quran/.next/static/chunks/41167-a32b6a9a9b2fbab1.js.map

{"version":3,"file":"static/chunks/41167-a32b6a9a9b2fbab1.js","mappings":"gGAEA,IAAIA,EAASC,OAAOC,UAAUC,eAC1BC,EAAQH,OAAOC,UAAUG,SACzBC,EAAiBL,OAAOK,eACxBC,EAAON,OAAOO,yBAEdC,EAAU,SAAiBC,GAC9B,MAA6B,oBAAlBC,MAAMF,QACTE,MAAMF,QAAQC,GAGK,mBAApBN,EAAMQ,KAAKF,IAGfG,EAAgB,SAAuBC,GAC1C,IAAKA,GAA2B,oBAApBV,EAAMQ,KAAKE,GACtB,OAAO,EAGR,IASIC,EATAC,EAAoBhB,EAAOY,KAAKE,EAAK,eACrCG,EAAmBH,EAAII,aAAeJ,EAAII,YAAYhB,WAAaF,EAAOY,KAAKE,EAAII,YAAYhB,UAAW,iBAE9G,GAAIY,EAAII,cAAgBF,IAAsBC,EAC7C,OAAO,EAMR,IAAKF,KAAOD,GAEZ,MAAsB,qBAARC,GAAuBf,EAAOY,KAAKE,EAAKC,IAInDI,EAAc,SAAqBC,EAAQC,GAC1Cf,GAAmC,cAAjBe,EAAQC,KAC7BhB,EAAec,EAAQC,EAAQC,KAAM,CACpCC,YAAY,EACZC,cAAc,EACdC,MAAOJ,EAAQK,SACfC,UAAU,IAGXP,EAAOC,EAAQC,MAAQD,EAAQK,UAK7BE,EAAc,SAAqBd,EAAKQ,GAC3C,GAAa,cAATA,EAAsB,CACzB,IAAKtB,EAAOY,KAAKE,EAAKQ,GACrB,OACM,GAAIf,EAGV,OAAOA,EAAKO,EAAKQ,GAAMG,MAIzB,OAAOX,EAAIQ,IAGZO,EAAOC,QAAU,SAASC,IACzB,IAAIV,EAASC,EAAMU,EAAKC,EAAMC,EAAaC,EACvCf,EAASgB,UAAU,GACnBC,EAAI,EACJC,EAASF,UAAUE,OACnBC,GAAO,EAaX,IAVsB,mBAAXnB,IACVmB,EAAOnB,EACPA,EAASgB,UAAU,IAAM,GAEzBC,EAAI,IAES,MAAVjB,GAAqC,kBAAXA,GAAyC,oBAAXA,KAC3DA,EAAS,IAGHiB,EAAIC,IAAUD,EAGpB,GAAe,OAFfhB,EAAUe,UAAUC,IAInB,IAAKf,KAAQD,EACZW,EAAMJ,EAAYR,EAAQE,GAItBF,KAHJa,EAAOL,EAAYP,EAASC,MAKvBiB,GAAQN,IAASpB,EAAcoB,KAAUC,EAAczB,EAAQwB,MAC9DC,GACHA,GAAc,EACdC,EAAQH,GAAOvB,EAAQuB,GAAOA,EAAM,IAEpCG,EAAQH,GAAOnB,EAAcmB,GAAOA,EAAM,GAI3Cb,EAAYC,EAAQ,CAAEE,KAAMA,EAAMI,SAAUK,EAAOQ,EAAMJ,EAAOF,MAGtC,qBAATA,GACjBd,EAAYC,EAAQ,CAAEE,KAAMA,EAAMI,SAAUO,KAQjD,OAAOb,I,kBCxGRS,EAAOC,QAJP,SAAsBU,GACpB,OAAOA,EAAOC,MAAM,M,kBCsBtBZ,EAAOC,QArBP,SAAmBY,EAAOC,EAAOC,GAC/B,IAAIC,GAAS,EACTP,EAASI,EAAMJ,OAEfK,EAAQ,IACVA,GAASA,EAAQL,EAAS,EAAKA,EAASK,IAE1CC,EAAMA,EAAMN,EAASA,EAASM,GACpB,IACRA,GAAON,GAETA,EAASK,EAAQC,EAAM,EAAMA,EAAMD,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIG,EAASnC,MAAM2B,KACVO,EAAQP,GACfQ,EAAOD,GAASH,EAAMG,EAAQF,GAEhC,OAAOG,I,sBC3BT,IAAIC,EAAY,EAAQ,OAiBxBlB,EAAOC,QANP,SAAmBY,EAAOC,EAAOC,GAC/B,IAAIN,EAASI,EAAMJ,OAEnB,OADAM,OAAcI,IAARJ,EAAoBN,EAASM,GAC1BD,GAASC,GAAON,EAAUI,EAAQK,EAAUL,EAAOC,EAAOC,K,sBCdrE,IAAIK,EAAY,EAAQ,OACpBC,EAAa,EAAQ,OACrBC,EAAgB,EAAQ,OACxB9C,EAAW,EAAQ,OA6BvBwB,EAAOC,QApBP,SAAyBsB,GACvB,OAAO,SAASZ,GACdA,EAASnC,EAASmC,GAElB,IAAIa,EAAaH,EAAWV,GACxBW,EAAcX,QACdQ,EAEAM,EAAMD,EACNA,EAAW,GACXb,EAAOe,OAAO,GAEdC,EAAWH,EACXJ,EAAUI,EAAY,GAAGI,KAAK,IAC9BjB,EAAOkB,MAAM,GAEjB,OAAOJ,EAAIF,KAAgBI,K,kBC3B/B,IAWIG,EAAeC,OAAO,uFAa1B/B,EAAOC,QAJP,SAAoBU,GAClB,OAAOmB,EAAaE,KAAKrB,K,sBCtB3B,IAAIsB,EAAe,EAAQ,OACvBZ,EAAa,EAAQ,OACrBa,EAAiB,EAAQ,OAe7BlC,EAAOC,QANP,SAAuBU,GACrB,OAAOU,EAAWV,GACduB,EAAevB,GACfsB,EAAatB,K,kBCbnB,IAQIwB,EAAW,oBACXC,EAAU,kDACVC,EAAS,2BAETC,EAAc,qBACdC,EAAa,kCACbC,EAAa,qCAIbC,EAPa,MAAQL,EAAU,IAAMC,EAAS,IAOtB,IACxBK,EAAW,oBAEXC,EAAQD,EAAWD,GADP,gBAAwB,CAACH,EAAaC,EAAYC,GAAYZ,KAAK,KAAO,IAAMc,EAAWD,EAAW,MAElHG,EAAW,MAAQ,CAACN,EAAcF,EAAU,IAAKA,EAASG,EAAYC,EAAYL,GAAUP,KAAK,KAAO,IAGxGiB,EAAYd,OAAOM,EAAS,MAAQA,EAAS,KAAOO,EAAWD,EAAO,KAa1E3C,EAAOC,QAJP,SAAwBU,GACtB,OAAOA,EAAOmC,MAAMD,IAAc,K,sBCpCpC,IAAIrE,EAAW,EAAQ,OACnBuE,EAAa,EAAQ,OAqBzB/C,EAAOC,QAJP,SAAoBU,GAClB,OAAOoC,EAAWvE,EAASmC,GAAQqC,iB,sBCnBrC,IAmBID,EAnBkB,EAAQ,MAmBbE,CAAgB,eAEjCjD,EAAOC,QAAU8C,G,w1BCTjB,MAAMG,EAAe,GAed,SAAS,EAAStD,EAAOJ,GAC9B,MAAM2D,EAAW3D,GAAW0D,EAQ5B,OAAOE,EAAIxD,EAN2B,mBAA7BuD,EAASE,iBACZF,EAASE,gBAGmB,mBAAzBF,EAASG,aAA4BH,EAASG,aAiBzD,SAASF,EAAIxD,EAAOyD,EAAiBC,GACnC,GAqDF,SAAc1D,GACZ,OAAO2D,QAAQ3D,GAA0B,kBAAVA,GAtD3B4D,CAAK5D,GAAQ,CACf,GAAI,UAAWA,EACb,MAAsB,SAAfA,EAAM6D,MAAoBH,EAAmB1D,EAAMA,MAAX,GAGjD,GAAIyD,GAAmB,QAASzD,GAASA,EAAM8D,IAC7C,OAAO9D,EAAM8D,IAGf,GAAI,aAAc9D,EAChB,OAAO,EAAIA,EAAM+D,SAAUN,EAAiBC,GAIhD,OAAIxE,MAAMF,QAAQgB,GACT,EAAIA,EAAOyD,EAAiBC,GAG9B,GAeT,SAAS,EAAIM,EAAQP,EAAiBC,GAEpC,MAAMrC,EAAS,GACf,IAAID,GAAS,EAEb,OAASA,EAAQ4C,EAAOnD,QACtBQ,EAAOD,GAASoC,EAAIQ,EAAO5C,GAAQqC,EAAiBC,GAGtD,OAAOrC,EAAOW,KAAK,ICxEd,SAASiC,EAAOC,EAAMhD,EAAOiD,EAAQC,GAC1C,MAAMjD,EAAM+C,EAAKrD,OACjB,IAEIwD,EAFAC,EAAa,EAajB,GAPEpD,EADEA,EAAQ,GACDA,EAAQC,EAAM,EAAIA,EAAMD,EAEzBA,EAAQC,EAAMA,EAAMD,EAE9BiD,EAASA,EAAS,EAAIA,EAAS,EAG3BC,EAAMvD,OAAS,IACjBwD,EAAanF,MAAMqF,KAAKH,GACxBC,EAAWG,QAAQtD,EAAOiD,GAE1BD,EAAKD,UAAUI,QAMf,IAHIF,GAAQD,EAAKD,OAAO/C,EAAOiD,GAGxBG,EAAaF,EAAMvD,QACxBwD,EAAaD,EAAMnC,MAAMqC,EAAYA,EAAa,KAClDD,EAAWG,QAAQtD,EAAO,GAE1BgD,EAAKD,UAAUI,GACfC,GAAc,IACdpD,GAAS,IAqBR,SAASuD,EAAKP,EAAME,GACzB,OAAIF,EAAKrD,OAAS,GAChBoD,EAAOC,EAAMA,EAAKrD,OAAQ,EAAGuD,GACtBF,GAEFE,EChEF,SAASM,EAAYC,GAE1B,MAAMC,EAAQ,GACd,IAEIC,EAEAC,EAEAC,EAEAC,EAEAX,EAEAY,EAEAC,EAdA9D,GAAS,EAeb,OAASA,EAAQuD,EAAO9D,QAAQ,CAC9B,KAAOO,KAASwD,GACdxD,EAAQwD,EAAMxD,GAMhB,GAJAyD,EAAQF,EAAOvD,GAKbA,GACkB,cAAlByD,EAAM,GAAGhB,MACqB,mBAA9Bc,EAAOvD,EAAQ,GAAG,GAAGyC,OAErBoB,EAAYJ,EAAM,GAAGM,WAAWR,OAChCI,EAAa,EAEXA,EAAaE,EAAUpE,QACW,oBAAlCoE,EAAUF,GAAY,GAAGlB,OAEzBkB,GAAc,GAGdA,EAAaE,EAAUpE,QACW,YAAlCoE,EAAUF,GAAY,GAAGlB,MAEzB,OAASkB,EAAaE,EAAUpE,QACQ,YAAlCoE,EAAUF,GAAY,GAAGlB,MAGS,cAAlCoB,EAAUF,GAAY,GAAGlB,OAC3BoB,EAAUF,GAAY,GAAGK,6BAA8B,EACvDL,KAOR,GAAiB,UAAbF,EAAM,GACJA,EAAM,GAAGQ,cACX7G,OAAO8G,OAAOV,EAAOW,EAAWZ,EAAQvD,IACxCA,EAAQwD,EAAMxD,GACd8D,GAAO,QAIN,GAAIL,EAAM,GAAGW,WAAY,CAG5B,IAFAT,EAAa3D,EACb0D,OAAYvD,EACLwD,MACLC,EAAaL,EAAOI,GAEK,eAAvBC,EAAW,GAAGnB,MACS,oBAAvBmB,EAAW,GAAGnB,OAEQ,UAAlBmB,EAAW,KACTF,IACFH,EAAOG,GAAW,GAAGjB,KAAO,mBAE9BmB,EAAW,GAAGnB,KAAO,aACrBiB,EAAYC,GAMdD,IAEFD,EAAM,GAAG1D,IAAM3C,OAAO8G,OAAO,GAAIX,EAAOG,GAAW,GAAG5D,OAGtDmD,EAAaM,EAAO1C,MAAM6C,EAAW1D,GACrCiD,EAAWG,QAAQK,GACnBZ,EAAOU,EAAQG,EAAW1D,EAAQ0D,EAAY,EAAGT,KAIvD,OAAQa,EAUV,SAASK,EAAWZ,EAAQc,GAC1B,MAAMC,EAAQf,EAAOc,GAAY,GAC3BE,EAAUhB,EAAOc,GAAY,GACnC,IAAIG,EAAgBH,EAAa,EAEjC,MAAMI,EAAiB,GACjBC,EACJJ,EAAMP,YAAcQ,EAAQI,OAAOL,EAAML,aAAaK,EAAMxE,OACxD8E,EAAcF,EAAUnB,OAExBC,EAAQ,GAERqB,EAAO,GAEb,IAAIC,EAEAC,EACA/E,GAAS,EAETgF,EAAUV,EACVW,EAAS,EACTnF,EAAQ,EACZ,MAAMoF,EAAS,CAACpF,GAIhB,KAAOkF,GAAS,CAEd,KAAOzB,IAASiB,GAAe,KAAOQ,IAGtCP,EAAepB,KAAKmB,GACfQ,EAAQjB,aACXe,EAASP,EAAQY,YAAYH,GACxBA,EAAQI,MACXN,EAAOzB,KAAK,MAEV0B,GACFL,EAAUW,WAAWL,EAAQlF,OAE3BkF,EAAQhB,8BACVU,EAAUY,oCAAqC,GAEjDZ,EAAUa,MAAMT,GACZE,EAAQhB,8BACVU,EAAUY,wCAAqCnF,IAKnD4E,EAAWC,EACXA,EAAUA,EAAQI,KAMpB,IADAJ,EAAUV,IACDtE,EAAQ4E,EAAYnF,QAGC,SAA1BmF,EAAY5E,GAAO,IACW,UAA9B4E,EAAY5E,EAAQ,GAAG,IACvB4E,EAAY5E,GAAO,GAAGyC,OAASmC,EAAY5E,EAAQ,GAAG,GAAGyC,MACzDmC,EAAY5E,GAAO,GAAGF,MAAM0F,OAASZ,EAAY5E,GAAO,GAAGD,IAAIyF,OAE/D1F,EAAQE,EAAQ,EAChBkF,EAAO7B,KAAKvD,GAEZkF,EAAQjB,gBAAa5D,EACrB6E,EAAQD,cAAW5E,EACnB6E,EAAUA,EAAQI,MAqBtB,IAhBAV,EAAUnB,OAAS,GAKfyB,GAEFA,EAAQjB,gBAAa5D,EACrB6E,EAAQD,cAAW5E,GAEnB+E,EAAOO,MAKTzF,EAAQkF,EAAOzF,OACRO,KAAS,CACd,MAAMa,EAAQ+D,EAAY/D,MAAMqE,EAAOlF,GAAQkF,EAAOlF,EAAQ,IACxDF,EAAQ2E,EAAegB,MAC7BjC,EAAMJ,QAAQ,CAACtD,EAAOA,EAAQe,EAAMpB,OAAS,IAC7CoD,EAAOU,EAAQzD,EAAO,EAAGe,GAG3B,IADAb,GAAS,IACAA,EAAQwD,EAAM/D,QACrBoF,EAAKI,EAASzB,EAAMxD,GAAO,IAAMiF,EAASzB,EAAMxD,GAAO,GACvDiF,GAAUzB,EAAMxD,GAAO,GAAKwD,EAAMxD,GAAO,GAAK,EAEhD,OAAO6E,ECrNT,MAAM,EAAiB,GAAGvH,eA+B1B,SAASoI,EAAgBC,EAAKC,GAE5B,IAAIC,EAEJ,IAAKA,KAAQD,EAAW,CACtB,MAEME,GAFQ,EAAe/H,KAAK4H,EAAKE,GAAQF,EAAIE,QAAQ1F,KAEpCwF,EAAIE,GAAQ,IAE7BE,EAAQH,EAAUC,GAExB,IAAIG,EAEJ,GAAID,EACF,IAAKC,KAAQD,EAAO,CACb,EAAehI,KAAK+H,EAAME,KAAOF,EAAKE,GAAQ,IACnD,MAAMpH,EAAQmH,EAAMC,GACpBC,EAEEH,EAAKE,GACLlI,MAAMF,QAAQgB,GAASA,EAAQA,EAAQ,CAACA,GAAS,MAe3D,SAASqH,EAAWC,EAAUpD,GAC5B,IAAI9C,GAAS,EAEb,MAAMmG,EAAS,GAEf,OAASnG,EAAQ8C,EAAKrD,SAEE,UAApBqD,EAAK9C,GAAOoG,IAAkBF,EAAWC,GAAQ9C,KAAKP,EAAK9C,IAG/D6C,EAAOqD,EAAU,EAAG,EAAGC,GChElB,MAAME,EAAaC,EAAW,YAcxBC,EAAoBD,EAAW,cAuB/BE,EAAaF,EAAW,uBAa9B,SAASG,EAAaT,GAC3B,OAGW,OAATA,IAAkBA,EAAO,IAAe,MAATA,GAe5B,MAAMU,EAAaJ,EAAW,MAoBxBK,EAAgBL,EAAW,cAe3BM,EAAmBN,EAAW,kBAiBpC,SAASO,EAAmBb,GACjC,OAAgB,OAATA,GAAiBA,GAAQ,EAY3B,SAASc,EAA0Bd,GACxC,OAAgB,OAATA,IAAkBA,EAAO,GAAc,KAATA,GAkBhC,SAASe,EAAcf,GAC5B,OAAiB,IAAVA,IAAyB,IAAVA,GAAwB,KAATA,EAwBhC,MAAMgB,EAAqBV,EAAW,gBAsBhCW,EAAoBX,EAAW,MAQ5C,SAASA,EAAWY,GAClB,OAUA,SAAelB,GACb,OAAgB,OAATA,GAAiBA,GAAQ,GAAKkB,EAAMlG,KAAKmG,OAAOC,aAAapB,KCvMjE,SAASqB,EAAaC,EAASC,EAAI9E,EAAM+E,GAC9C,MAAMC,EAAQD,EAAMA,EAAM,EAAIE,OAAOC,kBACrC,IAAIC,EAAO,EACX,OAGA,SAAe5B,GACb,GAAIe,EAAcf,GAEhB,OADAsB,EAAQO,MAAMpF,GACPqF,EAAO9B,GAEhB,OAAOuB,EAAGvB,IAIZ,SAAS8B,EAAO9B,GACd,OAAIe,EAAcf,IAAS4B,IAASH,GAClCH,EAAQS,QAAQ/B,GACT8B,IAETR,EAAQU,KAAKvF,GACN8E,EAAGvB,KCpDP,MAAMiC,EAAU,CACrBC,SAOF,SAA2BZ,GACzB,MAAMa,EAAeb,EAAQc,QAC3BC,KAAK1D,OAAOsB,WAAWqC,gBASzB,SAAoCtC,GAClC,GAAa,OAATA,EAEF,YADAsB,EAAQS,QAAQ/B,GAMlB,OAHAsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNX,EAAaC,EAASa,EAAc,iBAI7C,SAA0BnC,GAExB,OADAsB,EAAQO,MAAM,aACPU,EAAUvC,MAlBnB,IAAIjB,EACJ,OAAOoD,EAqBP,SAASI,EAAUvC,GACjB,MAAM1B,EAAQgD,EAAQO,MAAM,YAAa,CACvC5D,YAAa,OACbc,aAMF,OAJIA,IACFA,EAASK,KAAOd,GAElBS,EAAWT,EACJkE,EAAKxC,GAId,SAASwC,EAAKxC,GACZ,OAAa,OAATA,GACFsB,EAAQU,KAAK,aACbV,EAAQU,KAAK,kBACbV,EAAQS,QAAQ/B,IAGda,EAAmBb,IACrBsB,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,aACNO,IAITjB,EAAQS,QAAQ/B,GACTwC,MCxDJ,MAAM,EAAW,CACtBN,SAYF,SAA4BZ,GAC1B,MAAMmB,EAAOJ,KAEPK,EAAQ,GACd,IAEIC,EAEAC,EAEAC,EANAC,EAAY,EAOhB,OAAOhJ,EAGP,SAASA,EAAMkG,GAWb,GAAI8C,EAAYJ,EAAMjJ,OAAQ,CAC5B,MAAMsJ,EAAOL,EAAMI,GAEnB,OADAL,EAAKO,eAAiBD,EAAK,GACpBzB,EAAQc,QACbW,EAAK,GAAGE,aACRC,EACAC,EAHK7B,CAILtB,GAIJ,OAAOmD,EAAmBnD,GAI5B,SAASkD,EAAiBlD,GAMxB,GALA8C,IAKIL,EAAKO,eAAeI,WAAY,CAClCX,EAAKO,eAAeI,gBAAajJ,EAC7BwI,GACFU,IAKF,MAAMC,EAAmBb,EAAKlF,OAAO9D,OACrC,IAEI8J,EAFAC,EAAkBF,EAKtB,KAAOE,KACL,GACsC,SAApCf,EAAKlF,OAAOiG,GAAiB,IACY,cAAzCf,EAAKlF,OAAOiG,GAAiB,GAAG/G,KAChC,CACA8G,EAAQd,EAAKlF,OAAOiG,GAAiB,GAAGzJ,IACxC,MAGJ0J,EAAeX,GAGf,IAAI9I,EAAQsJ,EACZ,KAAOtJ,EAAQyI,EAAKlF,OAAO9D,QACzBgJ,EAAKlF,OAAOvD,GAAO,GAAGD,IAAM3C,OAAO8G,OAAO,GAAIqF,GAC9CvJ,IAaF,OATA6C,EACE4F,EAAKlF,OACLiG,EAAkB,EAClB,EACAf,EAAKlF,OAAO1C,MAAMyI,IAIpBb,EAAKlF,OAAO9D,OAASO,EACdmJ,EAAmBnD,GAE5B,OAAOlG,EAAMkG,GAIf,SAASmD,EAAmBnD,GAM1B,GAAI8C,IAAcJ,EAAMjJ,OAAQ,CAI9B,IAAKkJ,EACH,OAAOe,EAAkB1D,GAM3B,GAAI2C,EAAUgB,kBAAoBhB,EAAUgB,iBAAiBC,SAC3D,OAAOC,EAAU7D,GAQnByC,EAAKqB,UAAYvH,QACfoG,EAAUgB,mBAAqBhB,EAAUoB,+BAM7C,OADAtB,EAAKO,eAAiB,GACf1B,EAAQ0C,MACbC,EACAC,EACAC,EAHK7C,CAILtB,GAIJ,SAASkE,EAAqBlE,GAG5B,OAFI2C,GAAWU,IACfI,EAAeX,GACRY,EAAkB1D,GAI3B,SAASmE,EAAsBnE,GAG7B,OAFAyC,EAAK9D,OAAOyF,KAAK3B,EAAK4B,MAAM7E,MAAQsD,IAAcJ,EAAMjJ,OACxDoJ,EAAkBJ,EAAK4B,MAAMC,OACtBT,EAAU7D,GAInB,SAAS0D,EAAkB1D,GAGzB,OADAyC,EAAKO,eAAiB,GACf1B,EAAQc,QACb6B,EACAM,EACAV,EAHKvC,CAILtB,GAIJ,SAASuE,EAAkBvE,GAIzB,OAHA8C,IACAJ,EAAMrF,KAAK,CAACoF,EAAKkB,iBAAkBlB,EAAKO,iBAEjCU,EAAkB1D,GAI3B,SAAS6D,EAAU7D,GACjB,OAAa,OAATA,GACE2C,GAAWU,IACfI,EAAe,QACfnC,EAAQS,QAAQ/B,KAGlB2C,EAAYA,GAAaF,EAAK9D,OAAO6F,KAAK/B,EAAK4B,OAC/C/C,EAAQO,MAAM,YAAa,CACzB5D,YAAa,OACbc,SAAU6D,EACV7E,WAAY4E,IAEP8B,EAAazE,IAItB,SAASyE,EAAazE,GACpB,OAAa,OAATA,GACF0E,EAAapD,EAAQU,KAAK,cAAc,GACxCyB,EAAe,QACfnC,EAAQS,QAAQ/B,IAGda,EAAmBb,IACrBsB,EAAQS,QAAQ/B,GAChB0E,EAAapD,EAAQU,KAAK,cAE1Bc,EAAY,EACZL,EAAKqB,eAAY3J,EACVL,IAETwH,EAAQS,QAAQ/B,GACTyE,GAQT,SAASC,EAAapG,EAAOqG,GAC3B,MAAM7F,EAAS2D,EAAKtD,YAAYb,GAyChC,GAxCIqG,GAAK7F,EAAOzB,KAAK,MACrBiB,EAAMS,SAAW6D,EACbA,IAAYA,EAAWxD,KAAOd,GAClCsE,EAAatE,EACbqE,EAAUtD,WAAWf,EAAMxE,OAC3B6I,EAAUpD,MAAMT,GAmCZ2D,EAAK9D,OAAOyF,KAAK9F,EAAMxE,MAAM0F,MAAO,CACtC,IAAIxF,EAAQ2I,EAAUpF,OAAO9D,OAC7B,KAAOO,KACL,GAEE2I,EAAUpF,OAAOvD,GAAO,GAAGF,MAAMwK,OAASzB,KAExCF,EAAUpF,OAAOvD,GAAO,GAAGD,KAE3B4I,EAAUpF,OAAOvD,GAAO,GAAGD,IAAIuK,OAASzB,GAI1C,OAMJ,MAAMS,EAAmBb,EAAKlF,OAAO9D,OACrC,IAEImL,EAEArB,EAJAC,EAAkBF,EAOtB,KAAOE,KACL,GACsC,SAApCf,EAAKlF,OAAOiG,GAAiB,IACY,cAAzCf,EAAKlF,OAAOiG,GAAiB,GAAG/G,KAChC,CACA,GAAImI,EAAM,CACRrB,EAAQd,EAAKlF,OAAOiG,GAAiB,GAAGzJ,IACxC,MAEF6K,GAAO,EAOX,IAJAnB,EAAeX,GAGf9I,EAAQsJ,EACDtJ,EAAQyI,EAAKlF,OAAO9D,QACzBgJ,EAAKlF,OAAOvD,GAAO,GAAGD,IAAM3C,OAAO8G,OAAO,GAAIqF,GAC9CvJ,IAIF6C,EACE4F,EAAKlF,OACLiG,EAAkB,EAClB,EACAf,EAAKlF,OAAO1C,MAAMyI,IAIpBb,EAAKlF,OAAO9D,OAASO,GAQzB,SAASyJ,EAAe7B,GACtB,IAAI5H,EAAQ0I,EAAMjJ,OAGlB,KAAOO,KAAU4H,GAAM,CACrB,MAAMiD,EAAQnC,EAAM1I,GACpByI,EAAKO,eAAiB6B,EAAM,GAC5BA,EAAM,GAAG7C,KAAKjK,KAAK0K,EAAMnB,GAE3BoB,EAAMjJ,OAASmI,EAEjB,SAASyB,IACPV,EAAUpD,MAAM,CAAC,OACjBqD,OAAazI,EACbwI,OAAYxI,EACZsI,EAAKO,eAAeI,gBAAajJ,KAnV/B8J,EAAqB,CACzB/B,SA0VF,SAA2BZ,EAASC,EAAIuD,GAGtC,OAAOzD,EACLC,EACAA,EAAQc,QAAQC,KAAK1D,OAAOsB,WAAW8E,SAAUxD,EAAIuD,GACrD,aACAzC,KAAK1D,OAAOsB,WAAW+E,QAAQC,KAAKC,SAAS,qBAAkB/K,EAAY,KCjXxE,MAAMgL,EAAY,CACvBjD,SAQF,SAA2BZ,EAASC,EAAIuD,GACtC,OAgBA,SAAe9E,GACb,OAAOe,EAAcf,GACjBqB,EAAaC,EAAS8D,EAAO,aAA7B/D,CAA2CrB,GAC3CoF,EAAMpF,IAiBZ,SAASoF,EAAMpF,GACb,OAAgB,OAATA,GAAiBa,EAAmBb,GAAQuB,EAAGvB,GAAQ8E,EAAI9E,KA7CpEqF,SAAS,GCIJ,MAAM,EAAU,CACrBnD,SAyBF,SAAyBZ,EAASC,GAEhC,IAAIxC,EACJ,OAYA,SAAoBiB,GAKlB,OAJAsB,EAAQO,MAAM,WACd9C,EAAWuC,EAAQO,MAAM,eAAgB,CACvC5D,YAAa,YAERqH,EAAYtF,IAarB,SAASsF,EAAYtF,GACnB,OAAa,OAATA,EACKuF,EAAWvF,GAKhBa,EAAmBb,GACdsB,EAAQ0C,MACbwB,EACAC,EACAF,EAHKjE,CAILtB,IAIJsB,EAAQS,QAAQ/B,GACTsF,GAQT,SAASC,EAAWvF,GAGlB,OAFAsB,EAAQU,KAAK,gBACbV,EAAQU,KAAK,WACNT,EAAGvB,GAQZ,SAASyF,EAAgBzF,GAQvB,OAPAsB,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,gBACbjD,EAASK,KAAOkC,EAAQO,MAAM,eAAgB,CAC5C5D,YAAa,UACbc,aAEFA,EAAWA,EAASK,KACbkG,IArGTI,QAeF,SAAwBnI,GAEtB,OADAD,EAAYC,GACLA,IAbHiI,EAAwB,CAC5BtD,SAwGF,SAA8BZ,EAASC,EAAIuD,GACzC,MAAMrC,EAAOJ,KACb,OAOA,SAAwBrC,GAKtB,OAJAsB,EAAQU,KAAK,gBACbV,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNX,EAAaC,EAASqE,EAAU,eAQzC,SAASA,EAAS3F,GAChB,GAAa,OAATA,GAAiBa,EAAmBb,GACtC,OAAO8E,EAAI9E,GAKb,MAAM4F,EAAOnD,EAAKlF,OAAOkF,EAAKlF,OAAO9D,OAAS,GAC9C,OACGgJ,EAAK9D,OAAOsB,WAAW+E,QAAQC,KAAKC,SAAS,iBAC9CU,GACiB,eAAjBA,EAAK,GAAGnJ,MACRmJ,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMnM,QAAU,EAEzC8H,EAAGvB,GAELsB,EAAQwC,UAAUrB,EAAK9D,OAAOsB,WAAWuE,KAAMM,EAAKvD,EAApDD,CAAwDtB,KA7IjEqF,SAAS,GCbJ,MAAMb,EAAO,CAClBtC,SAOF,SAAwBZ,GACtB,MAAMmB,EAAOJ,KACPyD,EAAUxE,EAAQc,QAEtB+C,GAoBF,SAAuBnF,GACrB,GAAa,OAATA,EAEF,YADAsB,EAAQS,QAAQ/B,GAOlB,OAJAsB,EAAQO,MAAM,mBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,mBACbS,EAAKkB,sBAAmBxJ,EACjB2L,IA1BPxE,EAAQc,QACNC,KAAK1D,OAAOsB,WAAW8F,YACvBC,EACA3E,EACEC,EACAA,EAAQc,QACNC,KAAK1D,OAAOsB,WAAWuE,KACvBwB,EACA1E,EAAQc,QAAQ,EAAS4D,IAE3B,gBAIN,OAAOF,EAgBP,SAASE,EAAehG,GACtB,GAAa,OAATA,EAQJ,OAJAsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACbS,EAAKkB,sBAAmBxJ,EACjB2L,EAPLxE,EAAQS,QAAQ/B,MCjDf,MAAMiG,EAAW,CACtBC,WAAYC,KAEDxM,EAASyM,EAAkB,UAC3B,EAAOA,EAAkB,QAMtC,SAASA,EAAkBC,GACzB,MAAO,CACLnE,SAUF,SAAwBZ,GACtB,MAAMmB,EAAOJ,KACPpC,EAAaoC,KAAK1D,OAAOsB,WAAWoG,GACpCC,EAAOhF,EAAQc,QAAQnC,EAAYnG,EAAOyM,GAChD,OAAOzM,EAGP,SAASA,EAAMkG,GACb,OAAOwG,EAAQxG,GAAQsG,EAAKtG,GAAQuG,EAAQvG,GAI9C,SAASuG,EAAQvG,GACf,GAAa,OAATA,EAMJ,OAFAsB,EAAQO,MAAM,QACdP,EAAQS,QAAQ/B,GACTwC,EALLlB,EAAQS,QAAQ/B,GASpB,SAASwC,EAAKxC,GACZ,OAAIwG,EAAQxG,IACVsB,EAAQU,KAAK,QACNsE,EAAKtG,KAIdsB,EAAQS,QAAQ/B,GACTwC,GAOT,SAASgE,EAAQxG,GACf,GAAa,OAATA,EACF,OAAO,EAET,MAAMlD,EAAOmD,EAAWD,GACxB,IAAIhG,GAAS,EACb,GAAI8C,EAGF,OAAS9C,EAAQ8C,EAAKrD,QAAQ,CAC5B,MAAMsJ,EAAOjG,EAAK9C,GAClB,IAAK+I,EAAKhE,UAAYgE,EAAKhE,SAAShH,KAAK0K,EAAMA,EAAK1D,UAClD,OAAO,EAIb,OAAO,IA/DTmH,WAAYC,EACA,SAAVE,EAAmBI,OAAyBtM,IAuElD,SAASgM,EAAeO,GACtB,OAGA,SAAwBnJ,EAAQgB,GAC9B,IAEIsD,EAFA7H,GAAS,EAMb,OAASA,GAASuD,EAAO9D,aACTU,IAAV0H,EACEtE,EAAOvD,IAAoC,SAA1BuD,EAAOvD,GAAO,GAAGyC,OACpCoF,EAAQ7H,EACRA,KAEQuD,EAAOvD,IAAoC,SAA1BuD,EAAOvD,GAAO,GAAGyC,OAExCzC,IAAU6H,EAAQ,IACpBtE,EAAOsE,GAAO,GAAG9H,IAAMwD,EAAOvD,EAAQ,GAAG,GAAGD,IAC5CwD,EAAOV,OAAOgF,EAAQ,EAAG7H,EAAQ6H,EAAQ,GACzC7H,EAAQ6H,EAAQ,GAElBA,OAAQ1H,GAGZ,OAAOuM,EAAgBA,EAAcnJ,EAAQgB,GAAWhB,GAe5D,SAASkJ,EAAuBlJ,EAAQgB,GACtC,IAAIF,EAAa,EAEjB,OAASA,GAAcd,EAAO9D,QAC5B,IACG4E,IAAed,EAAO9D,QACU,eAA/B8D,EAAOc,GAAY,GAAG5B,OACW,SAAnCc,EAAOc,EAAa,GAAG,GAAG5B,KAC1B,CACA,MAAM+F,EAAOjF,EAAOc,EAAa,GAAG,GAC9BsI,EAASpI,EAAQY,YAAYqD,GACnC,IAIIoE,EAJA5M,EAAQ2M,EAAOlN,OACfoN,GAAe,EACfjF,EAAO,EAGX,KAAO5H,KAAS,CACd,MAAM8M,EAAQH,EAAO3M,GACrB,GAAqB,kBAAV8M,EAAoB,CAE7B,IADAD,EAAcC,EAAMrN,OACyB,KAAtCqN,EAAMC,WAAWF,EAAc,IACpCjF,IACAiF,IAEF,GAAIA,EAAa,MACjBA,GAAe,OAGZ,IAAe,IAAXC,EACPF,GAAO,EACPhF,SACK,IAAe,IAAXkF,EAEJ,CAEL9M,IACA,OAGJ,GAAI4H,EAAM,CACR,MAAMtD,EAAQ,CACZ7B,KACE4B,IAAed,EAAO9D,QAAUmN,GAAQhF,EAAO,EAC3C,aACA,oBACN9H,MAAO,CACL0F,KAAMgD,EAAKzI,IAAIyF,KACfwH,OAAQxE,EAAKzI,IAAIiN,OAASpF,EAC1B0C,OAAQ9B,EAAKzI,IAAIuK,OAAS1C,EAC1BqF,OAAQzE,EAAK1I,MAAMmN,OAASjN,EAC5BkN,aAAclN,EACV6M,EACArE,EAAK1I,MAAMoN,aAAeL,GAEhC9M,IAAK3C,OAAO8G,OAAO,GAAIsE,EAAKzI,MAE9ByI,EAAKzI,IAAM3C,OAAO8G,OAAO,GAAII,EAAMxE,OAC/B0I,EAAK1I,MAAMwK,SAAW9B,EAAKzI,IAAIuK,OACjClN,OAAO8G,OAAOsE,EAAMlE,IAEpBf,EAAOV,OACLwB,EACA,EACA,CAAC,QAASC,EAAOC,GACjB,CAAC,OAAQD,EAAOC,IAElBF,GAAc,GAGlBA,IAGJ,OAAOd,EC9LF,SAAS2I,EAAWjG,EAAY1C,EAAQgB,GAE7C,MAAM4I,EAAS,GACf,IAAInN,GAAS,EAEb,OAASA,EAAQiG,EAAWxG,QAAQ,CAClC,MAAMiM,EAAUzF,EAAWjG,GAAOkM,WAE9BR,IAAYyB,EAAOjC,SAASQ,KAC9BnI,EAASmI,EAAQnI,EAAQgB,GACzB4I,EAAO9J,KAAKqI,IAIhB,OAAOnI,ECeF,SAAS6J,EAAgBzI,EAAQ0I,EAAYlK,GAElD,IAAIoG,EAAQnM,OAAO8G,OACjBf,EACI/F,OAAO8G,OAAO,GAAIf,GAClB,CACEqC,KAAM,EACNwH,OAAQ,EACR1C,OAAQ,GAEd,CACE2C,OAAQ,EACRC,cAAe,IAInB,MAAMI,EAAc,GAEdC,EAAuB,GAE7B,IAAIZ,EAAS,GAETjE,EAAQ,GAER8E,GAAW,EAOf,MAAMlG,EAAU,CACdS,QAkJF,SAAiB/B,GACXa,EAAmBb,IACrBuD,EAAM/D,OACN+D,EAAMyD,OAAS,EACfzD,EAAMe,SAAoB,IAAVtE,EAAc,EAAI,EAClCyH,MACmB,IAAVzH,IACTuD,EAAMyD,SACNzD,EAAMe,UAIJf,EAAM2D,aAAe,EACvB3D,EAAM0D,UAEN1D,EAAM2D,eAKF3D,EAAM2D,eAAiBP,EAAOpD,EAAM0D,QAAQxN,SAC9C8J,EAAM2D,cAAgB,EACtB3D,EAAM0D,WAKV1I,EAAQQ,SAAWiB,EAGnBwH,GAAW,GA/KX3F,MAmLF,SAAepF,EAAMiL,GAGnB,MAAMpJ,EAAQoJ,GAAU,GAKxB,OAJApJ,EAAM7B,KAAOA,EACb6B,EAAMxE,MAAQuK,IACd9F,EAAQhB,OAAOF,KAAK,CAAC,QAASiB,EAAOC,IACrCmE,EAAMrF,KAAKiB,GACJA,GA1LP0D,KA8LF,SAAcvF,GACZ,MAAM6B,EAAQoE,EAAMjD,MAGpB,OAFAnB,EAAMvE,IAAMsK,IACZ9F,EAAQhB,OAAOF,KAAK,CAAC,OAAQiB,EAAOC,IAC7BD,GAjMP8D,QAASuF,GAyMX,SAA+BC,EAAWC,GACxCC,EAAUF,EAAWC,EAAK1K,SAzM1B6G,MAAO2D,EAAiBI,GACxBjE,UAAW6D,EAAiBI,EAAmB,CAC7CjE,WAAW,KASTvF,EAAU,CACdQ,SAAU,KACViB,KAAM,KACNgD,eAAgB,GAChBzF,OAAQ,GACRoB,SACAQ,cACA0G,eA6CF,SAAwBvH,EAAO0J,GAC7B,OAsYJ,SAAyBrB,EAAQqB,GAC/B,IAAIhO,GAAS,EAEb,MAAMC,EAAS,GAEf,IAAIgO,EACJ,OAASjO,EAAQ2M,EAAOlN,QAAQ,CAC9B,MAAMqN,EAAQH,EAAO3M,GAErB,IAAIpB,EACJ,GAAqB,kBAAVkO,EACTlO,EAAQkO,OAER,OAAQA,GACN,KAAM,EACJlO,EAAQ,KACR,MAEF,KAAM,EACJA,EAAQ,KACR,MAEF,KAAM,EACJA,EAAQ,OACR,MAEF,KAAM,EACJA,EAAQoP,EAAa,IAAM,KAC3B,MAEF,KAAM,EACJ,IAAKA,GAAcC,EAAO,SAC1BrP,EAAQ,IACR,MAEF,QAEEA,EAAQuI,OAAOC,aAAa0F,GAGlCmB,GAAmB,IAAXnB,EACR7M,EAAOoD,KAAKzE,GAEd,OAAOqB,EAAOW,KAAK,IAjbVsN,CAAgB/I,EAAYb,GAAQ0J,IA7C3C3D,MACAhF,WAkEF,SAAoBzG,GAClB0O,EAAY1O,EAAM4G,MAAQ5G,EAAMoO,OAChCS,KAnEAlI,MAsBF,SAAe1E,GAKb,GAJA8L,EAAStJ,EAAKsJ,EAAQ9L,GACtBsN,IAGkC,OAA9BxB,EAAOA,EAAOlN,OAAS,GACzB,MAAO,GAMT,OAJAqO,EAAUT,EAAY,GAGtB9I,EAAQhB,OAAS2I,EAAWqB,EAAsBhJ,EAAQhB,OAAQgB,GAC3DA,EAAQhB,SA1BjB,IAOI6K,EAPAC,EAAQhB,EAAWnF,SAASnK,KAAKwG,EAAS+C,GAW9C,OAHI+F,EAAWnB,YACbqB,EAAqBlK,KAAKgK,GAErB9I,EA4BP,SAASY,EAAYb,GACnB,OA8VJ,SAAqBqI,EAAQrI,GAC3B,MAAMgK,EAAahK,EAAMxE,MAAMmN,OACzBsB,EAAmBjK,EAAMxE,MAAMoN,aAC/BsB,EAAWlK,EAAMvE,IAAIkN,OACrBwB,EAAiBnK,EAAMvE,IAAImN,aAEjC,IAAIwB,EACJ,GAAIJ,IAAeE,EAEjBE,EAAO,CAAC/B,EAAO2B,GAAYzN,MAAM0N,EAAkBE,QAC9C,CAEL,GADAC,EAAO/B,EAAO9L,MAAMyN,EAAYE,GAC5BD,GAAoB,EAAG,CACzB,MAAMI,EAAOD,EAAK,GACE,kBAATC,EACTD,EAAK,GAAKC,EAAK9N,MAAM0N,GAErBG,EAAKE,QAGLH,EAAiB,GAEnBC,EAAKrL,KAAKsJ,EAAO6B,GAAU3N,MAAM,EAAG4N,IAGxC,OAAOC,EAvXEG,CAAYlC,EAAQrI,GAI7B,SAAS+F,IAEP,MAAM,KAAC7E,EAAI,OAAEwH,EAAM,OAAE1C,EAAM,OAAE2C,EAAM,aAAEC,GAAgB3D,EACrD,MAAO,CACL/D,OACAwH,SACA1C,SACA2C,SACAC,gBAwBJ,SAASiB,IAEP,IAAIW,EACJ,KAAOvF,EAAM0D,OAASN,EAAOlN,QAAQ,CACnC,MAAMqN,EAAQH,EAAOpD,EAAM0D,QAG3B,GAAqB,kBAAVH,EAKT,IAJAgC,EAAavF,EAAM0D,OACf1D,EAAM2D,aAAe,IACvB3D,EAAM2D,aAAe,GAGrB3D,EAAM0D,SAAW6B,GACjBvF,EAAM2D,aAAeJ,EAAMrN,QAE3BsP,EAAGjC,EAAMC,WAAWxD,EAAM2D,oBAG5B6B,EAAGjC,IAWT,SAASiC,EAAG/I,GACVwH,OAAWrN,EACXiO,EAAepI,EACfqI,EAAQA,EAAMrI,GAuEhB,SAAS+H,EAAkBiB,EAAGnB,GAC5BA,EAAKoB,UASP,SAAStB,EAAiBuB,EAAUxB,GAClC,OAWA,SAAczH,EAAYkJ,EAAaC,GAErC,IAAIC,EAEAC,EAEA3F,EAEAkE,EACJ,OAAO/P,MAAMF,QAAQqI,GACjBsJ,EAAuBtJ,GACvB,aAAcA,EAEdsJ,EAAuB,CAACtJ,IAS5B,SAA+BuJ,GAC7B,OAAO1P,EAGP,SAASA,EAAMkG,GACb,MAAMyJ,EAAe,OAATzJ,GAAiBwJ,EAAIxJ,GAC3BL,EAAe,OAATK,GAAiBwJ,EAAIvE,KAOjC,OAAOsE,EANM,IAGPzR,MAAMF,QAAQ6R,GAAOA,EAAMA,EAAM,CAACA,GAAO,MACzC3R,MAAMF,QAAQ+H,GAAOA,EAAMA,EAAM,CAACA,GAAO,IAExC4J,CAA6BvJ,IArBpC0J,CAAsBzJ,GA+B1B,SAASsJ,EAAuBzM,GAG9B,OAFAuM,EAAmBvM,EACnBwM,EAAiB,EACG,IAAhBxM,EAAKrD,OACA2P,EAEFO,EAAgB7M,EAAKwM,IAS9B,SAASK,EAAgB/B,GACvB,OAGA,SAAe5H,GAKb6H,EAwER,WACE,MAAM+B,EAAavF,IACbwF,EAAgBtL,EAAQQ,SACxB+K,EAAwBvL,EAAQoF,iBAChCoG,EAAmBxL,EAAQhB,OAAO9D,OAClCuQ,EAAalS,MAAMqF,KAAKuF,GAC9B,MAAO,CACLuG,UACA9L,KAAM4M,GAQR,SAASd,IACP1F,EAAQqG,EACRrL,EAAQQ,SAAW8K,EACnBtL,EAAQoF,iBAAmBmG,EAC3BvL,EAAQhB,OAAO9D,OAASsQ,EACxBrH,EAAQsH,EACRvC,KA9FWwC,GACPtG,EAAmBiE,EACdA,EAAUvC,UACb9G,EAAQoF,iBAAmBiE,GAK7B,GACEA,EAAUnP,MACV8F,EAAQI,OAAOsB,WAAW+E,QAAQC,KAAKC,SAAS0C,EAAUnP,MAE1D,OAAOqM,EAAI9E,GAEb,OAAO4H,EAAU1F,SAASnK,KAIxB2P,EAAStQ,OAAO8G,OAAO9G,OAAO8S,OAAO3L,GAAUmJ,GAAUnJ,EACzD+C,EACAC,EACAuD,EAPK8C,CAQL5H,IAKN,SAASuB,EAAGvB,GAGV,OAFAwH,GAAW,EACX0B,EAASvF,EAAkBkE,GACpBsB,EAIT,SAASrE,EAAI9E,GAGX,OAFAwH,GAAW,EACXK,EAAKoB,YACCK,EAAiBD,EAAiB5P,OAC/BkQ,EAAgBN,EAAiBC,IAEnCF,IAUb,SAAStB,EAAUF,EAAWzK,GACxByK,EAAU1B,aAAeqB,EAAqBrC,SAAS0C,IACzDL,EAAqBlK,KAAKuK,GAExBA,EAAUlC,SACZ7I,EACE0B,EAAQhB,OACRJ,EACAoB,EAAQhB,OAAO9D,OAAS0D,EACxByK,EAAUlC,QAAQnH,EAAQhB,OAAO1C,MAAMsC,GAAOoB,IAG9CqJ,EAAUuC,YACZ5L,EAAQhB,OAASqK,EAAUuC,UAAU5L,EAAQhB,OAAQgB,IAyCzD,SAASkJ,IACHlE,EAAM/D,QAAQ8H,GAAe/D,EAAMyD,OAAS,IAC9CzD,EAAMyD,OAASM,EAAY/D,EAAM/D,MACjC+D,EAAMe,QAAUgD,EAAY/D,EAAM/D,MAAQ,IC/dzC,MAAM4K,EAAgB,CAC3B3R,KAAM,gBACNyJ,SAOF,SAA+BZ,EAASC,EAAIuD,GAC1C,IAEIuF,EAFAzI,EAAO,EAGX,OAYA,SAAe5B,GAGb,OAFAsB,EAAQO,MAAM,iBAehB,SAAgB7B,GAEd,OADAqK,EAASrK,EACFwG,EAAQxG,GAfRG,CAAOH,IA4BhB,SAASwG,EAAQxG,GACf,OAAIA,IAASqK,GACX/I,EAAQO,MAAM,yBACPyI,EAAStK,IAEd4B,GAAQ,IAAe,OAAT5B,GAAiBa,EAAmBb,KACpDsB,EAAQU,KAAK,iBACNT,EAAGvB,IAEL8E,EAAI9E,GAab,SAASsK,EAAStK,GAChB,OAAIA,IAASqK,GACX/I,EAAQS,QAAQ/B,GAChB4B,IACO0I,IAEThJ,EAAQU,KAAK,yBACNjB,EAAcf,GACjBqB,EAAaC,EAASkF,EAAS,aAA/BnF,CAA6CrB,GAC7CwG,EAAQxG,OClFT,MAAMlD,EAAO,CAClBrE,KAAM,OACNyJ,SA0BF,SAA2BZ,EAASC,EAAIuD,GACtC,MAAMrC,EAAOJ,KACPuD,EAAOnD,EAAKlF,OAAOkF,EAAKlF,OAAO9D,OAAS,GAC9C,IAAI8Q,EACF3E,GAAyB,eAAjBA,EAAK,GAAGnJ,KACZmJ,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMnM,OACtC,EACFmI,EAAO,EACX,OAGA,SAAe5B,GACb,MAAMwK,EACJ/H,EAAKO,eAAevG,OACV,KAATuD,GAAwB,KAATA,GAAwB,KAATA,EAC3B,gBACA,eACN,GACW,kBAATwK,GACK/H,EAAKO,eAAeqH,QAAUrK,IAASyC,EAAKO,eAAeqH,OAC5D3J,EAAWV,GACf,CAOA,GANKyC,EAAKO,eAAevG,OACvBgG,EAAKO,eAAevG,KAAO+N,EAC3BlJ,EAAQO,MAAM2I,EAAM,CAClBpM,YAAY,KAGH,kBAAToM,EAEF,OADAlJ,EAAQO,MAAM,kBACE,KAAT7B,GAAwB,KAATA,EAClBsB,EAAQ0C,MAAMoG,EAAetF,EAAK2F,EAAlCnJ,CAA4CtB,GAC5CyK,EAASzK,GAEf,IAAKyC,EAAKqB,WAAsB,KAAT9D,EAGrB,OAFAsB,EAAQO,MAAM,kBACdP,EAAQO,MAAM,iBACP6I,EAAO1K,GAGlB,OAAO8E,EAAI9E,IAIb,SAAS0K,EAAO1K,GACd,OAAIU,EAAWV,MAAW4B,EAAO,IAC/BN,EAAQS,QAAQ/B,GACT0K,KAGLjI,EAAKqB,WAAalC,EAAO,KAC1Ba,EAAKO,eAAeqH,OACjBrK,IAASyC,EAAKO,eAAeqH,OACpB,KAATrK,GAAwB,KAATA,IAEnBsB,EAAQU,KAAK,iBACNyI,EAASzK,IAEX8E,EAAI9E,GAMb,SAASyK,EAASzK,GAKhB,OAJAsB,EAAQO,MAAM,kBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,kBACbS,EAAKO,eAAeqH,OAAS5H,EAAKO,eAAeqH,QAAUrK,EACpDsB,EAAQ0C,MACbmB,EAEA1C,EAAKqB,UAAYgB,EAAM6F,EACvBrJ,EAAQc,QACNwI,EACAC,EACAC,IAMN,SAASH,EAAQ3K,GAGf,OAFAyC,EAAKO,eAAe+H,kBAAmB,EACvCR,IACOM,EAAY7K,GAIrB,SAAS8K,EAAY9K,GACnB,OAAIe,EAAcf,IAChBsB,EAAQO,MAAM,4BACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,4BACN6I,GAEF/F,EAAI9E,GAIb,SAAS6K,EAAY7K,GAInB,OAHAyC,EAAKO,eAAepB,KAClB2I,EACA9H,EAAKoD,eAAevE,EAAQU,KAAK,mBAAmB,GAAMvI,OACrD8H,EAAGvB,KAjIZiD,aAAc,CACZf,SAwIJ,SAAkCZ,EAASC,EAAIuD,GAC7C,MAAMrC,EAAOJ,KAEb,OADAI,EAAKO,eAAeI,gBAAajJ,EAC1BmH,EAAQ0C,MAAMmB,EAAWwF,EAASK,GAGzC,SAASL,EAAQ3K,GAOf,OANAyC,EAAKO,eAAeiI,kBAClBxI,EAAKO,eAAeiI,mBACpBxI,EAAKO,eAAe+H,iBAIf1J,EACLC,EACAC,EACA,iBACAkB,EAAKO,eAAepB,KAAO,EAJtBP,CAKLrB,GAIJ,SAASgL,EAAShL,GAChB,OAAIyC,EAAKO,eAAeiI,oBAAsBlK,EAAcf,IAC1DyC,EAAKO,eAAeiI,uBAAoB9Q,EACxCsI,EAAKO,eAAe+H,sBAAmB5Q,EAChC+Q,EAAiBlL,KAE1ByC,EAAKO,eAAeiI,uBAAoB9Q,EACxCsI,EAAKO,eAAe+H,sBAAmB5Q,EAChCmH,EAAQc,QAAQ+I,EAAiB5J,EAAI2J,EAArC5J,CAAuDtB,IAIhE,SAASkL,EAAiBlL,GAOxB,OALAyC,EAAKO,eAAeI,YAAa,EAEjCX,EAAKqB,eAAY3J,EAGVkH,EACLC,EACAA,EAAQc,QAAQtF,EAAMyE,EAAIuD,GAC1B,aACArC,EAAK9D,OAAOsB,WAAW+E,QAAQC,KAAKC,SAAS,qBACzC/K,EACA,EANCkH,CAOLrB,MAtLJgC,KAsNF,SAAyBV,GACvBA,EAAQU,KAAKK,KAAKW,eAAevG,QAnN7BmO,EAAoC,CACxC1I,SAyNF,SAA0CZ,EAASC,EAAIuD,GACrD,MAAMrC,EAAOJ,KAIb,OAAOhB,EACLC,GASF,SAAqBtB,GACnB,MAAM4F,EAAOnD,EAAKlF,OAAOkF,EAAKlF,OAAO9D,OAAS,GAC9C,OAAQsH,EAAcf,IACpB4F,GACiB,6BAAjBA,EAAK,GAAGnJ,KACN8E,EAAGvB,GACH8E,EAAI9E,KAbR,2BACAyC,EAAK9D,OAAOsB,WAAW+E,QAAQC,KAAKC,SAAS,qBACzC/K,EACA,IAnONkL,SAAS,GAIL8F,EAAkB,CACtBjJ,SAmLF,SAAwBZ,EAASC,EAAIuD,GACnC,MAAMrC,EAAOJ,KACb,OAAOhB,EACLC,GAOF,SAAqBtB,GACnB,MAAM4F,EAAOnD,EAAKlF,OAAOkF,EAAKlF,OAAO9D,OAAS,GAC9C,OAAOmM,GACY,mBAAjBA,EAAK,GAAGnJ,MACRmJ,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMnM,SAAWgJ,EAAKO,eAAepB,KACnEL,EAAGvB,GACH8E,EAAI9E,KAXR,iBACAyC,EAAKO,eAAepB,KAAO,IAxL7ByD,SAAS,GCvBJ,MAAM+F,EAAa,CACxB3S,KAAM,aACNyJ,SAWF,SAAiCZ,EAASC,EAAIuD,GAC5C,MAAMrC,EAAOJ,KACb,OAYA,SAAerC,GACb,GAAa,KAATA,EAAa,CACf,MAAMqI,EAAQ5F,EAAKO,eAWnB,OAVKqF,EAAMgD,OACT/J,EAAQO,MAAM,aAAc,CAC1BzD,YAAY,IAEdiK,EAAMgD,MAAO,GAEf/J,EAAQO,MAAM,oBACdP,EAAQO,MAAM,oBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,oBACNoD,EAET,OAAON,EAAI9E,IAab,SAASoF,EAAMpF,GACb,OAAIe,EAAcf,IAChBsB,EAAQO,MAAM,8BACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,8BACbV,EAAQU,KAAK,oBACNT,IAETD,EAAQU,KAAK,oBACNT,EAAGvB,MA7DZiD,aAAc,CACZf,SA4EJ,SAAwCZ,EAASC,EAAIuD,GACnD,MAAMrC,EAAOJ,KACb,OAeA,SAAmBrC,GACjB,GAAIe,EAAcf,GAGhB,OAAOqB,EACLC,EACAgK,EACA,aACA7I,EAAK9D,OAAOsB,WAAW+E,QAAQC,KAAKC,SAAS,qBACzC/K,EACA,EANCkH,CAOLrB,GAEJ,OAAOsL,EAAWtL,IAgBpB,SAASsL,EAAWtL,GAClB,OAAOsB,EAAQc,QAAQgJ,EAAY7J,EAAIuD,EAAhCxD,CAAqCtB,MAzH9CgC,KA8HF,SAAcV,GACZA,EAAQU,KAAK,gBChGR,SAASuJ,EACdjK,EACAC,EACAuD,EACArI,EACA+O,EACAC,EACAC,EACAC,EACAnK,GAEA,MAAMC,EAAQD,GAAOE,OAAOC,kBAC5B,IAAIiK,EAAU,EACd,OAcA,SAAe5L,GACb,GAAa,KAATA,EAMF,OALAsB,EAAQO,MAAMpF,GACd6E,EAAQO,MAAM2J,GACdlK,EAAQO,MAAM4J,GACdnK,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAKyJ,GACNI,EAIT,GAAa,OAAT7L,GAA0B,KAATA,GAAwB,KAATA,GAAeS,EAAaT,GAC9D,OAAO8E,EAAI9E,GAQb,OANAsB,EAAQO,MAAMpF,GACd6E,EAAQO,MAAM6J,GACdpK,EAAQO,MAAM8J,GACdrK,EAAQO,MAAM,cAAe,CAC3B5D,YAAa,WAER6N,EAAI9L,IAab,SAAS6L,EAAe7L,GACtB,OAAa,KAATA,GACFsB,EAAQO,MAAM4J,GACdnK,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAKyJ,GACbnK,EAAQU,KAAKwJ,GACblK,EAAQU,KAAKvF,GACN8E,IAETD,EAAQO,MAAM8J,GACdrK,EAAQO,MAAM,cAAe,CAC3B5D,YAAa,WAER8N,EAAS/L,IAalB,SAAS+L,EAAS/L,GAChB,OAAa,KAATA,GACFsB,EAAQU,KAAK,eACbV,EAAQU,KAAK2J,GACNE,EAAe7L,IAEX,OAATA,GAA0B,KAATA,GAAea,EAAmBb,GAC9C8E,EAAI9E,IAEbsB,EAAQS,QAAQ/B,GACA,KAATA,EAAcgM,EAAiBD,GAaxC,SAASC,EAAehM,GACtB,OAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChCsB,EAAQS,QAAQ/B,GACT+L,GAEFA,EAAS/L,GAalB,SAAS8L,EAAI9L,GACX,OACG4L,GACS,OAAT5L,GAA0B,KAATA,IAAec,EAA0Bd,GAQzD4L,EAAUnK,GAAkB,KAATzB,GACrBsB,EAAQS,QAAQ/B,GAChB4L,IACOE,GAEI,KAAT9L,GACFsB,EAAQS,QAAQ/B,GAChB4L,IACOE,GAMI,OAAT9L,GAA0B,KAATA,GAAwB,KAATA,GAAeS,EAAaT,GACvD8E,EAAI9E,IAEbsB,EAAQS,QAAQ/B,GACA,KAATA,EAAciM,EAAYH,IAxB/BxK,EAAQU,KAAK,eACbV,EAAQU,KAAK2J,GACbrK,EAAQU,KAAK0J,GACbpK,EAAQU,KAAKvF,GACN8E,EAAGvB,IAiCd,SAASiM,EAAUjM,GACjB,OAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChCsB,EAAQS,QAAQ/B,GACT8L,GAEFA,EAAI9L,ICvLR,SAASkM,EAAa5K,EAASC,EAAIuD,EAAKrI,EAAM0P,EAAYR,GAC/D,MAAMlJ,EAAOJ,KACb,IAEIuC,EAFAhD,EAAO,EAGX,OAYA,SAAe5B,GAMb,OALAsB,EAAQO,MAAMpF,GACd6E,EAAQO,MAAMsK,GACd7K,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAKmK,GACb7K,EAAQO,MAAM8J,GACPnF,GAaT,SAASA,EAAQxG,GACf,OACE4B,EAAO,KACE,OAAT5B,GACS,KAATA,GACU,KAATA,IAAgB4E,GAMP,KAAT5E,IACE4B,GACD,2BAA4Ba,EAAK9D,OAAOsB,WAEnC6E,EAAI9E,GAEA,KAATA,GACFsB,EAAQU,KAAK2J,GACbrK,EAAQO,MAAMsK,GACd7K,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAKmK,GACb7K,EAAQU,KAAKvF,GACN8E,GAILV,EAAmBb,IACrBsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNwE,IAETlF,EAAQO,MAAM,cAAe,CAC3B5D,YAAa,WAERmO,EAAYpM,IAarB,SAASoM,EAAYpM,GACnB,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACAa,EAAmBb,IACnB4B,IAAS,KAETN,EAAQU,KAAK,eACNwE,EAAQxG,KAEjBsB,EAAQS,QAAQ/B,GACX4E,IAAMA,GAAQ7D,EAAcf,IACjB,KAATA,EAAcqM,EAAcD,GAarC,SAASC,EAAYrM,GACnB,OAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChCsB,EAAQS,QAAQ/B,GAChB4B,IACOwK,GAEFA,EAAYpM,ICpHhB,SAASsM,EAAahL,EAASC,EAAIuD,EAAKrI,EAAM0P,EAAYR,GAE/D,IAAItB,EACJ,OAYA,SAAerK,GACb,GAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,EAMhC,OALAsB,EAAQO,MAAMpF,GACd6E,EAAQO,MAAMsK,GACd7K,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAKmK,GACb9B,EAAkB,KAATrK,EAAc,GAAKA,EACrBuM,EAET,OAAOzH,EAAI9E,IAeb,SAASuM,EAAMvM,GACb,OAAIA,IAASqK,GACX/I,EAAQO,MAAMsK,GACd7K,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAKmK,GACb7K,EAAQU,KAAKvF,GACN8E,IAETD,EAAQO,MAAM8J,GACPnF,EAAQxG,IAajB,SAASwG,EAAQxG,GACf,OAAIA,IAASqK,GACX/I,EAAQU,KAAK2J,GACNY,EAAMlC,IAEF,OAATrK,EACK8E,EAAI9E,GAITa,EAAmBb,IAErBsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNX,EAAaC,EAASkF,EAAS,gBAExClF,EAAQO,MAAM,cAAe,CAC3B5D,YAAa,WAERyM,EAAO1K,IAQhB,SAAS0K,EAAO1K,GACd,OAAIA,IAASqK,GAAmB,OAATrK,GAAiBa,EAAmBb,IACzDsB,EAAQU,KAAK,eACNwE,EAAQxG,KAEjBsB,EAAQS,QAAQ/B,GACA,KAATA,EAAcwM,EAAS9B,GAahC,SAAS8B,EAAOxM,GACd,OAAIA,IAASqK,GAAmB,KAATrK,GACrBsB,EAAQS,QAAQ/B,GACT0K,GAEFA,EAAO1K,IChIX,SAASyM,GAAkBnL,EAASC,GAEzC,IAAIqD,EACJ,OAGA,SAAS9K,EAAMkG,GACb,GAAIa,EAAmBb,GAKrB,OAJAsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACb4C,GAAO,EACA9K,EAET,GAAIiH,EAAcf,GAChB,OAAOqB,EACLC,EACAxH,EACA8K,EAAO,aAAe,aAHjBvD,CAILrB,GAEJ,OAAOuB,EAAGvB,IC3BP,SAAS0M,GAAoB9T,GAClC,OACEA,EAEG+T,QAAQ,cAAe,KAEvBA,QAAQ,SAAU,IAOlB3Q,cACA4Q,cCdA,MAAMC,GAAa,CACxBpU,KAAM,aACNyJ,SAaF,SAA4BZ,EAASC,EAAIuD,GACvC,MAAMrC,EAAOJ,KAEb,IAAIyK,EACJ,OAYA,SAAe9M,GAKb,OADAsB,EAAQO,MAAM,cAchB,SAAgB7B,GAGd,OAAOkM,EAAanU,KAClB0K,EACAnB,EACAyL,EAEAjI,EACA,kBACA,wBACA,wBARKoH,CASLlM,GAzBKG,CAAOH,IAsChB,SAAS+M,EAAW/M,GAIlB,OAHA8M,EAAaJ,GACXjK,EAAKoD,eAAepD,EAAKlF,OAAOkF,EAAKlF,OAAO9D,OAAS,GAAG,IAAIoB,MAAM,GAAI,IAE3D,KAATmF,GACFsB,EAAQO,MAAM,oBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,oBACNgL,GAEFlI,EAAI9E,GAab,SAASgN,EAAYhN,GAEnB,OAAOc,EAA0Bd,GAC7ByM,GAAkBnL,EAAS2L,EAA3BR,CAA8CzM,GAC9CiN,EAAkBjN,GAaxB,SAASiN,EAAkBjN,GACzB,OAAOuL,EACLjK,EACA4L,EAEApI,EACA,wBACA,+BACA,qCACA,2BACA,8BATKyG,CAULvL,GAaJ,SAASkN,EAAiBlN,GACxB,OAAOsB,EAAQc,QAAQ+K,GAAa/H,EAAOA,EAApC9D,CAA2CtB,GAepD,SAASoF,EAAMpF,GACb,OAAOe,EAAcf,GACjBqB,EAAaC,EAAS8L,EAAiB,aAAvC/L,CAAqDrB,GACrDoN,EAAgBpN,GAetB,SAASoN,EAAgBpN,GACvB,OAAa,OAATA,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,cAKbS,EAAK9D,OAAO0O,QAAQhQ,KAAKyP,GAKlBvL,EAAGvB,IAEL8E,EAAI9E,MApLTmN,GAAc,CAClBjL,SA2LF,SAA6BZ,EAASC,EAAIuD,GACxC,OAcA,SAAqB9E,GACnB,OAAOc,EAA0Bd,GAC7ByM,GAAkBnL,EAASgM,EAA3Bb,CAAyCzM,GACzC8E,EAAI9E,IAcV,SAASsN,EAAatN,GACpB,OAAOsM,EACLhL,EACAiM,EACAzI,EACA,kBACA,wBACA,wBANKwH,CAOLtM,GAaJ,SAASuN,EAAWvN,GAClB,OAAOe,EAAcf,GACjBqB,EAAaC,EAASkM,EAA8B,aAApDnM,CAAkErB,GAClEwN,EAA6BxN,GAanC,SAASwN,EAA6BxN,GACpC,OAAgB,OAATA,GAAiBa,EAAmBb,GAAQuB,EAAGvB,GAAQ8E,EAAI9E,KAhQpEqF,SAAS,GCjBJ,MAAMoI,GAAe,CAC1BhV,KAAM,eACNyJ,SAaF,SAA8BZ,EAASC,EAAIuD,GACzC,MAAMrC,EAAOJ,KACb,OAgBA,SAAerC,GAMb,OAHAsB,EAAQO,MAAM,gBAGPR,EAAaC,EAASoM,EAAa,aAAc,EAAjDrM,CAAwDrB,IAajE,SAAS0N,EAAY1N,GACnB,MAAM4F,EAAOnD,EAAKlF,OAAOkF,EAAKlF,OAAO9D,OAAS,GAC9C,OAAOmM,GACY,eAAjBA,EAAK,GAAGnJ,MACRmJ,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMnM,QAAU,EAC9C+M,EAAQxG,GACR8E,EAAI9E,GAaV,SAASwG,EAAQxG,GACf,OAAa,OAATA,EACKoF,EAAMpF,GAEXa,EAAmBb,GACdsB,EAAQc,QAAQuL,GAAcnH,EAASpB,EAAvC9D,CAA8CtB,IAEvDsB,EAAQO,MAAM,iBACP6I,EAAO1K,IAahB,SAAS0K,EAAO1K,GACd,OAAa,OAATA,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,iBACNwE,EAAQxG,KAEjBsB,EAAQS,QAAQ/B,GACT0K,GAIT,SAAStF,EAAMpF,GAKb,OAJAsB,EAAQU,KAAK,gBAINT,EAAGvB,MArGR2N,GAAe,CACnBzL,SA4GF,SAA8BZ,EAASC,EAAIuD,GACzC,MAAMrC,EAAOJ,KACb,OAAOsL,EAaP,SAASA,EAAa3N,GAGpB,OAAIyC,EAAK9D,OAAOyF,KAAK3B,EAAK4B,MAAM7E,MACvBsF,EAAI9E,GAETa,EAAmBb,IACrBsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACN2L,GASFtM,EAAaC,EAASoM,EAAa,aAAc,EAAjDrM,CAAwDrB,GAajE,SAAS0N,EAAY1N,GACnB,MAAM4F,EAAOnD,EAAKlF,OAAOkF,EAAKlF,OAAO9D,OAAS,GAC9C,OAAOmM,GACY,eAAjBA,EAAK,GAAGnJ,MACRmJ,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMnM,QAAU,EAC9C8H,EAAGvB,GACHa,EAAmBb,GACnB2N,EAAa3N,GACb8E,EAAI9E,KAlKVqF,SAAS,GCDJ,MAAMuI,GAAa,CACxBnV,KAAM,aACNyJ,SA2DF,SAA4BZ,EAASC,EAAIuD,GACvC,IAAIlD,EAAO,EACX,OAYA,SAAe5B,GAGb,OADAsB,EAAQO,MAAM,cAchB,SAAgB7B,GAEd,OADAsB,EAAQO,MAAM,sBACPgM,EAAa7N,GAfbG,CAAOH,IA4BhB,SAAS6N,EAAa7N,GACpB,OAAa,KAATA,GAAe4B,IAAS,GAC1BN,EAAQS,QAAQ/B,GACT6N,GAII,OAAT7N,GAAiBc,EAA0Bd,IAC7CsB,EAAQU,KAAK,sBACNwE,EAAQxG,IAEV8E,EAAI9E,GAab,SAASwG,EAAQxG,GACf,OAAa,KAATA,GACFsB,EAAQO,MAAM,sBACPiM,EAAgB9N,IAEZ,OAATA,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,cAINT,EAAGvB,IAERe,EAAcf,GACTqB,EAAaC,EAASkF,EAAS,aAA/BnF,CAA6CrB,IAKtDsB,EAAQO,MAAM,kBACPW,EAAKxC,IAed,SAAS8N,EAAgB9N,GACvB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACT8N,IAETxM,EAAQU,KAAK,sBACNwE,EAAQxG,IAajB,SAASwC,EAAKxC,GACZ,OAAa,OAATA,GAA0B,KAATA,GAAec,EAA0Bd,IAC5DsB,EAAQU,KAAK,kBACNwE,EAAQxG,KAEjBsB,EAAQS,QAAQ/B,GACTwC,KA1LTkD,QAIF,SAA2BnI,EAAQgB,GACjC,IAGI0D,EAEAqE,EALAf,EAAahI,EAAO9D,OAAS,EAC7B0I,EAAe,EAOkB,eAAjC5E,EAAO4E,GAAc,GAAG1F,OAC1B0F,GAAgB,GAKhBoD,EAAa,EAAIpD,GACc,eAA/B5E,EAAOgI,GAAY,GAAG9I,OAEtB8I,GAAc,GAGiB,uBAA/BhI,EAAOgI,GAAY,GAAG9I,OACrB0F,IAAiBoD,EAAa,GAC5BA,EAAa,EAAIpD,GACmB,eAAnC5E,EAAOgI,EAAa,GAAG,GAAG9I,QAE9B8I,GAAcpD,EAAe,IAAMoD,EAAa,EAAI,GAElDA,EAAapD,IACfF,EAAU,CACRxF,KAAM,iBACN3C,MAAOyD,EAAO4E,GAAc,GAAGrI,MAC/BC,IAAKwD,EAAOgI,GAAY,GAAGxL,KAE7BuM,EAAO,CACL7J,KAAM,YACN3C,MAAOyD,EAAO4E,GAAc,GAAGrI,MAC/BC,IAAKwD,EAAOgI,GAAY,GAAGxL,IAC3BkE,YAAa,QAEfpB,EAAOU,EAAQ4E,EAAcoD,EAAapD,EAAe,EAAG,CAC1D,CAAC,QAASF,EAAS1D,GACnB,CAAC,QAAS+H,EAAM/H,GAChB,CAAC,OAAQ+H,EAAM/H,GACf,CAAC,OAAQ0D,EAAS1D,MAGtB,OAAOhB,IC3DF,MAAMwQ,GAAkB,CAC7BtV,KAAM,kBACNyJ,SAkEF,SAAiCZ,EAASC,EAAIuD,GAC5C,MAAMrC,EAAOJ,KAEb,IAAIgI,EACJ,OAaA,SAAerK,GACb,IAEIgO,EAFAhU,EAAQyI,EAAKlF,OAAO9D,OAIxB,KAAOO,KAGL,GACiC,eAA/ByI,EAAKlF,OAAOvD,GAAO,GAAGyC,MACS,eAA/BgG,EAAKlF,OAAOvD,GAAO,GAAGyC,MACS,YAA/BgG,EAAKlF,OAAOvD,GAAO,GAAGyC,KACtB,CACAuR,EAA2C,cAA/BvL,EAAKlF,OAAOvD,GAAO,GAAGyC,KAClC,MAMJ,IAAKgG,EAAK9D,OAAOyF,KAAK3B,EAAK4B,MAAM7E,QAAUiD,EAAKqB,WAAakK,GAG3D,OAFA1M,EAAQO,MAAM,qBACdwI,EAASrK,EAiBb,SAAgBA,GAEd,OADAsB,EAAQO,MAAM,6BACP6I,EAAO1K,GAlBLG,CAAOH,GAEhB,OAAO8E,EAAI9E,IA8Bb,SAAS0K,EAAO1K,GACd,OAAIA,IAASqK,GACX/I,EAAQS,QAAQ/B,GACT0K,IAETpJ,EAAQU,KAAK,6BACNjB,EAAcf,GACjBqB,EAAaC,EAAS8D,EAAO,aAA7B/D,CAA2CrB,GAC3CoF,EAAMpF,IAcZ,SAASoF,EAAMpF,GACb,OAAa,OAATA,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,qBACNT,EAAGvB,IAEL8E,EAAI9E,KApKbmK,UAIF,SAAkC5M,EAAQgB,GAExC,IAEI0D,EAEAqE,EAEAuG,EANA7S,EAAQuD,EAAO9D,OAUnB,KAAOO,KACL,GAAyB,UAArBuD,EAAOvD,GAAO,GAAgB,CAChC,GAA8B,YAA1BuD,EAAOvD,GAAO,GAAGyC,KAAoB,CACvCwF,EAAUjI,EACV,MAE4B,cAA1BuD,EAAOvD,GAAO,GAAGyC,OACnB6J,EAAOtM,OAKqB,YAA1BuD,EAAOvD,GAAO,GAAGyC,MAEnBc,EAAOV,OAAO7C,EAAO,GAElB6S,GAAwC,eAA1BtP,EAAOvD,GAAO,GAAGyC,OAClCoQ,EAAa7S,GAInB,MAAMiU,EAAU,CACdxR,KAAM,gBACN3C,MAAO1C,OAAO8G,OAAO,GAAIX,EAAO+I,GAAM,GAAGxM,OACzCC,IAAK3C,OAAO8G,OAAO,GAAIX,EAAOA,EAAO9D,OAAS,GAAG,GAAGM,MAItDwD,EAAO+I,GAAM,GAAG7J,KAAO,oBAInBoQ,GACFtP,EAAOV,OAAOyJ,EAAM,EAAG,CAAC,QAAS2H,EAAS1P,IAC1ChB,EAAOV,OAAOgQ,EAAa,EAAG,EAAG,CAAC,OAAQtP,EAAO0E,GAAS,GAAI1D,IAC9DhB,EAAO0E,GAAS,GAAGlI,IAAM3C,OAAO8G,OAAO,GAAIX,EAAOsP,GAAY,GAAG9S,MAEjEwD,EAAO0E,GAAS,GAAKgM,EAKvB,OADA1Q,EAAOF,KAAK,CAAC,OAAQ4Q,EAAS1P,IACvBhB,IC1DF,MAAM2Q,GAAiB,CAC5B,UACA,UACA,QACA,OACA,WACA,aACA,OACA,UACA,SACA,MACA,WACA,KACA,UACA,SACA,MACA,MACA,KACA,KACA,WACA,aACA,SACA,SACA,OACA,QACA,WACA,KACA,KACA,KACA,KACA,KACA,KACA,OACA,SACA,KACA,OACA,SACA,SACA,KACA,OACA,OACA,OACA,WACA,MACA,WACA,KACA,WACA,SACA,IACA,QACA,SACA,UACA,UACA,QACA,QACA,KACA,QACA,KACA,QACA,QACA,KACA,QACA,MAeWC,GAAe,CAAC,MAAO,SAAU,QAAS,YCxE1CC,GAAW,CACtB3V,KAAM,WACNyJ,SAsCF,SAA0BZ,EAASC,EAAIuD,GACrC,MAAMrC,EAAOJ,KAEb,IAAIgI,EAEAgE,EAEAC,EAEAtU,EAEAuU,EACJ,OAYA,SAAevO,GAEb,OAaF,SAAgBA,GAId,OAHAsB,EAAQO,MAAM,YACdP,EAAQO,MAAM,gBACdP,EAAQS,QAAQ/B,GACTqL,EAjBAlL,CAAOH,IAkChB,SAASqL,EAAKrL,GACZ,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACTwO,GAEI,KAATxO,GACFsB,EAAQS,QAAQ/B,GAChBqO,GAAa,EACNI,GAEI,KAATzO,GACFsB,EAAQS,QAAQ/B,GAChBqK,EAAS,EAMF5H,EAAKqB,UAAYvC,EAAKmN,GAI3BrO,EAAWL,IACbsB,EAAQS,QAAQ/B,GAEhBsO,EAASnN,OAAOC,aAAapB,GACtB2O,GAEF7J,EAAI9E,GAiBb,SAASwO,EAAgBxO,GACvB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GAChBqK,EAAS,EACFuE,GAEI,KAAT5O,GACFsB,EAAQS,QAAQ/B,GAChBqK,EAAS,EACTrQ,EAAQ,EACD6U,GAILxO,EAAWL,IACbsB,EAAQS,QAAQ/B,GAChBqK,EAAS,EAGF5H,EAAKqB,UAAYvC,EAAKmN,GAExB5J,EAAI9E,GAab,SAAS4O,EAAkB5O,GACzB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GAGTyC,EAAKqB,UAAYvC,EAAKmN,GAExB5J,EAAI9E,GAab,SAAS6O,EAAgB7O,GACvB,MAAMpH,EAAQ,SACd,OAAIoH,IAASpH,EAAMmO,WAAW/M,MAC5BsH,EAAQS,QAAQ/B,GACZhG,IAAUpB,EAAMa,OAGXgJ,EAAKqB,UAAYvC,EAAK0B,EAExB4L,GAEF/J,EAAI9E,GAab,SAASyO,EAAczO,GACrB,OAAIK,EAAWL,IACbsB,EAAQS,QAAQ/B,GAEhBsO,EAASnN,OAAOC,aAAapB,GACtB2O,GAEF7J,EAAI9E,GAeb,SAAS2O,EAAQ3O,GACf,GACW,OAATA,GACS,KAATA,GACS,KAATA,GACAc,EAA0Bd,GAC1B,CACA,MAAM8O,EAAiB,KAAT9O,EACRvH,EAAO6V,EAAOtS,cACpB,OAAK8S,GAAUT,IAAcF,GAAajJ,SAASzM,GAM/CyV,GAAehJ,SAASoJ,EAAOtS,gBACjCqO,EAAS,EACLyE,GACFxN,EAAQS,QAAQ/B,GACT+O,GAKFtM,EAAKqB,UAAYvC,EAAGvB,GAAQiD,EAAajD,KAElDqK,EAAS,EAEF5H,EAAKqB,YAAcrB,EAAK9D,OAAOyF,KAAK3B,EAAK4B,MAAM7E,MAClDsF,EAAI9E,GACJqO,EACAW,EAAwBhP,GACxBiP,EAA4BjP,KAtB9BqK,EAAS,EAGF5H,EAAKqB,UAAYvC,EAAGvB,GAAQiD,EAAajD,IAuBpD,OAAa,KAATA,GAAeO,EAAkBP,IACnCsB,EAAQS,QAAQ/B,GAChBsO,GAAUnN,OAAOC,aAAapB,GACvB2O,GAEF7J,EAAI9E,GAab,SAAS+O,EAAiB/O,GACxB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GAGTyC,EAAKqB,UAAYvC,EAAK0B,GAExB6B,EAAI9E,GAab,SAASgP,EAAwBhP,GAC/B,OAAIe,EAAcf,IAChBsB,EAAQS,QAAQ/B,GACTgP,GAEFE,EAAYlP,GA0BrB,SAASiP,EAA4BjP,GACnC,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACTkP,GAII,KAATlP,GAAwB,KAATA,GAAeK,EAAWL,IAC3CsB,EAAQS,QAAQ/B,GACTmP,GAELpO,EAAcf,IAChBsB,EAAQS,QAAQ/B,GACTiP,GAEFC,EAAYlP,GAiBrB,SAASmP,EAAsBnP,GAE7B,OACW,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACAO,EAAkBP,IAElBsB,EAAQS,QAAQ/B,GACTmP,GAEFC,EAA2BpP,GAgBpC,SAASoP,EAA2BpP,GAClC,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACTqP,GAELtO,EAAcf,IAChBsB,EAAQS,QAAQ/B,GACToP,GAEFH,EAA4BjP,GAgBrC,SAASqP,EAA6BrP,GACpC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,EAEO8E,EAAI9E,GAEA,KAATA,GAAwB,KAATA,GACjBsB,EAAQS,QAAQ/B,GAChBuO,EAAUvO,EACHsP,GAELvO,EAAcf,IAChBsB,EAAQS,QAAQ/B,GACTqP,GAEFE,EAA+BvP,GAexC,SAASsP,EAA6BtP,GACpC,OAAIA,IAASuO,GACXjN,EAAQS,QAAQ/B,GAChBuO,EAAU,KACHiB,GAEI,OAATxP,GAAiBa,EAAmBb,GAC/B8E,EAAI9E,IAEbsB,EAAQS,QAAQ/B,GACTsP,GAaT,SAASC,EAA+BvP,GACtC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACAc,EAA0Bd,GAEnBoP,EAA2BpP,IAEpCsB,EAAQS,QAAQ/B,GACTuP,GAcT,SAASC,EAAkCxP,GACzC,OAAa,KAATA,GAAwB,KAATA,GAAee,EAAcf,GACvCiP,EAA4BjP,GAE9B8E,EAAI9E,GAab,SAASkP,EAAYlP,GACnB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACTyP,GAEF3K,EAAI9E,GAab,SAASyP,EAAczP,GACrB,OAAa,OAATA,GAAiBa,EAAmBb,GAG/BiD,EAAajD,GAElBe,EAAcf,IAChBsB,EAAQS,QAAQ/B,GACTyP,GAEF3K,EAAI9E,GAab,SAASiD,EAAajD,GACpB,OAAa,KAATA,GAA0B,IAAXqK,GACjB/I,EAAQS,QAAQ/B,GACT0P,GAEI,KAAT1P,GAA0B,IAAXqK,GACjB/I,EAAQS,QAAQ/B,GACT2P,GAEI,KAAT3P,GAA0B,IAAXqK,GACjB/I,EAAQS,QAAQ/B,GACT4P,GAEI,KAAT5P,GAA0B,IAAXqK,GACjB/I,EAAQS,QAAQ/B,GACT0O,GAEI,KAAT1O,GAA0B,IAAXqK,GACjB/I,EAAQS,QAAQ/B,GACT6P,IAELhP,EAAmBb,IAAqB,IAAXqK,GAA2B,IAAXA,EAQpC,OAATrK,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,gBACN8N,EAAkB9P,KAE3BsB,EAAQS,QAAQ/B,GACTiD,IAZL3B,EAAQU,KAAK,gBACNV,EAAQ0C,MACb+L,GACAC,EACAF,EAHKxO,CAILtB,IAqBN,SAAS8P,EAAkB9P,GACzB,OAAOsB,EAAQ0C,MACbiM,GACAC,EACAF,EAHK1O,CAILtB,GAcJ,SAASkQ,EAAyBlQ,GAIhC,OAHAsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNmO,EAcT,SAASA,EAAmBnQ,GAC1B,OAAa,OAATA,GAAiBa,EAAmBb,GAC/B8P,EAAkB9P,IAE3BsB,EAAQO,MAAM,gBACPoB,EAAajD,IAatB,SAAS0P,EAA0B1P,GACjC,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACT0O,GAEFzL,EAAajD,GAatB,SAAS2P,EAAuB3P,GAC9B,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GAChBsO,EAAS,GACF8B,GAEFnN,EAAajD,GAatB,SAASoQ,EAAsBpQ,GAC7B,GAAa,KAATA,EAAa,CACf,MAAMvH,EAAO6V,EAAOtS,cACpB,OAAImS,GAAajJ,SAASzM,IACxB6I,EAAQS,QAAQ/B,GACT4P,GAEF3M,EAAajD,GAEtB,OAAIK,EAAWL,IAASsO,EAAO7U,OAAS,GACtC6H,EAAQS,QAAQ/B,GAEhBsO,GAAUnN,OAAOC,aAAapB,GACvBoQ,GAEFnN,EAAajD,GAatB,SAAS6P,EAAwB7P,GAC/B,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACT0O,GAEFzL,EAAajD,GAqBtB,SAAS0O,EAA8B1O,GACrC,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACT4P,GAII,KAAT5P,GAA0B,IAAXqK,GACjB/I,EAAQS,QAAQ/B,GACT0O,GAEFzL,EAAajD,GAatB,SAAS4P,EAAkB5P,GACzB,OAAa,OAATA,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,gBACNgO,EAAkBhQ,KAE3BsB,EAAQS,QAAQ/B,GACT4P,GAaT,SAASI,EAAkBhQ,GAMzB,OALAsB,EAAQU,KAAK,YAKNT,EAAGvB,KAnzBZmK,UAeF,SAA2B5M,GACzB,IAAIvD,EAAQuD,EAAO9D,OACnB,KAAOO,MACoB,UAArBuD,EAAOvD,GAAO,IAA4C,aAA1BuD,EAAOvD,GAAO,GAAGyC,QAInDzC,EAAQ,GAAmC,eAA9BuD,EAAOvD,EAAQ,GAAG,GAAGyC,OAEpCc,EAAOvD,GAAO,GAAGF,MAAQyD,EAAOvD,EAAQ,GAAG,GAAGF,MAE9CyD,EAAOvD,EAAQ,GAAG,GAAGF,MAAQyD,EAAOvD,EAAQ,GAAG,GAAGF,MAElDyD,EAAOV,OAAO7C,EAAQ,EAAG,IAE3B,OAAOuD,GA7BPqG,UAAU,GAINmM,GAAkB,CACtB7N,SAk2BF,SAAiCZ,EAASC,EAAIuD,GAC5C,OAaA,SAAe9E,GAIb,OAHAsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNV,EAAQc,QAAQ+C,EAAW5D,EAAIuD,KAn3BxCO,SAAS,GAEL4K,GAA2B,CAC/B/N,SAizBF,SAA0CZ,EAASC,EAAIuD,GACrD,MAAMrC,EAAOJ,KACb,OAaA,SAAerC,GACb,GAAIa,EAAmBb,GAIrB,OAHAsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNoD,EAET,OAAON,EAAI9E,IAcb,SAASoF,EAAMpF,GACb,OAAOyC,EAAK9D,OAAOyF,KAAK3B,EAAK4B,MAAM7E,MAAQsF,EAAI9E,GAAQuB,EAAGvB,KAr1B5DqF,SAAS,GCvBX,MAAMgL,GAAsB,CAC1BnO,SAwbF,SAAqCZ,EAASC,EAAIuD,GAChD,MAAMrC,EAAOJ,KACb,OAOA,SAAerC,GACb,GAAa,OAATA,EACF,OAAO8E,EAAI9E,GAKb,OAHAsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNO,GAQT,SAASA,EAAUvC,GACjB,OAAOyC,EAAK9D,OAAOyF,KAAK3B,EAAK4B,MAAM7E,MAAQsF,EAAI9E,GAAQuB,EAAGvB,KAhd5DqF,SAAS,GAIEiL,GAAa,CACxB7X,KAAM,aACNyJ,SAQF,SAA4BZ,EAASC,EAAIuD,GACvC,MAAMrC,EAAOJ,KAEPkO,EAAa,CACjBrO,SA+SF,SAA4BZ,EAASC,EAAIuD,GACvC,IAAIlD,EAAO,EACX,OAAO4O,EAOP,SAASA,EAAYxQ,GAInB,OAHAsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNlI,EAeT,SAASA,EAAMkG,GAKb,OADAsB,EAAQO,MAAM,mBACPd,EAAcf,GACjBqB,EACEC,EACAmP,EACA,aACAhO,EAAK9D,OAAOsB,WAAW+E,QAAQC,KAAKC,SAAS,qBACzC/K,EACA,EANNkH,CAOErB,GACFyQ,EAAoBzQ,GAe1B,SAASyQ,EAAoBzQ,GAC3B,OAAIA,IAASqK,GACX/I,EAAQO,MAAM,2BACP6O,EAAc1Q,IAEhB8E,EAAI9E,GAeb,SAAS0Q,EAAc1Q,GACrB,OAAIA,IAASqK,GACXzI,IACAN,EAAQS,QAAQ/B,GACT0Q,GAEL9O,GAAQ+O,GACVrP,EAAQU,KAAK,2BACNjB,EAAcf,GACjBqB,EAAaC,EAASsP,EAAoB,aAA1CvP,CAAwDrB,GACxD4Q,EAAmB5Q,IAElB8E,EAAI9E,GAeb,SAAS4Q,EAAmB5Q,GAC1B,OAAa,OAATA,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,mBACNT,EAAGvB,IAEL8E,EAAI9E,KA3ZbqF,SAAS,GAEX,IAGIgF,EAHAwG,EAAgB,EAChBF,EAAW,EAGf,OAcA,SAAe3Q,GAEb,OAeF,SAA4BA,GAC1B,MAAM4F,EAAOnD,EAAKlF,OAAOkF,EAAKlF,OAAO9D,OAAS,GAS9C,OARAoX,EACEjL,GAAyB,eAAjBA,EAAK,GAAGnJ,KACZmJ,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMnM,OACtC,EACN4Q,EAASrK,EACTsB,EAAQO,MAAM,cACdP,EAAQO,MAAM,mBACdP,EAAQO,MAAM,2BACPgM,EAAa7N,GAzBb8Q,CAAmB9Q,IAwC5B,SAAS6N,EAAa7N,GACpB,OAAIA,IAASqK,GACXsG,IACArP,EAAQS,QAAQ/B,GACT6N,GAEL8C,EAAW,EACN7L,EAAI9E,IAEbsB,EAAQU,KAAK,2BACNjB,EAAcf,GACjBqB,EAAaC,EAASyP,EAAY,aAAlC1P,CAAgDrB,GAChD+Q,EAAW/Q,IAejB,SAAS+Q,EAAW/Q,GAClB,OAAa,OAATA,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,mBACNS,EAAKqB,UACRvC,EAAGvB,GACHsB,EAAQ0C,MAAMqM,GAAqBW,EAAgB5L,EAAnD9D,CAA0DtB,KAEhEsB,EAAQO,MAAM,uBACdP,EAAQO,MAAM,cAAe,CAC3B5D,YAAa,WAER4J,EAAK7H,IAed,SAAS6H,EAAK7H,GACZ,OAAa,OAATA,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,eACbV,EAAQU,KAAK,uBACN+O,EAAW/Q,IAEhBe,EAAcf,IAChBsB,EAAQU,KAAK,eACbV,EAAQU,KAAK,uBACNX,EAAaC,EAAS2P,EAAY,aAAlC5P,CAAgDrB,IAE5C,KAATA,GAAeA,IAASqK,EACnBvF,EAAI9E,IAEbsB,EAAQS,QAAQ/B,GACT6H,GAeT,SAASoJ,EAAWjR,GAClB,OAAa,OAATA,GAAiBa,EAAmBb,GAC/B+Q,EAAW/Q,IAEpBsB,EAAQO,MAAM,uBACdP,EAAQO,MAAM,cAAe,CAC3B5D,YAAa,WAERiT,EAAKlR,IAed,SAASkR,EAAKlR,GACZ,OAAa,OAATA,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,eACbV,EAAQU,KAAK,uBACN+O,EAAW/Q,IAEP,KAATA,GAAeA,IAASqK,EACnBvF,EAAI9E,IAEbsB,EAAQS,QAAQ/B,GACTkR,GAgBT,SAASF,EAAehR,GACtB,OAAOsB,EAAQc,QAAQmO,EAAYnL,EAAO+L,EAAnC7P,CAAkDtB,GAe3D,SAASmR,EAAcnR,GAIrB,OAHAsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNG,EAeT,SAASA,EAAanC,GACpB,OAAO6Q,EAAgB,GAAK9P,EAAcf,GACtCqB,EACEC,EACA8P,EACA,aACAP,EAAgB,EAJlBxP,CAKErB,GACFoR,EAAmBpR,GAezB,SAASoR,EAAmBpR,GAC1B,OAAa,OAATA,GAAiBa,EAAmBb,GAC/BsB,EAAQ0C,MAAMqM,GAAqBW,EAAgB5L,EAAnD9D,CAA0DtB,IAEnEsB,EAAQO,MAAM,iBACPwP,EAAarR,IAetB,SAASqR,EAAarR,GACpB,OAAa,OAATA,GAAiBa,EAAmBb,IACtCsB,EAAQU,KAAK,iBACNoP,EAAmBpR,KAE5BsB,EAAQS,QAAQ/B,GACTqR,GAeT,SAASjM,EAAMpF,GAEb,OADAsB,EAAQU,KAAK,cACNT,EAAGvB,KAnTZ4D,UAAU,GChBZ,MAAM,GAAUmB,SAASuM,cAAc,KAMhC,SAASC,GAA8B3Y,GAC5C,MAAM4Y,EAAqB,IAAM5Y,EAAQ,IACzC,GAAQ6Y,UAAYD,EACpB,MAAME,EAAO,GAAQC,YAUrB,OAAyC,KAArCD,EAAK3K,WAAW2K,EAAKjY,OAAS,IAAiC,SAAVb,KAQlD8Y,IAASF,GAA6BE,GChBxC,MAAMF,GAAqB,CAChC/Y,KAAM,qBACNyJ,SAOF,SAAoCZ,EAASC,EAAIuD,GAC/C,MAAMrC,EAAOJ,KACb,IAEIb,EAEAxG,EAJA4G,EAAO,EAKX,OAgBA,SAAe5B,GAKb,OAJAsB,EAAQO,MAAM,sBACdP,EAAQO,MAAM,4BACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,4BACNqJ,GAkBT,SAASA,EAAKrL,GACZ,OAAa,KAATA,GACFsB,EAAQO,MAAM,mCACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,mCACN4P,IAETtQ,EAAQO,MAAM,2BACdL,EAAM,GACNxG,EAAOuF,EACA3H,EAAMoH,IAef,SAAS4R,EAAQ5R,GACf,OAAa,KAATA,GAAwB,MAATA,GACjBsB,EAAQO,MAAM,uCACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,uCACbV,EAAQO,MAAM,2BACdL,EAAM,EACNxG,EAAO2F,EACA/H,IAET0I,EAAQO,MAAM,2BACdL,EAAM,EACNxG,EAAO0F,EACA9H,EAAMoH,IAoBf,SAASpH,EAAMoH,GACb,GAAa,KAATA,GAAe4B,EAAM,CACvB,MAAMtD,EAAQgD,EAAQU,KAAK,2BAC3B,OACEhH,IAASuF,GACRgR,GAA8B9O,EAAKoD,eAAevH,KAOrDgD,EAAQO,MAAM,4BACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,4BACbV,EAAQU,KAAK,sBACNT,GATEuD,EAAI9E,GAWf,OAAIhF,EAAKgF,IAAS4B,IAASJ,GACzBF,EAAQS,QAAQ/B,GACTpH,GAEFkM,EAAI9E,MC7IR,MAAM6R,GAAkB,CAC7BpZ,KAAM,kBACNyJ,SAOF,SAAiCZ,EAASC,EAAIuD,GAC5C,OAYA,SAAe9E,GAKb,OAJAsB,EAAQO,MAAM,mBACdP,EAAQO,MAAM,gBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,gBACN0I,GAaT,SAASA,EAAO1K,GAEd,OAAIY,EAAiBZ,IACnBsB,EAAQO,MAAM,wBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,wBACbV,EAAQU,KAAK,mBACNT,GAEFuD,EAAI9E,MChDR,MAAM8R,GAAa,CACxBrZ,KAAM,aACNyJ,SAOF,SAA4BZ,EAASC,GACnC,OAGA,SAAevB,GAIb,OAHAsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNX,EAAaC,EAASC,EAAI,iBCR9B,MAAMwQ,GAAW,CACtBtZ,KAAM,WACNyJ,SA8IF,SAA0BZ,EAASC,EAAIuD,GACrC,MAAMrC,EAAOJ,KACb,IAEI2P,EAEA3E,EAJArT,EAAQyI,EAAKlF,OAAO9D,OAOxB,KAAOO,KACL,IACkC,eAA/ByI,EAAKlF,OAAOvD,GAAO,GAAGyC,MACU,cAA/BgG,EAAKlF,OAAOvD,GAAO,GAAGyC,QACvBgG,EAAKlF,OAAOvD,GAAO,GAAGiY,UACvB,CACAD,EAAavP,EAAKlF,OAAOvD,GAAO,GAChC,MAGJ,OAiBA,SAAegG,GAEb,IAAKgS,EACH,OAAOlN,EAAI9E,GAYb,GAAIgS,EAAWE,UACb,OAAOC,EAAYnS,GAerB,OAbAqN,EAAU5K,EAAK9D,OAAO0O,QAAQnI,SAC5BwH,GACEjK,EAAKoD,eAAe,CAClB/L,MAAOkY,EAAWjY,IAClBA,IAAK0I,EAAK4B,UAIhB/C,EAAQO,MAAM,YACdP,EAAQO,MAAM,eACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,eACbV,EAAQU,KAAK,YACNoD,GAmBT,SAASA,EAAMpF,GAKb,OAAa,KAATA,EACKsB,EAAQc,QACbgQ,GACAC,EACAhF,EAAUgF,EAAaF,EAHlB7Q,CAILtB,GAIS,KAATA,EACKsB,EAAQc,QACbkQ,GACAD,EACAhF,EAAUkF,EAAmBJ,EAHxB7Q,CAILtB,GAIGqN,EAAUgF,EAAWrS,GAAQmS,EAAYnS,GAiBlD,SAASuS,EAAiBvS,GACxB,OAAOsB,EAAQc,QACboQ,GACAH,EACAF,EAHK7Q,CAILtB,GAmBJ,SAASqS,EAAWrS,GAElB,OAAOuB,EAAGvB,GAmBZ,SAASmS,EAAYnS,GAEnB,OADAgS,EAAWC,WAAY,EAChBnN,EAAI9E,KA1TbmK,UAqCF,SAA2B5M,EAAQgB,GACjC,IAGID,EAEA+M,EAEAoH,EAEAC,EATA1Y,EAAQuD,EAAO9D,OACf6K,EAAS,EAWb,KAAOtK,KAEL,GADAsE,EAAQf,EAAOvD,GAAO,GAClBqR,EAAM,CAER,GACiB,SAAf/M,EAAM7B,MACU,cAAf6B,EAAM7B,MAAwB6B,EAAM4T,UAErC,MAKuB,UAArB3U,EAAOvD,GAAO,IAAiC,cAAfsE,EAAM7B,OACxC6B,EAAM4T,WAAY,QAEf,GAAIO,GACT,GACuB,UAArBlV,EAAOvD,GAAO,KACE,eAAfsE,EAAM7B,MAAwC,cAAf6B,EAAM7B,QACrC6B,EAAM2T,YAEP5G,EAAOrR,EACY,cAAfsE,EAAM7B,MAAsB,CAC9B6H,EAAS,EACT,WAGoB,aAAfhG,EAAM7B,OACfgW,EAAQzY,GAGZ,MAAM2Y,EAAQ,CACZlW,KAA+B,cAAzBc,EAAO8N,GAAM,GAAG5O,KAAuB,OAAS,QACtD3C,MAAO1C,OAAO8G,OAAO,GAAIX,EAAO8N,GAAM,GAAGvR,OACzCC,IAAK3C,OAAO8G,OAAO,GAAIX,EAAOA,EAAO9D,OAAS,GAAG,GAAGM,MAEhD6Y,EAAQ,CACZnW,KAAM,QACN3C,MAAO1C,OAAO8G,OAAO,GAAIX,EAAO8N,GAAM,GAAGvR,OACzCC,IAAK3C,OAAO8G,OAAO,GAAIX,EAAOkV,GAAO,GAAG1Y,MAEpCuM,EAAO,CACX7J,KAAM,YACN3C,MAAO1C,OAAO8G,OAAO,GAAIX,EAAO8N,EAAO/G,EAAS,GAAG,GAAGvK,KACtDA,IAAK3C,OAAO8G,OAAO,GAAIX,EAAOkV,EAAQ,GAAG,GAAG3Y,QAuC9C,OArCA4Y,EAAQ,CACN,CAAC,QAASC,EAAOpU,GACjB,CAAC,QAASqU,EAAOrU,IAInBmU,EAAQrV,EAAKqV,EAAOnV,EAAO1C,MAAMwQ,EAAO,EAAGA,EAAO/G,EAAS,IAG3DoO,EAAQrV,EAAKqV,EAAO,CAAC,CAAC,QAASpM,EAAM/H,KAKrCmU,EAAQrV,EACNqV,EACAxM,EACE3H,EAAQI,OAAOsB,WAAW4S,WAAW5N,KACrC1H,EAAO1C,MAAMwQ,EAAO/G,EAAS,EAAGmO,EAAQ,GACxClU,IAKJmU,EAAQrV,EAAKqV,EAAO,CAClB,CAAC,OAAQpM,EAAM/H,GACfhB,EAAOkV,EAAQ,GACflV,EAAOkV,EAAQ,GACf,CAAC,OAAQG,EAAOrU,KAIlBmU,EAAQrV,EAAKqV,EAAOnV,EAAO1C,MAAM4X,EAAQ,IAGzCC,EAAQrV,EAAKqV,EAAO,CAAC,CAAC,OAAQC,EAAOpU,KACrC1B,EAAOU,EAAQ8N,EAAM9N,EAAO9D,OAAQiZ,GAC7BnV,GArIP2I,WAiBF,SAA4B3I,GAC1B,IAAIvD,GAAS,EACb,OAASA,EAAQuD,EAAO9D,QAAQ,CAC9B,MAAM6E,EAAQf,EAAOvD,GAAO,GAEX,eAAfsE,EAAM7B,MACS,cAAf6B,EAAM7B,MACS,aAAf6B,EAAM7B,OAGNc,EAAOV,OAAO7C,EAAQ,EAAkB,eAAfsE,EAAM7B,KAAwB,EAAI,GAC3D6B,EAAM7B,KAAO,OACbzC,KAGJ,OAAOuD,IA5BH6U,GAAoB,CACxBlQ,SA4TF,SAA0BZ,EAASC,EAAIuD,GACrC,OAYA,SAAuB9E,GAKrB,OAJAsB,EAAQO,MAAM,YACdP,EAAQO,MAAM,kBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,kBACN8Q,GAaT,SAASA,EAAe9S,GACtB,OAAOc,EAA0Bd,GAC7ByM,GAAkBnL,EAASyR,EAA3BtG,CAAyCzM,GACzC+S,EAAa/S,GAanB,SAAS+S,EAAa/S,GACpB,OAAa,KAATA,EACKgT,EAAYhT,GAEduL,EACLjK,EACA2R,EACAC,EACA,sBACA,6BACA,mCACA,yBACA,4BACA,GATK3H,CAULvL,GAaJ,SAASiT,EAAyBjT,GAChC,OAAOc,EAA0Bd,GAC7ByM,GAAkBnL,EAAS6R,EAA3B1G,CAA4CzM,GAC5CgT,EAAYhT,GAalB,SAASkT,EAA2BlT,GAClC,OAAO8E,EAAI9E,GAab,SAASmT,EAAgBnT,GACvB,OAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,EACzBsM,EACLhL,EACA8R,EACAtO,EACA,gBACA,sBACA,sBANKwH,CAOLtM,GAEGgT,EAAYhT,GAarB,SAASoT,EAAmBpT,GAC1B,OAAOc,EAA0Bd,GAC7ByM,GAAkBnL,EAAS0R,EAA3BvG,CAAwCzM,GACxCgT,EAAYhT,GAalB,SAASgT,EAAYhT,GACnB,OAAa,KAATA,GACFsB,EAAQO,MAAM,kBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,kBACbV,EAAQU,KAAK,YACNT,GAEFuD,EAAI9E,MAjdTsS,GAAyB,CAC7BpQ,SAwdF,SAA+BZ,EAASC,EAAIuD,GAC1C,MAAMrC,EAAOJ,KACb,OAYA,SAAuBrC,GACrB,OAAOkM,EAAanU,KAClB0K,EACAnB,EACA+R,EACAC,EACA,YACA,kBACA,kBAPKpH,CAQLlM,IAaJ,SAASqT,EAAmBrT,GAC1B,OAAOyC,EAAK9D,OAAO0O,QAAQnI,SACzBwH,GACEjK,EAAKoD,eAAepD,EAAKlF,OAAOkF,EAAKlF,OAAO9D,OAAS,GAAG,IAAIoB,MAAM,GAAI,KAGtE0G,EAAGvB,GACH8E,EAAI9E,GAaV,SAASsT,EAAqBtT,GAC5B,OAAO8E,EAAI9E,MA9gBTwS,GAA8B,CAClCtQ,SAqhBF,SAAoCZ,EAASC,EAAIuD,GAC/C,OAcA,SAAiC9E,GAO/B,OAJAsB,EAAQO,MAAM,aACdP,EAAQO,MAAM,mBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,mBACNuR,GAeT,SAASA,EAAuBvT,GAC9B,OAAa,KAATA,GACFsB,EAAQO,MAAM,mBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,mBACbV,EAAQU,KAAK,aACNT,GAEFuD,EAAI9E,MC5lBR,MAAMwT,GAAkB,CAC7B/a,KAAM,kBACNyJ,SAQF,SAAiCZ,EAASC,EAAIuD,GAC5C,MAAMrC,EAAOJ,KACb,OAYA,SAAerC,GAKb,OAJAsB,EAAQO,MAAM,cACdP,EAAQO,MAAM,oBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,oBACNqJ,GAaT,SAASA,EAAKrL,GACZ,OAAa,KAATA,GACFsB,EAAQO,MAAM,eACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,eACbV,EAAQU,KAAK,cACNoD,GAEFN,EAAI9E,GA8Bb,SAASoF,EAAMpF,GAMb,OAAgB,KAATA,GAAe,2BAA4ByC,EAAK9D,OAAOsB,WAC1D6E,EAAI9E,GACJuB,EAAGvB,KArFTkG,WAAY6L,GAAS7L,YCUhB,SAASuN,GAAkBzT,GAChC,OACW,OAATA,GACAc,EAA0Bd,IAC1BiB,EAAkBjB,GAEX,EAELgB,EAAmBhB,GACd,OADT,ECfK,MAAM0T,GAAY,CACvBjb,KAAM,YACNyJ,SA6KF,SAA2BZ,EAASC,GAClC,MAAMoS,EAAmBtR,KAAK1D,OAAOsB,WAAW0T,iBAAiB1O,KAC3DlG,EAAWsD,KAAKtD,SAChBoB,EAASsT,GAAkB1U,GAGjC,IAAIsL,EACJ,OAYA,SAAerK,GAGb,OAFAqK,EAASrK,EACTsB,EAAQO,MAAM,qBACP6I,EAAO1K,IAahB,SAAS0K,EAAO1K,GACd,GAAIA,IAASqK,EAEX,OADA/I,EAAQS,QAAQ/B,GACT0K,EAET,MAAMpM,EAAQgD,EAAQU,KAAK,qBAGrBoD,EAAQqO,GAAkBzT,GAI1BqL,GACHjG,GAAoB,IAAVA,GAAejF,GAAWwT,EAAiBzO,SAASlF,GAC3DyS,GACHtS,GAAsB,IAAXA,GAAgBiF,GAAUuO,EAAiBzO,SAASnG,GAGlE,OAFAT,EAAMsV,MAAQrX,QAAmB,KAAX8N,EAAgBgB,EAAOA,IAASlL,IAAWsS,IACjEnU,EAAMuV,OAAStX,QAAmB,KAAX8N,EAAgBoI,EAAQA,IAAUrN,IAAUiG,IAC5D9J,EAAGvB,KAjOZkG,WASF,SAA6B3I,EAAQgB,GACnC,IAEI8M,EAEAsH,EAEArM,EAEAwN,EAEAC,EAEAC,EAEAC,EAEA3P,EAhBAtK,GAAS,EAsBb,OAASA,EAAQuD,EAAO9D,QAEtB,GACuB,UAArB8D,EAAOvD,GAAO,IACY,sBAA1BuD,EAAOvD,GAAO,GAAGyC,MACjBc,EAAOvD,GAAO,GAAG6Z,OAKjB,IAHAxI,EAAOrR,EAGAqR,KAEL,GACsB,SAApB9N,EAAO8N,GAAM,IACY,sBAAzB9N,EAAO8N,GAAM,GAAG5O,MAChBc,EAAO8N,GAAM,GAAGuI,OAEhBrV,EAAQsH,eAAetI,EAAO8N,GAAM,IAAItE,WAAW,KACjDxI,EAAQsH,eAAetI,EAAOvD,GAAO,IAAI+M,WAAW,GACtD,CAKA,IACGxJ,EAAO8N,GAAM,GAAGwI,QAAUtW,EAAOvD,GAAO,GAAG4Z,SAC3CrW,EAAOvD,GAAO,GAAGD,IAAIuK,OAAS/G,EAAOvD,GAAO,GAAGF,MAAMwK,QAAU,MAE7D/G,EAAO8N,GAAM,GAAGtR,IAAIuK,OACnB/G,EAAO8N,GAAM,GAAGvR,MAAMwK,OACtB/G,EAAOvD,GAAO,GAAGD,IAAIuK,OACrB/G,EAAOvD,GAAO,GAAGF,MAAMwK,QACzB,GAGF,SAIF0P,EACEzW,EAAO8N,GAAM,GAAGtR,IAAIuK,OAAS/G,EAAO8N,GAAM,GAAGvR,MAAMwK,OAAS,GAC5D/G,EAAOvD,GAAO,GAAGD,IAAIuK,OAAS/G,EAAOvD,GAAO,GAAGF,MAAMwK,OAAS,EAC1D,EACA,EACN,MAAMxK,EAAQ1C,OAAO8G,OAAO,GAAIX,EAAO8N,GAAM,GAAGtR,KAC1CA,EAAM3C,OAAO8G,OAAO,GAAIX,EAAOvD,GAAO,GAAGF,OAC/Coa,GAAUpa,GAAQka,GAClBE,GAAUna,EAAKia,GACfF,EAAkB,CAChBrX,KAAMuX,EAAM,EAAI,iBAAmB,mBACnCla,QACAC,IAAK3C,OAAO8G,OAAO,GAAIX,EAAO8N,GAAM,GAAGtR,MAEzCga,EAAkB,CAChBtX,KAAMuX,EAAM,EAAI,iBAAmB,mBACnCla,MAAO1C,OAAO8G,OAAO,GAAIX,EAAOvD,GAAO,GAAGF,OAC1CC,OAEFuM,EAAO,CACL7J,KAAMuX,EAAM,EAAI,aAAe,eAC/Bla,MAAO1C,OAAO8G,OAAO,GAAIX,EAAO8N,GAAM,GAAGtR,KACzCA,IAAK3C,OAAO8G,OAAO,GAAIX,EAAOvD,GAAO,GAAGF,QAE1C6Y,EAAQ,CACNlW,KAAMuX,EAAM,EAAI,SAAW,WAC3Bla,MAAO1C,OAAO8G,OAAO,GAAI4V,EAAgBha,OACzCC,IAAK3C,OAAO8G,OAAO,GAAI6V,EAAgBha,MAEzCwD,EAAO8N,GAAM,GAAGtR,IAAM3C,OAAO8G,OAAO,GAAI4V,EAAgBha,OACxDyD,EAAOvD,GAAO,GAAGF,MAAQ1C,OAAO8G,OAAO,GAAI6V,EAAgBha,KAC3Dka,EAAa,GAGT1W,EAAO8N,GAAM,GAAGtR,IAAIuK,OAAS/G,EAAO8N,GAAM,GAAGvR,MAAMwK,SACrD2P,EAAa5W,EAAK4W,EAAY,CAC5B,CAAC,QAAS1W,EAAO8N,GAAM,GAAI9M,GAC3B,CAAC,OAAQhB,EAAO8N,GAAM,GAAI9M,MAK9B0V,EAAa5W,EAAK4W,EAAY,CAC5B,CAAC,QAAStB,EAAOpU,GACjB,CAAC,QAASuV,EAAiBvV,GAC3B,CAAC,OAAQuV,EAAiBvV,GAC1B,CAAC,QAAS+H,EAAM/H,KAMlB0V,EAAa5W,EACX4W,EACA/N,EACE3H,EAAQI,OAAOsB,WAAW4S,WAAW5N,KACrC1H,EAAO1C,MAAMwQ,EAAO,EAAGrR,GACvBuE,IAKJ0V,EAAa5W,EAAK4W,EAAY,CAC5B,CAAC,OAAQ3N,EAAM/H,GACf,CAAC,QAASwV,EAAiBxV,GAC3B,CAAC,OAAQwV,EAAiBxV,GAC1B,CAAC,OAAQoU,EAAOpU,KAIdhB,EAAOvD,GAAO,GAAGD,IAAIuK,OAAS/G,EAAOvD,GAAO,GAAGF,MAAMwK,QACvDA,EAAS,EACT2P,EAAa5W,EAAK4W,EAAY,CAC5B,CAAC,QAAS1W,EAAOvD,GAAO,GAAIuE,GAC5B,CAAC,OAAQhB,EAAOvD,GAAO,GAAIuE,MAG7B+F,EAAS,EAEXzH,EAAOU,EAAQ8N,EAAO,EAAGrR,EAAQqR,EAAO,EAAG4I,GAC3Cja,EAAQqR,EAAO4I,EAAWxa,OAAS6K,EAAS,EAC5C,MAORtK,GAAS,EACT,OAASA,EAAQuD,EAAO9D,QACQ,sBAA1B8D,EAAOvD,GAAO,GAAGyC,OACnBc,EAAOvD,GAAO,GAAGyC,KAAO,QAG5B,OAAOc,IA0ET,SAAS2W,GAAU3Q,EAAOe,GACxBf,EAAMyD,QAAU1C,EAChBf,EAAMe,QAAUA,EAChBf,EAAM2D,cAAgB5C,ECvPjB,MAAM6P,GAAW,CACtB1b,KAAM,WACNyJ,SAOF,SAA0BZ,EAASC,EAAIuD,GACrC,IAAIlD,EAAO,EACX,OAcA,SAAe5B,GAMb,OALAsB,EAAQO,MAAM,YACdP,EAAQO,MAAM,kBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,kBACbV,EAAQO,MAAM,oBACPwJ,GAeT,SAASA,EAAKrL,GACZ,OAAIK,EAAWL,IACbsB,EAAQS,QAAQ/B,GACToU,GAEFC,EAAWrU,GAepB,SAASoU,EAAmBpU,GAE1B,OAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAAeO,EAAkBP,IAEjE4B,EAAO,EACA0S,EAAyBtU,IAE3BqU,EAAWrU,GAepB,SAASsU,EAAyBtU,GAChC,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GAChB4B,EAAO,EACA2S,IAKG,KAATvU,GAAwB,KAATA,GAAwB,KAATA,GAAeO,EAAkBP,KAChE4B,IAAS,IAETN,EAAQS,QAAQ/B,GACTsU,IAET1S,EAAO,EACAyS,EAAWrU,IAapB,SAASuU,EAAUvU,GACjB,OAAa,KAATA,GACFsB,EAAQU,KAAK,oBACbV,EAAQO,MAAM,kBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,kBACbV,EAAQU,KAAK,YACNT,GAII,OAATvB,GAA0B,KAATA,GAAwB,KAATA,GAAeS,EAAaT,GACvD8E,EAAI9E,IAEbsB,EAAQS,QAAQ/B,GACTuU,GAaT,SAASF,EAAWrU,GAClB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACTwU,GAELhU,EAAWR,IACbsB,EAAQS,QAAQ/B,GACTqU,GAEFvP,EAAI9E,GAab,SAASwU,EAAiBxU,GACxB,OAAOO,EAAkBP,GAAQyU,EAAWzU,GAAQ8E,EAAI9E,GAa1D,SAASyU,EAAWzU,GAClB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GAChB4B,EAAO,EACA4S,GAEI,KAATxU,GAEFsB,EAAQU,KAAK,oBAAoBvF,KAAO,gBACxC6E,EAAQO,MAAM,kBACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,kBACbV,EAAQU,KAAK,YACNT,GAEFmT,EAAW1U,GAepB,SAAS0U,EAAW1U,GAElB,IAAc,KAATA,GAAeO,EAAkBP,KAAU4B,IAAS,GAAI,CAC3D,MAAMxC,EAAgB,KAATY,EAAc0U,EAAaD,EAExC,OADAnT,EAAQS,QAAQ/B,GACTZ,EAET,OAAO0F,EAAI9E,MCvNR,MAAM2U,GAAW,CACtBlc,KAAM,WACNyJ,SAOF,SAA0BZ,EAASC,EAAIuD,GACrC,MAAMrC,EAAOJ,KAEb,IAAIgI,EAEArQ,EAEAmP,EACJ,OAYA,SAAenJ,GAIb,OAHAsB,EAAQO,MAAM,YACdP,EAAQO,MAAM,gBACdP,EAAQS,QAAQ/B,GACTqL,GAiBT,SAASA,EAAKrL,GACZ,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACTwO,GAEI,KAATxO,GACFsB,EAAQS,QAAQ/B,GACTyO,GAEI,KAATzO,GACFsB,EAAQS,QAAQ/B,GACT4U,GAILvU,EAAWL,IACbsB,EAAQS,QAAQ/B,GACT6U,GAEF/P,EAAI9E,GAiBb,SAASwO,EAAgBxO,GACvB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACT4O,GAEI,KAAT5O,GACFsB,EAAQS,QAAQ/B,GAChBhG,EAAQ,EACD6U,GAELxO,EAAWL,IACbsB,EAAQS,QAAQ/B,GACT8U,GAEFhQ,EAAI9E,GAab,SAAS4O,EAAkB5O,GACzB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACT+U,GAEFjQ,EAAI9E,GAab,SAASgV,EAAQhV,GACf,OAAa,OAATA,EACK8E,EAAI9E,GAEA,KAATA,GACFsB,EAAQS,QAAQ/B,GACTiV,GAELpU,EAAmBb,IACrBmJ,EAAc6L,EACPE,EAAiBlV,KAE1BsB,EAAQS,QAAQ/B,GACTgV,GAaT,SAASC,EAAajV,GACpB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACT+U,GAEFC,EAAQhV,GAajB,SAAS+U,EAAW/U,GAClB,OAAgB,KAATA,EACHjG,EAAIiG,GACK,KAATA,EACAiV,EAAajV,GACbgV,EAAQhV,GAad,SAAS6O,EAAgB7O,GACvB,MAAMpH,EAAQ,SACd,OAAIoH,IAASpH,EAAMmO,WAAW/M,MAC5BsH,EAAQS,QAAQ/B,GACThG,IAAUpB,EAAMa,OAAS0b,EAAQtG,GAEnC/J,EAAI9E,GAab,SAASmV,EAAMnV,GACb,OAAa,OAATA,EACK8E,EAAI9E,GAEA,KAATA,GACFsB,EAAQS,QAAQ/B,GACToV,GAELvU,EAAmBb,IACrBmJ,EAAcgM,EACPD,EAAiBlV,KAE1BsB,EAAQS,QAAQ/B,GACTmV,GAaT,SAASC,EAAWpV,GAClB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACTqV,GAEFF,EAAMnV,GAaf,SAASqV,EAASrV,GAChB,OAAa,KAATA,EACKjG,EAAIiG,GAEA,KAATA,GACFsB,EAAQS,QAAQ/B,GACTqV,GAEFF,EAAMnV,GAaf,SAAS8U,EAAY9U,GACnB,OAAa,OAATA,GAA0B,KAATA,EACZjG,EAAIiG,GAETa,EAAmBb,IACrBmJ,EAAc2L,EACPI,EAAiBlV,KAE1BsB,EAAQS,QAAQ/B,GACT8U,GAaT,SAASF,EAAY5U,GACnB,OAAa,OAATA,EACK8E,EAAI9E,GAEA,KAATA,GACFsB,EAAQS,QAAQ/B,GACTsV,GAELzU,EAAmBb,IACrBmJ,EAAcyL,EACPM,EAAiBlV,KAE1BsB,EAAQS,QAAQ/B,GACT4U,GAaT,SAASU,EAAiBtV,GACxB,OAAgB,KAATA,EAAcjG,EAAIiG,GAAQ4U,EAAY5U,GAa/C,SAASyO,EAAczO,GAErB,OAAIK,EAAWL,IACbsB,EAAQS,QAAQ/B,GACTuV,GAEFzQ,EAAI9E,GAab,SAASuV,EAASvV,GAEhB,OAAa,KAATA,GAAeO,EAAkBP,IACnCsB,EAAQS,QAAQ/B,GACTuV,GAEFC,EAAgBxV,GAazB,SAASwV,EAAgBxV,GACvB,OAAIa,EAAmBb,IACrBmJ,EAAcqM,EACPN,EAAiBlV,IAEtBe,EAAcf,IAChBsB,EAAQS,QAAQ/B,GACTwV,GAEFzb,EAAIiG,GAab,SAAS6U,EAAQ7U,GAEf,OAAa,KAATA,GAAeO,EAAkBP,IACnCsB,EAAQS,QAAQ/B,GACT6U,GAEI,KAAT7U,GAAwB,KAATA,GAAec,EAA0Bd,GACnDyV,EAAezV,GAEjB8E,EAAI9E,GAab,SAASyV,EAAezV,GACtB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACTjG,GAII,KAATiG,GAAwB,KAATA,GAAeK,EAAWL,IAC3CsB,EAAQS,QAAQ/B,GACT0V,GAEL7U,EAAmBb,IACrBmJ,EAAcsM,EACPP,EAAiBlV,IAEtBe,EAAcf,IAChBsB,EAAQS,QAAQ/B,GACTyV,GAEF1b,EAAIiG,GAab,SAAS0V,EAAqB1V,GAE5B,OACW,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACAO,EAAkBP,IAElBsB,EAAQS,QAAQ/B,GACT0V,GAEFC,EAA0B3V,GAcnC,SAAS2V,EAA0B3V,GACjC,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GACT4V,GAEL/U,EAAmBb,IACrBmJ,EAAcwM,EACPT,EAAiBlV,IAEtBe,EAAcf,IAChBsB,EAAQS,QAAQ/B,GACT2V,GAEFF,EAAezV,GAcxB,SAAS4V,EAA4B5V,GACnC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,EAEO8E,EAAI9E,GAEA,KAATA,GAAwB,KAATA,GACjBsB,EAAQS,QAAQ/B,GAChBqK,EAASrK,EACF6V,GAELhV,EAAmBb,IACrBmJ,EAAcyM,EACPV,EAAiBlV,IAEtBe,EAAcf,IAChBsB,EAAQS,QAAQ/B,GACT4V,IAETtU,EAAQS,QAAQ/B,GACT8V,GAaT,SAASD,EAA4B7V,GACnC,OAAIA,IAASqK,GACX/I,EAAQS,QAAQ/B,GAChBqK,OAASlQ,EACF4b,GAEI,OAAT/V,EACK8E,EAAI9E,GAETa,EAAmBb,IACrBmJ,EAAc0M,EACPX,EAAiBlV,KAE1BsB,EAAQS,QAAQ/B,GACT6V,GAaT,SAASC,EAA8B9V,GACrC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,EAEO8E,EAAI9E,GAEA,KAATA,GAAwB,KAATA,GAAec,EAA0Bd,GACnDyV,EAAezV,IAExBsB,EAAQS,QAAQ/B,GACT8V,GAcT,SAASC,EAAiC/V,GACxC,OAAa,KAATA,GAAwB,KAATA,GAAec,EAA0Bd,GACnDyV,EAAezV,GAEjB8E,EAAI9E,GAab,SAASjG,EAAIiG,GACX,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,gBACbV,EAAQU,KAAK,YACNT,GAEFuD,EAAI9E,GAiBb,SAASkV,EAAiBlV,GAKxB,OAJAsB,EAAQU,KAAK,gBACbV,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNgU,EAiBT,SAASA,EAAgBhW,GAGvB,OAAOe,EAAcf,GACjBqB,EACEC,EACA2U,EACA,aACAxT,EAAK9D,OAAOsB,WAAW+E,QAAQC,KAAKC,SAAS,qBACzC/K,EACA,EANNkH,CAOErB,GACFiW,EAAsBjW,GAiB5B,SAASiW,EAAsBjW,GAE7B,OADAsB,EAAQO,MAAM,gBACPsH,EAAYnJ,MC5rBhB,MAAMkW,GAAiB,CAC5Bzd,KAAM,iBACNyJ,SAQF,SAAgCZ,EAASC,EAAIuD,GAC3C,MAAMrC,EAAOJ,KACb,OAYA,SAAerC,GAMb,OALAsB,EAAQO,MAAM,aACdP,EAAQO,MAAM,eACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,eACbV,EAAQU,KAAK,aACNoD,GAIT,SAASA,EAAMpF,GAKb,OAAgB,KAATA,GAAe,2BAA4ByC,EAAK9D,OAAOsB,WAC1D6E,EAAI9E,GACJuB,EAAGvB,KAtCTkG,WAAY6L,GAAS7L,YCJhB,MAAMiQ,GAAkB,CAC7B1d,KAAM,kBACNyJ,SAOF,SAAiCZ,EAASC,EAAIuD,GAC5C,OAaA,SAAe9E,GAGb,OAFAsB,EAAQO,MAAM,mBACdP,EAAQS,QAAQ/B,GACToF,GAcT,SAASA,EAAMpF,GACb,OAAIa,EAAmBb,IACrBsB,EAAQU,KAAK,mBACNT,EAAGvB,IAEL8E,EAAI9E,MC1CR,MAAMoW,GAAW,CACtB3d,KAAM,WACNyJ,SA8EF,SAA0BZ,EAASC,EAAIuD,GAErC,IAEIlD,EAEAtD,EAJAqS,EAAW,EAKf,OAcA,SAAe3Q,GAGb,OAFAsB,EAAQO,MAAM,YACdP,EAAQO,MAAM,oBACPgM,EAAa7N,IAatB,SAAS6N,EAAa7N,GACpB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GAChB2Q,IACO9C,IAETvM,EAAQU,KAAK,oBACNqU,EAAQrW,IAajB,SAASqW,EAAQrW,GAEf,OAAa,OAATA,EACK8E,EAAI9E,GAMA,KAATA,GACFsB,EAAQO,MAAM,SACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,SACNqU,GAII,KAATrW,GACF1B,EAAQgD,EAAQO,MAAM,oBACtBD,EAAO,EACA8O,EAAc1Q,IAEnBa,EAAmBb,IACrBsB,EAAQO,MAAM,cACdP,EAAQS,QAAQ/B,GAChBsB,EAAQU,KAAK,cACNqU,IAIT/U,EAAQO,MAAM,gBACPW,EAAKxC,IAad,SAASwC,EAAKxC,GACZ,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACAa,EAAmBb,IAEnBsB,EAAQU,KAAK,gBACNqU,EAAQrW,KAEjBsB,EAAQS,QAAQ/B,GACTwC,GAaT,SAASkO,EAAc1Q,GAErB,OAAa,KAATA,GACFsB,EAAQS,QAAQ/B,GAChB4B,IACO8O,GAIL9O,IAAS+O,GACXrP,EAAQU,KAAK,oBACbV,EAAQU,KAAK,YACNT,EAAGvB,KAIZ1B,EAAM7B,KAAO,eACN+F,EAAKxC,MA3Nd0F,QAMF,SAAyBnI,GACvB,IAGIvD,EAEA6H,EALAyU,EAAgB/Y,EAAO9D,OAAS,EAChC8c,EAAiB,EAOrB,IACsC,eAAnChZ,EAAOgZ,GAAgB,GAAG9Z,MACU,UAAnCc,EAAOgZ,GAAgB,GAAG9Z,QACO,eAAlCc,EAAO+Y,GAAe,GAAG7Z,MACU,UAAlCc,EAAO+Y,GAAe,GAAG7Z,MAK3B,IAHAzC,EAAQuc,IAGCvc,EAAQsc,GACf,GAA8B,iBAA1B/Y,EAAOvD,GAAO,GAAGyC,KAAyB,CAE5Cc,EAAOgZ,GAAgB,GAAG9Z,KAAO,kBACjCc,EAAO+Y,GAAe,GAAG7Z,KAAO,kBAChC8Z,GAAkB,EAClBD,GAAiB,EACjB,MAMNtc,EAAQuc,EAAiB,EACzBD,IACA,OAAStc,GAASsc,QACFnc,IAAV0H,EACE7H,IAAUsc,GAA2C,eAA1B/Y,EAAOvD,GAAO,GAAGyC,OAC9CoF,EAAQ7H,GAGVA,IAAUsc,GACgB,eAA1B/Y,EAAOvD,GAAO,GAAGyC,OAEjBc,EAAOsE,GAAO,GAAGpF,KAAO,eACpBzC,IAAU6H,EAAQ,IACpBtE,EAAOsE,GAAO,GAAG9H,IAAMwD,EAAOvD,EAAQ,GAAG,GAAGD,IAC5CwD,EAAOV,OAAOgF,EAAQ,EAAG7H,EAAQ6H,EAAQ,GACzCyU,GAAiBtc,EAAQ6H,EAAQ,EACjC7H,EAAQ6H,EAAQ,GAElBA,OAAQ1H,GAGZ,OAAOoD,GAzDPwB,SAgEF,SAAkBiB,GAEhB,OACW,KAATA,GACgD,oBAAhDqC,KAAK9E,OAAO8E,KAAK9E,OAAO9D,OAAS,GAAG,GAAGgD,OCvDpC,MAAM,GAAW,CACtB,GAAMK,EACN,GAAMA,EACN,GAAMA,EACN,GAAMA,EACN,GAAMA,EACN,GAAMA,EACN,GAAMA,EACN,GAAMA,EACN,GAAMA,EACN,GAAMA,EACN,GAAMA,EACN,GAAMA,EACN,GAAMA,EACN,GAAMsO,GAIK9I,GAAiB,CAC5B,GAAMuK,IAIK9G,GAAc,CACzB,EAAE,GAAI0H,GACN,EAAE,GAAIA,GACN,GAAMA,IAIK,GAAO,CAClB,GAAMG,GACN,GAAMxD,EACN,GAAM,CAAC2D,GAAiB3D,GACxB,GAAMgE,GACN,GAAML,GACN,GAAM3D,EACN,GAAMkG,GACN,IAAOA,IAII,GAAS,CACpB,GAAMkB,GACN,GAAMK,IAIK,GAAO,CAClB,EAAE,GAAIC,GACN,EAAE,GAAIA,GACN,EAAE,GAAIA,GACN,GAAM0B,GACN,GAAMhC,GACN,GAAMkC,GACN,GAAM,CAACS,GAAUQ,IACjB,GAAMuB,GACN,GAAM,CAACC,GAAiBtE,IACxB,GAAME,GACN,GAAM2B,GACN,GAAM0C,IAIKvD,GAAa,CACxB5N,KAAM,CAACyO,GAAW,IAIPC,GAAmB,CAC9B1O,KAAM,CAAC,GAAI,KAIAD,GAAU,CACrBC,KAAM,ICpFD,SAASuR,GAAMhe,GACpB,MACMyH,ExCHD,SAA2BwW,GAEhC,MAAM9W,EAAM,GACZ,IAAI3F,GAAS,EAEb,OAASA,EAAQyc,EAAWhd,QAC1BiG,EAAgBC,EAAK8W,EAAWzc,IAGlC,OAAO2F,EwCJL+W,CAAkB,CAAC,MAHJle,GAAW,IAGyBie,YAAc,KAG7D9X,EAAS,CACb0O,QAAS,GACTjJ,KAAM,GACNnE,aACAgC,QAASiI,EAAOjI,GAChB8C,SAAUmF,EAAO,GACjB1F,KAAM0F,EAAO1F,GACb7K,OAAQuQ,EAAOvQ,GACf2M,KAAM4D,EAAO,IAEf,OAAOvL,EAKP,SAASuL,EAAOpE,GACd,OAEA,SAAiB3I,GACf,OAAOiK,EAAgBzI,EAAQmH,EAAS3I,KC/B9C,MAAMwZ,GAAS,cCDR,SAASC,GAAgChe,EAAOie,GACrD,MAAM7W,EAAO0B,OAAOoV,SAASle,EAAOie,GACpC,OAEA7W,EAAO,GAAc,KAATA,GAAeA,EAAO,IAAMA,EAAO,IAE/CA,EAAO,KAAOA,EAAO,KAErBA,EAAO,OAAUA,EAAO,OAExBA,EAAO,OAAUA,EAAO,OACJ,SAAZ,MAAPA,IAAiD,SAAZ,MAAPA,IAE/BA,EAAO,QACE,SAEFmB,OAAO4V,cAAc/W,GC5B9B,MAAMgX,GACJ,oEAcK,SAASC,GAAare,GAC3B,OAAOA,EAAM+T,QAAQqK,GAA4BE,IASnD,SAASA,GAAOC,EAAIC,EAAIC,GACtB,GAAID,EAEF,OAAOA,EAKT,GAAa,KADAC,EAAGtQ,WAAW,GACV,CACf,MAAM4B,EAAO0O,EAAGtQ,WAAW,GACrBuQ,EAAe,MAAT3O,GAAyB,KAATA,EAC5B,OAAOiO,GAAgCS,EAAGxc,MAAMyc,EAAM,EAAI,GAAIA,EAAM,GAAK,IAE3E,OAAO/F,GAA8B8F,IAAOF,ECJvC,SAASI,GAAkB3e,GAEhC,OAAKA,GAA0B,kBAAVA,EAKjB,aAAcA,GAAS,SAAUA,EAC5B4e,GAAS5e,EAAM4e,UAIpB,UAAW5e,GAAS,QAASA,EACxB4e,GAAS5e,GAId,SAAUA,GAAS,WAAYA,EAC1B2K,GAAM3K,GAIR,GAnBE,GA0BX,SAAS2K,GAAMA,GACb,OAAOvJ,GAAMuJ,GAASA,EAAM/D,MAAQ,IAAMxF,GAAMuJ,GAASA,EAAMyD,QAOjE,SAASwQ,GAASC,GAChB,OAAOlU,GAAMkU,GAAOA,EAAI3d,OAAS,IAAMyJ,GAAMkU,GAAOA,EAAI1d,KAO1D,SAASC,GAAMpB,GACb,OAAOA,GAA0B,kBAAVA,EAAqBA,EAAQ,EC4DtD,MAAM8e,GAAM,GAAGpgB,eAyBR,SAASqgB,GAAa/e,EAAOgf,EAAUpf,GAK5C,MAJwB,kBAAbof,IACTpf,EAAUof,EACVA,OAAWzd,GAcf,SAAkB3B,GAEhB,MAAMqf,EAAS,CACbC,WAAY,GACZC,eAAgB,CAAC,WAAY,WAAY,UAAW,YAAa,UACjElW,MAAO,CACLsS,SAAU6D,EAAOC,IACjBC,iBAAkBC,EAClBC,cAAeD,EACfE,WAAYL,EAAO/J,GACnB7C,WAAY4M,EAAO5M,GACnByG,gBAAiBsG,EACjB3G,mBAAoB2G,EACpB7H,WAAY0H,EAAOM,GACnBC,oBAAqBjK,EACrBkK,oBAAqBlK,EACrBb,aAAcuK,EAAOM,EAAUhK,GAC/B8H,SAAU4B,EAAO5B,EAAU9H,GAC3BmK,aAAcN,EACd3V,KAAM2V,EACNO,cAAeP,EACftL,WAAYmL,EAAOnL,GACnB8L,4BAA6BrK,EAC7BsK,sBAAuBtK,EACvBuK,sBAAuBvK,EACvBwK,SAAUd,EAAOc,GACjB3C,gBAAiB6B,EAAOe,GACxBC,kBAAmBhB,EAAOe,GAC1B3K,SAAU4J,EAAOiB,EAAM3K,GACvB4K,aAAcf,EACdxD,SAAUqD,EAAOiB,EAAM3K,GACvB6K,aAAchB,EACdiB,MAAOpB,EAAOoB,IACdxG,MAAOtE,EACP2J,KAAMD,EAAOC,IACboB,SAAUrB,EAAOqB,IACjBC,cAAeC,EACfC,YAAaxB,EAAOlb,GAAM2c,GAC1BC,cAAe1B,EAAOlb,IACtBkR,UAAWgK,EAAOhK,IAClB2L,UAAWC,EACXC,gBAAiBvL,EACjBwL,0BAA2BxL,EAC3ByL,oBAAqBzL,EACrB0L,cAAehC,EAAO/J,GACtBgM,OAAQjC,EAAOiC,IACf7P,cAAe4N,EAAO5N,KAExBpI,KAAM,CACJqW,WAAY6B,IACZC,mBAAoBC,EACpBjG,SAAU+F,IACV9B,cAAeiC,EACfnC,iBAAkBoC,EAClBlP,WAAY8O,IACZK,qBAAsBC,EACtBC,oCAAqCC,EACrCC,gCAAiCD,EACjCE,wBAAyBC,EACzBvK,WAAY4J,EAAOY,GACnBC,gBAAiBC,EACjBzC,oBAAqB0C,EACrBzC,oBAAqB0C,EACrBxC,cAAe8B,EACf/M,aAAcyM,EAAOiB,GACrB/E,SAAU8D,EAAOkB,GACjB3C,aAAc+B,EACdhY,KAAMgY,EACN3N,WAAYqN,IACZvB,4BAA6B0C,EAC7BzC,sBAAuB0C,EACvBzC,sBAAuB0C,EACvBzC,SAAUoB,IACV/D,gBAAiB+D,EAAOsB,GACxBxC,kBAAmBkB,EAAOsB,GAC1BpN,SAAU8L,EAAOuB,GACjBvC,aAAcsB,EACd7F,SAAUuF,EAAOwB,GACjBvC,aAAcqB,EACdpB,MAAOc,EAAOyB,GACd/I,MAAOgJ,EACPC,UAAWC,EACXhK,WAAYiK,EACZ9D,KAAMiC,EAAO8B,GACb3C,SAAUa,IACVV,YAAaU,IACbR,cAAeQ,IACflM,UAAWkM,IACXL,gBAAiBoC,EACjBnC,0BAA2BoC,EAC3BnC,oBAAqBoC,EACrBC,SAAUC,EACVrC,cAAeE,EAAOoC,GACtBC,0BAA2BC,EAC3BC,kBAAmBC,EACnBzC,OAAQC,IACR9P,cAAe8P,MAGnByC,GAAU9E,GAASrf,GAAW,IAAIokB,iBAAmB,IAGrD,MAAMpa,EAAO,GACb,OAAOqa,EAUP,SAASA,EAAQtf,GAEf,IAAIuf,EAAO,CACTrgB,KAAM,OACNE,SAAU,IAGZ,MAAM4B,EAAU,CACdmE,MAAO,CAACoa,GACRC,WAAY,GACZlF,SACAhW,QACAG,OACAsM,SACA0O,SACAxa,QAGIya,EAAY,GAClB,IAAIjjB,GAAS,EACb,OAASA,EAAQuD,EAAO9D,QAGtB,GAC4B,gBAA1B8D,EAAOvD,GAAO,GAAGyC,MACS,kBAA1Bc,EAAOvD,GAAO,GAAGyC,KAEjB,GAAyB,UAArBc,EAAOvD,GAAO,GAChBijB,EAAU5f,KAAKrD,OACV,CAELA,EAAQkjB,EAAY3f,EADP0f,EAAUxd,MACWzF,GAKxC,IADAA,GAAS,IACAA,EAAQuD,EAAO9D,QAAQ,CAC9B,MAAM0jB,EAAUtF,EAAOta,EAAOvD,GAAO,IACjC0d,GAAI3f,KAAKolB,EAAS5f,EAAOvD,GAAO,GAAGyC,OACrC0gB,EAAQ5f,EAAOvD,GAAO,GAAGyC,MAAM1E,KAC7BX,OAAO8G,OACL,CACE2H,eAAgBtI,EAAOvD,GAAO,GAAG6L,gBAEnCtH,GAEFhB,EAAOvD,GAAO,IAMpB,GAAIuE,EAAQwe,WAAWtjB,OAAS,EAAG,CACjC,MAAMmM,EAAOrH,EAAQwe,WAAWxe,EAAQwe,WAAWtjB,OAAS,IAC5CmM,EAAK,IAAMwX,IACnBrlB,KAAKwG,OAASpE,EAAWyL,EAAK,IA2BxC,IAvBAkX,EAAKtF,SAAW,CACd1d,MAAO,GACLyD,EAAO9D,OAAS,EACZ8D,EAAO,GAAG,GAAGzD,MACb,CACE0F,KAAM,EACNwH,OAAQ,EACR1C,OAAQ,IAGhBvK,IAAK,GACHwD,EAAO9D,OAAS,EACZ8D,EAAOA,EAAO9D,OAAS,GAAG,GAAGM,IAC7B,CACEyF,KAAM,EACNwH,OAAQ,EACR1C,OAAQ,KAMlBtK,GAAS,IACAA,EAAQ6d,EAAOC,WAAWre,QACjCqjB,EAAOjF,EAAOC,WAAW9d,GAAO8iB,IAASA,EAE3C,OAAOA,EAST,SAASI,EAAY3f,EAAQzD,EAAOL,GAClC,IAII4f,EAEA3b,EAEA2f,EAEA5S,EAVAzQ,EAAQF,EAAQ,EAChBwjB,GAAoB,EACpBC,GAAa,EASjB,OAASvjB,GAASP,GAAQ,CACxB,MAAMgE,EAAQF,EAAOvD,GACrB,OAAQyD,EAAM,GAAGhB,MACf,IAAK,gBACL,IAAK,cACL,IAAK,aACc,UAAbgB,EAAM,GACR6f,IAEAA,IAEF7S,OAAWtQ,EACX,MAEF,IAAK,kBACc,UAAbsD,EAAM,MAEN4b,GACC5O,GACA6S,GACAD,IAEDA,EAAsBrjB,GAExByQ,OAAWtQ,GAEb,MAEF,IAAK,aACL,IAAK,gBACL,IAAK,iBACL,IAAK,iBACL,IAAK,2BAGH,MAEF,QACEsQ,OAAWtQ,EAGf,IACImjB,GACa,UAAb7f,EAAM,IACY,mBAAlBA,EAAM,GAAGhB,OACY,IAAtB6gB,GACc,SAAb7f,EAAM,KACa,kBAAlBA,EAAM,GAAGhB,MACU,gBAAlBgB,EAAM,GAAGhB,MACb,CACA,GAAI4c,EAAU,CACZ,IAAImE,EAAYxjB,EAEhB,IADA0D,OAAYvD,EACLqjB,KAAa,CAClB,MAAMC,EAAYlgB,EAAOigB,GACzB,GACwB,eAAtBC,EAAU,GAAGhhB,MACS,oBAAtBghB,EAAU,GAAGhhB,KACb,CACA,GAAqB,SAAjBghB,EAAU,GAAe,SACzB/f,IACFH,EAAOG,GAAW,GAAGjB,KAAO,kBAC5B8gB,GAAa,GAEfE,EAAU,GAAGhhB,KAAO,aACpBiB,EAAY8f,OACP,GACiB,eAAtBC,EAAU,GAAGhhB,MACS,qBAAtBghB,EAAU,GAAGhhB,MACS,+BAAtBghB,EAAU,GAAGhhB,MACS,qBAAtBghB,EAAU,GAAGhhB,MACS,mBAAtBghB,EAAU,GAAGhhB,KAIb,MAIF4gB,KACE3f,GAAa2f,EAAsB3f,KAErC2b,EAASqE,SAAU,GAIrBrE,EAAStf,IAAM3C,OAAO8G,OACpB,GACAR,EAAYH,EAAOG,GAAW,GAAG5D,MAAQ2D,EAAM,GAAG1D,KAEpDwD,EAAOV,OAAOa,GAAa1D,EAAO,EAAG,CAAC,OAAQqf,EAAU5b,EAAM,KAC9DzD,IACAP,IAIF,GAAsB,mBAAlBgE,EAAM,GAAGhB,KAA2B,CAEtC,MAAMsG,EAAO,CACXtG,KAAM,WACNihB,SAAS,EACT5jB,MAAO1C,OAAO8G,OAAO,GAAIT,EAAM,GAAG3D,OAElCC,SAAKI,GAEPkf,EAAWtW,EACXxF,EAAOV,OAAO7C,EAAO,EAAG,CAAC,QAAS+I,EAAMtF,EAAM,KAC9CzD,IACAP,IACA4jB,OAAsBljB,EACtBsQ,GAAW,IAKjB,OADAlN,EAAOzD,GAAO,GAAG4jB,QAAUH,EACpB9jB,EAaT,SAASue,EAAO9N,EAAQyT,GACtB,OAAOtS,EAOP,SAASA,EAAK/M,GACZuD,EAAM9J,KAAKsK,KAAM6H,EAAO5L,GAAQA,GAC5Bqf,GAAKA,EAAI5lB,KAAKsK,KAAM/D,IAQ5B,SAASgQ,IACPjM,KAAKK,MAAMrF,KAAK,CACdZ,KAAM,WACNE,SAAU,KAgBd,SAASkF,EAAMrF,EAAM8B,EAAOsf,GACXvb,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAEtBkD,SACfU,KAAKb,GACd6F,KAAKK,MAAMrF,KAAKb,GAChB6F,KAAK0a,WAAW1f,KAAK,CAACiB,EAAOsf,IAC7BphB,EAAKgb,SAAW,CACd1d,MAAO,GAAMwE,EAAMxE,OAEnBC,SAAKI,GAYT,SAAS+f,EAAOyD,GACd,OAAOlL,EAOP,SAASA,EAAMnU,GACTqf,GAAKA,EAAI5lB,KAAKsK,KAAM/D,GACxB0D,EAAKjK,KAAKsK,KAAM/D,IAcpB,SAAS0D,EAAK1D,EAAOuf,GACnB,MAAMrhB,EAAO6F,KAAKK,MAAMjD,MAClB4L,EAAOhJ,KAAK0a,WAAWtd,MAC7B,IAAK4L,EACH,MAAM,IAAIyS,MACR,iBACExf,EAAM7B,KACN,MACA8a,GAAkB,CAChBzd,MAAOwE,EAAMxE,MACbC,IAAKuE,EAAMvE,MAEb,yBAEC,GAAIsR,EAAK,GAAG5O,OAAS6B,EAAM7B,KAChC,GAAIohB,EACFA,EAAY9lB,KAAKsK,KAAM/D,EAAO+M,EAAK,QAC9B,EACWA,EAAK,IAAM+R,IACnBrlB,KAAKsK,KAAM/D,EAAO+M,EAAK,IAGnC7O,EAAKgb,SAASzd,IAAM,GAAMuE,EAAMvE,KAOlC,SAASijB,IACP,OAAO,EAAS3a,KAAKK,MAAMjD,OAW7B,SAASga,IACPpX,KAAKG,KAAKub,6BAA8B,EAO1C,SAASxE,EAAqBjb,GAC5B,GAAI+D,KAAKG,KAAKub,4BAA6B,CACxB1b,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvCK,MAAQ4H,OAAOoV,SAASzU,KAAKwD,eAAevH,GAAQ,IAC7D+D,KAAKG,KAAKub,iCAA8B5jB,GAQ5C,SAAS8gB,IACP,MAAMzY,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvCukB,KAAOxb,EAOd,SAAS0Y,IACP,MAAM1Y,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvCyX,KAAO1O,EAOd,SAASwY,IAEH3Y,KAAKG,KAAKyb,iBACd5b,KAAKiM,SACLjM,KAAKG,KAAKyb,gBAAiB,GAO7B,SAASnD,IACP,MAAMtY,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvCb,MAAQ4J,EAAKmK,QAAQ,2BAA4B,IACtDtK,KAAKG,KAAKyb,oBAAiB9jB,EAO7B,SAASghB,IACP,MAAM3Y,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvCb,MAAQ4J,EAAKmK,QAAQ,eAAgB,IAO5C,SAAS2O,EAA4Bhd,GACnC,MAAMsU,EAAQvQ,KAAK2a,SACbxgB,EAAO6F,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAC5C+C,EAAKoW,MAAQA,EACbpW,EAAKsQ,WAAaJ,GAChBrK,KAAKwD,eAAevH,IACpBtC,cAOJ,SAASuf,IACP,MAAM/Y,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvCykB,MAAQ1b,EAOf,SAAS6Y,IACP,MAAM7Y,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvC0kB,IAAM3b,EAOb,SAAS4X,EAAyB9b,GAChC,MAAM9B,EAAO6F,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAC5C,IAAK+C,EAAK4hB,MAAO,CACf,MAAMA,EAAQ/b,KAAKwD,eAAevH,GAAO7E,OACzC+C,EAAK4hB,MAAQA,GAQjB,SAAS1B,IACPra,KAAKG,KAAK6b,8BAA+B,EAO3C,SAAS7B,EAAgCle,GAC1B+D,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvC2kB,MAAsD,KAA9C/b,KAAKwD,eAAevH,GAAOggB,YAAY,GAAY,EAAI,EAOtE,SAAShC,IACPja,KAAKG,KAAK6b,kCAA+BlkB,EAQ3C,SAASge,EAAY7Z,GACnB,MAEMigB,EAFOlc,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAEtBkD,SACtB,IAAIiJ,EAAO2Y,EAASA,EAAS9kB,OAAS,GACjCmM,GAAsB,SAAdA,EAAKnJ,OAEhBmJ,EAAOU,KACPV,EAAK4R,SAAW,CACd1d,MAAO,GAAMwE,EAAMxE,OAEnBC,SAAKI,GAEPokB,EAASlhB,KAAKuI,IAEhBvD,KAAKK,MAAMrF,KAAKuI,GAQlB,SAAS4U,EAAWlc,GAClB,MAAMsH,EAAOvD,KAAKK,MAAMjD,MACxBmG,EAAKhN,OAASyJ,KAAKwD,eAAevH,GAClCsH,EAAK4R,SAASzd,IAAM,GAAMuE,EAAMvE,KAQlC,SAASgiB,EAAiBzd,GACxB,MAAMC,EAAU8D,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAE/C,GAAI4I,KAAKG,KAAKgc,YAAa,CAIzB,OAHajgB,EAAQ5B,SAAS4B,EAAQ5B,SAASlD,OAAS,GACnD+d,SAASzd,IAAM,GAAMuE,EAAMvE,UAChCsI,KAAKG,KAAKgc,iBAAcrkB,IAIvBkI,KAAKG,KAAK6b,8BACXxG,EAAOE,eAAe7S,SAAS3G,EAAQ9B,QAEvC0b,EAAYpgB,KAAKsK,KAAM/D,GACvBkc,EAAWziB,KAAKsK,KAAM/D,IAS1B,SAASkd,IACPnZ,KAAKG,KAAKgc,aAAc,EAQ1B,SAAS/C,IACP,MAAMjZ,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvCb,MAAQ4J,EAQf,SAASkZ,IACP,MAAMlZ,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvCb,MAAQ4J,EAQf,SAAS4Y,IACP,MAAM5Y,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvCb,MAAQ4J,EAQf,SAASwZ,IACP,MAAMxf,EAAO6F,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAI5C,GAAI4I,KAAKG,KAAKic,YAAa,CAEzB,MAAMC,EAAgBrc,KAAKG,KAAKkc,eAAiB,WACjDliB,EAAKC,MAAQ,YAEbD,EAAKkiB,cAAgBA,SAEdliB,EAAK2hB,WACL3hB,EAAK0hB,kBAGL1hB,EAAKsQ,kBAELtQ,EAAKoW,MAEdvQ,KAAKG,KAAKkc,mBAAgBvkB,EAQ5B,SAASwhB,IACP,MAAMnf,EAAO6F,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAI5C,GAAI4I,KAAKG,KAAKic,YAAa,CAEzB,MAAMC,EAAgBrc,KAAKG,KAAKkc,eAAiB,WACjDliB,EAAKC,MAAQ,YAEbD,EAAKkiB,cAAgBA,SAEdliB,EAAK2hB,WACL3hB,EAAK0hB,kBAGL1hB,EAAKsQ,kBAELtQ,EAAKoW,MAEdvQ,KAAKG,KAAKkc,mBAAgBvkB,EAQ5B,SAAS2hB,EAAgBxd,GACvB,MAAM3E,EAAS0I,KAAKwD,eAAevH,GAC7BqgB,EAAWtc,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAGhDklB,EAAS/L,MAAQqE,GAAatd,GAE9BglB,EAAS7R,WAAaJ,GAAoB/S,GAAQqC,cAQpD,SAAS4f,IACP,MAAMgD,EAAWvc,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAC1Cb,EAAQyJ,KAAK2a,SACbxgB,EAAO6F,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAG5C,GADA4I,KAAKG,KAAKic,aAAc,EACN,SAAdjiB,EAAKC,KAAiB,CAExB,MAAME,EAAWiiB,EAASjiB,SAC1BH,EAAKG,SAAWA,OAEhBH,EAAKE,IAAM9D,EASf,SAASsjB,IACP,MAAM1Z,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvC0kB,IAAM3b,EAQb,SAAS2Z,IACP,MAAM3Z,EAAOH,KAAK2a,SACL3a,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvCykB,MAAQ1b,EAQf,SAAS6Z,IACPha,KAAKG,KAAKic,iBAActkB,EAQ1B,SAASyf,IACPvX,KAAKG,KAAKkc,cAAgB,YAQ5B,SAASzC,EAAsB3d,GAC7B,MAAMsU,EAAQvQ,KAAK2a,SACbxgB,EAAO6F,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GAG5C+C,EAAKoW,MAAQA,EAEbpW,EAAKsQ,WAAaJ,GAChBrK,KAAKwD,eAAevH,IACpBtC,cACFqG,KAAKG,KAAKkc,cAAgB,OAQ5B,SAAShE,EAA+Bpc,GACtC+D,KAAKG,KAAKqc,uBAAyBvgB,EAAM7B,KAO3C,SAASoe,EAA8Bvc,GACrC,MAAMkE,EAAOH,KAAKwD,eAAevH,GAC3B7B,EAAO4F,KAAKG,KAAKqc,uBAEvB,IAAIjmB,EACJ,GAAI6D,EACF7D,EAAQge,GACNpU,EACS,oCAAT/F,EAA6C,GAAK,IAEpD4F,KAAKG,KAAKqc,4BAAyB1kB,MAC9B,CAELvB,EADe2Y,GAA8B/O,GAG/C,MAAMoD,EAAOvD,KAAKK,MAAMjD,MACxBmG,EAAKhN,OAASA,EACdgN,EAAK4R,SAASzd,IAAM,GAAMuE,EAAMvE,KAOlC,SAASugB,EAAuBhc,GAC9Bkc,EAAWziB,KAAKsK,KAAM/D,GACT+D,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvC0kB,IAAM9b,KAAKwD,eAAevH,GAOjC,SAAS+b,EAAoB/b,GAC3Bkc,EAAWziB,KAAKsK,KAAM/D,GACT+D,KAAKK,MAAML,KAAKK,MAAMjJ,OAAS,GACvC0kB,IAAM,UAAY9b,KAAKwD,eAAevH,GAQ7C,SAAS8M,IACP,MAAO,CACL3O,KAAM,aACNE,SAAU,IAKd,SAAS2b,IACP,MAAO,CACL7b,KAAM,OACNuhB,KAAM,KACN9M,KAAM,KACNtY,MAAO,IAKX,SAASwd,IACP,MAAO,CACL3Z,KAAM,aACN7D,MAAO,IAKX,SAASiU,IACP,MAAO,CACLpQ,KAAM,aACNqQ,WAAY,GACZ8F,MAAO,KACPsL,MAAO,KACPC,IAAK,IAKT,SAASrF,IACP,MAAO,CACLrc,KAAM,WACNE,SAAU,IAKd,SAASsR,IACP,MAAO,CACLxR,KAAM,UAEN2hB,MAAO,EACPzhB,SAAU,IAKd,SAASoc,IACP,MAAO,CACLtc,KAAM,SAKV,SAASwc,IACP,MAAO,CACLxc,KAAM,OACN7D,MAAO,IAKX,SAASwgB,KACP,MAAO,CACL3c,KAAM,QACNyhB,MAAO,KACPC,IAAK,GACLzhB,IAAK,MAKT,SAASub,KACP,MAAO,CACLxb,KAAM,OACNyhB,MAAO,KACPC,IAAK,GACLxhB,SAAU,IAQd,SAASG,GAAKwB,GACZ,MAAO,CACL7B,KAAM,OACNqiB,QAAwB,gBAAfxgB,EAAM7B,KACf3C,MAAO,KACPilB,OAAQzgB,EAAMof,QACd/gB,SAAU,IAQd,SAAS0c,GAAS/a,GAChB,MAAO,CACL7B,KAAM,WACNsiB,OAAQzgB,EAAMof,QACdsB,QAAS,KACTriB,SAAU,IAKd,SAASqR,KACP,MAAO,CACLvR,KAAM,YACNE,SAAU,IAKd,SAASsd,KACP,MAAO,CACLxd,KAAM,SACNE,SAAU,IAKd,SAAS2J,KACP,MAAO,CACL7J,KAAM,OACN7D,MAAO,IAKX,SAASwR,KACP,MAAO,CACL3N,KAAM,kBA9iCHwiB,CAASzmB,EAATymB,CClKF,SAAqB1hB,GAC1B,MAAQD,EAAYC,KAGpB,OAAOA,ED+JL2hB,CACE1I,GAAMhe,GAASuM,WAAWxF,MJ1JzB,WACL,IAKI4f,EALAnY,EAAS,EACTsH,EAAS,GAETxU,GAAQ,EAGZ,OAIA,SAAsBlB,EAAOgf,EAAU7d,GAErC,MAAM4M,EAAS,GAEf,IAAI7K,EAEAsD,EAEAZ,EAEA4gB,EAEApf,EAeJ,IAdApH,EACE0V,GACkB,kBAAV1V,EACJA,EAAMpB,WACN,IAAI6nB,YAAYzH,QAAYzd,GAAW+c,OAAOte,IACpD4F,EAAgB,EAChB8P,EAAS,GACLxU,IAE0B,QAAxBlB,EAAMmO,WAAW,IACnBvI,IAEF1E,OAAQK,GAEHqE,EAAgB5F,EAAMa,QAAQ,CAMnC,GALAkd,GAAO2I,UAAY9gB,EACnB1C,EAAQ6a,GAAO4I,KAAK3mB,GACpBwmB,EACEtjB,QAAyB3B,IAAhB2B,EAAM9B,MAAsB8B,EAAM9B,MAAQpB,EAAMa,OAC3DuG,EAAOpH,EAAMmO,WAAWqY,IACnBtjB,EAAO,CACVwS,EAAS1V,EAAMiC,MAAM2D,GACrB,MAEF,GAAa,KAATwB,GAAexB,IAAkB4gB,GAAeD,EAClDxY,EAAOtJ,MAAM,GACb8hB,OAAmBhlB,OAUnB,OARIglB,IACFxY,EAAOtJ,MAAM,GACb8hB,OAAmBhlB,GAEjBqE,EAAgB4gB,IAClBzY,EAAOtJ,KAAKzE,EAAMiC,MAAM2D,EAAe4gB,IACvCpY,GAAUoY,EAAc5gB,GAElBwB,GACN,KAAK,EACH2G,EAAOtJ,KAAK,OACZ2J,IACA,MAEF,KAAK,EAGH,IAFA5H,EAA+B,EAAxBogB,KAAKC,KAAKzY,EAAS,GAC1BL,EAAOtJ,MAAM,GACN2J,IAAW5H,GAAMuH,EAAOtJ,MAAM,GACrC,MAEF,KAAK,GACHsJ,EAAOtJ,MAAM,GACb2J,EAAS,EACT,MAEF,QACEmY,GAAmB,EACnBnY,EAAS,EAIfxI,EAAgB4gB,EAAc,EAOhC,OALIrlB,IACEolB,GAAkBxY,EAAOtJ,MAAM,GAC/BiR,GAAQ3H,EAAOtJ,KAAKiR,GACxB3H,EAAOtJ,KAAK,OAEPsJ,GIgE2B+Y,GAAa9mB,EAAOgf,GAAU,MAyjCpE,SAAS,GAAM+H,GACb,MAAO,CACLngB,KAAMmgB,EAAEngB,KACRwH,OAAQ2Y,EAAE3Y,OACV1C,OAAQqb,EAAErb,QASd,SAASqY,GAAUiD,EAAUnJ,GAC3B,IAAIzc,GAAS,EACb,OAASA,EAAQyc,EAAWhd,QAAQ,CAClC,MAAMb,EAAQ6d,EAAWzc,GACrBlC,MAAMF,QAAQgB,GAChB+jB,GAAUiD,EAAUhnB,GAEpBgH,GAAUggB,EAAUhnB,IAU1B,SAASgH,GAAUggB,EAAUhgB,GAE3B,IAAI1H,EACJ,IAAKA,KAAO0H,EACV,GAAI8X,GAAI3f,KAAK6H,EAAW1H,GACtB,OAAQA,GACN,IAAK,iBAAkB,CACrB,MAAM6H,EAAQH,EAAU1H,GACpB6H,GACF6f,EAAS1nB,GAAKmF,QAAQ0C,GAExB,MAEF,IAAK,aAAc,CACjB,MAAMA,EAAQH,EAAU1H,GACpB6H,GACF6f,EAAS1nB,GAAKmF,QAAQ0C,GAExB,MAEF,IAAK,QACL,IAAK,OAAQ,CACX,MAAMA,EAAQH,EAAU1H,GACpB6H,GACF3I,OAAO8G,OAAO0hB,EAAS1nB,GAAM6H,GAE/B,QASV,SAASqd,GAAetd,EAAMC,GAC5B,MAAID,EACI,IAAIge,MACR,iBACEhe,EAAKrD,KACL,MACA8a,GAAkB,CAChBzd,MAAOgG,EAAKhG,MACZC,IAAK+F,EAAK/F,MAEZ,0BACAgG,EAAMtD,KACN,MACA8a,GAAkB,CAChBzd,MAAOiG,EAAMjG,MACbC,IAAKgG,EAAMhG,MAEb,aAGE,IAAI+jB,MACR,oCACE/d,EAAMtD,KACN,MACA8a,GAAkB,CAChBzd,MAAOiG,EAAMjG,MACbC,IAAKgG,EAAMhG,MAEb,mBE/yCO,SAAS8lB,GAAYrnB,GAGlC,MAAMiK,EAAOJ,KAEbI,EAAK9D,OAKL,SAAgBmhB,GACd,OAAOnI,GAAamI,EAAK,IACpBrd,EAAKD,KAAK,eACVhK,EAIHie,WAAYhU,EAAKD,KAAK,wBAA0B,GAChDoa,gBAAiBna,EAAKD,KAAK,2BAA6B,MCU9D,MAAM,GAAM,GAAGlL,eC5Cf,MAAM,GAAM,GAAGA,eAOR,SAAS,GAAUuf,EAAMjX,GAC9B,IAEI1H,EAFA8B,GAAS,EAKb,GAAI4F,EAAU6W,WACZ,OAASzc,EAAQ4F,EAAU6W,WAAWhd,QACpC,GAAUod,EAAMjX,EAAU6W,WAAWzc,IAIzC,IAAK9B,KAAO0H,EACV,GAAI,GAAI7H,KAAK6H,EAAW1H,GACtB,OAAQA,GACN,IAAK,aAEH,MAIF,IAAK,SAKL,IAAK,OACH,GAAK2e,EAAK3e,GAAM0H,EAAU1H,IAC1B,MAGF,IAAK,WACHsR,GAAIqN,EAAK3e,GAAM0H,EAAU1H,IACzB,MAGF,QAEE2e,EAAKre,QAAQN,GAAO0H,EAAU1H,GAMtC,OAAO2e,EAQT,SAAS,GAAK/W,EAAMC,GACdA,GACFD,EAAKzC,QAAQ0C,GASjB,SAASyJ,GAAI1J,EAAMC,GACbA,GACF3I,OAAO8G,OAAO4B,EAAMC,GChDxB,SAAS,GAAIP,EAAMwJ,EAAG+W,GACpB,MAAO,KAAOA,EAAQ,GAAK,KAAOvgB,ECpB7B,SAASwgB,GAAetd,EAAOud,GACpC,OACEC,GAAYxd,EAAOud,EAAQE,aAAa,KACvCD,GAAYxd,EAAOud,EAAQG,gBAAgB,GAUhD,SAASF,GAAYxd,EAAO5F,EAAMujB,GAKhC,GAJoB,kBAATvjB,IACTA,EAAO,CAACA,KAGLA,GAAwB,IAAhBA,EAAKrD,OAChB,OAAO4mB,EAGT,IAAIrmB,GAAS,EAEb,OAASA,EAAQ8C,EAAKrD,QACpB,GAAIiJ,EAAMwC,SAASpI,EAAK9C,IACtB,OAAO,EAIX,OAAO,ECxBF,SAAS+e,GAAU/P,EAAGsX,EAAIjY,EAAOR,GACtC,IAAI7N,GAAS,EAEb,OAASA,EAAQqO,EAAMkY,OAAO9mB,QAG5B,GACoC,OAAlC4O,EAAMkY,OAAOvmB,GAAOwmB,WACpBR,GAAe3X,EAAM3F,MAAO2F,EAAMkY,OAAOvmB,IAEzC,MAAO,QAAQgB,KAAK6M,EAAK1H,QAAU,GAAK,IAI5C,MAAO,OCpBF,SAASsgB,GAAqBjkB,EAAM6L,GACzC,OAAO9L,SACoB,IAAzB8L,EAAM7P,QAAQkoB,QACZlkB,EAAK5D,QAEJ4D,EAAKwhB,MAEN,WAAWhjB,KAAKwB,EAAK5D,SAEpB,0CAA0CoC,KAAKwB,EAAK5D,QCwD3D,SAAS,GAAI4G,EAAMwJ,EAAG+W,GACpB,OAAQA,EAAQ,GAAK,QAAUvgB,ECnE1B,SAASmhB,GAAWtY,GACzB,MAAMgC,EAAShC,EAAM7P,QAAQooB,OAAS,IAEtC,GAAe,MAAXvW,GAA6B,MAAXA,EACpB,MAAM,IAAIyT,MACR,gCACEzT,EACA,gDAIN,OAAOA,ECEF,SAASyO,GAAStc,EAAMwM,EAAGX,EAAOR,GACvC,MAAMwC,ECdD,SAAuBhC,GAC5B,MAAMgC,EAAShC,EAAM7P,QAAQsgB,UAAY,IAEzC,GAAe,MAAXzO,GAA6B,MAAXA,EACpB,MAAM,IAAIyT,MACR,mCACEzT,EACA,kDAIN,OAAOA,EDGQwW,CAAcxY,GACvBrG,EAAOqG,EAAMxG,MAAM,YACnBif,EAAUzY,EAAM0Y,cAAclZ,GACpC,IAAIjP,EAAQkoB,EAAQE,KAAK3W,GAUzB,OATAzR,GAASkoB,EAAQE,KACf3Y,EAAM4Y,kBAAkBzkB,EAAM,CAC5B2D,OAAQvH,EACRwM,MAAOiF,KACJyW,EAAQ9hB,aAGfpG,GAASkoB,EAAQE,KAAK3W,GACtBrI,IACOpJ,EA3BTkgB,GAASoI,KAoCT,SAAsBlY,EAAGsX,EAAIjY,GAC3B,OAAOA,EAAM7P,QAAQsgB,UAAY,K,2BEjC5B,SAASqI,GAAsB3kB,EAAM6L,GAC1C,IAAI+Y,GAAmB,EAcvB,OAVA,SAAM5kB,GAAM,SAAUA,GACpB,GACG,UAAWA,GAAQ,WAAWxB,KAAKwB,EAAK5D,QAC3B,UAAd4D,EAAKC,KAGL,OADA2kB,GAAmB,EACZ,SAIJ7kB,UACHC,EAAK4hB,OAAS5hB,EAAK4hB,MAAQ,IAC3B,EAAS5hB,KACR6L,EAAM7P,QAAQ6oB,QAAUD,ICrBxB,SAASnI,GAAKzc,GACnB,OAAOA,EAAK5D,OAAS,GCOhB,SAAS,GAAM4D,EAAMwM,EAAGX,EAAOR,GACpC,MAAM+Y,EAAQD,GAAWtY,GACnBiZ,EAAmB,MAAVV,EAAgB,QAAU,aACnC5e,EAAOqG,EAAMxG,MAAM,SACzB,IAAI0f,EAAUlZ,EAAMxG,MAAM,SAC1B,MAAMif,EAAUzY,EAAM0Y,cAAclZ,GACpC,IAAIjP,EAAQkoB,EAAQE,KAAK,MAmDzB,OAlDApoB,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAKE,IAAK,CAACyD,OAAQvH,EAAOwM,MAAO,OAAQ0b,EAAQ9hB,aAE9DpG,GAASkoB,EAAQE,KAAK,MAEtBO,KAII/kB,EAAK2hB,KAAO3hB,EAAK0hB,OAEnB,eAAeljB,KAAKwB,EAAK2hB,MAEzBoD,EAAUlZ,EAAMxG,MAAM,sBACtBjJ,GAASkoB,EAAQE,KAAK,KACtBpoB,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAK2hB,IAAK,CAAChe,OAAQvH,EAAOwM,MAAO,OAAQ0b,EAAQ9hB,aAE9DpG,GAASkoB,EAAQE,KAAK,OAGtBO,EAAUlZ,EAAMxG,MAAM,kBACtBjJ,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAK2hB,IAAK,CACnBhe,OAAQvH,EACRwM,MAAO5I,EAAK0hB,MAAQ,IAAM,OACvB4C,EAAQ9hB,cAKjBuiB,IAEI/kB,EAAK0hB,QACPqD,EAAUlZ,EAAMxG,MAAM,QAAQyf,KAC9B1oB,GAASkoB,EAAQE,KAAK,IAAMJ,GAC5BhoB,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAK0hB,MAAO,CACrB/d,OAAQvH,EACRwM,MAAOwb,KACJE,EAAQ9hB,aAGfpG,GAASkoB,EAAQE,KAAKJ,GACtBW,KAGF3oB,GAASkoB,EAAQE,KAAK,KACtBhf,IAEOpJ,EC3DF,SAAS6oB,GAAejlB,EAAMwM,EAAGX,EAAOR,GAC7C,MAAMpL,EAAOD,EAAKkiB,cACZ1c,EAAOqG,EAAMxG,MAAM,kBACzB,IAAI0f,EAAUlZ,EAAMxG,MAAM,SAC1B,MAAMif,EAAUzY,EAAM0Y,cAAclZ,GACpC,IAAIjP,EAAQkoB,EAAQE,KAAK,MACzB,MAAMtkB,EAAM2L,EAAMmZ,KAAKhlB,EAAKE,IAAK,CAC/ByD,OAAQvH,EACRwM,MAAO,OACJ0b,EAAQ9hB,YAEbpG,GAASkoB,EAAQE,KAAKtkB,EAAM,MAE5B6kB,IAEA,MAAM7e,EAAQ2F,EAAM3F,MACpB2F,EAAM3F,MAAQ,GACd6e,EAAUlZ,EAAMxG,MAAM,aAKtB,MAAM8X,EAAYtR,EAAMmZ,KAAKnZ,EAAMqZ,cAAcllB,GAAO,CACtD2D,OAAQvH,EACRwM,MAAO,OACJ0b,EAAQ9hB,YAeb,OAbAuiB,IACAlZ,EAAM3F,MAAQA,EACdV,IAEa,SAATvF,GAAoBC,GAAOA,IAAQid,EAEnB,aAATld,EAET7D,EAAQA,EAAMiC,MAAM,GAAI,GAExBjC,GAASkoB,EAAQE,KAAK,KALtBpoB,GAASkoB,EAAQE,KAAKrH,EAAY,KAQ7B/gB,EC1CF,SAAS+oB,GAAWnlB,EAAMwM,EAAGX,GAClC,IAAIzP,EAAQ4D,EAAK5D,OAAS,GACtB0R,EAAW,IACXtQ,GAAS,EAKb,KAAO,IAAIe,OAAO,WAAauP,EAAW,YAAYtP,KAAKpC,IACzD0R,GAAY,IAmBd,IAbE,WAAWtP,KAAKpC,KACd,WAAWoC,KAAKpC,IAAU,WAAWoC,KAAKpC,IAAW,QAAQoC,KAAKpC,MAEpEA,EAAQ,IAAMA,EAAQ,OAUfoB,EAAQqO,EAAMkY,OAAO9mB,QAAQ,CACpC,MAAMwmB,EAAU5X,EAAMkY,OAAOvmB,GACvB4nB,EAAavZ,EAAMwZ,eAAe5B,GAExC,IAAInkB,EAKJ,GAAKmkB,EAAQzZ,QAEb,KAAQ1K,EAAQ8lB,EAAWrC,KAAK3mB,IAAS,CACvC,IAAI4e,EAAW1b,EAAM9B,MAIY,KAA/BpB,EAAMmO,WAAWyQ,IACkB,KAAnC5e,EAAMmO,WAAWyQ,EAAW,IAE5BA,IAGF5e,EAAQA,EAAMiC,MAAM,EAAG2c,GAAY,IAAM5e,EAAMiC,MAAMiB,EAAM9B,MAAQ,IAIvE,OAAOsQ,EAAW1R,EAAQ0R,ECxDrB,SAASwX,GAAqBtlB,EAAM6L,GACzC,MAAMyD,EAAM,EAAStP,GAErB,OAAOD,SACJ8L,EAAM7P,QAAQupB,cAEbvlB,EAAK2hB,MAEJ3hB,EAAK0hB,OAEN1hB,EAAKG,UACoB,IAAzBH,EAAKG,SAASlD,QACY,SAA1B+C,EAAKG,SAAS,GAAGF,OAEhBqP,IAAQtP,EAAK2hB,KAAO,UAAYrS,IAAQtP,EAAK2hB,MAE9C,oBAAoBnjB,KAAKwB,EAAK2hB,OAG7B,iBAAiBnjB,KAAKwB,EAAK2hB,MCX3B,SAAS,GAAK3hB,EAAMwM,EAAGX,EAAOR,GACnC,MAAM+Y,EAAQD,GAAWtY,GACnBiZ,EAAmB,MAAVV,EAAgB,QAAU,aACnCE,EAAUzY,EAAM0Y,cAAclZ,GAEpC,IAAI7F,EAEAuf,EAEJ,GAAIO,GAAqBtlB,EAAM6L,GAAQ,CAErC,MAAM3F,EAAQ2F,EAAM3F,MACpB2F,EAAM3F,MAAQ,GACdV,EAAOqG,EAAMxG,MAAM,YACnB,IAAIjJ,EAAQkoB,EAAQE,KAAK,KAWzB,OAVApoB,GAASkoB,EAAQE,KACf3Y,EAAM4Y,kBAAkBzkB,EAAM,CAC5B2D,OAAQvH,EACRwM,MAAO,OACJ0b,EAAQ9hB,aAGfpG,GAASkoB,EAAQE,KAAK,KACtBhf,IACAqG,EAAM3F,MAAQA,EACP9J,EAGToJ,EAAOqG,EAAMxG,MAAM,QACnB0f,EAAUlZ,EAAMxG,MAAM,SACtB,IAAIjJ,EAAQkoB,EAAQE,KAAK,KAsDzB,OArDApoB,GAASkoB,EAAQE,KACf3Y,EAAM4Y,kBAAkBzkB,EAAM,CAC5B2D,OAAQvH,EACRwM,MAAO,QACJ0b,EAAQ9hB,aAGfpG,GAASkoB,EAAQE,KAAK,MACtBO,KAII/kB,EAAK2hB,KAAO3hB,EAAK0hB,OAEnB,eAAeljB,KAAKwB,EAAK2hB,MAEzBoD,EAAUlZ,EAAMxG,MAAM,sBACtBjJ,GAASkoB,EAAQE,KAAK,KACtBpoB,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAK2hB,IAAK,CAAChe,OAAQvH,EAAOwM,MAAO,OAAQ0b,EAAQ9hB,aAE9DpG,GAASkoB,EAAQE,KAAK,OAGtBO,EAAUlZ,EAAMxG,MAAM,kBACtBjJ,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAK2hB,IAAK,CACnBhe,OAAQvH,EACRwM,MAAO5I,EAAK0hB,MAAQ,IAAM,OACvB4C,EAAQ9hB,cAKjBuiB,IAEI/kB,EAAK0hB,QACPqD,EAAUlZ,EAAMxG,MAAM,QAAQyf,KAC9B1oB,GAASkoB,EAAQE,KAAK,IAAMJ,GAC5BhoB,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAK0hB,MAAO,CACrB/d,OAAQvH,EACRwM,MAAOwb,KACJE,EAAQ9hB,aAGfpG,GAASkoB,EAAQE,KAAKJ,GACtBW,KAGF3oB,GAASkoB,EAAQE,KAAK,KAEtBhf,IACOpJ,ECxFF,SAASopB,GAAcxlB,EAAMwM,EAAGX,EAAOR,GAC5C,MAAMpL,EAAOD,EAAKkiB,cACZ1c,EAAOqG,EAAMxG,MAAM,iBACzB,IAAI0f,EAAUlZ,EAAMxG,MAAM,SAC1B,MAAMif,EAAUzY,EAAM0Y,cAAclZ,GACpC,IAAIjP,EAAQkoB,EAAQE,KAAK,KACzB,MAAM1a,EAAO+B,EAAM4Y,kBAAkBzkB,EAAM,CACzC2D,OAAQvH,EACRwM,MAAO,OACJ0b,EAAQ9hB,YAEbpG,GAASkoB,EAAQE,KAAK1a,EAAO,MAE7Bib,IAEA,MAAM7e,EAAQ2F,EAAM3F,MACpB2F,EAAM3F,MAAQ,GACd6e,EAAUlZ,EAAMxG,MAAM,aAKtB,MAAM8X,EAAYtR,EAAMmZ,KAAKnZ,EAAMqZ,cAAcllB,GAAO,CACtD2D,OAAQvH,EACRwM,MAAO,OACJ0b,EAAQ9hB,YAeb,OAbAuiB,IACAlZ,EAAM3F,MAAQA,EACdV,IAEa,SAATvF,GAAoB6J,GAAQA,IAASqT,EAErB,aAATld,EAET7D,EAAQA,EAAMiC,MAAM,GAAI,GAExBjC,GAASkoB,EAAQE,KAAK,KALtBpoB,GAASkoB,EAAQE,KAAKrH,EAAY,KAQ7B/gB,EC/CF,SAASqpB,GAAY5Z,GAC1B,MAAMgC,EAAShC,EAAM7P,QAAQ0pB,QAAU,IAEvC,GAAe,MAAX7X,GAA6B,MAAXA,GAA6B,MAAXA,EACtC,MAAM,IAAIyT,MACR,gCACEzT,EACA,qDAIN,OAAOA,ECXF,SAAS8X,GAAU9Z,GACxB,MAAMgC,EAAShC,EAAM7P,QAAQ4pB,MAAQ,IAErC,GAAe,MAAX/X,GAA6B,MAAXA,GAA6B,MAAXA,EACtC,MAAM,IAAIyT,MACR,gCACEzT,EACA,mDAIN,OAAOA,ERhBT4O,GAAKiI,KAaL,WACE,MAAO,KCTT,GAAMA,KAwEN,WACE,MAAO,KC3ETO,GAAeP,KAuDf,WACE,MAAO,KCzDTS,GAAWT,KAoEX,WACE,MAAO,KEhET,GAAKA,KAsGL,SAAkB1kB,EAAMwM,EAAGX,GACzB,OAAOyZ,GAAqBtlB,EAAM6L,GAAS,IAAM,KC3GnD2Z,GAAcd,KAuDd,WACE,MAAO,KG7CF,MAAMmB,IAGT,E,SAAA,GAAQ,CACN,QACA,SACA,WAEA,WACA,oBACA,QACA,iBACA,aAEA,aACA,OACA,gBAEA,oBAEA,oBACA,SACA,OAEA,kBCpBC,SAASpI,GAAOzd,EAAMwM,EAAGX,EAAOR,GACrC,MAAMwC,ECdD,SAAqBhC,GAC1B,MAAMgC,EAAShC,EAAM7P,QAAQyhB,QAAU,IAEvC,GAAe,MAAX5P,GAA6B,MAAXA,EACpB,MAAM,IAAIyT,MACR,iCACEzT,EACA,gDAIN,OAAOA,EDGQiY,CAAYja,GACrBrG,EAAOqG,EAAMxG,MAAM,UACnBif,EAAUzY,EAAM0Y,cAAclZ,GACpC,IAAIjP,EAAQkoB,EAAQE,KAAK3W,EAASA,GAUlC,OATAzR,GAASkoB,EAAQE,KACf3Y,EAAM4Y,kBAAkBzkB,EAAM,CAC5B2D,OAAQvH,EACRwM,MAAOiF,KACJyW,EAAQ9hB,aAGfpG,GAASkoB,EAAQE,KAAK3W,EAASA,GAC/BrI,IACOpJ,EA3BTqhB,GAAOiH,KAoCP,SAAoBlY,EAAGsX,EAAIjY,GACzB,OAAOA,EAAM7P,QAAQyhB,QAAU,KEvB1B,MAAMsI,GAAS,CACpBC,WrBTK,SAAoBhmB,EAAMwM,EAAGX,EAAOR,GACzC,MAAM7F,EAAOqG,EAAMxG,MAAM,cACnBif,EAAUzY,EAAM0Y,cAAclZ,GACpCiZ,EAAQE,KAAK,MACbF,EAAQlY,MAAM,GACd,MAAMhQ,EAAQyP,EAAMoa,YAClBpa,EAAMqa,cAAclmB,EAAMskB,EAAQ9hB,WAClC,IAGF,OADAgD,IACOpJ,GqBAP+pB,MAAO5J,GACP/Y,KjBPK,SAAcxD,EAAMwM,EAAGX,EAAOR,GACnC,MAAMwC,EkBXD,SAAoBhC,GACzB,MAAMgC,EAAShC,EAAM7P,QAAQoqB,OAAS,IAEtC,GAAe,MAAXvY,GAA6B,MAAXA,EACpB,MAAM,IAAIyT,MACR,+BACEzT,EACA,kDAIN,OAAOA,ElBAQwY,CAAWxa,GACpByD,EAAMtP,EAAK5D,OAAS,GACpB0oB,EAAoB,MAAXjX,EAAiB,cAAgB,QAEhD,GAAIoW,GAAqBjkB,EAAM6L,GAAQ,CACrC,MAAMrG,EAAOqG,EAAMxG,MAAM,gBACnBjJ,EAAQyP,EAAMoa,YAAY3W,EAAK,IAErC,OADA9J,IACOpJ,EAGT,MAAMkoB,EAAUzY,EAAM0Y,cAAclZ,GAC9ByC,EAAWD,EAAOyY,OAAOtD,KAAKhe,ImBtB/B,SAAuB5I,EAAOmqB,GACnC,MAAMC,EAAS7hB,OAAOvI,GACtB,IAAIoB,EAAQgpB,EAAOC,QAAQF,GACvBG,EAAWlpB,EACXmpB,EAAQ,EACR3hB,EAAM,EAEV,GAAyB,kBAAduhB,EACT,MAAM,IAAIK,UAAU,sBAGtB,MAAkB,IAAXppB,GACDA,IAAUkpB,IACNC,EAAQ3hB,IACZA,EAAM2hB,GAGRA,EAAQ,EAGVD,EAAWlpB,EAAQ+oB,EAAUtpB,OAC7BO,EAAQgpB,EAAOC,QAAQF,EAAWG,GAGpC,OAAO1hB,EnBFiC6hB,CAAcvX,EAAKzB,GAAU,EAAG,IAClErI,EAAOqG,EAAMxG,MAAM,cACzB,IAAIjJ,EAAQkoB,EAAQE,KAAK1W,GAEzB,GAAI9N,EAAKwhB,KAAM,CACb,MAAMuD,EAAUlZ,EAAMxG,MAAM,iBAAiByf,KAC7C1oB,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAKwhB,KAAM,CACpB7d,OAAQvH,EACRwM,MAAO,IACPke,OAAQ,CAAC,QACNxC,EAAQ9hB,aAGfuiB,IAGF,GAAI/kB,EAAKwhB,MAAQxhB,EAAK0U,KAAM,CAC1B,MAAMqQ,EAAUlZ,EAAMxG,MAAM,iBAAiByf,KAC7C1oB,GAASkoB,EAAQE,KAAK,KACtBpoB,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAK0U,KAAM,CACpB/Q,OAAQvH,EACRwM,MAAO,KACPke,OAAQ,CAAC,QACNxC,EAAQ9hB,aAGfuiB,IAWF,OARA3oB,GAASkoB,EAAQE,KAAK,MAElBlV,IACFlT,GAASkoB,EAAQE,KAAKlV,EAAM,OAG9BlT,GAASkoB,EAAQE,KAAK1W,GACtBtI,IACOpJ,GiB5CPiU,WGXK,SAAoBrQ,EAAMwM,EAAGX,EAAOR,GACzC,MAAM+Y,EAAQD,GAAWtY,GACnBiZ,EAAmB,MAAVV,EAAgB,QAAU,aACnC5e,EAAOqG,EAAMxG,MAAM,cACzB,IAAI0f,EAAUlZ,EAAMxG,MAAM,SAC1B,MAAMif,EAAUzY,EAAM0Y,cAAclZ,GACpC,IAAIjP,EAAQkoB,EAAQE,KAAK,KAsDzB,OArDApoB,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKnZ,EAAMqZ,cAAcllB,GAAO,CACpC2D,OAAQvH,EACRwM,MAAO,OACJ0b,EAAQ9hB,aAGfpG,GAASkoB,EAAQE,KAAK,OAEtBO,KAIG/kB,EAAK2hB,KAEN,eAAenjB,KAAKwB,EAAK2hB,MAEzBoD,EAAUlZ,EAAMxG,MAAM,sBACtBjJ,GAASkoB,EAAQE,KAAK,KACtBpoB,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAK2hB,IAAK,CAAChe,OAAQvH,EAAOwM,MAAO,OAAQ0b,EAAQ9hB,aAE9DpG,GAASkoB,EAAQE,KAAK,OAGtBO,EAAUlZ,EAAMxG,MAAM,kBACtBjJ,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAK2hB,IAAK,CACnBhe,OAAQvH,EACRwM,MAAO5I,EAAK0hB,MAAQ,IAAM,QACvB4C,EAAQ9hB,cAKjBuiB,IAEI/kB,EAAK0hB,QACPqD,EAAUlZ,EAAMxG,MAAM,QAAQyf,KAC9B1oB,GAASkoB,EAAQE,KAAK,IAAMJ,GAC5BhoB,GAASkoB,EAAQE,KACf3Y,EAAMmZ,KAAKhlB,EAAK0hB,MAAO,CACrB/d,OAAQvH,EACRwM,MAAOwb,KACJE,EAAQ9hB,aAGfpG,GAASkoB,EAAQE,KAAKJ,GACtBW,KAGFvf,IAEOpJ,GHhDPkgB,SAAQ,GACRC,UAAS,GACT9K,QIdK,SAAiBzR,EAAMwM,EAAGX,EAAOR,GACtC,MAAM0b,EAAO/D,KAAKhe,IAAIge,KAAKgE,IAAI,EAAGhnB,EAAK4hB,OAAS,GAAI,GAC9C0C,EAAUzY,EAAM0Y,cAAclZ,GAEpC,GAAIsZ,GAAsB3kB,EAAM6L,GAAQ,CACtC,MAAMrG,EAAOqG,EAAMxG,MAAM,iBACnB0f,EAAUlZ,EAAMxG,MAAM,YACtBjJ,EAAQyP,EAAM4Y,kBAAkBzkB,EAAM,IACvCskB,EAAQ9hB,UACXmB,OAAQ,KACRiF,MAAO,OAKT,OAHAmc,IACAvf,IAGEpJ,EACA,MACU,IAAT2qB,EAAa,IAAM,KAAKT,OAEvBlqB,EAAMa,QAGH+lB,KAAKhe,IAAI5I,EAAM6qB,YAAY,MAAO7qB,EAAM6qB,YAAY,OAAS,IAKtE,MAAMnZ,EAAW,IAAIwY,OAAOS,GACtBvhB,EAAOqG,EAAMxG,MAAM,cACnB0f,EAAUlZ,EAAMxG,MAAM,YAM5Bif,EAAQE,KAAK1W,EAAW,KAExB,IAAI1R,EAAQyP,EAAM4Y,kBAAkBzkB,EAAM,CACxC2D,OAAQ,KACRiF,MAAO,QACJ0b,EAAQ9hB,YAqBb,MAlBI,SAAShE,KAAKpC,KAEhBA,EACE,MACAA,EAAMmO,WAAW,GAAGvP,SAAS,IAAIoV,cACjC,IACAhU,EAAMiC,MAAM,IAGhBjC,EAAQA,EAAQ0R,EAAW,IAAM1R,EAAQ0R,EAErCjC,EAAM7P,QAAQkrB,WAChB9qB,GAAS,IAAM0R,GAGjBiX,IACAvf,IAEOpJ,GJ/CPqgB,KAAI,GACJG,MAAK,GACLqI,eAAc,GACdE,WAAU,GACV1J,KAAI,GACJ+J,cAAa,GACbllB,KKlBK,SAAcN,EAAMmnB,EAAQtb,EAAOR,GACxC,MAAM7F,EAAOqG,EAAMxG,MAAM,QACnB+hB,EAAgBvb,EAAMub,cAE5B,IAAI1B,EAAS1lB,EAAKsiB,QCdb,SAA4BzW,GACjC,MAAMgC,EAAShC,EAAM7P,QAAQqrB,eAAiB,IAE9C,GAAe,MAAXxZ,GAA6B,MAAXA,EACpB,MAAM,IAAIyT,MACR,gCACEzT,EACA,sDAIN,OAAOA,EDGqByZ,CAAmBzb,GAAS4Z,GAAY5Z,GAEpE,MAAM0b,EAAcvnB,EAAKsiB,QACV,MAAXoD,EACE,IACA,IEjBD,SAA0B7Z,GAC/B,MAAM6Z,EAASD,GAAY5Z,GACrB0b,EAAc1b,EAAM7P,QAAQurB,YAElC,IAAKA,EACH,MAAkB,MAAX7B,EAAiB,IAAM,IAGhC,GAAoB,MAAhB6B,GAAuC,MAAhBA,GAAuC,MAAhBA,EAChD,MAAM,IAAIjG,MACR,gCACEiG,EACA,0DAIN,GAAIA,IAAgB7B,EAClB,MAAM,IAAIpE,MACR,uBACEoE,EACA,0BACA6B,EACA,sBAIN,OAAOA,EFRHC,CAAiB3b,GACrB,IAAI4b,KACFN,IAAUtb,EAAM6b,iBAAiBhC,IAAW7Z,EAAM6b,eAEpD,IAAK1nB,EAAKsiB,QAAS,CACjB,MAAMqF,EAAgB3nB,EAAKG,SAAWH,EAAKG,SAAS,QAAKxC,EAqCzD,GAzBc,MAAX+nB,GAA6B,MAAXA,IAEnBiC,GACEA,EAAcxnB,UAAawnB,EAAcxnB,SAAS,IAEZ,SAAxC0L,EAAM3F,MAAM2F,EAAM3F,MAAMjJ,OAAS,IACO,aAAxC4O,EAAM3F,MAAM2F,EAAM3F,MAAMjJ,OAAS,IACO,SAAxC4O,EAAM3F,MAAM2F,EAAM3F,MAAMjJ,OAAS,IACO,aAAxC4O,EAAM3F,MAAM2F,EAAM3F,MAAMjJ,OAAS,IAEiB,IAAlD4O,EAAM+b,WAAW/b,EAAM+b,WAAW3qB,OAAS,IACO,IAAlD4O,EAAM+b,WAAW/b,EAAM+b,WAAW3qB,OAAS,IACO,IAAlD4O,EAAM+b,WAAW/b,EAAM+b,WAAW3qB,OAAS,KAE3CwqB,GAAqB,GAWnB9B,GAAU9Z,KAAW6Z,GAAUiC,EAAe,CAChD,IAAInqB,GAAS,EAEb,OAASA,EAAQwC,EAAKG,SAASlD,QAAQ,CACrC,MAAMsJ,EAAOvG,EAAKG,SAAS3C,GAE3B,GACE+I,GACc,aAAdA,EAAKtG,MACLsG,EAAKpG,UACLoG,EAAKpG,SAAS,IACY,kBAA1BoG,EAAKpG,SAAS,GAAGF,KACjB,CACAwnB,GAAqB,EACrB,SAMJA,IACF/B,EAAS6B,GAGX1b,EAAMub,cAAgB1B,EACtB,MAAMtpB,EAAQyP,EAAMqa,cAAclmB,EAAMqL,GAIxC,OAHAQ,EAAM6b,eAAiBhC,EACvB7Z,EAAMub,cAAgBA,EACtB5hB,IACOpJ,GL9DPygB,SQpBK,SAAkB7c,EAAMmnB,EAAQtb,EAAOR,GAC5C,MAAMwc,ECVD,SAA6Bhc,GAClC,MAAMic,EAAQjc,EAAM7P,QAAQ6rB,gBAAkB,MAE9C,GAAc,QAAVC,GAA6B,QAAVA,GAA6B,UAAVA,EACxC,MAAM,IAAIxG,MACR,gCACEwG,EACA,qEAIN,OAAOA,EDDgBC,CAAoBlc,GAC3C,IAAI6Z,EAAS7Z,EAAMub,eAAiB3B,GAAY5Z,GAG5Csb,GAA0B,SAAhBA,EAAOlnB,MAAmBknB,EAAO7E,UAC7CoD,GAC2B,kBAAjByB,EAAO7pB,OAAsB6pB,EAAO7pB,OAAS,EACjD6pB,EAAO7pB,MACP,KACmC,IAAtCuO,EAAM7P,QAAQgsB,oBACX,EACAb,EAAOhnB,SAASsmB,QAAQzmB,IAC5B0lB,GAGJ,IAAItgB,EAAOsgB,EAAOzoB,OAAS,GAGN,QAAnB4qB,GACoB,UAAnBA,IACGV,GAA0B,SAAhBA,EAAOlnB,MAAmBknB,EAAO5E,QAAWviB,EAAKuiB,WAE/Dnd,EAA6B,EAAtB4d,KAAKC,KAAK7d,EAAO,IAG1B,MAAMkf,EAAUzY,EAAM0Y,cAAclZ,GACpCiZ,EAAQE,KAAKkB,EAAS,IAAIY,OAAOlhB,EAAOsgB,EAAOzoB,SAC/CqnB,EAAQlY,MAAMhH,GACd,MAAMI,EAAOqG,EAAMxG,MAAM,YACnBjJ,EAAQyP,EAAMoa,YAClBpa,EAAMqa,cAAclmB,EAAMskB,EAAQ9hB,YAQpC,SAAaQ,EAAMxF,EAAO+lB,GACxB,GAAI/lB,EACF,OAAQ+lB,EAAQ,GAAK,IAAI+C,OAAOlhB,IAASpC,EAG3C,OAAQugB,EAAQmC,EAASA,EAAS,IAAIY,OAAOlhB,EAAOsgB,EAAOzoB,SAAW+F,KARxE,OAFAwC,IAEOpJ,GRfPoV,UUzBK,SAAmBxR,EAAMwM,EAAGX,EAAOR,GACxC,MAAM7F,EAAOqG,EAAMxG,MAAM,aACnB0f,EAAUlZ,EAAMxG,MAAM,YACtBjJ,EAAQyP,EAAM4Y,kBAAkBzkB,EAAMqL,GAG5C,OAFA0Z,IACAvf,IACOpJ,GVoBP6rB,KWxBK,SAAcjoB,EAAMwM,EAAGX,EAAOR,GAEnC,MAAM6c,EAAcloB,EAAKG,SAASgoB,MAAK,SAAUhF,GAC/C,OAAO0C,GAAS1C,MAGlB,OADW+E,EAAcrc,EAAM4Y,kBAAoB5Y,EAAMqa,eAC/C3qB,KAAKsQ,EAAO7L,EAAMqL,IXmB5BoS,OAAM,GACN3T,KY5BK,SAAc9J,EAAMwM,EAAGX,EAAOR,GACnC,OAAOQ,EAAMmZ,KAAKhlB,EAAK5D,MAAOiP,IZ4B9BuC,ca5BK,SAAuBpB,EAAGsX,EAAIjY,GACnC,MAAMzP,GACJupB,GAAU9Z,IAAUA,EAAM7P,QAAQosB,WAAa,IAAM,KACrD9B,OCTG,SAA6Bza,GAClC,MAAMwc,EAAaxc,EAAM7P,QAAQssB,gBAAkB,EAEnD,GAAID,EAAa,EACf,MAAM,IAAI/G,MACR,2CACE+G,EACA,wDAIN,OAAOA,EDFEE,CAAoB1c,IAE7B,OAAOA,EAAM7P,QAAQosB,WAAahsB,EAAMiC,MAAM,GAAI,GAAKjC,IEZ5CgC,GAAO,CAGpB,SAAsBkF,EAAMC,EAAO4jB,EAAQtb,GAEzC,GACiB,SAAftI,EAAMtD,MACNgkB,GAAqB1gB,EAAOsI,KACb,SAAdvI,EAAKrD,MACHqD,EAAKrD,OAASsD,EAAMtD,MAAQgkB,GAAqB3gB,EAAMuI,IAE1D,OAAO,EAKT,GAAI,WAAYsb,GAAmC,mBAAlBA,EAAO5E,OAAsB,CAC5D,GACgB,cAAdjf,EAAKrD,OAEJqD,EAAKrD,OAASsD,EAAMtD,MACJ,eAAfsD,EAAMtD,MAEU,YAAfsD,EAAMtD,MAAsB0kB,GAAsBphB,EAAOsI,IAE5D,OAGF,OAAOsb,EAAO5E,OAAS,EAAI,KCvB/B,MAAMiG,GAAoB,CACxB,WACA,qBACA,iBACA,YACA,aACA,mBAIWzE,GAAS,CACpB,CAACC,UAAW,KAAMpb,MAAO,WAAY+a,YAAa,YAClD,CAACK,UAAW,KAAMrgB,OAAQ,WAAYggB,YAAa,YACnD,CACEK,UAAW,KACXL,YAAa,CAAC,4BAA6B,wBAE7C,CACEK,UAAW,KACXL,YAAa,CACX,4BACA,sBACA,4BACA,sBACA,qBACA,eAGJ,CACEK,UAAW,KACXL,YAAa,CACX,4BACA,sBACA,4BACA,sBACA,qBACA,eAGJ,CAACK,UAAW,IAAKpb,MAAO,WAAY+a,YAAa,YACjD,CAACK,UAAW,IAAKrgB,OAAQ,WAAYggB,YAAa,YAClD,CACEK,UAAW,IACXL,YAAa,CAAC,4BAA6B,wBAI7C,CACEK,UAAW,IACXpb,MAAO,MACP+a,YAAa,WACbC,eAAgB4E,IAGlB,CAACxE,UAAW,IAAKL,YAAa,cAE9B,CAAC3Z,SAAS,EAAMga,UAAW,KAC3B,CAACA,UAAW,IAAKL,YAAa,aAAc/a,MAAO,gBAGnD,CAACob,UAAW,IAAKpb,MAAO,YAAa+a,YAAa,YAElD,CAACK,UAAW,IAAKL,YAAa,mBAE9B,CAACK,UAAW,IAAKL,YAAa,kBAE9B,CACEhgB,OAAQ,MACRqgB,UAAW,IACXL,YAAa,WACbC,eAAgB4E,IAIlB,CAACxe,SAAS,EAAMrG,OAAQ,OAAQqgB,UAAW,KAC3C,CAACA,UAAW,IAAKL,YAAa,kBAE9B,CAAC3Z,SAAS,EAAMga,UAAW,IAAKpb,MAAO,kBACvC,CAACob,UAAW,IAAKL,YAAa,WAAYC,eAAgB4E,IAE1D,CAACxe,SAAS,EAAMga,UAAW,IAAKpb,MAAO,iBAGvC,CAACoB,SAAS,EAAMga,UAAW,IAAKpb,MAAO,kBAEvC,CAACoB,SAAS,EAAMrG,OAAQ,OAAQqgB,UAAW,IAAKpb,MAAO,mBAOvD,CAACoB,SAAS,EAAMga,UAAW,IAAKpb,MAAO,eACvC,CACEob,UAAW,IACXpb,MAAO,cACP+a,YAAa,WACbC,eAAgB4E,IAElB,CAACxE,UAAW,IAAKL,YAAa,sBAE9B,CAAC3Z,SAAS,EAAMga,UAAW,KAG3B,CAACha,SAAS,EAAMga,UAAW,KAC3B,CAACA,UAAW,IAAKL,YAAa,sBAG9B,CAAC3Z,SAAS,EAAMga,UAAW,KAC3B,CAACA,UAAW,IAAKL,YAAa,WAAYC,eAAgB4E,IAC1D,CAACxE,UAAW,IAAKL,YAAa,CAAC,QAAS,cAIxC,CAACK,UAAW,KAAMpb,MAAO,WAAY+a,YAAa,YAElD,CAACK,UAAW,IAAKL,YAAa,CAAC,QAAS,cAGxC,CAAC3Z,SAAS,EAAMga,UAAW,KAC3B,CAACA,UAAW,IAAKL,YAAa,WAAYC,eAAgB4E,IAG1D,CAACxe,SAAS,EAAMga,UAAW,KAC3B,CACEA,UAAW,IACXL,YAAa,CAAC,4BAA6B,8BAE7C,CAACK,UAAW,IAAKL,YAAa,WAAYC,eAAgB4E,IAI1D,CAACxe,SAAS,EAAMga,UAAW,MCvHtB,SAASyE,GAAYzoB,GAC1B,OAAIA,EAAKoW,QAAUpW,EAAKsQ,WACftQ,EAAKoW,OAAS,GAGhBqE,GAAaza,EAAKsQ,YCxBpB,SAAS+U,GAAe5B,GAC7B,IAAKA,EAAQiF,UAAW,CACtB,MAAM/kB,GACH8f,EAAQzZ,QAAU,kBAAoB,KACtCyZ,EAAQ9f,OAAS,MAAQ8f,EAAQ9f,OAAS,IAAM,IAEnD8f,EAAQiF,UAAY,IAAInqB,QACrBoF,EAAS,IAAMA,EAAS,IAAM,KAC5B,sBAAsBnF,KAAKilB,EAAQO,WAAa,KAAO,IACxDP,EAAQO,WACPP,EAAQ7a,MAAQ,MAAQ6a,EAAQ7a,MAAQ,IAAM,IACjD,KAIJ,OAAO6a,EAAQiF,UC2CjB,SAAS7O,GAAQvW,EAAMC,EAAO4jB,EAAQtb,GACpC,IAAIrO,EAAQqO,EAAMzN,KAAKnB,OAEvB,KAAOO,KAAS,CACd,MAAMC,EAASoO,EAAMzN,KAAKZ,GAAO8F,EAAMC,EAAO4jB,EAAQtb,GAEtD,IAAe,IAAXpO,GAA8B,IAAXA,EACrB,MAGF,GAAsB,kBAAXA,EACT,MAAO,KAAK6oB,OAAO,EAAI7oB,GAGzB,IAAe,IAAXA,EACF,MAAO,wBAIX,MAAO,OChFT,MAAMkrB,GAAM,YAKL,SAAS1C,GAAY7pB,EAAO4Q,GAEjC,MAAMvP,EAAS,GACf,IAGI6B,EAHAhC,EAAQ,EACR0F,EAAO,EAIX,KAAQ1D,EAAQqpB,GAAI5F,KAAK3mB,IACvBwD,EAAIxD,EAAMiC,MAAMf,EAAOgC,EAAM9B,QAC7BC,EAAOoD,KAAKvB,EAAM,IAClBhC,EAAQgC,EAAM9B,MAAQ8B,EAAM,GAAGrC,OAC/B+F,IAKF,OAFApD,EAAIxD,EAAMiC,MAAMf,IAETG,EAAOW,KAAK,IAKnB,SAASwB,EAAIxD,GACXqB,EAAOoD,KAAKmM,EAAI5Q,EAAO4G,GAAO5G,KC0GlC,SAASwsB,GAAUC,EAAGC,GACpB,OAAOD,EAAIC,EAQb,SAASC,GAAkB3sB,EAAOwM,GAChC,MAAMwc,EAAa,wBAEb4D,EAAY,GAEZC,EAAU,GACVC,EAAQ9sB,EAAQwM,EACtB,IAGItJ,EAHA9B,GAAS,EACTF,EAAQ,EAIZ,KAAQgC,EAAQ8lB,EAAWrC,KAAKmG,IAC9BF,EAAUnoB,KAAKvB,EAAM9B,OAGvB,OAASA,EAAQwrB,EAAU/rB,QACrBK,IAAU0rB,EAAUxrB,IACtByrB,EAAQpoB,KAAKzE,EAAMiC,MAAMf,EAAO0rB,EAAUxrB,KAG5CyrB,EAAQpoB,KAAK,MACbvD,EAAQ0rB,EAAUxrB,GAKpB,OAFAyrB,EAAQpoB,KAAKzE,EAAMiC,MAAMf,IAElB2rB,EAAQ7qB,KAAK,IClKf,SAAS+qB,GAAM9N,GAIpB,MAAMrf,EAAUqf,GAAU,GACpBxT,EAAM7L,EAAQ6L,KAAO,GAC3B,IAAIuhB,EAAYptB,EAAQotB,WAAa,EACjCpmB,EAAO6E,EAAI7E,MAAQ,EACnBwH,EAAS3C,EAAI2C,QAAU,EAE3B,MAAO,CAACga,KAyBR,SAAc6E,GAEZ,MAAMjtB,EAAQitB,GAAS,GACjBlf,EAAS/N,EAAMgB,MAAM,aACrBgM,EAAOe,EAAOA,EAAOlN,OAAS,GAIpC,OAHA+F,GAAQmH,EAAOlN,OAAS,EACxBuN,EACoB,IAAlBL,EAAOlN,OAAeuN,EAASpB,EAAKnM,OAAS,EAAImM,EAAKnM,OAASmsB,EAC1DhtB,GAjCKoG,QAOd,WACE,MAAO,CAACqF,IAAK,CAAC7E,OAAMwH,UAAS4e,cARRhd,MAgBvB,SAAehQ,GACbgtB,GAAahtB,ICHV,SAASktB,GAAWhJ,EAAMtkB,EAAU,IAEzC,MAAM6P,EAAQ,CACZxG,MAkDF,SAAepJ,GAEb,OADA4P,EAAM3F,MAAMrF,KAAK5E,GAMjB,WACE4P,EAAM3F,MAAMjD,QAzDdgjB,YAAW,GACXf,cAAeuD,GACfhE,kBAAmB8E,GACnBrD,cAAesD,GACfjF,cAAe4E,GACf9D,eAAc,GACdL,KAAMyE,GACNvjB,MAAO,GACP6d,OAAQ,IAAIA,IACZ3lB,KAAM,IAAIA,IAGVsrB,SAAU,IAAI3D,IACd/pB,QAAS,GACT4rB,WAAY,GAEZ7B,YAAQpoB,GAGV,GAAUkO,EAAO7P,GAEb6P,EAAM7P,QAAQ2tB,kBAChB9d,EAAMzN,KAAKyC,KAAK+oB,IAGlB/d,EAAMka,O9CFD,SAAgBrqB,EAAKM,GAC1B,MAAM2D,EAAW3D,GAAW,GA8B5B,SAAS4D,EAAIxD,KAAUqE,GAErB,IAAIopB,EAAKjqB,EAAIkqB,QACb,MAAMJ,EAAW9pB,EAAI8pB,SAErB,GAAIttB,GAAS,GAAIb,KAAKa,EAAOV,GAAM,CAEjC,MAAMquB,EAAKplB,OAAOvI,EAAMV,IAExBmuB,EAAK,GAAItuB,KAAKmuB,EAAUK,GAAML,EAASK,GAAMnqB,EAAIoqB,QAGnD,GAAIH,EACF,OAAOA,EAAGtuB,KAAKsK,KAAMzJ,KAAUqE,GASnC,OALAb,EAAI8pB,SAAW/pB,EAAS+pB,UAAY,GACpC9pB,EAAIkqB,QAAUnqB,EAASmqB,QACvBlqB,EAAIoqB,QAAUrqB,EAASqqB,QAGhBpqB,E8CnDQqqB,CAAO,OAAQ,CAC5BH,WACAE,WACAN,SAAU7d,EAAM6d,WAGlB,IAAIjsB,EAASoO,EAAMka,OAAOzF,OAAM3iB,EAAWkO,EAAO,CAChDlI,OAAQ,KACRiF,MAAO,KACPf,IAAK,CAAC7E,KAAM,EAAGwH,OAAQ,GACvB4e,UAAW,IAWb,OAPE3rB,GACyC,KAAzCA,EAAO8M,WAAW9M,EAAOR,OAAS,IACO,KAAzCQ,EAAO8M,WAAW9M,EAAOR,OAAS,KAElCQ,GAAU,MAGLA,EAoBT,SAASqsB,GAAQ1tB,GACf,MAAM,IAAIklB,MAAM,wBAA0BllB,EAAQ,oBAOpD,SAAS4tB,GAAQ5tB,GAGf,MAAM,IAAIklB,MAAM,+BADkB,EACoBrhB,KAAO,KAI/D,SAAS2pB,GAAetmB,EAAMC,GAE5B,GAAkB,eAAdD,EAAKrD,MAAyBqD,EAAKrD,OAASsD,EAAMtD,KACpD,OAAO,EAkBX,SAASspB,GAAuBpC,EAAQ9b,GACtC,OC1HK,SAA2B8b,EAAQtb,EAAOR,GAC/C,MAAMuc,EAAa/b,EAAM+b,WACnBznB,EAAWgnB,EAAOhnB,UAAY,GAE9B8oB,EAAU,GAChB,IAAIzrB,GAAS,EACTmG,EAAS0H,EAAK1H,OAElBikB,EAAW/mB,MAAM,GACjB,IAAIyjB,EAAUzY,EAAM0Y,cAAclZ,GAElC,OAAS7N,EAAQ2C,EAASlD,QAAQ,CAChC,MAAMitB,EAAQ/pB,EAAS3C,GAEvB,IAAIoL,EAIJ,GAFAgf,EAAWA,EAAW3qB,OAAS,GAAKO,EAEhCA,EAAQ,EAAI2C,EAASlD,OAAQ,CAG/B,IAAI8oB,EAASla,EAAMka,OAAO2D,SAASvpB,EAAS3C,EAAQ,GAAGyC,MAGnD8lB,GAAUA,EAAOrB,OAAMqB,EAASA,EAAOrB,MAC3C9b,EAAQmd,EACJA,EAAO5lB,EAAS3C,EAAQ,GAAI2pB,EAAQtb,EAAO,CACzClI,OAAQ,GACRiF,MAAO,MACJ0b,EAAQ9hB,YACVtE,OAAO,GACV,QAEJ0K,EAAQyC,EAAKzC,MAUbqgB,EAAQhsB,OAAS,IACL,OAAX0G,GAA8B,OAAXA,IACL,SAAfumB,EAAMjqB,OAENgpB,EAAQA,EAAQhsB,OAAS,GAAKgsB,EAAQA,EAAQhsB,OAAS,GAAGkT,QACxD,cACA,KAEFxM,EAAS,IAGT2gB,EAAUzY,EAAM0Y,cAAclZ,GAC9BiZ,EAAQE,KAAKyE,EAAQ7qB,KAAK,MAG5B6qB,EAAQpoB,KACNyjB,EAAQE,KACN3Y,EAAMka,OAAOmE,EAAO/C,EAAQtb,EAAO,IAC9ByY,EAAQ9hB,UACXmB,SACAiF,YAKNjF,EAASslB,EAAQA,EAAQhsB,OAAS,GAAGoB,OAAO,GAK9C,OAFAupB,EAAW3kB,MAEJgmB,EAAQ7qB,KAAK,IDiDbqmB,CAAkB0C,EAAQthB,KAAMwF,GAkBzC,SAASme,GAAmBrC,EAAQ9b,GAClC,OJjJK,SAAuB8b,EAAQtb,EAAOR,GAC3C,MAAMuc,EAAa/b,EAAM+b,WACnBznB,EAAWgnB,EAAOhnB,UAAY,GAC9BmkB,EAAUzY,EAAM0Y,cAAclZ,GAE9B4d,EAAU,GAChB,IAAIzrB,GAAS,EAIb,IAFAoqB,EAAW/mB,MAAM,KAERrD,EAAQ2C,EAASlD,QAAQ,CAChC,MAAMitB,EAAQ/pB,EAAS3C,GAEvBoqB,EAAWA,EAAW3qB,OAAS,GAAKO,EAEpCyrB,EAAQpoB,KACNyjB,EAAQE,KACN3Y,EAAMka,OAAOmE,EAAO/C,EAAQtb,EAAO,CACjClI,OAAQ,KACRiF,MAAO,QACJ0b,EAAQ9hB,cAKE,SAAf0nB,EAAMjqB,OACR4L,EAAM6b,oBAAiB/pB,GAGrBH,EAAQ2C,EAASlD,OAAS,GAC5BgsB,EAAQpoB,KACNyjB,EAAQE,KAAK3K,GAAQqQ,EAAO/pB,EAAS3C,EAAQ,GAAI2pB,EAAQtb,KAO/D,OAFA+b,EAAW3kB,MAEJgmB,EAAQ7qB,KAAK,II2Gb8nB,CAAciB,EAAQthB,KAAMwF,GA4BrC,SAASoe,GAAUrtB,EAAOif,GACxB,OF/JK,SAAcxP,EAAOwd,EAAOhO,GACjC,MAAMjf,GAASif,EAAO1X,QAAU,KAAO0lB,GAAS,KAAOhO,EAAOzS,OAAS,IAEjEogB,EAAY,GAEZvrB,EAAS,GAET0sB,EAAQ,GACd,IAAI3sB,GAAS,EAEb,OAASA,EAAQqO,EAAMkY,OAAO9mB,QAAQ,CACpC,MAAMwmB,EAAU5X,EAAMkY,OAAOvmB,GAE7B,IAAKgmB,GAAe3X,EAAM3F,MAAOud,GAC/B,SAGF,MAAM2B,EAAavZ,EAAMwZ,eAAe5B,GAExC,IAAInkB,EAEJ,KAAQA,EAAQ8lB,EAAWrC,KAAK3mB,IAAS,CACvC,MAAMuH,EAAS,WAAY8f,GAAW1jB,QAAQ0jB,EAAQzZ,SAChDpB,EAAQ,UAAW6a,EACnBzI,EAAW1b,EAAM9B,OAASmG,EAASrE,EAAM,GAAGrC,OAAS,GAEvD+rB,EAAUtgB,SAASsS,IACjBmP,EAAMnP,GAAUrX,SAAWA,IAC7BwmB,EAAMnP,GAAUrX,QAAS,GAGvBwmB,EAAMnP,GAAUpS,QAAUA,IAC5BuhB,EAAMnP,GAAUpS,OAAQ,KAG1BogB,EAAUnoB,KAAKma,GACfmP,EAAMnP,GAAY,CAACrX,SAAQiF,WAKjCogB,EAAUoB,KAAKxB,IAEf,IAAItrB,EAAQ+d,EAAO1X,OAAS0X,EAAO1X,OAAO1G,OAAS,EACnD,MAAMM,EAAMnB,EAAMa,QAAUoe,EAAOzS,MAAQyS,EAAOzS,MAAM3L,OAAS,GAGjE,IAFAO,GAAS,IAEAA,EAAQwrB,EAAU/rB,QAAQ,CACjC,MAAM+d,EAAWgO,EAAUxrB,GAGvBwd,EAAW1d,GAAS0d,GAAYzd,GAQjCyd,EAAW,EAAIzd,GACdyrB,EAAUxrB,EAAQ,KAAOwd,EAAW,GACpCmP,EAAMnP,GAAUpS,QACfuhB,EAAMnP,EAAW,GAAGrX,SACpBwmB,EAAMnP,EAAW,GAAGpS,OACtBogB,EAAUxrB,EAAQ,KAAOwd,EAAW,GACnCmP,EAAMnP,GAAUrX,SACfwmB,EAAMnP,EAAW,GAAGrX,SACpBwmB,EAAMnP,EAAW,GAAGpS,QAKrBtL,IAAU0d,GAIZvd,EAAOoD,KAAKkoB,GAAkB3sB,EAAMiC,MAAMf,EAAO0d,GAAW,OAG9D1d,EAAQ0d,GAGN,iBAAiBxc,KAAKpC,EAAM8B,OAAO8c,KACjCK,EAAOyL,QAAWzL,EAAOyL,OAAOpe,SAAStM,EAAM8B,OAAO8c,KAMxDvd,EAAOoD,KACL,MAAQzE,EAAMmO,WAAWyQ,GAAUhgB,SAAS,IAAIoV,cAAgB,KAElE9S,KANAG,EAAOoD,KAAK,OAYhB,OAFApD,EAAOoD,KAAKkoB,GAAkB3sB,EAAMiC,MAAMf,EAAOC,GAAM8d,EAAOzS,QAEvDnL,EAAOW,KAAK,IE6DZ4mB,CAAKnf,KAAMzJ,EAAOif,GE1KZ,SAASgP,GAAgBruB,GAGtC,MAAMiK,EAAOJ,KAEbI,EAAKwc,SAKL,SAAkBnC,GAChB,OAAOgJ,GAAWhJ,EAAM,IACnBra,EAAKD,KAAK,eACVhK,EAIHie,WAAYhU,EAAKD,KAAK,yBAA2B,MC/BhD,SAASskB,GAAKC,GACnB,GAAIA,EACF,MAAMA,E,gBCTK,SAAS/uB,GAAcY,GACrC,GAAqB,kBAAVA,GAAgC,OAAVA,EAChC,OAAO,EAGR,MAAMvB,EAAYD,OAAO4vB,eAAepuB,GACxC,OAAsB,OAAdvB,GAAsBA,IAAcD,OAAOC,WAAkD,OAArCD,OAAO4vB,eAAe3vB,OAA0B4vB,OAAOC,eAAetuB,MAAYquB,OAAOE,YAAYvuB,GCgC/J,SAASwuB,KAEd,MAAMC,EAAM,GAENC,EAAW,CAACC,IAKlB,YAAgB3qB,GACd,IAAI4qB,GAAmB,EAEvB,MAAMC,EAAW7qB,EAAO6C,MAExB,GAAwB,oBAAbgoB,EACT,MAAM,IAAIrE,UAAU,2CAA6CqE,IAWnE,SAASroB,EAAK2nB,KAAUW,GACtB,MAAMrB,EAAKgB,IAAMG,GACjB,IAAIxtB,GAAS,EAEb,GAAI+sB,EACFU,EAASV,OADX,CAMA,OAAS/sB,EAAQ4C,EAAOnD,QACA,OAAlBiuB,EAAO1tB,SAAqCG,IAAlButB,EAAO1tB,KACnC0tB,EAAO1tB,GAAS4C,EAAO5C,IAK3B4C,EAAS8qB,EAGLrB,EAqDH,SAAcsB,EAAYF,GAE/B,IAAItgB,EAEJ,OAAOygB,EAQP,SAASA,KAAW3qB,GAClB,MAAM4qB,EAAoBF,EAAWluB,OAASwD,EAAWxD,OAEzD,IAAIQ,EAEA4tB,GACF5qB,EAAWI,KAAKyqB,GAGlB,IACE7tB,EAAS0tB,EAAWI,MAAM1lB,KAAMpF,GAChC,MAAO8pB,GACP,MAAMiB,EAAiC,EAMvC,GAAIH,GAAqB1gB,EACvB,MAAM6gB,EAGR,OAAOF,EAAKE,GAGTH,IACC5tB,GAAUA,EAAOguB,MAA+B,oBAAhBhuB,EAAOguB,KACzChuB,EAAOguB,KAAKA,EAAMH,GACT7tB,aAAkB6jB,MAC3BgK,EAAK7tB,GAELguB,EAAKhuB,IAUX,SAAS6tB,EAAKf,KAAUW,GACjBvgB,IACHA,GAAS,EACTsgB,EAASV,KAAUW,IASvB,SAASO,EAAKrvB,GACZkvB,EAAK,KAAMlvB,IAtHPsvB,CAAK7B,EAAIjnB,EAAT8oB,IAAkBR,GAElBD,EAAS,QAASC,IA/BtBtoB,CAAK,QAASxC,IAdOoX,IAmDvB,SAAamU,GACX,GAA0B,oBAAfA,EACT,MAAM,IAAI/E,UACR,+CAAiD+E,GAKrD,OADAd,EAAIhqB,KAAK8qB,GACFb,IAzDT,OAAOA,EChBF,MAAMc,WAAqBtK,MAwDhCzlB,YAAYgwB,EAAeC,EAAwBC,GACjDC,QAEsC,kBAA3BF,IACTC,EAASD,EACTA,OAAyBnuB,GAI3B,IAAIsuB,EAAS,GAETjwB,EAAU,GACVkwB,GAAc,EAwClB,GAtCIJ,IAMA9vB,EAHA,SAAU8vB,GACV,WAAYA,GAMZ,UAAWA,GACX,QAASA,EALC,CAACK,MAAOL,GAUX,SAAUA,EACP,CACRM,UAAW,CAACN,GACZK,MAAOL,EAAuB9Q,UAKtB,IAAI8Q,IAIW,kBAAlBD,EACTI,EAASJ,GAGD7vB,EAAQqwB,OAASR,IACzBK,GAAc,EACdD,EAASJ,EAAcS,QACvBtwB,EAAQqwB,MAAQR,IAGb7vB,EAAQuwB,SAAWvwB,EAAQwqB,QAA4B,kBAAXuF,EAAqB,CACpE,MAAMvuB,EAAQuuB,EAAOtF,QAAQ,MAEd,IAAXjpB,EACFxB,EAAQuwB,OAASR,GAEjB/vB,EAAQwqB,OAASuF,EAAO1tB,MAAM,EAAGb,GACjCxB,EAAQuwB,OAASR,EAAO1tB,MAAMb,EAAQ,IAI1C,IAAKxB,EAAQmwB,OAASnwB,EAAQowB,WAAapwB,EAAQowB,UAAW,CAC5D,MAAMjF,EAASnrB,EAAQowB,UAAUpwB,EAAQowB,UAAUnvB,OAAS,GAExDkqB,IACFnrB,EAAQmwB,MAAQhF,EAAOnM,UAI3B,MAAM1d,EACJtB,EAAQmwB,OAAS,UAAWnwB,EAAQmwB,MAChCnwB,EAAQmwB,MAAM7uB,MACdtB,EAAQmwB,MAQdtmB,KAAKumB,UAAYpwB,EAAQowB,gBAAazuB,EAOtCkI,KAAKwmB,MAAQrwB,EAAQqwB,YAAS1uB,EAO9BkI,KAAK2E,OAASlN,EAAQA,EAAMkN,YAAS7M,EAWrCkI,KAAK2mB,WAAQ7uB,EAObkI,KAAK4mB,KAQL5mB,KAAKymB,QAAUL,EAOfpmB,KAAK7C,KAAO1F,EAAQA,EAAM0F,UAAOrF,EASjCkI,KAAK5J,KAAO8e,GAAkB/e,EAAQmwB,QAAU,MAOhDtmB,KAAKsmB,MAAQnwB,EAAQmwB,YAASxuB,EAO9BkI,KAAKomB,OAASpmB,KAAKymB,QAOnBzmB,KAAK0mB,OAASvwB,EAAQuwB,aAAU5uB,EAOhCkI,KAAK2gB,OAASxqB,EAAQwqB,aAAU7oB,EAWhCkI,KAAKK,MACHgmB,GAAelwB,EAAQqwB,OAAwC,kBAAxBrwB,EAAQqwB,MAAMnmB,MACjDlK,EAAQqwB,MAAMnmB,MACd,GAYNL,KAAK6mB,OAOL7mB,KAAK6gB,SAOL7gB,KAAK8mB,KAUL9mB,KAAK8b,KAKTiK,GAAa/wB,UAAU4xB,KAAO,GAC9Bb,GAAa/wB,UAAUoB,KAAO,GAC9B2vB,GAAa/wB,UAAUoxB,OAAS,GAChCL,GAAa/wB,UAAUyxB,QAAU,GACjCV,GAAa/wB,UAAUqL,MAAQ,GAC/B0lB,GAAa/wB,UAAU2P,YAAS7M,EAChCiuB,GAAa/wB,UAAUmI,UAAOrF,EAC9BiuB,GAAa/wB,UAAUuxB,eAAYzuB,EACnCiuB,GAAa/wB,UAAUwxB,WAAQ1uB,EAC/BiuB,GAAa/wB,UAAU2xB,WAAQ7uB,EAC/BiuB,GAAa/wB,UAAUsxB,WAAQxuB,EAC/BiuB,GAAa/wB,UAAU0xB,YAAS5uB,EAChCiuB,GAAa/wB,UAAU2rB,YAAS7oB,EC1QzB,MAAMivB,GAAO,CAACC,SAcrB,SAAkBD,EAAME,GACtB,QAAYnvB,IAARmvB,GAAoC,kBAARA,EAC9B,MAAM,IAAIlG,UAAU,mCAGtBmG,GAAWH,GACX,IAIII,EAJA1vB,EAAQ,EACRC,GAAO,EACPC,EAAQovB,EAAK3vB,OAIjB,QAAYU,IAARmvB,GAAoC,IAAfA,EAAI7vB,QAAgB6vB,EAAI7vB,OAAS2vB,EAAK3vB,OAAQ,CACrE,KAAOO,KACL,GAAgC,KAA5BovB,EAAK9K,YAAYtkB,IAGnB,GAAIwvB,EAAc,CAChB1vB,EAAQE,EAAQ,EAChB,YAEOD,EAAM,IAGfyvB,GAAe,EACfzvB,EAAMC,EAAQ,GAIlB,OAAOD,EAAM,EAAI,GAAKqvB,EAAKvuB,MAAMf,EAAOC,GAG1C,GAAIuvB,IAAQF,EACV,MAAO,GAGT,IAAIK,GAAoB,EACpBC,EAAWJ,EAAI7vB,OAAS,EAE5B,KAAOO,KACL,GAAgC,KAA5BovB,EAAK9K,YAAYtkB,IAGnB,GAAIwvB,EAAc,CAChB1vB,EAAQE,EAAQ,EAChB,YAGEyvB,EAAmB,IAGrBD,GAAe,EACfC,EAAmBzvB,EAAQ,GAGzB0vB,GAAY,IAEVN,EAAK9K,YAAYtkB,KAAWsvB,EAAIhL,YAAYoL,KAC1CA,EAAW,IAGb3vB,EAAMC,IAKR0vB,GAAY,EACZ3vB,EAAM0vB,IAMV3vB,IAAUC,EACZA,EAAM0vB,EACG1vB,EAAM,IACfA,EAAMqvB,EAAK3vB,QAGb,OAAO2vB,EAAKvuB,MAAMf,EAAOC,IA7FI4vB,QAwG/B,SAAiBP,GAGf,GAFAG,GAAWH,GAES,IAAhBA,EAAK3vB,OACP,MAAO,IAGT,IAGImwB,EAHA7vB,GAAO,EACPC,EAAQovB,EAAK3vB,OAKjB,OAASO,GACP,GAAgC,KAA5BovB,EAAK9K,YAAYtkB,IACnB,GAAI4vB,EAAgB,CAClB7vB,EAAMC,EACN,YAEQ4vB,IAEVA,GAAiB,GAIrB,OAAO7vB,EAAM,EACe,KAAxBqvB,EAAK9K,YAAY,GACf,IACA,IACM,IAARvkB,GAAqC,KAAxBqvB,EAAK9K,YAAY,GAC9B,KACA8K,EAAKvuB,MAAM,EAAGd,IAvIoB8vB,QAkJxC,SAAiBT,GACfG,GAAWH,GAEX,IASIQ,EATA5vB,EAAQovB,EAAK3vB,OAEbM,GAAO,EACP+vB,EAAY,EACZC,GAAY,EAGZC,EAAc,EAIlB,KAAOhwB,KAAS,CACd,MAAMgG,EAAOopB,EAAK9K,YAAYtkB,GAE9B,GAAa,KAATgG,EAWAjG,EAAM,IAGR6vB,GAAiB,EACjB7vB,EAAMC,EAAQ,GAGH,KAATgG,EAEE+pB,EAAW,EACbA,EAAW/vB,EACc,IAAhBgwB,IACTA,EAAc,GAEPD,GAAY,IAGrBC,GAAe,QAzBf,GAAIJ,EAAgB,CAClBE,EAAY9vB,EAAQ,EACpB,OA2BN,GACE+vB,EAAW,GACXhwB,EAAM,GAEU,IAAhBiwB,GAEiB,IAAhBA,GAAqBD,IAAahwB,EAAM,GAAKgwB,IAAaD,EAAY,EAEvE,MAAO,GAGT,OAAOV,EAAKvuB,MAAMkvB,EAAUhwB,IA9MmBa,KAyNjD,YAAiBqvB,GACf,IAEIC,EAFAlwB,GAAS,EAIb,OAASA,EAAQiwB,EAASxwB,QACxB8vB,GAAWU,EAASjwB,IAEhBiwB,EAASjwB,KACXkwB,OACa/vB,IAAX+vB,EAAuBD,EAASjwB,GAASkwB,EAAS,IAAMD,EAASjwB,IAIvE,YAAkBG,IAAX+vB,EAAuB,IAahC,SAAmBd,GACjBG,GAAWH,GAEX,MAAMe,EAAmC,KAAxBf,EAAK9K,YAAY,GAGlC,IAAI1lB,EAuBN,SAAyBwwB,EAAMgB,GAC7B,IAMIpqB,EAEAqqB,EARApwB,EAAS,GACTqwB,EAAoB,EACpBC,GAAa,EACbC,EAAO,EACPxwB,GAAS,EAMb,OAASA,GAASovB,EAAK3vB,QAAQ,CAC7B,GAAIO,EAAQovB,EAAK3vB,OACfuG,EAAOopB,EAAK9K,YAAYtkB,OACnB,IAAa,KAATgG,EACT,MAEAA,EAAO,GAGT,GAAa,KAATA,EAAuB,CACzB,GAAIuqB,IAAcvwB,EAAQ,GAAc,IAATwwB,QAExB,GAAID,IAAcvwB,EAAQ,GAAc,IAATwwB,EAAY,CAChD,GACEvwB,EAAOR,OAAS,GACM,IAAtB6wB,GAC0C,KAA1CrwB,EAAOqkB,YAAYrkB,EAAOR,OAAS,IACO,KAA1CQ,EAAOqkB,YAAYrkB,EAAOR,OAAS,GAEnC,GAAIQ,EAAOR,OAAS,GAGlB,GAFA4wB,EAAiBpwB,EAAOwpB,YAAY,KAEhC4G,IAAmBpwB,EAAOR,OAAS,EAAG,CACpC4wB,EAAiB,GACnBpwB,EAAS,GACTqwB,EAAoB,IAEpBrwB,EAASA,EAAOY,MAAM,EAAGwvB,GACzBC,EAAoBrwB,EAAOR,OAAS,EAAIQ,EAAOwpB,YAAY,MAG7D8G,EAAYvwB,EACZwwB,EAAO,EACP,eAEG,GAAIvwB,EAAOR,OAAS,EAAG,CAC5BQ,EAAS,GACTqwB,EAAoB,EACpBC,EAAYvwB,EACZwwB,EAAO,EACP,SAIAJ,IACFnwB,EAASA,EAAOR,OAAS,EAAIQ,EAAS,MAAQ,KAC9CqwB,EAAoB,QAGlBrwB,EAAOR,OAAS,EAClBQ,GAAU,IAAMmvB,EAAKvuB,MAAM0vB,EAAY,EAAGvwB,GAE1CC,EAASmvB,EAAKvuB,MAAM0vB,EAAY,EAAGvwB,GAGrCswB,EAAoBtwB,EAAQuwB,EAAY,EAG1CA,EAAYvwB,EACZwwB,EAAO,OACW,KAATxqB,GAAyBwqB,GAAQ,EAC1CA,IAEAA,GAAQ,EAIZ,OAAOvwB,EArGKwwB,CAAgBrB,GAAOe,GAEd,IAAjBvxB,EAAMa,QAAiB0wB,IACzBvxB,EAAQ,KAGNA,EAAMa,OAAS,GAA2C,KAAtC2vB,EAAK9K,YAAY8K,EAAK3vB,OAAS,KACrDb,GAAS,KAGX,OAAOuxB,EAAW,IAAMvxB,EAAQA,EA7BI8xB,CAAUR,IAvOK,SA0WrD,SAASX,GAAWH,GAClB,GAAoB,kBAATA,EACT,MAAM,IAAIhG,UACR,mCAAqCuH,KAAKC,UAAUxB,IC7ZnD,MAAMyB,GAAO,CAACC,IAErB,WACE,MAAO,MCaF,SAASC,GAAMC,GACpB,OAAOzuB,QACa,OAAlByuB,GAC2B,kBAAlBA,GACP,SAAUA,GACVA,EAAcC,MACd,aAAcD,GACdA,EAAcE,eAES/wB,IAAvB6wB,EAAcG,MChBb,SAASC,GAAUhC,GACxB,GAAoB,kBAATA,EACTA,EAAO,IAAIiC,IAAIjC,QACV,IAAK2B,GAAM3B,GAAO,CAEvB,MAAMrC,EAAQ,IAAI3D,UAChB,+EACEgG,EACA,KAGJ,MADArC,EAAM/mB,KAAO,uBACP+mB,EAGR,GAAsB,UAAlBqC,EAAK8B,SAAsB,CAE7B,MAAMnE,EAAQ,IAAI3D,UAAU,kCAE5B,MADA2D,EAAM/mB,KAAO,yBACP+mB,EAGR,OAWF,SAA6B5I,GAC3B,GAAqB,KAAjBA,EAAImN,SAAiB,CAEvB,MAAMvE,EAAQ,IAAI3D,UAChB,wDAGF,MADA2D,EAAM/mB,KAAO,4BACP+mB,EAGR,MAAMwE,EAAWpN,EAAIoN,SACrB,IAAIvxB,GAAS,EAEb,OAASA,EAAQuxB,EAAS9xB,QACxB,GACkC,KAAhC8xB,EAASjN,YAAYtkB,IACe,KAApCuxB,EAASjN,YAAYtkB,EAAQ,GAC7B,CACA,MAAMwxB,EAAQD,EAASjN,YAAYtkB,EAAQ,GAC3C,GAAc,KAAVwxB,GAAoC,MAAVA,EAAyB,CAErD,MAAMzE,EAAQ,IAAI3D,UAChB,uDAGF,MADA2D,EAAM/mB,KAAO,4BACP+mB,GAKZ,OAAO0E,mBAAmBF,GAzCnBG,CAAoBtC,GCuD7B,MAAMuC,GAA6B,CACjC,UACA,OACA,WACA,OACA,UACA,WAGK,MAAMC,GAuBXvzB,YAAYO,GAEV,IAAIJ,EAKFA,EAHGI,EAEMmyB,GAAMnyB,GACL,CAACwwB,KAAMxwB,GACS,kBAAVA,GAujBtB,SAAsBA,GACpB,OAAO2D,QACL3D,GACmB,kBAAVA,GACP,eAAgBA,GAChB,eAAgBA,GA5jBsBizB,CAAajzB,GACzC,CAACA,SAEDA,EANA,GAgBZyJ,KAAKyoB,IAAMD,GAAKC,MAUhBzoB,KAAKG,KAAO,GASZH,KAAKypB,QAAU,GAOfzpB,KAAK0pB,SAAW,GAOhB1pB,KAAKzJ,MAYLyJ,KAAKmH,IAULnH,KAAKpI,OASLoI,KAAK2pB,OAIL,IAkBIC,EAlBAjyB,GAAS,EAEb,OAASA,EAAQ2xB,GAAMlyB,QAAQ,CAC7B,MAAMwyB,EAAON,GAAM3xB,GAKjBiyB,KAAQzzB,QACU2B,IAAlB3B,EAAQyzB,IACU,OAAlBzzB,EAAQyzB,KAGR5pB,KAAK4pB,GAAiB,YAATA,EAAqB,IAAIzzB,EAAQyzB,IAASzzB,EAAQyzB,IAQnE,IAAKA,KAAQzzB,EAENmzB,GAAMzmB,SAAS+mB,KAElB5pB,KAAK4pB,GAAQzzB,EAAQyzB,IAWvB5C,eACF,MAA4B,kBAAdhnB,KAAK+mB,KAAoBA,GAAKC,SAAShnB,KAAK+mB,WAAQjvB,EAehEkvB,aAASA,GACX6C,GAAe7C,EAAU,YACzB8C,GAAW9C,EAAU,YACrBhnB,KAAK+mB,KAAOA,GAAKxuB,KAAKyH,KAAKsnB,SAAW,GAAIN,GASxCM,cACF,MAA4B,kBAAdtnB,KAAK+mB,KAAoBA,GAAKO,QAAQtnB,KAAK+mB,WAAQjvB,EAa/DwvB,YAAQA,GACV,GAAWtnB,KAAKgnB,SAAU,WAC1BhnB,KAAK+mB,KAAOA,GAAKxuB,KAAK+uB,GAAW,GAAItnB,KAAKgnB,UASxCQ,cACF,MAA4B,kBAAdxnB,KAAK+mB,KAAoBA,GAAKS,QAAQxnB,KAAK+mB,WAAQjvB,EAe/D0vB,YAAQA,GAIV,GAHAsC,GAAWtC,EAAS,WACpB,GAAWxnB,KAAKsnB,QAAS,WAErBE,EAAS,CACX,GAA+B,KAA3BA,EAAQvL,YAAY,GACtB,MAAM,IAAIR,MAAM,iCAGlB,GAAI+L,EAAQ3kB,SAAS,IAAK,GACxB,MAAM,IAAI4Y,MAAM,0CAIpBzb,KAAK+mB,KAAOA,GAAKxuB,KAAKyH,KAAKsnB,QAAStnB,KAAK+pB,MAAQvC,GAAW,KAS1DT,WACF,OAAO/mB,KAAKypB,QAAQzpB,KAAKypB,QAAQryB,OAAS,GAexC2vB,SAAKA,GACH2B,GAAM3B,KACRA,EAAOgC,GAAUhC,IAGnB8C,GAAe9C,EAAM,QAEjB/mB,KAAK+mB,OAASA,GAChB/mB,KAAKypB,QAAQzuB,KAAK+rB,GAUlBgD,WACF,MAA4B,kBAAd/pB,KAAK+mB,KACfA,GAAKC,SAAShnB,KAAK+mB,KAAM/mB,KAAKwnB,cAC9B1vB,EAeFiyB,SAAKA,GACPF,GAAeE,EAAM,QACrBD,GAAWC,EAAM,QACjB/pB,KAAK+mB,KAAOA,GAAKxuB,KAAKyH,KAAKsnB,SAAW,GAAIyC,GAAQ/pB,KAAKwnB,SAAW,KAgEpEwC,KAAKhE,EAAeC,EAAwBC,GAE1C,MAAMO,EAAUzmB,KAAKymB,QAAQT,EAAeC,EAAwBC,GAIpE,MAFAO,EAAQE,OAAQ,EAEVF,EA6DRjhB,KAAKwgB,EAAeC,EAAwBC,GAE1C,MAAMO,EAAUzmB,KAAKymB,QAAQT,EAAeC,EAAwBC,GAIpE,OAFAO,EAAQE,WAAQ7uB,EAET2uB,EA6DTA,QAAQT,EAAeC,EAAwBC,GAC7C,MAAMO,EAAU,IAAIV,GAElBC,EACAC,EACAC,GAYF,OATIlmB,KAAK+mB,OACPN,EAAQrwB,KAAO4J,KAAK+mB,KAAO,IAAMN,EAAQrwB,KACzCqwB,EAAQG,KAAO5mB,KAAK+mB,MAGtBN,EAAQE,OAAQ,EAEhB3mB,KAAK0pB,SAAS1uB,KAAKyrB,GAEZA,EAgBTtxB,SAASogB,GACP,QAAmBzd,IAAfkI,KAAKzJ,MACP,MAAO,GAGT,GAA0B,kBAAfyJ,KAAKzJ,MACd,OAAOyJ,KAAKzJ,MAId,OADgB,IAAIymB,YAAYzH,QAAYzd,GAC7B+c,OAAO7U,KAAKzJ,QAc/B,SAASuzB,GAAWG,EAAM7zB,GACxB,GAAI6zB,GAAQA,EAAKpnB,SAASkkB,GAAKmD,KAC7B,MAAM,IAAIzO,MACR,IAAMrlB,EAAO,uCAAyC2wB,GAAKmD,IAAM,KAevE,SAASL,GAAeI,EAAM7zB,GAC5B,IAAK6zB,EACH,MAAM,IAAIxO,MAAM,IAAMrlB,EAAO,qBAcjC,SAAS,GAAW2wB,EAAM3wB,GACxB,IAAK2wB,EACH,MAAM,IAAItL,MAAM,YAAcrlB,EAAO,mCC3qBlC,MAAM+zB,GAIX,SAQcC,GACR,MAEMC,EAFOrqB,KACOhK,YAKpB,UACMs0B,EAAOD,EAAMD,GAEb1E,EAAQ,WACZ,OAAO4E,EAAK5E,MAAMA,EAAOxuB,YAG3BnC,OAAOw1B,eAAe7E,EAAO2E,GAE7B,MAAMG,EAAQz1B,OAAO01B,oBAAoBH,GAEzC,IAAK,MAAMI,KAAKF,EAAO,CACrB,MAAMG,EAAa51B,OAAOO,yBAAyBg1B,EAAMI,GACrDC,GAAY51B,OAAOK,eAAeswB,EAAOgF,EAAGC,GAGlD,OAAOjF,GCuUT,GAAM,GAAGzwB,eAeR,MAAM21B,WAAkBT,GAI7Bn0B,cAEEmwB,MAAM,QAeNnmB,KAAK6qB,cAAW/yB,EAYhBkI,KAAK8qB,YAAShzB,EAadkI,KAAK+qB,UAAY,GAajB/qB,KAAK4c,cAAW9kB,EAShBkI,KAAKgrB,aAAe,EASpBhrB,KAAKirB,YAASnzB,EASdkI,KAAKkrB,UAAY,GAUjBlrB,KAAK1D,YAASxE,EASdkI,KAAKmrB,aAAepG,KActBhuB,OAEE,MAAMq0B,EACgF,IAC9ER,GAER,IAAIjzB,GAAS,EAEb,OAASA,EAAQqI,KAAK+qB,UAAU3zB,QAAQ,CACtC,MAAMi0B,EAAWrrB,KAAK+qB,UAAUpzB,GAChCyzB,EAAYzZ,OAAO0Z,GAKrB,OAFAD,EAAYjrB,KAAKtJ,IAAO,EAAM,GAAImJ,KAAKkrB,YAEhCE,EA8DTjrB,KAAKtK,EAAKU,GACR,MAAmB,kBAARV,EAEgB,IAArBqB,UAAUE,QACZk0B,GAAe,OAAQtrB,KAAKirB,QAC5BjrB,KAAKkrB,UAAUr1B,GAAOU,EACfyJ,MAID,GAAItK,KAAKsK,KAAKkrB,UAAWr1B,IAAQmK,KAAKkrB,UAAUr1B,SAASiC,EAI/DjC,GACFy1B,GAAe,OAAQtrB,KAAKirB,QAC5BjrB,KAAKkrB,UAAYr1B,EACVmK,MAIFA,KAAKkrB,UAoBdK,SACE,GAAIvrB,KAAKirB,OACP,OAAOjrB,KAMT,MAAMI,EAAgC,KAEtC,OAASJ,KAAKgrB,YAAchrB,KAAK+qB,UAAU3zB,QAAQ,CACjD,MAAOi0B,KAAal1B,GAAW6J,KAAK+qB,UAAU/qB,KAAKgrB,aAEnD,IAAmB,IAAf70B,EAAQ,GACV,UAGiB,IAAfA,EAAQ,KACVA,EAAQ,QAAK2B,GAGf,MAAM0zB,EAAcH,EAAS31B,KAAK0K,KAASjK,GAEhB,oBAAhBq1B,GACTxrB,KAAKmrB,aAAaxZ,IAAI6Z,GAO1B,OAHAxrB,KAAKirB,QAAS,EACdjrB,KAAKgrB,YAAc3rB,OAAOC,kBAEnBU,KAiBTmU,MAAMyS,GACJ5mB,KAAKurB,SACL,MAAME,EAAWC,GAAM9E,GACjBtqB,EAAS0D,KAAK1D,QAAU0D,KAAK8qB,OAEnC,OADAa,GAAa,QAASrvB,GACfA,EAAOwC,OAAO2sB,GAAWA,GA6ClCG,QAAQhF,EAAMnB,GACZ,MAAMrlB,EAAOJ,KAMb,OAJAA,KAAKurB,SACLI,GAAa,UAAW3rB,KAAK1D,QAAU0D,KAAK8qB,QAC5Ce,GAAe,UAAW7rB,KAAK4c,UAAY5c,KAAK6qB,UAEzCpF,EAAOqG,OAASh0B,EAAW2tB,GAAQ,IAAIsG,QAAQD,GAQtD,SAASA,EAASzoB,EAAS2oB,GACzB,MAAMP,EAAWC,GAAM9E,GAGjBqF,EAEsB7rB,EAAK+T,MAAMsX,GA+BvC,SAASS,EAASxH,EAAOkC,GACnBlC,IAAUkC,EACZoF,EAAOtH,GACErhB,EACTA,EAAQujB,GAGRnB,OAAK3tB,EAAW8uB,GAnCpBxmB,EAAK8kB,IAAI+G,EAAWR,GAAU,SAAU/G,EAAOjK,EAAMmM,GACnD,GAAIlC,IAAUjK,IAASmM,EACrB,OAAOsF,EAASxH,GAKlB,MAAMyH,EAC8D,EAI9DC,EAAgBhsB,EAAKmoB,UAAU4D,EAAavF,GA2iB1D,IAAyBrwB,EACC,kBADDA,EAziBG61B,IAqjB5B,SAAsB71B,GACpB,OAAO2D,QACL3D,GACmB,kBAAVA,GACP,eAAgBA,GAChB,eAAgBA,GAhBgB,CAAaA,GAziBzCqwB,EAAKrwB,MAAQ61B,EAEbxF,EAAKhvB,OAASw0B,EAGhBF,EAASxH,EAAqD,OAoDpE2H,YAAYzF,GAEV,IAEIhvB,EAFA00B,GAAW,EAYf,OARAtsB,KAAKurB,SACLI,GAAa,cAAe3rB,KAAK1D,QAAU0D,KAAK8qB,QAChDe,GAAe,cAAe7rB,KAAK4c,UAAY5c,KAAK6qB,UAEpD7qB,KAAK4rB,QAAQhF,GASb,SAAkBlC,EAAOkC,GACvB0F,GAAW,EACX7H,GAAKC,GACL9sB,EAASgvB,KAXX2F,GAAW,cAAe,UAAWD,GAG9B10B,EAkDTstB,IAAIzK,EAAMmM,EAAMnB,GACd+G,GAAW/R,GACXza,KAAKurB,SAEL,MAAMJ,EAAenrB,KAAKmrB,aAO1B,OALK1F,GAAwB,oBAATmB,IAClBnB,EAAOmB,EACPA,OAAO9uB,GAGF2tB,EAAOqG,OAASh0B,EAAW2tB,GAAQ,IAAIsG,QAAQD,GAWtD,SAASA,EAASzoB,EAAS2oB,GAKzB,MAAMP,EAAWC,GAAM9E,GACvBuE,EAAajG,IAAIzK,EAAMgR,GAQvB,SAAkB/G,EAAO+H,EAAY7F,GACnC,MAAM8F,EAEFD,GAAchS,EAGdiK,EACFsH,EAAOtH,GACErhB,EACTA,EAAQqpB,GAGRjH,OAAK3tB,EAAW40B,EAAe9F,OAuBvC+F,QAAQlS,EAAMmM,GAEZ,IAEIhvB,EAFA00B,GAAW,EAQf,OAJAtsB,KAAKklB,IAAIzK,EAAMmM,GASf,SAAkBlC,EAAOjK,GACvBgK,GAAKC,GACL9sB,EAAS6iB,EACT6R,GAAW,KAVbC,GAAW,UAAW,MAAOD,GAEtB10B,EAyCT2wB,UAAU9N,EAAMmM,GACd5mB,KAAKurB,SACL,MAAME,EAAWC,GAAM9E,GACjBhK,EAAW5c,KAAK4c,UAAY5c,KAAK6qB,SAIvC,OAHAgB,GAAe,YAAajP,GAC5B4P,GAAW/R,GAEJmC,EAASnC,EAAMgR,GA4DxB9Z,IAAIpb,KAAUqE,GACZ,MAAMmwB,EAAY/qB,KAAK+qB,UACjBG,EAAYlrB,KAAKkrB,UAIvB,GAFAI,GAAe,MAAOtrB,KAAKirB,QAEb,OAAV10B,QAA4BuB,IAAVvB,QAEf,GAAqB,oBAAVA,EAChBq2B,EAAUr2B,EAAOqE,OACZ,IAAqB,kBAAVrE,EAOhB,MAAM,IAAIwqB,UAAU,+BAAiCxqB,EAAQ,KANzDd,MAAMF,QAAQgB,GAChBs2B,EAAQt2B,GAERu2B,EAAUv2B,GAMd,OAAOyJ,KAMP,SAASjC,EAAIxH,GACX,GAAqB,oBAAVA,EACTq2B,EAAUr2B,EAAO,QACZ,IAAqB,kBAAVA,EAShB,MAAM,IAAIwqB,UAAU,+BAAiCxqB,EAAQ,KAR7D,GAAId,MAAMF,QAAQgB,GAAQ,CACxB,MAAOw2B,KAAWnyB,GAC2B,EAC7CgyB,EAAUG,EAAQnyB,QAElBkyB,EAAUv2B,IAWhB,SAASu2B,EAAUl1B,GACjB,KAAM,YAAaA,MAAa,aAAcA,GAC5C,MAAM,IAAI6jB,MACR,8KAIJoR,EAAQj1B,EAAOo1B,SAEXp1B,EAAOkC,WACToxB,EAAUpxB,SAAWjD,IAAO,EAAMq0B,EAAUpxB,SAAUlC,EAAOkC,WAQjE,SAAS+yB,EAAQG,GACf,IAAIr1B,GAAS,EAEb,GAAgB,OAAZq1B,QAAgCl1B,IAAZk1B,OAEjB,KAAIv3B,MAAMF,QAAQy3B,GAMvB,MAAM,IAAIjM,UAAU,oCAAsCiM,EAAU,KALpE,OAASr1B,EAAQq1B,EAAQ51B,QAAQ,CAE/B2G,EADcivB,EAAQr1B,MAa5B,SAASi1B,EAAUG,EAAQnyB,GACzB,IAAIjD,GAAS,EACTs1B,GAAc,EAElB,OAASt1B,EAAQozB,EAAU3zB,QACzB,GAAI2zB,EAAUpzB,GAAO,KAAOo1B,EAAQ,CAClCE,EAAat1B,EACb,MAIJ,IAAoB,IAAhBs1B,EACFlC,EAAU/vB,KAAK,CAAC+xB,KAAWnyB,SAIxB,GAAIA,EAAWxD,OAAS,EAAG,CAC9B,IAAK81B,KAAYC,GAAQvyB,EACzB,MAAMwyB,EAAiBrC,EAAUkC,GAAY,GACzC,GAAWG,IAAmB,GAAWF,KAC3CA,EAAUr2B,IAAO,EAAMu2B,EAAgBF,IAGzCnC,EAAUkC,GAAc,CAACF,EAAQG,KAAYC,MAkC9C,MAAME,IAAU,IAAIzC,IAAYW,SASvC,SAASI,GAAav1B,EAAMG,GAC1B,GAAqB,oBAAVA,EACT,MAAM,IAAIwqB,UAAU,WAAa3qB,EAAO,sBAW5C,SAASy1B,GAAez1B,EAAMG,GAC5B,GAAqB,oBAAVA,EACT,MAAM,IAAIwqB,UAAU,WAAa3qB,EAAO,wBAW5C,SAASk1B,GAAel1B,EAAM60B,GAC5B,GAAIA,EACF,MAAM,IAAIxP,MACR,gBACErlB,EACA,oHAWR,SAASo2B,GAAWryB,GAGlB,IAAK,GAAWA,IAA8B,kBAAdA,EAAKC,KACnC,MAAM,IAAI2mB,UAAU,uBAAyB5mB,EAAO,KAaxD,SAASoyB,GAAWn2B,EAAMk3B,EAAWhB,GACnC,IAAKA,EACH,MAAM,IAAI7Q,MACR,IAAMrlB,EAAO,0BAA4Bk3B,EAAY,aAS3D,SAAS5B,GAAMn1B,GACb,OAOF,SAAyBA,GACvB,OAAO2D,QACL3D,GACmB,kBAAVA,GACP,YAAaA,GACb,aAAcA,GAZXg3B,CAAgBh3B,GAASA,EAAQ,IAAIgzB,GAAMhzB,G,ICztChD+mB,GAAGkQ,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,G,YA1ClBC,GAAI,CAACpD,EAAGqD,EAAGC,KACb,IAAKD,EAAEE,IAAIvD,GACT,MAAM3J,UAAU,UAAYiN,IAE5BE,GAAI,CAACxD,EAAGqD,EAAGC,KAAOF,GAAEpD,EAAGqD,EAAG,2BAA4BC,EAAIA,EAAEt4B,KAAKg1B,GAAKqD,EAAEI,IAAIzD,IAAK0D,GAAI,CAAC1D,EAAGqD,EAAGC,KAC9F,GAAID,EAAEE,IAAIvD,GACR,MAAM3J,UAAU,qDAClBgN,aAAaM,QAAUN,EAAEhwB,IAAI2sB,GAAKqD,EAAEO,IAAI5D,EAAGsD,IAC1CO,GAAI,CAAC7D,EAAGqD,EAAGC,EAAGQ,KAAOV,GAAEpD,EAAGqD,EAAG,0BAA2BS,EAAIA,EAAE94B,KAAKg1B,EAAGsD,GAAKD,EAAEO,IAAI5D,EAAGsD,GAAIA,GAG3F,MAAMS,IAEN,MAAMC,GACJ14B,cACEgK,KAAK2uB,SAAW,GAAI3uB,KAAKT,KAAO,IAAMS,KAAK2uB,SAASv3B,OAAQ4I,KAAK4uB,IAAM,IAAM5uB,KAAK2uB,SAASE,IAAI,GAAI7uB,KAAKhF,KAAQ+yB,IAC9G,IAAIC,EACgB,OAAnBA,EAAIhuB,KAAK4uB,QAAkBZ,EAAEhzB,KAAK+yB,IAClC/tB,KAAKgJ,KAAQ+kB,IACd/tB,KAAK2uB,SAAS3zB,KAAK+yB,IAClB/tB,KAAKoQ,MAAQ,KACd,MAAM2d,EAAI/tB,KAAK2uB,SAASvxB,MACxB,IAAK2wB,EACH,MAAM,WACR,OAAOA,IAIb,MAAMe,WAAUL,GACdz4B,YAAY+3B,EAAGC,EAAGQ,GAChBrI,QAASnmB,KAAK5F,KAAO2zB,EAAG/tB,KAAKJ,QAAUouB,EAAGhuB,KAAK+uB,MAAQP,EAEzDxzB,KAAK+yB,KAAMC,GACThuB,KAAKJ,QAAQ5E,KAAK+yB,KAAMC,GAE1B5wB,MACE,OAAO4C,KAAKJ,QAAQxC,MAEtB4xB,cAAcjB,EAAGC,EAAGQ,GAClB,OAAO,IAAIM,GAAEf,EAAGC,EAAGQ,IAIvB,MAAMS,GAAI,cAAgBP,GAExB14B,YAAYg4B,GACV7H,QACAiI,GAAEpuB,KAAMsd,QAAG,GACX8Q,GAAEpuB,KAAMwtB,QAAG,GACXY,GAAEpuB,KAAMytB,QAAG,GACXW,GAAEpuB,KAAM0tB,QAAG,GACXU,GAAEpuB,KAAM2tB,QAAG,GACXS,GAAEpuB,KAAM4tB,QAAG,GACXQ,GAAEpuB,KAAM6tB,QAAG,GACXU,GAAEvuB,KAAMsd,GAAG,WAASiR,GAAEvuB,KAAMwtB,IAAIgB,GAAMA,EAAEU,SAASX,GAAEvuB,KAAMytB,IAAG,CAACe,EAAGW,KAC9D,GAAIjB,GAAEluB,KAAMwtB,IAAG93B,KAAKsK,KAAMwuB,IAAMN,GAAEluB,KAAMwtB,IAAG93B,KAAKsK,KAAMmvB,IAAM,aAAUX,EAAEY,MAAOD,EAAEC,OAC/E,OAAOpvB,KAAKqvB,OAAOprB,KAAKuqB,EAAEvqB,KAAOkrB,EAAElrB,KAAMuqB,EAAEY,UAC3Cb,GAAEvuB,KAAM0tB,IAAIc,IACd,MAAMW,EAAIp6B,OAAOwF,OAAO,IAAKyF,KAAKqvB,OAAOC,SAAUtvB,KAAKqvB,OAAOD,QAASG,MAAMC,GAAMA,EAAEC,KAAKC,cAAcj2B,MAAM+0B,KAC/G,IAAKW,EACH,MAAM,SAAEX,GACV,OAAOW,KACLZ,GAAEvuB,KAAM2tB,IAAIa,IACd,MAAMW,EAAIjB,GAAEluB,KAAM0tB,IAAGh4B,KAAKsK,KAAMwuB,GAChCW,EAAEM,KAAKC,cAAcC,OAAO3vB,KAAMwuB,EAAGW,MACnCnvB,KAAK4vB,WAAa,CAACpB,EAAGW,EAAGK,KAAOxvB,KAAK6vB,SAASV,EAAGK,GAAIxvB,KAAKjD,KAAKyxB,EAAEl0B,UAAW0F,MAAOA,KAAK6vB,SAAW,CAACrB,EAAGW,KAAOnvB,KAAKgJ,KAAK8lB,GAAEjnB,OAAO2mB,EAAG,GAAIW,IAAKnvB,MAAOuuB,GAAEvuB,KAAM4tB,IAAG,KACjKW,GAAEvuB,KAAMsd,GAAG,WACX,MAAMkR,EAAIxuB,KAAKoQ,QACf,OAAO8d,GAAEluB,KAAM6tB,IAAGn4B,KAAKsK,KAAMwuB,EAAEp0B,KAAMo0B,EAAEO,MAAOP,EAAE5uB,YAC9CI,KAAK8vB,UAAY,KAAO5B,GAAEluB,KAAM4tB,IAAGl4B,KAAKsK,MAAOA,MAAOuuB,GAAEvuB,KAAM6tB,IAAG,CAACW,EAAGW,EAAGK,KAC1E,MAAMr4B,EAAIq3B,EAAEuB,cAAcZ,EAAGK,EAAGtB,GAAEluB,KAAMsd,KACxC,IAAKnmB,EACH,MAAM,SAAEq3B,EAAGW,EAAGK,GAChB,OAAOxvB,KAAKhF,KAAK7D,GAAIA,KACnB6I,KAAKgwB,QAAU,CAACxB,EAAGW,EAAGK,KAAOtB,GAAEluB,KAAM6tB,IAAGn4B,KAAKsK,KAAMwuB,EAAGW,EAAGK,GAAIxvB,MAAOA,KAAKiwB,SAAW,CAACzB,EAAGW,KAC1F,MAAMK,EAAIhB,EAAE3mB,OAAOsnB,GACnB,OAAOZ,GAAEvuB,KAAMsd,GAAGkS,EAAEU,SAAShC,GAAEluB,KAAMsd,MAAMtd,MAC1CA,KAAKmwB,UAAa3B,IAAOD,GAAEvuB,KAAMsd,GAAGkR,EAAE4B,cAAclC,GAAEluB,KAAMsd,MAAMtd,MAAOA,KAAKqwB,QAAW7B,IAC1F,MAAMW,EAAInvB,KAAK4uB,MACf,IAAKO,EACH,MAAM,WACR,MAAMK,EAAIL,EAAE/xB,MAAOjG,EAAI6I,KAAKqvB,OAAOprB,KAAKuqB,EAAGN,GAAEluB,KAAMsd,KACnD,IAAKkS,EACH,OAAOL,EAAEn0B,KAAK7D,GAAI6I,KACpB,MAAMgjB,EAAIkL,GAAEluB,KAAMytB,IAAG/3B,KAAKsK,KAAMwvB,EAAGr4B,GACnC,OAAO6rB,GAAKmM,EAAEn0B,KAAKgoB,GAAIhjB,OAASmvB,EAAEn0B,KAAKw0B,EAAGr4B,GAAI6I,OAC7CA,KAAKswB,MAAQ,KACd,IAAI9B,EACJ,GACEA,EAAIN,GAAEluB,KAAM4tB,IAAGl4B,KAAKsK,YACfA,KAAKT,QACZ,OAAOivB,GACNxuB,KAAKjD,KAAO,CAACyxB,EAAI,MAAQ,CAACA,GAAG+B,OAAOC,SAASrB,GAAMjB,GAAEluB,KAAM2tB,IAAGj4B,KAAKsK,KAAMmvB,KAAKnvB,MAAOA,KAAKywB,MAAQ,IAAMzwB,KAAKswB,QAAStwB,KAAKklB,IAAM,CAACsJ,EAAGW,KACtI,MAAMK,EAAIhB,EAAE7B,QAAQ6B,EAAEra,MAAMgb,GAAIA,GAChC,OAAOnvB,KAAKjD,KAAKyyB,GAAIxvB,MACpBA,KAAKqvB,OAASrB,IAGrB1Q,GAAI,IAAIoT,QAAWlD,GAAI,IAAIkD,QAAWjD,GAAI,IAAIiD,QAAWhD,GAAI,IAAIgD,QAAW/C,GAAI,IAAI+C,QAAW9C,GAAI,IAAI8C,QAAW7C,GAAI,IAAI6C,QAAWzB,GAAEpnB,OAAS,CAACmmB,EAAGQ,KAClJ,MAAMW,EAAI,IAAIF,GAAEjB,GAChB,OAAQwB,IAAOL,EAAEjK,IAAIsJ,EAAGgB,GAAIL,EAAEsB,UAEhC,IAAIE,GAAI1B,GACR,MAAM2B,GAAI,cAAgBnC,GACxBz4B,YAAY+3B,EAAGC,EAAGQ,EAAGW,EAAI,IACvBhJ,QAASnmB,KAAK5F,KAAO2zB,EAAG/tB,KAAK1F,SAAW0zB,EAAGhuB,KAAKzJ,MAAQi4B,EAAGxuB,KAAK6wB,MAAQ1B,EAAGnvB,KAAKhF,KAAO,CAACw0B,KAAMr4B,KAC5F6I,KAAK1F,WAAa0F,KAAK1F,SAAW,IAAK0F,KAAK1F,SAASU,KAAKw0B,KAAMr4B,IAC/D6I,KAAK5C,IAAM,KACZ,IAAIoyB,EACJ,OAA8B,OAAtBA,EAAIxvB,KAAK1F,eAAoB,EAASk1B,EAAEpyB,SAItDwzB,GAAE/oB,OAAS,CAACkmB,EAAGC,EAAGQ,EAAGW,EAAI,KAAO,IAAIyB,GAAE7C,EAAGC,EAAGQ,EAAGW,GAC/C,IAAI2B,GAAIF,GAER,IAAIG,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GACrC,MAAMC,GAAI,cAAgBjD,GAExB14B,YAAYg4B,GACV7H,QACAiI,GAAEpuB,KAAM+wB,QAAG,GACX3C,GAAEpuB,KAAMgxB,QAAG,GACX5C,GAAEpuB,KAAMixB,QAAG,GACX7C,GAAEpuB,KAAMkxB,QAAG,GACX9C,GAAEpuB,KAAMmxB,QAAG,GACX/C,GAAEpuB,KAAMoxB,QAAG,GACXhD,GAAEpuB,KAAMqxB,QAAG,GACXjD,GAAEpuB,KAAMsxB,QAAG,GACXlD,GAAEpuB,KAAMuxB,QAAG,GACXnD,GAAEpuB,KAAMwxB,QAAG,GACXpD,GAAEpuB,KAAMyxB,QAAG,GACXrD,GAAEpuB,KAAM0xB,QAAG,GACXnD,GAAEvuB,KAAM+wB,GAAG,WAASxC,GAAEvuB,KAAMgxB,IAAIxC,IAC9B,MAAMW,EAAIp6B,OAAOwF,OAAO,IAAKyF,KAAKqvB,OAAOC,SAAUtvB,KAAKqvB,OAAOD,QAASG,MAAMC,GAAMA,EAAEC,KAAKhM,WAAWhqB,MAAM+0B,KAC5G,IAAKW,EACH,MAAM,SAAEX,EAAEp0B,MACZ,OAAO+0B,KACLZ,GAAEvuB,KAAMixB,IAAIzC,GAAMN,GAAEluB,KAAMgxB,IAAGt7B,KAAKsK,KAAMwuB,GAAGiB,KAAKhM,WAAWkM,OAAO3vB,KAAMwuB,KAAKD,GAAEvuB,KAAMkxB,IAAG,CAAC1C,EAAGW,IAAMjB,GAAEluB,KAAMgxB,IAAGt7B,KAAKsK,KAAMwuB,GAAGiB,KAAKhM,WAAWkM,OAAO3vB,KAAMwuB,EAAGW,KAAKZ,GAAEvuB,KAAMmxB,IAAI3C,IAC9K,MAAQY,MAAOD,GAAMX,EAAGgB,EAAKoC,GAAMA,EAAEx3B,KAAKq1B,KAAKoC,UAAY,GAC3D,IAAI1C,GAAG5K,MAAK,CAACqN,EAAGE,IAAMtC,EAAEoC,GAAKpC,EAAEsC,KAAIC,OAAOH,IAAO1D,GAAEluB,KAAMkxB,IAAGx7B,KAAKsK,KAAM4xB,EAAGpD,MAAON,GAAEluB,KAAMixB,IAAGv7B,KAAKsK,KAAMwuB,GAAIW,EAAEqB,SAASoB,GAAM1D,GAAEluB,KAAM0xB,IAAGh8B,KAAKsK,KAAM4xB,QAChJrD,GAAEvuB,KAAMoxB,IAAG,CAAC5C,EAAGW,KACjB,IAAI2C,EACJ,GAAItD,EAAEp0B,OAAS+0B,GAAwD,KAA9B,OAAnB2C,EAAItD,EAAEl0B,eAAoB,EAASw3B,EAAE16B,QACzD,OAAOo3B,EACT,MAAMgB,EAAKwC,IACT,IAAIC,EACJ,GAAID,EAAE53B,OAAS+0B,EACb,OAAO6C,EACT,GAAuD,KAA9B,OAAnBC,EAAID,EAAE13B,eAAoB,EAAS23B,EAAE76B,QACzC,OAAO,KACT,MAAO6rB,GAAK+O,EAAE13B,SACd,OAAO2oB,EAAIuM,EAAEvM,GAAK,MACjB9rB,EAAIq4B,EAAEhB,GACT,IAAKr3B,EACH,OAAOq3B,EACT,MAAMxL,EAAI7rB,EAAEmD,SAAW,IAAInD,EAAEmD,eAAY,EAAQs3B,EAAI,IAAKpD,EAAGl0B,SAAU0oB,GACvE,OAAO4O,EAAEt3B,SAAW0oB,EAAG7rB,EAAEmD,SAAW,CAACs3B,GAAIz6B,KACvCo3B,GAAEvuB,KAAMqxB,IAAI7C,IACd,MAAQl0B,SAAU60B,GAAMX,EACxB,OAAOW,IAAMX,EAAEl0B,SAAW60B,EAAE+C,QAAO,CAAC1C,EAAGr4B,EAAG6rB,KACxC,GAAU,IAANA,EACF,MAAO,CAAC7rB,GACV,MAAMy6B,EAAIpC,EAAEX,IAAI,GAChB,GAAI+C,GAAKA,EAAEO,QAAUh7B,EAAEg7B,OAAQ,CAC7Bh7B,EAAI+2B,GAAEluB,KAAMoxB,IAAG17B,KAAKsK,KAAM7I,EAAGy6B,EAAEx3B,MAC/B,MAAQE,SAAUw3B,KAAME,GAAM76B,GAAKmD,SAAU2oB,KAAMgP,GAAML,EACzD,GAAIz6B,EAAEiD,OAASw3B,EAAEx3B,MAAQ03B,GAAK7O,GAAKqF,KAAKC,UAAUyJ,KAAO1J,KAAKC,UAAU0J,GAAI,CAC1E,MAAMG,EAAI,IACLH,EACH33B,SAAU,IAAI2oB,KAAM6O,IAEtB,OAAOtC,EAAEh3B,MAAM,GAAI,GAAG65B,OAAOnE,GAAEluB,KAAMqxB,IAAG37B,KAAKsK,KAAMoyB,KAGvD,OAAO5C,EAAE6C,OAAOl7B,KACf,KAAMq3B,KACPD,GAAEvuB,KAAMsxB,IAAI9C,IACd,MAAMW,EAAI,IACLX,EAAEqC,MACLz2B,KAAMo0B,EAAEp0B,MAEV,OAAOo0B,EAAEl0B,WAAa60B,EAAE70B,SAAWk0B,EAAEl0B,UAAWk0B,EAAEj4B,QAAU44B,EAAE54B,MAAQi4B,EAAEj4B,OAAQ44B,KAC9EnvB,KAAK6vB,SAAW,CAACrB,EAAGW,EAAGK,KAAOxvB,KAAKgJ,KAAK8nB,GAAEjpB,OAAO2mB,OAAG,EAAQW,EAAGK,IAAKxvB,MAAOuuB,GAAEvuB,KAAMuxB,IAAG,KACxF,MAAM/C,EAAIxuB,KAAKoQ,QACf,OAAO8d,GAAEluB,KAAMwxB,IAAG97B,KAAKsK,KAAMwuB,EAAEp0B,KAAMo0B,EAAEl0B,SAAUk0B,EAAEj4B,MAAOi4B,EAAEqC,UAC1D7wB,KAAK8vB,UAAY,KAAO5B,GAAEluB,KAAMuxB,IAAG77B,KAAKsK,MAAOA,MAAOuuB,GAAEvuB,KAAMwxB,IAAG,CAAChD,EAAGW,EAAGK,EAAGr4B,KAC7E,MAAM6rB,EAAI8N,GAAEjpB,OAAO2mB,EAAGW,EAAGK,EAAGr4B,GAAIy6B,EAAI1D,GAAEluB,KAAMqxB,IAAG37B,KAAKsK,KAAMkuB,GAAEluB,KAAMsxB,IAAG57B,KAAKsK,KAAMgjB,IAChF,OAAOhjB,KAAKhF,KAAK42B,GAAIA,KACnB5xB,KAAKgwB,QAAU,CAACxB,EAAGW,EAAGK,EAAGr4B,KAAO+2B,GAAEluB,KAAMwxB,IAAG97B,KAAKsK,KAAMwuB,EAAGW,EAAGK,EAAGr4B,GAAI6I,MAAOuuB,GAAEvuB,KAAMyxB,IAAG,CAACjD,EAAGW,EAAGK,EAAGr4B,IAAMq3B,EAAE8D,QAAQpE,GAAEluB,KAAM+wB,KAAM/wB,MAAQuuB,GAAEvuB,KAAM+wB,GAAGvC,EAAE0B,SAAShC,GAAEluB,KAAM+wB,MAAM/wB,KAAK6vB,SAASV,EAAGK,EAAG,IAAKr4B,EAAGg7B,QAAQ,OAAS5D,GAAEvuB,KAAM0xB,IAAIlD,IACpOA,EAAE8D,QAAQpE,GAAEluB,KAAM+wB,OAAQxC,GAAEvuB,KAAM+wB,GAAGvC,EAAEp0B,KAAKg2B,cAAclC,GAAEluB,KAAM+wB,MAAM7C,GAAEluB,KAAMuxB,IAAG77B,KAAKsK,UACtFA,KAAKuyB,SAAW,CAAC/D,EAAGW,EAAGK,EAAGr4B,KAAO+2B,GAAEluB,KAAMyxB,IAAG/7B,KAAKsK,KAAMwuB,EAAGW,EAAGK,EAAGr4B,GAAI6I,MAAOA,KAAKmwB,UAAa3B,IAAON,GAAEluB,KAAM0xB,IAAGh8B,KAAKsK,KAAMwuB,GAAIxuB,MAAOA,KAAKswB,MAAQ,KACpJ,IAAI9B,EAAI,KACR,GACEA,EAAIN,GAAEluB,KAAMuxB,IAAG77B,KAAKsK,YACfA,KAAKT,QACZ,OAAOivB,GACNxuB,KAAKjD,KAAQyxB,GAlFV,CAAC9D,GAAM31B,OAAOC,UAAUC,eAAeS,KAAKg1B,EAAG,QAkF/B8H,CAAEhE,IAAMA,EAAEgC,SAASrB,IACvCjB,GAAEluB,KAAMmxB,IAAGz7B,KAAKsK,KAAMmvB,MACpBnvB,OAASkuB,GAAEluB,KAAMmxB,IAAGz7B,KAAKsK,KAAMwuB,GAAIxuB,MAAOA,KAAK7K,SAAYq5B,GAAMA,EAAEjG,UAAUvoB,KAAKswB,SAAUtwB,KAAKklB,IAAOsJ,IAAOxuB,KAAKjD,KAAKyxB,GAAIxuB,MAAOA,KAAKqvB,OAASrB,IAG1J+C,GAAI,IAAIL,QAAWM,GAAI,IAAIN,QAAWO,GAAI,IAAIP,QAAWQ,GAAI,IAAIR,QAAWS,GAAI,IAAIT,QAAWU,GAAI,IAAIV,QAAWW,GAAI,IAAIX,QAAWY,GAAI,IAAIZ,QAAWa,GAAI,IAAIb,QAAWc,GAAI,IAAId,QAAWe,GAAI,IAAIf,QAAWgB,GAAI,IAAIhB,QAAWiB,GAAE9pB,OAAS,CAACmmB,EAAGQ,KACjP,MAAMW,EAAI,IAAIwC,GAAE3D,GAChB,OAAQwB,IAAOL,EAAEjK,IAAIsK,GAAIL,EAAEh6B,SAASq5B,KAEtC,IAAIiE,GAAId,G,4EC9MJe,GAAK,CAAClD,EAAGhB,EAAGN,KACd,IAAKM,EAAEP,IAAIuB,GACT,MAAMzO,UAAU,UAAYmN,IAE5BiB,GAAI,CAACK,EAAGhB,EAAGN,KAAOwE,GAAGlD,EAAGhB,EAAG,2BAA4BN,EAAIA,EAAEx4B,KAAK85B,GAAKhB,EAAEL,IAAIqB,IAAK,GAAI,CAACA,EAAGhB,EAAGN,KAC/F,GAAIM,EAAEP,IAAIuB,GACR,MAAMzO,UAAU,qDAClByN,aAAaH,QAAUG,EAAEzwB,IAAIyxB,GAAKhB,EAAEF,IAAIkB,EAAGtB,IAC1C,GAAI,CAACsB,EAAGhB,EAAGN,EAAG/2B,KAAOu7B,GAAGlD,EAAGhB,EAAG,0BAA2Br3B,EAAIA,EAAEzB,KAAK85B,EAAGtB,GAAKM,EAAEF,IAAIkB,EAAGtB,GAAIA,GAc5F,SAAS,GAAEsB,EAAGhB,GACZ,OAAOgB,EAAE3gB,KAAO,CACd8jB,QAAS,iBACTriB,MAAO,YACJke,GACFgB,EAEL,MAAMoD,GAAK,CACThb,OAAQ,CAAC4X,EAAGhB,EAAGN,EAAG/2B,KAChB,MAAM62B,EAAIwB,EAAExnB,QAAUkmB,EAAE/3B,QAAQyhB,QAAU,IAAKoL,EAAIkL,EAAE1uB,MAAM,UAAWuuB,EAAIG,EAAExP,cAAcvnB,GAC1F,IAAIo6B,EAAIxD,EAAEpP,KAAKqP,EAAIA,GACnB,OAAOuD,GAAKxD,EAAEpP,KACZuP,EAAEtP,kBAAkB4Q,EAAG,CACrB1xB,OAAQyzB,EACRxuB,MAAOirB,KACJD,EAAEpxB,aAEN40B,GAAKxD,EAAEpP,KAAKqP,EAAIA,GAAIhL,IAAKuO,GAE9B9a,SAAU,CAAC+Y,EAAGhB,EAAGN,EAAG/2B,KAClB,MAAM62B,EAAIwB,EAAExnB,QAAUkmB,EAAE/3B,QAAQsgB,UAAY,IAAKuM,EAAIkL,EAAE1uB,MAAM,YAAauuB,EAAIG,EAAExP,cAAcvnB,GAC9F,IAAIo6B,EAAIxD,EAAEpP,KAAKqP,GACf,OAAOuD,GAAKxD,EAAEpP,KACZuP,EAAEtP,kBAAkB4Q,EAAG,CACrB1xB,OAAQyzB,EACRxuB,MAAOirB,KACJD,EAAEpxB,aAEN40B,GAAKxD,EAAEpP,KAAKqP,GAAIhL,IAAKuO,IAEzBsB,IAAI,QAAE,eAST,MAAM,IAAI,QAAE,aAAc,IAAI,QAAE,GAAI,aAAcC,IAAK,QAAE,GAAI,UAAWC,IAAK,QAAE,GAAI,cAAe,IAAI,QAAE,GAAI,gBAAiBC,IAAK,QAAE,GAAI,iBAAkBC,IAAK,QAAE,GAAI,YAAaC,IAAK,QAAE,GAAI,YAAa,IAAI,QAAE,KAAKvhB,IAAI,IAAIA,IAAI,IAAK,UAAW,IAAI,QAAE,CACrPkS,SAAU+O,IACT,0BACH,SAAS/D,GAAGW,GACV,MAAMhB,EAAKN,IAAOA,EAAEiF,OAAOL,GAAItD,GAAG2D,OAAO,GAAG,IAAIA,OAAOH,GAAI,IAAIG,OAAOJ,GAAI,IAAII,OAAOF,GAAI,IAAIE,OAAOD,GAAI,IAAIC,OAAO,GAAG,CACpHtP,SAAU+O,KACTO,OAAO,GAAG,KAAKxhB,IAAI,IAAIA,IAAI,KAAKwhB,OAAO,GAAG,CAACN,KAAIO,OAAO,IAAIC,gBACrDnF,EAAEoF,WAAW,IACnB,MAAMn8B,EAAI+2B,EAAEC,IAAI,IAChB,OAAOD,EAAEI,IAAI,GAAG,KAAK3c,IAAI,IAAIA,IAAI,GAAIxa,IAAK+2B,EAAEzI,KAAK,IAAI,KACnDyI,EAAExzB,OAAOo4B,IAAIp4B,OAAO,IAAGA,OAAOs4B,IAAIt4B,OAAOq4B,IAAIr4B,OAAOu4B,IAAIv4B,OAAOw4B,IAAIx4B,OAAO,IAAGA,OAAO,IAAGA,OAAO,IAAG64B,WAAW,OAGhH,OAAO,GAAE/E,EAAG,CACVgF,YAAa,SACXhF,EAEN,MAAM,IAAI,QAAE,eAAgB,IAAI,QAAE,GAAI,eAAgBvL,IAAI,QAAE,GAAI,UAAWwQ,IAAI,QAAE,GAAI,SAAU,IAAI,QAAE,GAAI,SACzG,SAASC,GAAGlE,GACV,IAAIhB,EACJ,MAAO,IACFgB,EACHmE,SAA8B,OAAnBnF,EAAIgB,EAAEmE,eAAoB,EAASnF,EAAErnB,KAAK+mB,IAAM,CAAG2D,SAAUrC,EAAEqC,YAAa3D,OAG3F,MAAM0F,GAAMpE,IAAOA,EAAE2D,OAAOlQ,GAAG,IAAIkQ,OAAOM,GAAG,IAAIN,OAAO,GAAG,IAAIA,OAAO,GAAG,CAAC,KAAIC,OAAO,IAAIC,gBACjF7D,EAAE8D,WAAW,IACnB,MAAM9E,EAAIgB,EAAErB,IAAI,IAAIh3B,EAAIq4B,EAAErB,IAAI6E,IAAId,QAAO,CAACX,EAAGO,IAAMP,EAAE5f,IAAImgB,EAAE/E,OAAQ+E,EAAE37B,UAAUq4B,GAC/EgB,EAAElB,IAAI,GAAGn3B,GACT,MAAM62B,EAAIj5B,OAAO8+B,YAAYrE,EAAErB,IAAIsF,IAAGtsB,KAAI,EAAEoqB,EAAGO,KAAO,CAACP,EAAGmC,GAAG5B,OAAO9O,EAAIjuB,OAAO8+B,YAAYrE,EAAErB,IAAI,IAAGhnB,KAAI,EAAEoqB,EAAGO,KAAO,CAACP,EAAGmC,GAAG5B,OAAO/D,EAAI,IAAI,KAAG,CAAEuB,MAAOtB,EAAGoB,MAAOpM,IAChK,OAAOwM,EAAElB,IAAIrL,GAAG8K,GAAIyB,EAAE/J,KAAK,IAAI,KAC7B+J,EAAE90B,OAAOuoB,IAAGvoB,OAAO+4B,IAAG/4B,OAAO,IAAGA,OAAO,IAAG64B,WAAW,OAGzD,GAAEK,GAAI,CACJJ,YAAa,WAEf,MAAMM,IAAI,QAAE,eAAgBC,GAAK,KAC/B,MAAM,YACLC,IAAI,QAAED,GAAI,UAAW,IAAI,QAAE,GAAI,eAAgBE,GAAMzE,IAAOA,EAAE2D,OAAOa,GAAGD,IAAIZ,OAAO,GAAG,CAAC,KAAIC,OAAOU,IAAIT,gBACjG7D,EAAE8D,WAAW,IACnB,MAAM9E,EAAIgB,EAAErB,IAAI,IAAID,EAAIsB,EAAErB,IAAIlL,IAC9B,OAAOuM,EAAElB,IAAI0F,GAAG,UAAU9F,EAAGM,IAAKgB,EAAE/J,KAAKqO,IAAI,KAC3CtE,EAAE90B,OAAOs5B,IAAGt5B,OAAO,IAAG64B,WAAWO,OAGrC,GAAEG,GAAI,CACJT,YAAa,WAEf,MAAMU,IAAI,QAAE,mBAAoBC,IAAK,QAAE,GAAI,mBAAoBC,GAAK,KAClE,MAAM,YACLC,IAAK,QAAED,GAAI,cAAeE,GAAM9E,IAAOA,EAAE2D,OAAOkB,GAAID,IAAIjB,OAAOgB,GAAI,CAAC,KAAIf,OAAOc,IAAIb,gBAC9E7D,EAAE8D,WAAWa,IACnB,MAAM3F,EAAIgB,EAAErB,IAAI,IAAID,EAAIsB,EAAErB,IAAIlL,IAC9B,OAAOuM,EAAElB,IAAI+F,GAAI,UAAUnG,EAAGM,IAAKgB,EAAE/J,KAAKyO,IAAI,KAC5C1E,EAAE90B,OAAO25B,IAAI35B,OAAOy5B,IAAIZ,WAAWW,OAGvC,GAAEI,GAAI,CACJd,YAAa,eAEf,MAAMe,IAAK,QAAE,GAAI,gBAAiBnC,IAAI,QAAE,GAAI,eAAgBoC,IAAK,SAAGhF,GAAMA,GAAG,gBAAiBiF,IAAK,QAAE,GAAI,oBAAqB,IAAI,QAAE,oBAUpI,MAAMC,GAAK,IAAI,MAAG,0BAClB,SAASC,GAAGnF,GACV,MAAMhB,GAAI,SACR,MACA,MACA,MACA,OAEF,OAAOgB,EAAEoF,UAAYpG,EAAGgB,EAE1B,MAAMqF,GAAMrF,IAAOA,EAAE2D,OAAOoB,GAAI,IAAIpB,OAAOf,GAAG,IAAIe,OAAOqB,IAAKhG,GAAMA,IAAG2E,OAAOsB,GAAI,CAACX,GAAGI,GAAG,KAAId,OAAO,IAAIC,gBAChG7D,EAAE8D,WAAWmB,IACnB,MAAMjG,EAAIgB,EAAErB,IAAIlL,IAAIiL,EAAIsB,EAAErB,IAAI6F,IAAI78B,EAAIq4B,EAAErB,IAAI4E,IAAK/E,EAAIwB,EAAErB,IAAIqG,IAAKxR,EAAIwM,EAAErB,IAAI,IAAmBoD,EArB/F,SAAY/B,EAAGhB,EAAGN,GAChB,GAAgB,iBAALsB,EACT,OAAOhB,EAAEgB,GACX,GAAe,SAAXA,EAAEp1B,KACJ,OAAO,gBAAc8zB,GAAG/Z,MAAMqb,EAAEsF,KAClC,GAAe,SAAXtF,EAAEp1B,KACJ,OAAO,cAAY8zB,EAAGsB,EAAEj5B,OAC1B,MAAM,SAAGi5B,GAcwFuF,CAAfvF,EAAErB,IAAIoG,IAAerG,EAAGM,GAAIsD,EAAI,IAC7G9O,EACH,IAAI,MAAG,CACLntB,IAAK6+B,GACL1uB,MAAO,CACLgvB,KAAM,OAENtP,MAAO,CAACuP,EAAItH,EAAGuH,EAAIC,KACjB3F,EAAElB,IAAI8D,GAAG+C,QAIf,SAAG,CAAEC,MAAOj+B,KACZ,QAAGw9B,GAAG,SAERnF,EAAElB,IAAI,GAAGwD,GACT,MAAMhD,EAAId,EAAE,CACVqB,OAAQb,EACR/Q,IAAK8T,EACLvE,QAAS8E,IACPf,EAAI,aAAUjC,GAClB,OAAOU,EAAElB,IAAI8D,GAAGrB,GAAIvB,EAAE/J,KAAK,IAAI,KAC7B+J,EAAE90B,OAAO65B,IAAI75B,OAAO03B,IAAG13B,OAAO85B,IAAI95B,OAAO+5B,IAAIlB,WAAW,OAG5D,GAAEsB,GAAI,CACJrB,YAAa,gBAEf,MAAM6B,IAAK,QAAE,mBAAoB,IAAI,QAAE,GAAI,cAAeC,IAAK,QAAE,GAAI,mBAAoBC,IAAK,QAAE,GAAI,qBAAsBC,IAAK,QAAE,KAAM,QAASC,IAAK,QAAE,KAAM,WAAYC,IAAK,QAAE,GAAI,aAUpL,MAAMC,GAAK,IAAI,MAAG,uBAAwBC,GAAMpG,IAAOA,EAAE2D,OAAOqC,GAAI9yB,SAASmzB,MAAM1C,OAAO,GAAG,IAAIA,OAAOoC,GAAI,IAAIpC,OAAOsC,GAAI,MAAMtC,OAAOuC,GAAI,IAAIvC,OAAOmC,GAAI,CAAC,KAAIlC,OAAOiC,IAAKhC,gBACpK7D,EAAEsG,KAAK,IACb,MAAMtH,EAAIgB,EAAErB,IAAIqH,KAAO9yB,SAASmzB,KAAM3H,EAAgB,iBAALM,EAAgB9rB,SAASqzB,cAAcvH,GAAKA,EAC7FgB,EAAEwG,OAAO,IAAIlE,GAAM,CACjB,IAAI,MAAG,CACLj8B,IAAK8/B,GACLtvB,KAAOyoB,IACL,MAAMiC,EAAI7C,EAhBlB,SAAYsB,EAAGhB,GACb,MAAMN,EAAIxrB,SAASuM,cAAc,OACjCif,EAAE+H,UAAY,WAAYzG,EAAE0G,YAAYhI,GAAIM,EAAEF,IAAImH,GAAIvH,GACtD,MAAM/2B,EAAIq3B,EAAEL,IAAIuH,IAChB,OAAO3gC,OAAOohC,QAAQh/B,GAAGq5B,SAAQ,EAAExC,EAAGhL,KAAOkL,EAAEkI,aAAapI,EAAGhL,KAAKkL,EAYhDmI,CAAGnI,EAAGsB,QAAK,EACzB,MAAO,MACL,GAAIuB,GAAK7C,EAAG,CACV,MAAMP,EAAImB,EAAEgG,IACZ5G,EAAEoI,aAAavF,EAAGpD,GAAIoD,EAAEmF,YAAYvI,KAHjC,GAKD,CACJ4I,QAAS,KACF,MAALxF,GAAaA,EAAEyF,aAAoB,MAALzF,GAAaA,EAAEyF,WAAWF,aAAaxH,EAAEgG,IAAK/D,IAAU,MAALA,GAAaA,EAAEr2B,iBAKrGo3B,WACKtC,EAAE8D,WAAWgC,IACvB,MAAMn+B,EAAIq4B,EAAErB,IAAIiE,IAAIpE,EAAIwB,EAAErB,IAAIoH,IAAKvS,EAAIjuB,OAAO8+B,YAAYrE,EAAErB,IAAI8E,KAAMlF,EAAIh5B,OAAO8+B,YAAYrE,EAAErB,IAAI+E,KAAM3B,EAAI,IAAI,MAAGrD,EAAG,CACrHloB,MAAO7O,EACPs/B,UAAWzT,EACX0T,UAAW3I,KACRC,IAEL,OA/BF,SAAYwB,GACVA,EAAEmH,UAAU54B,IAAI,UAAWyxB,EAAE4G,aAAa,OAAQ,WA8B3CQ,CAAGrF,EAAEuD,KAAMtF,EAAElB,IAAI,GAAGiD,GAAI/B,EAAE/J,KAAK4P,IAAK,KACpC,MAAL9D,GAAaA,EAAEgF,UAAW/G,EAAE90B,OAAO86B,IAAI96B,OAAO,IAAGA,OAAO66B,IAAI76B,OAAO+6B,IAAI/6B,OAAOg7B,IAAIh7B,OAAO46B,IAAI/B,WAAW8B,OAM5G,IAAI,GAAG,GAHP,GAAEO,GAAI,CACJpC,YAAa,eAGf,MAAMqD,GACJ7gC,cACE,GAAEgK,KAAM,QAAG,GACX,GAAEA,KAAM,QAAG,GACX,GAAEA,KAAM,GAAG,IAAI,MAAO,GAAEA,KAAM,GAAG,MAAOA,KAAK82B,OAAUtI,IACrD,GAAExuB,KAAM,GAAGwuB,IAGXuI,UACF,OAAO5H,GAAEnvB,KAAM,IAGjB6H,OAAO2mB,EAAGN,GACR,MAAM/2B,EAAIq3B,EAAE3mB,OAAOsnB,GAAEnvB,KAAM,IAAGg3B,UAC9B,OAAO7/B,EAAEm3B,IAAIJ,GAAI/2B,EAEnBg3B,IAAIK,GACF,OAAOW,GAAEnvB,KAAM,IAAGmuB,IAAIK,GAAGL,MAE3BzzB,OAAO8zB,GACL,OAAOW,GAAEnvB,KAAM,IAAGtF,OAAO8zB,GAE3B94B,KAAK84B,EAAGN,GACN,GAAkB,MAAdiB,GAAEnvB,KAAM,IACV,MAAM,WACR,MAAMguB,EAAIhuB,KAAKmuB,IAAIK,EAATxuB,CAAYkuB,GAAIlL,EAAImM,GAAEnvB,KAAM,IAAGmuB,IAAI,IAC7C,OAAOH,EAAEhL,EAAEhd,MAAOgd,EAAEiU,SAAUjU,IAIlC,SAASkU,GAAG1H,EAAI,UACd,OAAO,SAAE,IAAM,KAAM,GAAIA,GAF3B,GAAI,IAAIkB,QAAW,GAAI,IAAIA,QAI3B,MAAMyG,IAAK,QAAE,IAAIN,GAAM,YAAaO,IAAK,QAAE,CAAC,IAAI,iBAAkB,IAAI,QAAE,iBAAkBC,GAAM7H,IAC9F,MAAMhB,EAAI,IAAIqI,GACd,OAAOrI,EAAEsI,OAAOtH,GAAIA,EAAE2D,OAAOgE,GAAI3I,GAAG2E,OAAOiE,GAAI,CAAC,KAAIhE,OAAO,IAAIC,gBAAmB7D,EAAE8D,WAAW8D,IAAK5H,EAAE/J,KAAK,IAAI,KAC7G+J,EAAE90B,OAAOy8B,IAAIz8B,OAAO08B,IAAI7D,WAAW,OAGvC,GAAE8D,GAAI,CACJ7D,YAAa,aAEf,IAAwK,GAAG9I,GAAGsH,GAAGsF,GAAG3wB,GAAG,GAAGirB,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGK,GA6FlN,GAAI,IAAIvB,QAAWhG,GAAI,IAAIgG,QAAWsB,GAAI,IAAItB,QAAW4G,GAAI,IAAI5G,QAAW/pB,GAAI,IAAI+pB,QAAW,GAAI,IAAIA,QAAWkB,GAAI,IAAIlB,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAWuB,GAAI,IAAIvB,QAClR,IAAI6G,GA7FO,MAAMC,EACfxhC,cACE,GAAEgK,KAAM,QAAG,GACX,GAAEA,KAAM0qB,QAAG,GACX,GAAE1qB,KAAMgyB,QAAG,GACX,GAAEhyB,KAAMs3B,QAAG,GACX,GAAEt3B,KAAM2G,QAAG,GACX,GAAE3G,KAAM,QAAG,GACX,GAAEA,KAAM4xB,QAAG,GACX,GAAE5xB,KAAM,QAAG,GACX,GAAEA,KAAM,QAAG,GACX,GAAEA,KAAM,QAAG,GACX,GAAEA,KAAM,QAAG,GACX,GAAEA,KAAM,QAAG,GACX,GAAEA,KAAM,QAAG,GACX,GAAEA,KAAM,QAAG,GACX,GAAEA,KAAMiyB,QAAG,GACX,GAAEjyB,KAAM,IAAG,GAAK,GAAEA,KAAM0qB,GAAG,QAAS,GAAE1qB,KAAMgyB,GAAG,IAAK,GAAEhyB,KAAMs3B,IAAG,SAC3D,GAAEt3B,KAAM2G,GAAG,IAAI,MAAO,GAAE3G,KAAM,GAAG,IAAI,MAAO,GAAEA,KAAM4xB,GAAmB,IAAI6F,KAAQ,GAAEz3B,KAAM,GAAmB,IAAIy3B,KAAQ,GAAEz3B,KAAM,GAAG,IAAI,KAAGmvB,GAAEnvB,KAAM2G,IAAIwoB,GAAEnvB,KAAM,MAAM,GAAEA,KAAM,IAAG,KACnL,MAAMwuB,EAnOZ,SAAYgB,GACV,MAAMhB,EAAKN,IAAOA,EAAEkF,OAAOP,IAAIQ,gBAAmB7D,EAAEtB,GAAIA,EAAEzI,KAAKoN,IAAI,KACjE3E,EAAEqF,WAAWV,OAEf,OAAO,GAAErE,EAAG,CACVgF,YAAa,WACXhF,EA6NUkJ,EAAGrE,MAAOl8B,UACZ40B,QAAQzuB,IAAI6xB,GAAEnvB,KAAMgyB,IAAG7qB,KAAK6mB,GAAMA,EAAE72B,SACxC+2B,EAAI,CACN0F,GACAK,GACAK,GACA+C,GACAxC,GACAe,GACA/G,GAAG7uB,MACHwuB,GAEFW,GAAEnvB,KAAM,IAAGtK,KAAKsK,KAAMkuB,EAAGiB,GAAEnvB,KAAM,QAC/B,GAAEA,KAAM,IAAG,CAACwuB,EAAGN,KACjBM,EAAEgC,SAASr5B,IACT,MAAM62B,EAAImB,GAAEnvB,KAAM,IAAG23B,QAAQxI,GAAEnvB,KAAM,IAAK7I,EAAE0X,UAAO,GAASmU,EAAI7rB,EAAE62B,GAClEE,EAAEI,IAAIn3B,EAAG,CAAE4/B,IAAK/I,EAAGlT,QAASkI,EAAG4U,aAAS,UAExC,GAAE53B,KAAM,IAAG,CAACwuB,EAAGN,GAAI,IAAOnC,QAAQzuB,IACpC,CAACkxB,GAAG+B,OAAOppB,KAAKhQ,IACd,MAAM62B,EAAImB,GAAEnvB,KAAM4xB,IAAGzD,IAAIh3B,GAAI6rB,EAAS,MAALgL,OAAY,EAASA,EAAE4J,QACxD,OAAO1J,EAAIiB,GAAEnvB,KAAM4xB,IAAGiG,OAAO1gC,GAAKg4B,GAAEnvB,KAAM4xB,IAAGtD,IAAIn3B,EAAG,CAAE4/B,SAAK,EAAQjc,aAAS,EAAQ8c,aAAS,IAAuB,mBAAL5U,EAAkBA,IAAMA,QAEvI,GAAEhjB,KAAM,IAAGqzB,gBACPtH,QAAQzuB,IAAI,IAAI6xB,GAAEnvB,KAAM,IAAGm2B,WAAWhvB,KAAI,EAAEqnB,GAAKoJ,QAAS1J,MAAqB,mBAALA,EAAkBA,IAAMA,KAAKiB,GAAEnvB,KAAM,IAAG83B,WACtH,GAAE93B,KAAM,IAAIwuB,IACd,GAAExuB,KAAM0qB,GAAG8D,GAAIW,GAAEnvB,KAAMs3B,IAAG5hC,KAAKsK,KAAMwuB,MACnC,GAAExuB,KAAMiyB,IAAIzD,GAAM,IAAIA,EAAE2H,WAAWhvB,KAAIksB,OAAQnF,EAAG/2B,MACpD,MAAQ4/B,IAAK/I,EAAGlT,QAASkI,GAAM7rB,EAC/B,IAAK6rB,EACH,OACF,MAAM+K,QAAU/K,IAChBwL,EAAEF,IAAIJ,EAAG,CAAE6I,IAAK/I,EAAGlT,QAASkI,EAAG4U,QAAS7J,SACrC/tB,KAAK+3B,gBAAkB,CAACvJ,GAAI,KAAQ,GAAExuB,KAAM,GAAGwuB,GAAIxuB,MAAOA,KAAKg4B,eAAkBxJ,IAAO,GAAExuB,KAAMs3B,GAAG9I,GAAIxuB,MAAOA,KAAKwV,OAAUgZ,IAAOW,GAAEnvB,KAAMgyB,IAAGh3B,KAAKwzB,GAAIxuB,MAAOA,KAAKi4B,aAAgBzJ,IAAO,GAAExuB,KAAMgyB,GAAG7C,GAAEnvB,KAAMgyB,IAAGkG,QAAQhK,GAAMA,IAAMM,KAAKxuB,MAAOA,KAAK2R,IAAO6c,IAChQ,MAAMN,EAAI,CAACM,GAAG+B,OACd,OAAOrC,EAAEqC,OAAOC,SAASr5B,IACvBg4B,GAAEnvB,KAAM4xB,IAAGtD,IAAIn3B,EAAG,CAChB4/B,SAAK,EACLjc,aAAS,EACT8c,aAAS,OAEM,YAAfzI,GAAEnvB,KAAM0qB,KAAoByE,GAAEnvB,KAAM,IAAGtK,KAAKsK,KAAMkuB,EAAGiB,GAAEnvB,KAAM4xB,KAAK5xB,MACrEA,KAAKtF,OAAS24B,MAAO7E,GAAqB,aAAfW,GAAEnvB,KAAM0qB,KAAqByN,QAAQC,KAAK,8HAA+H,IAAIrM,SAASmC,IAClNmK,YAAW,KACTnK,EAAEluB,KAAKtF,OAAO8zB,MACb,eACQW,GAAEnvB,KAAM,IAAGtK,KAAKsK,KAAM,CAACwuB,GAAG+B,QAAQ,GAAKvwB,MAAOA,KAAK6H,OAASwrB,UAA2B,aAAflE,GAAEnvB,KAAM0qB,MAA2C,YAAfyE,GAAEnvB,KAAM0qB,WAA0B1qB,KAAKu2B,UAAWpH,GAAEnvB,KAAM,IAAGtK,KAAKsK,KAAM,YAAamvB,GAAEnvB,KAAM,IAAGtK,KAAKsK,MAAOmvB,GAAEnvB,KAAM,IAAGtK,KAAKsK,KAAM,IAAImvB,GAAEnvB,KAAM4xB,IAAG0G,QAASnJ,GAAEnvB,KAAM4xB,WAAW7F,QAAQzuB,IAC5S,CACE6xB,GAAEnvB,KAAMiyB,IAAGv8B,KAAKsK,KAAMmvB,GAAEnvB,KAAM,KAC9BmvB,GAAEnvB,KAAMiyB,IAAGv8B,KAAKsK,KAAMmvB,GAAEnvB,KAAM4xB,MAC9BrB,QACDpB,GAAEnvB,KAAM,IAAGtK,KAAKsK,KAAM,YALwFA,MAKrEA,KAAKu2B,QAAUlD,MAAO7E,GAAI,IAAsB,cAAfW,GAAEnvB,KAAM0qB,KAAqC,cAAfyE,GAAEnvB,KAAM0qB,IAAqB1qB,KAAsB,aAAfmvB,GAAEnvB,KAAM0qB,IAAoB,IAAIqB,SAASmC,IACtLmK,YAAW,KACTnK,EAAEluB,KAAKu2B,QAAQ/H,MACd,QACCA,GAAK,GAAExuB,KAAMgyB,GAAG,IAAK7C,GAAEnvB,KAAM,IAAGtK,KAAKsK,KAAM,mBAAoBmvB,GAAEnvB,KAAM,IAAGtK,KAAKsK,KAAM,IAAImvB,GAAEnvB,KAAM4xB,IAAG0G,QAAS9J,SAAUW,GAAEnvB,KAAM,IAAGtK,KAAKsK,MAAOmvB,GAAEnvB,KAAM,IAAGtK,KAAKsK,KAAM,aAAcA,MAAOA,KAAKu4B,OAAU/J,GAAMA,EAAEW,GAAEnvB,KAAM,KAAKA,KAAKw4B,QAAU,IAAMrJ,GAAEnvB,KAAM,IAAK,IAAImvB,GAAEnvB,KAAM,IAAGzF,YAAa40B,GAAEnvB,KAAM4xB,IAAGr3B,UAAU4M,KAAI,EAAG4vB,IAAKvI,MAChU,IAAIN,EACJ,OAAiD,OAAzCA,EAAS,MAALM,OAAY,EAASA,EAAEiK,gBAAqB,EAASvK,EAAEwK,UAClER,QAAQ1J,KAAQA,KAAM2J,QAAQC,KAAK,6IAA8I,IAGtLpJ,cACE,OAAO,IAAIwI,EAGTT,UACF,OAAO5H,GAAEnvB,KAAM,IAGb24B,aACF,OAAOxJ,GAAEnvB,KAAM0qB,O,wKCrUfkH,EAAGL,EAAGS,E,WAzBNN,EAAI,CAACnD,EAAGY,EAAGh4B,KACb,IAAKg4B,EAAElB,IAAIM,GACT,MAAMxN,UAAU,UAAY5pB,IAE5Bq4B,EAAI,CAACjB,EAAGY,EAAGh4B,KAAOu6B,EAAEnD,EAAGY,EAAG,2BAA4Bh4B,EAAIA,EAAEzB,KAAK64B,GAAKY,EAAEhB,IAAII,IAAKvL,EAAI,CAACuL,EAAGY,EAAGh4B,KAC9F,GAAIg4B,EAAElB,IAAIM,GACR,MAAMxN,UAAU,qDAClBoO,aAAad,QAAUc,EAAEpxB,IAAIwwB,GAAKY,EAAEb,IAAIC,EAAGp3B,IAC1C62B,EAAI,CAACO,EAAGY,EAAGh4B,EAAG+2B,KAAOwD,EAAEnD,EAAGY,EAAG,0BAA2BjB,EAAIA,EAAEx4B,KAAK64B,EAAGp3B,GAAKg4B,EAAEb,IAAIC,EAAGp3B,GAAIA,GAE3F,MAAM22B,EACJ93B,cACEgK,KAAKg3B,SAA2B,IAAIS,IAAOz3B,KAAKmuB,IAAOgB,IACrD,MAAMh4B,EAAgB,iBAALg4B,EAAgB,IAAInvB,KAAKg3B,SAASz8B,UAAUg1B,MAAMrB,GAAMA,EAAE9zB,KAAKhE,OAAS+4B,IAAKnvB,KAAKg3B,SAAS7I,IAAIgB,EAAEjL,IAClH,IAAK/sB,EAAG,CACN,MAAM+2B,EAAgB,iBAALiB,EAAgBA,EAAIA,EAAE/4B,KACvC,MAAM,QAAE83B,GAEV,OAAO/2B,GACN6I,KAAKtF,OAAUy0B,IAChB,MAAMh4B,EAAgB,iBAALg4B,EAAgB,IAAInvB,KAAKg3B,SAASz8B,UAAUg1B,MAAMrB,GAAMA,EAAE9zB,KAAKhE,OAAS+4B,IAAKnvB,KAAKg3B,SAAS7I,IAAIgB,EAAEjL,IAClH/sB,GAAK6I,KAAKg3B,SAASa,OAAO1gC,EAAEiD,KAAK8pB,KAChClkB,KAAKiuB,IAAOkB,GAAkB,iBAALA,EAAgB,IAAInvB,KAAKg3B,SAASz8B,UAAU+nB,MAAMnrB,GAAMA,EAAEiD,KAAKhE,OAAS+4B,IAAKnvB,KAAKg3B,SAAS/I,IAAIkB,EAAEjL,KAIjI,MAAMkO,EAEJp8B,YAAYm5B,EAAGh4B,EAAG+2B,GAChBlL,EAAEhjB,KAAM4xB,OAAG,GAEX5O,EAAEhjB,KAAMuxB,OAAG,GACXvO,EAAEhjB,KAAMgyB,OAAG,GACXhE,EAAEhuB,KAAM4xB,EAAG,IAAK5D,EAAEhuB,KAAMgyB,GAAG,KACzBxC,EAAExvB,KAAM4xB,GAAGpB,SAAShC,GAAMA,EAAEgB,EAAExvB,KAAMuxB,SAClCvxB,KAAKsuB,IAAOE,IACdR,EAAEhuB,KAAMuxB,EAAG/C,GAAIgB,EAAExvB,KAAMgyB,GAAGt8B,KAAKsK,OAC9BA,KAAKmuB,IAAM,IAAMqB,EAAExvB,KAAMuxB,GAAIvxB,KAAKg2B,OAAUxH,IAC7CR,EAAEhuB,KAAMuxB,EAAG/C,EAAEgB,EAAExvB,KAAMuxB,KAAM/B,EAAExvB,KAAMgyB,GAAGt8B,KAAKsK,OAC1CA,KAAK5F,KAAO8zB,EAAGF,EAAEhuB,KAAMuxB,EAAGp6B,GAAIg4B,EAAEb,IAAIJ,EAAEhK,GAAIlkB,MAI/C44B,GAAGzJ,GACD,OAAOK,EAAExvB,KAAM4xB,GAAG52B,KAAKm0B,GAAI,KACzBnB,EAAEhuB,KAAM4xB,EAAGpC,EAAExvB,KAAM4xB,GAAGsG,QAAQ/gC,GAAMA,IAAMg4B,MAM9C0J,KAAK1J,GACH,MAAMh4B,EAAI6I,KAAK44B,IAAI1K,IACjBiB,EAAEjB,GAAI/2B,OAER,OAAOA,EAGT2hC,IAAI3J,GACFnB,EAAEhuB,KAAM4xB,EAAGpC,EAAExvB,KAAM4xB,GAAGsG,QAAQ/gC,GAAMA,IAAMg4B,KAG5C4J,SACE/K,EAAEhuB,KAAM4xB,EAAG,KAGfA,EAAI,IAAIlB,QAAWa,EAAI,IAAIb,QAAWsB,EAAI,IAAItB,QAC9C,MAAMoD,EAGJ99B,YAAYm5B,EAAGh4B,GACb6I,KAAKkkB,GAAKU,OAAO,WAAWztB,KAAM6I,KAAK5J,KAAOe,EAAG6I,KAAKg5B,cAAgB7J,EAAGnvB,KAAKi5B,UAAY,KACxF,MAAM,WAKVpxB,OAAOsnB,EAAGh4B,EAAI6I,KAAKg5B,eACjB,OAAO,IAAI5G,EAAEjD,EAAGh4B,EAAG6I,OAGvB,MAAM2wB,EAAI,CAACpC,EAAGY,IAAM,IAAI2E,EAAEvF,EAAGY,GAC7B,IAAImI,EAAGjG,EAAGC,EAAGH,EAAGlC,EAAG6C,EAAGjE,EAAGH,EAAG0D,EA0DxB9T,EAAGyT,EAAG9N,EAAGmL,EAzDb,MAAMznB,EAEJ3Q,YAAYm5B,EAAGh4B,EAAG+2B,GAEhBlL,EAAEhjB,KAAMs3B,OAAG,GAEXtU,EAAEhjB,KAAMqxB,OAAG,GAEXrO,EAAEhjB,KAAMsxB,OAAG,GACXtO,EAAEhjB,KAAMmxB,OAAG,GACXnO,EAAEhjB,KAAMivB,OAAG,GACXjM,EAAEhjB,KAAM8xB,OAAG,GACX9O,EAAEhjB,KAAM6tB,OAAG,GACX7K,EAAEhjB,KAAM0tB,OAAG,GACX1K,EAAEhjB,KAAMoxB,OAAG,GACXpD,EAAEhuB,KAAMmxB,EAAmB,IAAI+H,KAAQlL,EAAEhuB,KAAMivB,EAAmB,IAAIiK,KAAQlL,EAAEhuB,KAAM8xB,EAAmB,IAAI2F,KAAQzJ,EAAEhuB,KAAM6tB,EAAmB,IAAI4J,KAAQz3B,KAAK04B,KAAO,KAAM,CAC5KS,SAAU3J,EAAExvB,KAAMs3B,GAClB8B,eAAgB,IAAI5J,EAAExvB,KAAMmxB,IAAIhqB,KAAKqnB,IAAM,CACzCp4B,KAAkB,iBAALo4B,EAAgBA,EAAIA,EAAEp4B,KACnCG,MAAOi5B,EAAExvB,KAAM0tB,GAAGh4B,KAAKsK,KAAMwuB,OAE/B6K,eAAgB,IAAI7J,EAAExvB,KAAMivB,IAAI9nB,KAAKqnB,IAAM,CACzCp4B,KAAkB,iBAALo4B,EAAgBA,EAAIA,EAAEp4B,KACnCG,MAAOi5B,EAAExvB,KAAM0tB,GAAGh4B,KAAKsK,KAAMwuB,OAE/B8K,eAAgB,IAAI9J,EAAExvB,KAAM8xB,IAAI3qB,KAAI,EAAEqnB,GAAK+K,SAAUxL,OAAS,CAC5D33B,KAAMo4B,EAAEp4B,KACRmjC,SAAUxL,EACV4K,OAAQnJ,EAAExvB,KAAMoxB,GAAG17B,KAAKsK,KAAMwuB,OAEhC8E,WAAY,IAAI9D,EAAExvB,KAAM6tB,IAAI1mB,KAAI,EAAEqnB,GAAK+K,SAAUxL,OAAS,CACxD33B,KAAMo4B,EAAEp4B,KACRmjC,SAAUxL,EACV4K,OAAQnJ,EAAExvB,KAAMoxB,GAAG17B,KAAKsK,KAAMwuB,SAE9BxuB,KAAKw5B,SAAYhL,IACnBgB,EAAExvB,KAAM8xB,GAAGxD,IAAIE,EAAG,CAAE/2B,MAAOgiC,KAAKz3B,MAAOu3B,SAAU,KAChDv5B,KAAK05B,QAAWlL,IACjBgB,EAAExvB,KAAM8xB,GAAG+F,OAAOrJ,IACjBxuB,KAAK25B,OAAUnL,IAChB,MAAMT,EAAIyB,EAAExvB,KAAM8xB,GAAG3D,IAAIK,GACzBT,IAAMA,EAAEwL,SAAWE,KAAKz3B,MAAQ+rB,EAAEt2B,QACjCuI,KAAK45B,OAAS,CAACpL,EAAGT,KACnB,MAAMiD,EAAIyI,KAAKz3B,MACf+rB,EAAE8L,SAAQ,KACRrK,EAAExvB,KAAM6tB,GAAGS,IAAIE,EAAG,CAAE+K,SAAUE,KAAKz3B,MAAQgvB,QAE5ChxB,KAAK85B,SAAYtL,IAClBgB,EAAExvB,KAAMmxB,GAAGpzB,IAAIywB,IACdxuB,KAAK+5B,SAAYvL,IAClBgB,EAAExvB,KAAMmxB,GAAG0G,OAAOrJ,IACjBxuB,KAAKg6B,MAASxL,IACfgB,EAAExvB,KAAMivB,GAAGlxB,IAAIywB,IACdR,EAAEhuB,KAAM0tB,GAAIc,GAAMgB,EAAExvB,KAAMqxB,GAAGlD,IAAIK,GAAGL,QAAQH,EAAEhuB,KAAMoxB,GAAI5C,GAAMgB,EAAExvB,KAAMsxB,GAAGnD,IAAIK,GAAGmK,SAAS3K,EAAEhuB,KAAMqxB,EAAGlC,GAAInB,EAAEhuB,KAAMsxB,EAAGn6B,GAAI62B,EAAEhuB,KAAMs3B,EAAGpJ,IAGzIoJ,EAAI,IAAI5G,QAAWW,EAAI,IAAIX,QAAWY,EAAI,IAAIZ,QAAWS,EAAI,IAAIT,QAAWzB,EAAI,IAAIyB,QAAWoB,EAAI,IAAIpB,QAAW7C,EAAI,IAAI6C,QAAWhD,EAAI,IAAIgD,QAAWU,EAAI,IAAIV,QAiDhKpT,EAAI,IAAIoT,QAAWK,EAAI,IAAIL,QAAWzN,EAAI,IAAIyN,QAAWtC,EAAI,IAAIsC,QACjE,IAAIhC,EAhDM,MAAMmE,EAEd78B,YAAYm5B,EAAGh4B,EAAG+2B,GAEhBlL,EAAEhjB,KAAMsd,OAAG,GAEX0F,EAAEhjB,KAAM+wB,OAAG,GAEX/N,EAAEhjB,KAAMijB,OAAG,GAEXD,EAAEhjB,KAAMouB,OAAG,GACXpuB,KAAK23B,QAAWnJ,GAAMA,GAAKz5B,OAAOujC,KAAK9J,GAAGp3B,OAAS,IAAIy7B,EAAErD,EAAExvB,KAAMsd,GAAIkS,EAAExvB,KAAM+wB,GAAI,IAAKvC,IAAOxuB,KAAMA,KAAKmzB,OAAS,CAAC3E,EAAGT,KACnH,IAAIN,EACJ,MAAMuD,EAAIxC,EAAE3mB,OAAO2nB,EAAExvB,KAAMsd,GAAG0Z,UAC9B,OAAY,MAALjJ,GAAaiD,EAAE1C,IAAIP,GAAwB,OAAnBN,EAAI+B,EAAExvB,KAAMouB,KAAeX,EAAEqM,SAAStL,GAAIxuB,MACxEA,KAAKtF,OAAU8zB,IAChB,IAAIT,EACJ,OAAOyB,EAAExvB,KAAMsd,GAAG5iB,OAAO8zB,GAAwB,OAAnBT,EAAIyB,EAAExvB,KAAMouB,KAAeL,EAAEgM,SAASvL,GAAIxuB,MACvEA,KAAKozB,OAAU5E,IAChB,IAAIT,EACJ,OAAOS,EAAE3mB,OAAO2nB,EAAExvB,KAAM+wB,GAAGnpB,OAA4B,OAAnBmmB,EAAIyB,EAAExvB,KAAMouB,KAAeL,EAAEyL,SAAShL,GAAIxuB,MAC7EA,KAAKuzB,WAAc/E,IACpB,IAAIT,EACJ,OAAOyB,EAAExvB,KAAM+wB,GAAGr2B,OAAO8zB,GAAwB,OAAnBT,EAAIyB,EAAExvB,KAAMouB,KAAeL,EAAE2L,QAAQlL,GAAIxuB,MACtEA,KAAKi6B,WAAczL,GAAMgB,EAAExvB,KAAMsd,GAAG2Q,IAAIO,GAAIxuB,KAAKk6B,WAAc1L,GAAMgB,EAAExvB,KAAM+wB,GAAG9C,IAAIO,GAAIxuB,KAAK2R,IAAO6c,IACrG,IAAIT,EACJ,OAA2B,OAAnBA,EAAIyB,EAAExvB,KAAMouB,KAAeL,EAAEiM,MAAMxL,GAAIgB,EAAExvB,KAAMsd,GAAG6Q,IAAIK,IAC7DxuB,KAAKmuB,IAAOK,GAAMxuB,KAAK2R,IAAI6c,GAAGL,MAAOnuB,KAAKsuB,IAAM,CAACE,EAAGT,IAAM/tB,KAAK2R,IAAI6c,GAAGF,IAAIP,GAAI/tB,KAAKg2B,OAAS,CAACxH,EAAGT,IAAM/tB,KAAK2R,IAAI6c,GAAGwH,OAAOjI,GAAI/tB,KAAKm6B,MAAS3L,GAAMgB,EAAExvB,KAAM+wB,GAAG5C,IAAIK,GAAIxuB,KAAKylB,KAAQ+I,IAClL,IAAIT,EACJ/tB,KAAKm6B,MAAM3L,GAAG/I,OAA4B,OAAnBsI,EAAIyB,EAAExvB,KAAMouB,KAAeL,EAAE4L,OAAOnL,IAC1DxuB,KAAK81B,KAAQtH,IACd,IAAIwC,EACJ,MAAMjD,EAAI/tB,KAAKm6B,MAAM3L,GAAG/2B,QACxB,OAA2B,OAAnBu5B,EAAIxB,EAAExvB,KAAMouB,KAAe4C,EAAE4I,OAAOpL,EAAGT,GAAIA,GAClD/tB,KAAKszB,WAAaD,MAAO7E,UACpBzC,QAAQzuB,IAAI0C,KAAKmuB,IAAIK,GAAGrnB,KAAK4mB,GAAM/tB,KAAK81B,KAAK/H,OAClDC,EAAEhuB,KAAMsd,EAAG6R,GAAInB,EAAEhuB,KAAM+wB,EAAG55B,GAAI62B,EAAEhuB,KAAMijB,EAAGiL,GAAIA,GAAKF,EAAEhuB,KAAMouB,EAAG,IAAIznB,EAAEwoB,EAAGh4B,EAAG+2B,IAG1Erf,WACF,OAAO2gB,EAAExvB,KAAMijB,GAGbwV,gBACF,OAAOjJ,EAAExvB,KAAMouB,KAKnB,MAAM0C,EACJ96B,cACEgK,KAAK4H,MAAwB,IAAI6vB,IAAOz3B,KAAKmuB,IAAOgB,IAClD,MAAMh4B,EAAI6I,KAAK4H,MAAMumB,IAAIgB,EAAEjL,IAC3B,IAAK/sB,EACH,MAAM,QAAEg4B,EAAE/4B,MACZ,OAAOe,GACN6I,KAAKtF,OAAUy0B,IAChBnvB,KAAK4H,MAAMiwB,OAAO1I,EAAEjL,KACnBlkB,KAAKiuB,IAAOkB,GAAMnvB,KAAK4H,MAAMqmB,IAAIkB,EAAEjL,KAG1C,IAAIuN,EAAGD,EAAGN,EAAGxG,EAAGuH,EAAGrE,EACnB,MAAMgD,EAEJ56B,YAAYm5B,EAAGh4B,GACb6rB,EAAEhjB,KAAMyxB,OAAG,GACXzO,EAAEhjB,KAAMwxB,OAAG,GAEXxO,EAAEhjB,KAAMkxB,OAAG,GACXlO,EAAEhjB,KAAM0qB,OAAG,GACX1H,EAAEhjB,KAAMiyB,OAAG,GACXjP,EAAEhjB,KAAM4tB,OAAG,GACXI,EAAEhuB,KAAMyxB,EAAG,MAAOzD,EAAEhuB,KAAMwxB,EAAG,MAAOxD,EAAEhuB,KAAM0qB,EAAG,WAAY1qB,KAAKvI,MAAQ,KAAO+3B,EAAExvB,KAAMyxB,IAAMzD,EAAEhuB,KAAMyxB,EAAG,IAAI1F,SAAQ,CAACmC,EAAGM,KACtHR,EAAEhuB,KAAMwxB,GAAIzD,IACVA,aAAaqM,aAAerM,EAAEsM,OAAOnW,KAAOsL,EAAExvB,KAAMkxB,KAAOlD,EAAEhuB,KAAM0qB,EAAG,YAAa8E,EAAExvB,KAAMiyB,GAAGv8B,KAAKsK,MAAO+tB,EAAEuM,2BAA4BpM,QACtIsB,EAAExvB,KAAM4tB,GAAGl4B,KAAKsK,MAAM,KACT,YAAfwvB,EAAExvB,KAAM0qB,IAAoBsD,EAAEhuB,KAAM0qB,EAAG,YAAa8E,EAAExvB,KAAMiyB,GAAGv8B,KAAKsK,MAAOwuB,EAAE,IAAI/S,MAAM,UAAUzb,KAAK5F,KAAKhE,qBACzG43B,EAAEhuB,KAAM0qB,EAAG,WAAY6P,iBAAiBv6B,KAAK5F,KAAKhE,KAAMo5B,EAAExvB,KAAMwxB,QACjEhC,EAAExvB,KAAMyxB,IAAKzxB,KAAKylB,KAAO,KAC5B,MAAMyI,EAAI,IAAIkM,YAAYp6B,KAAK5F,KAAKhE,KAAM,CAAEikC,OAAQ,CAAEnW,GAAIsL,EAAExvB,KAAMkxB,MAClEsJ,cAActM,IACbF,EAAEhuB,KAAMiyB,GAAG,KACZzC,EAAExvB,KAAMwxB,IAAMiJ,oBAAoBz6B,KAAK5F,KAAKhE,KAAMo5B,EAAExvB,KAAMwxB,OACxDxD,EAAEhuB,KAAM4tB,GAAIM,IACdmK,YAAW,KACTnK,MACCluB,KAAK5F,KAAKsgC,YACX1M,EAAEhuB,KAAMkxB,EAAGtM,OAAOztB,EAAEf,OAAQ4J,KAAK5F,KAAOjD,EAAGg4B,EAAEb,IAAIn3B,EAAE+sB,GAAIlkB,MAIzD24B,aACF,OAAOnJ,EAAExvB,KAAM0qB,IAGnB+G,EAAI,IAAIf,QAAWc,EAAI,IAAId,QAAWQ,EAAI,IAAIR,QAAWhG,EAAI,IAAIgG,QAAWuB,EAAI,IAAIvB,QAAW9C,EAAI,IAAI8C,QACvG,MAAMO,EAGJj7B,YAAYm5B,EAAGh4B,EAAI,KACjB6I,KAAK6H,OAAUqmB,GAAM,IAAI0C,EAAE1C,EAAGluB,MAAOA,KAAKkkB,GAAKU,OAAO,SAASuK,KAAMnvB,KAAK5J,KAAO+4B,EAAGnvB,KAAK06B,QAAUvjC,GAGvG,MAAMs7B,EAAI,CAAClE,EAAGY,EAAI,MAAQ,IAAI8B,EAAE1C,EAAGY,I,4UCpPnC,IAAInB,EAAoB,CAAEwB,IAAOA,EAAEmL,aAAe,eAAgBnL,EAAEoL,gBAAkB,kBAAmBpL,EAAEqL,cAAgB,gBAAiBrL,EAAEsL,kBAAoB,oBAAqBtL,EAAEuL,uBAAyB,yBAA0BvL,EAAEwL,cAAgB,gBAAiBxL,EAAEyL,iBAAmB,mBAAoBzL,EAAE0L,qBAAuB,uBAAwB1L,EAAE2L,sBAAwB,wBAAyB3L,EAAE4L,mBAAqB,qBAAsB5L,EAAE6L,4BAA8B,8BAA+B7L,EAAE8L,mBAAqB,qBAAsB9L,EAAE+L,oBAAsB,sBAAuB/L,EAAEgM,oBAAsB,sBAAuBhM,EAAEiM,WAAa,aAAcjM,EAAEkM,cAAgB,gBAAiBlM,GAA3rB,CAA+rBxB,GAAK,IAC5tB,MAAMQ,UAAU/S,MACdzlB,YAAYu4B,EAAGvL,GACbmD,MAAMnD,GAAIhjB,KAAK5J,KAAO,gBAAiB4J,KAAKrC,KAAO4wB,GAGvD,MAAMqD,EAAI,CAACpC,EAAGjB,IAAkB,mBAALA,EAAkB,aAAeA,EAAGp3B,EAAKq4B,GAAMlH,KAAKC,UAAUiH,EAAGoC,GAC5F,SAASb,EAAEvB,GACT,OAAO,IAAIhB,EAAER,EAAE2M,aAAc,qCAAqCxjC,EAAEq4B,MAEtE,SAASlS,EAAEkS,GACT,OAAO,IAAIhB,EAAER,EAAE4M,gBAAiB,YAAYpL,6CAE9C,SAASsC,EAAEtC,GACT,OAAO,IAAIhB,EAAER,EAAE6M,cAAe,UAAUrL,6CAE1C,SAAS9E,IACP,OAAO,IAAI8D,EAAER,EAAE8M,kBAAmB,gDAEpC,SAAStJ,KAAKhC,GACZ,MAAMjB,EAAIiB,EAAE0C,QAAO,CAAClP,EAAGoL,KACrB,IAAKA,EACH,OAAOpL,EACT,MAAMmM,EAAKjB,GAAMz4B,MAAMF,QAAQ24B,GAAKA,EAAE/mB,KAAKoqB,GAAMpC,EAAEoC,KAAIh5B,KAAK,MAAQ21B,EAAEyN,OAASxkC,EAAE+2B,EAAEyN,UAAYzN,EAAEuB,KAAOt4B,EAAE+2B,EAAEuB,MAAQvB,EAAE/4B,WACtH,MAAO,GAAG6tB,MAAMmM,EAAEf,OACjB,wDACH,OAAO,IAAII,EAAER,EAAE+M,uBAAwBxM,GAEzC,SAASR,IACP,OAAO,IAAIS,EAAER,EAAEgN,cAAe,kDAEhC,SAAS7J,EAAE3B,GACT,OAAO,IAAIhB,EAAER,EAAEiN,iBAAkB,wCAAwC9jC,EAAEq4B,OAE7E,SAAS7B,EAAE6B,GACT,OAAO,IAAIhB,EAAER,EAAEkN,qBAAsB,4CAA4C/jC,EAAEq4B,OAKrF,SAASP,EAAEO,GACT,OAAO,IAAIhB,EAAER,EAAEoN,mBAAoB,gCAAgCjkC,EAAEq4B,OAEvE,SAASwC,IACP,OAAO,IAAIxD,EACTR,EAAEqN,4BACF,mJASJ,SAASxN,EAAE2B,GACT,OAAO,IAAIhB,EACTR,EAAEuN,oBACF,iDAAiD/L,iBAGrD,SAAS6B,EAAE7B,GACT,OAAO,IAAIhB,EACTR,EAAEwN,oBACF,iDAAiDhM,mB,2IChEtC,SAASoM,EAAmBtkC,GAC1C,GAAsB,kBAAXA,EACV,MAAM,IAAIypB,UAAU,qBAKrB,OAAOzpB,EACLgT,QAAQ,sBAAuB,QAC/BA,QAAQ,KAAM,SCTF,SAAS,EAAmBhT,GAC1C,GAAsB,kBAAXA,EACV,MAAM,IAAIypB,UAAU,qBAKrB,OAAOzpB,EACLgT,QAAQ,sBAAuB,QAC/BA,QAAQ,KAAM,SC8/DjB,MAvgEqB,CAEpB,CAAC,OAAK,MACN,CAAC,SAAK,MACN,CAAC,OAAK,MACN,CAAC,OAAK,MACN,CAAC,OAAK,MACN,CAAC,OAAK,MACN,CAAC,OAAK,MACN,CAAC,OAAK,MAGN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,MACN,CAAC,OAAK,KACN,CAAC,OAAK,MACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,MACN,CAAC,SAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,MACN,CAAC,SAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,MACN,CAAC,OAAK,MACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,MACN,CAAC,OAAK,KACN,CAAC,OAAK,MACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,MACN,CAAC,SAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,MACN,CAAC,SAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,MACN,CAAC,OAAK,KACN,CAAC,SAAK,MAGN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,eAAM,KACP,CAAC,SAAK,KACN,CAAC,eAAM,KACP,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,IACN,CAAC,SAAK,IACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,IACN,CAAC,SAAK,IACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,OAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,OACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,IAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAcN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,eAAM,MACP,CAAC,eAAM,MAGP,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KA0CN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KAGN,CAAC,SAAK,MACN,CAAC,SAAK,MAWN,CAAC,OAAK,KACN,CAAC,OAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KAGP,CAAC,eAAM,KACP,CAAC,eAAM,KAGP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OAGN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KAGN,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,OACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,MACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,KACN,CAAC,SAAK,MACN,CAAC,SAAK,KAGN,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,SAAK,MACN,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,MAGP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,eAAM,MAGP,CAAC,eAAM,OACP,CAAC,eAAM,QACP,CAAC,eAAM,OACP,CAAC,eAAM,OACP,CAAC,eAAM,QACP,CAAC,eAAM,OACP,CAAC,eAAM,MACP,CAAC,eAAM,OACP,CAAC,eAAM,QACP,CAAC,eAAM,QACP,CAAC,eAAM,QACP,CAAC,eAAM,QACP,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,gBAAO,KACR,CAAC,eAAM,MACP,CAAC,qBAAO,KACR,CAAC,qBAAO,KACR,CAAC,eAAM,MACP,CAAC,eAAM,MACP,CAAC,qBAAO,KACR,CAAC,eAAM,KACP,CAAC,eAAM,OACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,KACP,CAAC,eAAM,MCx/DO,SAASuxB,EAAcvkC,EAAQnB,GAC7C,GAAsB,kBAAXmB,EACV,MAAM,IAAIypB,UAAU,mCAAmCzpB,OAGxDnB,EAAU,CACT2lC,mBAAoB,MACjB3lC,GAGJ,MAAM2lC,EAAqB,IAAIrE,IAAI,IAC/B,KACAthC,EAAQ2lC,qBAOZ,OAHAxkC,EAzB4B,EAACA,EAAQykC,KACrC,IAAK,MAAOlmC,EAAKU,KAAUwlC,EAE1BzkC,EAASA,EAAOgT,QAAQ,IAAI5R,OAAO,EAAmB7C,GAAM,KAAMU,GAGnE,OAAOe,GAmBE0kC,CADT1kC,EAASA,EAAO+wB,YACsByT,GACtCxkC,EAASA,EAAO+wB,UAAU,OAAO/d,QAAQ,kBAAmB,IAAI+d,YCvBjE,MANgC,CAC/B,CAAC,IAAK,SACN,CAAC,eAAM,aACP,CAAC,SAAK,WCsCQ,SAAS4T,EAAQ3kC,EAAQnB,GACvC,GAAsB,kBAAXmB,EACV,MAAM,IAAIypB,UAAU,mCAAmCzpB,OAcxD,MAAM4kC,GAXN/lC,EAAU,CACTgmC,UAAW,IACXC,WAAW,EACXC,YAAY,EACZP,mBAAoB,GACpBQ,2BAA2B,EAC3BC,sBAAsB,EACtBC,mBAAoB,MACjBrmC,IAGoCmmC,2BAA6BhlC,EAAOmlC,WAAW,KACjFC,EAAmBvmC,EAAQomC,sBAAwBjlC,EAAOqlC,SAAS,KAOzErlC,EAASukC,EAAcvkC,EAAQ,CAACwkC,mBALL,IAAIrE,IAAI,IAC/B,KACAthC,EAAQ2lC,uBAKR3lC,EAAQkmC,aACX/kC,EAhEiBA,IACXA,EAELgT,QAAQ,oBAAqB,SAC7BA,QAAQ,yBAA0B,SAElCA,QAAQ,oBAAqB,SAG7BA,QAAQ,8BAA+B,SAuD/B+xB,CAAW/kC,IAGrB,MAAMslC,EA/CkBzmC,KACxB,IAAI0mC,EAAqB,SAGzB,GAFAA,GAAsB1mC,EAAQimC,UAAY,GAAK,MAE3CjmC,EAAQqmC,mBAAmBplC,OAAS,EACvC,IAAK,MAAM+mB,KAAahoB,EAAQqmC,mBAAoB,CACnD,GAAIre,IAAchoB,EAAQgmC,UACzB,MAAM,IAAI1gB,MAAM,6BAA6BtlB,EAAQgmC,2DAA2DhmC,EAAQqmC,sBAGzHK,GAAsBjB,EAAmBzd,GAI3C,OAAO,IAAIzlB,OAAO,KAAKmkC,MAAwB,MAiC3BC,CAAiB3mC,GAyBrC,OAvBIA,EAAQimC,YACX9kC,EAASA,EAAOqC,eAQjBrC,GADAA,GAFAA,EAASA,EAAOgT,QAAQ,8BAA+B,WAEvCA,QAAQsyB,EAAazmC,EAAQgmC,YAC7B7xB,QAAQ,MAAO,IAE3BnU,EAAQgmC,YACX7kC,EArE2B,EAACA,EAAQ6kC,KACrC,MAAMY,EAAmBnB,EAAmBO,GAE5C,OAAO7kC,EACLgT,QAAQ,IAAI5R,OAAO,GAAGqkC,QAAwB,KAAMZ,GACpD7xB,QAAQ,IAAI5R,OAAO,IAAIqkC,KAAoBA,KAAqB,KAAM,KAgE9DC,CAAqB1lC,EAAQnB,EAAQgmC,YAG3CD,IACH5kC,EAAS,IAAIA,KAGVolC,IACHplC,EAAS,GAAGA,MAGNA,E,qCC8ER,SAAS2lC,EAAaC,GAClB,OAAO,SAAUl3B,EAAOixB,GACpB,IAAI,MAAEkG,EAAK,IAAEC,GAAQp3B,EAAMq3B,UACvBC,EAAQH,EAAMI,WAAWH,GAAKjjC,GAAQA,EAAKqjC,WAAa,GAAKrjC,EAAKsjC,WAAWrjC,MAAQ8iC,IACzF,QAAKI,KAEArG,IAEDkG,EAAMhjC,KAAKmjC,EAAMvhB,MAAQ,GAAG3hB,MAAQ8iC,EAMhD,SAAyBl3B,EAAOixB,EAAUiG,EAAUI,GAChD,IAAII,EAAK13B,EAAM03B,GAAIhmC,EAAM4lC,EAAM5lC,IAAKimC,EAAYL,EAAMF,IAAI1lC,IAAI4lC,EAAMvhB,OAChErkB,EAAMimC,IAGND,EAAGE,KAAK,IAAI,KAAkBlmC,EAAM,EAAGimC,EAAWjmC,EAAKimC,EAAW,IAAI,KAAM,UAAcT,EAASr1B,OAAO,KAAMy1B,EAAMhc,OAAOvqB,SAAU,EAAG,GAAI,GAAG,IACjJumC,EAAQ,IAAI,KAAUI,EAAGjgB,IAAIpa,QAAQi6B,EAAMH,MAAM/nB,KAAMsoB,EAAGjgB,IAAIpa,QAAQs6B,GAAYL,EAAMvhB,QAE5F,MAAM7lB,GAAS,QAAWonC,GAC1B,GAAc,MAAVpnC,EACA,OAAO,EACXwnC,EAAGG,KAAKP,EAAOpnC,GACf,IAAI6M,EAAQ26B,EAAGI,QAAQ32B,IAAIzP,GAAM,GAAK,GAClC,QAAQgmC,EAAGjgB,IAAK1a,IAChB26B,EAAGnlC,KAAKwK,GAEZ,OADAk0B,EAASyG,EAAGK,mBACL,EArBQC,CAAgBh4B,EAAOixB,EAAUiG,EAAUI,GAuB9D,SAAuBt3B,EAAOixB,EAAUqG,GACpC,IAAII,EAAK13B,EAAM03B,GAAIjjC,EAAO6iC,EAAMhc,OAEhC,IAAK,IAAIlM,EAAMkoB,EAAM5lC,IAAKP,EAAImmC,EAAMn3B,SAAW,EAAGqpB,EAAI8N,EAAMr3B,WAAY9O,EAAIq4B,EAAGr4B,IAC3Eie,GAAO3a,EAAK4pB,MAAMltB,GAAG8mC,SACrBP,EAAG7F,OAAOziB,EAAM,EAAGA,EAAM,GAE7B,IAAI8oB,EAASR,EAAGjgB,IAAIpa,QAAQi6B,EAAM7lC,OAAQiJ,EAAOw9B,EAAOC,UACxD,GAAIT,EAAGI,QAAQ32B,IAAIm2B,EAAM5lC,MAAQ4lC,EAAM7lC,MAAQymC,EAAOC,UAAUF,SAC5D,OAAO,EACX,IAAIG,EAA8B,GAApBd,EAAMr3B,WAAiBo4B,EAAQf,EAAMn3B,UAAY1L,EAAK+iC,WAChElc,EAAS4c,EAAO/jC,MAAM,GAAImkC,EAAcJ,EAAOvmC,OAAO,GAC1D,IAAK2pB,EAAOid,WAAWD,GAAeF,EAAU,EAAI,GAAIE,EAAc,EAAG59B,EAAKd,QAAQ4+B,OAAOH,EAAQ,WAAiB,UAAc5jC,KAChI,OAAO,EACX,IAAIhD,EAAQymC,EAAO9oB,IAAK1d,EAAMD,EAAQiJ,EAAKu9B,SAO3C,OAHAP,EAAGE,KAAK,IAAI,KAAkBnmC,GAAS2mC,EAAU,EAAI,GAAI1mC,GAAO2mC,EAAQ,EAAI,GAAI5mC,EAAQ,EAAGC,EAAM,EAAG,IAAI,MAAO0mC,EAAU,WAAiB,UAAc3jC,EAAK1D,KAAK,cAC7JynC,OAAOH,EAAQ,WAAiB,UAAc5jC,EAAK1D,KAAK,cAAmBqnC,EAAU,EAAI,EAAGC,EAAQ,EAAI,GAAID,EAAU,EAAI,IAC/HnH,EAASyG,EAAGK,mBACL,EA1CQU,CAAcz4B,EAAOixB,EAAUqG,M,yBClIlD,SAASoB,EAAMnoC,GACb,OAAOuI,OAAOvI,GAAS,IAAIgU,c,eC3Cd,SAASo0B,IAStB,OAAO,SAAUlkB,GACf,MAAMjQ,EDIH,SAAqBiQ,GAE1B,MAAMmkB,EAAQ,IAAInH,IAElB,IAAKhd,IAASA,EAAKrgB,KACjB,MAAM,IAAIqhB,MAAM,wCAUlB,OAPA,QAAMhB,EAAM,cAAc,SAAUjQ,GAClC,MAAM0Z,EAAKwa,EAAMl0B,EAAWC,YACxByZ,IAAO0a,EAAMzQ,IAAIjK,IACnB0a,EAAMtQ,IAAIpK,EAAI1Z,MAOlB,SAAoBC,GAClB,MAAMyZ,EAAKwa,EAAMj0B,GACjB,OAAOm0B,EAAMzQ,IAAIjK,ICxBE2a,CAAYpkB,IAE/B,QAAMA,GAAM,SAAUtgB,EAAMxC,EAAO2pB,GACjC,GACgB,eAAdnnB,EAAKC,WACMtC,IAAXwpB,GACiB,kBAAV3pB,EAGP,OADA2pB,EAAOhnB,SAASE,OAAO7C,EAAO,GACvB,CAAC,KAAMA,GAGhB,GAAkB,mBAAdwC,EAAKC,MAA2C,kBAAdD,EAAKC,KAA0B,CACnE,MAAMgN,EAAMoD,EAAWrQ,EAAKsQ,YAE5B,GAAIrD,GAAOka,GAA2B,kBAAV3pB,EAU1B,OATA2pB,EAAOhnB,SAAS3C,GACA,mBAAdwC,EAAKC,KACD,CAACA,KAAM,QAAS0hB,IAAK1U,EAAI0U,IAAKD,MAAOzU,EAAIyU,MAAOxhB,IAAKF,EAAKE,KAC1D,CACED,KAAM,OACN0hB,IAAK1U,EAAI0U,IACTD,MAAOzU,EAAIyU,MACXvhB,SAAUH,EAAKG,UAEhB,CAAC,KAAM3C,QClCxB,SAASk3B,EAAGL,EAAGgB,GACb,IAAIjB,EACJ,KAAMiB,EAAEgO,YAAc,GAA4D,eAAjC,OAApBjP,EAAIiB,EAAEsP,gBAAqB,EAASvQ,EAAEn0B,KAAKhE,OAEtE,YADAo4B,EAAEzxB,KAAKyyB,EAAE5vB,SAGX,MAAMojB,EAAI,GACVwM,EAAE5vB,QAAQ4wB,SAAQ,CAACrB,EAAG4B,EAAG55B,KACvBA,IAAMq4B,EAAEgO,WAAa,GAAKxa,EAAEhoB,KAAKm0B,MAC/BX,EAAEzxB,KAAK,eAAaimB,IAE1B,SAASgL,EAAEQ,EAAGgB,GACZ,OAAOz6B,OAAO8G,OAAO2yB,EAAG,CACtB3f,KAAM,CACJ8jB,QAAS,iCACNnD,KAEHhB,EAEN,MAAMgE,GAAI,QAAE,YACZxE,EAAEwE,EAAG,CACHgB,YAAa,iBACbljB,MAAO,aAET,MAAMghB,GAAI,QAAE,YAAa9C,IAAM,CAC7BO,MAAO,CACL/mB,OAAQ,CACN+2B,QAASvQ,EAAEL,IAAI,MAAI1X,UAAY,MAGnCkd,SAAU,CACR,CAAEqL,IAAK,KACP,CAAEA,IAAK,MACP,CAAE/c,MAAO,aAAcgd,SAAWzP,GAAY,WAANA,IAE1C0P,MAAQ1P,GAAM,CAAC,KAAMhB,EAAEL,IAAIqE,EAAE38B,IAAR24B,CAAagB,IAClCE,cAAe,CACbj2B,MAAQ+1B,GAAiB,aAAXA,EAAEp1B,KAChBu1B,OAAQ,CAACH,EAAGtB,EAAGlL,KACbwM,EAAES,SAASjN,EAAG,CAAEhb,OAAQkmB,EAAElmB,SAAWwnB,EAAEzyB,KAAKmxB,EAAE5zB,UAAWk1B,EAAEW,UAAUnN,KAGzES,WAAY,CACVhqB,MAAQ+1B,GAAsB,aAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVsB,EAAE+C,SAASrE,EAAG,gBAAY,EAAQ,CAChClmB,OAAQkmB,EAAEa,MAAM/mB,eAKxBgmB,EAAEsD,EAAE6N,KAAM,CACR3L,YAAa,uBACbljB,MAAO,aAET0d,EAAEsD,EAAEyF,IAAK,CACPvD,YAAa,0BACbljB,MAAO,aAET,MAAM6jB,GAAK,QAAE,kBAAmB3F,GAAM,KAAM,QAAE8C,EAAEl3B,KAAKo0B,MACrDR,EAAEmG,EAAI,CACJX,YAAa,iCACbljB,MAAO,aAET,MAAM8uB,GAAK,SAAG5Q,IAAM,QAAE,yBAA0B8C,EAAEl3B,KAAKo0B,GAAI,CACzD6Q,eAAgB,EAAGC,UAAW9P,EAAG/3B,MAAOy2B,KAAQsB,EAAEiN,WAAW,KAAO,GAAK,CAAE6C,UAAW9P,EAAEh3B,MAAM,GAAIf,MAAOy2B,EAAI,OAE/GF,EAAEoR,EAAI,CACJ5L,YAAa,2BACbljB,MAAO,aAET,MAAMonB,GAAK,SAAGlJ,IAAM,QAAE,uBAAwB8C,EAAEl3B,KAAKo0B,GAAI,CACvD6Q,eAAgB,EAAGC,UAAW9P,EAAG/3B,MAAOy2B,KAAQsB,EAAEiN,WAAW,KAAO,GAAK,CAAE6C,UAAW9P,EAAEh3B,MAAM,GAAIf,MAAOy2B,EAAI,OAE/GF,EAAE0J,EAAI,CACJlE,YAAa,iCACbljB,MAAO,aAET,MAAM+jB,GAAK,QAAE,iBAAkB,CAC7BkL,eAAgB,CACdC,UAAW,QACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKy+B,EAAGt+B,SAI7Bm4B,EAAEqG,EAAG0C,IAAK,CACRvD,YAAa,sBACbljB,MAAO,aAET0d,EAAEqG,EAAGmL,UAAW,CACdhM,YAAa,mBACbljB,MAAO,aAET,MAAMikB,GAAK,QAAE,UACbvG,EAAEuG,EAAI,CACJf,YAAa,eACbljB,MAAO,WAET,MAAM4jB,GAAI,QAAE,UAAW1F,IAAM,CAC3BO,MAAO,CACL/mB,OAAQ,CACN+2B,QAASvQ,EAAEL,IAAI,MAAIvW,QAAU,MAGjC+b,SAAU,CACR,CAAEqL,IAAK,KACP,CAAEA,IAAK,UACP,CAAE/c,MAAO,aAAcgd,SAAWzP,GAAY,SAANA,IAE1C0P,MAAQ1P,GAAM,CAAC,SAAUhB,EAAEL,IAAIoG,EAAG1+B,IAAT24B,CAAcgB,IACvCE,cAAe,CACbj2B,MAAQ+1B,GAAiB,WAAXA,EAAEp1B,KAChBu1B,OAAQ,CAACH,EAAGtB,EAAGlL,KACbwM,EAAES,SAASjN,EAAG,CAAEhb,OAAQkmB,EAAElmB,SAAWwnB,EAAEzyB,KAAKmxB,EAAE5zB,UAAWk1B,EAAEW,UAAUnN,KAGzES,WAAY,CACVhqB,MAAQ+1B,GAAsB,WAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVsB,EAAE+C,SAASrE,EAAG,cAAU,EAAQ,CAC9BlmB,OAAQkmB,EAAEa,MAAM/mB,eAKxBgmB,EAAEkG,EAAEiL,KAAM,CACR3L,YAAa,qBACbljB,MAAO,WAET0d,EAAEkG,EAAE6C,IAAK,CACPvD,YAAa,wBACbljB,MAAO,WAET,MAAMilB,GAAK,QAAE,gBAAiB/G,GAAM,KAAM,QAAE0F,EAAE95B,KAAKo0B,MACnDR,EAAEuH,EAAI,CACJ/B,YAAa,+BACbljB,MAAO,WAET,MAAMovB,GAAK,SAAGlR,IAAM,QAAE,kCAAmC0F,EAAE95B,KAAKo0B,MAChER,EAAE0R,EAAI,CACJlM,YAAa,oBACbljB,MAAO,WAET,MAAM+kB,GAAK,QAAE,eAAgB,CAC3BsK,WAAY,CACVH,UAAW,CAAC,SACZC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAK6/B,EAAG1/B,SAI7Bm4B,EAAEqH,EAAG0B,IAAK,CACRvD,YAAa,oBACbljB,MAAO,WAET0d,EAAEqH,EAAGmK,UAAW,CACdhM,YAAa,iBACbljB,MAAO,WAET,MAAMglB,GAAK,QAAE,cACbtH,EAAEsH,EAAI,CACJ9B,YAAa,mBACbljB,MAAO,eAET,MAAM+gB,GAAI,QAAE,cAAe7C,IAAM,CAC/BqD,SAAU,IACVl0B,MAAM,EACNiiC,WAAW,EACXjM,SAAU,CAAC,CAAEqL,IAAK,SAClBE,MAAQ1P,GAAM,CAAC,OAAQhB,EAAEL,IAAImH,EAAGz/B,IAAT24B,CAAcgB,IACrCE,cAAe,CACbj2B,MAAQ+1B,GAAiB,eAAXA,EAAEp1B,KAChBu1B,OAAQ,CAACH,EAAGtB,EAAGlL,KACbwM,EAAES,SAASjN,GAAIwM,EAAEa,QAAQnC,EAAE33B,OAAQi5B,EAAEW,UAAUnN,KAGnDS,WAAY,CACVhqB,MAAQ+1B,GAAsB,eAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,EAAGlL,KACbwM,EAAE+C,SAASrE,EAAG,aAAclL,EAAE/e,MAAQ,UAI5C+pB,EAAEqD,EAAE8N,KAAM,CACR3L,YAAa,yBACbljB,MAAO,eAET0d,EAAEqD,EAAE0F,IAAK,CACPvD,YAAa,4BACbljB,MAAO,eAET,MAAMkkB,GAAK,QAAE,oBAAqBhG,GAAM,IAAM,CAACgB,EAAGtB,KAChD,MAAQmP,UAAWra,EAAG0a,GAAInP,GAAMiB,EAChC,GAAIxM,EAAE6c,MACJ,OAAO,EACT,MAAQ/kC,KAAMq0B,EAAG2Q,GAAI/O,GAAM/N,EAC3B,OAAOwM,EAAE/R,IAAIsiB,aAAa5Q,EAAG4B,EAAGM,EAAEj3B,KAAKo0B,KAAY,MAALN,GAAaA,EAAEK,EAAEyR,WAAW7Q,EAAG4B,EAAGM,EAAEj3B,KAAKo0B,MAAM,IAAOz5B,OAAOujC,KAAK9I,EAAEH,OAAOD,OAAO8I,QAAQ3G,GAAMA,IAAMF,EAAEj3B,KAAKhE,OAAM+Q,KAAKoqB,GAAM/B,EAAEH,OAAOD,MAAMmC,KAAIf,SAASe,IACtMhD,EAAEyR,WAAW7Q,EAAG4B,EAAGQ,MACZ,MAALrD,GAAaA,EAAEK,EAAE0R,QAAQ9Q,EAAG4B,EAAGM,EAAEj3B,KAAKo0B,GAAG3mB,YAAY,MAE3DmmB,EAAEwG,EAAI,CACJhB,YAAa,mCACbljB,MAAO,eAET,MAAMsmB,GAAK,SAAGpI,IAAM,QAAE,wBAAyB6C,EAAEj3B,KAAKo0B,MACtDR,EAAE4I,EAAI,CACJpD,YAAa,iCACbljB,MAAO,eAET,MAAM4vB,GAAK,QAAE,mBAAoB,CAC/BC,iBAAkB,CAChBX,UAAW,QACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAK8+B,EAAG3+B,SAI7Bm4B,EAAEkS,EAAGnJ,IAAK,CACRvD,YAAa,wBACbljB,MAAO,eAET0d,EAAEkS,EAAGV,UAAW,CACdhM,YAAa,qBACbljB,MAAO,eAET,MAAMmkB,GAAK,QAAE,QACbzG,EAAEyG,EAAI,CACJjB,YAAa,aACbljB,MAAO,SAET,MAAMwe,GAAI,QAAE,QAASN,IAAM,CACzBO,MAAO,CACLnG,KAAM,GACN/M,MAAO,CAAEkjB,QAAS,OAEpBpL,SAAU,CACR,CACEqL,IAAK,UACLC,SAAWzP,IACT,KAAMA,aAAa4Q,aACjB,MAAM,QAAE5Q,GACV,MAAO,CAAE5G,KAAM4G,EAAE6Q,aAAa,QAASxkB,MAAO2T,EAAE6Q,aAAa,aAInEnB,MAAQ1P,GAAM,CAAC,IAAK,IAAKhB,EAAEL,IAAIsG,EAAG5+B,IAAT24B,CAAcgB,MAAOA,EAAET,QAChDW,cAAe,CACbj2B,MAAQ+1B,GAAiB,SAAXA,EAAEp1B,KAChBu1B,OAAQ,CAACH,EAAGtB,EAAGlL,KACb,MAAMuL,EAAIL,EAAEpS,IAAKqT,EAAIjB,EAAErS,MACvB2T,EAAES,SAASjN,EAAG,CAAE4F,KAAM2F,EAAG1S,MAAOsT,IAAMK,EAAEzyB,KAAKmxB,EAAE5zB,UAAWk1B,EAAEW,UAAUnN,KAG1ES,WAAY,CACVhqB,MAAQ+1B,GAAsB,SAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVsB,EAAE+C,SAASrE,EAAG,YAAQ,EAAQ,CAC5BrS,MAAOqS,EAAEa,MAAMlT,MACfC,IAAKoS,EAAEa,MAAMnG,aAKrBoF,EAAEc,EAAEqQ,KAAM,CACR3L,YAAa,mBACbljB,MAAO,SAET,MAAMgwB,GAAK,QAAE,cAAe9R,GAAM,CAACgB,EAAI,MAAO,QAAEV,EAAE10B,KAAKo0B,GAAIgB,KAC3DxB,EAAEsS,EAAI,CACJ9M,YAAa,6BACbljB,MAAO,SAET,MAAMqkB,GAAK,QAAE,cAAenG,GAAM,CAACgB,EAAI,KAAO,CAACtB,EAAGlL,KAChD,IAAKA,EACH,OAAO,EACT,IAAIuL,EAAGY,GAAK,EACZ,MAAQkO,UAAWtM,GAAM7C,GAAKpzB,KAAM3D,EAAG2oC,GAAIxiB,GAAMyT,EACjD,GAAI7C,EAAEzQ,IAAI8iB,aAAappC,EAAGA,IAAMmmB,EAAIA,EAAI,EAAIA,GAAG,CAAC0U,EAAG/O,KACjD,GAAI6L,EAAE10B,KAAKo0B,GAAG8D,QAAQN,EAAE5C,OACtB,OAAOb,EAAIyD,EAAG7C,EAAIlM,GAAG,MACpBsL,EACH,OAAO,EACT,MAAMgD,EAAIhD,EAAEa,MAAMG,MAAK,EAAGn1B,KAAM43B,KAAQA,IAAMlD,EAAE10B,KAAKo0B,KACrD,IAAK+C,EACH,OAAO,EACT,MAAM7G,EAAIyE,EAAGvB,EAAIuB,EAAIZ,EAAE0P,UAAYP,GAAIlM,GAAMtD,EAAGuD,EAAI3C,EAAE10B,KAAKo0B,GAAG3mB,OAAO,IAAK0pB,EAAExC,SAAUS,IACtF,QAAOiC,IAAKzO,EACVwO,EAAEwO,WAAWtV,EAAGkD,EAAG2D,GAAG0O,QAAQvV,EAAGkD,EAAG6D,GAAG+O,aAAa,IAAI,KAAEhP,EAAE6L,UAAUoD,UAAU1C,mBAC/E,MAEL/P,EAAE2G,EAAI,CACJnB,YAAa,6BACbljB,MAAO,SAET,MAAMokB,GAAK,QAAG,OAAO,KAAM,CACzB90B,QAAS,SACT8vB,cAAe,CACbj2B,MAAO,EAAGW,KAAMo0B,KAAc,SAANA,EACxBmB,OAAQ,CAACnB,EAAGgB,EAAGtB,KACbM,EAAEoB,WAAWJ,EAAGtB,KAGpBzK,WAAY,CACVhqB,MAAQ+0B,GAAsB,QAAhBA,EAAEp0B,KAAKhE,KACrBu5B,OAAQ,CAACnB,EAAGgB,KACVhB,EAAEqB,SAAS,QAASrB,EAAEzxB,KAAKyyB,EAAE5vB,eAInCouB,EAAE0G,EAAI,CACJlB,YAAa,kBACbljB,MAAO,QAET,MAAMowB,GAAK,QAAE,aACb1S,EAAE0S,EAAI,CACJlN,YAAa,kBACbljB,MAAO,cAET,MAAM2gB,GAAI,QAAE,aAAczC,IAAM,CAC9B5uB,QAAS,UACT0Q,MAAO,QACPqjB,SAAU,CAAC,CAAEqL,IAAK,MAClBE,MAAQ1P,GAAM,CAAC,IAAKhB,EAAEL,IAAIuS,EAAG7qC,IAAT24B,CAAcgB,GAAI,GACtCE,cAAe,CACbj2B,MAAQ+1B,GAAiB,cAAXA,EAAEp1B,KAChBu1B,OAAQ,CAACH,EAAGtB,EAAGlL,KACbwM,EAAEK,SAAS7M,GAAIkL,EAAE5zB,SAAWk1B,EAAEzyB,KAAKmxB,EAAE5zB,UAAYk1B,EAAEa,QAAQnC,EAAE33B,OAAS,IAAKi5B,EAAEM,cAGjFrM,WAAY,CACVhqB,MAAQ+1B,GAAsB,cAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVsB,EAAEK,SAAS,aAAchB,EAAGW,EAAGtB,GAAIsB,EAAEM,kBAI3C9B,EAAEiD,EAAE92B,KAAM,CACRq5B,YAAa,wBACbljB,MAAO,cAET0d,EAAEiD,EAAE8F,IAAK,CACPvD,YAAa,2BACbljB,MAAO,cAET,MAAM8mB,GAAK,QAAE,gBAAiB5I,GAAM,KAAM,QAAEyC,EAAE72B,KAAKo0B,MACnDR,EAAEoJ,EAAI,CACJ5D,YAAa,+BACbljB,MAAO,cAET,MAAM0iB,GAAK,QAAE,kBAAmB,CAC9B2N,aAAc,CACZnB,UAAW,YACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAK0hC,EAAGvhC,SAI7Bm4B,EAAEgF,EAAG+D,IAAK,CACRvD,YAAa,uBACbljB,MAAO,cAET0d,EAAEgF,EAAGwM,UAAW,CACdhM,YAAa,oBACbljB,MAAO,cAET,MAAMswB,EAAKnrC,MAAM,GAAGorC,KAAK,GAAG15B,KAAI,CAACqnB,EAAGgB,IAAMA,EAAI,IAI9C,MAAM4B,GAAI,SAHV,SAAY5C,GACV,OAAO,EAAGA,EAAElf,eAEG,sBACjB0e,EAAEoD,EAAG,CACHoC,YAAa,0BACbljB,MAAO,YAET,MAAMklB,GAAK,QAAE,WACbxH,EAAEwH,EAAI,CACJhC,YAAa,gBACbljB,MAAO,YAET,MAAMqgB,IAAI,QAAE,WAAYnC,IACtB,MAAMgB,EAAIhB,EAAEL,IAAIiD,EAAEv7B,KAClB,MAAO,CACL+J,QAAS,UACT0Q,MAAO,QACPwwB,UAAU,EACV/R,MAAO,CACL7K,GAAI,CACF6a,QAAS,IAEXgC,MAAO,CACLhC,QAAS,IAGbpL,SAAUiN,EAAGz5B,KAAK+mB,IAAM,CACtB8Q,IAAK,IAAI9Q,IACT+Q,SAAWjc,IACT,KAAMA,aAAaod,aACjB,MAAM,QAAEpd,GACV,MAAO,CAAE+d,MAAO7S,EAAGhK,GAAIlB,EAAEkB,SAG7Bgb,MAAQhR,GAAM,CACZ,IAAIA,EAAEa,MAAMgS,QACZ,IACKvS,EAAEL,IAAIqH,EAAG3/B,IAAT24B,CAAcN,GACjBhK,GAAIgK,EAAEa,MAAM7K,IAAMsL,EAAEtB,IAEtB,GAEFwB,cAAe,CACbj2B,MAAO,EAAGW,KAAM8zB,KAAc,YAANA,EACxByB,OAAQ,CAACzB,EAAGlL,EAAGuL,KACb,MAAMY,EAAInM,EAAEjH,MACZmS,EAAE2B,SAAStB,EAAG,CAAEwS,MAAO5R,IAAMjB,EAAEnxB,KAAKimB,EAAE1oB,UAAW4zB,EAAE4B,cAGvDrM,WAAY,CACVhqB,MAAQy0B,GAAsB,YAAhBA,EAAE9zB,KAAKhE,KACrBu5B,OAAQ,CAACzB,EAAGlL,KACVkL,EAAE2B,SAAS,eAAW,EAAQ,CAAE9T,MAAOiH,EAAE+L,MAAMgS,QAAUlS,EAAGX,EAAGlL,GAAIkL,EAAE4B,kBAK7E9B,EAAE2C,GAAEx2B,KAAM,CACRq5B,YAAa,sBACbljB,MAAO,YAET0d,EAAE2C,GAAEoG,IAAK,CACPvD,YAAa,yBACbljB,MAAO,YAET,MAAM0wB,IAAK,SAAGxS,IAAM,QAAG,oBAAqBmC,GAAEv2B,KAAKo0B,IAAKgB,IACtD,IAAIuB,EAAG55B,EACP,MAAM+2B,GAAyD,OAAnD/2B,EAAsB,OAAjB45B,EAAIvB,EAAEyR,aAAkB,EAASlQ,EAAEmQ,aAAkB,EAAS/pC,EAAEC,SAAW,EAAG4rB,EAAIwL,EAAEL,IAAI,OAAOgP,MAAO5O,GAAMvL,EAAEhd,MAAMq3B,UAAWlO,EAAIZ,EAAEp0B,OACtJ,GAAoB,YAAhBg1B,EAAE/0B,KAAKhE,KAAoB,CAC7B,IAAIknB,EAAIje,OAAO8vB,EAAEJ,MAAMgS,OAAS1hC,OAAO6uB,GACvC,OAAO5Q,EAAI,IAAMA,EAAI,GAAI,CAAEyjB,MAAOzjB,GAEpC,MAAO,CAAEyjB,MAAO7S,QAElBF,EAAEgT,GAAI,CACJxN,YAAa,oCACbljB,MAAO,YAET,MAAMuiB,IAAI,QAAE,iBAAkBrE,GAAOgB,IAAOA,IAAMA,EAAI,GAAIA,EAAI,GAAI,QAAEyB,EAAE72B,KAAKo0B,KAAM,QAAEmC,GAAEv2B,KAAKo0B,GAAI,CAAEuS,MAAOvR,OACvGxB,EAAE6E,GAAG,CACHW,YAAa,gCACbljB,MAAO,YAET,MAAMyiB,IAAK,QAAE,oBAAqBvE,GAAM,IAAM,CAACgB,EAAGtB,EAAGlL,KACnD,MAAQma,MAAO5O,GAAMiB,EAAE6N,UAAWlO,EAAIZ,EAAEp0B,OACxC,GAAIg1B,EAAE/0B,OAASu2B,GAAEv2B,KAAKo0B,KAAOgB,EAAE6N,UAAUwC,OAA4B,IAAnBtR,EAAE4S,aAClD,OAAO,EACT,MAAMpQ,EAAI5B,EAAEJ,MAAMgS,MAAQ,EAC1B,OAAOhQ,GAAU,MAAL7C,GAAaA,EACvBsB,EAAEkO,GAAG0D,cAAc5R,EAAE6N,UAAUF,MAAMr/B,cAAU,EAAQ,IAClDqxB,EAAEJ,MACLgS,MAAOhQ,MAER,IAAM,QAAEE,EAAE72B,KAAKo0B,GAAT,CAAagB,EAAGtB,EAAGlL,MAE9BgL,EAAE+E,GAAI,CACJS,YAAa,mCACbljB,MAAO,YAET,MAAMolB,IAAK,QAAE,gBAAiB,CAC5B2L,WAAY,CACV7B,UAAW,YACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKm9B,GAAEh9B,IAAK,KAG/ByrC,WAAY,CACV9B,UAAW,YACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKm9B,GAAEh9B,IAAK,KAG/B0rC,WAAY,CACV/B,UAAW,YACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKm9B,GAAEh9B,IAAK,KAG/B2rC,WAAY,CACVhC,UAAW,YACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKm9B,GAAEh9B,IAAK,KAG/B4rC,WAAY,CACVjC,UAAW,YACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKm9B,GAAEh9B,IAAK,KAG/B6rC,WAAY,CACVlC,UAAW,YACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKm9B,GAAEh9B,IAAK,KAG/B8rC,iBAAkB,CAChBnC,UAAW,CAAC,SAAU,aACtBC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKq9B,GAAGl9B,SAI7Bm4B,EAAE0H,GAAGqB,IAAK,CACRvD,YAAa,qBACbljB,MAAO,YAET0d,EAAE0H,GAAG8J,UAAW,CACdhM,YAAa,kBACbljB,MAAO,YAET,MAAM4iB,IAAK,QAAE,cACblF,EAAEkF,GAAI,CACJM,YAAa,mBACbljB,MAAO,eAET,MAAMsgB,IAAI,QAAE,cAAepC,IAAM,CAC/B5uB,QAAS,SACT0Q,MAAO,QACPwwB,UAAU,EACVnN,SAAU,CAAC,CAAEqL,IAAK,eAClBE,MAAQ1P,GAAM,CAAC,aAAchB,EAAEL,IAAI+E,GAAGr9B,IAAT24B,CAAcgB,GAAI,GAC/CE,cAAe,CACbj2B,MAAO,EAAGW,KAAMo1B,KAAc,eAANA,EACxBG,OAAQ,CAACH,EAAGtB,EAAGlL,KACbwM,EAAEK,SAAS7M,GAAGjmB,KAAKmxB,EAAE5zB,UAAUw1B,cAGnCrM,WAAY,CACVhqB,MAAQ+1B,GAAsB,eAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVsB,EAAEK,SAAS,cAAc9yB,KAAKmxB,EAAEtuB,SAASkwB,kBAI/C9B,EAAE4C,GAAEz2B,KAAM,CACRq5B,YAAa,yBACbljB,MAAO,eAET0d,EAAE4C,GAAEmG,IAAK,CACPvD,YAAa,4BACbljB,MAAO,eAET,MAAMykB,IAAK,SAAGvG,IAAM,QAAE,WAAYoC,GAAEx2B,KAAKo0B,MACzCR,EAAE+G,GAAI,CACJvB,YAAa,uCACbljB,MAAO,eAET,MAAMwiB,IAAK,QAAE,oBAAqBtE,GAAM,KAAM,QAAEoC,GAAEx2B,KAAKo0B,MACvDR,EAAE8E,GAAI,CACJU,YAAa,mCACbljB,MAAO,eAET,MAAMsxB,IAAK,QAAE,mBAAoB,CAC/BC,iBAAkB,CAChBrC,UAAW,cACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKo9B,GAAGj9B,SAI7Bm4B,EAAE4T,GAAG7K,IAAK,CACRvD,YAAa,wBACbljB,MAAO,eAET0d,EAAE4T,GAAGpC,UAAW,CACdhM,YAAa,qBACbljB,MAAO,eAET,MAAM2iB,IAAK,QAAE,aAAa,KAAM,CAC9B6O,IAAK,GACLnkC,KAAM,OAERqwB,EAAEiF,GAAI,CACJO,YAAa,kBACbljB,MAAO,cAET,MAAMwjB,IAAI,QAAE,cAAetF,IAAM,CAC/B5uB,QAAS,QACT0Q,MAAO,QACP8e,MAAO,GACP0R,UAAU,EACVnjC,MAAM,EACNoxB,MAAO,CACLgT,SAAU,CACRhD,QAAS,KAGbpL,SAAU,CACR,CACEqL,IAAK,MACLgD,mBAAoB,OACpB/C,SAAWzP,IACT,KAAMA,aAAa4Q,aACjB,MAAM,QAAE5Q,GACV,MAAO,CAAEuS,SAAUvS,EAAEyS,QAAQF,aAInC7C,MAAQ1P,IACN,MAAMtB,EAAIM,EAAEL,IAAI8E,GAAGp9B,IAAT24B,CAAcgB,GACxB,MAAO,CACL,MACA,IACKtB,EAAE4T,IACL,gBAAiBtS,EAAET,MAAMgT,UAE3B,CAAC,OAAQ7T,EAAEvwB,KAAM,KAGrB+xB,cAAe,CACbj2B,MAAO,EAAGW,KAAMo1B,KAAc,SAANA,EACxBG,OAAQ,CAACH,EAAGtB,EAAGlL,KACb,MAAMuL,EAAIL,EAAEvS,KAAMwT,EAAIjB,EAAE33B,MACxBi5B,EAAEK,SAAS7M,EAAG,CAAE+e,SAAUxT,IAAMY,GAAKK,EAAEa,QAAQlB,GAAIK,EAAEM,cAGzDrM,WAAY,CACVhqB,MAAQ+1B,GAAsB,eAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACV,IAAIlL,EACJwM,EAAEQ,QAAQ,YAAQ,GAAuC,OAA7BhN,EAAIkL,EAAEtuB,QAAQ69B,iBAAsB,EAASza,EAAE/e,OAAS,GAAI,CACtF0X,KAAMuS,EAAEa,MAAMgT,iBAKtB/T,EAAE8F,GAAE35B,KAAM,CACRq5B,YAAa,wBACbljB,MAAO,cAET0d,EAAE8F,GAAEiD,IAAK,CACPvD,YAAa,2BACbljB,MAAO,cAET,MAAMqlB,IAAK,SAAGnH,IAAM,QAAG,kCAAmCsF,GAAE15B,KAAKo0B,IAAKgB,IACpE,IAAItB,EACJ,MAAO,CACL6T,UAA6B,OAAjB7T,EAAIsB,EAAEyR,aAAkB,EAAS/S,EAAE6T,WAAa,SAGhE/T,EAAE2H,GAAI,CACJnC,YAAa,sCACbljB,MAAO,cAET,MAAMgkB,IAAK,QAAE,mBAAoB9F,GAAM,CAACgB,EAAI,MAAO,QAAEsE,GAAE15B,KAAKo0B,GAAI,CAAEuT,SAAUvS,MAC5ExB,EAAEsG,GAAI,CACJd,YAAa,kCACbljB,MAAO,cAGT0d,GADW,QAAE,2BAA2B,IAAM,EAAG5Y,IAAKoZ,EAAGuT,SAAUvS,GAAM,CAAEpa,KAAM,EAAG2sB,SAAU,MAAS,CAAC7T,EAAGlL,IAAMwL,GAAK,IAAU,MAALxL,GAAaA,EAAEkL,EAAEwP,GAAGwE,iBAAiB1T,EAAG,WAAYgB,KAAK,KAC9K,CACJgE,YAAa,0CACbljB,MAAO,cAET,MAAMyjB,IAAK,QAAE,kBAAmB,CAC9BoO,gBAAiB,CACf3C,UAAW,YACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAK4+B,GAAGz+B,SAI7Bm4B,EAAE+F,GAAGgD,IAAK,CACRvD,YAAa,uBACbljB,MAAO,cAET0d,EAAE+F,GAAGyL,UAAW,CACdhM,YAAa,oBACbljB,MAAO,cAET,MAAMknB,IAAK,QAAE,SACbxJ,EAAEwJ,GAAI,CACJhE,YAAa,cACbljB,MAAO,UAET,MAAM0gB,IAAI,QAAE,SAAUxC,IAAM,CAC1B4T,QAAQ,EACR9xB,MAAO,SACP+xB,YAAY,EACZC,WAAW,EACXlT,MAAO,GACPmT,MAAM,EACNzB,UAAU,EACV0B,WAAW,EACXzT,MAAO,CACLj4B,IAAK,CAAEioC,QAAS,IAChB1kC,IAAK,CAAE0kC,QAAS,IAChBljB,MAAO,CAAEkjB,QAAS,KAEpBpL,SAAU,CACR,CACEqL,IAAK,WACLC,SAAWzP,IACT,KAAMA,aAAa4Q,aACjB,MAAM,QAAE5Q,GACV,MAAO,CACL14B,IAAK04B,EAAE6Q,aAAa,QAAU,GAC9BhmC,IAAKm1B,EAAE6Q,aAAa,QAAU,GAC9BxkB,MAAO2T,EAAE6Q,aAAa,UAAY7Q,EAAE6Q,aAAa,QAAU,OAKnEnB,MAAQ1P,GAAM,CAAC,MAAO,IAAKhB,EAAEL,IAAIqJ,GAAG3hC,IAAT24B,CAAcgB,MAAOA,EAAET,QAClDW,cAAe,CACbj2B,MAAO,EAAGW,KAAMo1B,KAAc,UAANA,EACxBG,OAAQ,CAACH,EAAGtB,EAAGlL,KACb,MAAMuL,EAAIL,EAAEpS,IAAKqT,EAAIjB,EAAE7zB,IAAK02B,EAAI7C,EAAErS,MAClC2T,EAAEQ,QAAQhN,EAAG,CACXlsB,IAAKy3B,EACLl0B,IAAK80B,EACLtT,MAAOkV,MAIbtN,WAAY,CACVhqB,MAAQ+1B,GAAsB,UAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVsB,EAAEQ,QAAQ,aAAS,OAAQ,EAAQ,CACjCnU,MAAOqS,EAAEa,MAAMlT,MACfC,IAAKoS,EAAEa,MAAMj4B,IACbuD,IAAK6zB,EAAEa,MAAM10B,YAKrB2zB,EAAEgD,GAAE72B,KAAM,CACRq5B,YAAa,oBACbljB,MAAO,UAET0d,EAAEgD,GAAE+F,IAAK,CACPvD,YAAa,uBACbljB,MAAO,UAET,MAAMmyB,IAAK,QAAE,eAAgBjU,GAAM,CAACgB,EAAI,KAAO,CAACtB,EAAGlL,KACjD,IAAKA,EACH,OAAO,EACT,MAAQlsB,IAAKy3B,EAAI,GAAIl0B,IAAK80B,EAAI,GAAItT,MAAOkV,EAAI,IAAOvB,EAAGr4B,EAAI65B,GAAE52B,KAAKo0B,GAAG3mB,OAAO,CAAE/Q,IAAKy3B,EAAGl0B,IAAK80B,EAAGtT,MAAOkV,IACrG,OAAO55B,GAAK6rB,EAAEkL,EAAEwP,GAAGgF,qBAAqBvrC,GAAG4mC,mBAAmB,KAEhE/P,EAAEyU,GAAI,CACJjP,YAAa,8BACbljB,MAAO,UAET,MAAMqyB,IAAK,QAAE,eAAgBnU,GAAM,CAACgB,EAAI,KAAO,CAACtB,EAAGlL,KACjD,MAAMuL,GAAI,QAAGL,EAAEmP,UAAWrM,GAAE52B,KAAKo0B,IACjC,IAAKD,EACH,OAAO,EACT,MAAQp0B,KAAMg1B,EAAG/Z,IAAK2b,GAAMxC,EAAGp3B,EAAI,IAAKg4B,EAAEJ,QAAWj4B,IAAKwmB,EAAGjjB,IAAKk3B,EAAG1V,MAAO6O,GAAM8E,EAClF,YAAa,IAANlS,IAAiBnmB,EAAEL,IAAMwmB,QAAU,IAANiU,IAAiBp6B,EAAEkD,IAAMk3B,QAAU,IAAN7G,IAAiBvzB,EAAE0kB,MAAQ6O,GAAS,MAAL1H,GAAaA,EAAEkL,EAAEwP,GAAG0D,cAAcrQ,OAAG,EAAQ55B,GAAG4mC,mBAAmB,KAErK/P,EAAE2U,GAAI,CACJnP,YAAa,8BACbljB,MAAO,UAST0d,GAPW,SAAGQ,GAAM,IAAI,KACtB,sEACA,CAACgB,EAAGtB,EAAGlL,EAAGuL,KACR,MAAOY,EAAG4B,EAAG55B,EAAI,GAAImmB,GAAK4Q,EAC1B,OAAOiB,EAAIK,EAAEkO,GAAGkF,YAAY5f,EAAGuL,EAAGyC,GAAE52B,KAAKo0B,GAAG3mB,OAAO,CAAE/Q,IAAKK,EAAGkD,IAAK02B,EAAGlV,MAAOyB,KAAQ,UAGlF,CACJkW,YAAa,kCACbljB,MAAO,UAET,MAAM8jB,IAAK,QAAE,aAAc5F,IAAM,CAC/B,iBAAkBA,EAAEO,MAAM8T,aAE5B7U,EAAEoG,GAAI,CACJZ,YAAa,kBACbljB,MAAO,cAET,MAAM2e,IAAI,QAAE,aAAcT,IAAM,CAC9B4T,QAAQ,EACR9xB,MAAO,SACPye,MAAO,CACL8T,SAAU,CACR9D,SAAS,IAGbsD,YAAY,EACZ1O,SAAU,CAAC,CAAEqL,IAAK,OAClBE,MAAQ1P,GAAM,CAAC,KAAMhB,EAAEL,IAAIiG,GAAGv+B,IAAT24B,CAAcgB,IACnCE,cAAe,CACbj2B,MAAO,EAAGW,KAAMo1B,KAAc,UAANA,EACxBG,OAAQ,CAACH,EAAGtB,EAAGlL,KACb,IAAIuL,EACJiB,EAAEQ,QAAQhN,EAAG,CAAE6f,WAA6B,OAAftU,EAAIL,EAAE/tB,QAAiBouB,EAAEsU,cAG1DC,SAAU,IAAM,KAEhBrf,WAAY,CACVhqB,MAAQ+1B,GAAsB,cAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVA,EAAEa,MAAM8T,SAAWrT,EAAEQ,QAAQ,YAAQ,EAAQ,MAC9CR,EAAEQ,QAAQ,eAIfhC,EAAEiB,GAAE90B,KAAM,CACRq5B,YAAa,wBACbljB,MAAO,cAET0d,EAAEiB,GAAE8H,IAAK,CACPvD,YAAa,2BACbljB,MAAO,cAET,MAAMyyB,IAAK,QAAE,mBAAoBvU,GAAM,IAAM,CAACgB,EAAGtB,KAC/C,IAAIiB,EACJ,MAAQkO,UAAWra,EAAG0a,GAAInP,GAAMiB,EAChC,KAAMxM,aAAa,MACjB,OAAO,EACT,GAAIA,EAAE6c,MAAO,CACX,MAAM9O,EAAI/N,EAAEma,MAAMhjC,OAClB,GAAI42B,EAAEyM,WAAa,GAA4D,eAAjC,OAApBrO,EAAI4B,EAAE+N,gBAAqB,EAAS3P,EAAE/0B,KAAKhE,MACnE,OAAY,MAAL83B,GAAaA,EAClBK,EAAEyU,iBAAiBhgB,EAAE8c,GAAK,EAAG9c,EAAE8c,GAAItQ,EAAEH,OAAOl1B,KAAK,cAAcqmC,aAAa,UAAQjS,EAAE9Q,IAAIpa,QAAQ2f,EAAE8c,MAAM/B,mBACzG,EAEP,OAAY,MAAL7P,GAAaA,EAAEK,EAAE0U,QAAQ,aAAa,GAAIP,qBAAqBzT,GAAE70B,KAAKo0B,GAAG3mB,UAAUk2B,mBAAmB,KAE/G/P,EAAE+U,GAAI,CACJvP,YAAa,kCACbljB,MAAO,cAET,MAAM6kB,IAAK,QAAE,kBAAmB,CAC9B+N,gBAAiB,CACf1D,UAAW,cACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKqtC,GAAGltC,SAI7Bm4B,EAAEmH,GAAG4B,IAAK,CACRvD,YAAa,uBACbljB,MAAO,cAET0d,EAAEmH,GAAGqK,UAAW,CACdhM,YAAa,oBACbljB,MAAO,cAET,MAAM6yB,IAAK,QAAE,MACbnV,EAAEmV,GAAI,CACJ3P,YAAa,WACbljB,MAAO,OAET,MAAMqd,IAAI,QAAE,MAAOa,IAAM,CACvBle,MAAO,QACPqjB,SAAU,CAAC,CAAEqL,IAAK,OAClBE,MAAQ1P,GAAM,CAAC,KAAMhB,EAAEL,IAAIgV,GAAGttC,IAAT24B,CAAcgB,IACnCE,cAAe,CACbj2B,MAAO,EAAGW,KAAMo1B,KAAc,kBAANA,EACxBG,OAAQ,CAACH,EAAGtB,EAAGlL,KACbwM,EAAEQ,QAAQhN,KAGdS,WAAY,CACVhqB,MAAQ+1B,GAAsB,OAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAASH,IACPA,EAAEQ,QAAQ,uBAIhBhC,EAAEL,GAAExzB,KAAM,CACRq5B,YAAa,iBACbljB,MAAO,OAET0d,EAAEL,GAAEoJ,IAAK,CACPvD,YAAa,oBACbljB,MAAO,OAET,MAAM8yB,IAAK,SAAG5U,GAAM,IAAI,KACtB,4BACA,CAACgB,EAAGtB,EAAGlL,EAAGuL,KACR,MAAQmP,GAAIvO,GAAMK,EAClB,OAAOtB,EAAE,IAAMiB,EAAEyT,YAAY5f,EAAI,EAAGuL,EAAGZ,GAAEvzB,KAAKo0B,GAAG3mB,UAAWsnB,OAGhEnB,EAAEoV,GAAI,CACJ5P,YAAa,+BACbljB,MAAO,OAET,MAAM+lB,IAAK,QAAE,YAAa7H,GAAM,IAAM,CAACgB,EAAGtB,KACxC,IAAKA,EACH,OAAO,EACT,MAAMlL,EAAIiO,EAAE92B,KAAKC,KAAKo0B,GAAG3mB,UAAY61B,GAAInP,EAAG8O,UAAWlO,GAAMK,GAAK10B,KAAMi2B,GAAM5B,EAAGh4B,EAAIw2B,GAAEvzB,KAAKo0B,GAAG3mB,SAC/F,IAAK1Q,EACH,OAAO,EACT,MAAMmmB,EAAIiR,EAAEmU,qBAAqBvrC,GAAGksC,OAAOtS,EAAG/N,GAAIuO,EAAI,cAAYjU,EAAEG,IAAIpa,QAAQ0tB,GAAI,GAAG,GACvF,OAAOQ,GAAKrD,EAAE5Q,EAAEkjB,aAAajP,GAAGwM,mBAAmB,KAErD/P,EAAEqI,GAAI,CACJ7C,YAAa,2BACbljB,MAAO,OAET,MAAMgzB,IAAK,QAAE,cACbtV,EAAEsV,GAAI,CACJ9P,YAAa,mBACbljB,MAAO,eAET,MAAMmd,IAAI,QAAE,eAAgBe,IAAM,CAChC5uB,QAAS,YACT0Q,MAAO,QACPye,MAAO,CACLrS,OAAQ,CACNqiB,SAAS,IAGbpL,SAAU,CACR,CACEqL,IAAK,KACLC,SAAWzP,IACT,KAAMA,aAAa4Q,aACjB,MAAM,QAAE5Q,GACV,MAAO,CACL9S,OAAQ8S,EAAEyS,QAAQvlB,WAK1BwiB,MAAQ1P,GAAM,CACZ,KACA,IACKhB,EAAEL,IAAImV,GAAGztC,IAAT24B,CAAcgB,GACjB,cAAeA,EAAET,MAAMrS,QAEzB,GAEFgT,cAAe,CACbj2B,MAAO,EAAGW,KAAMo1B,EAAG/S,QAASyR,KAAc,SAANsB,IAAiBtB,EACrDyB,OAAQ,CAACH,EAAGtB,EAAGlL,KACb,MAAMuL,EAAgB,MAAZL,EAAExR,OAAiB,GAAGwR,EAAExR,SAAW,QAC7C8S,EAAEK,SAAS7M,EAAG,CAAEtG,OAAQ6R,IAAKxxB,KAAKmxB,EAAE5zB,UAAUw1B,cAGlDrM,WAAY,CACVhqB,MAAQ+1B,GAAsB,gBAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVsB,EAAEK,SAAS,YAAQ,EAAQ,CAAEpT,SAAS,EAAIC,OAA2B,SAAnBwR,EAAEa,MAAMrS,SAAqB3f,KAAKmxB,EAAEtuB,SAASkwB,kBAIrG9B,EAAEP,GAAEtzB,KAAM,CACRq5B,YAAa,yBACbljB,MAAO,eAET0d,EAAEP,GAAEsJ,IAAK,CACPvD,YAAa,4BACbljB,MAAO,eAET,MAAM4kB,IAAK,SAAG1G,IAAM,QAAE,iBAAkBf,GAAErzB,KAAKo0B,MAC/CR,EAAEkH,GAAI,CACJ1B,YAAa,uCACbljB,MAAO,eAET,MAAMmlB,IAAK,QAAE,oBAAqBjH,GAAM,KAAM,QAAEf,GAAErzB,KAAKo0B,MACvDR,EAAEyH,GAAI,CACJjC,YAAa,mCACbljB,MAAO,eAET,MAAM+mB,IAAK,QAAE,mBAAoB,CAC/BkM,iBAAkB,CAChB/D,UAAW,YACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAK+/B,GAAG5/B,SAI7Bm4B,EAAEqJ,GAAGN,IAAK,CACRvD,YAAa,8BACbljB,MAAO,eAET0d,EAAEqJ,GAAGmI,UAAW,CACdhM,YAAa,2BACbljB,MAAO,eAET,MAAMkzB,IAAK,QAAE,eACbxV,EAAEwV,GAAI,CACJhQ,YAAa,oBACbljB,MAAO,gBAET,MAAMod,IAAI,QAAE,gBAAiBc,IAAM,CACjC5uB,QAAS,YACT0Q,MAAO,QACPye,MAAO,CACLzF,MAAO,CACLyV,QAAS,GAEXriB,OAAQ,CACNqiB,SAAS,IAGbpL,SAAU,CACR,CACEqL,IAAK,KACLC,SAAWzP,IACT,KAAMA,aAAa4Q,aACjB,MAAM,QAAE5Q,GACV,MAAO,CACL9S,OAAQ8S,EAAEyS,QAAQvlB,OAClB4M,MAAOkG,EAAEiU,aAAa,SAAWpkC,OAAOmwB,EAAE6Q,aAAa,UAAY,MAK3EnB,MAAQ1P,GAAM,CACZ,KACA,IACKhB,EAAEL,IAAIqV,GAAG3tC,IAAT24B,CAAcgB,MACI,IAAlBA,EAAET,MAAMzF,MAAc,GAAKkG,EAAET,MAAMzF,MACtC,cAAekG,EAAET,MAAMrS,QAEzB,GAEFgT,cAAe,CACbj2B,MAAO,EAAGW,KAAMo1B,EAAG/S,QAASyR,KAAc,SAANsB,KAAkBtB,EACtDyB,OAAQ,CAACH,EAAGtB,EAAGlL,KACb,MAAMuL,EAAgB,MAAZL,EAAExR,OAAiB,GAAGwR,EAAExR,SAAW,OAC7C8S,EAAEK,SAAS7M,EAAG,CAAEtG,OAAQ6R,IAAKxxB,KAAKmxB,EAAE5zB,UAAUw1B,cAGlDrM,WAAY,CACVhqB,MAAQ+1B,GAAsB,iBAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVsB,EAAEK,SAAS,YAAQ,EAAQ,CAAEpT,SAAS,EAAIhlB,MAAO,EAAGilB,OAA2B,SAAnBwR,EAAEa,MAAMrS,SAAsB8S,EAAEzyB,KAAKmxB,EAAEtuB,SAAU4vB,EAAEM,kBAIrH9B,EAAEN,GAAEvzB,KAAM,CACRq5B,YAAa,0BACbljB,MAAO,gBAET0d,EAAEN,GAAEqJ,IAAK,CACPvD,YAAa,6BACbljB,MAAO,gBAET,MAAMozB,IAAK,SAAGlV,IAAM,QAClB,iBACAd,GAAEtzB,KAAKo0B,IACNgB,IAAM,CAAGlG,MAAOjqB,OAAOmwB,EAAE,QAC1B,CAACA,EAAGtB,IAAMA,EAAEsP,WAAatP,EAAEa,MAAMzF,QAAUjqB,OAAOmwB,EAAE,QAEtDxB,EAAE0V,GAAI,CACJlQ,YAAa,wCACbljB,MAAO,gBAET,MAAM2kB,IAAK,QAAE,qBAAsBzG,GAAM,KAAM,QAAEd,GAAEtzB,KAAKo0B,MACxDR,EAAEiH,GAAI,CACJzB,YAAa,oCACbljB,MAAO,gBAET,MAAMqzB,IAAK,QAAE,oBAAqB,CAChCC,kBAAmB,CACjBpE,UAAW,YACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKu/B,GAAGp/B,SAI7Bm4B,EAAE2V,GAAG5M,IAAK,CACRvD,YAAa,yBACbljB,MAAO,gBAET0d,EAAE2V,GAAGnE,UAAW,CACdhM,YAAa,sBACbljB,MAAO,gBAET,MAAMoiB,IAAK,QAAE,YACb1E,EAAE0E,GAAI,CACJc,YAAa,iBACbljB,MAAO,aAET,MAAMud,IAAI,QAAE,aAAcW,IAAM,CAC9Ble,MAAO,WACP1Q,QAAS,mBACTmvB,MAAO,CACLxe,MAAO,CACLwuB,QAAS,UAEX8E,SAAU,CACR9E,QAAS,UAEXriB,OAAQ,CACNqiB,QAAS,SAGb+B,UAAU,EACVnN,SAAU,CACR,CACEqL,IAAK,KACLC,SAAWzP,IACT,KAAMA,aAAa4Q,aACjB,MAAM,QAAE5Q,GACV,MAAO,CACLjf,MAAOif,EAAEyS,QAAQ1xB,MACjBszB,SAAUrU,EAAEyS,QAAQ,aACpBvlB,OAAQ8S,EAAEyS,QAAQvlB,WAK1BwiB,MAAQ1P,GAAM,CACZ,KACA,IACKhB,EAAEL,IAAIuE,GAAG78B,IAAT24B,CAAcgB,GACjB,aAAcA,EAAET,MAAMxe,MACtB,iBAAkBif,EAAET,MAAM8U,SAC1B,cAAerU,EAAET,MAAMrS,QAEzB,GAEFgT,cAAe,CACbj2B,MAAO,EAAGW,KAAMo1B,KAAc,aAANA,EACxBG,OAAQ,CAACH,EAAGtB,EAAGlL,KACb,MAAMuL,EAAe,MAAXL,EAAE3d,MAAgB,GAAG2d,EAAE3d,SAAW,SAAK4e,EAAe,MAAXjB,EAAE3d,MAAgB,UAAY,SAAUwgB,EAAgB,MAAZ7C,EAAExR,OAAiB,GAAGwR,EAAExR,SAAW,OACpI8S,EAAEK,SAAS7M,EAAG,CAAEzS,MAAOge,EAAGsV,SAAU1U,EAAGzS,OAAQqU,IAAMvB,EAAEzyB,KAAKmxB,EAAE5zB,UAAWk1B,EAAEM,cAG/ErM,WAAY,CACVhqB,MAAQ+1B,GAAsB,cAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVsB,EAAEK,SAAS,gBAAY,EAAQ,CAAEnT,OAA2B,SAAnBwR,EAAEa,MAAMrS,SAAsB8S,EAAEzyB,KAAKmxB,EAAEtuB,SAAU4vB,EAAEM,kBAIlG9B,EAAEH,GAAE1zB,KAAM,CACRq5B,YAAa,uBACbljB,MAAO,aAET0d,EAAEH,GAAEkJ,IAAK,CACPvD,YAAa,0BACbljB,MAAO,aAET,MAAMinB,IAAK,QAAE,gBAAiB/I,GAAM,KAAM,OH76BpB0O,EG66BuBrP,GAAEzzB,KAAKo0B,GH56BzC,SAAUxoB,EAAOixB,GACpB,IAAI,MAAEkG,EAAK,IAAEC,GAAQp3B,EAAMq3B,UACvBC,EAAQH,EAAMI,WAAWH,GAAKjjC,GAAQA,EAAKqjC,WAAa,GAAKrjC,EAAKsjC,WAAWrjC,MAAQ8iC,IACzF,IAAKI,EACD,OAAO,EACX,IAAIr3B,EAAaq3B,EAAMr3B,WACvB,GAAkB,GAAdA,EACA,OAAO,EACX,IAAIqb,EAASgc,EAAMhc,OAAQwiB,EAAaxiB,EAAO+C,MAAMpe,EAAa,GAClE,GAAI69B,EAAW1pC,MAAQ8iC,EACnB,OAAO,EACX,GAAIjG,EAAU,CACV,IAAI8M,EAAeD,EAAWhF,WAAagF,EAAWhF,UAAU1kC,MAAQknB,EAAOlnB,KAC3E4pC,EAAQ,UAAcD,EAAe7G,EAASr1B,SAAW,MACzDrP,EAAQ,IAAI,KAAM,UAAc0kC,EAASr1B,OAAO,KAAM,UAAcyZ,EAAOlnB,KAAKyN,OAAO,KAAMm8B,MAAWD,EAAe,EAAI,EAAG,GAC9HjmC,EAASw/B,EAAM7lC,MAAOsL,EAAQu6B,EAAM5lC,IACxCu/B,EAASjxB,EAAM03B,GAAGE,KAAK,IAAI,KAAkB9/B,GAAUimC,EAAe,EAAI,GAAIhhC,EAAOjF,EAAQiF,EAAOvK,EAAO,GAAG,IACzGulC,kBAET,OAAO,GApBf,IAAsBb,KG86BtBlP,EAAEuJ,GAAI,CACJ/D,YAAa,+BACbljB,MAAO,aAET,MAAMojB,IAAK,QAAE,iBAAkBlF,GAAM,IAAM,EAAGX,GAAEzzB,KAAKo0B,MACrDR,EAAE0F,GAAI,CACJF,YAAa,+BACbljB,MAAO,aAET,MAAMumB,IAAK,QAAE,iBAAkBrI,GAAM,KAAM,OHziCpB0O,EGyiCuBrP,GAAEzzB,KAAKo0B,GHxiC1C,SAAUxoB,EAAOixB,GACpB,IAAI,MAAEkG,EAAK,IAAEC,EAAG,KAAEjjC,GAAS6L,EAAMq3B,UACjC,GAAKljC,GAAQA,EAAK8pC,SAAY9G,EAAMphB,MAAQ,IAAMohB,EAAM+G,WAAW9G,GAC/D,OAAO,EACX,IAAI+G,EAAchH,EAAMhjC,MAAM,GAC9B,GAAIgqC,EAAY/pC,MAAQ8iC,EACpB,OAAO,EACX,GAAiC,GAA7BC,EAAM7b,OAAO1hB,QAAQL,MAAa49B,EAAMhjC,MAAM,GAAGqjC,YAAcL,EAAMiH,YAAY,GAAI,CAIrF,GAAmB,GAAfjH,EAAMphB,OAAcohB,EAAMhjC,MAAM,GAAGC,MAAQ8iC,GAC3CC,EAAMxlC,OAAO,IAAMwlC,EAAMhjC,MAAM,GAAGqjC,WAAa,EAC/C,OAAO,EACX,GAAIvG,EAAU,CACV,IAAIpR,EAAO,WACPwe,EAAclH,EAAMxlC,OAAO,GAAK,EAAIwlC,EAAMxlC,OAAO,GAAK,EAAI,EAG9D,IAAK,IAAI2lB,EAAI6f,EAAMphB,MAAQsoB,EAAa/mB,GAAK6f,EAAMphB,MAAQ,EAAGuB,IAC1DuI,EAAO,UAAcsX,EAAMhjC,KAAKmjB,GAAGvmB,KAAK8uB,IAC5C,IAAIye,EAAanH,EAAMiH,YAAY,GAAKjH,EAAMhjC,MAAM,GAAGqjC,WAAa,EAC9DL,EAAMiH,YAAY,GAAKjH,EAAMhjC,MAAM,GAAGqjC,WAAa,EAAI,EAE7D3X,EAAOA,EAAK2Y,OAAO,UAActB,EAASnN,kBAC1C,IAAIt4B,EAAQ0lC,EAAMr/B,OAAOq/B,EAAMphB,OAASsoB,EAAc,IAClD3G,EAAK13B,EAAM03B,GAAGpzB,QAAQ7S,EAAO0lC,EAAMp6B,OAAOuhC,GAAa,IAAI,KAAMze,EAAM,EAAIwe,EAAa,IACxFE,GAAO,EACX7G,EAAGjgB,IAAI8iB,aAAa9oC,EAAOimC,EAAGjgB,IAAI7d,QAAQL,MAAM,CAACpF,EAAMib,KACnD,GAAImvB,GAAO,EACP,OAAO,EACPpqC,EAAKqqC,aAAoC,GAArBrqC,EAAKyF,QAAQL,OACjCglC,EAAMnvB,EAAM,MAEhBmvB,GAAO,GACP7G,EAAG8C,aAAa,UAAe9C,EAAGjgB,IAAIpa,QAAQkhC,KAClDtN,EAASyG,EAAGK,kBAEhB,OAAO,EAEX,IAAI0G,EAAWrH,EAAIhoB,KAAO+nB,EAAMzlC,MAAQysC,EAAYO,eAAe,GAAGC,YAAc,KAChFjH,EAAK13B,EAAM03B,GAAG7F,OAAOsF,EAAM/nB,IAAKgoB,EAAIhoB,KACpCwvB,EAAQH,EAAW,CAACI,EAAY,CAAEzqC,KAAM8iC,EAAUnO,MAAO8V,GAAc,KAAM,CAAEzqC,KAAMqqC,SAAc3sC,EACvG,SAAK,QAAS4lC,EAAGjgB,IAAK0f,EAAM/nB,IAAK,EAAGwvB,KAEhC3N,GACAA,EAASyG,EAAGnmC,MAAM4lC,EAAM/nB,IAAK,EAAGwvB,GAAO7G,mBACpC,IAhDf,IAAuBb,EAAU2H,KG0iCjC7W,EAAE6I,GAAI,CACJrD,YAAa,gCACbljB,MAAO,aAcT,MAAMsiB,IAAK,QAAE,qBAAsBpE,GAAM,IAZzC,SAAYA,GACV,MAAO,CAACgB,EAAGtB,EAAGlL,KACZ,MAAQqa,UAAW9O,GAAMiB,EACzB,KAAMjB,aAAa,MACjB,OAAO,EACT,MAAQsR,MAAO1Q,EAAGgO,MAAOpM,GAAMxC,EAC/B,IAAKY,GAAwB,IAAnB4B,EAAEoQ,aACV,OAAO,EACT,MAAMhqC,EAAI45B,EAAE52B,MAAM,GAClB,QAAOhD,EAAEiD,OAASyzB,GAAEzzB,KAAKo0B,IAAMr3B,EAAEsmC,aAAe1M,EAAE52B,QAAU42B,EAAE52B,MAAM,GAAGqjC,WAAa,IAAS,EAAG3P,GAAEzzB,KAAKo0B,GAAV,CAAcgB,EAAGtB,EAAGlL,IAGtE8hB,CAAGtW,KAClDR,EAAE4E,GAAI,CACJY,YAAa,oCACbljB,MAAO,aAET,MAAMukB,IAAK,QAAE,iBAAkB,CAC7BkQ,aAAc,CACZvF,UAAW,QACXC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKmhC,GAAGhhC,OAG3BmvC,aAAc,CACZxF,UAAW,CAAC,MAAO,SACnBC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAK6hC,GAAG1hC,OAG3BovC,aAAc,CACZzF,UAAW,CAAC,YAAa,SACzBC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKg+B,GAAG79B,OAG3BqvC,kBAAmB,CACjB1F,UAAW,CAAC,YAAa,UACzBC,QAAUjR,IACR,MAAMgB,EAAIhB,EAAEL,IAAI,MAChB,MAAO,IAAMqB,EAAE95B,KAAKk9B,GAAG/8B,SAI7Bm4B,EAAE6G,GAAGkC,IAAK,CACRvD,YAAa,sBACbljB,MAAO,aAET0d,EAAE6G,GAAG2K,UAAW,CACdhM,YAAa,mBACbljB,MAAO,aAET,MAAM60B,IAAK,QAAG,QAAQ,KAAM,CAC1B70B,MAAO,SACPof,cAAe,CACbj2B,MAAO,EAAGW,KAAMo0B,KAAc,SAANA,EACxBmB,OAAQ,CAACnB,EAAGgB,KACVhB,EAAE6B,QAAQb,EAAEj5B,SAGhBktB,WAAY,CACVhqB,MAAQ+0B,GAAsB,SAAhBA,EAAEp0B,KAAKhE,KACrBu5B,OAAQ,CAACnB,EAAGgB,KACVhB,EAAEwB,QAAQ,YAAQ,EAAQR,EAAEvrB,YAIlC+pB,EAAEmX,GAAI,CACJ3R,YAAa,mBACbljB,MAAO,SAET,MAAMsjB,IAAK,QAAE,QACb5F,EAAE4F,GAAI,CACJJ,YAAa,aACbljB,MAAO,SAET,MAAM80B,IAAK,QAAE,QAAS5W,IAAM,CAC1B+T,MAAM,EACNjyB,MAAO,SACP8xB,QAAQ,EACRrT,MAAO,CACLx4B,MAAO,CACLwoC,QAAS,KAGbG,MAAQ1P,IACN,MAAMtB,EAAIxrB,SAASuM,cAAc,QAAS+T,EAAI,IACzCwL,EAAEL,IAAIyF,GAAG/9B,IAAT24B,CAAcgB,GACjB,aAAcA,EAAET,MAAMx4B,MACtB,YAAa,QAEf,OAAO23B,EAAE5e,YAAckgB,EAAET,MAAMx4B,MAAO,CAAC,OAAQysB,EAAGwM,EAAET,MAAMx4B,QAE5Do9B,SAAU,CAAC,CACTqL,IAAK,yBACLC,SAAWzP,IAAM,CACfj5B,MAAOi5B,EAAEyS,QAAQ1rC,OAAS,OAG9Bm5B,cAAe,CACbj2B,MAAO,EAAGW,KAAMo1B,KAAc,SAANA,EACxBG,OAAQ,CAACH,EAAGtB,EAAGlL,KACbwM,EAAEQ,QAAQhN,EAAG,CAAEzsB,MAAO23B,EAAE33B,UAG5BktB,WAAY,CACVhqB,MAAQ+1B,GAAsB,SAAhBA,EAAEp1B,KAAKhE,KACrBu5B,OAAQ,CAACH,EAAGtB,KACVsB,EAAEQ,QAAQ,YAAQ,EAAQ9B,EAAEa,MAAMx4B,aAIxCy3B,EAAEoX,GAAGjrC,KAAM,CACTq5B,YAAa,mBACbljB,MAAO,SAET0d,EAAEoX,GAAGrO,IAAK,CACRvD,YAAa,sBACbljB,MAAO,SAET,MAAM+0B,GAAK,CACT3Q,EACAgM,EACAzP,EACAG,EACAoE,EACA7E,GACAyD,GACAnF,GACAiE,GACAtC,GACAqC,GACAa,GACAqP,GACAxV,GACA6J,GACAxG,GACAsS,GACA7V,GACA+V,GACA9V,GACAgF,GACA7E,GACA2E,EACAlB,EACAiD,EACAL,EACAoB,EACAjE,EACAoD,EACA3F,EACA8E,GACAwR,GACAD,IACA5U,OAAQ+U,GAAK,CACbvQ,GACAG,GACAwO,GACA/N,GACAyN,GACApC,IACAzQ,OAAQgV,GAAK,CACbnG,EACA1H,EACAd,EACA8I,GACC8F,GAAK,CACNpO,EACAtE,GACAD,GACAE,GACAuB,GACAyO,GACA1M,GACAoM,GACAE,GACA1N,GACAQ,GACA8B,GACAV,GACAnD,GACAd,GACAuB,EACAK,EACAe,EACA+K,EACA3L,GACC8Q,GAAK,CACN7D,GACA7N,GACAoB,GACAO,GACAb,GACA8O,GACAtM,GACArE,EACAqB,EACA6L,EACA7K,GACA9E,OAAQmV,IAAK,QAAE,wBAAwB,IAAM,IAAOlX,KACpD,QAAEA,EAAG,QAASgB,IACZ,GAAIA,EAAE/S,QAAS,CACb,MAAMyR,EAAIsB,EAAE/3B,OAAS,EACrB+3B,EAAEl1B,SAASk2B,SAAQ,CAACxN,EAAGuL,KACrBvL,EAAEzS,MAAQge,EAAIL,YAKtBF,EAAE0X,GAAG3Y,OAAQ,CACXyG,YAAa,qCACbljB,MAAO,WAET0d,EAAE0X,GAAGvvC,QAAS,CACZq9B,YAAa,2CACbljB,MAAO,WAET,MAAMq1B,IAAK,QAAE,mBAAmB,IAAM,IAAOnX,IAC3C,MAAMgB,EAAI,uBACV,QAAEhB,EAAG,QAAQ,CAACN,EAAGlL,EAAGuL,KAClB,IAAKL,EAAE33B,OAA2B,iBAAX23B,EAAE33B,MACvB,OACF,MAAM44B,EAAI,GACV,IAAI4B,EAAI,EACRvB,EAAEvS,UAAY,EACd,IAAI9lB,EAAIq4B,EAAEtS,KAAKgR,EAAE33B,OACjB,KAAOY,GAAK,CACV,MAAMo6B,EAAIp6B,EAAEQ,MACZo5B,IAAMQ,GAAKpC,EAAEn0B,KAAK,CAAEZ,KAAM,OAAQ7D,MAAO23B,EAAE33B,MAAMiC,MAAMu4B,EAAGQ,KAAOpC,EAAEn0B,KAAK,CAAEZ,KAAM,QAAS+F,KAAM,CAAE0iC,UAAU,KAAS9R,EAAIQ,EAAIp6B,EAAE,GAAGC,OAAQD,EAAIq4B,EAAEtS,KAAKgR,EAAE33B,OAExJ,OAAI44B,EAAE/3B,OAAS,GAAKm3B,GAAiB,iBAALvL,GACvB+N,EAAI7C,EAAE33B,MAAMa,QAAU+3B,EAAEn0B,KAAK,CAAEZ,KAAM,OAAQ7D,MAAO23B,EAAE33B,MAAMiC,MAAMu4B,KAAOxC,EAAEj0B,SAASE,OAAOwoB,EAAG,KAAMmM,GAAInM,EAAImM,EAAE/3B,aADvH,QAIJ42B,EAAE2X,GAAG5Y,OAAQ,CACXyG,YAAa,0BACbljB,MAAO,WAET0d,EAAE2X,GAAGxvC,QAAS,CACZq9B,YAAa,gCACbljB,MAAO,WAET,MAAMs1B,IAAK,QAAE,oBAAoB,IAAM,IACvC5X,EAAE4X,GAAG7Y,OAAQ,CACXyG,YAAa,iCACbljB,MAAO,WAET0d,EAAE4X,GAAGzvC,QAAS,CACZq9B,YAAa,uCACbljB,MAAO,WAwBT,MAAMu1B,IAAK,QAAE,yBAAyB,IAAM,IAAOrX,KArBnD,SAAYA,EAAGgB,IAEb,SAAStB,EAAElL,EAAGuL,EAAGY,GACf,GAJO,CAACX,KAAQA,EAAEl0B,SAIdwrC,CAAG9iB,GAAI,CACT,MAAM+N,EAAI,GACV,IAAK,IAAI55B,EAAI,EAAGmmB,EAAI0F,EAAE1oB,SAASlD,OAAQD,EAAImmB,EAAGnmB,IAAK,CACjD,MAAMo6B,EAAIvO,EAAE1oB,SAASnD,GACrB,GAAIo6B,EAAG,CACL,MAAM7G,EAAIwD,EAAEqD,EAAGp6B,EAAG6rB,GAClB,GAAI0H,EACF,IAAK,IAAIkD,EAAI,EAAG4D,EAAI9G,EAAEtzB,OAAQw2B,EAAI4D,EAAG5D,IAAK,CACxC,MAAM6D,EAAI/G,EAAEkD,GACZ6D,GAAKV,EAAE/1B,KAAKy2B,KAIpBzO,EAAE1oB,SAAWy2B,EAEf,OAAOvB,EAAExM,EAAGuL,EAAGY,IAjBVjB,CAAEM,EAAG,EAAG,MAAM,GAqBrBuX,CAAGvX,GAAG,CAACgB,EAAGtB,EAAGlL,IAvBsB,CAACwL,GAAiB,SAAXA,EAAEp0B,KAuBzB4rC,CAAGxW,IAAwC,UAA5B,MAALxM,OAAY,EAASA,EAAE5oB,QAAqBo1B,EAAEl1B,SAAW,CAAC,IAAKk1B,WAAaA,EAAEj5B,MAAOi5B,EAAEp1B,KAAO,aAAc,CAACo1B,IAAM,CAACA,QAEnJxB,EAAE6X,GAAG9Y,OAAQ,CACXyG,YAAa,gCACbljB,MAAO,WAET0d,EAAE6X,GAAG1vC,QAAS,CACZq9B,YAAa,sCACbljB,MAAO,WAET,MAAM2jB,IAAK,QAAE,gBAAgB,IAAM,IAAM,CAACzF,EAAGgB,MAE3C,QAAEhB,GAAIxL,GAAM,CAAC,SAAU,YAAYngB,SAASmgB,EAAE5oB,QAAQ4oB,IACpDA,EAAEhb,OAFM,CAACgb,GAAMwM,EAAEj5B,MAAM8B,OAAO2qB,EAAE7N,SAAS1d,MAAMwK,QAEpCisB,CAAElL,SAGjBgL,EAAEiG,GAAGlH,OAAQ,CACXyG,YAAa,uBACbljB,MAAO,WAET0d,EAAEiG,GAAG99B,QAAS,CACZq9B,YAAa,6BACbljB,MAAO,WAET,MAAM21B,IAAK,SAAE,KACX,IAAIzX,GAAI,EACR,MAAMgB,EAAI,IAAI,KAAE,gCAAiCtB,EAAI,IAAI,KAAE,CACzDr4B,IAAK25B,EACLxpB,MAAO,CACLgvB,KAAI,KACK,EAETtP,MAAM1C,GACJ,IAAKA,EAAEqa,UAAUwC,MACf,OAAO,EACT,MAAMtR,EAAIvL,EAAEqa,UAAUF,MAAOhO,EAAIZ,EAAEuV,WAAY/S,EAAIxC,EAAE4P,UACrD,UAAUhP,GAAK4B,GAAK5B,EAAE0T,WAAa1T,EAAED,QAAU6B,EAAE8R,WAAa9R,EAAE7B,UAGpE2B,MAAO,CACLqV,gBAAiB,CACfC,eAAgB,CAACnjB,EAAGuL,MAAMC,IAAKA,GAAI,EAAI4X,uBAAsB,KAC3D,GAAIlY,EAAEmY,SAASrjB,EAAEhd,OAAQ,CACvB,MAAM+qB,EAAI/N,EAAEhd,MAAMq3B,UAAUviC,KAC5ByzB,EAAE+X,iBAAkBtjB,EAAEiU,SAASjU,EAAEhd,MAAM03B,GAAG6I,WAAWhY,EAAEpuB,MAAQ,GAAI4wB,SAEnE,GACJyV,iBAAmBxjB,IAAOkL,EAAEmY,SAASrjB,EAAEhd,SAAWwoB,GAAI,IAAK,GAC3DiY,YAAa,CAACzjB,EAAGuL,KACf,GAAIL,EAAEmY,SAASrjB,EAAEhd,QAAUuoB,aAAamY,YAAcnY,EAAEpuB,OAASquB,EAAG,CAClE,MAAMuC,EAAI/N,EAAEhd,MAAMq3B,UAAUviC,KAC5B,OAAOyzB,EAAE+X,iBAAkBtjB,EAAEiU,SAASjU,EAAEhd,MAAM03B,GAAG6I,WAAWhY,EAAEpuB,MAAQ,GAAI4wB,KAAK,EAEjF,OAAO,IAGX4V,YAAY3jB,GACV,GAAIkL,EAAEmY,SAASrjB,GAAI,CACjB,MAAM+N,EAAI/N,EAAEqa,UAAUF,MAAM/nB,IAAKje,EAAIuL,SAASuM,cAAc,QAASqO,EAAI,WAAUyT,EAAG55B,EAAG,CACvFyvC,MAAO,IACLrV,EAAI7uB,SAASuM,cAAc,QAASyb,EAAI,WAAUqG,EAAGQ,GACzD,OAAO8G,YAAW,KAChBlhC,EAAE0vC,gBAAkB,OAAQtV,EAAEsV,gBAAkB,UAC9C,YAAU7jB,EAAEvF,IAAK,CAACH,EAAGoN,IAE3B,OAAO,eAIb,OAAOwD,KAETF,EAAEiY,GAAI,CACJzS,YAAa,iCACbljB,MAAO,UAET,MAAMw2B,IAAK,SAAGtY,GAAM,IAAI,KAAE,CACxB34B,IAAK,IAAI,KAAE,4BACXkxC,kBAAmB,CAACvX,EAAGtB,EAAGlL,KACxB,IAAKwM,EAAEp4B,OACL,OACF,MAAOm3B,GAAKiB,EACZ,IAAKjB,EACH,OACF,MAAOY,GAAKZ,EAAEyY,MACd,GAAIzY,EAAE0Y,QAAQ,aAAc,CAC1B,KAAM9X,aAAa,MACjB,OACF,MAAQr0B,KAAMwiB,GAAM6R,EACpB,OAAOnM,EAAE0a,GAAG0D,cAAc9jB,EAAG2R,GAAE70B,KAAKo0B,QAAI,EAAQ,IAElD,GAAIW,aAAa,KAAI,CACnB,IAAI7R,EAAI0F,EAAE0a,GACV,MAAQ5iC,KAAMy2B,EAAGuO,GAAIpV,GAAMyE,EAC3B,OAAOnM,EAAEvF,IAAI8iB,aAAahP,EAAG7G,GAAG,CAACkD,EAAG4D,KAClC5D,EAAExzB,OAAS60B,GAAE70B,KAAKo0B,KAAOlR,EAAIA,EAAE8jB,cAAc5P,EAAGvC,GAAE70B,KAAKo0B,QAAI,EAAQ,QACjElR,QAIV0Q,EAAE8Y,GAAI,CACJtT,YAAa,kCACbljB,MAAO,UAET,MAAM42B,IAAK,QAAG,CAAC,QAAS,cAAe,wBACvClZ,EAAEkZ,GAAI,CACJ1T,YAAa,4BACbljB,MAAO,UAET,MAAM62B,IAAK,SAAG3Y,IACZ,MAAMgB,EAAIhB,EAAEL,IAAI+Y,GAAGrxC,KACnB,OAAO,IAAI,KAAE,CACXA,IAAK,IAAI,KAAE,6BACXuxC,kBAAmB,CAAClZ,EAAGlL,KACrB,MAAMuL,EAAIL,EAAE+Y,QAAQ,cAAe9X,GAAKjB,EAAE8Y,MAC1C,GAAIzY,GAAKY,EAAG,CACV,MAAQr0B,KAAMi2B,GAAM5B,EAAGh4B,EAAI6rB,EAAEvF,IAAIpa,QAAQ0tB,GACzC,IAAIzT,EAAInmB,EAAE4kB,MAAOwV,GAAI,EACrB,KAAOjU,EAAI,GACTkS,EAAE3sB,SAAS1L,EAAEgD,KAAKmjB,GAAGljB,KAAKhE,QAAUm7B,GAAI,GAAKjU,IAC/C,OAAOiU,EAET,OAAO,QAIbvD,EAAEmZ,GAAI,CACJ3T,YAAa,+BACbljB,MAAO,UAET,MAAM+2B,IAAK,SAAG7Y,IACZ,MAAMgB,EAAI,IAAI,KAAE,uBAAwBtB,EAAKlL,IAC3C,GAAIA,EAAEskB,YAActkB,EAAEukB,SACpB,OACF,MAAMhZ,EAAIC,EAAEL,IAAIiD,EAAEv7B,KAAMs5B,EAAInM,EAAEhd,MAAM03B,GAAGuF,QAAQ,gBAAgB,GAC/D,IAAIlS,GAAI,EACR/N,EAAEhd,MAAMyX,IAAI+pB,aAAY,CAACrwC,EAAGmmB,KAC1B,GAAInmB,EAAEiD,OAASu2B,GAAEv2B,KAAKo0B,GAAI,CACxB,GAAoC,IAAhCr3B,EAAEmY,YAAYm4B,OAAOrwC,OACvB,OACF,MAAMm6B,EAAIp6B,EAAE43B,MAAOrE,EAAI6D,EAAEp3B,GACzBo6B,EAAErN,KAAOwG,IAAMqG,GAAI,EAAI5B,EAAE8T,QAAQzT,GAAG,GAAI4R,cAAc9jB,OAAG,EAAQ,IAC5DiU,EACHrN,GAAIwG,SAGNqG,GAAK/N,EAAEiU,SAAS9H,IAEtB,OAAO,IAAI,KAAE,CACXt5B,IAAK25B,EACLnpB,KAAO2c,IAAOkL,EAAElL,GAAI,CAClBgT,OAASzH,IACPL,EAAEK,WAKVP,EAAEqZ,GAAI,CACJ7T,YAAa,6BACbljB,MAAO,UAET,MAAMo3B,IAAK,SAAGlZ,IACZ,MAAMgB,EAAKtB,IACT,GAAIA,EAAEoZ,YAAcpZ,EAAEqZ,SACpB,OACF,MAAMvkB,EAAI0K,GAAEtzB,KAAKo0B,GAAID,EAAId,GAAErzB,KAAKo0B,GAAIW,EAAItB,GAAEzzB,KAAKo0B,GAAIuC,EAAI7C,EAAEloB,MAAO7O,EAAI,CAACuzB,EAAGkD,KACtE,IAAI4D,GAAI,EACR,MAAMC,EAAI,GAAG7D,EAAI,KACjB,OAAOlD,EAAEna,QAAUkhB,IAAM/G,EAAEna,MAAQkhB,EAAGD,GAAI,GAAKA,GAEjD,IAAIlU,EAAIyT,EAAE2M,GAAInM,GAAI,EAClBR,EAAEtT,IAAI+pB,aAAY,CAAC9c,EAAGkD,EAAG4D,EAAGC,KAC1B,GAAI/G,EAAEtwB,OAASm0B,EAAG,CAChB,MAAMyD,EAAItH,EAAEid,WAAW,IACjB,MAAL3V,OAAY,EAASA,EAAE53B,QAAU+0B,GAA0B,YAArB6C,EAAEjD,MAAM8U,WAA2BtS,GAAI,EAAIjU,EAAE8jB,cAAcxT,EAAG5K,EAAG,CAAEtG,OAAQ,SAAWgO,EAAE8c,aAAY,CAACvkB,EAAG2kB,EAAIC,EAAIC,KACrJ,GAAI7kB,EAAE7oB,OAAS+0B,EAAG,CAChB,MAAMgI,EAAK,IAAKlU,EAAE8L,OAClB53B,EAAEggC,EAAI2Q,KAAQxqB,EAAIA,EAAE8jB,cAAcwG,OAAI,EAAQzQ,IAEhD,OAAO,WAEJ,GAAIzM,EAAEtwB,OAAS+0B,IAAW,MAALqC,OAAY,EAASA,EAAEp3B,QAAU4oB,EAAG,CAC9D,MAAMgP,EAAI,IAAKtH,EAAEqE,OACjB,IAAI9L,GAAI,EACO,YAAf+O,EAAE6R,WAA2B7R,EAAE6R,SAAW,UAAW5gB,GAAI,IAAW,MAALuO,OAAY,EAASA,EAAEmW,WAAW,MAAQ1kB,EAAI9rB,EAAE66B,EAAGP,IAAKxO,IAAM3F,EAAIA,EAAE8jB,cAAcxT,OAAG,EAAQoE,GAAIT,GAAI,OAEpKA,GAAKrD,EAAE+I,SAAS3Z,EAAE2lB,QAAQ,gBAAgB,KAEhD,OAAO,IAAI,KAAE,CACXptC,IAAK,IAAI,KAAE,4BACXwQ,KAAO6nB,IAAOsB,EAAEtB,GAAI,CAClB8H,OAAShT,IACPwM,EAAExM,WAKVgL,EAAE0Z,GAAI,CACJlU,YAAa,6BACbljB,MAAO,UAET,MAYUy3B,GAAK,CAAC1C,GAAIC,GAAIC,GAAIC,GAAIC,GAZrB,CACTqB,GACAI,GACAC,GACAlB,GACAP,GACAE,GACAD,GACAE,GACA5R,GACAoT,GACAK,IACAnX,QAAsCA,Q,8IC1oDxC,MAAMyX,EAA0B,oBAAbC,UAA2BA,UAAY,KACpDxqB,EAAyB,oBAAZ/a,SAA0BA,SAAW,KAClDwlC,EAAQF,GAAOA,EAAIG,WAAa,GAChCC,EAAU,cAAclrB,KAAKgrB,GAC7BG,EAAY,UAAUnrB,KAAKgrB,GAC3BI,EAAU,wCAAwCprB,KAAKgrB,GACvDzT,KAAQ4T,GAAaC,GAAWF,GAEhCG,GADaF,EAAY3lC,SAAS8lC,aAAeF,EAAWA,EAAQ,GAAKF,GAAWA,EAAQ,IACnF3T,GAAM,gBAAgB97B,KAAKuvC,IAEpCO,GADgBF,IAAW,iBAAiBrrB,KAAKgrB,IAAU,CAAC,EAAG,IAAI,IACxDzT,GAAM,gBAAgBvX,KAAKgrB,IAGtCQ,GADiBD,GAAWA,EAAQ,IAC1BhU,KAAQuT,GAAO,iBAAiBrvC,KAAKqvC,EAAIW,SACnDC,EAAMF,IAAW,cAAc/vC,KAAKuvC,MAAYF,GAAOA,EAAIa,eAAiB,GAG5EC,GAFMF,KAAQZ,GAAM,MAAMrvC,KAAKqvC,EAAIe,UACzB,aAAapwC,KAAKuvC,KACjBzqB,GAAO,wBAAyBA,EAAIurB,gBAAgB/mB,OAC9C6mB,IAAW,uBAAuB5rB,KAAK+qB,UAAUE,YAAc,CAAC,EAAG,IAAI,GAkB9F,SAASjjB,EAAI7e,EAAMvL,EAAMglC,EAAI77B,EAAMmxB,EAAOrI,GACxC,GAAI1mB,EAAKihC,UACP,OAAO,EACT,MAAMthC,EAAQK,EAAKL,MACbm3B,EAAQn3B,EAAMyX,IAAIpa,QAAQvI,GAChC,GAAIqiC,EAAM7b,OAAOlnB,KAAKq1B,KAAK9xB,KACzB,OAAO,EACT,MAAMsrC,EAAa9L,EAAM7b,OAAO4nB,YAAY/rB,KAAKhe,IAAI,EAAGg+B,EAAMgE,aAAe,KAAMhE,EAAMgE,kBAAc,EAAQ,UAAYl9B,EAC3H,IAAK,IAAI9M,EAAI,EAAGA,EAAIi+B,EAAMh+B,OAAQD,IAAK,CACrC,MAAMsC,EAAQ27B,EAAMj+B,GAAGsC,MAAMyjB,KAAK+rB,GAC5BvL,EAAKjkC,GAASA,EAAM,IAAM27B,EAAMj+B,GAAG2jB,QAAQ9U,EAAOvM,EAAOqB,GAAQrB,EAAM,GAAGrC,OAAS6M,EAAK7M,QAAS0oC,GACvG,GAAKpC,EAGL,OADAr3B,EAAK4wB,SAASyG,EAAGuF,QAAQlW,EAAQ,CAAEoc,UAAWzL,EAAI5iC,OAAMglC,KAAI77B,WACrD,EAET,OAAO,EAET,MAAMmlC,EAAsB,IAAI,KAAU,8BAC1C,SAASC,GAAiB,MAAEjU,IAC1B,MAAMrI,EAAS,IAAI,KAAO,CACxBl3B,IAAKuzC,EACLE,cAAc,EACdtjC,MAAO,CACLgvB,KAAI,IACK,KAETtP,MAAMgY,EAAI6L,GACR,MAAM5f,EAAS+T,EAAGuJ,QAAQjnC,MAC1B,OAAI2pB,IAEG+T,EAAG8L,cAAgB9L,EAAG+L,WAAa,KAAOF,KAGrD1Y,MAAO,CACL6Y,gBAAe,CAACrjC,EAAMvL,EAAMglC,EAAI77B,IACvBihB,EAAI7e,EAAMvL,EAAMglC,EAAI77B,EAAMmxB,EAAOrI,GAE1CmZ,gBAAiB,CACfC,eAAiB9/B,IACfgyB,YAAW,KACT,MAAM,QAAEsR,GAAYtjC,EAAKL,MAAMq3B,UAC3BsM,GACFzkB,EAAI7e,EAAMsjC,EAAQv0B,IAAKu0B,EAAQv0B,IAAK,GAAIggB,EAAOrI,OAE5C,IAGX6c,cAAcvjC,EAAMjL,GAClB,GAAkB,UAAdA,EAAMvF,IACR,OAAO,EACT,MAAM,QAAE8zC,GAAYtjC,EAAKL,MAAMq3B,UAC/B,QAAIsM,GACKzkB,EAAI7e,EAAMsjC,EAAQv0B,IAAKu0B,EAAQv0B,IAAK,KAAMggB,EAAOrI,OAKhE,OAAOA,EAGT,SAAS8c,EAASC,EAAQC,EAAU5zC,EAAU,IAC5C,OAAO,IAAI,KAAU2zC,GAAQ,CAAC9jC,EAAOvM,EAAOhC,EAAOC,KACjD,IAAIsyC,EAAIC,EAAIC,EAAIC,EAChB,MAAM,GAAEzM,GAAO13B,EAEf,IAAIsK,EAAQ7W,EADQA,EAAMrC,OACM,GAC5BkoC,EAAY7lC,EAAM,GAClB2wC,EAAqB,GACrBC,EAAU3yC,EACd,MAAM4yC,EAAW,CACfh6B,QACAgvB,YACA7nC,QACAC,OAEIE,EAA0C,OAAhCoyC,EAAK7zC,EAAQkpC,qBAA0B,EAAS2K,EAAGt0C,KAAKS,EAASm0C,GAGjF,GAFAv1C,OAAO8G,OAAOyuC,EAAU1yC,KACrB0Y,QAAOgvB,YAAW7nC,QAAOC,OAAQ4yC,GAClB,OAAdhL,EACF,OAAO,KACT,GAAgD,MAAlC,MAAThvB,OAAgB,EAASA,EAAMm3B,QAClC,OAAO,KACT,GAAIn3B,EAAO,CACT,MAAMi6B,EAAcjL,EAAUhrB,OAAO,MAC/Bk2B,EAAY/yC,EAAQ6nC,EAAU1e,QAAQtQ,GACtCm6B,EAAUD,EAAYl6B,EAAMlZ,OAClCgzC,EAA8C,OAAxBH,EAAKvM,EAAGgN,aAAuBT,EAAK,GACtDQ,EAAU/yC,GACZgmC,EAAG7F,OAAO4S,EAAS/yC,GACjB8yC,EAAY/yC,GACdimC,EAAG7F,OAAOpgC,EAAQ8yC,EAAaC,GACjCH,EAAU5yC,EAAQ8yC,EAAcj6B,EAAMlZ,OACtC,MAAM23B,EAAkC,OAAzBmb,EAAK/zC,EAAQw0C,cAAmB,EAAST,EAAGx0C,KAAKS,EAASsD,GACzEikC,EAAGuC,QAAQxoC,EAAO4yC,EAASN,EAASliC,OAAOknB,IAC3C2O,EAAGkN,eAAeR,GACe,OAAhCD,EAAKh0C,EAAQ00C,iBAAmCV,EAAGz0C,KAAKS,EAAS,CAAEsD,QAAOhC,QAAOC,MAAKgmC,OAEzF,OAAOA,KAiCK3oC,OAAOK,eACNL,OAAO+1C,iBACA/1C,OAAOg2C,0BACLh2C,OAAOi2C,sBACdj2C,OAAOC,UAAUC,eACjBF,OAAOC,UAAUi2C,qBAwIpC,SAASC,EAAuB7N,EAAW8N,GACzC,KAAM9N,aAAqB,MACzB,OACF,MAAM,KAAEljC,EAAI,MAAEgjC,GAAUE,EACxB,OA3DF,SAAuB8N,EAAUhxC,GAC/B,OAAO1E,MAAMF,QAAQ41C,IAAaA,EAAStoC,SAAS1I,EAAKC,OAASD,EAAKC,OAAS+wC,EA0D5EC,CAAcD,EAAUhxC,GACnB,CAAEA,OAAMib,IAAK+nB,EAAM/nB,IAAK3d,MAAO0lC,EAAM1lC,MAAM0lC,EAAMphB,OAAQA,MAAOohB,EAAMphB,YAD/E,I,kIC3TF,MAAMoT,GAAI,mBAAE,IAoBZ,MAAMsC,EAAI,KACR,MAAMjD,EApBR,WACE,MAAQsG,IAAKtG,EAAG6c,OAAQ9c,EAAG+c,WAAY9b,EAAG+b,cAAerd,IAAM,gBAAEiB,GAAIh4B,GAAI,YAAE,MAC3E,OAAO,gBAAE,KACP,MAAM62B,EAAI72B,EAAEwF,QACZ,IAAKuxB,IAAMF,EACT,OACFQ,EAAE7xB,QAAUqxB,EACZ,MAAM1Q,EAAI4Q,EAAEF,GACZ,OAAI1Q,GACKkS,GAAE,GAAKlS,EAAEzV,SAAS+d,MAAMwI,IAC7BG,EAAE5xB,QAAUyxB,KACXyL,SAAQ,KACTrK,GAAE,MACDgc,MAAMrT,QAAQzT,OAAQ,KACvB,IAAI0J,EACe,OAAlBA,EAAIG,EAAE5xB,UAAoByxB,EAAEmI,iBAPjC,IASC,CAAC/H,EAAGD,EAAGL,EAAGsB,IAAKr4B,EAGR86B,GACV,OAAuB,gBAAgB,MAAO,CAAE,sBAAsB,EAAIwZ,IAAKjd,KAC9E8C,EAAI,EAAGh3B,SAAUk0B,MAClB,MAAMD,GAAI,iBAAE,IAAUiB,EAAGtB,IAAK,mBAAE,GAAS/2B,GAAI,eAAM62B,EAAG1Q,IAAK,eAAE,GAAK8Q,GAAI,cAAE,KAAM,CAC5Esd,QAAS1d,EACT8G,IAAKvG,EACL8c,OAAQl0C,EACRm0C,WAAYhuB,EACZiuB,cAAe/b,EACfmc,iBAAkBzd,KAChB,CAACF,EAAGwB,IACR,OAAuB,gBAAgBL,EAAEyc,SAAU,CAAEr1C,MAAO63B,GAAKI,IAEnE,SAASZ,EAAEY,EAAGD,EAAI,IAChB,MAAMiB,GAAI,gBAAEL,GAAIjB,GAAI,iBAAEM,EAAGD,GACzB,OAAO,sBAAE,KACPiB,EAAEmc,kBAAiB,IAAMzd,MACxB,CAACsB,EAAGtB,IAAK,CACVwd,QAASlc,EAAEkc,QACXvd,IAAK,IAAMqB,EAAE6b,OAAO1uC,W,sWCvCjB,IAAIkvC,EAASC,GAASC,OAAOC,gBAAgB,IAAIC,WAAWH,I,gDAgBvC,EAACI,EAAU3sC,EAAO,MAfpB,EAAC2sC,EAAUC,EAAaC,KAChD,IAAIC,GAAQ,GAAMlvB,KAAKmvB,IAAIJ,EAAS90C,OAAS,GAAK+lB,KAAKovB,KAAQ,EAC3D3O,KAAW,IAAMyO,EAAOF,EAAeD,EAAS90C,SAcpDo1C,CAAaN,EAAU3sC,EAAMssC,ICZrB,CAAE,iBAAkB,IAc9B,SAAStX,EAAGvG,EAAGO,GACb,MAAML,GAAI,QAAEF,GAAIQ,EAAKgB,GAAM6D,UACzB7E,EAAE34B,IAAMq4B,QAASsB,EAAEsG,KAAK,MACxB,MAAM9S,EAAIuL,EAAEiB,GACZ,OAAOA,EAAErB,IAAI,MAAGtmB,OAAOqmB,EAAGlL,GAAIwL,EAAEtJ,IAAOiK,GAAMK,EAAErB,IAAI,MAAGz4B,KAAKs4B,EAAGmB,GAAI,KAChEK,EAAErB,IAAI,MAAGzzB,OAAOwzB,KAGpB,OAAOM,EAgBT,SAAS8G,EAAGtH,GACV,MAAMO,EAAKL,GAAMmF,gBACTnF,EAAE4H,KAAK,MACb,MAAMtH,EAAIR,EAAEE,GACZ,OAAOA,EAAE8H,OAAO,MAAIxG,GAAM,IAAIA,EAAGhB,KAAKD,EAAEke,UAAYje,EAAG,KACrDN,EAAE8H,OAAO,MAAIxG,GAAMA,EAAE0I,QAAQlV,GAAMA,IAAMwL,QAG7C,OAAOD,EA+CT,SAASuF,EAAE9F,EAAGO,GACZ,MAAML,EAAKM,GAAM6E,UACf,MAAM7D,EAAIjB,EAAEC,GACZ,OAAOA,EAAEwH,OAAO,MAAIhT,GAAM,IAAIA,EAAEkV,QAAQ/I,GAAMA,EAAE,KAAOnB,IAAI,CAACA,EAAGwB,MAAMtB,EAAEhK,GAAK8J,EAAGE,EAAEmB,OAASG,EAAG,KAC3FhB,EAAEwH,OAAO,MAAIhT,GAAMA,EAAEkV,QAAO,EAAE/I,KAAOA,IAAMnB,QAG/C,OAAOE,EAAE9zB,KAAQo0B,IACf,MAAMgB,EAAIhB,EAAEL,IAAI,MAAGmB,MAAMtB,GACzB,IAAKwB,EACH,MAAM,QAAExB,GACV,OAAOwB,GACNtB,EAoBL,SAAS6E,EAAG/E,GACV,IAAIO,EACJ,MAAML,EAAKM,GAAM6E,gBAAmB7E,EAAEsH,KAAK,MAAIvH,EAAIP,EAAEQ,GAAIA,EAAEwH,OAAO,MAAIxG,GAAM,IAAIA,EAAGjB,KAAK,KACtFC,EAAEwH,OAAO,MAAIxG,GAAMA,EAAE0I,QAAQlV,GAAMA,IAAMuL,QAE3C,OAAOL,EAAEnB,OAAS,IAAMwB,EAAGL,EAAEr4B,IAAM,IAAM04B,EAAEkB,KAAK55B,IAAKq4B,EA2DvD,SAASH,EAAEC,EAAGO,GACZ,MAAML,GAAI,QAAEF,EAAGO,GAAIC,EAAKgB,IAAOA,EAAE2D,OAAOjF,GAAI,IAAM,KAChDsB,EAAE90B,OAAOwzB,KAEX,OAAOM,EAAE34B,IAAMq4B,EAAGM,EAEpB,SAASyE,EAAGjF,EAAGO,GACb,MAAML,EAAIH,EAAEQ,EAAGP,GAAIQ,EAAIsF,EAAE9F,GAAIhL,GAAMA,EAAEmL,IAAID,EAAEr4B,IAARmtB,CAAaA,KAAKwM,EAAI,CAACtB,EAAGM,GAC7D,OAAOgB,EAAEtL,GAAKsK,EAAEtK,GAAIsL,EAAEr1B,KAAOq0B,EAAGgB,EAAEp1B,KAAQ4oB,GAAMwL,EAAEp0B,KAAK4oB,GAAIwM,EAAEH,OAASb,EAAEa,OAAQG,EAAEuH,IAAM7I,EAAGsB,EAAE35B,IAAMq4B,EAAEr4B,IAAK25B,EAAEkd,aAAgB1pB,GAAOmM,GAAM,KACvI,MAAMh4B,EAAIg4B,EAAEhB,IAAID,EAAEr4B,KAAMu4B,EAAIpL,EAAE7rB,EAAF6rB,CAAKmM,GACjCA,EAAE6G,OAAO,MAAIzE,GAAM,IAAIA,EAAE2G,QAAQjJ,GAAMA,EAAE,KAAOjB,IAAI,CAACA,EAAGI,MAAMoB,EAAEH,OAASjB,GACxEoB,EAEL,SAAS0D,EAAGlF,EAAGO,GACb,MAAML,EAAIH,EAAEQ,EAAGP,GAAIQ,EA9IrB,SAAWR,EAAGO,GACZ,MAAML,EAAKM,GAAM6E,UACf,MAAM7D,EAAIjB,EAAEC,GACZ,OAAOA,EAAEwH,OAAO,MAAIhT,GAAM,IAAIA,EAAEkV,QAAQ/I,GAAMA,EAAE,KAAOnB,IAAI,CAACA,EAAGwB,MAAMtB,EAAEhK,GAAK8J,EAAGE,EAAEmB,OAASG,EAAG,KAC3FhB,EAAEwH,OAAO,MAAIhT,GAAMA,EAAEkV,QAAO,EAAE/I,KAAOA,IAAMnB,QAG/C,OAAOE,EAAE9zB,KAAQo0B,IACf,MAAMgB,EAAIhB,EAAEL,IAAI,MAAGiB,MAAMpB,GACzB,IAAKwB,EACH,MAAM,QAAExB,GACV,OAAOwB,GACNtB,EAkIoBO,CAAET,GAAIhL,GAAMA,EAAEmL,IAAID,EAAEr4B,IAARmtB,CAAaA,KAAKwM,EAAI,CAACtB,EAAGM,GAC7D,OAAOgB,EAAEtL,GAAKsK,EAAEtK,GAAIsL,EAAE2P,KAAO3Q,EAAGgB,EAAEp1B,KAAOo0B,EAAEp0B,KAAMo1B,EAAEH,OAASb,EAAEa,OAAQG,EAAEuH,IAAM7I,EAAGsB,EAAE35B,IAAMq4B,EAAEr4B,IAAK25B,EAAEkd,aAAgB1pB,GAAOmM,GAAM,KAC7H,MAAMh4B,EAAIg4B,EAAEhB,IAAID,EAAEr4B,KAAMu4B,EAAIpL,EAAE7rB,EAAF6rB,CAAKmM,GACjCA,EAAE6G,OAAO,MAAIzE,GAAM,IAAIA,EAAE2G,QAAQjJ,GAAMA,EAAE,KAAOjB,IAAI,CAACA,EAAGI,MAAMoB,EAAEH,OAASjB,GACxEoB,EAEL,SAASkG,EAAG1H,EAAGO,GACb,MAAwFC,EAAIT,EAAlFh5B,OAAO8+B,YAAY9+B,OAAOohC,QAAQ5H,GAAGpnB,KAAI,EAAEgoB,GAAKqQ,UAAWroC,MAAS,CAACg4B,EAAGh4B,MAAe,GAAG62B,WAAYwB,EAnElH,SAAWxB,GACT,MAAMO,EAAKL,GAAMmF,gBACTnF,EAAE4H,KAAK,MACb,MAAMtH,EAAIR,EAAEE,GAAIsB,GAAI,OAAEhB,GACtB,OAAON,EAAE8H,OAAO,MAAIhT,GAAM,IAAIA,EAAGwM,KAAKjB,EAAEoe,OAASne,EAAG,KAClDN,EAAE8H,OAAO,MAAIhT,GAAMA,EAAEkV,QAAQ/I,GAAMA,IAAMK,QAG7C,OAAOjB,EA2D6GkF,EAAGtE,IACrH,MAAMh4B,EAAIg4B,EAAEhB,IAAIK,EAAE34B,KAAM+7B,EAAI78B,OAAOohC,QAAQ5H,GAAGqe,SAAQ,EAAExe,GAAKqR,QAASlO,MAAS,CAACp6B,EAAEi3B,IAAImC,OAAOppB,KAAKirB,GAAM,CAACA,EAAGb,EAAEpC,QAC9G,OAAOp6B,OAAO8+B,YAAYjC,MACxB5O,EAAI,CAACwL,EAAGgB,GACZ,OAAOxM,EAAE+T,IAAMvI,EAAGxL,EAAEwc,UAAYhQ,EAAGxM,EAAEntB,IAAM24B,EAAE34B,IAAKmtB,EAAE2pB,OAASnd,EAAEmd,OAAQ3pB,EAEzE,MAAM4e,EAAK,CAAC5T,EAAGO,EAAI,MAAM,OAASR,EAAEQ,EAAG,GAAGP,SAAUyH,EAAK,CAACzH,EAAGO,EAAI,MAAM,OAASR,EAAEQ,EAAG,GAAGP,SACxF,SAAS8E,EAAG9E,EAAGO,EAAGL,GAChB,MAAMM,EAAIT,EAAEG,GAAK,GAAIF,GAAIwB,EAAKL,GAAMkE,gBAC5BlE,EAAE2G,KAAK,MACb,MAAMlE,EAAI,CACR7E,OAAQwB,EAAEY,GACVh5B,QAASg5B,EAAEhB,IAAIK,EAAE34B,MAEnB,OAAOs5B,EAAE6G,OAAO,MAAI5H,GAAM,IAAIA,EAAGwD,KAAK,KACpCzC,EAAE6G,OAAO,MAAI5H,GAAMA,EAAE8J,QAAQ3G,GAAMA,IAAMK,QAE1C5O,EAAI,CAACwL,EAAGgB,GACX,OAAOxM,EAAEkB,GAAK8J,EAAGhL,EAAE+J,OAASyC,EAAGxM,EAAE7sB,QAAUq4B,EAAGxL,EA0ChD,SAAS+f,EAAG/U,EAAGO,GAAI,GACjB,OAAQL,IACN,MAAMM,EAAIN,EAAEC,IAAI,MAAInL,EAAIkL,EAAEC,IAAI,KAAND,CAASF,GACjC,IAAKhL,EACH,OACF,IAAKuL,EAAG,CACN,MAAQvoB,MAAOurB,GAAM/C,EACrB,OAAOA,EAAEyI,SAAS1F,EAAEmM,GAAGpzB,QAAQ,EAAGinB,EAAE9T,IAAI7d,QAAQL,KAAM,IAAI,KAAEyjB,EAAEpjB,QAAS,EAAG,KAE5E,MAAMuvB,EAAIjB,EAAEC,IAAI,MAAIh3B,EAAI+2B,EAAEC,IAAI,KAAIyD,EAAI1D,EAAEC,IAAI,MAAIC,EAAI,YAAS,CAC3DiB,OAAQF,EACR1R,IAAKuF,EACLgK,QAAS4E,KACNz6B,IAELq3B,EAAEqe,YAAYze,M,iRC7RlB,MAAM0e,EAAkB,CAAC9mC,EAAOixB,KACxBjxB,EAAMq3B,UAAUwC,QAEhB5I,GACAA,EAASjxB,EAAM03B,GAAGoP,kBAAkB/O,mBACjC,GAEX,SAASgP,EAAa/mC,EAAOK,GACzB,IAAI,QAAEsjC,GAAY3jC,EAAMq3B,UACxB,OAAKsM,IAAYtjC,GAAQA,EAAK2mC,eAAe,WAAYhnC,GACnD2jC,EAAQxI,aAAe,GAClB,KACJwI,EAWX,MAAMsD,EAAe,CAACjnC,EAAOixB,EAAU5wB,KACnC,IAAIsjC,EAAUoD,EAAa/mC,EAAOK,GAClC,IAAKsjC,EACD,OAAO,EACX,IAAIuD,EAAOC,EAAcxD,GAEzB,IAAKuD,EAAM,CACP,IAAI5P,EAAQqM,EAAQpM,aAAcrnC,EAASonC,IAAS,QAAWA,GAC/D,OAAc,MAAVpnC,IAEA+gC,GACAA,EAASjxB,EAAM03B,GAAGG,KAAKP,EAAOpnC,GAAQ6nC,mBACnC,GAEX,IAAIjgC,EAASovC,EAAKpJ,WAElB,IAAKhmC,EAAO1D,KAAKq1B,KAAK+S,WAAa4K,EAAcpnC,EAAOknC,EAAMjW,GAC1D,OAAO,EAGX,GAAmC,GAA/B0S,EAAQroB,OAAO1hB,QAAQL,OACtB8tC,EAAYvvC,EAAQ,QAAU,kBAA2BA,IAAU,CACpE,IAAIwvC,GAAU,QAAYtnC,EAAMyX,IAAKksB,EAAQ7rC,SAAU6rC,EAAQ5mC,QAAS,YACxE,GAAIuqC,GAAWA,EAAQ90C,MAAM+G,KAAO+tC,EAAQxN,GAAKwN,EAAQxyC,KAAM,CAC3D,GAAIm8B,EAAU,CACV,IAAIyG,EAAK13B,EAAM03B,GAAGE,KAAK0P,GACvB5P,EAAG8C,aAAa6M,EAAYvvC,EAAQ,OAAS,cAAmB4/B,EAAGjgB,IAAIpa,QAAQq6B,EAAGI,QAAQ32B,IAAI+lC,EAAK93B,KAAM,KAAM,GACzG,YAAqBsoB,EAAGjgB,IAAKyvB,EAAK93B,IAAMtX,EAAOmgC,WACrDhH,EAASyG,EAAGK,kBAEhB,OAAO,GAIf,SAAIjgC,EAAOyvC,QAAUL,EAAKnxB,OAAS4tB,EAAQ5tB,MAAQ,KAC3Ckb,GACAA,EAASjxB,EAAM03B,GAAG7F,OAAOqV,EAAK93B,IAAMtX,EAAOmgC,SAAUiP,EAAK93B,KAAK2oB,mBAC5D,IA0Df,SAASsP,EAAYlzC,EAAMysC,EAAM4G,GAAO,GACpC,IAAK,IAAIC,EAAOtzC,EAAMszC,EAAMA,EAAgB,SAAR7G,EAAkB6G,EAAKhQ,WAAagQ,EAAK3O,UAAY,CACrF,GAAI2O,EAAKjJ,YACL,OAAO,EACX,GAAIgJ,GAA2B,GAAnBC,EAAKjQ,WACb,OAAO,EAEf,OAAO,EAUX,MAAMkQ,EAAqB,CAAC1nC,EAAOixB,EAAU5wB,KACzC,IAAI,MAAEsnC,EAAK,MAAE9N,GAAU75B,EAAMq3B,UAAW6P,EAAOS,EAC/C,IAAK9N,EACD,OAAO,EACX,GAAI8N,EAAMrsB,OAAOkjB,YAAa,CAC1B,GAAIn+B,GAAQA,EAAK2mC,eAAe,WAAYhnC,GAAS2nC,EAAMxM,aAAe,EACtE,OAAO,EACX+L,EAAOC,EAAcQ,GAEzB,IAAIxzC,EAAO+yC,GAAQA,EAAKpJ,WACxB,SAAK3pC,IAAS,kBAA2BA,MAErC88B,GACAA,EAASjxB,EAAM03B,GAAG8C,aAAa,YAAqBx6B,EAAMyX,IAAKyvB,EAAK93B,IAAMjb,EAAK8jC,WAAWF,mBACvF,IAEX,SAASoP,EAAcS,GACnB,IAAKA,EAAKtsB,OAAOlnB,KAAKq1B,KAAK+S,UACvB,IAAK,IAAIrrC,EAAIy2C,EAAK7xB,MAAQ,EAAG5kB,GAAK,EAAGA,IAAK,CACtC,GAAIy2C,EAAKj2C,MAAMR,GAAK,EAChB,OAAOy2C,EAAKnwB,IAAIpa,QAAQuqC,EAAK9vC,OAAO3G,EAAI,IAC5C,GAAIy2C,EAAKzzC,KAAKhD,GAAGiD,KAAKq1B,KAAK+S,UACvB,MAEZ,OAAO,KAEX,SAASqL,EAAW7nC,EAAOK,GACvB,IAAI,QAAEsjC,GAAY3jC,EAAMq3B,UACxB,OAAKsM,IAAYtjC,GAAQA,EAAK2mC,eAAe,UAAWhnC,GAClD2jC,EAAQxI,aAAewI,EAAQroB,OAAO1hB,QAAQL,MACzC,KACJoqC,EAoEX,SAASmE,EAAaF,GAClB,IAAKA,EAAKtsB,OAAOlnB,KAAKq1B,KAAK+S,UACvB,IAAK,IAAIrrC,EAAIy2C,EAAK7xB,MAAQ,EAAG5kB,GAAK,EAAGA,IAAK,CACtC,IAAImqB,EAASssB,EAAKzzC,KAAKhD,GACvB,GAAIy2C,EAAKj2C,MAAMR,GAAK,EAAImqB,EAAOkc,WAC3B,OAAOoQ,EAAKnwB,IAAIpa,QAAQuqC,EAAK7qC,MAAM5L,EAAI,IAC3C,GAAImqB,EAAOlnB,KAAKq1B,KAAK+S,UACjB,MAEZ,OAAO,KAyEX,SAASuL,EAAet0C,GACpB,IAAK,IAAItC,EAAI,EAAGA,EAAIsC,EAAMu0C,UAAW72C,IAAK,CACtC,IAAI,KAAEiD,GAASX,EAAMw0C,KAAK92C,GAC1B,GAAIiD,EAAKoqC,cAAgBpqC,EAAK8zC,mBAC1B,OAAO9zC,EAEf,OAAO,KA8GX,MAAM+zC,EA1CK,CAACnoC,EAAOixB,KACX,IAAI,MAAEkG,EAAK,IAAEC,GAAQp3B,EAAMq3B,UAC3B,GAAIr3B,EAAMq3B,qBAAqB,MAAiBr3B,EAAMq3B,UAAUljC,KAAK8pC,QACjE,SAAK9G,EAAMgE,gBAAiB,QAASn7B,EAAMyX,IAAK0f,EAAM/nB,QAElD6hB,GACAA,EAASjxB,EAAM03B,GAAGnmC,MAAM4lC,EAAM/nB,KAAK2oB,mBAChC,GAEX,IAAKZ,EAAM7b,OAAO2iB,QACd,OAAO,EACX,GAAIhN,EAAU,CACV,IAAIoH,EAAQjB,EAAI+D,cAAgB/D,EAAI9b,OAAO1hB,QAAQL,KAC/Cm+B,EAAK13B,EAAM03B,IACX13B,EAAMq3B,qBAAqB,MAAiBr3B,EAAMq3B,qBAAqB,OACvEK,EAAGoP,kBACP,IAAIsB,EAAuB,GAAfjR,EAAMphB,MAAa,KAAOgyB,EAAe5Q,EAAMhjC,MAAM,GAAGuqC,eAAevH,EAAMiH,YAAY,KACjGiK,EAAYC,GAAaA,EAAUlR,EAAI9b,OAAQ+c,GAC/CuG,EAAQyJ,EAAY,CAACA,GAAahQ,GAAS+P,EAAQ,CAAC,CAAEh0C,KAAMg0C,SAAWt2C,EACvEy2C,GAAM,QAAS7Q,EAAGjgB,IAAKigB,EAAGI,QAAQ32B,IAAIg2B,EAAM/nB,KAAM,EAAGwvB,GAMzD,GALKA,GAAU2J,KAAO,QAAS7Q,EAAGjgB,IAAKigB,EAAGI,QAAQ32B,IAAIg2B,EAAM/nB,KAAM,EAAGg5B,EAAQ,CAAC,CAAEh0C,KAAMg0C,SAAWt2C,KACzFs2C,IACAxJ,EAAQ,CAAC,CAAExqC,KAAMg0C,KACrBG,GAAM,GAENA,IACA7Q,EAAGnmC,MAAMmmC,EAAGI,QAAQ32B,IAAIg2B,EAAM/nB,KAAM,EAAGwvB,IAClCvG,IAAUlB,EAAMgE,cAAgBhE,EAAM7b,OAAOlnB,MAAQg0C,GAAO,CAC7D,IAAII,EAAQ9Q,EAAGI,QAAQ32B,IAAIg2B,EAAMr/B,UAAW2wC,EAAS/Q,EAAGjgB,IAAIpa,QAAQmrC,GAChEJ,GAASjR,EAAMhjC,MAAM,GAAGu0C,eAAeD,EAAO92C,QAAS82C,EAAO92C,QAAU,EAAGy2C,IAC3E1Q,EAAG0D,cAAc1D,EAAGI,QAAQ32B,IAAIg2B,EAAMr/B,UAAWswC,GAG7DnX,EAASyG,EAAGK,kBAEhB,OAAO,GApCf,IAAsBuQ,EAgGtB,SAASlB,EAAcpnC,EAAOknC,EAAMjW,GAChC,IAAsD0X,EAAMl1C,EAAxDqE,EAASovC,EAAKpJ,WAAY/gC,EAAQmqC,EAAK/O,UAC3C,GAAIrgC,EAAO1D,KAAKq1B,KAAK+S,WAAaz/B,EAAM3I,KAAKq1B,KAAK+S,UAC9C,OAAO,EACX,GAtBJ,SAAwBx8B,EAAO4nC,EAAM3W,GACjC,IAAIn5B,EAAS8vC,EAAK9J,WAAY/gC,EAAQ6qC,EAAKzP,UAAWxmC,EAAQi2C,EAAKj2C,QACnE,SAAKmG,GAAWiF,GAAUjF,EAAO1D,KAAKw0C,kBAAkB7rC,EAAM3I,UAEzD0D,EAAO8B,QAAQL,MAAQquC,EAAKtsB,OAAOid,WAAW5mC,EAAQ,EAAGA,IACtDs/B,GACAA,EAASjxB,EAAM03B,GAAG7F,OAAO+V,EAAKx4B,IAAMtX,EAAOmgC,SAAU2P,EAAKx4B,KAAK2oB,mBAC5D,MAEN6P,EAAKtsB,OAAOid,WAAW5mC,EAAOA,EAAQ,KAAQoL,EAAMyhC,eAAe,QAAQx+B,EAAMyX,IAAKmwB,EAAKx4B,QAE5F6hB,GACAA,EAASjxB,EAAM03B,GACVmR,kBAAkBjB,EAAKx4B,IAAKtX,EAAO1D,KAAM0D,EAAO4mC,eAAe5mC,EAAO0/B,aACtEjlC,KAAKq1C,EAAKx4B,KACV2oB,mBACF,IAMH+Q,CAAe9oC,EAAOknC,EAAMjW,GAC5B,OAAO,EACX,IAAI8X,EAAc7B,EAAK5rB,OAAOid,WAAW2O,EAAKv1C,QAASu1C,EAAKv1C,QAAU,GACtE,GAAIo3C,IACCJ,GAAQl1C,EAAQqE,EAAO4mC,eAAe5mC,EAAO0/B,aAAawR,aAAajsC,EAAM3I,QAC9EX,EAAMw1C,UAAUN,EAAK,IAAM5rC,EAAM3I,MAAM80C,SAAU,CACjD,GAAIjY,EAAU,CACV,IAAIv/B,EAAMw1C,EAAK93B,IAAMrS,EAAMk7B,SAAUpY,EAAO,WAC5C,IAAK,IAAI1uB,EAAIw3C,EAAKv3C,OAAS,EAAGD,GAAK,EAAGA,IAClC0uB,EAAO,UAAc8oB,EAAKx3C,GAAG0Q,OAAO,KAAMge,IAC9CA,EAAO,UAAc/nB,EAAO/G,KAAK8uB,IACjC,IAAI6X,EAAK13B,EAAM03B,GAAGE,KAAK,IAAI,KAAkBsP,EAAK93B,IAAM,EAAG1d,EAAKw1C,EAAK93B,IAAK1d,EAAK,IAAI,KAAMmuB,EAAM,EAAG,GAAI8oB,EAAKv3C,QAAQ,IAC/G+3C,EAASz3C,EAAM,EAAIi3C,EAAKv3C,QACxB,QAAQsmC,EAAGjgB,IAAK0xB,IAChBzR,EAAGnlC,KAAK42C,GACZlY,EAASyG,EAAGK,kBAEhB,OAAO,EAEX,IAAIqR,EAAW,cAAmBlC,EAAM,GACpC5P,EAAQ8R,GAAYA,EAASjS,MAAMI,WAAW6R,EAAShS,KAAMlnC,EAASonC,IAAS,QAAWA,GAC9F,GAAc,MAAVpnC,GAAkBA,GAAUg3C,EAAKnxB,MAGjC,OAFIkb,GACAA,EAASjxB,EAAM03B,GAAGG,KAAKP,EAAOpnC,GAAQ6nC,mBACnC,EAEX,GAAIgR,GAAe1B,EAAYtqC,EAAO,SAAS,IAASsqC,EAAYvvC,EAAQ,OAAQ,CAChF,IAAI+wB,EAAK/wB,EAAQ+nB,EAAO,GACxB,KACIA,EAAK7qB,KAAK6zB,IACNA,EAAG2V,aAEP3V,EAAKA,EAAGiQ,UAEZ,IAAIuQ,EAAYtsC,EAAOusC,EAAa,EACpC,MAAQD,EAAU7K,YAAa6K,EAAYA,EAAU5R,WACjD6R,IACJ,GAAIzgB,EAAG0P,WAAW1P,EAAG2O,WAAY3O,EAAG2O,WAAY6R,EAAUzvC,SAAU,CAChE,GAAIq3B,EAAU,CACV,IAAIv/B,EAAM,WACV,IAAK,IAAIP,EAAI0uB,EAAKzuB,OAAS,EAAGD,GAAK,EAAGA,IAClCO,EAAM,UAAcmuB,EAAK1uB,GAAGJ,KAAKW,IAErCu/B,EADSjxB,EAAM03B,GAAGE,KAAK,IAAI,KAAkBsP,EAAK93B,IAAMyQ,EAAKzuB,OAAQ81C,EAAK93B,IAAMrS,EAAMk7B,SAAUiP,EAAK93B,IAAMk6B,EAAYpC,EAAK93B,IAAMrS,EAAMk7B,SAAWqR,EAAY,IAAI,KAAM53C,EAAKmuB,EAAKzuB,OAAQ,GAAI,GAAG,IACtL2mC,kBAEhB,OAAO,GAGf,OAAO,EAEX,SAASwR,EAAoB3I,GACzB,OAAO,SAAU5gC,EAAOixB,GACpB,IAAIsN,EAAMv+B,EAAMq3B,UAAWuQ,EAAOhH,EAAO,EAAIrC,EAAIpH,MAAQoH,EAAInH,IACzDrhB,EAAQ6xB,EAAK7xB,MACjB,KAAO6xB,EAAKzzC,KAAK4hB,GAAO8mB,UAAU,CAC9B,IAAK9mB,EACD,OAAO,EACXA,IAEJ,QAAK6xB,EAAKzzC,KAAK4hB,GAAOyoB,cAElBvN,GACAA,EAASjxB,EAAM03B,GAAG8C,aAAa,YAAqBx6B,EAAMyX,IAAKmpB,EAAO,EAAIgH,EAAKn2C,MAAMskB,GAAS6xB,EAAKl2C,IAAIqkB,OACpG,IAMf,MAAMyzB,EAAuBD,GAAqB,GAI5CE,EAAqBF,EAAoB,GAM/C,SAASG,EAAOvE,EAAUpc,EAAQ,MAC9B,OAAO,SAAU/oB,EAAOixB,GACpB,IAAI,MAAEkG,EAAK,IAAEC,GAAQp3B,EAAMq3B,UACvBC,EAAQH,EAAMI,WAAWH,GAAMuS,EAAWrS,IAAS,QAAaA,EAAO6N,EAAUpc,GACrF,QAAK4gB,IAED1Y,GACAA,EAASjxB,EAAM03B,GAAG7X,KAAKyX,EAAOqS,GAAU5R,mBACrC,IAOf,SAAS6R,EAAazE,EAAUpc,EAAQ,MACpC,OAAO,SAAU/oB,EAAOixB,GACpB,IAAI4Y,GAAa,EACjB,IAAK,IAAI14C,EAAI,EAAGA,EAAI6O,EAAMq3B,UAAUyS,OAAO14C,SAAWy4C,EAAY14C,IAAK,CACnE,IAAMgmC,OAAS/nB,IAAKta,GAAQsiC,KAAOhoB,IAAK0qB,IAAS95B,EAAMq3B,UAAUyS,OAAO34C,GACxE6O,EAAMyX,IAAI8iB,aAAazlC,EAAMglC,GAAI,CAAC3lC,EAAMib,KACpC,GAAIy6B,EACA,OAAO,EACX,GAAK11C,EAAKqqC,cAAerqC,EAAK41C,UAAU5E,EAAUpc,GAElD,GAAI50B,EAAKC,MAAQ+wC,EACb0E,GAAa,MAEZ,CACD,IAAIjC,EAAO5nC,EAAMyX,IAAIpa,QAAQ+R,GAAMzd,EAAQi2C,EAAKj2C,QAChDk4C,EAAajC,EAAKtsB,OAAOotB,eAAe/2C,EAAOA,EAAQ,EAAGwzC,OAItE,IAAK0E,EACD,OAAO,EACX,GAAI5Y,EAAU,CACV,IAAIyG,EAAK13B,EAAM03B,GACf,IAAK,IAAIvmC,EAAI,EAAGA,EAAI6O,EAAMq3B,UAAUyS,OAAO14C,OAAQD,IAAK,CACpD,IAAMgmC,OAAS/nB,IAAKta,GAAQsiC,KAAOhoB,IAAK0qB,IAAS95B,EAAMq3B,UAAUyS,OAAO34C,GACxEumC,EAAGkS,aAAa90C,EAAMglC,EAAIqL,EAAUpc,GAExCkI,EAASyG,EAAGK,kBAEhB,OAAO,GA0Bf,SAASiS,EAAWjG,EAAUhb,EAAQ,MAClC,OAAO,SAAU/oB,EAAOixB,GACpB,IAAI,MAAE4I,EAAK,QAAE8J,EAAO,OAAEmG,GAAW9pC,EAAMq3B,UACvC,GAAKwC,IAAU8J,IA1BvB,SAAqBlsB,EAAKqyB,EAAQ11C,GAC9B,IAAK,IAAIjD,EAAI,EAAGA,EAAI24C,EAAO14C,OAAQD,IAAK,CACpC,IAAI,MAAEgmC,EAAK,IAAEC,GAAQ0S,EAAO34C,GACxBo3C,EAAqB,GAAfpR,EAAMphB,OAAa0B,EAAIwyB,eAAiBxyB,EAAIrjB,KAAK81C,eAAe91C,GAM1E,GALAqjB,EAAI8iB,aAAapD,EAAM/nB,IAAKgoB,EAAIhoB,KAAKjb,IACjC,GAAIo0C,EACA,OAAO,EACXA,EAAMp0C,EAAK81C,eAAiB91C,EAAKC,KAAK81C,eAAe91C,MAErDm0C,EACA,OAAO,EAEf,OAAO,EAcyB4B,CAAYnqC,EAAMyX,IAAKqyB,EAAQ/F,GACvD,OAAO,EACX,GAAI9S,EACA,GAAI0S,EACII,EAASzX,QAAQtsB,EAAM0kC,aAAef,EAAQva,SAC9C6H,EAASjxB,EAAM03B,GAAG0S,iBAAiBrG,IAEnC9S,EAASjxB,EAAM03B,GAAG2S,cAActG,EAASliC,OAAOknB,SAEnD,CACD,IAAId,GAAM,EAAOyP,EAAK13B,EAAM03B,GAC5B,IAAK,IAAIvmC,EAAI,GAAI82B,GAAO92B,EAAI24C,EAAO14C,OAAQD,IAAK,CAC5C,IAAI,MAAEgmC,EAAK,IAAEC,GAAQ0S,EAAO34C,GAC5B82B,EAAMjoB,EAAMyX,IAAIsiB,aAAa5C,EAAM/nB,IAAKgoB,EAAIhoB,IAAK20B,GAErD,IAAK,IAAI5yC,EAAI,EAAGA,EAAI24C,EAAO14C,OAAQD,IAAK,CACpC,IAAI,MAAEgmC,EAAK,IAAEC,GAAQ0S,EAAO34C,GAC5B,GAAI82B,EACAyP,EAAGsC,WAAW7C,EAAM/nB,IAAKgoB,EAAIhoB,IAAK20B,OAEjC,CACD,IAAIjvC,EAAOqiC,EAAM/nB,IAAK0qB,EAAK1C,EAAIhoB,IAAK3d,EAAQ0lC,EAAMgB,UAAWzmC,EAAM0lC,EAAI0G,WACnEwM,EAAa74C,GAASA,EAAMy3B,OAAS,OAAOhS,KAAKzlB,EAAMwM,MAAM,GAAG7M,OAAS,EACzEm5C,EAAW74C,GAAOA,EAAIw3B,OAAS,OAAOhS,KAAKxlB,EAAIuM,MAAM,GAAG7M,OAAS,EACjE0D,EAAOw1C,EAAaxQ,IACpBhlC,GAAQw1C,EACRxQ,GAAMyQ,GAEV7S,EAAGuC,QAAQnlC,EAAMglC,EAAIiK,EAASliC,OAAOknB,KAG7CkI,EAASyG,EAAGK,kBAGpB,OAAO,GA0Df,SAASyS,KAAiBC,GACtB,OAAO,SAAUzqC,EAAOixB,EAAU5wB,GAC9B,IAAK,IAAIlP,EAAI,EAAGA,EAAIs5C,EAASr5C,OAAQD,IACjC,GAAIs5C,EAASt5C,GAAG6O,EAAOixB,EAAU5wB,GAC7B,OAAO,EACf,OAAO,GAGf,IAAIqqC,EAAYF,EAAc1D,EAAiBG,EAAcS,GACzDiD,EAAMH,EAAc1D,GAvjBJ,CAAC9mC,EAAOixB,EAAU5wB,KAClC,IAAIsjC,EAAUkE,EAAW7nC,EAAOK,GAChC,IAAKsjC,EACD,OAAO,EACX,IAAIuD,EAAOY,EAAanE,GAExB,IAAKuD,EACD,OAAO,EACX,IAAInqC,EAAQmqC,EAAK/O,UAEjB,GAAIiP,EAAcpnC,EAAOknC,EAAMjW,GAC3B,OAAO,EAGX,GAAmC,GAA/B0S,EAAQroB,OAAO1hB,QAAQL,OACtB8tC,EAAYtqC,EAAO,UAAY,kBAA2BA,IAAS,CACpE,IAAIuqC,GAAU,QAAYtnC,EAAMyX,IAAKksB,EAAQ7rC,SAAU6rC,EAAQ5mC,QAAS,YACxE,GAAIuqC,GAAWA,EAAQ90C,MAAM+G,KAAO+tC,EAAQxN,GAAKwN,EAAQxyC,KAAM,CAC3D,GAAIm8B,EAAU,CACV,IAAIyG,EAAK13B,EAAM03B,GAAGE,KAAK0P,GACvB5P,EAAG8C,aAAa6M,EAAYtqC,EAAO,SAAW,cAAmB26B,EAAGjgB,IAAIpa,QAAQq6B,EAAGI,QAAQ32B,IAAI+lC,EAAK93B,MAAO,GACrG,YAAqBsoB,EAAGjgB,IAAKigB,EAAGI,QAAQ32B,IAAI+lC,EAAK93B,OACvD6hB,EAASyG,EAAGK,kBAEhB,OAAO,GAIf,SAAIh7B,EAAMwqC,QAAUL,EAAKnxB,OAAS4tB,EAAQ5tB,MAAQ,KAC1Ckb,GACAA,EAASjxB,EAAM03B,GAAG7F,OAAOqV,EAAK93B,IAAK83B,EAAK93B,IAAMrS,EAAMk7B,UAAUF,mBAC3D,MAYW,CAAC/3B,EAAOixB,EAAU5wB,KACxC,IAAI,MAAEsnC,EAAK,MAAE9N,GAAU75B,EAAMq3B,UAAW6P,EAAOS,EAC/C,IAAK9N,EACD,OAAO,EACX,GAAI8N,EAAMrsB,OAAOkjB,YAAa,CAC1B,GAAIn+B,GAAQA,EAAK2mC,eAAe,UAAWhnC,GAAS2nC,EAAMxM,aAAewM,EAAMrsB,OAAO1hB,QAAQL,KAC1F,OAAO,EACX2tC,EAAOY,EAAaH,GAExB,IAAIxzC,EAAO+yC,GAAQA,EAAK/O,UACxB,SAAKhkC,IAAS,kBAA2BA,MAErC88B,GACAA,EAASjxB,EAAM03B,GAAG8C,aAAa,YAAqBx6B,EAAMyX,IAAKyvB,EAAK93B,MAAM2oB,mBACvE,MA2gBX,MAAM6S,EAAe,CACjB,MAASJ,GAhcS,CAACxqC,EAAOixB,KAC1B,IAAI,MAAE0W,EAAK,QAAElN,GAAYz6B,EAAMq3B,UAC/B,SAAKsQ,EAAMrsB,OAAOlnB,KAAKq1B,KAAK9xB,OAASgwC,EAAMzJ,WAAWzD,MAElDxJ,GACAA,EAASjxB,EAAM03B,GAAG6I,WAAW,MAAMxI,mBAChC,MAiCiB,CAAC/3B,EAAOixB,KAChC,IAAIsN,EAAMv+B,EAAMq3B,WAAW,MAAEF,EAAK,IAAEC,GAAQmH,EAC5C,GAAIA,aAAe,MAAgBpH,EAAM7b,OAAO2uB,eAAiB7S,EAAI9b,OAAO2uB,cACxE,OAAO,EACX,IAAI71C,EAAO2zC,EAAe3Q,EAAI9b,OAAOojB,eAAetH,EAAIgH,eACxD,IAAKhqC,IAASA,EAAKoqC,YACf,OAAO,EACX,GAAIvN,EAAU,CACV,IAAI2P,IAASzJ,EAAMgE,cAAgB/D,EAAIzlC,QAAUylC,EAAI9b,OAAOkc,WAAaL,EAAQC,GAAKhoB,IAClFsoB,EAAK13B,EAAM03B,GAAG2F,OAAOuD,EAAMxsC,EAAK21B,iBACpC2N,EAAG8C,aAAa,YAAqB9C,EAAGjgB,IAAKmpB,EAAO,IACpD3P,EAASyG,EAAGK,kBAEhB,OAAO,KAMY,CAAC/3B,EAAOixB,KAC3B,IAAI,QAAE0S,GAAY3jC,EAAMq3B,UACxB,IAAKsM,GAAWA,EAAQroB,OAAO1hB,QAAQL,KACnC,OAAO,EACX,GAAIoqC,EAAQ5tB,MAAQ,GAAK4tB,EAAQ5mC,SAAW4mC,EAAQjyC,KAAK,GAAI,CACzD,IAAIoG,EAAS6rC,EAAQ7rC,SACrB,IAAI,QAASkI,EAAMyX,IAAK3f,GAGpB,OAFIm5B,GACAA,EAASjxB,EAAM03B,GAAGnmC,MAAMuG,GAAQigC,mBAC7B,EAGf,IAAIT,EAAQqM,EAAQpM,aAAcrnC,EAASonC,IAAS,QAAWA,GAC/D,OAAc,MAAVpnC,IAEA+gC,GACAA,EAASjxB,EAAM03B,GAAGG,KAAKP,EAAOpnC,GAAQ6nC,mBACnC,KAqXoEoQ,GAC3E,YA5aa,CAACnoC,EAAOixB,KACrB,IAAI,MAAE0W,EAAK,QAAElN,GAAYz6B,EAAMq3B,UAC/B,IAAKsQ,EAAMrsB,OAAOlnB,KAAKq1B,KAAK9xB,OAASgwC,EAAMzJ,WAAWzD,GAClD,OAAO,EACX,IAAIoQ,EAAQlD,EAAMxzC,MAAM,GAAI4I,EAAQ4qC,EAAMvJ,YAAY,GAAIhqC,EAAO2zC,EAAe8C,EAAMnM,eAAe3hC,IACrG,IAAK3I,IAASy2C,EAAMnC,eAAe3rC,EAAOA,EAAO3I,GAC7C,OAAO,EACX,GAAI68B,EAAU,CACV,IAAI7hB,EAAMu4B,EAAM5qC,QAAS26B,EAAK13B,EAAM03B,GAAGkF,YAAYxtB,EAAKA,EAAKhb,EAAK21B,iBAClE2N,EAAG8C,aAAa,UAAe9C,EAAGjgB,IAAIpa,QAAQ+R,GAAM,IACpD6hB,EAASyG,EAAGK,kBAEhB,OAAO,GAiaP,UAAa2S,EACb,gBAAiBA,EACjB,kBAAmBA,EACnB,OAAUC,EACV,aAAcA,EACd,QA7Sc,CAAC3qC,EAAOixB,KAClBA,GACAA,EAASjxB,EAAM03B,GAAG8C,aAAa,IAAI,KAAax6B,EAAMyX,QACnD,IAkTLqzB,EAAgB,CAClB,SAAUF,EAAwB,UAClC,gBAAiBA,EAAa,iBAC9B,SAAUA,EAAqB,OAC/B,qBAAsBA,EAAa,cACnC,aAAcA,EAAa,cAC3B,QAASA,EAAa,cACtB,SAAUpB,EACV,SAAUC,GAEd,IAAK,IAAI55C,KAAO+6C,EACZE,EAAcj7C,GAAO+6C,EAAa/6C,GACtC,MAQMk7C,GAR0B,oBAAb9I,UAA2B,qBAAqBtvC,KAAKsvC,UAAUc,YAE/D,oBAANiI,KAAqBA,GAAGjI,WAA4B,UAAjBiI,GAAGjI,YAM1B+H,EAAgBF,G,2JCrxBzC,MAAMK,EAkBFj7C,YAIAyD,EAAOqhB,EAAS3kB,EAAU,IAQ9B,IAAuBmB,EAPf0I,KAAKvG,MAAQA,EACbuG,KAAKvG,MAAQA,EACbuG,KAAK8a,QAA4B,iBAAXA,GAKPxjB,EAL2CwjB,EAMvD,SAAU9U,EAAOvM,EAAOhC,EAAOC,GAClC,IAAI2rC,EAAS/rC,EACb,GAAImC,EAAM,GAAI,CACV,IAAIwI,EAASxI,EAAM,GAAG2nB,YAAY3nB,EAAM,IACxC4pC,GAAU5pC,EAAM,GAAGjB,MAAMyJ,EAASxI,EAAM,GAAGrC,QAE3C,IAAI85C,GADJz5C,GAASwK,GACYvK,EACjBw5C,EAAS,IACT7N,EAAS5pC,EAAM,GAAGjB,MAAMyJ,EAASivC,EAAQjvC,GAAUohC,EACnD5rC,EAAQC,GAGhB,OAAOsO,EAAM03B,GAAG6I,WAAWlD,EAAQ5rC,EAAOC,KAlB2BojB,EACrE9a,KAAKmxC,UAAgC,IAArBh7C,EAAQg7C,SACxBnxC,KAAKoxC,OAASj7C,EAAQi7C,SAAU,GAmFxC,MAAMC,EAAgB,CAACrrC,EAAOixB,KAC1B,IAAIjK,EAAUhnB,EAAMgnB,QACpB,IAAK,IAAI71B,EAAI,EAAGA,EAAI61B,EAAQ51B,OAAQD,IAAK,CACrC,IAAyBg6C,EAArBpkB,EAASC,EAAQ71B,GACrB,GAAI41B,EAAO0C,KAAK6Z,eAAiB6H,EAAWpkB,EAAOsZ,SAASrgC,IAAS,CACjE,GAAIixB,EAAU,CACV,IAAIyG,EAAK13B,EAAM03B,GAAI4T,EAASH,EAAShI,UACrC,IAAK,IAAI/X,EAAIkgB,EAAOtK,MAAM5vC,OAAS,EAAGg6B,GAAK,EAAGA,IAC1CsM,EAAGE,KAAK0T,EAAOtK,MAAM5V,GAAGmgB,OAAOD,EAAOE,KAAKpgB,KAC/C,GAAI+f,EAASltC,KAAM,CACf,IAAImrB,EAAQsO,EAAGjgB,IAAIpa,QAAQ8tC,EAASr2C,MAAMs0B,QAC1CsO,EAAGkF,YAAYuO,EAASr2C,KAAMq2C,EAASrR,GAAI95B,EAAMqpB,OAAOprB,KAAKktC,EAASltC,KAAMmrB,SAG5EsO,EAAG7F,OAAOsZ,EAASr2C,KAAMq2C,EAASrR,IAEtC7I,EAASyG,GAEb,OAAO,GAGf,OAAO,GAMI,IAAIuT,EAAU,MAAO,UAInB,IAAIA,EAAU,UAAW,UAIlB,IAAIA,EAAU,uCAAwC,UAIrD,IAAIA,EAAU,KAAM,UAIrB,IAAIA,EAAU,uCAAwC,UAIrD,IAAIA,EAAU,KAAM,UAuB7C,SAASQ,EAAkB3H,EAAQqB,EAAUlM,EAAW,KAAMyS,GAC1D,OAAO,IAAIT,EAAUnH,GAAQ,CAAC9jC,EAAOvM,EAAOhC,EAAOC,KAC/C,IAAIq3B,EAAQkQ,aAAoB0S,SAAW1S,EAASxlC,GAASwlC,EACzDvB,EAAK13B,EAAM03B,GAAG7F,OAAOpgC,EAAOC,GACI4lC,EAAvBI,EAAGjgB,IAAIpa,QAAQ5L,GAAuB8lC,aAAcoS,EAAWrS,IAAS,QAAaA,EAAO6N,EAAUpc,GACnH,IAAK4gB,EACD,OAAO,KACXjS,EAAG7X,KAAKyX,EAAOqS,GACf,IAAI7xC,EAAS4/B,EAAGjgB,IAAIpa,QAAQ5L,EAAQ,GAAGqsC,WAIvC,OAHIhmC,GAAUA,EAAO1D,MAAQ+wC,IAAY,QAAQzN,EAAGjgB,IAAKhmB,EAAQ,MAC3Di6C,GAAiBA,EAAcj4C,EAAOqE,KACxC4/B,EAAGnlC,KAAKd,EAAQ,GACbimC,KAWf,SAASkU,EAAuB9H,EAAQqB,EAAUlM,EAAW,MACzD,OAAO,IAAIgS,EAAUnH,GAAQ,CAAC9jC,EAAOvM,EAAOhC,EAAOC,KAC/C,IAAIwmC,EAASl4B,EAAMyX,IAAIpa,QAAQ5L,GAC3Bs3B,EAAQkQ,aAAoB0S,SAAW1S,EAASxlC,GAASwlC,EAC7D,OAAKf,EAAO/jC,MAAM,GAAGu0C,eAAexQ,EAAOvmC,OAAO,GAAIumC,EAAOkG,YAAY,GAAI+G,GAEtEnlC,EAAM03B,GACR7F,OAAOpgC,EAAOC,GACdk4C,aAAan4C,EAAOA,EAAO0zC,EAAUpc,GAH/B,U,mECnInB,IAtFO,IAAIva,EAAO,CAChB,EAAG,YACH,EAAG,MACH,GAAI,QACJ,GAAI,UACJ,GAAI,QACJ,GAAI,QACJ,GAAI,UACJ,GAAI,MACJ,GAAI,WACJ,GAAI,SACJ,GAAI,IACJ,GAAI,SACJ,GAAI,WACJ,GAAI,MACJ,GAAI,OACJ,GAAI,YACJ,GAAI,UACJ,GAAI,aACJ,GAAI,YACJ,GAAI,cACJ,GAAI,SACJ,GAAI,SACJ,GAAI,IACJ,GAAI,IACJ,GAAI,OACJ,GAAI,OACJ,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,UACL,IAAK,aACL,IAAK,QACL,IAAK,QACL,IAAK,UACL,IAAK,UACL,IAAK,MACL,IAAK,MACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,KACL,IAAK,IACL,IAAK,KAGIjO,EAAQ,CACjB,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,KAGHsrC,EAA0B,oBAAb5J,WAA4B,MAAMtvC,KAAKsvC,UAAUc,UAC9DtU,EAAyB,oBAAbwT,WAA4B,gDAAgD/qB,KAAK+qB,UAAUE,WAGlGhxC,EAAI,EAAGA,EAAI,GAAIA,IAAKqd,EAAK,GAAKrd,GAAKqd,EAAK,GAAKrd,GAAK2H,OAAO3H,GAGlE,IAASA,EAAI,EAAGA,GAAK,GAAIA,IAAKqd,EAAKrd,EAAI,KAAO,IAAMA,EAGpD,IAASA,EAAI,GAAIA,GAAK,GAAIA,IACxBqd,EAAKrd,GAAK2H,OAAOC,aAAa5H,EAAI,IAClCoP,EAAMpP,GAAK2H,OAAOC,aAAa5H,GAIjC,IAAK,IAAIwG,KAAQ6W,EAAWjO,EAAMtR,eAAe0I,KAAO4I,EAAM5I,GAAQ6W,EAAK7W,I,eC/F3E,MAAM,EAA0B,oBAAbsqC,WAA2B,qBAAqBtvC,KAAKsvC,UAAUc,UAClF,SAAS+I,EAAiB17C,GACtB,IAGIiE,EAAK03C,EAAMxrC,EAAOsI,EAHlBmjC,EAAQ57C,EAAKmB,MAAM,UAAWK,EAASo6C,EAAMA,EAAM56C,OAAS,GAClD,SAAVQ,IACAA,EAAS,KAEb,IAAK,IAAIT,EAAI,EAAGA,EAAI66C,EAAM56C,OAAS,EAAGD,IAAK,CACvC,IAAI86C,EAAMD,EAAM76C,GAChB,GAAI,kBAAkBwB,KAAKs5C,GACvBpjC,GAAO,OACN,GAAI,YAAYlW,KAAKs5C,GACtB53C,GAAM,OACL,GAAI,sBAAsB1B,KAAKs5C,GAChCF,GAAO,OACN,GAAI,cAAcp5C,KAAKs5C,GACxB1rC,GAAQ,MACP,KAAI,SAAS5N,KAAKs5C,GAOnB,MAAM,IAAIx2B,MAAM,+BAAiCw2B,GAN7C,EACApjC,GAAO,EAEPkjC,GAAO,GAanB,OARI13C,IACAzC,EAAS,OAASA,GAClBm6C,IACAn6C,EAAS,QAAUA,GACnBiX,IACAjX,EAAS,QAAUA,GACnB2O,IACA3O,EAAS,SAAWA,GACjBA,EAQX,SAASs6C,EAAU97C,EAAMgF,EAAOmL,GAAQ,GASpC,OARInL,EAAM+2C,SACN/7C,EAAO,OAASA,GAChBgF,EAAMg3C,UACNh8C,EAAO,QAAUA,GACjBgF,EAAMi3C,UACNj8C,EAAO,QAAUA,GACjBmQ,GAASnL,EAAMk3C,WACfl8C,EAAO,SAAWA,GACfA,EAiCX,SAASu2C,EAAO4F,GACZ,OAAO,IAAI,KAAO,CAAE1hB,MAAO,CAAE+Y,cAAe4I,EAAeD,MAO/D,SAASC,EAAeD,GACpB,IAAIprC,EAzDR,SAAmBA,GACf,IAAIpQ,EAAOhC,OAAO8S,OAAO,MACzB,IAAK,IAAI+hB,KAAQziB,EACbpQ,EAAK+6C,EAAiBloB,IAASziB,EAAIyiB,GACvC,OAAO7yB,EAqDGsxB,CAAUkqB,GACpB,OAAO,SAAUlsC,EAAMjL,GACnB,IAA2Bq3C,EAAvBr8C,EDGL,SAAiBgF,GAGtB,IAGIhF,IAHYy7C,GAAOz2C,EAAMi3C,SAAWj3C,EAAMk3C,WAAal3C,EAAMg3C,UAAYh3C,EAAM+2C,QAC/E1d,GAAMr5B,EAAMk3C,UAAYl3C,EAAMvF,KAA2B,GAApBuF,EAAMvF,IAAIuB,QAClC,gBAAbgE,EAAMvF,MACgBuF,EAAMvF,MAC7BuF,EAAMk3C,SAAW/rC,EAAQiO,GAAMpZ,EAAMs3C,UACtCt3C,EAAMvF,KAAO,eASf,MAPY,OAARO,IAAeA,EAAO,UACd,OAARA,IAAeA,EAAO,UAEd,QAARA,IAAgBA,EAAO,aACf,MAARA,IAAcA,EAAO,WACb,SAARA,IAAiBA,EAAO,cAChB,QAARA,IAAgBA,EAAO,aACpBA,ECpBUu8C,CAAQv3C,GAAkBw3C,EAASzrC,EAAI+qC,EAAU97C,EAAMgF,IAClE,GAAIw3C,GAAUA,EAAOvsC,EAAKL,MAAOK,EAAK4wB,SAAU5wB,GAC5C,OAAO,EAEX,GAAmB,GAAfjQ,EAAKgB,QAAuB,KAARhB,EAAa,CACjC,GAAIgF,EAAMk3C,SAAU,CAGhB,IAAIO,EAAU1rC,EAAI+qC,EAAU97C,EAAMgF,GAAO,IACzC,GAAIy3C,GAAWA,EAAQxsC,EAAKL,MAAOK,EAAK4wB,SAAU5wB,GAC9C,OAAO,EAEf,IAAKjL,EAAMk3C,UAAYl3C,EAAM+2C,QAAU/2C,EAAMi3C,SAAWj8C,EAAKsO,WAAW,GAAK,OACxE+tC,EAAWj+B,EAAKpZ,EAAMs3C,WAAaD,GAAYr8C,EAAM,CAKtD,IAAI08C,EAAW3rC,EAAI+qC,EAAUO,EAAUr3C,IACvC,GAAI03C,GAAYA,EAASzsC,EAAKL,MAAOK,EAAK4wB,SAAU5wB,GAChD,OAAO,GAGnB,OAAO,K,mCCtHf,SAAS0sC,EAAWnzC,GAClBI,KAAKJ,QAAUA,E,0PAGjBmzC,EAAW/9C,UAAY,CACrBgB,YAAa+8C,EAEbxjB,KAAM,SAAS15B,GACb,IAAK,IAAIsB,EAAI,EAAGA,EAAI6I,KAAKJ,QAAQxI,OAAQD,GAAK,EAC5C,GAAI6I,KAAKJ,QAAQzI,KAAOtB,EAAK,OAAOsB,EACtC,OAAQ,GAMVg3B,IAAK,SAASt4B,GACZ,IAAIm9C,EAAQhzC,KAAKuvB,KAAK15B,GACtB,OAAiB,GAAVm9C,OAAcl7C,EAAYkI,KAAKJ,QAAQozC,EAAQ,IAOxDhd,OAAQ,SAASngC,EAAKU,EAAO08C,GAC3B,IAAI7yC,EAAO6yC,GAAUA,GAAUp9C,EAAMmK,KAAKtF,OAAOu4C,GAAUjzC,KACvDgzC,EAAQ5yC,EAAKmvB,KAAK15B,GAAM+J,EAAUQ,EAAKR,QAAQpH,QAOnD,OANc,GAAVw6C,EACFpzC,EAAQ5E,KAAKi4C,GAAUp9C,EAAKU,IAE5BqJ,EAAQozC,EAAQ,GAAKz8C,EACjB08C,IAAQrzC,EAAQozC,GAASC,IAExB,IAAIF,EAAWnzC,IAKxBlF,OAAQ,SAAS7E,GACf,IAAIm9C,EAAQhzC,KAAKuvB,KAAK15B,GACtB,IAAc,GAAVm9C,EAAa,OAAOhzC,KACxB,IAAIJ,EAAUI,KAAKJ,QAAQpH,QAE3B,OADAoH,EAAQpF,OAAOw4C,EAAO,GACf,IAAID,EAAWnzC,IAKxBszC,WAAY,SAASr9C,EAAKU,GACxB,OAAO,IAAIw8C,EAAW,CAACl9C,EAAKU,GAAO87B,OAAOryB,KAAKtF,OAAO7E,GAAK+J,WAK7DuzC,SAAU,SAASt9C,EAAKU,GACtB,IAAIqJ,EAAUI,KAAKtF,OAAO7E,GAAK+J,QAAQpH,QAEvC,OADAoH,EAAQ5E,KAAKnF,EAAKU,GACX,IAAIw8C,EAAWnzC,IAMxBwzC,UAAW,SAAS9sB,EAAOzwB,EAAKU,GAC9B,IAAI88C,EAAUrzC,KAAKtF,OAAO7E,GAAM+J,EAAUyzC,EAAQzzC,QAAQpH,QACtDw6C,EAAQK,EAAQ9jB,KAAKjJ,GAEzB,OADA1mB,EAAQpF,QAAiB,GAAVw4C,EAAcpzC,EAAQxI,OAAS47C,EAAO,EAAGn9C,EAAKU,GACtD,IAAIw8C,EAAWnzC,IAMxB4wB,QAAS,SAASsB,GAChB,IAAK,IAAI36B,EAAI,EAAGA,EAAI6I,KAAKJ,QAAQxI,OAAQD,GAAK,EAC5C26B,EAAE9xB,KAAKJ,QAAQzI,GAAI6I,KAAKJ,QAAQzI,EAAI,KAMxCm8C,QAAS,SAASnsC,GAEhB,OADAA,EAAM4rC,EAAWj4C,KAAKqM,IACb5H,KACF,IAAIwzC,EAAW5rC,EAAIvH,QAAQyyB,OAAOryB,KAAKuzC,SAASpsC,GAAKvH,UADtCI,MAOxBw+B,OAAQ,SAASr3B,GAEf,OADAA,EAAM4rC,EAAWj4C,KAAKqM,IACb5H,KACF,IAAIwzC,EAAW/yC,KAAKuzC,SAASpsC,GAAKvH,QAAQyyB,OAAOlrB,EAAIvH,UADtCI,MAOxBuzC,SAAU,SAASpsC,GACjB,IAAIvP,EAASoI,KACbmH,EAAM4rC,EAAWj4C,KAAKqM,GACtB,IAAK,IAAIhQ,EAAI,EAAGA,EAAIgQ,EAAIvH,QAAQxI,OAAQD,GAAK,EAC3CS,EAASA,EAAO8C,OAAOyM,EAAIvH,QAAQzI,IACrC,OAAOS,GAKT47C,SAAU,WACR,IAAI57C,EAAS,GAEb,OADAoI,KAAKwwB,SAAQ,SAAS36B,EAAKU,GAASqB,EAAO/B,GAAOU,KAC3CqB,GAKL2H,WACF,OAAOS,KAAKJ,QAAQxI,QAAU,IAQlC27C,EAAWj4C,KAAO,SAASvE,GACzB,GAAIA,aAAiBw8C,EAAY,OAAOx8C,EACxC,IAAIqJ,EAAU,GACd,GAAIrJ,EAAO,IAAK,IAAIqzB,KAAQrzB,EAAOqJ,EAAQ5E,KAAK4uB,EAAMrzB,EAAMqzB,IAC5D,OAAO,IAAImpB,EAAWnzC,IAGxB,QCtIA,SAAS6zC,EAAczwB,EAAGC,EAAG7N,GACzB,IAAK,IAAIje,EAAI,GAAIA,IAAK,CAClB,GAAIA,GAAK6rB,EAAEwa,YAAcrmC,GAAK8rB,EAAEua,WAC5B,OAAOxa,EAAEwa,YAAcva,EAAEua,WAAa,KAAOpoB,EACjD,IAAIs+B,EAAS1wB,EAAEqB,MAAMltB,GAAIw8C,EAAS1wB,EAAEoB,MAAMltB,GAC1C,GAAIu8C,GAAUC,EAAd,CAIA,IAAKD,EAAOE,WAAWD,GACnB,OAAOv+B,EACX,GAAIs+B,EAAOxkB,QAAUwkB,EAAOzvC,MAAQ0vC,EAAO1vC,KAAM,CAC7C,IAAK,IAAImtB,EAAI,EAAGsiB,EAAOzvC,KAAKmtB,IAAMuiB,EAAO1vC,KAAKmtB,GAAIA,IAC9Chc,IACJ,OAAOA,EAEX,GAAIs+B,EAAO9zC,QAAQL,MAAQo0C,EAAO/zC,QAAQL,KAAM,CAC5C,IAAIykC,EAAQyP,EAAcC,EAAO9zC,QAAS+zC,EAAO/zC,QAASwV,EAAM,GAChE,GAAa,MAAT4uB,EACA,OAAOA,EAEf5uB,GAAOs+B,EAAOzV,cAfV7oB,GAAOs+B,EAAOzV,UAkB1B,SAAS4V,EAAY7wB,EAAGC,EAAG6wB,EAAMC,GAC7B,IAAK,IAAIC,EAAKhxB,EAAEwa,WAAYyW,EAAKhxB,EAAEua,aAAc,CAC7C,GAAU,GAANwW,GAAiB,GAANC,EACX,OAAOD,GAAMC,EAAK,KAAO,CAAEjxB,EAAG8wB,EAAM7wB,EAAG8wB,GAC3C,IAAIL,EAAS1wB,EAAEqB,QAAQ2vB,GAAKL,EAAS1wB,EAAEoB,QAAQ4vB,GAAK10C,EAAOm0C,EAAOzV,SAClE,GAAIyV,GAAUC,EAAd,CAKA,IAAKD,EAAOE,WAAWD,GACnB,MAAO,CAAE3wB,EAAG8wB,EAAM7wB,EAAG8wB,GACzB,GAAIL,EAAOxkB,QAAUwkB,EAAOzvC,MAAQ0vC,EAAO1vC,KAAM,CAC7C,IAAIiwC,EAAO,EAAGC,EAAUh3B,KAAKgE,IAAIuyB,EAAOzvC,KAAK7M,OAAQu8C,EAAO1vC,KAAK7M,QACjE,KAAO88C,EAAOC,GAAWT,EAAOzvC,KAAKyvC,EAAOzvC,KAAK7M,OAAS88C,EAAO,IAAMP,EAAO1vC,KAAK0vC,EAAO1vC,KAAK7M,OAAS88C,EAAO,IAC3GA,IACAJ,IACAC,IAEJ,MAAO,CAAE/wB,EAAG8wB,EAAM7wB,EAAG8wB,GAEzB,GAAIL,EAAO9zC,QAAQL,MAAQo0C,EAAO/zC,QAAQL,KAAM,CAC5C,IAAIykC,EAAQ6P,EAAYH,EAAO9zC,QAAS+zC,EAAO/zC,QAASk0C,EAAO,EAAGC,EAAO,GACzE,GAAI/P,EACA,OAAOA,EAEf8P,GAAQv0C,EACRw0C,GAAQx0C,OArBJu0C,GAAQv0C,EACRw0C,GAAQx0C,GA+BpB,MAAM60C,EAIFp+C,YAIA4J,EAASL,GAGL,GAFAS,KAAKJ,QAAUA,EACfI,KAAKT,KAAOA,GAAQ,EACR,MAARA,EACA,IAAK,IAAIpI,EAAI,EAAGA,EAAIyI,EAAQxI,OAAQD,IAChC6I,KAAKT,MAAQK,EAAQzI,GAAG8mC,SAOpCsC,aAAazlC,EAAMglC,EAAIhO,EAAGuiB,EAAY,EAAG/yB,GACrC,IAAK,IAAInqB,EAAI,EAAGie,EAAM,EAAGA,EAAM0qB,EAAI3oC,IAAK,CACpC,IAAIktB,EAAQrkB,KAAKJ,QAAQzI,GAAIO,EAAM0d,EAAMiP,EAAM4Z,SAC/C,GAAIvmC,EAAMoD,IAAyD,IAAjDg3B,EAAEzN,EAAOgwB,EAAYj/B,EAAKkM,GAAU,KAAMnqB,IAAgBktB,EAAMzkB,QAAQL,KAAM,CAC5F,IAAI9H,EAAQ2d,EAAM,EAClBiP,EAAMkc,aAAapjB,KAAKhe,IAAI,EAAGrE,EAAOrD,GAAQ0lB,KAAKgE,IAAIkD,EAAMzkB,QAAQL,KAAMugC,EAAKroC,GAAQq6B,EAAGuiB,EAAY58C,GAE3G2d,EAAM1d,GAQd8vC,YAAY1V,GACR9xB,KAAKugC,aAAa,EAAGvgC,KAAKT,KAAMuyB,GAMpCoX,YAAYpuC,EAAMglC,EAAIwU,EAAgBxR,GAClC,IAAI7+B,EAAO,GAAIuqC,GAAQ,EAevB,OAdAxuC,KAAKugC,aAAazlC,EAAMglC,GAAI,CAAC3lC,EAAMib,KAC/B,IAAIm/B,EAAWp6C,EAAK+0B,OAAS/0B,EAAK8J,KAAKzL,MAAM2kB,KAAKhe,IAAIrE,EAAMsa,GAAOA,EAAK0qB,EAAK1qB,GACtEjb,EAAKq6C,OACF1R,EAAgC,oBAAbA,EAA0BA,EAAS3oC,GAAQ2oC,EAC1D3oC,EAAKC,KAAKq1B,KAAKqT,SAAW3oC,EAAKC,KAAKq1B,KAAKqT,SAAS3oC,GAC9C,GAHG,GAIjBA,EAAK8pC,UAAY9pC,EAAKq6C,QAAUD,GAAYp6C,EAAKqqC,cAAgB8P,IAC7D9F,EACAA,GAAQ,EAERvqC,GAAQqwC,GAEhBrwC,GAAQswC,IACT,GACItwC,EAMXu6B,OAAOiW,GACH,IAAKA,EAAMl1C,KACP,OAAOS,KACX,IAAKA,KAAKT,KACN,OAAOk1C,EACX,IAAIC,EAAO10C,KAAK8+B,UAAW0P,EAAQiG,EAAMhX,WAAY79B,EAAUI,KAAKJ,QAAQpH,QAASrB,EAAI,EAKzF,IAJIu9C,EAAKxlB,QAAUwlB,EAAKd,WAAWpF,KAC/B5uC,EAAQA,EAAQxI,OAAS,GAAKs9C,EAAKC,SAASD,EAAKzwC,KAAOuqC,EAAMvqC,MAC9D9M,EAAI,GAEDA,EAAIs9C,EAAM70C,QAAQxI,OAAQD,IAC7ByI,EAAQ5E,KAAKy5C,EAAM70C,QAAQzI,IAC/B,OAAO,IAAIi9C,EAASx0C,EAASI,KAAKT,KAAOk1C,EAAMl1C,MAKnDq1C,IAAI95C,EAAMglC,EAAK9/B,KAAKT,MAChB,GAAY,GAARzE,GAAaglC,GAAM9/B,KAAKT,KACxB,OAAOS,KACX,IAAIpI,EAAS,GAAI2H,EAAO,EACxB,GAAIugC,EAAKhlC,EACL,IAAK,IAAI3D,EAAI,EAAGie,EAAM,EAAGA,EAAM0qB,EAAI3oC,IAAK,CACpC,IAAIktB,EAAQrkB,KAAKJ,QAAQzI,GAAIO,EAAM0d,EAAMiP,EAAM4Z,SAC3CvmC,EAAMoD,KACFsa,EAAMta,GAAQpD,EAAMooC,KAEhBzb,EADAA,EAAM6K,OACE7K,EAAMuwB,IAAIz3B,KAAKhe,IAAI,EAAGrE,EAAOsa,GAAM+H,KAAKgE,IAAIkD,EAAMpgB,KAAK7M,OAAQ0oC,EAAK1qB,IAEpEiP,EAAMuwB,IAAIz3B,KAAKhe,IAAI,EAAGrE,EAAOsa,EAAM,GAAI+H,KAAKgE,IAAIkD,EAAMzkB,QAAQL,KAAMugC,EAAK1qB,EAAM,KAE/Fxd,EAAOoD,KAAKqpB,GACZ9kB,GAAQ8kB,EAAM4Z,UAElB7oB,EAAM1d,EAEd,OAAO,IAAI08C,EAASx8C,EAAQ2H,GAKhCs1C,WAAW/5C,EAAMglC,GACb,OAAIhlC,GAAQglC,EACDsU,EAASvU,MACR,GAAR/kC,GAAaglC,GAAM9/B,KAAKJ,QAAQxI,OACzB4I,KACJ,IAAIo0C,EAASp0C,KAAKJ,QAAQpH,MAAMsC,EAAMglC,IAMjDxJ,aAAa3+B,EAAOwC,GAChB,IAAIwC,EAAUqD,KAAKJ,QAAQjI,GAC3B,GAAIgF,GAAWxC,EACX,OAAO6F,KACX,IAAIjJ,EAAOiJ,KAAKJ,QAAQpH,QACpB+G,EAAOS,KAAKT,KAAOpF,EAAK8jC,SAAWthC,EAAQshC,SAE/C,OADAlnC,EAAKY,GAASwC,EACP,IAAIi6C,EAASr9C,EAAMwI,GAM9B2zC,WAAW/4C,GACP,OAAO,IAAIi6C,EAAS,CAACj6C,GAAMk4B,OAAOryB,KAAKJ,SAAUI,KAAKT,KAAOpF,EAAK8jC,UAMtEkV,SAASh5C,GACL,OAAO,IAAIi6C,EAASp0C,KAAKJ,QAAQyyB,OAAOl4B,GAAO6F,KAAKT,KAAOpF,EAAK8jC,UAKpE6W,GAAGL,GACC,GAAIz0C,KAAKJ,QAAQxI,QAAUq9C,EAAM70C,QAAQxI,OACrC,OAAO,EACX,IAAK,IAAID,EAAI,EAAGA,EAAI6I,KAAKJ,QAAQxI,OAAQD,IACrC,IAAK6I,KAAKJ,QAAQzI,GAAG29C,GAAGL,EAAM70C,QAAQzI,IAClC,OAAO,EACf,OAAO,EAKPsmC,iBAAe,OAAOz9B,KAAKJ,QAAQxI,OAAS4I,KAAKJ,QAAQ,GAAK,KAI9Dk/B,gBAAc,OAAO9+B,KAAKJ,QAAQxI,OAAS4I,KAAKJ,QAAQI,KAAKJ,QAAQxI,OAAS,GAAK,KAInFomC,iBAAe,OAAOx9B,KAAKJ,QAAQxI,OAKvCitB,MAAM1sB,GACF,IAAIq7C,EAAQhzC,KAAKJ,QAAQjI,GACzB,IAAKq7C,EACD,MAAM,IAAI+B,WAAW,SAAWp9C,EAAQ,qBAAuBqI,MACnE,OAAOgzC,EAKXrL,WAAWhwC,GACP,OAAOqI,KAAKJ,QAAQjI,IAAU,KAMlC64B,QAAQsB,GACJ,IAAK,IAAI36B,EAAI,EAAGuzB,EAAI,EAAGvzB,EAAI6I,KAAKJ,QAAQxI,OAAQD,IAAK,CACjD,IAAIktB,EAAQrkB,KAAKJ,QAAQzI,GACzB26B,EAAEzN,EAAOqG,EAAGvzB,GACZuzB,GAAKrG,EAAM4Z,UAOnBwV,cAAcgB,EAAOr/B,EAAM,GACvB,OAAOq+B,EAAczzC,KAAMy0C,EAAOr/B,GAQtCy+B,YAAYY,EAAOr/B,EAAMpV,KAAKT,KAAMy1C,EAAWP,EAAMl1C,MACjD,OAAOs0C,EAAY7zC,KAAMy0C,EAAOr/B,EAAK4/B,GAOzCC,UAAU7/B,EAAK8/B,GAAQ,GACnB,GAAW,GAAP9/B,EACA,OAAO+/B,EAAS,EAAG//B,GACvB,GAAIA,GAAOpV,KAAKT,KACZ,OAAO41C,EAASn1C,KAAKJ,QAAQxI,OAAQge,GACzC,GAAIA,EAAMpV,KAAKT,MAAQ6V,EAAM,EACzB,MAAM,IAAI2/B,WAAW,YAAY3/B,0BAA4BpV,SACjE,IAAK,IAAI7I,EAAI,EAAGi+C,EAAS,GAAIj+C,IAAK,CAC9B,IAAyBO,EAAM09C,EAArBp1C,KAAKqkB,MAAMltB,GAAuB8mC,SAC5C,GAAIvmC,GAAO0d,EACP,OAAI1d,GAAO0d,GAAO8/B,EAAQ,EACfC,EAASh+C,EAAI,EAAGO,GACpBy9C,EAASh+C,EAAGi+C,GAEvBA,EAAS19C,GAMjBvC,WAAa,MAAO,IAAM6K,KAAKq1C,gBAAkB,IAIjDA,gBAAkB,OAAOr1C,KAAKJ,QAAQrH,KAAK,MAI3CojC,SACI,OAAO37B,KAAKJ,QAAQxI,OAAS4I,KAAKJ,QAAQuH,KAAI6mB,GAAKA,EAAE2N,WAAY,KAKrE3M,gBAAgBK,EAAQ94B,GACpB,IAAKA,EACD,OAAO69C,EAASvU,MACpB,IAAKpqC,MAAMF,QAAQgB,GACf,MAAM,IAAIw+C,WAAW,uCACzB,OAAO,IAAIX,EAAS79C,EAAM4Q,IAAIkoB,EAAOimB,eAMzCtmB,iBAAiBx3B,GACb,IAAKA,EAAMJ,OACP,OAAOg9C,EAASvU,MACpB,IAAIhY,EAAQtoB,EAAO,EACnB,IAAK,IAAIpI,EAAI,EAAGA,EAAIK,EAAMJ,OAAQD,IAAK,CACnC,IAAIgD,EAAO3C,EAAML,GACjBoI,GAAQpF,EAAK8jC,SACT9mC,GAAKgD,EAAK+0B,QAAU13B,EAAML,EAAI,GAAGy8C,WAAWz5C,IACvC0tB,IACDA,EAASrwB,EAAMgB,MAAM,EAAGrB,IAC5B0wB,EAAOA,EAAOzwB,OAAS,GAAK+C,EACvBw6C,SAAS9sB,EAAOA,EAAOzwB,OAAS,GAAG6M,KAAO9J,EAAK8J,OAE/C4jB,GACLA,EAAO7sB,KAAKb,GAGpB,OAAO,IAAIi6C,EAASvsB,GAAUrwB,EAAO+H,GAQzCyvB,YAAYM,GACR,IAAKA,EACD,OAAO8kB,EAASvU,MACpB,GAAIvQ,aAAiB8kB,EACjB,OAAO9kB,EACX,GAAI75B,MAAMF,QAAQ+5B,GACd,OAAOtvB,KAAKu1C,UAAUjmB,GAC1B,GAAIA,EAAMP,MACN,OAAO,IAAIqlB,EAAS,CAAC9kB,GAAQA,EAAM2O,UACvC,MAAM,IAAI8W,WAAW,mBAAqBzlB,EAAQ,kBAC7CA,EAAMiR,aAAe,mEAAqE,MAQvG6T,EAASvU,MAAQ,IAAIuU,EAAS,GAAI,GAClC,MAAMpB,EAAQ,CAAEr7C,MAAO,EAAGsK,OAAQ,GAClC,SAASkzC,EAASx9C,EAAOsK,GAGrB,OAFA+wC,EAAMr7C,MAAQA,EACdq7C,EAAM/wC,OAASA,EACR+wC,EAGX,SAASwC,EAAYxyB,EAAGC,GACpB,GAAID,IAAMC,EACN,OAAO,EACX,IAAMD,GAAiB,iBAALA,IACZC,GAAiB,iBAALA,EACd,OAAO,EACX,IAAIzrB,EAAQ/B,MAAMF,QAAQytB,GAC1B,GAAIvtB,MAAMF,QAAQ0tB,IAAMzrB,EACpB,OAAO,EACX,GAAIA,EAAO,CACP,GAAIwrB,EAAE5rB,QAAU6rB,EAAE7rB,OACd,OAAO,EACX,IAAK,IAAID,EAAI,EAAGA,EAAI6rB,EAAE5rB,OAAQD,IAC1B,IAAKq+C,EAAYxyB,EAAE7rB,GAAI8rB,EAAE9rB,IACrB,OAAO,MAEd,CACD,IAAK,IAAIuzB,KAAK1H,EACV,KAAM0H,KAAKzH,KAAOuyB,EAAYxyB,EAAE0H,GAAIzH,EAAEyH,IAClC,OAAO,EACf,IAAK,IAAIA,KAAKzH,EACV,KAAMyH,KAAK1H,GACP,OAAO,EAEnB,OAAO,EAWX,MAAMyyB,EAIFz/C,YAIAoE,EAIA20B,GACI/uB,KAAK5F,KAAOA,EACZ4F,KAAK+uB,MAAQA,EASjBmB,SAAS5B,GACL,IAAIv3B,EAAM2+C,GAAS,EACnB,IAAK,IAAIv+C,EAAI,EAAGA,EAAIm3B,EAAIl3B,OAAQD,IAAK,CACjC,IAAIs9C,EAAQnmB,EAAIn3B,GAChB,GAAI6I,KAAK80C,GAAGL,GACR,OAAOnmB,EACX,GAAItuB,KAAK5F,KAAKu7C,SAASlB,EAAMr6C,MACpBrD,IACDA,EAAOu3B,EAAI91B,MAAM,EAAGrB,QAEvB,IAAIs9C,EAAMr6C,KAAKu7C,SAAS31C,KAAK5F,MAC9B,OAAOk0B,GAGFonB,GAAUjB,EAAMr6C,KAAK8mB,KAAOlhB,KAAK5F,KAAK8mB,OAClCnqB,IACDA,EAAOu3B,EAAI91B,MAAM,EAAGrB,IACxBJ,EAAKiE,KAAKgF,MACV01C,GAAS,GAET3+C,GACAA,EAAKiE,KAAKy5C,IAOtB,OAJK19C,IACDA,EAAOu3B,EAAI91B,SACVk9C,GACD3+C,EAAKiE,KAAKgF,MACPjJ,EAMXq5B,cAAc9B,GACV,IAAK,IAAIn3B,EAAI,EAAGA,EAAIm3B,EAAIl3B,OAAQD,IAC5B,GAAI6I,KAAK80C,GAAGxmB,EAAIn3B,IACZ,OAAOm3B,EAAI91B,MAAM,EAAGrB,GAAGk7B,OAAO/D,EAAI91B,MAAMrB,EAAI,IACpD,OAAOm3B,EAKXgE,QAAQhE,GACJ,IAAK,IAAIn3B,EAAI,EAAGA,EAAIm3B,EAAIl3B,OAAQD,IAC5B,GAAI6I,KAAK80C,GAAGxmB,EAAIn3B,IACZ,OAAO,EACf,OAAO,EAMX29C,GAAGL,GACC,OAAOz0C,MAAQy0C,GACVz0C,KAAK5F,MAAQq6C,EAAMr6C,MAAQo7C,EAAYx1C,KAAK+uB,MAAO0lB,EAAM1lB,OAKlE4M,SACI,IAAI/lC,EAAM,CAAEwE,KAAM4F,KAAK5F,KAAKhE,MAC5B,IAAK,IAAIuQ,KAAK3G,KAAK+uB,MAAO,CACtBn5B,EAAIm5B,MAAQ/uB,KAAK+uB,MACjB,MAEJ,OAAOn5B,EAKXo5B,gBAAgBK,EAAQumB,GACpB,IAAKA,EACD,MAAM,IAAIb,WAAW,mCACzB,IAAI36C,EAAOi1B,EAAOD,MAAMwmB,EAAKx7C,MAC7B,IAAKA,EACD,MAAM,IAAI26C,WAAW,yBAAyBa,EAAKx7C,uBACvD,OAAOA,EAAKyN,OAAO+tC,EAAK7mB,OAK5BC,eAAehM,EAAGC,GACd,GAAID,GAAKC,EACL,OAAO,EACX,GAAID,EAAE5rB,QAAU6rB,EAAE7rB,OACd,OAAO,EACX,IAAK,IAAID,EAAI,EAAGA,EAAI6rB,EAAE5rB,OAAQD,IAC1B,IAAK6rB,EAAE7rB,GAAG29C,GAAG7xB,EAAE9rB,IACX,OAAO,EACf,OAAO,EAMX63B,eAAeI,GACX,IAAKA,GAAS35B,MAAMF,QAAQ65B,IAA0B,GAAhBA,EAAMh4B,OACxC,OAAOq+C,EAAKz3B,KAChB,GAAIoR,aAAiBqmB,EACjB,MAAO,CAACrmB,GACZ,IAAIr4B,EAAOq4B,EAAM52B,QAEjB,OADAzB,EAAKwtB,MAAK,CAACvB,EAAGC,IAAMD,EAAE5oB,KAAK8mB,KAAO+B,EAAE7oB,KAAK8mB,OAClCnqB,GAMf0+C,EAAKz3B,KAAO,GAMZ,MAAM63B,UAAqBp6B,OAkB3B,MAAMq6B,EAaF9/C,YAIA4J,EAIAm2C,EAIAC,GACIh2C,KAAKJ,QAAUA,EACfI,KAAK+1C,UAAYA,EACjB/1C,KAAKg2C,QAAUA,EAKfz2C,WACA,OAAOS,KAAKJ,QAAQL,KAAOS,KAAK+1C,UAAY/1C,KAAKg2C,QAKrDC,SAAS7gC,EAAKmH,GACV,IAAI3c,EAAUs2C,EAAWl2C,KAAKJ,QAASwV,EAAMpV,KAAK+1C,UAAWx5B,GAC7D,OAAO3c,GAAW,IAAIk2C,EAAMl2C,EAASI,KAAK+1C,UAAW/1C,KAAKg2C,SAK9DG,cAAcr7C,EAAMglC,GAChB,OAAO,IAAIgW,EAAMM,EAAYp2C,KAAKJ,QAAS9E,EAAOkF,KAAK+1C,UAAWjW,EAAK9/B,KAAK+1C,WAAY/1C,KAAK+1C,UAAW/1C,KAAKg2C,SAKjHlB,GAAGL,GACC,OAAOz0C,KAAKJ,QAAQk1C,GAAGL,EAAM70C,UAAYI,KAAK+1C,WAAatB,EAAMsB,WAAa/1C,KAAKg2C,SAAWvB,EAAMuB,QAKxG7gD,WACI,OAAO6K,KAAKJ,QAAU,IAAMI,KAAK+1C,UAAY,IAAM/1C,KAAKg2C,QAAU,IAKtEra,SACI,IAAK37B,KAAKJ,QAAQL,KACd,OAAO,KACX,IAAIq2C,EAAO,CAAEh2C,QAASI,KAAKJ,QAAQ+7B,UAKnC,OAJI37B,KAAK+1C,UAAY,IACjBH,EAAKG,UAAY/1C,KAAK+1C,WACtB/1C,KAAKg2C,QAAU,IACfJ,EAAKI,QAAUh2C,KAAKg2C,SACjBJ,EAKX5mB,gBAAgBK,EAAQumB,GACpB,IAAKA,EACD,OAAOE,EAAMjW,MACjB,IAAIkW,EAAYH,EAAKG,WAAa,EAAGC,EAAUJ,EAAKI,SAAW,EAC/D,GAAwB,iBAAbD,GAA2C,iBAAXC,EACvC,MAAM,IAAIjB,WAAW,oCACzB,OAAO,IAAIe,EAAM1B,EAASiC,SAAShnB,EAAQumB,EAAKh2C,SAAUm2C,EAAWC,GAMzEhnB,eAAezS,EAAU+5B,GAAgB,GACrC,IAAIP,EAAY,EAAGC,EAAU,EAC7B,IAAK,IAAIhoB,EAAIzR,EAASkhB,WAAYzP,IAAMA,EAAEwmB,SAAW8B,IAAkBtoB,EAAE5zB,KAAKq1B,KAAK+S,WAAYxU,EAAIA,EAAEyP,WACjGsY,IACJ,IAAK,IAAI/nB,EAAIzR,EAASuiB,UAAW9Q,IAAMA,EAAEwmB,SAAW8B,IAAkBtoB,EAAE5zB,KAAKq1B,KAAK+S,WAAYxU,EAAIA,EAAE8Q,UAChGkX,IACJ,OAAO,IAAIF,EAAMv5B,EAAUw5B,EAAWC,IAO9C,SAASI,EAAYx2C,EAAS9E,EAAMglC,GAChC,IAAI,MAAEnoC,EAAK,OAAEsK,GAAWrC,EAAQq1C,UAAUn6C,GAAOupB,EAAQzkB,EAAQ+nC,WAAWhwC,IACtEA,MAAO4+C,EAASt0C,OAAQu0C,GAAa52C,EAAQq1C,UAAUnV,GAC7D,GAAI79B,GAAUnH,GAAQupB,EAAM6K,OAAQ,CAChC,GAAIsnB,GAAY1W,IAAOlgC,EAAQykB,MAAMkyB,GAASrnB,OAC1C,MAAM,IAAI6lB,WAAW,2BACzB,OAAOn1C,EAAQg1C,IAAI,EAAG95C,GAAM0jC,OAAO5+B,EAAQg1C,IAAI9U,IAEnD,GAAInoC,GAAS4+C,EACT,MAAM,IAAIxB,WAAW,2BACzB,OAAOn1C,EAAQ02B,aAAa3+B,EAAO0sB,EAAMttB,KAAKq/C,EAAY/xB,EAAMzkB,QAAS9E,EAAOmH,EAAS,EAAG69B,EAAK79B,EAAS,KAE9G,SAASi0C,EAAWt2C,EAAS62C,EAAMpT,EAAQ/hB,GACvC,IAAI,MAAE3pB,EAAK,OAAEsK,GAAWrC,EAAQq1C,UAAUwB,GAAOpyB,EAAQzkB,EAAQ+nC,WAAWhwC,GAC5E,GAAIsK,GAAUw0C,GAAQpyB,EAAM6K,OACxB,OAAI5N,IAAWA,EAAOid,WAAW5mC,EAAOA,EAAO0rC,GACpC,KACJzjC,EAAQg1C,IAAI,EAAG6B,GAAMjY,OAAO6E,GAAQ7E,OAAO5+B,EAAQg1C,IAAI6B,IAElE,IAAIzS,EAAQkS,EAAW7xB,EAAMzkB,QAAS62C,EAAOx0C,EAAS,EAAGohC,GACzD,OAAOW,GAASpkC,EAAQ02B,aAAa3+B,EAAO0sB,EAAMttB,KAAKitC,IAE3D,SAAS15B,EAAQ6yB,EAAOC,EAAK5kC,GACzB,GAAIA,EAAMu9C,UAAY5Y,EAAMphB,MACxB,MAAM,IAAI85B,EAAa,mDAC3B,GAAI1Y,EAAMphB,MAAQvjB,EAAMu9C,WAAa3Y,EAAIrhB,MAAQvjB,EAAMw9C,QACnD,MAAM,IAAIH,EAAa,4BAC3B,OAAOa,EAAavZ,EAAOC,EAAK5kC,EAAO,GAE3C,SAASk+C,EAAavZ,EAAOC,EAAK5kC,EAAOujB,GACrC,IAAIpkB,EAAQwlC,EAAMxlC,MAAMokB,GAAQ5hB,EAAOgjC,EAAMhjC,KAAK4hB,GAClD,GAAIpkB,GAASylC,EAAIzlC,MAAMokB,IAAUA,EAAQohB,EAAMphB,MAAQvjB,EAAMu9C,UAAW,CACpE,IAAI/R,EAAQ0S,EAAavZ,EAAOC,EAAK5kC,EAAOujB,EAAQ,GACpD,OAAO5hB,EAAKpD,KAAKoD,EAAKyF,QAAQ02B,aAAa3+B,EAAOqsC,IAEjD,GAAKxrC,EAAMoH,QAAQL,KAGnB,IAAK/G,EAAMu9C,WAAcv9C,EAAMw9C,SAAW7Y,EAAMphB,OAASA,GAASqhB,EAAIrhB,OAASA,EAI/E,CACD,IAAI,MAAEtkB,EAAK,IAAEC,GAuErB,SAAgCc,EAAOm+C,GACnC,IAAIC,EAAQD,EAAO56B,MAAQvjB,EAAMu9C,UAC7B57C,EADiDw8C,EAAOx8C,KAAKy8C,GAC/C7/C,KAAKyB,EAAMoH,SAC7B,IAAK,IAAIzI,EAAIy/C,EAAQ,EAAGz/C,GAAK,EAAGA,IAC5BgD,EAAOw8C,EAAOx8C,KAAKhD,GAAGJ,KAAKq9C,EAASt5C,KAAKX,IAC7C,MAAO,CAAE1C,MAAO0C,EAAK08C,eAAer+C,EAAMu9C,UAAYa,GAClDl/C,IAAKyC,EAAK08C,eAAe18C,EAAKyF,QAAQL,KAAO/G,EAAMw9C,QAAUY,IA7ExCE,CAAuBt+C,EAAO2kC,GACnD,OAAO,EAAMhjC,EAAM48C,EAAgB5Z,EAAO1lC,EAAOC,EAAK0lC,EAAKrhB,IAN4B,CACvF,IAAIuF,EAAS6b,EAAM7b,OAAQ1hB,EAAU0hB,EAAO1hB,QAC5C,OAAO,EAAM0hB,EAAQ1hB,EAAQg1C,IAAI,EAAGzX,EAAMgE,cAAc3C,OAAOhmC,EAAMoH,SAAS4+B,OAAO5+B,EAAQg1C,IAAIxX,EAAI+D,iBAJrG,OAAO,EAAMhnC,EAAM68C,EAAc7Z,EAAOC,EAAKrhB,IAWrD,SAASk7B,EAAUnxC,EAAMoxC,GACrB,IAAKA,EAAI98C,KAAKw0C,kBAAkB9oC,EAAK1L,MACjC,MAAM,IAAIy7C,EAAa,eAAiBqB,EAAI98C,KAAKhE,KAAO,SAAW0P,EAAK1L,KAAKhE,MAErF,SAAS+gD,EAASC,EAASC,EAAQt7B,GAC/B,IAAI5hB,EAAOi9C,EAAQj9C,KAAK4hB,GAExB,OADAk7B,EAAU98C,EAAMk9C,EAAOl9C,KAAK4hB,IACrB5hB,EAEX,SAAS61B,EAAQ3L,EAAOnuB,GACpB,IAAIw+C,EAAOx+C,EAAOkB,OAAS,EACvBs9C,GAAQ,GAAKrwB,EAAM6K,QAAU7K,EAAMuvB,WAAW19C,EAAOw+C,IACrDx+C,EAAOw+C,GAAQrwB,EAAMswB,SAASz+C,EAAOw+C,GAAMzwC,KAAOogB,EAAMpgB,MAExD/N,EAAO8E,KAAKqpB,GAEpB,SAASizB,EAASpZ,EAAQqZ,EAAMx7B,EAAO7lB,GACnC,IAAIiE,GAAQo9C,GAAQrZ,GAAQ/jC,KAAK4hB,GAC7B9V,EAAa,EAAGE,EAAWoxC,EAAOA,EAAK5/C,MAAMokB,GAAS5hB,EAAKqjC,WAC3DU,IACAj4B,EAAai4B,EAAOvmC,MAAMokB,GACtBmiB,EAAOniB,MAAQA,EACf9V,IAEKi4B,EAAOsZ,aACZxnB,EAAQkO,EAAOC,UAAWjoC,GAC1B+P,MAGR,IAAK,IAAI9O,EAAI8O,EAAY9O,EAAIgP,EAAUhP,IACnC64B,EAAQ71B,EAAKkqB,MAAMltB,GAAIjB,GACvBqhD,GAAQA,EAAKx7B,OAASA,GAASw7B,EAAKC,YACpCxnB,EAAQunB,EAAKzT,WAAY5tC,GAEjC,SAAS,EAAMiE,EAAMyF,GAEjB,OADAzF,EAAKC,KAAKq9C,aAAa73C,GAChBzF,EAAKpD,KAAK6I,GAErB,SAASm3C,EAAgB5Z,EAAOe,EAAQqZ,EAAMna,EAAKrhB,GAC/C,IAAIg6B,EAAY5Y,EAAMphB,MAAQA,GAASo7B,EAASha,EAAOe,EAAQniB,EAAQ,GACnEi6B,EAAU5Y,EAAIrhB,MAAQA,GAASo7B,EAASI,EAAMna,EAAKrhB,EAAQ,GAC3Dnc,EAAU,GAcd,OAbA03C,EAAS,KAAMna,EAAOphB,EAAOnc,GACzBm2C,GAAaC,GAAW9X,EAAOvmC,MAAMokB,IAAUw7B,EAAK5/C,MAAMokB,IAC1Dk7B,EAAUlB,EAAWC,GACrBhmB,EAAQ,EAAM+lB,EAAWgB,EAAgB5Z,EAAOe,EAAQqZ,EAAMna,EAAKrhB,EAAQ,IAAKnc,KAG5Em2C,GACA/lB,EAAQ,EAAM+lB,EAAWiB,EAAc7Z,EAAOe,EAAQniB,EAAQ,IAAKnc,GACvE03C,EAASpZ,EAAQqZ,EAAMx7B,EAAOnc,GAC1Bo2C,GACAhmB,EAAQ,EAAMgmB,EAASgB,EAAcO,EAAMna,EAAKrhB,EAAQ,IAAKnc,IAErE03C,EAASla,EAAK,KAAMrhB,EAAOnc,GACpB,IAAIw0C,EAASx0C,GAExB,SAASo3C,EAAc7Z,EAAOC,EAAKrhB,GAC/B,IAAInc,EAAU,GAEd,GADA03C,EAAS,KAAMna,EAAOphB,EAAOnc,GACzBu9B,EAAMphB,MAAQA,EAAO,CAErBiU,EAAQ,EADGmnB,EAASha,EAAOC,EAAKrhB,EAAQ,GACpBi7B,EAAc7Z,EAAOC,EAAKrhB,EAAQ,IAAKnc,GAG/D,OADA03C,EAASla,EAAK,KAAMrhB,EAAOnc,GACpB,IAAIw0C,EAASx0C,GAjHxBk2C,EAAMjW,MAAQ,IAAIiW,EAAM1B,EAASvU,MAAO,EAAG,GAsI3C,MAAM6X,EAIF1hD,YAIAof,EAIA2R,EAIAoa,GACInhC,KAAKoV,IAAMA,EACXpV,KAAK+mB,KAAOA,EACZ/mB,KAAKmhC,aAAeA,EACpBnhC,KAAK+b,MAAQgL,EAAK3vB,OAAS,EAAI,EAKnCugD,aAAaC,GACT,OAAW,MAAPA,EACO53C,KAAK+b,MACZ67B,EAAM,EACC53C,KAAK+b,MAAQ67B,EACjBA,EAOPt2B,aAAW,OAAOthB,KAAK7F,KAAK6F,KAAK+b,OAIjC0B,UAAQ,OAAOzd,KAAK7F,KAAK,GAK7BA,KAAK4hB,GAAS,OAAO/b,KAAK+mB,KAAgC,EAA3B/mB,KAAK23C,aAAa57B,IAMjDpkB,MAAMokB,GAAS,OAAO/b,KAAK+mB,KAAgC,EAA3B/mB,KAAK23C,aAAa57B,GAAa,GAK/DqoB,WAAWroB,GAEP,OADAA,EAAQ/b,KAAK23C,aAAa57B,GACnB/b,KAAKrI,MAAMokB,IAAUA,GAAS/b,KAAK+b,OAAU/b,KAAKw3C,WAAiB,EAAJ,GAM1E//C,MAAMskB,GAEF,OAAgB,IADhBA,EAAQ/b,KAAK23C,aAAa57B,IACN,EAAI/b,KAAK+mB,KAAa,EAARhL,EAAY,GAAK,EAMvDrkB,IAAIqkB,GAEA,OADAA,EAAQ/b,KAAK23C,aAAa57B,GACnB/b,KAAKvI,MAAMskB,GAAS/b,KAAK7F,KAAK4hB,GAAOnc,QAAQL,KAOxDzB,OAAOie,GAEH,KADAA,EAAQ/b,KAAK23C,aAAa57B,IAEtB,MAAM,IAAIg5B,WAAW,kDACzB,OAAOh5B,GAAS/b,KAAK+b,MAAQ,EAAI/b,KAAKoV,IAAMpV,KAAK+mB,KAAa,EAARhL,EAAY,GAMtEhZ,MAAMgZ,GAEF,KADAA,EAAQ/b,KAAK23C,aAAa57B,IAEtB,MAAM,IAAIg5B,WAAW,iDACzB,OAAOh5B,GAAS/b,KAAK+b,MAAQ,EAAI/b,KAAKoV,IAAMpV,KAAK+mB,KAAa,EAARhL,EAAY,GAAK/b,KAAK+mB,KAAa,EAARhL,GAAWkiB,SAO5FuZ,iBAAe,OAAOx3C,KAAKoV,IAAMpV,KAAK+mB,KAAK/mB,KAAK+mB,KAAK3vB,OAAS,GAM9D+mC,gBACA,IAAI7c,EAASthB,KAAKshB,OAAQ3pB,EAAQqI,KAAKrI,MAAMqI,KAAK+b,OAClD,GAAIpkB,GAAS2pB,EAAOkc,WAChB,OAAO,KACX,IAAIqa,EAAO73C,KAAKoV,IAAMpV,KAAK+mB,KAAK/mB,KAAK+mB,KAAK3vB,OAAS,GAAIitB,EAAQ/C,EAAO+C,MAAM1sB,GAC5E,OAAOkgD,EAAOv2B,EAAO+C,MAAM1sB,GAAOi9C,IAAIiD,GAAQxzB,EAO9Cyf,iBACA,IAAInsC,EAAQqI,KAAKrI,MAAMqI,KAAK+b,OACxB87B,EAAO73C,KAAKoV,IAAMpV,KAAK+mB,KAAK/mB,KAAK+mB,KAAK3vB,OAAS,GACnD,OAAIygD,EACO73C,KAAKshB,OAAO+C,MAAM1sB,GAAOi9C,IAAI,EAAGiD,GAC3B,GAATlgD,EAAa,KAAOqI,KAAKshB,OAAO+C,MAAM1sB,EAAQ,GAMzDmgD,WAAWngD,EAAOokB,GACdA,EAAQ/b,KAAK23C,aAAa57B,GAC1B,IAAI5hB,EAAO6F,KAAK+mB,KAAa,EAARhL,GAAY3G,EAAe,GAAT2G,EAAa,EAAI/b,KAAK+mB,KAAa,EAARhL,EAAY,GAAK,EACnF,IAAK,IAAI5kB,EAAI,EAAGA,EAAIQ,EAAOR,IACvBie,GAAOjb,EAAKkqB,MAAMltB,GAAG8mC,SACzB,OAAO7oB,EAQXga,QACI,IAAI9N,EAASthB,KAAKshB,OAAQ3pB,EAAQqI,KAAKrI,QAEvC,GAA2B,GAAvB2pB,EAAO1hB,QAAQL,KACf,OAAOk2C,EAAKz3B,KAEhB,GAAIhe,KAAKw3C,WACL,OAAOl2B,EAAO+C,MAAM1sB,GAAOy3B,MAC/B,IAAItpB,EAAOwb,EAAOqmB,WAAWhwC,EAAQ,GAAI88C,EAAQnzB,EAAOqmB,WAAWhwC,GAGnE,IAAKmO,EAAM,CACP,IAAIiyC,EAAMjyC,EACVA,EAAO2uC,EACPA,EAAQsD,EAIZ,IAAI3oB,EAAQtpB,EAAKspB,MACjB,IAAK,IAAIj4B,EAAI,EAAGA,EAAIi4B,EAAMh4B,OAAQD,KACO,IAAjCi4B,EAAMj4B,GAAGiD,KAAKq1B,KAAKmQ,WAAyB6U,GAAUrlB,EAAMj4B,GAAGm7B,QAAQmiB,EAAMrlB,SAC7EA,EAAQA,EAAMj4B,KAAKi5B,cAAchB,IACzC,OAAOA,EAUX4oB,YAAYT,GACR,IAAIx0C,EAAQ/C,KAAKshB,OAAOqmB,WAAW3nC,KAAKrI,SACxC,IAAKoL,IAAUA,EAAM8/B,SACjB,OAAO,KACX,IAAIzT,EAAQrsB,EAAMqsB,MAAOryB,EAAOw6C,EAAKj2B,OAAOqmB,WAAW4P,EAAK5/C,SAC5D,IAAK,IAAIR,EAAI,EAAGA,EAAIi4B,EAAMh4B,OAAQD,KACO,IAAjCi4B,EAAMj4B,GAAGiD,KAAKq1B,KAAKmQ,WAAyB7iC,GAASqyB,EAAMj4B,GAAGm7B,QAAQv1B,EAAKqyB,SAC3EA,EAAQA,EAAMj4B,KAAKi5B,cAAchB,IACzC,OAAOA,EAMX6oB,YAAY7iC,GACR,IAAK,IAAI2G,EAAQ/b,KAAK+b,MAAOA,EAAQ,EAAGA,IACpC,GAAI/b,KAAKvI,MAAMskB,IAAU3G,GAAOpV,KAAKtI,IAAIqkB,IAAU3G,EAC/C,OAAO2G,EACf,OAAO,EAWXwhB,WAAWkX,EAAQz0C,KAAMk4C,GACrB,GAAIzD,EAAMr/B,IAAMpV,KAAKoV,IACjB,OAAOq/B,EAAMlX,WAAWv9B,MAC5B,IAAK,IAAIsd,EAAItd,KAAK+b,OAAS/b,KAAKshB,OAAO2uB,eAAiBjwC,KAAKoV,KAAOq/B,EAAMr/B,IAAM,EAAI,GAAIkI,GAAK,EAAGA,IAC5F,GAAIm3B,EAAMr/B,KAAOpV,KAAKtI,IAAI4lB,MAAQ46B,GAAQA,EAAKl4C,KAAK7F,KAAKmjB,KACrD,OAAO,IAAI66B,EAAUn4C,KAAMy0C,EAAOn3B,GAC1C,OAAO,KAKX4mB,WAAWuQ,GACP,OAAOz0C,KAAKoV,IAAMpV,KAAKmhC,cAAgBsT,EAAMr/B,IAAMq/B,EAAMtT,aAK7DhiC,IAAIs1C,GACA,OAAOA,EAAMr/B,IAAMpV,KAAKoV,IAAMq/B,EAAQz0C,KAK1CmhB,IAAIszB,GACA,OAAOA,EAAMr/B,IAAMpV,KAAKoV,IAAMq/B,EAAQz0C,KAK1C7K,WACI,IAAIijD,EAAM,GACV,IAAK,IAAIjhD,EAAI,EAAGA,GAAK6I,KAAK+b,MAAO5kB,IAC7BihD,IAAQA,EAAM,IAAM,IAAMp4C,KAAK7F,KAAKhD,GAAGiD,KAAKhE,KAAO,IAAM4J,KAAKrI,MAAMR,EAAI,GAC5E,OAAOihD,EAAM,IAAMp4C,KAAKmhC,aAK5BnS,eAAevR,EAAKrI,GAChB,KAAMA,GAAO,GAAKA,GAAOqI,EAAI7d,QAAQL,MACjC,MAAM,IAAIw1C,WAAW,YAAc3/B,EAAM,iBAC7C,IAAI2R,EAAO,GACPtvB,EAAQ,EAAG0pC,EAAe/rB,EAC9B,IAAK,IAAIjb,EAAOsjB,IAAO,CACnB,IAAI,MAAE9lB,EAAK,OAAEsK,GAAW9H,EAAKyF,QAAQq1C,UAAU9T,GAC3CkX,EAAMlX,EAAel/B,EAEzB,GADA8kB,EAAK/rB,KAAKb,EAAMxC,EAAOF,EAAQwK,IAC1Bo2C,EACD,MAEJ,GADAl+C,EAAOA,EAAKkqB,MAAM1sB,GACdwC,EAAK+0B,OACL,MACJiS,EAAekX,EAAM,EACrB5gD,GAASwK,EAAS,EAEtB,OAAO,IAAIy1C,EAAYtiC,EAAK2R,EAAMoa,GAKtCnS,qBAAqBvR,EAAKrI,GACtB,IAAK,IAAIje,EAAI,EAAGA,EAAImhD,EAAalhD,OAAQD,IAAK,CAC1C,IAAIohD,EAASD,EAAanhD,GAC1B,GAAIohD,EAAOnjC,KAAOA,GAAOmjC,EAAO96B,KAAOA,EACnC,OAAO86B,EAEf,IAAI3gD,EAAS0gD,EAAaE,GAAmBd,EAAYr0C,QAAQoa,EAAKrI,GAEtE,OADAojC,GAAmBA,EAAkB,GAAKC,EACnC7gD,GAGf,IAAI0gD,EAAe,GAAIE,EAAkB,EAAGC,EAAmB,GAK/D,MAAMN,EAMFniD,YAOAmnC,EAKAC,EAIArhB,GACI/b,KAAKm9B,MAAQA,EACbn9B,KAAKo9B,IAAMA,EACXp9B,KAAK+b,MAAQA,EAKbtkB,YAAU,OAAOuI,KAAKm9B,MAAMr/B,OAAOkC,KAAK+b,MAAQ,GAIhDrkB,UAAQ,OAAOsI,KAAKo9B,IAAIr6B,MAAM/C,KAAK+b,MAAQ,GAI3CuF,aAAW,OAAOthB,KAAKm9B,MAAMhjC,KAAK6F,KAAK+b,OAIvC9V,iBAAe,OAAOjG,KAAKm9B,MAAMxlC,MAAMqI,KAAK+b,OAI5C5V,eAAa,OAAOnG,KAAKo9B,IAAIgH,WAAWpkC,KAAK+b,QAGrD,MAAM28B,EAAa3jD,OAAO8S,OAAO,MAejC,MAAM8wC,EAIF3iD,YAIAoE,EAMA20B,EAEAnvB,EAKAwvB,EAAQqmB,EAAKz3B,MACThe,KAAK5F,KAAOA,EACZ4F,KAAK+uB,MAAQA,EACb/uB,KAAKovB,MAAQA,EACbpvB,KAAKJ,QAAUA,GAAWw0C,EAASvU,MASnC5B,eAAa,OAAOj+B,KAAKw0C,OAAS,EAAI,EAAIx0C,KAAKJ,QAAQL,KAIvDi+B,iBAAe,OAAOx9B,KAAKJ,QAAQ49B,WAKvCnZ,MAAM1sB,GAAS,OAAOqI,KAAKJ,QAAQykB,MAAM1sB,GAIzCgwC,WAAWhwC,GAAS,OAAOqI,KAAKJ,QAAQ+nC,WAAWhwC,GAKnD64B,QAAQsB,GAAK9xB,KAAKJ,QAAQ4wB,QAAQsB,GAWlCyO,aAAazlC,EAAMglC,EAAIhO,EAAG8mB,EAAW,GACjC54C,KAAKJ,QAAQ2gC,aAAazlC,EAAMglC,EAAIhO,EAAG8mB,EAAU54C,MAMrDwnC,YAAY1V,GACR9xB,KAAKugC,aAAa,EAAGvgC,KAAKJ,QAAQL,KAAMuyB,GAMxCxiB,kBACA,OAAQtP,KAAKw0C,QAAUx0C,KAAK5F,KAAKq1B,KAAKqT,SAChC9iC,KAAK5F,KAAKq1B,KAAKqT,SAAS9iC,MACxBA,KAAKkpC,YAAY,EAAGlpC,KAAKJ,QAAQL,KAAM,IASjD2pC,YAAYpuC,EAAMglC,EAAIwU,EAAgBxR,GAClC,OAAO9iC,KAAKJ,QAAQspC,YAAYpuC,EAAMglC,EAAIwU,EAAgBxR,GAM1DrF,iBAAe,OAAOz9B,KAAKJ,QAAQ69B,WAKnCqB,gBAAc,OAAO9+B,KAAKJ,QAAQk/B,UAItCgW,GAAGL,GACC,OAAOz0C,MAAQy0C,GAAUz0C,KAAK4zC,WAAWa,IAAUz0C,KAAKJ,QAAQk1C,GAAGL,EAAM70C,SAM7Eg0C,WAAWa,GACP,OAAOz0C,KAAK+vC,UAAU0E,EAAMr6C,KAAMq6C,EAAM1lB,MAAO0lB,EAAMrlB,OAMzD2gB,UAAU31C,EAAM20B,EAAOK,GACnB,OAAOpvB,KAAK5F,MAAQA,GAChBo7C,EAAYx1C,KAAK+uB,MAAOA,GAAS30B,EAAKy+C,cAAgBH,IACtDjD,EAAKqD,QAAQ94C,KAAKovB,MAAOA,GAASqmB,EAAKz3B,MAM/CjnB,KAAK6I,EAAU,MACX,OAAIA,GAAWI,KAAKJ,QACTI,KACJ,IAAI24C,EAAK34C,KAAK5F,KAAM4F,KAAK+uB,MAAOnvB,EAASI,KAAKovB,OAMzD+P,KAAK/P,GACD,OAAOA,GAASpvB,KAAKovB,MAAQpvB,KAAO,IAAI24C,EAAK34C,KAAK5F,KAAM4F,KAAK+uB,MAAO/uB,KAAKJ,QAASwvB,GAOtFwlB,IAAI95C,EAAMglC,EAAK9/B,KAAKJ,QAAQL,MACxB,OAAY,GAARzE,GAAaglC,GAAM9/B,KAAKJ,QAAQL,KACzBS,KACJA,KAAKjJ,KAAKiJ,KAAKJ,QAAQg1C,IAAI95C,EAAMglC,IAM5CtnC,MAAMsC,EAAMglC,EAAK9/B,KAAKJ,QAAQL,KAAMw5C,GAAiB,GACjD,GAAIj+C,GAAQglC,EACR,OAAOgW,EAAMjW,MACjB,IAAI1C,EAAQn9B,KAAKqD,QAAQvI,GAAOsiC,EAAMp9B,KAAKqD,QAAQy8B,GAC/C/jB,EAAQg9B,EAAiB,EAAI5b,EAAM8a,YAAYnY,GAC/CroC,EAAQ0lC,EAAM1lC,MAAMskB,GACpBnc,EADmCu9B,EAAMhjC,KAAK4hB,GAC/Bnc,QAAQg1C,IAAIzX,EAAM/nB,IAAM3d,EAAO2lC,EAAIhoB,IAAM3d,GAC5D,OAAO,IAAIq+C,EAAMl2C,EAASu9B,EAAMphB,MAAQA,EAAOqhB,EAAIrhB,MAAQA,GAU/DzR,QAAQxP,EAAMglC,EAAItnC,GACd,OAAO8R,EAAQtK,KAAKqD,QAAQvI,GAAOkF,KAAKqD,QAAQy8B,GAAKtnC,GAKzDwgD,OAAO5jC,GACH,IAAK,IAAIjb,EAAO6F,OAAQ,CACpB,IAAI,MAAErI,EAAK,OAAEsK,GAAW9H,EAAKyF,QAAQq1C,UAAU7/B,GAE/C,GADAjb,EAAOA,EAAKwtC,WAAWhwC,IAClBwC,EACD,OAAO,KACX,GAAI8H,GAAUmT,GAAOjb,EAAK+0B,OACtB,OAAO/0B,EACXib,GAAOnT,EAAS,GAQxBg3C,WAAW7jC,GACP,IAAI,MAAEzd,EAAK,OAAEsK,GAAWjC,KAAKJ,QAAQq1C,UAAU7/B,GAC/C,MAAO,CAAEjb,KAAM6F,KAAKJ,QAAQ+nC,WAAWhwC,GAAQA,QAAOsK,UAO1Di3C,YAAY9jC,GACR,GAAW,GAAPA,EACA,MAAO,CAAEjb,KAAM,KAAMxC,MAAO,EAAGsK,OAAQ,GAC3C,IAAI,MAAEtK,EAAK,OAAEsK,GAAWjC,KAAKJ,QAAQq1C,UAAU7/B,GAC/C,GAAInT,EAASmT,EACT,MAAO,CAAEjb,KAAM6F,KAAKJ,QAAQykB,MAAM1sB,GAAQA,QAAOsK,UACrD,IAAI9H,EAAO6F,KAAKJ,QAAQykB,MAAM1sB,EAAQ,GACtC,MAAO,CAAEwC,OAAMxC,MAAOA,EAAQ,EAAGsK,OAAQA,EAAS9H,EAAK8jC,UAM3D56B,QAAQ+R,GAAO,OAAOsiC,EAAYyB,cAAcn5C,KAAMoV,GAItDyhC,eAAezhC,GAAO,OAAOsiC,EAAYr0C,QAAQrD,KAAMoV,GAKvD2qB,aAAajlC,EAAMglC,EAAI1lC,GACnB,IAAI44C,GAAQ,EAOZ,OANIlT,EAAKhlC,GACLkF,KAAKugC,aAAazlC,EAAMglC,GAAI3lC,IACpBC,EAAKk4B,QAAQn4B,EAAKi1B,SAClB4jB,GAAQ,IACJA,KAETA,EAKP/O,cAAY,OAAOjkC,KAAK5F,KAAK6pC,QAK7BO,kBAAgB,OAAOxkC,KAAK5F,KAAKoqC,YAIjCyL,oBAAkB,OAAOjwC,KAAK5F,KAAK61C,cAKnCpN,eAAa,OAAO7iC,KAAK5F,KAAKyoC,SAI9B3T,aAAW,OAAOlvB,KAAK5F,KAAK80B,OAI5BslB,aAAW,OAAOx0C,KAAK5F,KAAKo6C,OAQ5BjH,aAAW,OAAOvtC,KAAK5F,KAAKmzC,OAKhCp4C,WACI,GAAI6K,KAAK5F,KAAKq1B,KAAK2pB,cACf,OAAOp5C,KAAK5F,KAAKq1B,KAAK2pB,cAAcp5C,MACxC,IAAI5J,EAAO4J,KAAK5F,KAAKhE,KAGrB,OAFI4J,KAAKJ,QAAQL,OACbnJ,GAAQ,IAAM4J,KAAKJ,QAAQy1C,gBAAkB,KAC1CgE,EAAUr5C,KAAKovB,MAAOh5B,GAKjCsuC,eAAe/sC,GACX,IAAI8B,EAAQuG,KAAK5F,KAAKk/C,aAAaC,cAAcv5C,KAAKJ,QAAS,EAAGjI,GAClE,IAAK8B,EACD,MAAM,IAAIgiB,MAAM,wDACpB,OAAOhiB,EASX8kC,WAAWzjC,EAAMglC,EAAI0Z,EAAcpF,EAASvU,MAAOpoC,EAAQ,EAAGC,EAAM8hD,EAAYhc,YAC5E,IAAIzjC,EAAMiG,KAAK0kC,eAAe5pC,GAAMy+C,cAAcC,EAAa/hD,EAAOC,GAClE+hD,EAAM1/C,GAAOA,EAAIw/C,cAAcv5C,KAAKJ,QAASkgC,GACjD,IAAK2Z,IAAQA,EAAIvK,SACb,OAAO,EACX,IAAK,IAAI/3C,EAAIM,EAAON,EAAIO,EAAKP,IACzB,IAAK6I,KAAK5F,KAAKs/C,YAAYF,EAAYn1B,MAAMltB,GAAGi4B,OAC5C,OAAO,EACf,OAAO,EAMXsf,eAAe5zC,EAAMglC,EAAI1lC,EAAMg1B,GAC3B,GAAIA,IAAUpvB,KAAK5F,KAAKs/C,YAAYtqB,GAChC,OAAO,EACX,IAAI33B,EAAQuI,KAAK0kC,eAAe5pC,GAAMm0C,UAAU70C,GAC5C1C,EAAMD,GAASA,EAAM8hD,cAAcv5C,KAAKJ,QAASkgC,GACrD,QAAOpoC,GAAMA,EAAIw3C,SAQrByK,UAAUlF,GACN,OAAIA,EAAM70C,QAAQL,KACPS,KAAKu+B,WAAWv+B,KAAKw9B,WAAYx9B,KAAKw9B,WAAYiX,EAAM70C,SAExDI,KAAK5F,KAAKw0C,kBAAkB6F,EAAMr6C,MAMjDuH,QACI3B,KAAK5F,KAAKq9C,aAAaz3C,KAAKJ,SAC5B,IAAI7I,EAAO0+C,EAAKz3B,KAChB,IAAK,IAAI7mB,EAAI,EAAGA,EAAI6I,KAAKovB,MAAMh4B,OAAQD,IACnCJ,EAAOiJ,KAAKovB,MAAMj4B,GAAG+4B,SAASn5B,GAClC,IAAK0+C,EAAKqD,QAAQ/hD,EAAMiJ,KAAKovB,OACzB,MAAM,IAAI2lB,WAAW,wCAAwC/0C,KAAK5F,KAAKhE,SAAS4J,KAAKovB,MAAMjoB,KAAIoqB,GAAKA,EAAEn3B,KAAKhE,UAC/G4J,KAAKJ,QAAQ4wB,SAAQr2B,GAAQA,EAAKwH,UAKtCg6B,SACI,IAAI/lC,EAAM,CAAEwE,KAAM4F,KAAK5F,KAAKhE,MAC5B,IAAK,IAAIuQ,KAAK3G,KAAK+uB,MAAO,CACtBn5B,EAAIm5B,MAAQ/uB,KAAK+uB,MACjB,MAMJ,OAJI/uB,KAAKJ,QAAQL,OACb3J,EAAIgK,QAAUI,KAAKJ,QAAQ+7B,UAC3B37B,KAAKovB,MAAMh4B,SACXxB,EAAIw5B,MAAQpvB,KAAKovB,MAAMjoB,KAAI6mB,GAAKA,EAAE2N,YAC/B/lC,EAKXo5B,gBAAgBK,EAAQumB,GACpB,IAAKA,EACD,MAAM,IAAIb,WAAW,mCACzB,IAAI3lB,EAAQ,KACZ,GAAIwmB,EAAKxmB,MAAO,CACZ,IAAK35B,MAAMF,QAAQqgD,EAAKxmB,OACpB,MAAM,IAAI2lB,WAAW,uCACzB3lB,EAAQwmB,EAAKxmB,MAAMjoB,IAAIkoB,EAAOuqB,cAElC,GAAiB,QAAbhE,EAAKx7C,KAAgB,CACrB,GAAwB,iBAAbw7C,EAAK3xC,KACZ,MAAM,IAAI8wC,WAAW,6BACzB,OAAO1lB,EAAOprB,KAAK2xC,EAAK3xC,KAAMmrB,GAElC,IAAIxvB,EAAUw0C,EAASiC,SAAShnB,EAAQumB,EAAKh2C,SAC7C,OAAOyvB,EAAO8b,SAASyK,EAAKx7C,MAAMyN,OAAO+tC,EAAK7mB,MAAOnvB,EAASwvB,IAGtEupB,EAAK3jD,UAAUiP,UAAOnM,EACtB,MAAM+hD,UAAiBlB,EAInB3iD,YAAYoE,EAAM20B,EAAOnvB,EAASwvB,GAE9B,GADAjJ,MAAM/rB,EAAM20B,EAAO,KAAMK,IACpBxvB,EACD,MAAM,IAAIm1C,WAAW,oCACzB/0C,KAAKiE,KAAOrE,EAEhBzK,WACI,OAAI6K,KAAK5F,KAAKq1B,KAAK2pB,cACRp5C,KAAK5F,KAAKq1B,KAAK2pB,cAAcp5C,MACjCq5C,EAAUr5C,KAAKovB,MAAO9G,KAAKC,UAAUvoB,KAAKiE,OAEjDqL,kBAAgB,OAAOtP,KAAKiE,KAChCilC,YAAYpuC,EAAMglC,GAAM,OAAO9/B,KAAKiE,KAAKzL,MAAMsC,EAAMglC,GACjD7B,eAAa,OAAOj+B,KAAKiE,KAAK7M,OAClC+nC,KAAK/P,GACD,OAAOA,GAASpvB,KAAKovB,MAAQpvB,KAAO,IAAI65C,EAAS75C,KAAK5F,KAAM4F,KAAK+uB,MAAO/uB,KAAKiE,KAAMmrB,GAEvFulB,SAAS1wC,GACL,OAAIA,GAAQjE,KAAKiE,KACNjE,KACJ,IAAI65C,EAAS75C,KAAK5F,KAAM4F,KAAK+uB,MAAO9qB,EAAMjE,KAAKovB,OAE1DwlB,IAAI95C,EAAO,EAAGglC,EAAK9/B,KAAKiE,KAAK7M,QACzB,OAAY,GAAR0D,GAAaglC,GAAM9/B,KAAKiE,KAAK7M,OACtB4I,KACJA,KAAK20C,SAAS30C,KAAKiE,KAAKzL,MAAMsC,EAAMglC,IAE/CgV,GAAGL,GACC,OAAOz0C,KAAK4zC,WAAWa,IAAUz0C,KAAKiE,MAAQwwC,EAAMxwC,KAExD03B,SACI,IAAInnB,EAAO2R,MAAMwV,SAEjB,OADAnnB,EAAKvQ,KAAOjE,KAAKiE,KACVuQ,GAGf,SAAS6kC,EAAUjqB,EAAOgpB,GACtB,IAAK,IAAIjhD,EAAIi4B,EAAMh4B,OAAS,EAAGD,GAAK,EAAGA,IACnCihD,EAAMhpB,EAAMj4B,GAAGiD,KAAKhE,KAAO,IAAMgiD,EAAM,IAC3C,OAAOA,EASX,MAAM0B,EAIF9jD,YAIAk5C,GACIlvC,KAAKkvC,SAAWA,EAIhBlvC,KAAKjD,KAAO,GAIZiD,KAAK+5C,UAAY,GAKrB/qB,aAAa13B,EAAQ0iD,GACjB,IAAIv9C,EAAS,IAAIw9C,EAAY3iD,EAAQ0iD,GACrC,GAAmB,MAAfv9C,EAAOM,KACP,OAAO+8C,EAAaja,MACxB,IAAIqa,EAAOC,EAAU19C,GACjBA,EAAOM,MACPN,EAAO29C,IAAI,4BACf,IAAI3gD,EAsWZ,SAAa4gD,GACT,IAAIC,EAAUvlD,OAAO8S,OAAO,MAC5B,OAAO0yC,EAAQC,EAASH,EAAK,IAC7B,SAASE,EAAQE,GACb,IAAIC,EAAM,GACVD,EAAOjqB,SAAQr2B,IACXkgD,EAAIlgD,GAAMq2B,SAAQ,EAAGmqB,OAAM7a,SACvB,IAAK6a,EACD,OACJ,IAAIrsB,EACJ,IAAK,IAAIn3B,EAAI,EAAGA,EAAIujD,EAAItjD,OAAQD,IACxBujD,EAAIvjD,GAAG,IAAMwjD,IACbrsB,EAAMosB,EAAIvjD,GAAG,IACrBqjD,EAASH,EAAKva,GAAItP,SAAQr2B,IACjBm0B,GACDosB,EAAI1/C,KAAK,CAAC2/C,EAAMrsB,EAAM,MACA,GAAtBA,EAAI1N,QAAQzmB,IACZm0B,EAAItzB,KAAKb,YAIzB,IAAI6L,EAAQs0C,EAAQG,EAAOliD,KAAK,MAAQ,IAAIuhD,EAAaW,EAAO75B,QAAQy5B,EAAIjjD,OAAS,IAAM,GAC3F,IAAK,IAAID,EAAI,EAAGA,EAAIujD,EAAItjD,OAAQD,IAAK,CACjC,IAAIsjD,EAASC,EAAIvjD,GAAG,GAAGotB,KAAKq2B,GAC5B50C,EAAMjJ,KAAK/B,KAAK,CAAEZ,KAAMsgD,EAAIvjD,GAAG,GAAI4F,KAAMu9C,EAAQG,EAAOliD,KAAK,OAASgiD,EAAQE,KAElF,OAAOz0C,GAhYK60C,CA2QpB,SAAaX,GACT,IAAIG,EAAM,CAAC,IAEX,OADAS,EAAQtgC,EAAQ0/B,EAAM,GAAI//C,KACnBkgD,EACP,SAASlgD,IAAS,OAAOkgD,EAAIr/C,KAAK,IAAM,EACxC,SAASizC,EAAKnzC,EAAMglC,EAAI6a,GACpB,IAAI1M,EAAO,CAAE0M,OAAM7a,MAEnB,OADAua,EAAIv/C,GAAME,KAAKizC,GACRA,EAEX,SAAS6M,EAAQC,EAAOjb,GACpBib,EAAMvqB,SAAQyd,GAAQA,EAAKnO,GAAKA,IAEpC,SAAStlB,EAAQ0/B,EAAMp/C,GACnB,GAAiB,UAAbo/C,EAAK9/C,KACL,OAAO8/C,EAAKc,MAAM9oB,QAAO,CAACwoB,EAAKR,IAASQ,EAAIroB,OAAO7X,EAAQ0/B,EAAMp/C,KAAQ,IAExE,GAAiB,OAAbo/C,EAAK9/C,KAQT,IAAiB,QAAb8/C,EAAK9/C,KAAgB,CAC1B,IAAI6gD,EAAO9gD,IAGX,OAFA8zC,EAAKnzC,EAAMmgD,GACXH,EAAQtgC,EAAQ0/B,EAAKA,KAAMe,GAAOA,GAC3B,CAAChN,EAAKgN,IAEZ,GAAiB,QAAbf,EAAK9/C,KAAgB,CAC1B,IAAI6gD,EAAO9gD,IAGX,OAFA2gD,EAAQtgC,EAAQ0/B,EAAKA,KAAMp/C,GAAOmgD,GAClCH,EAAQtgC,EAAQ0/B,EAAKA,KAAMe,GAAOA,GAC3B,CAAChN,EAAKgN,IAEZ,GAAiB,OAAbf,EAAK9/C,KACV,MAAO,CAAC6zC,EAAKnzC,IAAOu3B,OAAO7X,EAAQ0/B,EAAKA,KAAMp/C,IAE7C,GAAiB,SAAbo/C,EAAK9/C,KAAiB,CAC3B,IAAI8gD,EAAMpgD,EACV,IAAK,IAAI3D,EAAI,EAAGA,EAAI+iD,EAAK/4B,IAAKhqB,IAAK,CAC/B,IAAI4F,EAAO5C,IACX2gD,EAAQtgC,EAAQ0/B,EAAKA,KAAMgB,GAAMn+C,GACjCm+C,EAAMn+C,EAEV,IAAiB,GAAbm9C,EAAK/6C,IACL27C,EAAQtgC,EAAQ0/B,EAAKA,KAAMgB,GAAMA,QAGjC,IAAK,IAAI/jD,EAAI+iD,EAAK/4B,IAAKhqB,EAAI+iD,EAAK/6C,IAAKhI,IAAK,CACtC,IAAI4F,EAAO5C,IACX8zC,EAAKiN,EAAKn+C,GACV+9C,EAAQtgC,EAAQ0/B,EAAKA,KAAMgB,GAAMn+C,GACjCm+C,EAAMn+C,EAGd,MAAO,CAACkxC,EAAKiN,IAEZ,GAAiB,QAAbhB,EAAK9/C,KACV,MAAO,CAAC6zC,EAAKnzC,OAAMhD,EAAWoiD,EAAK3jD,QAGnC,MAAM,IAAIklB,MAAM,qBA9ChB,IAAK,IAAItkB,EAAI,GAAIA,IAAK,CAClB,IAAI4F,EAAOyd,EAAQ0/B,EAAKc,MAAM7jD,GAAI2D,GAClC,GAAI3D,GAAK+iD,EAAKc,MAAM5jD,OAAS,EACzB,OAAO2F,EACX+9C,EAAQ/9C,EAAMjC,EAAOX,OAjSbkgD,CAAIH,IAEpB,OAiYR,SAA0BzgD,EAAOgD,GAC7B,IAAK,IAAItF,EAAI,EAAGgkD,EAAO,CAAC1hD,GAAQtC,EAAIgkD,EAAK/jD,OAAQD,IAAK,CAClD,IAAI6O,EAAQm1C,EAAKhkD,GAAIikD,GAAQp1C,EAAMkpC,SAAU5f,EAAQ,GACrD,IAAK,IAAI8B,EAAI,EAAGA,EAAIprB,EAAMjJ,KAAK3F,OAAQg6B,IAAK,CACxC,IAAI,KAAEh3B,EAAI,KAAE2C,GAASiJ,EAAMjJ,KAAKq0B,GAChC9B,EAAMt0B,KAAKZ,EAAKhE,OACZglD,GAAUhhD,EAAK80B,QAAU90B,EAAK8zC,qBAC9BkN,GAAO,IACgB,GAAvBD,EAAKv6B,QAAQ7jB,IACbo+C,EAAKngD,KAAK+B,GAEdq+C,GACA3+C,EAAO29C,IAAI,+BAAiC9qB,EAAM/2B,KAAK,MAAQ,mFA9YnE8iD,CAAiB5hD,EAAOgD,GACjBhD,EAMXw1C,UAAU70C,GACN,IAAK,IAAIjD,EAAI,EAAGA,EAAI6I,KAAKjD,KAAK3F,OAAQD,IAClC,GAAI6I,KAAKjD,KAAK5F,GAAGiD,MAAQA,EACrB,OAAO4F,KAAKjD,KAAK5F,GAAG4F,KAC5B,OAAO,KAMXw8C,cAAc+B,EAAM7jD,EAAQ,EAAGC,EAAM4jD,EAAK9d,YACtC,IAAI0d,EAAMl7C,KACV,IAAK,IAAI7I,EAAIM,EAAOyjD,GAAO/jD,EAAIO,EAAKP,IAChC+jD,EAAMA,EAAIjM,UAAUqM,EAAKj3B,MAAMltB,GAAGiD,MACtC,OAAO8gD,EAKPjL,oBACA,OAA2B,GAApBjwC,KAAKjD,KAAK3F,QAAe4I,KAAKjD,KAAK,GAAG3C,KAAKyoC,SAMlD8B,kBACA,IAAK,IAAIxtC,EAAI,EAAGA,EAAI6I,KAAKjD,KAAK3F,OAAQD,IAAK,CACvC,IAAI,KAAEiD,GAAS4F,KAAKjD,KAAK5F,GACzB,IAAMiD,EAAK80B,SAAU90B,EAAK8zC,mBACtB,OAAO9zC,EAEf,OAAO,KAKXmhD,WAAW9G,GACP,IAAK,IAAIt9C,EAAI,EAAGA,EAAI6I,KAAKjD,KAAK3F,OAAQD,IAClC,IAAK,IAAIi6B,EAAI,EAAGA,EAAIqjB,EAAM13C,KAAK3F,OAAQg6B,IACnC,GAAIpxB,KAAKjD,KAAK5F,GAAGiD,MAAQq6C,EAAM13C,KAAKq0B,GAAGh3B,KACnC,OAAO,EACnB,OAAO,EAUXohD,WAAWz4C,EAAO04C,GAAQ,EAAOx1C,EAAa,GAC1C,IAAI1D,EAAO,CAACvC,MAgBZ,OAfA,SAASsU,EAAO7a,EAAOmrC,GACnB,IAAI8W,EAAWjiD,EAAM8/C,cAAcx2C,EAAOkD,GAC1C,GAAIy1C,KAAcD,GAASC,EAASxM,UAChC,OAAOkF,EAASt5C,KAAK8pC,EAAMz9B,KAAIw0C,GAAMA,EAAG5rB,mBAC5C,IAAK,IAAI54B,EAAI,EAAGA,EAAIsC,EAAMsD,KAAK3F,OAAQD,IAAK,CACxC,IAAI,KAAEiD,EAAI,KAAE2C,GAAStD,EAAMsD,KAAK5F,GAChC,IAAMiD,EAAK80B,SAAU90B,EAAK8zC,qBAA8C,GAAvB3rC,EAAKqe,QAAQ7jB,GAAa,CACvEwF,EAAKvH,KAAK+B,GACV,IAAIi2C,EAAQ1+B,EAAOvX,EAAM6nC,EAAMvS,OAAOj4B,IACtC,GAAI44C,EACA,OAAOA,GAGnB,OAAO,KAEJ1+B,CAAOtU,KAAM,IAQxBgvC,aAAa94C,GACT,IAAK,IAAIiB,EAAI,EAAGA,EAAI6I,KAAK+5C,UAAU3iD,OAAQD,GAAK,EAC5C,GAAI6I,KAAK+5C,UAAU5iD,IAAMjB,EACrB,OAAO8J,KAAK+5C,UAAU5iD,EAAI,GAClC,IAAIykD,EAAW57C,KAAK67C,gBAAgB3lD,GAEpC,OADA8J,KAAK+5C,UAAU/+C,KAAK9E,EAAQ0lD,GACrBA,EAKXC,gBAAgB3lD,GACZ,IAAIqM,EAAOxN,OAAO8S,OAAO,MAAOi0C,EAAS,CAAC,CAAEriD,MAAOuG,KAAM5F,KAAM,KAAM2hD,IAAK,OAC1E,KAAOD,EAAO1kD,QAAQ,CAClB,IAAIuF,EAAUm/C,EAAOv1C,QAAS9M,EAAQkD,EAAQlD,MAC9C,GAAIA,EAAMw1C,UAAU/4C,GAAS,CACzB,IAAI0B,EAAS,GACb,IAAK,IAAIhC,EAAM+G,EAAS/G,EAAIwE,KAAMxE,EAAMA,EAAImmD,IACxCnkD,EAAOoD,KAAKpF,EAAIwE,MACpB,OAAOxC,EAAOokD,UAElB,IAAK,IAAI7kD,EAAI,EAAGA,EAAIsC,EAAMsD,KAAK3F,OAAQD,IAAK,CACxC,IAAI,KAAEiD,EAAI,KAAE2C,GAAStD,EAAMsD,KAAK5F,GAC3BiD,EAAKo6C,QAAWp6C,EAAK8zC,oBAAwB9zC,EAAKhE,QAAQmM,GAAW5F,EAAQvC,OAAQ2C,EAAKmyC,WAC3F4M,EAAO9gD,KAAK,CAAEvB,MAAOW,EAAKk/C,aAAcl/C,OAAM2hD,IAAKp/C,IACnD4F,EAAKnI,EAAKhE,OAAQ,IAI9B,OAAO,KAMP43C,gBACA,OAAOhuC,KAAKjD,KAAK3F,OAMrB62C,KAAKjgB,GACD,GAAIA,GAAKhuB,KAAKjD,KAAK3F,OACf,MAAM,IAAI29C,WAAW,cAAc/mB,kCACvC,OAAOhuB,KAAKjD,KAAKixB,GAKrB74B,WACI,IAAIoN,EAAO,GAQX,OAPA,SAASkrC,EAAKlc,GACVhvB,EAAKvH,KAAKu2B,GACV,IAAK,IAAIp6B,EAAI,EAAGA,EAAIo6B,EAAEx0B,KAAK3F,OAAQD,KACM,GAAjCoL,EAAKqe,QAAQ2Q,EAAEx0B,KAAK5F,GAAG4F,OACvB0wC,EAAKlc,EAAEx0B,KAAK5F,GAAG4F,MAE3B0wC,CAAKztC,MACEuC,EAAK4E,KAAI,CAACoqB,EAAGp6B,KAChB,IAAIujD,EAAMvjD,GAAKo6B,EAAE2d,SAAW,IAAM,KAAO,IACzC,IAAK,IAAI/3C,EAAI,EAAGA,EAAIo6B,EAAEx0B,KAAK3F,OAAQD,IAC/BujD,IAAQvjD,EAAI,KAAO,IAAMo6B,EAAEx0B,KAAK5F,GAAGiD,KAAKhE,KAAO,KAAOmM,EAAKqe,QAAQ2Q,EAAEx0B,KAAK5F,GAAG4F,MACjF,OAAO29C,KACRniD,KAAK,OAMhBuhD,EAAaja,MAAQ,IAAIia,GAAa,GACtC,MAAMG,EACFjkD,YAAYsB,EAAQ0iD,GAChBh6C,KAAK1I,OAASA,EACd0I,KAAKg6C,UAAYA,EACjBh6C,KAAKoiC,OAAS,KACdpiC,KAAKoV,IAAM,EACXpV,KAAKi8C,OAAS3kD,EAAOC,MAAM,kBACgB,IAAvCyI,KAAKi8C,OAAOj8C,KAAKi8C,OAAO7kD,OAAS,IACjC4I,KAAKi8C,OAAO7+C,MACM,IAAlB4C,KAAKi8C,OAAO,IACZj8C,KAAKi8C,OAAO11C,QAEhBxJ,WAAS,OAAOiD,KAAKi8C,OAAOj8C,KAAKoV,KACrC8mC,IAAIC,GAAO,OAAOn8C,KAAKjD,MAAQo/C,IAAQn8C,KAAKoV,QAAS,GACrDglC,IAAIhC,GAAO,MAAM,IAAIgE,YAAYhE,EAAM,4BAA8Bp4C,KAAK1I,OAAS,OAEvF,SAAS6iD,EAAU19C,GACf,IAAIu+C,EAAQ,GACZ,GACIA,EAAMhgD,KAAKqhD,EAAa5/C,UACnBA,EAAOy/C,IAAI,MACpB,OAAuB,GAAhBlB,EAAM5jD,OAAc4jD,EAAM,GAAK,CAAE5gD,KAAM,SAAU4gD,SAE5D,SAASqB,EAAa5/C,GAClB,IAAIu+C,EAAQ,GACZ,GACIA,EAAMhgD,KAAKshD,EAAmB7/C,UACzBA,EAAOM,MAAuB,KAAfN,EAAOM,MAA8B,KAAfN,EAAOM,MACrD,OAAuB,GAAhBi+C,EAAM5jD,OAAc4jD,EAAM,GAAK,CAAE5gD,KAAM,MAAO4gD,SAEzD,SAASsB,EAAmB7/C,GACxB,IAAIy9C,EAgDR,SAAuBz9C,GACnB,GAAIA,EAAOy/C,IAAI,KAAM,CACjB,IAAIhC,EAAOC,EAAU19C,GAGrB,OAFKA,EAAOy/C,IAAI,MACZz/C,EAAO29C,IAAI,yBACRF,EAEN,IAAK,KAAKvhD,KAAK8D,EAAOM,MAAO,CAC9B,IAAIi+C,EAtBZ,SAAqBv+C,EAAQrG,GACzB,IAAIwuC,EAAQnoC,EAAOu9C,UAAW5/C,EAAOwqC,EAAMxuC,GAC3C,GAAIgE,EACA,MAAO,CAACA,GACZ,IAAIxC,EAAS,GACb,IAAK,IAAI2kD,KAAY3X,EAAO,CACxB,IAAIxqC,EAAOwqC,EAAM2X,GACbniD,EAAK6mC,OAAOrgB,QAAQxqB,IAAS,GAC7BwB,EAAOoD,KAAKZ,GAEC,GAAjBxC,EAAOR,QACPqF,EAAO29C,IAAI,0BAA4BhkD,EAAO,WAClD,OAAOwB,EAUS4kD,CAAY//C,EAAQA,EAAOM,MAAMoK,KAAI/M,IACxB,MAAjBqC,EAAO2lC,OACP3lC,EAAO2lC,OAAShoC,EAAKyoC,SAChBpmC,EAAO2lC,QAAUhoC,EAAKyoC,UAC3BpmC,EAAO29C,IAAI,mCACR,CAAEhgD,KAAM,OAAQ7D,MAAO6D,MAGlC,OADAqC,EAAO2Y,MACgB,GAAhB4lC,EAAM5jD,OAAc4jD,EAAM,GAAK,CAAE5gD,KAAM,SAAU4gD,SAGxDv+C,EAAO29C,IAAI,qBAAuB39C,EAAOM,KAAO,KAnEzC0/C,CAAchgD,GACzB,OACI,GAAIA,EAAOy/C,IAAI,KACXhC,EAAO,CAAE9/C,KAAM,OAAQ8/C,aACtB,GAAIz9C,EAAOy/C,IAAI,KAChBhC,EAAO,CAAE9/C,KAAM,OAAQ8/C,aACtB,GAAIz9C,EAAOy/C,IAAI,KAChBhC,EAAO,CAAE9/C,KAAM,MAAO8/C,YACrB,KAAIz9C,EAAOy/C,IAAI,KAGhB,MAFAhC,EAAOwC,EAAejgD,EAAQy9C,GAItC,OAAOA,EAEX,SAASyC,EAASlgD,GACV,KAAK9D,KAAK8D,EAAOM,OACjBN,EAAO29C,IAAI,yBAA2B39C,EAAOM,KAAO,KACxD,IAAInF,EAASyH,OAAO5C,EAAOM,MAE3B,OADAN,EAAO2Y,MACAxd,EAEX,SAAS8kD,EAAejgD,EAAQy9C,GAC5B,IAAI/4B,EAAMw7B,EAASlgD,GAAS0C,EAAMgiB,EASlC,OARI1kB,EAAOy/C,IAAI,OAEP/8C,EADe,KAAf1C,EAAOM,KACD4/C,EAASlgD,IAER,GAEVA,EAAOy/C,IAAI,MACZz/C,EAAO29C,IAAI,yBACR,CAAEhgD,KAAM,QAAS+mB,MAAKhiB,MAAK+6C,QAoHtC,SAASU,EAAI53B,EAAGC,GAAK,OAAOA,EAAID,EAIhC,SAASw3B,EAASH,EAAKlgD,GACnB,IAAIvC,EAAS,GAEb,OACA,SAAS61C,EAAKtzC,GACV,IAAI4gD,EAAQV,EAAIlgD,GAChB,GAAoB,GAAhB4gD,EAAM3jD,SAAgB2jD,EAAM,GAAGJ,KAC/B,OAAOlN,EAAKsN,EAAM,GAAGjb,IACzBloC,EAAOoD,KAAKb,GACZ,IAAK,IAAIhD,EAAI,EAAGA,EAAI4jD,EAAM3jD,OAAQD,IAAK,CACnC,IAAI,KAAEwjD,EAAI,GAAE7a,GAAOib,EAAM5jD,GACpBwjD,IAA+B,GAAvB/iD,EAAOgpB,QAAQkf,IACxB2N,EAAK3N,IAVjB2N,CAAKtzC,GACEvC,EAAO2sB,KAAKq2B,GAiEvB,SAAS/B,EAAa9pB,GAClB,IAAI6tB,EAAW7nD,OAAO8S,OAAO,MAC7B,IAAK,IAAIg1C,KAAY9tB,EAAO,CACxB,IAAI+tB,EAAO/tB,EAAM8tB,GACjB,IAAKC,EAAKC,WACN,OAAO,KACXH,EAASC,GAAYC,EAAK/d,QAE9B,OAAO6d,EAEX,SAASI,EAAajuB,EAAOx4B,GACzB,IAAI0mD,EAAQloD,OAAO8S,OAAO,MAC1B,IAAK,IAAIzR,KAAQ24B,EAAO,CACpB,IAAImuB,EAAQ3mD,GAASA,EAAMH,GAC3B,QAAc0B,IAAVolD,EAAqB,CACrB,IAAIJ,EAAO/tB,EAAM34B,GACjB,IAAI0mD,EAAKC,WAGL,MAAM,IAAIhI,WAAW,mCAAqC3+C,GAF1D8mD,EAAQJ,EAAK/d,QAIrBke,EAAM7mD,GAAQ8mD,EAElB,OAAOD,EAEX,SAASE,EAAUpuB,GACf,IAAIn3B,EAAS7C,OAAO8S,OAAO,MAC3B,GAAIknB,EACA,IAAK,IAAI34B,KAAQ24B,EACbn3B,EAAOxB,GAAQ,IAAIgnD,EAAUruB,EAAM34B,IAC3C,OAAOwB,EAQX,MAAMylD,EAIFrnD,YAIAI,EAIAi5B,EAIAI,GACIzvB,KAAK5J,KAAOA,EACZ4J,KAAKqvB,OAASA,EACdrvB,KAAKyvB,KAAOA,EAKZzvB,KAAKs9C,QAAU,KACft9C,KAAKihC,OAASxR,EAAKnf,MAAQmf,EAAKnf,MAAM/Y,MAAM,KAAO,GACnDyI,KAAK+uB,MAAQouB,EAAU1tB,EAAKV,OAC5B/uB,KAAK64C,aAAeA,EAAa74C,KAAK+uB,OACtC/uB,KAAKs5C,aAAe,KACpBt5C,KAAKiwC,cAAgB,KACrBjwC,KAAKikC,UAAYxU,EAAK2S,QAAkB,QAARhsC,GAChC4J,KAAKkvB,OAAiB,QAAR94B,EAKdysC,eAAa,OAAQ7iC,KAAKikC,QAK1BO,kBAAgB,OAAOxkC,KAAKikC,SAAWjkC,KAAKiwC,cAI5CuE,aAAW,OAAOx0C,KAAKs5C,cAAgBQ,EAAaja,MAKpD0N,aAAW,OAAOvtC,KAAKw0C,UAAYx0C,KAAKyvB,KAAK8S,KAI7Cgb,iBACA,OAAOv9C,KAAKyvB,KAAK8tB,aAAev9C,KAAKyvB,KAAK9xB,KAAO,MAAQ,UAK7DuwC,mBACI,IAAK,IAAIlgB,KAAKhuB,KAAK+uB,MACf,GAAI/uB,KAAK+uB,MAAMf,GAAGwvB,WACd,OAAO,EACf,OAAO,EAMX5O,kBAAkB6F,GACd,OAAOz0C,MAAQy0C,GAASz0C,KAAKs5C,aAAaiC,WAAW9G,EAAM6E,cAK/D0D,aAAajuB,GACT,OAAKA,GAAS/uB,KAAK64C,aACR74C,KAAK64C,aAELmE,EAAah9C,KAAK+uB,MAAOA,GAUxClnB,OAAOknB,EAAQ,KAAMnvB,EAASwvB,GAC1B,GAAIpvB,KAAKkvB,OACL,MAAM,IAAIzT,MAAM,8CACpB,OAAO,IAAIk9B,EAAK34C,KAAMA,KAAKg9C,aAAajuB,GAAQqlB,EAASt5C,KAAK8E,GAAU61C,EAAKgI,QAAQruB,IAOzFsuB,cAAc3uB,EAAQ,KAAMnvB,EAASwvB,GAGjC,OAFAxvB,EAAUw0C,EAASt5C,KAAK8E,GACxBI,KAAKy3C,aAAa73C,GACX,IAAI+4C,EAAK34C,KAAMA,KAAKg9C,aAAajuB,GAAQnvB,EAAS61C,EAAKgI,QAAQruB,IAU1EW,cAAchB,EAAQ,KAAMnvB,EAASwvB,GAGjC,GAFAL,EAAQ/uB,KAAKg9C,aAAajuB,IAC1BnvB,EAAUw0C,EAASt5C,KAAK8E,IACZL,KAAM,CACd,IAAIzB,EAASkC,KAAKs5C,aAAakC,WAAW57C,GAC1C,IAAK9B,EACD,OAAO,KACX8B,EAAU9B,EAAO0gC,OAAO5+B,GAE5B,IAAI+9C,EAAU39C,KAAKs5C,aAAaC,cAAc35C,GAC1CmD,EAAQ46C,GAAWA,EAAQnC,WAAWpH,EAASvU,OAAO,GAC1D,OAAK98B,EAEE,IAAI41C,EAAK34C,KAAM+uB,EAAOnvB,EAAQ4+B,OAAOz7B,GAAQ0yC,EAAKgI,QAAQruB,IADtD,KAOfwuB,aAAah+C,GACT,IAAIhI,EAASoI,KAAKs5C,aAAaC,cAAc35C,GAC7C,IAAKhI,IAAWA,EAAOs3C,SACnB,OAAO,EACX,IAAK,IAAI/3C,EAAI,EAAGA,EAAIyI,EAAQ49B,WAAYrmC,IACpC,IAAK6I,KAAK05C,YAAY95C,EAAQykB,MAAMltB,GAAGi4B,OACnC,OAAO,EACf,OAAO,EAOXqoB,aAAa73C,GACT,IAAKI,KAAK49C,aAAah+C,GACnB,MAAM,IAAIm1C,WAAW,4BAA4B/0C,KAAK5J,SAASwJ,EAAQzK,WAAWqD,MAAM,EAAG,OAKnG03C,eAAenG,GACX,OAAuB,MAAhB/pC,KAAKs9C,SAAmBt9C,KAAKs9C,QAAQ18B,QAAQmpB,IAAa,EAKrE2P,YAAYtqB,GACR,GAAoB,MAAhBpvB,KAAKs9C,QACL,OAAO,EACX,IAAK,IAAInmD,EAAI,EAAGA,EAAIi4B,EAAMh4B,OAAQD,IAC9B,IAAK6I,KAAKkwC,eAAe9gB,EAAMj4B,GAAGiD,MAC9B,OAAO,EACf,OAAO,EAKXyjD,aAAazuB,GACT,GAAoB,MAAhBpvB,KAAKs9C,QACL,OAAOluB,EACX,IAAIr4B,EACJ,IAAK,IAAII,EAAI,EAAGA,EAAIi4B,EAAMh4B,OAAQD,IACzB6I,KAAKkwC,eAAe9gB,EAAMj4B,GAAGiD,MAIzBrD,GACLA,EAAKiE,KAAKo0B,EAAMj4B,IAJXJ,IACDA,EAAOq4B,EAAM52B,MAAM,EAAGrB,IAMlC,OAAQJ,EAAeA,EAAKK,OAASL,EAAO0+C,EAAKz3B,KAAlCoR,EAKnBJ,eAAeM,EAAOD,GAClB,IAAIz3B,EAAS7C,OAAO8S,OAAO,MAC3BynB,EAAMkB,SAAQ,CAACp6B,EAAMq5B,IAAS73B,EAAOxB,GAAQ,IAAIinD,EAASjnD,EAAMi5B,EAAQI,KACxE,IAAIquB,EAAUzuB,EAAOI,KAAKsuB,SAAW,MACrC,IAAKnmD,EAAOkmD,GACR,MAAM,IAAI/I,WAAW,yCAA2C+I,EAAU,MAC9E,IAAKlmD,EAAOqM,KACR,MAAM,IAAI8wC,WAAW,oCACzB,IAAK,IAAIpuC,KAAK/O,EAAOqM,KAAK8qB,MACtB,MAAM,IAAIgmB,WAAW,iDACzB,OAAOn9C,GAIf,MAAMwlD,EACFpnD,YAAYG,GACR6J,KAAK+8C,WAAahoD,OAAOC,UAAUC,eAAeS,KAAKS,EAAS,WAChE6J,KAAK++B,QAAU5oC,EAAQ4oC,QAEvBye,iBACA,OAAQx9C,KAAK+8C,YAUrB,MAAMiB,EAIFhoD,YAIAI,EAIA8qB,EAIAmO,EAIAI,GACIzvB,KAAK5J,KAAOA,EACZ4J,KAAKkhB,KAAOA,EACZlhB,KAAKqvB,OAASA,EACdrvB,KAAKyvB,KAAOA,EACZzvB,KAAK+uB,MAAQouB,EAAU1tB,EAAKV,OAC5B/uB,KAAKi+C,SAAW,KAChB,IAAIrB,EAAW/D,EAAa74C,KAAK+uB,OACjC/uB,KAAKk+C,SAAWtB,EAAW,IAAInH,EAAKz1C,KAAM48C,GAAY,KAO1D/0C,OAAOknB,EAAQ,MACX,OAAKA,GAAS/uB,KAAKk+C,SACRl+C,KAAKk+C,SACT,IAAIzI,EAAKz1C,KAAMg9C,EAAah9C,KAAK+uB,MAAOA,IAKnDC,eAAeI,EAAOC,GAClB,IAAIz3B,EAAS7C,OAAO8S,OAAO,MAAOqZ,EAAO,EAEzC,OADAkO,EAAMoB,SAAQ,CAACp6B,EAAMq5B,IAAS73B,EAAOxB,GAAQ,IAAI4nD,EAAS5nD,EAAM8qB,IAAQmO,EAAQI,KACzE73B,EAMXw4B,cAAc9B,GACV,IAAK,IAAIn3B,EAAI,EAAGA,EAAIm3B,EAAIl3B,OAAQD,IACxBm3B,EAAIn3B,GAAGiD,MAAQ4F,OACfsuB,EAAMA,EAAI91B,MAAM,EAAGrB,GAAGk7B,OAAO/D,EAAI91B,MAAMrB,EAAI,IAC3CA,KAER,OAAOm3B,EAKXgE,QAAQhE,GACJ,IAAK,IAAIn3B,EAAI,EAAGA,EAAIm3B,EAAIl3B,OAAQD,IAC5B,GAAIm3B,EAAIn3B,GAAGiD,MAAQ4F,KACf,OAAOsuB,EAAIn3B,GAMvBw+C,SAASlB,GACL,OAAOz0C,KAAKi+C,SAASr9B,QAAQ6zB,IAAU,GAY/C,MAAM0J,EAIFnoD,YAAYy5B,GAMRzvB,KAAKu4C,OAASxjD,OAAO8S,OAAO,MAC5B,IAAIu2C,EAAep+C,KAAKyvB,KAAO,GAC/B,IAAK,IAAI7F,KAAQ6F,EACb2uB,EAAax0B,GAAQ6F,EAAK7F,GAC9Bw0B,EAAa9uB,MAAQ,OAAgBG,EAAKH,OACtC8uB,EAAahvB,MAAQ,OAAgBK,EAAKL,OAAS,IACnDpvB,KAAKsvB,MAAQ+tB,EAAS7iC,QAAQxa,KAAKyvB,KAAKH,MAAOtvB,MACnDA,KAAKovB,MAAQ4uB,EAASxjC,QAAQxa,KAAKyvB,KAAKL,MAAOpvB,MAC/C,IAAIq+C,EAAmBtpD,OAAO8S,OAAO,MACrC,IAAK,IAAI+hB,KAAQ5pB,KAAKsvB,MAAO,CACzB,GAAI1F,KAAQ5pB,KAAKovB,MACb,MAAM,IAAI2lB,WAAWnrB,EAAO,sCAChC,IAAIxvB,EAAO4F,KAAKsvB,MAAM1F,GAAO00B,EAAclkD,EAAKq1B,KAAK7vB,SAAW,GAAI2+C,EAAWnkD,EAAKq1B,KAAKL,MACzFh1B,EAAKk/C,aAAe+E,EAAiBC,KAChCD,EAAiBC,GAAexE,EAAa3lC,MAAMmqC,EAAat+C,KAAKsvB,QAC1El1B,EAAK61C,cAAgB71C,EAAKk/C,aAAarJ,cACvC71C,EAAKkjD,QAAsB,KAAZiB,EAAkB,KAC7BA,EAAWC,EAAYx+C,KAAMu+C,EAAShnD,MAAM,MAC5B,IAAZgnD,GAAmBnkD,EAAK61C,cAAqB,KAAL,GAEpD,IAAK,IAAIrmB,KAAQ5pB,KAAKovB,MAAO,CACzB,IAAIh1B,EAAO4F,KAAKovB,MAAMxF,GAAO60B,EAAOrkD,EAAKq1B,KAAKkmB,SAC9Cv7C,EAAK6jD,SAAmB,MAARQ,EAAe,CAACrkD,GAAgB,IAARqkD,EAAa,GAAKD,EAAYx+C,KAAMy+C,EAAKlnD,MAAM,MAE3FyI,KAAKs1C,aAAet1C,KAAKs1C,aAAaoJ,KAAK1+C,MAC3CA,KAAK45C,aAAe55C,KAAK45C,aAAa8E,KAAK1+C,MAC3CA,KAAK2+C,YAAc3+C,KAAKsvB,MAAMtvB,KAAKyvB,KAAKsuB,SAAW,OACnD/9C,KAAKu4C,OAAOqG,UAAY7pD,OAAO8S,OAAO,MAQ1C1N,KAAKC,EAAM20B,EAAQ,KAAMnvB,EAASwvB,GAC9B,GAAmB,iBAARh1B,EACPA,EAAO4F,KAAKmrC,SAAS/wC,OACpB,MAAMA,aAAgBijD,GACvB,MAAM,IAAItI,WAAW,sBAAwB36C,GAC5C,GAAIA,EAAKi1B,QAAUrvB,KACpB,MAAM,IAAI+0C,WAAW,yCAA2C36C,EAAKhE,KAAO,KAChF,OAAOgE,EAAKsjD,cAAc3uB,EAAOnvB,EAASwvB,GAM9CnrB,KAAKA,EAAMmrB,GACP,IAAIh1B,EAAO4F,KAAKsvB,MAAMrrB,KACtB,OAAO,IAAI41C,EAASz/C,EAAMA,EAAKy+C,aAAc50C,EAAMwxC,EAAKgI,QAAQruB,IAKpE+P,KAAK/kC,EAAM20B,GAGP,MAFmB,iBAAR30B,IACPA,EAAO4F,KAAKovB,MAAMh1B,IACfA,EAAKyN,OAAOknB,GAMvBumB,aAAaM,GACT,OAAO+C,EAAKtC,SAASr2C,KAAM41C,GAM/BgE,aAAahE,GACT,OAAOH,EAAKY,SAASr2C,KAAM41C,GAK/BzK,SAAS/0C,GACL,IAAI48C,EAAQhzC,KAAKsvB,MAAMl5B,GACvB,IAAK48C,EACD,MAAM,IAAI+B,WAAW,sBAAwB3+C,GACjD,OAAO48C,GAGf,SAASwL,EAAYnvB,EAAQD,GACzB,IAAI4jB,EAAQ,GACZ,IAAK,IAAI77C,EAAI,EAAGA,EAAIi4B,EAAMh4B,OAAQD,IAAK,CACnC,IAAIf,EAAOg5B,EAAMj4B,GAAIgoC,EAAO9P,EAAOD,MAAMh5B,GAAO8I,EAAKigC,EACrD,GAAIA,EACA6T,EAAMh4C,KAAKmkC,QAGX,IAAK,IAAIvV,KAAQyF,EAAOD,MAAO,CAC3B,IAAI+P,EAAO9P,EAAOD,MAAMxF,IACZ,KAARxzB,GAAgB+oC,EAAK1P,KAAKnf,OAAS6uB,EAAK1P,KAAKnf,MAAM/Y,MAAM,KAAKqpB,QAAQxqB,IAAS,IAC/E48C,EAAMh4C,KAAKkE,EAAKigC,GAG5B,IAAKjgC,EACD,MAAM,IAAIk9C,YAAY,uBAAyBhtB,EAAMj4B,GAAK,KAElE,OAAO67C,EAQX,MAAM6L,EAKF7oD,YAIAq5B,EAKA+F,GACIp1B,KAAKqvB,OAASA,EACdrvB,KAAKo1B,MAAQA,EAIbp1B,KAAK8+C,KAAO,GAIZ9+C,KAAK++C,OAAS,GACd3pB,EAAM5E,SAAQzQ,IACNA,EAAKif,IACLh/B,KAAK8+C,KAAK9jD,KAAK+kB,GACVA,EAAKkC,OACVjiB,KAAK++C,OAAO/jD,KAAK+kB,MAGzB/f,KAAKg/C,gBAAkBh/C,KAAK8+C,KAAKx8B,MAAK4L,IAClC,IAAK,aAAav1B,KAAKu1B,EAAE8Q,OAAS9Q,EAAE/zB,KAChC,OAAO,EACX,IAAIA,EAAOk1B,EAAOC,MAAMpB,EAAE/zB,MAC1B,OAAOA,EAAKm/C,aAAarK,UAAU90C,MAM3Cga,MAAM2gB,EAAK3+B,EAAU,IACjB,IAAI+F,EAAU,IAAI+iD,GAAaj/C,KAAM7J,GAAS,GAE9C,OADA+F,EAAQgjD,OAAOpqB,EAAK3+B,EAAQ2E,KAAM3E,EAAQ2pC,IACnC5jC,EAAQijD,SAUnBC,WAAWtqB,EAAK3+B,EAAU,IACtB,IAAI+F,EAAU,IAAI+iD,GAAaj/C,KAAM7J,GAAS,GAE9C,OADA+F,EAAQgjD,OAAOpqB,EAAK3+B,EAAQ2E,KAAM3E,EAAQ2pC,IACnCgW,EAAMuJ,QAAQnjD,EAAQijD,UAKjCG,SAASxqB,EAAK54B,EAAS6G,GACnB,IAAK,IAAI5L,EAAI4L,EAAQ/C,KAAK8+C,KAAKl+B,QAAQ7d,GAAS,EAAI,EAAG5L,EAAI6I,KAAK8+C,KAAK1nD,OAAQD,IAAK,CAC9E,IAAI4oB,EAAO/f,KAAK8+C,KAAK3nD,GACrB,GAAIooD,GAAQzqB,EAAK/U,EAAKif,YACElnC,IAAnBioB,EAAKmL,WAA2B4J,EAAI0qB,cAAgBz/B,EAAKmL,cACxDnL,EAAK7jB,SAAWA,EAAQujD,eAAe1/B,EAAK7jB,UAAW,CACzD,GAAI6jB,EAAKkf,SAAU,CACf,IAAIrnC,EAASmoB,EAAKkf,SAASnK,GAC3B,IAAe,IAAXl9B,EACA,SACJmoB,EAAKgP,MAAQn3B,QAAUE,EAE3B,OAAOioB,IAOnB2/B,WAAW91B,EAAMrzB,EAAO2F,EAAS6G,GAC7B,IAAK,IAAI5L,EAAI4L,EAAQ/C,KAAK++C,OAAOn+B,QAAQ7d,GAAS,EAAI,EAAG5L,EAAI6I,KAAK++C,OAAO3nD,OAAQD,IAAK,CAClF,IAAI4oB,EAAO/f,KAAK++C,OAAO5nD,GAAI8qB,EAAQlC,EAAKkC,MACxC,KAA2B,GAAvBA,EAAMrB,QAAQgJ,IACd7J,EAAK7jB,UAAYA,EAAQujD,eAAe1/B,EAAK7jB,UAI7C+lB,EAAM7qB,OAASwyB,EAAKxyB,SACkB,IAAjC6qB,EAAMvd,WAAWklB,EAAKxyB,SAAiB6qB,EAAMzpB,MAAMoxB,EAAKxyB,OAAS,IAAMb,IANhF,CAQA,GAAIwpB,EAAKkf,SAAU,CACf,IAAIrnC,EAASmoB,EAAKkf,SAAS1oC,GAC3B,IAAe,IAAXqB,EACA,SACJmoB,EAAKgP,MAAQn3B,QAAUE,EAE3B,OAAOioB,IAMfiP,mBAAmBK,GACf,IAAIz3B,EAAS,GACb,SAASyrC,EAAOtjB,GACZ,IAAI8R,EAA4B,MAAjB9R,EAAK8R,SAAmB,GAAK9R,EAAK8R,SAAU16B,EAAI,EAC/D,KAAOA,EAAIS,EAAOR,OAAQD,IAAK,CAC3B,IAAI4F,EAAOnF,EAAOT,GAClB,IADsD,MAAjB4F,EAAK80B,SAAmB,GAAK90B,EAAK80B,UACpDA,EACf,MAERj6B,EAAO4C,OAAOrD,EAAG,EAAG4oB,GAExB,IAAK,IAAI3pB,KAAQi5B,EAAOD,MAAO,CAC3B,IAAIgG,EAAQ/F,EAAOD,MAAMh5B,GAAMq5B,KAAKkE,SAChCyB,GACAA,EAAM5E,SAAQzQ,IACVsjB,EAAOtjB,EAAOhpB,GAAKgpB,IACbA,EAAKof,MAAQpf,EAAK4/B,QAAU5/B,EAAK6/B,YACnC7/B,EAAKof,KAAO/oC,MAG5B,IAAK,IAAIA,KAAQi5B,EAAOC,MAAO,CAC3B,IAAI8F,EAAQ/F,EAAOC,MAAMl5B,GAAMq5B,KAAKkE,SAChCyB,GACAA,EAAM5E,SAAQzQ,IACVsjB,EAAOtjB,EAAOhpB,GAAKgpB,IACbA,EAAK5lB,MAAQ4lB,EAAK4/B,QAAU5/B,EAAKof,OACnCpf,EAAK5lB,KAAO/D,MAG5B,OAAOwB,EAOXo3B,kBAAkBK,GACd,OAAOA,EAAOkpB,OAAOsH,YAChBxwB,EAAOkpB,OAAOsH,UAAY,IAAIhB,EAAUxvB,EAAQwvB,EAAUiB,YAAYzwB,MAGnF,MAAM0wB,EAAY,CACdC,SAAS,EAAMC,SAAS,EAAMC,OAAO,EAAM//B,YAAY,EAAMggC,QAAQ,EACrEC,IAAI,EAAMC,KAAK,EAAMC,IAAI,EAAMC,UAAU,EAAMC,YAAY,EAAMC,QAAQ,EACzEC,QAAQ,EAAMC,MAAM,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EACtEC,IAAI,EAAMC,QAAQ,EAAMC,QAAQ,EAAMC,IAAI,EAAMC,IAAI,EAAMC,UAAU,EAAMC,IAAI,EAC9El8B,QAAQ,EAAMqF,GAAG,EAAMoX,KAAK,EAAM0f,SAAS,EAAMC,OAAO,EAAMC,OAAO,EAAMC,IAAI,GAE7EC,EAAa,CACft7C,MAAM,EAAMg7C,UAAU,EAAMO,QAAQ,EAAMC,QAAQ,EAAM7/B,OAAO,EAAMpG,OAAO,GAE1EkmC,GAAW,CAAER,IAAI,EAAMI,IAAI,GAGjC,SAASK,GAAa5nD,EAAM4nC,EAAoBxtB,GAC5C,OAA0B,MAAtBwtB,GACQA,EAHQ,EAG+B,IACnB,SAAvBA,EAJqC,EAIkB,GACzD5nC,GAA2B,OAAnBA,EAAKmjD,WAAsB0E,GAAgD,EAAPztC,EAEvF,MAAM0tC,GACFlsD,YAAYoE,EAAM20B,EAElBK,EAEA+yB,EAAcC,EAAO3oD,EAAOtD,GACxB6J,KAAK5F,KAAOA,EACZ4F,KAAK+uB,MAAQA,EACb/uB,KAAKovB,MAAQA,EACbpvB,KAAKmiD,aAAeA,EACpBniD,KAAKoiD,MAAQA,EACbpiD,KAAK7J,QAAUA,EACf6J,KAAKJ,QAAU,GAEfI,KAAKqiD,YAAc5M,EAAKz3B,KAExBhe,KAAKsiD,WAAa,GAClBtiD,KAAKvG,MAAQA,IAxBgD,EAwBtCtD,EAA0B,KAAOiE,EAAKk/C,cAEjEtK,aAAa70C,GACT,IAAK6F,KAAKvG,MAAO,CACb,IAAKuG,KAAK5F,KACN,MAAO,GACX,IAAIymC,EAAO7gC,KAAK5F,KAAKk/C,aAAakC,WAAWpH,EAASt5C,KAAKX,IAC3D,IAAI0mC,EAGC,CACD,IAAoChb,EAAhCpuB,EAAQuI,KAAK5F,KAAKk/C,aACtB,OAAIzzB,EAAOpuB,EAAMu3C,aAAa70C,EAAKC,QAC/B4F,KAAKvG,MAAQhC,EACNouB,GAGA,KATX7lB,KAAKvG,MAAQuG,KAAK5F,KAAKk/C,aAAaC,cAAc1Y,GAa1D,OAAO7gC,KAAKvG,MAAMu1C,aAAa70C,EAAKC,MAExC+kD,OAAOnJ,GACH,KAhDgB,EAgDVh2C,KAAK7J,SAA4B,CACnC,IAAkDo7B,EAA9CmjB,EAAO10C,KAAKJ,QAAQI,KAAKJ,QAAQxI,OAAS,GAC9C,GAAIs9C,GAAQA,EAAKxlB,SAAWqC,EAAI,oBAAoBrU,KAAKw3B,EAAKzwC,OAAQ,CAClE,IAAIA,EAAOywC,EACPA,EAAKzwC,KAAK7M,QAAUm6B,EAAE,GAAGn6B,OACzB4I,KAAKJ,QAAQxC,MAEb4C,KAAKJ,QAAQI,KAAKJ,QAAQxI,OAAS,GAAK6M,EAAK0wC,SAAS1wC,EAAKA,KAAKzL,MAAM,EAAGyL,EAAKA,KAAK7M,OAASm6B,EAAE,GAAGn6B,UAG7G,IAAIwI,EAAUw0C,EAASt5C,KAAKkF,KAAKJ,SAGjC,OAFKo2C,GAAWh2C,KAAKvG,QACjBmG,EAAUA,EAAQ4+B,OAAOx+B,KAAKvG,MAAM+hD,WAAWpH,EAASvU,OAAO,KAC5D7/B,KAAK5F,KAAO4F,KAAK5F,KAAKyN,OAAO7H,KAAK+uB,MAAOnvB,EAASI,KAAKovB,OAASxvB,EAE3E2iD,iBAAiBpjB,GACb,IAAK,IAAIhoC,EAAI6I,KAAKsiD,WAAWlrD,OAAS,EAAGD,GAAK,EAAGA,IAC7C,GAAIgoC,EAAK2V,GAAG90C,KAAKsiD,WAAWnrD,IACxB,OAAO6I,KAAKsiD,WAAW9nD,OAAOrD,EAAG,GAAG,GAEhDqrD,aAAa/d,GACT,IAAK,IAAIttC,EAAI,EAAGsrD,EAAUziD,KAAKmiD,aAAchrD,EAAIsrD,EAAQrrD,OAAQD,IAAK,CAClE,IAAIgoC,EAAOsjB,EAAQtrD,IACd6I,KAAK5F,KAAO4F,KAAK5F,KAAK81C,eAAe/Q,EAAK/kC,MAAQsoD,GAAavjB,EAAK/kC,KAAMqqC,MAC1EtF,EAAK7M,QAAQtyB,KAAKqiD,eACnBriD,KAAKqiD,YAAcljB,EAAKjP,SAASlwB,KAAKqiD,aACtCriD,KAAKmiD,aAAehjB,EAAK/O,cAAcpwB,KAAKmiD,gBAIxDQ,cAAcxoD,GACV,OAAI6F,KAAK5F,KACE4F,KAAK5F,KAAK61C,cACjBjwC,KAAKJ,QAAQxI,OACN4I,KAAKJ,QAAQ,GAAGijC,SACpB1oC,EAAKq8B,aAAeupB,EAAU9qD,eAAekF,EAAKq8B,WAAWosB,SAASjpD,gBAGrF,MAAMslD,GACFjpD,YAEAsG,EAEAnG,EAAS0sD,GACL7iD,KAAK1D,OAASA,EACd0D,KAAK7J,QAAUA,EACf6J,KAAK6iD,OAASA,EACd7iD,KAAKgJ,KAAO,EACZ,IAA+B85C,EAA3B/E,EAAU5nD,EAAQ4nD,QAClBgF,EAAaf,GAAa,KAAM7rD,EAAQ6rC,mBAAoB,IAAM6gB,EAjGT,EAiGkC,GAE3FC,EADA/E,EACa,IAAImE,GAAYnE,EAAQ3jD,KAAM2jD,EAAQhvB,MAAO0mB,EAAKz3B,KAAMy3B,EAAKz3B,MAAM,EAAM7nB,EAAQ6sD,UAAYjF,EAAQ3jD,KAAKk/C,aAAcyJ,GAExH,IAAIb,GADZW,EACwB,KAEAvmD,EAAO+yB,OAAOsvB,YAFR,KAAMlJ,EAAKz3B,KAAMy3B,EAAKz3B,MAAM,EAAM,KAAM+kC,GAG/E/iD,KAAKsvB,MAAQ,CAACwzB,GACd9iD,KAAKuvB,KAAOp5B,EAAQ8sD,cACpBjjD,KAAKkjD,YAAa,EAElBt0B,UACA,OAAO5uB,KAAKsvB,MAAMtvB,KAAKgJ,MAK3Bm6C,OAAOruB,GACiB,GAAhBA,EAAIqW,SACJnrC,KAAKojD,YAAYtuB,GACI,GAAhBA,EAAIqW,UACTnrC,KAAKqjD,WAAWvuB,GAExBwuB,eAAexuB,EAAKhD,GAChB,IAAI7P,EAAQ6S,EAAIuL,aAAa,SAC7B,IAAKpe,EACD,OAAO6P,IACX,IAAI1C,EAAQpvB,KAAKujD,WA+ZzB,SAAqBthC,GACjB,IAAuCsP,EAAnCgD,EAAK,6BAAiC38B,EAAS,GACnD,KAAO25B,EAAIgD,EAAGrX,KAAK+E,IACfrqB,EAAOoD,KAAKu2B,EAAE,GAAIA,EAAE,GAAGkW,QAC3B,OAAO7vC,EAnayB4rD,CAAYvhC,IACxC,IAAKmN,EACD,OACJ,IAAKq0B,EAAUC,GAAet0B,EAAOR,EAAM5uB,KAAK4uB,IAChD,IAAK,IAAIz3B,EAAI,EAAGA,EAAIusD,EAAYtsD,OAAQD,IACpC6I,KAAK2jD,kBAAkBD,EAAYvsD,GAAIy3B,GAC3C,IAAK,IAAIz3B,EAAI,EAAGA,EAAIssD,EAASrsD,OAAQD,IACjC6I,KAAK4jD,eAAeH,EAAStsD,IACjC26B,IACA,IAAK,IAAI36B,EAAI,EAAGA,EAAIssD,EAASrsD,OAAQD,IACjC6I,KAAK2jD,kBAAkBF,EAAStsD,GAAIy3B,GACxC,IAAK,IAAIz3B,EAAI,EAAGA,EAAIusD,EAAYtsD,OAAQD,IACpC6I,KAAK4jD,eAAeF,EAAYvsD,IAExCisD,YAAYtuB,GACR,IAAIv+B,EAAQu+B,EAAI+uB,UACZj1B,EAAM5uB,KAAK4uB,IACf,GA7I0C,EA6ItCA,EAAIz4B,SACJy4B,EAAI+zB,cAAc7tB,IAClB,mBAAmBn8B,KAAKpC,GAAQ,CAChC,GAhJY,EAgJNq4B,EAAIz4B,QAkBNI,EAlKkC,EA8J3Bq4B,EAAIz4B,QAIHI,EAAM+T,QAAQ,SAAU,MAHxB/T,EAAM+T,QAAQ,YAAa,UAVnC,GAJA/T,EAAQA,EAAM+T,QAAQ,oBAAqB,KAIvC,mBAAmB3R,KAAKpC,IAAUyJ,KAAKgJ,MAAQhJ,KAAKsvB,MAAMl4B,OAAS,EAAG,CACtE,IAAI0sC,EAAalV,EAAIhvB,QAAQgvB,EAAIhvB,QAAQxI,OAAS,GAC9C0sD,EAAgBhvB,EAAIivB,kBACnBjgB,GACAggB,GAA2C,MAA1BA,EAAclB,UAC/B9e,EAAW5U,QAAU,mBAAmBv2B,KAAKmrC,EAAW7/B,SACzD1N,EAAQA,EAAMiC,MAAM,IAS5BjC,GACAyJ,KAAKgkD,WAAWhkD,KAAK1D,OAAO+yB,OAAOprB,KAAK1N,IAC5CyJ,KAAKikD,WAAWnvB,QAGhB90B,KAAKkkD,WAAWpvB,GAKxBuuB,WAAWvuB,EAAKqvB,GACZ,IAAuCC,EAAnChuD,EAAO0+B,EAAI8tB,SAASjpD,cACpBooD,GAAS9sD,eAAemB,IAAS4J,KAAK1D,OAAO0iD,gBAuVzD,SAAuBlqB,GACnB,IAAK,IAAIzQ,EAAQyQ,EAAI2I,WAAY4mB,EAAW,KAAMhgC,EAAOA,EAAQA,EAAMigC,YAAa,CAChF,IAAIluD,EAAyB,GAAlBiuB,EAAM8mB,SAAgB9mB,EAAMu+B,SAASjpD,cAAgB,KAC5DvD,GAAQ2rD,GAAS9sD,eAAemB,IAASiuD,GACzCA,EAASnuB,YAAY7R,GACrBA,EAAQggC,GAEK,MAARjuD,EACLiuD,EAAWhgC,EAENjuB,IACLiuD,EAAW,OAjWXE,CAAczvB,GAClB,IAAI/U,EAAQ/f,KAAK7J,QAAQquD,cAAgBxkD,KAAK7J,QAAQquD,aAAa1vB,KAC9DsvB,EAASpkD,KAAK1D,OAAOgjD,SAASxqB,EAAK90B,KAAMmkD,IAC9C,GAAIpkC,EAAOA,EAAK4/B,OAASiC,EAAW3sD,eAAemB,GAC/C4J,KAAKkkD,WAAWpvB,GAChB90B,KAAKykD,eAAe3vB,QAEnB,IAAK/U,GAAQA,EAAK2kC,MAAQ3kC,EAAK4kC,YAAa,CACzC5kC,GAAQA,EAAK4kC,YACb3kD,KAAKgJ,KAAOmU,KAAKhe,IAAI,EAAGa,KAAKgJ,KAAO,GAC/B+W,GAAQA,EAAK2kC,KAAKvZ,WACvBrW,EAAM/U,EAAK2kC,MACf,IAAIE,EAAMh2B,EAAM5uB,KAAK4uB,IAAKi2B,EAAgB7kD,KAAKkjD,WAC/C,GAAInD,EAAU9qD,eAAemB,GACrBw4B,EAAIhvB,QAAQxI,QAAUw3B,EAAIhvB,QAAQ,GAAGijC,UAAY7iC,KAAKgJ,OACtDhJ,KAAKgJ,OACL4lB,EAAM5uB,KAAK4uB,KAEfg2B,GAAO,EACFh2B,EAAIx0B,OACL4F,KAAKkjD,YAAa,QAErB,IAAKpuB,EAAI2I,WAEV,YADAz9B,KAAK8kD,aAAahwB,GAGlB/U,GAAQA,EAAK2kC,KACb1kD,KAAKk/C,OAAOpqB,GAEZ90B,KAAKsjD,eAAexuB,GAAK,IAAM90B,KAAKk/C,OAAOpqB,KAC3C8vB,GACA5kD,KAAK4kD,KAAKh2B,GACd5uB,KAAKkjD,WAAa2B,OAGlB7kD,KAAKsjD,eAAexuB,GAAK,KACrB90B,KAAK+kD,iBAAiBjwB,EAAK/U,GAAyB,IAAnBA,EAAKilC,UAAsBZ,OAAStsD,MAKjFgtD,aAAahwB,GACW,MAAhBA,EAAI8tB,UAAoB5iD,KAAK4uB,IAAIx0B,MAAQ4F,KAAK4uB,IAAIx0B,KAAK61C,eACvDjwC,KAAKojD,YAAYtuB,EAAImwB,cAAcC,eAAe,OAG1DT,eAAe3vB,GAES,MAAhBA,EAAI8tB,UAAsB5iD,KAAK4uB,IAAIx0B,MAAS4F,KAAK4uB,IAAIx0B,KAAK61C,eAC1DjwC,KAAKmlD,UAAUnlD,KAAK1D,OAAO+yB,OAAOprB,KAAK,MAK/Cs/C,WAAWxE,GACP,IAAIhhD,EAAM03C,EAAKz3B,KAAMtjB,EAAS+6C,EAAKz3B,KACnC,IAAK,IAAI7mB,EAAI,EAAGA,EAAI4nD,EAAO3nD,OAAQD,GAAK,EACpC,IAAK,IAAI4L,IAAqB,CAC1B,IAAIgd,EAAO/f,KAAK1D,OAAOojD,WAAWX,EAAO5nD,GAAI4nD,EAAO5nD,EAAI,GAAI6I,KAAM+C,GAClE,IAAKgd,EACD,MACJ,GAAIA,EAAK4/B,OACL,OAAO,KAUX,GATI5/B,EAAK6/B,UACL5/C,KAAK4uB,IAAIuzB,aAAa9vB,OAAOryB,KAAK4uB,IAAIyzB,aAAa7xB,SAAQe,IACnDxR,EAAK6/B,UAAUruB,KACf72B,EAAS62B,EAAErB,SAASx1B,OAI5BqD,EAAMiC,KAAK1D,OAAO+yB,OAAOD,MAAMrP,EAAKof,MAAMt3B,OAAOkY,EAAKgP,OAAOmB,SAASnyB,IAEnD,IAAnBgiB,EAAKilC,UAGL,MAFAjiD,EAAQgd,EAKpB,MAAO,CAAChiB,EAAKrD,GAKjBqqD,iBAAiBjwB,EAAK/U,EAAMqlC,GACxB,IAAIR,EAAMzZ,EAAUhM,EACpB,GAAIpf,EAAK5lB,KACLgxC,EAAWnrC,KAAK1D,OAAO+yB,OAAOC,MAAMvP,EAAK5lB,MACpCgxC,EAASqJ,OAGJx0C,KAAKgkD,WAAW7Y,EAAStjC,OAAOkY,EAAKgP,SAC3C/uB,KAAK8kD,aAAahwB,GAHlB8vB,EAAO5kD,KAAKR,MAAM2rC,EAAUprB,EAAKgP,OAAS,KAAMhP,EAAKiiB,wBAMxD,CAED7C,EADen/B,KAAK1D,OAAO+yB,OAAOD,MAAMrP,EAAKof,MAC7Bt3B,OAAOkY,EAAKgP,OAC5B/uB,KAAK4jD,eAAezkB,GAExB,IAAIkmB,EAAUrlD,KAAK4uB,IACnB,GAAIuc,GAAYA,EAASqJ,OACrBx0C,KAAKkkD,WAAWpvB,QAEf,GAAIswB,EACLplD,KAAKqjD,WAAWvuB,EAAKswB,QAEpB,GAAIrlC,EAAKulC,WACVtlD,KAAKkkD,WAAWpvB,GAChB/U,EAAKulC,WAAWxwB,EAAK90B,KAAK1D,OAAO+yB,QAAQmB,SAAQr2B,GAAQ6F,KAAKgkD,WAAW7pD,SAExE,CACD,IAAIorD,EAAazwB,EACiB,iBAAvB/U,EAAKylC,eACZD,EAAazwB,EAAIiB,cAAchW,EAAKylC,gBACD,mBAAvBzlC,EAAKylC,eACjBD,EAAaxlC,EAAKylC,eAAe1wB,GAC5B/U,EAAKylC,iBACVD,EAAaxlC,EAAKylC,gBACtBxlD,KAAKylD,WAAW3wB,EAAKywB,GAAY,GACjCvlD,KAAKk/C,OAAOqG,GAEZX,GAAQ5kD,KAAK4kD,KAAKS,IAClBrlD,KAAKgJ,OACLm2B,GACAn/B,KAAK2jD,kBAAkBxkB,EAAMkmB,GAKrCnG,OAAO59B,EAAQrb,EAAYE,GACvB,IAAIxO,EAAQsO,GAAc,EAC1B,IAAK,IAAI6uB,EAAM7uB,EAAaqb,EAAOokC,WAAWz/C,GAAcqb,EAAOmc,WAAY/lC,EAAkB,MAAZyO,EAAmB,KAAOmb,EAAOokC,WAAWv/C,GAAW2uB,GAAOp9B,EAAKo9B,EAAMA,EAAIwvB,cAAe3sD,EAC7KqI,KAAK2lD,YAAYrkC,EAAQ3pB,GACzBqI,KAAKmjD,OAAOruB,GAEhB90B,KAAK2lD,YAAYrkC,EAAQ3pB,GAK7BwtD,UAAUhrD,GACN,IAAIyrD,EAAOhB,EACX,IAAK,IAAI7oC,EAAQ/b,KAAKgJ,KAAM+S,GAAS,EAAGA,IAAS,CAC7C,IAAI8pC,EAAK7lD,KAAKsvB,MAAMvT,GAChBi3B,EAAQ6S,EAAG7W,aAAa70C,GAC5B,GAAI64C,KAAW4S,GAASA,EAAMxuD,OAAS47C,EAAM57C,UACzCwuD,EAAQ5S,EACR4R,EAAOiB,GACF7S,EAAM57C,QACP,MAER,GAAIyuD,EAAGzD,MACH,MAER,IAAKwD,EACD,OAAO,EACX5lD,KAAK4kD,KAAKA,GACV,IAAK,IAAIztD,EAAI,EAAGA,EAAIyuD,EAAMxuD,OAAQD,IAC9B6I,KAAK8lD,WAAWF,EAAMzuD,GAAI,MAAM,GACpC,OAAO,EAGX6sD,WAAW7pD,GACP,GAAIA,EAAK0oC,UAAY7iC,KAAKkjD,aAAeljD,KAAK4uB,IAAIx0B,KAAM,CACpD,IAAI2rD,EAAQ/lD,KAAKgmD,uBACbD,GACA/lD,KAAK8lD,WAAWC,GAExB,GAAI/lD,KAAKmlD,UAAUhrD,GAAO,CACtB6F,KAAKimD,aACL,IAAIr3B,EAAM5uB,KAAK4uB,IACfA,EAAI4zB,aAAaroD,EAAKC,MAClBw0B,EAAIn1B,QACJm1B,EAAIn1B,MAAQm1B,EAAIn1B,MAAMw1C,UAAU90C,EAAKC,OACzC,IAAIg1B,EAAQR,EAAIyzB,YAChB,IAAK,IAAIlrD,EAAI,EAAGA,EAAIgD,EAAKi1B,MAAMh4B,OAAQD,IAC9By3B,EAAIx0B,OAAQw0B,EAAIx0B,KAAK81C,eAAe/1C,EAAKi1B,MAAMj4B,GAAGiD,QACnDg1B,EAAQj1B,EAAKi1B,MAAMj4B,GAAG+4B,SAASd,IAEvC,OADAR,EAAIhvB,QAAQ5E,KAAKb,EAAKglC,KAAK/P,KACpB,EAEX,OAAO,EAIX5vB,MAAMpF,EAAM20B,EAAOm3B,GACf,IAAIhnD,EAAKc,KAAKmlD,UAAU/qD,EAAKyN,OAAOknB,IAGpC,OAFI7vB,GACAc,KAAK8lD,WAAW1rD,EAAM20B,GAAO,EAAMm3B,GAChChnD,EAGX4mD,WAAW1rD,EAAM20B,EAAQ,KAAMqzB,GAAQ,EAAO8D,GAC1ClmD,KAAKimD,aACL,IAAIr3B,EAAM5uB,KAAK4uB,IACfA,EAAI4zB,aAAapoD,GACjBw0B,EAAIn1B,MAAQm1B,EAAIn1B,OAASm1B,EAAIn1B,MAAMw1C,UAAU70C,GAC7C,IAAIjE,EAAU6rD,GAAa5nD,EAAM8rD,EAAYt3B,EAAIz4B,SAtXY,EAuXxDy4B,EAAIz4B,SAAkD,GAAtBy4B,EAAIhvB,QAAQxI,SAC7CjB,GAxXyD,GAyX7D6J,KAAKsvB,MAAMt0B,KAAK,IAAIknD,GAAY9nD,EAAM20B,EAAOH,EAAIyzB,YAAazzB,EAAIuzB,aAAcC,EAAO,KAAMjsD,IAC7F6J,KAAKgJ,OAITi9C,WAAWjQ,GAAU,GACjB,IAAI7+C,EAAI6I,KAAKsvB,MAAMl4B,OAAS,EAC5B,GAAID,EAAI6I,KAAKgJ,KAAM,CACf,KAAO7R,EAAI6I,KAAKgJ,KAAM7R,IAClB6I,KAAKsvB,MAAMn4B,EAAI,GAAGyI,QAAQ5E,KAAKgF,KAAKsvB,MAAMn4B,GAAGgoD,OAAOnJ,IACxDh2C,KAAKsvB,MAAMl4B,OAAS4I,KAAKgJ,KAAO,GAGxCm2C,SAGI,OAFAn/C,KAAKgJ,KAAO,EACZhJ,KAAKimD,WAAWjmD,KAAK6iD,QACd7iD,KAAKsvB,MAAM,GAAG6vB,OAAOn/C,KAAK6iD,QAAU7iD,KAAK7J,QAAQgwD,SAE5DvB,KAAK9kB,GACD,IAAK,IAAI3oC,EAAI6I,KAAKgJ,KAAM7R,GAAK,EAAGA,IAC5B,GAAI6I,KAAKsvB,MAAMn4B,IAAM2oC,EAEjB,OADA9/B,KAAKgJ,KAAO7R,GACL,EAEf,OAAO,EAEPivD,iBACApmD,KAAKimD,aACL,IAAI7wC,EAAM,EACV,IAAK,IAAIje,EAAI6I,KAAKgJ,KAAM7R,GAAK,EAAGA,IAAK,CACjC,IAAIyI,EAAUI,KAAKsvB,MAAMn4B,GAAGyI,QAC5B,IAAK,IAAIwxB,EAAIxxB,EAAQxI,OAAS,EAAGg6B,GAAK,EAAGA,IACrChc,GAAOxV,EAAQwxB,GAAG6M,SAClB9mC,GACAie,IAER,OAAOA,EAEXuwC,YAAYrkC,EAAQrf,GAChB,GAAIjC,KAAKuvB,KACL,IAAK,IAAIp4B,EAAI,EAAGA,EAAI6I,KAAKuvB,KAAKn4B,OAAQD,IAC9B6I,KAAKuvB,KAAKp4B,GAAGgD,MAAQmnB,GAAUthB,KAAKuvB,KAAKp4B,GAAG8K,QAAUA,IACtDjC,KAAKuvB,KAAKp4B,GAAGie,IAAMpV,KAAKomD,YAGxClC,WAAW5iC,GACP,GAAIthB,KAAKuvB,KACL,IAAK,IAAIp4B,EAAI,EAAGA,EAAI6I,KAAKuvB,KAAKn4B,OAAQD,IACV,MAApB6I,KAAKuvB,KAAKp4B,GAAGie,KAAkC,GAAnBkM,EAAO6pB,UAAiB7pB,EAAO+kC,SAASrmD,KAAKuvB,KAAKp4B,GAAGgD,QACjF6F,KAAKuvB,KAAKp4B,GAAGie,IAAMpV,KAAKomD,YAGxCX,WAAWnkC,EAAQ1hB,EAAS9B,GACxB,GAAIwjB,GAAU1hB,GAAWI,KAAKuvB,KAC1B,IAAK,IAAIp4B,EAAI,EAAGA,EAAI6I,KAAKuvB,KAAKn4B,OAAQD,IAClC,GAAwB,MAApB6I,KAAKuvB,KAAKp4B,GAAGie,KAAkC,GAAnBkM,EAAO6pB,UAAiB7pB,EAAO+kC,SAASrmD,KAAKuvB,KAAKp4B,GAAGgD,MAAO,CAC9EyF,EAAQ0mD,wBAAwBtmD,KAAKuvB,KAAKp4B,GAAGgD,OAC5C2D,EAAS,EAAI,KACpBkC,KAAKuvB,KAAKp4B,GAAGie,IAAMpV,KAAKomD,aAI5CnC,WAAWsC,GACP,GAAIvmD,KAAKuvB,KACL,IAAK,IAAIp4B,EAAI,EAAGA,EAAI6I,KAAKuvB,KAAKn4B,OAAQD,IAC9B6I,KAAKuvB,KAAKp4B,GAAGgD,MAAQosD,IACrBvmD,KAAKuvB,KAAKp4B,GAAGie,IAAMpV,KAAKomD,YAAcG,EAAS1C,UAAUzsD,OAAS4I,KAAKuvB,KAAKp4B,GAAG8K,SAI/Fw9C,eAAevjD,GACX,GAAIA,EAAQ0kB,QAAQ,MAAQ,EACxB,OAAO1kB,EAAQ3E,MAAM,YAAY+qB,KAAKtiB,KAAKy/C,eAAgBz/C,MAC/D,IAAIgyC,EAAQ91C,EAAQ3E,MAAM,KACtBivD,EAASxmD,KAAK7J,QAAQ+F,QACtBuqD,GAAWzmD,KAAK6iD,UAAY2D,GAAUA,EAAOllC,OAAOlnB,MAAQ4F,KAAKsvB,MAAM,GAAGl1B,MAC1EssD,IAAaF,EAASA,EAAOzqC,MAAQ,EAAI,IAAM0qC,EAAU,EAAI,GAC7DhtD,EAAQ,CAACtC,EAAG4kB,KACZ,KAAO5kB,GAAK,EAAGA,IAAK,CAChB,IAAI8yB,EAAO+nB,EAAM76C,GACjB,GAAY,IAAR8yB,EAAY,CACZ,GAAI9yB,GAAK66C,EAAM56C,OAAS,GAAU,GAALD,EACzB,SACJ,KAAO4kB,GAAS2qC,EAAU3qC,IACtB,GAAItiB,EAAMtC,EAAI,EAAG4kB,GACb,OAAO,EACf,OAAO,EAEN,CACD,IAAIhf,EAAOgf,EAAQ,GAAe,GAATA,GAAc0qC,EAAWzmD,KAAKsvB,MAAMvT,GAAO3hB,KAC9DosD,GAAUzqC,GAAS2qC,EAAWF,EAAOrsD,KAAK4hB,EAAQ2qC,GAAUtsD,KACxD,KACV,IAAK2C,GAASA,EAAK3G,MAAQ6zB,IAAsC,GAA9BltB,EAAKkkC,OAAOrgB,QAAQqJ,GACnD,OAAO,EACXlO,KAGR,OAAO,GAEX,OAAOtiB,EAAMu4C,EAAM56C,OAAS,EAAG4I,KAAKgJ,MAExCg9C,uBACI,IAAIW,EAAW3mD,KAAK7J,QAAQ+F,QAC5B,GAAIyqD,EACA,IAAK,IAAIrpC,EAAIqpC,EAAS5qC,MAAOuB,GAAK,EAAGA,IAAK,CACtC,IAAI8wB,EAAQuY,EAASxsD,KAAKmjB,GAAGonB,eAAeiiB,EAASviB,WAAW9mB,IAAIqnB,YACpE,GAAIyJ,GAASA,EAAM5J,aAAe4J,EAAMyK,aACpC,OAAOzK,EAEnB,IAAK,IAAIh4C,KAAQ4J,KAAK1D,OAAO+yB,OAAOC,MAAO,CACvC,IAAIl1B,EAAO4F,KAAK1D,OAAO+yB,OAAOC,MAAMl5B,GACpC,GAAIgE,EAAKoqC,aAAepqC,EAAKy+C,aACzB,OAAOz+C,GAGnBwpD,eAAezkB,GACX,IAAI6T,EAiFZ,SAA2B7T,EAAM7Q,GAC7B,IAAK,IAAIn3B,EAAI,EAAGA,EAAIm3B,EAAIl3B,OAAQD,IAC5B,GAAIgoC,EAAK2V,GAAGxmB,EAAIn3B,IACZ,OAAOm3B,EAAIn3B,GApFHyvD,CAAkBznB,EAAMn/B,KAAK4uB,IAAIuzB,cACzCnP,GACAhzC,KAAK4uB,IAAI0zB,WAAWtnD,KAAKg4C,GAC7BhzC,KAAK4uB,IAAIuzB,aAAehjB,EAAKjP,SAASlwB,KAAK4uB,IAAIuzB,cAEnDwB,kBAAkBxkB,EAAM0nB,GACpB,IAAK,IAAI9qC,EAAQ/b,KAAKgJ,KAAM+S,GAAS,EAAGA,IAAS,CAC7C,IAAIglB,EAAQ/gC,KAAKsvB,MAAMvT,GAEvB,GADYglB,EAAMohB,aAAa/gC,YAAY+d,IAC9B,EACT4B,EAAMohB,aAAehjB,EAAK/O,cAAc2Q,EAAMohB,kBAE7C,CACDphB,EAAMshB,YAAcljB,EAAK/O,cAAc2Q,EAAMshB,aAC7C,IAAIyE,EAAY/lB,EAAMwhB,iBAAiBpjB,GACnC2nB,GAAa/lB,EAAM3mC,MAAQ2mC,EAAM3mC,KAAK81C,eAAe4W,EAAU1sD,QAC/D2mC,EAAMshB,YAAcyE,EAAU52B,SAAS6Q,EAAMshB,cAErD,GAAIthB,GAAS8lB,EACT,QAuBhB,SAAStH,GAAQzqB,EAAKiyB,GAClB,OAAQjyB,EAAIyqB,SAAWzqB,EAAIkyB,mBAAqBlyB,EAAImyB,uBAAyBnyB,EAAIoyB,oBAAoBxxD,KAAKo/B,EAAKiyB,GASnH,SAAShwD,GAAKnB,GACV,IAAImB,EAAO,GACX,IAAK,IAAI6yB,KAAQh0B,EACbmB,EAAK6yB,GAAQh0B,EAAIg0B,GACrB,OAAO7yB,EAKX,SAAS2rD,GAAa3Y,EAAUoB,GAC5B,IAAI7b,EAAQ6b,EAAS9b,OAAOC,MAC5B,IAAK,IAAIl5B,KAAQk5B,EAAO,CACpB,IAAIhO,EAASgO,EAAMl5B,GACnB,IAAKkrB,EAAO4uB,eAAenG,GACvB,SACJ,IAAIxnC,EAAO,GAAIkrC,EAAQh0C,IACnB8I,EAAKvH,KAAKvB,GACV,IAAK,IAAItC,EAAI,EAAGA,EAAIsC,EAAMu0C,UAAW72C,IAAK,CACtC,IAAI,KAAEiD,EAAI,KAAE2C,GAAStD,EAAMw0C,KAAK92C,GAChC,GAAIiD,GAAQ+wC,EACR,OAAO,EACX,GAAI5oC,EAAKqe,QAAQ7jB,GAAQ,GAAK0wC,EAAK1wC,GAC/B,OAAO,IAGnB,GAAI0wC,EAAKnsB,EAAOg4B,cACZ,OAAO,GAcnB,MAAM6N,GAUFnxD,YAIAs5B,EAIAF,GACIpvB,KAAKsvB,MAAQA,EACbtvB,KAAKovB,MAAQA,EAQjBg4B,kBAAkB7qC,EAAUpmB,EAAU,GAAID,GACjCA,IACDA,EAASunB,GAAItnB,GAASkxD,0BAC1B,IAAIz4B,EAAM14B,EAAQ4lD,EAAS,GA6B3B,OA5BAv/B,EAASiU,SAAQr2B,IACb,GAAI2hD,EAAO1kD,QAAU+C,EAAKi1B,MAAMh4B,OAAQ,CACpC,IAAIkwD,EAAO,EAAGC,EAAW,EACzB,KAAOD,EAAOxL,EAAO1kD,QAAUmwD,EAAWptD,EAAKi1B,MAAMh4B,QAAQ,CACzD,IAAI2F,EAAO5C,EAAKi1B,MAAMm4B,GACtB,GAAKvnD,KAAKovB,MAAMryB,EAAK3C,KAAKhE,MAA1B,CAIA,IAAK2G,EAAK+3C,GAAGgH,EAAOwL,GAAM,MAAmC,IAA5BvqD,EAAK3C,KAAKq1B,KAAK+3B,SAC5C,MACJF,IACAC,SANIA,IAQR,KAAOD,EAAOxL,EAAO1kD,QACjBw3B,EAAMktB,EAAO1+C,MAAM,GACvB,KAAOmqD,EAAWptD,EAAKi1B,MAAMh4B,QAAQ,CACjC,IAAI2G,EAAM5D,EAAKi1B,MAAMm4B,KACjBE,EAAUznD,KAAK0nD,cAAc3pD,EAAK5D,EAAK0oC,SAAU1sC,GACjDsxD,IACA3L,EAAO9gD,KAAK,CAAC+C,EAAK6wB,IAClBA,EAAIsH,YAAYuxB,EAAQ3yB,KACxBlG,EAAM64B,EAAQlC,YAAckC,EAAQ3yB,MAIhDlG,EAAIsH,YAAYl2B,KAAK2nD,mBAAmBxtD,EAAMhE,OAE3CD,EAKXyxD,mBAAmBxtD,EAAMhE,GACrB,IAAI,IAAE2+B,EAAG,WAAEywB,GAAe4B,GAAcS,WAAWnqC,GAAItnB,GAAU6J,KAAKsvB,MAAMn1B,EAAKC,KAAKhE,MAAM+D,IAC5F,GAAIorD,EAAY,CACZ,GAAIprD,EAAKq6C,OACL,MAAM,IAAIO,WAAW,gDACzB/0C,KAAKonD,kBAAkBjtD,EAAKyF,QAASzJ,EAASovD,GAElD,OAAOzwB,EASX+yB,cAAc1tD,EAAMhE,EAAU,IAC1B,IAAI2+B,EAAM90B,KAAK2nD,mBAAmBxtD,EAAMhE,GACxC,IAAK,IAAIgB,EAAIgD,EAAKi1B,MAAMh4B,OAAS,EAAGD,GAAK,EAAGA,IAAK,CAC7C,IAAI0uB,EAAO7lB,KAAK0nD,cAAcvtD,EAAKi1B,MAAMj4B,GAAIgD,EAAK0oC,SAAU1sC,GACxD0vB,KACCA,EAAK0/B,YAAc1/B,EAAKiP,KAAKoB,YAAYpB,GAC1CA,EAAMjP,EAAKiP,KAGnB,OAAOA,EAKX4yB,cAAcvoB,EAAMiD,EAAQjsC,EAAU,IAClC,IAAI+oC,EAAQl/B,KAAKovB,MAAM+P,EAAK/kC,KAAKhE,MACjC,OAAO8oC,GAASioB,GAAcS,WAAWnqC,GAAItnB,GAAU+oC,EAAMC,EAAMiD,IAOvEpT,kBAAkBvR,EAAKqqC,EAAWC,EAAQ,MACtC,GAAwB,iBAAbD,EACP,MAAO,CAAEhzB,IAAKrX,EAAIynC,eAAe4C,IACrC,GAA0B,MAAtBA,EAAU3c,SACV,MAAO,CAAErW,IAAKgzB,GAClB,GAAIA,EAAUhzB,KAAiC,MAA1BgzB,EAAUhzB,IAAIqW,SAC/B,OAAO2c,EACX,IAKIvC,EALAj5C,EAAUw7C,EAAU,GAAIE,EAAQ17C,EAAQsU,QAAQ,KAChDonC,EAAQ,IACRD,EAAQz7C,EAAQ9T,MAAM,EAAGwvD,GACzB17C,EAAUA,EAAQ9T,MAAMwvD,EAAQ,IAGpC,IAAIlzB,EAAOizB,EAAQtqC,EAAIwqC,gBAAgBF,EAAOz7C,GAAWmR,EAAIxO,cAAc3C,GACvEyiB,EAAQ+4B,EAAU,GAAIrwD,EAAQ,EAClC,GAAIs3B,GAAyB,iBAATA,GAAuC,MAAlBA,EAAMoc,WAAqB11C,MAAMF,QAAQw5B,GAAQ,CACtFt3B,EAAQ,EACR,IAAK,IAAIrB,KAAQ24B,EACb,GAAmB,MAAfA,EAAM34B,GAAe,CACrB,IAAI4xD,EAAQ5xD,EAAKwqB,QAAQ,KACrBonC,EAAQ,EACRlzB,EAAIozB,eAAe9xD,EAAKoC,MAAM,EAAGwvD,GAAQ5xD,EAAKoC,MAAMwvD,EAAQ,GAAIj5B,EAAM34B,IAEtE0+B,EAAIsB,aAAahgC,EAAM24B,EAAM34B,KAG7C,IAAK,IAAIe,EAAIM,EAAON,EAAI2wD,EAAU1wD,OAAQD,IAAK,CAC3C,IAAIktB,EAAQyjC,EAAU3wD,GACtB,GAAc,IAAVktB,EAAa,CACb,GAAIltB,EAAI2wD,EAAU1wD,OAAS,GAAKD,EAAIM,EAChC,MAAM,IAAIs9C,WAAW,0DACzB,MAAO,CAAEjgB,MAAKywB,WAAYzwB,GAEzB,CACD,IAAMA,IAAKkP,EAAOuhB,WAAY4C,GAAiBhB,GAAcS,WAAWnqC,EAAK4G,EAAO0jC,GAEpF,GADAjzB,EAAIoB,YAAY8N,GACZmkB,EAAc,CACd,GAAI5C,EACA,MAAM,IAAIxQ,WAAW,0BACzBwQ,EAAa4C,IAIzB,MAAO,CAAErzB,MAAKywB,cAMlBv2B,kBAAkBK,GACd,OAAOA,EAAOkpB,OAAO6P,gBAChB/4B,EAAOkpB,OAAO6P,cAAgB,IAAIjB,GAAcnnD,KAAKqoD,gBAAgBh5B,GAASrvB,KAAKsoD,gBAAgBj5B,KAM5GL,uBAAuBK,GACnB,IAAIz3B,EAAS2wD,GAAYl5B,EAAOC,OAGhC,OAFK13B,EAAOqM,OACRrM,EAAOqM,KAAO9J,GAAQA,EAAK8J,MACxBrM,EAKXo3B,uBAAuBK,GACnB,OAAOk5B,GAAYl5B,EAAOD,QAGlC,SAASm5B,GAAY3yD,GACjB,IAAIgC,EAAS,GACb,IAAK,IAAIxB,KAAQR,EAAK,CAClB,IAAIspC,EAAQtpC,EAAIQ,GAAMq5B,KAAKyP,MACvBA,IACAtnC,EAAOxB,GAAQ8oC,GAEvB,OAAOtnC,EAEX,SAAS6lB,GAAItnB,GACT,OAAOA,EAAQuM,UAAY8lD,OAAO9lD,W,8OCj0GtC,MAAM+lD,EAAc1zD,OAAO8S,OAAO,MAKlC,MAAM6gD,EAMF1yD,YAKAyqC,EAKAkN,EAAOmC,GACH9vC,KAAKygC,QAAUA,EACfzgC,KAAK2tC,MAAQA,EACb3tC,KAAK8vC,OAASA,GAAU,CAAC,IAAI6Y,EAAeloB,EAAQtf,IAAIwsB,GAAQlN,EAAQthC,IAAIwuC,KAK5Eib,aAAW,OAAO5oD,KAAKygC,QAAQrrB,IAI/B9O,WAAS,OAAOtG,KAAK2tC,MAAMv4B,IAI3Bta,WAAS,OAAOkF,KAAKm9B,MAAM/nB,IAI3B0qB,SAAO,OAAO9/B,KAAKo9B,IAAIhoB,IAIvB+nB,YACA,OAAOn9B,KAAK8vC,OAAO,GAAG3S,MAKtBC,UACA,OAAOp9B,KAAK8vC,OAAO,GAAG1S,IAKtByC,YACA,IAAIiQ,EAAS9vC,KAAK8vC,OAClB,IAAK,IAAI34C,EAAI,EAAGA,EAAI24C,EAAO14C,OAAQD,IAC/B,GAAI24C,EAAO34C,GAAGgmC,MAAM/nB,KAAO06B,EAAO34C,GAAGimC,IAAIhoB,IACrC,OAAO,EACf,OAAO,EAKXxV,UACI,OAAOI,KAAKm9B,MAAM1f,IAAIjlB,MAAMwH,KAAKlF,KAAMkF,KAAK8/B,IAAI,GAMpDx1B,QAAQozB,EAAI99B,EAAU,YAIlB,IAAIipD,EAAWjpD,EAAQA,QAAQk/B,UAAWgqB,EAAa,KACvD,IAAK,IAAI3xD,EAAI,EAAGA,EAAIyI,EAAQo2C,QAAS7+C,IACjC2xD,EAAaD,EACbA,EAAWA,EAAS/pB,UAExB,IAAIiqB,EAAUrrB,EAAGsJ,MAAM5vC,OAAQ04C,EAAS9vC,KAAK8vC,OAC7C,IAAK,IAAI34C,EAAI,EAAGA,EAAI24C,EAAO14C,OAAQD,IAAK,CACpC,IAAI,MAAEgmC,EAAK,IAAEC,GAAQ0S,EAAO34C,GAAI2mC,EAAUJ,EAAGI,QAAQtlC,MAAMuwD,GAC3DrrB,EAAGsrB,aAAalrB,EAAQ32B,IAAIg2B,EAAM/nB,KAAM0oB,EAAQ32B,IAAIi2B,EAAIhoB,KAAMje,EAAI,WAAcyI,GACvE,GAALzI,GACA8xD,EAAwBvrB,EAAIqrB,GAAUF,EAAWA,EAAShmB,SAAWimB,GAAcA,EAAWtkB,cAAgB,EAAI,IAO9H5B,YAAYlF,EAAIvjC,GACZ,IAAI4uD,EAAUrrB,EAAGsJ,MAAM5vC,OAAQ04C,EAAS9vC,KAAK8vC,OAC7C,IAAK,IAAI34C,EAAI,EAAGA,EAAI24C,EAAO14C,OAAQD,IAAK,CACpC,IAAI,MAAEgmC,EAAK,IAAEC,GAAQ0S,EAAO34C,GAAI2mC,EAAUJ,EAAGI,QAAQtlC,MAAMuwD,GACvDjuD,EAAOgjC,EAAQ32B,IAAIg2B,EAAM/nB,KAAM0qB,EAAKhC,EAAQ32B,IAAIi2B,EAAIhoB,KACpDje,EACAumC,EAAGwrB,YAAYpuD,EAAMglC,IAGrBpC,EAAGsF,iBAAiBloC,EAAMglC,EAAI3lC,GAC9B8uD,EAAwBvrB,EAAIqrB,EAAS5uD,EAAK0oC,UAAY,EAAI,KAWtE7T,gBAAgB4e,EAAMub,EAAKC,GAAW,GAClC,IAAIplB,EAAQ4J,EAAKtsB,OAAO2uB,cAAgB,IAAIoZ,EAAczb,GACpD0b,EAAgB1b,EAAKzzC,KAAK,GAAIyzC,EAAKtsB,OAAQssB,EAAKx4B,IAAKw4B,EAAKj2C,QAASwxD,EAAKC,GAC9E,GAAIplB,EACA,OAAOA,EACX,IAAK,IAAIjoB,EAAQ6xB,EAAK7xB,MAAQ,EAAGA,GAAS,EAAGA,IAAS,CAClD,IAAIi3B,EAAQmW,EAAM,EACZG,EAAgB1b,EAAKzzC,KAAK,GAAIyzC,EAAKzzC,KAAK4hB,GAAQ6xB,EAAK9vC,OAAOie,EAAQ,GAAI6xB,EAAKj2C,MAAMokB,GAAQotC,EAAKC,GAChGE,EAAgB1b,EAAKzzC,KAAK,GAAIyzC,EAAKzzC,KAAK4hB,GAAQ6xB,EAAK7qC,MAAMgZ,EAAQ,GAAI6xB,EAAKj2C,MAAMokB,GAAS,EAAGotC,EAAKC,GACzG,GAAIpW,EACA,OAAOA,EAEf,OAAO,KAOXhkB,YAAY4e,EAAM2b,EAAO,GACrB,OAAOvpD,KAAKwpD,SAAS5b,EAAM2b,IAASvpD,KAAKwpD,SAAS5b,GAAO2b,IAAS,IAAIE,EAAa7b,EAAKzzC,KAAK,IAQjG60B,eAAevR,GACX,OAAO6rC,EAAgB7rC,EAAKA,EAAK,EAAG,EAAG,IAAM,IAAIgsC,EAAahsC,GAMlEuR,aAAavR,GACT,OAAO6rC,EAAgB7rC,EAAKA,EAAKA,EAAI7d,QAAQL,KAAMke,EAAI+f,YAAa,IAAM,IAAIisB,EAAahsC,GAM/FuR,gBAAgBvR,EAAKm4B,GACjB,IAAKA,IAASA,EAAKx7C,KACf,MAAM,IAAI26C,WAAW,wCACzB,IAAI2U,EAAMjB,EAAY7S,EAAKx7C,MAC3B,IAAKsvD,EACD,MAAM,IAAI3U,WAAW,qBAAqBa,EAAKx7C,gBACnD,OAAOsvD,EAAIrT,SAAS54B,EAAKm4B,GAQ7B5mB,cAAc9K,EAAIylC,GACd,GAAIzlC,KAAMukC,EACN,MAAM,IAAI1T,WAAW,sCAAwC7wB,GAGjE,OAFAukC,EAAYvkC,GAAMylC,EAClBA,EAAe30D,UAAU40D,OAAS1lC,EAC3BylC,EAWXE,cACI,OAAOR,EAAcr1C,QAAQhU,KAAKygC,QAASzgC,KAAK2tC,OAAOkc,eAG/DnB,EAAU1zD,UAAU80D,SAAU,EAI9B,MAAMnB,EAIF3yD,YAIAmnC,EAIAC,GACIp9B,KAAKm9B,MAAQA,EACbn9B,KAAKo9B,IAAMA,GAGnB,IAAI2sB,GAA2B,EAC/B,SAASC,EAAmBpc,GACnBmc,GAA6Bnc,EAAKtsB,OAAO2uB,gBAC1C8Z,GAA2B,EAC3B5xB,QAAc,KAAE,wEAA0EyV,EAAKtsB,OAAOlnB,KAAKhE,KAAO,MAS1H,MAAMizD,UAAsBX,EAIxB1yD,YAAYyqC,EAASkN,EAAQlN,GACzBupB,EAAmBvpB,GACnBupB,EAAmBrc,GACnBxnB,MAAMsa,EAASkN,GAMfhE,cAAY,OAAO3pC,KAAKygC,QAAQrrB,KAAOpV,KAAK2tC,MAAMv4B,IAAMpV,KAAK2tC,MAAQ,KACzExmC,IAAIsW,EAAKqgB,GACL,IAAI6P,EAAQlwB,EAAIpa,QAAQy6B,EAAQ32B,IAAInH,KAAKsG,OACzC,IAAKqnC,EAAMrsB,OAAO2uB,cACd,OAAOyY,EAAUuB,KAAKtc,GAC1B,IAAIlN,EAAUhjB,EAAIpa,QAAQy6B,EAAQ32B,IAAInH,KAAK4oD,SAC3C,OAAO,IAAIS,EAAc5oB,EAAQnf,OAAO2uB,cAAgBxP,EAAUkN,EAAOA,GAE7ErjC,QAAQozB,EAAI99B,EAAU,YAElB,GADAumB,MAAM7b,QAAQozB,EAAI99B,GACdA,GAAW,WAAa,CACxB,IAAIwvB,EAAQpvB,KAAKm9B,MAAM6a,YAAYh4C,KAAKo9B,KACpChO,GACAsO,EAAGwsB,YAAY96B,IAG3B0lB,GAAGL,GACC,OAAOA,aAAiB4U,GAAiB5U,EAAMmU,QAAU5oD,KAAK4oD,QAAUnU,EAAMnuC,MAAQtG,KAAKsG,KAE/FujD,cACI,OAAO,IAAIM,EAAanqD,KAAK4oD,OAAQ5oD,KAAKsG,MAE9Cq1B,SACI,MAAO,CAAEvhC,KAAM,OAAQwuD,OAAQ5oD,KAAK4oD,OAAQtiD,KAAMtG,KAAKsG,MAK3D0oB,gBAAgBvR,EAAKm4B,GACjB,GAA0B,iBAAfA,EAAKgT,QAA0C,iBAAbhT,EAAKtvC,KAC9C,MAAM,IAAIyuC,WAAW,4CACzB,OAAO,IAAIsU,EAAc5rC,EAAIpa,QAAQuyC,EAAKgT,QAASnrC,EAAIpa,QAAQuyC,EAAKtvC,OAKxE0oB,cAAcvR,EAAKmrC,EAAQtiD,EAAOsiD,GAC9B,IAAInoB,EAAUhjB,EAAIpa,QAAQulD,GAC1B,OAAO,IAAI5oD,KAAKygC,EAASn6B,GAAQsiD,EAASnoB,EAAUhjB,EAAIpa,QAAQiD,IAUpE0oB,eAAeyR,EAASkN,EAAO4b,GAC3B,IAAIa,EAAO3pB,EAAQrrB,IAAMu4B,EAAMv4B,IAG/B,GAFKm0C,IAAQa,IACTb,EAAOa,GAAQ,EAAI,GAAK,IACvBzc,EAAMrsB,OAAO2uB,cAAe,CAC7B,IAAI+C,EAAQ0V,EAAUc,SAAS7b,EAAO4b,GAAM,IAASb,EAAUc,SAAS7b,GAAQ4b,GAAM,GACtF,IAAIvW,EAGA,OAAO0V,EAAUuB,KAAKtc,EAAO4b,GAF7B5b,EAAQqF,EAAMrF,MActB,OAVKlN,EAAQnf,OAAO2uB,gBACJ,GAARma,IAIA3pB,GAAWioB,EAAUc,SAAS/oB,GAAU8oB,GAAM,IAASb,EAAUc,SAAS/oB,EAAS8oB,GAAM,IAAO9oB,SACnFrrB,IAAMu4B,EAAMv4B,KAASg1C,EAAO,KAJzC3pB,EAAUkN,GAQX,IAAI0b,EAAc5oB,EAASkN,IAG1C+a,EAAUkB,OAAO,OAAQP,GACzB,MAAMc,EACFn0D,YAAY4yD,EAAQtiD,GAChBtG,KAAK4oD,OAASA,EACd5oD,KAAKsG,KAAOA,EAEhBa,IAAI22B,GACA,OAAO,IAAIqsB,EAAarsB,EAAQ32B,IAAInH,KAAK4oD,QAAS9qB,EAAQ32B,IAAInH,KAAKsG,OAEvEjD,QAAQoa,GACJ,OAAO4rC,EAAcr1C,QAAQyJ,EAAIpa,QAAQrD,KAAK4oD,QAASnrC,EAAIpa,QAAQrD,KAAKsG,QAUhF,MAAM+jD,UAAsB3B,EAKxB1yD,YAAY43C,GACR,IAAIzzC,EAAOyzC,EAAKzP,UACZoZ,EAAO3J,EAAKzzC,KAAK,GAAGkJ,QAAQuqC,EAAKx4B,IAAMjb,EAAK8jC,UAChD9X,MAAMynB,EAAM2J,GACZv3C,KAAK7F,KAAOA,EAEhBgN,IAAIsW,EAAKqgB,GACL,IAAI,QAAEwsB,EAAO,IAAEl1C,GAAQ0oB,EAAQysB,UAAUvqD,KAAK4oD,QAC1Chb,EAAOnwB,EAAIpa,QAAQ+R,GACvB,OAAIk1C,EACO5B,EAAUuB,KAAKrc,GACnB,IAAIyc,EAAczc,GAE7BhuC,UACI,OAAO,IAAI,KAAM,UAAcI,KAAK7F,MAAO,EAAG,GAElD26C,GAAGL,GACC,OAAOA,aAAiB4V,GAAiB5V,EAAMmU,QAAU5oD,KAAK4oD,OAElEjtB,SACI,MAAO,CAAEvhC,KAAM,OAAQwuD,OAAQ5oD,KAAK4oD,QAExCiB,cAAgB,OAAO,IAAIW,EAAaxqD,KAAK4oD,QAI7C55B,gBAAgBvR,EAAKm4B,GACjB,GAA0B,iBAAfA,EAAKgT,OACZ,MAAM,IAAI7T,WAAW,4CACzB,OAAO,IAAIsV,EAAc5sC,EAAIpa,QAAQuyC,EAAKgT,SAK9C55B,cAAcvR,EAAK3iB,GACf,OAAO,IAAIuvD,EAAc5sC,EAAIpa,QAAQvI,IAMzCk0B,oBAAoB70B,GAChB,OAAQA,EAAK+0B,SAAwC,IAA9B/0B,EAAKC,KAAKq1B,KAAK4S,YAG9CgoB,EAAcr1D,UAAU80D,SAAU,EAClCpB,EAAUkB,OAAO,OAAQS,GACzB,MAAMG,EACFx0D,YAAY4yD,GACR5oD,KAAK4oD,OAASA,EAElBzhD,IAAI22B,GACA,IAAI,QAAEwsB,EAAO,IAAEl1C,GAAQ0oB,EAAQysB,UAAUvqD,KAAK4oD,QAC9C,OAAO0B,EAAU,IAAIH,EAAa/0C,EAAKA,GAAO,IAAIo1C,EAAap1C,GAEnE/R,QAAQoa,GACJ,IAAImwB,EAAOnwB,EAAIpa,QAAQrD,KAAK4oD,QAASzuD,EAAOyzC,EAAKzP,UACjD,OAAIhkC,GAAQkwD,EAAcI,aAAatwD,GAC5B,IAAIkwD,EAAczc,GACtB8a,EAAUuB,KAAKrc,IAS9B,MAAM6b,UAAqBf,EAIvB1yD,YAAYynB,GACR0I,MAAM1I,EAAIpa,QAAQ,GAAIoa,EAAIpa,QAAQoa,EAAI7d,QAAQL,OAElD+K,QAAQozB,EAAI99B,EAAU,YAClB,GAAIA,GAAW,WAAa,CACxB89B,EAAG7F,OAAO,EAAG6F,EAAGjgB,IAAI7d,QAAQL,MAC5B,IAAIglC,EAAMmkB,EAAUtqB,QAAQV,EAAGjgB,KAC1B8mB,EAAIuQ,GAAGpX,EAAGL,YACXK,EAAG8C,aAAa+D,QAGpBpe,MAAM7b,QAAQozB,EAAI99B,GAG1B+7B,SAAW,MAAO,CAAEvhC,KAAM,OAI1B40B,gBAAgBvR,GAAO,OAAO,IAAIgsC,EAAahsC,GAC/CtW,IAAIsW,GAAO,OAAO,IAAIgsC,EAAahsC,GACnCq3B,GAAGL,GAAS,OAAOA,aAAiBgV,EACpCI,cAAgB,OAAOa,GAE3BhC,EAAUkB,OAAO,MAAOH,GACxB,MAAMiB,EAAc,CAChBvjD,MAAQ,OAAOnH,MACfqD,QAAQoa,GAAc,IAAIgsC,EAAahsC,IAM3C,SAAS6rC,EAAgB7rC,EAAKtjB,EAAMib,EAAKzd,EAAOwxD,EAAKllD,GAAO,GACxD,GAAI9J,EAAK81C,cACL,OAAOoZ,EAAcxhD,OAAO4V,EAAKrI,GACrC,IAAK,IAAIje,EAAIQ,GAASwxD,EAAM,EAAI,EAAI,GAAIA,EAAM,EAAIhyD,EAAIgD,EAAKqjC,WAAarmC,GAAK,EAAGA,GAAKgyD,EAAK,CACtF,IAAI9kC,EAAQlqB,EAAKkqB,MAAMltB,GACvB,GAAKktB,EAAMkpB,QAKN,IAAKtpC,GAAQomD,EAAcI,aAAapmC,GACzC,OAAOgmC,EAAcxiD,OAAO4V,EAAKrI,GAAO+zC,EAAM,EAAI9kC,EAAM4Z,SAAW,QANpD,CACf,IAAI+F,EAAQslB,EAAgB7rC,EAAK4G,EAAOjP,EAAM+zC,EAAKA,EAAM,EAAI9kC,EAAMmZ,WAAa,EAAG2rB,EAAKllD,GACxF,GAAI+/B,EACA,OAAOA,EAKf5uB,GAAOiP,EAAM4Z,SAAWkrB,EAE5B,OAAO,KAEX,SAASF,EAAwBvrB,EAAIitB,EAAUpB,GAC3C,IAAI7U,EAAOhX,EAAGsJ,MAAM5vC,OAAS,EAC7B,GAAIs9C,EAAOiW,EACP,OACJ,IAGiCjzD,EAH7BkmC,EAAOF,EAAGsJ,MAAM0N,IACd9W,aAAgB,MAAeA,aAAgB,QAE3CF,EAAGI,QAAQ8sB,KAAKlW,GACtBlkB,SAAQ,CAACq6B,EAAOC,EAAKC,EAAUC,KAAuB,MAAPtzD,IAC/CA,EAAMszD,MACVttB,EAAG8C,aAAakoB,EAAUuB,KAAKvsB,EAAGjgB,IAAIpa,QAAQ3L,GAAM6xD,KA0BxD,MAAM0B,UAAoB,KAItBj1D,YAAYgQ,GACRmgB,MAAMngB,EAAMyX,KAEZzd,KAAKkrD,gBAAkB,EAGvBlrD,KAAKmrD,QAAU,EAEfnrD,KAAK6O,KAAO9Z,OAAO8S,OAAO,MAC1B7H,KAAKorD,KAAO3xB,KAAKz3B,MACjBhC,KAAKqrD,aAAerlD,EAAMq3B,UAC1Br9B,KAAK0qC,YAAc1kC,EAAM0kC,YAQzBrN,gBAKA,OAJIr9B,KAAKkrD,gBAAkBlrD,KAAKgnC,MAAM5vC,SAClC4I,KAAKqrD,aAAerrD,KAAKqrD,aAAalkD,IAAInH,KAAKyd,IAAKzd,KAAK89B,QAAQtlC,MAAMwH,KAAKkrD,kBAC5ElrD,KAAKkrD,gBAAkBlrD,KAAKgnC,MAAM5vC,QAE/B4I,KAAKqrD,aAMhB7qB,aAAanD,GACT,GAAIA,EAAUF,MAAM1f,KAAOzd,KAAKyd,IAC5B,MAAM,IAAIs3B,WAAW,uEAKzB,OAJA/0C,KAAKqrD,aAAehuB,EACpBr9B,KAAKkrD,gBAAkBlrD,KAAKgnC,MAAM5vC,OAClC4I,KAAKmrD,SAAyC,GA9DlC,EA8DInrD,KAAKmrD,SACrBnrD,KAAK0qC,YAAc,KACZ1qC,KAKPwpC,mBACA,OAtEY,EAsEJxpC,KAAKmrD,SAAyB,EAK1CvgB,eAAexb,GAGX,OAFApvB,KAAK0qC,YAActb,EACnBpvB,KAAKmrD,SA7E0B,EA8ExBnrD,KAOXkqD,YAAY96B,GAGR,OAFK,aAAapvB,KAAK0qC,aAAe1qC,KAAKq9B,UAAUF,MAAM/N,QAASA,IAChEpvB,KAAK4qC,eAAexb,GACjBpvB,KAKXqwC,cAAclR,GACV,OAAOn/B,KAAKkqD,YAAY/qB,EAAKjP,SAASlwB,KAAK0qC,aAAe1qC,KAAKq9B,UAAUsQ,MAAMve,UAKnFghB,iBAAiBjR,GACb,OAAOn/B,KAAKkqD,YAAY/qB,EAAK/O,cAAcpwB,KAAK0qC,aAAe1qC,KAAKq9B,UAAUsQ,MAAMve,UAKpFk8B,qBACA,OA1G+B,EA0GvBtrD,KAAKmrD,SAA2B,EAK5CI,QAAQ3tB,EAAMngB,GACV0I,MAAMolC,QAAQ3tB,EAAMngB,GACpBzd,KAAKmrD,SAAyB,EAAfnrD,KAAKmrD,QACpBnrD,KAAK0qC,YAAc,KAKvB8gB,QAAQJ,GAEJ,OADAprD,KAAKorD,KAAOA,EACLprD,KAKXyrD,iBAAiBjzD,GAEb,OADAwH,KAAKq9B,UAAU/yB,QAAQtK,KAAMxH,GACtBwH,KAOX0iC,qBAAqBvoC,EAAMuxD,GAAe,GACtC,IAAIruB,EAAYr9B,KAAKq9B,UAIrB,OAHIquB,IACAvxD,EAAOA,EAAKglC,KAAKn/B,KAAK0qC,cAAgBrN,EAAUwC,MAAQxC,EAAUF,MAAM/N,QAAWiO,EAAUF,MAAM6a,YAAY3a,EAAUD,MAAQ,aACrIC,EAAUuF,YAAY5iC,KAAM7F,GACrB6F,KAKX8sC,kBAEI,OADA9sC,KAAKq9B,UAAU/yB,QAAQtK,MAChBA,KAMXumC,WAAWtiC,EAAMnJ,EAAMglC,GACnB,IAAIzQ,EAASrvB,KAAKyd,IAAIrjB,KAAKi1B,OAC3B,GAAY,MAARv0B,EACA,OAAKmJ,EAEEjE,KAAK0iC,qBAAqBrT,EAAOprB,KAAKA,IAAO,GADzCjE,KAAK8sC,kBAGf,CAID,GAHU,MAANhN,IACAA,EAAKhlC,GACTglC,EAAW,MAANA,EAAahlC,EAAOglC,GACpB77B,EACD,OAAOjE,KAAKkpD,YAAYpuD,EAAMglC,GAClC,IAAI1Q,EAAQpvB,KAAK0qC,YACjB,IAAKtb,EAAO,CACR,IAAI+N,EAAQn9B,KAAKyd,IAAIpa,QAAQvI,GAC7Bs0B,EAAQ0Q,GAAMhlC,EAAOqiC,EAAM/N,QAAU+N,EAAM6a,YAAYh4C,KAAKyd,IAAIpa,QAAQy8B,IAK5E,OAHA9/B,KAAKgjC,iBAAiBloC,EAAMglC,EAAIzQ,EAAOprB,KAAKA,EAAMmrB,IAC7CpvB,KAAKq9B,UAAUwC,OAChB7/B,KAAKwgC,aAAakoB,EAAUuB,KAAKjqD,KAAKq9B,UAAUD,MAC7Cp9B,MAOfijC,QAAQptC,EAAKU,GAET,OADAyJ,KAAK6O,KAAmB,iBAAPhZ,EAAkBA,EAAMA,EAAIA,KAAOU,EAC7CyJ,KAKXinC,QAAQpxC,GACJ,OAAOmK,KAAK6O,KAAmB,iBAAPhZ,EAAkBA,EAAMA,EAAIA,KAMpD81D,gBACA,IAAK,IAAIhlD,KAAK3G,KAAK6O,KACf,OAAO,EACX,OAAO,EAMXkvB,iBAEI,OADA/9B,KAAKmrD,SA7M8C,EA8M5CnrD,KAKP4rD,uBACA,OApNmD,EAoN3C5rD,KAAKmrD,SAA4B,GAIjD,SAASzM,EAAK5sB,EAAG1xB,GACb,OAAQA,GAAS0xB,EAAQA,EAAE4sB,KAAKt+C,GAAX0xB,EAEzB,MAAM+5B,EACF71D,YAAYI,EAAM01D,EAAM1rD,GACpBJ,KAAK5J,KAAOA,EACZ4J,KAAKg1B,KAAO0pB,EAAKoN,EAAK92B,KAAM50B,GAC5BJ,KAAK0lB,MAAQg5B,EAAKoN,EAAKpmC,MAAOtlB,IAGtC,MAAM2rD,EAAa,CACf,IAAIF,EAAU,MAAO,CACjB72B,KAAKxf,GAAiBA,EAAOiI,KAAOjI,EAAO6Z,OAAOsvB,YAAY5uB,gBAC9DrK,MAAMgY,GAAaA,EAAGjgB,MAE1B,IAAIouC,EAAU,YAAa,CACvB72B,KAAI,CAACxf,EAAQ0oC,IAAmB1oC,EAAO6nB,WAAaqrB,EAAUtqB,QAAQ8f,EAASzgC,KAC/EiI,MAAMgY,GAAaA,EAAGL,YAE1B,IAAIwuB,EAAU,cAAe,CACzB72B,KAAKxf,GAAiBA,EAAOk1B,aAAe,KAC5ChlB,MAAK,CAACgY,EAAIsuB,EAAQC,EAAMjmD,IAAgBA,EAAMq3B,UAAUsM,QAAUjM,EAAGgN,YAAc,OAEvF,IAAImhB,EAAU,oBAAqB,CAC/B72B,KAAI,IAAY,EAChBtP,MAAK,CAACgY,EAAI6L,IAAe7L,EAAGkuB,iBAAmBriB,EAAO,EAAIA,KAKlE,MAAM2iB,EACFl2D,YAAYq5B,EAAQrC,GAChBhtB,KAAKqvB,OAASA,EACdrvB,KAAKgtB,QAAU,GACfhtB,KAAKmsD,aAAep3D,OAAO8S,OAAO,MAClC7H,KAAKqF,OAAS0mD,EAAWvzD,QACrBw0B,GACAA,EAAQwD,SAAQzD,IACZ,GAAI/sB,KAAKmsD,aAAap/B,EAAOl3B,KACzB,MAAM,IAAIk/C,WAAW,iDAAmDhoB,EAAOl3B,IAAM,KACzFmK,KAAKgtB,QAAQhyB,KAAK+xB,GAClB/sB,KAAKmsD,aAAap/B,EAAOl3B,KAAOk3B,EAC5BA,EAAO0C,KAAKzpB,OACZhG,KAAKqF,OAAOrK,KAAK,IAAI6wD,EAAU9+B,EAAOl3B,IAAKk3B,EAAO0C,KAAKzpB,MAAO+mB,QAalF,MAAMq/B,EAIFp2D,YAIAwf,GACIxV,KAAKwV,OAASA,EAKd6Z,aACA,OAAOrvB,KAAKwV,OAAO6Z,OAKnBrC,cACA,OAAOhtB,KAAKwV,OAAOwX,QAKvBtH,MAAMgY,GACF,OAAO19B,KAAKqsD,iBAAiB3uB,GAAI13B,MAKrCohC,kBAAkB1J,EAAIiiB,GAAS,GAC3B,IAAK,IAAIxoD,EAAI,EAAGA,EAAI6I,KAAKwV,OAAOwX,QAAQ51B,OAAQD,IAC5C,GAAIA,GAAKwoD,EAAQ,CACb,IAAI5yB,EAAS/sB,KAAKwV,OAAOwX,QAAQ71B,GACjC,GAAI41B,EAAO0C,KAAK2X,oBAAsBra,EAAO0C,KAAK2X,kBAAkB1xC,KAAKq3B,EAAQ2Q,EAAI19B,MACjF,OAAO,EAEnB,OAAO,EASXqsD,iBAAiBC,GACb,IAAKtsD,KAAKonC,kBAAkBklB,GACxB,MAAO,CAAEtmD,MAAOhG,KAAMusD,aAAc,IACxC,IAAIC,EAAM,CAACF,GAASG,EAAWzsD,KAAK0sD,WAAWJ,GAAS/pD,EAAO,KAI/D,OAAS,CACL,IAAIoqD,GAAU,EACd,IAAK,IAAIx1D,EAAI,EAAGA,EAAI6I,KAAKwV,OAAOwX,QAAQ51B,OAAQD,IAAK,CACjD,IAAI41B,EAAS/sB,KAAKwV,OAAOwX,QAAQ71B,GACjC,GAAI41B,EAAO0C,KAAKsX,kBAAmB,CAC/B,IAAI/Y,EAAIzrB,EAAOA,EAAKpL,GAAG62B,EAAI,EAAG4+B,EAAWrqD,EAAOA,EAAKpL,GAAG6O,MAAQhG,KAC5D09B,EAAK1P,EAAIw+B,EAAIp1D,QACb21B,EAAO0C,KAAKsX,kBAAkBrxC,KAAKq3B,EAAQiB,EAAIw+B,EAAIh0D,MAAMw1B,GAAKw+B,EAAKI,EAAUH,GACjF,GAAI/uB,GAAM+uB,EAASrlB,kBAAkB1J,EAAIvmC,GAAI,CAEzC,GADAumC,EAAGuF,QAAQ,sBAAuBqpB,IAC7B/pD,EAAM,CACPA,EAAO,GACP,IAAK,IAAI6uB,EAAI,EAAGA,EAAIpxB,KAAKwV,OAAOwX,QAAQ51B,OAAQg6B,IAC5C7uB,EAAKvH,KAAKo2B,EAAIj6B,EAAI,CAAE6O,MAAOymD,EAAUz+B,EAAGw+B,EAAIp1D,QAAW,CAAE4O,MAAOhG,KAAMguB,EAAG,IAEjFw+B,EAAIxxD,KAAK0iC,GACT+uB,EAAWA,EAASC,WAAWhvB,GAC/BivB,GAAU,EAEVpqD,IACAA,EAAKpL,GAAK,CAAE6O,MAAOymD,EAAUz+B,EAAGw+B,EAAIp1D,UAGhD,IAAKu1D,EACD,MAAO,CAAE3mD,MAAOymD,EAAUF,aAAcC,IAMpDE,WAAWhvB,GACP,IAAKA,EAAG5/B,OAAOg3C,GAAG90C,KAAKyd,KACnB,MAAM,IAAIs3B,WAAW,qCACzB,IAAI8X,EAAc,IAAIT,EAAYpsD,KAAKwV,QAASnQ,EAASrF,KAAKwV,OAAOnQ,OACrE,IAAK,IAAIlO,EAAI,EAAGA,EAAIkO,EAAOjO,OAAQD,IAAK,CACpC,IAAI6M,EAAQqB,EAAOlO,GACnB01D,EAAY7oD,EAAM5N,MAAQ4N,EAAM0hB,MAAMgY,EAAI19B,KAAKgE,EAAM5N,MAAO4J,KAAM6sD,GAEtE,OAAOA,EAKPnvB,SAAO,OAAO,IAAIutB,EAAYjrD,MAIlCgvB,cAAcxZ,GACV,IAAIs3C,EAAU,IAAIZ,EAAc12C,EAAOiI,IAAMjI,EAAOiI,IAAIrjB,KAAKi1B,OAAS7Z,EAAO6Z,OAAQ7Z,EAAOwX,SACxFkxB,EAAW,IAAIkO,EAAYU,GAC/B,IAAK,IAAI31D,EAAI,EAAGA,EAAI21D,EAAQznD,OAAOjO,OAAQD,IACvC+mD,EAAS4O,EAAQznD,OAAOlO,GAAGf,MAAQ02D,EAAQznD,OAAOlO,GAAG69B,KAAKxf,EAAQ0oC,GACtE,OAAOA,EAUX6O,YAAYv3C,GACR,IAAIs3C,EAAU,IAAIZ,EAAclsD,KAAKqvB,OAAQ7Z,EAAOwX,SAChD3nB,EAASynD,EAAQznD,OAAQ64C,EAAW,IAAIkO,EAAYU,GACxD,IAAK,IAAI31D,EAAI,EAAGA,EAAIkO,EAAOjO,OAAQD,IAAK,CACpC,IAAIf,EAAOiP,EAAOlO,GAAGf,KACrB8nD,EAAS9nD,GAAQ4J,KAAK/K,eAAemB,GAAQ4J,KAAK5J,GAAQiP,EAAOlO,GAAG69B,KAAKxf,EAAQ0oC,GAErF,OAAOA,EASXviB,OAAOqxB,GACH,IAAIp1D,EAAS,CAAE6lB,IAAKzd,KAAKyd,IAAIke,SAAU0B,UAAWr9B,KAAKq9B,UAAU1B,UAGjE,GAFI37B,KAAK0qC,cACL9yC,EAAO8yC,YAAc1qC,KAAK0qC,YAAYvjC,KAAIoqB,GAAKA,EAAEoK,YACjDqxB,GAAuC,iBAAhBA,EACvB,IAAK,IAAIpjC,KAAQojC,EAAc,CAC3B,GAAY,OAARpjC,GAAyB,aAARA,EACjB,MAAM,IAAImrB,WAAW,sDACzB,IAAIhoB,EAASigC,EAAapjC,GAAO5jB,EAAQ+mB,EAAO0C,KAAKzpB,MACjDA,GAASA,EAAM21B,SACf/jC,EAAOgyB,GAAQ5jB,EAAM21B,OAAOjmC,KAAKq3B,EAAQ/sB,KAAK+sB,EAAOl3B,OAEjE,OAAO+B,EASXo3B,gBAAgBxZ,EAAQogC,EAAMoX,GAC1B,IAAKpX,EACD,MAAM,IAAIb,WAAW,0CACzB,IAAKv/B,EAAO6Z,OACR,MAAM,IAAI0lB,WAAW,0CACzB,IAAI+X,EAAU,IAAIZ,EAAc12C,EAAO6Z,OAAQ7Z,EAAOwX,SAClDkxB,EAAW,IAAIkO,EAAYU,GAyB/B,OAxBAA,EAAQznD,OAAOmrB,SAAQxsB,IACnB,GAAkB,OAAdA,EAAM5N,KACN8nD,EAASzgC,IAAM,cAAcjI,EAAO6Z,OAAQumB,EAAKn4B,UAEhD,GAAkB,aAAdzZ,EAAM5N,KACX8nD,EAAS7gB,UAAYqrB,EAAUrS,SAAS6H,EAASzgC,IAAKm4B,EAAKvY,gBAE1D,GAAkB,eAAdr5B,EAAM5N,KACPw/C,EAAKlL,cACLwT,EAASxT,YAAckL,EAAKlL,YAAYvjC,IAAIqO,EAAO6Z,OAAOuqB,mBAE7D,CACD,GAAIoT,EACA,IAAK,IAAIpjC,KAAQojC,EAAc,CAC3B,IAAIjgC,EAASigC,EAAapjC,GAAO5jB,EAAQ+mB,EAAO0C,KAAKzpB,MACrD,GAAI+mB,EAAOl3B,KAAOmO,EAAM5N,MAAQ4P,GAASA,EAAMqwC,UAC3CthD,OAAOC,UAAUC,eAAeS,KAAKkgD,EAAMhsB,GAE3C,YADAs0B,EAASl6C,EAAM5N,MAAQ4P,EAAMqwC,SAAS3gD,KAAKq3B,EAAQvX,EAAQogC,EAAKhsB,GAAOs0B,IAInFA,EAASl6C,EAAM5N,MAAQ4N,EAAMgxB,KAAKxf,EAAQ0oC,OAG3CA,GAIf,SAAS+O,EAAUr3D,EAAKwK,EAAMlK,GAC1B,IAAK,IAAI0zB,KAAQh0B,EAAK,CAClB,IAAIgiD,EAAMhiD,EAAIg0B,GACVguB,aAAejG,SACfiG,EAAMA,EAAI8G,KAAKt+C,GACF,mBAARwpB,IACLguB,EAAMqV,EAAUrV,EAAKx3C,EAAM,KAC/BlK,EAAO0zB,GAAQguB,EAEnB,OAAO1hD,EAOX,MAAMg3D,EAIFl3D,YAIAy5B,GACIzvB,KAAKyvB,KAAOA,EAIZzvB,KAAK6wB,MAAQ,GACTpB,EAAKoB,OACLo8B,EAAUx9B,EAAKoB,MAAO7wB,KAAMA,KAAK6wB,OACrC7wB,KAAKnK,IAAM45B,EAAK55B,IAAM45B,EAAK55B,IAAIA,IAAMs3D,EAAU,UAKnD9mB,SAASrgC,GAAS,OAAOA,EAAMhG,KAAKnK,MAExC,MAAMyiC,EAAOvjC,OAAO8S,OAAO,MAC3B,SAASslD,EAAU/2D,GACf,OAAIA,KAAQkiC,EACDliC,EAAO,OAAQkiC,EAAKliC,IAC/BkiC,EAAKliC,GAAQ,EACNA,EAAO,KAQlB,MAAMg3D,EAIFp3D,YAAYI,EAAO,OAAS4J,KAAKnK,IAAMs3D,EAAU/2D,GAKjD+3B,IAAInoB,GAAS,OAAOA,EAAMwP,OAAO22C,aAAansD,KAAKnK,KAInDwwC,SAASrgC,GAAS,OAAOA,EAAMhG,KAAKnK,Q,2SC59BxC,MACMw3D,EAAWlwC,KAAKmwC,IAAI,EAAG,IAE7B,SAASC,EAAah3D,GAAS,OAHf,MAGsBA,EAOtC,MAAMi3D,EAIFx3D,YAIAof,EAIAq4C,EAIAC,GACI1tD,KAAKoV,IAAMA,EACXpV,KAAKytD,QAAUA,EACfztD,KAAK0tD,QAAUA,EAOfpD,cAAY,OA/B4C,EA+BpCtqD,KAAKytD,SAAsB,EAI/CE,oBAAkB,OAAuB,EAAf3tD,KAAKytD,SAAuC,EAItEG,mBAAiB,OAAuB,EAAf5tD,KAAKytD,SAAsC,EAMpEI,oBAAkB,OA7CwB,EA6ChB7tD,KAAKytD,SAAwB,GAQ/D,MAAMK,EAMF93D,YAIA85C,EAIAie,GAAW,GAGP,GAFA/tD,KAAK8vC,OAASA,EACd9vC,KAAK+tD,SAAWA,GACXje,EAAO14C,QAAU02D,EAAQjuB,MAC1B,OAAOiuB,EAAQjuB,MAKvB6tB,QAAQn3D,GACJ,IAAIy3D,EAAO,EAAGr2D,EAAQ41D,EAAah3D,GACnC,IAAKyJ,KAAK+tD,SACN,IAAK,IAAI52D,EAAI,EAAGA,EAAIQ,EAAOR,IACvB62D,GAAQhuD,KAAK8vC,OAAW,EAAJ34C,EAAQ,GAAK6I,KAAK8vC,OAAW,EAAJ34C,EAAQ,GAC7D,OAAO6I,KAAK8vC,OAAe,EAARn4C,GAAaq2D,EAlFxC,SAAuBz3D,GAAS,OAAQA,GAJxB,MAIiCA,IAAoB82D,EAkFtBY,CAAc13D,GAEzDg0D,UAAUn1C,EAAK84C,EAAQ,GAAK,OAAOluD,KAAKmuD,KAAK/4C,EAAK84C,GAAO,GACzD/mD,IAAIiO,EAAK84C,EAAQ,GAAK,OAAOluD,KAAKmuD,KAAK/4C,EAAK84C,GAAO,GAInDC,KAAK/4C,EAAK84C,EAAOE,GACb,IAAIJ,EAAO,EAAGK,EAAWruD,KAAK+tD,SAAW,EAAI,EAAGO,EAAWtuD,KAAK+tD,SAAW,EAAI,EAC/E,IAAK,IAAI52D,EAAI,EAAGA,EAAI6I,KAAK8vC,OAAO14C,OAAQD,GAAK,EAAG,CAC5C,IAAIM,EAAQuI,KAAK8vC,OAAO34C,IAAM6I,KAAK+tD,SAAWC,EAAO,GACrD,GAAIv2D,EAAQ2d,EACR,MACJ,IAAIm5C,EAAUvuD,KAAK8vC,OAAO34C,EAAIk3D,GAAWG,EAAUxuD,KAAK8vC,OAAO34C,EAAIm3D,GAAW52D,EAAMD,EAAQ82D,EAC5F,GAAIn5C,GAAO1d,EAAK,CACZ,IACIE,EAASH,EAAQu2D,IADTO,EAAkBn5C,GAAO3d,GAAS,EAAI2d,GAAO1d,EAAM,EAAIw2D,EAA7CA,GACc,EAAI,EAAIM,GAC5C,GAAIJ,EACA,OAAOx2D,EACX,IAAI81D,EAAUt4C,IAAQ84C,EAAQ,EAAIz2D,EAAQC,GAAO,KAAmBP,EAAI,GAAGie,EAAM3d,GAvGnC41D,EAwG1C1c,EAAMv7B,GAAO3d,EArGC,EAqGmB2d,GAAO1d,EArGzC,EAA+B,EAwGlC,OAFIw2D,EAAQ,EAAI94C,GAAO3d,EAAQ2d,GAAO1d,KAClCi5C,GAvG4C,GAwGzC,IAAI6c,EAAU51D,EAAQ+4C,EAAK+c,GAEtCM,GAAQQ,EAAUD,EAEtB,OAAOH,EAASh5C,EAAM44C,EAAO,IAAIR,EAAUp4C,EAAM44C,EAAM,EAAG,MAK9DS,QAAQr5C,EAAKs4C,GACT,IAAIM,EAAO,EAAGr2D,EAAQ41D,EAAaG,GAC/BW,EAAWruD,KAAK+tD,SAAW,EAAI,EAAGO,EAAWtuD,KAAK+tD,SAAW,EAAI,EACrE,IAAK,IAAI52D,EAAI,EAAGA,EAAI6I,KAAK8vC,OAAO14C,OAAQD,GAAK,EAAG,CAC5C,IAAIM,EAAQuI,KAAK8vC,OAAO34C,IAAM6I,KAAK+tD,SAAWC,EAAO,GACrD,GAAIv2D,EAAQ2d,EACR,MACJ,IAAIm5C,EAAUvuD,KAAK8vC,OAAO34C,EAAIk3D,GAC9B,GAAIj5C,GAD2C3d,EAAQ82D,GACrCp3D,GAAa,EAARQ,EACnB,OAAO,EACXq2D,GAAQhuD,KAAK8vC,OAAO34C,EAAIm3D,GAAYC,EAExC,OAAO,EAMX/9B,QAAQsB,GACJ,IAAIu8B,EAAWruD,KAAK+tD,SAAW,EAAI,EAAGO,EAAWtuD,KAAK+tD,SAAW,EAAI,EACrE,IAAK,IAAI52D,EAAI,EAAG62D,EAAO,EAAG72D,EAAI6I,KAAK8vC,OAAO14C,OAAQD,GAAK,EAAG,CACtD,IAAIM,EAAQuI,KAAK8vC,OAAO34C,GAAIu3D,EAAWj3D,GAASuI,KAAK+tD,SAAWC,EAAO,GAAIW,EAAWl3D,GAASuI,KAAK+tD,SAAW,EAAIC,GAC/GO,EAAUvuD,KAAK8vC,OAAO34C,EAAIk3D,GAAWG,EAAUxuD,KAAK8vC,OAAO34C,EAAIm3D,GACnEx8B,EAAE48B,EAAUA,EAAWH,EAASI,EAAUA,EAAWH,GACrDR,GAAQQ,EAAUD,GAO1Bhd,SACI,OAAO,IAAIuc,EAAQ9tD,KAAK8vC,QAAS9vC,KAAK+tD,UAK1C54D,WACI,OAAQ6K,KAAK+tD,SAAW,IAAM,IAAMzlC,KAAKC,UAAUvoB,KAAK8vC,QAO5D9gB,cAAchB,GACV,OAAY,GAALA,EAAS8/B,EAAQjuB,MAAQ,IAAIiuB,EAAQ9/B,EAAI,EAAI,CAAC,GAAIA,EAAG,GAAK,CAAC,EAAG,EAAGA,KAMhF8/B,EAAQjuB,MAAQ,IAAIiuB,EAAQ,IAS5B,MAAMc,EAIF54D,YAIA40D,EAAO,GAIPiE,EAKA/zD,EAAO,EAIPglC,EAAK8qB,EAAKxzD,QACN4I,KAAK4qD,KAAOA,EACZ5qD,KAAK6uD,OAASA,EACd7uD,KAAKlF,KAAOA,EACZkF,KAAK8/B,GAAKA,EAKdtnC,MAAMsC,EAAO,EAAGglC,EAAK9/B,KAAK4qD,KAAKxzD,QAC3B,OAAO,IAAIw3D,EAAQ5uD,KAAK4qD,KAAM5qD,KAAK6uD,OAAQ/zD,EAAMglC,GAKrD/oC,OACI,OAAO,IAAI63D,EAAQ5uD,KAAK4qD,KAAKpyD,QAASwH,KAAK6uD,QAAU7uD,KAAK6uD,OAAOr2D,QAASwH,KAAKlF,KAAMkF,KAAK8/B,IAO9FgvB,UAAU3nD,EAAK4nD,GACX/uD,KAAK8/B,GAAK9/B,KAAK4qD,KAAK5vD,KAAKmM,GACV,MAAX4nD,GACA/uD,KAAKgvD,UAAUhvD,KAAK4qD,KAAKxzD,OAAS,EAAG23D,GAM7CE,cAAcnxB,GACV,IAAK,IAAI3mC,EAAI,EAAG+3D,EAAYlvD,KAAK4qD,KAAKxzD,OAAQD,EAAI2mC,EAAQ8sB,KAAKxzD,OAAQD,IAAK,CACxE,IAAIg4D,EAAOrxB,EAAQsxB,UAAUj4D,GAC7B6I,KAAK8uD,UAAUhxB,EAAQ8sB,KAAKzzD,GAAY,MAARg4D,GAAgBA,EAAOh4D,EAAI+3D,EAAYC,OAAOr3D,IAQtFs3D,UAAUphC,GACN,GAAIhuB,KAAK6uD,OACL,IAAK,IAAI13D,EAAI,EAAGA,EAAI6I,KAAK6uD,OAAOz3D,OAAQD,IACpC,GAAI6I,KAAK6uD,OAAO13D,IAAM62B,EAClB,OAAOhuB,KAAK6uD,OAAO13D,GAAKA,EAAI,GAAK,EAAI,IAKrD63D,UAAUhhC,EAAGuD,GACJvxB,KAAK6uD,SACN7uD,KAAK6uD,OAAS,IAClB7uD,KAAK6uD,OAAO7zD,KAAKgzB,EAAGuD,GAKxB89B,sBAAsBvxB,GAClB,IAAK,IAAI3mC,EAAI2mC,EAAQ8sB,KAAKxzD,OAAS,EAAGk4D,EAAYtvD,KAAK4qD,KAAKxzD,OAAS0mC,EAAQ8sB,KAAKxzD,OAAQD,GAAK,EAAGA,IAAK,CACnG,IAAIg4D,EAAOrxB,EAAQsxB,UAAUj4D,GAC7B6I,KAAK8uD,UAAUhxB,EAAQ8sB,KAAKzzD,GAAGo6C,SAAkB,MAAR4d,GAAgBA,EAAOh4D,EAAIm4D,EAAYH,EAAO,OAAIr3D,IAMnGy5C,SACI,IAAIge,EAAU,IAAIX,EAElB,OADAW,EAAQF,sBAAsBrvD,MACvBuvD,EAKXpoD,IAAIiO,EAAK84C,EAAQ,GACb,GAAIluD,KAAK6uD,OACL,OAAO7uD,KAAKmuD,KAAK/4C,EAAK84C,GAAO,GACjC,IAAK,IAAI/2D,EAAI6I,KAAKlF,KAAM3D,EAAI6I,KAAK8/B,GAAI3oC,IACjCie,EAAMpV,KAAK4qD,KAAKzzD,GAAGgQ,IAAIiO,EAAK84C,GAChC,OAAO94C,EAMXm1C,UAAUn1C,EAAK84C,EAAQ,GAAK,OAAOluD,KAAKmuD,KAAK/4C,EAAK84C,GAAO,GAIzDC,KAAK/4C,EAAK84C,EAAOE,GACb,IAAIX,EAAU,EACd,IAAK,IAAIt2D,EAAI6I,KAAKlF,KAAM3D,EAAI6I,KAAK8/B,GAAI3oC,IAAK,CACtC,IAAwBS,EAAdoI,KAAK4qD,KAAKzzD,GAAiBozD,UAAUn1C,EAAK84C,GACpD,GAAsB,MAAlBt2D,EAAO81D,QAAiB,CACxB,IAAI8B,EAAOxvD,KAAKovD,UAAUj4D,GAC1B,GAAY,MAARq4D,GAAgBA,EAAOr4D,GAAKq4D,EAAOxvD,KAAK8/B,GAAI,CAC5C3oC,EAAIq4D,EACJp6C,EAAMpV,KAAK4qD,KAAK4E,GAAM9B,QAAQ91D,EAAO81D,SACrC,UAGRD,GAAW71D,EAAO61D,QAClBr4C,EAAMxd,EAAOwd,IAEjB,OAAOg5C,EAASh5C,EAAM,IAAIo4C,EAAUp4C,EAAKq4C,EAAS,OAI1D,MAAMgC,EAAY16D,OAAO8S,OAAO,MAYhC,MAAM6nD,EAMFC,SAAW,OAAO7B,EAAQjuB,MAM1B+vB,MAAMnb,GAAS,OAAO,KAKtBzlB,gBAAgBK,EAAQumB,GACpB,IAAKA,IAASA,EAAKia,SACf,MAAM,IAAI9a,WAAW,mCACzB,IAAI36C,EAAOq1D,EAAU7Z,EAAKia,UAC1B,IAAKz1D,EACD,MAAM,IAAI26C,WAAW,gBAAgBa,EAAKia,oBAC9C,OAAOz1D,EAAKi8C,SAAShnB,EAAQumB,GAQjC5mB,cAAc9K,EAAI4rC,GACd,GAAI5rC,KAAMurC,EACN,MAAM,IAAI1a,WAAW,iCAAmC7wB,GAG5D,OAFAurC,EAAUvrC,GAAM4rC,EAChBA,EAAU96D,UAAU40D,OAAS1lC,EACtB4rC,GAOf,MAAMC,EAIF/5D,YAIAynB,EAIAuyC,GACIhwD,KAAKyd,IAAMA,EACXzd,KAAKgwD,OAASA,EAKlBhhC,UAAUvR,GAAO,OAAO,IAAIsyC,EAAWtyC,EAAK,MAI5CuR,YAAYvI,GAAW,OAAO,IAAIspC,EAAW,KAAMtpC,GAMnDuI,mBAAmBvR,EAAK3iB,EAAMglC,EAAItnC,GAC9B,IACI,OAAOu3D,EAAW7wD,GAAGue,EAAInT,QAAQxP,EAAMglC,EAAItnC,IAE/C,MAAOg3B,GACH,GAAIA,aAAa,KACb,OAAOugC,EAAW/lC,KAAKwF,EAAE/I,SAC7B,MAAM+I,IAKlB,SAASygC,EAAY1zC,EAAUuV,EAAGxQ,GAC9B,IAAI4uC,EAAS,GACb,IAAK,IAAI/4D,EAAI,EAAGA,EAAIolB,EAASihB,WAAYrmC,IAAK,CAC1C,IAAIktB,EAAQ9H,EAAS8H,MAAMltB,GACvBktB,EAAMzkB,QAAQL,OACd8kB,EAAQA,EAAMttB,KAAKk5D,EAAY5rC,EAAMzkB,QAASkyB,EAAGzN,KACjDA,EAAMwe,WACNxe,EAAQyN,EAAEzN,EAAO/C,EAAQnqB,IAC7B+4D,EAAOl1D,KAAKqpB,GAEhB,OAAO,eAAmB6rC,GAK9B,MAAMC,UAAoBT,EAItB15D,YAIA8E,EAIAglC,EAIAX,GACIhZ,QACAnmB,KAAKlF,KAAOA,EACZkF,KAAK8/B,GAAKA,EACV9/B,KAAKm/B,KAAOA,EAEhBzZ,MAAMjI,GACF,IAAI2yC,EAAW3yC,EAAIjlB,MAAMwH,KAAKlF,KAAMkF,KAAK8/B,IAAK3C,EAAQ1f,EAAIpa,QAAQrD,KAAKlF,MACnEwmB,EAAS6b,EAAMhjC,KAAKgjC,EAAM8a,YAAYj4C,KAAK8/B,KAC3CtnC,EAAQ,IAAI,KAAMy3D,EAAYG,EAASxwD,SAAS,CAACzF,EAAMmnB,IAClDnnB,EAAKozC,QAAWjsB,EAAOlnB,KAAK81C,eAAelwC,KAAKm/B,KAAK/kC,MAEnDD,EAAKglC,KAAKn/B,KAAKm/B,KAAKjP,SAAS/1B,EAAKi1B,QAD9Bj1B,GAEZmnB,GAAS8uC,EAASra,UAAWqa,EAASpa,SACzC,OAAO+Z,EAAWM,YAAY5yC,EAAKzd,KAAKlF,KAAMkF,KAAK8/B,GAAItnC,GAE3D+4C,SACI,OAAO,IAAI+e,EAAetwD,KAAKlF,KAAMkF,KAAK8/B,GAAI9/B,KAAKm/B,MAEvDh4B,IAAI22B,GACA,IAAIhjC,EAAOgjC,EAAQysB,UAAUvqD,KAAKlF,KAAM,GAAIglC,EAAKhC,EAAQysB,UAAUvqD,KAAK8/B,IAAK,GAC7E,OAAIhlC,EAAKwvD,SAAWxqB,EAAGwqB,SAAWxvD,EAAKsa,KAAO0qB,EAAG1qB,IACtC,KACJ,IAAI+6C,EAAYr1D,EAAKsa,IAAK0qB,EAAG1qB,IAAKpV,KAAKm/B,MAElDywB,MAAMnb,GACF,OAAIA,aAAiB0b,GACjB1b,EAAMtV,KAAK2V,GAAG90C,KAAKm/B,OACnBn/B,KAAKlF,MAAQ25C,EAAM3U,IAAM9/B,KAAK8/B,IAAM2U,EAAM35C,KACnC,IAAIq1D,EAAYhzC,KAAKgE,IAAInhB,KAAKlF,KAAM25C,EAAM35C,MAAOqiB,KAAKhe,IAAIa,KAAK8/B,GAAI2U,EAAM3U,IAAK9/B,KAAKm/B,MACvF,KAEXxD,SACI,MAAO,CAAEk0B,SAAU,UAAW1wB,KAAMn/B,KAAKm/B,KAAKxD,SAC1C7gC,KAAMkF,KAAKlF,KAAMglC,GAAI9/B,KAAK8/B,IAKlC9Q,gBAAgBK,EAAQumB,GACpB,GAAwB,iBAAbA,EAAK96C,MAAsC,iBAAX86C,EAAK9V,GAC5C,MAAM,IAAIiV,WAAW,0CACzB,OAAO,IAAIob,EAAYva,EAAK96C,KAAM86C,EAAK9V,GAAIzQ,EAAOuqB,aAAahE,EAAKzW,QAG5EuwB,EAAK9F,OAAO,UAAWuG,GAIvB,MAAMG,UAAuBZ,EAIzB15D,YAIA8E,EAIAglC,EAIAX,GACIhZ,QACAnmB,KAAKlF,KAAOA,EACZkF,KAAK8/B,GAAKA,EACV9/B,KAAKm/B,KAAOA,EAEhBzZ,MAAMjI,GACF,IAAI2yC,EAAW3yC,EAAIjlB,MAAMwH,KAAKlF,KAAMkF,KAAK8/B,IACrCtnC,EAAQ,IAAI,KAAMy3D,EAAYG,EAASxwD,SAASzF,GACzCA,EAAKglC,KAAKn/B,KAAKm/B,KAAK/O,cAAcj2B,EAAKi1B,SAC/C3R,GAAM2yC,EAASra,UAAWqa,EAASpa,SACtC,OAAO+Z,EAAWM,YAAY5yC,EAAKzd,KAAKlF,KAAMkF,KAAK8/B,GAAItnC,GAE3D+4C,SACI,OAAO,IAAI4e,EAAYnwD,KAAKlF,KAAMkF,KAAK8/B,GAAI9/B,KAAKm/B,MAEpDh4B,IAAI22B,GACA,IAAIhjC,EAAOgjC,EAAQysB,UAAUvqD,KAAKlF,KAAM,GAAIglC,EAAKhC,EAAQysB,UAAUvqD,KAAK8/B,IAAK,GAC7E,OAAIhlC,EAAKwvD,SAAWxqB,EAAGwqB,SAAWxvD,EAAKsa,KAAO0qB,EAAG1qB,IACtC,KACJ,IAAIk7C,EAAex1D,EAAKsa,IAAK0qB,EAAG1qB,IAAKpV,KAAKm/B,MAErDywB,MAAMnb,GACF,OAAIA,aAAiB6b,GACjB7b,EAAMtV,KAAK2V,GAAG90C,KAAKm/B,OACnBn/B,KAAKlF,MAAQ25C,EAAM3U,IAAM9/B,KAAK8/B,IAAM2U,EAAM35C,KACnC,IAAIw1D,EAAenzC,KAAKgE,IAAInhB,KAAKlF,KAAM25C,EAAM35C,MAAOqiB,KAAKhe,IAAIa,KAAK8/B,GAAI2U,EAAM3U,IAAK9/B,KAAKm/B,MAC1F,KAEXxD,SACI,MAAO,CAAEk0B,SAAU,aAAc1wB,KAAMn/B,KAAKm/B,KAAKxD,SAC7C7gC,KAAMkF,KAAKlF,KAAMglC,GAAI9/B,KAAK8/B,IAKlC9Q,gBAAgBK,EAAQumB,GACpB,GAAwB,iBAAbA,EAAK96C,MAAsC,iBAAX86C,EAAK9V,GAC5C,MAAM,IAAIiV,WAAW,6CACzB,OAAO,IAAIub,EAAe1a,EAAK96C,KAAM86C,EAAK9V,GAAIzQ,EAAOuqB,aAAahE,EAAKzW,QAG/EuwB,EAAK9F,OAAO,aAAc0G,GAI1B,MAAMC,UAAwBb,EAI1B15D,YAIAof,EAIA+pB,GACIhZ,QACAnmB,KAAKoV,IAAMA,EACXpV,KAAKm/B,KAAOA,EAEhBzZ,MAAMjI,GACF,IAAItjB,EAAOsjB,EAAIu7B,OAAOh5C,KAAKoV,KAC3B,IAAKjb,EACD,OAAO41D,EAAW/lC,KAAK,mCAC3B,IAAImhC,EAAUhxD,EAAKC,KAAKyN,OAAO1N,EAAK40B,MAAO,KAAM/uB,KAAKm/B,KAAKjP,SAAS/1B,EAAKi1B,QACzE,OAAO2gC,EAAWM,YAAY5yC,EAAKzd,KAAKoV,IAAKpV,KAAKoV,IAAM,EAAG,IAAI,KAAM,UAAc+1C,GAAU,EAAGhxD,EAAKq6C,OAAS,EAAI,IAEtHjD,OAAO9zB,GACH,IAAItjB,EAAOsjB,EAAIu7B,OAAOh5C,KAAKoV,KAC3B,GAAIjb,EAAM,CACN,IAAIq2D,EAASxwD,KAAKm/B,KAAKjP,SAAS/1B,EAAKi1B,OACrC,GAAIohC,EAAOp5D,QAAU+C,EAAKi1B,MAAMh4B,OAAQ,CACpC,IAAK,IAAID,EAAI,EAAGA,EAAIgD,EAAKi1B,MAAMh4B,OAAQD,IACnC,IAAKgD,EAAKi1B,MAAMj4B,GAAGm7B,QAAQk+B,GACvB,OAAO,IAAID,EAAgBvwD,KAAKoV,IAAKjb,EAAKi1B,MAAMj4B,IACxD,OAAO,IAAIo5D,EAAgBvwD,KAAKoV,IAAKpV,KAAKm/B,OAGlD,OAAO,IAAIsxB,EAAmBzwD,KAAKoV,IAAKpV,KAAKm/B,MAEjDh4B,IAAI22B,GACA,IAAI1oB,EAAM0oB,EAAQysB,UAAUvqD,KAAKoV,IAAK,GACtC,OAAOA,EAAIw4C,aAAe,KAAO,IAAI2C,EAAgBn7C,EAAIA,IAAKpV,KAAKm/B,MAEvExD,SACI,MAAO,CAAEk0B,SAAU,cAAez6C,IAAKpV,KAAKoV,IAAK+pB,KAAMn/B,KAAKm/B,KAAKxD,UAKrE3M,gBAAgBK,EAAQumB,GACpB,GAAuB,iBAAZA,EAAKxgC,IACZ,MAAM,IAAI2/B,WAAW,8CACzB,OAAO,IAAIwb,EAAgB3a,EAAKxgC,IAAKia,EAAOuqB,aAAahE,EAAKzW,QAGtEuwB,EAAK9F,OAAO,cAAe2G,GAI3B,MAAME,UAA2Bf,EAI7B15D,YAIAof,EAIA+pB,GACIhZ,QACAnmB,KAAKoV,IAAMA,EACXpV,KAAKm/B,KAAOA,EAEhBzZ,MAAMjI,GACF,IAAItjB,EAAOsjB,EAAIu7B,OAAOh5C,KAAKoV,KAC3B,IAAKjb,EACD,OAAO41D,EAAW/lC,KAAK,mCAC3B,IAAImhC,EAAUhxD,EAAKC,KAAKyN,OAAO1N,EAAK40B,MAAO,KAAM/uB,KAAKm/B,KAAK/O,cAAcj2B,EAAKi1B,QAC9E,OAAO2gC,EAAWM,YAAY5yC,EAAKzd,KAAKoV,IAAKpV,KAAKoV,IAAM,EAAG,IAAI,KAAM,UAAc+1C,GAAU,EAAGhxD,EAAKq6C,OAAS,EAAI,IAEtHjD,OAAO9zB,GACH,IAAItjB,EAAOsjB,EAAIu7B,OAAOh5C,KAAKoV,KAC3B,OAAKjb,GAAS6F,KAAKm/B,KAAK7M,QAAQn4B,EAAKi1B,OAE9B,IAAImhC,EAAgBvwD,KAAKoV,IAAKpV,KAAKm/B,MAD/Bn/B,KAGfmH,IAAI22B,GACA,IAAI1oB,EAAM0oB,EAAQysB,UAAUvqD,KAAKoV,IAAK,GACtC,OAAOA,EAAIw4C,aAAe,KAAO,IAAI6C,EAAmBr7C,EAAIA,IAAKpV,KAAKm/B,MAE1ExD,SACI,MAAO,CAAEk0B,SAAU,iBAAkBz6C,IAAKpV,KAAKoV,IAAK+pB,KAAMn/B,KAAKm/B,KAAKxD,UAKxE3M,gBAAgBK,EAAQumB,GACpB,GAAuB,iBAAZA,EAAKxgC,IACZ,MAAM,IAAI2/B,WAAW,iDACzB,OAAO,IAAI0b,EAAmB7a,EAAKxgC,IAAKia,EAAOuqB,aAAahE,EAAKzW,QAGzEuwB,EAAK9F,OAAO,iBAAkB6G,GAK9B,MAAMC,UAAoBhB,EAUtB15D,YAIA8E,EAIAglC,EAIAtnC,EAIAsvD,GAAY,GACR3hC,QACAnmB,KAAKlF,KAAOA,EACZkF,KAAK8/B,GAAKA,EACV9/B,KAAKxH,MAAQA,EACbwH,KAAK8nD,UAAYA,EAErBpiC,MAAMjI,GACF,OAAIzd,KAAK8nD,WAAa6I,EAAelzC,EAAKzd,KAAKlF,KAAMkF,KAAK8/B,IAC/CiwB,EAAW/lC,KAAK,6CACpB+lC,EAAWM,YAAY5yC,EAAKzd,KAAKlF,KAAMkF,KAAK8/B,GAAI9/B,KAAKxH,OAEhEm3D,SACI,OAAO,IAAI7B,EAAQ,CAAC9tD,KAAKlF,KAAMkF,KAAK8/B,GAAK9/B,KAAKlF,KAAMkF,KAAKxH,MAAM+G,OAEnEgyC,OAAO9zB,GACH,OAAO,IAAIizC,EAAY1wD,KAAKlF,KAAMkF,KAAKlF,KAAOkF,KAAKxH,MAAM+G,KAAMke,EAAIjlB,MAAMwH,KAAKlF,KAAMkF,KAAK8/B,KAE7F34B,IAAI22B,GACA,IAAIhjC,EAAOgjC,EAAQysB,UAAUvqD,KAAKlF,KAAM,GAAIglC,EAAKhC,EAAQysB,UAAUvqD,KAAK8/B,IAAK,GAC7E,OAAIhlC,EAAK+yD,eAAiB/tB,EAAG+tB,cAClB,KACJ,IAAI6C,EAAY51D,EAAKsa,IAAK+H,KAAKhe,IAAIrE,EAAKsa,IAAK0qB,EAAG1qB,KAAMpV,KAAKxH,OAEtEo3D,MAAMnb,GACF,KAAMA,aAAiBic,IAAgBjc,EAAMqT,WAAa9nD,KAAK8nD,UAC3D,OAAO,KACX,GAAI9nD,KAAKlF,KAAOkF,KAAKxH,MAAM+G,MAAQk1C,EAAM35C,MAASkF,KAAKxH,MAAMw9C,SAAYvB,EAAMj8C,MAAMu9C,UAKhF,IAAItB,EAAM3U,IAAM9/B,KAAKlF,MAASkF,KAAKxH,MAAMu9C,WAActB,EAAMj8C,MAAMw9C,QAMpE,OAAO,KANsE,CAC7E,IAAIx9C,EAAQwH,KAAKxH,MAAM+G,KAAOk1C,EAAMj8C,MAAM+G,MAAQ,EAAI,WAChD,IAAI,KAAMk1C,EAAMj8C,MAAMoH,QAAQ4+B,OAAOx+B,KAAKxH,MAAMoH,SAAU60C,EAAMj8C,MAAMu9C,UAAW/1C,KAAKxH,MAAMw9C,SAClG,OAAO,IAAI0a,EAAYjc,EAAM35C,KAAMkF,KAAK8/B,GAAItnC,EAAOwH,KAAK8nD,YARoC,CAC5F,IAAItvD,EAAQwH,KAAKxH,MAAM+G,KAAOk1C,EAAMj8C,MAAM+G,MAAQ,EAAI,WAChD,IAAI,KAAMS,KAAKxH,MAAMoH,QAAQ4+B,OAAOiW,EAAMj8C,MAAMoH,SAAUI,KAAKxH,MAAMu9C,UAAWtB,EAAMj8C,MAAMw9C,SAClG,OAAO,IAAI0a,EAAY1wD,KAAKlF,KAAMkF,KAAK8/B,IAAM2U,EAAM3U,GAAK2U,EAAM35C,MAAOtC,EAAOwH,KAAK8nD,YAWzFnsB,SACI,IAAIia,EAAO,CAAEia,SAAU,UAAW/0D,KAAMkF,KAAKlF,KAAMglC,GAAI9/B,KAAK8/B,IAK5D,OAJI9/B,KAAKxH,MAAM+G,OACXq2C,EAAKp9C,MAAQwH,KAAKxH,MAAMmjC,UACxB37B,KAAK8nD,YACLlS,EAAKkS,WAAY,GACdlS,EAKX5mB,gBAAgBK,EAAQumB,GACpB,GAAwB,iBAAbA,EAAK96C,MAAsC,iBAAX86C,EAAK9V,GAC5C,MAAM,IAAIiV,WAAW,0CACzB,OAAO,IAAI2b,EAAY9a,EAAK96C,KAAM86C,EAAK9V,GAAI,cAAezQ,EAAQumB,EAAKp9C,SAAUo9C,EAAKkS,YAG9F4H,EAAK9F,OAAO,UAAW8G,GAMvB,MAAME,UAA0BlB,EAO5B15D,YAIA8E,EAIAglC,EAIA+wB,EAIAC,EAIAt4D,EAKA6qC,EAIAykB,GAAY,GACR3hC,QACAnmB,KAAKlF,KAAOA,EACZkF,KAAK8/B,GAAKA,EACV9/B,KAAK6wD,QAAUA,EACf7wD,KAAK8wD,MAAQA,EACb9wD,KAAKxH,MAAQA,EACbwH,KAAKqjC,OAASA,EACdrjC,KAAK8nD,UAAYA,EAErBpiC,MAAMjI,GACF,GAAIzd,KAAK8nD,YAAc6I,EAAelzC,EAAKzd,KAAKlF,KAAMkF,KAAK6wD,UACvDF,EAAelzC,EAAKzd,KAAK8wD,MAAO9wD,KAAK8/B,KACrC,OAAOiwB,EAAW/lC,KAAK,iDAC3B,IAAI+mC,EAAMtzC,EAAIjlB,MAAMwH,KAAK6wD,QAAS7wD,KAAK8wD,OACvC,GAAIC,EAAIhb,WAAagb,EAAI/a,QACrB,OAAO+Z,EAAW/lC,KAAK,2BAC3B,IAAIgnC,EAAWhxD,KAAKxH,MAAMy9C,SAASj2C,KAAKqjC,OAAQ0tB,EAAInxD,SACpD,OAAKoxD,EAEEjB,EAAWM,YAAY5yC,EAAKzd,KAAKlF,KAAMkF,KAAK8/B,GAAIkxB,GAD5CjB,EAAW/lC,KAAK,+BAG/B2lC,SACI,OAAO,IAAI7B,EAAQ,CAAC9tD,KAAKlF,KAAMkF,KAAK6wD,QAAU7wD,KAAKlF,KAAMkF,KAAKqjC,OAC1DrjC,KAAK8wD,MAAO9wD,KAAK8/B,GAAK9/B,KAAK8wD,MAAO9wD,KAAKxH,MAAM+G,KAAOS,KAAKqjC,SAEjEkO,OAAO9zB,GACH,IAAIszC,EAAM/wD,KAAK8wD,MAAQ9wD,KAAK6wD,QAC5B,OAAO,IAAID,EAAkB5wD,KAAKlF,KAAMkF,KAAKlF,KAAOkF,KAAKxH,MAAM+G,KAAOwxD,EAAK/wD,KAAKlF,KAAOkF,KAAKqjC,OAAQrjC,KAAKlF,KAAOkF,KAAKqjC,OAAS0tB,EAAKtzC,EAAIjlB,MAAMwH,KAAKlF,KAAMkF,KAAK8/B,IAAIqW,cAAcn2C,KAAK6wD,QAAU7wD,KAAKlF,KAAMkF,KAAK8wD,MAAQ9wD,KAAKlF,MAAOkF,KAAK6wD,QAAU7wD,KAAKlF,KAAMkF,KAAK8nD,WAErQ3gD,IAAI22B,GACA,IAAIhjC,EAAOgjC,EAAQysB,UAAUvqD,KAAKlF,KAAM,GAAIglC,EAAKhC,EAAQysB,UAAUvqD,KAAK8/B,IAAK,GACzE+wB,EAAU/yB,EAAQ32B,IAAInH,KAAK6wD,SAAU,GAAIC,EAAQhzB,EAAQ32B,IAAInH,KAAK8wD,MAAO,GAC7E,OAAKh2D,EAAK+yD,eAAiB/tB,EAAG+tB,eAAkBgD,EAAU/1D,EAAKsa,KAAO07C,EAAQhxB,EAAG1qB,IACtE,KACJ,IAAIw7C,EAAkB91D,EAAKsa,IAAK0qB,EAAG1qB,IAAKy7C,EAASC,EAAO9wD,KAAKxH,MAAOwH,KAAKqjC,OAAQrjC,KAAK8nD,WAEjGnsB,SACI,IAAIia,EAAO,CAAEia,SAAU,gBAAiB/0D,KAAMkF,KAAKlF,KAAMglC,GAAI9/B,KAAK8/B,GAC9D+wB,QAAS7wD,KAAK6wD,QAASC,MAAO9wD,KAAK8wD,MAAOztB,OAAQrjC,KAAKqjC,QAK3D,OAJIrjC,KAAKxH,MAAM+G,OACXq2C,EAAKp9C,MAAQwH,KAAKxH,MAAMmjC,UACxB37B,KAAK8nD,YACLlS,EAAKkS,WAAY,GACdlS,EAKX5mB,gBAAgBK,EAAQumB,GACpB,GAAwB,iBAAbA,EAAK96C,MAAsC,iBAAX86C,EAAK9V,IACrB,iBAAhB8V,EAAKib,SAA4C,iBAAdjb,EAAKkb,OAA2C,iBAAflb,EAAKvS,OAChF,MAAM,IAAI0R,WAAW,gDACzB,OAAO,IAAI6b,EAAkBhb,EAAK96C,KAAM86C,EAAK9V,GAAI8V,EAAKib,QAASjb,EAAKkb,MAAO,cAAezhC,EAAQumB,EAAKp9C,OAAQo9C,EAAKvS,SAAUuS,EAAKkS,YAI3I,SAAS6I,EAAelzC,EAAK3iB,EAAMglC,GAC/B,IAAI3C,EAAQ1f,EAAIpa,QAAQvI,GAAO27C,EAAO3W,EAAKhlC,EAAMihB,EAAQohB,EAAMphB,MAC/D,KAAO06B,EAAO,GAAK16B,EAAQ,GAAKohB,EAAMiH,WAAWroB,IAAUohB,EAAMhjC,KAAK4hB,GAAOyhB,YACzEzhB,IACA06B,IAEJ,GAAIA,EAAO,EAAG,CACV,IAAI15C,EAAOogC,EAAMhjC,KAAK4hB,GAAO4rB,WAAWxK,EAAMiH,WAAWroB,IACzD,KAAO06B,EAAO,GAAG,CACb,IAAK15C,GAAQA,EAAKy3C,OACd,OAAO,EACXz3C,EAAOA,EAAK0gC,WACZgZ,KAGR,OAAO,EAyGX,SAASwa,EAAO92D,EAAM1C,EAAOC,GACzB,OAAiB,GAATD,GAAc0C,EAAKokC,WAAW9mC,EAAO0C,EAAKqjC,eAC7C9lC,GAAOyC,EAAKqjC,YAAcrjC,EAAKokC,WAAW,EAAG7mC,IAOtD,SAASw5D,EAAW5zB,GAChB,IACI19B,EADS09B,EAAMhc,OACE1hB,QAAQi1C,WAAWvX,EAAMr3B,WAAYq3B,EAAMn3B,UAChE,IAAK,IAAI4V,EAAQuhB,EAAMvhB,SAAUA,EAAO,CACpC,IAAI5hB,EAAOmjC,EAAMH,MAAMhjC,KAAK4hB,GACxBpkB,EAAQ2lC,EAAMH,MAAMxlC,MAAMokB,GAAQ5V,EAAWm3B,EAAMF,IAAIgH,WAAWroB,GACtE,GAAIA,EAAQuhB,EAAMvhB,OAAS5hB,EAAKokC,WAAW5mC,EAAOwO,EAAUvG,GACxD,OAAOmc,EACX,GAAa,GAATA,GAAc5hB,EAAKC,KAAKq1B,KAAK+S,YAAcyuB,EAAO92D,EAAMxC,EAAOwO,GAC/D,MAER,OAAO,KAoCX,SAAS6oC,EAAa1R,EAAO6N,EAAUpc,EAAQ,KAAMoiC,EAAa7zB,GAC9D,IAAI8zB,EAQR,SAA6B9zB,EAAOljC,GAChC,IAAI,OAAEknB,EAAM,WAAErb,EAAU,SAAEE,GAAam3B,EACnC8zB,EAAS9vC,EAAOojB,eAAez+B,GAAY+oC,aAAa50C,GAC5D,IAAKg3D,EACD,OAAO,KACX,IAAIC,EAAQD,EAAOh6D,OAASg6D,EAAO,GAAKh3D,EACxC,OAAOknB,EAAOotB,eAAezoC,EAAYE,EAAUkrD,GAASD,EAAS,KAdxDE,CAAoBh0B,EAAO6N,GACpCnH,EAAQotB,GAehB,SAA4B9zB,EAAOljC,GAC/B,IAAI,OAAEknB,EAAM,WAAErb,EAAU,SAAEE,GAAam3B,EACnC0G,EAAQ1iB,EAAO+C,MAAMpe,GACrBoC,EAASjO,EAAKk/C,aAAatK,aAAahL,EAAM5pC,MAClD,IAAKiO,EACD,OAAO,KACX,IACIkpD,GADWlpD,EAAOjR,OAASiR,EAAOA,EAAOjR,OAAS,GAAKgD,GACjCk/C,aAC1B,IAAK,IAAIniD,EAAI8O,EAAYsrD,GAAcp6D,EAAIgP,EAAUhP,IACjDo6D,EAAaA,EAAWtiB,UAAU3tB,EAAO+C,MAAMltB,GAAGiD,MACtD,OAAKm3D,GAAeA,EAAWriB,SAExB7mC,EADI,KA1BWmpD,CAAmBL,EAAYhmB,GACrD,OAAKnH,EAEEotB,EAAOjqD,IAAIsqD,GACbp/B,OAAO,CAAEj4B,KAAM+wC,EAAUpc,UAASsD,OAAO2R,EAAM78B,IAAIsqD,IAF7C,KAIf,SAASA,EAAUr3D,GAAQ,MAAO,CAAEA,OAAM20B,MAAO,MA2EjD,SAAS2iC,EAASj0C,EAAKrI,EAAK2G,EAAQ,EAAG41C,GACnC,IAAI/jB,EAAOnwB,EAAIpa,QAAQ+R,GAAMZ,EAAOo5B,EAAK7xB,MAAQA,EAC7C61C,EAAaD,GAAcA,EAAWA,EAAWv6D,OAAS,IAAOw2C,EAAKtsB,OAC1E,GAAI9M,EAAO,GAAKo5B,EAAKtsB,OAAOlnB,KAAKq1B,KAAK+S,YACjCoL,EAAKtsB,OAAOid,WAAWqP,EAAKj2C,QAASi2C,EAAKtsB,OAAOkc,cACjDo0B,EAAUx3D,KAAKwjD,aAAahQ,EAAKtsB,OAAO1hB,QAAQi1C,WAAWjH,EAAKj2C,QAASi2C,EAAKtsB,OAAOkc,aACtF,OAAO,EACX,IAAK,IAAIlgB,EAAIswB,EAAK7xB,MAAQ,EAAG5kB,EAAI4kB,EAAQ,EAAGuB,EAAI9I,EAAM8I,IAAKnmB,IAAK,CAC5D,IAAIgD,EAAOyzC,EAAKzzC,KAAKmjB,GAAI3lB,EAAQi2C,EAAKj2C,MAAM2lB,GAC5C,GAAInjB,EAAKC,KAAKq1B,KAAK+S,UACf,OAAO,EACX,IAAIrV,EAAOhzB,EAAKyF,QAAQi1C,WAAWl9C,EAAOwC,EAAKqjC,YAC3Cq0B,EAAgBF,GAAcA,EAAWx6D,EAAI,GAC7C06D,IACA1kC,EAAOA,EAAKmJ,aAAa,EAAGu7B,EAAcz3D,KAAKyN,OAAOgqD,EAAc9iC,SACxE,IAAIhsB,EAAS4uD,GAAcA,EAAWx6D,IAAOgD,EAC7C,IAAKA,EAAKokC,WAAW5mC,EAAQ,EAAGwC,EAAKqjC,cAAgBz6B,EAAM3I,KAAKwjD,aAAazwB,GACzE,OAAO,EAEf,IAAIx1B,EAAQi2C,EAAKxJ,WAAW5vB,GACxBs9C,EAAWH,GAAcA,EAAW,GACxC,OAAO/jB,EAAKzzC,KAAKqa,GAAMk6B,eAAe/2C,EAAOA,EAAOm6D,EAAWA,EAAS13D,KAAOwzC,EAAKzzC,KAAKqa,EAAO,GAAGpa,MAevG,SAAS23D,EAAQt0C,EAAKrI,GAClB,IAAIw4B,EAAOnwB,EAAIpa,QAAQ+R,GAAMzd,EAAQi2C,EAAKj2C,QAC1C,OAAOw/C,EAASvJ,EAAK9J,WAAY8J,EAAKzP,YAClCyP,EAAKtsB,OAAOid,WAAW5mC,EAAOA,EAAQ,GAE9C,SAASw/C,EAASn0B,EAAGC,GACjB,SAAUD,IAAKC,GAAMD,EAAEwxB,SAAUxxB,EAAE22B,UAAU12B,IAsEjD,SAAS+uC,EAAUv0C,EAAKrI,EAAK5c,GACzB,IAAIo1C,EAAOnwB,EAAIpa,QAAQ+R,GACvB,IAAK5c,EAAMoH,QAAQL,KACf,OAAO6V,EACX,IAAIxV,EAAUpH,EAAMoH,QACpB,IAAK,IAAIzI,EAAI,EAAGA,EAAIqB,EAAMu9C,UAAW5+C,IACjCyI,EAAUA,EAAQ69B,WAAW79B,QACjC,IAAK,IAAIqyD,EAAO,EAAGA,IAA4B,GAAnBz5D,EAAMu9C,WAAkBv9C,EAAM+G,KAAO,EAAI,GAAI0yD,IACrE,IAAK,IAAI30C,EAAIswB,EAAK7xB,MAAOuB,GAAK,EAAGA,IAAK,CAClC,IAAIisC,EAAOjsC,GAAKswB,EAAK7xB,MAAQ,EAAI6xB,EAAKx4B,MAAQw4B,EAAKn2C,MAAM6lB,EAAI,GAAKswB,EAAKl2C,IAAI4lB,EAAI,IAAM,GAAK,EAAI,EAC1F40C,EAAYtkB,EAAKj2C,MAAM2lB,IAAMisC,EAAO,EAAI,EAAI,GAC5CjoC,EAASssB,EAAKzzC,KAAKmjB,GAAI60C,GAAO,EAClC,GAAY,GAARF,EACAE,EAAO7wC,EAAOid,WAAW2zB,EAAWA,EAAWtyD,OAE9C,CACD,IAAI+vC,EAAWruB,EAAOojB,eAAewtB,GAAWljB,aAAapvC,EAAQ69B,WAAWrjC,MAChF+3D,EAAOxiB,GAAYruB,EAAOotB,eAAewjB,EAAWA,EAAWviB,EAAS,IAE5E,GAAIwiB,EACA,OAAe,GAAR5I,EAAY3b,EAAKx4B,IAAMm0C,EAAO,EAAI3b,EAAK9vC,OAAOwf,EAAI,GAAKswB,EAAK7qC,MAAMua,EAAI,GAGzF,OAAO,KASX,SAAS80C,EAAY30C,EAAK3iB,EAAMglC,EAAKhlC,EAAMtC,EAAQ,YAC/C,GAAIsC,GAAQglC,IAAOtnC,EAAM+G,KACrB,OAAO,KACX,IAAI49B,EAAQ1f,EAAIpa,QAAQvI,GAAOsiC,EAAM3f,EAAIpa,QAAQy8B,GAEjD,OAAIuyB,EAAcl1B,EAAOC,EAAK5kC,GACnB,IAAIk4D,EAAY51D,EAAMglC,EAAItnC,GAC9B,IAAI85D,EAAOn1B,EAAOC,EAAK5kC,GAAO+5D,MAEzC,SAASF,EAAcl1B,EAAOC,EAAK5kC,GAC/B,OAAQA,EAAMu9C,YAAcv9C,EAAMw9C,SAAW7Y,EAAM1lC,SAAW2lC,EAAI3lC,SAC9D0lC,EAAM7b,OAAOid,WAAWpB,EAAMxlC,QAASylC,EAAIzlC,QAASa,EAAMoH,SA/ZlE8vD,EAAK9F,OAAO,gBAAiBgH,GAqb7B,MAAM0B,EACFt8D,YAAYmnC,EAAOC,EAAKo1B,GACpBxyD,KAAKm9B,MAAQA,EACbn9B,KAAKo9B,IAAMA,EACXp9B,KAAKwyD,SAAWA,EAChBxyD,KAAKyyD,SAAW,GAChBzyD,KAAK01C,OAAS,WACd,IAAK,IAAIv+C,EAAI,EAAGA,GAAKgmC,EAAMphB,MAAO5kB,IAAK,CACnC,IAAIgD,EAAOgjC,EAAMhjC,KAAKhD,GACtB6I,KAAKyyD,SAASz3D,KAAK,CACfZ,KAAMD,EAAKC,KACXX,MAAOU,EAAKuqC,eAAevH,EAAMiH,WAAWjtC,MAGpD,IAAK,IAAIA,EAAIgmC,EAAMphB,MAAO5kB,EAAI,EAAGA,IAC7B6I,KAAK01C,OAAS,UAAcvY,EAAMhjC,KAAKhD,GAAGJ,KAAKiJ,KAAK01C,SAExD35B,YAAU,OAAO/b,KAAKyyD,SAASr7D,OAAS,EAC5Cm7D,MAII,KAAOvyD,KAAKwyD,SAASjzD,MAAM,CACvB,IAAIgzD,EAAMvyD,KAAK0yD,eACXH,EACAvyD,KAAK2yD,WAAWJ,GAEhBvyD,KAAK4yD,YAAc5yD,KAAK6yD,WAOhC,IAAIC,EAAa9yD,KAAK+yD,iBAAkBC,EAAahzD,KAAK01C,OAAOn2C,KAAOS,KAAK+b,MAAQ/b,KAAKm9B,MAAMphB,MAC5FohB,EAAQn9B,KAAKm9B,MAAOC,EAAMp9B,KAAKoQ,MAAM0iD,EAAa,EAAI9yD,KAAKo9B,IAAMD,EAAM1f,IAAIpa,QAAQyvD,IACvF,IAAK11B,EACD,OAAO,KAEX,IAAIx9B,EAAUI,KAAK01C,OAAQK,EAAY5Y,EAAMphB,MAAOi6B,EAAU5Y,EAAIrhB,MAClE,KAAOg6B,GAAaC,GAAiC,GAAtBp2C,EAAQ49B,YACnC59B,EAAUA,EAAQ69B,WAAW79B,QAC7Bm2C,IACAC,IAEJ,IAAIx9C,EAAQ,IAAI,KAAMoH,EAASm2C,EAAWC,GAC1C,OAAI8c,GAAc,EACP,IAAIlC,EAAkBzzB,EAAM/nB,IAAK09C,EAAY9yD,KAAKo9B,IAAIhoB,IAAKpV,KAAKo9B,IAAI1lC,MAAOc,EAAOw6D,GACzFx6D,EAAM+G,MAAQ49B,EAAM/nB,KAAOpV,KAAKo9B,IAAIhoB,IAC7B,IAAIs7C,EAAYvzB,EAAM/nB,IAAKgoB,EAAIhoB,IAAK5c,GACxC,KAKXk6D,eACI,IAAIO,EAAajzD,KAAKwyD,SAASzc,UAC/B,IAAK,IAAImF,EAAMl7C,KAAKwyD,SAAS5yD,QAAS0d,EAAI,EAAG04B,EAAUh2C,KAAKwyD,SAASxc,QAAS14B,EAAI21C,EAAY31C,IAAK,CAC/F,IAAInjB,EAAO+gD,EAAIzd,WAGf,GAFIyd,EAAI1d,WAAa,IACjBwY,EAAU,GACV77C,EAAKC,KAAKq1B,KAAK+S,WAAawT,GAAW14B,EAAG,CAC1C21C,EAAa31C,EACb,MAEJ49B,EAAM/gD,EAAKyF,QAIf,IAAK,IAAIqyD,EAAO,EAAGA,GAAQ,EAAGA,IAC1B,IAAK,IAAIiB,EAAqB,GAARjB,EAAYgB,EAAajzD,KAAKwyD,SAASzc,UAAWmd,GAAc,EAAGA,IAAc,CACnG,IAAI32C,EAAU+E,EAAS,KACnB4xC,GACA5xC,EAAS6xC,EAAUnzD,KAAKwyD,SAAS5yD,QAASszD,EAAa,GAAGz1B,WAC1DlhB,EAAW+E,EAAO1hB,SAGlB2c,EAAWvc,KAAKwyD,SAAS5yD,QAE7B,IAAI4uC,EAAQjyB,EAASkhB,WACrB,IAAK,IAAI21B,EAAgBpzD,KAAK+b,MAAOq3C,GAAiB,EAAGA,IAAiB,CACtE,IAAoDvtC,GAAhD,KAAEzrB,EAAI,MAAEX,GAAUuG,KAAKyyD,SAASW,GAAsBjgC,EAAS,KAInE,GAAY,GAAR8+B,IAAczjB,EAAQ/0C,EAAMw1C,UAAUT,EAAMp0C,QAAU+4B,EAAS15B,EAAM+hD,WAAW,UAAchN,IAAQ,IACpGltB,GAAUlnB,EAAKw0C,kBAAkBttB,EAAOlnB,OAC1C,MAAO,CAAE84D,aAAYE,gBAAe9xC,SAAQ6R,UAG3C,GAAY,GAAR8+B,GAAazjB,IAAU3oB,EAAOpsB,EAAMu1C,aAAaR,EAAMp0C,OAC5D,MAAO,CAAE84D,aAAYE,gBAAe9xC,SAAQuE,QAGhD,GAAIvE,GAAU7nB,EAAMw1C,UAAU3tB,EAAOlnB,MACjC,QAKpBw4D,WACI,IAAI,QAAEhzD,EAAO,UAAEm2C,EAAS,QAAEC,GAAYh2C,KAAKwyD,SACvCxuB,EAAQmvB,EAAUvzD,EAASm2C,GAC/B,SAAK/R,EAAMxG,YAAcwG,EAAMvG,WAAW+W,UAE1Cx0C,KAAKwyD,SAAW,IAAI,KAAM5yD,EAASm2C,EAAY,EAAG54B,KAAKhe,IAAI62C,EAAShS,EAAMzkC,KAAOw2C,GAAan2C,EAAQL,KAAOy2C,EAAUD,EAAY,EAAI,KAChI,GAEX8c,WACI,IAAI,QAAEjzD,EAAO,UAAEm2C,EAAS,QAAEC,GAAYh2C,KAAKwyD,SACvCxuB,EAAQmvB,EAAUvzD,EAASm2C,GAC/B,GAAI/R,EAAMxG,YAAc,GAAKuY,EAAY,EAAG,CACxC,IAAIsd,EAAYzzD,EAAQL,KAAOw2C,GAAaA,EAAY/R,EAAMzkC,KAC9DS,KAAKwyD,SAAW,IAAI,KAAMc,EAAiB1zD,EAASm2C,EAAY,EAAG,GAAIA,EAAY,EAAGsd,EAAYtd,EAAY,EAAIC,QAGlHh2C,KAAKwyD,SAAW,IAAI,KAAMc,EAAiB1zD,EAASm2C,EAAW,GAAIA,EAAWC,GAMtF2c,YAAW,WAAEO,EAAU,cAAEE,EAAa,OAAE9xC,EAAM,OAAE6R,EAAM,KAAEtN,IACpD,KAAO7lB,KAAK+b,MAAQq3C,GAChBpzD,KAAKuzD,oBACT,GAAI1tC,EACA,IAAK,IAAI1uB,EAAI,EAAGA,EAAI0uB,EAAKzuB,OAAQD,IAC7B6I,KAAKwzD,iBAAiB3tC,EAAK1uB,IACnC,IAAIqB,EAAQwH,KAAKwyD,SAAUj2C,EAAW+E,EAASA,EAAO1hB,QAAUpH,EAAMoH,QAClEm2C,EAAYv9C,EAAMu9C,UAAYmd,EAC9BO,EAAQ,EAAG11D,EAAM,IACjB,MAAEtE,EAAK,KAAEW,GAAS4F,KAAKyyD,SAASW,GACpC,GAAIjgC,EAAQ,CACR,IAAK,IAAIh8B,EAAI,EAAGA,EAAIg8B,EAAOqK,WAAYrmC,IACnC4G,EAAI/C,KAAKm4B,EAAO9O,MAAMltB,IAC1BsC,EAAQA,EAAM8/C,cAAcpmB,GAKhC,IAAIugC,EAAgBn3C,EAAShd,KAAO2zD,GAAe16D,EAAMoH,QAAQL,KAAO/G,EAAMw9C,SAG9E,KAAOyd,EAAQl3C,EAASihB,YAAY,CAChC,IAAIzgC,EAAOwf,EAAS8H,MAAMovC,GAAQlU,EAAU9lD,EAAMw1C,UAAUlyC,EAAK3C,MACjE,IAAKmlD,EACD,MACJkU,KACIA,EAAQ,GAAkB,GAAb1d,GAAkBh5C,EAAK6C,QAAQL,QAC5C9F,EAAQ8lD,EACRxhD,EAAI/C,KAAK24D,EAAe52D,EAAKoiC,KAAK/kC,EAAKyjD,aAAa9gD,EAAKqyB,QAAkB,GAATqkC,EAAa1d,EAAY,EAAG0d,GAASl3C,EAASihB,WAAak2B,GAAgB,KAGrJ,IAAIjY,EAAQgY,GAASl3C,EAASihB,WACzBie,IACDiY,GAAgB,GACpB1zD,KAAK01C,OAASke,EAAc5zD,KAAK01C,OAAQ0d,EAAe,UAAcr1D,IACtEiC,KAAKyyD,SAASW,GAAe35D,MAAQA,EAGjCgiD,GAASiY,EAAe,GAAKpyC,GAAUA,EAAOlnB,MAAQ4F,KAAKyyD,SAASzyD,KAAK+b,OAAO3hB,MAAQ4F,KAAKyyD,SAASr7D,OAAS,GAC/G4I,KAAKuzD,oBAET,IAAK,IAAIp8D,EAAI,EAAG+jD,EAAM3+B,EAAUplB,EAAIu8D,EAAcv8D,IAAK,CACnD,IAAIgD,EAAO+gD,EAAIpc,UACf9+B,KAAKyyD,SAASz3D,KAAK,CAAEZ,KAAMD,EAAKC,KAAMX,MAAOU,EAAKuqC,eAAevqC,EAAKqjC,cACtE0d,EAAM/gD,EAAKyF,QAKfI,KAAKwyD,SAAY/W,EACG,GAAdyX,EAAkB,WACd,IAAI,KAAMI,EAAiB96D,EAAMoH,QAASszD,EAAa,EAAG,GAAIA,EAAa,EAAGQ,EAAe,EAAIl7D,EAAMw9C,QAAUkd,EAAa,GAF/G,IAAI,KAAMI,EAAiB96D,EAAMoH,QAASszD,EAAYO,GAAQj7D,EAAMu9C,UAAWv9C,EAAMw9C,SAIlH+c,iBACI,IAAK/yD,KAAKo9B,IAAI9b,OAAOkjB,YACjB,OAAQ,EACZ,IAAqCzD,EAAjCnS,EAAM5uB,KAAKyyD,SAASzyD,KAAK+b,OAC7B,IAAK6S,EAAIx0B,KAAKoqC,cAAgBqvB,EAAiB7zD,KAAKo9B,IAAKp9B,KAAKo9B,IAAIrhB,MAAO6S,EAAIx0B,KAAMw0B,EAAIn1B,OAAO,IACzFuG,KAAKo9B,IAAIrhB,OAAS/b,KAAK+b,QAAUglB,EAAQ/gC,KAAK8zD,eAAe9zD,KAAKo9B,OAAS2D,EAAMhlB,OAAS/b,KAAK+b,MAChG,OAAQ,EACZ,IAAI,MAAEA,GAAU/b,KAAKo9B,IAAKr6B,EAAQ/C,KAAKo9B,IAAIr6B,MAAMgZ,GACjD,KAAOA,EAAQ,GAAKhZ,GAAS/C,KAAKo9B,IAAI1lC,MAAMqkB,MACtChZ,EACN,OAAOA,EAEX+wD,eAAe12B,GACXqQ,EAAM,IAAK,IAAIt2C,EAAIgmB,KAAKgE,IAAInhB,KAAK+b,MAAOqhB,EAAIrhB,OAAQ5kB,GAAK,EAAGA,IAAK,CAC7D,IAAI,MAAEsC,EAAK,KAAEW,GAAS4F,KAAKyyD,SAASt7D,GAChC48D,EAAY58D,EAAIimC,EAAIrhB,OAASqhB,EAAI1lC,IAAIP,EAAI,IAAMimC,EAAIhoB,KAAOgoB,EAAIrhB,OAAS5kB,EAAI,IAC3Eo7D,EAAMsB,EAAiBz2B,EAAKjmC,EAAGiD,EAAMX,EAAOs6D,GAChD,GAAKxB,EAAL,CAEA,IAAK,IAAIj1C,EAAInmB,EAAI,EAAGmmB,GAAK,EAAGA,IAAK,CAC7B,IAAI,MAAE7jB,EAAK,KAAEW,GAAS4F,KAAKyyD,SAASn1C,GAChCiiC,EAAUsU,EAAiBz2B,EAAK9f,EAAGljB,EAAMX,GAAO,GACpD,IAAK8lD,GAAWA,EAAQ/hB,WACpB,SAASiQ,EAEjB,MAAO,CAAE1xB,MAAO5kB,EAAGo7D,MAAK5zC,KAAMo1C,EAAY32B,EAAI3f,IAAIpa,QAAQ+5B,EAAIr6B,MAAM5L,EAAI,IAAMimC,KAGtFhtB,MAAMgtB,GACF,IAAIhtB,EAAQpQ,KAAK8zD,eAAe12B,GAChC,IAAKhtB,EACD,OAAO,KACX,KAAOpQ,KAAK+b,MAAQ3L,EAAM2L,OACtB/b,KAAKuzD,oBACLnjD,EAAMmiD,IAAI/0B,aACVx9B,KAAK01C,OAASke,EAAc5zD,KAAK01C,OAAQtlC,EAAM2L,MAAO3L,EAAMmiD,MAChEn1B,EAAMhtB,EAAMuO,KACZ,IAAK,IAAIrB,EAAIlN,EAAM2L,MAAQ,EAAGuB,GAAK8f,EAAIrhB,MAAOuB,IAAK,CAC/C,IAAInjB,EAAOijC,EAAIjjC,KAAKmjB,GAAIvf,EAAM5D,EAAKC,KAAKk/C,aAAakC,WAAWrhD,EAAKyF,SAAS,EAAMw9B,EAAIzlC,MAAM2lB,IAC9Ftd,KAAKwzD,iBAAiBr5D,EAAKC,KAAMD,EAAK40B,MAAOhxB,GAEjD,OAAOq/B,EAEXo2B,iBAAiBp5D,EAAM20B,EAAQ,KAAMnvB,GACjC,IAAIgvB,EAAM5uB,KAAKyyD,SAASzyD,KAAK+b,OAC7B6S,EAAIn1B,MAAQm1B,EAAIn1B,MAAMw1C,UAAU70C,GAChC4F,KAAK01C,OAASke,EAAc5zD,KAAK01C,OAAQ11C,KAAK+b,MAAO,UAAc3hB,EAAKyN,OAAOknB,EAAOnvB,KACtFI,KAAKyyD,SAASz3D,KAAK,CAAEZ,OAAMX,MAAOW,EAAKk/C,eAE3Cia,oBACI,IACIx1D,EADOiC,KAAKyyD,SAASr1D,MACV3D,MAAM+hD,WAAW,YAAgB,GAC5Cz9C,EAAIy/B,aACJx9B,KAAK01C,OAASke,EAAc5zD,KAAK01C,OAAQ11C,KAAKyyD,SAASr7D,OAAQ2G,KAG3E,SAASu1D,EAAiB/2C,EAAUR,EAAO+E,GACvC,OAAa,GAAT/E,EACOQ,EAASs4B,WAAW/zB,EAAOvE,EAASihB,YACxCjhB,EAAS+Z,aAAa,EAAG/Z,EAASkhB,WAAW1mC,KAAKu8D,EAAiB/2C,EAASkhB,WAAW79B,QAASmc,EAAQ,EAAG+E,KAEtH,SAAS8yC,EAAcr3C,EAAUR,EAAOnc,GACpC,OAAa,GAATmc,EACOQ,EAASiiB,OAAO5+B,GACpB2c,EAAS+Z,aAAa/Z,EAASihB,WAAa,EAAGjhB,EAASuiB,UAAU/nC,KAAK68D,EAAcr3C,EAASuiB,UAAUl/B,QAASmc,EAAQ,EAAGnc,KAEvI,SAASuzD,EAAU52C,EAAUR,GACzB,IAAK,IAAI5kB,EAAI,EAAGA,EAAI4kB,EAAO5kB,IACvBolB,EAAWA,EAASkhB,WAAW79B,QACnC,OAAO2c,EAEX,SAASo3C,EAAex5D,EAAM47C,EAAWC,GACrC,GAAID,GAAa,EACb,OAAO57C,EACX,IAAImhD,EAAOnhD,EAAKyF,QAQhB,OAPIm2C,EAAY,IACZuF,EAAOA,EAAKhlB,aAAa,EAAGq9B,EAAerY,EAAK7d,WAAYsY,EAAY,EAAsB,GAAnBuF,EAAK9d,WAAkBwY,EAAU,EAAI,KAChHD,EAAY,IACZuF,EAAOnhD,EAAKC,KAAKk/C,aAAakC,WAAWF,GAAM9c,OAAO8c,GAClDtF,GAAW,IACXsF,EAAOA,EAAK9c,OAAOrkC,EAAKC,KAAKk/C,aAAaC,cAAc+B,GAAME,WAAW,YAAgB,MAE1FrhD,EAAKpD,KAAKukD,GAErB,SAASuY,EAAiBz2B,EAAKrhB,EAAO3hB,EAAMX,EAAOuP,GAC/C,IAAI7O,EAAOijC,EAAIjjC,KAAK4hB,GAAQpkB,EAAQqR,EAAOo0B,EAAIgH,WAAWroB,GAASqhB,EAAIzlC,MAAMokB,GAC7E,GAAIpkB,GAASwC,EAAKqjC,aAAepjC,EAAKw0C,kBAAkBz0C,EAAKC,MACzD,OAAO,KACX,IAAIm4D,EAAM94D,EAAM+hD,WAAWrhD,EAAKyF,SAAS,EAAMjI,GAC/C,OAAO46D,IAEX,SAAsBn4D,EAAMmiB,EAAU9kB,GAClC,IAAK,IAAIN,EAAIM,EAAON,EAAIolB,EAASihB,WAAYrmC,IACzC,IAAKiD,EAAKs/C,YAAYn9B,EAAS8H,MAAMltB,GAAGi4B,OACpC,OAAO,EACf,OAAO,EANQ4kC,CAAa55D,EAAMD,EAAKyF,QAASjI,GAAS46D,EAAM,KAwFnE,SAAS0B,EAAc13C,EAAUR,EAAOm4C,EAASC,EAAS7yC,GACtD,GAAIvF,EAAQm4C,EAAS,CACjB,IAAI1lB,EAAQjyB,EAASkhB,WACrBlhB,EAAWA,EAAS+Z,aAAa,EAAGkY,EAAMz3C,KAAKk9D,EAAczlB,EAAM5uC,QAASmc,EAAQ,EAAGm4C,EAASC,EAAS3lB,KAE7G,GAAIzyB,EAAQo4C,EAAS,CACjB,IAAI16D,EAAQ6nB,EAAOojB,eAAe,GAC9BjtC,EAAQgC,EAAM+hD,WAAWj/B,GAAUiiB,OAAOjiB,GAC9CA,EAAW9kB,EAAM+mC,OAAO/kC,EAAM8/C,cAAc9hD,GAAO+jD,WAAW,YAAgB,IAElF,OAAOj/B,EA4BX,SAAS63C,EAAcj3B,EAAOC,GAC1B,IAAIxlC,EAAS,GACb,IAAK,IAAI0lB,EADmBH,KAAKgE,IAAIgc,EAAMphB,MAAOqhB,EAAIrhB,OAC/BuB,GAAK,EAAGA,IAAK,CAChC,IAAI7lB,EAAQ0lC,EAAM1lC,MAAM6lB,GACxB,GAAI7lB,EAAQ0lC,EAAM/nB,KAAO+nB,EAAMphB,MAAQuB,IACnC8f,EAAI1lC,IAAI4lB,GAAK8f,EAAIhoB,KAAOgoB,EAAIrhB,MAAQuB,IACpC6f,EAAMhjC,KAAKmjB,GAAGljB,KAAKq1B,KAAK+S,WACxBpF,EAAIjjC,KAAKmjB,GAAGljB,KAAKq1B,KAAK+S,UACtB,OACA/qC,GAAS2lC,EAAI3lC,MAAM6lB,IAClBA,GAAK6f,EAAMphB,OAASuB,GAAK8f,EAAIrhB,OAASohB,EAAM7b,OAAO2uB,eAAiB7S,EAAI9b,OAAO2uB,eAC5E3yB,GAAK8f,EAAI3lC,MAAM6lB,EAAI,IAAM7lB,EAAQ,IACrCG,EAAOoD,KAAKsiB,GAEpB,OAAO1lB,EAMX,MAAMy8D,UAAiB3E,EAInB15D,YAIAof,EAIA0nC,EAEAvmD,GACI4vB,QACAnmB,KAAKoV,IAAMA,EACXpV,KAAK88C,KAAOA,EACZ98C,KAAKzJ,MAAQA,EAEjBmvB,MAAMjI,GACF,IAAItjB,EAAOsjB,EAAIu7B,OAAOh5C,KAAKoV,KAC3B,IAAKjb,EACD,OAAO41D,EAAW/lC,KAAK,wCAC3B,IAAI+E,EAAQh6B,OAAO8S,OAAO,MAC1B,IAAK,IAAIzR,KAAQ+D,EAAK40B,MAClBA,EAAM34B,GAAQ+D,EAAK40B,MAAM34B,GAC7B24B,EAAM/uB,KAAK88C,MAAQ98C,KAAKzJ,MACxB,IAAI40D,EAAUhxD,EAAKC,KAAKyN,OAAOknB,EAAO,KAAM50B,EAAKi1B,OACjD,OAAO2gC,EAAWM,YAAY5yC,EAAKzd,KAAKoV,IAAKpV,KAAKoV,IAAM,EAAG,IAAI,KAAM,UAAc+1C,GAAU,EAAGhxD,EAAKq6C,OAAS,EAAI,IAEtHmb,SACI,OAAO7B,EAAQjuB,MAEnB0R,OAAO9zB,GACH,OAAO,IAAI42C,EAASr0D,KAAKoV,IAAKpV,KAAK88C,KAAMr/B,EAAIu7B,OAAOh5C,KAAKoV,KAAK2Z,MAAM/uB,KAAK88C,OAE7E31C,IAAI22B,GACA,IAAI1oB,EAAM0oB,EAAQysB,UAAUvqD,KAAKoV,IAAK,GACtC,OAAOA,EAAIw4C,aAAe,KAAO,IAAIyG,EAASj/C,EAAIA,IAAKpV,KAAK88C,KAAM98C,KAAKzJ,OAE3EolC,SACI,MAAO,CAAEk0B,SAAU,OAAQz6C,IAAKpV,KAAKoV,IAAK0nC,KAAM98C,KAAK88C,KAAMvmD,MAAOyJ,KAAKzJ,OAE3Ey4B,gBAAgBK,EAAQumB,GACpB,GAAuB,iBAAZA,EAAKxgC,KAAuC,iBAAbwgC,EAAKkH,KAC3C,MAAM,IAAI/H,WAAW,uCACzB,OAAO,IAAIsf,EAASze,EAAKxgC,IAAKwgC,EAAKkH,KAAMlH,EAAKr/C,QAGtDm5D,EAAK9F,OAAO,OAAQyK,GAIpB,MAAMC,UAAoB5E,EAItB15D,YAIA8mD,EAEAvmD,GACI4vB,QACAnmB,KAAK88C,KAAOA,EACZ98C,KAAKzJ,MAAQA,EAEjBmvB,MAAMjI,GACF,IAAIsR,EAAQh6B,OAAO8S,OAAO,MAC1B,IAAK,IAAIzR,KAAQqnB,EAAIsR,MACjBA,EAAM34B,GAAQqnB,EAAIsR,MAAM34B,GAC5B24B,EAAM/uB,KAAK88C,MAAQ98C,KAAKzJ,MACxB,IAAI40D,EAAU1tC,EAAIrjB,KAAKyN,OAAOknB,EAAOtR,EAAI7d,QAAS6d,EAAI2R,OACtD,OAAO2gC,EAAW7wD,GAAGisD,GAEzBwE,SACI,OAAO7B,EAAQjuB,MAEnB0R,OAAO9zB,GACH,OAAO,IAAI62C,EAAYt0D,KAAK88C,KAAMr/B,EAAIsR,MAAM/uB,KAAK88C,OAErD31C,IAAI22B,GACA,OAAO99B,KAEX27B,SACI,MAAO,CAAEk0B,SAAU,UAAW/S,KAAM98C,KAAK88C,KAAMvmD,MAAOyJ,KAAKzJ,OAE/Dy4B,gBAAgBK,EAAQumB,GACpB,GAAwB,iBAAbA,EAAKkH,KACZ,MAAM,IAAI/H,WAAW,0CACzB,OAAO,IAAIuf,EAAY1e,EAAKkH,KAAMlH,EAAKr/C,QAG/Cm5D,EAAK9F,OAAO,UAAW0K,GAKvB,IAAIC,EAAiB,cAAc94C,QAEnC84C,EAAiB,SAASA,EAAe9tC,GACrC,IAAI2zB,EAAM3+B,MAAM/lB,KAAKsK,KAAMymB,GAE3B,OADA2zB,EAAIoa,UAAYD,EAAev/D,UACxBolD,IAEXma,EAAev/D,UAAYD,OAAO8S,OAAO4T,MAAMzmB,YACtBgB,YAAcu+D,EACvCA,EAAev/D,UAAUoB,KAAO,iBAQhC,MAAMq+D,EAIFz+D,YAKAynB,GACIzd,KAAKyd,IAAMA,EAIXzd,KAAKgnC,MAAQ,GAIbhnC,KAAKwxC,KAAO,GAIZxxC,KAAK89B,QAAU,IAAI8wB,EAKnB9wD,aAAW,OAAOkC,KAAKwxC,KAAKp6C,OAAS4I,KAAKwxC,KAAK,GAAKxxC,KAAKyd,IAK7DmgB,KAAKA,GACD,IAAIhmC,EAASoI,KAAK00D,UAAU92B,GAC5B,GAAIhmC,EAAOo4D,OACP,MAAM,IAAIuE,EAAe38D,EAAOo4D,QACpC,OAAOhwD,KAMX00D,UAAU92B,GACN,IAAIhmC,EAASgmC,EAAKlY,MAAM1lB,KAAKyd,KAG7B,OAFK7lB,EAAOo4D,QACRhwD,KAAKurD,QAAQ3tB,EAAMhmC,EAAO6lB,KACvB7lB,EAMP6xC,iBACA,OAAOzpC,KAAKgnC,MAAM5vC,OAAS,EAK/Bm0D,QAAQ3tB,EAAMngB,GACVzd,KAAKwxC,KAAKx2C,KAAKgF,KAAKyd,KACpBzd,KAAKgnC,MAAMhsC,KAAK4iC,GAChB59B,KAAK89B,QAAQgxB,UAAUlxB,EAAK+xB,UAC5B3vD,KAAKyd,IAAMA,EAMfnT,QAAQxP,EAAMglC,EAAKhlC,EAAMtC,EAAQ,YAC7B,IAAIolC,EAAOw0B,EAAYpyD,KAAKyd,IAAK3iB,EAAMglC,EAAItnC,GAG3C,OAFIolC,GACA59B,KAAK49B,KAAKA,GACP59B,KAMX4iC,YAAY9nC,EAAMglC,EAAIlgC,GAClB,OAAOI,KAAKsK,QAAQxP,EAAMglC,EAAI,IAAI,KAAM,UAAclgC,GAAU,EAAG,IAKvEi4B,OAAO/8B,EAAMglC,GACT,OAAO9/B,KAAKsK,QAAQxP,EAAMglC,EAAI,YAKlCuD,OAAOjuB,EAAKxV,GACR,OAAOI,KAAK4iC,YAAYxtB,EAAKA,EAAKxV,GAqBtCopD,aAAaluD,EAAMglC,EAAItnC,GAEnB,OA9WR,SAAsBklC,EAAI5iC,EAAMglC,EAAItnC,GAChC,IAAKA,EAAM+G,KACP,OAAOm+B,EAAGwrB,YAAYpuD,EAAMglC,GAChC,IAAI3C,EAAQO,EAAGjgB,IAAIpa,QAAQvI,GAAOsiC,EAAMM,EAAGjgB,IAAIpa,QAAQy8B,GACvD,GAAIuyB,EAAcl1B,EAAOC,EAAK5kC,GAC1B,OAAOklC,EAAGE,KAAK,IAAI8yB,EAAY51D,EAAMglC,EAAItnC,IAC7C,IAAIm8D,EAAeP,EAAcj3B,EAAOO,EAAGjgB,IAAIpa,QAAQy8B,IAEV,GAAzC60B,EAAaA,EAAav9D,OAAS,IACnCu9D,EAAav3D,MAGjB,IAAIw3D,IAAoBz3B,EAAMphB,MAAQ,GACtC44C,EAAa55D,QAAQ65D,GAKrB,IAAK,IAAIt3C,EAAI6f,EAAMphB,MAAO3G,EAAM+nB,EAAM/nB,IAAM,EAAGkI,EAAI,EAAGA,IAAKlI,IAAO,CAC9D,IAAIqa,EAAO0N,EAAMhjC,KAAKmjB,GAAGljB,KAAKq1B,KAC9B,GAAIA,EAAKqR,UAAYrR,EAAKolC,mBAAqBplC,EAAK+S,UAChD,MACAmyB,EAAa/zC,QAAQtD,IAAM,EAC3Bs3C,EAAkBt3C,EACb6f,EAAMr/B,OAAOwf,IAAMlI,GACxBu/C,EAAan6D,OAAO,EAAG,GAAI8iB,GAInC,IAAIw3C,EAAuBH,EAAa/zC,QAAQg0C,GAC5CG,EAAY,GAAIC,EAAiBx8D,EAAMu9C,UAC3C,IAAK,IAAIn2C,EAAUpH,EAAMoH,QAASzI,EAAI,GAAIA,IAAK,CAC3C,IAAIgD,EAAOyF,EAAQ69B,WAEnB,GADAs3B,EAAU/5D,KAAKb,GACXhD,GAAKqB,EAAMu9C,UACX,MACJn2C,EAAUzF,EAAKyF,QAInB,IAAK,IAAI0d,EAAI03C,EAAiB,EAAG13C,GAAK,EAAGA,IAAK,CAC1C,IAAI23C,EAAWF,EAAUz3C,GAAIlW,GA5CbhN,EA4CkC66D,EAAS76D,MA3CnDq1B,KAAKqR,UAAY1mC,EAAKq1B,KAAKylC,mBA4CnC,GAAI9tD,IAAQ6tD,EAASrhB,WAAWzW,EAAMhjC,KAAKgjB,KAAKg4C,IAAIP,GAAmB,IACnEI,EAAiB13C,OAChB,GAAIlW,IAAQ6tD,EAAS76D,KAAKoqC,YAC3B,MAhDZ,IAAwBpqC,EAkDpB,IAAK,IAAIg3B,EAAI54B,EAAMu9C,UAAW3kB,GAAK,EAAGA,IAAK,CACvC,IAAIgkC,GAAahkC,EAAI4jC,EAAiB,IAAMx8D,EAAMu9C,UAAY,GAC1D1S,EAAS0xB,EAAUK,GACvB,GAAK/xB,EAEL,IAAK,IAAIlsC,EAAI,EAAGA,EAAIw9D,EAAav9D,OAAQD,IAAK,CAG1C,IAAIk+D,EAAcV,GAAcx9D,EAAI29D,GAAwBH,EAAav9D,QAASk+D,GAAS,EACvFD,EAAc,IACdC,GAAS,EACTD,GAAeA,GAEnB,IAAI/zC,EAAS6b,EAAMhjC,KAAKk7D,EAAc,GAAI19D,EAAQwlC,EAAMxlC,MAAM09D,EAAc,GAC5E,GAAI/zC,EAAOotB,eAAe/2C,EAAOA,EAAO0rC,EAAOjpC,KAAMipC,EAAOjU,OACxD,OAAOsO,EAAGpzB,QAAQ6yB,EAAMr/B,OAAOu3D,GAAcC,EAASl4B,EAAIr6B,MAAMsyD,GAAev1B,EAAI,IAAI,KAAMm0B,EAAcz7D,EAAMoH,QAAS,EAAGpH,EAAMu9C,UAAWqf,GAAYA,EAAW58D,EAAMw9C,WAGvL,IAAIuf,EAAa73B,EAAGsJ,MAAM5vC,OAC1B,IAAK,IAAID,EAAIw9D,EAAav9D,OAAS,EAAGD,GAAK,IACvCumC,EAAGpzB,QAAQxP,EAAMglC,EAAItnC,KACjBklC,EAAGsJ,MAAM5vC,OAASm+D,IAFoBp+D,IAAK,CAI/C,IAAI4kB,EAAQ44C,EAAax9D,GACrB4kB,EAAQ,IAEZjhB,EAAOqiC,EAAMr/B,OAAOie,GACpB+jB,EAAK1C,EAAIr6B,MAAMgZ,KAmSfitC,CAAahpD,KAAMlF,EAAMglC,EAAItnC,GACtBwH,KAWXgjC,iBAAiBloC,EAAMglC,EAAI3lC,GAEvB,OAlSR,SAA0BujC,EAAI5iC,EAAMglC,EAAI3lC,GACpC,IAAKA,EAAK0oC,UAAY/nC,GAAQglC,GAAMpC,EAAGjgB,IAAIpa,QAAQvI,GAAMwmB,OAAO1hB,QAAQL,KAAM,CAC1E,IAAI2B,EA3cZ,SAAqBuc,EAAKrI,EAAK+1B,GAC3B,IAAIyC,EAAOnwB,EAAIpa,QAAQ+R,GACvB,GAAIw4B,EAAKtsB,OAAOotB,eAAed,EAAKj2C,QAASi2C,EAAKj2C,QAASwzC,GACvD,OAAO/1B,EACX,GAAyB,GAArBw4B,EAAKzM,aACL,IAAK,IAAI7jB,EAAIswB,EAAK7xB,MAAQ,EAAGuB,GAAK,EAAGA,IAAK,CACtC,IAAI3lB,EAAQi2C,EAAKj2C,MAAM2lB,GACvB,GAAIswB,EAAKzzC,KAAKmjB,GAAGoxB,eAAe/2C,EAAOA,EAAOwzC,GAC1C,OAAOyC,EAAK9vC,OAAOwf,EAAI,GAC3B,GAAI3lB,EAAQ,EACR,OAAO,KAEnB,GAAIi2C,EAAKzM,cAAgByM,EAAKtsB,OAAO1hB,QAAQL,KACzC,IAAK,IAAI+d,EAAIswB,EAAK7xB,MAAQ,EAAGuB,GAAK,EAAGA,IAAK,CACtC,IAAI3lB,EAAQi2C,EAAKxJ,WAAW9mB,GAC5B,GAAIswB,EAAKzzC,KAAKmjB,GAAGoxB,eAAe/2C,EAAOA,EAAOwzC,GAC1C,OAAOyC,EAAK7qC,MAAMua,EAAI,GAC1B,GAAI3lB,EAAQi2C,EAAKzzC,KAAKmjB,GAAGkgB,WACrB,OAAO,KAEnB,OAAO,KAubSg4B,CAAY93B,EAAGjgB,IAAK3iB,EAAMX,EAAKC,MAC9B,MAAT8G,IACApG,EAAOglC,EAAK5+B,GAEpBw8B,EAAGsrB,aAAaluD,EAAMglC,EAAI,IAAI,KAAM,UAAc3lC,GAAO,EAAG,IA2RxD6oC,CAAiBhjC,KAAMlF,EAAMglC,EAAI3lC,GAC1B6F,KAMXkpD,YAAYpuD,EAAMglC,GAEd,OAlSR,SAAqBpC,EAAI5iC,EAAMglC,GAC3B,IAAI3C,EAAQO,EAAGjgB,IAAIpa,QAAQvI,GAAOsiC,EAAMM,EAAGjgB,IAAIpa,QAAQy8B,GACnD21B,EAAUrB,EAAcj3B,EAAOC,GACnC,IAAK,IAAIjmC,EAAI,EAAGA,EAAIs+D,EAAQr+D,OAAQD,IAAK,CACrC,IAAI4kB,EAAQ05C,EAAQt+D,GAAIu9C,EAAOv9C,GAAKs+D,EAAQr+D,OAAS,EACrD,GAAKs9C,GAAiB,GAAT34B,GAAeohB,EAAMhjC,KAAK4hB,GAAO3hB,KAAKk/C,aAAapK,SAC5D,OAAOxR,EAAG7F,OAAOsF,EAAM1lC,MAAMskB,GAAQqhB,EAAI1lC,IAAIqkB,IACjD,GAAIA,EAAQ,IAAM24B,GAAQvX,EAAMhjC,KAAK4hB,EAAQ,GAAGwiB,WAAWpB,EAAMxlC,MAAMokB,EAAQ,GAAIqhB,EAAIgH,WAAWroB,EAAQ,KACtG,OAAO2hB,EAAG7F,OAAOsF,EAAMr/B,OAAOie,GAAQqhB,EAAIr6B,MAAMgZ,IAExD,IAAK,IAAIuB,EAAI,EAAGA,GAAK6f,EAAMphB,OAASuB,GAAK8f,EAAIrhB,MAAOuB,IAChD,GAAIxiB,EAAOqiC,EAAM1lC,MAAM6lB,IAAM6f,EAAMphB,MAAQuB,GAAKwiB,EAAK3C,EAAMzlC,IAAI4lB,IAAM8f,EAAI1lC,IAAI4lB,GAAKwiB,GAAM1C,EAAIrhB,MAAQuB,EAChG,OAAOogB,EAAG7F,OAAOsF,EAAMr/B,OAAOwf,GAAIwiB,GAE1CpC,EAAG7F,OAAO/8B,EAAMglC,GAmRZopB,CAAYlpD,KAAMlF,EAAMglC,GACjB9/B,KASX69B,KAAKP,EAAOpnC,GAER,OAv8BR,SAAcwnC,EAAIJ,EAAOpnC,GACrB,IAAI,MAAEinC,EAAK,IAAEC,EAAG,MAAErhB,GAAUuhB,EACxBo4B,EAAWv4B,EAAMr/B,OAAOie,EAAQ,GAAI45C,EAASv4B,EAAIr6B,MAAMgZ,EAAQ,GAC/DtkB,EAAQi+D,EAAUh+D,EAAMi+D,EACxB73D,EAAS,WAAgBi4C,EAAY,EACzC,IAAK,IAAIz4B,EAAIvB,EAAO65C,GAAY,EAAOt4C,EAAIpnB,EAAQonB,IAC3Cs4C,GAAaz4B,EAAMxlC,MAAM2lB,GAAK,GAC9Bs4C,GAAY,EACZ93D,EAAS,UAAcq/B,EAAMhjC,KAAKmjB,GAAGvmB,KAAK+G,IAC1Ci4C,KAGAt+C,IAER,IAAIsL,EAAQ,WAAgBizC,EAAU,EACtC,IAAK,IAAI14B,EAAIvB,EAAO65C,GAAY,EAAOt4C,EAAIpnB,EAAQonB,IAC3Cs4C,GAAax4B,EAAIr6B,MAAMua,EAAI,GAAK8f,EAAI1lC,IAAI4lB,IACxCs4C,GAAY,EACZ7yD,EAAQ,UAAcq6B,EAAIjjC,KAAKmjB,GAAGvmB,KAAKgM,IACvCizC,KAGAt+C,IAERgmC,EAAGE,KAAK,IAAIgzB,EAAkBn5D,EAAOC,EAAKg+D,EAAUC,EAAQ,IAAI,KAAM73D,EAAO0gC,OAAOz7B,GAAQgzC,EAAWC,GAAUl4C,EAAOyB,KAAOw2C,GAAW,IA86BtIlY,CAAK79B,KAAMs9B,EAAOpnC,GACX8J,KAMXzH,KAAK6c,EAAK2G,EAAQ,GAEd,OAhxBR,SAAc2hB,EAAItoB,EAAK2G,GACnB,IAAI6hB,EAAO,IAAI8yB,EAAYt7C,EAAM2G,EAAO3G,EAAM2G,EAAO,YAAa,GAClE2hB,EAAGE,KAAKA,GA6wBJrlC,CAAKyH,KAAMoV,EAAK2G,GACT/b,KAOX6lB,KAAKyX,EAAOu4B,GAER,OAv5BR,SAAcn4B,EAAIJ,EAAOu4B,GACrB,IAAIj2D,EAAU,WACd,IAAK,IAAIzI,EAAI0+D,EAASz+D,OAAS,EAAGD,GAAK,EAAGA,IAAK,CAC3C,GAAIyI,EAAQL,KAAM,CACd,IAAI9F,EAAQo8D,EAAS1+D,GAAGiD,KAAKk/C,aAAaC,cAAc35C,GACxD,IAAKnG,IAAUA,EAAMy1C,SACjB,MAAM,IAAI6F,WAAW,0FAE7Bn1C,EAAU,UAAci2D,EAAS1+D,GAAGiD,KAAKyN,OAAOguD,EAAS1+D,GAAG43B,MAAOnvB,IAEvE,IAAInI,EAAQ6lC,EAAM7lC,MAAOC,EAAM4lC,EAAM5lC,IACrCgmC,EAAGE,KAAK,IAAIgzB,EAAkBn5D,EAAOC,EAAKD,EAAOC,EAAK,IAAI,KAAMkI,EAAS,EAAG,GAAIi2D,EAASz+D,QAAQ,IA24B7FyuB,CAAK7lB,KAAMs9B,EAAOu4B,GACX71D,KAMX4vC,aAAa90C,EAAMglC,EAAKhlC,EAAMV,EAAM20B,EAAQ,MAExC,OAl5BR,SAAsB2O,EAAI5iC,EAAMglC,EAAI1lC,EAAM20B,GACtC,IAAK30B,EAAKoqC,YACN,MAAM,IAAIuQ,WAAW,oDACzB,IAAIgU,EAAUrrB,EAAGsJ,MAAM5vC,OACvBsmC,EAAGjgB,IAAI8iB,aAAazlC,EAAMglC,GAAI,CAAC3lC,EAAMib,KACjC,GAAIjb,EAAKqqC,cAAgBrqC,EAAK41C,UAAU31C,EAAM20B,IAUtD,SAAuBtR,EAAKrI,EAAKhb,GAC7B,IAAIwzC,EAAOnwB,EAAIpa,QAAQ+R,GAAMzd,EAAQi2C,EAAKj2C,QAC1C,OAAOi2C,EAAKtsB,OAAOotB,eAAe/2C,EAAOA,EAAQ,EAAGyC,GAZQ07D,CAAcp4B,EAAGjgB,IAAKigB,EAAGI,QAAQtlC,MAAMuwD,GAAS5hD,IAAIiO,GAAMhb,GAAO,CAErHsjC,EAAGmR,kBAAkBnR,EAAGI,QAAQtlC,MAAMuwD,GAAS5hD,IAAIiO,EAAK,GAAIhb,GAC5D,IAAI0jC,EAAUJ,EAAGI,QAAQtlC,MAAMuwD,GAC3BgN,EAASj4B,EAAQ32B,IAAIiO,EAAK,GAAI4gD,EAAOl4B,EAAQ32B,IAAIiO,EAAMjb,EAAK8jC,SAAU,GAE1E,OADAP,EAAGE,KAAK,IAAIgzB,EAAkBmF,EAAQC,EAAMD,EAAS,EAAGC,EAAO,EAAG,IAAI,KAAM,UAAc57D,EAAKyN,OAAOknB,EAAO,KAAM50B,EAAKi1B,QAAS,EAAG,GAAI,GAAG,KACpI,MAs4BXwgB,CAAa5vC,KAAMlF,EAAMglC,EAAI1lC,EAAM20B,GAC5B/uB,KAMXohC,cAAchsB,EAAKhb,EAAM20B,EAAQ,KAAMK,GAEnC,OAn4BR,SAAuBsO,EAAItoB,EAAKhb,EAAM20B,EAAOK,GACzC,IAAIj1B,EAAOujC,EAAGjgB,IAAIu7B,OAAO5jC,GACzB,IAAKjb,EACD,MAAM,IAAI46C,WAAW,6BACpB36C,IACDA,EAAOD,EAAKC,MAChB,IAAI67D,EAAU77D,EAAKyN,OAAOknB,EAAO,KAAMK,GAASj1B,EAAKi1B,OACrD,GAAIj1B,EAAKq6C,OACL,OAAO9W,EAAGkF,YAAYxtB,EAAKA,EAAMjb,EAAK8jC,SAAUg4B,GACpD,IAAK77D,EAAKwjD,aAAazjD,EAAKyF,SACxB,MAAM,IAAIm1C,WAAW,iCAAmC36C,EAAKhE,MACjEsnC,EAAGE,KAAK,IAAIgzB,EAAkBx7C,EAAKA,EAAMjb,EAAK8jC,SAAU7oB,EAAM,EAAGA,EAAMjb,EAAK8jC,SAAW,EAAG,IAAI,KAAM,UAAcg4B,GAAU,EAAG,GAAI,GAAG,IAu3BlI70B,CAAcphC,KAAMoV,EAAKhb,EAAM20B,EAAOK,GAC/BpvB,KAOXkiC,iBAAiB9sB,EAAK0nC,EAAMvmD,GAExB,OADAyJ,KAAK49B,KAAK,IAAIy2B,EAASj/C,EAAK0nC,EAAMvmD,IAC3ByJ,KAKXk2D,gBAAgBpZ,EAAMvmD,GAElB,OADAyJ,KAAK49B,KAAK,IAAI02B,EAAYxX,EAAMvmD,IACzByJ,KAKXm2D,YAAY/gD,EAAK+pB,GAEb,OADAn/B,KAAK49B,KAAK,IAAI2yB,EAAgBn7C,EAAK+pB,IAC5Bn/B,KAMXo2D,eAAehhD,EAAK+pB,GAChB,KAAMA,aAAgB,MAAO,CACzB,IAAIhlC,EAAO6F,KAAKyd,IAAIu7B,OAAO5jC,GAC3B,IAAKjb,EACD,MAAM,IAAI46C,WAAW,uBAAyB3/B,GAElD,KADA+pB,EAAOA,EAAK7M,QAAQn4B,EAAKi1B,QAErB,OAAOpvB,KAGf,OADAA,KAAK49B,KAAK,IAAI6yB,EAAmBr7C,EAAK+pB,IAC/Bn/B,KASXzI,MAAM6d,EAAK2G,EAAQ,EAAG41C,GAElB,OA94BR,SAAej0B,EAAItoB,EAAK2G,EAAQ,EAAG41C,GAC/B,IAAI/jB,EAAOlQ,EAAGjgB,IAAIpa,QAAQ+R,GAAMtX,EAAS,WAAgBiF,EAAQ,WACjE,IAAK,IAAIua,EAAIswB,EAAK7xB,MAAOyT,EAAIoe,EAAK7xB,MAAQA,EAAO5kB,EAAI4kB,EAAQ,EAAGuB,EAAIkS,EAAGlS,IAAKnmB,IAAK,CAC7E2G,EAAS,UAAc8vC,EAAKzzC,KAAKmjB,GAAGvmB,KAAK+G,IACzC,IAAIu4D,EAAY1E,GAAcA,EAAWx6D,GACzC4L,EAAQ,UAAcszD,EAAYA,EAAUj8D,KAAKyN,OAAOwuD,EAAUtnC,MAAOhsB,GAAS6qC,EAAKzzC,KAAKmjB,GAAGvmB,KAAKgM,IAExG26B,EAAGE,KAAK,IAAI8yB,EAAYt7C,EAAKA,EAAK,IAAI,KAAMtX,EAAO0gC,OAAOz7B,GAAQgZ,EAAOA,IAAQ,IAs4B7ExkB,CAAMyI,KAAMoV,EAAK2G,EAAO41C,GACjB3xD,KAKXigC,QAAQnlC,EAAMglC,EAAIX,GAEd,OA7pCR,SAAiBzB,EAAI5iC,EAAMglC,EAAIX,GAC3B,IACIm3B,EAAUC,EADVC,EAAU,GAAIC,EAAQ,GAE1B/4B,EAAGjgB,IAAI8iB,aAAazlC,EAAMglC,GAAI,CAAC3lC,EAAMib,EAAKkM,KACtC,IAAKnnB,EAAK0oC,SACN,OACJ,IAAIzT,EAAQj1B,EAAKi1B,MACjB,IAAK+P,EAAK7M,QAAQlD,IAAU9N,EAAOlnB,KAAK81C,eAAe/Q,EAAK/kC,MAAO,CAC/D,IAAI3C,EAAQ0lB,KAAKhe,IAAIiW,EAAKta,GAAOpD,EAAMylB,KAAKgE,IAAI/L,EAAMjb,EAAK8jC,SAAU6B,GACjE0wB,EAASrxB,EAAKjP,SAASd,GAC3B,IAAK,IAAIj4B,EAAI,EAAGA,EAAIi4B,EAAMh4B,OAAQD,IACzBi4B,EAAMj4B,GAAGm7B,QAAQk+B,KACd8F,GAAYA,EAASx2B,IAAMroC,GAAS6+D,EAASn3B,KAAK2V,GAAG1lB,EAAMj4B,IAC3Dm/D,EAASx2B,GAAKpoC,EAEd8+D,EAAQx7D,KAAKs7D,EAAW,IAAIhG,EAAe74D,EAAOC,EAAK03B,EAAMj4B,MAGrEo/D,GAAUA,EAAOz2B,IAAMroC,EACvB8+D,EAAOz2B,GAAKpoC,EAEZ++D,EAAMz7D,KAAKu7D,EAAS,IAAIpG,EAAY14D,EAAOC,EAAKynC,QAG5Dq3B,EAAQhmC,SAAQrB,GAAKuO,EAAGE,KAAKzO,KAC7BsnC,EAAMjmC,SAAQrB,GAAKuO,EAAGE,KAAKzO,KAmoCvB8Q,CAAQjgC,KAAMlF,EAAMglC,EAAIX,GACjBn/B,KAQXggC,WAAWllC,EAAMglC,EAAIX,GAEjB,OA5oCR,SAAoBzB,EAAI5iC,EAAMglC,EAAIX,GAC9B,IAAIwe,EAAU,GAAI/f,EAAO,EACzBF,EAAGjgB,IAAI8iB,aAAazlC,EAAMglC,GAAI,CAAC3lC,EAAMib,KACjC,IAAKjb,EAAK0oC,SACN,OACJjF,IACA,IAAI84B,EAAW,KACf,GAAIv3B,aAAgB,KAAU,CAC1B,IAAsB6T,EAAlB1kB,EAAMn0B,EAAKi1B,MACf,KAAO4jB,EAAQ7T,EAAK7M,QAAQhE,KACvBooC,IAAaA,EAAW,KAAK17D,KAAKg4C,GACnC1kB,EAAM0kB,EAAM5iB,cAAc9B,QAGzB6Q,EACDA,EAAK7M,QAAQn4B,EAAKi1B,SAClBsnC,EAAW,CAACv3B,IAGhBu3B,EAAWv8D,EAAKi1B,MAEpB,GAAIsnC,GAAYA,EAASt/D,OAAQ,CAC7B,IAAIM,EAAMylB,KAAKgE,IAAI/L,EAAMjb,EAAK8jC,SAAU6B,GACxC,IAAK,IAAI3oC,EAAI,EAAGA,EAAIu/D,EAASt/D,OAAQD,IAAK,CACtC,IAAyB67C,EAArB/wB,EAAQy0C,EAASv/D,GACrB,IAAK,IAAIi6B,EAAI,EAAGA,EAAIusB,EAAQvmD,OAAQg6B,IAAK,CACrC,IAAIG,EAAIosB,EAAQvsB,GACZG,EAAEqM,MAAQA,EAAO,GAAK3b,EAAM6yB,GAAG6I,EAAQvsB,GAAGnP,SAC1C+wB,EAAQzhB,GAEZyhB,GACAA,EAAMlT,GAAKpoC,EACXs7C,EAAMpV,KAAOA,GAGb+f,EAAQ3iD,KAAK,CAAEinB,QAAOnnB,KAAMqiB,KAAKhe,IAAIiW,EAAKta,GAAOglC,GAAIpoC,EAAKkmC,cAK1E+f,EAAQntB,SAAQe,GAAKmM,EAAGE,KAAK,IAAI0yB,EAAe/+B,EAAEz2B,KAAMy2B,EAAEuO,GAAIvO,EAAEtP,UAmmC5D+d,CAAWhgC,KAAMlF,EAAMglC,EAAIX,GACpBn/B,KAQX6uC,kBAAkBz5B,EAAKuhD,EAAYl9D,GAE/B,OA5mCR,SAA2BikC,EAAItoB,EAAKuhD,EAAYl9D,EAAQk9D,EAAWrd,cAC/D,IAAIn/C,EAAOujC,EAAGjgB,IAAIu7B,OAAO5jC,GACrBwhD,EAAY,GAAI1b,EAAM9lC,EAAM,EAChC,IAAK,IAAIje,EAAI,EAAGA,EAAIgD,EAAKqjC,WAAYrmC,IAAK,CACtC,IAAIktB,EAAQlqB,EAAKkqB,MAAMltB,GAAIO,EAAMwjD,EAAM72B,EAAM4Z,SACzC44B,EAAUp9D,EAAMw1C,UAAU5qB,EAAMjqB,MACpC,GAAKy8D,EAGA,CACDp9D,EAAQo9D,EACR,IAAK,IAAIzlC,EAAI,EAAGA,EAAI/M,EAAM+K,MAAMh4B,OAAQg6B,IAC/BulC,EAAWzmB,eAAe7rB,EAAM+K,MAAMgC,GAAGh3B,OAC1CsjC,EAAGE,KAAK,IAAI0yB,EAAepV,EAAKxjD,EAAK2sB,EAAM+K,MAAMgC,KACzD,GAAI/M,EAAM6K,SAAWynC,EAAWlnC,KAAK9xB,KAAM,CACvC,IAAI4zB,EAA0B/4B,EAAvBs+D,EAAU,YACjB,KAAOvlC,EAAIulC,EAAQ55C,KAAKmH,EAAMpgB,OACrBzL,IACDA,EAAQ,IAAI,KAAM,UAAcm+D,EAAWtnC,OAAOprB,KAAK,IAAK0yD,EAAW9Y,aAAax5B,EAAM+K,SAAU,EAAG,IAC3GwnC,EAAU57D,KAAK,IAAI01D,EAAYxV,EAAM3pB,EAAE55B,MAAOujD,EAAM3pB,EAAE55B,MAAQ45B,EAAE,GAAGn6B,OAAQoB,UAZnFo+D,EAAU57D,KAAK,IAAI01D,EAAYxV,EAAKxjD,EAAK,aAgB7CwjD,EAAMxjD,EAEV,IAAK+B,EAAMy1C,SAAU,CACjB,IAAIrO,EAAOpnC,EAAM+hD,WAAW,YAAgB,GAC5C9d,EAAGpzB,QAAQ4wC,EAAKA,EAAK,IAAI,KAAMra,EAAM,EAAG,IAE5C,IAAK,IAAI1pC,EAAIy/D,EAAUx/D,OAAS,EAAGD,GAAK,EAAGA,IACvCumC,EAAGE,KAAKg5B,EAAUz/D,IA6kClB03C,CAAkB7uC,KAAMoV,EAAKuhD,EAAYl9D,GAClCuG,Q,mECr9DR,MA0EM+2D,EAWX,SAKYp+D,GACR,GAAa,OAATA,QAA0Bb,IAATa,EACnB,OAAOuG,EAGT,GAAoB,oBAATvG,EACT,OAAOq+D,EAAYr+D,GAGrB,GAAoB,kBAATA,EACT,OAAOlD,MAAMF,QAAQoD,GAe7B,SAAoBs+D,GAElB,MAAMC,EAAS,GACf,IAAIv/D,GAAS,EAEb,OAASA,EAAQs/D,EAAM7/D,QACrB8/D,EAAOv/D,GAASo/D,EAAQE,EAAMt/D,IAGhC,OAAOq/D,EAAYG,GAMnB,SAASA,KAAOv8D,GACd,IAAIjD,GAAS,EAEb,OAASA,EAAQu/D,EAAO9/D,QACtB,GAAI8/D,EAAOv/D,GAAO+tB,MAAM1lB,KAAMpF,GAAa,OAAO,EAGpD,OAAO,GArC0Bw8D,CAAWz+D,GA+ChD,SAAsBgJ,GACpB,MAAM01D,EAAuD,EAE7D,OAAOL,EAAY15D,GAMnB,SAASA,EAAInD,GACX,MAAMm9D,EAAsD,EAK5D,IAAIzhE,EAEJ,IAAKA,KAAO8L,EACV,GAAI21D,EAAazhE,KAASwhE,EAAcxhE,GAAM,OAAO,EAGvD,OAAO,GApE6C0hE,CAAa5+D,GAG/D,GAAoB,kBAATA,EACT,OA0ER,SAAqBgJ,GACnB,OAAOq1D,EAAY58D,GAKnB,SAASA,EAAKD,GACZ,OAAOA,GAAQA,EAAKC,OAASuH,GAjFlB61D,CAAY7+D,GAGrB,MAAM,IAAI8iB,MAAM,iDAwFtB,SAASu7C,EAAYS,GACnB,OAMA,SAAelhE,EAAOoB,EAAO2pB,GAC3B,OAAOpnB,QACLw9D,EAAenhE,IACbkhE,EAAa/hE,KACXsK,KACAzJ,EACiB,kBAAVoB,EAAqBA,OAAQG,EACpCwpB,QAAUxpB,KAMpB,SAASoH,IACP,OAAO,EAOT,SAASw4D,EAAenhE,GACtB,OAAiB,OAAVA,GAAmC,kBAAVA,GAAsB,SAAUA,I,mIClElE,MAAMspC,EAAQ,GAUD83B,GAAO,EAKPC,EAAO,OAiDb,SAASC,EAAap9C,EAAM9hB,EAAMm/D,EAAS9b,GAEhD,IAAIr6C,EAEgB,oBAAThJ,GAA0C,oBAAZm/D,GACvC9b,EAAU8b,EAEVA,EAAUn/D,GAGVgJ,EAAQhJ,EAGV,MAAMo/D,GAAK,OAAQp2D,GACbi8B,EAAOoe,GAAW,EAAI,GAS5B,SAASgc,EAAQ79D,EAAMxC,EAAOsgE,GAC5B,MAAM1hE,EACJ4D,GAAwB,kBAATA,EAAoBA,EAAO,GAG5C,GAA0B,kBAAf5D,EAAM6D,KAAmB,CAClC,MAAMhE,EAEqB,kBAAlBG,EAAM+V,QACT/V,EAAM+V,QAEc,kBAAf/V,EAAMH,KACXG,EAAMH,UACN0B,EAEN/C,OAAOK,eAAe8iE,EAAO,OAAQ,CACnC3hE,MACE,SAAiB4D,EAAKC,MAAQhE,EAAO,IAAMA,EAAO,IAAM,IAAO,MAIrE,OAAO8hE,EAEP,SAASA,IAEP,IAEIC,EAEAl2D,EAEAm2D,EANAxgE,EAASioC,EAQb,KAAKlnC,GAAQo/D,EAAG59D,EAAMxC,EAAOsgE,EAAQA,EAAQ7gE,OAAS,SAAMU,MAE1DF,EA0CR,SAAkBrB,GAChB,GAAId,MAAMF,QAAQgB,GAChB,OAAOA,EAGT,GAAqB,kBAAVA,EACT,MAAO,CArKa,KAqKFA,GAGpB,OAAiB,OAAVA,QAA4BuB,IAAVvB,EAAsBspC,EAAQ,CAACtpC,GAnDzC8hE,CAASP,EAAQ39D,EAAM89D,IAE5BrgE,EAAO,KAAO+/D,GAChB,OAAO//D,EAIX,GAAI,aAAcuC,GAAQA,EAAKG,SAAU,CACvC,MAAMg+D,EAA0C,EAEhD,GAAIA,EAAah+D,UAAY1C,EAAO,KAAOggE,EAIzC,IAHA31D,GAAU+5C,EAAUsc,EAAah+D,SAASlD,QAAU,GAAKwmC,EACzDw6B,EAAeH,EAAQ5lC,OAAOimC,GAEvBr2D,GAAU,GAAKA,EAASq2D,EAAah+D,SAASlD,QAAQ,CAC3D,MAAMitB,EAAQi0C,EAAah+D,SAAS2H,GAIpC,GAFAk2D,EAAYH,EAAQ3zC,EAAOpiB,EAAQm2D,EAAvBJ,GAERG,EAAU,KAAOR,EACnB,OAAOQ,EAGTl2D,EAC0B,kBAAjBk2D,EAAU,GAAkBA,EAAU,GAAKl2D,EAAS27B,GAKnE,OAAOhmC,GAvEXogE,CAAQv9C,OAAM3iB,EAAW,GAAzBkgE,K,kFCzBK,SAASE,EAAMz9C,EAAM89C,EAAeC,EAAkBC,GAE3D,IAAIzc,EAEArjD,EAEAm/D,EAGuB,oBAAlBS,GACqB,oBAArBC,GAEP7/D,OAAOb,EACPggE,EAAUS,EACVvc,EAAUwc,IAGV7/D,EAAO4/D,EAEPT,EAAUU,EACVxc,EAAUyc,IAGZ,QAAah+C,EAAM9hB,GAMnB,SAAkBwB,EAAM89D,GACtB,MAAM32C,EAAS22C,EAAQA,EAAQ7gE,OAAS,GAClCO,EAAQ2pB,EAASA,EAAOhnB,SAASsmB,QAAQzmB,QAAQrC,EACvD,OAAOggE,EAAQ39D,EAAMxC,EAAO2pB,KATK06B","sources":["webpack://_N_E/./node_modules/extend/index.js","webpack://_N_E/./node_modules/lodash/_asciiToArray.js","webpack://_N_E/./node_modules/lodash/_baseSlice.js","webpack://_N_E/./node_modules/lodash/_castSlice.js","webpack://_N_E/./node_modules/lodash/_createCaseFirst.js","webpack://_N_E/./node_modules/lodash/_hasUnicode.js","webpack://_N_E/./node_modules/lodash/_stringToArray.js","webpack://_N_E/./node_modules/lodash/_unicodeToArray.js","webpack://_N_E/./node_modules/lodash/capitalize.js","webpack://_N_E/./node_modules/lodash/upperFirst.js","webpack://_N_E/./node_modules/mdast-util-to-string/lib/index.js","webpack://_N_E/./node_modules/micromark-util-chunked/index.js","webpack://_N_E/./node_modules/micromark-util-subtokenize/index.js","webpack://_N_E/./node_modules/micromark-util-combine-extensions/index.js","webpack://_N_E/./node_modules/micromark-util-character/index.js","webpack://_N_E/./node_modules/micromark-factory-space/index.js","webpack://_N_E/./node_modules/micromark/lib/initialize/content.js","webpack://_N_E/./node_modules/micromark/lib/initialize/document.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/blank-line.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/content.js","webpack://_N_E/./node_modules/micromark/lib/initialize/flow.js","webpack://_N_E/./node_modules/micromark/lib/initialize/text.js","webpack://_N_E/./node_modules/micromark-util-resolve-all/index.js","webpack://_N_E/./node_modules/micromark/lib/create-tokenizer.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/thematic-break.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/list.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/block-quote.js","webpack://_N_E/./node_modules/micromark-factory-destination/index.js","webpack://_N_E/./node_modules/micromark-factory-label/index.js","webpack://_N_E/./node_modules/micromark-factory-title/index.js","webpack://_N_E/./node_modules/micromark-factory-whitespace/index.js","webpack://_N_E/./node_modules/micromark-util-normalize-identifier/index.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/definition.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/code-indented.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/heading-atx.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/setext-underline.js","webpack://_N_E/./node_modules/micromark-util-html-tag-name/index.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/html-flow.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/code-fenced.js","webpack://_N_E/./node_modules/decode-named-character-reference/index.dom.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/character-reference.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/character-escape.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/line-ending.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/label-end.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/label-start-image.js","webpack://_N_E/./node_modules/micromark-util-classify-character/index.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/attention.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/autolink.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/html-text.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/label-start-link.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/hard-break-escape.js","webpack://_N_E/./node_modules/micromark-core-commonmark/lib/code-text.js","webpack://_N_E/./node_modules/micromark/lib/constructs.js","webpack://_N_E/./node_modules/micromark/lib/parse.js","webpack://_N_E/./node_modules/micromark/lib/preprocess.js","webpack://_N_E/./node_modules/micromark-util-decode-numeric-character-reference/index.js","webpack://_N_E/./node_modules/micromark-util-decode-string/index.js","webpack://_N_E/./node_modules/unist-util-stringify-position/lib/index.js","webpack://_N_E/./node_modules/mdast-util-from-markdown/lib/index.js","webpack://_N_E/./node_modules/micromark/lib/postprocess.js","webpack://_N_E/./node_modules/remark-parse/lib/index.js","webpack://_N_E/./node_modules/zwitch/index.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/configure.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/blockquote.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/pattern-in-scope.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/break.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/format-code-as-indented.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/code.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/check-quote.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/emphasis.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/check-emphasis.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/format-heading-as-setext.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/html.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/image.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/image-reference.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/inline-code.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/format-link-as-autolink.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/link.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/link-reference.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/check-bullet.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/check-rule.js","webpack://_N_E/./node_modules/mdast-util-phrasing/lib/index.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/strong.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/check-strong.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/index.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/check-fence.js","webpack://_N_E/./node_modules/longest-streak/index.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/definition.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/heading.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/list.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/check-bullet-ordered.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/check-bullet-other.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/list-item.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/check-list-item-indent.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/paragraph.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/root.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/text.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/handle/thematic-break.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/check-rule-repetition.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/join.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/unsafe.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/association.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/compile-pattern.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/container-flow.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/indent-lines.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/safe.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/track.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/index.js","webpack://_N_E/./node_modules/mdast-util-to-markdown/lib/util/container-phrasing.js","webpack://_N_E/./node_modules/remark-stringify/lib/index.js","webpack://_N_E/./node_modules/bail/index.js","webpack://_N_E/./node_modules/is-plain-obj/index.js","webpack://_N_E/./node_modules/trough/lib/index.js","webpack://_N_E/./node_modules/vfile-message/lib/index.js","webpack://_N_E/./node_modules/vfile/lib/minpath.browser.js","webpack://_N_E/./node_modules/vfile/lib/minproc.browser.js","webpack://_N_E/./node_modules/vfile/lib/minurl.shared.js","webpack://_N_E/./node_modules/vfile/lib/minurl.browser.js","webpack://_N_E/./node_modules/vfile/lib/index.js","webpack://_N_E/./node_modules/unified/lib/callable-instance.js","webpack://_N_E/./node_modules/unified/lib/index.js","webpack://_N_E/./node_modules/@milkdown/transformer/lib/index.es.js","webpack://_N_E/./node_modules/@milkdown/core/lib/index.es.js","webpack://_N_E/./node_modules/@milkdown/ctx/lib/index.es.js","webpack://_N_E/./node_modules/@milkdown/exception/lib/index.es.js","webpack://_N_E/./node_modules/@sindresorhus/slugify/node_modules/escape-string-regexp/index.js","webpack://_N_E/./node_modules/@sindresorhus/transliterate/node_modules/escape-string-regexp/index.js","webpack://_N_E/./node_modules/@sindresorhus/transliterate/replacements.js","webpack://_N_E/./node_modules/@sindresorhus/transliterate/index.js","webpack://_N_E/./node_modules/@sindresorhus/slugify/overridable-replacements.js","webpack://_N_E/./node_modules/@sindresorhus/slugify/index.js","webpack://_N_E/./node_modules/prosemirror-schema-list/dist/index.js","webpack://_N_E/./node_modules/mdast-util-definitions/lib/index.js","webpack://_N_E/./node_modules/remark-inline-links/lib/index.js","webpack://_N_E/./node_modules/@milkdown/preset-commonmark/lib/index.es.js","webpack://_N_E/./node_modules/@milkdown/prose/lib/index.js","webpack://_N_E/./node_modules/@milkdown/react/lib/index.es.js","webpack://_N_E/./node_modules/@milkdown/utils/node_modules/nanoid/index.browser.js","webpack://_N_E/./node_modules/@milkdown/utils/lib/index.es.js","webpack://_N_E/./node_modules/prosemirror-commands/dist/index.js","webpack://_N_E/./node_modules/prosemirror-inputrules/dist/index.js","webpack://_N_E/./node_modules/w3c-keyname/index.js","webpack://_N_E/./node_modules/prosemirror-keymap/dist/index.js","webpack://_N_E/./node_modules/orderedmap/dist/index.js","webpack://_N_E/./node_modules/prosemirror-model/dist/index.js","webpack://_N_E/./node_modules/prosemirror-state/dist/index.js","webpack://_N_E/./node_modules/prosemirror-transform/dist/index.js","webpack://_N_E/./node_modules/unist-util-is/lib/index.js","webpack://_N_E/./node_modules/unist-util-visit-parents/lib/index.js","webpack://_N_E/./node_modules/unist-util-visit/lib/index.js"],"sourcesContent":["'use strict';\n\nvar hasOwn = Object.prototype.hasOwnProperty;\nvar toStr = Object.prototype.toString;\nvar defineProperty = Object.defineProperty;\nvar gOPD = Object.getOwnPropertyDescriptor;\n\nvar isArray = function isArray(arr) {\n\tif (typeof Array.isArray === 'function') {\n\t\treturn Array.isArray(arr);\n\t}\n\n\treturn toStr.call(arr) === '[object Array]';\n};\n\nvar isPlainObject = function isPlainObject(obj) {\n\tif (!obj || toStr.call(obj) !== '[object Object]') {\n\t\treturn false;\n\t}\n\n\tvar hasOwnConstructor = hasOwn.call(obj, 'constructor');\n\tvar hasIsPrototypeOf = obj.constructor && obj.constructor.prototype && hasOwn.call(obj.constructor.prototype, 'isPrototypeOf');\n\t// Not own constructor property must be Object\n\tif (obj.constructor && !hasOwnConstructor && !hasIsPrototypeOf) {\n\t\treturn false;\n\t}\n\n\t// Own properties are enumerated firstly, so to speed up,\n\t// if last one is own, then all properties are own.\n\tvar key;\n\tfor (key in obj) { /**/ }\n\n\treturn typeof key === 'undefined' || hasOwn.call(obj, key);\n};\n\n// If name is '__proto__', and Object.defineProperty is available, define __proto__ as an own property on target\nvar setProperty = function setProperty(target, options) {\n\tif (defineProperty && options.name === '__proto__') {\n\t\tdefineProperty(target, options.name, {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: true,\n\t\t\tvalue: options.newValue,\n\t\t\twritable: true\n\t\t});\n\t} else {\n\t\ttarget[options.name] = options.newValue;\n\t}\n};\n\n// Return undefined instead of __proto__ if '__proto__' is not an own property\nvar getProperty = function getProperty(obj, name) {\n\tif (name === '__proto__') {\n\t\tif (!hasOwn.call(obj, name)) {\n\t\t\treturn void 0;\n\t\t} else if (gOPD) {\n\t\t\t// In early versions of node, obj['__proto__'] is buggy when obj has\n\t\t\t// __proto__ as an own property. Object.getOwnPropertyDescriptor() works.\n\t\t\treturn gOPD(obj, name).value;\n\t\t}\n\t}\n\n\treturn obj[name];\n};\n\nmodule.exports = function extend() {\n\tvar options, name, src, copy, copyIsArray, clone;\n\tvar target = arguments[0];\n\tvar i = 1;\n\tvar length = arguments.length;\n\tvar deep = false;\n\n\t// Handle a deep copy situation\n\tif (typeof target === 'boolean') {\n\t\tdeep = target;\n\t\ttarget = arguments[1] || {};\n\t\t// skip the boolean and the target\n\t\ti = 2;\n\t}\n\tif (target == null || (typeof target !== 'object' && typeof target !== 'function')) {\n\t\ttarget = {};\n\t}\n\n\tfor (; i < length; ++i) {\n\t\toptions = arguments[i];\n\t\t// Only deal with non-null/undefined values\n\t\tif (options != null) {\n\t\t\t// Extend the base object\n\t\t\tfor (name in options) {\n\t\t\t\tsrc = getProperty(target, name);\n\t\t\t\tcopy = getProperty(options, name);\n\n\t\t\t\t// Prevent never-ending loop\n\t\t\t\tif (target !== copy) {\n\t\t\t\t\t// Recurse if we're merging plain objects or arrays\n\t\t\t\t\tif (deep && copy && (isPlainObject(copy) || (copyIsArray = isArray(copy)))) {\n\t\t\t\t\t\tif (copyIsArray) {\n\t\t\t\t\t\t\tcopyIsArray = false;\n\t\t\t\t\t\t\tclone = src && isArray(src) ? src : [];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tclone = src && isPlainObject(src) ? src : {};\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Never move original objects, clone them\n\t\t\t\t\t\tsetProperty(target, { name: name, newValue: extend(deep, clone, copy) });\n\n\t\t\t\t\t// Don't bring in undefined values\n\t\t\t\t\t} else if (typeof copy !== 'undefined') {\n\t\t\t\t\t\tsetProperty(target, { name: name, newValue: copy });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Return the modified object\n\treturn target;\n};\n","/**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction asciiToArray(string) {\n  return string.split('');\n}\n\nmodule.exports = asciiToArray;\n","/**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\nfunction baseSlice(array, start, end) {\n  var index = -1,\n      length = array.length;\n\n  if (start < 0) {\n    start = -start > length ? 0 : (length + start);\n  }\n  end = end > length ? length : end;\n  if (end < 0) {\n    end += length;\n  }\n  length = start > end ? 0 : ((end - start) >>> 0);\n  start >>>= 0;\n\n  var result = Array(length);\n  while (++index < length) {\n    result[index] = array[index + start];\n  }\n  return result;\n}\n\nmodule.exports = baseSlice;\n","var baseSlice = require('./_baseSlice');\n\n/**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\nfunction castSlice(array, start, end) {\n  var length = array.length;\n  end = end === undefined ? length : end;\n  return (!start && end >= length) ? array : baseSlice(array, start, end);\n}\n\nmodule.exports = castSlice;\n","var castSlice = require('./_castSlice'),\n    hasUnicode = require('./_hasUnicode'),\n    stringToArray = require('./_stringToArray'),\n    toString = require('./toString');\n\n/**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\nfunction createCaseFirst(methodName) {\n  return function(string) {\n    string = toString(string);\n\n    var strSymbols = hasUnicode(string)\n      ? stringToArray(string)\n      : undefined;\n\n    var chr = strSymbols\n      ? strSymbols[0]\n      : string.charAt(0);\n\n    var trailing = strSymbols\n      ? castSlice(strSymbols, 1).join('')\n      : string.slice(1);\n\n    return chr[methodName]() + trailing;\n  };\n}\n\nmodule.exports = createCaseFirst;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsZWJ = '\\\\u200d';\n\n/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n/**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\nfunction hasUnicode(string) {\n  return reHasUnicode.test(string);\n}\n\nmodule.exports = hasUnicode;\n","var asciiToArray = require('./_asciiToArray'),\n    hasUnicode = require('./_hasUnicode'),\n    unicodeToArray = require('./_unicodeToArray');\n\n/**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction stringToArray(string) {\n  return hasUnicode(string)\n    ? unicodeToArray(string)\n    : asciiToArray(string);\n}\n\nmodule.exports = stringToArray;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction unicodeToArray(string) {\n  return string.match(reUnicode) || [];\n}\n\nmodule.exports = unicodeToArray;\n","var toString = require('./toString'),\n    upperFirst = require('./upperFirst');\n\n/**\n * Converts the first character of `string` to upper case and the remaining\n * to lower case.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to capitalize.\n * @returns {string} Returns the capitalized string.\n * @example\n *\n * _.capitalize('FRED');\n * // => 'Fred'\n */\nfunction capitalize(string) {\n  return upperFirst(toString(string).toLowerCase());\n}\n\nmodule.exports = capitalize;\n","var createCaseFirst = require('./_createCaseFirst');\n\n/**\n * Converts the first character of `string` to upper case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.upperFirst('fred');\n * // => 'Fred'\n *\n * _.upperFirst('FRED');\n * // => 'FRED'\n */\nvar upperFirst = createCaseFirst('toUpperCase');\n\nmodule.exports = upperFirst;\n","/**\n * @typedef {import('mdast').Nodes} Nodes\n *\n * @typedef Options\n *   Configuration (optional).\n * @property {boolean | null | undefined} [includeImageAlt=true]\n *   Whether to use `alt` for `image`s (default: `true`).\n * @property {boolean | null | undefined} [includeHtml=true]\n *   Whether to use `value` of HTML (default: `true`).\n */\n\n/** @type {Options} */\nconst emptyOptions = {}\n\n/**\n * Get the text content of a node or list of nodes.\n *\n * Prefers the node’s plain-text fields, otherwise serializes its children,\n * and if the given value is an array, serialize the nodes in it.\n *\n * @param {unknown} [value]\n *   Thing to serialize, typically `Node`.\n * @param {Options | null | undefined} [options]\n *   Configuration (optional).\n * @returns {string}\n *   Serialized `value`.\n */\nexport function toString(value, options) {\n  const settings = options || emptyOptions\n  const includeImageAlt =\n    typeof settings.includeImageAlt === 'boolean'\n      ? settings.includeImageAlt\n      : true\n  const includeHtml =\n    typeof settings.includeHtml === 'boolean' ? settings.includeHtml : true\n\n  return one(value, includeImageAlt, includeHtml)\n}\n\n/**\n * One node or several nodes.\n *\n * @param {unknown} value\n *   Thing to serialize.\n * @param {boolean} includeImageAlt\n *   Include image `alt`s.\n * @param {boolean} includeHtml\n *   Include HTML.\n * @returns {string}\n *   Serialized node.\n */\nfunction one(value, includeImageAlt, includeHtml) {\n  if (node(value)) {\n    if ('value' in value) {\n      return value.type === 'html' && !includeHtml ? '' : value.value\n    }\n\n    if (includeImageAlt && 'alt' in value && value.alt) {\n      return value.alt\n    }\n\n    if ('children' in value) {\n      return all(value.children, includeImageAlt, includeHtml)\n    }\n  }\n\n  if (Array.isArray(value)) {\n    return all(value, includeImageAlt, includeHtml)\n  }\n\n  return ''\n}\n\n/**\n * Serialize a list of nodes.\n *\n * @param {Array<unknown>} values\n *   Thing to serialize.\n * @param {boolean} includeImageAlt\n *   Include image `alt`s.\n * @param {boolean} includeHtml\n *   Include HTML.\n * @returns {string}\n *   Serialized nodes.\n */\nfunction all(values, includeImageAlt, includeHtml) {\n  /** @type {Array<string>} */\n  const result = []\n  let index = -1\n\n  while (++index < values.length) {\n    result[index] = one(values[index], includeImageAlt, includeHtml)\n  }\n\n  return result.join('')\n}\n\n/**\n * Check if `value` looks like a node.\n *\n * @param {unknown} value\n *   Thing.\n * @returns {value is Nodes}\n *   Whether `value` is a node.\n */\nfunction node(value) {\n  return Boolean(value && typeof value === 'object')\n}\n","/**\n * Like `Array#splice`, but smarter for giant arrays.\n *\n * `Array#splice` takes all items to be inserted as individual argument which\n * causes a stack overflow in V8 when trying to insert 100k items for instance.\n *\n * Otherwise, this does not return the removed items, and takes `items` as an\n * array instead of rest parameters.\n *\n * @template {unknown} T\n *   Item type.\n * @param {Array<T>} list\n *   List to operate on.\n * @param {number} start\n *   Index to remove/insert at (can be negative).\n * @param {number} remove\n *   Number of items to remove.\n * @param {Array<T>} items\n *   Items to inject into `list`.\n * @returns {undefined}\n *   Nothing.\n */\nexport function splice(list, start, remove, items) {\n  const end = list.length\n  let chunkStart = 0\n  /** @type {Array<unknown>} */\n  let parameters\n\n  // Make start between zero and `end` (included).\n  if (start < 0) {\n    start = -start > end ? 0 : end + start\n  } else {\n    start = start > end ? end : start\n  }\n  remove = remove > 0 ? remove : 0\n\n  // No need to chunk the items if there’s only a couple (10k) items.\n  if (items.length < 10000) {\n    parameters = Array.from(items)\n    parameters.unshift(start, remove)\n    // @ts-expect-error Hush, it’s fine.\n    list.splice(...parameters)\n  } else {\n    // Delete `remove` items starting from `start`\n    if (remove) list.splice(start, remove)\n\n    // Insert the items in chunks to not cause stack overflows.\n    while (chunkStart < items.length) {\n      parameters = items.slice(chunkStart, chunkStart + 10000)\n      parameters.unshift(start, 0)\n      // @ts-expect-error Hush, it’s fine.\n      list.splice(...parameters)\n      chunkStart += 10000\n      start += 10000\n    }\n  }\n}\n\n/**\n * Append `items` (an array) at the end of `list` (another array).\n * When `list` was empty, returns `items` instead.\n *\n * This prevents a potentially expensive operation when `list` is empty,\n * and adds items in batches to prevent V8 from hanging.\n *\n * @template {unknown} T\n *   Item type.\n * @param {Array<T>} list\n *   List to operate on.\n * @param {Array<T>} items\n *   Items to add to `list`.\n * @returns {Array<T>}\n *   Either `list` or `items`.\n */\nexport function push(list, items) {\n  if (list.length > 0) {\n    splice(list, list.length, 0, items)\n    return list\n  }\n  return items\n}\n","/**\n * @typedef {import('micromark-util-types').Chunk} Chunk\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Token} Token\n */\n\nimport {splice} from 'micromark-util-chunked'\n/**\n * Tokenize subcontent.\n *\n * @param {Array<Event>} events\n *   List of events.\n * @returns {boolean}\n *   Whether subtokens were found.\n */ // eslint-disable-next-line complexity\nexport function subtokenize(events) {\n  /** @type {Record<string, number>} */\n  const jumps = {}\n  let index = -1\n  /** @type {Event} */\n  let event\n  /** @type {number | undefined} */\n  let lineIndex\n  /** @type {number} */\n  let otherIndex\n  /** @type {Event} */\n  let otherEvent\n  /** @type {Array<Event>} */\n  let parameters\n  /** @type {Array<Event>} */\n  let subevents\n  /** @type {boolean | undefined} */\n  let more\n  while (++index < events.length) {\n    while (index in jumps) {\n      index = jumps[index]\n    }\n    event = events[index]\n\n    // Add a hook for the GFM tasklist extension, which needs to know if text\n    // is in the first content of a list item.\n    if (\n      index &&\n      event[1].type === 'chunkFlow' &&\n      events[index - 1][1].type === 'listItemPrefix'\n    ) {\n      subevents = event[1]._tokenizer.events\n      otherIndex = 0\n      if (\n        otherIndex < subevents.length &&\n        subevents[otherIndex][1].type === 'lineEndingBlank'\n      ) {\n        otherIndex += 2\n      }\n      if (\n        otherIndex < subevents.length &&\n        subevents[otherIndex][1].type === 'content'\n      ) {\n        while (++otherIndex < subevents.length) {\n          if (subevents[otherIndex][1].type === 'content') {\n            break\n          }\n          if (subevents[otherIndex][1].type === 'chunkText') {\n            subevents[otherIndex][1]._isInFirstContentOfListItem = true\n            otherIndex++\n          }\n        }\n      }\n    }\n\n    // Enter.\n    if (event[0] === 'enter') {\n      if (event[1].contentType) {\n        Object.assign(jumps, subcontent(events, index))\n        index = jumps[index]\n        more = true\n      }\n    }\n    // Exit.\n    else if (event[1]._container) {\n      otherIndex = index\n      lineIndex = undefined\n      while (otherIndex--) {\n        otherEvent = events[otherIndex]\n        if (\n          otherEvent[1].type === 'lineEnding' ||\n          otherEvent[1].type === 'lineEndingBlank'\n        ) {\n          if (otherEvent[0] === 'enter') {\n            if (lineIndex) {\n              events[lineIndex][1].type = 'lineEndingBlank'\n            }\n            otherEvent[1].type = 'lineEnding'\n            lineIndex = otherIndex\n          }\n        } else {\n          break\n        }\n      }\n      if (lineIndex) {\n        // Fix position.\n        event[1].end = Object.assign({}, events[lineIndex][1].start)\n\n        // Switch container exit w/ line endings.\n        parameters = events.slice(lineIndex, index)\n        parameters.unshift(event)\n        splice(events, lineIndex, index - lineIndex + 1, parameters)\n      }\n    }\n  }\n  return !more\n}\n\n/**\n * Tokenize embedded tokens.\n *\n * @param {Array<Event>} events\n * @param {number} eventIndex\n * @returns {Record<string, number>}\n */\nfunction subcontent(events, eventIndex) {\n  const token = events[eventIndex][1]\n  const context = events[eventIndex][2]\n  let startPosition = eventIndex - 1\n  /** @type {Array<number>} */\n  const startPositions = []\n  const tokenizer =\n    token._tokenizer || context.parser[token.contentType](token.start)\n  const childEvents = tokenizer.events\n  /** @type {Array<[number, number]>} */\n  const jumps = []\n  /** @type {Record<string, number>} */\n  const gaps = {}\n  /** @type {Array<Chunk>} */\n  let stream\n  /** @type {Token | undefined} */\n  let previous\n  let index = -1\n  /** @type {Token | undefined} */\n  let current = token\n  let adjust = 0\n  let start = 0\n  const breaks = [start]\n\n  // Loop forward through the linked tokens to pass them in order to the\n  // subtokenizer.\n  while (current) {\n    // Find the position of the event for this token.\n    while (events[++startPosition][1] !== current) {\n      // Empty.\n    }\n    startPositions.push(startPosition)\n    if (!current._tokenizer) {\n      stream = context.sliceStream(current)\n      if (!current.next) {\n        stream.push(null)\n      }\n      if (previous) {\n        tokenizer.defineSkip(current.start)\n      }\n      if (current._isInFirstContentOfListItem) {\n        tokenizer._gfmTasklistFirstContentOfListItem = true\n      }\n      tokenizer.write(stream)\n      if (current._isInFirstContentOfListItem) {\n        tokenizer._gfmTasklistFirstContentOfListItem = undefined\n      }\n    }\n\n    // Unravel the next token.\n    previous = current\n    current = current.next\n  }\n\n  // Now, loop back through all events (and linked tokens), to figure out which\n  // parts belong where.\n  current = token\n  while (++index < childEvents.length) {\n    if (\n      // Find a void token that includes a break.\n      childEvents[index][0] === 'exit' &&\n      childEvents[index - 1][0] === 'enter' &&\n      childEvents[index][1].type === childEvents[index - 1][1].type &&\n      childEvents[index][1].start.line !== childEvents[index][1].end.line\n    ) {\n      start = index + 1\n      breaks.push(start)\n      // Help GC.\n      current._tokenizer = undefined\n      current.previous = undefined\n      current = current.next\n    }\n  }\n\n  // Help GC.\n  tokenizer.events = []\n\n  // If there’s one more token (which is the cases for lines that end in an\n  // EOF), that’s perfect: the last point we found starts it.\n  // If there isn’t then make sure any remaining content is added to it.\n  if (current) {\n    // Help GC.\n    current._tokenizer = undefined\n    current.previous = undefined\n  } else {\n    breaks.pop()\n  }\n\n  // Now splice the events from the subtokenizer into the current events,\n  // moving back to front so that splice indices aren’t affected.\n  index = breaks.length\n  while (index--) {\n    const slice = childEvents.slice(breaks[index], breaks[index + 1])\n    const start = startPositions.pop()\n    jumps.unshift([start, start + slice.length - 1])\n    splice(events, start, 2, slice)\n  }\n  index = -1\n  while (++index < jumps.length) {\n    gaps[adjust + jumps[index][0]] = adjust + jumps[index][1]\n    adjust += jumps[index][1] - jumps[index][0] - 1\n  }\n  return gaps\n}\n","/**\n * @typedef {import('micromark-util-types').Extension} Extension\n * @typedef {import('micromark-util-types').Handles} Handles\n * @typedef {import('micromark-util-types').HtmlExtension} HtmlExtension\n * @typedef {import('micromark-util-types').NormalizedExtension} NormalizedExtension\n */\n\nimport {splice} from 'micromark-util-chunked'\n\nconst hasOwnProperty = {}.hasOwnProperty\n\n/**\n * Combine multiple syntax extensions into one.\n *\n * @param {Array<Extension>} extensions\n *   List of syntax extensions.\n * @returns {NormalizedExtension}\n *   A single combined extension.\n */\nexport function combineExtensions(extensions) {\n  /** @type {NormalizedExtension} */\n  const all = {}\n  let index = -1\n\n  while (++index < extensions.length) {\n    syntaxExtension(all, extensions[index])\n  }\n\n  return all\n}\n\n/**\n * Merge `extension` into `all`.\n *\n * @param {NormalizedExtension} all\n *   Extension to merge into.\n * @param {Extension} extension\n *   Extension to merge.\n * @returns {undefined}\n */\nfunction syntaxExtension(all, extension) {\n  /** @type {keyof Extension} */\n  let hook\n\n  for (hook in extension) {\n    const maybe = hasOwnProperty.call(all, hook) ? all[hook] : undefined\n    /** @type {Record<string, unknown>} */\n    const left = maybe || (all[hook] = {})\n    /** @type {Record<string, unknown> | undefined} */\n    const right = extension[hook]\n    /** @type {string} */\n    let code\n\n    if (right) {\n      for (code in right) {\n        if (!hasOwnProperty.call(left, code)) left[code] = []\n        const value = right[code]\n        constructs(\n          // @ts-expect-error Looks like a list.\n          left[code],\n          Array.isArray(value) ? value : value ? [value] : []\n        )\n      }\n    }\n  }\n}\n\n/**\n * Merge `list` into `existing` (both lists of constructs).\n * Mutates `existing`.\n *\n * @param {Array<unknown>} existing\n * @param {Array<unknown>} list\n * @returns {undefined}\n */\nfunction constructs(existing, list) {\n  let index = -1\n  /** @type {Array<unknown>} */\n  const before = []\n\n  while (++index < list.length) {\n    // @ts-expect-error Looks like an object.\n    ;(list[index].add === 'after' ? existing : before).push(list[index])\n  }\n\n  splice(existing, 0, 0, before)\n}\n\n/**\n * Combine multiple HTML extensions into one.\n *\n * @param {Array<HtmlExtension>} htmlExtensions\n *   List of HTML extensions.\n * @returns {HtmlExtension}\n *   A single combined HTML extension.\n */\nexport function combineHtmlExtensions(htmlExtensions) {\n  /** @type {HtmlExtension} */\n  const handlers = {}\n  let index = -1\n\n  while (++index < htmlExtensions.length) {\n    htmlExtension(handlers, htmlExtensions[index])\n  }\n\n  return handlers\n}\n\n/**\n * Merge `extension` into `all`.\n *\n * @param {HtmlExtension} all\n *   Extension to merge into.\n * @param {HtmlExtension} extension\n *   Extension to merge.\n * @returns {undefined}\n */\nfunction htmlExtension(all, extension) {\n  /** @type {keyof HtmlExtension} */\n  let hook\n\n  for (hook in extension) {\n    const maybe = hasOwnProperty.call(all, hook) ? all[hook] : undefined\n    const left = maybe || (all[hook] = {})\n    const right = extension[hook]\n    /** @type {keyof Handles} */\n    let type\n\n    if (right) {\n      for (type in right) {\n        // @ts-expect-error assume document vs regular handler are managed correctly.\n        left[type] = right[type]\n      }\n    }\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n */\n\n/**\n * Check whether the character code represents an ASCII alpha (`a` through `z`,\n * case insensitive).\n *\n * An **ASCII alpha** is an ASCII upper alpha or ASCII lower alpha.\n *\n * An **ASCII upper alpha** is a character in the inclusive range U+0041 (`A`)\n * to U+005A (`Z`).\n *\n * An **ASCII lower alpha** is a character in the inclusive range U+0061 (`a`)\n * to U+007A (`z`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiAlpha = regexCheck(/[A-Za-z]/);\n\n/**\n * Check whether the character code represents an ASCII alphanumeric (`a`\n * through `z`, case insensitive, or `0` through `9`).\n *\n * An **ASCII alphanumeric** is an ASCII digit (see `asciiDigit`) or ASCII alpha\n * (see `asciiAlpha`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiAlphanumeric = regexCheck(/[\\dA-Za-z]/);\n\n/**\n * Check whether the character code represents an ASCII atext.\n *\n * atext is an ASCII alphanumeric (see `asciiAlphanumeric`), or a character in\n * the inclusive ranges U+0023 NUMBER SIGN (`#`) to U+0027 APOSTROPHE (`'`),\n * U+002A ASTERISK (`*`), U+002B PLUS SIGN (`+`), U+002D DASH (`-`), U+002F\n * SLASH (`/`), U+003D EQUALS TO (`=`), U+003F QUESTION MARK (`?`), U+005E\n * CARET (`^`) to U+0060 GRAVE ACCENT (`` ` ``), or U+007B LEFT CURLY BRACE\n * (`{`) to U+007E TILDE (`~`).\n *\n * See:\n * **\\[RFC5322]**:\n * [Internet Message Format](https://tools.ietf.org/html/rfc5322).\n * P. Resnick.\n * IETF.\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiAtext = regexCheck(/[#-'*+\\--9=?A-Z^-~]/);\n\n/**\n * Check whether a character code is an ASCII control character.\n *\n * An **ASCII control** is a character in the inclusive range U+0000 NULL (NUL)\n * to U+001F (US), or U+007F (DEL).\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function asciiControl(code) {\n  return (\n    // Special whitespace codes (which have negative values), C0 and Control\n    // character DEL\n    code !== null && (code < 32 || code === 127)\n  );\n}\n\n/**\n * Check whether the character code represents an ASCII digit (`0` through `9`).\n *\n * An **ASCII digit** is a character in the inclusive range U+0030 (`0`) to\n * U+0039 (`9`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiDigit = regexCheck(/\\d/);\n\n/**\n * Check whether the character code represents an ASCII hex digit (`a` through\n * `f`, case insensitive, or `0` through `9`).\n *\n * An **ASCII hex digit** is an ASCII digit (see `asciiDigit`), ASCII upper hex\n * digit, or an ASCII lower hex digit.\n *\n * An **ASCII upper hex digit** is a character in the inclusive range U+0041\n * (`A`) to U+0046 (`F`).\n *\n * An **ASCII lower hex digit** is a character in the inclusive range U+0061\n * (`a`) to U+0066 (`f`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiHexDigit = regexCheck(/[\\dA-Fa-f]/);\n\n/**\n * Check whether the character code represents ASCII punctuation.\n *\n * An **ASCII punctuation** is a character in the inclusive ranges U+0021\n * EXCLAMATION MARK (`!`) to U+002F SLASH (`/`), U+003A COLON (`:`) to U+0040 AT\n * SIGN (`@`), U+005B LEFT SQUARE BRACKET (`[`) to U+0060 GRAVE ACCENT\n * (`` ` ``), or U+007B LEFT CURLY BRACE (`{`) to U+007E TILDE (`~`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/);\n\n/**\n * Check whether a character code is a markdown line ending.\n *\n * A **markdown line ending** is the virtual characters M-0003 CARRIAGE RETURN\n * LINE FEED (CRLF), M-0004 LINE FEED (LF) and M-0005 CARRIAGE RETURN (CR).\n *\n * In micromark, the actual character U+000A LINE FEED (LF) and U+000D CARRIAGE\n * RETURN (CR) are replaced by these virtual characters depending on whether\n * they occurred together.\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function markdownLineEnding(code) {\n  return code !== null && code < -2;\n}\n\n/**\n * Check whether a character code is a markdown line ending (see\n * `markdownLineEnding`) or markdown space (see `markdownSpace`).\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function markdownLineEndingOrSpace(code) {\n  return code !== null && (code < 0 || code === 32);\n}\n\n/**\n * Check whether a character code is a markdown space.\n *\n * A **markdown space** is the concrete character U+0020 SPACE (SP) and the\n * virtual characters M-0001 VIRTUAL SPACE (VS) and M-0002 HORIZONTAL TAB (HT).\n *\n * In micromark, the actual character U+0009 CHARACTER TABULATION (HT) is\n * replaced by one M-0002 HORIZONTAL TAB (HT) and between 0 and 3 M-0001 VIRTUAL\n * SPACE (VS) characters, depending on the column at which the tab occurred.\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function markdownSpace(code) {\n  return code === -2 || code === -1 || code === 32;\n}\n\n// Size note: removing ASCII from the regex and using `asciiPunctuation` here\n// In fact adds to the bundle size.\n/**\n * Check whether the character code represents Unicode punctuation.\n *\n * A **Unicode punctuation** is a character in the Unicode `Pc` (Punctuation,\n * Connector), `Pd` (Punctuation, Dash), `Pe` (Punctuation, Close), `Pf`\n * (Punctuation, Final quote), `Pi` (Punctuation, Initial quote), `Po`\n * (Punctuation, Other), or `Ps` (Punctuation, Open) categories, or an ASCII\n * punctuation (see `asciiPunctuation`).\n *\n * See:\n * **\\[UNICODE]**:\n * [The Unicode Standard](https://www.unicode.org/versions/).\n * Unicode Consortium.\n *\n * @param code\n *   Code.\n * @returns\n *   Whether it matches.\n */\nexport const unicodePunctuation = regexCheck(/\\p{P}|\\p{S}/u);\n\n/**\n * Check whether the character code represents Unicode whitespace.\n *\n * Note that this does handle micromark specific markdown whitespace characters.\n * See `markdownLineEndingOrSpace` to check that.\n *\n * A **Unicode whitespace** is a character in the Unicode `Zs` (Separator,\n * Space) category, or U+0009 CHARACTER TABULATION (HT), U+000A LINE FEED (LF),\n * U+000C (FF), or U+000D CARRIAGE RETURN (CR) (**\\[UNICODE]**).\n *\n * See:\n * **\\[UNICODE]**:\n * [The Unicode Standard](https://www.unicode.org/versions/).\n * Unicode Consortium.\n *\n * @param code\n *   Code.\n * @returns\n *   Whether it matches.\n */\nexport const unicodeWhitespace = regexCheck(/\\s/);\n\n/**\n * Create a code check from a regex.\n *\n * @param {RegExp} regex\n * @returns {(code: Code) => boolean}\n */\nfunction regexCheck(regex) {\n  return check;\n\n  /**\n   * Check whether a code matches the bound regex.\n   *\n   * @param {Code} code\n   *   Character code.\n   * @returns {boolean}\n   *   Whether the character code matches the bound regex.\n   */\n  function check(code) {\n    return code !== null && code > -1 && regex.test(String.fromCharCode(code));\n  }\n}","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenType} TokenType\n */\n\nimport {markdownSpace} from 'micromark-util-character'\n\n// To do: implement `spaceOrTab`, `spaceOrTabMinMax`, `spaceOrTabWithOptions`.\n\n/**\n * Parse spaces and tabs.\n *\n * There is no `nok` parameter:\n *\n * *   spaces in markdown are often optional, in which case this factory can be\n *     used and `ok` will be switched to whether spaces were found or not\n * *   one line ending or space can be detected with `markdownSpace(code)` right\n *     before using `factorySpace`\n *\n * ###### Examples\n *\n * Where `␉` represents a tab (plus how much it expands) and `␠` represents a\n * single space.\n *\n * ```markdown\n * ␉\n * ␠␠␠␠\n * ␉␠\n * ```\n *\n * @param {Effects} effects\n *   Context.\n * @param {State} ok\n *   State switched to when successful.\n * @param {TokenType} type\n *   Type (`' \\t'`).\n * @param {number | undefined} [max=Infinity]\n *   Max (exclusive).\n * @returns {State}\n *   Start state.\n */\nexport function factorySpace(effects, ok, type, max) {\n  const limit = max ? max - 1 : Number.POSITIVE_INFINITY\n  let size = 0\n  return start\n\n  /** @type {State} */\n  function start(code) {\n    if (markdownSpace(code)) {\n      effects.enter(type)\n      return prefix(code)\n    }\n    return ok(code)\n  }\n\n  /** @type {State} */\n  function prefix(code) {\n    if (markdownSpace(code) && size++ < limit) {\n      effects.consume(code)\n      return prefix\n    }\n    effects.exit(type)\n    return ok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').Initializer} Initializer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n/** @type {InitialConstruct} */\nexport const content = {\n  tokenize: initializeContent\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Initializer}\n */\nfunction initializeContent(effects) {\n  const contentStart = effects.attempt(\n    this.parser.constructs.contentInitial,\n    afterContentStartConstruct,\n    paragraphInitial\n  )\n  /** @type {Token} */\n  let previous\n  return contentStart\n\n  /** @type {State} */\n  function afterContentStartConstruct(code) {\n    if (code === null) {\n      effects.consume(code)\n      return\n    }\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    return factorySpace(effects, contentStart, 'linePrefix')\n  }\n\n  /** @type {State} */\n  function paragraphInitial(code) {\n    effects.enter('paragraph')\n    return lineStart(code)\n  }\n\n  /** @type {State} */\n  function lineStart(code) {\n    const token = effects.enter('chunkText', {\n      contentType: 'text',\n      previous\n    })\n    if (previous) {\n      previous.next = token\n    }\n    previous = token\n    return data(code)\n  }\n\n  /** @type {State} */\n  function data(code) {\n    if (code === null) {\n      effects.exit('chunkText')\n      effects.exit('paragraph')\n      effects.consume(code)\n      return\n    }\n    if (markdownLineEnding(code)) {\n      effects.consume(code)\n      effects.exit('chunkText')\n      return lineStart\n    }\n\n    // Data.\n    effects.consume(code)\n    return data\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').ContainerState} ContainerState\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').Initializer} Initializer\n * @typedef {import('micromark-util-types').Point} Point\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\n/**\n * @typedef {[Construct, ContainerState]} StackItem\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\nimport {splice} from 'micromark-util-chunked'\n/** @type {InitialConstruct} */\nexport const document = {\n  tokenize: initializeDocument\n}\n\n/** @type {Construct} */\nconst containerConstruct = {\n  tokenize: tokenizeContainer\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Initializer}\n */\nfunction initializeDocument(effects) {\n  const self = this\n  /** @type {Array<StackItem>} */\n  const stack = []\n  let continued = 0\n  /** @type {TokenizeContext | undefined} */\n  let childFlow\n  /** @type {Token | undefined} */\n  let childToken\n  /** @type {number} */\n  let lineStartOffset\n  return start\n\n  /** @type {State} */\n  function start(code) {\n    // First we iterate through the open blocks, starting with the root\n    // document, and descending through last children down to the last open\n    // block.\n    // Each block imposes a condition that the line must satisfy if the block is\n    // to remain open.\n    // For example, a block quote requires a `>` character.\n    // A paragraph requires a non-blank line.\n    // In this phase we may match all or just some of the open blocks.\n    // But we cannot close unmatched blocks yet, because we may have a lazy\n    // continuation line.\n    if (continued < stack.length) {\n      const item = stack[continued]\n      self.containerState = item[1]\n      return effects.attempt(\n        item[0].continuation,\n        documentContinue,\n        checkNewContainers\n      )(code)\n    }\n\n    // Done.\n    return checkNewContainers(code)\n  }\n\n  /** @type {State} */\n  function documentContinue(code) {\n    continued++\n\n    // Note: this field is called `_closeFlow` but it also closes containers.\n    // Perhaps a good idea to rename it but it’s already used in the wild by\n    // extensions.\n    if (self.containerState._closeFlow) {\n      self.containerState._closeFlow = undefined\n      if (childFlow) {\n        closeFlow()\n      }\n\n      // Note: this algorithm for moving events around is similar to the\n      // algorithm when dealing with lazy lines in `writeToChild`.\n      const indexBeforeExits = self.events.length\n      let indexBeforeFlow = indexBeforeExits\n      /** @type {Point | undefined} */\n      let point\n\n      // Find the flow chunk.\n      while (indexBeforeFlow--) {\n        if (\n          self.events[indexBeforeFlow][0] === 'exit' &&\n          self.events[indexBeforeFlow][1].type === 'chunkFlow'\n        ) {\n          point = self.events[indexBeforeFlow][1].end\n          break\n        }\n      }\n      exitContainers(continued)\n\n      // Fix positions.\n      let index = indexBeforeExits\n      while (index < self.events.length) {\n        self.events[index][1].end = Object.assign({}, point)\n        index++\n      }\n\n      // Inject the exits earlier (they’re still also at the end).\n      splice(\n        self.events,\n        indexBeforeFlow + 1,\n        0,\n        self.events.slice(indexBeforeExits)\n      )\n\n      // Discard the duplicate exits.\n      self.events.length = index\n      return checkNewContainers(code)\n    }\n    return start(code)\n  }\n\n  /** @type {State} */\n  function checkNewContainers(code) {\n    // Next, after consuming the continuation markers for existing blocks, we\n    // look for new block starts (e.g. `>` for a block quote).\n    // If we encounter a new block start, we close any blocks unmatched in\n    // step 1 before creating the new block as a child of the last matched\n    // block.\n    if (continued === stack.length) {\n      // No need to `check` whether there’s a container, of `exitContainers`\n      // would be moot.\n      // We can instead immediately `attempt` to parse one.\n      if (!childFlow) {\n        return documentContinued(code)\n      }\n\n      // If we have concrete content, such as block HTML or fenced code,\n      // we can’t have containers “pierce” into them, so we can immediately\n      // start.\n      if (childFlow.currentConstruct && childFlow.currentConstruct.concrete) {\n        return flowStart(code)\n      }\n\n      // If we do have flow, it could still be a blank line,\n      // but we’d be interrupting it w/ a new container if there’s a current\n      // construct.\n      // To do: next major: remove `_gfmTableDynamicInterruptHack` (no longer\n      // needed in micromark-extension-gfm-table@1.0.6).\n      self.interrupt = Boolean(\n        childFlow.currentConstruct && !childFlow._gfmTableDynamicInterruptHack\n      )\n    }\n\n    // Check if there is a new container.\n    self.containerState = {}\n    return effects.check(\n      containerConstruct,\n      thereIsANewContainer,\n      thereIsNoNewContainer\n    )(code)\n  }\n\n  /** @type {State} */\n  function thereIsANewContainer(code) {\n    if (childFlow) closeFlow()\n    exitContainers(continued)\n    return documentContinued(code)\n  }\n\n  /** @type {State} */\n  function thereIsNoNewContainer(code) {\n    self.parser.lazy[self.now().line] = continued !== stack.length\n    lineStartOffset = self.now().offset\n    return flowStart(code)\n  }\n\n  /** @type {State} */\n  function documentContinued(code) {\n    // Try new containers.\n    self.containerState = {}\n    return effects.attempt(\n      containerConstruct,\n      containerContinue,\n      flowStart\n    )(code)\n  }\n\n  /** @type {State} */\n  function containerContinue(code) {\n    continued++\n    stack.push([self.currentConstruct, self.containerState])\n    // Try another.\n    return documentContinued(code)\n  }\n\n  /** @type {State} */\n  function flowStart(code) {\n    if (code === null) {\n      if (childFlow) closeFlow()\n      exitContainers(0)\n      effects.consume(code)\n      return\n    }\n    childFlow = childFlow || self.parser.flow(self.now())\n    effects.enter('chunkFlow', {\n      contentType: 'flow',\n      previous: childToken,\n      _tokenizer: childFlow\n    })\n    return flowContinue(code)\n  }\n\n  /** @type {State} */\n  function flowContinue(code) {\n    if (code === null) {\n      writeToChild(effects.exit('chunkFlow'), true)\n      exitContainers(0)\n      effects.consume(code)\n      return\n    }\n    if (markdownLineEnding(code)) {\n      effects.consume(code)\n      writeToChild(effects.exit('chunkFlow'))\n      // Get ready for the next line.\n      continued = 0\n      self.interrupt = undefined\n      return start\n    }\n    effects.consume(code)\n    return flowContinue\n  }\n\n  /**\n   * @param {Token} token\n   * @param {boolean | undefined} [eof]\n   * @returns {undefined}\n   */\n  function writeToChild(token, eof) {\n    const stream = self.sliceStream(token)\n    if (eof) stream.push(null)\n    token.previous = childToken\n    if (childToken) childToken.next = token\n    childToken = token\n    childFlow.defineSkip(token.start)\n    childFlow.write(stream)\n\n    // Alright, so we just added a lazy line:\n    //\n    // ```markdown\n    // > a\n    // b.\n    //\n    // Or:\n    //\n    // > ~~~c\n    // d\n    //\n    // Or:\n    //\n    // > | e |\n    // f\n    // ```\n    //\n    // The construct in the second example (fenced code) does not accept lazy\n    // lines, so it marked itself as done at the end of its first line, and\n    // then the content construct parses `d`.\n    // Most constructs in markdown match on the first line: if the first line\n    // forms a construct, a non-lazy line can’t “unmake” it.\n    //\n    // The construct in the third example is potentially a GFM table, and\n    // those are *weird*.\n    // It *could* be a table, from the first line, if the following line\n    // matches a condition.\n    // In this case, that second line is lazy, which “unmakes” the first line\n    // and turns the whole into one content block.\n    //\n    // We’ve now parsed the non-lazy and the lazy line, and can figure out\n    // whether the lazy line started a new flow block.\n    // If it did, we exit the current containers between the two flow blocks.\n    if (self.parser.lazy[token.start.line]) {\n      let index = childFlow.events.length\n      while (index--) {\n        if (\n          // The token starts before the line ending…\n          childFlow.events[index][1].start.offset < lineStartOffset &&\n          // …and either is not ended yet…\n          (!childFlow.events[index][1].end ||\n            // …or ends after it.\n            childFlow.events[index][1].end.offset > lineStartOffset)\n        ) {\n          // Exit: there’s still something open, which means it’s a lazy line\n          // part of something.\n          return\n        }\n      }\n\n      // Note: this algorithm for moving events around is similar to the\n      // algorithm when closing flow in `documentContinue`.\n      const indexBeforeExits = self.events.length\n      let indexBeforeFlow = indexBeforeExits\n      /** @type {boolean | undefined} */\n      let seen\n      /** @type {Point | undefined} */\n      let point\n\n      // Find the previous chunk (the one before the lazy line).\n      while (indexBeforeFlow--) {\n        if (\n          self.events[indexBeforeFlow][0] === 'exit' &&\n          self.events[indexBeforeFlow][1].type === 'chunkFlow'\n        ) {\n          if (seen) {\n            point = self.events[indexBeforeFlow][1].end\n            break\n          }\n          seen = true\n        }\n      }\n      exitContainers(continued)\n\n      // Fix positions.\n      index = indexBeforeExits\n      while (index < self.events.length) {\n        self.events[index][1].end = Object.assign({}, point)\n        index++\n      }\n\n      // Inject the exits earlier (they’re still also at the end).\n      splice(\n        self.events,\n        indexBeforeFlow + 1,\n        0,\n        self.events.slice(indexBeforeExits)\n      )\n\n      // Discard the duplicate exits.\n      self.events.length = index\n    }\n  }\n\n  /**\n   * @param {number} size\n   * @returns {undefined}\n   */\n  function exitContainers(size) {\n    let index = stack.length\n\n    // Exit open containers.\n    while (index-- > size) {\n      const entry = stack[index]\n      self.containerState = entry[1]\n      entry[0].exit.call(self, effects)\n    }\n    stack.length = size\n  }\n  function closeFlow() {\n    childFlow.write([null])\n    childToken = undefined\n    childFlow = undefined\n    self.containerState._closeFlow = undefined\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeContainer(effects, ok, nok) {\n  // Always populated by defaults.\n\n  return factorySpace(\n    effects,\n    effects.attempt(this.parser.constructs.document, ok, nok),\n    'linePrefix',\n    this.parser.constructs.disable.null.includes('codeIndented') ? undefined : 4\n  )\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n/** @type {Construct} */\nexport const blankLine = {\n  tokenize: tokenizeBlankLine,\n  partial: true\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeBlankLine(effects, ok, nok) {\n  return start\n\n  /**\n   * Start of blank line.\n   *\n   * > 👉 **Note**: `␠` represents a space character.\n   *\n   * ```markdown\n   * > | ␠␠␊\n   *     ^\n   * > | ␊\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    return markdownSpace(code)\n      ? factorySpace(effects, after, 'linePrefix')(code)\n      : after(code)\n  }\n\n  /**\n   * At eof/eol, after optional whitespace.\n   *\n   * > 👉 **Note**: `␠` represents a space character.\n   *\n   * ```markdown\n   * > | ␠␠␊\n   *       ^\n   * > | ␊\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function after(code) {\n    return code === null || markdownLineEnding(code) ? ok(code) : nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\nimport {subtokenize} from 'micromark-util-subtokenize'\n/**\n * No name because it must not be turned off.\n * @type {Construct}\n */\nexport const content = {\n  tokenize: tokenizeContent,\n  resolve: resolveContent\n}\n\n/** @type {Construct} */\nconst continuationConstruct = {\n  tokenize: tokenizeContinuation,\n  partial: true\n}\n\n/**\n * Content is transparent: it’s parsed right now. That way, definitions are also\n * parsed right now: before text in paragraphs (specifically, media) are parsed.\n *\n * @type {Resolver}\n */\nfunction resolveContent(events) {\n  subtokenize(events)\n  return events\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeContent(effects, ok) {\n  /** @type {Token | undefined} */\n  let previous\n  return chunkStart\n\n  /**\n   * Before a content chunk.\n   *\n   * ```markdown\n   * > | abc\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function chunkStart(code) {\n    effects.enter('content')\n    previous = effects.enter('chunkContent', {\n      contentType: 'content'\n    })\n    return chunkInside(code)\n  }\n\n  /**\n   * In a content chunk.\n   *\n   * ```markdown\n   * > | abc\n   *     ^^^\n   * ```\n   *\n   * @type {State}\n   */\n  function chunkInside(code) {\n    if (code === null) {\n      return contentEnd(code)\n    }\n\n    // To do: in `markdown-rs`, each line is parsed on its own, and everything\n    // is stitched together resolving.\n    if (markdownLineEnding(code)) {\n      return effects.check(\n        continuationConstruct,\n        contentContinue,\n        contentEnd\n      )(code)\n    }\n\n    // Data.\n    effects.consume(code)\n    return chunkInside\n  }\n\n  /**\n   *\n   *\n   * @type {State}\n   */\n  function contentEnd(code) {\n    effects.exit('chunkContent')\n    effects.exit('content')\n    return ok(code)\n  }\n\n  /**\n   *\n   *\n   * @type {State}\n   */\n  function contentContinue(code) {\n    effects.consume(code)\n    effects.exit('chunkContent')\n    previous.next = effects.enter('chunkContent', {\n      contentType: 'content',\n      previous\n    })\n    previous = previous.next\n    return chunkInside\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeContinuation(effects, ok, nok) {\n  const self = this\n  return startLookahead\n\n  /**\n   *\n   *\n   * @type {State}\n   */\n  function startLookahead(code) {\n    effects.exit('chunkContent')\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    return factorySpace(effects, prefixed, 'linePrefix')\n  }\n\n  /**\n   *\n   *\n   * @type {State}\n   */\n  function prefixed(code) {\n    if (code === null || markdownLineEnding(code)) {\n      return nok(code)\n    }\n\n    // Always populated by defaults.\n\n    const tail = self.events[self.events.length - 1]\n    if (\n      !self.parser.constructs.disable.null.includes('codeIndented') &&\n      tail &&\n      tail[1].type === 'linePrefix' &&\n      tail[2].sliceSerialize(tail[1], true).length >= 4\n    ) {\n      return ok(code)\n    }\n    return effects.interrupt(self.parser.constructs.flow, nok, ok)(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').Initializer} Initializer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n */\n\nimport {blankLine, content} from 'micromark-core-commonmark'\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n/** @type {InitialConstruct} */\nexport const flow = {\n  tokenize: initializeFlow\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Initializer}\n */\nfunction initializeFlow(effects) {\n  const self = this\n  const initial = effects.attempt(\n    // Try to parse a blank line.\n    blankLine,\n    atBlankEnding,\n    // Try to parse initial flow (essentially, only code).\n    effects.attempt(\n      this.parser.constructs.flowInitial,\n      afterConstruct,\n      factorySpace(\n        effects,\n        effects.attempt(\n          this.parser.constructs.flow,\n          afterConstruct,\n          effects.attempt(content, afterConstruct)\n        ),\n        'linePrefix'\n      )\n    )\n  )\n  return initial\n\n  /** @type {State} */\n  function atBlankEnding(code) {\n    if (code === null) {\n      effects.consume(code)\n      return\n    }\n    effects.enter('lineEndingBlank')\n    effects.consume(code)\n    effects.exit('lineEndingBlank')\n    self.currentConstruct = undefined\n    return initial\n  }\n\n  /** @type {State} */\n  function afterConstruct(code) {\n    if (code === null) {\n      effects.consume(code)\n      return\n    }\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    self.currentConstruct = undefined\n    return initial\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').Initializer} Initializer\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n */\n\nexport const resolver = {\n  resolveAll: createResolver()\n}\nexport const string = initializeFactory('string')\nexport const text = initializeFactory('text')\n\n/**\n * @param {'string' | 'text'} field\n * @returns {InitialConstruct}\n */\nfunction initializeFactory(field) {\n  return {\n    tokenize: initializeText,\n    resolveAll: createResolver(\n      field === 'text' ? resolveAllLineSuffixes : undefined\n    )\n  }\n\n  /**\n   * @this {TokenizeContext}\n   * @type {Initializer}\n   */\n  function initializeText(effects) {\n    const self = this\n    const constructs = this.parser.constructs[field]\n    const text = effects.attempt(constructs, start, notText)\n    return start\n\n    /** @type {State} */\n    function start(code) {\n      return atBreak(code) ? text(code) : notText(code)\n    }\n\n    /** @type {State} */\n    function notText(code) {\n      if (code === null) {\n        effects.consume(code)\n        return\n      }\n      effects.enter('data')\n      effects.consume(code)\n      return data\n    }\n\n    /** @type {State} */\n    function data(code) {\n      if (atBreak(code)) {\n        effects.exit('data')\n        return text(code)\n      }\n\n      // Data.\n      effects.consume(code)\n      return data\n    }\n\n    /**\n     * @param {Code} code\n     * @returns {boolean}\n     */\n    function atBreak(code) {\n      if (code === null) {\n        return true\n      }\n      const list = constructs[code]\n      let index = -1\n      if (list) {\n        // Always populated by defaults.\n\n        while (++index < list.length) {\n          const item = list[index]\n          if (!item.previous || item.previous.call(self, self.previous)) {\n            return true\n          }\n        }\n      }\n      return false\n    }\n  }\n}\n\n/**\n * @param {Resolver | undefined} [extraResolver]\n * @returns {Resolver}\n */\nfunction createResolver(extraResolver) {\n  return resolveAllText\n\n  /** @type {Resolver} */\n  function resolveAllText(events, context) {\n    let index = -1\n    /** @type {number | undefined} */\n    let enter\n\n    // A rather boring computation (to merge adjacent `data` events) which\n    // improves mm performance by 29%.\n    while (++index <= events.length) {\n      if (enter === undefined) {\n        if (events[index] && events[index][1].type === 'data') {\n          enter = index\n          index++\n        }\n      } else if (!events[index] || events[index][1].type !== 'data') {\n        // Don’t do anything if there is one data token.\n        if (index !== enter + 2) {\n          events[enter][1].end = events[index - 1][1].end\n          events.splice(enter + 2, index - enter - 2)\n          index = enter + 2\n        }\n        enter = undefined\n      }\n    }\n    return extraResolver ? extraResolver(events, context) : events\n  }\n}\n\n/**\n * A rather ugly set of instructions which again looks at chunks in the input\n * stream.\n * The reason to do this here is that it is *much* faster to parse in reverse.\n * And that we can’t hook into `null` to split the line suffix before an EOF.\n * To do: figure out if we can make this into a clean utility, or even in core.\n * As it will be useful for GFMs literal autolink extension (and maybe even\n * tables?)\n *\n * @type {Resolver}\n */\nfunction resolveAllLineSuffixes(events, context) {\n  let eventIndex = 0 // Skip first.\n\n  while (++eventIndex <= events.length) {\n    if (\n      (eventIndex === events.length ||\n        events[eventIndex][1].type === 'lineEnding') &&\n      events[eventIndex - 1][1].type === 'data'\n    ) {\n      const data = events[eventIndex - 1][1]\n      const chunks = context.sliceStream(data)\n      let index = chunks.length\n      let bufferIndex = -1\n      let size = 0\n      /** @type {boolean | undefined} */\n      let tabs\n      while (index--) {\n        const chunk = chunks[index]\n        if (typeof chunk === 'string') {\n          bufferIndex = chunk.length\n          while (chunk.charCodeAt(bufferIndex - 1) === 32) {\n            size++\n            bufferIndex--\n          }\n          if (bufferIndex) break\n          bufferIndex = -1\n        }\n        // Number\n        else if (chunk === -2) {\n          tabs = true\n          size++\n        } else if (chunk === -1) {\n          // Empty\n        } else {\n          // Replacement character, exit.\n          index++\n          break\n        }\n      }\n      if (size) {\n        const token = {\n          type:\n            eventIndex === events.length || tabs || size < 2\n              ? 'lineSuffix'\n              : 'hardBreakTrailing',\n          start: {\n            line: data.end.line,\n            column: data.end.column - size,\n            offset: data.end.offset - size,\n            _index: data.start._index + index,\n            _bufferIndex: index\n              ? bufferIndex\n              : data.start._bufferIndex + bufferIndex\n          },\n          end: Object.assign({}, data.end)\n        }\n        data.end = Object.assign({}, token.start)\n        if (data.start.offset === data.end.offset) {\n          Object.assign(data, token)\n        } else {\n          events.splice(\n            eventIndex,\n            0,\n            ['enter', token, context],\n            ['exit', token, context]\n          )\n          eventIndex += 2\n        }\n      }\n      eventIndex++\n    }\n  }\n  return events\n}\n","/**\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n */\n\n/**\n * Call all `resolveAll`s.\n *\n * @param {Array<{resolveAll?: Resolver | undefined}>} constructs\n *   List of constructs, optionally with `resolveAll`s.\n * @param {Array<Event>} events\n *   List of events.\n * @param {TokenizeContext} context\n *   Context used by `tokenize`.\n * @returns {Array<Event>}\n *   Changed events.\n */\nexport function resolveAll(constructs, events, context) {\n  /** @type {Array<Resolver>} */\n  const called = []\n  let index = -1\n\n  while (++index < constructs.length) {\n    const resolve = constructs[index].resolveAll\n\n    if (resolve && !called.includes(resolve)) {\n      events = resolve(events, context)\n      called.push(resolve)\n    }\n  }\n\n  return events\n}\n","/**\n * @typedef {import('micromark-util-types').Chunk} Chunk\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').ConstructRecord} ConstructRecord\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').ParseContext} ParseContext\n * @typedef {import('micromark-util-types').Point} Point\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').TokenType} TokenType\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n */\n\n/**\n * @callback Restore\n * @returns {undefined}\n *\n * @typedef Info\n * @property {Restore} restore\n * @property {number} from\n *\n * @callback ReturnHandle\n *   Handle a successful run.\n * @param {Construct} construct\n * @param {Info} info\n * @returns {undefined}\n */\n\nimport {markdownLineEnding} from 'micromark-util-character'\nimport {push, splice} from 'micromark-util-chunked'\nimport {resolveAll} from 'micromark-util-resolve-all'\n/**\n * Create a tokenizer.\n * Tokenizers deal with one type of data (e.g., containers, flow, text).\n * The parser is the object dealing with it all.\n * `initialize` works like other constructs, except that only its `tokenize`\n * function is used, in which case it doesn’t receive an `ok` or `nok`.\n * `from` can be given to set the point before the first character, although\n * when further lines are indented, they must be set with `defineSkip`.\n *\n * @param {ParseContext} parser\n * @param {InitialConstruct} initialize\n * @param {Omit<Point, '_bufferIndex' | '_index'> | undefined} [from]\n * @returns {TokenizeContext}\n */\nexport function createTokenizer(parser, initialize, from) {\n  /** @type {Point} */\n  let point = Object.assign(\n    from\n      ? Object.assign({}, from)\n      : {\n          line: 1,\n          column: 1,\n          offset: 0\n        },\n    {\n      _index: 0,\n      _bufferIndex: -1\n    }\n  )\n  /** @type {Record<string, number>} */\n  const columnStart = {}\n  /** @type {Array<Construct>} */\n  const resolveAllConstructs = []\n  /** @type {Array<Chunk>} */\n  let chunks = []\n  /** @type {Array<Token>} */\n  let stack = []\n  /** @type {boolean | undefined} */\n  let consumed = true\n\n  /**\n   * Tools used for tokenizing.\n   *\n   * @type {Effects}\n   */\n  const effects = {\n    consume,\n    enter,\n    exit,\n    attempt: constructFactory(onsuccessfulconstruct),\n    check: constructFactory(onsuccessfulcheck),\n    interrupt: constructFactory(onsuccessfulcheck, {\n      interrupt: true\n    })\n  }\n\n  /**\n   * State and tools for resolving and serializing.\n   *\n   * @type {TokenizeContext}\n   */\n  const context = {\n    previous: null,\n    code: null,\n    containerState: {},\n    events: [],\n    parser,\n    sliceStream,\n    sliceSerialize,\n    now,\n    defineSkip,\n    write\n  }\n\n  /**\n   * The state function.\n   *\n   * @type {State | undefined}\n   */\n  let state = initialize.tokenize.call(context, effects)\n\n  /**\n   * Track which character we expect to be consumed, to catch bugs.\n   *\n   * @type {Code}\n   */\n  let expectedCode\n  if (initialize.resolveAll) {\n    resolveAllConstructs.push(initialize)\n  }\n  return context\n\n  /** @type {TokenizeContext['write']} */\n  function write(slice) {\n    chunks = push(chunks, slice)\n    main()\n\n    // Exit if we’re not done, resolve might change stuff.\n    if (chunks[chunks.length - 1] !== null) {\n      return []\n    }\n    addResult(initialize, 0)\n\n    // Otherwise, resolve, and exit.\n    context.events = resolveAll(resolveAllConstructs, context.events, context)\n    return context.events\n  }\n\n  //\n  // Tools.\n  //\n\n  /** @type {TokenizeContext['sliceSerialize']} */\n  function sliceSerialize(token, expandTabs) {\n    return serializeChunks(sliceStream(token), expandTabs)\n  }\n\n  /** @type {TokenizeContext['sliceStream']} */\n  function sliceStream(token) {\n    return sliceChunks(chunks, token)\n  }\n\n  /** @type {TokenizeContext['now']} */\n  function now() {\n    // This is a hot path, so we clone manually instead of `Object.assign({}, point)`\n    const {line, column, offset, _index, _bufferIndex} = point\n    return {\n      line,\n      column,\n      offset,\n      _index,\n      _bufferIndex\n    }\n  }\n\n  /** @type {TokenizeContext['defineSkip']} */\n  function defineSkip(value) {\n    columnStart[value.line] = value.column\n    accountForPotentialSkip()\n  }\n\n  //\n  // State management.\n  //\n\n  /**\n   * Main loop (note that `_index` and `_bufferIndex` in `point` are modified by\n   * `consume`).\n   * Here is where we walk through the chunks, which either include strings of\n   * several characters, or numerical character codes.\n   * The reason to do this in a loop instead of a call is so the stack can\n   * drain.\n   *\n   * @returns {undefined}\n   */\n  function main() {\n    /** @type {number} */\n    let chunkIndex\n    while (point._index < chunks.length) {\n      const chunk = chunks[point._index]\n\n      // If we’re in a buffer chunk, loop through it.\n      if (typeof chunk === 'string') {\n        chunkIndex = point._index\n        if (point._bufferIndex < 0) {\n          point._bufferIndex = 0\n        }\n        while (\n          point._index === chunkIndex &&\n          point._bufferIndex < chunk.length\n        ) {\n          go(chunk.charCodeAt(point._bufferIndex))\n        }\n      } else {\n        go(chunk)\n      }\n    }\n  }\n\n  /**\n   * Deal with one code.\n   *\n   * @param {Code} code\n   * @returns {undefined}\n   */\n  function go(code) {\n    consumed = undefined\n    expectedCode = code\n    state = state(code)\n  }\n\n  /** @type {Effects['consume']} */\n  function consume(code) {\n    if (markdownLineEnding(code)) {\n      point.line++\n      point.column = 1\n      point.offset += code === -3 ? 2 : 1\n      accountForPotentialSkip()\n    } else if (code !== -1) {\n      point.column++\n      point.offset++\n    }\n\n    // Not in a string chunk.\n    if (point._bufferIndex < 0) {\n      point._index++\n    } else {\n      point._bufferIndex++\n\n      // At end of string chunk.\n      // @ts-expect-error Points w/ non-negative `_bufferIndex` reference\n      // strings.\n      if (point._bufferIndex === chunks[point._index].length) {\n        point._bufferIndex = -1\n        point._index++\n      }\n    }\n\n    // Expose the previous character.\n    context.previous = code\n\n    // Mark as consumed.\n    consumed = true\n  }\n\n  /** @type {Effects['enter']} */\n  function enter(type, fields) {\n    /** @type {Token} */\n    // @ts-expect-error Patch instead of assign required fields to help GC.\n    const token = fields || {}\n    token.type = type\n    token.start = now()\n    context.events.push(['enter', token, context])\n    stack.push(token)\n    return token\n  }\n\n  /** @type {Effects['exit']} */\n  function exit(type) {\n    const token = stack.pop()\n    token.end = now()\n    context.events.push(['exit', token, context])\n    return token\n  }\n\n  /**\n   * Use results.\n   *\n   * @type {ReturnHandle}\n   */\n  function onsuccessfulconstruct(construct, info) {\n    addResult(construct, info.from)\n  }\n\n  /**\n   * Discard results.\n   *\n   * @type {ReturnHandle}\n   */\n  function onsuccessfulcheck(_, info) {\n    info.restore()\n  }\n\n  /**\n   * Factory to attempt/check/interrupt.\n   *\n   * @param {ReturnHandle} onreturn\n   * @param {{interrupt?: boolean | undefined} | undefined} [fields]\n   */\n  function constructFactory(onreturn, fields) {\n    return hook\n\n    /**\n     * Handle either an object mapping codes to constructs, a list of\n     * constructs, or a single construct.\n     *\n     * @param {Array<Construct> | Construct | ConstructRecord} constructs\n     * @param {State} returnState\n     * @param {State | undefined} [bogusState]\n     * @returns {State}\n     */\n    function hook(constructs, returnState, bogusState) {\n      /** @type {Array<Construct>} */\n      let listOfConstructs\n      /** @type {number} */\n      let constructIndex\n      /** @type {Construct} */\n      let currentConstruct\n      /** @type {Info} */\n      let info\n      return Array.isArray(constructs) /* c8 ignore next 1 */\n        ? handleListOfConstructs(constructs)\n        : 'tokenize' in constructs\n        ? // @ts-expect-error Looks like a construct.\n          handleListOfConstructs([constructs])\n        : handleMapOfConstructs(constructs)\n\n      /**\n       * Handle a list of construct.\n       *\n       * @param {ConstructRecord} map\n       * @returns {State}\n       */\n      function handleMapOfConstructs(map) {\n        return start\n\n        /** @type {State} */\n        function start(code) {\n          const def = code !== null && map[code]\n          const all = code !== null && map.null\n          const list = [\n            // To do: add more extension tests.\n            /* c8 ignore next 2 */\n            ...(Array.isArray(def) ? def : def ? [def] : []),\n            ...(Array.isArray(all) ? all : all ? [all] : [])\n          ]\n          return handleListOfConstructs(list)(code)\n        }\n      }\n\n      /**\n       * Handle a list of construct.\n       *\n       * @param {Array<Construct>} list\n       * @returns {State}\n       */\n      function handleListOfConstructs(list) {\n        listOfConstructs = list\n        constructIndex = 0\n        if (list.length === 0) {\n          return bogusState\n        }\n        return handleConstruct(list[constructIndex])\n      }\n\n      /**\n       * Handle a single construct.\n       *\n       * @param {Construct} construct\n       * @returns {State}\n       */\n      function handleConstruct(construct) {\n        return start\n\n        /** @type {State} */\n        function start(code) {\n          // To do: not needed to store if there is no bogus state, probably?\n          // Currently doesn’t work because `inspect` in document does a check\n          // w/o a bogus, which doesn’t make sense. But it does seem to help perf\n          // by not storing.\n          info = store()\n          currentConstruct = construct\n          if (!construct.partial) {\n            context.currentConstruct = construct\n          }\n\n          // Always populated by defaults.\n\n          if (\n            construct.name &&\n            context.parser.constructs.disable.null.includes(construct.name)\n          ) {\n            return nok(code)\n          }\n          return construct.tokenize.call(\n            // If we do have fields, create an object w/ `context` as its\n            // prototype.\n            // This allows a “live binding”, which is needed for `interrupt`.\n            fields ? Object.assign(Object.create(context), fields) : context,\n            effects,\n            ok,\n            nok\n          )(code)\n        }\n      }\n\n      /** @type {State} */\n      function ok(code) {\n        consumed = true\n        onreturn(currentConstruct, info)\n        return returnState\n      }\n\n      /** @type {State} */\n      function nok(code) {\n        consumed = true\n        info.restore()\n        if (++constructIndex < listOfConstructs.length) {\n          return handleConstruct(listOfConstructs[constructIndex])\n        }\n        return bogusState\n      }\n    }\n  }\n\n  /**\n   * @param {Construct} construct\n   * @param {number} from\n   * @returns {undefined}\n   */\n  function addResult(construct, from) {\n    if (construct.resolveAll && !resolveAllConstructs.includes(construct)) {\n      resolveAllConstructs.push(construct)\n    }\n    if (construct.resolve) {\n      splice(\n        context.events,\n        from,\n        context.events.length - from,\n        construct.resolve(context.events.slice(from), context)\n      )\n    }\n    if (construct.resolveTo) {\n      context.events = construct.resolveTo(context.events, context)\n    }\n  }\n\n  /**\n   * Store state.\n   *\n   * @returns {Info}\n   */\n  function store() {\n    const startPoint = now()\n    const startPrevious = context.previous\n    const startCurrentConstruct = context.currentConstruct\n    const startEventsIndex = context.events.length\n    const startStack = Array.from(stack)\n    return {\n      restore,\n      from: startEventsIndex\n    }\n\n    /**\n     * Restore state.\n     *\n     * @returns {undefined}\n     */\n    function restore() {\n      point = startPoint\n      context.previous = startPrevious\n      context.currentConstruct = startCurrentConstruct\n      context.events.length = startEventsIndex\n      stack = startStack\n      accountForPotentialSkip()\n    }\n  }\n\n  /**\n   * Move the current point a bit forward in the line when it’s on a column\n   * skip.\n   *\n   * @returns {undefined}\n   */\n  function accountForPotentialSkip() {\n    if (point.line in columnStart && point.column < 2) {\n      point.column = columnStart[point.line]\n      point.offset += columnStart[point.line] - 1\n    }\n  }\n}\n\n/**\n * Get the chunks from a slice of chunks in the range of a token.\n *\n * @param {Array<Chunk>} chunks\n * @param {Pick<Token, 'end' | 'start'>} token\n * @returns {Array<Chunk>}\n */\nfunction sliceChunks(chunks, token) {\n  const startIndex = token.start._index\n  const startBufferIndex = token.start._bufferIndex\n  const endIndex = token.end._index\n  const endBufferIndex = token.end._bufferIndex\n  /** @type {Array<Chunk>} */\n  let view\n  if (startIndex === endIndex) {\n    // @ts-expect-error `_bufferIndex` is used on string chunks.\n    view = [chunks[startIndex].slice(startBufferIndex, endBufferIndex)]\n  } else {\n    view = chunks.slice(startIndex, endIndex)\n    if (startBufferIndex > -1) {\n      const head = view[0]\n      if (typeof head === 'string') {\n        view[0] = head.slice(startBufferIndex)\n      } else {\n        view.shift()\n      }\n    }\n    if (endBufferIndex > 0) {\n      // @ts-expect-error `_bufferIndex` is used on string chunks.\n      view.push(chunks[endIndex].slice(0, endBufferIndex))\n    }\n  }\n  return view\n}\n\n/**\n * Get the string value of a slice of chunks.\n *\n * @param {Array<Chunk>} chunks\n * @param {boolean | undefined} [expandTabs=false]\n * @returns {string}\n */\nfunction serializeChunks(chunks, expandTabs) {\n  let index = -1\n  /** @type {Array<string>} */\n  const result = []\n  /** @type {boolean | undefined} */\n  let atTab\n  while (++index < chunks.length) {\n    const chunk = chunks[index]\n    /** @type {string} */\n    let value\n    if (typeof chunk === 'string') {\n      value = chunk\n    } else\n      switch (chunk) {\n        case -5: {\n          value = '\\r'\n          break\n        }\n        case -4: {\n          value = '\\n'\n          break\n        }\n        case -3: {\n          value = '\\r' + '\\n'\n          break\n        }\n        case -2: {\n          value = expandTabs ? ' ' : '\\t'\n          break\n        }\n        case -1: {\n          if (!expandTabs && atTab) continue\n          value = ' '\n          break\n        }\n        default: {\n          // Currently only replacement character.\n          value = String.fromCharCode(chunk)\n        }\n      }\n    atTab = chunk === -2\n    result.push(value)\n  }\n  return result.join('')\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n/** @type {Construct} */\nexport const thematicBreak = {\n  name: 'thematicBreak',\n  tokenize: tokenizeThematicBreak\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeThematicBreak(effects, ok, nok) {\n  let size = 0\n  /** @type {NonNullable<Code>} */\n  let marker\n  return start\n\n  /**\n   * Start of thematic break.\n   *\n   * ```markdown\n   * > | ***\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('thematicBreak')\n    // To do: parse indent like `markdown-rs`.\n    return before(code)\n  }\n\n  /**\n   * After optional whitespace, at marker.\n   *\n   * ```markdown\n   * > | ***\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function before(code) {\n    marker = code\n    return atBreak(code)\n  }\n\n  /**\n   * After something, before something else.\n   *\n   * ```markdown\n   * > | ***\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function atBreak(code) {\n    if (code === marker) {\n      effects.enter('thematicBreakSequence')\n      return sequence(code)\n    }\n    if (size >= 3 && (code === null || markdownLineEnding(code))) {\n      effects.exit('thematicBreak')\n      return ok(code)\n    }\n    return nok(code)\n  }\n\n  /**\n   * In sequence.\n   *\n   * ```markdown\n   * > | ***\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function sequence(code) {\n    if (code === marker) {\n      effects.consume(code)\n      size++\n      return sequence\n    }\n    effects.exit('thematicBreakSequence')\n    return markdownSpace(code)\n      ? factorySpace(effects, atBreak, 'whitespace')(code)\n      : atBreak(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').ContainerState} ContainerState\n * @typedef {import('micromark-util-types').Exiter} Exiter\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {asciiDigit, markdownSpace} from 'micromark-util-character'\nimport {blankLine} from './blank-line.js'\nimport {thematicBreak} from './thematic-break.js'\n\n/** @type {Construct} */\nexport const list = {\n  name: 'list',\n  tokenize: tokenizeListStart,\n  continuation: {\n    tokenize: tokenizeListContinuation\n  },\n  exit: tokenizeListEnd\n}\n\n/** @type {Construct} */\nconst listItemPrefixWhitespaceConstruct = {\n  tokenize: tokenizeListItemPrefixWhitespace,\n  partial: true\n}\n\n/** @type {Construct} */\nconst indentConstruct = {\n  tokenize: tokenizeIndent,\n  partial: true\n}\n\n// To do: `markdown-rs` parses list items on their own and later stitches them\n// together.\n\n/**\n * @type {Tokenizer}\n * @this {TokenizeContext}\n */\nfunction tokenizeListStart(effects, ok, nok) {\n  const self = this\n  const tail = self.events[self.events.length - 1]\n  let initialSize =\n    tail && tail[1].type === 'linePrefix'\n      ? tail[2].sliceSerialize(tail[1], true).length\n      : 0\n  let size = 0\n  return start\n\n  /** @type {State} */\n  function start(code) {\n    const kind =\n      self.containerState.type ||\n      (code === 42 || code === 43 || code === 45\n        ? 'listUnordered'\n        : 'listOrdered')\n    if (\n      kind === 'listUnordered'\n        ? !self.containerState.marker || code === self.containerState.marker\n        : asciiDigit(code)\n    ) {\n      if (!self.containerState.type) {\n        self.containerState.type = kind\n        effects.enter(kind, {\n          _container: true\n        })\n      }\n      if (kind === 'listUnordered') {\n        effects.enter('listItemPrefix')\n        return code === 42 || code === 45\n          ? effects.check(thematicBreak, nok, atMarker)(code)\n          : atMarker(code)\n      }\n      if (!self.interrupt || code === 49) {\n        effects.enter('listItemPrefix')\n        effects.enter('listItemValue')\n        return inside(code)\n      }\n    }\n    return nok(code)\n  }\n\n  /** @type {State} */\n  function inside(code) {\n    if (asciiDigit(code) && ++size < 10) {\n      effects.consume(code)\n      return inside\n    }\n    if (\n      (!self.interrupt || size < 2) &&\n      (self.containerState.marker\n        ? code === self.containerState.marker\n        : code === 41 || code === 46)\n    ) {\n      effects.exit('listItemValue')\n      return atMarker(code)\n    }\n    return nok(code)\n  }\n\n  /**\n   * @type {State}\n   **/\n  function atMarker(code) {\n    effects.enter('listItemMarker')\n    effects.consume(code)\n    effects.exit('listItemMarker')\n    self.containerState.marker = self.containerState.marker || code\n    return effects.check(\n      blankLine,\n      // Can’t be empty when interrupting.\n      self.interrupt ? nok : onBlank,\n      effects.attempt(\n        listItemPrefixWhitespaceConstruct,\n        endOfPrefix,\n        otherPrefix\n      )\n    )\n  }\n\n  /** @type {State} */\n  function onBlank(code) {\n    self.containerState.initialBlankLine = true\n    initialSize++\n    return endOfPrefix(code)\n  }\n\n  /** @type {State} */\n  function otherPrefix(code) {\n    if (markdownSpace(code)) {\n      effects.enter('listItemPrefixWhitespace')\n      effects.consume(code)\n      effects.exit('listItemPrefixWhitespace')\n      return endOfPrefix\n    }\n    return nok(code)\n  }\n\n  /** @type {State} */\n  function endOfPrefix(code) {\n    self.containerState.size =\n      initialSize +\n      self.sliceSerialize(effects.exit('listItemPrefix'), true).length\n    return ok(code)\n  }\n}\n\n/**\n * @type {Tokenizer}\n * @this {TokenizeContext}\n */\nfunction tokenizeListContinuation(effects, ok, nok) {\n  const self = this\n  self.containerState._closeFlow = undefined\n  return effects.check(blankLine, onBlank, notBlank)\n\n  /** @type {State} */\n  function onBlank(code) {\n    self.containerState.furtherBlankLines =\n      self.containerState.furtherBlankLines ||\n      self.containerState.initialBlankLine\n\n    // We have a blank line.\n    // Still, try to consume at most the items size.\n    return factorySpace(\n      effects,\n      ok,\n      'listItemIndent',\n      self.containerState.size + 1\n    )(code)\n  }\n\n  /** @type {State} */\n  function notBlank(code) {\n    if (self.containerState.furtherBlankLines || !markdownSpace(code)) {\n      self.containerState.furtherBlankLines = undefined\n      self.containerState.initialBlankLine = undefined\n      return notInCurrentItem(code)\n    }\n    self.containerState.furtherBlankLines = undefined\n    self.containerState.initialBlankLine = undefined\n    return effects.attempt(indentConstruct, ok, notInCurrentItem)(code)\n  }\n\n  /** @type {State} */\n  function notInCurrentItem(code) {\n    // While we do continue, we signal that the flow should be closed.\n    self.containerState._closeFlow = true\n    // As we’re closing flow, we’re no longer interrupting.\n    self.interrupt = undefined\n    // Always populated by defaults.\n\n    return factorySpace(\n      effects,\n      effects.attempt(list, ok, nok),\n      'linePrefix',\n      self.parser.constructs.disable.null.includes('codeIndented')\n        ? undefined\n        : 4\n    )(code)\n  }\n}\n\n/**\n * @type {Tokenizer}\n * @this {TokenizeContext}\n */\nfunction tokenizeIndent(effects, ok, nok) {\n  const self = this\n  return factorySpace(\n    effects,\n    afterPrefix,\n    'listItemIndent',\n    self.containerState.size + 1\n  )\n\n  /** @type {State} */\n  function afterPrefix(code) {\n    const tail = self.events[self.events.length - 1]\n    return tail &&\n      tail[1].type === 'listItemIndent' &&\n      tail[2].sliceSerialize(tail[1], true).length === self.containerState.size\n      ? ok(code)\n      : nok(code)\n  }\n}\n\n/**\n * @type {Exiter}\n * @this {TokenizeContext}\n */\nfunction tokenizeListEnd(effects) {\n  effects.exit(this.containerState.type)\n}\n\n/**\n * @type {Tokenizer}\n * @this {TokenizeContext}\n */\nfunction tokenizeListItemPrefixWhitespace(effects, ok, nok) {\n  const self = this\n\n  // Always populated by defaults.\n\n  return factorySpace(\n    effects,\n    afterPrefix,\n    'listItemPrefixWhitespace',\n    self.parser.constructs.disable.null.includes('codeIndented')\n      ? undefined\n      : 4 + 1\n  )\n\n  /** @type {State} */\n  function afterPrefix(code) {\n    const tail = self.events[self.events.length - 1]\n    return !markdownSpace(code) &&\n      tail &&\n      tail[1].type === 'listItemPrefixWhitespace'\n      ? ok(code)\n      : nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Exiter} Exiter\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownSpace} from 'micromark-util-character'\n/** @type {Construct} */\nexport const blockQuote = {\n  name: 'blockQuote',\n  tokenize: tokenizeBlockQuoteStart,\n  continuation: {\n    tokenize: tokenizeBlockQuoteContinuation\n  },\n  exit\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeBlockQuoteStart(effects, ok, nok) {\n  const self = this\n  return start\n\n  /**\n   * Start of block quote.\n   *\n   * ```markdown\n   * > | > a\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    if (code === 62) {\n      const state = self.containerState\n      if (!state.open) {\n        effects.enter('blockQuote', {\n          _container: true\n        })\n        state.open = true\n      }\n      effects.enter('blockQuotePrefix')\n      effects.enter('blockQuoteMarker')\n      effects.consume(code)\n      effects.exit('blockQuoteMarker')\n      return after\n    }\n    return nok(code)\n  }\n\n  /**\n   * After `>`, before optional whitespace.\n   *\n   * ```markdown\n   * > | > a\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function after(code) {\n    if (markdownSpace(code)) {\n      effects.enter('blockQuotePrefixWhitespace')\n      effects.consume(code)\n      effects.exit('blockQuotePrefixWhitespace')\n      effects.exit('blockQuotePrefix')\n      return ok\n    }\n    effects.exit('blockQuotePrefix')\n    return ok(code)\n  }\n}\n\n/**\n * Start of block quote continuation.\n *\n * ```markdown\n *   | > a\n * > | > b\n *     ^\n * ```\n *\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeBlockQuoteContinuation(effects, ok, nok) {\n  const self = this\n  return contStart\n\n  /**\n   * Start of block quote continuation.\n   *\n   * Also used to parse the first block quote opening.\n   *\n   * ```markdown\n   *   | > a\n   * > | > b\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function contStart(code) {\n    if (markdownSpace(code)) {\n      // Always populated by defaults.\n\n      return factorySpace(\n        effects,\n        contBefore,\n        'linePrefix',\n        self.parser.constructs.disable.null.includes('codeIndented')\n          ? undefined\n          : 4\n      )(code)\n    }\n    return contBefore(code)\n  }\n\n  /**\n   * At `>`, after optional whitespace.\n   *\n   * Also used to parse the first block quote opening.\n   *\n   * ```markdown\n   *   | > a\n   * > | > b\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function contBefore(code) {\n    return effects.attempt(blockQuote, ok, nok)(code)\n  }\n}\n\n/** @type {Exiter} */\nfunction exit(effects) {\n  effects.exit('blockQuote')\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenType} TokenType\n */\n\nimport {\n  asciiControl,\n  markdownLineEndingOrSpace,\n  markdownLineEnding\n} from 'micromark-util-character'\n/**\n * Parse destinations.\n *\n * ###### Examples\n *\n * ```markdown\n * <a>\n * <a\\>b>\n * <a b>\n * <a)>\n * a\n * a\\)b\n * a(b)c\n * a(b)\n * ```\n *\n * @param {Effects} effects\n *   Context.\n * @param {State} ok\n *   State switched to when successful.\n * @param {State} nok\n *   State switched to when unsuccessful.\n * @param {TokenType} type\n *   Type for whole (`<a>` or `b`).\n * @param {TokenType} literalType\n *   Type when enclosed (`<a>`).\n * @param {TokenType} literalMarkerType\n *   Type for enclosing (`<` and `>`).\n * @param {TokenType} rawType\n *   Type when not enclosed (`b`).\n * @param {TokenType} stringType\n *   Type for the value (`a` or `b`).\n * @param {number | undefined} [max=Infinity]\n *   Depth of nested parens (inclusive).\n * @returns {State}\n *   Start state.\n */ // eslint-disable-next-line max-params\nexport function factoryDestination(\n  effects,\n  ok,\n  nok,\n  type,\n  literalType,\n  literalMarkerType,\n  rawType,\n  stringType,\n  max\n) {\n  const limit = max || Number.POSITIVE_INFINITY\n  let balance = 0\n  return start\n\n  /**\n   * Start of destination.\n   *\n   * ```markdown\n   * > | <aa>\n   *     ^\n   * > | aa\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    if (code === 60) {\n      effects.enter(type)\n      effects.enter(literalType)\n      effects.enter(literalMarkerType)\n      effects.consume(code)\n      effects.exit(literalMarkerType)\n      return enclosedBefore\n    }\n\n    // ASCII control, space, closing paren.\n    if (code === null || code === 32 || code === 41 || asciiControl(code)) {\n      return nok(code)\n    }\n    effects.enter(type)\n    effects.enter(rawType)\n    effects.enter(stringType)\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return raw(code)\n  }\n\n  /**\n   * After `<`, at an enclosed destination.\n   *\n   * ```markdown\n   * > | <aa>\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function enclosedBefore(code) {\n    if (code === 62) {\n      effects.enter(literalMarkerType)\n      effects.consume(code)\n      effects.exit(literalMarkerType)\n      effects.exit(literalType)\n      effects.exit(type)\n      return ok\n    }\n    effects.enter(stringType)\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return enclosed(code)\n  }\n\n  /**\n   * In enclosed destination.\n   *\n   * ```markdown\n   * > | <aa>\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function enclosed(code) {\n    if (code === 62) {\n      effects.exit('chunkString')\n      effects.exit(stringType)\n      return enclosedBefore(code)\n    }\n    if (code === null || code === 60 || markdownLineEnding(code)) {\n      return nok(code)\n    }\n    effects.consume(code)\n    return code === 92 ? enclosedEscape : enclosed\n  }\n\n  /**\n   * After `\\`, at a special character.\n   *\n   * ```markdown\n   * > | <a\\*a>\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function enclosedEscape(code) {\n    if (code === 60 || code === 62 || code === 92) {\n      effects.consume(code)\n      return enclosed\n    }\n    return enclosed(code)\n  }\n\n  /**\n   * In raw destination.\n   *\n   * ```markdown\n   * > | aa\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function raw(code) {\n    if (\n      !balance &&\n      (code === null || code === 41 || markdownLineEndingOrSpace(code))\n    ) {\n      effects.exit('chunkString')\n      effects.exit(stringType)\n      effects.exit(rawType)\n      effects.exit(type)\n      return ok(code)\n    }\n    if (balance < limit && code === 40) {\n      effects.consume(code)\n      balance++\n      return raw\n    }\n    if (code === 41) {\n      effects.consume(code)\n      balance--\n      return raw\n    }\n\n    // ASCII control (but *not* `\\0`) and space and `(`.\n    // Note: in `markdown-rs`, `\\0` exists in codes, in `micromark-js` it\n    // doesn’t.\n    if (code === null || code === 32 || code === 40 || asciiControl(code)) {\n      return nok(code)\n    }\n    effects.consume(code)\n    return code === 92 ? rawEscape : raw\n  }\n\n  /**\n   * After `\\`, at special character.\n   *\n   * ```markdown\n   * > | a\\*a\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function rawEscape(code) {\n    if (code === 40 || code === 41 || code === 92) {\n      effects.consume(code)\n      return raw\n    }\n    return raw(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').TokenType} TokenType\n */\n\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n/**\n * Parse labels.\n *\n * > 👉 **Note**: labels in markdown are capped at 999 characters in the string.\n *\n * ###### Examples\n *\n * ```markdown\n * [a]\n * [a\n * b]\n * [a\\]b]\n * ```\n *\n * @this {TokenizeContext}\n *   Tokenize context.\n * @param {Effects} effects\n *   Context.\n * @param {State} ok\n *   State switched to when successful.\n * @param {State} nok\n *   State switched to when unsuccessful.\n * @param {TokenType} type\n *   Type of the whole label (`[a]`).\n * @param {TokenType} markerType\n *   Type for the markers (`[` and `]`).\n * @param {TokenType} stringType\n *   Type for the identifier (`a`).\n * @returns {State}\n *   Start state.\n */ // eslint-disable-next-line max-params\nexport function factoryLabel(effects, ok, nok, type, markerType, stringType) {\n  const self = this\n  let size = 0\n  /** @type {boolean} */\n  let seen\n  return start\n\n  /**\n   * Start of label.\n   *\n   * ```markdown\n   * > | [a]\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter(type)\n    effects.enter(markerType)\n    effects.consume(code)\n    effects.exit(markerType)\n    effects.enter(stringType)\n    return atBreak\n  }\n\n  /**\n   * In label, at something, before something else.\n   *\n   * ```markdown\n   * > | [a]\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function atBreak(code) {\n    if (\n      size > 999 ||\n      code === null ||\n      code === 91 ||\n      (code === 93 && !seen) ||\n      // To do: remove in the future once we’ve switched from\n      // `micromark-extension-footnote` to `micromark-extension-gfm-footnote`,\n      // which doesn’t need this.\n      // Hidden footnotes hook.\n      /* c8 ignore next 3 */\n      (code === 94 &&\n        !size &&\n        '_hiddenFootnoteSupport' in self.parser.constructs)\n    ) {\n      return nok(code)\n    }\n    if (code === 93) {\n      effects.exit(stringType)\n      effects.enter(markerType)\n      effects.consume(code)\n      effects.exit(markerType)\n      effects.exit(type)\n      return ok\n    }\n\n    // To do: indent? Link chunks and EOLs together?\n    if (markdownLineEnding(code)) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return atBreak\n    }\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return labelInside(code)\n  }\n\n  /**\n   * In label, in text.\n   *\n   * ```markdown\n   * > | [a]\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function labelInside(code) {\n    if (\n      code === null ||\n      code === 91 ||\n      code === 93 ||\n      markdownLineEnding(code) ||\n      size++ > 999\n    ) {\n      effects.exit('chunkString')\n      return atBreak(code)\n    }\n    effects.consume(code)\n    if (!seen) seen = !markdownSpace(code)\n    return code === 92 ? labelEscape : labelInside\n  }\n\n  /**\n   * After `\\`, at a special character.\n   *\n   * ```markdown\n   * > | [a\\*a]\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function labelEscape(code) {\n    if (code === 91 || code === 92 || code === 93) {\n      effects.consume(code)\n      size++\n      return labelInside\n    }\n    return labelInside(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenType} TokenType\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n/**\n * Parse titles.\n *\n * ###### Examples\n *\n * ```markdown\n * \"a\"\n * 'b'\n * (c)\n * \"a\n * b\"\n * 'a\n *     b'\n * (a\\)b)\n * ```\n *\n * @param {Effects} effects\n *   Context.\n * @param {State} ok\n *   State switched to when successful.\n * @param {State} nok\n *   State switched to when unsuccessful.\n * @param {TokenType} type\n *   Type of the whole title (`\"a\"`, `'b'`, `(c)`).\n * @param {TokenType} markerType\n *   Type for the markers (`\"`, `'`, `(`, and `)`).\n * @param {TokenType} stringType\n *   Type for the value (`a`).\n * @returns {State}\n *   Start state.\n */ // eslint-disable-next-line max-params\nexport function factoryTitle(effects, ok, nok, type, markerType, stringType) {\n  /** @type {NonNullable<Code>} */\n  let marker\n  return start\n\n  /**\n   * Start of title.\n   *\n   * ```markdown\n   * > | \"a\"\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    if (code === 34 || code === 39 || code === 40) {\n      effects.enter(type)\n      effects.enter(markerType)\n      effects.consume(code)\n      effects.exit(markerType)\n      marker = code === 40 ? 41 : code\n      return begin\n    }\n    return nok(code)\n  }\n\n  /**\n   * After opening marker.\n   *\n   * This is also used at the closing marker.\n   *\n   * ```markdown\n   * > | \"a\"\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function begin(code) {\n    if (code === marker) {\n      effects.enter(markerType)\n      effects.consume(code)\n      effects.exit(markerType)\n      effects.exit(type)\n      return ok\n    }\n    effects.enter(stringType)\n    return atBreak(code)\n  }\n\n  /**\n   * At something, before something else.\n   *\n   * ```markdown\n   * > | \"a\"\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function atBreak(code) {\n    if (code === marker) {\n      effects.exit(stringType)\n      return begin(marker)\n    }\n    if (code === null) {\n      return nok(code)\n    }\n\n    // Note: blank lines can’t exist in content.\n    if (markdownLineEnding(code)) {\n      // To do: use `space_or_tab_eol_with_options`, connect.\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return factorySpace(effects, atBreak, 'linePrefix')\n    }\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return inside(code)\n  }\n\n  /**\n   *\n   *\n   * @type {State}\n   */\n  function inside(code) {\n    if (code === marker || code === null || markdownLineEnding(code)) {\n      effects.exit('chunkString')\n      return atBreak(code)\n    }\n    effects.consume(code)\n    return code === 92 ? escape : inside\n  }\n\n  /**\n   * After `\\`, at a special character.\n   *\n   * ```markdown\n   * > | \"a\\*b\"\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function escape(code) {\n    if (code === marker || code === 92) {\n      effects.consume(code)\n      return inside\n    }\n    return inside(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n/**\n * Parse spaces and tabs.\n *\n * There is no `nok` parameter:\n *\n * *   line endings or spaces in markdown are often optional, in which case this\n *     factory can be used and `ok` will be switched to whether spaces were found\n *     or not\n * *   one line ending or space can be detected with\n *     `markdownLineEndingOrSpace(code)` right before using `factoryWhitespace`\n *\n * @param {Effects} effects\n *   Context.\n * @param {State} ok\n *   State switched to when successful.\n * @returns {State}\n *   Start state.\n */\nexport function factoryWhitespace(effects, ok) {\n  /** @type {boolean} */\n  let seen\n  return start\n\n  /** @type {State} */\n  function start(code) {\n    if (markdownLineEnding(code)) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      seen = true\n      return start\n    }\n    if (markdownSpace(code)) {\n      return factorySpace(\n        effects,\n        start,\n        seen ? 'linePrefix' : 'lineSuffix'\n      )(code)\n    }\n    return ok(code)\n  }\n}\n","/**\n * Normalize an identifier (as found in references, definitions).\n *\n * Collapses markdown whitespace, trim, and then lower- and uppercase.\n *\n * Some characters are considered “uppercase”, such as U+03F4 (`ϴ`), but if their\n * lowercase counterpart (U+03B8 (`θ`)) is uppercased will result in a different\n * uppercase character (U+0398 (`Θ`)).\n * So, to get a canonical form, we perform both lower- and uppercase.\n *\n * Using uppercase last makes sure keys will never interact with default\n * prototypal values (such as `constructor`): nothing in the prototype of\n * `Object` is uppercase.\n *\n * @param {string} value\n *   Identifier to normalize.\n * @returns {string}\n *   Normalized identifier.\n */\nexport function normalizeIdentifier(value) {\n  return (\n    value\n      // Collapse markdown whitespace.\n      .replace(/[\\t\\n\\r ]+/g, ' ')\n      // Trim.\n      .replace(/^ | $/g, '')\n      // Some characters are considered “uppercase”, but if their lowercase\n      // counterpart is uppercased will result in a different uppercase\n      // character.\n      // Hence, to get that form, we perform both lower- and uppercase.\n      // Upper case makes sure keys will not interact with default prototypal\n      // methods: no method is uppercase.\n      .toLowerCase()\n      .toUpperCase()\n  )\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factoryDestination} from 'micromark-factory-destination'\nimport {factoryLabel} from 'micromark-factory-label'\nimport {factorySpace} from 'micromark-factory-space'\nimport {factoryTitle} from 'micromark-factory-title'\nimport {factoryWhitespace} from 'micromark-factory-whitespace'\nimport {\n  markdownLineEnding,\n  markdownLineEndingOrSpace,\n  markdownSpace\n} from 'micromark-util-character'\nimport {normalizeIdentifier} from 'micromark-util-normalize-identifier'\n/** @type {Construct} */\nexport const definition = {\n  name: 'definition',\n  tokenize: tokenizeDefinition\n}\n\n/** @type {Construct} */\nconst titleBefore = {\n  tokenize: tokenizeTitleBefore,\n  partial: true\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeDefinition(effects, ok, nok) {\n  const self = this\n  /** @type {string} */\n  let identifier\n  return start\n\n  /**\n   * At start of a definition.\n   *\n   * ```markdown\n   * > | [a]: b \"c\"\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    // Do not interrupt paragraphs (but do follow definitions).\n    // To do: do `interrupt` the way `markdown-rs` does.\n    // To do: parse whitespace the way `markdown-rs` does.\n    effects.enter('definition')\n    return before(code)\n  }\n\n  /**\n   * After optional whitespace, at `[`.\n   *\n   * ```markdown\n   * > | [a]: b \"c\"\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function before(code) {\n    // To do: parse whitespace the way `markdown-rs` does.\n\n    return factoryLabel.call(\n      self,\n      effects,\n      labelAfter,\n      // Note: we don’t need to reset the way `markdown-rs` does.\n      nok,\n      'definitionLabel',\n      'definitionLabelMarker',\n      'definitionLabelString'\n    )(code)\n  }\n\n  /**\n   * After label.\n   *\n   * ```markdown\n   * > | [a]: b \"c\"\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function labelAfter(code) {\n    identifier = normalizeIdentifier(\n      self.sliceSerialize(self.events[self.events.length - 1][1]).slice(1, -1)\n    )\n    if (code === 58) {\n      effects.enter('definitionMarker')\n      effects.consume(code)\n      effects.exit('definitionMarker')\n      return markerAfter\n    }\n    return nok(code)\n  }\n\n  /**\n   * After marker.\n   *\n   * ```markdown\n   * > | [a]: b \"c\"\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function markerAfter(code) {\n    // Note: whitespace is optional.\n    return markdownLineEndingOrSpace(code)\n      ? factoryWhitespace(effects, destinationBefore)(code)\n      : destinationBefore(code)\n  }\n\n  /**\n   * Before destination.\n   *\n   * ```markdown\n   * > | [a]: b \"c\"\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function destinationBefore(code) {\n    return factoryDestination(\n      effects,\n      destinationAfter,\n      // Note: we don’t need to reset the way `markdown-rs` does.\n      nok,\n      'definitionDestination',\n      'definitionDestinationLiteral',\n      'definitionDestinationLiteralMarker',\n      'definitionDestinationRaw',\n      'definitionDestinationString'\n    )(code)\n  }\n\n  /**\n   * After destination.\n   *\n   * ```markdown\n   * > | [a]: b \"c\"\n   *           ^\n   * ```\n   *\n   * @type {State}\n   */\n  function destinationAfter(code) {\n    return effects.attempt(titleBefore, after, after)(code)\n  }\n\n  /**\n   * After definition.\n   *\n   * ```markdown\n   * > | [a]: b\n   *           ^\n   * > | [a]: b \"c\"\n   *               ^\n   * ```\n   *\n   * @type {State}\n   */\n  function after(code) {\n    return markdownSpace(code)\n      ? factorySpace(effects, afterWhitespace, 'whitespace')(code)\n      : afterWhitespace(code)\n  }\n\n  /**\n   * After definition, after optional whitespace.\n   *\n   * ```markdown\n   * > | [a]: b\n   *           ^\n   * > | [a]: b \"c\"\n   *               ^\n   * ```\n   *\n   * @type {State}\n   */\n  function afterWhitespace(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('definition')\n\n      // Note: we don’t care about uniqueness.\n      // It’s likely that that doesn’t happen very frequently.\n      // It is more likely that it wastes precious time.\n      self.parser.defined.push(identifier)\n\n      // To do: `markdown-rs` interrupt.\n      // // You’d be interrupting.\n      // tokenizer.interrupt = true\n      return ok(code)\n    }\n    return nok(code)\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeTitleBefore(effects, ok, nok) {\n  return titleBefore\n\n  /**\n   * After destination, at whitespace.\n   *\n   * ```markdown\n   * > | [a]: b\n   *           ^\n   * > | [a]: b \"c\"\n   *           ^\n   * ```\n   *\n   * @type {State}\n   */\n  function titleBefore(code) {\n    return markdownLineEndingOrSpace(code)\n      ? factoryWhitespace(effects, beforeMarker)(code)\n      : nok(code)\n  }\n\n  /**\n   * At title.\n   *\n   * ```markdown\n   *   | [a]: b\n   * > | \"c\"\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function beforeMarker(code) {\n    return factoryTitle(\n      effects,\n      titleAfter,\n      nok,\n      'definitionTitle',\n      'definitionTitleMarker',\n      'definitionTitleString'\n    )(code)\n  }\n\n  /**\n   * After title.\n   *\n   * ```markdown\n   * > | [a]: b \"c\"\n   *               ^\n   * ```\n   *\n   * @type {State}\n   */\n  function titleAfter(code) {\n    return markdownSpace(code)\n      ? factorySpace(effects, titleAfterOptionalWhitespace, 'whitespace')(code)\n      : titleAfterOptionalWhitespace(code)\n  }\n\n  /**\n   * After title, after optional whitespace.\n   *\n   * ```markdown\n   * > | [a]: b \"c\"\n   *               ^\n   * ```\n   *\n   * @type {State}\n   */\n  function titleAfterOptionalWhitespace(code) {\n    return code === null || markdownLineEnding(code) ? ok(code) : nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n/** @type {Construct} */\nexport const codeIndented = {\n  name: 'codeIndented',\n  tokenize: tokenizeCodeIndented\n}\n\n/** @type {Construct} */\nconst furtherStart = {\n  tokenize: tokenizeFurtherStart,\n  partial: true\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeCodeIndented(effects, ok, nok) {\n  const self = this\n  return start\n\n  /**\n   * Start of code (indented).\n   *\n   * > **Parsing note**: it is not needed to check if this first line is a\n   * > filled line (that it has a non-whitespace character), because blank lines\n   * > are parsed already, so we never run into that.\n   *\n   * ```markdown\n   * > |     aaa\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    // To do: manually check if interrupting like `markdown-rs`.\n\n    effects.enter('codeIndented')\n    // To do: use an improved `space_or_tab` function like `markdown-rs`,\n    // so that we can drop the next state.\n    return factorySpace(effects, afterPrefix, 'linePrefix', 4 + 1)(code)\n  }\n\n  /**\n   * At start, after 1 or 4 spaces.\n   *\n   * ```markdown\n   * > |     aaa\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function afterPrefix(code) {\n    const tail = self.events[self.events.length - 1]\n    return tail &&\n      tail[1].type === 'linePrefix' &&\n      tail[2].sliceSerialize(tail[1], true).length >= 4\n      ? atBreak(code)\n      : nok(code)\n  }\n\n  /**\n   * At a break.\n   *\n   * ```markdown\n   * > |     aaa\n   *         ^  ^\n   * ```\n   *\n   * @type {State}\n   */\n  function atBreak(code) {\n    if (code === null) {\n      return after(code)\n    }\n    if (markdownLineEnding(code)) {\n      return effects.attempt(furtherStart, atBreak, after)(code)\n    }\n    effects.enter('codeFlowValue')\n    return inside(code)\n  }\n\n  /**\n   * In code content.\n   *\n   * ```markdown\n   * > |     aaa\n   *         ^^^^\n   * ```\n   *\n   * @type {State}\n   */\n  function inside(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('codeFlowValue')\n      return atBreak(code)\n    }\n    effects.consume(code)\n    return inside\n  }\n\n  /** @type {State} */\n  function after(code) {\n    effects.exit('codeIndented')\n    // To do: allow interrupting like `markdown-rs`.\n    // Feel free to interrupt.\n    // tokenizer.interrupt = false\n    return ok(code)\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeFurtherStart(effects, ok, nok) {\n  const self = this\n  return furtherStart\n\n  /**\n   * At eol, trying to parse another indent.\n   *\n   * ```markdown\n   * > |     aaa\n   *            ^\n   *   |     bbb\n   * ```\n   *\n   * @type {State}\n   */\n  function furtherStart(code) {\n    // To do: improve `lazy` / `pierce` handling.\n    // If this is a lazy line, it can’t be code.\n    if (self.parser.lazy[self.now().line]) {\n      return nok(code)\n    }\n    if (markdownLineEnding(code)) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return furtherStart\n    }\n\n    // To do: the code here in `micromark-js` is a bit different from\n    // `markdown-rs` because there it can attempt spaces.\n    // We can’t yet.\n    //\n    // To do: use an improved `space_or_tab` function like `markdown-rs`,\n    // so that we can drop the next state.\n    return factorySpace(effects, afterPrefix, 'linePrefix', 4 + 1)(code)\n  }\n\n  /**\n   * At start, after 1 or 4 spaces.\n   *\n   * ```markdown\n   * > |     aaa\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function afterPrefix(code) {\n    const tail = self.events[self.events.length - 1]\n    return tail &&\n      tail[1].type === 'linePrefix' &&\n      tail[2].sliceSerialize(tail[1], true).length >= 4\n      ? ok(code)\n      : markdownLineEnding(code)\n      ? furtherStart(code)\n      : nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {\n  markdownLineEnding,\n  markdownLineEndingOrSpace,\n  markdownSpace\n} from 'micromark-util-character'\nimport {splice} from 'micromark-util-chunked'\n/** @type {Construct} */\nexport const headingAtx = {\n  name: 'headingAtx',\n  tokenize: tokenizeHeadingAtx,\n  resolve: resolveHeadingAtx\n}\n\n/** @type {Resolver} */\nfunction resolveHeadingAtx(events, context) {\n  let contentEnd = events.length - 2\n  let contentStart = 3\n  /** @type {Token} */\n  let content\n  /** @type {Token} */\n  let text\n\n  // Prefix whitespace, part of the opening.\n  if (events[contentStart][1].type === 'whitespace') {\n    contentStart += 2\n  }\n\n  // Suffix whitespace, part of the closing.\n  if (\n    contentEnd - 2 > contentStart &&\n    events[contentEnd][1].type === 'whitespace'\n  ) {\n    contentEnd -= 2\n  }\n  if (\n    events[contentEnd][1].type === 'atxHeadingSequence' &&\n    (contentStart === contentEnd - 1 ||\n      (contentEnd - 4 > contentStart &&\n        events[contentEnd - 2][1].type === 'whitespace'))\n  ) {\n    contentEnd -= contentStart + 1 === contentEnd ? 2 : 4\n  }\n  if (contentEnd > contentStart) {\n    content = {\n      type: 'atxHeadingText',\n      start: events[contentStart][1].start,\n      end: events[contentEnd][1].end\n    }\n    text = {\n      type: 'chunkText',\n      start: events[contentStart][1].start,\n      end: events[contentEnd][1].end,\n      contentType: 'text'\n    }\n    splice(events, contentStart, contentEnd - contentStart + 1, [\n      ['enter', content, context],\n      ['enter', text, context],\n      ['exit', text, context],\n      ['exit', content, context]\n    ])\n  }\n  return events\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeHeadingAtx(effects, ok, nok) {\n  let size = 0\n  return start\n\n  /**\n   * Start of a heading (atx).\n   *\n   * ```markdown\n   * > | ## aa\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    // To do: parse indent like `markdown-rs`.\n    effects.enter('atxHeading')\n    return before(code)\n  }\n\n  /**\n   * After optional whitespace, at `#`.\n   *\n   * ```markdown\n   * > | ## aa\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function before(code) {\n    effects.enter('atxHeadingSequence')\n    return sequenceOpen(code)\n  }\n\n  /**\n   * In opening sequence.\n   *\n   * ```markdown\n   * > | ## aa\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function sequenceOpen(code) {\n    if (code === 35 && size++ < 6) {\n      effects.consume(code)\n      return sequenceOpen\n    }\n\n    // Always at least one `#`.\n    if (code === null || markdownLineEndingOrSpace(code)) {\n      effects.exit('atxHeadingSequence')\n      return atBreak(code)\n    }\n    return nok(code)\n  }\n\n  /**\n   * After something, before something else.\n   *\n   * ```markdown\n   * > | ## aa\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function atBreak(code) {\n    if (code === 35) {\n      effects.enter('atxHeadingSequence')\n      return sequenceFurther(code)\n    }\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('atxHeading')\n      // To do: interrupt like `markdown-rs`.\n      // // Feel free to interrupt.\n      // tokenizer.interrupt = false\n      return ok(code)\n    }\n    if (markdownSpace(code)) {\n      return factorySpace(effects, atBreak, 'whitespace')(code)\n    }\n\n    // To do: generate `data` tokens, add the `text` token later.\n    // Needs edit map, see: `markdown.rs`.\n    effects.enter('atxHeadingText')\n    return data(code)\n  }\n\n  /**\n   * In further sequence (after whitespace).\n   *\n   * Could be normal “visible” hashes in the heading or a final sequence.\n   *\n   * ```markdown\n   * > | ## aa ##\n   *           ^\n   * ```\n   *\n   * @type {State}\n   */\n  function sequenceFurther(code) {\n    if (code === 35) {\n      effects.consume(code)\n      return sequenceFurther\n    }\n    effects.exit('atxHeadingSequence')\n    return atBreak(code)\n  }\n\n  /**\n   * In text.\n   *\n   * ```markdown\n   * > | ## aa\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function data(code) {\n    if (code === null || code === 35 || markdownLineEndingOrSpace(code)) {\n      effects.exit('atxHeadingText')\n      return atBreak(code)\n    }\n    effects.consume(code)\n    return data\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n/** @type {Construct} */\nexport const setextUnderline = {\n  name: 'setextUnderline',\n  tokenize: tokenizeSetextUnderline,\n  resolveTo: resolveToSetextUnderline\n}\n\n/** @type {Resolver} */\nfunction resolveToSetextUnderline(events, context) {\n  // To do: resolve like `markdown-rs`.\n  let index = events.length\n  /** @type {number | undefined} */\n  let content\n  /** @type {number | undefined} */\n  let text\n  /** @type {number | undefined} */\n  let definition\n\n  // Find the opening of the content.\n  // It’ll always exist: we don’t tokenize if it isn’t there.\n  while (index--) {\n    if (events[index][0] === 'enter') {\n      if (events[index][1].type === 'content') {\n        content = index\n        break\n      }\n      if (events[index][1].type === 'paragraph') {\n        text = index\n      }\n    }\n    // Exit\n    else {\n      if (events[index][1].type === 'content') {\n        // Remove the content end (if needed we’ll add it later)\n        events.splice(index, 1)\n      }\n      if (!definition && events[index][1].type === 'definition') {\n        definition = index\n      }\n    }\n  }\n  const heading = {\n    type: 'setextHeading',\n    start: Object.assign({}, events[text][1].start),\n    end: Object.assign({}, events[events.length - 1][1].end)\n  }\n\n  // Change the paragraph to setext heading text.\n  events[text][1].type = 'setextHeadingText'\n\n  // If we have definitions in the content, we’ll keep on having content,\n  // but we need move it.\n  if (definition) {\n    events.splice(text, 0, ['enter', heading, context])\n    events.splice(definition + 1, 0, ['exit', events[content][1], context])\n    events[content][1].end = Object.assign({}, events[definition][1].end)\n  } else {\n    events[content][1] = heading\n  }\n\n  // Add the heading exit at the end.\n  events.push(['exit', heading, context])\n  return events\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeSetextUnderline(effects, ok, nok) {\n  const self = this\n  /** @type {NonNullable<Code>} */\n  let marker\n  return start\n\n  /**\n   * At start of heading (setext) underline.\n   *\n   * ```markdown\n   *   | aa\n   * > | ==\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    let index = self.events.length\n    /** @type {boolean | undefined} */\n    let paragraph\n    // Find an opening.\n    while (index--) {\n      // Skip enter/exit of line ending, line prefix, and content.\n      // We can now either have a definition or a paragraph.\n      if (\n        self.events[index][1].type !== 'lineEnding' &&\n        self.events[index][1].type !== 'linePrefix' &&\n        self.events[index][1].type !== 'content'\n      ) {\n        paragraph = self.events[index][1].type === 'paragraph'\n        break\n      }\n    }\n\n    // To do: handle lazy/pierce like `markdown-rs`.\n    // To do: parse indent like `markdown-rs`.\n    if (!self.parser.lazy[self.now().line] && (self.interrupt || paragraph)) {\n      effects.enter('setextHeadingLine')\n      marker = code\n      return before(code)\n    }\n    return nok(code)\n  }\n\n  /**\n   * After optional whitespace, at `-` or `=`.\n   *\n   * ```markdown\n   *   | aa\n   * > | ==\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function before(code) {\n    effects.enter('setextHeadingLineSequence')\n    return inside(code)\n  }\n\n  /**\n   * In sequence.\n   *\n   * ```markdown\n   *   | aa\n   * > | ==\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function inside(code) {\n    if (code === marker) {\n      effects.consume(code)\n      return inside\n    }\n    effects.exit('setextHeadingLineSequence')\n    return markdownSpace(code)\n      ? factorySpace(effects, after, 'lineSuffix')(code)\n      : after(code)\n  }\n\n  /**\n   * After sequence, after optional whitespace.\n   *\n   * ```markdown\n   *   | aa\n   * > | ==\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function after(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('setextHeadingLine')\n      return ok(code)\n    }\n    return nok(code)\n  }\n}\n","/**\n * List of lowercase HTML “block” tag names.\n *\n * The list, when parsing HTML (flow), results in more relaxed rules (condition\n * 6).\n * Because they are known blocks, the HTML-like syntax doesn’t have to be\n * strictly parsed.\n * For tag names not in this list, a more strict algorithm (condition 7) is used\n * to detect whether the HTML-like syntax is seen as HTML (flow) or not.\n *\n * This is copied from:\n * <https://spec.commonmark.org/0.30/#html-blocks>.\n *\n * > 👉 **Note**: `search` was added in `CommonMark@0.31`.\n */\nexport const htmlBlockNames = [\n  'address',\n  'article',\n  'aside',\n  'base',\n  'basefont',\n  'blockquote',\n  'body',\n  'caption',\n  'center',\n  'col',\n  'colgroup',\n  'dd',\n  'details',\n  'dialog',\n  'dir',\n  'div',\n  'dl',\n  'dt',\n  'fieldset',\n  'figcaption',\n  'figure',\n  'footer',\n  'form',\n  'frame',\n  'frameset',\n  'h1',\n  'h2',\n  'h3',\n  'h4',\n  'h5',\n  'h6',\n  'head',\n  'header',\n  'hr',\n  'html',\n  'iframe',\n  'legend',\n  'li',\n  'link',\n  'main',\n  'menu',\n  'menuitem',\n  'nav',\n  'noframes',\n  'ol',\n  'optgroup',\n  'option',\n  'p',\n  'param',\n  'search',\n  'section',\n  'summary',\n  'table',\n  'tbody',\n  'td',\n  'tfoot',\n  'th',\n  'thead',\n  'title',\n  'tr',\n  'track',\n  'ul'\n]\n\n/**\n * List of lowercase HTML “raw” tag names.\n *\n * The list, when parsing HTML (flow), results in HTML that can include lines\n * without exiting, until a closing tag also in this list is found (condition\n * 1).\n *\n * This module is copied from:\n * <https://spec.commonmark.org/0.30/#html-blocks>.\n *\n * > 👉 **Note**: `textarea` was added in `CommonMark@0.30`.\n */\nexport const htmlRawNames = ['pre', 'script', 'style', 'textarea']\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {\n  asciiAlpha,\n  asciiAlphanumeric,\n  markdownLineEnding,\n  markdownLineEndingOrSpace,\n  markdownSpace\n} from 'micromark-util-character'\nimport {htmlBlockNames, htmlRawNames} from 'micromark-util-html-tag-name'\nimport {blankLine} from './blank-line.js'\n\n/** @type {Construct} */\nexport const htmlFlow = {\n  name: 'htmlFlow',\n  tokenize: tokenizeHtmlFlow,\n  resolveTo: resolveToHtmlFlow,\n  concrete: true\n}\n\n/** @type {Construct} */\nconst blankLineBefore = {\n  tokenize: tokenizeBlankLineBefore,\n  partial: true\n}\nconst nonLazyContinuationStart = {\n  tokenize: tokenizeNonLazyContinuationStart,\n  partial: true\n}\n\n/** @type {Resolver} */\nfunction resolveToHtmlFlow(events) {\n  let index = events.length\n  while (index--) {\n    if (events[index][0] === 'enter' && events[index][1].type === 'htmlFlow') {\n      break\n    }\n  }\n  if (index > 1 && events[index - 2][1].type === 'linePrefix') {\n    // Add the prefix start to the HTML token.\n    events[index][1].start = events[index - 2][1].start\n    // Add the prefix start to the HTML line token.\n    events[index + 1][1].start = events[index - 2][1].start\n    // Remove the line prefix.\n    events.splice(index - 2, 2)\n  }\n  return events\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeHtmlFlow(effects, ok, nok) {\n  const self = this\n  /** @type {number} */\n  let marker\n  /** @type {boolean} */\n  let closingTag\n  /** @type {string} */\n  let buffer\n  /** @type {number} */\n  let index\n  /** @type {Code} */\n  let markerB\n  return start\n\n  /**\n   * Start of HTML (flow).\n   *\n   * ```markdown\n   * > | <x />\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    // To do: parse indent like `markdown-rs`.\n    return before(code)\n  }\n\n  /**\n   * At `<`, after optional whitespace.\n   *\n   * ```markdown\n   * > | <x />\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function before(code) {\n    effects.enter('htmlFlow')\n    effects.enter('htmlFlowData')\n    effects.consume(code)\n    return open\n  }\n\n  /**\n   * After `<`, at tag name or other stuff.\n   *\n   * ```markdown\n   * > | <x />\n   *      ^\n   * > | <!doctype>\n   *      ^\n   * > | <!--xxx-->\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function open(code) {\n    if (code === 33) {\n      effects.consume(code)\n      return declarationOpen\n    }\n    if (code === 47) {\n      effects.consume(code)\n      closingTag = true\n      return tagCloseStart\n    }\n    if (code === 63) {\n      effects.consume(code)\n      marker = 3\n      // To do:\n      // tokenizer.concrete = true\n      // To do: use `markdown-rs` style interrupt.\n      // While we’re in an instruction instead of a declaration, we’re on a `?`\n      // right now, so we do need to search for `>`, similar to declarations.\n      return self.interrupt ? ok : continuationDeclarationInside\n    }\n\n    // ASCII alphabetical.\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      // @ts-expect-error: not null.\n      buffer = String.fromCharCode(code)\n      return tagName\n    }\n    return nok(code)\n  }\n\n  /**\n   * After `<!`, at declaration, comment, or CDATA.\n   *\n   * ```markdown\n   * > | <!doctype>\n   *       ^\n   * > | <!--xxx-->\n   *       ^\n   * > | <![CDATA[>&<]]>\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function declarationOpen(code) {\n    if (code === 45) {\n      effects.consume(code)\n      marker = 2\n      return commentOpenInside\n    }\n    if (code === 91) {\n      effects.consume(code)\n      marker = 5\n      index = 0\n      return cdataOpenInside\n    }\n\n    // ASCII alphabetical.\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      marker = 4\n      // // Do not form containers.\n      // tokenizer.concrete = true\n      return self.interrupt ? ok : continuationDeclarationInside\n    }\n    return nok(code)\n  }\n\n  /**\n   * After `<!-`, inside a comment, at another `-`.\n   *\n   * ```markdown\n   * > | <!--xxx-->\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function commentOpenInside(code) {\n    if (code === 45) {\n      effects.consume(code)\n      // // Do not form containers.\n      // tokenizer.concrete = true\n      return self.interrupt ? ok : continuationDeclarationInside\n    }\n    return nok(code)\n  }\n\n  /**\n   * After `<![`, inside CDATA, expecting `CDATA[`.\n   *\n   * ```markdown\n   * > | <![CDATA[>&<]]>\n   *        ^^^^^^\n   * ```\n   *\n   * @type {State}\n   */\n  function cdataOpenInside(code) {\n    const value = 'CDATA['\n    if (code === value.charCodeAt(index++)) {\n      effects.consume(code)\n      if (index === value.length) {\n        // // Do not form containers.\n        // tokenizer.concrete = true\n        return self.interrupt ? ok : continuation\n      }\n      return cdataOpenInside\n    }\n    return nok(code)\n  }\n\n  /**\n   * After `</`, in closing tag, at tag name.\n   *\n   * ```markdown\n   * > | </x>\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagCloseStart(code) {\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      // @ts-expect-error: not null.\n      buffer = String.fromCharCode(code)\n      return tagName\n    }\n    return nok(code)\n  }\n\n  /**\n   * In tag name.\n   *\n   * ```markdown\n   * > | <ab>\n   *      ^^\n   * > | </ab>\n   *       ^^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagName(code) {\n    if (\n      code === null ||\n      code === 47 ||\n      code === 62 ||\n      markdownLineEndingOrSpace(code)\n    ) {\n      const slash = code === 47\n      const name = buffer.toLowerCase()\n      if (!slash && !closingTag && htmlRawNames.includes(name)) {\n        marker = 1\n        // // Do not form containers.\n        // tokenizer.concrete = true\n        return self.interrupt ? ok(code) : continuation(code)\n      }\n      if (htmlBlockNames.includes(buffer.toLowerCase())) {\n        marker = 6\n        if (slash) {\n          effects.consume(code)\n          return basicSelfClosing\n        }\n\n        // // Do not form containers.\n        // tokenizer.concrete = true\n        return self.interrupt ? ok(code) : continuation(code)\n      }\n      marker = 7\n      // Do not support complete HTML when interrupting.\n      return self.interrupt && !self.parser.lazy[self.now().line]\n        ? nok(code)\n        : closingTag\n        ? completeClosingTagAfter(code)\n        : completeAttributeNameBefore(code)\n    }\n\n    // ASCII alphanumerical and `-`.\n    if (code === 45 || asciiAlphanumeric(code)) {\n      effects.consume(code)\n      buffer += String.fromCharCode(code)\n      return tagName\n    }\n    return nok(code)\n  }\n\n  /**\n   * After closing slash of a basic tag name.\n   *\n   * ```markdown\n   * > | <div/>\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function basicSelfClosing(code) {\n    if (code === 62) {\n      effects.consume(code)\n      // // Do not form containers.\n      // tokenizer.concrete = true\n      return self.interrupt ? ok : continuation\n    }\n    return nok(code)\n  }\n\n  /**\n   * After closing slash of a complete tag name.\n   *\n   * ```markdown\n   * > | <x/>\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function completeClosingTagAfter(code) {\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return completeClosingTagAfter\n    }\n    return completeEnd(code)\n  }\n\n  /**\n   * At an attribute name.\n   *\n   * At first, this state is used after a complete tag name, after whitespace,\n   * where it expects optional attributes or the end of the tag.\n   * It is also reused after attributes, when expecting more optional\n   * attributes.\n   *\n   * ```markdown\n   * > | <a />\n   *        ^\n   * > | <a :b>\n   *        ^\n   * > | <a _b>\n   *        ^\n   * > | <a b>\n   *        ^\n   * > | <a >\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function completeAttributeNameBefore(code) {\n    if (code === 47) {\n      effects.consume(code)\n      return completeEnd\n    }\n\n    // ASCII alphanumerical and `:` and `_`.\n    if (code === 58 || code === 95 || asciiAlpha(code)) {\n      effects.consume(code)\n      return completeAttributeName\n    }\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return completeAttributeNameBefore\n    }\n    return completeEnd(code)\n  }\n\n  /**\n   * In attribute name.\n   *\n   * ```markdown\n   * > | <a :b>\n   *         ^\n   * > | <a _b>\n   *         ^\n   * > | <a b>\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function completeAttributeName(code) {\n    // ASCII alphanumerical and `-`, `.`, `:`, and `_`.\n    if (\n      code === 45 ||\n      code === 46 ||\n      code === 58 ||\n      code === 95 ||\n      asciiAlphanumeric(code)\n    ) {\n      effects.consume(code)\n      return completeAttributeName\n    }\n    return completeAttributeNameAfter(code)\n  }\n\n  /**\n   * After attribute name, at an optional initializer, the end of the tag, or\n   * whitespace.\n   *\n   * ```markdown\n   * > | <a b>\n   *         ^\n   * > | <a b=c>\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function completeAttributeNameAfter(code) {\n    if (code === 61) {\n      effects.consume(code)\n      return completeAttributeValueBefore\n    }\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return completeAttributeNameAfter\n    }\n    return completeAttributeNameBefore(code)\n  }\n\n  /**\n   * Before unquoted, double quoted, or single quoted attribute value, allowing\n   * whitespace.\n   *\n   * ```markdown\n   * > | <a b=c>\n   *          ^\n   * > | <a b=\"c\">\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function completeAttributeValueBefore(code) {\n    if (\n      code === null ||\n      code === 60 ||\n      code === 61 ||\n      code === 62 ||\n      code === 96\n    ) {\n      return nok(code)\n    }\n    if (code === 34 || code === 39) {\n      effects.consume(code)\n      markerB = code\n      return completeAttributeValueQuoted\n    }\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return completeAttributeValueBefore\n    }\n    return completeAttributeValueUnquoted(code)\n  }\n\n  /**\n   * In double or single quoted attribute value.\n   *\n   * ```markdown\n   * > | <a b=\"c\">\n   *           ^\n   * > | <a b='c'>\n   *           ^\n   * ```\n   *\n   * @type {State}\n   */\n  function completeAttributeValueQuoted(code) {\n    if (code === markerB) {\n      effects.consume(code)\n      markerB = null\n      return completeAttributeValueQuotedAfter\n    }\n    if (code === null || markdownLineEnding(code)) {\n      return nok(code)\n    }\n    effects.consume(code)\n    return completeAttributeValueQuoted\n  }\n\n  /**\n   * In unquoted attribute value.\n   *\n   * ```markdown\n   * > | <a b=c>\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function completeAttributeValueUnquoted(code) {\n    if (\n      code === null ||\n      code === 34 ||\n      code === 39 ||\n      code === 47 ||\n      code === 60 ||\n      code === 61 ||\n      code === 62 ||\n      code === 96 ||\n      markdownLineEndingOrSpace(code)\n    ) {\n      return completeAttributeNameAfter(code)\n    }\n    effects.consume(code)\n    return completeAttributeValueUnquoted\n  }\n\n  /**\n   * After double or single quoted attribute value, before whitespace or the\n   * end of the tag.\n   *\n   * ```markdown\n   * > | <a b=\"c\">\n   *            ^\n   * ```\n   *\n   * @type {State}\n   */\n  function completeAttributeValueQuotedAfter(code) {\n    if (code === 47 || code === 62 || markdownSpace(code)) {\n      return completeAttributeNameBefore(code)\n    }\n    return nok(code)\n  }\n\n  /**\n   * In certain circumstances of a complete tag where only an `>` is allowed.\n   *\n   * ```markdown\n   * > | <a b=\"c\">\n   *             ^\n   * ```\n   *\n   * @type {State}\n   */\n  function completeEnd(code) {\n    if (code === 62) {\n      effects.consume(code)\n      return completeAfter\n    }\n    return nok(code)\n  }\n\n  /**\n   * After `>` in a complete tag.\n   *\n   * ```markdown\n   * > | <x>\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function completeAfter(code) {\n    if (code === null || markdownLineEnding(code)) {\n      // // Do not form containers.\n      // tokenizer.concrete = true\n      return continuation(code)\n    }\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return completeAfter\n    }\n    return nok(code)\n  }\n\n  /**\n   * In continuation of any HTML kind.\n   *\n   * ```markdown\n   * > | <!--xxx-->\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function continuation(code) {\n    if (code === 45 && marker === 2) {\n      effects.consume(code)\n      return continuationCommentInside\n    }\n    if (code === 60 && marker === 1) {\n      effects.consume(code)\n      return continuationRawTagOpen\n    }\n    if (code === 62 && marker === 4) {\n      effects.consume(code)\n      return continuationClose\n    }\n    if (code === 63 && marker === 3) {\n      effects.consume(code)\n      return continuationDeclarationInside\n    }\n    if (code === 93 && marker === 5) {\n      effects.consume(code)\n      return continuationCdataInside\n    }\n    if (markdownLineEnding(code) && (marker === 6 || marker === 7)) {\n      effects.exit('htmlFlowData')\n      return effects.check(\n        blankLineBefore,\n        continuationAfter,\n        continuationStart\n      )(code)\n    }\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('htmlFlowData')\n      return continuationStart(code)\n    }\n    effects.consume(code)\n    return continuation\n  }\n\n  /**\n   * In continuation, at eol.\n   *\n   * ```markdown\n   * > | <x>\n   *        ^\n   *   | asd\n   * ```\n   *\n   * @type {State}\n   */\n  function continuationStart(code) {\n    return effects.check(\n      nonLazyContinuationStart,\n      continuationStartNonLazy,\n      continuationAfter\n    )(code)\n  }\n\n  /**\n   * In continuation, at eol, before non-lazy content.\n   *\n   * ```markdown\n   * > | <x>\n   *        ^\n   *   | asd\n   * ```\n   *\n   * @type {State}\n   */\n  function continuationStartNonLazy(code) {\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    return continuationBefore\n  }\n\n  /**\n   * In continuation, before non-lazy content.\n   *\n   * ```markdown\n   *   | <x>\n   * > | asd\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function continuationBefore(code) {\n    if (code === null || markdownLineEnding(code)) {\n      return continuationStart(code)\n    }\n    effects.enter('htmlFlowData')\n    return continuation(code)\n  }\n\n  /**\n   * In comment continuation, after one `-`, expecting another.\n   *\n   * ```markdown\n   * > | <!--xxx-->\n   *             ^\n   * ```\n   *\n   * @type {State}\n   */\n  function continuationCommentInside(code) {\n    if (code === 45) {\n      effects.consume(code)\n      return continuationDeclarationInside\n    }\n    return continuation(code)\n  }\n\n  /**\n   * In raw continuation, after `<`, at `/`.\n   *\n   * ```markdown\n   * > | <script>console.log(1)</script>\n   *                            ^\n   * ```\n   *\n   * @type {State}\n   */\n  function continuationRawTagOpen(code) {\n    if (code === 47) {\n      effects.consume(code)\n      buffer = ''\n      return continuationRawEndTag\n    }\n    return continuation(code)\n  }\n\n  /**\n   * In raw continuation, after `</`, in a raw tag name.\n   *\n   * ```markdown\n   * > | <script>console.log(1)</script>\n   *                             ^^^^^^\n   * ```\n   *\n   * @type {State}\n   */\n  function continuationRawEndTag(code) {\n    if (code === 62) {\n      const name = buffer.toLowerCase()\n      if (htmlRawNames.includes(name)) {\n        effects.consume(code)\n        return continuationClose\n      }\n      return continuation(code)\n    }\n    if (asciiAlpha(code) && buffer.length < 8) {\n      effects.consume(code)\n      // @ts-expect-error: not null.\n      buffer += String.fromCharCode(code)\n      return continuationRawEndTag\n    }\n    return continuation(code)\n  }\n\n  /**\n   * In cdata continuation, after `]`, expecting `]>`.\n   *\n   * ```markdown\n   * > | <![CDATA[>&<]]>\n   *                  ^\n   * ```\n   *\n   * @type {State}\n   */\n  function continuationCdataInside(code) {\n    if (code === 93) {\n      effects.consume(code)\n      return continuationDeclarationInside\n    }\n    return continuation(code)\n  }\n\n  /**\n   * In declaration or instruction continuation, at `>`.\n   *\n   * ```markdown\n   * > | <!-->\n   *         ^\n   * > | <?>\n   *       ^\n   * > | <!q>\n   *        ^\n   * > | <!--ab-->\n   *             ^\n   * > | <![CDATA[>&<]]>\n   *                   ^\n   * ```\n   *\n   * @type {State}\n   */\n  function continuationDeclarationInside(code) {\n    if (code === 62) {\n      effects.consume(code)\n      return continuationClose\n    }\n\n    // More dashes.\n    if (code === 45 && marker === 2) {\n      effects.consume(code)\n      return continuationDeclarationInside\n    }\n    return continuation(code)\n  }\n\n  /**\n   * In closed continuation: everything we get until the eol/eof is part of it.\n   *\n   * ```markdown\n   * > | <!doctype>\n   *               ^\n   * ```\n   *\n   * @type {State}\n   */\n  function continuationClose(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('htmlFlowData')\n      return continuationAfter(code)\n    }\n    effects.consume(code)\n    return continuationClose\n  }\n\n  /**\n   * Done.\n   *\n   * ```markdown\n   * > | <!doctype>\n   *               ^\n   * ```\n   *\n   * @type {State}\n   */\n  function continuationAfter(code) {\n    effects.exit('htmlFlow')\n    // // Feel free to interrupt.\n    // tokenizer.interrupt = false\n    // // No longer concrete.\n    // tokenizer.concrete = false\n    return ok(code)\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeNonLazyContinuationStart(effects, ok, nok) {\n  const self = this\n  return start\n\n  /**\n   * At eol, before continuation.\n   *\n   * ```markdown\n   * > | * ```js\n   *            ^\n   *   | b\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    if (markdownLineEnding(code)) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return after\n    }\n    return nok(code)\n  }\n\n  /**\n   * A continuation.\n   *\n   * ```markdown\n   *   | * ```js\n   * > | b\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function after(code) {\n    return self.parser.lazy[self.now().line] ? nok(code) : ok(code)\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeBlankLineBefore(effects, ok, nok) {\n  return start\n\n  /**\n   * Before eol, expecting blank line.\n   *\n   * ```markdown\n   * > | <div>\n   *          ^\n   *   |\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    return effects.attempt(blankLine, ok, nok)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n/** @type {Construct} */\nconst nonLazyContinuation = {\n  tokenize: tokenizeNonLazyContinuation,\n  partial: true\n}\n\n/** @type {Construct} */\nexport const codeFenced = {\n  name: 'codeFenced',\n  tokenize: tokenizeCodeFenced,\n  concrete: true\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeCodeFenced(effects, ok, nok) {\n  const self = this\n  /** @type {Construct} */\n  const closeStart = {\n    tokenize: tokenizeCloseStart,\n    partial: true\n  }\n  let initialPrefix = 0\n  let sizeOpen = 0\n  /** @type {NonNullable<Code>} */\n  let marker\n  return start\n\n  /**\n   * Start of code.\n   *\n   * ```markdown\n   * > | ~~~js\n   *     ^\n   *   | alert(1)\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    // To do: parse whitespace like `markdown-rs`.\n    return beforeSequenceOpen(code)\n  }\n\n  /**\n   * In opening fence, after prefix, at sequence.\n   *\n   * ```markdown\n   * > | ~~~js\n   *     ^\n   *   | alert(1)\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function beforeSequenceOpen(code) {\n    const tail = self.events[self.events.length - 1]\n    initialPrefix =\n      tail && tail[1].type === 'linePrefix'\n        ? tail[2].sliceSerialize(tail[1], true).length\n        : 0\n    marker = code\n    effects.enter('codeFenced')\n    effects.enter('codeFencedFence')\n    effects.enter('codeFencedFenceSequence')\n    return sequenceOpen(code)\n  }\n\n  /**\n   * In opening fence sequence.\n   *\n   * ```markdown\n   * > | ~~~js\n   *      ^\n   *   | alert(1)\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function sequenceOpen(code) {\n    if (code === marker) {\n      sizeOpen++\n      effects.consume(code)\n      return sequenceOpen\n    }\n    if (sizeOpen < 3) {\n      return nok(code)\n    }\n    effects.exit('codeFencedFenceSequence')\n    return markdownSpace(code)\n      ? factorySpace(effects, infoBefore, 'whitespace')(code)\n      : infoBefore(code)\n  }\n\n  /**\n   * In opening fence, after the sequence (and optional whitespace), before info.\n   *\n   * ```markdown\n   * > | ~~~js\n   *        ^\n   *   | alert(1)\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function infoBefore(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('codeFencedFence')\n      return self.interrupt\n        ? ok(code)\n        : effects.check(nonLazyContinuation, atNonLazyBreak, after)(code)\n    }\n    effects.enter('codeFencedFenceInfo')\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return info(code)\n  }\n\n  /**\n   * In info.\n   *\n   * ```markdown\n   * > | ~~~js\n   *        ^\n   *   | alert(1)\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function info(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('chunkString')\n      effects.exit('codeFencedFenceInfo')\n      return infoBefore(code)\n    }\n    if (markdownSpace(code)) {\n      effects.exit('chunkString')\n      effects.exit('codeFencedFenceInfo')\n      return factorySpace(effects, metaBefore, 'whitespace')(code)\n    }\n    if (code === 96 && code === marker) {\n      return nok(code)\n    }\n    effects.consume(code)\n    return info\n  }\n\n  /**\n   * In opening fence, after info and whitespace, before meta.\n   *\n   * ```markdown\n   * > | ~~~js eval\n   *           ^\n   *   | alert(1)\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function metaBefore(code) {\n    if (code === null || markdownLineEnding(code)) {\n      return infoBefore(code)\n    }\n    effects.enter('codeFencedFenceMeta')\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return meta(code)\n  }\n\n  /**\n   * In meta.\n   *\n   * ```markdown\n   * > | ~~~js eval\n   *           ^\n   *   | alert(1)\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function meta(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('chunkString')\n      effects.exit('codeFencedFenceMeta')\n      return infoBefore(code)\n    }\n    if (code === 96 && code === marker) {\n      return nok(code)\n    }\n    effects.consume(code)\n    return meta\n  }\n\n  /**\n   * At eol/eof in code, before a non-lazy closing fence or content.\n   *\n   * ```markdown\n   * > | ~~~js\n   *          ^\n   * > | alert(1)\n   *             ^\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function atNonLazyBreak(code) {\n    return effects.attempt(closeStart, after, contentBefore)(code)\n  }\n\n  /**\n   * Before code content, not a closing fence, at eol.\n   *\n   * ```markdown\n   *   | ~~~js\n   * > | alert(1)\n   *             ^\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function contentBefore(code) {\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    return contentStart\n  }\n\n  /**\n   * Before code content, not a closing fence.\n   *\n   * ```markdown\n   *   | ~~~js\n   * > | alert(1)\n   *     ^\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function contentStart(code) {\n    return initialPrefix > 0 && markdownSpace(code)\n      ? factorySpace(\n          effects,\n          beforeContentChunk,\n          'linePrefix',\n          initialPrefix + 1\n        )(code)\n      : beforeContentChunk(code)\n  }\n\n  /**\n   * Before code content, after optional prefix.\n   *\n   * ```markdown\n   *   | ~~~js\n   * > | alert(1)\n   *     ^\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function beforeContentChunk(code) {\n    if (code === null || markdownLineEnding(code)) {\n      return effects.check(nonLazyContinuation, atNonLazyBreak, after)(code)\n    }\n    effects.enter('codeFlowValue')\n    return contentChunk(code)\n  }\n\n  /**\n   * In code content.\n   *\n   * ```markdown\n   *   | ~~~js\n   * > | alert(1)\n   *     ^^^^^^^^\n   *   | ~~~\n   * ```\n   *\n   * @type {State}\n   */\n  function contentChunk(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('codeFlowValue')\n      return beforeContentChunk(code)\n    }\n    effects.consume(code)\n    return contentChunk\n  }\n\n  /**\n   * After code.\n   *\n   * ```markdown\n   *   | ~~~js\n   *   | alert(1)\n   * > | ~~~\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function after(code) {\n    effects.exit('codeFenced')\n    return ok(code)\n  }\n\n  /**\n   * @this {TokenizeContext}\n   * @type {Tokenizer}\n   */\n  function tokenizeCloseStart(effects, ok, nok) {\n    let size = 0\n    return startBefore\n\n    /**\n     *\n     *\n     * @type {State}\n     */\n    function startBefore(code) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return start\n    }\n\n    /**\n     * Before closing fence, at optional whitespace.\n     *\n     * ```markdown\n     *   | ~~~js\n     *   | alert(1)\n     * > | ~~~\n     *     ^\n     * ```\n     *\n     * @type {State}\n     */\n    function start(code) {\n      // Always populated by defaults.\n\n      // To do: `enter` here or in next state?\n      effects.enter('codeFencedFence')\n      return markdownSpace(code)\n        ? factorySpace(\n            effects,\n            beforeSequenceClose,\n            'linePrefix',\n            self.parser.constructs.disable.null.includes('codeIndented')\n              ? undefined\n              : 4\n          )(code)\n        : beforeSequenceClose(code)\n    }\n\n    /**\n     * In closing fence, after optional whitespace, at sequence.\n     *\n     * ```markdown\n     *   | ~~~js\n     *   | alert(1)\n     * > | ~~~\n     *     ^\n     * ```\n     *\n     * @type {State}\n     */\n    function beforeSequenceClose(code) {\n      if (code === marker) {\n        effects.enter('codeFencedFenceSequence')\n        return sequenceClose(code)\n      }\n      return nok(code)\n    }\n\n    /**\n     * In closing fence sequence.\n     *\n     * ```markdown\n     *   | ~~~js\n     *   | alert(1)\n     * > | ~~~\n     *     ^\n     * ```\n     *\n     * @type {State}\n     */\n    function sequenceClose(code) {\n      if (code === marker) {\n        size++\n        effects.consume(code)\n        return sequenceClose\n      }\n      if (size >= sizeOpen) {\n        effects.exit('codeFencedFenceSequence')\n        return markdownSpace(code)\n          ? factorySpace(effects, sequenceCloseAfter, 'whitespace')(code)\n          : sequenceCloseAfter(code)\n      }\n      return nok(code)\n    }\n\n    /**\n     * After closing fence sequence, after optional whitespace.\n     *\n     * ```markdown\n     *   | ~~~js\n     *   | alert(1)\n     * > | ~~~\n     *        ^\n     * ```\n     *\n     * @type {State}\n     */\n    function sequenceCloseAfter(code) {\n      if (code === null || markdownLineEnding(code)) {\n        effects.exit('codeFencedFence')\n        return ok(code)\n      }\n      return nok(code)\n    }\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeNonLazyContinuation(effects, ok, nok) {\n  const self = this\n  return start\n\n  /**\n   *\n   *\n   * @type {State}\n   */\n  function start(code) {\n    if (code === null) {\n      return nok(code)\n    }\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    return lineStart\n  }\n\n  /**\n   *\n   *\n   * @type {State}\n   */\n  function lineStart(code) {\n    return self.parser.lazy[self.now().line] ? nok(code) : ok(code)\n  }\n}\n","/// <reference lib=\"dom\" />\n\n/* eslint-env browser */\n\nconst element = document.createElement('i')\n\n/**\n * @param {string} value\n * @returns {string|false}\n */\nexport function decodeNamedCharacterReference(value) {\n  const characterReference = '&' + value + ';'\n  element.innerHTML = characterReference\n  const char = element.textContent\n\n  // Some named character references do not require the closing semicolon\n  // (`&not`, for instance), which leads to situations where parsing the assumed\n  // named reference of `&notit;` will result in the string `¬it;`.\n  // When we encounter a trailing semicolon after parsing, and the character\n  // reference to decode was not a semicolon (`&semi;`), we can assume that the\n  // matching was not complete.\n  // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n  // yield `null`.\n  if (char.charCodeAt(char.length - 1) === 59 /* `;` */ && value !== 'semi') {\n    return false\n  }\n\n  // If the decoded string is equal to the input, the character reference was\n  // not valid.\n  // @ts-expect-error: TypeScript is wrong that `textContent` on elements can\n  // yield `null`.\n  return char === characterReference ? false : char\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {decodeNamedCharacterReference} from 'decode-named-character-reference'\nimport {\n  asciiAlphanumeric,\n  asciiDigit,\n  asciiHexDigit\n} from 'micromark-util-character'\n/** @type {Construct} */\nexport const characterReference = {\n  name: 'characterReference',\n  tokenize: tokenizeCharacterReference\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeCharacterReference(effects, ok, nok) {\n  const self = this\n  let size = 0\n  /** @type {number} */\n  let max\n  /** @type {(code: Code) => boolean} */\n  let test\n  return start\n\n  /**\n   * Start of character reference.\n   *\n   * ```markdown\n   * > | a&amp;b\n   *      ^\n   * > | a&#123;b\n   *      ^\n   * > | a&#x9;b\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('characterReference')\n    effects.enter('characterReferenceMarker')\n    effects.consume(code)\n    effects.exit('characterReferenceMarker')\n    return open\n  }\n\n  /**\n   * After `&`, at `#` for numeric references or alphanumeric for named\n   * references.\n   *\n   * ```markdown\n   * > | a&amp;b\n   *       ^\n   * > | a&#123;b\n   *       ^\n   * > | a&#x9;b\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function open(code) {\n    if (code === 35) {\n      effects.enter('characterReferenceMarkerNumeric')\n      effects.consume(code)\n      effects.exit('characterReferenceMarkerNumeric')\n      return numeric\n    }\n    effects.enter('characterReferenceValue')\n    max = 31\n    test = asciiAlphanumeric\n    return value(code)\n  }\n\n  /**\n   * After `#`, at `x` for hexadecimals or digit for decimals.\n   *\n   * ```markdown\n   * > | a&#123;b\n   *        ^\n   * > | a&#x9;b\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function numeric(code) {\n    if (code === 88 || code === 120) {\n      effects.enter('characterReferenceMarkerHexadecimal')\n      effects.consume(code)\n      effects.exit('characterReferenceMarkerHexadecimal')\n      effects.enter('characterReferenceValue')\n      max = 6\n      test = asciiHexDigit\n      return value\n    }\n    effects.enter('characterReferenceValue')\n    max = 7\n    test = asciiDigit\n    return value(code)\n  }\n\n  /**\n   * After markers (`&#x`, `&#`, or `&`), in value, before `;`.\n   *\n   * The character reference kind defines what and how many characters are\n   * allowed.\n   *\n   * ```markdown\n   * > | a&amp;b\n   *       ^^^\n   * > | a&#123;b\n   *        ^^^\n   * > | a&#x9;b\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function value(code) {\n    if (code === 59 && size) {\n      const token = effects.exit('characterReferenceValue')\n      if (\n        test === asciiAlphanumeric &&\n        !decodeNamedCharacterReference(self.sliceSerialize(token))\n      ) {\n        return nok(code)\n      }\n\n      // To do: `markdown-rs` uses a different name:\n      // `CharacterReferenceMarkerSemi`.\n      effects.enter('characterReferenceMarker')\n      effects.consume(code)\n      effects.exit('characterReferenceMarker')\n      effects.exit('characterReference')\n      return ok\n    }\n    if (test(code) && size++ < max) {\n      effects.consume(code)\n      return value\n    }\n    return nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {asciiPunctuation} from 'micromark-util-character'\n/** @type {Construct} */\nexport const characterEscape = {\n  name: 'characterEscape',\n  tokenize: tokenizeCharacterEscape\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeCharacterEscape(effects, ok, nok) {\n  return start\n\n  /**\n   * Start of character escape.\n   *\n   * ```markdown\n   * > | a\\*b\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('characterEscape')\n    effects.enter('escapeMarker')\n    effects.consume(code)\n    effects.exit('escapeMarker')\n    return inside\n  }\n\n  /**\n   * After `\\`, at punctuation.\n   *\n   * ```markdown\n   * > | a\\*b\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function inside(code) {\n    // ASCII punctuation.\n    if (asciiPunctuation(code)) {\n      effects.enter('characterEscapeValue')\n      effects.consume(code)\n      effects.exit('characterEscapeValue')\n      effects.exit('characterEscape')\n      return ok\n    }\n    return nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n/** @type {Construct} */\nexport const lineEnding = {\n  name: 'lineEnding',\n  tokenize: tokenizeLineEnding\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeLineEnding(effects, ok) {\n  return start\n\n  /** @type {State} */\n  function start(code) {\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    return factorySpace(effects, ok, 'linePrefix')\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factoryDestination} from 'micromark-factory-destination'\nimport {factoryLabel} from 'micromark-factory-label'\nimport {factoryTitle} from 'micromark-factory-title'\nimport {factoryWhitespace} from 'micromark-factory-whitespace'\nimport {markdownLineEndingOrSpace} from 'micromark-util-character'\nimport {push, splice} from 'micromark-util-chunked'\nimport {normalizeIdentifier} from 'micromark-util-normalize-identifier'\nimport {resolveAll} from 'micromark-util-resolve-all'\n/** @type {Construct} */\nexport const labelEnd = {\n  name: 'labelEnd',\n  tokenize: tokenizeLabelEnd,\n  resolveTo: resolveToLabelEnd,\n  resolveAll: resolveAllLabelEnd\n}\n\n/** @type {Construct} */\nconst resourceConstruct = {\n  tokenize: tokenizeResource\n}\n/** @type {Construct} */\nconst referenceFullConstruct = {\n  tokenize: tokenizeReferenceFull\n}\n/** @type {Construct} */\nconst referenceCollapsedConstruct = {\n  tokenize: tokenizeReferenceCollapsed\n}\n\n/** @type {Resolver} */\nfunction resolveAllLabelEnd(events) {\n  let index = -1\n  while (++index < events.length) {\n    const token = events[index][1]\n    if (\n      token.type === 'labelImage' ||\n      token.type === 'labelLink' ||\n      token.type === 'labelEnd'\n    ) {\n      // Remove the marker.\n      events.splice(index + 1, token.type === 'labelImage' ? 4 : 2)\n      token.type = 'data'\n      index++\n    }\n  }\n  return events\n}\n\n/** @type {Resolver} */\nfunction resolveToLabelEnd(events, context) {\n  let index = events.length\n  let offset = 0\n  /** @type {Token} */\n  let token\n  /** @type {number | undefined} */\n  let open\n  /** @type {number | undefined} */\n  let close\n  /** @type {Array<Event>} */\n  let media\n\n  // Find an opening.\n  while (index--) {\n    token = events[index][1]\n    if (open) {\n      // If we see another link, or inactive link label, we’ve been here before.\n      if (\n        token.type === 'link' ||\n        (token.type === 'labelLink' && token._inactive)\n      ) {\n        break\n      }\n\n      // Mark other link openings as inactive, as we can’t have links in\n      // links.\n      if (events[index][0] === 'enter' && token.type === 'labelLink') {\n        token._inactive = true\n      }\n    } else if (close) {\n      if (\n        events[index][0] === 'enter' &&\n        (token.type === 'labelImage' || token.type === 'labelLink') &&\n        !token._balanced\n      ) {\n        open = index\n        if (token.type !== 'labelLink') {\n          offset = 2\n          break\n        }\n      }\n    } else if (token.type === 'labelEnd') {\n      close = index\n    }\n  }\n  const group = {\n    type: events[open][1].type === 'labelLink' ? 'link' : 'image',\n    start: Object.assign({}, events[open][1].start),\n    end: Object.assign({}, events[events.length - 1][1].end)\n  }\n  const label = {\n    type: 'label',\n    start: Object.assign({}, events[open][1].start),\n    end: Object.assign({}, events[close][1].end)\n  }\n  const text = {\n    type: 'labelText',\n    start: Object.assign({}, events[open + offset + 2][1].end),\n    end: Object.assign({}, events[close - 2][1].start)\n  }\n  media = [\n    ['enter', group, context],\n    ['enter', label, context]\n  ]\n\n  // Opening marker.\n  media = push(media, events.slice(open + 1, open + offset + 3))\n\n  // Text open.\n  media = push(media, [['enter', text, context]])\n\n  // Always populated by defaults.\n\n  // Between.\n  media = push(\n    media,\n    resolveAll(\n      context.parser.constructs.insideSpan.null,\n      events.slice(open + offset + 4, close - 3),\n      context\n    )\n  )\n\n  // Text close, marker close, label close.\n  media = push(media, [\n    ['exit', text, context],\n    events[close - 2],\n    events[close - 1],\n    ['exit', label, context]\n  ])\n\n  // Reference, resource, or so.\n  media = push(media, events.slice(close + 1))\n\n  // Media close.\n  media = push(media, [['exit', group, context]])\n  splice(events, open, events.length, media)\n  return events\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeLabelEnd(effects, ok, nok) {\n  const self = this\n  let index = self.events.length\n  /** @type {Token} */\n  let labelStart\n  /** @type {boolean} */\n  let defined\n\n  // Find an opening.\n  while (index--) {\n    if (\n      (self.events[index][1].type === 'labelImage' ||\n        self.events[index][1].type === 'labelLink') &&\n      !self.events[index][1]._balanced\n    ) {\n      labelStart = self.events[index][1]\n      break\n    }\n  }\n  return start\n\n  /**\n   * Start of label end.\n   *\n   * ```markdown\n   * > | [a](b) c\n   *       ^\n   * > | [a][b] c\n   *       ^\n   * > | [a][] b\n   *       ^\n   * > | [a] b\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    // If there is not an okay opening.\n    if (!labelStart) {\n      return nok(code)\n    }\n\n    // If the corresponding label (link) start is marked as inactive,\n    // it means we’d be wrapping a link, like this:\n    //\n    // ```markdown\n    // > | a [b [c](d) e](f) g.\n    //                  ^\n    // ```\n    //\n    // We can’t have that, so it’s just balanced brackets.\n    if (labelStart._inactive) {\n      return labelEndNok(code)\n    }\n    defined = self.parser.defined.includes(\n      normalizeIdentifier(\n        self.sliceSerialize({\n          start: labelStart.end,\n          end: self.now()\n        })\n      )\n    )\n    effects.enter('labelEnd')\n    effects.enter('labelMarker')\n    effects.consume(code)\n    effects.exit('labelMarker')\n    effects.exit('labelEnd')\n    return after\n  }\n\n  /**\n   * After `]`.\n   *\n   * ```markdown\n   * > | [a](b) c\n   *       ^\n   * > | [a][b] c\n   *       ^\n   * > | [a][] b\n   *       ^\n   * > | [a] b\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function after(code) {\n    // Note: `markdown-rs` also parses GFM footnotes here, which for us is in\n    // an extension.\n\n    // Resource (`[asd](fgh)`)?\n    if (code === 40) {\n      return effects.attempt(\n        resourceConstruct,\n        labelEndOk,\n        defined ? labelEndOk : labelEndNok\n      )(code)\n    }\n\n    // Full (`[asd][fgh]`) or collapsed (`[asd][]`) reference?\n    if (code === 91) {\n      return effects.attempt(\n        referenceFullConstruct,\n        labelEndOk,\n        defined ? referenceNotFull : labelEndNok\n      )(code)\n    }\n\n    // Shortcut (`[asd]`) reference?\n    return defined ? labelEndOk(code) : labelEndNok(code)\n  }\n\n  /**\n   * After `]`, at `[`, but not at a full reference.\n   *\n   * > 👉 **Note**: we only get here if the label is defined.\n   *\n   * ```markdown\n   * > | [a][] b\n   *        ^\n   * > | [a] b\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function referenceNotFull(code) {\n    return effects.attempt(\n      referenceCollapsedConstruct,\n      labelEndOk,\n      labelEndNok\n    )(code)\n  }\n\n  /**\n   * Done, we found something.\n   *\n   * ```markdown\n   * > | [a](b) c\n   *           ^\n   * > | [a][b] c\n   *           ^\n   * > | [a][] b\n   *          ^\n   * > | [a] b\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function labelEndOk(code) {\n    // Note: `markdown-rs` does a bunch of stuff here.\n    return ok(code)\n  }\n\n  /**\n   * Done, it’s nothing.\n   *\n   * There was an okay opening, but we didn’t match anything.\n   *\n   * ```markdown\n   * > | [a](b c\n   *        ^\n   * > | [a][b c\n   *        ^\n   * > | [a] b\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function labelEndNok(code) {\n    labelStart._balanced = true\n    return nok(code)\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeResource(effects, ok, nok) {\n  return resourceStart\n\n  /**\n   * At a resource.\n   *\n   * ```markdown\n   * > | [a](b) c\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function resourceStart(code) {\n    effects.enter('resource')\n    effects.enter('resourceMarker')\n    effects.consume(code)\n    effects.exit('resourceMarker')\n    return resourceBefore\n  }\n\n  /**\n   * In resource, after `(`, at optional whitespace.\n   *\n   * ```markdown\n   * > | [a](b) c\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function resourceBefore(code) {\n    return markdownLineEndingOrSpace(code)\n      ? factoryWhitespace(effects, resourceOpen)(code)\n      : resourceOpen(code)\n  }\n\n  /**\n   * In resource, after optional whitespace, at `)` or a destination.\n   *\n   * ```markdown\n   * > | [a](b) c\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function resourceOpen(code) {\n    if (code === 41) {\n      return resourceEnd(code)\n    }\n    return factoryDestination(\n      effects,\n      resourceDestinationAfter,\n      resourceDestinationMissing,\n      'resourceDestination',\n      'resourceDestinationLiteral',\n      'resourceDestinationLiteralMarker',\n      'resourceDestinationRaw',\n      'resourceDestinationString',\n      32\n    )(code)\n  }\n\n  /**\n   * In resource, after destination, at optional whitespace.\n   *\n   * ```markdown\n   * > | [a](b) c\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function resourceDestinationAfter(code) {\n    return markdownLineEndingOrSpace(code)\n      ? factoryWhitespace(effects, resourceBetween)(code)\n      : resourceEnd(code)\n  }\n\n  /**\n   * At invalid destination.\n   *\n   * ```markdown\n   * > | [a](<<) b\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function resourceDestinationMissing(code) {\n    return nok(code)\n  }\n\n  /**\n   * In resource, after destination and whitespace, at `(` or title.\n   *\n   * ```markdown\n   * > | [a](b ) c\n   *           ^\n   * ```\n   *\n   * @type {State}\n   */\n  function resourceBetween(code) {\n    if (code === 34 || code === 39 || code === 40) {\n      return factoryTitle(\n        effects,\n        resourceTitleAfter,\n        nok,\n        'resourceTitle',\n        'resourceTitleMarker',\n        'resourceTitleString'\n      )(code)\n    }\n    return resourceEnd(code)\n  }\n\n  /**\n   * In resource, after title, at optional whitespace.\n   *\n   * ```markdown\n   * > | [a](b \"c\") d\n   *              ^\n   * ```\n   *\n   * @type {State}\n   */\n  function resourceTitleAfter(code) {\n    return markdownLineEndingOrSpace(code)\n      ? factoryWhitespace(effects, resourceEnd)(code)\n      : resourceEnd(code)\n  }\n\n  /**\n   * In resource, at `)`.\n   *\n   * ```markdown\n   * > | [a](b) d\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function resourceEnd(code) {\n    if (code === 41) {\n      effects.enter('resourceMarker')\n      effects.consume(code)\n      effects.exit('resourceMarker')\n      effects.exit('resource')\n      return ok\n    }\n    return nok(code)\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeReferenceFull(effects, ok, nok) {\n  const self = this\n  return referenceFull\n\n  /**\n   * In a reference (full), at the `[`.\n   *\n   * ```markdown\n   * > | [a][b] d\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function referenceFull(code) {\n    return factoryLabel.call(\n      self,\n      effects,\n      referenceFullAfter,\n      referenceFullMissing,\n      'reference',\n      'referenceMarker',\n      'referenceString'\n    )(code)\n  }\n\n  /**\n   * In a reference (full), after `]`.\n   *\n   * ```markdown\n   * > | [a][b] d\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function referenceFullAfter(code) {\n    return self.parser.defined.includes(\n      normalizeIdentifier(\n        self.sliceSerialize(self.events[self.events.length - 1][1]).slice(1, -1)\n      )\n    )\n      ? ok(code)\n      : nok(code)\n  }\n\n  /**\n   * In reference (full) that was missing.\n   *\n   * ```markdown\n   * > | [a][b d\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function referenceFullMissing(code) {\n    return nok(code)\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeReferenceCollapsed(effects, ok, nok) {\n  return referenceCollapsedStart\n\n  /**\n   * In reference (collapsed), at `[`.\n   *\n   * > 👉 **Note**: we only get here if the label is defined.\n   *\n   * ```markdown\n   * > | [a][] d\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function referenceCollapsedStart(code) {\n    // We only attempt a collapsed label if there’s a `[`.\n\n    effects.enter('reference')\n    effects.enter('referenceMarker')\n    effects.consume(code)\n    effects.exit('referenceMarker')\n    return referenceCollapsedOpen\n  }\n\n  /**\n   * In reference (collapsed), at `]`.\n   *\n   * > 👉 **Note**: we only get here if the label is defined.\n   *\n   * ```markdown\n   * > | [a][] d\n   *         ^\n   * ```\n   *\n   *  @type {State}\n   */\n  function referenceCollapsedOpen(code) {\n    if (code === 93) {\n      effects.enter('referenceMarker')\n      effects.consume(code)\n      effects.exit('referenceMarker')\n      effects.exit('reference')\n      return ok\n    }\n    return nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {labelEnd} from './label-end.js'\n\n/** @type {Construct} */\nexport const labelStartImage = {\n  name: 'labelStartImage',\n  tokenize: tokenizeLabelStartImage,\n  resolveAll: labelEnd.resolveAll\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeLabelStartImage(effects, ok, nok) {\n  const self = this\n  return start\n\n  /**\n   * Start of label (image) start.\n   *\n   * ```markdown\n   * > | a ![b] c\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('labelImage')\n    effects.enter('labelImageMarker')\n    effects.consume(code)\n    effects.exit('labelImageMarker')\n    return open\n  }\n\n  /**\n   * After `!`, at `[`.\n   *\n   * ```markdown\n   * > | a ![b] c\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function open(code) {\n    if (code === 91) {\n      effects.enter('labelMarker')\n      effects.consume(code)\n      effects.exit('labelMarker')\n      effects.exit('labelImage')\n      return after\n    }\n    return nok(code)\n  }\n\n  /**\n   * After `![`.\n   *\n   * ```markdown\n   * > | a ![b] c\n   *         ^\n   * ```\n   *\n   * This is needed in because, when GFM footnotes are enabled, images never\n   * form when started with a `^`.\n   * Instead, links form:\n   *\n   * ```markdown\n   * ![^a](b)\n   *\n   * ![^a][b]\n   *\n   * [b]: c\n   * ```\n   *\n   * ```html\n   * <p>!<a href=\\\"b\\\">^a</a></p>\n   * <p>!<a href=\\\"c\\\">^a</a></p>\n   * ```\n   *\n   * @type {State}\n   */\n  function after(code) {\n    // To do: use a new field to do this, this is still needed for\n    // `micromark-extension-gfm-footnote`, but the `label-start-link`\n    // behavior isn’t.\n    // Hidden footnotes hook.\n    /* c8 ignore next 3 */\n    return code === 94 && '_hiddenFootnoteSupport' in self.parser.constructs\n      ? nok(code)\n      : ok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n */\n\nimport {\n  markdownLineEndingOrSpace,\n  unicodePunctuation,\n  unicodeWhitespace\n} from 'micromark-util-character'\n/**\n * Classify whether a code represents whitespace, punctuation, or something\n * else.\n *\n * Used for attention (emphasis, strong), whose sequences can open or close\n * based on the class of surrounding characters.\n *\n * > 👉 **Note**: eof (`null`) is seen as whitespace.\n *\n * @param {Code} code\n *   Code.\n * @returns {typeof constants.characterGroupWhitespace | typeof constants.characterGroupPunctuation | undefined}\n *   Group.\n */\nexport function classifyCharacter(code) {\n  if (\n    code === null ||\n    markdownLineEndingOrSpace(code) ||\n    unicodeWhitespace(code)\n  ) {\n    return 1\n  }\n  if (unicodePunctuation(code)) {\n    return 2\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Point} Point\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {push, splice} from 'micromark-util-chunked'\nimport {classifyCharacter} from 'micromark-util-classify-character'\nimport {resolveAll} from 'micromark-util-resolve-all'\n/** @type {Construct} */\nexport const attention = {\n  name: 'attention',\n  tokenize: tokenizeAttention,\n  resolveAll: resolveAllAttention\n}\n\n/**\n * Take all events and resolve attention to emphasis or strong.\n *\n * @type {Resolver}\n */\n// eslint-disable-next-line complexity\nfunction resolveAllAttention(events, context) {\n  let index = -1\n  /** @type {number} */\n  let open\n  /** @type {Token} */\n  let group\n  /** @type {Token} */\n  let text\n  /** @type {Token} */\n  let openingSequence\n  /** @type {Token} */\n  let closingSequence\n  /** @type {number} */\n  let use\n  /** @type {Array<Event>} */\n  let nextEvents\n  /** @type {number} */\n  let offset\n\n  // Walk through all events.\n  //\n  // Note: performance of this is fine on an mb of normal markdown, but it’s\n  // a bottleneck for malicious stuff.\n  while (++index < events.length) {\n    // Find a token that can close.\n    if (\n      events[index][0] === 'enter' &&\n      events[index][1].type === 'attentionSequence' &&\n      events[index][1]._close\n    ) {\n      open = index\n\n      // Now walk back to find an opener.\n      while (open--) {\n        // Find a token that can open the closer.\n        if (\n          events[open][0] === 'exit' &&\n          events[open][1].type === 'attentionSequence' &&\n          events[open][1]._open &&\n          // If the markers are the same:\n          context.sliceSerialize(events[open][1]).charCodeAt(0) ===\n            context.sliceSerialize(events[index][1]).charCodeAt(0)\n        ) {\n          // If the opening can close or the closing can open,\n          // and the close size *is not* a multiple of three,\n          // but the sum of the opening and closing size *is* multiple of three,\n          // then don’t match.\n          if (\n            (events[open][1]._close || events[index][1]._open) &&\n            (events[index][1].end.offset - events[index][1].start.offset) % 3 &&\n            !(\n              (events[open][1].end.offset -\n                events[open][1].start.offset +\n                events[index][1].end.offset -\n                events[index][1].start.offset) %\n              3\n            )\n          ) {\n            continue\n          }\n\n          // Number of markers to use from the sequence.\n          use =\n            events[open][1].end.offset - events[open][1].start.offset > 1 &&\n            events[index][1].end.offset - events[index][1].start.offset > 1\n              ? 2\n              : 1\n          const start = Object.assign({}, events[open][1].end)\n          const end = Object.assign({}, events[index][1].start)\n          movePoint(start, -use)\n          movePoint(end, use)\n          openingSequence = {\n            type: use > 1 ? 'strongSequence' : 'emphasisSequence',\n            start,\n            end: Object.assign({}, events[open][1].end)\n          }\n          closingSequence = {\n            type: use > 1 ? 'strongSequence' : 'emphasisSequence',\n            start: Object.assign({}, events[index][1].start),\n            end\n          }\n          text = {\n            type: use > 1 ? 'strongText' : 'emphasisText',\n            start: Object.assign({}, events[open][1].end),\n            end: Object.assign({}, events[index][1].start)\n          }\n          group = {\n            type: use > 1 ? 'strong' : 'emphasis',\n            start: Object.assign({}, openingSequence.start),\n            end: Object.assign({}, closingSequence.end)\n          }\n          events[open][1].end = Object.assign({}, openingSequence.start)\n          events[index][1].start = Object.assign({}, closingSequence.end)\n          nextEvents = []\n\n          // If there are more markers in the opening, add them before.\n          if (events[open][1].end.offset - events[open][1].start.offset) {\n            nextEvents = push(nextEvents, [\n              ['enter', events[open][1], context],\n              ['exit', events[open][1], context]\n            ])\n          }\n\n          // Opening.\n          nextEvents = push(nextEvents, [\n            ['enter', group, context],\n            ['enter', openingSequence, context],\n            ['exit', openingSequence, context],\n            ['enter', text, context]\n          ])\n\n          // Always populated by defaults.\n\n          // Between.\n          nextEvents = push(\n            nextEvents,\n            resolveAll(\n              context.parser.constructs.insideSpan.null,\n              events.slice(open + 1, index),\n              context\n            )\n          )\n\n          // Closing.\n          nextEvents = push(nextEvents, [\n            ['exit', text, context],\n            ['enter', closingSequence, context],\n            ['exit', closingSequence, context],\n            ['exit', group, context]\n          ])\n\n          // If there are more markers in the closing, add them after.\n          if (events[index][1].end.offset - events[index][1].start.offset) {\n            offset = 2\n            nextEvents = push(nextEvents, [\n              ['enter', events[index][1], context],\n              ['exit', events[index][1], context]\n            ])\n          } else {\n            offset = 0\n          }\n          splice(events, open - 1, index - open + 3, nextEvents)\n          index = open + nextEvents.length - offset - 2\n          break\n        }\n      }\n    }\n  }\n\n  // Remove remaining sequences.\n  index = -1\n  while (++index < events.length) {\n    if (events[index][1].type === 'attentionSequence') {\n      events[index][1].type = 'data'\n    }\n  }\n  return events\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeAttention(effects, ok) {\n  const attentionMarkers = this.parser.constructs.attentionMarkers.null\n  const previous = this.previous\n  const before = classifyCharacter(previous)\n\n  /** @type {NonNullable<Code>} */\n  let marker\n  return start\n\n  /**\n   * Before a sequence.\n   *\n   * ```markdown\n   * > | **\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    marker = code\n    effects.enter('attentionSequence')\n    return inside(code)\n  }\n\n  /**\n   * In a sequence.\n   *\n   * ```markdown\n   * > | **\n   *     ^^\n   * ```\n   *\n   * @type {State}\n   */\n  function inside(code) {\n    if (code === marker) {\n      effects.consume(code)\n      return inside\n    }\n    const token = effects.exit('attentionSequence')\n\n    // To do: next major: move this to resolver, just like `markdown-rs`.\n    const after = classifyCharacter(code)\n\n    // Always populated by defaults.\n\n    const open =\n      !after || (after === 2 && before) || attentionMarkers.includes(code)\n    const close =\n      !before || (before === 2 && after) || attentionMarkers.includes(previous)\n    token._open = Boolean(marker === 42 ? open : open && (before || !close))\n    token._close = Boolean(marker === 42 ? close : close && (after || !open))\n    return ok(code)\n  }\n}\n\n/**\n * Move a point a bit.\n *\n * Note: `move` only works inside lines! It’s not possible to move past other\n * chunks (replacement characters, tabs, or line endings).\n *\n * @param {Point} point\n * @param {number} offset\n * @returns {undefined}\n */\nfunction movePoint(point, offset) {\n  point.column += offset\n  point.offset += offset\n  point._bufferIndex += offset\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {\n  asciiAlpha,\n  asciiAlphanumeric,\n  asciiAtext,\n  asciiControl\n} from 'micromark-util-character'\n/** @type {Construct} */\nexport const autolink = {\n  name: 'autolink',\n  tokenize: tokenizeAutolink\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeAutolink(effects, ok, nok) {\n  let size = 0\n  return start\n\n  /**\n   * Start of an autolink.\n   *\n   * ```markdown\n   * > | a<https://example.com>b\n   *      ^\n   * > | a<user@example.com>b\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('autolink')\n    effects.enter('autolinkMarker')\n    effects.consume(code)\n    effects.exit('autolinkMarker')\n    effects.enter('autolinkProtocol')\n    return open\n  }\n\n  /**\n   * After `<`, at protocol or atext.\n   *\n   * ```markdown\n   * > | a<https://example.com>b\n   *       ^\n   * > | a<user@example.com>b\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function open(code) {\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      return schemeOrEmailAtext\n    }\n    return emailAtext(code)\n  }\n\n  /**\n   * At second byte of protocol or atext.\n   *\n   * ```markdown\n   * > | a<https://example.com>b\n   *        ^\n   * > | a<user@example.com>b\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function schemeOrEmailAtext(code) {\n    // ASCII alphanumeric and `+`, `-`, and `.`.\n    if (code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)) {\n      // Count the previous alphabetical from `open` too.\n      size = 1\n      return schemeInsideOrEmailAtext(code)\n    }\n    return emailAtext(code)\n  }\n\n  /**\n   * In ambiguous protocol or atext.\n   *\n   * ```markdown\n   * > | a<https://example.com>b\n   *        ^\n   * > | a<user@example.com>b\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function schemeInsideOrEmailAtext(code) {\n    if (code === 58) {\n      effects.consume(code)\n      size = 0\n      return urlInside\n    }\n\n    // ASCII alphanumeric and `+`, `-`, and `.`.\n    if (\n      (code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)) &&\n      size++ < 32\n    ) {\n      effects.consume(code)\n      return schemeInsideOrEmailAtext\n    }\n    size = 0\n    return emailAtext(code)\n  }\n\n  /**\n   * After protocol, in URL.\n   *\n   * ```markdown\n   * > | a<https://example.com>b\n   *             ^\n   * ```\n   *\n   * @type {State}\n   */\n  function urlInside(code) {\n    if (code === 62) {\n      effects.exit('autolinkProtocol')\n      effects.enter('autolinkMarker')\n      effects.consume(code)\n      effects.exit('autolinkMarker')\n      effects.exit('autolink')\n      return ok\n    }\n\n    // ASCII control, space, or `<`.\n    if (code === null || code === 32 || code === 60 || asciiControl(code)) {\n      return nok(code)\n    }\n    effects.consume(code)\n    return urlInside\n  }\n\n  /**\n   * In email atext.\n   *\n   * ```markdown\n   * > | a<user.name@example.com>b\n   *              ^\n   * ```\n   *\n   * @type {State}\n   */\n  function emailAtext(code) {\n    if (code === 64) {\n      effects.consume(code)\n      return emailAtSignOrDot\n    }\n    if (asciiAtext(code)) {\n      effects.consume(code)\n      return emailAtext\n    }\n    return nok(code)\n  }\n\n  /**\n   * In label, after at-sign or dot.\n   *\n   * ```markdown\n   * > | a<user.name@example.com>b\n   *                 ^       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function emailAtSignOrDot(code) {\n    return asciiAlphanumeric(code) ? emailLabel(code) : nok(code)\n  }\n\n  /**\n   * In label, where `.` and `>` are allowed.\n   *\n   * ```markdown\n   * > | a<user.name@example.com>b\n   *                   ^\n   * ```\n   *\n   * @type {State}\n   */\n  function emailLabel(code) {\n    if (code === 46) {\n      effects.consume(code)\n      size = 0\n      return emailAtSignOrDot\n    }\n    if (code === 62) {\n      // Exit, then change the token type.\n      effects.exit('autolinkProtocol').type = 'autolinkEmail'\n      effects.enter('autolinkMarker')\n      effects.consume(code)\n      effects.exit('autolinkMarker')\n      effects.exit('autolink')\n      return ok\n    }\n    return emailValue(code)\n  }\n\n  /**\n   * In label, where `.` and `>` are *not* allowed.\n   *\n   * Though, this is also used in `emailLabel` to parse other values.\n   *\n   * ```markdown\n   * > | a<user.name@ex-ample.com>b\n   *                    ^\n   * ```\n   *\n   * @type {State}\n   */\n  function emailValue(code) {\n    // ASCII alphanumeric or `-`.\n    if ((code === 45 || asciiAlphanumeric(code)) && size++ < 63) {\n      const next = code === 45 ? emailValue : emailLabel\n      effects.consume(code)\n      return next\n    }\n    return nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {factorySpace} from 'micromark-factory-space'\nimport {\n  asciiAlpha,\n  asciiAlphanumeric,\n  markdownLineEnding,\n  markdownLineEndingOrSpace,\n  markdownSpace\n} from 'micromark-util-character'\n/** @type {Construct} */\nexport const htmlText = {\n  name: 'htmlText',\n  tokenize: tokenizeHtmlText\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeHtmlText(effects, ok, nok) {\n  const self = this\n  /** @type {NonNullable<Code> | undefined} */\n  let marker\n  /** @type {number} */\n  let index\n  /** @type {State} */\n  let returnState\n  return start\n\n  /**\n   * Start of HTML (text).\n   *\n   * ```markdown\n   * > | a <b> c\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('htmlText')\n    effects.enter('htmlTextData')\n    effects.consume(code)\n    return open\n  }\n\n  /**\n   * After `<`, at tag name or other stuff.\n   *\n   * ```markdown\n   * > | a <b> c\n   *        ^\n   * > | a <!doctype> c\n   *        ^\n   * > | a <!--b--> c\n   *        ^\n   * ```\n   *\n   * @type {State}\n   */\n  function open(code) {\n    if (code === 33) {\n      effects.consume(code)\n      return declarationOpen\n    }\n    if (code === 47) {\n      effects.consume(code)\n      return tagCloseStart\n    }\n    if (code === 63) {\n      effects.consume(code)\n      return instruction\n    }\n\n    // ASCII alphabetical.\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      return tagOpen\n    }\n    return nok(code)\n  }\n\n  /**\n   * After `<!`, at declaration, comment, or CDATA.\n   *\n   * ```markdown\n   * > | a <!doctype> c\n   *         ^\n   * > | a <!--b--> c\n   *         ^\n   * > | a <![CDATA[>&<]]> c\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function declarationOpen(code) {\n    if (code === 45) {\n      effects.consume(code)\n      return commentOpenInside\n    }\n    if (code === 91) {\n      effects.consume(code)\n      index = 0\n      return cdataOpenInside\n    }\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      return declaration\n    }\n    return nok(code)\n  }\n\n  /**\n   * In a comment, after `<!-`, at another `-`.\n   *\n   * ```markdown\n   * > | a <!--b--> c\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function commentOpenInside(code) {\n    if (code === 45) {\n      effects.consume(code)\n      return commentEnd\n    }\n    return nok(code)\n  }\n\n  /**\n   * In comment.\n   *\n   * ```markdown\n   * > | a <!--b--> c\n   *           ^\n   * ```\n   *\n   * @type {State}\n   */\n  function comment(code) {\n    if (code === null) {\n      return nok(code)\n    }\n    if (code === 45) {\n      effects.consume(code)\n      return commentClose\n    }\n    if (markdownLineEnding(code)) {\n      returnState = comment\n      return lineEndingBefore(code)\n    }\n    effects.consume(code)\n    return comment\n  }\n\n  /**\n   * In comment, after `-`.\n   *\n   * ```markdown\n   * > | a <!--b--> c\n   *             ^\n   * ```\n   *\n   * @type {State}\n   */\n  function commentClose(code) {\n    if (code === 45) {\n      effects.consume(code)\n      return commentEnd\n    }\n    return comment(code)\n  }\n\n  /**\n   * In comment, after `--`.\n   *\n   * ```markdown\n   * > | a <!--b--> c\n   *              ^\n   * ```\n   *\n   * @type {State}\n   */\n  function commentEnd(code) {\n    return code === 62\n      ? end(code)\n      : code === 45\n      ? commentClose(code)\n      : comment(code)\n  }\n\n  /**\n   * After `<![`, in CDATA, expecting `CDATA[`.\n   *\n   * ```markdown\n   * > | a <![CDATA[>&<]]> b\n   *          ^^^^^^\n   * ```\n   *\n   * @type {State}\n   */\n  function cdataOpenInside(code) {\n    const value = 'CDATA['\n    if (code === value.charCodeAt(index++)) {\n      effects.consume(code)\n      return index === value.length ? cdata : cdataOpenInside\n    }\n    return nok(code)\n  }\n\n  /**\n   * In CDATA.\n   *\n   * ```markdown\n   * > | a <![CDATA[>&<]]> b\n   *                ^^^\n   * ```\n   *\n   * @type {State}\n   */\n  function cdata(code) {\n    if (code === null) {\n      return nok(code)\n    }\n    if (code === 93) {\n      effects.consume(code)\n      return cdataClose\n    }\n    if (markdownLineEnding(code)) {\n      returnState = cdata\n      return lineEndingBefore(code)\n    }\n    effects.consume(code)\n    return cdata\n  }\n\n  /**\n   * In CDATA, after `]`, at another `]`.\n   *\n   * ```markdown\n   * > | a <![CDATA[>&<]]> b\n   *                    ^\n   * ```\n   *\n   * @type {State}\n   */\n  function cdataClose(code) {\n    if (code === 93) {\n      effects.consume(code)\n      return cdataEnd\n    }\n    return cdata(code)\n  }\n\n  /**\n   * In CDATA, after `]]`, at `>`.\n   *\n   * ```markdown\n   * > | a <![CDATA[>&<]]> b\n   *                     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function cdataEnd(code) {\n    if (code === 62) {\n      return end(code)\n    }\n    if (code === 93) {\n      effects.consume(code)\n      return cdataEnd\n    }\n    return cdata(code)\n  }\n\n  /**\n   * In declaration.\n   *\n   * ```markdown\n   * > | a <!b> c\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function declaration(code) {\n    if (code === null || code === 62) {\n      return end(code)\n    }\n    if (markdownLineEnding(code)) {\n      returnState = declaration\n      return lineEndingBefore(code)\n    }\n    effects.consume(code)\n    return declaration\n  }\n\n  /**\n   * In instruction.\n   *\n   * ```markdown\n   * > | a <?b?> c\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function instruction(code) {\n    if (code === null) {\n      return nok(code)\n    }\n    if (code === 63) {\n      effects.consume(code)\n      return instructionClose\n    }\n    if (markdownLineEnding(code)) {\n      returnState = instruction\n      return lineEndingBefore(code)\n    }\n    effects.consume(code)\n    return instruction\n  }\n\n  /**\n   * In instruction, after `?`, at `>`.\n   *\n   * ```markdown\n   * > | a <?b?> c\n   *           ^\n   * ```\n   *\n   * @type {State}\n   */\n  function instructionClose(code) {\n    return code === 62 ? end(code) : instruction(code)\n  }\n\n  /**\n   * After `</`, in closing tag, at tag name.\n   *\n   * ```markdown\n   * > | a </b> c\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagCloseStart(code) {\n    // ASCII alphabetical.\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      return tagClose\n    }\n    return nok(code)\n  }\n\n  /**\n   * After `</x`, in a tag name.\n   *\n   * ```markdown\n   * > | a </b> c\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagClose(code) {\n    // ASCII alphanumerical and `-`.\n    if (code === 45 || asciiAlphanumeric(code)) {\n      effects.consume(code)\n      return tagClose\n    }\n    return tagCloseBetween(code)\n  }\n\n  /**\n   * In closing tag, after tag name.\n   *\n   * ```markdown\n   * > | a </b> c\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagCloseBetween(code) {\n    if (markdownLineEnding(code)) {\n      returnState = tagCloseBetween\n      return lineEndingBefore(code)\n    }\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return tagCloseBetween\n    }\n    return end(code)\n  }\n\n  /**\n   * After `<x`, in opening tag name.\n   *\n   * ```markdown\n   * > | a <b> c\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagOpen(code) {\n    // ASCII alphanumerical and `-`.\n    if (code === 45 || asciiAlphanumeric(code)) {\n      effects.consume(code)\n      return tagOpen\n    }\n    if (code === 47 || code === 62 || markdownLineEndingOrSpace(code)) {\n      return tagOpenBetween(code)\n    }\n    return nok(code)\n  }\n\n  /**\n   * In opening tag, after tag name.\n   *\n   * ```markdown\n   * > | a <b> c\n   *         ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagOpenBetween(code) {\n    if (code === 47) {\n      effects.consume(code)\n      return end\n    }\n\n    // ASCII alphabetical and `:` and `_`.\n    if (code === 58 || code === 95 || asciiAlpha(code)) {\n      effects.consume(code)\n      return tagOpenAttributeName\n    }\n    if (markdownLineEnding(code)) {\n      returnState = tagOpenBetween\n      return lineEndingBefore(code)\n    }\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return tagOpenBetween\n    }\n    return end(code)\n  }\n\n  /**\n   * In attribute name.\n   *\n   * ```markdown\n   * > | a <b c> d\n   *          ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagOpenAttributeName(code) {\n    // ASCII alphabetical and `-`, `.`, `:`, and `_`.\n    if (\n      code === 45 ||\n      code === 46 ||\n      code === 58 ||\n      code === 95 ||\n      asciiAlphanumeric(code)\n    ) {\n      effects.consume(code)\n      return tagOpenAttributeName\n    }\n    return tagOpenAttributeNameAfter(code)\n  }\n\n  /**\n   * After attribute name, before initializer, the end of the tag, or\n   * whitespace.\n   *\n   * ```markdown\n   * > | a <b c> d\n   *           ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagOpenAttributeNameAfter(code) {\n    if (code === 61) {\n      effects.consume(code)\n      return tagOpenAttributeValueBefore\n    }\n    if (markdownLineEnding(code)) {\n      returnState = tagOpenAttributeNameAfter\n      return lineEndingBefore(code)\n    }\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return tagOpenAttributeNameAfter\n    }\n    return tagOpenBetween(code)\n  }\n\n  /**\n   * Before unquoted, double quoted, or single quoted attribute value, allowing\n   * whitespace.\n   *\n   * ```markdown\n   * > | a <b c=d> e\n   *            ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagOpenAttributeValueBefore(code) {\n    if (\n      code === null ||\n      code === 60 ||\n      code === 61 ||\n      code === 62 ||\n      code === 96\n    ) {\n      return nok(code)\n    }\n    if (code === 34 || code === 39) {\n      effects.consume(code)\n      marker = code\n      return tagOpenAttributeValueQuoted\n    }\n    if (markdownLineEnding(code)) {\n      returnState = tagOpenAttributeValueBefore\n      return lineEndingBefore(code)\n    }\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return tagOpenAttributeValueBefore\n    }\n    effects.consume(code)\n    return tagOpenAttributeValueUnquoted\n  }\n\n  /**\n   * In double or single quoted attribute value.\n   *\n   * ```markdown\n   * > | a <b c=\"d\"> e\n   *             ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagOpenAttributeValueQuoted(code) {\n    if (code === marker) {\n      effects.consume(code)\n      marker = undefined\n      return tagOpenAttributeValueQuotedAfter\n    }\n    if (code === null) {\n      return nok(code)\n    }\n    if (markdownLineEnding(code)) {\n      returnState = tagOpenAttributeValueQuoted\n      return lineEndingBefore(code)\n    }\n    effects.consume(code)\n    return tagOpenAttributeValueQuoted\n  }\n\n  /**\n   * In unquoted attribute value.\n   *\n   * ```markdown\n   * > | a <b c=d> e\n   *            ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagOpenAttributeValueUnquoted(code) {\n    if (\n      code === null ||\n      code === 34 ||\n      code === 39 ||\n      code === 60 ||\n      code === 61 ||\n      code === 96\n    ) {\n      return nok(code)\n    }\n    if (code === 47 || code === 62 || markdownLineEndingOrSpace(code)) {\n      return tagOpenBetween(code)\n    }\n    effects.consume(code)\n    return tagOpenAttributeValueUnquoted\n  }\n\n  /**\n   * After double or single quoted attribute value, before whitespace or the end\n   * of the tag.\n   *\n   * ```markdown\n   * > | a <b c=\"d\"> e\n   *               ^\n   * ```\n   *\n   * @type {State}\n   */\n  function tagOpenAttributeValueQuotedAfter(code) {\n    if (code === 47 || code === 62 || markdownLineEndingOrSpace(code)) {\n      return tagOpenBetween(code)\n    }\n    return nok(code)\n  }\n\n  /**\n   * In certain circumstances of a tag where only an `>` is allowed.\n   *\n   * ```markdown\n   * > | a <b c=\"d\"> e\n   *               ^\n   * ```\n   *\n   * @type {State}\n   */\n  function end(code) {\n    if (code === 62) {\n      effects.consume(code)\n      effects.exit('htmlTextData')\n      effects.exit('htmlText')\n      return ok\n    }\n    return nok(code)\n  }\n\n  /**\n   * At eol.\n   *\n   * > 👉 **Note**: we can’t have blank lines in text, so no need to worry about\n   * > empty tokens.\n   *\n   * ```markdown\n   * > | a <!--a\n   *            ^\n   *   | b-->\n   * ```\n   *\n   * @type {State}\n   */\n  function lineEndingBefore(code) {\n    effects.exit('htmlTextData')\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    return lineEndingAfter\n  }\n\n  /**\n   * After eol, at optional whitespace.\n   *\n   * > 👉 **Note**: we can’t have blank lines in text, so no need to worry about\n   * > empty tokens.\n   *\n   * ```markdown\n   *   | a <!--a\n   * > | b-->\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function lineEndingAfter(code) {\n    // Always populated by defaults.\n\n    return markdownSpace(code)\n      ? factorySpace(\n          effects,\n          lineEndingAfterPrefix,\n          'linePrefix',\n          self.parser.constructs.disable.null.includes('codeIndented')\n            ? undefined\n            : 4\n        )(code)\n      : lineEndingAfterPrefix(code)\n  }\n\n  /**\n   * After eol, after optional whitespace.\n   *\n   * > 👉 **Note**: we can’t have blank lines in text, so no need to worry about\n   * > empty tokens.\n   *\n   * ```markdown\n   *   | a <!--a\n   * > | b-->\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function lineEndingAfterPrefix(code) {\n    effects.enter('htmlTextData')\n    return returnState(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {labelEnd} from './label-end.js'\n\n/** @type {Construct} */\nexport const labelStartLink = {\n  name: 'labelStartLink',\n  tokenize: tokenizeLabelStartLink,\n  resolveAll: labelEnd.resolveAll\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeLabelStartLink(effects, ok, nok) {\n  const self = this\n  return start\n\n  /**\n   * Start of label (link) start.\n   *\n   * ```markdown\n   * > | a [b] c\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('labelLink')\n    effects.enter('labelMarker')\n    effects.consume(code)\n    effects.exit('labelMarker')\n    effects.exit('labelLink')\n    return after\n  }\n\n  /** @type {State} */\n  function after(code) {\n    // To do: this isn’t needed in `micromark-extension-gfm-footnote`,\n    // remove.\n    // Hidden footnotes hook.\n    /* c8 ignore next 3 */\n    return code === 94 && '_hiddenFootnoteSupport' in self.parser.constructs\n      ? nok(code)\n      : ok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {markdownLineEnding} from 'micromark-util-character'\n/** @type {Construct} */\nexport const hardBreakEscape = {\n  name: 'hardBreakEscape',\n  tokenize: tokenizeHardBreakEscape\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeHardBreakEscape(effects, ok, nok) {\n  return start\n\n  /**\n   * Start of a hard break (escape).\n   *\n   * ```markdown\n   * > | a\\\n   *      ^\n   *   | b\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('hardBreakEscape')\n    effects.consume(code)\n    return after\n  }\n\n  /**\n   * After `\\`, at eol.\n   *\n   * ```markdown\n   * > | a\\\n   *       ^\n   *   | b\n   * ```\n   *\n   *  @type {State}\n   */\n  function after(code) {\n    if (markdownLineEnding(code)) {\n      effects.exit('hardBreakEscape')\n      return ok(code)\n    }\n    return nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Previous} Previous\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n */\n\nimport {markdownLineEnding} from 'micromark-util-character'\n/** @type {Construct} */\nexport const codeText = {\n  name: 'codeText',\n  tokenize: tokenizeCodeText,\n  resolve: resolveCodeText,\n  previous\n}\n\n// To do: next major: don’t resolve, like `markdown-rs`.\n/** @type {Resolver} */\nfunction resolveCodeText(events) {\n  let tailExitIndex = events.length - 4\n  let headEnterIndex = 3\n  /** @type {number} */\n  let index\n  /** @type {number | undefined} */\n  let enter\n\n  // If we start and end with an EOL or a space.\n  if (\n    (events[headEnterIndex][1].type === 'lineEnding' ||\n      events[headEnterIndex][1].type === 'space') &&\n    (events[tailExitIndex][1].type === 'lineEnding' ||\n      events[tailExitIndex][1].type === 'space')\n  ) {\n    index = headEnterIndex\n\n    // And we have data.\n    while (++index < tailExitIndex) {\n      if (events[index][1].type === 'codeTextData') {\n        // Then we have padding.\n        events[headEnterIndex][1].type = 'codeTextPadding'\n        events[tailExitIndex][1].type = 'codeTextPadding'\n        headEnterIndex += 2\n        tailExitIndex -= 2\n        break\n      }\n    }\n  }\n\n  // Merge adjacent spaces and data.\n  index = headEnterIndex - 1\n  tailExitIndex++\n  while (++index <= tailExitIndex) {\n    if (enter === undefined) {\n      if (index !== tailExitIndex && events[index][1].type !== 'lineEnding') {\n        enter = index\n      }\n    } else if (\n      index === tailExitIndex ||\n      events[index][1].type === 'lineEnding'\n    ) {\n      events[enter][1].type = 'codeTextData'\n      if (index !== enter + 2) {\n        events[enter][1].end = events[index - 1][1].end\n        events.splice(enter + 2, index - enter - 2)\n        tailExitIndex -= index - enter - 2\n        index = enter + 2\n      }\n      enter = undefined\n    }\n  }\n  return events\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Previous}\n */\nfunction previous(code) {\n  // If there is a previous code, there will always be a tail.\n  return (\n    code !== 96 ||\n    this.events[this.events.length - 1][1].type === 'characterEscape'\n  )\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeCodeText(effects, ok, nok) {\n  const self = this\n  let sizeOpen = 0\n  /** @type {number} */\n  let size\n  /** @type {Token} */\n  let token\n  return start\n\n  /**\n   * Start of code (text).\n   *\n   * ```markdown\n   * > | `a`\n   *     ^\n   * > | \\`a`\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('codeText')\n    effects.enter('codeTextSequence')\n    return sequenceOpen(code)\n  }\n\n  /**\n   * In opening sequence.\n   *\n   * ```markdown\n   * > | `a`\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function sequenceOpen(code) {\n    if (code === 96) {\n      effects.consume(code)\n      sizeOpen++\n      return sequenceOpen\n    }\n    effects.exit('codeTextSequence')\n    return between(code)\n  }\n\n  /**\n   * Between something and something else.\n   *\n   * ```markdown\n   * > | `a`\n   *      ^^\n   * ```\n   *\n   * @type {State}\n   */\n  function between(code) {\n    // EOF.\n    if (code === null) {\n      return nok(code)\n    }\n\n    // To do: next major: don’t do spaces in resolve, but when compiling,\n    // like `markdown-rs`.\n    // Tabs don’t work, and virtual spaces don’t make sense.\n    if (code === 32) {\n      effects.enter('space')\n      effects.consume(code)\n      effects.exit('space')\n      return between\n    }\n\n    // Closing fence? Could also be data.\n    if (code === 96) {\n      token = effects.enter('codeTextSequence')\n      size = 0\n      return sequenceClose(code)\n    }\n    if (markdownLineEnding(code)) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return between\n    }\n\n    // Data.\n    effects.enter('codeTextData')\n    return data(code)\n  }\n\n  /**\n   * In data.\n   *\n   * ```markdown\n   * > | `a`\n   *      ^\n   * ```\n   *\n   * @type {State}\n   */\n  function data(code) {\n    if (\n      code === null ||\n      code === 32 ||\n      code === 96 ||\n      markdownLineEnding(code)\n    ) {\n      effects.exit('codeTextData')\n      return between(code)\n    }\n    effects.consume(code)\n    return data\n  }\n\n  /**\n   * In closing sequence.\n   *\n   * ```markdown\n   * > | `a`\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function sequenceClose(code) {\n    // More.\n    if (code === 96) {\n      effects.consume(code)\n      size++\n      return sequenceClose\n    }\n\n    // Done!\n    if (size === sizeOpen) {\n      effects.exit('codeTextSequence')\n      effects.exit('codeText')\n      return ok(code)\n    }\n\n    // More or less accents: mark as data.\n    token.type = 'codeTextData'\n    return data(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Extension} Extension\n */\n\nimport {\n  attention,\n  autolink,\n  blockQuote,\n  characterEscape,\n  characterReference,\n  codeFenced,\n  codeIndented,\n  codeText,\n  definition,\n  hardBreakEscape,\n  headingAtx,\n  htmlFlow,\n  htmlText,\n  labelEnd,\n  labelStartImage,\n  labelStartLink,\n  lineEnding,\n  list,\n  setextUnderline,\n  thematicBreak\n} from 'micromark-core-commonmark'\nimport {resolver as resolveText} from './initialize/text.js'\n\n/** @satisfies {Extension['document']} */\nexport const document = {\n  [42]: list,\n  [43]: list,\n  [45]: list,\n  [48]: list,\n  [49]: list,\n  [50]: list,\n  [51]: list,\n  [52]: list,\n  [53]: list,\n  [54]: list,\n  [55]: list,\n  [56]: list,\n  [57]: list,\n  [62]: blockQuote\n}\n\n/** @satisfies {Extension['contentInitial']} */\nexport const contentInitial = {\n  [91]: definition\n}\n\n/** @satisfies {Extension['flowInitial']} */\nexport const flowInitial = {\n  [-2]: codeIndented,\n  [-1]: codeIndented,\n  [32]: codeIndented\n}\n\n/** @satisfies {Extension['flow']} */\nexport const flow = {\n  [35]: headingAtx,\n  [42]: thematicBreak,\n  [45]: [setextUnderline, thematicBreak],\n  [60]: htmlFlow,\n  [61]: setextUnderline,\n  [95]: thematicBreak,\n  [96]: codeFenced,\n  [126]: codeFenced\n}\n\n/** @satisfies {Extension['string']} */\nexport const string = {\n  [38]: characterReference,\n  [92]: characterEscape\n}\n\n/** @satisfies {Extension['text']} */\nexport const text = {\n  [-5]: lineEnding,\n  [-4]: lineEnding,\n  [-3]: lineEnding,\n  [33]: labelStartImage,\n  [38]: characterReference,\n  [42]: attention,\n  [60]: [autolink, htmlText],\n  [91]: labelStartLink,\n  [92]: [hardBreakEscape, characterEscape],\n  [93]: labelEnd,\n  [95]: attention,\n  [96]: codeText\n}\n\n/** @satisfies {Extension['insideSpan']} */\nexport const insideSpan = {\n  null: [attention, resolveText]\n}\n\n/** @satisfies {Extension['attentionMarkers']} */\nexport const attentionMarkers = {\n  null: [42, 95]\n}\n\n/** @satisfies {Extension['disable']} */\nexport const disable = {\n  null: []\n}\n","/**\n * @typedef {import('micromark-util-types').Create} Create\n * @typedef {import('micromark-util-types').FullNormalizedExtension} FullNormalizedExtension\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').ParseContext} ParseContext\n * @typedef {import('micromark-util-types').ParseOptions} ParseOptions\n */\n\nimport {combineExtensions} from 'micromark-util-combine-extensions'\nimport {content} from './initialize/content.js'\nimport {document} from './initialize/document.js'\nimport {flow} from './initialize/flow.js'\nimport {string, text} from './initialize/text.js'\nimport {createTokenizer} from './create-tokenizer.js'\nimport * as defaultConstructs from './constructs.js'\n\n/**\n * @param {ParseOptions | null | undefined} [options]\n * @returns {ParseContext}\n */\nexport function parse(options) {\n  const settings = options || {}\n  const constructs =\n    /** @type {FullNormalizedExtension} */\n    combineExtensions([defaultConstructs, ...(settings.extensions || [])])\n\n  /** @type {ParseContext} */\n  const parser = {\n    defined: [],\n    lazy: {},\n    constructs,\n    content: create(content),\n    document: create(document),\n    flow: create(flow),\n    string: create(string),\n    text: create(text)\n  }\n  return parser\n\n  /**\n   * @param {InitialConstruct} initial\n   */\n  function create(initial) {\n    return creator\n    /** @type {Create} */\n    function creator(from) {\n      return createTokenizer(parser, initial, from)\n    }\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Chunk} Chunk\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Encoding} Encoding\n * @typedef {import('micromark-util-types').Value} Value\n */\n\n/**\n * @callback Preprocessor\n * @param {Value} value\n * @param {Encoding | null | undefined} [encoding]\n * @param {boolean | null | undefined} [end=false]\n * @returns {Array<Chunk>}\n */\n\nconst search = /[\\0\\t\\n\\r]/g\n\n/**\n * @returns {Preprocessor}\n */\nexport function preprocess() {\n  let column = 1\n  let buffer = ''\n  /** @type {boolean | undefined} */\n  let start = true\n  /** @type {boolean | undefined} */\n  let atCarriageReturn\n  return preprocessor\n\n  /** @type {Preprocessor} */\n  // eslint-disable-next-line complexity\n  function preprocessor(value, encoding, end) {\n    /** @type {Array<Chunk>} */\n    const chunks = []\n    /** @type {RegExpMatchArray | null} */\n    let match\n    /** @type {number} */\n    let next\n    /** @type {number} */\n    let startPosition\n    /** @type {number} */\n    let endPosition\n    /** @type {Code} */\n    let code\n    value =\n      buffer +\n      (typeof value === 'string'\n        ? value.toString()\n        : new TextDecoder(encoding || undefined).decode(value))\n    startPosition = 0\n    buffer = ''\n    if (start) {\n      // To do: `markdown-rs` actually parses BOMs (byte order mark).\n      if (value.charCodeAt(0) === 65279) {\n        startPosition++\n      }\n      start = undefined\n    }\n    while (startPosition < value.length) {\n      search.lastIndex = startPosition\n      match = search.exec(value)\n      endPosition =\n        match && match.index !== undefined ? match.index : value.length\n      code = value.charCodeAt(endPosition)\n      if (!match) {\n        buffer = value.slice(startPosition)\n        break\n      }\n      if (code === 10 && startPosition === endPosition && atCarriageReturn) {\n        chunks.push(-3)\n        atCarriageReturn = undefined\n      } else {\n        if (atCarriageReturn) {\n          chunks.push(-5)\n          atCarriageReturn = undefined\n        }\n        if (startPosition < endPosition) {\n          chunks.push(value.slice(startPosition, endPosition))\n          column += endPosition - startPosition\n        }\n        switch (code) {\n          case 0: {\n            chunks.push(65533)\n            column++\n            break\n          }\n          case 9: {\n            next = Math.ceil(column / 4) * 4\n            chunks.push(-2)\n            while (column++ < next) chunks.push(-1)\n            break\n          }\n          case 10: {\n            chunks.push(-4)\n            column = 1\n            break\n          }\n          default: {\n            atCarriageReturn = true\n            column = 1\n          }\n        }\n      }\n      startPosition = endPosition + 1\n    }\n    if (end) {\n      if (atCarriageReturn) chunks.push(-5)\n      if (buffer) chunks.push(buffer)\n      chunks.push(null)\n    }\n    return chunks\n  }\n}\n","/**\n * Turn the number (in string form as either hexa- or plain decimal) coming from\n * a numeric character reference into a character.\n *\n * Sort of like `String.fromCodePoint(Number.parseInt(value, base))`, but makes\n * non-characters and control characters safe.\n *\n * @param {string} value\n *   Value to decode.\n * @param {number} base\n *   Numeric base.\n * @returns {string}\n *   Character.\n */\nexport function decodeNumericCharacterReference(value, base) {\n  const code = Number.parseInt(value, base);\n  if (\n  // C0 except for HT, LF, FF, CR, space.\n  code < 9 || code === 11 || code > 13 && code < 32 ||\n  // Control character (DEL) of C0, and C1 controls.\n  code > 126 && code < 160 ||\n  // Lone high surrogates and low surrogates.\n  code > 55_295 && code < 57_344 ||\n  // Noncharacters.\n  code > 64_975 && code < 65_008 || /* eslint-disable no-bitwise */\n  (code & 65_535) === 65_535 || (code & 65_535) === 65_534 || /* eslint-enable no-bitwise */\n  // Out of range\n  code > 1_114_111) {\n    return \"\\uFFFD\";\n  }\n  return String.fromCodePoint(code);\n}","import {decodeNamedCharacterReference} from 'decode-named-character-reference'\nimport {decodeNumericCharacterReference} from 'micromark-util-decode-numeric-character-reference'\nconst characterEscapeOrReference =\n  /\\\\([!-/:-@[-`{-~])|&(#(?:\\d{1,7}|x[\\da-f]{1,6})|[\\da-z]{1,31});/gi\n\n/**\n * Decode markdown strings (which occur in places such as fenced code info\n * strings, destinations, labels, and titles).\n *\n * The “string” content type allows character escapes and -references.\n * This decodes those.\n *\n * @param {string} value\n *   Value to decode.\n * @returns {string}\n *   Decoded value.\n */\nexport function decodeString(value) {\n  return value.replace(characterEscapeOrReference, decode)\n}\n\n/**\n * @param {string} $0\n * @param {string} $1\n * @param {string} $2\n * @returns {string}\n */\nfunction decode($0, $1, $2) {\n  if ($1) {\n    // Escape.\n    return $1\n  }\n\n  // Reference.\n  const head = $2.charCodeAt(0)\n  if (head === 35) {\n    const head = $2.charCodeAt(1)\n    const hex = head === 120 || head === 88\n    return decodeNumericCharacterReference($2.slice(hex ? 2 : 1), hex ? 16 : 10)\n  }\n  return decodeNamedCharacterReference($2) || $0\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Point} Point\n * @typedef {import('unist').Position} Position\n */\n\n/**\n * @typedef NodeLike\n * @property {string} type\n * @property {PositionLike | null | undefined} [position]\n *\n * @typedef PointLike\n * @property {number | null | undefined} [line]\n * @property {number | null | undefined} [column]\n * @property {number | null | undefined} [offset]\n *\n * @typedef PositionLike\n * @property {PointLike | null | undefined} [start]\n * @property {PointLike | null | undefined} [end]\n */\n\n/**\n * Serialize the positional info of a point, position (start and end points),\n * or node.\n *\n * @param {Node | NodeLike | Point | PointLike | Position | PositionLike | null | undefined} [value]\n *   Node, position, or point.\n * @returns {string}\n *   Pretty printed positional info of a node (`string`).\n *\n *   In the format of a range `ls:cs-le:ce` (when given `node` or `position`)\n *   or a point `l:c` (when given `point`), where `l` stands for line, `c` for\n *   column, `s` for `start`, and `e` for end.\n *   An empty string (`''`) is returned if the given value is neither `node`,\n *   `position`, nor `point`.\n */\nexport function stringifyPosition(value) {\n  // Nothing.\n  if (!value || typeof value !== 'object') {\n    return ''\n  }\n\n  // Node.\n  if ('position' in value || 'type' in value) {\n    return position(value.position)\n  }\n\n  // Position.\n  if ('start' in value || 'end' in value) {\n    return position(value)\n  }\n\n  // Point.\n  if ('line' in value || 'column' in value) {\n    return point(value)\n  }\n\n  // ?\n  return ''\n}\n\n/**\n * @param {Point | PointLike | null | undefined} point\n * @returns {string}\n */\nfunction point(point) {\n  return index(point && point.line) + ':' + index(point && point.column)\n}\n\n/**\n * @param {Position | PositionLike | null | undefined} pos\n * @returns {string}\n */\nfunction position(pos) {\n  return point(pos && pos.start) + '-' + point(pos && pos.end)\n}\n\n/**\n * @param {number | null | undefined} value\n * @returns {number}\n */\nfunction index(value) {\n  return value && typeof value === 'number' ? value : 1\n}\n","/**\n * @typedef {import('mdast').Break} Break\n * @typedef {import('mdast').Blockquote} Blockquote\n * @typedef {import('mdast').Code} Code\n * @typedef {import('mdast').Definition} Definition\n * @typedef {import('mdast').Emphasis} Emphasis\n * @typedef {import('mdast').Heading} Heading\n * @typedef {import('mdast').Html} Html\n * @typedef {import('mdast').Image} Image\n * @typedef {import('mdast').InlineCode} InlineCode\n * @typedef {import('mdast').Link} Link\n * @typedef {import('mdast').List} List\n * @typedef {import('mdast').ListItem} ListItem\n * @typedef {import('mdast').Nodes} Nodes\n * @typedef {import('mdast').Paragraph} Paragraph\n * @typedef {import('mdast').Parent} Parent\n * @typedef {import('mdast').PhrasingContent} PhrasingContent\n * @typedef {import('mdast').ReferenceType} ReferenceType\n * @typedef {import('mdast').Root} Root\n * @typedef {import('mdast').Strong} Strong\n * @typedef {import('mdast').Text} Text\n * @typedef {import('mdast').ThematicBreak} ThematicBreak\n *\n * @typedef {import('micromark-util-types').Encoding} Encoding\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').ParseOptions} ParseOptions\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Value} Value\n *\n * @typedef {import('unist').Point} Point\n *\n * @typedef {import('../index.js').CompileData} CompileData\n */\n\n/**\n * @typedef {Omit<Parent, 'children' | 'type'> & {type: 'fragment', children: Array<PhrasingContent>}} Fragment\n */\n\n/**\n * @callback Transform\n *   Extra transform, to change the AST afterwards.\n * @param {Root} tree\n *   Tree to transform.\n * @returns {Root | null | undefined | void}\n *   New tree or nothing (in which case the current tree is used).\n *\n * @callback Handle\n *   Handle a token.\n * @param {CompileContext} this\n *   Context.\n * @param {Token} token\n *   Current token.\n * @returns {undefined | void}\n *   Nothing.\n *\n * @typedef {Record<string, Handle>} Handles\n *   Token types mapping to handles\n *\n * @callback OnEnterError\n *   Handle the case where the `right` token is open, but it is closed (by the\n *   `left` token) or because we reached the end of the document.\n * @param {Omit<CompileContext, 'sliceSerialize'>} this\n *   Context.\n * @param {Token | undefined} left\n *   Left token.\n * @param {Token} right\n *   Right token.\n * @returns {undefined}\n *   Nothing.\n *\n * @callback OnExitError\n *   Handle the case where the `right` token is open but it is closed by\n *   exiting the `left` token.\n * @param {Omit<CompileContext, 'sliceSerialize'>} this\n *   Context.\n * @param {Token} left\n *   Left token.\n * @param {Token} right\n *   Right token.\n * @returns {undefined}\n *   Nothing.\n *\n * @typedef {[Token, OnEnterError | undefined]} TokenTuple\n *   Open token on the stack, with an optional error handler for when\n *   that token isn’t closed properly.\n */\n\n/**\n * @typedef Config\n *   Configuration.\n *\n *   We have our defaults, but extensions will add more.\n * @property {Array<string>} canContainEols\n *   Token types where line endings are used.\n * @property {Handles} enter\n *   Opening handles.\n * @property {Handles} exit\n *   Closing handles.\n * @property {Array<Transform>} transforms\n *   Tree transforms.\n *\n * @typedef {Partial<Config>} Extension\n *   Change how markdown tokens from micromark are turned into mdast.\n *\n * @typedef CompileContext\n *   mdast compiler context.\n * @property {Array<Fragment | Nodes>} stack\n *   Stack of nodes.\n * @property {Array<TokenTuple>} tokenStack\n *   Stack of tokens.\n * @property {(this: CompileContext) => undefined} buffer\n *   Capture some of the output data.\n * @property {(this: CompileContext) => string} resume\n *   Stop capturing and access the output data.\n * @property {(this: CompileContext, node: Nodes, token: Token, onError?: OnEnterError) => undefined} enter\n *   Enter a node.\n * @property {(this: CompileContext, token: Token, onError?: OnExitError) => undefined} exit\n *   Exit a node.\n * @property {TokenizeContext['sliceSerialize']} sliceSerialize\n *   Get the string value of a token.\n * @property {Config} config\n *   Configuration.\n * @property {CompileData} data\n *   Info passed around; key/value store.\n *\n * @typedef FromMarkdownOptions\n *   Configuration for how to build mdast.\n * @property {Array<Extension | Array<Extension>> | null | undefined} [mdastExtensions]\n *   Extensions for this utility to change how tokens are turned into a tree.\n *\n * @typedef {ParseOptions & FromMarkdownOptions} Options\n *   Configuration.\n */\n\nimport {toString} from 'mdast-util-to-string'\nimport {parse, postprocess, preprocess} from 'micromark'\nimport {decodeNumericCharacterReference} from 'micromark-util-decode-numeric-character-reference'\nimport {decodeString} from 'micromark-util-decode-string'\nimport {normalizeIdentifier} from 'micromark-util-normalize-identifier'\nimport {decodeNamedCharacterReference} from 'decode-named-character-reference'\nimport {stringifyPosition} from 'unist-util-stringify-position'\nconst own = {}.hasOwnProperty\n\n/**\n * Turn markdown into a syntax tree.\n *\n * @overload\n * @param {Value} value\n * @param {Encoding | null | undefined} [encoding]\n * @param {Options | null | undefined} [options]\n * @returns {Root}\n *\n * @overload\n * @param {Value} value\n * @param {Options | null | undefined} [options]\n * @returns {Root}\n *\n * @param {Value} value\n *   Markdown to parse.\n * @param {Encoding | Options | null | undefined} [encoding]\n *   Character encoding for when `value` is `Buffer`.\n * @param {Options | null | undefined} [options]\n *   Configuration.\n * @returns {Root}\n *   mdast tree.\n */\nexport function fromMarkdown(value, encoding, options) {\n  if (typeof encoding !== 'string') {\n    options = encoding\n    encoding = undefined\n  }\n  return compiler(options)(\n    postprocess(\n      parse(options).document().write(preprocess()(value, encoding, true))\n    )\n  )\n}\n\n/**\n * Note this compiler only understand complete buffering, not streaming.\n *\n * @param {Options | null | undefined} [options]\n */\nfunction compiler(options) {\n  /** @type {Config} */\n  const config = {\n    transforms: [],\n    canContainEols: ['emphasis', 'fragment', 'heading', 'paragraph', 'strong'],\n    enter: {\n      autolink: opener(link),\n      autolinkProtocol: onenterdata,\n      autolinkEmail: onenterdata,\n      atxHeading: opener(heading),\n      blockQuote: opener(blockQuote),\n      characterEscape: onenterdata,\n      characterReference: onenterdata,\n      codeFenced: opener(codeFlow),\n      codeFencedFenceInfo: buffer,\n      codeFencedFenceMeta: buffer,\n      codeIndented: opener(codeFlow, buffer),\n      codeText: opener(codeText, buffer),\n      codeTextData: onenterdata,\n      data: onenterdata,\n      codeFlowValue: onenterdata,\n      definition: opener(definition),\n      definitionDestinationString: buffer,\n      definitionLabelString: buffer,\n      definitionTitleString: buffer,\n      emphasis: opener(emphasis),\n      hardBreakEscape: opener(hardBreak),\n      hardBreakTrailing: opener(hardBreak),\n      htmlFlow: opener(html, buffer),\n      htmlFlowData: onenterdata,\n      htmlText: opener(html, buffer),\n      htmlTextData: onenterdata,\n      image: opener(image),\n      label: buffer,\n      link: opener(link),\n      listItem: opener(listItem),\n      listItemValue: onenterlistitemvalue,\n      listOrdered: opener(list, onenterlistordered),\n      listUnordered: opener(list),\n      paragraph: opener(paragraph),\n      reference: onenterreference,\n      referenceString: buffer,\n      resourceDestinationString: buffer,\n      resourceTitleString: buffer,\n      setextHeading: opener(heading),\n      strong: opener(strong),\n      thematicBreak: opener(thematicBreak)\n    },\n    exit: {\n      atxHeading: closer(),\n      atxHeadingSequence: onexitatxheadingsequence,\n      autolink: closer(),\n      autolinkEmail: onexitautolinkemail,\n      autolinkProtocol: onexitautolinkprotocol,\n      blockQuote: closer(),\n      characterEscapeValue: onexitdata,\n      characterReferenceMarkerHexadecimal: onexitcharacterreferencemarker,\n      characterReferenceMarkerNumeric: onexitcharacterreferencemarker,\n      characterReferenceValue: onexitcharacterreferencevalue,\n      codeFenced: closer(onexitcodefenced),\n      codeFencedFence: onexitcodefencedfence,\n      codeFencedFenceInfo: onexitcodefencedfenceinfo,\n      codeFencedFenceMeta: onexitcodefencedfencemeta,\n      codeFlowValue: onexitdata,\n      codeIndented: closer(onexitcodeindented),\n      codeText: closer(onexitcodetext),\n      codeTextData: onexitdata,\n      data: onexitdata,\n      definition: closer(),\n      definitionDestinationString: onexitdefinitiondestinationstring,\n      definitionLabelString: onexitdefinitionlabelstring,\n      definitionTitleString: onexitdefinitiontitlestring,\n      emphasis: closer(),\n      hardBreakEscape: closer(onexithardbreak),\n      hardBreakTrailing: closer(onexithardbreak),\n      htmlFlow: closer(onexithtmlflow),\n      htmlFlowData: onexitdata,\n      htmlText: closer(onexithtmltext),\n      htmlTextData: onexitdata,\n      image: closer(onexitimage),\n      label: onexitlabel,\n      labelText: onexitlabeltext,\n      lineEnding: onexitlineending,\n      link: closer(onexitlink),\n      listItem: closer(),\n      listOrdered: closer(),\n      listUnordered: closer(),\n      paragraph: closer(),\n      referenceString: onexitreferencestring,\n      resourceDestinationString: onexitresourcedestinationstring,\n      resourceTitleString: onexitresourcetitlestring,\n      resource: onexitresource,\n      setextHeading: closer(onexitsetextheading),\n      setextHeadingLineSequence: onexitsetextheadinglinesequence,\n      setextHeadingText: onexitsetextheadingtext,\n      strong: closer(),\n      thematicBreak: closer()\n    }\n  }\n  configure(config, (options || {}).mdastExtensions || [])\n\n  /** @type {CompileData} */\n  const data = {}\n  return compile\n\n  /**\n   * Turn micromark events into an mdast tree.\n   *\n   * @param {Array<Event>} events\n   *   Events.\n   * @returns {Root}\n   *   mdast tree.\n   */\n  function compile(events) {\n    /** @type {Root} */\n    let tree = {\n      type: 'root',\n      children: []\n    }\n    /** @type {Omit<CompileContext, 'sliceSerialize'>} */\n    const context = {\n      stack: [tree],\n      tokenStack: [],\n      config,\n      enter,\n      exit,\n      buffer,\n      resume,\n      data\n    }\n    /** @type {Array<number>} */\n    const listStack = []\n    let index = -1\n    while (++index < events.length) {\n      // We preprocess lists to add `listItem` tokens, and to infer whether\n      // items the list itself are spread out.\n      if (\n        events[index][1].type === 'listOrdered' ||\n        events[index][1].type === 'listUnordered'\n      ) {\n        if (events[index][0] === 'enter') {\n          listStack.push(index)\n        } else {\n          const tail = listStack.pop()\n          index = prepareList(events, tail, index)\n        }\n      }\n    }\n    index = -1\n    while (++index < events.length) {\n      const handler = config[events[index][0]]\n      if (own.call(handler, events[index][1].type)) {\n        handler[events[index][1].type].call(\n          Object.assign(\n            {\n              sliceSerialize: events[index][2].sliceSerialize\n            },\n            context\n          ),\n          events[index][1]\n        )\n      }\n    }\n\n    // Handle tokens still being open.\n    if (context.tokenStack.length > 0) {\n      const tail = context.tokenStack[context.tokenStack.length - 1]\n      const handler = tail[1] || defaultOnError\n      handler.call(context, undefined, tail[0])\n    }\n\n    // Figure out `root` position.\n    tree.position = {\n      start: point(\n        events.length > 0\n          ? events[0][1].start\n          : {\n              line: 1,\n              column: 1,\n              offset: 0\n            }\n      ),\n      end: point(\n        events.length > 0\n          ? events[events.length - 2][1].end\n          : {\n              line: 1,\n              column: 1,\n              offset: 0\n            }\n      )\n    }\n\n    // Call transforms.\n    index = -1\n    while (++index < config.transforms.length) {\n      tree = config.transforms[index](tree) || tree\n    }\n    return tree\n  }\n\n  /**\n   * @param {Array<Event>} events\n   * @param {number} start\n   * @param {number} length\n   * @returns {number}\n   */\n  function prepareList(events, start, length) {\n    let index = start - 1\n    let containerBalance = -1\n    let listSpread = false\n    /** @type {Token | undefined} */\n    let listItem\n    /** @type {number | undefined} */\n    let lineIndex\n    /** @type {number | undefined} */\n    let firstBlankLineIndex\n    /** @type {boolean | undefined} */\n    let atMarker\n    while (++index <= length) {\n      const event = events[index]\n      switch (event[1].type) {\n        case 'listUnordered':\n        case 'listOrdered':\n        case 'blockQuote': {\n          if (event[0] === 'enter') {\n            containerBalance++\n          } else {\n            containerBalance--\n          }\n          atMarker = undefined\n          break\n        }\n        case 'lineEndingBlank': {\n          if (event[0] === 'enter') {\n            if (\n              listItem &&\n              !atMarker &&\n              !containerBalance &&\n              !firstBlankLineIndex\n            ) {\n              firstBlankLineIndex = index\n            }\n            atMarker = undefined\n          }\n          break\n        }\n        case 'linePrefix':\n        case 'listItemValue':\n        case 'listItemMarker':\n        case 'listItemPrefix':\n        case 'listItemPrefixWhitespace': {\n          // Empty.\n\n          break\n        }\n        default: {\n          atMarker = undefined\n        }\n      }\n      if (\n        (!containerBalance &&\n          event[0] === 'enter' &&\n          event[1].type === 'listItemPrefix') ||\n        (containerBalance === -1 &&\n          event[0] === 'exit' &&\n          (event[1].type === 'listUnordered' ||\n            event[1].type === 'listOrdered'))\n      ) {\n        if (listItem) {\n          let tailIndex = index\n          lineIndex = undefined\n          while (tailIndex--) {\n            const tailEvent = events[tailIndex]\n            if (\n              tailEvent[1].type === 'lineEnding' ||\n              tailEvent[1].type === 'lineEndingBlank'\n            ) {\n              if (tailEvent[0] === 'exit') continue\n              if (lineIndex) {\n                events[lineIndex][1].type = 'lineEndingBlank'\n                listSpread = true\n              }\n              tailEvent[1].type = 'lineEnding'\n              lineIndex = tailIndex\n            } else if (\n              tailEvent[1].type === 'linePrefix' ||\n              tailEvent[1].type === 'blockQuotePrefix' ||\n              tailEvent[1].type === 'blockQuotePrefixWhitespace' ||\n              tailEvent[1].type === 'blockQuoteMarker' ||\n              tailEvent[1].type === 'listItemIndent'\n            ) {\n              // Empty\n            } else {\n              break\n            }\n          }\n          if (\n            firstBlankLineIndex &&\n            (!lineIndex || firstBlankLineIndex < lineIndex)\n          ) {\n            listItem._spread = true\n          }\n\n          // Fix position.\n          listItem.end = Object.assign(\n            {},\n            lineIndex ? events[lineIndex][1].start : event[1].end\n          )\n          events.splice(lineIndex || index, 0, ['exit', listItem, event[2]])\n          index++\n          length++\n        }\n\n        // Create a new list item.\n        if (event[1].type === 'listItemPrefix') {\n          /** @type {Token} */\n          const item = {\n            type: 'listItem',\n            _spread: false,\n            start: Object.assign({}, event[1].start),\n            // @ts-expect-error: we’ll add `end` in a second.\n            end: undefined\n          }\n          listItem = item\n          events.splice(index, 0, ['enter', item, event[2]])\n          index++\n          length++\n          firstBlankLineIndex = undefined\n          atMarker = true\n        }\n      }\n    }\n    events[start][1]._spread = listSpread\n    return length\n  }\n\n  /**\n   * Create an opener handle.\n   *\n   * @param {(token: Token) => Nodes} create\n   *   Create a node.\n   * @param {Handle | undefined} [and]\n   *   Optional function to also run.\n   * @returns {Handle}\n   *   Handle.\n   */\n  function opener(create, and) {\n    return open\n\n    /**\n     * @this {CompileContext}\n     * @param {Token} token\n     * @returns {undefined}\n     */\n    function open(token) {\n      enter.call(this, create(token), token)\n      if (and) and.call(this, token)\n    }\n  }\n\n  /**\n   * @this {CompileContext}\n   * @returns {undefined}\n   */\n  function buffer() {\n    this.stack.push({\n      type: 'fragment',\n      children: []\n    })\n  }\n\n  /**\n   * @this {CompileContext}\n   *   Context.\n   * @param {Nodes} node\n   *   Node to enter.\n   * @param {Token} token\n   *   Corresponding token.\n   * @param {OnEnterError | undefined} [errorHandler]\n   *   Handle the case where this token is open, but it is closed by something else.\n   * @returns {undefined}\n   *   Nothing.\n   */\n  function enter(node, token, errorHandler) {\n    const parent = this.stack[this.stack.length - 1]\n    /** @type {Array<Nodes>} */\n    const siblings = parent.children\n    siblings.push(node)\n    this.stack.push(node)\n    this.tokenStack.push([token, errorHandler])\n    node.position = {\n      start: point(token.start),\n      // @ts-expect-error: `end` will be patched later.\n      end: undefined\n    }\n  }\n\n  /**\n   * Create a closer handle.\n   *\n   * @param {Handle | undefined} [and]\n   *   Optional function to also run.\n   * @returns {Handle}\n   *   Handle.\n   */\n  function closer(and) {\n    return close\n\n    /**\n     * @this {CompileContext}\n     * @param {Token} token\n     * @returns {undefined}\n     */\n    function close(token) {\n      if (and) and.call(this, token)\n      exit.call(this, token)\n    }\n  }\n\n  /**\n   * @this {CompileContext}\n   *   Context.\n   * @param {Token} token\n   *   Corresponding token.\n   * @param {OnExitError | undefined} [onExitError]\n   *   Handle the case where another token is open.\n   * @returns {undefined}\n   *   Nothing.\n   */\n  function exit(token, onExitError) {\n    const node = this.stack.pop()\n    const open = this.tokenStack.pop()\n    if (!open) {\n      throw new Error(\n        'Cannot close `' +\n          token.type +\n          '` (' +\n          stringifyPosition({\n            start: token.start,\n            end: token.end\n          }) +\n          '): it’s not open'\n      )\n    } else if (open[0].type !== token.type) {\n      if (onExitError) {\n        onExitError.call(this, token, open[0])\n      } else {\n        const handler = open[1] || defaultOnError\n        handler.call(this, token, open[0])\n      }\n    }\n    node.position.end = point(token.end)\n  }\n\n  /**\n   * @this {CompileContext}\n   * @returns {string}\n   */\n  function resume() {\n    return toString(this.stack.pop())\n  }\n\n  //\n  // Handlers.\n  //\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onenterlistordered() {\n    this.data.expectingFirstListItemValue = true\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onenterlistitemvalue(token) {\n    if (this.data.expectingFirstListItemValue) {\n      const ancestor = this.stack[this.stack.length - 2]\n      ancestor.start = Number.parseInt(this.sliceSerialize(token), 10)\n      this.data.expectingFirstListItemValue = undefined\n    }\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitcodefencedfenceinfo() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.lang = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitcodefencedfencemeta() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.meta = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitcodefencedfence() {\n    // Exit if this is the closing fence.\n    if (this.data.flowCodeInside) return\n    this.buffer()\n    this.data.flowCodeInside = true\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitcodefenced() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.value = data.replace(/^(\\r?\\n|\\r)|(\\r?\\n|\\r)$/g, '')\n    this.data.flowCodeInside = undefined\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitcodeindented() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.value = data.replace(/(\\r?\\n|\\r)$/g, '')\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitdefinitionlabelstring(token) {\n    const label = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.label = label\n    node.identifier = normalizeIdentifier(\n      this.sliceSerialize(token)\n    ).toLowerCase()\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitdefinitiontitlestring() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.title = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitdefinitiondestinationstring() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.url = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitatxheadingsequence(token) {\n    const node = this.stack[this.stack.length - 1]\n    if (!node.depth) {\n      const depth = this.sliceSerialize(token).length\n      node.depth = depth\n    }\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitsetextheadingtext() {\n    this.data.setextHeadingSlurpLineEnding = true\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitsetextheadinglinesequence(token) {\n    const node = this.stack[this.stack.length - 1]\n    node.depth = this.sliceSerialize(token).codePointAt(0) === 61 ? 1 : 2\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitsetextheading() {\n    this.data.setextHeadingSlurpLineEnding = undefined\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onenterdata(token) {\n    const node = this.stack[this.stack.length - 1]\n    /** @type {Array<Nodes>} */\n    const siblings = node.children\n    let tail = siblings[siblings.length - 1]\n    if (!tail || tail.type !== 'text') {\n      // Add a new text node.\n      tail = text()\n      tail.position = {\n        start: point(token.start),\n        // @ts-expect-error: we’ll add `end` later.\n        end: undefined\n      }\n      siblings.push(tail)\n    }\n    this.stack.push(tail)\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitdata(token) {\n    const tail = this.stack.pop()\n    tail.value += this.sliceSerialize(token)\n    tail.position.end = point(token.end)\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitlineending(token) {\n    const context = this.stack[this.stack.length - 1]\n    // If we’re at a hard break, include the line ending in there.\n    if (this.data.atHardBreak) {\n      const tail = context.children[context.children.length - 1]\n      tail.position.end = point(token.end)\n      this.data.atHardBreak = undefined\n      return\n    }\n    if (\n      !this.data.setextHeadingSlurpLineEnding &&\n      config.canContainEols.includes(context.type)\n    ) {\n      onenterdata.call(this, token)\n      onexitdata.call(this, token)\n    }\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexithardbreak() {\n    this.data.atHardBreak = true\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexithtmlflow() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.value = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexithtmltext() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.value = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitcodetext() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.value = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitlink() {\n    const node = this.stack[this.stack.length - 1]\n    // Note: there are also `identifier` and `label` fields on this link node!\n    // These are used / cleaned here.\n    // To do: clean.\n    if (this.data.inReference) {\n      /** @type {ReferenceType} */\n      const referenceType = this.data.referenceType || 'shortcut'\n      node.type += 'Reference'\n      // @ts-expect-error: mutate.\n      node.referenceType = referenceType\n      // @ts-expect-error: mutate.\n      delete node.url\n      delete node.title\n    } else {\n      // @ts-expect-error: mutate.\n      delete node.identifier\n      // @ts-expect-error: mutate.\n      delete node.label\n    }\n    this.data.referenceType = undefined\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitimage() {\n    const node = this.stack[this.stack.length - 1]\n    // Note: there are also `identifier` and `label` fields on this link node!\n    // These are used / cleaned here.\n    // To do: clean.\n    if (this.data.inReference) {\n      /** @type {ReferenceType} */\n      const referenceType = this.data.referenceType || 'shortcut'\n      node.type += 'Reference'\n      // @ts-expect-error: mutate.\n      node.referenceType = referenceType\n      // @ts-expect-error: mutate.\n      delete node.url\n      delete node.title\n    } else {\n      // @ts-expect-error: mutate.\n      delete node.identifier\n      // @ts-expect-error: mutate.\n      delete node.label\n    }\n    this.data.referenceType = undefined\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitlabeltext(token) {\n    const string = this.sliceSerialize(token)\n    const ancestor = this.stack[this.stack.length - 2]\n    // @ts-expect-error: stash this on the node, as it might become a reference\n    // later.\n    ancestor.label = decodeString(string)\n    // @ts-expect-error: same as above.\n    ancestor.identifier = normalizeIdentifier(string).toLowerCase()\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitlabel() {\n    const fragment = this.stack[this.stack.length - 1]\n    const value = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    // Assume a reference.\n    this.data.inReference = true\n    if (node.type === 'link') {\n      /** @type {Array<PhrasingContent>} */\n      const children = fragment.children\n      node.children = children\n    } else {\n      node.alt = value\n    }\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitresourcedestinationstring() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.url = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitresourcetitlestring() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    node.title = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitresource() {\n    this.data.inReference = undefined\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onenterreference() {\n    this.data.referenceType = 'collapsed'\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitreferencestring(token) {\n    const label = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    // @ts-expect-error: stash this on the node, as it might become a reference\n    // later.\n    node.label = label\n    // @ts-expect-error: same as above.\n    node.identifier = normalizeIdentifier(\n      this.sliceSerialize(token)\n    ).toLowerCase()\n    this.data.referenceType = 'full'\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitcharacterreferencemarker(token) {\n    this.data.characterReferenceType = token.type\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitcharacterreferencevalue(token) {\n    const data = this.sliceSerialize(token)\n    const type = this.data.characterReferenceType\n    /** @type {string} */\n    let value\n    if (type) {\n      value = decodeNumericCharacterReference(\n        data,\n        type === 'characterReferenceMarkerNumeric' ? 10 : 16\n      )\n      this.data.characterReferenceType = undefined\n    } else {\n      const result = decodeNamedCharacterReference(data)\n      value = result\n    }\n    const tail = this.stack.pop()\n    tail.value += value\n    tail.position.end = point(token.end)\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitautolinkprotocol(token) {\n    onexitdata.call(this, token)\n    const node = this.stack[this.stack.length - 1]\n    node.url = this.sliceSerialize(token)\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitautolinkemail(token) {\n    onexitdata.call(this, token)\n    const node = this.stack[this.stack.length - 1]\n    node.url = 'mailto:' + this.sliceSerialize(token)\n  }\n\n  //\n  // Creaters.\n  //\n\n  /** @returns {Blockquote} */\n  function blockQuote() {\n    return {\n      type: 'blockquote',\n      children: []\n    }\n  }\n\n  /** @returns {Code} */\n  function codeFlow() {\n    return {\n      type: 'code',\n      lang: null,\n      meta: null,\n      value: ''\n    }\n  }\n\n  /** @returns {InlineCode} */\n  function codeText() {\n    return {\n      type: 'inlineCode',\n      value: ''\n    }\n  }\n\n  /** @returns {Definition} */\n  function definition() {\n    return {\n      type: 'definition',\n      identifier: '',\n      label: null,\n      title: null,\n      url: ''\n    }\n  }\n\n  /** @returns {Emphasis} */\n  function emphasis() {\n    return {\n      type: 'emphasis',\n      children: []\n    }\n  }\n\n  /** @returns {Heading} */\n  function heading() {\n    return {\n      type: 'heading',\n      // @ts-expect-error `depth` will be set later.\n      depth: 0,\n      children: []\n    }\n  }\n\n  /** @returns {Break} */\n  function hardBreak() {\n    return {\n      type: 'break'\n    }\n  }\n\n  /** @returns {Html} */\n  function html() {\n    return {\n      type: 'html',\n      value: ''\n    }\n  }\n\n  /** @returns {Image} */\n  function image() {\n    return {\n      type: 'image',\n      title: null,\n      url: '',\n      alt: null\n    }\n  }\n\n  /** @returns {Link} */\n  function link() {\n    return {\n      type: 'link',\n      title: null,\n      url: '',\n      children: []\n    }\n  }\n\n  /**\n   * @param {Token} token\n   * @returns {List}\n   */\n  function list(token) {\n    return {\n      type: 'list',\n      ordered: token.type === 'listOrdered',\n      start: null,\n      spread: token._spread,\n      children: []\n    }\n  }\n\n  /**\n   * @param {Token} token\n   * @returns {ListItem}\n   */\n  function listItem(token) {\n    return {\n      type: 'listItem',\n      spread: token._spread,\n      checked: null,\n      children: []\n    }\n  }\n\n  /** @returns {Paragraph} */\n  function paragraph() {\n    return {\n      type: 'paragraph',\n      children: []\n    }\n  }\n\n  /** @returns {Strong} */\n  function strong() {\n    return {\n      type: 'strong',\n      children: []\n    }\n  }\n\n  /** @returns {Text} */\n  function text() {\n    return {\n      type: 'text',\n      value: ''\n    }\n  }\n\n  /** @returns {ThematicBreak} */\n  function thematicBreak() {\n    return {\n      type: 'thematicBreak'\n    }\n  }\n}\n\n/**\n * Copy a point-like value.\n *\n * @param {Point} d\n *   Point-like value.\n * @returns {Point}\n *   unist point.\n */\nfunction point(d) {\n  return {\n    line: d.line,\n    column: d.column,\n    offset: d.offset\n  }\n}\n\n/**\n * @param {Config} combined\n * @param {Array<Array<Extension> | Extension>} extensions\n * @returns {undefined}\n */\nfunction configure(combined, extensions) {\n  let index = -1\n  while (++index < extensions.length) {\n    const value = extensions[index]\n    if (Array.isArray(value)) {\n      configure(combined, value)\n    } else {\n      extension(combined, value)\n    }\n  }\n}\n\n/**\n * @param {Config} combined\n * @param {Extension} extension\n * @returns {undefined}\n */\nfunction extension(combined, extension) {\n  /** @type {keyof Extension} */\n  let key\n  for (key in extension) {\n    if (own.call(extension, key)) {\n      switch (key) {\n        case 'canContainEols': {\n          const right = extension[key]\n          if (right) {\n            combined[key].push(...right)\n          }\n          break\n        }\n        case 'transforms': {\n          const right = extension[key]\n          if (right) {\n            combined[key].push(...right)\n          }\n          break\n        }\n        case 'enter':\n        case 'exit': {\n          const right = extension[key]\n          if (right) {\n            Object.assign(combined[key], right)\n          }\n          break\n        }\n        // No default\n      }\n    }\n  }\n}\n\n/** @type {OnEnterError} */\nfunction defaultOnError(left, right) {\n  if (left) {\n    throw new Error(\n      'Cannot close `' +\n        left.type +\n        '` (' +\n        stringifyPosition({\n          start: left.start,\n          end: left.end\n        }) +\n        '): a different token (`' +\n        right.type +\n        '`, ' +\n        stringifyPosition({\n          start: right.start,\n          end: right.end\n        }) +\n        ') is open'\n    )\n  } else {\n    throw new Error(\n      'Cannot close document, a token (`' +\n        right.type +\n        '`, ' +\n        stringifyPosition({\n          start: right.start,\n          end: right.end\n        }) +\n        ') is still open'\n    )\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Event} Event\n */\n\nimport {subtokenize} from 'micromark-util-subtokenize'\n\n/**\n * @param {Array<Event>} events\n * @returns {Array<Event>}\n */\nexport function postprocess(events) {\n  while (!subtokenize(events)) {\n    // Empty\n  }\n  return events\n}\n","/**\n * @typedef {import('mdast').Root} Root\n * @typedef {import('mdast-util-from-markdown').Options} FromMarkdownOptions\n * @typedef {import('unified').Parser<Root>} Parser\n * @typedef {import('unified').Processor<Root>} Processor\n */\n\n/**\n * @typedef {Omit<FromMarkdownOptions, 'extensions' | 'mdastExtensions'>} Options\n */\n\nimport {fromMarkdown} from 'mdast-util-from-markdown'\n\n/**\n * Aadd support for parsing from markdown.\n *\n * @param {Readonly<Options> | null | undefined} [options]\n *   Configuration (optional).\n * @returns {undefined}\n *   Nothing.\n */\nexport default function remarkParse(options) {\n  /** @type {Processor} */\n  // @ts-expect-error: TS in JSDoc generates wrong types if `this` is typed regularly.\n  const self = this\n\n  self.parser = parser\n\n  /**\n   * @type {Parser}\n   */\n  function parser(doc) {\n    return fromMarkdown(doc, {\n      ...self.data('settings'),\n      ...options,\n      // Note: these options are not in the readme.\n      // The goal is for them to be set by plugins on `data` instead of being\n      // passed by users.\n      extensions: self.data('micromarkExtensions') || [],\n      mdastExtensions: self.data('fromMarkdownExtensions') || []\n    })\n  }\n}\n","/**\n * @callback Handler\n *   Handle a value, with a certain ID field set to a certain value.\n *   The ID field is passed to `zwitch`, and it’s value is this function’s\n *   place on the `handlers` record.\n * @param {...any} parameters\n *   Arbitrary parameters passed to the zwitch.\n *   The first will be an object with a certain ID field set to a certain value.\n * @returns {any}\n *   Anything!\n */\n\n/**\n * @callback UnknownHandler\n *   Handle values that do have a certain ID field, but it’s set to a value\n *   that is not listed in the `handlers` record.\n * @param {unknown} value\n *   An object with a certain ID field set to an unknown value.\n * @param {...any} rest\n *   Arbitrary parameters passed to the zwitch.\n * @returns {any}\n *   Anything!\n */\n\n/**\n * @callback InvalidHandler\n *   Handle values that do not have a certain ID field.\n * @param {unknown} value\n *   Any unknown value.\n * @param {...any} rest\n *   Arbitrary parameters passed to the zwitch.\n * @returns {void|null|undefined|never}\n *   This should crash or return nothing.\n */\n\n/**\n * @template {InvalidHandler} [Invalid=InvalidHandler]\n * @template {UnknownHandler} [Unknown=UnknownHandler]\n * @template {Record<string, Handler>} [Handlers=Record<string, Handler>]\n * @typedef Options\n *   Configuration (required).\n * @property {Invalid} [invalid]\n *   Handler to use for invalid values.\n * @property {Unknown} [unknown]\n *   Handler to use for unknown values.\n * @property {Handlers} [handlers]\n *   Handlers to use.\n */\n\nconst own = {}.hasOwnProperty\n\n/**\n * Handle values based on a field.\n *\n * @template {InvalidHandler} [Invalid=InvalidHandler]\n * @template {UnknownHandler} [Unknown=UnknownHandler]\n * @template {Record<string, Handler>} [Handlers=Record<string, Handler>]\n * @param {string} key\n *   Field to switch on.\n * @param {Options<Invalid, Unknown, Handlers>} [options]\n *   Configuration (required).\n * @returns {{unknown: Unknown, invalid: Invalid, handlers: Handlers, (...parameters: Parameters<Handlers[keyof Handlers]>): ReturnType<Handlers[keyof Handlers]>, (...parameters: Parameters<Unknown>): ReturnType<Unknown>}}\n */\nexport function zwitch(key, options) {\n  const settings = options || {}\n\n  /**\n   * Handle one value.\n   *\n   * Based on the bound `key`, a respective handler will be called.\n   * If `value` is not an object, or doesn’t have a `key` property, the special\n   * “invalid” handler will be called.\n   * If `value` has an unknown `key`, the special “unknown” handler will be\n   * called.\n   *\n   * All arguments, and the context object, are passed through to the handler,\n   * and it’s result is returned.\n   *\n   * @this {unknown}\n   *   Any context object.\n   * @param {unknown} [value]\n   *   Any value.\n   * @param {...unknown} parameters\n   *   Arbitrary parameters passed to the zwitch.\n   * @property {Handler} invalid\n   *   Handle for values that do not have a certain ID field.\n   * @property {Handler} unknown\n   *   Handle values that do have a certain ID field, but it’s set to a value\n   *   that is not listed in the `handlers` record.\n   * @property {Handlers} handlers\n   *   Record of handlers.\n   * @returns {unknown}\n   *   Anything.\n   */\n  function one(value, ...parameters) {\n    /** @type {Handler|undefined} */\n    let fn = one.invalid\n    const handlers = one.handlers\n\n    if (value && own.call(value, key)) {\n      // @ts-expect-error Indexable.\n      const id = String(value[key])\n      // @ts-expect-error Indexable.\n      fn = own.call(handlers, id) ? handlers[id] : one.unknown\n    }\n\n    if (fn) {\n      return fn.call(this, value, ...parameters)\n    }\n  }\n\n  one.handlers = settings.handlers || {}\n  one.invalid = settings.invalid\n  one.unknown = settings.unknown\n\n  // @ts-expect-error: matches!\n  return one\n}\n","/**\n * @typedef {import('./types.js').Options} Options\n * @typedef {import('./types.js').State} State\n */\n\nconst own = {}.hasOwnProperty\n\n/**\n * @param {State} base\n * @param {Options} extension\n * @returns {State}\n */\nexport function configure(base, extension) {\n  let index = -1\n  /** @type {keyof Options} */\n  let key\n\n  // First do subextensions.\n  if (extension.extensions) {\n    while (++index < extension.extensions.length) {\n      configure(base, extension.extensions[index])\n    }\n  }\n\n  for (key in extension) {\n    if (own.call(extension, key)) {\n      switch (key) {\n        case 'extensions': {\n          // Empty.\n          break\n        }\n\n        /* c8 ignore next 4 */\n        case 'unsafe': {\n          list(base[key], extension[key])\n          break\n        }\n\n        case 'join': {\n          list(base[key], extension[key])\n          break\n        }\n\n        case 'handlers': {\n          map(base[key], extension[key])\n          break\n        }\n\n        default: {\n          // @ts-expect-error: matches.\n          base.options[key] = extension[key]\n        }\n      }\n    }\n  }\n\n  return base\n}\n\n/**\n * @template T\n * @param {Array<T>} left\n * @param {Array<T> | null | undefined} right\n */\nfunction list(left, right) {\n  if (right) {\n    left.push(...right)\n  }\n}\n\n/**\n * @template T\n * @param {Record<string, T>} left\n * @param {Record<string, T> | null | undefined} right\n */\nfunction map(left, right) {\n  if (right) {\n    Object.assign(left, right)\n  }\n}\n","/**\n * @typedef {import('mdast').Blockquote} Blockquote\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').Map} Map\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {Blockquote} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function blockquote(node, _, state, info) {\n  const exit = state.enter('blockquote')\n  const tracker = state.createTracker(info)\n  tracker.move('> ')\n  tracker.shift(2)\n  const value = state.indentLines(\n    state.containerFlow(node, tracker.current()),\n    map\n  )\n  exit()\n  return value\n}\n\n/** @type {Map} */\nfunction map(line, _, blank) {\n  return '>' + (blank ? '' : ' ') + line\n}\n","/**\n * @typedef {import('../types.js').ConstructName} ConstructName\n * @typedef {import('../types.js').Unsafe} Unsafe\n */\n\n/**\n * @param {Array<ConstructName>} stack\n * @param {Unsafe} pattern\n * @returns {boolean}\n */\nexport function patternInScope(stack, pattern) {\n  return (\n    listInScope(stack, pattern.inConstruct, true) &&\n    !listInScope(stack, pattern.notInConstruct, false)\n  )\n}\n\n/**\n * @param {Array<ConstructName>} stack\n * @param {Unsafe['inConstruct']} list\n * @param {boolean} none\n * @returns {boolean}\n */\nfunction listInScope(stack, list, none) {\n  if (typeof list === 'string') {\n    list = [list]\n  }\n\n  if (!list || list.length === 0) {\n    return none\n  }\n\n  let index = -1\n\n  while (++index < list.length) {\n    if (stack.includes(list[index])) {\n      return true\n    }\n  }\n\n  return false\n}\n","/**\n * @typedef {import('mdast').Break} Break\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nimport {patternInScope} from '../util/pattern-in-scope.js'\n\n/**\n * @param {Break} _\n * @param {Parents | undefined} _1\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function hardBreak(_, _1, state, info) {\n  let index = -1\n\n  while (++index < state.unsafe.length) {\n    // If we can’t put eols in this construct (setext headings, tables), use a\n    // space instead.\n    if (\n      state.unsafe[index].character === '\\n' &&\n      patternInScope(state.stack, state.unsafe[index])\n    ) {\n      return /[ \\t]/.test(info.before) ? '' : ' '\n    }\n  }\n\n  return '\\\\\\n'\n}\n","/**\n * @typedef {import('mdast').Code} Code\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {Code} node\n * @param {State} state\n * @returns {boolean}\n */\nexport function formatCodeAsIndented(node, state) {\n  return Boolean(\n    state.options.fences === false &&\n      node.value &&\n      // If there’s no info…\n      !node.lang &&\n      // And there’s a non-whitespace character…\n      /[^ \\r\\n]/.test(node.value) &&\n      // And the value doesn’t start or end in a blank…\n      !/^[\\t ]*(?:[\\r\\n]|$)|(?:^|[\\r\\n])[\\t ]*$/.test(node.value)\n  )\n}\n","/**\n * @typedef {import('mdast').Code} Code\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').Map} Map\n * @typedef {import('../types.js').State} State\n */\n\nimport {longestStreak} from 'longest-streak'\nimport {formatCodeAsIndented} from '../util/format-code-as-indented.js'\nimport {checkFence} from '../util/check-fence.js'\n\n/**\n * @param {Code} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function code(node, _, state, info) {\n  const marker = checkFence(state)\n  const raw = node.value || ''\n  const suffix = marker === '`' ? 'GraveAccent' : 'Tilde'\n\n  if (formatCodeAsIndented(node, state)) {\n    const exit = state.enter('codeIndented')\n    const value = state.indentLines(raw, map)\n    exit()\n    return value\n  }\n\n  const tracker = state.createTracker(info)\n  const sequence = marker.repeat(Math.max(longestStreak(raw, marker) + 1, 3))\n  const exit = state.enter('codeFenced')\n  let value = tracker.move(sequence)\n\n  if (node.lang) {\n    const subexit = state.enter(`codeFencedLang${suffix}`)\n    value += tracker.move(\n      state.safe(node.lang, {\n        before: value,\n        after: ' ',\n        encode: ['`'],\n        ...tracker.current()\n      })\n    )\n    subexit()\n  }\n\n  if (node.lang && node.meta) {\n    const subexit = state.enter(`codeFencedMeta${suffix}`)\n    value += tracker.move(' ')\n    value += tracker.move(\n      state.safe(node.meta, {\n        before: value,\n        after: '\\n',\n        encode: ['`'],\n        ...tracker.current()\n      })\n    )\n    subexit()\n  }\n\n  value += tracker.move('\\n')\n\n  if (raw) {\n    value += tracker.move(raw + '\\n')\n  }\n\n  value += tracker.move(sequence)\n  exit()\n  return value\n}\n\n/** @type {Map} */\nfunction map(line, _, blank) {\n  return (blank ? '' : '    ') + line\n}\n","/**\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['quote'], null | undefined>}\n */\nexport function checkQuote(state) {\n  const marker = state.options.quote || '\"'\n\n  if (marker !== '\"' && marker !== \"'\") {\n    throw new Error(\n      'Cannot serialize title with `' +\n        marker +\n        '` for `options.quote`, expected `\"`, or `\\'`'\n    )\n  }\n\n  return marker\n}\n","/**\n * @typedef {import('mdast').Emphasis} Emphasis\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nimport {checkEmphasis} from '../util/check-emphasis.js'\n\nemphasis.peek = emphasisPeek\n\n// To do: there are cases where emphasis cannot “form” depending on the\n// previous or next character of sequences.\n// There’s no way around that though, except for injecting zero-width stuff.\n// Do we need to safeguard against that?\n/**\n * @param {Emphasis} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function emphasis(node, _, state, info) {\n  const marker = checkEmphasis(state)\n  const exit = state.enter('emphasis')\n  const tracker = state.createTracker(info)\n  let value = tracker.move(marker)\n  value += tracker.move(\n    state.containerPhrasing(node, {\n      before: value,\n      after: marker,\n      ...tracker.current()\n    })\n  )\n  value += tracker.move(marker)\n  exit()\n  return value\n}\n\n/**\n * @param {Emphasis} _\n * @param {Parents | undefined} _1\n * @param {State} state\n * @returns {string}\n */\nfunction emphasisPeek(_, _1, state) {\n  return state.options.emphasis || '*'\n}\n","/**\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['emphasis'], null | undefined>}\n */\nexport function checkEmphasis(state) {\n  const marker = state.options.emphasis || '*'\n\n  if (marker !== '*' && marker !== '_') {\n    throw new Error(\n      'Cannot serialize emphasis with `' +\n        marker +\n        '` for `options.emphasis`, expected `*`, or `_`'\n    )\n  }\n\n  return marker\n}\n","/**\n * @typedef {import('mdast').Heading} Heading\n * @typedef {import('../types.js').State} State\n */\n\nimport {EXIT, visit} from 'unist-util-visit'\nimport {toString} from 'mdast-util-to-string'\n\n/**\n * @param {Heading} node\n * @param {State} state\n * @returns {boolean}\n */\nexport function formatHeadingAsSetext(node, state) {\n  let literalWithBreak = false\n\n  // Look for literals with a line break.\n  // Note that this also\n  visit(node, function (node) {\n    if (\n      ('value' in node && /\\r?\\n|\\r/.test(node.value)) ||\n      node.type === 'break'\n    ) {\n      literalWithBreak = true\n      return EXIT\n    }\n  })\n\n  return Boolean(\n    (!node.depth || node.depth < 3) &&\n      toString(node) &&\n      (state.options.setext || literalWithBreak)\n  )\n}\n","/**\n * @typedef {import('mdast').Html} Html\n */\n\nhtml.peek = htmlPeek\n\n/**\n * @param {Html} node\n * @returns {string}\n */\nexport function html(node) {\n  return node.value || ''\n}\n\n/**\n * @returns {string}\n */\nfunction htmlPeek() {\n  return '<'\n}\n","/**\n * @typedef {import('mdast').Image} Image\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nimport {checkQuote} from '../util/check-quote.js'\n\nimage.peek = imagePeek\n\n/**\n * @param {Image} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function image(node, _, state, info) {\n  const quote = checkQuote(state)\n  const suffix = quote === '\"' ? 'Quote' : 'Apostrophe'\n  const exit = state.enter('image')\n  let subexit = state.enter('label')\n  const tracker = state.createTracker(info)\n  let value = tracker.move('![')\n  value += tracker.move(\n    state.safe(node.alt, {before: value, after: ']', ...tracker.current()})\n  )\n  value += tracker.move('](')\n\n  subexit()\n\n  if (\n    // If there’s no url but there is a title…\n    (!node.url && node.title) ||\n    // If there are control characters or whitespace.\n    /[\\0- \\u007F]/.test(node.url)\n  ) {\n    subexit = state.enter('destinationLiteral')\n    value += tracker.move('<')\n    value += tracker.move(\n      state.safe(node.url, {before: value, after: '>', ...tracker.current()})\n    )\n    value += tracker.move('>')\n  } else {\n    // No whitespace, raw is prettier.\n    subexit = state.enter('destinationRaw')\n    value += tracker.move(\n      state.safe(node.url, {\n        before: value,\n        after: node.title ? ' ' : ')',\n        ...tracker.current()\n      })\n    )\n  }\n\n  subexit()\n\n  if (node.title) {\n    subexit = state.enter(`title${suffix}`)\n    value += tracker.move(' ' + quote)\n    value += tracker.move(\n      state.safe(node.title, {\n        before: value,\n        after: quote,\n        ...tracker.current()\n      })\n    )\n    value += tracker.move(quote)\n    subexit()\n  }\n\n  value += tracker.move(')')\n  exit()\n\n  return value\n}\n\n/**\n * @returns {string}\n */\nfunction imagePeek() {\n  return '!'\n}\n","/**\n * @typedef {import('mdast').ImageReference} ImageReference\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nimageReference.peek = imageReferencePeek\n\n/**\n * @param {ImageReference} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function imageReference(node, _, state, info) {\n  const type = node.referenceType\n  const exit = state.enter('imageReference')\n  let subexit = state.enter('label')\n  const tracker = state.createTracker(info)\n  let value = tracker.move('![')\n  const alt = state.safe(node.alt, {\n    before: value,\n    after: ']',\n    ...tracker.current()\n  })\n  value += tracker.move(alt + '][')\n\n  subexit()\n  // Hide the fact that we’re in phrasing, because escapes don’t work.\n  const stack = state.stack\n  state.stack = []\n  subexit = state.enter('reference')\n  // Note: for proper tracking, we should reset the output positions when we end\n  // up making a `shortcut` reference, because then there is no brace output.\n  // Practically, in that case, there is no content, so it doesn’t matter that\n  // we’ve tracked one too many characters.\n  const reference = state.safe(state.associationId(node), {\n    before: value,\n    after: ']',\n    ...tracker.current()\n  })\n  subexit()\n  state.stack = stack\n  exit()\n\n  if (type === 'full' || !alt || alt !== reference) {\n    value += tracker.move(reference + ']')\n  } else if (type === 'shortcut') {\n    // Remove the unwanted `[`.\n    value = value.slice(0, -1)\n  } else {\n    value += tracker.move(']')\n  }\n\n  return value\n}\n\n/**\n * @returns {string}\n */\nfunction imageReferencePeek() {\n  return '!'\n}\n","/**\n * @typedef {import('mdast').InlineCode} InlineCode\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').State} State\n */\n\ninlineCode.peek = inlineCodePeek\n\n/**\n * @param {InlineCode} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @returns {string}\n */\nexport function inlineCode(node, _, state) {\n  let value = node.value || ''\n  let sequence = '`'\n  let index = -1\n\n  // If there is a single grave accent on its own in the code, use a fence of\n  // two.\n  // If there are two in a row, use one.\n  while (new RegExp('(^|[^`])' + sequence + '([^`]|$)').test(value)) {\n    sequence += '`'\n  }\n\n  // If this is not just spaces or eols (tabs don’t count), and either the\n  // first or last character are a space, eol, or tick, then pad with spaces.\n  if (\n    /[^ \\r\\n]/.test(value) &&\n    ((/^[ \\r\\n]/.test(value) && /[ \\r\\n]$/.test(value)) || /^`|`$/.test(value))\n  ) {\n    value = ' ' + value + ' '\n  }\n\n  // We have a potential problem: certain characters after eols could result in\n  // blocks being seen.\n  // For example, if someone injected the string `'\\n# b'`, then that would\n  // result in an ATX heading.\n  // We can’t escape characters in `inlineCode`, but because eols are\n  // transformed to spaces when going from markdown to HTML anyway, we can swap\n  // them out.\n  while (++index < state.unsafe.length) {\n    const pattern = state.unsafe[index]\n    const expression = state.compilePattern(pattern)\n    /** @type {RegExpExecArray | null} */\n    let match\n\n    // Only look for `atBreak`s.\n    // Btw: note that `atBreak` patterns will always start the regex at LF or\n    // CR.\n    if (!pattern.atBreak) continue\n\n    while ((match = expression.exec(value))) {\n      let position = match.index\n\n      // Support CRLF (patterns only look for one of the characters).\n      if (\n        value.charCodeAt(position) === 10 /* `\\n` */ &&\n        value.charCodeAt(position - 1) === 13 /* `\\r` */\n      ) {\n        position--\n      }\n\n      value = value.slice(0, position) + ' ' + value.slice(match.index + 1)\n    }\n  }\n\n  return sequence + value + sequence\n}\n\n/**\n * @returns {string}\n */\nfunction inlineCodePeek() {\n  return '`'\n}\n","/**\n * @typedef {import('mdast').Link} Link\n * @typedef {import('../types.js').State} State\n */\n\nimport {toString} from 'mdast-util-to-string'\n\n/**\n * @param {Link} node\n * @param {State} state\n * @returns {boolean}\n */\nexport function formatLinkAsAutolink(node, state) {\n  const raw = toString(node)\n\n  return Boolean(\n    !state.options.resourceLink &&\n      // If there’s a url…\n      node.url &&\n      // And there’s a no title…\n      !node.title &&\n      // And the content of `node` is a single text node…\n      node.children &&\n      node.children.length === 1 &&\n      node.children[0].type === 'text' &&\n      // And if the url is the same as the content…\n      (raw === node.url || 'mailto:' + raw === node.url) &&\n      // And that starts w/ a protocol…\n      /^[a-z][a-z+.-]+:/i.test(node.url) &&\n      // And that doesn’t contain ASCII control codes (character escapes and\n      // references don’t work), space, or angle brackets…\n      !/[\\0- <>\\u007F]/.test(node.url)\n  )\n}\n","/**\n * @typedef {import('mdast').Link} Link\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Exit} Exit\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nimport {checkQuote} from '../util/check-quote.js'\nimport {formatLinkAsAutolink} from '../util/format-link-as-autolink.js'\n\nlink.peek = linkPeek\n\n/**\n * @param {Link} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function link(node, _, state, info) {\n  const quote = checkQuote(state)\n  const suffix = quote === '\"' ? 'Quote' : 'Apostrophe'\n  const tracker = state.createTracker(info)\n  /** @type {Exit} */\n  let exit\n  /** @type {Exit} */\n  let subexit\n\n  if (formatLinkAsAutolink(node, state)) {\n    // Hide the fact that we’re in phrasing, because escapes don’t work.\n    const stack = state.stack\n    state.stack = []\n    exit = state.enter('autolink')\n    let value = tracker.move('<')\n    value += tracker.move(\n      state.containerPhrasing(node, {\n        before: value,\n        after: '>',\n        ...tracker.current()\n      })\n    )\n    value += tracker.move('>')\n    exit()\n    state.stack = stack\n    return value\n  }\n\n  exit = state.enter('link')\n  subexit = state.enter('label')\n  let value = tracker.move('[')\n  value += tracker.move(\n    state.containerPhrasing(node, {\n      before: value,\n      after: '](',\n      ...tracker.current()\n    })\n  )\n  value += tracker.move('](')\n  subexit()\n\n  if (\n    // If there’s no url but there is a title…\n    (!node.url && node.title) ||\n    // If there are control characters or whitespace.\n    /[\\0- \\u007F]/.test(node.url)\n  ) {\n    subexit = state.enter('destinationLiteral')\n    value += tracker.move('<')\n    value += tracker.move(\n      state.safe(node.url, {before: value, after: '>', ...tracker.current()})\n    )\n    value += tracker.move('>')\n  } else {\n    // No whitespace, raw is prettier.\n    subexit = state.enter('destinationRaw')\n    value += tracker.move(\n      state.safe(node.url, {\n        before: value,\n        after: node.title ? ' ' : ')',\n        ...tracker.current()\n      })\n    )\n  }\n\n  subexit()\n\n  if (node.title) {\n    subexit = state.enter(`title${suffix}`)\n    value += tracker.move(' ' + quote)\n    value += tracker.move(\n      state.safe(node.title, {\n        before: value,\n        after: quote,\n        ...tracker.current()\n      })\n    )\n    value += tracker.move(quote)\n    subexit()\n  }\n\n  value += tracker.move(')')\n\n  exit()\n  return value\n}\n\n/**\n * @param {Link} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @returns {string}\n */\nfunction linkPeek(node, _, state) {\n  return formatLinkAsAutolink(node, state) ? '<' : '['\n}\n","/**\n * @typedef {import('mdast').LinkReference} LinkReference\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nlinkReference.peek = linkReferencePeek\n\n/**\n * @param {LinkReference} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function linkReference(node, _, state, info) {\n  const type = node.referenceType\n  const exit = state.enter('linkReference')\n  let subexit = state.enter('label')\n  const tracker = state.createTracker(info)\n  let value = tracker.move('[')\n  const text = state.containerPhrasing(node, {\n    before: value,\n    after: ']',\n    ...tracker.current()\n  })\n  value += tracker.move(text + '][')\n\n  subexit()\n  // Hide the fact that we’re in phrasing, because escapes don’t work.\n  const stack = state.stack\n  state.stack = []\n  subexit = state.enter('reference')\n  // Note: for proper tracking, we should reset the output positions when we end\n  // up making a `shortcut` reference, because then there is no brace output.\n  // Practically, in that case, there is no content, so it doesn’t matter that\n  // we’ve tracked one too many characters.\n  const reference = state.safe(state.associationId(node), {\n    before: value,\n    after: ']',\n    ...tracker.current()\n  })\n  subexit()\n  state.stack = stack\n  exit()\n\n  if (type === 'full' || !text || text !== reference) {\n    value += tracker.move(reference + ']')\n  } else if (type === 'shortcut') {\n    // Remove the unwanted `[`.\n    value = value.slice(0, -1)\n  } else {\n    value += tracker.move(']')\n  }\n\n  return value\n}\n\n/**\n * @returns {string}\n */\nfunction linkReferencePeek() {\n  return '['\n}\n","/**\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['bullet'], null | undefined>}\n */\nexport function checkBullet(state) {\n  const marker = state.options.bullet || '*'\n\n  if (marker !== '*' && marker !== '+' && marker !== '-') {\n    throw new Error(\n      'Cannot serialize items with `' +\n        marker +\n        '` for `options.bullet`, expected `*`, `+`, or `-`'\n    )\n  }\n\n  return marker\n}\n","/**\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['rule'], null | undefined>}\n */\nexport function checkRule(state) {\n  const marker = state.options.rule || '*'\n\n  if (marker !== '*' && marker !== '-' && marker !== '_') {\n    throw new Error(\n      'Cannot serialize rules with `' +\n        marker +\n        '` for `options.rule`, expected `*`, `-`, or `_`'\n    )\n  }\n\n  return marker\n}\n","/**\n * @typedef {import('mdast').Html} Html\n * @typedef {import('mdast').PhrasingContent} PhrasingContent\n */\n\nimport {convert} from 'unist-util-is'\n\n/**\n * Check if the given value is *phrasing content*.\n *\n * > 👉 **Note**: Excludes `html`, which can be both phrasing or flow.\n *\n * @param node\n *   Thing to check, typically `Node`.\n * @returns\n *   Whether `value` is phrasing content.\n */\n\nexport const phrasing =\n  /** @type {(node?: unknown) => node is Exclude<PhrasingContent, Html>} */\n  (\n    convert([\n      'break',\n      'delete',\n      'emphasis',\n      // To do: next major: removed since footnotes were added to GFM.\n      'footnote',\n      'footnoteReference',\n      'image',\n      'imageReference',\n      'inlineCode',\n      // Enabled by `mdast-util-math`:\n      'inlineMath',\n      'link',\n      'linkReference',\n      // Enabled by `mdast-util-mdx`:\n      'mdxJsxTextElement',\n      // Enabled by `mdast-util-mdx`:\n      'mdxTextExpression',\n      'strong',\n      'text',\n      // Enabled by `mdast-util-directive`:\n      'textDirective'\n    ])\n  )\n","/**\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('mdast').Strong} Strong\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nimport {checkStrong} from '../util/check-strong.js'\n\nstrong.peek = strongPeek\n\n// To do: there are cases where emphasis cannot “form” depending on the\n// previous or next character of sequences.\n// There’s no way around that though, except for injecting zero-width stuff.\n// Do we need to safeguard against that?\n/**\n * @param {Strong} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function strong(node, _, state, info) {\n  const marker = checkStrong(state)\n  const exit = state.enter('strong')\n  const tracker = state.createTracker(info)\n  let value = tracker.move(marker + marker)\n  value += tracker.move(\n    state.containerPhrasing(node, {\n      before: value,\n      after: marker,\n      ...tracker.current()\n    })\n  )\n  value += tracker.move(marker + marker)\n  exit()\n  return value\n}\n\n/**\n * @param {Strong} _\n * @param {Parents | undefined} _1\n * @param {State} state\n * @returns {string}\n */\nfunction strongPeek(_, _1, state) {\n  return state.options.strong || '*'\n}\n","/**\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['strong'], null | undefined>}\n */\nexport function checkStrong(state) {\n  const marker = state.options.strong || '*'\n\n  if (marker !== '*' && marker !== '_') {\n    throw new Error(\n      'Cannot serialize strong with `' +\n        marker +\n        '` for `options.strong`, expected `*`, or `_`'\n    )\n  }\n\n  return marker\n}\n","import {blockquote} from './blockquote.js'\nimport {hardBreak} from './break.js'\nimport {code} from './code.js'\nimport {definition} from './definition.js'\nimport {emphasis} from './emphasis.js'\nimport {heading} from './heading.js'\nimport {html} from './html.js'\nimport {image} from './image.js'\nimport {imageReference} from './image-reference.js'\nimport {inlineCode} from './inline-code.js'\nimport {link} from './link.js'\nimport {linkReference} from './link-reference.js'\nimport {list} from './list.js'\nimport {listItem} from './list-item.js'\nimport {paragraph} from './paragraph.js'\nimport {root} from './root.js'\nimport {strong} from './strong.js'\nimport {text} from './text.js'\nimport {thematicBreak} from './thematic-break.js'\n\n/**\n * Default (CommonMark) handlers.\n */\nexport const handle = {\n  blockquote,\n  break: hardBreak,\n  code,\n  definition,\n  emphasis,\n  hardBreak,\n  heading,\n  html,\n  image,\n  imageReference,\n  inlineCode,\n  link,\n  linkReference,\n  list,\n  listItem,\n  paragraph,\n  root,\n  strong,\n  text,\n  thematicBreak\n}\n","/**\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['fence'], null | undefined>}\n */\nexport function checkFence(state) {\n  const marker = state.options.fence || '`'\n\n  if (marker !== '`' && marker !== '~') {\n    throw new Error(\n      'Cannot serialize code with `' +\n        marker +\n        '` for `options.fence`, expected `` ` `` or `~`'\n    )\n  }\n\n  return marker\n}\n","/**\n * Get the count of the longest repeating streak of `substring` in `value`.\n *\n * @param {string} value\n *   Content to search in.\n * @param {string} substring\n *   Substring to look for, typically one character.\n * @returns {number}\n *   Count of most frequent adjacent `substring`s in `value`.\n */\nexport function longestStreak(value, substring) {\n  const source = String(value)\n  let index = source.indexOf(substring)\n  let expected = index\n  let count = 0\n  let max = 0\n\n  if (typeof substring !== 'string') {\n    throw new TypeError('Expected substring')\n  }\n\n  while (index !== -1) {\n    if (index === expected) {\n      if (++count > max) {\n        max = count\n      }\n    } else {\n      count = 1\n    }\n\n    expected = index + substring.length\n    index = source.indexOf(substring, expected)\n  }\n\n  return max\n}\n","/**\n * @typedef {import('mdast').Definition} Definition\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nimport {checkQuote} from '../util/check-quote.js'\n\n/**\n * @param {Definition} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function definition(node, _, state, info) {\n  const quote = checkQuote(state)\n  const suffix = quote === '\"' ? 'Quote' : 'Apostrophe'\n  const exit = state.enter('definition')\n  let subexit = state.enter('label')\n  const tracker = state.createTracker(info)\n  let value = tracker.move('[')\n  value += tracker.move(\n    state.safe(state.associationId(node), {\n      before: value,\n      after: ']',\n      ...tracker.current()\n    })\n  )\n  value += tracker.move(']: ')\n\n  subexit()\n\n  if (\n    // If there’s no url, or…\n    !node.url ||\n    // If there are control characters or whitespace.\n    /[\\0- \\u007F]/.test(node.url)\n  ) {\n    subexit = state.enter('destinationLiteral')\n    value += tracker.move('<')\n    value += tracker.move(\n      state.safe(node.url, {before: value, after: '>', ...tracker.current()})\n    )\n    value += tracker.move('>')\n  } else {\n    // No whitespace, raw is prettier.\n    subexit = state.enter('destinationRaw')\n    value += tracker.move(\n      state.safe(node.url, {\n        before: value,\n        after: node.title ? ' ' : '\\n',\n        ...tracker.current()\n      })\n    )\n  }\n\n  subexit()\n\n  if (node.title) {\n    subexit = state.enter(`title${suffix}`)\n    value += tracker.move(' ' + quote)\n    value += tracker.move(\n      state.safe(node.title, {\n        before: value,\n        after: quote,\n        ...tracker.current()\n      })\n    )\n    value += tracker.move(quote)\n    subexit()\n  }\n\n  exit()\n\n  return value\n}\n","/**\n * @typedef {import('mdast').Heading} Heading\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nimport {formatHeadingAsSetext} from '../util/format-heading-as-setext.js'\n\n/**\n * @param {Heading} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function heading(node, _, state, info) {\n  const rank = Math.max(Math.min(6, node.depth || 1), 1)\n  const tracker = state.createTracker(info)\n\n  if (formatHeadingAsSetext(node, state)) {\n    const exit = state.enter('headingSetext')\n    const subexit = state.enter('phrasing')\n    const value = state.containerPhrasing(node, {\n      ...tracker.current(),\n      before: '\\n',\n      after: '\\n'\n    })\n    subexit()\n    exit()\n\n    return (\n      value +\n      '\\n' +\n      (rank === 1 ? '=' : '-').repeat(\n        // The whole size…\n        value.length -\n          // Minus the position of the character after the last EOL (or\n          // 0 if there is none)…\n          (Math.max(value.lastIndexOf('\\r'), value.lastIndexOf('\\n')) + 1)\n      )\n    )\n  }\n\n  const sequence = '#'.repeat(rank)\n  const exit = state.enter('headingAtx')\n  const subexit = state.enter('phrasing')\n\n  // Note: for proper tracking, we should reset the output positions when there\n  // is no content returned, because then the space is not output.\n  // Practically, in that case, there is no content, so it doesn’t matter that\n  // we’ve tracked one too many characters.\n  tracker.move(sequence + ' ')\n\n  let value = state.containerPhrasing(node, {\n    before: '# ',\n    after: '\\n',\n    ...tracker.current()\n  })\n\n  if (/^[\\t ]/.test(value)) {\n    // To do: what effect has the character reference on tracking?\n    value =\n      '&#x' +\n      value.charCodeAt(0).toString(16).toUpperCase() +\n      ';' +\n      value.slice(1)\n  }\n\n  value = value ? sequence + ' ' + value : sequence\n\n  if (state.options.closeAtx) {\n    value += ' ' + sequence\n  }\n\n  subexit()\n  exit()\n\n  return value\n}\n","/**\n * @typedef {import('mdast').List} List\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nimport {checkBullet} from '../util/check-bullet.js'\nimport {checkBulletOther} from '../util/check-bullet-other.js'\nimport {checkBulletOrdered} from '../util/check-bullet-ordered.js'\nimport {checkRule} from '../util/check-rule.js'\n\n/**\n * @param {List} node\n * @param {Parents | undefined} parent\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function list(node, parent, state, info) {\n  const exit = state.enter('list')\n  const bulletCurrent = state.bulletCurrent\n  /** @type {string} */\n  let bullet = node.ordered ? checkBulletOrdered(state) : checkBullet(state)\n  /** @type {string} */\n  const bulletOther = node.ordered\n    ? bullet === '.'\n      ? ')'\n      : '.'\n    : checkBulletOther(state)\n  let useDifferentMarker =\n    parent && state.bulletLastUsed ? bullet === state.bulletLastUsed : false\n\n  if (!node.ordered) {\n    const firstListItem = node.children ? node.children[0] : undefined\n\n    // If there’s an empty first list item directly in two list items,\n    // we have to use a different bullet:\n    //\n    // ```markdown\n    // * - *\n    // ```\n    //\n    // …because otherwise it would become one big thematic break.\n    if (\n      // Bullet could be used as a thematic break marker:\n      (bullet === '*' || bullet === '-') &&\n      // Empty first list item:\n      firstListItem &&\n      (!firstListItem.children || !firstListItem.children[0]) &&\n      // Directly in two other list items:\n      state.stack[state.stack.length - 1] === 'list' &&\n      state.stack[state.stack.length - 2] === 'listItem' &&\n      state.stack[state.stack.length - 3] === 'list' &&\n      state.stack[state.stack.length - 4] === 'listItem' &&\n      // That are each the first child.\n      state.indexStack[state.indexStack.length - 1] === 0 &&\n      state.indexStack[state.indexStack.length - 2] === 0 &&\n      state.indexStack[state.indexStack.length - 3] === 0\n    ) {\n      useDifferentMarker = true\n    }\n\n    // If there’s a thematic break at the start of the first list item,\n    // we have to use a different bullet:\n    //\n    // ```markdown\n    // * ---\n    // ```\n    //\n    // …because otherwise it would become one big thematic break.\n    if (checkRule(state) === bullet && firstListItem) {\n      let index = -1\n\n      while (++index < node.children.length) {\n        const item = node.children[index]\n\n        if (\n          item &&\n          item.type === 'listItem' &&\n          item.children &&\n          item.children[0] &&\n          item.children[0].type === 'thematicBreak'\n        ) {\n          useDifferentMarker = true\n          break\n        }\n      }\n    }\n  }\n\n  if (useDifferentMarker) {\n    bullet = bulletOther\n  }\n\n  state.bulletCurrent = bullet\n  const value = state.containerFlow(node, info)\n  state.bulletLastUsed = bullet\n  state.bulletCurrent = bulletCurrent\n  exit()\n  return value\n}\n","/**\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['bulletOrdered'], null | undefined>}\n */\nexport function checkBulletOrdered(state) {\n  const marker = state.options.bulletOrdered || '.'\n\n  if (marker !== '.' && marker !== ')') {\n    throw new Error(\n      'Cannot serialize items with `' +\n        marker +\n        '` for `options.bulletOrdered`, expected `.` or `)`'\n    )\n  }\n\n  return marker\n}\n","/**\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').State} State\n */\n\nimport {checkBullet} from './check-bullet.js'\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['bullet'], null | undefined>}\n */\nexport function checkBulletOther(state) {\n  const bullet = checkBullet(state)\n  const bulletOther = state.options.bulletOther\n\n  if (!bulletOther) {\n    return bullet === '*' ? '-' : '*'\n  }\n\n  if (bulletOther !== '*' && bulletOther !== '+' && bulletOther !== '-') {\n    throw new Error(\n      'Cannot serialize items with `' +\n        bulletOther +\n        '` for `options.bulletOther`, expected `*`, `+`, or `-`'\n    )\n  }\n\n  if (bulletOther === bullet) {\n    throw new Error(\n      'Expected `bullet` (`' +\n        bullet +\n        '`) and `bulletOther` (`' +\n        bulletOther +\n        '`) to be different'\n    )\n  }\n\n  return bulletOther\n}\n","/**\n * @typedef {import('mdast').ListItem} ListItem\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').Map} Map\n * @typedef {import('../types.js').State} State\n */\n\nimport {checkBullet} from '../util/check-bullet.js'\nimport {checkListItemIndent} from '../util/check-list-item-indent.js'\n\n/**\n * @param {ListItem} node\n * @param {Parents | undefined} parent\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function listItem(node, parent, state, info) {\n  const listItemIndent = checkListItemIndent(state)\n  let bullet = state.bulletCurrent || checkBullet(state)\n\n  // Add the marker value for ordered lists.\n  if (parent && parent.type === 'list' && parent.ordered) {\n    bullet =\n      (typeof parent.start === 'number' && parent.start > -1\n        ? parent.start\n        : 1) +\n      (state.options.incrementListMarker === false\n        ? 0\n        : parent.children.indexOf(node)) +\n      bullet\n  }\n\n  let size = bullet.length + 1\n\n  if (\n    listItemIndent === 'tab' ||\n    (listItemIndent === 'mixed' &&\n      ((parent && parent.type === 'list' && parent.spread) || node.spread))\n  ) {\n    size = Math.ceil(size / 4) * 4\n  }\n\n  const tracker = state.createTracker(info)\n  tracker.move(bullet + ' '.repeat(size - bullet.length))\n  tracker.shift(size)\n  const exit = state.enter('listItem')\n  const value = state.indentLines(\n    state.containerFlow(node, tracker.current()),\n    map\n  )\n  exit()\n\n  return value\n\n  /** @type {Map} */\n  function map(line, index, blank) {\n    if (index) {\n      return (blank ? '' : ' '.repeat(size)) + line\n    }\n\n    return (blank ? bullet : bullet + ' '.repeat(size - bullet.length)) + line\n  }\n}\n","/**\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['listItemIndent'], null | undefined>}\n */\nexport function checkListItemIndent(state) {\n  const style = state.options.listItemIndent || 'one'\n\n  if (style !== 'tab' && style !== 'one' && style !== 'mixed') {\n    throw new Error(\n      'Cannot serialize items with `' +\n        style +\n        '` for `options.listItemIndent`, expected `tab`, `one`, or `mixed`'\n    )\n  }\n\n  return style\n}\n","/**\n * @typedef {import('mdast').Paragraph} Paragraph\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {Paragraph} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function paragraph(node, _, state, info) {\n  const exit = state.enter('paragraph')\n  const subexit = state.enter('phrasing')\n  const value = state.containerPhrasing(node, info)\n  subexit()\n  exit()\n  return value\n}\n","/**\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('mdast').Root} Root\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\nimport {phrasing} from 'mdast-util-phrasing'\n\n/**\n * @param {Root} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function root(node, _, state, info) {\n  // Note: `html` nodes are ambiguous.\n  const hasPhrasing = node.children.some(function (d) {\n    return phrasing(d)\n  })\n  const fn = hasPhrasing ? state.containerPhrasing : state.containerFlow\n  return fn.call(state, node, info)\n}\n","/**\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('mdast').Text} Text\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {Text} node\n * @param {Parents | undefined} _\n * @param {State} state\n * @param {Info} info\n * @returns {string}\n */\nexport function text(node, _, state, info) {\n  return state.safe(node.value, info)\n}\n","/**\n * @typedef {import('mdast').Parents} Parents\n * @typedef {import('mdast').ThematicBreak} ThematicBreak\n * @typedef {import('../types.js').State} State\n */\n\nimport {checkRuleRepetition} from '../util/check-rule-repetition.js'\nimport {checkRule} from '../util/check-rule.js'\n\n/**\n * @param {ThematicBreak} _\n * @param {Parents | undefined} _1\n * @param {State} state\n * @returns {string}\n */\nexport function thematicBreak(_, _1, state) {\n  const value = (\n    checkRule(state) + (state.options.ruleSpaces ? ' ' : '')\n  ).repeat(checkRuleRepetition(state))\n\n  return state.options.ruleSpaces ? value.slice(0, -1) : value\n}\n","/**\n * @typedef {import('../types.js').Options} Options\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['ruleRepetition'], null | undefined>}\n */\nexport function checkRuleRepetition(state) {\n  const repetition = state.options.ruleRepetition || 3\n\n  if (repetition < 3) {\n    throw new Error(\n      'Cannot serialize rules with repetition `' +\n        repetition +\n        '` for `options.ruleRepetition`, expected `3` or more'\n    )\n  }\n\n  return repetition\n}\n","/**\n * @typedef {import('./types.js').Join} Join\n */\n\nimport {formatCodeAsIndented} from './util/format-code-as-indented.js'\nimport {formatHeadingAsSetext} from './util/format-heading-as-setext.js'\n\n/** @type {Array<Join>} */\nexport const join = [joinDefaults]\n\n/** @type {Join} */\nfunction joinDefaults(left, right, parent, state) {\n  // Indented code after list or another indented code.\n  if (\n    right.type === 'code' &&\n    formatCodeAsIndented(right, state) &&\n    (left.type === 'list' ||\n      (left.type === right.type && formatCodeAsIndented(left, state)))\n  ) {\n    return false\n  }\n\n  // Join children of a list or an item.\n  // In which case, `parent` has a `spread` field.\n  if ('spread' in parent && typeof parent.spread === 'boolean') {\n    if (\n      left.type === 'paragraph' &&\n      // Two paragraphs.\n      (left.type === right.type ||\n        right.type === 'definition' ||\n        // Paragraph followed by a setext heading.\n        (right.type === 'heading' && formatHeadingAsSetext(right, state)))\n    ) {\n      return\n    }\n\n    return parent.spread ? 1 : 0\n  }\n}\n","/**\n * @typedef {import('./types.js').ConstructName} ConstructName\n * @typedef {import('./types.js').Unsafe} Unsafe\n */\n\n/**\n * List of constructs that occur in phrasing (paragraphs, headings), but cannot\n * contain things like attention (emphasis, strong), images, or links.\n * So they sort of cancel each other out.\n * Note: could use a better name.\n *\n * @type {Array<ConstructName>}\n */\nconst fullPhrasingSpans = [\n  'autolink',\n  'destinationLiteral',\n  'destinationRaw',\n  'reference',\n  'titleQuote',\n  'titleApostrophe'\n]\n\n/** @type {Array<Unsafe>} */\nexport const unsafe = [\n  {character: '\\t', after: '[\\\\r\\\\n]', inConstruct: 'phrasing'},\n  {character: '\\t', before: '[\\\\r\\\\n]', inConstruct: 'phrasing'},\n  {\n    character: '\\t',\n    inConstruct: ['codeFencedLangGraveAccent', 'codeFencedLangTilde']\n  },\n  {\n    character: '\\r',\n    inConstruct: [\n      'codeFencedLangGraveAccent',\n      'codeFencedLangTilde',\n      'codeFencedMetaGraveAccent',\n      'codeFencedMetaTilde',\n      'destinationLiteral',\n      'headingAtx'\n    ]\n  },\n  {\n    character: '\\n',\n    inConstruct: [\n      'codeFencedLangGraveAccent',\n      'codeFencedLangTilde',\n      'codeFencedMetaGraveAccent',\n      'codeFencedMetaTilde',\n      'destinationLiteral',\n      'headingAtx'\n    ]\n  },\n  {character: ' ', after: '[\\\\r\\\\n]', inConstruct: 'phrasing'},\n  {character: ' ', before: '[\\\\r\\\\n]', inConstruct: 'phrasing'},\n  {\n    character: ' ',\n    inConstruct: ['codeFencedLangGraveAccent', 'codeFencedLangTilde']\n  },\n  // An exclamation mark can start an image, if it is followed by a link or\n  // a link reference.\n  {\n    character: '!',\n    after: '\\\\[',\n    inConstruct: 'phrasing',\n    notInConstruct: fullPhrasingSpans\n  },\n  // A quote can break out of a title.\n  {character: '\"', inConstruct: 'titleQuote'},\n  // A number sign could start an ATX heading if it starts a line.\n  {atBreak: true, character: '#'},\n  {character: '#', inConstruct: 'headingAtx', after: '(?:[\\r\\n]|$)'},\n  // Dollar sign and percentage are not used in markdown.\n  // An ampersand could start a character reference.\n  {character: '&', after: '[#A-Za-z]', inConstruct: 'phrasing'},\n  // An apostrophe can break out of a title.\n  {character: \"'\", inConstruct: 'titleApostrophe'},\n  // A left paren could break out of a destination raw.\n  {character: '(', inConstruct: 'destinationRaw'},\n  // A left paren followed by `]` could make something into a link or image.\n  {\n    before: '\\\\]',\n    character: '(',\n    inConstruct: 'phrasing',\n    notInConstruct: fullPhrasingSpans\n  },\n  // A right paren could start a list item or break out of a destination\n  // raw.\n  {atBreak: true, before: '\\\\d+', character: ')'},\n  {character: ')', inConstruct: 'destinationRaw'},\n  // An asterisk can start thematic breaks, list items, emphasis, strong.\n  {atBreak: true, character: '*', after: '(?:[ \\t\\r\\n*])'},\n  {character: '*', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},\n  // A plus sign could start a list item.\n  {atBreak: true, character: '+', after: '(?:[ \\t\\r\\n])'},\n  // A dash can start thematic breaks, list items, and setext heading\n  // underlines.\n  {atBreak: true, character: '-', after: '(?:[ \\t\\r\\n-])'},\n  // A dot could start a list item.\n  {atBreak: true, before: '\\\\d+', character: '.', after: '(?:[ \\t\\r\\n]|$)'},\n  // Slash, colon, and semicolon are not used in markdown for constructs.\n  // A less than can start html (flow or text) or an autolink.\n  // HTML could start with an exclamation mark (declaration, cdata, comment),\n  // slash (closing tag), question mark (instruction), or a letter (tag).\n  // An autolink also starts with a letter.\n  // Finally, it could break out of a destination literal.\n  {atBreak: true, character: '<', after: '[!/?A-Za-z]'},\n  {\n    character: '<',\n    after: '[!/?A-Za-z]',\n    inConstruct: 'phrasing',\n    notInConstruct: fullPhrasingSpans\n  },\n  {character: '<', inConstruct: 'destinationLiteral'},\n  // An equals to can start setext heading underlines.\n  {atBreak: true, character: '='},\n  // A greater than can start block quotes and it can break out of a\n  // destination literal.\n  {atBreak: true, character: '>'},\n  {character: '>', inConstruct: 'destinationLiteral'},\n  // Question mark and at sign are not used in markdown for constructs.\n  // A left bracket can start definitions, references, labels,\n  {atBreak: true, character: '['},\n  {character: '[', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},\n  {character: '[', inConstruct: ['label', 'reference']},\n  // A backslash can start an escape (when followed by punctuation) or a\n  // hard break (when followed by an eol).\n  // Note: typical escapes are handled in `safe`!\n  {character: '\\\\', after: '[\\\\r\\\\n]', inConstruct: 'phrasing'},\n  // A right bracket can exit labels.\n  {character: ']', inConstruct: ['label', 'reference']},\n  // Caret is not used in markdown for constructs.\n  // An underscore can start emphasis, strong, or a thematic break.\n  {atBreak: true, character: '_'},\n  {character: '_', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},\n  // A grave accent can start code (fenced or text), or it can break out of\n  // a grave accent code fence.\n  {atBreak: true, character: '`'},\n  {\n    character: '`',\n    inConstruct: ['codeFencedLangGraveAccent', 'codeFencedMetaGraveAccent']\n  },\n  {character: '`', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},\n  // Left brace, vertical bar, right brace are not used in markdown for\n  // constructs.\n  // A tilde can start code (fenced).\n  {atBreak: true, character: '~'}\n]\n","/**\n * @typedef {import('../types.js').AssociationId} AssociationId\n */\n\nimport {decodeString} from 'micromark-util-decode-string'\n\n/**\n * Get an identifier from an association to match it to others.\n *\n * Associations are nodes that match to something else through an ID:\n * <https://github.com/syntax-tree/mdast#association>.\n *\n * The `label` of an association is the string value: character escapes and\n * references work, and casing is intact.\n * The `identifier` is used to match one association to another:\n * controversially, character escapes and references don’t work in this\n * matching: `&copy;` does not match `©`, and `\\+` does not match `+`.\n *\n * But casing is ignored (and whitespace) is trimmed and collapsed: ` A\\nb`\n * matches `a b`.\n * So, we do prefer the label when figuring out how we’re going to serialize:\n * it has whitespace, casing, and we can ignore most useless character\n * escapes and all character references.\n *\n * @type {AssociationId}\n */\nexport function association(node) {\n  if (node.label || !node.identifier) {\n    return node.label || ''\n  }\n\n  return decodeString(node.identifier)\n}\n","/**\n * @typedef {import('../types.js').CompilePattern} CompilePattern\n */\n\n/**\n * @type {CompilePattern}\n */\nexport function compilePattern(pattern) {\n  if (!pattern._compiled) {\n    const before =\n      (pattern.atBreak ? '[\\\\r\\\\n][\\\\t ]*' : '') +\n      (pattern.before ? '(?:' + pattern.before + ')' : '')\n\n    pattern._compiled = new RegExp(\n      (before ? '(' + before + ')' : '') +\n        (/[|\\\\{}()[\\]^$+*?.-]/.test(pattern.character) ? '\\\\' : '') +\n        pattern.character +\n        (pattern.after ? '(?:' + pattern.after + ')' : ''),\n      'g'\n    )\n  }\n\n  return pattern._compiled\n}\n","/**\n * @typedef {import('../types.js').FlowParents} FlowParents\n * @typedef {import('../types.js').FlowChildren} FlowChildren\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').TrackFields} TrackFields\n */\n\n/**\n * @param {FlowParents} parent\n *   Parent of flow nodes.\n * @param {State} state\n *   Info passed around about the current state.\n * @param {TrackFields} info\n *   Info on where we are in the document we are generating.\n * @returns {string}\n *   Serialized children, joined by (blank) lines.\n */\nexport function containerFlow(parent, state, info) {\n  const indexStack = state.indexStack\n  const children = parent.children || []\n  const tracker = state.createTracker(info)\n  /** @type {Array<string>} */\n  const results = []\n  let index = -1\n\n  indexStack.push(-1)\n\n  while (++index < children.length) {\n    const child = children[index]\n\n    indexStack[indexStack.length - 1] = index\n\n    results.push(\n      tracker.move(\n        state.handle(child, parent, state, {\n          before: '\\n',\n          after: '\\n',\n          ...tracker.current()\n        })\n      )\n    )\n\n    if (child.type !== 'list') {\n      state.bulletLastUsed = undefined\n    }\n\n    if (index < children.length - 1) {\n      results.push(\n        tracker.move(between(child, children[index + 1], parent, state))\n      )\n    }\n  }\n\n  indexStack.pop()\n\n  return results.join('')\n}\n\n/**\n * @param {FlowChildren} left\n * @param {FlowChildren} right\n * @param {FlowParents} parent\n * @param {State} state\n * @returns {string}\n */\nfunction between(left, right, parent, state) {\n  let index = state.join.length\n\n  while (index--) {\n    const result = state.join[index](left, right, parent, state)\n\n    if (result === true || result === 1) {\n      break\n    }\n\n    if (typeof result === 'number') {\n      return '\\n'.repeat(1 + result)\n    }\n\n    if (result === false) {\n      return '\\n\\n<!---->\\n\\n'\n    }\n  }\n\n  return '\\n\\n'\n}\n","/**\n * @typedef {import('../types.js').IndentLines} IndentLines\n */\n\nconst eol = /\\r?\\n|\\r/g\n\n/**\n * @type {IndentLines}\n */\nexport function indentLines(value, map) {\n  /** @type {Array<string>} */\n  const result = []\n  let start = 0\n  let line = 0\n  /** @type {RegExpExecArray | null} */\n  let match\n\n  while ((match = eol.exec(value))) {\n    one(value.slice(start, match.index))\n    result.push(match[0])\n    start = match.index + match[0].length\n    line++\n  }\n\n  one(value.slice(start))\n\n  return result.join('')\n\n  /**\n   * @param {string} value\n   */\n  function one(value) {\n    result.push(map(value, line, !value))\n  }\n}\n","/**\n * @typedef {import('../types.js').SafeConfig} SafeConfig\n * @typedef {import('../types.js').State} State\n */\n\nimport {patternInScope} from './pattern-in-scope.js'\n\n/**\n * Make a string safe for embedding in markdown constructs.\n *\n * In markdown, almost all punctuation characters can, in certain cases,\n * result in something.\n * Whether they do is highly subjective to where they happen and in what\n * they happen.\n *\n * To solve this, `mdast-util-to-markdown` tracks:\n *\n * * Characters before and after something;\n * * What “constructs” we are in.\n *\n * This information is then used by this function to escape or encode\n * special characters.\n *\n * @param {State} state\n *   Info passed around about the current state.\n * @param {string | null | undefined} input\n *   Raw value to make safe.\n * @param {SafeConfig} config\n *   Configuration.\n * @returns {string}\n *   Serialized markdown safe for embedding.\n */\nexport function safe(state, input, config) {\n  const value = (config.before || '') + (input || '') + (config.after || '')\n  /** @type {Array<number>} */\n  const positions = []\n  /** @type {Array<string>} */\n  const result = []\n  /** @type {Record<number, {before: boolean, after: boolean}>} */\n  const infos = {}\n  let index = -1\n\n  while (++index < state.unsafe.length) {\n    const pattern = state.unsafe[index]\n\n    if (!patternInScope(state.stack, pattern)) {\n      continue\n    }\n\n    const expression = state.compilePattern(pattern)\n    /** @type {RegExpExecArray | null} */\n    let match\n\n    while ((match = expression.exec(value))) {\n      const before = 'before' in pattern || Boolean(pattern.atBreak)\n      const after = 'after' in pattern\n      const position = match.index + (before ? match[1].length : 0)\n\n      if (positions.includes(position)) {\n        if (infos[position].before && !before) {\n          infos[position].before = false\n        }\n\n        if (infos[position].after && !after) {\n          infos[position].after = false\n        }\n      } else {\n        positions.push(position)\n        infos[position] = {before, after}\n      }\n    }\n  }\n\n  positions.sort(numerical)\n\n  let start = config.before ? config.before.length : 0\n  const end = value.length - (config.after ? config.after.length : 0)\n  index = -1\n\n  while (++index < positions.length) {\n    const position = positions[index]\n\n    // Character before or after matched:\n    if (position < start || position >= end) {\n      continue\n    }\n\n    // If this character is supposed to be escaped because it has a condition on\n    // the next character, and the next character is definitly being escaped,\n    // then skip this escape.\n    if (\n      (position + 1 < end &&\n        positions[index + 1] === position + 1 &&\n        infos[position].after &&\n        !infos[position + 1].before &&\n        !infos[position + 1].after) ||\n      (positions[index - 1] === position - 1 &&\n        infos[position].before &&\n        !infos[position - 1].before &&\n        !infos[position - 1].after)\n    ) {\n      continue\n    }\n\n    if (start !== position) {\n      // If we have to use a character reference, an ampersand would be more\n      // correct, but as backslashes only care about punctuation, either will\n      // do the trick\n      result.push(escapeBackslashes(value.slice(start, position), '\\\\'))\n    }\n\n    start = position\n\n    if (\n      /[!-/:-@[-`{-~]/.test(value.charAt(position)) &&\n      (!config.encode || !config.encode.includes(value.charAt(position)))\n    ) {\n      // Character escape.\n      result.push('\\\\')\n    } else {\n      // Character reference.\n      result.push(\n        '&#x' + value.charCodeAt(position).toString(16).toUpperCase() + ';'\n      )\n      start++\n    }\n  }\n\n  result.push(escapeBackslashes(value.slice(start, end), config.after))\n\n  return result.join('')\n}\n\n/**\n * @param {number} a\n * @param {number} b\n * @returns {number}\n */\nfunction numerical(a, b) {\n  return a - b\n}\n\n/**\n * @param {string} value\n * @param {string} after\n * @returns {string}\n */\nfunction escapeBackslashes(value, after) {\n  const expression = /\\\\(?=[!-/:-@[-`{-~])/g\n  /** @type {Array<number>} */\n  const positions = []\n  /** @type {Array<string>} */\n  const results = []\n  const whole = value + after\n  let index = -1\n  let start = 0\n  /** @type {RegExpExecArray | null} */\n  let match\n\n  while ((match = expression.exec(whole))) {\n    positions.push(match.index)\n  }\n\n  while (++index < positions.length) {\n    if (start !== positions[index]) {\n      results.push(value.slice(start, positions[index]))\n    }\n\n    results.push('\\\\')\n    start = positions[index]\n  }\n\n  results.push(value.slice(start))\n\n  return results.join('')\n}\n","/**\n * @typedef {import('../types.js').CreateTracker} CreateTracker\n * @typedef {import('../types.js').TrackCurrent} TrackCurrent\n * @typedef {import('../types.js').TrackMove} TrackMove\n * @typedef {import('../types.js').TrackShift} TrackShift\n */\n\n/**\n * Track positional info in the output.\n *\n * @type {CreateTracker}\n */\nexport function track(config) {\n  // Defaults are used to prevent crashes when older utilities somehow activate\n  // this code.\n  /* c8 ignore next 5 */\n  const options = config || {}\n  const now = options.now || {}\n  let lineShift = options.lineShift || 0\n  let line = now.line || 1\n  let column = now.column || 1\n\n  return {move, current, shift}\n\n  /**\n   * Get the current tracked info.\n   *\n   * @type {TrackCurrent}\n   */\n  function current() {\n    return {now: {line, column}, lineShift}\n  }\n\n  /**\n   * Define an increased line shift (the typical indent for lines).\n   *\n   * @type {TrackShift}\n   */\n  function shift(value) {\n    lineShift += value\n  }\n\n  /**\n   * Move past some generated markdown.\n   *\n   * @type {TrackMove}\n   */\n  function move(input) {\n    // eslint-disable-next-line unicorn/prefer-default-parameters\n    const value = input || ''\n    const chunks = value.split(/\\r?\\n|\\r/g)\n    const tail = chunks[chunks.length - 1]\n    line += chunks.length - 1\n    column =\n      chunks.length === 1 ? column + tail.length : 1 + tail.length + lineShift\n    return value\n  }\n}\n","/**\n * @typedef {import('mdast').Nodes} Nodes\n * @typedef {import('./types.js').Enter} Enter\n * @typedef {import('./types.js').Info} Info\n * @typedef {import('./types.js').Join} Join\n * @typedef {import('./types.js').FlowParents} FlowParents\n * @typedef {import('./types.js').Options} Options\n * @typedef {import('./types.js').PhrasingParents} PhrasingParents\n * @typedef {import('./types.js').SafeConfig} SafeConfig\n * @typedef {import('./types.js').State} State\n * @typedef {import('./types.js').TrackFields} TrackFields\n */\n\nimport {zwitch} from 'zwitch'\nimport {configure} from './configure.js'\nimport {handle as handlers} from './handle/index.js'\nimport {join} from './join.js'\nimport {unsafe} from './unsafe.js'\nimport {association} from './util/association.js'\nimport {compilePattern} from './util/compile-pattern.js'\nimport {containerPhrasing} from './util/container-phrasing.js'\nimport {containerFlow} from './util/container-flow.js'\nimport {indentLines} from './util/indent-lines.js'\nimport {safe} from './util/safe.js'\nimport {track} from './util/track.js'\n\n/**\n * Turn an mdast syntax tree into markdown.\n *\n * @param {Nodes} tree\n *   Tree to serialize.\n * @param {Options} [options]\n *   Configuration (optional).\n * @returns {string}\n *   Serialized markdown representing `tree`.\n */\nexport function toMarkdown(tree, options = {}) {\n  /** @type {State} */\n  const state = {\n    enter,\n    indentLines,\n    associationId: association,\n    containerPhrasing: containerPhrasingBound,\n    containerFlow: containerFlowBound,\n    createTracker: track,\n    compilePattern,\n    safe: safeBound,\n    stack: [],\n    unsafe: [...unsafe],\n    join: [...join],\n    // @ts-expect-error: GFM / frontmatter are typed in `mdast` but not defined\n    // here.\n    handlers: {...handlers},\n    options: {},\n    indexStack: [],\n    // @ts-expect-error: add `handle` in a second.\n    handle: undefined\n  }\n\n  configure(state, options)\n\n  if (state.options.tightDefinitions) {\n    state.join.push(joinDefinition)\n  }\n\n  state.handle = zwitch('type', {\n    invalid,\n    unknown,\n    handlers: state.handlers\n  })\n\n  let result = state.handle(tree, undefined, state, {\n    before: '\\n',\n    after: '\\n',\n    now: {line: 1, column: 1},\n    lineShift: 0\n  })\n\n  if (\n    result &&\n    result.charCodeAt(result.length - 1) !== 10 &&\n    result.charCodeAt(result.length - 1) !== 13\n  ) {\n    result += '\\n'\n  }\n\n  return result\n\n  /** @type {Enter} */\n  function enter(name) {\n    state.stack.push(name)\n    return exit\n\n    /**\n     * @returns {undefined}\n     */\n    function exit() {\n      state.stack.pop()\n    }\n  }\n}\n\n/**\n * @param {unknown} value\n * @returns {never}\n */\nfunction invalid(value) {\n  throw new Error('Cannot handle value `' + value + '`, expected node')\n}\n\n/**\n * @param {unknown} value\n * @returns {never}\n */\nfunction unknown(value) {\n  // Always a node.\n  const node = /** @type {Nodes} */ (value)\n  throw new Error('Cannot handle unknown node `' + node.type + '`')\n}\n\n/** @type {Join} */\nfunction joinDefinition(left, right) {\n  // No blank line between adjacent definitions.\n  if (left.type === 'definition' && left.type === right.type) {\n    return 0\n  }\n}\n\n/**\n * Serialize the children of a parent that contains phrasing children.\n *\n * These children will be joined flush together.\n *\n * @this {State}\n *   Info passed around about the current state.\n * @param {PhrasingParents} parent\n *   Parent of flow nodes.\n * @param {Info} info\n *   Info on where we are in the document we are generating.\n * @returns {string}\n *   Serialized children, joined together.\n */\nfunction containerPhrasingBound(parent, info) {\n  return containerPhrasing(parent, this, info)\n}\n\n/**\n * Serialize the children of a parent that contains flow children.\n *\n * These children will typically be joined by blank lines.\n * What they are joined by exactly is defined by `Join` functions.\n *\n * @this {State}\n *   Info passed around about the current state.\n * @param {FlowParents} parent\n *   Parent of flow nodes.\n * @param {TrackFields} info\n *   Info on where we are in the document we are generating.\n * @returns {string}\n *   Serialized children, joined by (blank) lines.\n */\nfunction containerFlowBound(parent, info) {\n  return containerFlow(parent, this, info)\n}\n\n/**\n * Make a string safe for embedding in markdown constructs.\n *\n * In markdown, almost all punctuation characters can, in certain cases,\n * result in something.\n * Whether they do is highly subjective to where they happen and in what\n * they happen.\n *\n * To solve this, `mdast-util-to-markdown` tracks:\n *\n * * Characters before and after something;\n * * What “constructs” we are in.\n *\n * This information is then used by this function to escape or encode\n * special characters.\n *\n * @this {State}\n *   Info passed around about the current state.\n * @param {string | null | undefined} value\n *   Raw value to make safe.\n * @param {SafeConfig} config\n *   Configuration.\n * @returns {string}\n *   Serialized markdown safe for embedding.\n */\nfunction safeBound(value, config) {\n  return safe(this, value, config)\n}\n","/**\n * @typedef {import('../types.js').Handle} Handle\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').PhrasingParents} PhrasingParents\n * @typedef {import('../types.js').State} State\n */\n\n/**\n * Serialize the children of a parent that contains phrasing children.\n *\n * These children will be joined flush together.\n *\n * @param {PhrasingParents} parent\n *   Parent of flow nodes.\n * @param {State} state\n *   Info passed around about the current state.\n * @param {Info} info\n *   Info on where we are in the document we are generating.\n * @returns {string}\n *   Serialized children, joined together.\n */\nexport function containerPhrasing(parent, state, info) {\n  const indexStack = state.indexStack\n  const children = parent.children || []\n  /** @type {Array<string>} */\n  const results = []\n  let index = -1\n  let before = info.before\n\n  indexStack.push(-1)\n  let tracker = state.createTracker(info)\n\n  while (++index < children.length) {\n    const child = children[index]\n    /** @type {string} */\n    let after\n\n    indexStack[indexStack.length - 1] = index\n\n    if (index + 1 < children.length) {\n      /** @type {Handle} */\n      // @ts-expect-error: hush, it’s actually a `zwitch`.\n      let handle = state.handle.handlers[children[index + 1].type]\n      /** @type {Handle} */\n      // @ts-expect-error: hush, it’s actually a `zwitch`.\n      if (handle && handle.peek) handle = handle.peek\n      after = handle\n        ? handle(children[index + 1], parent, state, {\n            before: '',\n            after: '',\n            ...tracker.current()\n          }).charAt(0)\n        : ''\n    } else {\n      after = info.after\n    }\n\n    // In some cases, html (text) can be found in phrasing right after an eol.\n    // When we’d serialize that, in most cases that would be seen as html\n    // (flow).\n    // As we can’t escape or so to prevent it from happening, we take a somewhat\n    // reasonable approach: replace that eol with a space.\n    // See: <https://github.com/syntax-tree/mdast-util-to-markdown/issues/15>\n    if (\n      results.length > 0 &&\n      (before === '\\r' || before === '\\n') &&\n      child.type === 'html'\n    ) {\n      results[results.length - 1] = results[results.length - 1].replace(\n        /(\\r?\\n|\\r)$/,\n        ' '\n      )\n      before = ' '\n\n      // To do: does this work to reset tracker?\n      tracker = state.createTracker(info)\n      tracker.move(results.join(''))\n    }\n\n    results.push(\n      tracker.move(\n        state.handle(child, parent, state, {\n          ...tracker.current(),\n          before,\n          after\n        })\n      )\n    )\n\n    before = results[results.length - 1].slice(-1)\n  }\n\n  indexStack.pop()\n\n  return results.join('')\n}\n","/**\n * @typedef {import('mdast').Root} Root\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownOptions\n * @typedef {import('unified').Compiler<Root, string>} Compiler\n * @typedef {import('unified').Processor<undefined, undefined, undefined, Root, string>} Processor\n */\n\n/**\n * @typedef {Omit<ToMarkdownOptions, 'extensions'>} Options\n */\n\nimport {toMarkdown} from 'mdast-util-to-markdown'\n\n/**\n * Add support for serializing to markdown.\n *\n * @param {Readonly<Options> | null | undefined} [options]\n *   Configuration (optional).\n * @returns {undefined}\n *   Nothing.\n */\nexport default function remarkStringify(options) {\n  /** @type {Processor} */\n  // @ts-expect-error: TS in JSDoc generates wrong types if `this` is typed regularly.\n  const self = this\n\n  self.compiler = compiler\n\n  /**\n   * @type {Compiler}\n   */\n  function compiler(tree) {\n    return toMarkdown(tree, {\n      ...self.data('settings'),\n      ...options,\n      // Note: this option is not in the readme.\n      // The goal is for it to be set by plugins on `data` instead of being\n      // passed by users.\n      extensions: self.data('toMarkdownExtensions') || []\n    })\n  }\n}\n","/**\n * Throw a given error.\n *\n * @param {Error|null|undefined} [error]\n *   Maybe error.\n * @returns {asserts error is null|undefined}\n */\nexport function bail(error) {\n  if (error) {\n    throw error\n  }\n}\n","export default function isPlainObject(value) {\n\tif (typeof value !== 'object' || value === null) {\n\t\treturn false;\n\t}\n\n\tconst prototype = Object.getPrototypeOf(value);\n\treturn (prototype === null || prototype === Object.prototype || Object.getPrototypeOf(prototype) === null) && !(Symbol.toStringTag in value) && !(Symbol.iterator in value);\n}\n","// To do: remove `void`s\n// To do: remove `null` from output of our APIs, allow it as user APIs.\n\n/**\n * @typedef {(error?: Error | null | undefined, ...output: Array<any>) => void} Callback\n *   Callback.\n *\n * @typedef {(...input: Array<any>) => any} Middleware\n *   Ware.\n *\n * @typedef Pipeline\n *   Pipeline.\n * @property {Run} run\n *   Run the pipeline.\n * @property {Use} use\n *   Add middleware.\n *\n * @typedef {(...input: Array<any>) => void} Run\n *   Call all middleware.\n *\n *   Calls `done` on completion with either an error or the output of the\n *   last middleware.\n *\n *   > 👉 **Note**: as the length of input defines whether async functions get a\n *   > `next` function,\n *   > it’s recommended to keep `input` at one value normally.\n\n *\n * @typedef {(fn: Middleware) => Pipeline} Use\n *   Add middleware.\n */\n\n/**\n * Create new middleware.\n *\n * @returns {Pipeline}\n *   Pipeline.\n */\nexport function trough() {\n  /** @type {Array<Middleware>} */\n  const fns = []\n  /** @type {Pipeline} */\n  const pipeline = {run, use}\n\n  return pipeline\n\n  /** @type {Run} */\n  function run(...values) {\n    let middlewareIndex = -1\n    /** @type {Callback} */\n    const callback = values.pop()\n\n    if (typeof callback !== 'function') {\n      throw new TypeError('Expected function as last argument, not ' + callback)\n    }\n\n    next(null, ...values)\n\n    /**\n     * Run the next `fn`, or we’re done.\n     *\n     * @param {Error | null | undefined} error\n     * @param {Array<any>} output\n     */\n    function next(error, ...output) {\n      const fn = fns[++middlewareIndex]\n      let index = -1\n\n      if (error) {\n        callback(error)\n        return\n      }\n\n      // Copy non-nullish input into values.\n      while (++index < values.length) {\n        if (output[index] === null || output[index] === undefined) {\n          output[index] = values[index]\n        }\n      }\n\n      // Save the newly created `output` for the next call.\n      values = output\n\n      // Next or done.\n      if (fn) {\n        wrap(fn, next)(...output)\n      } else {\n        callback(null, ...output)\n      }\n    }\n  }\n\n  /** @type {Use} */\n  function use(middelware) {\n    if (typeof middelware !== 'function') {\n      throw new TypeError(\n        'Expected `middelware` to be a function, not ' + middelware\n      )\n    }\n\n    fns.push(middelware)\n    return pipeline\n  }\n}\n\n/**\n * Wrap `middleware` into a uniform interface.\n *\n * You can pass all input to the resulting function.\n * `callback` is then called with the output of `middleware`.\n *\n * If `middleware` accepts more arguments than the later given in input,\n * an extra `done` function is passed to it after that input,\n * which must be called by `middleware`.\n *\n * The first value in `input` is the main input value.\n * All other input values are the rest input values.\n * The values given to `callback` are the input values,\n * merged with every non-nullish output value.\n *\n * * if `middleware` throws an error,\n *   returns a promise that is rejected,\n *   or calls the given `done` function with an error,\n *   `callback` is called with that error\n * * if `middleware` returns a value or returns a promise that is resolved,\n *   that value is the main output value\n * * if `middleware` calls `done`,\n *   all non-nullish values except for the first one (the error) overwrite the\n *   output values\n *\n * @param {Middleware} middleware\n *   Function to wrap.\n * @param {Callback} callback\n *   Callback called with the output of `middleware`.\n * @returns {Run}\n *   Wrapped middleware.\n */\nexport function wrap(middleware, callback) {\n  /** @type {boolean} */\n  let called\n\n  return wrapped\n\n  /**\n   * Call `middleware`.\n   * @this {any}\n   * @param {Array<any>} parameters\n   * @returns {void}\n   */\n  function wrapped(...parameters) {\n    const fnExpectsCallback = middleware.length > parameters.length\n    /** @type {any} */\n    let result\n\n    if (fnExpectsCallback) {\n      parameters.push(done)\n    }\n\n    try {\n      result = middleware.apply(this, parameters)\n    } catch (error) {\n      const exception = /** @type {Error} */ (error)\n\n      // Well, this is quite the pickle.\n      // `middleware` received a callback and called it synchronously, but that\n      // threw an error.\n      // The only thing left to do is to throw the thing instead.\n      if (fnExpectsCallback && called) {\n        throw exception\n      }\n\n      return done(exception)\n    }\n\n    if (!fnExpectsCallback) {\n      if (result && result.then && typeof result.then === 'function') {\n        result.then(then, done)\n      } else if (result instanceof Error) {\n        done(result)\n      } else {\n        then(result)\n      }\n    }\n  }\n\n  /**\n   * Call `callback`, only once.\n   *\n   * @type {Callback}\n   */\n  function done(error, ...output) {\n    if (!called) {\n      called = true\n      callback(error, ...output)\n    }\n  }\n\n  /**\n   * Call `done` with one value.\n   *\n   * @param {any} [value]\n   */\n  function then(value) {\n    done(null, value)\n  }\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Point} Point\n * @typedef {import('unist').Position} Position\n */\n\n/**\n * @typedef {object & {type: string, position?: Position | undefined}} NodeLike\n *\n * @typedef Options\n *   Configuration.\n * @property {Array<Node> | null | undefined} [ancestors]\n *   Stack of (inclusive) ancestor nodes surrounding the message (optional).\n * @property {Error | null | undefined} [cause]\n *   Original error cause of the message (optional).\n * @property {Point | Position | null | undefined} [place]\n *   Place of message (optional).\n * @property {string | null | undefined} [ruleId]\n *   Category of message (optional, example: `'my-rule'`).\n * @property {string | null | undefined} [source]\n *   Namespace of who sent the message (optional, example: `'my-package'`).\n */\n\nimport {stringifyPosition} from 'unist-util-stringify-position'\n\n/**\n * Message.\n */\nexport class VFileMessage extends Error {\n  /**\n   * Create a message for `reason`.\n   *\n   * > 🪦 **Note**: also has obsolete signatures.\n   *\n   * @overload\n   * @param {string} reason\n   * @param {Options | null | undefined} [options]\n   * @returns\n   *\n   * @overload\n   * @param {string} reason\n   * @param {Node | NodeLike | null | undefined} parent\n   * @param {string | null | undefined} [origin]\n   * @returns\n   *\n   * @overload\n   * @param {string} reason\n   * @param {Point | Position | null | undefined} place\n   * @param {string | null | undefined} [origin]\n   * @returns\n   *\n   * @overload\n   * @param {string} reason\n   * @param {string | null | undefined} [origin]\n   * @returns\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {Node | NodeLike | null | undefined} parent\n   * @param {string | null | undefined} [origin]\n   * @returns\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {Point | Position | null | undefined} place\n   * @param {string | null | undefined} [origin]\n   * @returns\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {string | null | undefined} [origin]\n   * @returns\n   *\n   * @param {Error | VFileMessage | string} causeOrReason\n   *   Reason for message, should use markdown.\n   * @param {Node | NodeLike | Options | Point | Position | string | null | undefined} [optionsOrParentOrPlace]\n   *   Configuration (optional).\n   * @param {string | null | undefined} [origin]\n   *   Place in code where the message originates (example:\n   *   `'my-package:my-rule'` or `'my-rule'`).\n   * @returns\n   *   Instance of `VFileMessage`.\n   */\n  // eslint-disable-next-line complexity\n  constructor(causeOrReason, optionsOrParentOrPlace, origin) {\n    super()\n\n    if (typeof optionsOrParentOrPlace === 'string') {\n      origin = optionsOrParentOrPlace\n      optionsOrParentOrPlace = undefined\n    }\n\n    /** @type {string} */\n    let reason = ''\n    /** @type {Options} */\n    let options = {}\n    let legacyCause = false\n\n    if (optionsOrParentOrPlace) {\n      // Point.\n      if (\n        'line' in optionsOrParentOrPlace &&\n        'column' in optionsOrParentOrPlace\n      ) {\n        options = {place: optionsOrParentOrPlace}\n      }\n      // Position.\n      else if (\n        'start' in optionsOrParentOrPlace &&\n        'end' in optionsOrParentOrPlace\n      ) {\n        options = {place: optionsOrParentOrPlace}\n      }\n      // Node.\n      else if ('type' in optionsOrParentOrPlace) {\n        options = {\n          ancestors: [optionsOrParentOrPlace],\n          place: optionsOrParentOrPlace.position\n        }\n      }\n      // Options.\n      else {\n        options = {...optionsOrParentOrPlace}\n      }\n    }\n\n    if (typeof causeOrReason === 'string') {\n      reason = causeOrReason\n    }\n    // Error.\n    else if (!options.cause && causeOrReason) {\n      legacyCause = true\n      reason = causeOrReason.message\n      options.cause = causeOrReason\n    }\n\n    if (!options.ruleId && !options.source && typeof origin === 'string') {\n      const index = origin.indexOf(':')\n\n      if (index === -1) {\n        options.ruleId = origin\n      } else {\n        options.source = origin.slice(0, index)\n        options.ruleId = origin.slice(index + 1)\n      }\n    }\n\n    if (!options.place && options.ancestors && options.ancestors) {\n      const parent = options.ancestors[options.ancestors.length - 1]\n\n      if (parent) {\n        options.place = parent.position\n      }\n    }\n\n    const start =\n      options.place && 'start' in options.place\n        ? options.place.start\n        : options.place\n\n    /* eslint-disable no-unused-expressions */\n    /**\n     * Stack of ancestor nodes surrounding the message.\n     *\n     * @type {Array<Node> | undefined}\n     */\n    this.ancestors = options.ancestors || undefined\n\n    /**\n     * Original error cause of the message.\n     *\n     * @type {Error | undefined}\n     */\n    this.cause = options.cause || undefined\n\n    /**\n     * Starting column of message.\n     *\n     * @type {number | undefined}\n     */\n    this.column = start ? start.column : undefined\n\n    /**\n     * State of problem.\n     *\n     * * `true` — error, file not usable\n     * * `false` — warning, change may be needed\n     * * `undefined` — change likely not needed\n     *\n     * @type {boolean | null | undefined}\n     */\n    this.fatal = undefined\n\n    /**\n     * Path of a file (used throughout the `VFile` ecosystem).\n     *\n     * @type {string | undefined}\n     */\n    this.file\n\n    // Field from `Error`.\n    /**\n     * Reason for message.\n     *\n     * @type {string}\n     */\n    this.message = reason\n\n    /**\n     * Starting line of error.\n     *\n     * @type {number | undefined}\n     */\n    this.line = start ? start.line : undefined\n\n    // Field from `Error`.\n    /**\n     * Serialized positional info of message.\n     *\n     * On normal errors, this would be something like `ParseError`, buit in\n     * `VFile` messages we use this space to show where an error happened.\n     */\n    this.name = stringifyPosition(options.place) || '1:1'\n\n    /**\n     * Place of message.\n     *\n     * @type {Point | Position | undefined}\n     */\n    this.place = options.place || undefined\n\n    /**\n     * Reason for message, should use markdown.\n     *\n     * @type {string}\n     */\n    this.reason = this.message\n\n    /**\n     * Category of message (example: `'my-rule'`).\n     *\n     * @type {string | undefined}\n     */\n    this.ruleId = options.ruleId || undefined\n\n    /**\n     * Namespace of message (example: `'my-package'`).\n     *\n     * @type {string | undefined}\n     */\n    this.source = options.source || undefined\n\n    // Field from `Error`.\n    /**\n     * Stack of message.\n     *\n     * This is used by normal errors to show where something happened in\n     * programming code, irrelevant for `VFile` messages,\n     *\n     * @type {string}\n     */\n    this.stack =\n      legacyCause && options.cause && typeof options.cause.stack === 'string'\n        ? options.cause.stack\n        : ''\n\n    // The following fields are “well known”.\n    // Not standard.\n    // Feel free to add other non-standard fields to your messages.\n\n    /**\n     * Specify the source value that’s being reported, which is deemed\n     * incorrect.\n     *\n     * @type {string | undefined}\n     */\n    this.actual\n\n    /**\n     * Suggest acceptable values that can be used instead of `actual`.\n     *\n     * @type {Array<string> | undefined}\n     */\n    this.expected\n\n    /**\n     * Long form description of the message (you should use markdown).\n     *\n     * @type {string | undefined}\n     */\n    this.note\n\n    /**\n     * Link to docs for the message.\n     *\n     * > 👉 **Note**: this must be an absolute URL that can be passed as `x`\n     * > to `new URL(x)`.\n     *\n     * @type {string | undefined}\n     */\n    this.url\n    /* eslint-enable no-unused-expressions */\n  }\n}\n\nVFileMessage.prototype.file = ''\nVFileMessage.prototype.name = ''\nVFileMessage.prototype.reason = ''\nVFileMessage.prototype.message = ''\nVFileMessage.prototype.stack = ''\nVFileMessage.prototype.column = undefined\nVFileMessage.prototype.line = undefined\nVFileMessage.prototype.ancestors = undefined\nVFileMessage.prototype.cause = undefined\nVFileMessage.prototype.fatal = undefined\nVFileMessage.prototype.place = undefined\nVFileMessage.prototype.ruleId = undefined\nVFileMessage.prototype.source = undefined\n","// A derivative work based on:\n// <https://github.com/browserify/path-browserify>.\n// Which is licensed:\n//\n// MIT License\n//\n// Copyright (c) 2013 James Halliday\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy of\n// this software and associated documentation files (the \"Software\"), to deal in\n// the Software without restriction, including without limitation the rights to\n// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\n// the Software, and to permit persons to whom the Software is furnished to do so,\n// subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in all\n// 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, FITNESS\n// FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n// COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n// IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n// A derivative work based on:\n//\n// Parts of that are extracted from Node’s internal `path` module:\n// <https://github.com/nodejs/node/blob/master/lib/path.js>.\n// Which is licensed:\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\nexport const path = {basename, dirname, extname, join, sep: '/'}\n\n/* eslint-disable max-depth, complexity */\n\n/**\n * Get the basename from a path.\n *\n * @param {string} path\n *   File path.\n * @param {string | null | undefined} [ext]\n *   Extension to strip.\n * @returns {string}\n *   Stem or basename.\n */\nfunction basename(path, ext) {\n  if (ext !== undefined && typeof ext !== 'string') {\n    throw new TypeError('\"ext\" argument must be a string')\n  }\n\n  assertPath(path)\n  let start = 0\n  let end = -1\n  let index = path.length\n  /** @type {boolean | undefined} */\n  let seenNonSlash\n\n  if (ext === undefined || ext.length === 0 || ext.length > path.length) {\n    while (index--) {\n      if (path.codePointAt(index) === 47 /* `/` */) {\n        // If we reached a path separator that was not part of a set of path\n        // separators at the end of the string, stop now.\n        if (seenNonSlash) {\n          start = index + 1\n          break\n        }\n      } else if (end < 0) {\n        // We saw the first non-path separator, mark this as the end of our\n        // path component.\n        seenNonSlash = true\n        end = index + 1\n      }\n    }\n\n    return end < 0 ? '' : path.slice(start, end)\n  }\n\n  if (ext === path) {\n    return ''\n  }\n\n  let firstNonSlashEnd = -1\n  let extIndex = ext.length - 1\n\n  while (index--) {\n    if (path.codePointAt(index) === 47 /* `/` */) {\n      // If we reached a path separator that was not part of a set of path\n      // separators at the end of the string, stop now.\n      if (seenNonSlash) {\n        start = index + 1\n        break\n      }\n    } else {\n      if (firstNonSlashEnd < 0) {\n        // We saw the first non-path separator, remember this index in case\n        // we need it if the extension ends up not matching.\n        seenNonSlash = true\n        firstNonSlashEnd = index + 1\n      }\n\n      if (extIndex > -1) {\n        // Try to match the explicit extension.\n        if (path.codePointAt(index) === ext.codePointAt(extIndex--)) {\n          if (extIndex < 0) {\n            // We matched the extension, so mark this as the end of our path\n            // component\n            end = index\n          }\n        } else {\n          // Extension does not match, so our result is the entire path\n          // component\n          extIndex = -1\n          end = firstNonSlashEnd\n        }\n      }\n    }\n  }\n\n  if (start === end) {\n    end = firstNonSlashEnd\n  } else if (end < 0) {\n    end = path.length\n  }\n\n  return path.slice(start, end)\n}\n\n/**\n * Get the dirname from a path.\n *\n * @param {string} path\n *   File path.\n * @returns {string}\n *   File path.\n */\nfunction dirname(path) {\n  assertPath(path)\n\n  if (path.length === 0) {\n    return '.'\n  }\n\n  let end = -1\n  let index = path.length\n  /** @type {boolean | undefined} */\n  let unmatchedSlash\n\n  // Prefix `--` is important to not run on `0`.\n  while (--index) {\n    if (path.codePointAt(index) === 47 /* `/` */) {\n      if (unmatchedSlash) {\n        end = index\n        break\n      }\n    } else if (!unmatchedSlash) {\n      // We saw the first non-path separator\n      unmatchedSlash = true\n    }\n  }\n\n  return end < 0\n    ? path.codePointAt(0) === 47 /* `/` */\n      ? '/'\n      : '.'\n    : end === 1 && path.codePointAt(0) === 47 /* `/` */\n    ? '//'\n    : path.slice(0, end)\n}\n\n/**\n * Get an extname from a path.\n *\n * @param {string} path\n *   File path.\n * @returns {string}\n *   Extname.\n */\nfunction extname(path) {\n  assertPath(path)\n\n  let index = path.length\n\n  let end = -1\n  let startPart = 0\n  let startDot = -1\n  // Track the state of characters (if any) we see before our first dot and\n  // after any path separator we find.\n  let preDotState = 0\n  /** @type {boolean | undefined} */\n  let unmatchedSlash\n\n  while (index--) {\n    const code = path.codePointAt(index)\n\n    if (code === 47 /* `/` */) {\n      // If we reached a path separator that was not part of a set of path\n      // separators at the end of the string, stop now.\n      if (unmatchedSlash) {\n        startPart = index + 1\n        break\n      }\n\n      continue\n    }\n\n    if (end < 0) {\n      // We saw the first non-path separator, mark this as the end of our\n      // extension.\n      unmatchedSlash = true\n      end = index + 1\n    }\n\n    if (code === 46 /* `.` */) {\n      // If this is our first dot, mark it as the start of our extension.\n      if (startDot < 0) {\n        startDot = index\n      } else if (preDotState !== 1) {\n        preDotState = 1\n      }\n    } else if (startDot > -1) {\n      // We saw a non-dot and non-path separator before our dot, so we should\n      // have a good chance at having a non-empty extension.\n      preDotState = -1\n    }\n  }\n\n  if (\n    startDot < 0 ||\n    end < 0 ||\n    // We saw a non-dot character immediately before the dot.\n    preDotState === 0 ||\n    // The (right-most) trimmed path component is exactly `..`.\n    (preDotState === 1 && startDot === end - 1 && startDot === startPart + 1)\n  ) {\n    return ''\n  }\n\n  return path.slice(startDot, end)\n}\n\n/**\n * Join segments from a path.\n *\n * @param {Array<string>} segments\n *   Path segments.\n * @returns {string}\n *   File path.\n */\nfunction join(...segments) {\n  let index = -1\n  /** @type {string | undefined} */\n  let joined\n\n  while (++index < segments.length) {\n    assertPath(segments[index])\n\n    if (segments[index]) {\n      joined =\n        joined === undefined ? segments[index] : joined + '/' + segments[index]\n    }\n  }\n\n  return joined === undefined ? '.' : normalize(joined)\n}\n\n/**\n * Normalize a basic file path.\n *\n * @param {string} path\n *   File path.\n * @returns {string}\n *   File path.\n */\n// Note: `normalize` is not exposed as `path.normalize`, so some code is\n// manually removed from it.\nfunction normalize(path) {\n  assertPath(path)\n\n  const absolute = path.codePointAt(0) === 47 /* `/` */\n\n  // Normalize the path according to POSIX rules.\n  let value = normalizeString(path, !absolute)\n\n  if (value.length === 0 && !absolute) {\n    value = '.'\n  }\n\n  if (value.length > 0 && path.codePointAt(path.length - 1) === 47 /* / */) {\n    value += '/'\n  }\n\n  return absolute ? '/' + value : value\n}\n\n/**\n * Resolve `.` and `..` elements in a path with directory names.\n *\n * @param {string} path\n *   File path.\n * @param {boolean} allowAboveRoot\n *   Whether `..` can move above root.\n * @returns {string}\n *   File path.\n */\nfunction normalizeString(path, allowAboveRoot) {\n  let result = ''\n  let lastSegmentLength = 0\n  let lastSlash = -1\n  let dots = 0\n  let index = -1\n  /** @type {number | undefined} */\n  let code\n  /** @type {number} */\n  let lastSlashIndex\n\n  while (++index <= path.length) {\n    if (index < path.length) {\n      code = path.codePointAt(index)\n    } else if (code === 47 /* `/` */) {\n      break\n    } else {\n      code = 47 /* `/` */\n    }\n\n    if (code === 47 /* `/` */) {\n      if (lastSlash === index - 1 || dots === 1) {\n        // Empty.\n      } else if (lastSlash !== index - 1 && dots === 2) {\n        if (\n          result.length < 2 ||\n          lastSegmentLength !== 2 ||\n          result.codePointAt(result.length - 1) !== 46 /* `.` */ ||\n          result.codePointAt(result.length - 2) !== 46 /* `.` */\n        ) {\n          if (result.length > 2) {\n            lastSlashIndex = result.lastIndexOf('/')\n\n            if (lastSlashIndex !== result.length - 1) {\n              if (lastSlashIndex < 0) {\n                result = ''\n                lastSegmentLength = 0\n              } else {\n                result = result.slice(0, lastSlashIndex)\n                lastSegmentLength = result.length - 1 - result.lastIndexOf('/')\n              }\n\n              lastSlash = index\n              dots = 0\n              continue\n            }\n          } else if (result.length > 0) {\n            result = ''\n            lastSegmentLength = 0\n            lastSlash = index\n            dots = 0\n            continue\n          }\n        }\n\n        if (allowAboveRoot) {\n          result = result.length > 0 ? result + '/..' : '..'\n          lastSegmentLength = 2\n        }\n      } else {\n        if (result.length > 0) {\n          result += '/' + path.slice(lastSlash + 1, index)\n        } else {\n          result = path.slice(lastSlash + 1, index)\n        }\n\n        lastSegmentLength = index - lastSlash - 1\n      }\n\n      lastSlash = index\n      dots = 0\n    } else if (code === 46 /* `.` */ && dots > -1) {\n      dots++\n    } else {\n      dots = -1\n    }\n  }\n\n  return result\n}\n\n/**\n * Make sure `path` is a string.\n *\n * @param {string} path\n *   File path.\n * @returns {asserts path is string}\n *   Nothing.\n */\nfunction assertPath(path) {\n  if (typeof path !== 'string') {\n    throw new TypeError(\n      'Path must be a string. Received ' + JSON.stringify(path)\n    )\n  }\n}\n\n/* eslint-enable max-depth, complexity */\n","// Somewhat based on:\n// <https://github.com/defunctzombie/node-process/blob/master/browser.js>.\n// But I don’t think one tiny line of code can be copyrighted. 😅\nexport const proc = {cwd}\n\nfunction cwd() {\n  return '/'\n}\n","/**\n * Checks if a value has the shape of a WHATWG URL object.\n *\n * Using a symbol or instanceof would not be able to recognize URL objects\n * coming from other implementations (e.g. in Electron), so instead we are\n * checking some well known properties for a lack of a better test.\n *\n * We use `href` and `protocol` as they are the only properties that are\n * easy to retrieve and calculate due to the lazy nature of the getters.\n *\n * We check for auth attribute to distinguish legacy url instance with\n * WHATWG URL instance.\n *\n * @param {unknown} fileUrlOrPath\n *   File path or URL.\n * @returns {fileUrlOrPath is URL}\n *   Whether it’s a URL.\n */\n// From: <https://github.com/nodejs/node/blob/6a3403c/lib/internal/url.js#L720>\nexport function isUrl(fileUrlOrPath) {\n  return Boolean(\n    fileUrlOrPath !== null &&\n      typeof fileUrlOrPath === 'object' &&\n      'href' in fileUrlOrPath &&\n      fileUrlOrPath.href &&\n      'protocol' in fileUrlOrPath &&\n      fileUrlOrPath.protocol &&\n      // @ts-expect-error: indexing is fine.\n      fileUrlOrPath.auth === undefined\n  )\n}\n","import {isUrl} from './minurl.shared.js'\n\nexport {isUrl} from './minurl.shared.js'\n\n// See: <https://github.com/nodejs/node/blob/6a3403c/lib/internal/url.js>\n\n/**\n * @param {URL | string} path\n *   File URL.\n * @returns {string}\n *   File URL.\n */\nexport function urlToPath(path) {\n  if (typeof path === 'string') {\n    path = new URL(path)\n  } else if (!isUrl(path)) {\n    /** @type {NodeJS.ErrnoException} */\n    const error = new TypeError(\n      'The \"path\" argument must be of type string or an instance of URL. Received `' +\n        path +\n        '`'\n    )\n    error.code = 'ERR_INVALID_ARG_TYPE'\n    throw error\n  }\n\n  if (path.protocol !== 'file:') {\n    /** @type {NodeJS.ErrnoException} */\n    const error = new TypeError('The URL must be of scheme file')\n    error.code = 'ERR_INVALID_URL_SCHEME'\n    throw error\n  }\n\n  return getPathFromURLPosix(path)\n}\n\n/**\n * Get a path from a POSIX URL.\n *\n * @param {URL} url\n *   URL.\n * @returns {string}\n *   File path.\n */\nfunction getPathFromURLPosix(url) {\n  if (url.hostname !== '') {\n    /** @type {NodeJS.ErrnoException} */\n    const error = new TypeError(\n      'File URL host must be \"localhost\" or empty on darwin'\n    )\n    error.code = 'ERR_INVALID_FILE_URL_HOST'\n    throw error\n  }\n\n  const pathname = url.pathname\n  let index = -1\n\n  while (++index < pathname.length) {\n    if (\n      pathname.codePointAt(index) === 37 /* `%` */ &&\n      pathname.codePointAt(index + 1) === 50 /* `2` */\n    ) {\n      const third = pathname.codePointAt(index + 2)\n      if (third === 70 /* `F` */ || third === 102 /* `f` */) {\n        /** @type {NodeJS.ErrnoException} */\n        const error = new TypeError(\n          'File URL path must not include encoded / characters'\n        )\n        error.code = 'ERR_INVALID_FILE_URL_PATH'\n        throw error\n      }\n    }\n  }\n\n  return decodeURIComponent(pathname)\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Point} Point\n * @typedef {import('unist').Position} Position\n * @typedef {import('vfile-message').Options} MessageOptions\n * @typedef {import('../index.js').Data} Data\n * @typedef {import('../index.js').Value} Value\n */\n\n/**\n * @typedef {object & {type: string, position?: Position | undefined}} NodeLike\n *\n * @typedef {Options | URL | VFile | Value} Compatible\n *   Things that can be passed to the constructor.\n *\n * @typedef VFileCoreOptions\n *   Set multiple values.\n * @property {string | null | undefined} [basename]\n *   Set `basename` (name).\n * @property {string | null | undefined} [cwd]\n *   Set `cwd` (working directory).\n * @property {Data | null | undefined} [data]\n *   Set `data` (associated info).\n * @property {string | null | undefined} [dirname]\n *   Set `dirname` (path w/o basename).\n * @property {string | null | undefined} [extname]\n *   Set `extname` (extension with dot).\n * @property {Array<string> | null | undefined} [history]\n *   Set `history` (paths the file moved between).\n * @property {URL | string | null | undefined} [path]\n *   Set `path` (current path).\n * @property {string | null | undefined} [stem]\n *   Set `stem` (name without extension).\n * @property {Value | null | undefined} [value]\n *   Set `value` (the contents of the file).\n *\n * @typedef Map\n *   Raw source map.\n *\n *   See:\n *   <https://github.com/mozilla/source-map/blob/60adcb0/source-map.d.ts#L15-L23>.\n * @property {number} version\n *   Which version of the source map spec this map is following.\n * @property {Array<string>} sources\n *   An array of URLs to the original source files.\n * @property {Array<string>} names\n *   An array of identifiers which can be referenced by individual mappings.\n * @property {string | undefined} [sourceRoot]\n *   The URL root from which all sources are relative.\n * @property {Array<string> | undefined} [sourcesContent]\n *   An array of contents of the original source files.\n * @property {string} mappings\n *   A string of base64 VLQs which contain the actual mappings.\n * @property {string} file\n *   The generated file this source map is associated with.\n *\n * @typedef {Record<string, unknown> & VFileCoreOptions} Options\n *   Configuration.\n *\n *   A bunch of keys that will be shallow copied over to the new file.\n *\n * @typedef {Record<string, unknown>} ReporterSettings\n *   Configuration for reporters.\n */\n\n/**\n * @template [Settings=ReporterSettings]\n *   Options type.\n * @callback Reporter\n *   Type for a reporter.\n * @param {Array<VFile>} files\n *   Files to report.\n * @param {Settings} options\n *   Configuration.\n * @returns {string}\n *   Report.\n */\n\nimport {VFileMessage} from 'vfile-message'\nimport {path} from 'vfile/do-not-use-conditional-minpath'\nimport {proc} from 'vfile/do-not-use-conditional-minproc'\nimport {urlToPath, isUrl} from 'vfile/do-not-use-conditional-minurl'\n\n/**\n * Order of setting (least specific to most), we need this because otherwise\n * `{stem: 'a', path: '~/b.js'}` would throw, as a path is needed before a\n * stem can be set.\n */\nconst order = /** @type {const} */ ([\n  'history',\n  'path',\n  'basename',\n  'stem',\n  'extname',\n  'dirname'\n])\n\nexport class VFile {\n  /**\n   * Create a new virtual file.\n   *\n   * `options` is treated as:\n   *\n   * *   `string` or `Uint8Array` — `{value: options}`\n   * *   `URL` — `{path: options}`\n   * *   `VFile` — shallow copies its data over to the new file\n   * *   `object` — all fields are shallow copied over to the new file\n   *\n   * Path related fields are set in the following order (least specific to\n   * most specific): `history`, `path`, `basename`, `stem`, `extname`,\n   * `dirname`.\n   *\n   * You cannot set `dirname` or `extname` without setting either `history`,\n   * `path`, `basename`, or `stem` too.\n   *\n   * @param {Compatible | null | undefined} [value]\n   *   File value.\n   * @returns\n   *   New instance.\n   */\n  constructor(value) {\n    /** @type {Options | VFile} */\n    let options\n\n    if (!value) {\n      options = {}\n    } else if (isUrl(value)) {\n      options = {path: value}\n    } else if (typeof value === 'string' || isUint8Array(value)) {\n      options = {value}\n    } else {\n      options = value\n    }\n\n    /* eslint-disable no-unused-expressions */\n\n    /**\n     * Base of `path` (default: `process.cwd()` or `'/'` in browsers).\n     *\n     * @type {string}\n     */\n    this.cwd = proc.cwd()\n\n    /**\n     * Place to store custom info (default: `{}`).\n     *\n     * It’s OK to store custom data directly on the file but moving it to\n     * `data` is recommended.\n     *\n     * @type {Data}\n     */\n    this.data = {}\n\n    /**\n     * List of file paths the file moved between.\n     *\n     * The first is the original path and the last is the current path.\n     *\n     * @type {Array<string>}\n     */\n    this.history = []\n\n    /**\n     * List of messages associated with the file.\n     *\n     * @type {Array<VFileMessage>}\n     */\n    this.messages = []\n\n    /**\n     * Raw value.\n     *\n     * @type {Value}\n     */\n    this.value\n\n    // The below are non-standard, they are “well-known”.\n    // As in, used in several tools.\n    /**\n     * Source map.\n     *\n     * This type is equivalent to the `RawSourceMap` type from the `source-map`\n     * module.\n     *\n     * @type {Map | null | undefined}\n     */\n    this.map\n\n    /**\n     * Custom, non-string, compiled, representation.\n     *\n     * This is used by unified to store non-string results.\n     * One example is when turning markdown into React nodes.\n     *\n     * @type {unknown}\n     */\n    this.result\n\n    /**\n     * Whether a file was saved to disk.\n     *\n     * This is used by vfile reporters.\n     *\n     * @type {boolean}\n     */\n    this.stored\n    /* eslint-enable no-unused-expressions */\n\n    // Set path related properties in the correct order.\n    let index = -1\n\n    while (++index < order.length) {\n      const prop = order[index]\n\n      // Note: we specifically use `in` instead of `hasOwnProperty` to accept\n      // `vfile`s too.\n      if (\n        prop in options &&\n        options[prop] !== undefined &&\n        options[prop] !== null\n      ) {\n        // @ts-expect-error: TS doesn’t understand basic reality.\n        this[prop] = prop === 'history' ? [...options[prop]] : options[prop]\n      }\n    }\n\n    /** @type {string} */\n    let prop\n\n    // Set non-path related properties.\n    for (prop in options) {\n      // @ts-expect-error: fine to set other things.\n      if (!order.includes(prop)) {\n        // @ts-expect-error: fine to set other things.\n        this[prop] = options[prop]\n      }\n    }\n  }\n\n  /**\n   * Get the basename (including extname) (example: `'index.min.js'`).\n   *\n   * @returns {string | undefined}\n   *   Basename.\n   */\n  get basename() {\n    return typeof this.path === 'string' ? path.basename(this.path) : undefined\n  }\n\n  /**\n   * Set basename (including extname) (`'index.min.js'`).\n   *\n   * Cannot contain path separators (`'/'` on unix, macOS, and browsers, `'\\'`\n   * on windows).\n   * Cannot be nullified (use `file.path = file.dirname` instead).\n   *\n   * @param {string} basename\n   *   Basename.\n   * @returns {undefined}\n   *   Nothing.\n   */\n  set basename(basename) {\n    assertNonEmpty(basename, 'basename')\n    assertPart(basename, 'basename')\n    this.path = path.join(this.dirname || '', basename)\n  }\n\n  /**\n   * Get the parent path (example: `'~'`).\n   *\n   * @returns {string | undefined}\n   *   Dirname.\n   */\n  get dirname() {\n    return typeof this.path === 'string' ? path.dirname(this.path) : undefined\n  }\n\n  /**\n   * Set the parent path (example: `'~'`).\n   *\n   * Cannot be set if there’s no `path` yet.\n   *\n   * @param {string | undefined} dirname\n   *   Dirname.\n   * @returns {undefined}\n   *   Nothing.\n   */\n  set dirname(dirname) {\n    assertPath(this.basename, 'dirname')\n    this.path = path.join(dirname || '', this.basename)\n  }\n\n  /**\n   * Get the extname (including dot) (example: `'.js'`).\n   *\n   * @returns {string | undefined}\n   *   Extname.\n   */\n  get extname() {\n    return typeof this.path === 'string' ? path.extname(this.path) : undefined\n  }\n\n  /**\n   * Set the extname (including dot) (example: `'.js'`).\n   *\n   * Cannot contain path separators (`'/'` on unix, macOS, and browsers, `'\\'`\n   * on windows).\n   * Cannot be set if there’s no `path` yet.\n   *\n   * @param {string | undefined} extname\n   *   Extname.\n   * @returns {undefined}\n   *   Nothing.\n   */\n  set extname(extname) {\n    assertPart(extname, 'extname')\n    assertPath(this.dirname, 'extname')\n\n    if (extname) {\n      if (extname.codePointAt(0) !== 46 /* `.` */) {\n        throw new Error('`extname` must start with `.`')\n      }\n\n      if (extname.includes('.', 1)) {\n        throw new Error('`extname` cannot contain multiple dots')\n      }\n    }\n\n    this.path = path.join(this.dirname, this.stem + (extname || ''))\n  }\n\n  /**\n   * Get the full path (example: `'~/index.min.js'`).\n   *\n   * @returns {string}\n   *   Path.\n   */\n  get path() {\n    return this.history[this.history.length - 1]\n  }\n\n  /**\n   * Set the full path (example: `'~/index.min.js'`).\n   *\n   * Cannot be nullified.\n   * You can set a file URL (a `URL` object with a `file:` protocol) which will\n   * be turned into a path with `url.fileURLToPath`.\n   *\n   * @param {URL | string} path\n   *   Path.\n   * @returns {undefined}\n   *   Nothing.\n   */\n  set path(path) {\n    if (isUrl(path)) {\n      path = urlToPath(path)\n    }\n\n    assertNonEmpty(path, 'path')\n\n    if (this.path !== path) {\n      this.history.push(path)\n    }\n  }\n\n  /**\n   * Get the stem (basename w/o extname) (example: `'index.min'`).\n   *\n   * @returns {string | undefined}\n   *   Stem.\n   */\n  get stem() {\n    return typeof this.path === 'string'\n      ? path.basename(this.path, this.extname)\n      : undefined\n  }\n\n  /**\n   * Set the stem (basename w/o extname) (example: `'index.min'`).\n   *\n   * Cannot contain path separators (`'/'` on unix, macOS, and browsers, `'\\'`\n   * on windows).\n   * Cannot be nullified (use `file.path = file.dirname` instead).\n   *\n   * @param {string} stem\n   *   Stem.\n   * @returns {undefined}\n   *   Nothing.\n   */\n  set stem(stem) {\n    assertNonEmpty(stem, 'stem')\n    assertPart(stem, 'stem')\n    this.path = path.join(this.dirname || '', stem + (this.extname || ''))\n  }\n\n  // Normal prototypal methods.\n  /**\n   * Create a fatal message for `reason` associated with the file.\n   *\n   * The `fatal` field of the message is set to `true` (error; file not usable)\n   * and the `file` field is set to the current file path.\n   * The message is added to the `messages` field on `file`.\n   *\n   * > 🪦 **Note**: also has obsolete signatures.\n   *\n   * @overload\n   * @param {string} reason\n   * @param {MessageOptions | null | undefined} [options]\n   * @returns {never}\n   *\n   * @overload\n   * @param {string} reason\n   * @param {Node | NodeLike | null | undefined} parent\n   * @param {string | null | undefined} [origin]\n   * @returns {never}\n   *\n   * @overload\n   * @param {string} reason\n   * @param {Point | Position | null | undefined} place\n   * @param {string | null | undefined} [origin]\n   * @returns {never}\n   *\n   * @overload\n   * @param {string} reason\n   * @param {string | null | undefined} [origin]\n   * @returns {never}\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {Node | NodeLike | null | undefined} parent\n   * @param {string | null | undefined} [origin]\n   * @returns {never}\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {Point | Position | null | undefined} place\n   * @param {string | null | undefined} [origin]\n   * @returns {never}\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {string | null | undefined} [origin]\n   * @returns {never}\n   *\n   * @param {Error | VFileMessage | string} causeOrReason\n   *   Reason for message, should use markdown.\n   * @param {Node | NodeLike | MessageOptions | Point | Position | string | null | undefined} [optionsOrParentOrPlace]\n   *   Configuration (optional).\n   * @param {string | null | undefined} [origin]\n   *   Place in code where the message originates (example:\n   *   `'my-package:my-rule'` or `'my-rule'`).\n   * @returns {never}\n   *   Never.\n   * @throws {VFileMessage}\n   *   Message.\n   */\n  fail(causeOrReason, optionsOrParentOrPlace, origin) {\n    // @ts-expect-error: the overloads are fine.\n    const message = this.message(causeOrReason, optionsOrParentOrPlace, origin)\n\n    message.fatal = true\n\n    throw message\n  }\n\n  /**\n   * Create an info message for `reason` associated with the file.\n   *\n   * The `fatal` field of the message is set to `undefined` (info; change\n   * likely not needed) and the `file` field is set to the current file path.\n   * The message is added to the `messages` field on `file`.\n   *\n   * > 🪦 **Note**: also has obsolete signatures.\n   *\n   * @overload\n   * @param {string} reason\n   * @param {MessageOptions | null | undefined} [options]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {string} reason\n   * @param {Node | NodeLike | null | undefined} parent\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {string} reason\n   * @param {Point | Position | null | undefined} place\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {string} reason\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {Node | NodeLike | null | undefined} parent\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {Point | Position | null | undefined} place\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @param {Error | VFileMessage | string} causeOrReason\n   *   Reason for message, should use markdown.\n   * @param {Node | NodeLike | MessageOptions | Point | Position | string | null | undefined} [optionsOrParentOrPlace]\n   *   Configuration (optional).\n   * @param {string | null | undefined} [origin]\n   *   Place in code where the message originates (example:\n   *   `'my-package:my-rule'` or `'my-rule'`).\n   * @returns {VFileMessage}\n   *   Message.\n   */\n  info(causeOrReason, optionsOrParentOrPlace, origin) {\n    // @ts-expect-error: the overloads are fine.\n    const message = this.message(causeOrReason, optionsOrParentOrPlace, origin)\n\n    message.fatal = undefined\n\n    return message\n  }\n\n  /**\n   * Create a message for `reason` associated with the file.\n   *\n   * The `fatal` field of the message is set to `false` (warning; change may be\n   * needed) and the `file` field is set to the current file path.\n   * The message is added to the `messages` field on `file`.\n   *\n   * > 🪦 **Note**: also has obsolete signatures.\n   *\n   * @overload\n   * @param {string} reason\n   * @param {MessageOptions | null | undefined} [options]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {string} reason\n   * @param {Node | NodeLike | null | undefined} parent\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {string} reason\n   * @param {Point | Position | null | undefined} place\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {string} reason\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {Node | NodeLike | null | undefined} parent\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {Point | Position | null | undefined} place\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @overload\n   * @param {Error | VFileMessage} cause\n   * @param {string | null | undefined} [origin]\n   * @returns {VFileMessage}\n   *\n   * @param {Error | VFileMessage | string} causeOrReason\n   *   Reason for message, should use markdown.\n   * @param {Node | NodeLike | MessageOptions | Point | Position | string | null | undefined} [optionsOrParentOrPlace]\n   *   Configuration (optional).\n   * @param {string | null | undefined} [origin]\n   *   Place in code where the message originates (example:\n   *   `'my-package:my-rule'` or `'my-rule'`).\n   * @returns {VFileMessage}\n   *   Message.\n   */\n  message(causeOrReason, optionsOrParentOrPlace, origin) {\n    const message = new VFileMessage(\n      // @ts-expect-error: the overloads are fine.\n      causeOrReason,\n      optionsOrParentOrPlace,\n      origin\n    )\n\n    if (this.path) {\n      message.name = this.path + ':' + message.name\n      message.file = this.path\n    }\n\n    message.fatal = false\n\n    this.messages.push(message)\n\n    return message\n  }\n\n  /**\n   * Serialize the file.\n   *\n   * > **Note**: which encodings are supported depends on the engine.\n   * > For info on Node.js, see:\n   * > <https://nodejs.org/api/util.html#whatwg-supported-encodings>.\n   *\n   * @param {string | null | undefined} [encoding='utf8']\n   *   Character encoding to understand `value` as when it’s a `Uint8Array`\n   *   (default: `'utf-8'`).\n   * @returns {string}\n   *   Serialized file.\n   */\n  toString(encoding) {\n    if (this.value === undefined) {\n      return ''\n    }\n\n    if (typeof this.value === 'string') {\n      return this.value\n    }\n\n    const decoder = new TextDecoder(encoding || undefined)\n    return decoder.decode(this.value)\n  }\n}\n\n/**\n * Assert that `part` is not a path (as in, does not contain `path.sep`).\n *\n * @param {string | null | undefined} part\n *   File path part.\n * @param {string} name\n *   Part name.\n * @returns {undefined}\n *   Nothing.\n */\nfunction assertPart(part, name) {\n  if (part && part.includes(path.sep)) {\n    throw new Error(\n      '`' + name + '` cannot be a path: did not expect `' + path.sep + '`'\n    )\n  }\n}\n\n/**\n * Assert that `part` is not empty.\n *\n * @param {string | undefined} part\n *   Thing.\n * @param {string} name\n *   Part name.\n * @returns {asserts part is string}\n *   Nothing.\n */\nfunction assertNonEmpty(part, name) {\n  if (!part) {\n    throw new Error('`' + name + '` cannot be empty')\n  }\n}\n\n/**\n * Assert `path` exists.\n *\n * @param {string | undefined} path\n *   Path.\n * @param {string} name\n *   Dependency name.\n * @returns {asserts path is string}\n *   Nothing.\n */\nfunction assertPath(path, name) {\n  if (!path) {\n    throw new Error('Setting `' + name + '` requires `path` to be set too')\n  }\n}\n\n/**\n * Assert `value` is an `Uint8Array`.\n *\n * @param {unknown} value\n *   thing.\n * @returns {value is Uint8Array}\n *   Whether `value` is an `Uint8Array`.\n */\nfunction isUint8Array(value) {\n  return Boolean(\n    value &&\n      typeof value === 'object' &&\n      'byteLength' in value &&\n      'byteOffset' in value\n  )\n}\n","export const CallableInstance =\n  /**\n   * @type {new <Parameters extends Array<unknown>, Result>(property: string | symbol) => (...parameters: Parameters) => Result}\n   */\n  (\n    /** @type {unknown} */\n    (\n      /**\n       * @this {Function}\n       * @param {string | symbol} property\n       * @returns {(...parameters: Array<unknown>) => unknown}\n       */\n      function (property) {\n        const self = this\n        const constr = self.constructor\n        const proto = /** @type {Record<string | symbol, Function>} */ (\n          // Prototypes do exist.\n          // type-coverage:ignore-next-line\n          constr.prototype\n        )\n        const func = proto[property]\n        /** @type {(...parameters: Array<unknown>) => unknown} */\n        const apply = function () {\n          return func.apply(apply, arguments)\n        }\n\n        Object.setPrototypeOf(apply, proto)\n\n        const names = Object.getOwnPropertyNames(func)\n\n        for (const p of names) {\n          const descriptor = Object.getOwnPropertyDescriptor(func, p)\n          if (descriptor) Object.defineProperty(apply, p, descriptor)\n        }\n\n        return apply\n      }\n    )\n  )\n","/**\n * @typedef {import('trough').Pipeline} Pipeline\n *\n * @typedef {import('unist').Node} Node\n *\n * @typedef {import('vfile').Compatible} Compatible\n * @typedef {import('vfile').Value} Value\n *\n * @typedef {import('../index.js').CompileResultMap} CompileResultMap\n * @typedef {import('../index.js').Data} Data\n * @typedef {import('../index.js').Settings} Settings\n */\n\n/**\n * @typedef {CompileResultMap[keyof CompileResultMap]} CompileResults\n *   Acceptable results from compilers.\n *\n *   To register custom results, add them to\n *   {@link CompileResultMap `CompileResultMap`}.\n */\n\n/**\n * @template {Node} [Tree=Node]\n *   The node that the compiler receives (default: `Node`).\n * @template {CompileResults} [Result=CompileResults]\n *   The thing that the compiler yields (default: `CompileResults`).\n * @callback Compiler\n *   A **compiler** handles the compiling of a syntax tree to something else\n *   (in most cases, text) (TypeScript type).\n *\n *   It is used in the stringify phase and called with a {@link Node `Node`}\n *   and {@link VFile `VFile`} representation of the document to compile.\n *   It should return the textual representation of the given tree (typically\n *   `string`).\n *\n *   > 👉 **Note**: unified typically compiles by serializing: most compilers\n *   > return `string` (or `Uint8Array`).\n *   > Some compilers, such as the one configured with\n *   > [`rehype-react`][rehype-react], return other values (in this case, a\n *   > React tree).\n *   > If you’re using a compiler that doesn’t serialize, expect different\n *   > result values.\n *   >\n *   > To register custom results in TypeScript, add them to\n *   > {@link CompileResultMap `CompileResultMap`}.\n *\n *   [rehype-react]: https://github.com/rehypejs/rehype-react\n * @param {Tree} tree\n *   Tree to compile.\n * @param {VFile} file\n *   File associated with `tree`.\n * @returns {Result}\n *   New content: compiled text (`string` or `Uint8Array`, for `file.value`) or\n *   something else (for `file.result`).\n */\n\n/**\n * @template {Node} [Tree=Node]\n *   The node that the parser yields (default: `Node`)\n * @callback Parser\n *   A **parser** handles the parsing of text to a syntax tree.\n *\n *   It is used in the parse phase and is called with a `string` and\n *   {@link VFile `VFile`} of the document to parse.\n *   It must return the syntax tree representation of the given file\n *   ({@link Node `Node`}).\n * @param {string} document\n *   Document to parse.\n * @param {VFile} file\n *   File associated with `document`.\n * @returns {Tree}\n *   Node representing the given file.\n */\n\n/**\n * @typedef {(\n *   Plugin<Array<any>, any, any> |\n *   PluginTuple<Array<any>, any, any> |\n *   Preset\n * )} Pluggable\n *   Union of the different ways to add plugins and settings.\n */\n\n/**\n * @typedef {Array<Pluggable>} PluggableList\n *   List of plugins and presets.\n */\n\n// Note: we can’t use `callback` yet as it messes up `this`:\n//  <https://github.com/microsoft/TypeScript/issues/55197>.\n/**\n * @template {Array<unknown>} [PluginParameters=[]]\n *   Arguments passed to the plugin (default: `[]`, the empty tuple).\n * @template {Node | string | undefined} [Input=Node]\n *   Value that is expected as input (default: `Node`).\n *\n *   *   If the plugin returns a {@link Transformer `Transformer`}, this\n *       should be the node it expects.\n *   *   If the plugin sets a {@link Parser `Parser`}, this should be\n *       `string`.\n *   *   If the plugin sets a {@link Compiler `Compiler`}, this should be the\n *       node it expects.\n * @template [Output=Input]\n *   Value that is yielded as output (default: `Input`).\n *\n *   *   If the plugin returns a {@link Transformer `Transformer`}, this\n *       should be the node that that yields.\n *   *   If the plugin sets a {@link Parser `Parser`}, this should be the\n *       node that it yields.\n *   *   If the plugin sets a {@link Compiler `Compiler`}, this should be\n *       result it yields.\n * @typedef {(\n *   (this: Processor, ...parameters: PluginParameters) =>\n *     Input extends string ? // Parser.\n *        Output extends Node | undefined ? undefined | void : never :\n *     Output extends CompileResults ? // Compiler.\n *        Input extends Node | undefined ? undefined | void : never :\n *     Transformer<\n *       Input extends Node ? Input : Node,\n *       Output extends Node ? Output : Node\n *     > | undefined | void\n * )} Plugin\n *   Single plugin.\n *\n *   Plugins configure the processors they are applied on in the following\n *   ways:\n *\n *   *   they change the processor, such as the parser, the compiler, or by\n *       configuring data\n *   *   they specify how to handle trees and files\n *\n *   In practice, they are functions that can receive options and configure the\n *   processor (`this`).\n *\n *   > 👉 **Note**: plugins are called when the processor is *frozen*, not when\n *   > they are applied.\n */\n\n/**\n * Tuple of a plugin and its configuration.\n *\n * The first item is a plugin, the rest are its parameters.\n *\n * @template {Array<unknown>} [TupleParameters=[]]\n *   Arguments passed to the plugin (default: `[]`, the empty tuple).\n * @template {Node | string | undefined} [Input=undefined]\n *   Value that is expected as input (optional).\n *\n *   *   If the plugin returns a {@link Transformer `Transformer`}, this\n *       should be the node it expects.\n *   *   If the plugin sets a {@link Parser `Parser`}, this should be\n *       `string`.\n *   *   If the plugin sets a {@link Compiler `Compiler`}, this should be the\n *       node it expects.\n * @template [Output=undefined] (optional).\n *   Value that is yielded as output.\n *\n *   *   If the plugin returns a {@link Transformer `Transformer`}, this\n *       should be the node that that yields.\n *   *   If the plugin sets a {@link Parser `Parser`}, this should be the\n *       node that it yields.\n *   *   If the plugin sets a {@link Compiler `Compiler`}, this should be\n *       result it yields.\n * @typedef {(\n *   [\n *     plugin: Plugin<TupleParameters, Input, Output>,\n *     ...parameters: TupleParameters\n *   ]\n * )} PluginTuple\n */\n\n/**\n * @typedef Preset\n *   Sharable configuration.\n *\n *   They can contain plugins and settings.\n * @property {PluggableList | undefined} [plugins]\n *   List of plugins and presets (optional).\n * @property {Settings | undefined} [settings]\n *   Shared settings for parsers and compilers (optional).\n */\n\n/**\n * @template {VFile} [File=VFile]\n *   The file that the callback receives (default: `VFile`).\n * @callback ProcessCallback\n *   Callback called when the process is done.\n *\n *   Called with either an error or a result.\n * @param {Error | undefined} [error]\n *   Fatal error (optional).\n * @param {File | undefined} [file]\n *   Processed file (optional).\n * @returns {undefined}\n *   Nothing.\n */\n\n/**\n * @template {Node} [Tree=Node]\n *   The tree that the callback receives (default: `Node`).\n * @callback RunCallback\n *   Callback called when transformers are done.\n *\n *   Called with either an error or results.\n * @param {Error | undefined} [error]\n *   Fatal error (optional).\n * @param {Tree | undefined} [tree]\n *   Transformed tree (optional).\n * @param {VFile | undefined} [file]\n *   File (optional).\n * @returns {undefined}\n *   Nothing.\n */\n\n/**\n * @template {Node} [Output=Node]\n *   Node type that the transformer yields (default: `Node`).\n * @callback TransformCallback\n *   Callback passed to transforms.\n *\n *   If the signature of a `transformer` accepts a third argument, the\n *   transformer may perform asynchronous operations, and must call it.\n * @param {Error | undefined} [error]\n *   Fatal error to stop the process (optional).\n * @param {Output | undefined} [tree]\n *   New, changed, tree (optional).\n * @param {VFile | undefined} [file]\n *   New, changed, file (optional).\n * @returns {undefined}\n *   Nothing.\n */\n\n/**\n * @template {Node} [Input=Node]\n *   Node type that the transformer expects (default: `Node`).\n * @template {Node} [Output=Input]\n *   Node type that the transformer yields (default: `Input`).\n * @callback Transformer\n *   Transformers handle syntax trees and files.\n *\n *   They are functions that are called each time a syntax tree and file are\n *   passed through the run phase.\n *   When an error occurs in them (either because it’s thrown, returned,\n *   rejected, or passed to `next`), the process stops.\n *\n *   The run phase is handled by [`trough`][trough], see its documentation for\n *   the exact semantics of these functions.\n *\n *   > 👉 **Note**: you should likely ignore `next`: don’t accept it.\n *   > it supports callback-style async work.\n *   > But promises are likely easier to reason about.\n *\n *   [trough]: https://github.com/wooorm/trough#function-fninput-next\n * @param {Input} tree\n *   Tree to handle.\n * @param {VFile} file\n *   File to handle.\n * @param {TransformCallback<Output>} next\n *   Callback.\n * @returns {(\n *   Promise<Output | undefined | void> |\n *   Promise<never> | // For some reason this is needed separately.\n *   Output |\n *   Error |\n *   undefined |\n *   void\n * )}\n *   If you accept `next`, nothing.\n *   Otherwise:\n *\n *   *   `Error` — fatal error to stop the process\n *   *   `Promise<undefined>` or `undefined` — the next transformer keeps using\n *       same tree\n *   *   `Promise<Node>` or `Node` — new, changed, tree\n */\n\n/**\n * @template {Node | undefined} ParseTree\n *   Output of `parse`.\n * @template {Node | undefined} HeadTree\n *   Input for `run`.\n * @template {Node | undefined} TailTree\n *   Output for `run`.\n * @template {Node | undefined} CompileTree\n *   Input of `stringify`.\n * @template {CompileResults | undefined} CompileResult\n *   Output of `stringify`.\n * @template {Node | string | undefined} Input\n *   Input of plugin.\n * @template Output\n *   Output of plugin (optional).\n * @typedef {(\n *   Input extends string\n *     ? Output extends Node | undefined\n *       ? // Parser.\n *         Processor<\n *           Output extends undefined ? ParseTree : Output,\n *           HeadTree,\n *           TailTree,\n *           CompileTree,\n *           CompileResult\n *         >\n *       : // Unknown.\n *         Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>\n *     : Output extends CompileResults\n *     ? Input extends Node | undefined\n *       ? // Compiler.\n *         Processor<\n *           ParseTree,\n *           HeadTree,\n *           TailTree,\n *           Input extends undefined ? CompileTree : Input,\n *           Output extends undefined ? CompileResult : Output\n *         >\n *       : // Unknown.\n *         Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>\n *     : Input extends Node | undefined\n *     ? Output extends Node | undefined\n *       ? // Transform.\n *         Processor<\n *           ParseTree,\n *           HeadTree extends undefined ? Input : HeadTree,\n *           Output extends undefined ? TailTree : Output,\n *           CompileTree,\n *           CompileResult\n *         >\n *       : // Unknown.\n *         Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>\n *     : // Unknown.\n *       Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>\n * )} UsePlugin\n *   Create a processor based on the input/output of a {@link Plugin plugin}.\n */\n\n/**\n * @template {CompileResults | undefined} Result\n *   Node type that the transformer yields.\n * @typedef {(\n *   Result extends Value | undefined ?\n *     VFile :\n *     VFile & {result: Result}\n *   )} VFileWithOutput\n *   Type to generate a {@link VFile `VFile`} corresponding to a compiler result.\n *\n *   If a result that is not acceptable on a `VFile` is used, that will\n *   be stored on the `result` field of {@link VFile `VFile`}.\n */\n\nimport {bail} from 'bail'\nimport extend from 'extend'\nimport {ok as assert} from 'devlop'\nimport isPlainObj from 'is-plain-obj'\nimport {trough} from 'trough'\nimport {VFile} from 'vfile'\nimport {CallableInstance} from './callable-instance.js'\n\n// To do: next major: drop `Compiler`, `Parser`: prefer lowercase.\n\n// To do: we could start yielding `never` in TS when a parser is missing and\n// `parse` is called.\n// Currently, we allow directly setting `processor.parser`, which is untyped.\n\nconst own = {}.hasOwnProperty\n\n/**\n * @template {Node | undefined} [ParseTree=undefined]\n *   Output of `parse` (optional).\n * @template {Node | undefined} [HeadTree=undefined]\n *   Input for `run` (optional).\n * @template {Node | undefined} [TailTree=undefined]\n *   Output for `run` (optional).\n * @template {Node | undefined} [CompileTree=undefined]\n *   Input of `stringify` (optional).\n * @template {CompileResults | undefined} [CompileResult=undefined]\n *   Output of `stringify` (optional).\n * @extends {CallableInstance<[], Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>>}\n */\nexport class Processor extends CallableInstance {\n  /**\n   * Create a processor.\n   */\n  constructor() {\n    // If `Processor()` is called (w/o new), `copy` is called instead.\n    super('copy')\n\n    /**\n     * Compiler to use (deprecated).\n     *\n     * @deprecated\n     *   Use `compiler` instead.\n     * @type {(\n     *   Compiler<\n     *     CompileTree extends undefined ? Node : CompileTree,\n     *     CompileResult extends undefined ? CompileResults : CompileResult\n     *   > |\n     *   undefined\n     * )}\n     */\n    this.Compiler = undefined\n\n    /**\n     * Parser to use (deprecated).\n     *\n     * @deprecated\n     *   Use `parser` instead.\n     * @type {(\n     *   Parser<ParseTree extends undefined ? Node : ParseTree> |\n     *   undefined\n     * )}\n     */\n    this.Parser = undefined\n\n    // Note: the following fields are considered private.\n    // However, they are needed for tests, and TSC generates an untyped\n    // `private freezeIndex` field for, which trips `type-coverage` up.\n    // Instead, we use `@deprecated` to visualize that they shouldn’t be used.\n    /**\n     * Internal list of configured plugins.\n     *\n     * @deprecated\n     *   This is a private internal property and should not be used.\n     * @type {Array<PluginTuple<Array<unknown>>>}\n     */\n    this.attachers = []\n\n    /**\n     * Compiler to use.\n     *\n     * @type {(\n     *   Compiler<\n     *     CompileTree extends undefined ? Node : CompileTree,\n     *     CompileResult extends undefined ? CompileResults : CompileResult\n     *   > |\n     *   undefined\n     * )}\n     */\n    this.compiler = undefined\n\n    /**\n     * Internal state to track where we are while freezing.\n     *\n     * @deprecated\n     *   This is a private internal property and should not be used.\n     * @type {number}\n     */\n    this.freezeIndex = -1\n\n    /**\n     * Internal state to track whether we’re frozen.\n     *\n     * @deprecated\n     *   This is a private internal property and should not be used.\n     * @type {boolean | undefined}\n     */\n    this.frozen = undefined\n\n    /**\n     * Internal state.\n     *\n     * @deprecated\n     *   This is a private internal property and should not be used.\n     * @type {Data}\n     */\n    this.namespace = {}\n\n    /**\n     * Parser to use.\n     *\n     * @type {(\n     *   Parser<ParseTree extends undefined ? Node : ParseTree> |\n     *   undefined\n     * )}\n     */\n    this.parser = undefined\n\n    /**\n     * Internal list of configured transformers.\n     *\n     * @deprecated\n     *   This is a private internal property and should not be used.\n     * @type {Pipeline}\n     */\n    this.transformers = trough()\n  }\n\n  /**\n   * Copy a processor.\n   *\n   * @deprecated\n   *   This is a private internal method and should not be used.\n   * @returns {Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>}\n   *   New *unfrozen* processor ({@link Processor `Processor`}) that is\n   *   configured to work the same as its ancestor.\n   *   When the descendant processor is configured in the future it does not\n   *   affect the ancestral processor.\n   */\n  copy() {\n    // Cast as the type parameters will be the same after attaching.\n    const destination =\n      /** @type {Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>} */ (\n        new Processor()\n      )\n    let index = -1\n\n    while (++index < this.attachers.length) {\n      const attacher = this.attachers[index]\n      destination.use(...attacher)\n    }\n\n    destination.data(extend(true, {}, this.namespace))\n\n    return destination\n  }\n\n  /**\n   * Configure the processor with info available to all plugins.\n   * Information is stored in an object.\n   *\n   * Typically, options can be given to a specific plugin, but sometimes it\n   * makes sense to have information shared with several plugins.\n   * For example, a list of HTML elements that are self-closing, which is\n   * needed during all phases.\n   *\n   * > 👉 **Note**: setting information cannot occur on *frozen* processors.\n   * > Call the processor first to create a new unfrozen processor.\n   *\n   * > 👉 **Note**: to register custom data in TypeScript, augment the\n   * > {@link Data `Data`} interface.\n   *\n   * @example\n   *   This example show how to get and set info:\n   *\n   *   ```js\n   *   import {unified} from 'unified'\n   *\n   *   const processor = unified().data('alpha', 'bravo')\n   *\n   *   processor.data('alpha') // => 'bravo'\n   *\n   *   processor.data() // => {alpha: 'bravo'}\n   *\n   *   processor.data({charlie: 'delta'})\n   *\n   *   processor.data() // => {charlie: 'delta'}\n   *   ```\n   *\n   * @template {keyof Data} Key\n   *\n   * @overload\n   * @returns {Data}\n   *\n   * @overload\n   * @param {Data} dataset\n   * @returns {Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>}\n   *\n   * @overload\n   * @param {Key} key\n   * @returns {Data[Key]}\n   *\n   * @overload\n   * @param {Key} key\n   * @param {Data[Key]} value\n   * @returns {Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>}\n   *\n   * @param {Data | Key} [key]\n   *   Key to get or set, or entire dataset to set, or nothing to get the\n   *   entire dataset (optional).\n   * @param {Data[Key]} [value]\n   *   Value to set (optional).\n   * @returns {unknown}\n   *   The current processor when setting, the value at `key` when getting, or\n   *   the entire dataset when getting without key.\n   */\n  data(key, value) {\n    if (typeof key === 'string') {\n      // Set `key`.\n      if (arguments.length === 2) {\n        assertUnfrozen('data', this.frozen)\n        this.namespace[key] = value\n        return this\n      }\n\n      // Get `key`.\n      return (own.call(this.namespace, key) && this.namespace[key]) || undefined\n    }\n\n    // Set space.\n    if (key) {\n      assertUnfrozen('data', this.frozen)\n      this.namespace = key\n      return this\n    }\n\n    // Get space.\n    return this.namespace\n  }\n\n  /**\n   * Freeze a processor.\n   *\n   * Frozen processors are meant to be extended and not to be configured\n   * directly.\n   *\n   * When a processor is frozen it cannot be unfrozen.\n   * New processors working the same way can be created by calling the\n   * processor.\n   *\n   * It’s possible to freeze processors explicitly by calling `.freeze()`.\n   * Processors freeze automatically when `.parse()`, `.run()`, `.runSync()`,\n   * `.stringify()`, `.process()`, or `.processSync()` are called.\n   *\n   * @returns {Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>}\n   *   The current processor.\n   */\n  freeze() {\n    if (this.frozen) {\n      return this\n    }\n\n    // Cast so that we can type plugins easier.\n    // Plugins are supposed to be usable on different processors, not just on\n    // this exact processor.\n    const self = /** @type {Processor} */ (/** @type {unknown} */ (this))\n\n    while (++this.freezeIndex < this.attachers.length) {\n      const [attacher, ...options] = this.attachers[this.freezeIndex]\n\n      if (options[0] === false) {\n        continue\n      }\n\n      if (options[0] === true) {\n        options[0] = undefined\n      }\n\n      const transformer = attacher.call(self, ...options)\n\n      if (typeof transformer === 'function') {\n        this.transformers.use(transformer)\n      }\n    }\n\n    this.frozen = true\n    this.freezeIndex = Number.POSITIVE_INFINITY\n\n    return this\n  }\n\n  /**\n   * Parse text to a syntax tree.\n   *\n   * > 👉 **Note**: `parse` freezes the processor if not already *frozen*.\n   *\n   * > 👉 **Note**: `parse` performs the parse phase, not the run phase or other\n   * > phases.\n   *\n   * @param {Compatible | undefined} [file]\n   *   file to parse (optional); typically `string` or `VFile`; any value\n   *   accepted as `x` in `new VFile(x)`.\n   * @returns {ParseTree extends undefined ? Node : ParseTree}\n   *   Syntax tree representing `file`.\n   */\n  parse(file) {\n    this.freeze()\n    const realFile = vfile(file)\n    const parser = this.parser || this.Parser\n    assertParser('parse', parser)\n    return parser(String(realFile), realFile)\n  }\n\n  /**\n   * Process the given file as configured on the processor.\n   *\n   * > 👉 **Note**: `process` freezes the processor if not already *frozen*.\n   *\n   * > 👉 **Note**: `process` performs the parse, run, and stringify phases.\n   *\n   * @overload\n   * @param {Compatible | undefined} file\n   * @param {ProcessCallback<VFileWithOutput<CompileResult>>} done\n   * @returns {undefined}\n   *\n   * @overload\n   * @param {Compatible | undefined} [file]\n   * @returns {Promise<VFileWithOutput<CompileResult>>}\n   *\n   * @param {Compatible | undefined} [file]\n   *   File (optional); typically `string` or `VFile`]; any value accepted as\n   *   `x` in `new VFile(x)`.\n   * @param {ProcessCallback<VFileWithOutput<CompileResult>> | undefined} [done]\n   *   Callback (optional).\n   * @returns {Promise<VFile> | undefined}\n   *   Nothing if `done` is given.\n   *   Otherwise a promise, rejected with a fatal error or resolved with the\n   *   processed file.\n   *\n   *   The parsed, transformed, and compiled value is available at\n   *   `file.value` (see note).\n   *\n   *   > 👉 **Note**: unified typically compiles by serializing: most\n   *   > compilers return `string` (or `Uint8Array`).\n   *   > Some compilers, such as the one configured with\n   *   > [`rehype-react`][rehype-react], return other values (in this case, a\n   *   > React tree).\n   *   > If you’re using a compiler that doesn’t serialize, expect different\n   *   > result values.\n   *   >\n   *   > To register custom results in TypeScript, add them to\n   *   > {@link CompileResultMap `CompileResultMap`}.\n   *\n   *   [rehype-react]: https://github.com/rehypejs/rehype-react\n   */\n  process(file, done) {\n    const self = this\n\n    this.freeze()\n    assertParser('process', this.parser || this.Parser)\n    assertCompiler('process', this.compiler || this.Compiler)\n\n    return done ? executor(undefined, done) : new Promise(executor)\n\n    // Note: `void`s needed for TS.\n    /**\n     * @param {((file: VFileWithOutput<CompileResult>) => undefined | void) | undefined} resolve\n     * @param {(error: Error | undefined) => undefined | void} reject\n     * @returns {undefined}\n     */\n    function executor(resolve, reject) {\n      const realFile = vfile(file)\n      // Assume `ParseTree` (the result of the parser) matches `HeadTree` (the\n      // input of the first transform).\n      const parseTree =\n        /** @type {HeadTree extends undefined ? Node : HeadTree} */ (\n          /** @type {unknown} */ (self.parse(realFile))\n        )\n\n      self.run(parseTree, realFile, function (error, tree, file) {\n        if (error || !tree || !file) {\n          return realDone(error)\n        }\n\n        // Assume `TailTree` (the output of the last transform) matches\n        // `CompileTree` (the input of the compiler).\n        const compileTree =\n          /** @type {CompileTree extends undefined ? Node : CompileTree} */ (\n            /** @type {unknown} */ (tree)\n          )\n\n        const compileResult = self.stringify(compileTree, file)\n\n        if (looksLikeAValue(compileResult)) {\n          file.value = compileResult\n        } else {\n          file.result = compileResult\n        }\n\n        realDone(error, /** @type {VFileWithOutput<CompileResult>} */ (file))\n      })\n\n      /**\n       * @param {Error | undefined} error\n       * @param {VFileWithOutput<CompileResult> | undefined} [file]\n       * @returns {undefined}\n       */\n      function realDone(error, file) {\n        if (error || !file) {\n          reject(error)\n        } else if (resolve) {\n          resolve(file)\n        } else {\n          assert(done, '`done` is defined if `resolve` is not')\n          done(undefined, file)\n        }\n      }\n    }\n  }\n\n  /**\n   * Process the given file as configured on the processor.\n   *\n   * An error is thrown if asynchronous transforms are configured.\n   *\n   * > 👉 **Note**: `processSync` freezes the processor if not already *frozen*.\n   *\n   * > 👉 **Note**: `processSync` performs the parse, run, and stringify phases.\n   *\n   * @param {Compatible | undefined} [file]\n   *   File (optional); typically `string` or `VFile`; any value accepted as\n   *   `x` in `new VFile(x)`.\n   * @returns {VFileWithOutput<CompileResult>}\n   *   The processed file.\n   *\n   *   The parsed, transformed, and compiled value is available at\n   *   `file.value` (see note).\n   *\n   *   > 👉 **Note**: unified typically compiles by serializing: most\n   *   > compilers return `string` (or `Uint8Array`).\n   *   > Some compilers, such as the one configured with\n   *   > [`rehype-react`][rehype-react], return other values (in this case, a\n   *   > React tree).\n   *   > If you’re using a compiler that doesn’t serialize, expect different\n   *   > result values.\n   *   >\n   *   > To register custom results in TypeScript, add them to\n   *   > {@link CompileResultMap `CompileResultMap`}.\n   *\n   *   [rehype-react]: https://github.com/rehypejs/rehype-react\n   */\n  processSync(file) {\n    /** @type {boolean} */\n    let complete = false\n    /** @type {VFileWithOutput<CompileResult> | undefined} */\n    let result\n\n    this.freeze()\n    assertParser('processSync', this.parser || this.Parser)\n    assertCompiler('processSync', this.compiler || this.Compiler)\n\n    this.process(file, realDone)\n    assertDone('processSync', 'process', complete)\n    assert(result, 'we either bailed on an error or have a tree')\n\n    return result\n\n    /**\n     * @type {ProcessCallback<VFileWithOutput<CompileResult>>}\n     */\n    function realDone(error, file) {\n      complete = true\n      bail(error)\n      result = file\n    }\n  }\n\n  /**\n   * Run *transformers* on a syntax tree.\n   *\n   * > 👉 **Note**: `run` freezes the processor if not already *frozen*.\n   *\n   * > 👉 **Note**: `run` performs the run phase, not other phases.\n   *\n   * @overload\n   * @param {HeadTree extends undefined ? Node : HeadTree} tree\n   * @param {RunCallback<TailTree extends undefined ? Node : TailTree>} done\n   * @returns {undefined}\n   *\n   * @overload\n   * @param {HeadTree extends undefined ? Node : HeadTree} tree\n   * @param {Compatible | undefined} file\n   * @param {RunCallback<TailTree extends undefined ? Node : TailTree>} done\n   * @returns {undefined}\n   *\n   * @overload\n   * @param {HeadTree extends undefined ? Node : HeadTree} tree\n   * @param {Compatible | undefined} [file]\n   * @returns {Promise<TailTree extends undefined ? Node : TailTree>}\n   *\n   * @param {HeadTree extends undefined ? Node : HeadTree} tree\n   *   Tree to transform and inspect.\n   * @param {(\n   *   RunCallback<TailTree extends undefined ? Node : TailTree> |\n   *   Compatible\n   * )} [file]\n   *   File associated with `node` (optional); any value accepted as `x` in\n   *   `new VFile(x)`.\n   * @param {RunCallback<TailTree extends undefined ? Node : TailTree>} [done]\n   *   Callback (optional).\n   * @returns {Promise<TailTree extends undefined ? Node : TailTree> | undefined}\n   *   Nothing if `done` is given.\n   *   Otherwise, a promise rejected with a fatal error or resolved with the\n   *   transformed tree.\n   */\n  run(tree, file, done) {\n    assertNode(tree)\n    this.freeze()\n\n    const transformers = this.transformers\n\n    if (!done && typeof file === 'function') {\n      done = file\n      file = undefined\n    }\n\n    return done ? executor(undefined, done) : new Promise(executor)\n\n    // Note: `void`s needed for TS.\n    /**\n     * @param {(\n     *   ((tree: TailTree extends undefined ? Node : TailTree) => undefined | void) |\n     *   undefined\n     * )} resolve\n     * @param {(error: Error) => undefined | void} reject\n     * @returns {undefined}\n     */\n    function executor(resolve, reject) {\n      assert(\n        typeof file !== 'function',\n        '`file` can’t be a `done` anymore, we checked'\n      )\n      const realFile = vfile(file)\n      transformers.run(tree, realFile, realDone)\n\n      /**\n       * @param {Error | undefined} error\n       * @param {Node} outputTree\n       * @param {VFile} file\n       * @returns {undefined}\n       */\n      function realDone(error, outputTree, file) {\n        const resultingTree =\n          /** @type {TailTree extends undefined ? Node : TailTree} */ (\n            outputTree || tree\n          )\n\n        if (error) {\n          reject(error)\n        } else if (resolve) {\n          resolve(resultingTree)\n        } else {\n          assert(done, '`done` is defined if `resolve` is not')\n          done(undefined, resultingTree, file)\n        }\n      }\n    }\n  }\n\n  /**\n   * Run *transformers* on a syntax tree.\n   *\n   * An error is thrown if asynchronous transforms are configured.\n   *\n   * > 👉 **Note**: `runSync` freezes the processor if not already *frozen*.\n   *\n   * > 👉 **Note**: `runSync` performs the run phase, not other phases.\n   *\n   * @param {HeadTree extends undefined ? Node : HeadTree} tree\n   *   Tree to transform and inspect.\n   * @param {Compatible | undefined} [file]\n   *   File associated with `node` (optional); any value accepted as `x` in\n   *   `new VFile(x)`.\n   * @returns {TailTree extends undefined ? Node : TailTree}\n   *   Transformed tree.\n   */\n  runSync(tree, file) {\n    /** @type {boolean} */\n    let complete = false\n    /** @type {(TailTree extends undefined ? Node : TailTree) | undefined} */\n    let result\n\n    this.run(tree, file, realDone)\n\n    assertDone('runSync', 'run', complete)\n    assert(result, 'we either bailed on an error or have a tree')\n    return result\n\n    /**\n     * @type {RunCallback<TailTree extends undefined ? Node : TailTree>}\n     */\n    function realDone(error, tree) {\n      bail(error)\n      result = tree\n      complete = true\n    }\n  }\n\n  /**\n   * Compile a syntax tree.\n   *\n   * > 👉 **Note**: `stringify` freezes the processor if not already *frozen*.\n   *\n   * > 👉 **Note**: `stringify` performs the stringify phase, not the run phase\n   * > or other phases.\n   *\n   * @param {CompileTree extends undefined ? Node : CompileTree} tree\n   *   Tree to compile.\n   * @param {Compatible | undefined} [file]\n   *   File associated with `node` (optional); any value accepted as `x` in\n   *   `new VFile(x)`.\n   * @returns {CompileResult extends undefined ? Value : CompileResult}\n   *   Textual representation of the tree (see note).\n   *\n   *   > 👉 **Note**: unified typically compiles by serializing: most compilers\n   *   > return `string` (or `Uint8Array`).\n   *   > Some compilers, such as the one configured with\n   *   > [`rehype-react`][rehype-react], return other values (in this case, a\n   *   > React tree).\n   *   > If you’re using a compiler that doesn’t serialize, expect different\n   *   > result values.\n   *   >\n   *   > To register custom results in TypeScript, add them to\n   *   > {@link CompileResultMap `CompileResultMap`}.\n   *\n   *   [rehype-react]: https://github.com/rehypejs/rehype-react\n   */\n  stringify(tree, file) {\n    this.freeze()\n    const realFile = vfile(file)\n    const compiler = this.compiler || this.Compiler\n    assertCompiler('stringify', compiler)\n    assertNode(tree)\n\n    return compiler(tree, realFile)\n  }\n\n  /**\n   * Configure the processor to use a plugin, a list of usable values, or a\n   * preset.\n   *\n   * If the processor is already using a plugin, the previous plugin\n   * configuration is changed based on the options that are passed in.\n   * In other words, the plugin is not added a second time.\n   *\n   * > 👉 **Note**: `use` cannot be called on *frozen* processors.\n   * > Call the processor first to create a new unfrozen processor.\n   *\n   * @example\n   *   There are many ways to pass plugins to `.use()`.\n   *   This example gives an overview:\n   *\n   *   ```js\n   *   import {unified} from 'unified'\n   *\n   *   unified()\n   *     // Plugin with options:\n   *     .use(pluginA, {x: true, y: true})\n   *     // Passing the same plugin again merges configuration (to `{x: true, y: false, z: true}`):\n   *     .use(pluginA, {y: false, z: true})\n   *     // Plugins:\n   *     .use([pluginB, pluginC])\n   *     // Two plugins, the second with options:\n   *     .use([pluginD, [pluginE, {}]])\n   *     // Preset with plugins and settings:\n   *     .use({plugins: [pluginF, [pluginG, {}]], settings: {position: false}})\n   *     // Settings only:\n   *     .use({settings: {position: false}})\n   *   ```\n   *\n   * @template {Array<unknown>} [Parameters=[]]\n   * @template {Node | string | undefined} [Input=undefined]\n   * @template [Output=Input]\n   *\n   * @overload\n   * @param {Preset | null | undefined} [preset]\n   * @returns {Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>}\n   *\n   * @overload\n   * @param {PluggableList} list\n   * @returns {Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>}\n   *\n   * @overload\n   * @param {Plugin<Parameters, Input, Output>} plugin\n   * @param {...(Parameters | [boolean])} parameters\n   * @returns {UsePlugin<ParseTree, HeadTree, TailTree, CompileTree, CompileResult, Input, Output>}\n   *\n   * @param {PluggableList | Plugin | Preset | null | undefined} value\n   *   Usable value.\n   * @param {...unknown} parameters\n   *   Parameters, when a plugin is given as a usable value.\n   * @returns {Processor<ParseTree, HeadTree, TailTree, CompileTree, CompileResult>}\n   *   Current processor.\n   */\n  use(value, ...parameters) {\n    const attachers = this.attachers\n    const namespace = this.namespace\n\n    assertUnfrozen('use', this.frozen)\n\n    if (value === null || value === undefined) {\n      // Empty.\n    } else if (typeof value === 'function') {\n      addPlugin(value, parameters)\n    } else if (typeof value === 'object') {\n      if (Array.isArray(value)) {\n        addList(value)\n      } else {\n        addPreset(value)\n      }\n    } else {\n      throw new TypeError('Expected usable value, not `' + value + '`')\n    }\n\n    return this\n\n    /**\n     * @param {Pluggable} value\n     * @returns {undefined}\n     */\n    function add(value) {\n      if (typeof value === 'function') {\n        addPlugin(value, [])\n      } else if (typeof value === 'object') {\n        if (Array.isArray(value)) {\n          const [plugin, ...parameters] =\n            /** @type {PluginTuple<Array<unknown>>} */ (value)\n          addPlugin(plugin, parameters)\n        } else {\n          addPreset(value)\n        }\n      } else {\n        throw new TypeError('Expected usable value, not `' + value + '`')\n      }\n    }\n\n    /**\n     * @param {Preset} result\n     * @returns {undefined}\n     */\n    function addPreset(result) {\n      if (!('plugins' in result) && !('settings' in result)) {\n        throw new Error(\n          'Expected usable value but received an empty preset, which is probably a mistake: presets typically come with `plugins` and sometimes with `settings`, but this has neither'\n        )\n      }\n\n      addList(result.plugins)\n\n      if (result.settings) {\n        namespace.settings = extend(true, namespace.settings, result.settings)\n      }\n    }\n\n    /**\n     * @param {PluggableList | null | undefined} plugins\n     * @returns {undefined}\n     */\n    function addList(plugins) {\n      let index = -1\n\n      if (plugins === null || plugins === undefined) {\n        // Empty.\n      } else if (Array.isArray(plugins)) {\n        while (++index < plugins.length) {\n          const thing = plugins[index]\n          add(thing)\n        }\n      } else {\n        throw new TypeError('Expected a list of plugins, not `' + plugins + '`')\n      }\n    }\n\n    /**\n     * @param {Plugin} plugin\n     * @param {Array<unknown>} parameters\n     * @returns {undefined}\n     */\n    function addPlugin(plugin, parameters) {\n      let index = -1\n      let entryIndex = -1\n\n      while (++index < attachers.length) {\n        if (attachers[index][0] === plugin) {\n          entryIndex = index\n          break\n        }\n      }\n\n      if (entryIndex === -1) {\n        attachers.push([plugin, ...parameters])\n      }\n      // Only set if there was at least a `primary` value, otherwise we’d change\n      // `arguments.length`.\n      else if (parameters.length > 0) {\n        let [primary, ...rest] = parameters\n        const currentPrimary = attachers[entryIndex][1]\n        if (isPlainObj(currentPrimary) && isPlainObj(primary)) {\n          primary = extend(true, currentPrimary, primary)\n        }\n\n        attachers[entryIndex] = [plugin, primary, ...rest]\n      }\n    }\n  }\n}\n\n// Note: this returns a *callable* instance.\n// That’s why it’s documented as a function.\n/**\n * Create a new processor.\n *\n * @example\n *   This example shows how a new processor can be created (from `remark`) and linked\n *   to **stdin**(4) and **stdout**(4).\n *\n *   ```js\n *   import process from 'node:process'\n *   import concatStream from 'concat-stream'\n *   import {remark} from 'remark'\n *\n *   process.stdin.pipe(\n *     concatStream(function (buf) {\n *       process.stdout.write(String(remark().processSync(buf)))\n *     })\n *   )\n *   ```\n *\n * @returns\n *   New *unfrozen* processor (`processor`).\n *\n *   This processor is configured to work the same as its ancestor.\n *   When the descendant processor is configured in the future it does not\n *   affect the ancestral processor.\n */\nexport const unified = new Processor().freeze()\n\n/**\n * Assert a parser is available.\n *\n * @param {string} name\n * @param {unknown} value\n * @returns {asserts value is Parser}\n */\nfunction assertParser(name, value) {\n  if (typeof value !== 'function') {\n    throw new TypeError('Cannot `' + name + '` without `parser`')\n  }\n}\n\n/**\n * Assert a compiler is available.\n *\n * @param {string} name\n * @param {unknown} value\n * @returns {asserts value is Compiler}\n */\nfunction assertCompiler(name, value) {\n  if (typeof value !== 'function') {\n    throw new TypeError('Cannot `' + name + '` without `compiler`')\n  }\n}\n\n/**\n * Assert the processor is not frozen.\n *\n * @param {string} name\n * @param {unknown} frozen\n * @returns {asserts frozen is false}\n */\nfunction assertUnfrozen(name, frozen) {\n  if (frozen) {\n    throw new Error(\n      'Cannot call `' +\n        name +\n        '` on a frozen processor.\\nCreate a new processor first, by calling it: use `processor()` instead of `processor`.'\n    )\n  }\n}\n\n/**\n * Assert `node` is a unist node.\n *\n * @param {unknown} node\n * @returns {asserts node is Node}\n */\nfunction assertNode(node) {\n  // `isPlainObj` unfortunately uses `any` instead of `unknown`.\n  // type-coverage:ignore-next-line\n  if (!isPlainObj(node) || typeof node.type !== 'string') {\n    throw new TypeError('Expected node, got `' + node + '`')\n    // Fine.\n  }\n}\n\n/**\n * Assert that `complete` is `true`.\n *\n * @param {string} name\n * @param {string} asyncName\n * @param {unknown} complete\n * @returns {asserts complete is true}\n */\nfunction assertDone(name, asyncName, complete) {\n  if (!complete) {\n    throw new Error(\n      '`' + name + '` finished async. Use `' + asyncName + '` instead'\n    )\n  }\n}\n\n/**\n * @param {Compatible | undefined} [value]\n * @returns {VFile}\n */\nfunction vfile(value) {\n  return looksLikeAVFile(value) ? value : new VFile(value)\n}\n\n/**\n * @param {Compatible | undefined} [value]\n * @returns {value is VFile}\n */\nfunction looksLikeAVFile(value) {\n  return Boolean(\n    value &&\n      typeof value === 'object' &&\n      'message' in value &&\n      'messages' in value\n  )\n}\n\n/**\n * @param {unknown} [value]\n * @returns {value is Value}\n */\nfunction looksLikeAValue(value) {\n  return typeof value === 'string' || isUint8Array(value)\n}\n\n/**\n * Assert `value` is an `Uint8Array`.\n *\n * @param {unknown} value\n *   thing.\n * @returns {value is Uint8Array}\n *   Whether `value` is an `Uint8Array`.\n */\nfunction isUint8Array(value) {\n  return Boolean(\n    value &&\n      typeof value === 'object' &&\n      'byteLength' in value &&\n      'byteOffset' in value\n  )\n}\n","var G = (p, h, n) => {\n  if (!h.has(p))\n    throw TypeError(\"Cannot \" + n);\n};\nvar r = (p, h, n) => (G(p, h, \"read from private field\"), n ? n.call(p) : h.get(p)), c = (p, h, n) => {\n  if (h.has(p))\n    throw TypeError(\"Cannot add the same private member more than once\");\n  h instanceof WeakSet ? h.add(p) : h.set(p, n);\n}, o = (p, h, n, t) => (G(p, h, \"write to private field\"), t ? t.call(p, n) : h.set(p, n), n);\nimport { stackOverFlow as L, parserMatchError as W, createNodeInParserFail as X, serializerMatchError as Y } from \"@milkdown/exception\";\nimport { Mark as D } from \"@milkdown/prose/model\";\nclass Q {\n}\nclass U {\n  constructor() {\n    this.elements = [], this.size = () => this.elements.length, this.top = () => this.elements.at(-1), this.push = (h) => {\n      var n;\n      (n = this.top()) == null || n.push(h);\n    }, this.open = (h) => {\n      this.elements.push(h);\n    }, this.close = () => {\n      const h = this.elements.pop();\n      if (!h)\n        throw L();\n      return h;\n    };\n  }\n}\nclass B extends Q {\n  constructor(h, n, t) {\n    super(), this.type = h, this.content = n, this.attrs = t;\n  }\n  push(h, ...n) {\n    this.content.push(h, ...n);\n  }\n  pop() {\n    return this.content.pop();\n  }\n  static create(h, n, t) {\n    return new B(h, n, t);\n  }\n}\nvar d, N, O, T, F, k, M;\nconst S = class S extends U {\n  /// @internal\n  constructor(n) {\n    super();\n    c(this, d, void 0);\n    c(this, N, void 0);\n    c(this, O, void 0);\n    c(this, T, void 0);\n    c(this, F, void 0);\n    c(this, k, void 0);\n    c(this, M, void 0);\n    o(this, d, D.none), o(this, N, (t) => t.isText), o(this, O, (t, s) => {\n      if (r(this, N).call(this, t) && r(this, N).call(this, s) && D.sameSet(t.marks, s.marks))\n        return this.schema.text(t.text + s.text, t.marks);\n    }), o(this, T, (t) => {\n      const s = Object.values({ ...this.schema.nodes, ...this.schema.marks }).find((e) => e.spec.parseMarkdown.match(t));\n      if (!s)\n        throw W(t);\n      return s;\n    }), o(this, F, (t) => {\n      const s = r(this, T).call(this, t);\n      s.spec.parseMarkdown.runner(this, t, s);\n    }), this.injectRoot = (t, s, e) => (this.openNode(s, e), this.next(t.children), this), this.openNode = (t, s) => (this.open(B.create(t, [], s)), this), o(this, k, () => {\n      o(this, d, D.none);\n      const t = this.close();\n      return r(this, M).call(this, t.type, t.attrs, t.content);\n    }), this.closeNode = () => (r(this, k).call(this), this), o(this, M, (t, s, e) => {\n      const i = t.createAndFill(s, e, r(this, d));\n      if (!i)\n        throw X(t, s, e);\n      return this.push(i), i;\n    }), this.addNode = (t, s, e) => (r(this, M).call(this, t, s, e), this), this.openMark = (t, s) => {\n      const e = t.create(s);\n      return o(this, d, e.addToSet(r(this, d))), this;\n    }, this.closeMark = (t) => (o(this, d, t.removeFromSet(r(this, d))), this), this.addText = (t) => {\n      const s = this.top();\n      if (!s)\n        throw L();\n      const e = s.pop(), i = this.schema.text(t, r(this, d));\n      if (!e)\n        return s.push(i), this;\n      const a = r(this, O).call(this, e, i);\n      return a ? (s.push(a), this) : (s.push(e, i), this);\n    }, this.build = () => {\n      let t;\n      do\n        t = r(this, k).call(this);\n      while (this.size());\n      return t;\n    }, this.next = (t = []) => ([t].flat().forEach((s) => r(this, F).call(this, s)), this), this.toDoc = () => this.build(), this.run = (t, s) => {\n      const e = t.runSync(t.parse(s), s);\n      return this.next(e), this;\n    }, this.schema = n;\n  }\n};\nd = new WeakMap(), N = new WeakMap(), O = new WeakMap(), T = new WeakMap(), F = new WeakMap(), k = new WeakMap(), M = new WeakMap(), S.create = (n, t) => {\n  const s = new S(n);\n  return (e) => (s.run(t, e), s.toDoc());\n};\nlet H = S;\nconst q = class q extends Q {\n  constructor(h, n, t, s = {}) {\n    super(), this.type = h, this.children = n, this.value = t, this.props = s, this.push = (e, ...i) => {\n      this.children || (this.children = []), this.children.push(e, ...i);\n    }, this.pop = () => {\n      var e;\n      return (e = this.children) == null ? void 0 : e.pop();\n    };\n  }\n};\nq.create = (h, n, t, s = {}) => new q(h, n, t, s);\nlet J = q;\nconst Z = (p) => Object.prototype.hasOwnProperty.call(p, \"size\");\nvar l, v, A, E, w, j, x, R, m, g, C, P;\nconst z = class z extends U {\n  /// @internal\n  constructor(n) {\n    super();\n    c(this, l, void 0);\n    c(this, v, void 0);\n    c(this, A, void 0);\n    c(this, E, void 0);\n    c(this, w, void 0);\n    c(this, j, void 0);\n    c(this, x, void 0);\n    c(this, R, void 0);\n    c(this, m, void 0);\n    c(this, g, void 0);\n    c(this, C, void 0);\n    c(this, P, void 0);\n    o(this, l, D.none), o(this, v, (t) => {\n      const s = Object.values({ ...this.schema.nodes, ...this.schema.marks }).find((e) => e.spec.toMarkdown.match(t));\n      if (!s)\n        throw Y(t.type);\n      return s;\n    }), o(this, A, (t) => r(this, v).call(this, t).spec.toMarkdown.runner(this, t)), o(this, E, (t, s) => r(this, v).call(this, t).spec.toMarkdown.runner(this, t, s)), o(this, w, (t) => {\n      const { marks: s } = t, e = (u) => u.type.spec.priority ?? 50;\n      [...s].sort((u, f) => e(u) - e(f)).every((u) => !r(this, E).call(this, u, t)) && r(this, A).call(this, t), s.forEach((u) => r(this, P).call(this, u));\n    }), o(this, j, (t, s) => {\n      var f;\n      if (t.type === s || ((f = t.children) == null ? void 0 : f.length) !== 1)\n        return t;\n      const e = (y) => {\n        var I;\n        if (y.type === s)\n          return y;\n        if (((I = y.children) == null ? void 0 : I.length) !== 1)\n          return null;\n        const [b] = y.children;\n        return b ? e(b) : null;\n      }, i = e(t);\n      if (!i)\n        return t;\n      const a = i.children ? [...i.children] : void 0, u = { ...t, children: a };\n      return u.children = a, i.children = [u], i;\n    }), o(this, x, (t) => {\n      const { children: s } = t;\n      return s && (t.children = s.reduce((e, i, a) => {\n        if (a === 0)\n          return [i];\n        const u = e.at(-1);\n        if (u && u.isMark && i.isMark) {\n          i = r(this, j).call(this, i, u.type);\n          const { children: f, ...y } = i, { children: b, ...I } = u;\n          if (i.type === u.type && f && b && JSON.stringify(y) === JSON.stringify(I)) {\n            const V = {\n              ...I,\n              children: [...b, ...f]\n            };\n            return e.slice(0, -1).concat(r(this, x).call(this, V));\n          }\n        }\n        return e.concat(i);\n      }, [])), t;\n    }), o(this, R, (t) => {\n      const s = {\n        ...t.props,\n        type: t.type\n      };\n      return t.children && (s.children = t.children), t.value && (s.value = t.value), s;\n    }), this.openNode = (t, s, e) => (this.open(J.create(t, void 0, s, e)), this), o(this, m, () => {\n      const t = this.close();\n      return r(this, g).call(this, t.type, t.children, t.value, t.props);\n    }), this.closeNode = () => (r(this, m).call(this), this), o(this, g, (t, s, e, i) => {\n      const a = J.create(t, s, e, i), u = r(this, x).call(this, r(this, R).call(this, a));\n      return this.push(u), u;\n    }), this.addNode = (t, s, e, i) => (r(this, g).call(this, t, s, e, i), this), o(this, C, (t, s, e, i) => t.isInSet(r(this, l)) ? this : (o(this, l, t.addToSet(r(this, l))), this.openNode(s, e, { ...i, isMark: !0 }))), o(this, P, (t) => {\n      t.isInSet(r(this, l)) && (o(this, l, t.type.removeFromSet(r(this, l))), r(this, m).call(this));\n    }), this.withMark = (t, s, e, i) => (r(this, C).call(this, t, s, e, i), this), this.closeMark = (t) => (r(this, P).call(this, t), this), this.build = () => {\n      let t = null;\n      do\n        t = r(this, m).call(this);\n      while (this.size());\n      return t;\n    }, this.next = (t) => Z(t) ? (t.forEach((s) => {\n      r(this, w).call(this, s);\n    }), this) : (r(this, w).call(this, t), this), this.toString = (t) => t.stringify(this.build()), this.run = (t) => (this.next(t), this), this.schema = n;\n  }\n};\nl = new WeakMap(), v = new WeakMap(), A = new WeakMap(), E = new WeakMap(), w = new WeakMap(), j = new WeakMap(), x = new WeakMap(), R = new WeakMap(), m = new WeakMap(), g = new WeakMap(), C = new WeakMap(), P = new WeakMap(), z.create = (n, t) => {\n  const s = new z(n);\n  return (e) => (s.run(e), s.toString(t));\n};\nlet K = z;\nexport {\n  H as ParserState,\n  K as SerializerState,\n  U as Stack,\n  Q as StackElement\n};\n//# sourceMappingURL=index.es.js.map\n","var ve = (e, t, r) => {\n  if (!t.has(e))\n    throw TypeError(\"Cannot \" + r);\n};\nvar s = (e, t, r) => (ve(e, t, \"read from private field\"), r ? r.call(e) : t.get(e)), d = (e, t, r) => {\n  if (t.has(e))\n    throw TypeError(\"Cannot add the same private member more than once\");\n  t instanceof WeakSet ? t.add(e) : t.set(e, r);\n}, c = (e, t, r, i) => (ve(e, t, \"write to private field\"), i ? i.call(e, r) : t.set(e, r), r);\nimport { createTimer as v, createSlice as o, Container as Se, Clock as We, Ctx as Ye } from \"@milkdown/ctx\";\nimport { Schema as $e, DOMParser as qe, Node as He } from \"@milkdown/prose/model\";\nimport de from \"remark-parse\";\nimport he from \"remark-stringify\";\nimport { unified as le } from \"unified\";\nimport { ctxCallOutOfScope as Pe, docTypeError as Je, callCommandBeforeEditorView as Fe } from \"@milkdown/exception\";\nimport { ParserState as Ge, SerializerState as Qe } from \"@milkdown/transformer\";\nimport { PluginKey as Re, Plugin as be, EditorState as Ue } from \"@milkdown/prose/state\";\nimport { EditorView as Xe } from \"@milkdown/prose/view\";\nimport { customInputRules as Ze } from \"@milkdown/prose\";\nimport { chainCommands as xe, deleteSelection as et, joinBackward as tt, selectNodeBackward as rt, baseKeymap as st } from \"@milkdown/prose/commands\";\nimport { undoInputRule as it } from \"@milkdown/prose/inputrules\";\nimport { keymap as nt } from \"@milkdown/prose/keymap\";\nfunction k(e, t) {\n  return e.meta = {\n    package: \"@milkdown/core\",\n    group: \"System\",\n    ...t\n  }, e;\n}\nconst De = {\n  strong: (e, t, r, i) => {\n    const n = e.marker || r.options.strong || \"*\", a = r.enter(\"strong\"), h = r.createTracker(i);\n    let m = h.move(n + n);\n    return m += h.move(\n      r.containerPhrasing(e, {\n        before: m,\n        after: n,\n        ...h.current()\n      })\n    ), m += h.move(n + n), a(), m;\n  },\n  emphasis: (e, t, r, i) => {\n    const n = e.marker || r.options.emphasis || \"*\", a = r.enter(\"emphasis\"), h = r.createTracker(i);\n    let m = h.move(n);\n    return m += h.move(\n      r.containerPhrasing(e, {\n        before: m,\n        after: n,\n        ...h.current()\n      })\n    ), m += h.move(n), a(), m;\n  }\n}, L = v(\"ConfigReady\");\nfunction ot(e) {\n  const t = (r) => (r.record(L), async () => (await e(r), r.done(L), () => {\n    r.clearTimer(L);\n  }));\n  return k(t, {\n    displayName: \"Config\"\n  }), t;\n}\nconst M = v(\"InitReady\"), G = o([], \"initTimer\"), ke = o({}, \"editor\"), ue = o([], \"inputRules\"), N = o([], \"prosePlugins\"), pe = o([], \"remarkPlugins\"), fe = o([], \"nodeView\"), ye = o([], \"markView\"), P = o(le().use(de).use(he), \"remark\"), Q = o({\n  handlers: De\n}, \"remarkStringifyOptions\");\nfunction at(e) {\n  const t = (r) => (r.inject(ke, e).inject(N, []).inject(pe, []).inject(ue, []).inject(fe, []).inject(ye, []).inject(Q, {\n    handlers: De\n  }).inject(P, le().use(de).use(he)).inject(G, [L]).record(M), async () => {\n    await r.waitTimers(G);\n    const i = r.get(Q);\n    return r.set(P, le().use(de).use(he, i)), r.done(M), () => {\n      r.remove(ke).remove(N).remove(pe).remove(ue).remove(fe).remove(ye).remove(Q).remove(P).remove(G).clearTimer(M);\n    };\n  });\n  return k(t, {\n    displayName: \"Init\"\n  }), t;\n}\nconst R = v(\"SchemaReady\"), U = o([], \"schemaTimer\"), b = o({}, \"schema\"), X = o([], \"nodes\"), Z = o([], \"marks\");\nfunction Te(e) {\n  var t;\n  return {\n    ...e,\n    parseDOM: (t = e.parseDOM) == null ? void 0 : t.map((r) => ({ priority: e.priority, ...r }))\n  };\n}\nconst Ee = (e) => (e.inject(b, {}).inject(X, []).inject(Z, []).inject(U, [M]).record(R), async () => {\n  await e.waitTimers(U);\n  const t = e.get(P), i = e.get(pe).reduce((m, f) => m.use(f.plugin, f.options), t);\n  e.set(P, i);\n  const n = Object.fromEntries(e.get(X).map(([m, f]) => [m, Te(f)])), a = Object.fromEntries(e.get(Z).map(([m, f]) => [m, Te(f)])), h = new $e({ nodes: n, marks: a });\n  return e.set(b, h), e.done(R), () => {\n    e.remove(b).remove(X).remove(Z).remove(U).clearTimer(R);\n  };\n});\nk(Ee, {\n  displayName: \"Schema\"\n});\nconst W = v(\"ParserReady\"), Ie = () => {\n  throw Pe();\n}, Y = o(Ie, \"parser\"), x = o([], \"parserTimer\"), Ve = (e) => (e.inject(Y, Ie).inject(x, [R]).record(W), async () => {\n  await e.waitTimers(x);\n  const t = e.get(P), r = e.get(b);\n  return e.set(Y, Ge.create(r, t)), e.done(W), () => {\n    e.remove(Y).remove(x).clearTimer(W);\n  };\n});\nk(Ve, {\n  displayName: \"Parser\"\n});\nconst $ = v(\"SerializerReady\"), ee = o([], \"serializerTimer\"), Me = () => {\n  throw Pe();\n}, te = o(Me, \"serializer\"), Ne = (e) => (e.inject(te, Me).inject(ee, [R]).record($), async () => {\n  await e.waitTimers(ee);\n  const t = e.get(P), r = e.get(b);\n  return e.set(te, Qe.create(r, t)), e.done($), () => {\n    e.remove(te).remove(ee).clearTimer($);\n  };\n});\nk(Ne, {\n  displayName: \"Serializer\"\n});\nconst re = o(\"\", \"defaultValue\"), V = o({}, \"editorState\"), se = o((e) => e, \"stateOptions\"), ie = o([], \"editorStateTimer\"), q = v(\"EditorStateReady\");\nfunction ct(e, t, r) {\n  if (typeof e == \"string\")\n    return t(e);\n  if (e.type === \"html\")\n    return qe.fromSchema(r).parse(e.dom);\n  if (e.type === \"json\")\n    return He.fromJSON(r, e.value);\n  throw Je(e);\n}\nconst mt = new Re(\"MILKDOWN_STATE_TRACKER\");\nfunction dt(e) {\n  const t = xe(\n    it,\n    et,\n    tt,\n    rt\n  );\n  return e.Backspace = t, e;\n}\nconst _e = (e) => (e.inject(re, \"\").inject(V, {}).inject(se, (t) => t).inject(ie, [W, $, J]).record(q), async () => {\n  await e.waitTimers(ie);\n  const t = e.get(b), r = e.get(Y), i = e.get(ue), n = e.get(se), a = e.get(N), h = e.get(re), m = ct(h, r, t), f = [\n    ...a,\n    new be({\n      key: mt,\n      state: {\n        init: () => {\n        },\n        apply: (Be, F, ft, Le) => {\n          e.set(V, Le);\n        }\n      }\n    }),\n    Ze({ rules: i }),\n    nt(dt(st))\n  ];\n  e.set(N, f);\n  const B = n({\n    schema: t,\n    doc: m,\n    plugins: f\n  }), l = Ue.create(B);\n  return e.set(V, l), e.done(q), () => {\n    e.remove(re).remove(V).remove(se).remove(ie).clearTimer(q);\n  };\n});\nk(_e, {\n  displayName: \"EditorState\"\n});\nconst ne = v(\"EditorViewReady\"), H = o({}, \"editorView\"), oe = o([], \"editorViewTimer\"), ae = o({}, \"editorViewOptions\"), ce = o(null, \"root\"), we = o(null, \"rootDOM\"), ge = o({}, \"rootAttrs\");\nfunction ht(e, t) {\n  const r = document.createElement(\"div\");\n  r.className = \"milkdown\", e.appendChild(r), t.set(we, r);\n  const i = t.get(ge);\n  return Object.entries(i).forEach(([n, a]) => r.setAttribute(n, a)), r;\n}\nfunction lt(e) {\n  e.classList.add(\"editor\"), e.setAttribute(\"role\", \"textbox\");\n}\nconst ut = new Re(\"MILKDOWN_VIEW_CLEAR\"), ze = (e) => (e.inject(ce, document.body).inject(H, {}).inject(ae, {}).inject(we, null).inject(ge, {}).inject(oe, [q]).record(ne), async () => {\n  await e.wait(M);\n  const t = e.get(ce) || document.body, r = typeof t == \"string\" ? document.querySelector(t) : t;\n  e.update(N, (f) => [\n    new be({\n      key: ut,\n      view: (B) => {\n        const l = r ? ht(r, e) : void 0;\n        return (() => {\n          if (l && r) {\n            const F = B.dom;\n            r.replaceChild(l, F), l.appendChild(F);\n          }\n        })(), {\n          destroy: () => {\n            l != null && l.parentNode && (l == null || l.parentNode.replaceChild(B.dom, l)), l == null || l.remove();\n          }\n        };\n      }\n    }),\n    ...f\n  ]), await e.waitTimers(oe);\n  const i = e.get(V), n = e.get(ae), a = Object.fromEntries(e.get(fe)), h = Object.fromEntries(e.get(ye)), m = new Xe(r, {\n    state: i,\n    nodeViews: a,\n    markViews: h,\n    ...n\n  });\n  return lt(m.dom), e.set(H, m), e.done(ne), () => {\n    m == null || m.destroy(), e.remove(ce).remove(H).remove(ae).remove(we).remove(ge).remove(oe).clearTimer(ne);\n  };\n});\nk(ze, {\n  displayName: \"EditorView\"\n});\nvar T, g;\nclass Ke {\n  constructor() {\n    d(this, T, void 0);\n    d(this, g, void 0);\n    c(this, T, new Se()), c(this, g, null), this.setCtx = (t) => {\n      c(this, g, t);\n    };\n  }\n  get ctx() {\n    return s(this, g);\n  }\n  /// Register a command into the manager.\n  create(t, r) {\n    const i = t.create(s(this, T).sliceMap);\n    return i.set(r), i;\n  }\n  get(t) {\n    return s(this, T).get(t).get();\n  }\n  remove(t) {\n    return s(this, T).remove(t);\n  }\n  call(t, r) {\n    if (s(this, g) == null)\n      throw Fe();\n    const n = this.get(t)(r), a = s(this, g).get(H);\n    return n(a.state, a.dispatch, a);\n  }\n}\nT = new WeakMap(), g = new WeakMap();\nfunction Et(e = \"cmdKey\") {\n  return o(() => () => !1, e);\n}\nconst je = o(new Ke(), \"commands\"), me = o([R], \"commandsTimer\"), J = v(\"CommandsReady\"), Ae = (e) => {\n  const t = new Ke();\n  return t.setCtx(e), e.inject(je, t).inject(me, [R]).record(J), async () => (await e.waitTimers(me), e.done(J), () => {\n    e.remove(je).remove(me).clearTimer(J);\n  });\n};\nk(Ae, {\n  displayName: \"Commands\"\n});\nvar pt = /* @__PURE__ */ ((e) => (e.Idle = \"Idle\", e.OnCreate = \"OnCreate\", e.Created = \"Created\", e.OnDestroy = \"OnDestroy\", e.Destroyed = \"Destroyed\", e))(pt || {}), j, p, y, D, _, z, u, w, O, K, S, E, A, C, I;\nconst Ce = class Ce {\n  constructor() {\n    d(this, j, void 0);\n    d(this, p, void 0);\n    d(this, y, void 0);\n    d(this, D, void 0);\n    d(this, _, void 0);\n    d(this, z, void 0);\n    d(this, u, void 0);\n    d(this, w, void 0);\n    d(this, O, void 0);\n    d(this, K, void 0);\n    d(this, S, void 0);\n    d(this, E, void 0);\n    d(this, A, void 0);\n    d(this, C, void 0);\n    d(this, I, void 0);\n    c(this, j, !1), c(this, p, \"Idle\"), c(this, y, []), c(this, D, () => {\n    }), c(this, _, new Se()), c(this, z, new We()), c(this, u, /* @__PURE__ */ new Map()), c(this, w, /* @__PURE__ */ new Map()), c(this, O, new Ye(s(this, _), s(this, z))), c(this, K, () => {\n      const t = ot(async (i) => {\n        await Promise.all(s(this, y).map((n) => n(i)));\n      }), r = [\n        Ee,\n        Ve,\n        Ne,\n        Ae,\n        _e,\n        ze,\n        at(this),\n        t\n      ];\n      s(this, S).call(this, r, s(this, w));\n    }), c(this, S, (t, r) => {\n      t.forEach((i) => {\n        const n = s(this, O).produce(s(this, j) ? i.meta : void 0), a = i(n);\n        r.set(i, { ctx: n, handler: a, cleanup: void 0 });\n      });\n    }), c(this, E, (t, r = !1) => Promise.all(\n      [t].flat().map((i) => {\n        const n = s(this, u).get(i), a = n == null ? void 0 : n.cleanup;\n        return r ? s(this, u).delete(i) : s(this, u).set(i, { ctx: void 0, handler: void 0, cleanup: void 0 }), typeof a == \"function\" ? a() : a;\n      })\n    )), c(this, A, async () => {\n      await Promise.all([...s(this, w).entries()].map(([t, { cleanup: r }]) => typeof r == \"function\" ? r() : r)), s(this, w).clear();\n    }), c(this, C, (t) => {\n      c(this, p, t), s(this, D).call(this, t);\n    }), c(this, I, (t) => [...t.entries()].map(async ([r, i]) => {\n      const { ctx: n, handler: a } = i;\n      if (!a)\n        return;\n      const h = await a();\n      t.set(r, { ctx: n, handler: a, cleanup: h });\n    })), this.enableInspector = (t = !0) => (c(this, j, t), this), this.onStatusChange = (t) => (c(this, D, t), this), this.config = (t) => (s(this, y).push(t), this), this.removeConfig = (t) => (c(this, y, s(this, y).filter((r) => r !== t)), this), this.use = (t) => {\n      const r = [t].flat();\n      return r.flat().forEach((i) => {\n        s(this, u).set(i, {\n          ctx: void 0,\n          handler: void 0,\n          cleanup: void 0\n        });\n      }), s(this, p) === \"Created\" && s(this, S).call(this, r, s(this, u)), this;\n    }, this.remove = async (t) => s(this, p) === \"OnCreate\" ? (console.warn(\"[Milkdown]: You are trying to remove plugins when the editor is creating, this is not recommended, please check your code.\"), new Promise((r) => {\n      setTimeout(() => {\n        r(this.remove(t));\n      }, 50);\n    })) : (await s(this, E).call(this, [t].flat(), !0), this), this.create = async () => s(this, p) === \"OnCreate\" ? this : (s(this, p) === \"Created\" && await this.destroy(), s(this, C).call(this, \"OnCreate\"), s(this, K).call(this), s(this, S).call(this, [...s(this, u).keys()], s(this, u)), await Promise.all(\n      [\n        s(this, I).call(this, s(this, w)),\n        s(this, I).call(this, s(this, u))\n      ].flat()\n    ), s(this, C).call(this, \"Created\"), this), this.destroy = async (t = !1) => s(this, p) === \"Destroyed\" || s(this, p) === \"OnDestroy\" ? this : s(this, p) === \"OnCreate\" ? new Promise((r) => {\n      setTimeout(() => {\n        r(this.destroy(t));\n      }, 50);\n    }) : (t && c(this, y, []), s(this, C).call(this, \"OnDestroy\"), await s(this, E).call(this, [...s(this, u).keys()], t), await s(this, A).call(this), s(this, C).call(this, \"Destroyed\"), this), this.action = (t) => t(s(this, O)), this.inspect = () => s(this, j) ? [...s(this, w).values(), ...s(this, u).values()].map(({ ctx: t }) => {\n      var r;\n      return (r = t == null ? void 0 : t.inspector) == null ? void 0 : r.read();\n    }).filter((t) => !!t) : (console.warn(\"[Milkdown]: You are trying to collect inspection when inspector is disabled, please enable inspector by `editor.enableInspector()` first.\"), []);\n  }\n  /// Create a new editor instance.\n  static make() {\n    return new Ce();\n  }\n  /// Get the ctx of the editor.\n  get ctx() {\n    return s(this, O);\n  }\n  /// Get the status of the editor.\n  get status() {\n    return s(this, p);\n  }\n};\nj = new WeakMap(), p = new WeakMap(), y = new WeakMap(), D = new WeakMap(), _ = new WeakMap(), z = new WeakMap(), u = new WeakMap(), w = new WeakMap(), O = new WeakMap(), K = new WeakMap(), S = new WeakMap(), E = new WeakMap(), A = new WeakMap(), C = new WeakMap(), I = new WeakMap();\nlet Oe = Ce;\nexport {\n  Ke as CommandManager,\n  J as CommandsReady,\n  L as ConfigReady,\n  Oe as Editor,\n  q as EditorStateReady,\n  pt as EditorStatus,\n  ne as EditorViewReady,\n  M as InitReady,\n  W as ParserReady,\n  R as SchemaReady,\n  $ as SerializerReady,\n  Ae as commands,\n  je as commandsCtx,\n  me as commandsTimerCtx,\n  ot as config,\n  Et as createCmdKey,\n  re as defaultValueCtx,\n  ke as editorCtx,\n  _e as editorState,\n  V as editorStateCtx,\n  se as editorStateOptionsCtx,\n  ie as editorStateTimerCtx,\n  ze as editorView,\n  H as editorViewCtx,\n  ae as editorViewOptionsCtx,\n  oe as editorViewTimerCtx,\n  ct as getDoc,\n  at as init,\n  G as initTimerCtx,\n  ue as inputRulesCtx,\n  ye as markViewCtx,\n  Z as marksCtx,\n  fe as nodeViewCtx,\n  X as nodesCtx,\n  Ve as parser,\n  Y as parserCtx,\n  x as parserTimerCtx,\n  N as prosePluginsCtx,\n  P as remarkCtx,\n  pe as remarkPluginsCtx,\n  Q as remarkStringifyOptionsCtx,\n  ge as rootAttrsCtx,\n  ce as rootCtx,\n  we as rootDOMCtx,\n  Ee as schema,\n  b as schemaCtx,\n  U as schemaTimerCtx,\n  Ne as serializer,\n  te as serializerCtx,\n  ee as serializerTimerCtx\n};\n//# sourceMappingURL=index.es.js.map\n","var P = (o, s, i) => {\n  if (!s.has(o))\n    throw TypeError(\"Cannot \" + i);\n};\nvar e = (o, s, i) => (P(o, s, \"read from private field\"), i ? i.call(o) : s.get(o)), a = (o, s, i) => {\n  if (s.has(o))\n    throw TypeError(\"Cannot add the same private member more than once\");\n  s instanceof WeakSet ? s.add(o) : s.set(o, i);\n}, n = (o, s, i, r) => (P(o, s, \"write to private field\"), r ? r.call(o, i) : s.set(o, i), i);\nimport { contextNotFound as $, ctxCallOutOfScope as F, timerNotFound as N } from \"@milkdown/exception\";\nclass G {\n  constructor() {\n    this.sliceMap = /* @__PURE__ */ new Map(), this.get = (s) => {\n      const i = typeof s == \"string\" ? [...this.sliceMap.values()].find((r) => r.type.name === s) : this.sliceMap.get(s.id);\n      if (!i) {\n        const r = typeof s == \"string\" ? s : s.name;\n        throw $(r);\n      }\n      return i;\n    }, this.remove = (s) => {\n      const i = typeof s == \"string\" ? [...this.sliceMap.values()].find((r) => r.type.name === s) : this.sliceMap.get(s.id);\n      i && this.sliceMap.delete(i.type.id);\n    }, this.has = (s) => typeof s == \"string\" ? [...this.sliceMap.values()].some((i) => i.type.name === s) : this.sliceMap.has(s.id);\n  }\n}\nvar u, m, y;\nclass V {\n  /// @internal\n  constructor(s, i, r) {\n    a(this, u, void 0);\n    /// @internal\n    a(this, m, void 0);\n    a(this, y, void 0);\n    n(this, u, []), n(this, y, () => {\n      e(this, u).forEach((t) => t(e(this, m)));\n    }), this.set = (t) => {\n      n(this, m, t), e(this, y).call(this);\n    }, this.get = () => e(this, m), this.update = (t) => {\n      n(this, m, t(e(this, m))), e(this, y).call(this);\n    }, this.type = r, n(this, m, i), s.set(r.id, this);\n  }\n  /// Add a watcher for changes in the slice.\n  /// Returns a function to remove the watcher.\n  on(s) {\n    return e(this, u).push(s), () => {\n      n(this, u, e(this, u).filter((i) => i !== s));\n    };\n  }\n  /// Add a one-time watcher for changes in the slice.\n  /// The watcher will be removed after it is called.\n  /// Returns a function to remove the watcher.\n  once(s) {\n    const i = this.on((r) => {\n      s(r), i();\n    });\n    return i;\n  }\n  /// Remove a watcher.\n  off(s) {\n    n(this, u, e(this, u).filter((i) => i !== s));\n  }\n  /// Remove all watchers.\n  offAll() {\n    n(this, u, []);\n  }\n}\nu = new WeakMap(), m = new WeakMap(), y = new WeakMap();\nclass W {\n  /// Create a slice type with a default value and a name.\n  /// The name should be unique in the container.\n  constructor(s, i) {\n    this.id = Symbol(`Context-${i}`), this.name = i, this._defaultValue = s, this._typeInfo = () => {\n      throw F();\n    };\n  }\n  /// Create a slice with a container.\n  /// You can also pass a value to override the default value.\n  create(s, i = this._defaultValue) {\n    return new V(s, i, this);\n  }\n}\nconst H = (o, s) => new W(o, s);\nvar D, x, R, w, S, f, M, T, j;\nclass _ {\n  /// Create an inspector with container, clock and metadata.\n  constructor(s, i, r) {\n    /// @internal\n    a(this, D, void 0);\n    /// @internal\n    a(this, x, void 0);\n    /// @internal\n    a(this, R, void 0);\n    a(this, w, void 0);\n    a(this, S, void 0);\n    a(this, f, void 0);\n    a(this, M, void 0);\n    a(this, T, void 0);\n    a(this, j, void 0);\n    n(this, w, /* @__PURE__ */ new Set()), n(this, S, /* @__PURE__ */ new Set()), n(this, f, /* @__PURE__ */ new Map()), n(this, M, /* @__PURE__ */ new Map()), this.read = () => ({\n      metadata: e(this, D),\n      injectedSlices: [...e(this, w)].map((t) => ({\n        name: typeof t == \"string\" ? t : t.name,\n        value: e(this, T).call(this, t)\n      })),\n      consumedSlices: [...e(this, S)].map((t) => ({\n        name: typeof t == \"string\" ? t : t.name,\n        value: e(this, T).call(this, t)\n      })),\n      recordedTimers: [...e(this, f)].map(([t, { duration: h }]) => ({\n        name: t.name,\n        duration: h,\n        status: e(this, j).call(this, t)\n      })),\n      waitTimers: [...e(this, M)].map(([t, { duration: h }]) => ({\n        name: t.name,\n        duration: h,\n        status: e(this, j).call(this, t)\n      }))\n    }), this.onRecord = (t) => {\n      e(this, f).set(t, { start: Date.now(), duration: 0 });\n    }, this.onClear = (t) => {\n      e(this, f).delete(t);\n    }, this.onDone = (t) => {\n      const h = e(this, f).get(t);\n      h && (h.duration = Date.now() - h.start);\n    }, this.onWait = (t, h) => {\n      const v = Date.now();\n      h.finally(() => {\n        e(this, M).set(t, { duration: Date.now() - v });\n      });\n    }, this.onInject = (t) => {\n      e(this, w).add(t);\n    }, this.onRemove = (t) => {\n      e(this, w).delete(t);\n    }, this.onUse = (t) => {\n      e(this, S).add(t);\n    }, n(this, T, (t) => e(this, x).get(t).get()), n(this, j, (t) => e(this, R).get(t).status), n(this, x, s), n(this, R, i), n(this, D, r);\n  }\n}\nD = new WeakMap(), x = new WeakMap(), R = new WeakMap(), w = new WeakMap(), S = new WeakMap(), f = new WeakMap(), M = new WeakMap(), T = new WeakMap(), j = new WeakMap();\nvar d, l, b, c;\nconst L = class L {\n  /// Create a ctx object with container and clock.\n  constructor(s, i, r) {\n    /// @internal\n    a(this, d, void 0);\n    /// @internal\n    a(this, l, void 0);\n    /// @internal\n    a(this, b, void 0);\n    /// @internal\n    a(this, c, void 0);\n    this.produce = (t) => t && Object.keys(t).length ? new L(e(this, d), e(this, l), { ...t }) : this, this.inject = (t, h) => {\n      var O;\n      const v = t.create(e(this, d).sliceMap);\n      return h != null && v.set(h), (O = e(this, c)) == null || O.onInject(t), this;\n    }, this.remove = (t) => {\n      var h;\n      return e(this, d).remove(t), (h = e(this, c)) == null || h.onRemove(t), this;\n    }, this.record = (t) => {\n      var h;\n      return t.create(e(this, l).store), (h = e(this, c)) == null || h.onRecord(t), this;\n    }, this.clearTimer = (t) => {\n      var h;\n      return e(this, l).remove(t), (h = e(this, c)) == null || h.onClear(t), this;\n    }, this.isInjected = (t) => e(this, d).has(t), this.isRecorded = (t) => e(this, l).has(t), this.use = (t) => {\n      var h;\n      return (h = e(this, c)) == null || h.onUse(t), e(this, d).get(t);\n    }, this.get = (t) => this.use(t).get(), this.set = (t, h) => this.use(t).set(h), this.update = (t, h) => this.use(t).update(h), this.timer = (t) => e(this, l).get(t), this.done = (t) => {\n      var h;\n      this.timer(t).done(), (h = e(this, c)) == null || h.onDone(t);\n    }, this.wait = (t) => {\n      var v;\n      const h = this.timer(t).start();\n      return (v = e(this, c)) == null || v.onWait(t, h), h;\n    }, this.waitTimers = async (t) => {\n      await Promise.all(this.get(t).map((h) => this.wait(h)));\n    }, n(this, d, s), n(this, l, i), n(this, b, r), r && n(this, c, new _(s, i, r));\n  }\n  /// Get metadata of the ctx.\n  get meta() {\n    return e(this, b);\n  }\n  /// Get the inspector of the ctx.\n  get inspector() {\n    return e(this, c);\n  }\n};\nd = new WeakMap(), l = new WeakMap(), b = new WeakMap(), c = new WeakMap();\nlet U = L;\nclass J {\n  constructor() {\n    this.store = /* @__PURE__ */ new Map(), this.get = (s) => {\n      const i = this.store.get(s.id);\n      if (!i)\n        throw N(s.name);\n      return i;\n    }, this.remove = (s) => {\n      this.store.delete(s.id);\n    }, this.has = (s) => this.store.has(s.id);\n  }\n}\nvar C, g, E, p, I, k;\nclass q {\n  /// @internal\n  constructor(s, i) {\n    a(this, C, void 0);\n    a(this, g, void 0);\n    /// @internal\n    a(this, E, void 0);\n    a(this, p, void 0);\n    a(this, I, void 0);\n    a(this, k, void 0);\n    n(this, C, null), n(this, g, null), n(this, p, \"pending\"), this.start = () => (e(this, C) ?? n(this, C, new Promise((r, t) => {\n      n(this, g, (h) => {\n        h instanceof CustomEvent && h.detail.id === e(this, E) && (n(this, p, \"resolved\"), e(this, I).call(this), h.stopImmediatePropagation(), r());\n      }), e(this, k).call(this, () => {\n        e(this, p) === \"pending\" && n(this, p, \"rejected\"), e(this, I).call(this), t(new Error(`Timing ${this.type.name} timeout.`));\n      }), n(this, p, \"pending\"), addEventListener(this.type.name, e(this, g));\n    })), e(this, C)), this.done = () => {\n      const r = new CustomEvent(this.type.name, { detail: { id: e(this, E) } });\n      dispatchEvent(r);\n    }, n(this, I, () => {\n      e(this, g) && removeEventListener(this.type.name, e(this, g));\n    }), n(this, k, (r) => {\n      setTimeout(() => {\n        r();\n      }, this.type.timeout);\n    }), n(this, E, Symbol(i.name)), this.type = i, s.set(i.id, this);\n  }\n  /// The status of the timer.\n  /// Can be `pending`, `resolved` or `rejected`.\n  get status() {\n    return e(this, p);\n  }\n}\nC = new WeakMap(), g = new WeakMap(), E = new WeakMap(), p = new WeakMap(), I = new WeakMap(), k = new WeakMap();\nclass A {\n  /// Create a timer type with a name and a timeout.\n  /// The name should be unique in the clock.\n  constructor(s, i = 3e3) {\n    this.create = (r) => new q(r, this), this.id = Symbol(`Timer-${s}`), this.name = s, this.timeout = i;\n  }\n}\nconst K = (o, s = 3e3) => new A(o, s);\nexport {\n  J as Clock,\n  G as Container,\n  U as Ctx,\n  _ as Inspector,\n  V as Slice,\n  W as SliceType,\n  q as Timer,\n  A as TimerType,\n  H as createSlice,\n  K as createTimer\n};\n//# sourceMappingURL=index.es.js.map\n","var n = /* @__PURE__ */ ((e) => (e.docTypeError = \"docTypeError\", e.contextNotFound = \"contextNotFound\", e.timerNotFound = \"timerNotFound\", e.ctxCallOutOfScope = \"ctxCallOutOfScope\", e.createNodeInParserFail = \"createNodeInParserFail\", e.stackOverFlow = \"stackOverFlow\", e.parserMatchError = \"parserMatchError\", e.serializerMatchError = \"serializerMatchError\", e.getAtomFromSchemaFail = \"getAtomFromSchemaFail\", e.expectDomTypeError = \"expectDomTypeError\", e.callCommandBeforeEditorView = \"callCommandBeforeEditorView\", e.missingRootElement = \"missingRootElement\", e.missingNodeInSchema = \"missingNodeInSchema\", e.missingMarkInSchema = \"missingMarkInSchema\", e.ctxNotBind = \"ctxNotBind\", e.missingYjsDoc = \"missingYjsDoc\", e))(n || {});\nclass t extends Error {\n  constructor(o, a) {\n    super(a), this.name = \"MilkdownError\", this.code = o;\n  }\n}\nconst u = (e, o) => typeof o == \"function\" ? \"[Function]\" : o, i = (e) => JSON.stringify(e, u);\nfunction l(e) {\n  return new t(n.docTypeError, `Doc type error, unsupported type: ${i(e)}`);\n}\nfunction d(e) {\n  return new t(n.contextNotFound, `Context \"${e}\" not found, do you forget to inject it?`);\n}\nfunction f(e) {\n  return new t(n.timerNotFound, `Timer \"${e}\" not found, do you forget to record it?`);\n}\nfunction p() {\n  return new t(n.ctxCallOutOfScope, \"Should not call a context out of the plugin.\");\n}\nfunction g(...e) {\n  const o = e.reduce((a, c) => {\n    if (!c)\n      return a;\n    const s = (r) => Array.isArray(r) ? r.map((m) => s(m)).join(\", \") : r.toJSON ? i(r.toJSON()) : r.spec ? i(r.spec) : r.toString();\n    return `${a}, ${s(c)}`;\n  }, \"Create prosemirror node from remark failed in parser\");\n  return new t(n.createNodeInParserFail, o);\n}\nfunction h() {\n  return new t(n.stackOverFlow, \"Stack over flow, cannot pop on an empty stack.\");\n}\nfunction w(e) {\n  return new t(n.parserMatchError, `Cannot match target parser for node: ${i(e)}.`);\n}\nfunction F(e) {\n  return new t(n.serializerMatchError, `Cannot match target serializer for node: ${i(e)}.`);\n}\nfunction N(e, o) {\n  return new t(n.getAtomFromSchemaFail, `Cannot get ${e}: ${o} from schema.`);\n}\nfunction S(e) {\n  return new t(n.expectDomTypeError, `Expect to be a dom, but get: ${i(e)}.`);\n}\nfunction y() {\n  return new t(\n    n.callCommandBeforeEditorView,\n    \"You're trying to call a command before editor view initialized, make sure to get commandManager from ctx after editor view has been initialized\"\n  );\n}\nfunction k() {\n  return new t(\n    n.missingRootElement,\n    \"Missing root element, milkdown cannot find root element of the editor.\"\n  );\n}\nfunction M(e) {\n  return new t(\n    n.missingNodeInSchema,\n    `Missing node in schema, milkdown cannot find \"${e}\" in schema.`\n  );\n}\nfunction x(e) {\n  return new t(\n    n.missingMarkInSchema,\n    `Missing mark in schema, milkdown cannot find \"${e}\" in schema.`\n  );\n}\nfunction O() {\n  return new t(n.ctxNotBind, \"Context not bind, please make sure the plugin has been initialized.\");\n}\nfunction E() {\n  return new t(n.missingYjsDoc, \"Missing yjs doc, please make sure you have bind one.\");\n}\nexport {\n  y as callCommandBeforeEditorView,\n  d as contextNotFound,\n  g as createNodeInParserFail,\n  p as ctxCallOutOfScope,\n  O as ctxNotBind,\n  l as docTypeError,\n  S as expectDomTypeError,\n  N as getAtomFromSchemaFail,\n  x as missingMarkInSchema,\n  M as missingNodeInSchema,\n  k as missingRootElement,\n  E as missingYjsDoc,\n  w as parserMatchError,\n  F as serializerMatchError,\n  h as stackOverFlow,\n  f as timerNotFound\n};\n//# sourceMappingURL=index.es.js.map\n","export default function escapeStringRegexp(string) {\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\t// Escape characters with special meaning either inside or outside character sets.\n\t// Use a simple backslash escape when it’s always valid, and a `\\xnn` escape when the simpler form would be disallowed by Unicode patterns’ stricter grammar.\n\treturn string\n\t\t.replace(/[|\\\\{}()[\\]^$+*?.]/g, '\\\\$&')\n\t\t.replace(/-/g, '\\\\x2d');\n}\n","export default function escapeStringRegexp(string) {\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\t// Escape characters with special meaning either inside or outside character sets.\n\t// Use a simple backslash escape when it’s always valid, and a `\\xnn` escape when the simpler form would be disallowed by Unicode patterns’ stricter grammar.\n\treturn string\n\t\t.replace(/[|\\\\{}()[\\]^$+*?.]/g, '\\\\$&')\n\t\t.replace(/-/g, '\\\\x2d');\n}\n","const replacements = [\n\t// German umlauts\n\t['ß', 'ss'],\n\t['ẞ', 'Ss'],\n\t['ä', 'ae'],\n\t['Ä', 'Ae'],\n\t['ö', 'oe'],\n\t['Ö', 'Oe'],\n\t['ü', 'ue'],\n\t['Ü', 'Ue'],\n\n\t// Latin\n\t['À', 'A'],\n\t['Á', 'A'],\n\t['Â', 'A'],\n\t['Ã', 'A'],\n\t['Ä', 'Ae'],\n\t['Å', 'A'],\n\t['Æ', 'AE'],\n\t['Ç', 'C'],\n\t['È', 'E'],\n\t['É', 'E'],\n\t['Ê', 'E'],\n\t['Ë', 'E'],\n\t['Ì', 'I'],\n\t['Í', 'I'],\n\t['Î', 'I'],\n\t['Ï', 'I'],\n\t['Ð', 'D'],\n\t['Ñ', 'N'],\n\t['Ò', 'O'],\n\t['Ó', 'O'],\n\t['Ô', 'O'],\n\t['Õ', 'O'],\n\t['Ö', 'Oe'],\n\t['Ő', 'O'],\n\t['Ø', 'O'],\n\t['Ù', 'U'],\n\t['Ú', 'U'],\n\t['Û', 'U'],\n\t['Ü', 'Ue'],\n\t['Ű', 'U'],\n\t['Ý', 'Y'],\n\t['Þ', 'TH'],\n\t['ß', 'ss'],\n\t['à', 'a'],\n\t['á', 'a'],\n\t['â', 'a'],\n\t['ã', 'a'],\n\t['ä', 'ae'],\n\t['å', 'a'],\n\t['æ', 'ae'],\n\t['ç', 'c'],\n\t['è', 'e'],\n\t['é', 'e'],\n\t['ê', 'e'],\n\t['ë', 'e'],\n\t['ì', 'i'],\n\t['í', 'i'],\n\t['î', 'i'],\n\t['ï', 'i'],\n\t['ð', 'd'],\n\t['ñ', 'n'],\n\t['ò', 'o'],\n\t['ó', 'o'],\n\t['ô', 'o'],\n\t['õ', 'o'],\n\t['ö', 'oe'],\n\t['ő', 'o'],\n\t['ø', 'o'],\n\t['ù', 'u'],\n\t['ú', 'u'],\n\t['û', 'u'],\n\t['ü', 'ue'],\n\t['ű', 'u'],\n\t['ý', 'y'],\n\t['þ', 'th'],\n\t['ÿ', 'y'],\n\t['ẞ', 'SS'],\n\n\t// Vietnamese\n\t['à', 'a'],\n\t['À', 'A'],\n\t['á', 'a'],\n\t['Á', 'A'],\n\t['â', 'a'],\n\t['Â', 'A'],\n\t['ã', 'a'],\n\t['Ã', 'A'],\n\t['è', 'e'],\n\t['È', 'E'],\n\t['é', 'e'],\n\t['É', 'E'],\n\t['ê', 'e'],\n\t['Ê', 'E'],\n\t['ì', 'i'],\n\t['Ì', 'I'],\n\t['í', 'i'],\n\t['Í', 'I'],\n\t['ò', 'o'],\n\t['Ò', 'O'],\n\t['ó', 'o'],\n\t['Ó', 'O'],\n\t['ô', 'o'],\n\t['Ô', 'O'],\n\t['õ', 'o'],\n\t['Õ', 'O'],\n\t['ù', 'u'],\n\t['Ù', 'U'],\n\t['ú', 'u'],\n\t['Ú', 'U'],\n\t['ý', 'y'],\n\t['Ý', 'Y'],\n\t['ă', 'a'],\n\t['Ă', 'A'],\n\t['Đ', 'D'],\n\t['đ', 'd'],\n\t['ĩ', 'i'],\n\t['Ĩ', 'I'],\n\t['ũ', 'u'],\n\t['Ũ', 'U'],\n\t['ơ', 'o'],\n\t['Ơ', 'O'],\n\t['ư', 'u'],\n\t['Ư', 'U'],\n\t['ạ', 'a'],\n\t['Ạ', 'A'],\n\t['ả', 'a'],\n\t['Ả', 'A'],\n\t['ấ', 'a'],\n\t['Ấ', 'A'],\n\t['ầ', 'a'],\n\t['Ầ', 'A'],\n\t['ẩ', 'a'],\n\t['Ẩ', 'A'],\n\t['ẫ', 'a'],\n\t['Ẫ', 'A'],\n\t['ậ', 'a'],\n\t['Ậ', 'A'],\n\t['ắ', 'a'],\n\t['Ắ', 'A'],\n\t['ằ', 'a'],\n\t['Ằ', 'A'],\n\t['ẳ', 'a'],\n\t['Ẳ', 'A'],\n\t['ẵ', 'a'],\n\t['Ẵ', 'A'],\n\t['ặ', 'a'],\n\t['Ặ', 'A'],\n\t['ẹ', 'e'],\n\t['Ẹ', 'E'],\n\t['ẻ', 'e'],\n\t['Ẻ', 'E'],\n\t['ẽ', 'e'],\n\t['Ẽ', 'E'],\n\t['ế', 'e'],\n\t['Ế', 'E'],\n\t['ề', 'e'],\n\t['Ề', 'E'],\n\t['ể', 'e'],\n\t['Ể', 'E'],\n\t['ễ', 'e'],\n\t['Ễ', 'E'],\n\t['ệ', 'e'],\n\t['Ệ', 'E'],\n\t['ỉ', 'i'],\n\t['Ỉ', 'I'],\n\t['ị', 'i'],\n\t['Ị', 'I'],\n\t['ọ', 'o'],\n\t['Ọ', 'O'],\n\t['ỏ', 'o'],\n\t['Ỏ', 'O'],\n\t['ố', 'o'],\n\t['Ố', 'O'],\n\t['ồ', 'o'],\n\t['Ồ', 'O'],\n\t['ổ', 'o'],\n\t['Ổ', 'O'],\n\t['ỗ', 'o'],\n\t['Ỗ', 'O'],\n\t['ộ', 'o'],\n\t['Ộ', 'O'],\n\t['ớ', 'o'],\n\t['Ớ', 'O'],\n\t['ờ', 'o'],\n\t['Ờ', 'O'],\n\t['ở', 'o'],\n\t['Ở', 'O'],\n\t['ỡ', 'o'],\n\t['Ỡ', 'O'],\n\t['ợ', 'o'],\n\t['Ợ', 'O'],\n\t['ụ', 'u'],\n\t['Ụ', 'U'],\n\t['ủ', 'u'],\n\t['Ủ', 'U'],\n\t['ứ', 'u'],\n\t['Ứ', 'U'],\n\t['ừ', 'u'],\n\t['Ừ', 'U'],\n\t['ử', 'u'],\n\t['Ử', 'U'],\n\t['ữ', 'u'],\n\t['Ữ', 'U'],\n\t['ự', 'u'],\n\t['Ự', 'U'],\n\t['ỳ', 'y'],\n\t['Ỳ', 'Y'],\n\t['ỵ', 'y'],\n\t['Ỵ', 'Y'],\n\t['ỷ', 'y'],\n\t['Ỷ', 'Y'],\n\t['ỹ', 'y'],\n\t['Ỹ', 'Y'],\n\n\t// Arabic\n\t['ء', 'e'],\n\t['آ', 'a'],\n\t['أ', 'a'],\n\t['ؤ', 'w'],\n\t['إ', 'i'],\n\t['ئ', 'y'],\n\t['ا', 'a'],\n\t['ب', 'b'],\n\t['ة', 't'],\n\t['ت', 't'],\n\t['ث', 'th'],\n\t['ج', 'j'],\n\t['ح', 'h'],\n\t['خ', 'kh'],\n\t['د', 'd'],\n\t['ذ', 'dh'],\n\t['ر', 'r'],\n\t['ز', 'z'],\n\t['س', 's'],\n\t['ش', 'sh'],\n\t['ص', 's'],\n\t['ض', 'd'],\n\t['ط', 't'],\n\t['ظ', 'z'],\n\t['ع', 'e'],\n\t['غ', 'gh'],\n\t['ـ', '_'],\n\t['ف', 'f'],\n\t['ق', 'q'],\n\t['ك', 'k'],\n\t['ل', 'l'],\n\t['م', 'm'],\n\t['ن', 'n'],\n\t['ه', 'h'],\n\t['و', 'w'],\n\t['ى', 'a'],\n\t['ي', 'y'],\n\t['َ‎', 'a'],\n\t['ُ', 'u'],\n\t['ِ‎', 'i'],\n\t['٠', '0'],\n\t['١', '1'],\n\t['٢', '2'],\n\t['٣', '3'],\n\t['٤', '4'],\n\t['٥', '5'],\n\t['٦', '6'],\n\t['٧', '7'],\n\t['٨', '8'],\n\t['٩', '9'],\n\n\t// Persian / Farsi\n\t['چ', 'ch'],\n\t['ک', 'k'],\n\t['گ', 'g'],\n\t['پ', 'p'],\n\t['ژ', 'zh'],\n\t['ی', 'y'],\n\t['۰', '0'],\n\t['۱', '1'],\n\t['۲', '2'],\n\t['۳', '3'],\n\t['۴', '4'],\n\t['۵', '5'],\n\t['۶', '6'],\n\t['۷', '7'],\n\t['۸', '8'],\n\t['۹', '9'],\n\n\t// Pashto\n\t['ټ', 'p'],\n\t['ځ', 'z'],\n\t['څ', 'c'],\n\t['ډ', 'd'],\n\t['ﺫ', 'd'],\n\t['ﺭ', 'r'],\n\t['ړ', 'r'],\n\t['ﺯ', 'z'],\n\t['ږ', 'g'],\n\t['ښ', 'x'],\n\t['ګ', 'g'],\n\t['ڼ', 'n'],\n\t['ۀ', 'e'],\n\t['ې', 'e'],\n\t['ۍ', 'ai'],\n\n\t// Urdu\n\t['ٹ', 't'],\n\t['ڈ', 'd'],\n\t['ڑ', 'r'],\n\t['ں', 'n'],\n\t['ہ', 'h'],\n\t['ھ', 'h'],\n\t['ے', 'e'],\n\n\t// Russian\n\t['А', 'A'],\n\t['а', 'a'],\n\t['Б', 'B'],\n\t['б', 'b'],\n\t['В', 'V'],\n\t['в', 'v'],\n\t['Г', 'G'],\n\t['г', 'g'],\n\t['Д', 'D'],\n\t['д', 'd'],\n\t['ъе', 'ye'],\n\t['Ъе', 'Ye'],\n\t['ъЕ', 'yE'],\n\t['ЪЕ', 'YE'],\n\t['Е', 'E'],\n\t['е', 'e'],\n\t['Ё', 'Yo'],\n\t['ё', 'yo'],\n\t['Ж', 'Zh'],\n\t['ж', 'zh'],\n\t['З', 'Z'],\n\t['з', 'z'],\n\t['И', 'I'],\n\t['и', 'i'],\n\t['ый', 'iy'],\n\t['Ый', 'Iy'],\n\t['ЫЙ', 'IY'],\n\t['ыЙ', 'iY'],\n\t['Й', 'Y'],\n\t['й', 'y'],\n\t['К', 'K'],\n\t['к', 'k'],\n\t['Л', 'L'],\n\t['л', 'l'],\n\t['М', 'M'],\n\t['м', 'm'],\n\t['Н', 'N'],\n\t['н', 'n'],\n\t['О', 'O'],\n\t['о', 'o'],\n\t['П', 'P'],\n\t['п', 'p'],\n\t['Р', 'R'],\n\t['р', 'r'],\n\t['С', 'S'],\n\t['с', 's'],\n\t['Т', 'T'],\n\t['т', 't'],\n\t['У', 'U'],\n\t['у', 'u'],\n\t['Ф', 'F'],\n\t['ф', 'f'],\n\t['Х', 'Kh'],\n\t['х', 'kh'],\n\t['Ц', 'Ts'],\n\t['ц', 'ts'],\n\t['Ч', 'Ch'],\n\t['ч', 'ch'],\n\t['Ш', 'Sh'],\n\t['ш', 'sh'],\n\t['Щ', 'Sch'],\n\t['щ', 'sch'],\n\t['Ъ', ''],\n\t['ъ', ''],\n\t['Ы', 'Y'],\n\t['ы', 'y'],\n\t['Ь', ''],\n\t['ь', ''],\n\t['Э', 'E'],\n\t['э', 'e'],\n\t['Ю', 'Yu'],\n\t['ю', 'yu'],\n\t['Я', 'Ya'],\n\t['я', 'ya'],\n\n\t// Romanian\n\t['ă', 'a'],\n\t['Ă', 'A'],\n\t['ș', 's'],\n\t['Ș', 'S'],\n\t['ț', 't'],\n\t['Ț', 'T'],\n\t['ţ', 't'],\n\t['Ţ', 'T'],\n\n\t// Turkish\n\t['ş', 's'],\n\t['Ş', 'S'],\n\t['ç', 'c'],\n\t['Ç', 'C'],\n\t['ğ', 'g'],\n\t['Ğ', 'G'],\n\t['ı', 'i'],\n\t['İ', 'I'],\n\n\t// Armenian\n\t['ա', 'a'],\n\t['Ա', 'A'],\n\t['բ', 'b'],\n\t['Բ', 'B'],\n\t['գ', 'g'],\n\t['Գ', 'G'],\n\t['դ', 'd'],\n\t['Դ', 'D'],\n\t['ե', 'ye'],\n\t['Ե', 'Ye'],\n\t['զ', 'z'],\n\t['Զ', 'Z'],\n\t['է', 'e'],\n\t['Է', 'E'],\n\t['ը', 'y'],\n\t['Ը', 'Y'],\n\t['թ', 't'],\n\t['Թ', 'T'],\n\t['ժ', 'zh'],\n\t['Ժ', 'Zh'],\n\t['ի', 'i'],\n\t['Ի', 'I'],\n\t['լ', 'l'],\n\t['Լ', 'L'],\n\t['խ', 'kh'],\n\t['Խ', 'Kh'],\n\t['ծ', 'ts'],\n\t['Ծ', 'Ts'],\n\t['կ', 'k'],\n\t['Կ', 'K'],\n\t['հ', 'h'],\n\t['Հ', 'H'],\n\t['ձ', 'dz'],\n\t['Ձ', 'Dz'],\n\t['ղ', 'gh'],\n\t['Ղ', 'Gh'],\n\t['ճ', 'tch'],\n\t['Ճ', 'Tch'],\n\t['մ', 'm'],\n\t['Մ', 'M'],\n\t['յ', 'y'],\n\t['Յ', 'Y'],\n\t['ն', 'n'],\n\t['Ն', 'N'],\n\t['շ', 'sh'],\n\t['Շ', 'Sh'],\n\t['ո', 'vo'],\n\t['Ո', 'Vo'],\n\t['չ', 'ch'],\n\t['Չ', 'Ch'],\n\t['պ', 'p'],\n\t['Պ', 'P'],\n\t['ջ', 'j'],\n\t['Ջ', 'J'],\n\t['ռ', 'r'],\n\t['Ռ', 'R'],\n\t['ս', 's'],\n\t['Ս', 'S'],\n\t['վ', 'v'],\n\t['Վ', 'V'],\n\t['տ', 't'],\n\t['Տ', 'T'],\n\t['ր', 'r'],\n\t['Ր', 'R'],\n\t['ց', 'c'],\n\t['Ց', 'C'],\n\t['ու', 'u'],\n\t['ՈՒ', 'U'],\n\t['Ու', 'U'],\n\t['փ', 'p'],\n\t['Փ', 'P'],\n\t['ք', 'q'],\n\t['Ք', 'Q'],\n\t['օ', 'o'],\n\t['Օ', 'O'],\n\t['ֆ', 'f'],\n\t['Ֆ', 'F'],\n\t['և', 'yev'],\n\n\t// Georgian\n\t['ა', 'a'],\n\t['ბ', 'b'],\n\t['გ', 'g'],\n\t['დ', 'd'],\n\t['ე', 'e'],\n\t['ვ', 'v'],\n\t['ზ', 'z'],\n\t['თ', 't'],\n\t['ი', 'i'],\n\t['კ', 'k'],\n\t['ლ', 'l'],\n\t['მ', 'm'],\n\t['ნ', 'n'],\n\t['ო', 'o'],\n\t['პ', 'p'],\n\t['ჟ', 'zh'],\n\t['რ', 'r'],\n\t['ს', 's'],\n\t['ტ', 't'],\n\t['უ', 'u'],\n\t['ფ', 'ph'],\n\t['ქ', 'q'],\n\t['ღ', 'gh'],\n\t['ყ', 'k'],\n\t['შ', 'sh'],\n\t['ჩ', 'ch'],\n\t['ც', 'ts'],\n\t['ძ', 'dz'],\n\t['წ', 'ts'],\n\t['ჭ', 'tch'],\n\t['ხ', 'kh'],\n\t['ჯ', 'j'],\n\t['ჰ', 'h'],\n\n\t// Czech\n\t['č', 'c'],\n\t['ď', 'd'],\n\t['ě', 'e'],\n\t['ň', 'n'],\n\t['ř', 'r'],\n\t['š', 's'],\n\t['ť', 't'],\n\t['ů', 'u'],\n\t['ž', 'z'],\n\t['Č', 'C'],\n\t['Ď', 'D'],\n\t['Ě', 'E'],\n\t['Ň', 'N'],\n\t['Ř', 'R'],\n\t['Š', 'S'],\n\t['Ť', 'T'],\n\t['Ů', 'U'],\n\t['Ž', 'Z'],\n\n\t// Dhivehi\n\t['ހ', 'h'],\n\t['ށ', 'sh'],\n\t['ނ', 'n'],\n\t['ރ', 'r'],\n\t['ބ', 'b'],\n\t['ޅ', 'lh'],\n\t['ކ', 'k'],\n\t['އ', 'a'],\n\t['ވ', 'v'],\n\t['މ', 'm'],\n\t['ފ', 'f'],\n\t['ދ', 'dh'],\n\t['ތ', 'th'],\n\t['ލ', 'l'],\n\t['ގ', 'g'],\n\t['ޏ', 'gn'],\n\t['ސ', 's'],\n\t['ޑ', 'd'],\n\t['ޒ', 'z'],\n\t['ޓ', 't'],\n\t['ޔ', 'y'],\n\t['ޕ', 'p'],\n\t['ޖ', 'j'],\n\t['ޗ', 'ch'],\n\t['ޘ', 'tt'],\n\t['ޙ', 'hh'],\n\t['ޚ', 'kh'],\n\t['ޛ', 'th'],\n\t['ޜ', 'z'],\n\t['ޝ', 'sh'],\n\t['ޞ', 's'],\n\t['ޟ', 'd'],\n\t['ޠ', 't'],\n\t['ޡ', 'z'],\n\t['ޢ', 'a'],\n\t['ޣ', 'gh'],\n\t['ޤ', 'q'],\n\t['ޥ', 'w'],\n\t['ަ', 'a'],\n\t['ާ', 'aa'],\n\t['ި', 'i'],\n\t['ީ', 'ee'],\n\t['ު', 'u'],\n\t['ޫ', 'oo'],\n\t['ެ', 'e'],\n\t['ޭ', 'ey'],\n\t['ޮ', 'o'],\n\t['ޯ', 'oa'],\n\t['ް', ''],\n\n\t// Greek\n\t['α', 'a'],\n\t['β', 'v'],\n\t['γ', 'g'],\n\t['δ', 'd'],\n\t['ε', 'e'],\n\t['ζ', 'z'],\n\t['η', 'i'],\n\t['θ', 'th'],\n\t['ι', 'i'],\n\t['κ', 'k'],\n\t['λ', 'l'],\n\t['μ', 'm'],\n\t['ν', 'n'],\n\t['ξ', 'ks'],\n\t['ο', 'o'],\n\t['π', 'p'],\n\t['ρ', 'r'],\n\t['σ', 's'],\n\t['τ', 't'],\n\t['υ', 'y'],\n\t['φ', 'f'],\n\t['χ', 'x'],\n\t['ψ', 'ps'],\n\t['ω', 'o'],\n\t['ά', 'a'],\n\t['έ', 'e'],\n\t['ί', 'i'],\n\t['ό', 'o'],\n\t['ύ', 'y'],\n\t['ή', 'i'],\n\t['ώ', 'o'],\n\t['ς', 's'],\n\t['ϊ', 'i'],\n\t['ΰ', 'y'],\n\t['ϋ', 'y'],\n\t['ΐ', 'i'],\n\t['Α', 'A'],\n\t['Β', 'B'],\n\t['Γ', 'G'],\n\t['Δ', 'D'],\n\t['Ε', 'E'],\n\t['Ζ', 'Z'],\n\t['Η', 'I'],\n\t['Θ', 'TH'],\n\t['Ι', 'I'],\n\t['Κ', 'K'],\n\t['Λ', 'L'],\n\t['Μ', 'M'],\n\t['Ν', 'N'],\n\t['Ξ', 'KS'],\n\t['Ο', 'O'],\n\t['Π', 'P'],\n\t['Ρ', 'R'],\n\t['Σ', 'S'],\n\t['Τ', 'T'],\n\t['Υ', 'Y'],\n\t['Φ', 'F'],\n\t['Χ', 'X'],\n\t['Ψ', 'PS'],\n\t['Ω', 'O'],\n\t['Ά', 'A'],\n\t['Έ', 'E'],\n\t['Ί', 'I'],\n\t['Ό', 'O'],\n\t['Ύ', 'Y'],\n\t['Ή', 'I'],\n\t['Ώ', 'O'],\n\t['Ϊ', 'I'],\n\t['Ϋ', 'Y'],\n\n\t// Disabled as it conflicts with German and Latin.\n\t// Hungarian\n\t// ['ä', 'a'],\n\t// ['Ä', 'A'],\n\t// ['ö', 'o'],\n\t// ['Ö', 'O'],\n\t// ['ü', 'u'],\n\t// ['Ü', 'U'],\n\t// ['ű', 'u'],\n\t// ['Ű', 'U'],\n\n\t// Latvian\n\t['ā', 'a'],\n\t['ē', 'e'],\n\t['ģ', 'g'],\n\t['ī', 'i'],\n\t['ķ', 'k'],\n\t['ļ', 'l'],\n\t['ņ', 'n'],\n\t['ū', 'u'],\n\t['Ā', 'A'],\n\t['Ē', 'E'],\n\t['Ģ', 'G'],\n\t['Ī', 'I'],\n\t['Ķ', 'K'],\n\t['Ļ', 'L'],\n\t['Ņ', 'N'],\n\t['Ū', 'U'],\n\t['č', 'c'],\n\t['š', 's'],\n\t['ž', 'z'],\n\t['Č', 'C'],\n\t['Š', 'S'],\n\t['Ž', 'Z'],\n\n\t// Lithuanian\n\t['ą', 'a'],\n\t['č', 'c'],\n\t['ę', 'e'],\n\t['ė', 'e'],\n\t['į', 'i'],\n\t['š', 's'],\n\t['ų', 'u'],\n\t['ū', 'u'],\n\t['ž', 'z'],\n\t['Ą', 'A'],\n\t['Č', 'C'],\n\t['Ę', 'E'],\n\t['Ė', 'E'],\n\t['Į', 'I'],\n\t['Š', 'S'],\n\t['Ų', 'U'],\n\t['Ū', 'U'],\n\n\t// Macedonian\n\t['Ќ', 'Kj'],\n\t['ќ', 'kj'],\n\t['Љ', 'Lj'],\n\t['љ', 'lj'],\n\t['Њ', 'Nj'],\n\t['њ', 'nj'],\n\t['Тс', 'Ts'],\n\t['тс', 'ts'],\n\n\t// Polish\n\t['ą', 'a'],\n\t['ć', 'c'],\n\t['ę', 'e'],\n\t['ł', 'l'],\n\t['ń', 'n'],\n\t['ś', 's'],\n\t['ź', 'z'],\n\t['ż', 'z'],\n\t['Ą', 'A'],\n\t['Ć', 'C'],\n\t['Ę', 'E'],\n\t['Ł', 'L'],\n\t['Ń', 'N'],\n\t['Ś', 'S'],\n\t['Ź', 'Z'],\n\t['Ż', 'Z'],\n\n\t// Disabled as it conflicts with Vietnamese.\n\t// Serbian\n\t// ['љ', 'lj'],\n\t// ['њ', 'nj'],\n\t// ['Љ', 'Lj'],\n\t// ['Њ', 'Nj'],\n\t// ['đ', 'dj'],\n\t// ['Đ', 'Dj'],\n\t// ['ђ', 'dj'],\n\t// ['ј', 'j'],\n\t// ['ћ', 'c'],\n\t// ['џ', 'dz'],\n\t// ['Ђ', 'Dj'],\n\t// ['Ј', 'j'],\n\t// ['Ћ', 'C'],\n\t// ['Џ', 'Dz'],\n\n\t// Disabled as it conflicts with German and Latin.\n\t// Slovak\n\t// ['ä', 'a'],\n\t// ['Ä', 'A'],\n\t// ['ľ', 'l'],\n\t// ['ĺ', 'l'],\n\t// ['ŕ', 'r'],\n\t// ['Ľ', 'L'],\n\t// ['Ĺ', 'L'],\n\t// ['Ŕ', 'R'],\n\n\t// Disabled as it conflicts with German and Latin.\n\t// Swedish\n\t// ['å', 'o'],\n\t// ['Å', 'o'],\n\t// ['ä', 'a'],\n\t// ['Ä', 'A'],\n\t// ['ë', 'e'],\n\t// ['Ë', 'E'],\n\t// ['ö', 'o'],\n\t// ['Ö', 'O'],\n\n\t// Ukrainian\n\t['Є', 'Ye'],\n\t['І', 'I'],\n\t['Ї', 'Yi'],\n\t['Ґ', 'G'],\n\t['є', 'ye'],\n\t['і', 'i'],\n\t['ї', 'yi'],\n\t['ґ', 'g'],\n\n\t// Dutch\n\t['IJ', 'IJ'],\n\t['ij', 'ij'],\n\n\t// Danish\n\t// ['Æ', 'Ae'],\n\t// ['Ø', 'Oe'],\n\t// ['Å', 'Aa'],\n\t// ['æ', 'ae'],\n\t// ['ø', 'oe'],\n\t// ['å', 'aa']\n\n\t// Currencies\n\t['¢', 'c'],\n\t['¥', 'Y'],\n\t['߿', 'b'],\n\t['৳', 't'],\n\t['૱', 'Bo'],\n\t['฿', 'B'],\n\t['₠', 'CE'],\n\t['₡', 'C'],\n\t['₢', 'Cr'],\n\t['₣', 'F'],\n\t['₥', 'm'],\n\t['₦', 'N'],\n\t['₧', 'Pt'],\n\t['₨', 'Rs'],\n\t['₩', 'W'],\n\t['₫', 's'],\n\t['€', 'E'],\n\t['₭', 'K'],\n\t['₮', 'T'],\n\t['₯', 'Dp'],\n\t['₰', 'S'],\n\t['₱', 'P'],\n\t['₲', 'G'],\n\t['₳', 'A'],\n\t['₴', 'S'],\n\t['₵', 'C'],\n\t['₶', 'tt'],\n\t['₷', 'S'],\n\t['₸', 'T'],\n\t['₹', 'R'],\n\t['₺', 'L'],\n\t['₽', 'P'],\n\t['₿', 'B'],\n\t['﹩', '$'],\n\t['￠', 'c'],\n\t['￥', 'Y'],\n\t['￦', 'W'],\n\n\t// Latin\n\t['𝐀', 'A'],\n\t['𝐁', 'B'],\n\t['𝐂', 'C'],\n\t['𝐃', 'D'],\n\t['𝐄', 'E'],\n\t['𝐅', 'F'],\n\t['𝐆', 'G'],\n\t['𝐇', 'H'],\n\t['𝐈', 'I'],\n\t['𝐉', 'J'],\n\t['𝐊', 'K'],\n\t['𝐋', 'L'],\n\t['𝐌', 'M'],\n\t['𝐍', 'N'],\n\t['𝐎', 'O'],\n\t['𝐏', 'P'],\n\t['𝐐', 'Q'],\n\t['𝐑', 'R'],\n\t['𝐒', 'S'],\n\t['𝐓', 'T'],\n\t['𝐔', 'U'],\n\t['𝐕', 'V'],\n\t['𝐖', 'W'],\n\t['𝐗', 'X'],\n\t['𝐘', 'Y'],\n\t['𝐙', 'Z'],\n\t['𝐚', 'a'],\n\t['𝐛', 'b'],\n\t['𝐜', 'c'],\n\t['𝐝', 'd'],\n\t['𝐞', 'e'],\n\t['𝐟', 'f'],\n\t['𝐠', 'g'],\n\t['𝐡', 'h'],\n\t['𝐢', 'i'],\n\t['𝐣', 'j'],\n\t['𝐤', 'k'],\n\t['𝐥', 'l'],\n\t['𝐦', 'm'],\n\t['𝐧', 'n'],\n\t['𝐨', 'o'],\n\t['𝐩', 'p'],\n\t['𝐪', 'q'],\n\t['𝐫', 'r'],\n\t['𝐬', 's'],\n\t['𝐭', 't'],\n\t['𝐮', 'u'],\n\t['𝐯', 'v'],\n\t['𝐰', 'w'],\n\t['𝐱', 'x'],\n\t['𝐲', 'y'],\n\t['𝐳', 'z'],\n\t['𝐴', 'A'],\n\t['𝐵', 'B'],\n\t['𝐶', 'C'],\n\t['𝐷', 'D'],\n\t['𝐸', 'E'],\n\t['𝐹', 'F'],\n\t['𝐺', 'G'],\n\t['𝐻', 'H'],\n\t['𝐼', 'I'],\n\t['𝐽', 'J'],\n\t['𝐾', 'K'],\n\t['𝐿', 'L'],\n\t['𝑀', 'M'],\n\t['𝑁', 'N'],\n\t['𝑂', 'O'],\n\t['𝑃', 'P'],\n\t['𝑄', 'Q'],\n\t['𝑅', 'R'],\n\t['𝑆', 'S'],\n\t['𝑇', 'T'],\n\t['𝑈', 'U'],\n\t['𝑉', 'V'],\n\t['𝑊', 'W'],\n\t['𝑋', 'X'],\n\t['𝑌', 'Y'],\n\t['𝑍', 'Z'],\n\t['𝑎', 'a'],\n\t['𝑏', 'b'],\n\t['𝑐', 'c'],\n\t['𝑑', 'd'],\n\t['𝑒', 'e'],\n\t['𝑓', 'f'],\n\t['𝑔', 'g'],\n\t['𝑖', 'i'],\n\t['𝑗', 'j'],\n\t['𝑘', 'k'],\n\t['𝑙', 'l'],\n\t['𝑚', 'm'],\n\t['𝑛', 'n'],\n\t['𝑜', 'o'],\n\t['𝑝', 'p'],\n\t['𝑞', 'q'],\n\t['𝑟', 'r'],\n\t['𝑠', 's'],\n\t['𝑡', 't'],\n\t['𝑢', 'u'],\n\t['𝑣', 'v'],\n\t['𝑤', 'w'],\n\t['𝑥', 'x'],\n\t['𝑦', 'y'],\n\t['𝑧', 'z'],\n\t['𝑨', 'A'],\n\t['𝑩', 'B'],\n\t['𝑪', 'C'],\n\t['𝑫', 'D'],\n\t['𝑬', 'E'],\n\t['𝑭', 'F'],\n\t['𝑮', 'G'],\n\t['𝑯', 'H'],\n\t['𝑰', 'I'],\n\t['𝑱', 'J'],\n\t['𝑲', 'K'],\n\t['𝑳', 'L'],\n\t['𝑴', 'M'],\n\t['𝑵', 'N'],\n\t['𝑶', 'O'],\n\t['𝑷', 'P'],\n\t['𝑸', 'Q'],\n\t['𝑹', 'R'],\n\t['𝑺', 'S'],\n\t['𝑻', 'T'],\n\t['𝑼', 'U'],\n\t['𝑽', 'V'],\n\t['𝑾', 'W'],\n\t['𝑿', 'X'],\n\t['𝒀', 'Y'],\n\t['𝒁', 'Z'],\n\t['𝒂', 'a'],\n\t['𝒃', 'b'],\n\t['𝒄', 'c'],\n\t['𝒅', 'd'],\n\t['𝒆', 'e'],\n\t['𝒇', 'f'],\n\t['𝒈', 'g'],\n\t['𝒉', 'h'],\n\t['𝒊', 'i'],\n\t['𝒋', 'j'],\n\t['𝒌', 'k'],\n\t['𝒍', 'l'],\n\t['𝒎', 'm'],\n\t['𝒏', 'n'],\n\t['𝒐', 'o'],\n\t['𝒑', 'p'],\n\t['𝒒', 'q'],\n\t['𝒓', 'r'],\n\t['𝒔', 's'],\n\t['𝒕', 't'],\n\t['𝒖', 'u'],\n\t['𝒗', 'v'],\n\t['𝒘', 'w'],\n\t['𝒙', 'x'],\n\t['𝒚', 'y'],\n\t['𝒛', 'z'],\n\t['𝒜', 'A'],\n\t['𝒞', 'C'],\n\t['𝒟', 'D'],\n\t['𝒢', 'g'],\n\t['𝒥', 'J'],\n\t['𝒦', 'K'],\n\t['𝒩', 'N'],\n\t['𝒪', 'O'],\n\t['𝒫', 'P'],\n\t['𝒬', 'Q'],\n\t['𝒮', 'S'],\n\t['𝒯', 'T'],\n\t['𝒰', 'U'],\n\t['𝒱', 'V'],\n\t['𝒲', 'W'],\n\t['𝒳', 'X'],\n\t['𝒴', 'Y'],\n\t['𝒵', 'Z'],\n\t['𝒶', 'a'],\n\t['𝒷', 'b'],\n\t['𝒸', 'c'],\n\t['𝒹', 'd'],\n\t['𝒻', 'f'],\n\t['𝒽', 'h'],\n\t['𝒾', 'i'],\n\t['𝒿', 'j'],\n\t['𝓀', 'h'],\n\t['𝓁', 'l'],\n\t['𝓂', 'm'],\n\t['𝓃', 'n'],\n\t['𝓅', 'p'],\n\t['𝓆', 'q'],\n\t['𝓇', 'r'],\n\t['𝓈', 's'],\n\t['𝓉', 't'],\n\t['𝓊', 'u'],\n\t['𝓋', 'v'],\n\t['𝓌', 'w'],\n\t['𝓍', 'x'],\n\t['𝓎', 'y'],\n\t['𝓏', 'z'],\n\t['𝓐', 'A'],\n\t['𝓑', 'B'],\n\t['𝓒', 'C'],\n\t['𝓓', 'D'],\n\t['𝓔', 'E'],\n\t['𝓕', 'F'],\n\t['𝓖', 'G'],\n\t['𝓗', 'H'],\n\t['𝓘', 'I'],\n\t['𝓙', 'J'],\n\t['𝓚', 'K'],\n\t['𝓛', 'L'],\n\t['𝓜', 'M'],\n\t['𝓝', 'N'],\n\t['𝓞', 'O'],\n\t['𝓟', 'P'],\n\t['𝓠', 'Q'],\n\t['𝓡', 'R'],\n\t['𝓢', 'S'],\n\t['𝓣', 'T'],\n\t['𝓤', 'U'],\n\t['𝓥', 'V'],\n\t['𝓦', 'W'],\n\t['𝓧', 'X'],\n\t['𝓨', 'Y'],\n\t['𝓩', 'Z'],\n\t['𝓪', 'a'],\n\t['𝓫', 'b'],\n\t['𝓬', 'c'],\n\t['𝓭', 'd'],\n\t['𝓮', 'e'],\n\t['𝓯', 'f'],\n\t['𝓰', 'g'],\n\t['𝓱', 'h'],\n\t['𝓲', 'i'],\n\t['𝓳', 'j'],\n\t['𝓴', 'k'],\n\t['𝓵', 'l'],\n\t['𝓶', 'm'],\n\t['𝓷', 'n'],\n\t['𝓸', 'o'],\n\t['𝓹', 'p'],\n\t['𝓺', 'q'],\n\t['𝓻', 'r'],\n\t['𝓼', 's'],\n\t['𝓽', 't'],\n\t['𝓾', 'u'],\n\t['𝓿', 'v'],\n\t['𝔀', 'w'],\n\t['𝔁', 'x'],\n\t['𝔂', 'y'],\n\t['𝔃', 'z'],\n\t['𝔄', 'A'],\n\t['𝔅', 'B'],\n\t['𝔇', 'D'],\n\t['𝔈', 'E'],\n\t['𝔉', 'F'],\n\t['𝔊', 'G'],\n\t['𝔍', 'J'],\n\t['𝔎', 'K'],\n\t['𝔏', 'L'],\n\t['𝔐', 'M'],\n\t['𝔑', 'N'],\n\t['𝔒', 'O'],\n\t['𝔓', 'P'],\n\t['𝔔', 'Q'],\n\t['𝔖', 'S'],\n\t['𝔗', 'T'],\n\t['𝔘', 'U'],\n\t['𝔙', 'V'],\n\t['𝔚', 'W'],\n\t['𝔛', 'X'],\n\t['𝔜', 'Y'],\n\t['𝔞', 'a'],\n\t['𝔟', 'b'],\n\t['𝔠', 'c'],\n\t['𝔡', 'd'],\n\t['𝔢', 'e'],\n\t['𝔣', 'f'],\n\t['𝔤', 'g'],\n\t['𝔥', 'h'],\n\t['𝔦', 'i'],\n\t['𝔧', 'j'],\n\t['𝔨', 'k'],\n\t['𝔩', 'l'],\n\t['𝔪', 'm'],\n\t['𝔫', 'n'],\n\t['𝔬', 'o'],\n\t['𝔭', 'p'],\n\t['𝔮', 'q'],\n\t['𝔯', 'r'],\n\t['𝔰', 's'],\n\t['𝔱', 't'],\n\t['𝔲', 'u'],\n\t['𝔳', 'v'],\n\t['𝔴', 'w'],\n\t['𝔵', 'x'],\n\t['𝔶', 'y'],\n\t['𝔷', 'z'],\n\t['𝔸', 'A'],\n\t['𝔹', 'B'],\n\t['𝔻', 'D'],\n\t['𝔼', 'E'],\n\t['𝔽', 'F'],\n\t['𝔾', 'G'],\n\t['𝕀', 'I'],\n\t['𝕁', 'J'],\n\t['𝕂', 'K'],\n\t['𝕃', 'L'],\n\t['𝕄', 'M'],\n\t['𝕆', 'N'],\n\t['𝕊', 'S'],\n\t['𝕋', 'T'],\n\t['𝕌', 'U'],\n\t['𝕍', 'V'],\n\t['𝕎', 'W'],\n\t['𝕏', 'X'],\n\t['𝕐', 'Y'],\n\t['𝕒', 'a'],\n\t['𝕓', 'b'],\n\t['𝕔', 'c'],\n\t['𝕕', 'd'],\n\t['𝕖', 'e'],\n\t['𝕗', 'f'],\n\t['𝕘', 'g'],\n\t['𝕙', 'h'],\n\t['𝕚', 'i'],\n\t['𝕛', 'j'],\n\t['𝕜', 'k'],\n\t['𝕝', 'l'],\n\t['𝕞', 'm'],\n\t['𝕟', 'n'],\n\t['𝕠', 'o'],\n\t['𝕡', 'p'],\n\t['𝕢', 'q'],\n\t['𝕣', 'r'],\n\t['𝕤', 's'],\n\t['𝕥', 't'],\n\t['𝕦', 'u'],\n\t['𝕧', 'v'],\n\t['𝕨', 'w'],\n\t['𝕩', 'x'],\n\t['𝕪', 'y'],\n\t['𝕫', 'z'],\n\t['𝕬', 'A'],\n\t['𝕭', 'B'],\n\t['𝕮', 'C'],\n\t['𝕯', 'D'],\n\t['𝕰', 'E'],\n\t['𝕱', 'F'],\n\t['𝕲', 'G'],\n\t['𝕳', 'H'],\n\t['𝕴', 'I'],\n\t['𝕵', 'J'],\n\t['𝕶', 'K'],\n\t['𝕷', 'L'],\n\t['𝕸', 'M'],\n\t['𝕹', 'N'],\n\t['𝕺', 'O'],\n\t['𝕻', 'P'],\n\t['𝕼', 'Q'],\n\t['𝕽', 'R'],\n\t['𝕾', 'S'],\n\t['𝕿', 'T'],\n\t['𝖀', 'U'],\n\t['𝖁', 'V'],\n\t['𝖂', 'W'],\n\t['𝖃', 'X'],\n\t['𝖄', 'Y'],\n\t['𝖅', 'Z'],\n\t['𝖆', 'a'],\n\t['𝖇', 'b'],\n\t['𝖈', 'c'],\n\t['𝖉', 'd'],\n\t['𝖊', 'e'],\n\t['𝖋', 'f'],\n\t['𝖌', 'g'],\n\t['𝖍', 'h'],\n\t['𝖎', 'i'],\n\t['𝖏', 'j'],\n\t['𝖐', 'k'],\n\t['𝖑', 'l'],\n\t['𝖒', 'm'],\n\t['𝖓', 'n'],\n\t['𝖔', 'o'],\n\t['𝖕', 'p'],\n\t['𝖖', 'q'],\n\t['𝖗', 'r'],\n\t['𝖘', 's'],\n\t['𝖙', 't'],\n\t['𝖚', 'u'],\n\t['𝖛', 'v'],\n\t['𝖜', 'w'],\n\t['𝖝', 'x'],\n\t['𝖞', 'y'],\n\t['𝖟', 'z'],\n\t['𝖠', 'A'],\n\t['𝖡', 'B'],\n\t['𝖢', 'C'],\n\t['𝖣', 'D'],\n\t['𝖤', 'E'],\n\t['𝖥', 'F'],\n\t['𝖦', 'G'],\n\t['𝖧', 'H'],\n\t['𝖨', 'I'],\n\t['𝖩', 'J'],\n\t['𝖪', 'K'],\n\t['𝖫', 'L'],\n\t['𝖬', 'M'],\n\t['𝖭', 'N'],\n\t['𝖮', 'O'],\n\t['𝖯', 'P'],\n\t['𝖰', 'Q'],\n\t['𝖱', 'R'],\n\t['𝖲', 'S'],\n\t['𝖳', 'T'],\n\t['𝖴', 'U'],\n\t['𝖵', 'V'],\n\t['𝖶', 'W'],\n\t['𝖷', 'X'],\n\t['𝖸', 'Y'],\n\t['𝖹', 'Z'],\n\t['𝖺', 'a'],\n\t['𝖻', 'b'],\n\t['𝖼', 'c'],\n\t['𝖽', 'd'],\n\t['𝖾', 'e'],\n\t['𝖿', 'f'],\n\t['𝗀', 'g'],\n\t['𝗁', 'h'],\n\t['𝗂', 'i'],\n\t['𝗃', 'j'],\n\t['𝗄', 'k'],\n\t['𝗅', 'l'],\n\t['𝗆', 'm'],\n\t['𝗇', 'n'],\n\t['𝗈', 'o'],\n\t['𝗉', 'p'],\n\t['𝗊', 'q'],\n\t['𝗋', 'r'],\n\t['𝗌', 's'],\n\t['𝗍', 't'],\n\t['𝗎', 'u'],\n\t['𝗏', 'v'],\n\t['𝗐', 'w'],\n\t['𝗑', 'x'],\n\t['𝗒', 'y'],\n\t['𝗓', 'z'],\n\t['𝗔', 'A'],\n\t['𝗕', 'B'],\n\t['𝗖', 'C'],\n\t['𝗗', 'D'],\n\t['𝗘', 'E'],\n\t['𝗙', 'F'],\n\t['𝗚', 'G'],\n\t['𝗛', 'H'],\n\t['𝗜', 'I'],\n\t['𝗝', 'J'],\n\t['𝗞', 'K'],\n\t['𝗟', 'L'],\n\t['𝗠', 'M'],\n\t['𝗡', 'N'],\n\t['𝗢', 'O'],\n\t['𝗣', 'P'],\n\t['𝗤', 'Q'],\n\t['𝗥', 'R'],\n\t['𝗦', 'S'],\n\t['𝗧', 'T'],\n\t['𝗨', 'U'],\n\t['𝗩', 'V'],\n\t['𝗪', 'W'],\n\t['𝗫', 'X'],\n\t['𝗬', 'Y'],\n\t['𝗭', 'Z'],\n\t['𝗮', 'a'],\n\t['𝗯', 'b'],\n\t['𝗰', 'c'],\n\t['𝗱', 'd'],\n\t['𝗲', 'e'],\n\t['𝗳', 'f'],\n\t['𝗴', 'g'],\n\t['𝗵', 'h'],\n\t['𝗶', 'i'],\n\t['𝗷', 'j'],\n\t['𝗸', 'k'],\n\t['𝗹', 'l'],\n\t['𝗺', 'm'],\n\t['𝗻', 'n'],\n\t['𝗼', 'o'],\n\t['𝗽', 'p'],\n\t['𝗾', 'q'],\n\t['𝗿', 'r'],\n\t['𝘀', 's'],\n\t['𝘁', 't'],\n\t['𝘂', 'u'],\n\t['𝘃', 'v'],\n\t['𝘄', 'w'],\n\t['𝘅', 'x'],\n\t['𝘆', 'y'],\n\t['𝘇', 'z'],\n\t['𝘈', 'A'],\n\t['𝘉', 'B'],\n\t['𝘊', 'C'],\n\t['𝘋', 'D'],\n\t['𝘌', 'E'],\n\t['𝘍', 'F'],\n\t['𝘎', 'G'],\n\t['𝘏', 'H'],\n\t['𝘐', 'I'],\n\t['𝘑', 'J'],\n\t['𝘒', 'K'],\n\t['𝘓', 'L'],\n\t['𝘔', 'M'],\n\t['𝘕', 'N'],\n\t['𝘖', 'O'],\n\t['𝘗', 'P'],\n\t['𝘘', 'Q'],\n\t['𝘙', 'R'],\n\t['𝘚', 'S'],\n\t['𝘛', 'T'],\n\t['𝘜', 'U'],\n\t['𝘝', 'V'],\n\t['𝘞', 'W'],\n\t['𝘟', 'X'],\n\t['𝘠', 'Y'],\n\t['𝘡', 'Z'],\n\t['𝘢', 'a'],\n\t['𝘣', 'b'],\n\t['𝘤', 'c'],\n\t['𝘥', 'd'],\n\t['𝘦', 'e'],\n\t['𝘧', 'f'],\n\t['𝘨', 'g'],\n\t['𝘩', 'h'],\n\t['𝘪', 'i'],\n\t['𝘫', 'j'],\n\t['𝘬', 'k'],\n\t['𝘭', 'l'],\n\t['𝘮', 'm'],\n\t['𝘯', 'n'],\n\t['𝘰', 'o'],\n\t['𝘱', 'p'],\n\t['𝘲', 'q'],\n\t['𝘳', 'r'],\n\t['𝘴', 's'],\n\t['𝘵', 't'],\n\t['𝘶', 'u'],\n\t['𝘷', 'v'],\n\t['𝘸', 'w'],\n\t['𝘹', 'x'],\n\t['𝘺', 'y'],\n\t['𝘻', 'z'],\n\t['𝘼', 'A'],\n\t['𝘽', 'B'],\n\t['𝘾', 'C'],\n\t['𝘿', 'D'],\n\t['𝙀', 'E'],\n\t['𝙁', 'F'],\n\t['𝙂', 'G'],\n\t['𝙃', 'H'],\n\t['𝙄', 'I'],\n\t['𝙅', 'J'],\n\t['𝙆', 'K'],\n\t['𝙇', 'L'],\n\t['𝙈', 'M'],\n\t['𝙉', 'N'],\n\t['𝙊', 'O'],\n\t['𝙋', 'P'],\n\t['𝙌', 'Q'],\n\t['𝙍', 'R'],\n\t['𝙎', 'S'],\n\t['𝙏', 'T'],\n\t['𝙐', 'U'],\n\t['𝙑', 'V'],\n\t['𝙒', 'W'],\n\t['𝙓', 'X'],\n\t['𝙔', 'Y'],\n\t['𝙕', 'Z'],\n\t['𝙖', 'a'],\n\t['𝙗', 'b'],\n\t['𝙘', 'c'],\n\t['𝙙', 'd'],\n\t['𝙚', 'e'],\n\t['𝙛', 'f'],\n\t['𝙜', 'g'],\n\t['𝙝', 'h'],\n\t['𝙞', 'i'],\n\t['𝙟', 'j'],\n\t['𝙠', 'k'],\n\t['𝙡', 'l'],\n\t['𝙢', 'm'],\n\t['𝙣', 'n'],\n\t['𝙤', 'o'],\n\t['𝙥', 'p'],\n\t['𝙦', 'q'],\n\t['𝙧', 'r'],\n\t['𝙨', 's'],\n\t['𝙩', 't'],\n\t['𝙪', 'u'],\n\t['𝙫', 'v'],\n\t['𝙬', 'w'],\n\t['𝙭', 'x'],\n\t['𝙮', 'y'],\n\t['𝙯', 'z'],\n\t['𝙰', 'A'],\n\t['𝙱', 'B'],\n\t['𝙲', 'C'],\n\t['𝙳', 'D'],\n\t['𝙴', 'E'],\n\t['𝙵', 'F'],\n\t['𝙶', 'G'],\n\t['𝙷', 'H'],\n\t['𝙸', 'I'],\n\t['𝙹', 'J'],\n\t['𝙺', 'K'],\n\t['𝙻', 'L'],\n\t['𝙼', 'M'],\n\t['𝙽', 'N'],\n\t['𝙾', 'O'],\n\t['𝙿', 'P'],\n\t['𝚀', 'Q'],\n\t['𝚁', 'R'],\n\t['𝚂', 'S'],\n\t['𝚃', 'T'],\n\t['𝚄', 'U'],\n\t['𝚅', 'V'],\n\t['𝚆', 'W'],\n\t['𝚇', 'X'],\n\t['𝚈', 'Y'],\n\t['𝚉', 'Z'],\n\t['𝚊', 'a'],\n\t['𝚋', 'b'],\n\t['𝚌', 'c'],\n\t['𝚍', 'd'],\n\t['𝚎', 'e'],\n\t['𝚏', 'f'],\n\t['𝚐', 'g'],\n\t['𝚑', 'h'],\n\t['𝚒', 'i'],\n\t['𝚓', 'j'],\n\t['𝚔', 'k'],\n\t['𝚕', 'l'],\n\t['𝚖', 'm'],\n\t['𝚗', 'n'],\n\t['𝚘', 'o'],\n\t['𝚙', 'p'],\n\t['𝚚', 'q'],\n\t['𝚛', 'r'],\n\t['𝚜', 's'],\n\t['𝚝', 't'],\n\t['𝚞', 'u'],\n\t['𝚟', 'v'],\n\t['𝚠', 'w'],\n\t['𝚡', 'x'],\n\t['𝚢', 'y'],\n\t['𝚣', 'z'],\n\n\t// Dotless letters\n\t['𝚤', 'l'],\n\t['𝚥', 'j'],\n\n\t// Greek\n\t['𝛢', 'A'],\n\t['𝛣', 'B'],\n\t['𝛤', 'G'],\n\t['𝛥', 'D'],\n\t['𝛦', 'E'],\n\t['𝛧', 'Z'],\n\t['𝛨', 'I'],\n\t['𝛩', 'TH'],\n\t['𝛪', 'I'],\n\t['𝛫', 'K'],\n\t['𝛬', 'L'],\n\t['𝛭', 'M'],\n\t['𝛮', 'N'],\n\t['𝛯', 'KS'],\n\t['𝛰', 'O'],\n\t['𝛱', 'P'],\n\t['𝛲', 'R'],\n\t['𝛳', 'TH'],\n\t['𝛴', 'S'],\n\t['𝛵', 'T'],\n\t['𝛶', 'Y'],\n\t['𝛷', 'F'],\n\t['𝛸', 'x'],\n\t['𝛹', 'PS'],\n\t['𝛺', 'O'],\n\t['𝛻', 'D'],\n\t['𝛼', 'a'],\n\t['𝛽', 'b'],\n\t['𝛾', 'g'],\n\t['𝛿', 'd'],\n\t['𝜀', 'e'],\n\t['𝜁', 'z'],\n\t['𝜂', 'i'],\n\t['𝜃', 'th'],\n\t['𝜄', 'i'],\n\t['𝜅', 'k'],\n\t['𝜆', 'l'],\n\t['𝜇', 'm'],\n\t['𝜈', 'n'],\n\t['𝜉', 'ks'],\n\t['𝜊', 'o'],\n\t['𝜋', 'p'],\n\t['𝜌', 'r'],\n\t['𝜍', 's'],\n\t['𝜎', 's'],\n\t['𝜏', 't'],\n\t['𝜐', 'y'],\n\t['𝜑', 'f'],\n\t['𝜒', 'x'],\n\t['𝜓', 'ps'],\n\t['𝜔', 'o'],\n\t['𝜕', 'd'],\n\t['𝜖', 'E'],\n\t['𝜗', 'TH'],\n\t['𝜘', 'K'],\n\t['𝜙', 'f'],\n\t['𝜚', 'r'],\n\t['𝜛', 'p'],\n\t['𝜜', 'A'],\n\t['𝜝', 'V'],\n\t['𝜞', 'G'],\n\t['𝜟', 'D'],\n\t['𝜠', 'E'],\n\t['𝜡', 'Z'],\n\t['𝜢', 'I'],\n\t['𝜣', 'TH'],\n\t['𝜤', 'I'],\n\t['𝜥', 'K'],\n\t['𝜦', 'L'],\n\t['𝜧', 'M'],\n\t['𝜨', 'N'],\n\t['𝜩', 'KS'],\n\t['𝜪', 'O'],\n\t['𝜫', 'P'],\n\t['𝜬', 'S'],\n\t['𝜭', 'TH'],\n\t['𝜮', 'S'],\n\t['𝜯', 'T'],\n\t['𝜰', 'Y'],\n\t['𝜱', 'F'],\n\t['𝜲', 'X'],\n\t['𝜳', 'PS'],\n\t['𝜴', 'O'],\n\t['𝜵', 'D'],\n\t['𝜶', 'a'],\n\t['𝜷', 'v'],\n\t['𝜸', 'g'],\n\t['𝜹', 'd'],\n\t['𝜺', 'e'],\n\t['𝜻', 'z'],\n\t['𝜼', 'i'],\n\t['𝜽', 'th'],\n\t['𝜾', 'i'],\n\t['𝜿', 'k'],\n\t['𝝀', 'l'],\n\t['𝝁', 'm'],\n\t['𝝂', 'n'],\n\t['𝝃', 'ks'],\n\t['𝝄', 'o'],\n\t['𝝅', 'p'],\n\t['𝝆', 'r'],\n\t['𝝇', 's'],\n\t['𝝈', 's'],\n\t['𝝉', 't'],\n\t['𝝊', 'y'],\n\t['𝝋', 'f'],\n\t['𝝌', 'x'],\n\t['𝝍', 'ps'],\n\t['𝝎', 'o'],\n\t['𝝏', 'a'],\n\t['𝝐', 'e'],\n\t['𝝑', 'i'],\n\t['𝝒', 'k'],\n\t['𝝓', 'f'],\n\t['𝝔', 'r'],\n\t['𝝕', 'p'],\n\t['𝝖', 'A'],\n\t['𝝗', 'B'],\n\t['𝝘', 'G'],\n\t['𝝙', 'D'],\n\t['𝝚', 'E'],\n\t['𝝛', 'Z'],\n\t['𝝜', 'I'],\n\t['𝝝', 'TH'],\n\t['𝝞', 'I'],\n\t['𝝟', 'K'],\n\t['𝝠', 'L'],\n\t['𝝡', 'M'],\n\t['𝝢', 'N'],\n\t['𝝣', 'KS'],\n\t['𝝤', 'O'],\n\t['𝝥', 'P'],\n\t['𝝦', 'R'],\n\t['𝝧', 'TH'],\n\t['𝝨', 'S'],\n\t['𝝩', 'T'],\n\t['𝝪', 'Y'],\n\t['𝝫', 'F'],\n\t['𝝬', 'X'],\n\t['𝝭', 'PS'],\n\t['𝝮', 'O'],\n\t['𝝯', 'D'],\n\t['𝝰', 'a'],\n\t['𝝱', 'v'],\n\t['𝝲', 'g'],\n\t['𝝳', 'd'],\n\t['𝝴', 'e'],\n\t['𝝵', 'z'],\n\t['𝝶', 'i'],\n\t['𝝷', 'th'],\n\t['𝝸', 'i'],\n\t['𝝹', 'k'],\n\t['𝝺', 'l'],\n\t['𝝻', 'm'],\n\t['𝝼', 'n'],\n\t['𝝽', 'ks'],\n\t['𝝾', 'o'],\n\t['𝝿', 'p'],\n\t['𝞀', 'r'],\n\t['𝞁', 's'],\n\t['𝞂', 's'],\n\t['𝞃', 't'],\n\t['𝞄', 'y'],\n\t['𝞅', 'f'],\n\t['𝞆', 'x'],\n\t['𝞇', 'ps'],\n\t['𝞈', 'o'],\n\t['𝞉', 'a'],\n\t['𝞊', 'e'],\n\t['𝞋', 'i'],\n\t['𝞌', 'k'],\n\t['𝞍', 'f'],\n\t['𝞎', 'r'],\n\t['𝞏', 'p'],\n\t['𝞐', 'A'],\n\t['𝞑', 'V'],\n\t['𝞒', 'G'],\n\t['𝞓', 'D'],\n\t['𝞔', 'E'],\n\t['𝞕', 'Z'],\n\t['𝞖', 'I'],\n\t['𝞗', 'TH'],\n\t['𝞘', 'I'],\n\t['𝞙', 'K'],\n\t['𝞚', 'L'],\n\t['𝞛', 'M'],\n\t['𝞜', 'N'],\n\t['𝞝', 'KS'],\n\t['𝞞', 'O'],\n\t['𝞟', 'P'],\n\t['𝞠', 'S'],\n\t['𝞡', 'TH'],\n\t['𝞢', 'S'],\n\t['𝞣', 'T'],\n\t['𝞤', 'Y'],\n\t['𝞥', 'F'],\n\t['𝞦', 'X'],\n\t['𝞧', 'PS'],\n\t['𝞨', 'O'],\n\t['𝞩', 'D'],\n\t['𝞪', 'av'],\n\t['𝞫', 'g'],\n\t['𝞬', 'd'],\n\t['𝞭', 'e'],\n\t['𝞮', 'z'],\n\t['𝞯', 'i'],\n\t['𝞰', 'i'],\n\t['𝞱', 'th'],\n\t['𝞲', 'i'],\n\t['𝞳', 'k'],\n\t['𝞴', 'l'],\n\t['𝞵', 'm'],\n\t['𝞶', 'n'],\n\t['𝞷', 'ks'],\n\t['𝞸', 'o'],\n\t['𝞹', 'p'],\n\t['𝞺', 'r'],\n\t['𝞻', 's'],\n\t['𝞼', 's'],\n\t['𝞽', 't'],\n\t['𝞾', 'y'],\n\t['𝞿', 'f'],\n\t['𝟀', 'x'],\n\t['𝟁', 'ps'],\n\t['𝟂', 'o'],\n\t['𝟃', 'a'],\n\t['𝟄', 'e'],\n\t['𝟅', 'i'],\n\t['𝟆', 'k'],\n\t['𝟇', 'f'],\n\t['𝟈', 'r'],\n\t['𝟉', 'p'],\n\t['𝟊', 'F'],\n\t['𝟋', 'f'],\n\t['⒜', '(a)'],\n\t['⒝', '(b)'],\n\t['⒞', '(c)'],\n\t['⒟', '(d)'],\n\t['⒠', '(e)'],\n\t['⒡', '(f)'],\n\t['⒢', '(g)'],\n\t['⒣', '(h)'],\n\t['⒤', '(i)'],\n\t['⒥', '(j)'],\n\t['⒦', '(k)'],\n\t['⒧', '(l)'],\n\t['⒨', '(m)'],\n\t['⒩', '(n)'],\n\t['⒪', '(o)'],\n\t['⒫', '(p)'],\n\t['⒬', '(q)'],\n\t['⒭', '(r)'],\n\t['⒮', '(s)'],\n\t['⒯', '(t)'],\n\t['⒰', '(u)'],\n\t['⒱', '(v)'],\n\t['⒲', '(w)'],\n\t['⒳', '(x)'],\n\t['⒴', '(y)'],\n\t['⒵', '(z)'],\n\t['Ⓐ', '(A)'],\n\t['Ⓑ', '(B)'],\n\t['Ⓒ', '(C)'],\n\t['Ⓓ', '(D)'],\n\t['Ⓔ', '(E)'],\n\t['Ⓕ', '(F)'],\n\t['Ⓖ', '(G)'],\n\t['Ⓗ', '(H)'],\n\t['Ⓘ', '(I)'],\n\t['Ⓙ', '(J)'],\n\t['Ⓚ', '(K)'],\n\t['Ⓛ', '(L)'],\n\t['Ⓝ', '(N)'],\n\t['Ⓞ', '(O)'],\n\t['Ⓟ', '(P)'],\n\t['Ⓠ', '(Q)'],\n\t['Ⓡ', '(R)'],\n\t['Ⓢ', '(S)'],\n\t['Ⓣ', '(T)'],\n\t['Ⓤ', '(U)'],\n\t['Ⓥ', '(V)'],\n\t['Ⓦ', '(W)'],\n\t['Ⓧ', '(X)'],\n\t['Ⓨ', '(Y)'],\n\t['Ⓩ', '(Z)'],\n\t['ⓐ', '(a)'],\n\t['ⓑ', '(b)'],\n\t['ⓒ', '(b)'],\n\t['ⓓ', '(c)'],\n\t['ⓔ', '(e)'],\n\t['ⓕ', '(f)'],\n\t['ⓖ', '(g)'],\n\t['ⓗ', '(h)'],\n\t['ⓘ', '(i)'],\n\t['ⓙ', '(j)'],\n\t['ⓚ', '(k)'],\n\t['ⓛ', '(l)'],\n\t['ⓜ', '(m)'],\n\t['ⓝ', '(n)'],\n\t['ⓞ', '(o)'],\n\t['ⓟ', '(p)'],\n\t['ⓠ', '(q)'],\n\t['ⓡ', '(r)'],\n\t['ⓢ', '(s)'],\n\t['ⓣ', '(t)'],\n\t['ⓤ', '(u)'],\n\t['ⓥ', '(v)'],\n\t['ⓦ', '(w)'],\n\t['ⓧ', '(x)'],\n\t['ⓨ', '(y)'],\n\t['ⓩ', '(z)'],\n\n\t// Maltese\n\t['Ċ', 'C'],\n\t['ċ', 'c'],\n\t['Ġ', 'G'],\n\t['ġ', 'g'],\n\t['Ħ', 'H'],\n\t['ħ', 'h'],\n\t['Ż', 'Z'],\n\t['ż', 'z'],\n\n\t// Numbers\n\t['𝟎', '0'],\n\t['𝟏', '1'],\n\t['𝟐', '2'],\n\t['𝟑', '3'],\n\t['𝟒', '4'],\n\t['𝟓', '5'],\n\t['𝟔', '6'],\n\t['𝟕', '7'],\n\t['𝟖', '8'],\n\t['𝟗', '9'],\n\t['𝟘', '0'],\n\t['𝟙', '1'],\n\t['𝟚', '2'],\n\t['𝟛', '3'],\n\t['𝟜', '4'],\n\t['𝟝', '5'],\n\t['𝟞', '6'],\n\t['𝟟', '7'],\n\t['𝟠', '8'],\n\t['𝟡', '9'],\n\t['𝟢', '0'],\n\t['𝟣', '1'],\n\t['𝟤', '2'],\n\t['𝟥', '3'],\n\t['𝟦', '4'],\n\t['𝟧', '5'],\n\t['𝟨', '6'],\n\t['𝟩', '7'],\n\t['𝟪', '8'],\n\t['𝟫', '9'],\n\t['𝟬', '0'],\n\t['𝟭', '1'],\n\t['𝟮', '2'],\n\t['𝟯', '3'],\n\t['𝟰', '4'],\n\t['𝟱', '5'],\n\t['𝟲', '6'],\n\t['𝟳', '7'],\n\t['𝟴', '8'],\n\t['𝟵', '9'],\n\t['𝟶', '0'],\n\t['𝟷', '1'],\n\t['𝟸', '2'],\n\t['𝟹', '3'],\n\t['𝟺', '4'],\n\t['𝟻', '5'],\n\t['𝟼', '6'],\n\t['𝟽', '7'],\n\t['𝟾', '8'],\n\t['𝟿', '9'],\n\t['①', '1'],\n\t['②', '2'],\n\t['③', '3'],\n\t['④', '4'],\n\t['⑤', '5'],\n\t['⑥', '6'],\n\t['⑦', '7'],\n\t['⑧', '8'],\n\t['⑨', '9'],\n\t['⑩', '10'],\n\t['⑪', '11'],\n\t['⑫', '12'],\n\t['⑬', '13'],\n\t['⑭', '14'],\n\t['⑮', '15'],\n\t['⑯', '16'],\n\t['⑰', '17'],\n\t['⑱', '18'],\n\t['⑲', '19'],\n\t['⑳', '20'],\n\t['⑴', '1'],\n\t['⑵', '2'],\n\t['⑶', '3'],\n\t['⑷', '4'],\n\t['⑸', '5'],\n\t['⑹', '6'],\n\t['⑺', '7'],\n\t['⑻', '8'],\n\t['⑼', '9'],\n\t['⑽', '10'],\n\t['⑾', '11'],\n\t['⑿', '12'],\n\t['⒀', '13'],\n\t['⒁', '14'],\n\t['⒂', '15'],\n\t['⒃', '16'],\n\t['⒄', '17'],\n\t['⒅', '18'],\n\t['⒆', '19'],\n\t['⒇', '20'],\n\t['⒈', '1.'],\n\t['⒉', '2.'],\n\t['⒊', '3.'],\n\t['⒋', '4.'],\n\t['⒌', '5.'],\n\t['⒍', '6.'],\n\t['⒎', '7.'],\n\t['⒏', '8.'],\n\t['⒐', '9.'],\n\t['⒑', '10.'],\n\t['⒒', '11.'],\n\t['⒓', '12.'],\n\t['⒔', '13.'],\n\t['⒕', '14.'],\n\t['⒖', '15.'],\n\t['⒗', '16.'],\n\t['⒘', '17.'],\n\t['⒙', '18.'],\n\t['⒚', '19.'],\n\t['⒛', '20.'],\n\t['⓪', '0'],\n\t['⓫', '11'],\n\t['⓬', '12'],\n\t['⓭', '13'],\n\t['⓮', '14'],\n\t['⓯', '15'],\n\t['⓰', '16'],\n\t['⓱', '17'],\n\t['⓲', '18'],\n\t['⓳', '19'],\n\t['⓴', '20'],\n\t['⓵', '1'],\n\t['⓶', '2'],\n\t['⓷', '3'],\n\t['⓸', '4'],\n\t['⓹', '5'],\n\t['⓺', '6'],\n\t['⓻', '7'],\n\t['⓼', '8'],\n\t['⓽', '9'],\n\t['⓾', '10'],\n\t['⓿', '0'],\n\n\t// Punctuation\n\t['🙰', '&'],\n\t['🙱', '&'],\n\t['🙲', '&'],\n\t['🙳', '&'],\n\t['🙴', '&'],\n\t['🙵', '&'],\n\t['🙶', '\"'],\n\t['🙷', '\"'],\n\t['🙸', '\"'],\n\t['‽', '?!'],\n\t['🙹', '?!'],\n\t['🙺', '?!'],\n\t['🙻', '?!'],\n\t['🙼', '/'],\n\t['🙽', '\\\\'],\n\n\t// Alchemy\n\t['🜇', 'AR'],\n\t['🜈', 'V'],\n\t['🜉', 'V'],\n\t['🜆', 'VR'],\n\t['🜅', 'VF'],\n\t['🜩', '2'],\n\t['🜪', '5'],\n\t['🝡', 'f'],\n\t['🝢', 'W'],\n\t['🝣', 'U'],\n\t['🝧', 'V'],\n\t['🝨', 'T'],\n\t['🝪', 'V'],\n\t['🝫', 'MB'],\n\t['🝬', 'VB'],\n\t['🝲', '3B'],\n\t['🝳', '3B'],\n\n\t// Emojis\n\t['💯', '100'],\n\t['🔙', 'BACK'],\n\t['🔚', 'END'],\n\t['🔛', 'ON!'],\n\t['🔜', 'SOON'],\n\t['🔝', 'TOP'],\n\t['🔞', '18'],\n\t['🔤', 'abc'],\n\t['🔠', 'ABCD'],\n\t['🔡', 'abcd'],\n\t['🔢', '1234'],\n\t['🔣', 'T&@%'],\n\t['#️⃣', '#'],\n\t['*️⃣', '*'],\n\t['0️⃣', '0'],\n\t['1️⃣', '1'],\n\t['2️⃣', '2'],\n\t['3️⃣', '3'],\n\t['4️⃣', '4'],\n\t['5️⃣', '5'],\n\t['6️⃣', '6'],\n\t['7️⃣', '7'],\n\t['8️⃣', '8'],\n\t['9️⃣', '9'],\n\t['🔟', '10'],\n\t['🅰️', 'A'],\n\t['🅱️', 'B'],\n\t['🆎', 'AB'],\n\t['🆑', 'CL'],\n\t['🅾️', 'O'],\n\t['🅿', 'P'],\n\t['🆘', 'SOS'],\n\t['🅲', 'C'],\n\t['🅳', 'D'],\n\t['🅴', 'E'],\n\t['🅵', 'F'],\n\t['🅶', 'G'],\n\t['🅷', 'H'],\n\t['🅸', 'I'],\n\t['🅹', 'J'],\n\t['🅺', 'K'],\n\t['🅻', 'L'],\n\t['🅼', 'M'],\n\t['🅽', 'N'],\n\t['🆀', 'Q'],\n\t['🆁', 'R'],\n\t['🆂', 'S'],\n\t['🆃', 'T'],\n\t['🆄', 'U'],\n\t['🆅', 'V'],\n\t['🆆', 'W'],\n\t['🆇', 'X'],\n\t['🆈', 'Y'],\n\t['🆉', 'Z']\n];\n\nexport default replacements;\n","import escapeStringRegexp from 'escape-string-regexp';\nimport builtinReplacements from './replacements.js';\n\nconst doCustomReplacements = (string, replacements) => {\n\tfor (const [key, value] of replacements) {\n\t\t// TODO: Use `String#replaceAll()` when targeting Node.js 16.\n\t\tstring = string.replace(new RegExp(escapeStringRegexp(key), 'g'), value);\n\t}\n\n\treturn string;\n};\n\nexport default function transliterate(string, options) {\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError(`Expected a string, got \\`${typeof string}\\``);\n\t}\n\n\toptions = {\n\t\tcustomReplacements: [],\n\t\t...options\n\t};\n\n\tconst customReplacements = new Map([\n\t\t...builtinReplacements,\n\t\t...options.customReplacements\n\t]);\n\n\tstring = string.normalize();\n\tstring = doCustomReplacements(string, customReplacements);\n\tstring = string.normalize('NFD').replace(/\\p{Diacritic}/gu, '').normalize();\n\n\treturn string;\n}\n","const overridableReplacements = [\n\t['&', ' and '],\n\t['🦄', ' unicorn '],\n\t['♥', ' love ']\n];\n\nexport default overridableReplacements;\n","import escapeStringRegexp from 'escape-string-regexp';\nimport transliterate from '@sindresorhus/transliterate';\nimport builtinOverridableReplacements from './overridable-replacements.js';\n\nconst decamelize = string => {\n\treturn string\n\t\t// Separate capitalized words.\n\t\t.replace(/([A-Z]{2,})(\\d+)/g, '$1 $2')\n\t\t.replace(/([a-z\\d]+)([A-Z]{2,})/g, '$1 $2')\n\n\t\t.replace(/([a-z\\d])([A-Z])/g, '$1 $2')\n\t\t// `[a-rt-z]` matches all lowercase characters except `s`.\n\t\t// This avoids matching plural acronyms like `APIs`.\n\t\t.replace(/([A-Z]+)([A-Z][a-rt-z\\d]+)/g, '$1 $2');\n};\n\nconst removeMootSeparators = (string, separator) => {\n\tconst escapedSeparator = escapeStringRegexp(separator);\n\n\treturn string\n\t\t.replace(new RegExp(`${escapedSeparator}{2,}`, 'g'), separator)\n\t\t.replace(new RegExp(`^${escapedSeparator}|${escapedSeparator}$`, 'g'), '');\n};\n\nconst buildPatternSlug = options => {\n\tlet negationSetPattern = 'a-z\\\\d';\n\tnegationSetPattern += options.lowercase ? '' : 'A-Z';\n\n\tif (options.preserveCharacters.length > 0) {\n\t\tfor (const character of options.preserveCharacters) {\n\t\t\tif (character === options.separator) {\n\t\t\t\tthrow new Error(`The separator character \\`${options.separator}\\` cannot be included in preserved characters: ${options.preserveCharacters}`);\n\t\t\t}\n\n\t\t\tnegationSetPattern += escapeStringRegexp(character);\n\t\t}\n\t}\n\n\treturn new RegExp(`[^${negationSetPattern}]+`, 'g');\n};\n\nexport default function slugify(string, options) {\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError(`Expected a string, got \\`${typeof string}\\``);\n\t}\n\n\toptions = {\n\t\tseparator: '-',\n\t\tlowercase: true,\n\t\tdecamelize: true,\n\t\tcustomReplacements: [],\n\t\tpreserveLeadingUnderscore: false,\n\t\tpreserveTrailingDash: false,\n\t\tpreserveCharacters: [],\n\t\t...options\n\t};\n\n\tconst shouldPrependUnderscore = options.preserveLeadingUnderscore && string.startsWith('_');\n\tconst shouldAppendDash = options.preserveTrailingDash && string.endsWith('-');\n\n\tconst customReplacements = new Map([\n\t\t...builtinOverridableReplacements,\n\t\t...options.customReplacements\n\t]);\n\n\tstring = transliterate(string, {customReplacements});\n\n\tif (options.decamelize) {\n\t\tstring = decamelize(string);\n\t}\n\n\tconst patternSlug = buildPatternSlug(options);\n\n\tif (options.lowercase) {\n\t\tstring = string.toLowerCase();\n\t}\n\n\t// Detect contractions/possessives by looking for any word followed by a `'t`\n\t// or `'s` in isolation and then remove it.\n\tstring = string.replace(/([a-zA-Z\\d]+)'([ts])(\\s|$)/g, '$1$2$3');\n\n\tstring = string.replace(patternSlug, options.separator);\n\tstring = string.replace(/\\\\/g, '');\n\n\tif (options.separator) {\n\t\tstring = removeMootSeparators(string, options.separator);\n\t}\n\n\tif (shouldPrependUnderscore) {\n\t\tstring = `_${string}`;\n\t}\n\n\tif (shouldAppendDash) {\n\t\tstring = `${string}-`;\n\t}\n\n\treturn string;\n}\n\nexport function slugifyWithCounter() {\n\tconst occurrences = new Map();\n\n\tconst countable = (string, options) => {\n\t\tstring = slugify(string, options);\n\n\t\tif (!string) {\n\t\t\treturn '';\n\t\t}\n\n\t\tconst stringLower = string.toLowerCase();\n\t\tconst numberless = occurrences.get(stringLower.replace(/(?:-\\d+?)+?$/, '')) || 0;\n\t\tconst counter = occurrences.get(stringLower);\n\t\toccurrences.set(stringLower, typeof counter === 'number' ? counter + 1 : 1);\n\t\tconst newCounter = occurrences.get(stringLower) || 2;\n\t\tif (newCounter >= 2 || numberless > 2) {\n\t\t\tstring = `${string}-${newCounter}`;\n\t\t}\n\n\t\treturn string;\n\t};\n\n\tcountable.reset = () => {\n\t\toccurrences.clear();\n\t};\n\n\treturn countable;\n}\n","import { findWrapping, ReplaceAroundStep, canSplit, liftTarget, canJoin } from 'prosemirror-transform';\nimport { NodeRange, Fragment, Slice } from 'prosemirror-model';\nimport { Selection } from 'prosemirror-state';\n\nconst olDOM = [\"ol\", 0], ulDOM = [\"ul\", 0], liDOM = [\"li\", 0];\n/**\nAn ordered list [node spec](https://prosemirror.net/docs/ref/#model.NodeSpec). Has a single\nattribute, `order`, which determines the number at which the list\nstarts counting, and defaults to 1. Represented as an `<ol>`\nelement.\n*/\nconst orderedList = {\n    attrs: { order: { default: 1 } },\n    parseDOM: [{ tag: \"ol\", getAttrs(dom) {\n                return { order: dom.hasAttribute(\"start\") ? +dom.getAttribute(\"start\") : 1 };\n            } }],\n    toDOM(node) {\n        return node.attrs.order == 1 ? olDOM : [\"ol\", { start: node.attrs.order }, 0];\n    }\n};\n/**\nA bullet list node spec, represented in the DOM as `<ul>`.\n*/\nconst bulletList = {\n    parseDOM: [{ tag: \"ul\" }],\n    toDOM() { return ulDOM; }\n};\n/**\nA list item (`<li>`) spec.\n*/\nconst listItem = {\n    parseDOM: [{ tag: \"li\" }],\n    toDOM() { return liDOM; },\n    defining: true\n};\nfunction add(obj, props) {\n    let copy = {};\n    for (let prop in obj)\n        copy[prop] = obj[prop];\n    for (let prop in props)\n        copy[prop] = props[prop];\n    return copy;\n}\n/**\nConvenience function for adding list-related node types to a map\nspecifying the nodes for a schema. Adds\n[`orderedList`](https://prosemirror.net/docs/ref/#schema-list.orderedList) as `\"ordered_list\"`,\n[`bulletList`](https://prosemirror.net/docs/ref/#schema-list.bulletList) as `\"bullet_list\"`, and\n[`listItem`](https://prosemirror.net/docs/ref/#schema-list.listItem) as `\"list_item\"`.\n\n`itemContent` determines the content expression for the list items.\nIf you want the commands defined in this module to apply to your\nlist structure, it should have a shape like `\"paragraph block*\"` or\n`\"paragraph (ordered_list | bullet_list)*\"`. `listGroup` can be\ngiven to assign a group name to the list node types, for example\n`\"block\"`.\n*/\nfunction addListNodes(nodes, itemContent, listGroup) {\n    return nodes.append({\n        ordered_list: add(orderedList, { content: \"list_item+\", group: listGroup }),\n        bullet_list: add(bulletList, { content: \"list_item+\", group: listGroup }),\n        list_item: add(listItem, { content: itemContent })\n    });\n}\n/**\nReturns a command function that wraps the selection in a list with\nthe given type an attributes. If `dispatch` is null, only return a\nvalue to indicate whether this is possible, but don't actually\nperform the change.\n*/\nfunction wrapInList(listType, attrs = null) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to), doJoin = false, outerRange = range;\n        if (!range)\n            return false;\n        // This is at the top of an existing list item\n        if (range.depth >= 2 && $from.node(range.depth - 1).type.compatibleContent(listType) && range.startIndex == 0) {\n            // Don't do anything if this is the top of the list\n            if ($from.index(range.depth - 1) == 0)\n                return false;\n            let $insert = state.doc.resolve(range.start - 2);\n            outerRange = new NodeRange($insert, $insert, range.depth);\n            if (range.endIndex < range.parent.childCount)\n                range = new NodeRange($from, state.doc.resolve($to.end(range.depth)), range.depth);\n            doJoin = true;\n        }\n        let wrap = findWrapping(outerRange, listType, attrs, range);\n        if (!wrap)\n            return false;\n        if (dispatch)\n            dispatch(doWrapInList(state.tr, range, wrap, doJoin, listType).scrollIntoView());\n        return true;\n    };\n}\nfunction doWrapInList(tr, range, wrappers, joinBefore, listType) {\n    let content = Fragment.empty;\n    for (let i = wrappers.length - 1; i >= 0; i--)\n        content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));\n    tr.step(new ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end, new Slice(content, 0, 0), wrappers.length, true));\n    let found = 0;\n    for (let i = 0; i < wrappers.length; i++)\n        if (wrappers[i].type == listType)\n            found = i + 1;\n    let splitDepth = wrappers.length - found;\n    let splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent;\n    for (let i = range.startIndex, e = range.endIndex, first = true; i < e; i++, first = false) {\n        if (!first && canSplit(tr.doc, splitPos, splitDepth)) {\n            tr.split(splitPos, splitDepth);\n            splitPos += 2 * splitDepth;\n        }\n        splitPos += parent.child(i).nodeSize;\n    }\n    return tr;\n}\n/**\nBuild a command that splits a non-empty textblock at the top level\nof a list item by also splitting that list item.\n*/\nfunction splitListItem(itemType, itemAttrs) {\n    return function (state, dispatch) {\n        let { $from, $to, node } = state.selection;\n        if ((node && node.isBlock) || $from.depth < 2 || !$from.sameParent($to))\n            return false;\n        let grandParent = $from.node(-1);\n        if (grandParent.type != itemType)\n            return false;\n        if ($from.parent.content.size == 0 && $from.node(-1).childCount == $from.indexAfter(-1)) {\n            // In an empty block. If this is a nested list, the wrapping\n            // list item should be split. Otherwise, bail out and let next\n            // command handle lifting.\n            if ($from.depth == 3 || $from.node(-3).type != itemType ||\n                $from.index(-2) != $from.node(-2).childCount - 1)\n                return false;\n            if (dispatch) {\n                let wrap = Fragment.empty;\n                let depthBefore = $from.index(-1) ? 1 : $from.index(-2) ? 2 : 3;\n                // Build a fragment containing empty versions of the structure\n                // from the outer list item to the parent node of the cursor\n                for (let d = $from.depth - depthBefore; d >= $from.depth - 3; d--)\n                    wrap = Fragment.from($from.node(d).copy(wrap));\n                let depthAfter = $from.indexAfter(-1) < $from.node(-2).childCount ? 1\n                    : $from.indexAfter(-2) < $from.node(-3).childCount ? 2 : 3;\n                // Add a second list item with an empty default start node\n                wrap = wrap.append(Fragment.from(itemType.createAndFill()));\n                let start = $from.before($from.depth - (depthBefore - 1));\n                let tr = state.tr.replace(start, $from.after(-depthAfter), new Slice(wrap, 4 - depthBefore, 0));\n                let sel = -1;\n                tr.doc.nodesBetween(start, tr.doc.content.size, (node, pos) => {\n                    if (sel > -1)\n                        return false;\n                    if (node.isTextblock && node.content.size == 0)\n                        sel = pos + 1;\n                });\n                if (sel > -1)\n                    tr.setSelection(Selection.near(tr.doc.resolve(sel)));\n                dispatch(tr.scrollIntoView());\n            }\n            return true;\n        }\n        let nextType = $to.pos == $from.end() ? grandParent.contentMatchAt(0).defaultType : null;\n        let tr = state.tr.delete($from.pos, $to.pos);\n        let types = nextType ? [itemAttrs ? { type: itemType, attrs: itemAttrs } : null, { type: nextType }] : undefined;\n        if (!canSplit(tr.doc, $from.pos, 2, types))\n            return false;\n        if (dispatch)\n            dispatch(tr.split($from.pos, 2, types).scrollIntoView());\n        return true;\n    };\n}\n/**\nCreate a command to lift the list item around the selection up into\na wrapping list.\n*/\nfunction liftListItem(itemType) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to, node => node.childCount > 0 && node.firstChild.type == itemType);\n        if (!range)\n            return false;\n        if (!dispatch)\n            return true;\n        if ($from.node(range.depth - 1).type == itemType) // Inside a parent list\n            return liftToOuterList(state, dispatch, itemType, range);\n        else // Outer list node\n            return liftOutOfList(state, dispatch, range);\n    };\n}\nfunction liftToOuterList(state, dispatch, itemType, range) {\n    let tr = state.tr, end = range.end, endOfList = range.$to.end(range.depth);\n    if (end < endOfList) {\n        // There are siblings after the lifted items, which must become\n        // children of the last item\n        tr.step(new ReplaceAroundStep(end - 1, endOfList, end, endOfList, new Slice(Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));\n        range = new NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);\n    }\n    const target = liftTarget(range);\n    if (target == null)\n        return false;\n    tr.lift(range, target);\n    let after = tr.mapping.map(end, -1) - 1;\n    if (canJoin(tr.doc, after))\n        tr.join(after);\n    dispatch(tr.scrollIntoView());\n    return true;\n}\nfunction liftOutOfList(state, dispatch, range) {\n    let tr = state.tr, list = range.parent;\n    // Merge the list items into a single big item\n    for (let pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {\n        pos -= list.child(i).nodeSize;\n        tr.delete(pos - 1, pos + 1);\n    }\n    let $start = tr.doc.resolve(range.start), item = $start.nodeAfter;\n    if (tr.mapping.map(range.end) != range.start + $start.nodeAfter.nodeSize)\n        return false;\n    let atStart = range.startIndex == 0, atEnd = range.endIndex == list.childCount;\n    let parent = $start.node(-1), indexBefore = $start.index(-1);\n    if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1, item.content.append(atEnd ? Fragment.empty : Fragment.from(list))))\n        return false;\n    let start = $start.pos, end = start + item.nodeSize;\n    // Strip off the surrounding list. At the sides where we're not at\n    // the end of the list, the existing list is closed. At sides where\n    // this is the end, it is overwritten to its end.\n    tr.step(new ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1, new Slice((atStart ? Fragment.empty : Fragment.from(list.copy(Fragment.empty)))\n        .append(atEnd ? Fragment.empty : Fragment.from(list.copy(Fragment.empty))), atStart ? 0 : 1, atEnd ? 0 : 1), atStart ? 0 : 1));\n    dispatch(tr.scrollIntoView());\n    return true;\n}\n/**\nCreate a command to sink the list item around the selection down\ninto an inner list.\n*/\nfunction sinkListItem(itemType) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to, node => node.childCount > 0 && node.firstChild.type == itemType);\n        if (!range)\n            return false;\n        let startIndex = range.startIndex;\n        if (startIndex == 0)\n            return false;\n        let parent = range.parent, nodeBefore = parent.child(startIndex - 1);\n        if (nodeBefore.type != itemType)\n            return false;\n        if (dispatch) {\n            let nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;\n            let inner = Fragment.from(nestedBefore ? itemType.create() : null);\n            let slice = new Slice(Fragment.from(itemType.create(null, Fragment.from(parent.type.create(null, inner)))), nestedBefore ? 3 : 1, 0);\n            let before = range.start, after = range.end;\n            dispatch(state.tr.step(new ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after, before, after, slice, 1, true))\n                .scrollIntoView());\n        }\n        return true;\n    };\n}\n\nexport { addListNodes, bulletList, liftListItem, listItem, orderedList, sinkListItem, splitListItem, wrapInList };\n","/**\n * @typedef {import('mdast').Definition} Definition\n * @typedef {import('mdast').Nodes} Nodes\n */\n\n/**\n * @callback GetDefinition\n *   Get a definition by identifier.\n * @param {string | null | undefined} [identifier]\n *   Identifier of definition (optional).\n * @returns {Definition | undefined}\n *   Definition corresponding to `identifier` or `null`.\n */\n\nimport {visit} from 'unist-util-visit'\n\n/**\n * Find definitions in `tree`.\n *\n * Uses CommonMark precedence, which means that earlier definitions are\n * preferred over duplicate later definitions.\n *\n * @param {Nodes} tree\n *   Tree to check.\n * @returns {GetDefinition}\n *   Getter.\n */\nexport function definitions(tree) {\n  /** @type {Map<string, Definition>} */\n  const cache = new Map()\n\n  if (!tree || !tree.type) {\n    throw new Error('mdast-util-definitions expected node')\n  }\n\n  visit(tree, 'definition', function (definition) {\n    const id = clean(definition.identifier)\n    if (id && !cache.get(id)) {\n      cache.set(id, definition)\n    }\n  })\n\n  return definition\n\n  /** @type {GetDefinition} */\n  function definition(identifier) {\n    const id = clean(identifier)\n    return cache.get(id)\n  }\n}\n\n/**\n * @param {string | null | undefined} [value]\n * @returns {string}\n */\nfunction clean(value) {\n  return String(value || '').toUpperCase()\n}\n","/**\n * @typedef {import('mdast').Root} Root\n */\n\nimport {definitions} from 'mdast-util-definitions'\nimport {SKIP, visit} from 'unist-util-visit'\n\n/**\n * Turn references and definitions into normal links and images.\n *\n * @returns\n *   Transform.\n */\nexport default function remarkInlineLinks() {\n  /**\n   * Transform.\n   *\n   * @param {Root} tree\n   *   Tree.\n   * @returns {undefined}\n   *   Nothing.\n   */\n  return function (tree) {\n    const definition = definitions(tree)\n\n    visit(tree, function (node, index, parent) {\n      if (\n        node.type === 'definition' &&\n        parent !== undefined &&\n        typeof index === 'number'\n      ) {\n        parent.children.splice(index, 1)\n        return [SKIP, index]\n      }\n\n      if (node.type === 'imageReference' || node.type === 'linkReference') {\n        const def = definition(node.identifier)\n\n        if (def && parent && typeof index === 'number') {\n          parent.children[index] =\n            node.type === 'imageReference'\n              ? {type: 'image', url: def.url, title: def.title, alt: node.alt}\n              : {\n                  type: 'link',\n                  url: def.url,\n                  title: def.title,\n                  children: node.children\n                }\n          return [SKIP, index]\n        }\n      }\n    })\n  }\n}\n","import { $markAttr as V, $markSchema as U, $command as c, $inputRule as h, $useKeymap as f, $node as Qe, $nodeAttr as N, $nodeSchema as I, $ctx as Xe, $remark as D, $prose as _ } from \"@milkdown/utils\";\nimport { remarkStringifyOptionsCtx as Ye, commandsCtx as u, editorViewCtx as wt } from \"@milkdown/core\";\nimport { toggleMark as z, setBlockType as K, wrapIn as J } from \"@milkdown/prose/commands\";\nimport { Fragment as At } from \"@milkdown/prose/model\";\nimport { expectDomTypeError as w } from \"@milkdown/exception\";\nimport { textblockTypeInputRule as Ze, wrappingInputRule as Q, InputRule as et } from \"@milkdown/prose/inputrules\";\nimport Ht from \"@sindresorhus/slugify\";\nimport { TextSelection as X, Selection as tt, PluginKey as E, Plugin as P } from \"@milkdown/prose/state\";\nimport { markRule as G, findSelectedNodeOfType as Bt } from \"@milkdown/prose\";\nimport { sinkListItem as Rt, liftListItem as rt, splitListItem as vt } from \"@milkdown/prose/schema-list\";\nimport { ReplaceStep as Ot, AddMarkStep as Tt } from \"@milkdown/prose/transform\";\nimport { Decoration as ze, DecorationSet as Je } from \"@milkdown/prose/view\";\nimport { visit as Y } from \"unist-util-visit\";\nimport Kt from \"remark-inline-links\";\nfunction at(t, e) {\n  var o;\n  if (!(e.childCount >= 1 && ((o = e.lastChild) == null ? void 0 : o.type.name) === \"hardbreak\")) {\n    t.next(e.content);\n    return;\n  }\n  const a = [];\n  e.content.forEach((s, l, i) => {\n    i !== e.childCount - 1 && a.push(s);\n  }), t.next(At.fromArray(a));\n}\nfunction n(t, e) {\n  return Object.assign(t, {\n    meta: {\n      package: \"@milkdown/preset-commonmark\",\n      ...e\n    }\n  }), t;\n}\nconst Z = V(\"emphasis\");\nn(Z, {\n  displayName: \"Attr<emphasis>\",\n  group: \"Emphasis\"\n});\nconst R = U(\"emphasis\", (t) => ({\n  attrs: {\n    marker: {\n      default: t.get(Ye).emphasis || \"*\"\n    }\n  },\n  parseDOM: [\n    { tag: \"i\" },\n    { tag: \"em\" },\n    { style: \"font-style\", getAttrs: (e) => e === \"italic\" }\n  ],\n  toDOM: (e) => [\"em\", t.get(Z.key)(e)],\n  parseMarkdown: {\n    match: (e) => e.type === \"emphasis\",\n    runner: (e, r, a) => {\n      e.openMark(a, { marker: r.marker }), e.next(r.children), e.closeMark(a);\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"emphasis\",\n    runner: (e, r) => {\n      e.withMark(r, \"emphasis\", void 0, {\n        marker: r.attrs.marker\n      });\n    }\n  }\n}));\nn(R.mark, {\n  displayName: \"MarkSchema<emphasis>\",\n  group: \"Emphasis\"\n});\nn(R.ctx, {\n  displayName: \"MarkSchemaCtx<emphasis>\",\n  group: \"Emphasis\"\n});\nconst ee = c(\"ToggleEmphasis\", (t) => () => z(R.type(t)));\nn(ee, {\n  displayName: \"Command<toggleEmphasisCommand>\",\n  group: \"Emphasis\"\n});\nconst nt = h((t) => G(/(?:^|[^*])\\*([^*]+)\\*$/, R.type(t), {\n  updateCaptured: ({ fullMatch: e, start: r }) => e.startsWith(\"*\") ? {} : { fullMatch: e.slice(1), start: r + 1 }\n}));\nn(nt, {\n  displayName: \"InputRule<emphasis>|Star\",\n  group: \"Emphasis\"\n});\nconst ot = h((t) => G(/(?:^|[^_])_([^_]+)_$/, R.type(t), {\n  updateCaptured: ({ fullMatch: e, start: r }) => e.startsWith(\"_\") ? {} : { fullMatch: e.slice(1), start: r + 1 }\n}));\nn(ot, {\n  displayName: \"InputRule<emphasis>|Underscore\",\n  group: \"Emphasis\"\n});\nconst te = f(\"emphasisKeymap\", {\n  ToggleEmphasis: {\n    shortcuts: \"Mod-i\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(ee.key);\n    }\n  }\n});\nn(te.ctx, {\n  displayName: \"KeymapCtx<emphasis>\",\n  group: \"Emphasis\"\n});\nn(te.shortcuts, {\n  displayName: \"Keymap<emphasis>\",\n  group: \"Emphasis\"\n});\nconst re = V(\"strong\");\nn(re, {\n  displayName: \"Attr<strong>\",\n  group: \"Strong\"\n});\nconst $ = U(\"strong\", (t) => ({\n  attrs: {\n    marker: {\n      default: t.get(Ye).strong || \"*\"\n    }\n  },\n  parseDOM: [\n    { tag: \"b\" },\n    { tag: \"strong\" },\n    { style: \"font-style\", getAttrs: (e) => e === \"bold\" }\n  ],\n  toDOM: (e) => [\"strong\", t.get(re.key)(e)],\n  parseMarkdown: {\n    match: (e) => e.type === \"strong\",\n    runner: (e, r, a) => {\n      e.openMark(a, { marker: r.marker }), e.next(r.children), e.closeMark(a);\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"strong\",\n    runner: (e, r) => {\n      e.withMark(r, \"strong\", void 0, {\n        marker: r.attrs.marker\n      });\n    }\n  }\n}));\nn($.mark, {\n  displayName: \"MarkSchema<strong>\",\n  group: \"Strong\"\n});\nn($.ctx, {\n  displayName: \"MarkSchemaCtx<strong>\",\n  group: \"Strong\"\n});\nconst ae = c(\"ToggleStrong\", (t) => () => z($.type(t)));\nn(ae, {\n  displayName: \"Command<toggleStrongCommand>\",\n  group: \"Strong\"\n});\nconst st = h((t) => G(/(?:\\*\\*|__)([^*_]+)(?:\\*\\*|__)$/, $.type(t)));\nn(st, {\n  displayName: \"InputRule<strong>\",\n  group: \"Strong\"\n});\nconst ne = f(\"strongKeymap\", {\n  ToggleBold: {\n    shortcuts: [\"Mod-b\"],\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(ae.key);\n    }\n  }\n});\nn(ne.ctx, {\n  displayName: \"KeymapCtx<strong>\",\n  group: \"Strong\"\n});\nn(ne.shortcuts, {\n  displayName: \"Keymap<strong>\",\n  group: \"Strong\"\n});\nconst oe = V(\"inlineCode\");\nn(oe, {\n  displayName: \"Attr<inlineCode>\",\n  group: \"InlineCode\"\n});\nconst x = U(\"inlineCode\", (t) => ({\n  priority: 100,\n  code: !0,\n  inclusive: !1,\n  parseDOM: [{ tag: \"code\" }],\n  toDOM: (e) => [\"code\", t.get(oe.key)(e)],\n  parseMarkdown: {\n    match: (e) => e.type === \"inlineCode\",\n    runner: (e, r, a) => {\n      e.openMark(a), e.addText(r.value), e.closeMark(a);\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"inlineCode\",\n    runner: (e, r, a) => {\n      e.withMark(r, \"inlineCode\", a.text || \"\");\n    }\n  }\n}));\nn(x.mark, {\n  displayName: \"MarkSchema<inlineCode>\",\n  group: \"InlineCode\"\n});\nn(x.ctx, {\n  displayName: \"MarkSchemaCtx<inlineCode>\",\n  group: \"InlineCode\"\n});\nconst se = c(\"ToggleInlineCode\", (t) => () => (e, r) => {\n  const { selection: a, tr: o } = e;\n  if (a.empty)\n    return !1;\n  const { from: s, to: l } = a;\n  return e.doc.rangeHasMark(s, l, x.type(t)) ? (r == null || r(o.removeMark(s, l, x.type(t))), !0) : (Object.keys(e.schema.marks).filter((m) => m !== x.type.name).map((m) => e.schema.marks[m]).forEach((m) => {\n    o.removeMark(s, l, m);\n  }), r == null || r(o.addMark(s, l, x.type(t).create())), !0);\n});\nn(se, {\n  displayName: \"Command<toggleInlineCodeCommand>\",\n  group: \"InlineCode\"\n});\nconst lt = h((t) => G(/(?:\\`)([^\\`]+)(?:\\`)$/, x.type(t)));\nn(lt, {\n  displayName: \"InputRule<inlineCodeInputRule>\",\n  group: \"InlineCode\"\n});\nconst le = f(\"inlineCodeKeymap\", {\n  ToggleInlineCode: {\n    shortcuts: \"Mod-e\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(se.key);\n    }\n  }\n});\nn(le.ctx, {\n  displayName: \"KeymapCtx<inlineCode>\",\n  group: \"InlineCode\"\n});\nn(le.shortcuts, {\n  displayName: \"Keymap<inlineCode>\",\n  group: \"InlineCode\"\n});\nconst ie = V(\"link\");\nn(ie, {\n  displayName: \"Attr<link>\",\n  group: \"Link\"\n});\nconst B = U(\"link\", (t) => ({\n  attrs: {\n    href: {},\n    title: { default: null }\n  },\n  parseDOM: [\n    {\n      tag: \"a[href]\",\n      getAttrs: (e) => {\n        if (!(e instanceof HTMLElement))\n          throw w(e);\n        return { href: e.getAttribute(\"href\"), title: e.getAttribute(\"title\") };\n      }\n    }\n  ],\n  toDOM: (e) => [\"a\", { ...t.get(ie.key)(e), ...e.attrs }],\n  parseMarkdown: {\n    match: (e) => e.type === \"link\",\n    runner: (e, r, a) => {\n      const o = r.url, s = r.title;\n      e.openMark(a, { href: o, title: s }), e.next(r.children), e.closeMark(a);\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"link\",\n    runner: (e, r) => {\n      e.withMark(r, \"link\", void 0, {\n        title: r.attrs.title,\n        url: r.attrs.href\n      });\n    }\n  }\n}));\nn(B.mark, {\n  displayName: \"MarkSchema<link>\",\n  group: \"Link\"\n});\nconst it = c(\"ToggleLink\", (t) => (e = {}) => z(B.type(t), e));\nn(it, {\n  displayName: \"Command<toggleLinkCommand>\",\n  group: \"Link\"\n});\nconst dt = c(\"UpdateLink\", (t) => (e = {}) => (r, a) => {\n  if (!a)\n    return !1;\n  let o, s = -1;\n  const { selection: l } = r, { from: i, to: d } = l;\n  if (r.doc.nodesBetween(i, i === d ? d + 1 : d, (y, b) => {\n    if (B.type(t).isInSet(y.marks))\n      return o = y, s = b, !1;\n  }), !o)\n    return !1;\n  const m = o.marks.find(({ type: y }) => y === B.type(t));\n  if (!m)\n    return !1;\n  const p = s, k = s + o.nodeSize, { tr: g } = r, C = B.type(t).create({ ...m.attrs, ...e });\n  return C ? (a(\n    g.removeMark(p, k, m).addMark(p, k, C).setSelection(new X(g.selection.$anchor)).scrollIntoView()\n  ), !0) : !1;\n});\nn(dt, {\n  displayName: \"Command<updateLinkCommand>\",\n  group: \"Link\"\n});\nconst mt = Qe(\"doc\", () => ({\n  content: \"block+\",\n  parseMarkdown: {\n    match: ({ type: t }) => t === \"root\",\n    runner: (t, e, r) => {\n      t.injectRoot(e, r);\n    }\n  },\n  toMarkdown: {\n    match: (t) => t.type.name === \"doc\",\n    runner: (t, e) => {\n      t.openNode(\"root\"), t.next(e.content);\n    }\n  }\n}));\nn(mt, {\n  displayName: \"NodeSchema<doc>\",\n  group: \"Doc\"\n});\nconst de = N(\"paragraph\");\nn(de, {\n  displayName: \"Attr<paragraph>\",\n  group: \"Paragraph\"\n});\nconst A = I(\"paragraph\", (t) => ({\n  content: \"inline*\",\n  group: \"block\",\n  parseDOM: [{ tag: \"p\" }],\n  toDOM: (e) => [\"p\", t.get(de.key)(e), 0],\n  parseMarkdown: {\n    match: (e) => e.type === \"paragraph\",\n    runner: (e, r, a) => {\n      e.openNode(a), r.children ? e.next(r.children) : e.addText(r.value || \"\"), e.closeNode();\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"paragraph\",\n    runner: (e, r) => {\n      e.openNode(\"paragraph\"), at(e, r), e.closeNode();\n    }\n  }\n}));\nn(A.node, {\n  displayName: \"NodeSchema<paragraph>\",\n  group: \"Paragraph\"\n});\nn(A.ctx, {\n  displayName: \"NodeSchemaCtx<paragraph>\",\n  group: \"Paragraph\"\n});\nconst me = c(\"TurnIntoText\", (t) => () => K(A.type(t)));\nn(me, {\n  displayName: \"Command<turnIntoTextCommand>\",\n  group: \"Paragraph\"\n});\nconst pe = f(\"paragraphKeymap\", {\n  TurnIntoText: {\n    shortcuts: \"Mod-Alt-0\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(me.key);\n    }\n  }\n});\nn(pe.ctx, {\n  displayName: \"KeymapCtx<paragraph>\",\n  group: \"Paragraph\"\n});\nn(pe.shortcuts, {\n  displayName: \"Keymap<paragraph>\",\n  group: \"Paragraph\"\n});\nconst Dt = Array(6).fill(0).map((t, e) => e + 1);\nfunction _t(t) {\n  return Ht(t.textContent);\n}\nconst j = Xe(_t, \"headingIdGenerator\");\nn(j, {\n  displayName: \"Ctx<HeadingIdGenerator>\",\n  group: \"Heading\"\n});\nconst ce = N(\"heading\");\nn(ce, {\n  displayName: \"Attr<heading>\",\n  group: \"Heading\"\n});\nconst H = I(\"heading\", (t) => {\n  const e = t.get(j.key);\n  return {\n    content: \"inline*\",\n    group: \"block\",\n    defining: !0,\n    attrs: {\n      id: {\n        default: \"\"\n      },\n      level: {\n        default: 1\n      }\n    },\n    parseDOM: Dt.map((r) => ({\n      tag: `h${r}`,\n      getAttrs: (a) => {\n        if (!(a instanceof HTMLElement))\n          throw w(a);\n        return { level: r, id: a.id };\n      }\n    })),\n    toDOM: (r) => [\n      `h${r.attrs.level}`,\n      {\n        ...t.get(ce.key)(r),\n        id: r.attrs.id || e(r)\n      },\n      0\n    ],\n    parseMarkdown: {\n      match: ({ type: r }) => r === \"heading\",\n      runner: (r, a, o) => {\n        const s = a.depth;\n        r.openNode(o, { level: s }), r.next(a.children), r.closeNode();\n      }\n    },\n    toMarkdown: {\n      match: (r) => r.type.name === \"heading\",\n      runner: (r, a) => {\n        r.openNode(\"heading\", void 0, { depth: a.attrs.level }), at(r, a), r.closeNode();\n      }\n    }\n  };\n});\nn(H.node, {\n  displayName: \"NodeSchema<heading>\",\n  group: \"Heading\"\n});\nn(H.ctx, {\n  displayName: \"NodeSchemaCtx<heading>\",\n  group: \"Heading\"\n});\nconst pt = h((t) => Ze(/^(?<hashes>#+)\\s$/, H.type(t), (e) => {\n  var l, i;\n  const r = ((i = (l = e.groups) == null ? void 0 : l.hashes) == null ? void 0 : i.length) || 0, a = t.get(wt), { $from: o } = a.state.selection, s = o.node();\n  if (s.type.name === \"heading\") {\n    let d = Number(s.attrs.level) + Number(r);\n    return d > 6 && (d = 6), { level: d };\n  }\n  return { level: r };\n}));\nn(pt, {\n  displayName: \"InputRule<wrapInHeadingInputRule>\",\n  group: \"Heading\"\n});\nconst L = c(\"WrapInHeading\", (t) => (e) => (e ?? (e = 1), e < 1 ? K(A.type(t)) : K(H.type(t), { level: e })));\nn(L, {\n  displayName: \"Command<wrapInHeadingCommand>\",\n  group: \"Heading\"\n});\nconst ue = c(\"DowngradeHeading\", (t) => () => (e, r, a) => {\n  const { $from: o } = e.selection, s = o.node();\n  if (s.type !== H.type(t) || !e.selection.empty || o.parentOffset !== 0)\n    return !1;\n  const l = s.attrs.level - 1;\n  return l ? (r == null || r(\n    e.tr.setNodeMarkup(e.selection.$from.before(), void 0, {\n      ...s.attrs,\n      level: l\n    })\n  ), !0) : K(A.type(t))(e, r, a);\n});\nn(ue, {\n  displayName: \"Command<downgradeHeadingCommand>\",\n  group: \"Heading\"\n});\nconst ge = f(\"headingKeymap\", {\n  TurnIntoH1: {\n    shortcuts: \"Mod-Alt-1\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(L.key, 1);\n    }\n  },\n  TurnIntoH2: {\n    shortcuts: \"Mod-Alt-2\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(L.key, 2);\n    }\n  },\n  TurnIntoH3: {\n    shortcuts: \"Mod-Alt-3\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(L.key, 3);\n    }\n  },\n  TurnIntoH4: {\n    shortcuts: \"Mod-Alt-4\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(L.key, 4);\n    }\n  },\n  TurnIntoH5: {\n    shortcuts: \"Mod-Alt-5\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(L.key, 5);\n    }\n  },\n  TurnIntoH6: {\n    shortcuts: \"Mod-Alt-6\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(L.key, 6);\n    }\n  },\n  DowngradeHeading: {\n    shortcuts: [\"Delete\", \"Backspace\"],\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(ue.key);\n    }\n  }\n});\nn(ge.ctx, {\n  displayName: \"KeymapCtx<heading>\",\n  group: \"Heading\"\n});\nn(ge.shortcuts, {\n  displayName: \"Keymap<heading>\",\n  group: \"Heading\"\n});\nconst ye = N(\"blockquote\");\nn(ye, {\n  displayName: \"Attr<blockquote>\",\n  group: \"Blockquote\"\n});\nconst q = I(\"blockquote\", (t) => ({\n  content: \"block+\",\n  group: \"block\",\n  defining: !0,\n  parseDOM: [{ tag: \"blockquote\" }],\n  toDOM: (e) => [\"blockquote\", t.get(ye.key)(e), 0],\n  parseMarkdown: {\n    match: ({ type: e }) => e === \"blockquote\",\n    runner: (e, r, a) => {\n      e.openNode(a).next(r.children).closeNode();\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"blockquote\",\n    runner: (e, r) => {\n      e.openNode(\"blockquote\").next(r.content).closeNode();\n    }\n  }\n}));\nn(q.node, {\n  displayName: \"NodeSchema<blockquote>\",\n  group: \"Blockquote\"\n});\nn(q.ctx, {\n  displayName: \"NodeSchemaCtx<blockquote>\",\n  group: \"Blockquote\"\n});\nconst ct = h((t) => Q(/^\\s*>\\s$/, q.type(t)));\nn(ct, {\n  displayName: \"InputRule<wrapInBlockquoteInputRule>\",\n  group: \"Blockquote\"\n});\nconst ke = c(\"WrapInBlockquote\", (t) => () => J(q.type(t)));\nn(ke, {\n  displayName: \"Command<wrapInBlockquoteCommand>\",\n  group: \"Blockquote\"\n});\nconst he = f(\"blockquoteKeymap\", {\n  WrapInBlockquote: {\n    shortcuts: \"Mod-Shift-b\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(ke.key);\n    }\n  }\n});\nn(he.ctx, {\n  displayName: \"KeymapCtx<blockquote>\",\n  group: \"Blockquote\"\n});\nn(he.shortcuts, {\n  displayName: \"Keymap<blockquote>\",\n  group: \"Blockquote\"\n});\nconst fe = N(\"codeBlock\", () => ({\n  pre: {},\n  code: {}\n}));\nn(fe, {\n  displayName: \"Attr<codeBlock>\",\n  group: \"CodeBlock\"\n});\nconst W = I(\"code_block\", (t) => ({\n  content: \"text*\",\n  group: \"block\",\n  marks: \"\",\n  defining: !0,\n  code: !0,\n  attrs: {\n    language: {\n      default: \"\"\n    }\n  },\n  parseDOM: [\n    {\n      tag: \"pre\",\n      preserveWhitespace: \"full\",\n      getAttrs: (e) => {\n        if (!(e instanceof HTMLElement))\n          throw w(e);\n        return { language: e.dataset.language };\n      }\n    }\n  ],\n  toDOM: (e) => {\n    const r = t.get(fe.key)(e);\n    return [\n      \"pre\",\n      {\n        ...r.pre,\n        \"data-language\": e.attrs.language\n      },\n      [\"code\", r.code, 0]\n    ];\n  },\n  parseMarkdown: {\n    match: ({ type: e }) => e === \"code\",\n    runner: (e, r, a) => {\n      const o = r.lang, s = r.value;\n      e.openNode(a, { language: o }), s && e.addText(s), e.closeNode();\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"code_block\",\n    runner: (e, r) => {\n      var a;\n      e.addNode(\"code\", void 0, ((a = r.content.firstChild) == null ? void 0 : a.text) || \"\", {\n        lang: r.attrs.language\n      });\n    }\n  }\n}));\nn(W.node, {\n  displayName: \"NodeSchema<codeBlock>\",\n  group: \"CodeBlock\"\n});\nn(W.ctx, {\n  displayName: \"NodeSchemaCtx<codeBlock>\",\n  group: \"CodeBlock\"\n});\nconst ut = h((t) => Ze(/^```(?<language>[a-z]*)?[\\s\\n]$/, W.type(t), (e) => {\n  var r;\n  return {\n    language: ((r = e.groups) == null ? void 0 : r.language) ?? \"\"\n  };\n}));\nn(ut, {\n  displayName: \"InputRule<createCodeBlockInputRule>\",\n  group: \"CodeBlock\"\n});\nconst Ne = c(\"CreateCodeBlock\", (t) => (e = \"\") => K(W.type(t), { language: e }));\nn(Ne, {\n  displayName: \"Command<createCodeBlockCommand>\",\n  group: \"CodeBlock\"\n});\nconst Et = c(\"UpdateCodeBlockLanguage\", () => ({ pos: t, language: e } = { pos: -1, language: \"\" }) => (r, a) => t >= 0 ? (a == null || a(r.tr.setNodeAttribute(t, \"language\", e)), !0) : !1);\nn(Et, {\n  displayName: \"Command<updateCodeBlockLanguageCommand>\",\n  group: \"CodeBlock\"\n});\nconst Ie = f(\"codeBlockKeymap\", {\n  CreateCodeBlock: {\n    shortcuts: \"Mod-Alt-c\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(Ne.key);\n    }\n  }\n});\nn(Ie.ctx, {\n  displayName: \"KeymapCtx<codeBlock>\",\n  group: \"CodeBlock\"\n});\nn(Ie.shortcuts, {\n  displayName: \"Keymap<codeBlock>\",\n  group: \"CodeBlock\"\n});\nconst Ce = N(\"image\");\nn(Ce, {\n  displayName: \"Attr<image>\",\n  group: \"Image\"\n});\nconst v = I(\"image\", (t) => ({\n  inline: !0,\n  group: \"inline\",\n  selectable: !0,\n  draggable: !0,\n  marks: \"\",\n  atom: !0,\n  defining: !0,\n  isolating: !0,\n  attrs: {\n    src: { default: \"\" },\n    alt: { default: \"\" },\n    title: { default: \"\" }\n  },\n  parseDOM: [\n    {\n      tag: \"img[src]\",\n      getAttrs: (e) => {\n        if (!(e instanceof HTMLElement))\n          throw w(e);\n        return {\n          src: e.getAttribute(\"src\") || \"\",\n          alt: e.getAttribute(\"alt\") || \"\",\n          title: e.getAttribute(\"title\") || e.getAttribute(\"alt\") || \"\"\n        };\n      }\n    }\n  ],\n  toDOM: (e) => [\"img\", { ...t.get(Ce.key)(e), ...e.attrs }],\n  parseMarkdown: {\n    match: ({ type: e }) => e === \"image\",\n    runner: (e, r, a) => {\n      const o = r.url, s = r.alt, l = r.title;\n      e.addNode(a, {\n        src: o,\n        alt: s,\n        title: l\n      });\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"image\",\n    runner: (e, r) => {\n      e.addNode(\"image\", void 0, void 0, {\n        title: r.attrs.title,\n        url: r.attrs.src,\n        alt: r.attrs.alt\n      });\n    }\n  }\n}));\nn(v.node, {\n  displayName: \"NodeSchema<image>\",\n  group: \"Image\"\n});\nn(v.ctx, {\n  displayName: \"NodeSchemaCtx<image>\",\n  group: \"Image\"\n});\nconst gt = c(\"InsertImage\", (t) => (e = {}) => (r, a) => {\n  if (!a)\n    return !0;\n  const { src: o = \"\", alt: s = \"\", title: l = \"\" } = e, i = v.type(t).create({ src: o, alt: s, title: l });\n  return i && a(r.tr.replaceSelectionWith(i).scrollIntoView()), !0;\n});\nn(gt, {\n  displayName: \"Command<insertImageCommand>\",\n  group: \"Image\"\n});\nconst yt = c(\"UpdateImage\", (t) => (e = {}) => (r, a) => {\n  const o = Bt(r.selection, v.type(t));\n  if (!o)\n    return !1;\n  const { node: s, pos: l } = o, i = { ...s.attrs }, { src: d, alt: m, title: p } = e;\n  return d !== void 0 && (i.src = d), m !== void 0 && (i.alt = m), p !== void 0 && (i.title = p), a == null || a(r.tr.setNodeMarkup(l, void 0, i).scrollIntoView()), !0;\n});\nn(yt, {\n  displayName: \"Command<updateImageCommand>\",\n  group: \"Image\"\n});\nconst Pt = h((t) => new et(\n  /!\\[(?<alt>.*?)]\\((?<filename>.*?)\\s*(?=\"|\\))\"?(?<title>[^\"]+)?\"?\\)/,\n  (e, r, a, o) => {\n    const [s, l, i = \"\", d] = r;\n    return s ? e.tr.replaceWith(a, o, v.type(t).create({ src: i, alt: l, title: d })) : null;\n  }\n));\nn(Pt, {\n  displayName: \"InputRule<insertImageInputRule>\",\n  group: \"Image\"\n});\nconst Me = N(\"hardbreak\", (t) => ({\n  \"data-is-inline\": t.attrs.isInline\n}));\nn(Me, {\n  displayName: \"Attr<hardbreak>\",\n  group: \"Hardbreak\"\n});\nconst S = I(\"hardbreak\", (t) => ({\n  inline: !0,\n  group: \"inline\",\n  attrs: {\n    isInline: {\n      default: !1\n    }\n  },\n  selectable: !1,\n  parseDOM: [{ tag: \"br\" }],\n  toDOM: (e) => [\"br\", t.get(Me.key)(e)],\n  parseMarkdown: {\n    match: ({ type: e }) => e === \"break\",\n    runner: (e, r, a) => {\n      var o;\n      e.addNode(a, { isInline: !!((o = r.data) != null && o.isInline) });\n    }\n  },\n  leafText: () => `\n`,\n  toMarkdown: {\n    match: (e) => e.type.name === \"hardbreak\",\n    runner: (e, r) => {\n      r.attrs.isInline ? e.addNode(\"text\", void 0, `\n`) : e.addNode(\"break\");\n    }\n  }\n}));\nn(S.node, {\n  displayName: \"NodeSchema<hardbreak>\",\n  group: \"Hardbreak\"\n});\nn(S.ctx, {\n  displayName: \"NodeSchemaCtx<hardbreak>\",\n  group: \"Hardbreak\"\n});\nconst be = c(\"InsertHardbreak\", (t) => () => (e, r) => {\n  var s;\n  const { selection: a, tr: o } = e;\n  if (!(a instanceof X))\n    return !1;\n  if (a.empty) {\n    const l = a.$from.node();\n    if (l.childCount > 0 && ((s = l.lastChild) == null ? void 0 : s.type.name) === \"hardbreak\")\n      return r == null || r(\n        o.replaceRangeWith(a.to - 1, a.to, e.schema.node(\"paragraph\")).setSelection(tt.near(o.doc.resolve(a.to))).scrollIntoView()\n      ), !0;\n  }\n  return r == null || r(o.setMeta(\"hardbreak\", !0).replaceSelectionWith(S.type(t).create()).scrollIntoView()), !0;\n});\nn(be, {\n  displayName: \"Command<insertHardbreakCommand>\",\n  group: \"Hardbreak\"\n});\nconst Le = f(\"hardbreakKeymap\", {\n  InsertHardbreak: {\n    shortcuts: \"Shift-Enter\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(be.key);\n    }\n  }\n});\nn(Le.ctx, {\n  displayName: \"KeymapCtx<hardbreak>\",\n  group: \"Hardbreak\"\n});\nn(Le.shortcuts, {\n  displayName: \"Keymap<hardbreak>\",\n  group: \"Hardbreak\"\n});\nconst xe = N(\"hr\");\nn(xe, {\n  displayName: \"Attr<hr>\",\n  group: \"Hr\"\n});\nconst F = I(\"hr\", (t) => ({\n  group: \"block\",\n  parseDOM: [{ tag: \"hr\" }],\n  toDOM: (e) => [\"hr\", t.get(xe.key)(e)],\n  parseMarkdown: {\n    match: ({ type: e }) => e === \"thematicBreak\",\n    runner: (e, r, a) => {\n      e.addNode(a);\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"hr\",\n    runner: (e) => {\n      e.addNode(\"thematicBreak\");\n    }\n  }\n}));\nn(F.node, {\n  displayName: \"NodeSchema<hr>\",\n  group: \"Hr\"\n});\nn(F.ctx, {\n  displayName: \"NodeSchemaCtx<hr>\",\n  group: \"Hr\"\n});\nconst kt = h((t) => new et(\n  /^(?:---|___\\s|\\*\\*\\*\\s)$/,\n  (e, r, a, o) => {\n    const { tr: s } = e;\n    return r[0] && s.replaceWith(a - 1, o, F.type(t).create()), s;\n  }\n));\nn(kt, {\n  displayName: \"InputRule<insertHrInputRule>\",\n  group: \"Hr\"\n});\nconst ht = c(\"InsertHr\", (t) => () => (e, r) => {\n  if (!r)\n    return !0;\n  const a = A.node.type(t).create(), { tr: o, selection: s } = e, { from: l } = s, i = F.type(t).create();\n  if (!i)\n    return !0;\n  const d = o.replaceSelectionWith(i).insert(l, a), m = tt.findFrom(d.doc.resolve(l), 1, !0);\n  return m && r(d.setSelection(m).scrollIntoView()), !0;\n});\nn(ht, {\n  displayName: \"Command<insertHrCommand>\",\n  group: \"Hr\"\n});\nconst Se = N(\"bulletList\");\nn(Se, {\n  displayName: \"Attr<bulletList>\",\n  group: \"BulletList\"\n});\nconst O = I(\"bullet_list\", (t) => ({\n  content: \"listItem+\",\n  group: \"block\",\n  attrs: {\n    spread: {\n      default: !1\n    }\n  },\n  parseDOM: [\n    {\n      tag: \"ul\",\n      getAttrs: (e) => {\n        if (!(e instanceof HTMLElement))\n          throw w(e);\n        return {\n          spread: e.dataset.spread\n        };\n      }\n    }\n  ],\n  toDOM: (e) => [\n    \"ul\",\n    {\n      ...t.get(Se.key)(e),\n      \"data-spread\": e.attrs.spread\n    },\n    0\n  ],\n  parseMarkdown: {\n    match: ({ type: e, ordered: r }) => e === \"list\" && !r,\n    runner: (e, r, a) => {\n      const o = r.spread != null ? `${r.spread}` : \"false\";\n      e.openNode(a, { spread: o }).next(r.children).closeNode();\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"bullet_list\",\n    runner: (e, r) => {\n      e.openNode(\"list\", void 0, { ordered: !1, spread: r.attrs.spread === \"true\" }).next(r.content).closeNode();\n    }\n  }\n}));\nn(O.node, {\n  displayName: \"NodeSchema<bulletList>\",\n  group: \"BulletList\"\n});\nn(O.ctx, {\n  displayName: \"NodeSchemaCtx<bulletList>\",\n  group: \"BulletList\"\n});\nconst ft = h((t) => Q(/^\\s*([-+*])\\s$/, O.type(t)));\nn(ft, {\n  displayName: \"InputRule<wrapInBulletListInputRule>\",\n  group: \"BulletList\"\n});\nconst we = c(\"WrapInBulletList\", (t) => () => J(O.type(t)));\nn(we, {\n  displayName: \"Command<wrapInBulletListCommand>\",\n  group: \"BulletList\"\n});\nconst Ae = f(\"bulletListKeymap\", {\n  WrapInBulletList: {\n    shortcuts: \"Mod-Alt-8\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(we.key);\n    }\n  }\n});\nn(Ae.ctx, {\n  displayName: \"KeymapCtx<bulletListKeymap>\",\n  group: \"BulletList\"\n});\nn(Ae.shortcuts, {\n  displayName: \"Keymap<bulletListKeymap>\",\n  group: \"BulletList\"\n});\nconst He = N(\"orderedList\");\nn(He, {\n  displayName: \"Attr<orderedList>\",\n  group: \"OrderedList\"\n});\nconst T = I(\"ordered_list\", (t) => ({\n  content: \"listItem+\",\n  group: \"block\",\n  attrs: {\n    order: {\n      default: 1\n    },\n    spread: {\n      default: !1\n    }\n  },\n  parseDOM: [\n    {\n      tag: \"ol\",\n      getAttrs: (e) => {\n        if (!(e instanceof HTMLElement))\n          throw w(e);\n        return {\n          spread: e.dataset.spread,\n          order: e.hasAttribute(\"start\") ? Number(e.getAttribute(\"start\")) : 1\n        };\n      }\n    }\n  ],\n  toDOM: (e) => [\n    \"ol\",\n    {\n      ...t.get(He.key)(e),\n      ...e.attrs.order === 1 ? {} : e.attrs.order,\n      \"data-spread\": e.attrs.spread\n    },\n    0\n  ],\n  parseMarkdown: {\n    match: ({ type: e, ordered: r }) => e === \"list\" && !!r,\n    runner: (e, r, a) => {\n      const o = r.spread != null ? `${r.spread}` : \"true\";\n      e.openNode(a, { spread: o }).next(r.children).closeNode();\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"ordered_list\",\n    runner: (e, r) => {\n      e.openNode(\"list\", void 0, { ordered: !0, start: 1, spread: r.attrs.spread === \"true\" }), e.next(r.content), e.closeNode();\n    }\n  }\n}));\nn(T.node, {\n  displayName: \"NodeSchema<orderedList>\",\n  group: \"OrderedList\"\n});\nn(T.ctx, {\n  displayName: \"NodeSchemaCtx<orderedList>\",\n  group: \"OrderedList\"\n});\nconst Nt = h((t) => Q(\n  /^\\s*(\\d+)\\.\\s$/,\n  T.type(t),\n  (e) => ({ order: Number(e[1]) }),\n  (e, r) => r.childCount + r.attrs.order === Number(e[1])\n));\nn(Nt, {\n  displayName: \"InputRule<wrapInOrderedListInputRule>\",\n  group: \"OrderedList\"\n});\nconst Be = c(\"WrapInOrderedList\", (t) => () => J(T.type(t)));\nn(Be, {\n  displayName: \"Command<wrapInOrderedListCommand>\",\n  group: \"OrderedList\"\n});\nconst Re = f(\"orderedListKeymap\", {\n  WrapInOrderedList: {\n    shortcuts: \"Mod-Alt-7\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(Be.key);\n    }\n  }\n});\nn(Re.ctx, {\n  displayName: \"KeymapCtx<orderedList>\",\n  group: \"OrderedList\"\n});\nn(Re.shortcuts, {\n  displayName: \"Keymap<orderedList>\",\n  group: \"OrderedList\"\n});\nconst ve = N(\"listItem\");\nn(ve, {\n  displayName: \"Attr<listItem>\",\n  group: \"ListItem\"\n});\nconst M = I(\"list_item\", (t) => ({\n  group: \"listItem\",\n  content: \"paragraph block*\",\n  attrs: {\n    label: {\n      default: \"•\"\n    },\n    listType: {\n      default: \"bullet\"\n    },\n    spread: {\n      default: \"true\"\n    }\n  },\n  defining: !0,\n  parseDOM: [\n    {\n      tag: \"li\",\n      getAttrs: (e) => {\n        if (!(e instanceof HTMLElement))\n          throw w(e);\n        return {\n          label: e.dataset.label,\n          listType: e.dataset[\"list-type\"],\n          spread: e.dataset.spread\n        };\n      }\n    }\n  ],\n  toDOM: (e) => [\n    \"li\",\n    {\n      ...t.get(ve.key)(e),\n      \"data-label\": e.attrs.label,\n      \"data-list-type\": e.attrs.listType,\n      \"data-spread\": e.attrs.spread\n    },\n    0\n  ],\n  parseMarkdown: {\n    match: ({ type: e }) => e === \"listItem\",\n    runner: (e, r, a) => {\n      const o = r.label != null ? `${r.label}.` : \"•\", s = r.label != null ? \"ordered\" : \"bullet\", l = r.spread != null ? `${r.spread}` : \"true\";\n      e.openNode(a, { label: o, listType: s, spread: l }), e.next(r.children), e.closeNode();\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"list_item\",\n    runner: (e, r) => {\n      e.openNode(\"listItem\", void 0, { spread: r.attrs.spread === \"true\" }), e.next(r.content), e.closeNode();\n    }\n  }\n}));\nn(M.node, {\n  displayName: \"NodeSchema<listItem>\",\n  group: \"ListItem\"\n});\nn(M.ctx, {\n  displayName: \"NodeSchemaCtx<listItem>\",\n  group: \"ListItem\"\n});\nconst Oe = c(\"SinkListItem\", (t) => () => Rt(M.type(t)));\nn(Oe, {\n  displayName: \"Command<sinkListItemCommand>\",\n  group: \"ListItem\"\n});\nconst Te = c(\"SplitListItem\", (t) => () => rt(M.type(t)));\nn(Te, {\n  displayName: \"Command<liftListItemCommand>\",\n  group: \"ListItem\"\n});\nconst Ke = c(\"SplitListItem\", (t) => () => vt(M.type(t)));\nn(Ke, {\n  displayName: \"Command<splitListItemCommand>\",\n  group: \"ListItem\"\n});\nfunction $t(t) {\n  return (e, r, a) => {\n    const { selection: o } = e;\n    if (!(o instanceof X))\n      return !1;\n    const { empty: s, $from: l } = o;\n    if (!s || l.parentOffset !== 0)\n      return !1;\n    const i = l.node(-1);\n    return i.type !== M.type(t) || i.firstChild !== l.node() || l.node(-2).childCount > 1 ? !1 : rt(M.type(t))(e, r, a);\n  };\n}\nconst De = c(\"LiftFirstListItem\", (t) => () => $t(t));\nn(De, {\n  displayName: \"Command<liftFirstListItemCommand>\",\n  group: \"ListItem\"\n});\nconst _e = f(\"listItemKeymap\", {\n  NextListItem: {\n    shortcuts: \"Enter\",\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(Ke.key);\n    }\n  },\n  SinkListItem: {\n    shortcuts: [\"Tab\", \"Mod-]\"],\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(Oe.key);\n    }\n  },\n  LiftListItem: {\n    shortcuts: [\"Shift-Tab\", \"Mod-[\"],\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(Te.key);\n    }\n  },\n  LiftFirstListItem: {\n    shortcuts: [\"Backspace\", \"Delete\"],\n    command: (t) => {\n      const e = t.get(u);\n      return () => e.call(De.key);\n    }\n  }\n});\nn(_e.ctx, {\n  displayName: \"KeymapCtx<listItem>\",\n  group: \"ListItem\"\n});\nn(_e.shortcuts, {\n  displayName: \"Keymap<listItem>\",\n  group: \"ListItem\"\n});\nconst It = Qe(\"text\", () => ({\n  group: \"inline\",\n  parseMarkdown: {\n    match: ({ type: t }) => t === \"text\",\n    runner: (t, e) => {\n      t.addText(e.value);\n    }\n  },\n  toMarkdown: {\n    match: (t) => t.type.name === \"text\",\n    runner: (t, e) => {\n      t.addNode(\"text\", void 0, e.text);\n    }\n  }\n}));\nn(It, {\n  displayName: \"NodeSchema<text>\",\n  group: \"Text\"\n});\nconst Ee = N(\"html\");\nn(Ee, {\n  displayName: \"Attr<html>\",\n  group: \"Html\"\n});\nconst Pe = I(\"html\", (t) => ({\n  atom: !0,\n  group: \"inline\",\n  inline: !0,\n  attrs: {\n    value: {\n      default: \"\"\n    }\n  },\n  toDOM: (e) => {\n    const r = document.createElement(\"span\"), a = {\n      ...t.get(Ee.key)(e),\n      \"data-value\": e.attrs.value,\n      \"data-type\": \"html\"\n    };\n    return r.textContent = e.attrs.value, [\"span\", a, e.attrs.value];\n  },\n  parseDOM: [{\n    tag: 'span[data-type=\"html\"]',\n    getAttrs: (e) => ({\n      value: e.dataset.value ?? \"\"\n    })\n  }],\n  parseMarkdown: {\n    match: ({ type: e }) => e === \"html\",\n    runner: (e, r, a) => {\n      e.addNode(a, { value: r.value });\n    }\n  },\n  toMarkdown: {\n    match: (e) => e.type.name === \"html\",\n    runner: (e, r) => {\n      e.addNode(\"html\", void 0, r.attrs.value);\n    }\n  }\n}));\nn(Pe.node, {\n  displayName: \"NodeSchema<html>\",\n  group: \"Html\"\n});\nn(Pe.ctx, {\n  displayName: \"NodeSchemaCtx<html>\",\n  group: \"Html\"\n});\nconst qt = [\n  mt,\n  de,\n  A,\n  j,\n  ce,\n  H,\n  Me,\n  S,\n  ye,\n  q,\n  fe,\n  W,\n  xe,\n  F,\n  Ce,\n  v,\n  Se,\n  O,\n  He,\n  T,\n  ve,\n  M,\n  Z,\n  R,\n  re,\n  $,\n  oe,\n  x,\n  ie,\n  B,\n  Ee,\n  Pe,\n  It\n].flat(), Wt = [\n  ct,\n  ft,\n  Nt,\n  ut,\n  kt,\n  pt\n].flat(), Ft = [\n  nt,\n  ot,\n  lt,\n  st\n], Vt = [\n  me,\n  ke,\n  L,\n  ue,\n  Ne,\n  be,\n  ht,\n  gt,\n  yt,\n  Be,\n  we,\n  Oe,\n  Ke,\n  Te,\n  De,\n  ee,\n  se,\n  ae,\n  it,\n  dt\n], Ut = [\n  he,\n  Ie,\n  Le,\n  ge,\n  _e,\n  Re,\n  Ae,\n  pe,\n  te,\n  le,\n  ne\n].flat(), $e = D(\"remarkAddOrderInList\", () => () => (t) => {\n  Y(t, \"list\", (e) => {\n    if (e.ordered) {\n      const r = e.start ?? 1;\n      e.children.forEach((a, o) => {\n        a.label = o + r;\n      });\n    }\n  });\n});\nn($e.plugin, {\n  displayName: \"Remark<remarkAddOrderInListPlugin>\",\n  group: \"Remark\"\n});\nn($e.options, {\n  displayName: \"RemarkConfig<remarkAddOrderInListPlugin>\",\n  group: \"Remark\"\n});\nconst qe = D(\"remarkLineBreak\", () => () => (t) => {\n  const e = /[\\t ]*(?:\\r?\\n|\\r)/g;\n  Y(t, \"text\", (r, a, o) => {\n    if (!r.value || typeof r.value != \"string\")\n      return;\n    const s = [];\n    let l = 0;\n    e.lastIndex = 0;\n    let i = e.exec(r.value);\n    for (; i; ) {\n      const m = i.index;\n      l !== m && s.push({ type: \"text\", value: r.value.slice(l, m) }), s.push({ type: \"break\", data: { isInline: !0 } }), l = m + i[0].length, i = e.exec(r.value);\n    }\n    if (s.length > 0 && o && typeof a == \"number\")\n      return l < r.value.length && s.push({ type: \"text\", value: r.value.slice(l) }), o.children.splice(a, 1, ...s), a + s.length;\n  });\n});\nn(qe.plugin, {\n  displayName: \"Remark<remarkLineBreak>\",\n  group: \"Remark\"\n});\nn(qe.options, {\n  displayName: \"RemarkConfig<remarkLineBreak>\",\n  group: \"Remark\"\n});\nconst We = D(\"remarkInlineLink\", () => Kt);\nn(We.plugin, {\n  displayName: \"Remark<remarkInlineLinkPlugin>\",\n  group: \"Remark\"\n});\nn(We.options, {\n  displayName: \"RemarkConfig<remarkInlineLinkPlugin>\",\n  group: \"Remark\"\n});\nconst Gt = (t) => !!t.children, jt = (t) => t.type === \"html\";\nfunction zt(t, e) {\n  return r(t, 0, null)[0];\n  function r(a, o, s) {\n    if (Gt(a)) {\n      const l = [];\n      for (let i = 0, d = a.children.length; i < d; i++) {\n        const m = a.children[i];\n        if (m) {\n          const p = r(m, i, a);\n          if (p)\n            for (let k = 0, g = p.length; k < g; k++) {\n              const C = p[k];\n              C && l.push(C);\n            }\n        }\n      }\n      a.children = l;\n    }\n    return e(a, o, s);\n  }\n}\nconst Fe = D(\"remarkHTMLTransformer\", () => () => (t) => {\n  zt(t, (e, r, a) => jt(e) ? ((a == null ? void 0 : a.type) === \"root\" && (e.children = [{ ...e }], delete e.value, e.type = \"paragraph\"), [e]) : [e]);\n});\nn(Fe.plugin, {\n  displayName: \"Remark<remarkHtmlTransformer>\",\n  group: \"Remark\"\n});\nn(Fe.options, {\n  displayName: \"RemarkConfig<remarkHtmlTransformer>\",\n  group: \"Remark\"\n});\nconst Ve = D(\"remarkMarker\", () => () => (t, e) => {\n  const r = (a) => e.value.charAt(a.position.start.offset);\n  Y(t, (a) => [\"strong\", \"emphasis\"].includes(a.type), (a) => {\n    a.marker = r(a);\n  });\n});\nn(Ve.plugin, {\n  displayName: \"Remark<remarkMarker>\",\n  group: \"Remark\"\n});\nn(Ve.options, {\n  displayName: \"RemarkConfig<remarkMarker>\",\n  group: \"Remark\"\n});\nconst Ct = _(() => {\n  let t = !1;\n  const e = new E(\"MILKDOWN_INLINE_NODES_CURSOR\"), r = new P({\n    key: e,\n    state: {\n      init() {\n        return !1;\n      },\n      apply(a) {\n        if (!a.selection.empty)\n          return !1;\n        const o = a.selection.$from, s = o.nodeBefore, l = o.nodeAfter;\n        return !!(s && l && s.isInline && !s.isText && l.isInline && !l.isText);\n      }\n    },\n    props: {\n      handleDOMEvents: {\n        compositionend: (a, o) => t ? (t = !1, requestAnimationFrame(() => {\n          if (r.getState(a.state)) {\n            const l = a.state.selection.from;\n            o.preventDefault(), a.dispatch(a.state.tr.insertText(o.data || \"\", l));\n          }\n        }), !0) : !1,\n        compositionstart: (a) => (r.getState(a.state) && (t = !0), !1),\n        beforeinput: (a, o) => {\n          if (r.getState(a.state) && o instanceof InputEvent && o.data && !t) {\n            const l = a.state.selection.from;\n            return o.preventDefault(), a.dispatch(a.state.tr.insertText(o.data || \"\", l)), !0;\n          }\n          return !1;\n        }\n      },\n      decorations(a) {\n        if (r.getState(a)) {\n          const l = a.selection.$from.pos, i = document.createElement(\"span\"), d = ze.widget(l, i, {\n            side: -1\n          }), m = document.createElement(\"span\"), p = ze.widget(l, m);\n          return setTimeout(() => {\n            i.contentEditable = \"true\", m.contentEditable = \"true\";\n          }), Je.create(a.doc, [d, p]);\n        }\n        return Je.empty;\n      }\n    }\n  });\n  return r;\n});\nn(Ct, {\n  displayName: \"Prose<inlineNodesCursorPlugin>\",\n  group: \"Prose\"\n});\nconst Mt = _((t) => new P({\n  key: new E(\"MILKDOWN_HARDBREAK_MARKS\"),\n  appendTransaction: (e, r, a) => {\n    if (!e.length)\n      return;\n    const [o] = e;\n    if (!o)\n      return;\n    const [s] = o.steps;\n    if (o.getMeta(\"hardbreak\")) {\n      if (!(s instanceof Ot))\n        return;\n      const { from: d } = s;\n      return a.tr.setNodeMarkup(d, S.type(t), void 0, []);\n    }\n    if (s instanceof Tt) {\n      let d = a.tr;\n      const { from: m, to: p } = s;\n      return a.doc.nodesBetween(m, p, (k, g) => {\n        k.type === S.type(t) && (d = d.setNodeMarkup(g, S.type(t), void 0, []));\n      }), d;\n    }\n  }\n}));\nn(Mt, {\n  displayName: \"Prose<hardbreakClearMarkPlugin>\",\n  group: \"Prose\"\n});\nconst Ue = Xe([\"table\", \"code_block\"], \"hardbreakFilterNodes\");\nn(Ue, {\n  displayName: \"Ctx<hardbreakFilterNodes>\",\n  group: \"Prose\"\n});\nconst bt = _((t) => {\n  const e = t.get(Ue.key);\n  return new P({\n    key: new E(\"MILKDOWN_HARDBREAK_FILTER\"),\n    filterTransaction: (r, a) => {\n      const o = r.getMeta(\"hardbreak\"), [s] = r.steps;\n      if (o && s) {\n        const { from: l } = s, i = a.doc.resolve(l);\n        let d = i.depth, m = !0;\n        for (; d > 0; )\n          e.includes(i.node(d).type.name) && (m = !1), d--;\n        return m;\n      }\n      return !0;\n    }\n  });\n});\nn(bt, {\n  displayName: \"Prose<hardbreakFilterPlugin>\",\n  group: \"Prose\"\n});\nconst Lt = _((t) => {\n  const e = new E(\"MILKDOWN_HEADING_ID\"), r = (a) => {\n    if (a.composing || !a.editable)\n      return;\n    const o = t.get(j.key), s = a.state.tr.setMeta(\"addToHistory\", !1);\n    let l = !1;\n    a.state.doc.descendants((i, d) => {\n      if (i.type === H.type(t)) {\n        if (i.textContent.trim().length === 0)\n          return;\n        const m = i.attrs, p = o(i);\n        m.id !== p && (l = !0, s.setMeta(e, !0).setNodeMarkup(d, void 0, {\n          ...m,\n          id: p\n        }));\n      }\n    }), l && a.dispatch(s);\n  };\n  return new P({\n    key: e,\n    view: (a) => (r(a), {\n      update: (o) => {\n        r(o);\n      }\n    })\n  });\n});\nn(Lt, {\n  displayName: \"Prose<syncHeadingIdPlugin>\",\n  group: \"Prose\"\n});\nconst xt = _((t) => {\n  const e = (r) => {\n    if (r.composing || !r.editable)\n      return;\n    const a = T.type(t), o = O.type(t), s = M.type(t), l = r.state, i = (p, k) => {\n      let g = !1;\n      const C = `${k + 1}.`;\n      return p.label !== C && (p.label = C, g = !0), g;\n    };\n    let d = l.tr, m = !1;\n    l.doc.descendants((p, k, g, C) => {\n      if (p.type === o) {\n        const y = p.maybeChild(0);\n        (y == null ? void 0 : y.type) === s && y.attrs.listType === \"ordered\" && (m = !0, d.setNodeMarkup(k, a, { spread: \"true\" }), p.descendants((b, Ge, Qt, St) => {\n          if (b.type === s) {\n            const je = { ...b.attrs };\n            i(je, St) && (d = d.setNodeMarkup(Ge, void 0, je));\n          }\n          return !1;\n        }));\n      } else if (p.type === s && (g == null ? void 0 : g.type) === a) {\n        const y = { ...p.attrs };\n        let b = !1;\n        y.listType !== \"ordered\" && (y.listType = \"ordered\", b = !0), (g == null ? void 0 : g.maybeChild(0)) && (b = i(y, C)), b && (d = d.setNodeMarkup(k, void 0, y), m = !0);\n      }\n    }), m && r.dispatch(d.setMeta(\"addToHistory\", !1));\n  };\n  return new P({\n    key: new E(\"MILKDOWN_KEEP_LIST_ORDER\"),\n    view: (r) => (e(r), {\n      update: (a) => {\n        e(a);\n      }\n    })\n  });\n});\nn(xt, {\n  displayName: \"Prose<syncListOrderPlugin>\",\n  group: \"Prose\"\n});\nconst Jt = [\n  Mt,\n  Ue,\n  bt,\n  Ct,\n  $e,\n  We,\n  qe,\n  Fe,\n  Ve,\n  Lt,\n  xt\n].flat(), cr = [qt, Wt, Ft, Vt, Ut, Jt].flat();\nexport {\n  ye as blockquoteAttr,\n  he as blockquoteKeymap,\n  q as blockquoteSchema,\n  Se as bulletListAttr,\n  Ae as bulletListKeymap,\n  O as bulletListSchema,\n  fe as codeBlockAttr,\n  Ie as codeBlockKeymap,\n  W as codeBlockSchema,\n  Vt as commands,\n  cr as commonmark,\n  Ne as createCodeBlockCommand,\n  ut as createCodeBlockInputRule,\n  mt as docSchema,\n  ue as downgradeHeadingCommand,\n  Z as emphasisAttr,\n  te as emphasisKeymap,\n  R as emphasisSchema,\n  nt as emphasisStarInputRule,\n  ot as emphasisUnderscoreInputRule,\n  Me as hardbreakAttr,\n  Mt as hardbreakClearMarkPlugin,\n  Ue as hardbreakFilterNodes,\n  bt as hardbreakFilterPlugin,\n  Le as hardbreakKeymap,\n  S as hardbreakSchema,\n  ce as headingAttr,\n  j as headingIdGenerator,\n  ge as headingKeymap,\n  H as headingSchema,\n  xe as hrAttr,\n  F as hrSchema,\n  Ee as htmlAttr,\n  Pe as htmlSchema,\n  Ce as imageAttr,\n  v as imageSchema,\n  oe as inlineCodeAttr,\n  lt as inlineCodeInputRule,\n  le as inlineCodeKeymap,\n  x as inlineCodeSchema,\n  Ct as inlineNodesCursorPlugin,\n  Wt as inputRules,\n  be as insertHardbreakCommand,\n  ht as insertHrCommand,\n  kt as insertHrInputRule,\n  gt as insertImageCommand,\n  Pt as insertImageInputRule,\n  Ut as keymap,\n  De as liftFirstListItemCommand,\n  Te as liftListItemCommand,\n  ie as linkAttr,\n  B as linkSchema,\n  ve as listItemAttr,\n  _e as listItemKeymap,\n  M as listItemSchema,\n  Ft as markInputRules,\n  He as orderedListAttr,\n  Re as orderedListKeymap,\n  T as orderedListSchema,\n  de as paragraphAttr,\n  pe as paragraphKeymap,\n  A as paragraphSchema,\n  Jt as plugins,\n  $e as remarkAddOrderInListPlugin,\n  Fe as remarkHtmlTransformer,\n  We as remarkInlineLinkPlugin,\n  qe as remarkLineBreak,\n  Ve as remarkMarker,\n  qt as schema,\n  Oe as sinkListItemCommand,\n  Ke as splitListItemCommand,\n  re as strongAttr,\n  st as strongInputRule,\n  ne as strongKeymap,\n  $ as strongSchema,\n  Lt as syncHeadingIdPlugin,\n  xt as syncListOrderPlugin,\n  It as textSchema,\n  ee as toggleEmphasisCommand,\n  se as toggleInlineCodeCommand,\n  it as toggleLinkCommand,\n  ae as toggleStrongCommand,\n  me as turnIntoTextCommand,\n  Et as updateCodeBlockLanguageCommand,\n  yt as updateImageCommand,\n  dt as updateLinkCommand,\n  ke as wrapInBlockquoteCommand,\n  ct as wrapInBlockquoteInputRule,\n  we as wrapInBulletListCommand,\n  ft as wrapInBulletListInputRule,\n  L as wrapInHeadingCommand,\n  pt as wrapInHeadingInputRule,\n  Be as wrapInOrderedListCommand,\n  Nt as wrapInOrderedListInputRule\n};\n//# sourceMappingURL=index.es.js.map\n","import { PluginKey, Plugin, NodeSelection } from 'prosemirror-state';\nimport { InputRule } from 'prosemirror-inputrules';\nimport { expectDomTypeError, missingRootElement, getAtomFromSchemaFail } from '@milkdown/exception';\n\nconst nav = typeof navigator != \"undefined\" ? navigator : null;\nconst doc = typeof document != \"undefined\" ? document : null;\nconst agent = nav && nav.userAgent || \"\";\nconst ie_edge = /Edge\\/(\\d+)/.exec(agent);\nconst ie_upto10 = /MSIE \\d/.exec(agent);\nconst ie_11up = /Trident\\/(?:[7-9]|\\d{2,})\\..*rv:(\\d+)/.exec(agent);\nconst ie = !!(ie_upto10 || ie_11up || ie_edge);\nconst ie_version = ie_upto10 ? document.documentMode : ie_11up ? +ie_11up[1] : ie_edge ? +ie_edge[1] : 0;\nconst gecko = !ie && /gecko\\/(\\d+)/i.test(agent);\nconst gecko_version = gecko && +(/Firefox\\/(\\d+)/.exec(agent) || [0, 0])[1];\nconst _chrome = !ie && /Chrome\\/(\\d+)/.exec(agent);\nconst chrome = !!_chrome;\nconst chrome_version = _chrome ? +_chrome[1] : 0;\nconst safari = !ie && !!nav && /Apple Computer/.test(nav.vendor);\nconst ios = safari && (/Mobile\\/\\w+/.test(agent) || !!nav && nav.maxTouchPoints > 2);\nconst mac = ios || (nav ? /Mac/.test(nav.platform) : false);\nconst android = /Android \\d/.test(agent);\nconst webkit = !!doc && \"webkitFontSmoothing\" in doc.documentElement.style;\nconst webkit_version = webkit ? +(/\\bAppleWebKit\\/(\\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;\n\nvar browser = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  android: android,\n  chrome: chrome,\n  chrome_version: chrome_version,\n  gecko: gecko,\n  gecko_version: gecko_version,\n  ie: ie,\n  ie_version: ie_version,\n  ios: ios,\n  mac: mac,\n  safari: safari,\n  webkit: webkit,\n  webkit_version: webkit_version\n});\n\nfunction run(view, from, to, text, rules, plugin) {\n  if (view.composing)\n    return false;\n  const state = view.state;\n  const $from = state.doc.resolve(from);\n  if ($from.parent.type.spec.code)\n    return false;\n  const textBefore = $from.parent.textBetween(Math.max(0, $from.parentOffset - 500), $from.parentOffset, void 0, \"\\uFFFC\") + text;\n  for (let i = 0; i < rules.length; i++) {\n    const match = rules[i].match.exec(textBefore);\n    const tr = match && match[0] && rules[i].handler(state, match, from - (match[0].length - text.length), to);\n    if (!tr)\n      continue;\n    view.dispatch(tr.setMeta(plugin, { transform: tr, from, to, text }));\n    return true;\n  }\n  return false;\n}\nconst customInputRulesKey = new PluginKey(\"MILKDOWN_CUSTOM_INPUTRULES\");\nfunction customInputRules({ rules }) {\n  const plugin = new Plugin({\n    key: customInputRulesKey,\n    isInputRules: true,\n    state: {\n      init() {\n        return null;\n      },\n      apply(tr, prev) {\n        const stored = tr.getMeta(this);\n        if (stored)\n          return stored;\n        return tr.selectionSet || tr.docChanged ? null : prev;\n      }\n    },\n    props: {\n      handleTextInput(view, from, to, text) {\n        return run(view, from, to, text, rules, plugin);\n      },\n      handleDOMEvents: {\n        compositionend: (view) => {\n          setTimeout(() => {\n            const { $cursor } = view.state.selection;\n            if ($cursor)\n              run(view, $cursor.pos, $cursor.pos, \"\", rules, plugin);\n          });\n          return false;\n        }\n      },\n      handleKeyDown(view, event) {\n        if (event.key !== \"Enter\")\n          return false;\n        const { $cursor } = view.state.selection;\n        if ($cursor)\n          return run(view, $cursor.pos, $cursor.pos, \"\\n\", rules, plugin);\n        return false;\n      }\n    }\n  });\n  return plugin;\n}\n\nfunction markRule(regexp, markType, options = {}) {\n  return new InputRule(regexp, (state, match, start, end) => {\n    var _a, _b, _c, _d;\n    const { tr } = state;\n    const matchLength = match.length;\n    let group = match[matchLength - 1];\n    let fullMatch = match[0];\n    let initialStoredMarks = [];\n    let markEnd = end;\n    const captured = {\n      group,\n      fullMatch,\n      start,\n      end\n    };\n    const result = (_a = options.updateCaptured) == null ? void 0 : _a.call(options, captured);\n    Object.assign(captured, result);\n    ({ group, fullMatch, start, end } = captured);\n    if (fullMatch === null)\n      return null;\n    if ((group == null ? void 0 : group.trim()) === \"\")\n      return null;\n    if (group) {\n      const startSpaces = fullMatch.search(/\\S/);\n      const textStart = start + fullMatch.indexOf(group);\n      const textEnd = textStart + group.length;\n      initialStoredMarks = (_b = tr.storedMarks) != null ? _b : [];\n      if (textEnd < end)\n        tr.delete(textEnd, end);\n      if (textStart > start)\n        tr.delete(start + startSpaces, textStart);\n      markEnd = start + startSpaces + group.length;\n      const attrs = (_c = options.getAttr) == null ? void 0 : _c.call(options, match);\n      tr.addMark(start, markEnd, markType.create(attrs));\n      tr.setStoredMarks(initialStoredMarks);\n      (_d = options.beforeDispatch) == null ? void 0 : _d.call(options, { match, start, end, tr });\n    }\n    return tr;\n  });\n}\n\nfunction nodeRule(regexp, nodeType, options = {}) {\n  return new InputRule(regexp, (state, match, start, end) => {\n    var _a, _b, _c;\n    const { tr } = state;\n    let group = match[1];\n    let fullMatch = match[0];\n    const captured = {\n      group,\n      fullMatch,\n      start,\n      end\n    };\n    const result = (_a = options.updateCaptured) == null ? void 0 : _a.call(options, captured);\n    Object.assign(captured, result);\n    ({ group, fullMatch, start, end } = captured);\n    if (fullMatch === null)\n      return null;\n    if (!group || group.trim() === \"\")\n      return null;\n    const attrs = (_b = options.getAttr) == null ? void 0 : _b.call(options, match);\n    const node = nodeType.createAndFill(attrs);\n    if (node) {\n      tr.replaceRangeWith(nodeType.isBlock ? tr.doc.resolve(start).before() : start, end, node);\n      (_c = options.beforeDispatch) == null ? void 0 : _c.call(options, { match: [fullMatch, group != null ? group : \"\"], start, end, tr });\n    }\n    return tr;\n  });\n}\n\nvar __defProp = Object.defineProperty;\nvar __defProps = Object.defineProperties;\nvar __getOwnPropDescs = Object.getOwnPropertyDescriptors;\nvar __getOwnPropSymbols = Object.getOwnPropertySymbols;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __propIsEnum = Object.prototype.propertyIsEnumerable;\nvar __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;\nvar __spreadValues = (a, b) => {\n  for (var prop in b || (b = {}))\n    if (__hasOwnProp.call(b, prop))\n      __defNormalProp(a, prop, b[prop]);\n  if (__getOwnPropSymbols)\n    for (var prop of __getOwnPropSymbols(b)) {\n      if (__propIsEnum.call(b, prop))\n        __defNormalProp(a, prop, b[prop]);\n    }\n  return a;\n};\nvar __spreadProps = (a, b) => __defProps(a, __getOwnPropDescs(b));\nfunction calculateNodePosition(view, target, handler) {\n  const state = view.state;\n  const { from } = state.selection;\n  const { node } = view.domAtPos(from);\n  const element = node instanceof Text ? node.parentElement : node;\n  if (!(element instanceof HTMLElement))\n    throw expectDomTypeError(element);\n  const selectedNodeRect = element.getBoundingClientRect();\n  const targetNodeRect = target.getBoundingClientRect();\n  const parent = target.parentElement;\n  if (!parent)\n    throw expectDomTypeError(parent);\n  const parentNodeRect = parent.getBoundingClientRect();\n  const [top, left] = handler(selectedNodeRect, targetNodeRect, parentNodeRect);\n  target.style.top = `${top}px`;\n  target.style.left = `${left}px`;\n}\nfunction calculateTextPosition(view, target, handler) {\n  const state = view.state;\n  const { from, to } = state.selection;\n  const start = view.coordsAtPos(from);\n  const end = view.coordsAtPos(to);\n  const targetNodeRect = target.getBoundingClientRect();\n  const parent = target.parentElement;\n  if (!parent)\n    throw missingRootElement();\n  const parentNodeRect = parent.getBoundingClientRect();\n  const [top, left] = handler(start, end, targetNodeRect, parentNodeRect);\n  target.style.top = `${top}px`;\n  target.style.left = `${left}px`;\n}\nfunction minMax(value = 0, min = 0, max = 0) {\n  return Math.min(Math.max(value, min), max);\n}\nfunction posToDOMRect(view, from, to) {\n  const minPos = 0;\n  const maxPos = view.state.doc.content.size;\n  const resolvedFrom = minMax(from, minPos, maxPos);\n  const resolvedEnd = minMax(to, minPos, maxPos);\n  const start = view.coordsAtPos(resolvedFrom);\n  const end = view.coordsAtPos(resolvedEnd, -1);\n  const top = Math.min(start.top, end.top);\n  const bottom = Math.max(start.bottom, end.bottom);\n  const left = Math.min(start.left, end.left);\n  const right = Math.max(start.right, end.right);\n  const width = right - left;\n  const height = bottom - top;\n  const x = left;\n  const y = top;\n  const data = {\n    top,\n    bottom,\n    left,\n    right,\n    width,\n    height,\n    x,\n    y\n  };\n  return __spreadProps(__spreadValues({}, data), {\n    toJSON: () => data\n  });\n}\n\nfunction cloneTr(tr) {\n  return Object.assign(Object.create(tr), tr).setTime(Date.now());\n}\nfunction equalNodeType(nodeType, node) {\n  return Array.isArray(nodeType) && nodeType.includes(node.type) || node.type === nodeType;\n}\n\nfunction flatten(node, descend = true) {\n  const result = [];\n  node.descendants((child, pos) => {\n    result.push({ node: child, pos });\n    if (!descend)\n      return false;\n    return void 0;\n  });\n  return result;\n}\nfunction findChildren(predicate) {\n  return (node, descend) => flatten(node, descend).filter((child) => predicate(child.node));\n}\nfunction findChildrenByMark(node, markType, descend) {\n  return findChildren((child) => Boolean(markType.isInSet(child.marks)))(node, descend);\n}\n\nfunction getNodeFromSchema(type, schema) {\n  const target = schema.nodes[type];\n  if (!target)\n    throw getAtomFromSchemaFail(\"node\", type);\n  return target;\n}\nfunction getMarkFromSchema(type, schema) {\n  const target = schema.marks[type];\n  if (!target)\n    throw getAtomFromSchemaFail(\"mark\", type);\n  return target;\n}\n\nfunction findParentNodeClosestToPos(predicate) {\n  return ($pos) => {\n    for (let i = $pos.depth; i > 0; i--) {\n      const node = $pos.node(i);\n      if (predicate(node)) {\n        return {\n          pos: i > 0 ? $pos.before(i) : 0,\n          start: $pos.start(i),\n          depth: i,\n          node\n        };\n      }\n    }\n    return void 0;\n  };\n}\nfunction findParentNode(predicate) {\n  return (selection) => {\n    return findParentNodeClosestToPos(predicate)(selection.$from);\n  };\n}\nfunction findSelectedNodeOfType(selection, nodeType) {\n  if (!(selection instanceof NodeSelection))\n    return;\n  const { node, $from } = selection;\n  if (equalNodeType(nodeType, node))\n    return { node, pos: $from.pos, start: $from.start($from.depth), depth: $from.depth };\n  return void 0;\n}\n\nexport { browser, calculateNodePosition, calculateTextPosition, cloneTr, customInputRules, customInputRulesKey, equalNodeType, findChildren, findChildrenByMark, findParentNode, findParentNodeClosestToPos, findSelectedNodeOfType, flatten, getMarkFromSchema, getNodeFromSchema, markRule, nodeRule, posToDOMRect };\n//# sourceMappingURL=index.js.map\n","import l, { createContext as g, useContext as a, useRef as u, useEffect as E, useState as f, useMemo as y, useCallback as m, useLayoutEffect as v } from \"react\";\nconst s = g({});\nfunction I() {\n  const { dom: t, editor: o, setLoading: e, editorFactory: r } = a(s), i = u(null);\n  return E(() => {\n    const n = i.current;\n    if (!r || !n)\n      return;\n    t.current = n;\n    const d = r(n);\n    if (d)\n      return e(!0), d.create().then((c) => {\n        o.current = c;\n      }).finally(() => {\n        e(!1);\n      }).catch(console.error), () => {\n        var c;\n        (c = o.current) == null || c.destroy();\n      };\n  }, [t, o, r, e]), i;\n}\nconst C = () => {\n  const t = I();\n  return /* @__PURE__ */ l.createElement(\"div\", { \"data-milkdown-root\": !0, ref: t });\n}, R = ({ children: t }) => {\n  const o = u(void 0), [e, r] = f(void 0), i = u(), [n, d] = f(!0), c = y(() => ({\n    loading: n,\n    dom: o,\n    editor: i,\n    setLoading: d,\n    editorFactory: e,\n    setEditorFactory: r\n  }), [n, e]);\n  return /* @__PURE__ */ l.createElement(s.Provider, { value: c }, t);\n};\nfunction k(t, o = []) {\n  const e = a(s), r = m(t, o);\n  return v(() => {\n    e.setEditorFactory(() => r);\n  }, [e, r]), {\n    loading: e.loading,\n    get: () => e.editor.current\n  };\n}\nfunction F() {\n  const t = a(s), o = m(() => t.editor.current, [t.editor]);\n  return [t.loading, o];\n}\nexport {\n  C as Milkdown,\n  R as MilkdownProvider,\n  k as useEditor,\n  F as useInstance\n};\n//# sourceMappingURL=index.es.js.map\n","import { urlAlphabet } from './url-alphabet/index.js'\nexport { urlAlphabet } from './url-alphabet/index.js'\nexport let random = bytes => crypto.getRandomValues(new Uint8Array(bytes))\nexport let customRandom = (alphabet, defaultSize, getRandom) => {\n  let mask = (2 << (Math.log(alphabet.length - 1) / Math.LN2)) - 1\n  let step = -~((1.6 * mask * defaultSize) / alphabet.length)\n  return (size = defaultSize) => {\n    let id = ''\n    while (true) {\n      let bytes = getRandom(step)\n      let j = step\n      while (j--) {\n        id += alphabet[bytes[j] & mask] || ''\n        if (id.length === size) return id\n      }\n    }\n  }\n}\nexport let customAlphabet = (alphabet, size = 21) =>\n  customRandom(alphabet, size, random)\nexport let nanoid = (size = 21) => {\n  let id = ''\n  let bytes = crypto.getRandomValues(new Uint8Array(size))\n  while (size--) {\n    id += urlAlphabet[bytes[size] & 63]\n  }\n  return id\n}\n","import { createCmdKey as O, commandsTimerCtx as I, CommandsReady as R, commandsCtx as d, editorStateTimerCtx as A, SchemaReady as l, inputRulesCtx as C, schemaCtx as g, schemaTimerCtx as E, marksCtx as w, nodesCtx as k, prosePluginsCtx as p, editorViewTimerCtx as D, nodeViewCtx as v, markViewCtx as $, InitReady as N, remarkPluginsCtx as b, editorViewCtx as f, serializerCtx as H, parserCtx as M, editorStateOptionsCtx as L } from \"@milkdown/core\";\nimport { createTimer as F, createSlice as U } from \"@milkdown/ctx\";\nimport { customAlphabet as q } from \"nanoid\";\nimport { missingMarkInSchema as P, missingNodeInSchema as j } from \"@milkdown/exception\";\nimport { keymap as z } from \"@milkdown/prose/keymap\";\nimport { NodeType as T, DOMSerializer as B, Slice as K } from \"@milkdown/prose/model\";\nimport { EditorState as G } from \"@milkdown/prose/state\";\nconst J = q(\"abcedfghicklmn\", 10);\nfunction y(n, o, r) {\n  const t = F(r || J());\n  let e = !1;\n  const a = (s) => (s.record(t), s.update(o, (i) => i.concat(t)), async () => {\n    const u = await n(s, a, () => {\n      s.done(t), e = !0;\n    });\n    return e || s.done(t), () => {\n      s.update(o, (c) => c.filter((m) => m !== t)), s.clearTimer(t), u == null || u();\n    };\n  });\n  return a.timer = t, a;\n}\nfunction re(n, o) {\n  const r = O(n), t = (e) => async () => {\n    t.key = r, await e.wait(R);\n    const a = o(e);\n    return e.get(d).create(r, a), t.run = (s) => e.get(d).call(n, s), () => {\n      e.get(d).remove(r);\n    };\n  };\n  return t;\n}\nfunction ae(n, o, r) {\n  const t = O(n);\n  return y(\n    async (e, a) => {\n      await e.wait(R);\n      const s = await o(e);\n      return e.get(d).create(t, s), a.run = (i) => e.get(d).call(n, i), a.key = t, () => {\n        e.get(d).remove(t);\n      };\n    },\n    I,\n    r\n  );\n}\nfunction oe(n) {\n  const o = (r) => async () => {\n    await r.wait(l);\n    const t = n(r);\n    return r.update(C, (e) => [...e, t]), o.inputRule = t, () => {\n      r.update(C, (e) => e.filter((a) => a !== t));\n    };\n  };\n  return o;\n}\nfunction se(n, o) {\n  return y(\n    async (r, t) => {\n      await r.wait(l);\n      const e = await n(r);\n      return r.update(C, (a) => [...a, e]), t.inputRule = e, () => {\n        r.update(C, (a) => a.filter((s) => s !== e));\n      };\n    },\n    A,\n    o\n  );\n}\nfunction Q(n, o) {\n  const r = (t) => async () => {\n    const e = o(t);\n    return t.update(w, (a) => [...a.filter((s) => s[0] !== n), [n, e]]), r.id = n, r.schema = e, () => {\n      t.update(w, (a) => a.filter(([s]) => s !== n));\n    };\n  };\n  return r.type = (t) => {\n    const e = t.get(g).marks[n];\n    if (!e)\n      throw P(n);\n    return e;\n  }, r;\n}\nfunction ie(n, o, r) {\n  const t = y(\n    async (e, a, s) => {\n      const i = await o(e);\n      return e.update(w, (u) => [...u.filter((c) => c[0] !== n), [n, i]]), a.id = n, a.schema = i, s(), () => {\n        e.update(w, (u) => u.filter(([c]) => c !== n));\n      };\n    },\n    E,\n    r\n  );\n  return t.type = (e) => {\n    const a = e.get(g).marks[n];\n    if (!a)\n      throw P(n);\n    return a;\n  }, t;\n}\nfunction W(n, o) {\n  const r = (t) => async () => {\n    const e = o(t);\n    return t.update(k, (a) => [...a.filter((s) => s[0] !== n), [n, e]]), r.id = n, r.schema = e, () => {\n      t.update(k, (a) => a.filter(([s]) => s !== n));\n    };\n  };\n  return r.type = (t) => {\n    const e = t.get(g).nodes[n];\n    if (!e)\n      throw j(n);\n    return e;\n  }, r;\n}\nfunction ce(n, o, r) {\n  const t = y(\n    async (e, a, s) => {\n      const i = await o(e);\n      return e.update(k, (u) => [...u.filter((c) => c[0] !== n), [n, i]]), a.id = n, a.schema = i, s(), () => {\n        e.update(k, (u) => u.filter(([c]) => c !== n));\n      };\n    },\n    E,\n    r\n  );\n  return t.type = (e) => {\n    const a = e.get(g).nodes[n];\n    if (!a)\n      throw j(n);\n    return a;\n  }, t;\n}\nfunction ue(n) {\n  let o;\n  const r = (t) => async () => (await t.wait(l), o = n(t), t.update(p, (e) => [...e, o]), () => {\n    t.update(p, (e) => e.filter((a) => a !== o));\n  });\n  return r.plugin = () => o, r.key = () => o.spec.key, r;\n}\nfunction me(n, o) {\n  let r;\n  const t = y(\n    async (e) => (await e.wait(l), r = await n(e), e.update(p, (a) => [...a, r]), () => {\n      e.update(p, (a) => a.filter((s) => s !== r));\n    }),\n    A,\n    o\n  );\n  return t.plugin = () => r, t.key = () => r.spec.key, t;\n}\nfunction X(n) {\n  const o = (r) => async () => {\n    await r.wait(l);\n    const t = n(r), e = z(t);\n    return r.update(p, (a) => [...a, e]), o.keymap = t, () => {\n      r.update(p, (a) => a.filter((s) => s !== e));\n    };\n  };\n  return o;\n}\nfunction pe(n, o) {\n  return y(\n    async (r, t) => {\n      await r.wait(l);\n      const e = await n(r), a = z(e);\n      return r.update(p, (s) => [...s, a]), t.keymap = e, () => {\n        r.update(p, (s) => s.filter((i) => i !== a));\n      };\n    },\n    A,\n    o\n  );\n}\nfunction le(n, o) {\n  const r = (t) => async () => {\n    await t.wait(l);\n    const e = o(t);\n    return n.type(t) instanceof T ? t.update(v, (a) => [...a, [n.id, e]]) : t.update($, (a) => [...a, [n.id, e]]), r.view = e, r.type = n, () => {\n      n.type(t) instanceof T ? t.update(v, (a) => a.filter((s) => s[0] !== n.id)) : t.update($, (a) => a.filter((s) => s[0] !== n.id));\n    };\n  };\n  return r;\n}\nfunction de(n, o, r) {\n  return y(\n    async (t, e) => {\n      await t.wait(l);\n      const a = await o(t);\n      return n.type(t) instanceof T ? t.update(v, (s) => [...s, [n.id, a]]) : t.update($, (s) => [...s, [n.id, a]]), e.view = a, e.type = n, () => {\n        n.type(t) instanceof T ? t.update(v, (s) => s.filter((i) => i[0] !== n.id)) : t.update($, (s) => s.filter((i) => i[0] !== n.id));\n      };\n    },\n    D,\n    r\n  );\n}\nfunction h(n, o) {\n  const r = U(n, o), t = (e) => (e.inject(r), () => () => {\n    e.remove(r);\n  });\n  return t.key = r, t;\n}\nfunction fe(n, o) {\n  const r = h(o, n), t = W(n, (a) => a.get(r.key)(a)), e = [r, t];\n  return e.id = t.id, e.node = t, e.type = (a) => t.type(a), e.schema = t.schema, e.ctx = r, e.key = r.key, e.extendSchema = (a) => (s) => () => {\n    const i = s.get(r.key), c = a(i)(s);\n    s.update(k, (m) => [...m.filter((S) => S[0] !== n), [n, c]]), e.schema = c;\n  }, e;\n}\nfunction ye(n, o) {\n  const r = h(o, n), t = Q(n, (a) => a.get(r.key)(a)), e = [r, t];\n  return e.id = t.id, e.mark = t, e.type = t.type, e.schema = t.schema, e.ctx = r, e.key = r.key, e.extendSchema = (a) => (s) => () => {\n    const i = s.get(r.key), c = a(i)(s);\n    s.update(w, (m) => [...m.filter((S) => S[0] !== n), [n, c]]), e.schema = c;\n  }, e;\n}\nfunction ge(n, o) {\n  const r = Object.fromEntries(Object.entries(o).map(([s, { shortcuts: i }]) => [s, i])), t = h(r, `${n}Keymap`), e = X((s) => {\n    const i = s.get(t.key), u = Object.entries(o).flatMap(([c, { command: m }]) => [i[c]].flat().map((V) => [V, m(s)]));\n    return Object.fromEntries(u);\n  }), a = [t, e];\n  return a.ctx = t, a.shortcuts = e, a.key = t.key, a.keymap = e.keymap, a;\n}\nconst he = (n, o = () => ({})) => h(o, `${n}Attr`), we = (n, o = () => ({})) => h(o, `${n}Attr`);\nfunction ke(n, o, r) {\n  const t = h(r ?? {}, n), e = (s) => async () => {\n    await s.wait(N);\n    const u = {\n      plugin: o(s),\n      options: s.get(t.key)\n    };\n    return s.update(b, (c) => [...c, u]), () => {\n      s.update(b, (c) => c.filter((m) => m !== u));\n    };\n  }, a = [t, e];\n  return a.id = n, a.plugin = e, a.options = t, a;\n}\nfunction Se(n, o) {\n  return (r) => r.get(d).call(n, o);\n}\nfunction Ce() {\n  return (n) => {\n    const o = n.get(f), { tr: r } = o.state, t = Object.assign(Object.create(r), r).setTime(Date.now());\n    return o.dispatch(t);\n  };\n}\nfunction ve() {\n  return (n) => {\n    const o = document.createElement(\"div\"), r = n.get(g), t = n.get(f), e = B.fromSchema(r).serializeFragment(t.state.doc.content);\n    return o.appendChild(e), o.innerHTML;\n  };\n}\nfunction $e() {\n  return (n) => {\n    const o = n.get(f);\n    return n.get(H)(o.state.doc);\n  };\n}\nfunction Te(n) {\n  return (o) => {\n    const r = o.get(f), e = o.get(M)(n);\n    if (!e)\n      return;\n    const a = r.state.selection.content();\n    return r.dispatch(\n      r.state.tr.replaceSelection(new K(e.content, a.openStart, a.openEnd)).scrollIntoView()\n    );\n  };\n}\nfunction Ae() {\n  return (n) => {\n    const o = n.get(f), r = [];\n    return o.state.doc.descendants((e) => {\n      e.type.name === \"heading\" && e.attrs.level && r.push({ text: e.textContent, level: e.attrs.level, id: e.attrs.id });\n    }), r;\n  };\n}\nfunction be(n, o = !1) {\n  return (r) => {\n    const t = r.get(f), a = r.get(M)(n);\n    if (!a)\n      return;\n    if (!o) {\n      const { state: m } = t;\n      return t.dispatch(m.tr.replace(0, m.doc.content.size, new K(a.content, 0, 0)));\n    }\n    const s = r.get(g), i = r.get(L), u = r.get(p), c = G.create({\n      schema: s,\n      doc: a,\n      plugins: u,\n      ...i\n    });\n    t.updateState(c);\n  };\n}\nfunction Oe(n, o) {\n  return (r) => {\n    const t = r.get(f), { tr: e } = t.state, a = e.doc.nodeAt(n);\n    if (!a)\n      return;\n    const s = o(a.attrs);\n    return t.dispatch(e.setNodeMarkup(n, void 0, s));\n  };\n}\nconst Re = (...n) => {\n  const o = n.length;\n  let r = o;\n  for (; r--; )\n    if (typeof n[r] != \"function\")\n      throw new TypeError(\"Expected a function\");\n  return (...t) => {\n    let e = 0, a = o ? n[e](...t) : t[0];\n    for (; ++e < o; )\n      a = n[e](a);\n    return a;\n  };\n};\nexport {\n  re as $command,\n  ae as $commandAsync,\n  h as $ctx,\n  oe as $inputRule,\n  se as $inputRuleAsync,\n  Q as $mark,\n  ie as $markAsync,\n  we as $markAttr,\n  ye as $markSchema,\n  W as $node,\n  ce as $nodeAsync,\n  he as $nodeAttr,\n  fe as $nodeSchema,\n  ue as $prose,\n  me as $proseAsync,\n  ke as $remark,\n  X as $shortcut,\n  pe as $shortcutAsync,\n  ge as $useKeymap,\n  le as $view,\n  de as $viewAsync,\n  y as addTimer,\n  Se as callCommand,\n  Ce as forceUpdate,\n  ve as getHTML,\n  $e as getMarkdown,\n  Te as insert,\n  J as nanoid,\n  Ae as outline,\n  Re as pipe,\n  be as replaceAll,\n  Oe as setAttr\n};\n//# sourceMappingURL=index.es.js.map\n","import { liftTarget, replaceStep, ReplaceStep, canJoin, joinPoint, canSplit, ReplaceAroundStep, findWrapping } from 'prosemirror-transform';\nimport { Slice, Fragment } from 'prosemirror-model';\nimport { NodeSelection, Selection, TextSelection, AllSelection } from 'prosemirror-state';\n\n/**\nDelete the selection, if there is one.\n*/\nconst deleteSelection = (state, dispatch) => {\n    if (state.selection.empty)\n        return false;\n    if (dispatch)\n        dispatch(state.tr.deleteSelection().scrollIntoView());\n    return true;\n};\nfunction atBlockStart(state, view) {\n    let { $cursor } = state.selection;\n    if (!$cursor || (view ? !view.endOfTextblock(\"backward\", state)\n        : $cursor.parentOffset > 0))\n        return null;\n    return $cursor;\n}\n/**\nIf the selection is empty and at the start of a textblock, try to\nreduce the distance between that block and the one before it—if\nthere's a block directly before it that can be joined, join them.\nIf not, try to move the selected block closer to the next one in\nthe document structure by lifting it out of its parent or moving it\ninto a parent of the previous block. Will use the view for accurate\n(bidi-aware) start-of-textblock detection if given.\n*/\nconst joinBackward = (state, dispatch, view) => {\n    let $cursor = atBlockStart(state, view);\n    if (!$cursor)\n        return false;\n    let $cut = findCutBefore($cursor);\n    // If there is no node before this, try to lift\n    if (!$cut) {\n        let range = $cursor.blockRange(), target = range && liftTarget(range);\n        if (target == null)\n            return false;\n        if (dispatch)\n            dispatch(state.tr.lift(range, target).scrollIntoView());\n        return true;\n    }\n    let before = $cut.nodeBefore;\n    // Apply the joining algorithm\n    if (!before.type.spec.isolating && deleteBarrier(state, $cut, dispatch))\n        return true;\n    // If the node below has no content and the node above is\n    // selectable, delete the node below and select the one above.\n    if ($cursor.parent.content.size == 0 &&\n        (textblockAt(before, \"end\") || NodeSelection.isSelectable(before))) {\n        let delStep = replaceStep(state.doc, $cursor.before(), $cursor.after(), Slice.empty);\n        if (delStep && delStep.slice.size < delStep.to - delStep.from) {\n            if (dispatch) {\n                let tr = state.tr.step(delStep);\n                tr.setSelection(textblockAt(before, \"end\") ? Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos, -1)), -1)\n                    : NodeSelection.create(tr.doc, $cut.pos - before.nodeSize));\n                dispatch(tr.scrollIntoView());\n            }\n            return true;\n        }\n    }\n    // If the node before is an atom, delete it\n    if (before.isAtom && $cut.depth == $cursor.depth - 1) {\n        if (dispatch)\n            dispatch(state.tr.delete($cut.pos - before.nodeSize, $cut.pos).scrollIntoView());\n        return true;\n    }\n    return false;\n};\n/**\nA more limited form of [`joinBackward`]($commands.joinBackward)\nthat only tries to join the current textblock to the one before\nit, if the cursor is at the start of a textblock.\n*/\nconst joinTextblockBackward = (state, dispatch, view) => {\n    let $cursor = atBlockStart(state, view);\n    if (!$cursor)\n        return false;\n    let $cut = findCutBefore($cursor);\n    return $cut ? joinTextblocksAround(state, $cut, dispatch) : false;\n};\n/**\nA more limited form of [`joinForward`]($commands.joinForward)\nthat only tries to join the current textblock to the one after\nit, if the cursor is at the end of a textblock.\n*/\nconst joinTextblockForward = (state, dispatch, view) => {\n    let $cursor = atBlockEnd(state, view);\n    if (!$cursor)\n        return false;\n    let $cut = findCutAfter($cursor);\n    return $cut ? joinTextblocksAround(state, $cut, dispatch) : false;\n};\nfunction joinTextblocksAround(state, $cut, dispatch) {\n    let before = $cut.nodeBefore, beforeText = before, beforePos = $cut.pos - 1;\n    for (; !beforeText.isTextblock; beforePos--) {\n        if (beforeText.type.spec.isolating)\n            return false;\n        let child = beforeText.lastChild;\n        if (!child)\n            return false;\n        beforeText = child;\n    }\n    let after = $cut.nodeAfter, afterText = after, afterPos = $cut.pos + 1;\n    for (; !afterText.isTextblock; afterPos++) {\n        if (afterText.type.spec.isolating)\n            return false;\n        let child = afterText.firstChild;\n        if (!child)\n            return false;\n        afterText = child;\n    }\n    let step = replaceStep(state.doc, beforePos, afterPos, Slice.empty);\n    if (!step || step.from != beforePos ||\n        step instanceof ReplaceStep && step.slice.size >= afterPos - beforePos)\n        return false;\n    if (dispatch) {\n        let tr = state.tr.step(step);\n        tr.setSelection(TextSelection.create(tr.doc, beforePos));\n        dispatch(tr.scrollIntoView());\n    }\n    return true;\n}\nfunction textblockAt(node, side, only = false) {\n    for (let scan = node; scan; scan = (side == \"start\" ? scan.firstChild : scan.lastChild)) {\n        if (scan.isTextblock)\n            return true;\n        if (only && scan.childCount != 1)\n            return false;\n    }\n    return false;\n}\n/**\nWhen the selection is empty and at the start of a textblock, select\nthe node before that textblock, if possible. This is intended to be\nbound to keys like backspace, after\n[`joinBackward`](https://prosemirror.net/docs/ref/#commands.joinBackward) or other deleting\ncommands, as a fall-back behavior when the schema doesn't allow\ndeletion at the selected point.\n*/\nconst selectNodeBackward = (state, dispatch, view) => {\n    let { $head, empty } = state.selection, $cut = $head;\n    if (!empty)\n        return false;\n    if ($head.parent.isTextblock) {\n        if (view ? !view.endOfTextblock(\"backward\", state) : $head.parentOffset > 0)\n            return false;\n        $cut = findCutBefore($head);\n    }\n    let node = $cut && $cut.nodeBefore;\n    if (!node || !NodeSelection.isSelectable(node))\n        return false;\n    if (dispatch)\n        dispatch(state.tr.setSelection(NodeSelection.create(state.doc, $cut.pos - node.nodeSize)).scrollIntoView());\n    return true;\n};\nfunction findCutBefore($pos) {\n    if (!$pos.parent.type.spec.isolating)\n        for (let i = $pos.depth - 1; i >= 0; i--) {\n            if ($pos.index(i) > 0)\n                return $pos.doc.resolve($pos.before(i + 1));\n            if ($pos.node(i).type.spec.isolating)\n                break;\n        }\n    return null;\n}\nfunction atBlockEnd(state, view) {\n    let { $cursor } = state.selection;\n    if (!$cursor || (view ? !view.endOfTextblock(\"forward\", state)\n        : $cursor.parentOffset < $cursor.parent.content.size))\n        return null;\n    return $cursor;\n}\n/**\nIf the selection is empty and the cursor is at the end of a\ntextblock, try to reduce or remove the boundary between that block\nand the one after it, either by joining them or by moving the other\nblock closer to this one in the tree structure. Will use the view\nfor accurate start-of-textblock detection if given.\n*/\nconst joinForward = (state, dispatch, view) => {\n    let $cursor = atBlockEnd(state, view);\n    if (!$cursor)\n        return false;\n    let $cut = findCutAfter($cursor);\n    // If there is no node after this, there's nothing to do\n    if (!$cut)\n        return false;\n    let after = $cut.nodeAfter;\n    // Try the joining algorithm\n    if (deleteBarrier(state, $cut, dispatch))\n        return true;\n    // If the node above has no content and the node below is\n    // selectable, delete the node above and select the one below.\n    if ($cursor.parent.content.size == 0 &&\n        (textblockAt(after, \"start\") || NodeSelection.isSelectable(after))) {\n        let delStep = replaceStep(state.doc, $cursor.before(), $cursor.after(), Slice.empty);\n        if (delStep && delStep.slice.size < delStep.to - delStep.from) {\n            if (dispatch) {\n                let tr = state.tr.step(delStep);\n                tr.setSelection(textblockAt(after, \"start\") ? Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos)), 1)\n                    : NodeSelection.create(tr.doc, tr.mapping.map($cut.pos)));\n                dispatch(tr.scrollIntoView());\n            }\n            return true;\n        }\n    }\n    // If the next node is an atom, delete it\n    if (after.isAtom && $cut.depth == $cursor.depth - 1) {\n        if (dispatch)\n            dispatch(state.tr.delete($cut.pos, $cut.pos + after.nodeSize).scrollIntoView());\n        return true;\n    }\n    return false;\n};\n/**\nWhen the selection is empty and at the end of a textblock, select\nthe node coming after that textblock, if possible. This is intended\nto be bound to keys like delete, after\n[`joinForward`](https://prosemirror.net/docs/ref/#commands.joinForward) and similar deleting\ncommands, to provide a fall-back behavior when the schema doesn't\nallow deletion at the selected point.\n*/\nconst selectNodeForward = (state, dispatch, view) => {\n    let { $head, empty } = state.selection, $cut = $head;\n    if (!empty)\n        return false;\n    if ($head.parent.isTextblock) {\n        if (view ? !view.endOfTextblock(\"forward\", state) : $head.parentOffset < $head.parent.content.size)\n            return false;\n        $cut = findCutAfter($head);\n    }\n    let node = $cut && $cut.nodeAfter;\n    if (!node || !NodeSelection.isSelectable(node))\n        return false;\n    if (dispatch)\n        dispatch(state.tr.setSelection(NodeSelection.create(state.doc, $cut.pos)).scrollIntoView());\n    return true;\n};\nfunction findCutAfter($pos) {\n    if (!$pos.parent.type.spec.isolating)\n        for (let i = $pos.depth - 1; i >= 0; i--) {\n            let parent = $pos.node(i);\n            if ($pos.index(i) + 1 < parent.childCount)\n                return $pos.doc.resolve($pos.after(i + 1));\n            if (parent.type.spec.isolating)\n                break;\n        }\n    return null;\n}\n/**\nJoin the selected block or, if there is a text selection, the\nclosest ancestor block of the selection that can be joined, with\nthe sibling above it.\n*/\nconst joinUp = (state, dispatch) => {\n    let sel = state.selection, nodeSel = sel instanceof NodeSelection, point;\n    if (nodeSel) {\n        if (sel.node.isTextblock || !canJoin(state.doc, sel.from))\n            return false;\n        point = sel.from;\n    }\n    else {\n        point = joinPoint(state.doc, sel.from, -1);\n        if (point == null)\n            return false;\n    }\n    if (dispatch) {\n        let tr = state.tr.join(point);\n        if (nodeSel)\n            tr.setSelection(NodeSelection.create(tr.doc, point - state.doc.resolve(point).nodeBefore.nodeSize));\n        dispatch(tr.scrollIntoView());\n    }\n    return true;\n};\n/**\nJoin the selected block, or the closest ancestor of the selection\nthat can be joined, with the sibling after it.\n*/\nconst joinDown = (state, dispatch) => {\n    let sel = state.selection, point;\n    if (sel instanceof NodeSelection) {\n        if (sel.node.isTextblock || !canJoin(state.doc, sel.to))\n            return false;\n        point = sel.to;\n    }\n    else {\n        point = joinPoint(state.doc, sel.to, 1);\n        if (point == null)\n            return false;\n    }\n    if (dispatch)\n        dispatch(state.tr.join(point).scrollIntoView());\n    return true;\n};\n/**\nLift the selected block, or the closest ancestor block of the\nselection that can be lifted, out of its parent node.\n*/\nconst lift = (state, dispatch) => {\n    let { $from, $to } = state.selection;\n    let range = $from.blockRange($to), target = range && liftTarget(range);\n    if (target == null)\n        return false;\n    if (dispatch)\n        dispatch(state.tr.lift(range, target).scrollIntoView());\n    return true;\n};\n/**\nIf the selection is in a node whose type has a truthy\n[`code`](https://prosemirror.net/docs/ref/#model.NodeSpec.code) property in its spec, replace the\nselection with a newline character.\n*/\nconst newlineInCode = (state, dispatch) => {\n    let { $head, $anchor } = state.selection;\n    if (!$head.parent.type.spec.code || !$head.sameParent($anchor))\n        return false;\n    if (dispatch)\n        dispatch(state.tr.insertText(\"\\n\").scrollIntoView());\n    return true;\n};\nfunction defaultBlockAt(match) {\n    for (let i = 0; i < match.edgeCount; i++) {\n        let { type } = match.edge(i);\n        if (type.isTextblock && !type.hasRequiredAttrs())\n            return type;\n    }\n    return null;\n}\n/**\nWhen the selection is in a node with a truthy\n[`code`](https://prosemirror.net/docs/ref/#model.NodeSpec.code) property in its spec, create a\ndefault block after the code block, and move the cursor there.\n*/\nconst exitCode = (state, dispatch) => {\n    let { $head, $anchor } = state.selection;\n    if (!$head.parent.type.spec.code || !$head.sameParent($anchor))\n        return false;\n    let above = $head.node(-1), after = $head.indexAfter(-1), type = defaultBlockAt(above.contentMatchAt(after));\n    if (!type || !above.canReplaceWith(after, after, type))\n        return false;\n    if (dispatch) {\n        let pos = $head.after(), tr = state.tr.replaceWith(pos, pos, type.createAndFill());\n        tr.setSelection(Selection.near(tr.doc.resolve(pos), 1));\n        dispatch(tr.scrollIntoView());\n    }\n    return true;\n};\n/**\nIf a block node is selected, create an empty paragraph before (if\nit is its parent's first child) or after it.\n*/\nconst createParagraphNear = (state, dispatch) => {\n    let sel = state.selection, { $from, $to } = sel;\n    if (sel instanceof AllSelection || $from.parent.inlineContent || $to.parent.inlineContent)\n        return false;\n    let type = defaultBlockAt($to.parent.contentMatchAt($to.indexAfter()));\n    if (!type || !type.isTextblock)\n        return false;\n    if (dispatch) {\n        let side = (!$from.parentOffset && $to.index() < $to.parent.childCount ? $from : $to).pos;\n        let tr = state.tr.insert(side, type.createAndFill());\n        tr.setSelection(TextSelection.create(tr.doc, side + 1));\n        dispatch(tr.scrollIntoView());\n    }\n    return true;\n};\n/**\nIf the cursor is in an empty textblock that can be lifted, lift the\nblock.\n*/\nconst liftEmptyBlock = (state, dispatch) => {\n    let { $cursor } = state.selection;\n    if (!$cursor || $cursor.parent.content.size)\n        return false;\n    if ($cursor.depth > 1 && $cursor.after() != $cursor.end(-1)) {\n        let before = $cursor.before();\n        if (canSplit(state.doc, before)) {\n            if (dispatch)\n                dispatch(state.tr.split(before).scrollIntoView());\n            return true;\n        }\n    }\n    let range = $cursor.blockRange(), target = range && liftTarget(range);\n    if (target == null)\n        return false;\n    if (dispatch)\n        dispatch(state.tr.lift(range, target).scrollIntoView());\n    return true;\n};\n/**\nCreate a variant of [`splitBlock`](https://prosemirror.net/docs/ref/#commands.splitBlock) that uses\na custom function to determine the type of the newly split off block.\n*/\nfunction splitBlockAs(splitNode) {\n    return (state, dispatch) => {\n        let { $from, $to } = state.selection;\n        if (state.selection instanceof NodeSelection && state.selection.node.isBlock) {\n            if (!$from.parentOffset || !canSplit(state.doc, $from.pos))\n                return false;\n            if (dispatch)\n                dispatch(state.tr.split($from.pos).scrollIntoView());\n            return true;\n        }\n        if (!$from.parent.isBlock)\n            return false;\n        if (dispatch) {\n            let atEnd = $to.parentOffset == $to.parent.content.size;\n            let tr = state.tr;\n            if (state.selection instanceof TextSelection || state.selection instanceof AllSelection)\n                tr.deleteSelection();\n            let deflt = $from.depth == 0 ? null : defaultBlockAt($from.node(-1).contentMatchAt($from.indexAfter(-1)));\n            let splitType = splitNode && splitNode($to.parent, atEnd);\n            let types = splitType ? [splitType] : atEnd && deflt ? [{ type: deflt }] : undefined;\n            let can = canSplit(tr.doc, tr.mapping.map($from.pos), 1, types);\n            if (!types && !can && canSplit(tr.doc, tr.mapping.map($from.pos), 1, deflt ? [{ type: deflt }] : undefined)) {\n                if (deflt)\n                    types = [{ type: deflt }];\n                can = true;\n            }\n            if (can) {\n                tr.split(tr.mapping.map($from.pos), 1, types);\n                if (!atEnd && !$from.parentOffset && $from.parent.type != deflt) {\n                    let first = tr.mapping.map($from.before()), $first = tr.doc.resolve(first);\n                    if (deflt && $from.node(-1).canReplaceWith($first.index(), $first.index() + 1, deflt))\n                        tr.setNodeMarkup(tr.mapping.map($from.before()), deflt);\n                }\n            }\n            dispatch(tr.scrollIntoView());\n        }\n        return true;\n    };\n}\n/**\nSplit the parent block of the selection. If the selection is a text\nselection, also delete its content.\n*/\nconst splitBlock = splitBlockAs();\n/**\nActs like [`splitBlock`](https://prosemirror.net/docs/ref/#commands.splitBlock), but without\nresetting the set of active marks at the cursor.\n*/\nconst splitBlockKeepMarks = (state, dispatch) => {\n    return splitBlock(state, dispatch && (tr => {\n        let marks = state.storedMarks || (state.selection.$to.parentOffset && state.selection.$from.marks());\n        if (marks)\n            tr.ensureMarks(marks);\n        dispatch(tr);\n    }));\n};\n/**\nMove the selection to the node wrapping the current selection, if\nany. (Will not select the document node.)\n*/\nconst selectParentNode = (state, dispatch) => {\n    let { $from, to } = state.selection, pos;\n    let same = $from.sharedDepth(to);\n    if (same == 0)\n        return false;\n    pos = $from.before(same);\n    if (dispatch)\n        dispatch(state.tr.setSelection(NodeSelection.create(state.doc, pos)));\n    return true;\n};\n/**\nSelect the whole document.\n*/\nconst selectAll = (state, dispatch) => {\n    if (dispatch)\n        dispatch(state.tr.setSelection(new AllSelection(state.doc)));\n    return true;\n};\nfunction joinMaybeClear(state, $pos, dispatch) {\n    let before = $pos.nodeBefore, after = $pos.nodeAfter, index = $pos.index();\n    if (!before || !after || !before.type.compatibleContent(after.type))\n        return false;\n    if (!before.content.size && $pos.parent.canReplace(index - 1, index)) {\n        if (dispatch)\n            dispatch(state.tr.delete($pos.pos - before.nodeSize, $pos.pos).scrollIntoView());\n        return true;\n    }\n    if (!$pos.parent.canReplace(index, index + 1) || !(after.isTextblock || canJoin(state.doc, $pos.pos)))\n        return false;\n    if (dispatch)\n        dispatch(state.tr\n            .clearIncompatible($pos.pos, before.type, before.contentMatchAt(before.childCount))\n            .join($pos.pos)\n            .scrollIntoView());\n    return true;\n}\nfunction deleteBarrier(state, $cut, dispatch) {\n    let before = $cut.nodeBefore, after = $cut.nodeAfter, conn, match;\n    if (before.type.spec.isolating || after.type.spec.isolating)\n        return false;\n    if (joinMaybeClear(state, $cut, dispatch))\n        return true;\n    let canDelAfter = $cut.parent.canReplace($cut.index(), $cut.index() + 1);\n    if (canDelAfter &&\n        (conn = (match = before.contentMatchAt(before.childCount)).findWrapping(after.type)) &&\n        match.matchType(conn[0] || after.type).validEnd) {\n        if (dispatch) {\n            let end = $cut.pos + after.nodeSize, wrap = Fragment.empty;\n            for (let i = conn.length - 1; i >= 0; i--)\n                wrap = Fragment.from(conn[i].create(null, wrap));\n            wrap = Fragment.from(before.copy(wrap));\n            let tr = state.tr.step(new ReplaceAroundStep($cut.pos - 1, end, $cut.pos, end, new Slice(wrap, 1, 0), conn.length, true));\n            let joinAt = end + 2 * conn.length;\n            if (canJoin(tr.doc, joinAt))\n                tr.join(joinAt);\n            dispatch(tr.scrollIntoView());\n        }\n        return true;\n    }\n    let selAfter = Selection.findFrom($cut, 1);\n    let range = selAfter && selAfter.$from.blockRange(selAfter.$to), target = range && liftTarget(range);\n    if (target != null && target >= $cut.depth) {\n        if (dispatch)\n            dispatch(state.tr.lift(range, target).scrollIntoView());\n        return true;\n    }\n    if (canDelAfter && textblockAt(after, \"start\", true) && textblockAt(before, \"end\")) {\n        let at = before, wrap = [];\n        for (;;) {\n            wrap.push(at);\n            if (at.isTextblock)\n                break;\n            at = at.lastChild;\n        }\n        let afterText = after, afterDepth = 1;\n        for (; !afterText.isTextblock; afterText = afterText.firstChild)\n            afterDepth++;\n        if (at.canReplace(at.childCount, at.childCount, afterText.content)) {\n            if (dispatch) {\n                let end = Fragment.empty;\n                for (let i = wrap.length - 1; i >= 0; i--)\n                    end = Fragment.from(wrap[i].copy(end));\n                let tr = state.tr.step(new ReplaceAroundStep($cut.pos - wrap.length, $cut.pos + after.nodeSize, $cut.pos + afterDepth, $cut.pos + after.nodeSize - afterDepth, new Slice(end, wrap.length, 0), 0, true));\n                dispatch(tr.scrollIntoView());\n            }\n            return true;\n        }\n    }\n    return false;\n}\nfunction selectTextblockSide(side) {\n    return function (state, dispatch) {\n        let sel = state.selection, $pos = side < 0 ? sel.$from : sel.$to;\n        let depth = $pos.depth;\n        while ($pos.node(depth).isInline) {\n            if (!depth)\n                return false;\n            depth--;\n        }\n        if (!$pos.node(depth).isTextblock)\n            return false;\n        if (dispatch)\n            dispatch(state.tr.setSelection(TextSelection.create(state.doc, side < 0 ? $pos.start(depth) : $pos.end(depth))));\n        return true;\n    };\n}\n/**\nMoves the cursor to the start of current text block.\n*/\nconst selectTextblockStart = selectTextblockSide(-1);\n/**\nMoves the cursor to the end of current text block.\n*/\nconst selectTextblockEnd = selectTextblockSide(1);\n// Parameterized commands\n/**\nWrap the selection in a node of the given type with the given\nattributes.\n*/\nfunction wrapIn(nodeType, attrs = null) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to), wrapping = range && findWrapping(range, nodeType, attrs);\n        if (!wrapping)\n            return false;\n        if (dispatch)\n            dispatch(state.tr.wrap(range, wrapping).scrollIntoView());\n        return true;\n    };\n}\n/**\nReturns a command that tries to set the selected textblocks to the\ngiven node type with the given attributes.\n*/\nfunction setBlockType(nodeType, attrs = null) {\n    return function (state, dispatch) {\n        let applicable = false;\n        for (let i = 0; i < state.selection.ranges.length && !applicable; i++) {\n            let { $from: { pos: from }, $to: { pos: to } } = state.selection.ranges[i];\n            state.doc.nodesBetween(from, to, (node, pos) => {\n                if (applicable)\n                    return false;\n                if (!node.isTextblock || node.hasMarkup(nodeType, attrs))\n                    return;\n                if (node.type == nodeType) {\n                    applicable = true;\n                }\n                else {\n                    let $pos = state.doc.resolve(pos), index = $pos.index();\n                    applicable = $pos.parent.canReplaceWith(index, index + 1, nodeType);\n                }\n            });\n        }\n        if (!applicable)\n            return false;\n        if (dispatch) {\n            let tr = state.tr;\n            for (let i = 0; i < state.selection.ranges.length; i++) {\n                let { $from: { pos: from }, $to: { pos: to } } = state.selection.ranges[i];\n                tr.setBlockType(from, to, nodeType, attrs);\n            }\n            dispatch(tr.scrollIntoView());\n        }\n        return true;\n    };\n}\nfunction markApplies(doc, ranges, type) {\n    for (let i = 0; i < ranges.length; i++) {\n        let { $from, $to } = ranges[i];\n        let can = $from.depth == 0 ? doc.inlineContent && doc.type.allowsMarkType(type) : false;\n        doc.nodesBetween($from.pos, $to.pos, node => {\n            if (can)\n                return false;\n            can = node.inlineContent && node.type.allowsMarkType(type);\n        });\n        if (can)\n            return true;\n    }\n    return false;\n}\n/**\nCreate a command function that toggles the given mark with the\ngiven attributes. Will return `false` when the current selection\ndoesn't support that mark. This will remove the mark if any marks\nof that type exist in the selection, or add it otherwise. If the\nselection is empty, this applies to the [stored\nmarks](https://prosemirror.net/docs/ref/#state.EditorState.storedMarks) instead of a range of the\ndocument.\n*/\nfunction toggleMark(markType, attrs = null) {\n    return function (state, dispatch) {\n        let { empty, $cursor, ranges } = state.selection;\n        if ((empty && !$cursor) || !markApplies(state.doc, ranges, markType))\n            return false;\n        if (dispatch) {\n            if ($cursor) {\n                if (markType.isInSet(state.storedMarks || $cursor.marks()))\n                    dispatch(state.tr.removeStoredMark(markType));\n                else\n                    dispatch(state.tr.addStoredMark(markType.create(attrs)));\n            }\n            else {\n                let has = false, tr = state.tr;\n                for (let i = 0; !has && i < ranges.length; i++) {\n                    let { $from, $to } = ranges[i];\n                    has = state.doc.rangeHasMark($from.pos, $to.pos, markType);\n                }\n                for (let i = 0; i < ranges.length; i++) {\n                    let { $from, $to } = ranges[i];\n                    if (has) {\n                        tr.removeMark($from.pos, $to.pos, markType);\n                    }\n                    else {\n                        let from = $from.pos, to = $to.pos, start = $from.nodeAfter, end = $to.nodeBefore;\n                        let spaceStart = start && start.isText ? /^\\s*/.exec(start.text)[0].length : 0;\n                        let spaceEnd = end && end.isText ? /\\s*$/.exec(end.text)[0].length : 0;\n                        if (from + spaceStart < to) {\n                            from += spaceStart;\n                            to -= spaceEnd;\n                        }\n                        tr.addMark(from, to, markType.create(attrs));\n                    }\n                }\n                dispatch(tr.scrollIntoView());\n            }\n        }\n        return true;\n    };\n}\nfunction wrapDispatchForJoin(dispatch, isJoinable) {\n    return (tr) => {\n        if (!tr.isGeneric)\n            return dispatch(tr);\n        let ranges = [];\n        for (let i = 0; i < tr.mapping.maps.length; i++) {\n            let map = tr.mapping.maps[i];\n            for (let j = 0; j < ranges.length; j++)\n                ranges[j] = map.map(ranges[j]);\n            map.forEach((_s, _e, from, to) => ranges.push(from, to));\n        }\n        // Figure out which joinable points exist inside those ranges,\n        // by checking all node boundaries in their parent nodes.\n        let joinable = [];\n        for (let i = 0; i < ranges.length; i += 2) {\n            let from = ranges[i], to = ranges[i + 1];\n            let $from = tr.doc.resolve(from), depth = $from.sharedDepth(to), parent = $from.node(depth);\n            for (let index = $from.indexAfter(depth), pos = $from.after(depth + 1); pos <= to; ++index) {\n                let after = parent.maybeChild(index);\n                if (!after)\n                    break;\n                if (index && joinable.indexOf(pos) == -1) {\n                    let before = parent.child(index - 1);\n                    if (before.type == after.type && isJoinable(before, after))\n                        joinable.push(pos);\n                }\n                pos += after.nodeSize;\n            }\n        }\n        // Join the joinable points\n        joinable.sort((a, b) => a - b);\n        for (let i = joinable.length - 1; i >= 0; i--) {\n            if (canJoin(tr.doc, joinable[i]))\n                tr.join(joinable[i]);\n        }\n        dispatch(tr);\n    };\n}\n/**\nWrap a command so that, when it produces a transform that causes\ntwo joinable nodes to end up next to each other, those are joined.\nNodes are considered joinable when they are of the same type and\nwhen the `isJoinable` predicate returns true for them or, if an\narray of strings was passed, if their node type name is in that\narray.\n*/\nfunction autoJoin(command, isJoinable) {\n    let canJoin = Array.isArray(isJoinable) ? (node) => isJoinable.indexOf(node.type.name) > -1\n        : isJoinable;\n    return (state, dispatch, view) => command(state, dispatch && wrapDispatchForJoin(dispatch, canJoin), view);\n}\n/**\nCombine a number of command functions into a single function (which\ncalls them one by one until one returns true).\n*/\nfunction chainCommands(...commands) {\n    return function (state, dispatch, view) {\n        for (let i = 0; i < commands.length; i++)\n            if (commands[i](state, dispatch, view))\n                return true;\n        return false;\n    };\n}\nlet backspace = chainCommands(deleteSelection, joinBackward, selectNodeBackward);\nlet del = chainCommands(deleteSelection, joinForward, selectNodeForward);\n/**\nA basic keymap containing bindings not specific to any schema.\nBinds the following keys (when multiple commands are listed, they\nare chained with [`chainCommands`](https://prosemirror.net/docs/ref/#commands.chainCommands)):\n\n* **Enter** to `newlineInCode`, `createParagraphNear`, `liftEmptyBlock`, `splitBlock`\n* **Mod-Enter** to `exitCode`\n* **Backspace** and **Mod-Backspace** to `deleteSelection`, `joinBackward`, `selectNodeBackward`\n* **Delete** and **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`\n* **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`\n* **Mod-a** to `selectAll`\n*/\nconst pcBaseKeymap = {\n    \"Enter\": chainCommands(newlineInCode, createParagraphNear, liftEmptyBlock, splitBlock),\n    \"Mod-Enter\": exitCode,\n    \"Backspace\": backspace,\n    \"Mod-Backspace\": backspace,\n    \"Shift-Backspace\": backspace,\n    \"Delete\": del,\n    \"Mod-Delete\": del,\n    \"Mod-a\": selectAll\n};\n/**\nA copy of `pcBaseKeymap` that also binds **Ctrl-h** like Backspace,\n**Ctrl-d** like Delete, **Alt-Backspace** like Ctrl-Backspace, and\n**Ctrl-Alt-Backspace**, **Alt-Delete**, and **Alt-d** like\nCtrl-Delete.\n*/\nconst macBaseKeymap = {\n    \"Ctrl-h\": pcBaseKeymap[\"Backspace\"],\n    \"Alt-Backspace\": pcBaseKeymap[\"Mod-Backspace\"],\n    \"Ctrl-d\": pcBaseKeymap[\"Delete\"],\n    \"Ctrl-Alt-Backspace\": pcBaseKeymap[\"Mod-Delete\"],\n    \"Alt-Delete\": pcBaseKeymap[\"Mod-Delete\"],\n    \"Alt-d\": pcBaseKeymap[\"Mod-Delete\"],\n    \"Ctrl-a\": selectTextblockStart,\n    \"Ctrl-e\": selectTextblockEnd\n};\nfor (let key in pcBaseKeymap)\n    macBaseKeymap[key] = pcBaseKeymap[key];\nconst mac = typeof navigator != \"undefined\" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform)\n    // @ts-ignore\n    : typeof os != \"undefined\" && os.platform ? os.platform() == \"darwin\" : false;\n/**\nDepending on the detected platform, this will hold\n[`pcBasekeymap`](https://prosemirror.net/docs/ref/#commands.pcBaseKeymap) or\n[`macBaseKeymap`](https://prosemirror.net/docs/ref/#commands.macBaseKeymap).\n*/\nconst baseKeymap = mac ? macBaseKeymap : pcBaseKeymap;\n\nexport { autoJoin, baseKeymap, chainCommands, createParagraphNear, deleteSelection, exitCode, joinBackward, joinDown, joinForward, joinTextblockBackward, joinTextblockForward, joinUp, lift, liftEmptyBlock, macBaseKeymap, newlineInCode, pcBaseKeymap, selectAll, selectNodeBackward, selectNodeForward, selectParentNode, selectTextblockEnd, selectTextblockStart, setBlockType, splitBlock, splitBlockAs, splitBlockKeepMarks, toggleMark, wrapIn };\n","import { Plugin } from 'prosemirror-state';\nimport { findWrapping, canJoin } from 'prosemirror-transform';\n\n/**\nInput rules are regular expressions describing a piece of text\nthat, when typed, causes something to happen. This might be\nchanging two dashes into an emdash, wrapping a paragraph starting\nwith `\"> \"` into a blockquote, or something entirely different.\n*/\nclass InputRule {\n    // :: (RegExp, union<string, (state: EditorState, match: [string], start: number, end: number) → ?Transaction>)\n    /**\n    Create an input rule. The rule applies when the user typed\n    something and the text directly in front of the cursor matches\n    `match`, which should end with `$`.\n    \n    The `handler` can be a string, in which case the matched text, or\n    the first matched group in the regexp, is replaced by that\n    string.\n    \n    Or a it can be a function, which will be called with the match\n    array produced by\n    [`RegExp.exec`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp/exec),\n    as well as the start and end of the matched range, and which can\n    return a [transaction](https://prosemirror.net/docs/ref/#state.Transaction) that describes the\n    rule's effect, or null to indicate the input was not handled.\n    */\n    constructor(\n    /**\n    @internal\n    */\n    match, handler, options = {}) {\n        this.match = match;\n        this.match = match;\n        this.handler = typeof handler == \"string\" ? stringHandler(handler) : handler;\n        this.undoable = options.undoable !== false;\n        this.inCode = options.inCode || false;\n    }\n}\nfunction stringHandler(string) {\n    return function (state, match, start, end) {\n        let insert = string;\n        if (match[1]) {\n            let offset = match[0].lastIndexOf(match[1]);\n            insert += match[0].slice(offset + match[1].length);\n            start += offset;\n            let cutOff = start - end;\n            if (cutOff > 0) {\n                insert = match[0].slice(offset - cutOff, offset) + insert;\n                start = end;\n            }\n        }\n        return state.tr.insertText(insert, start, end);\n    };\n}\nconst MAX_MATCH = 500;\n/**\nCreate an input rules plugin. When enabled, it will cause text\ninput that matches any of the given rules to trigger the rule's\naction.\n*/\nfunction inputRules({ rules }) {\n    let plugin = new Plugin({\n        state: {\n            init() { return null; },\n            apply(tr, prev) {\n                let stored = tr.getMeta(this);\n                if (stored)\n                    return stored;\n                return tr.selectionSet || tr.docChanged ? null : prev;\n            }\n        },\n        props: {\n            handleTextInput(view, from, to, text) {\n                return run(view, from, to, text, rules, plugin);\n            },\n            handleDOMEvents: {\n                compositionend: (view) => {\n                    setTimeout(() => {\n                        let { $cursor } = view.state.selection;\n                        if ($cursor)\n                            run(view, $cursor.pos, $cursor.pos, \"\", rules, plugin);\n                    });\n                }\n            }\n        },\n        isInputRules: true\n    });\n    return plugin;\n}\nfunction run(view, from, to, text, rules, plugin) {\n    if (view.composing)\n        return false;\n    let state = view.state, $from = state.doc.resolve(from);\n    let textBefore = $from.parent.textBetween(Math.max(0, $from.parentOffset - MAX_MATCH), $from.parentOffset, null, \"\\ufffc\") + text;\n    for (let i = 0; i < rules.length; i++) {\n        let rule = rules[i];\n        if ($from.parent.type.spec.code) {\n            if (!rule.inCode)\n                continue;\n        }\n        else if (rule.inCode === \"only\") {\n            continue;\n        }\n        let match = rule.match.exec(textBefore);\n        let tr = match && rule.handler(state, match, from - (match[0].length - text.length), to);\n        if (!tr)\n            continue;\n        if (rule.undoable)\n            tr.setMeta(plugin, { transform: tr, from, to, text });\n        view.dispatch(tr);\n        return true;\n    }\n    return false;\n}\n/**\nThis is a command that will undo an input rule, if applying such a\nrule was the last thing that the user did.\n*/\nconst undoInputRule = (state, dispatch) => {\n    let plugins = state.plugins;\n    for (let i = 0; i < plugins.length; i++) {\n        let plugin = plugins[i], undoable;\n        if (plugin.spec.isInputRules && (undoable = plugin.getState(state))) {\n            if (dispatch) {\n                let tr = state.tr, toUndo = undoable.transform;\n                for (let j = toUndo.steps.length - 1; j >= 0; j--)\n                    tr.step(toUndo.steps[j].invert(toUndo.docs[j]));\n                if (undoable.text) {\n                    let marks = tr.doc.resolve(undoable.from).marks();\n                    tr.replaceWith(undoable.from, undoable.to, state.schema.text(undoable.text, marks));\n                }\n                else {\n                    tr.delete(undoable.from, undoable.to);\n                }\n                dispatch(tr);\n            }\n            return true;\n        }\n    }\n    return false;\n};\n\n/**\nConverts double dashes to an emdash.\n*/\nconst emDash = new InputRule(/--$/, \"—\");\n/**\nConverts three dots to an ellipsis character.\n*/\nconst ellipsis = new InputRule(/\\.\\.\\.$/, \"…\");\n/**\n“Smart” opening double quotes.\n*/\nconst openDoubleQuote = new InputRule(/(?:^|[\\s\\{\\[\\(\\<'\"\\u2018\\u201C])(\")$/, \"“\");\n/**\n“Smart” closing double quotes.\n*/\nconst closeDoubleQuote = new InputRule(/\"$/, \"”\");\n/**\n“Smart” opening single quotes.\n*/\nconst openSingleQuote = new InputRule(/(?:^|[\\s\\{\\[\\(\\<'\"\\u2018\\u201C])(')$/, \"‘\");\n/**\n“Smart” closing single quotes.\n*/\nconst closeSingleQuote = new InputRule(/'$/, \"’\");\n/**\nSmart-quote related input rules.\n*/\nconst smartQuotes = [openDoubleQuote, closeDoubleQuote, openSingleQuote, closeSingleQuote];\n\n/**\nBuild an input rule for automatically wrapping a textblock when a\ngiven string is typed. The `regexp` argument is\ndirectly passed through to the `InputRule` constructor. You'll\nprobably want the regexp to start with `^`, so that the pattern can\nonly occur at the start of a textblock.\n\n`nodeType` is the type of node to wrap in. If it needs attributes,\nyou can either pass them directly, or pass a function that will\ncompute them from the regular expression match.\n\nBy default, if there's a node with the same type above the newly\nwrapped node, the rule will try to [join](https://prosemirror.net/docs/ref/#transform.Transform.join) those\ntwo nodes. You can pass a join predicate, which takes a regular\nexpression match and the node before the wrapped node, and can\nreturn a boolean to indicate whether a join should happen.\n*/\nfunction wrappingInputRule(regexp, nodeType, getAttrs = null, joinPredicate) {\n    return new InputRule(regexp, (state, match, start, end) => {\n        let attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n        let tr = state.tr.delete(start, end);\n        let $start = tr.doc.resolve(start), range = $start.blockRange(), wrapping = range && findWrapping(range, nodeType, attrs);\n        if (!wrapping)\n            return null;\n        tr.wrap(range, wrapping);\n        let before = tr.doc.resolve(start - 1).nodeBefore;\n        if (before && before.type == nodeType && canJoin(tr.doc, start - 1) &&\n            (!joinPredicate || joinPredicate(match, before)))\n            tr.join(start - 1);\n        return tr;\n    });\n}\n/**\nBuild an input rule that changes the type of a textblock when the\nmatched text is typed into it. You'll usually want to start your\nregexp with `^` to that it is only matched at the start of a\ntextblock. The optional `getAttrs` parameter can be used to compute\nthe new node's attributes, and works the same as in the\n`wrappingInputRule` function.\n*/\nfunction textblockTypeInputRule(regexp, nodeType, getAttrs = null) {\n    return new InputRule(regexp, (state, match, start, end) => {\n        let $start = state.doc.resolve(start);\n        let attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n        if (!$start.node(-1).canReplaceWith($start.index(-1), $start.indexAfter(-1), nodeType))\n            return null;\n        return state.tr\n            .delete(start, end)\n            .setBlockType(start, start, nodeType, attrs);\n    });\n}\n\nexport { InputRule, closeDoubleQuote, closeSingleQuote, ellipsis, emDash, inputRules, openDoubleQuote, openSingleQuote, smartQuotes, textblockTypeInputRule, undoInputRule, wrappingInputRule };\n","export var base = {\n  8: \"Backspace\",\n  9: \"Tab\",\n  10: \"Enter\",\n  12: \"NumLock\",\n  13: \"Enter\",\n  16: \"Shift\",\n  17: \"Control\",\n  18: \"Alt\",\n  20: \"CapsLock\",\n  27: \"Escape\",\n  32: \" \",\n  33: \"PageUp\",\n  34: \"PageDown\",\n  35: \"End\",\n  36: \"Home\",\n  37: \"ArrowLeft\",\n  38: \"ArrowUp\",\n  39: \"ArrowRight\",\n  40: \"ArrowDown\",\n  44: \"PrintScreen\",\n  45: \"Insert\",\n  46: \"Delete\",\n  59: \";\",\n  61: \"=\",\n  91: \"Meta\",\n  92: \"Meta\",\n  106: \"*\",\n  107: \"+\",\n  108: \",\",\n  109: \"-\",\n  110: \".\",\n  111: \"/\",\n  144: \"NumLock\",\n  145: \"ScrollLock\",\n  160: \"Shift\",\n  161: \"Shift\",\n  162: \"Control\",\n  163: \"Control\",\n  164: \"Alt\",\n  165: \"Alt\",\n  173: \"-\",\n  186: \";\",\n  187: \"=\",\n  188: \",\",\n  189: \"-\",\n  190: \".\",\n  191: \"/\",\n  192: \"`\",\n  219: \"[\",\n  220: \"\\\\\",\n  221: \"]\",\n  222: \"'\"\n}\n\nexport var shift = {\n  48: \")\",\n  49: \"!\",\n  50: \"@\",\n  51: \"#\",\n  52: \"$\",\n  53: \"%\",\n  54: \"^\",\n  55: \"&\",\n  56: \"*\",\n  57: \"(\",\n  59: \":\",\n  61: \"+\",\n  173: \"_\",\n  186: \":\",\n  187: \"+\",\n  188: \"<\",\n  189: \"_\",\n  190: \">\",\n  191: \"?\",\n  192: \"~\",\n  219: \"{\",\n  220: \"|\",\n  221: \"}\",\n  222: \"\\\"\"\n}\n\nvar mac = typeof navigator != \"undefined\" && /Mac/.test(navigator.platform)\nvar ie = typeof navigator != \"undefined\" && /MSIE \\d|Trident\\/(?:[7-9]|\\d{2,})\\..*rv:(\\d+)/.exec(navigator.userAgent)\n\n// Fill in the digit keys\nfor (var i = 0; i < 10; i++) base[48 + i] = base[96 + i] = String(i)\n\n// The function keys\nfor (var i = 1; i <= 24; i++) base[i + 111] = \"F\" + i\n\n// And the alphabetic keys\nfor (var i = 65; i <= 90; i++) {\n  base[i] = String.fromCharCode(i + 32)\n  shift[i] = String.fromCharCode(i)\n}\n\n// For each code that doesn't have a shift-equivalent, copy the base name\nfor (var code in base) if (!shift.hasOwnProperty(code)) shift[code] = base[code]\n\nexport function keyName(event) {\n  // On macOS, keys held with Shift and Cmd don't reflect the effect of Shift in `.key`.\n  // On IE, shift effect is never included in `.key`.\n  var ignoreKey = mac && event.metaKey && event.shiftKey && !event.ctrlKey && !event.altKey ||\n      ie && event.shiftKey && event.key && event.key.length == 1 ||\n      event.key == \"Unidentified\"\n  var name = (!ignoreKey && event.key) ||\n    (event.shiftKey ? shift : base)[event.keyCode] ||\n    event.key || \"Unidentified\"\n  // Edge sometimes produces wrong names (Issue #3)\n  if (name == \"Esc\") name = \"Escape\"\n  if (name == \"Del\") name = \"Delete\"\n  // https://developer.microsoft.com/en-us/microsoft-edge/platform/issues/8860571/\n  if (name == \"Left\") name = \"ArrowLeft\"\n  if (name == \"Up\") name = \"ArrowUp\"\n  if (name == \"Right\") name = \"ArrowRight\"\n  if (name == \"Down\") name = \"ArrowDown\"\n  return name\n}\n","import { keyName, base } from 'w3c-keyname';\nimport { Plugin } from 'prosemirror-state';\n\nconst mac = typeof navigator != \"undefined\" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform) : false;\nfunction normalizeKeyName(name) {\n    let parts = name.split(/-(?!$)/), result = parts[parts.length - 1];\n    if (result == \"Space\")\n        result = \" \";\n    let alt, ctrl, shift, meta;\n    for (let i = 0; i < parts.length - 1; i++) {\n        let mod = parts[i];\n        if (/^(cmd|meta|m)$/i.test(mod))\n            meta = true;\n        else if (/^a(lt)?$/i.test(mod))\n            alt = true;\n        else if (/^(c|ctrl|control)$/i.test(mod))\n            ctrl = true;\n        else if (/^s(hift)?$/i.test(mod))\n            shift = true;\n        else if (/^mod$/i.test(mod)) {\n            if (mac)\n                meta = true;\n            else\n                ctrl = true;\n        }\n        else\n            throw new Error(\"Unrecognized modifier name: \" + mod);\n    }\n    if (alt)\n        result = \"Alt-\" + result;\n    if (ctrl)\n        result = \"Ctrl-\" + result;\n    if (meta)\n        result = \"Meta-\" + result;\n    if (shift)\n        result = \"Shift-\" + result;\n    return result;\n}\nfunction normalize(map) {\n    let copy = Object.create(null);\n    for (let prop in map)\n        copy[normalizeKeyName(prop)] = map[prop];\n    return copy;\n}\nfunction modifiers(name, event, shift = true) {\n    if (event.altKey)\n        name = \"Alt-\" + name;\n    if (event.ctrlKey)\n        name = \"Ctrl-\" + name;\n    if (event.metaKey)\n        name = \"Meta-\" + name;\n    if (shift && event.shiftKey)\n        name = \"Shift-\" + name;\n    return name;\n}\n/**\nCreate a keymap plugin for the given set of bindings.\n\nBindings should map key names to [command](https://prosemirror.net/docs/ref/#commands)-style\nfunctions, which will be called with `(EditorState, dispatch,\nEditorView)` arguments, and should return true when they've handled\nthe key. Note that the view argument isn't part of the command\nprotocol, but can be used as an escape hatch if a binding needs to\ndirectly interact with the UI.\n\nKey names may be strings like `\"Shift-Ctrl-Enter\"`—a key\nidentifier prefixed with zero or more modifiers. Key identifiers\nare based on the strings that can appear in\n[`KeyEvent.key`](https:developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key).\nUse lowercase letters to refer to letter keys (or uppercase letters\nif you want shift to be held). You may use `\"Space\"` as an alias\nfor the `\" \"` name.\n\nModifiers can be given in any order. `Shift-` (or `s-`), `Alt-` (or\n`a-`), `Ctrl-` (or `c-` or `Control-`) and `Cmd-` (or `m-` or\n`Meta-`) are recognized. For characters that are created by holding\nshift, the `Shift-` prefix is implied, and should not be added\nexplicitly.\n\nYou can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on\nother platforms.\n\nYou can add multiple keymap plugins to an editor. The order in\nwhich they appear determines their precedence (the ones early in\nthe array get to dispatch first).\n*/\nfunction keymap(bindings) {\n    return new Plugin({ props: { handleKeyDown: keydownHandler(bindings) } });\n}\n/**\nGiven a set of bindings (using the same format as\n[`keymap`](https://prosemirror.net/docs/ref/#keymap.keymap)), return a [keydown\nhandler](https://prosemirror.net/docs/ref/#view.EditorProps.handleKeyDown) that handles them.\n*/\nfunction keydownHandler(bindings) {\n    let map = normalize(bindings);\n    return function (view, event) {\n        let name = keyName(event), baseName, direct = map[modifiers(name, event)];\n        if (direct && direct(view.state, view.dispatch, view))\n            return true;\n        // A character key\n        if (name.length == 1 && name != \" \") {\n            if (event.shiftKey) {\n                // In case the name was already modified by shift, try looking\n                // it up without its shift modifier\n                let noShift = map[modifiers(name, event, false)];\n                if (noShift && noShift(view.state, view.dispatch, view))\n                    return true;\n            }\n            if ((event.shiftKey || event.altKey || event.metaKey || name.charCodeAt(0) > 127) &&\n                (baseName = base[event.keyCode]) && baseName != name) {\n                // Try falling back to the keyCode when there's a modifier\n                // active or the character produced isn't ASCII, and our table\n                // produces a different name from the the keyCode. See #668,\n                // #1060\n                let fromCode = map[modifiers(baseName, event)];\n                if (fromCode && fromCode(view.state, view.dispatch, view))\n                    return true;\n            }\n        }\n        return false;\n    };\n}\n\nexport { keydownHandler, keymap };\n","// ::- Persistent data structure representing an ordered mapping from\n// strings to values, with some convenient update methods.\nfunction OrderedMap(content) {\n  this.content = content;\n}\n\nOrderedMap.prototype = {\n  constructor: OrderedMap,\n\n  find: function(key) {\n    for (var i = 0; i < this.content.length; i += 2)\n      if (this.content[i] === key) return i\n    return -1\n  },\n\n  // :: (string) → ?any\n  // Retrieve the value stored under `key`, or return undefined when\n  // no such key exists.\n  get: function(key) {\n    var found = this.find(key);\n    return found == -1 ? undefined : this.content[found + 1]\n  },\n\n  // :: (string, any, ?string) → OrderedMap\n  // Create a new map by replacing the value of `key` with a new\n  // value, or adding a binding to the end of the map. If `newKey` is\n  // given, the key of the binding will be replaced with that key.\n  update: function(key, value, newKey) {\n    var self = newKey && newKey != key ? this.remove(newKey) : this;\n    var found = self.find(key), content = self.content.slice();\n    if (found == -1) {\n      content.push(newKey || key, value);\n    } else {\n      content[found + 1] = value;\n      if (newKey) content[found] = newKey;\n    }\n    return new OrderedMap(content)\n  },\n\n  // :: (string) → OrderedMap\n  // Return a map with the given key removed, if it existed.\n  remove: function(key) {\n    var found = this.find(key);\n    if (found == -1) return this\n    var content = this.content.slice();\n    content.splice(found, 2);\n    return new OrderedMap(content)\n  },\n\n  // :: (string, any) → OrderedMap\n  // Add a new key to the start of the map.\n  addToStart: function(key, value) {\n    return new OrderedMap([key, value].concat(this.remove(key).content))\n  },\n\n  // :: (string, any) → OrderedMap\n  // Add a new key to the end of the map.\n  addToEnd: function(key, value) {\n    var content = this.remove(key).content.slice();\n    content.push(key, value);\n    return new OrderedMap(content)\n  },\n\n  // :: (string, string, any) → OrderedMap\n  // Add a key after the given key. If `place` is not found, the new\n  // key is added to the end.\n  addBefore: function(place, key, value) {\n    var without = this.remove(key), content = without.content.slice();\n    var found = without.find(place);\n    content.splice(found == -1 ? content.length : found, 0, key, value);\n    return new OrderedMap(content)\n  },\n\n  // :: ((key: string, value: any))\n  // Call the given function for each key/value pair in the map, in\n  // order.\n  forEach: function(f) {\n    for (var i = 0; i < this.content.length; i += 2)\n      f(this.content[i], this.content[i + 1]);\n  },\n\n  // :: (union<Object, OrderedMap>) → OrderedMap\n  // Create a new map by prepending the keys in this map that don't\n  // appear in `map` before the keys in `map`.\n  prepend: function(map) {\n    map = OrderedMap.from(map);\n    if (!map.size) return this\n    return new OrderedMap(map.content.concat(this.subtract(map).content))\n  },\n\n  // :: (union<Object, OrderedMap>) → OrderedMap\n  // Create a new map by appending the keys in this map that don't\n  // appear in `map` after the keys in `map`.\n  append: function(map) {\n    map = OrderedMap.from(map);\n    if (!map.size) return this\n    return new OrderedMap(this.subtract(map).content.concat(map.content))\n  },\n\n  // :: (union<Object, OrderedMap>) → OrderedMap\n  // Create a map containing all the keys in this map that don't\n  // appear in `map`.\n  subtract: function(map) {\n    var result = this;\n    map = OrderedMap.from(map);\n    for (var i = 0; i < map.content.length; i += 2)\n      result = result.remove(map.content[i]);\n    return result\n  },\n\n  // :: () → Object\n  // Turn ordered map into a plain object.\n  toObject: function() {\n    var result = {};\n    this.forEach(function(key, value) { result[key] = value; });\n    return result\n  },\n\n  // :: number\n  // The amount of keys in this map.\n  get size() {\n    return this.content.length >> 1\n  }\n};\n\n// :: (?union<Object, OrderedMap>) → OrderedMap\n// Return a map with the given content. If null, create an empty\n// map. If given an ordered map, return that map itself. If given an\n// object, create a map from the object's properties.\nOrderedMap.from = function(value) {\n  if (value instanceof OrderedMap) return value\n  var content = [];\n  if (value) for (var prop in value) content.push(prop, value[prop]);\n  return new OrderedMap(content)\n};\n\nexport default OrderedMap;\n","import OrderedMap from 'orderedmap';\n\nfunction findDiffStart(a, b, pos) {\n    for (let i = 0;; i++) {\n        if (i == a.childCount || i == b.childCount)\n            return a.childCount == b.childCount ? null : pos;\n        let childA = a.child(i), childB = b.child(i);\n        if (childA == childB) {\n            pos += childA.nodeSize;\n            continue;\n        }\n        if (!childA.sameMarkup(childB))\n            return pos;\n        if (childA.isText && childA.text != childB.text) {\n            for (let j = 0; childA.text[j] == childB.text[j]; j++)\n                pos++;\n            return pos;\n        }\n        if (childA.content.size || childB.content.size) {\n            let inner = findDiffStart(childA.content, childB.content, pos + 1);\n            if (inner != null)\n                return inner;\n        }\n        pos += childA.nodeSize;\n    }\n}\nfunction findDiffEnd(a, b, posA, posB) {\n    for (let iA = a.childCount, iB = b.childCount;;) {\n        if (iA == 0 || iB == 0)\n            return iA == iB ? null : { a: posA, b: posB };\n        let childA = a.child(--iA), childB = b.child(--iB), size = childA.nodeSize;\n        if (childA == childB) {\n            posA -= size;\n            posB -= size;\n            continue;\n        }\n        if (!childA.sameMarkup(childB))\n            return { a: posA, b: posB };\n        if (childA.isText && childA.text != childB.text) {\n            let same = 0, minSize = Math.min(childA.text.length, childB.text.length);\n            while (same < minSize && childA.text[childA.text.length - same - 1] == childB.text[childB.text.length - same - 1]) {\n                same++;\n                posA--;\n                posB--;\n            }\n            return { a: posA, b: posB };\n        }\n        if (childA.content.size || childB.content.size) {\n            let inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1);\n            if (inner)\n                return inner;\n        }\n        posA -= size;\n        posB -= size;\n    }\n}\n\n/**\nA fragment represents a node's collection of child nodes.\n\nLike nodes, fragments are persistent data structures, and you\nshould not mutate them or their content. Rather, you create new\ninstances whenever needed. The API tries to make this easy.\n*/\nclass Fragment {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    @internal\n    */\n    content, size) {\n        this.content = content;\n        this.size = size || 0;\n        if (size == null)\n            for (let i = 0; i < content.length; i++)\n                this.size += content[i].nodeSize;\n    }\n    /**\n    Invoke a callback for all descendant nodes between the given two\n    positions (relative to start of this fragment). Doesn't descend\n    into a node when the callback returns `false`.\n    */\n    nodesBetween(from, to, f, nodeStart = 0, parent) {\n        for (let i = 0, pos = 0; pos < to; i++) {\n            let child = this.content[i], end = pos + child.nodeSize;\n            if (end > from && f(child, nodeStart + pos, parent || null, i) !== false && child.content.size) {\n                let start = pos + 1;\n                child.nodesBetween(Math.max(0, from - start), Math.min(child.content.size, to - start), f, nodeStart + start);\n            }\n            pos = end;\n        }\n    }\n    /**\n    Call the given callback for every descendant node. `pos` will be\n    relative to the start of the fragment. The callback may return\n    `false` to prevent traversal of a given node's children.\n    */\n    descendants(f) {\n        this.nodesBetween(0, this.size, f);\n    }\n    /**\n    Extract the text between `from` and `to`. See the same method on\n    [`Node`](https://prosemirror.net/docs/ref/#model.Node.textBetween).\n    */\n    textBetween(from, to, blockSeparator, leafText) {\n        let text = \"\", first = true;\n        this.nodesBetween(from, to, (node, pos) => {\n            let nodeText = node.isText ? node.text.slice(Math.max(from, pos) - pos, to - pos)\n                : !node.isLeaf ? \"\"\n                    : leafText ? (typeof leafText === \"function\" ? leafText(node) : leafText)\n                        : node.type.spec.leafText ? node.type.spec.leafText(node)\n                            : \"\";\n            if (node.isBlock && (node.isLeaf && nodeText || node.isTextblock) && blockSeparator) {\n                if (first)\n                    first = false;\n                else\n                    text += blockSeparator;\n            }\n            text += nodeText;\n        }, 0);\n        return text;\n    }\n    /**\n    Create a new fragment containing the combined content of this\n    fragment and the other.\n    */\n    append(other) {\n        if (!other.size)\n            return this;\n        if (!this.size)\n            return other;\n        let last = this.lastChild, first = other.firstChild, content = this.content.slice(), i = 0;\n        if (last.isText && last.sameMarkup(first)) {\n            content[content.length - 1] = last.withText(last.text + first.text);\n            i = 1;\n        }\n        for (; i < other.content.length; i++)\n            content.push(other.content[i]);\n        return new Fragment(content, this.size + other.size);\n    }\n    /**\n    Cut out the sub-fragment between the two given positions.\n    */\n    cut(from, to = this.size) {\n        if (from == 0 && to == this.size)\n            return this;\n        let result = [], size = 0;\n        if (to > from)\n            for (let i = 0, pos = 0; pos < to; i++) {\n                let child = this.content[i], end = pos + child.nodeSize;\n                if (end > from) {\n                    if (pos < from || end > to) {\n                        if (child.isText)\n                            child = child.cut(Math.max(0, from - pos), Math.min(child.text.length, to - pos));\n                        else\n                            child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1));\n                    }\n                    result.push(child);\n                    size += child.nodeSize;\n                }\n                pos = end;\n            }\n        return new Fragment(result, size);\n    }\n    /**\n    @internal\n    */\n    cutByIndex(from, to) {\n        if (from == to)\n            return Fragment.empty;\n        if (from == 0 && to == this.content.length)\n            return this;\n        return new Fragment(this.content.slice(from, to));\n    }\n    /**\n    Create a new fragment in which the node at the given index is\n    replaced by the given node.\n    */\n    replaceChild(index, node) {\n        let current = this.content[index];\n        if (current == node)\n            return this;\n        let copy = this.content.slice();\n        let size = this.size + node.nodeSize - current.nodeSize;\n        copy[index] = node;\n        return new Fragment(copy, size);\n    }\n    /**\n    Create a new fragment by prepending the given node to this\n    fragment.\n    */\n    addToStart(node) {\n        return new Fragment([node].concat(this.content), this.size + node.nodeSize);\n    }\n    /**\n    Create a new fragment by appending the given node to this\n    fragment.\n    */\n    addToEnd(node) {\n        return new Fragment(this.content.concat(node), this.size + node.nodeSize);\n    }\n    /**\n    Compare this fragment to another one.\n    */\n    eq(other) {\n        if (this.content.length != other.content.length)\n            return false;\n        for (let i = 0; i < this.content.length; i++)\n            if (!this.content[i].eq(other.content[i]))\n                return false;\n        return true;\n    }\n    /**\n    The first child of the fragment, or `null` if it is empty.\n    */\n    get firstChild() { return this.content.length ? this.content[0] : null; }\n    /**\n    The last child of the fragment, or `null` if it is empty.\n    */\n    get lastChild() { return this.content.length ? this.content[this.content.length - 1] : null; }\n    /**\n    The number of child nodes in this fragment.\n    */\n    get childCount() { return this.content.length; }\n    /**\n    Get the child node at the given index. Raise an error when the\n    index is out of range.\n    */\n    child(index) {\n        let found = this.content[index];\n        if (!found)\n            throw new RangeError(\"Index \" + index + \" out of range for \" + this);\n        return found;\n    }\n    /**\n    Get the child node at the given index, if it exists.\n    */\n    maybeChild(index) {\n        return this.content[index] || null;\n    }\n    /**\n    Call `f` for every child node, passing the node, its offset\n    into this parent node, and its index.\n    */\n    forEach(f) {\n        for (let i = 0, p = 0; i < this.content.length; i++) {\n            let child = this.content[i];\n            f(child, p, i);\n            p += child.nodeSize;\n        }\n    }\n    /**\n    Find the first position at which this fragment and another\n    fragment differ, or `null` if they are the same.\n    */\n    findDiffStart(other, pos = 0) {\n        return findDiffStart(this, other, pos);\n    }\n    /**\n    Find the first position, searching from the end, at which this\n    fragment and the given fragment differ, or `null` if they are\n    the same. Since this position will not be the same in both\n    nodes, an object with two separate positions is returned.\n    */\n    findDiffEnd(other, pos = this.size, otherPos = other.size) {\n        return findDiffEnd(this, other, pos, otherPos);\n    }\n    /**\n    Find the index and inner offset corresponding to a given relative\n    position in this fragment. The result object will be reused\n    (overwritten) the next time the function is called. (Not public.)\n    */\n    findIndex(pos, round = -1) {\n        if (pos == 0)\n            return retIndex(0, pos);\n        if (pos == this.size)\n            return retIndex(this.content.length, pos);\n        if (pos > this.size || pos < 0)\n            throw new RangeError(`Position ${pos} outside of fragment (${this})`);\n        for (let i = 0, curPos = 0;; i++) {\n            let cur = this.child(i), end = curPos + cur.nodeSize;\n            if (end >= pos) {\n                if (end == pos || round > 0)\n                    return retIndex(i + 1, end);\n                return retIndex(i, curPos);\n            }\n            curPos = end;\n        }\n    }\n    /**\n    Return a debugging string that describes this fragment.\n    */\n    toString() { return \"<\" + this.toStringInner() + \">\"; }\n    /**\n    @internal\n    */\n    toStringInner() { return this.content.join(\", \"); }\n    /**\n    Create a JSON-serializeable representation of this fragment.\n    */\n    toJSON() {\n        return this.content.length ? this.content.map(n => n.toJSON()) : null;\n    }\n    /**\n    Deserialize a fragment from its JSON representation.\n    */\n    static fromJSON(schema, value) {\n        if (!value)\n            return Fragment.empty;\n        if (!Array.isArray(value))\n            throw new RangeError(\"Invalid input for Fragment.fromJSON\");\n        return new Fragment(value.map(schema.nodeFromJSON));\n    }\n    /**\n    Build a fragment from an array of nodes. Ensures that adjacent\n    text nodes with the same marks are joined together.\n    */\n    static fromArray(array) {\n        if (!array.length)\n            return Fragment.empty;\n        let joined, size = 0;\n        for (let i = 0; i < array.length; i++) {\n            let node = array[i];\n            size += node.nodeSize;\n            if (i && node.isText && array[i - 1].sameMarkup(node)) {\n                if (!joined)\n                    joined = array.slice(0, i);\n                joined[joined.length - 1] = node\n                    .withText(joined[joined.length - 1].text + node.text);\n            }\n            else if (joined) {\n                joined.push(node);\n            }\n        }\n        return new Fragment(joined || array, size);\n    }\n    /**\n    Create a fragment from something that can be interpreted as a\n    set of nodes. For `null`, it returns the empty fragment. For a\n    fragment, the fragment itself. For a node or array of nodes, a\n    fragment containing those nodes.\n    */\n    static from(nodes) {\n        if (!nodes)\n            return Fragment.empty;\n        if (nodes instanceof Fragment)\n            return nodes;\n        if (Array.isArray(nodes))\n            return this.fromArray(nodes);\n        if (nodes.attrs)\n            return new Fragment([nodes], nodes.nodeSize);\n        throw new RangeError(\"Can not convert \" + nodes + \" to a Fragment\" +\n            (nodes.nodesBetween ? \" (looks like multiple versions of prosemirror-model were loaded)\" : \"\"));\n    }\n}\n/**\nAn empty fragment. Intended to be reused whenever a node doesn't\ncontain anything (rather than allocating a new empty fragment for\neach leaf node).\n*/\nFragment.empty = new Fragment([], 0);\nconst found = { index: 0, offset: 0 };\nfunction retIndex(index, offset) {\n    found.index = index;\n    found.offset = offset;\n    return found;\n}\n\nfunction compareDeep(a, b) {\n    if (a === b)\n        return true;\n    if (!(a && typeof a == \"object\") ||\n        !(b && typeof b == \"object\"))\n        return false;\n    let array = Array.isArray(a);\n    if (Array.isArray(b) != array)\n        return false;\n    if (array) {\n        if (a.length != b.length)\n            return false;\n        for (let i = 0; i < a.length; i++)\n            if (!compareDeep(a[i], b[i]))\n                return false;\n    }\n    else {\n        for (let p in a)\n            if (!(p in b) || !compareDeep(a[p], b[p]))\n                return false;\n        for (let p in b)\n            if (!(p in a))\n                return false;\n    }\n    return true;\n}\n\n/**\nA mark is a piece of information that can be attached to a node,\nsuch as it being emphasized, in code font, or a link. It has a\ntype and optionally a set of attributes that provide further\ninformation (such as the target of the link). Marks are created\nthrough a `Schema`, which controls which types exist and which\nattributes they have.\n*/\nclass Mark {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The type of this mark.\n    */\n    type, \n    /**\n    The attributes associated with this mark.\n    */\n    attrs) {\n        this.type = type;\n        this.attrs = attrs;\n    }\n    /**\n    Given a set of marks, create a new set which contains this one as\n    well, in the right position. If this mark is already in the set,\n    the set itself is returned. If any marks that are set to be\n    [exclusive](https://prosemirror.net/docs/ref/#model.MarkSpec.excludes) with this mark are present,\n    those are replaced by this one.\n    */\n    addToSet(set) {\n        let copy, placed = false;\n        for (let i = 0; i < set.length; i++) {\n            let other = set[i];\n            if (this.eq(other))\n                return set;\n            if (this.type.excludes(other.type)) {\n                if (!copy)\n                    copy = set.slice(0, i);\n            }\n            else if (other.type.excludes(this.type)) {\n                return set;\n            }\n            else {\n                if (!placed && other.type.rank > this.type.rank) {\n                    if (!copy)\n                        copy = set.slice(0, i);\n                    copy.push(this);\n                    placed = true;\n                }\n                if (copy)\n                    copy.push(other);\n            }\n        }\n        if (!copy)\n            copy = set.slice();\n        if (!placed)\n            copy.push(this);\n        return copy;\n    }\n    /**\n    Remove this mark from the given set, returning a new set. If this\n    mark is not in the set, the set itself is returned.\n    */\n    removeFromSet(set) {\n        for (let i = 0; i < set.length; i++)\n            if (this.eq(set[i]))\n                return set.slice(0, i).concat(set.slice(i + 1));\n        return set;\n    }\n    /**\n    Test whether this mark is in the given set of marks.\n    */\n    isInSet(set) {\n        for (let i = 0; i < set.length; i++)\n            if (this.eq(set[i]))\n                return true;\n        return false;\n    }\n    /**\n    Test whether this mark has the same type and attributes as\n    another mark.\n    */\n    eq(other) {\n        return this == other ||\n            (this.type == other.type && compareDeep(this.attrs, other.attrs));\n    }\n    /**\n    Convert this mark to a JSON-serializeable representation.\n    */\n    toJSON() {\n        let obj = { type: this.type.name };\n        for (let _ in this.attrs) {\n            obj.attrs = this.attrs;\n            break;\n        }\n        return obj;\n    }\n    /**\n    Deserialize a mark from JSON.\n    */\n    static fromJSON(schema, json) {\n        if (!json)\n            throw new RangeError(\"Invalid input for Mark.fromJSON\");\n        let type = schema.marks[json.type];\n        if (!type)\n            throw new RangeError(`There is no mark type ${json.type} in this schema`);\n        return type.create(json.attrs);\n    }\n    /**\n    Test whether two sets of marks are identical.\n    */\n    static sameSet(a, b) {\n        if (a == b)\n            return true;\n        if (a.length != b.length)\n            return false;\n        for (let i = 0; i < a.length; i++)\n            if (!a[i].eq(b[i]))\n                return false;\n        return true;\n    }\n    /**\n    Create a properly sorted mark set from null, a single mark, or an\n    unsorted array of marks.\n    */\n    static setFrom(marks) {\n        if (!marks || Array.isArray(marks) && marks.length == 0)\n            return Mark.none;\n        if (marks instanceof Mark)\n            return [marks];\n        let copy = marks.slice();\n        copy.sort((a, b) => a.type.rank - b.type.rank);\n        return copy;\n    }\n}\n/**\nThe empty set of marks.\n*/\nMark.none = [];\n\n/**\nError type raised by [`Node.replace`](https://prosemirror.net/docs/ref/#model.Node.replace) when\ngiven an invalid replacement.\n*/\nclass ReplaceError extends Error {\n}\n/*\nReplaceError = function(this: any, message: string) {\n  let err = Error.call(this, message)\n  ;(err as any).__proto__ = ReplaceError.prototype\n  return err\n} as any\n\nReplaceError.prototype = Object.create(Error.prototype)\nReplaceError.prototype.constructor = ReplaceError\nReplaceError.prototype.name = \"ReplaceError\"\n*/\n/**\nA slice represents a piece cut out of a larger document. It\nstores not only a fragment, but also the depth up to which nodes on\nboth side are ‘open’ (cut through).\n*/\nclass Slice {\n    /**\n    Create a slice. When specifying a non-zero open depth, you must\n    make sure that there are nodes of at least that depth at the\n    appropriate side of the fragment—i.e. if the fragment is an\n    empty paragraph node, `openStart` and `openEnd` can't be greater\n    than 1.\n    \n    It is not necessary for the content of open nodes to conform to\n    the schema's content constraints, though it should be a valid\n    start/end/middle for such a node, depending on which sides are\n    open.\n    */\n    constructor(\n    /**\n    The slice's content.\n    */\n    content, \n    /**\n    The open depth at the start of the fragment.\n    */\n    openStart, \n    /**\n    The open depth at the end.\n    */\n    openEnd) {\n        this.content = content;\n        this.openStart = openStart;\n        this.openEnd = openEnd;\n    }\n    /**\n    The size this slice would add when inserted into a document.\n    */\n    get size() {\n        return this.content.size - this.openStart - this.openEnd;\n    }\n    /**\n    @internal\n    */\n    insertAt(pos, fragment) {\n        let content = insertInto(this.content, pos + this.openStart, fragment);\n        return content && new Slice(content, this.openStart, this.openEnd);\n    }\n    /**\n    @internal\n    */\n    removeBetween(from, to) {\n        return new Slice(removeRange(this.content, from + this.openStart, to + this.openStart), this.openStart, this.openEnd);\n    }\n    /**\n    Tests whether this slice is equal to another slice.\n    */\n    eq(other) {\n        return this.content.eq(other.content) && this.openStart == other.openStart && this.openEnd == other.openEnd;\n    }\n    /**\n    @internal\n    */\n    toString() {\n        return this.content + \"(\" + this.openStart + \",\" + this.openEnd + \")\";\n    }\n    /**\n    Convert a slice to a JSON-serializable representation.\n    */\n    toJSON() {\n        if (!this.content.size)\n            return null;\n        let json = { content: this.content.toJSON() };\n        if (this.openStart > 0)\n            json.openStart = this.openStart;\n        if (this.openEnd > 0)\n            json.openEnd = this.openEnd;\n        return json;\n    }\n    /**\n    Deserialize a slice from its JSON representation.\n    */\n    static fromJSON(schema, json) {\n        if (!json)\n            return Slice.empty;\n        let openStart = json.openStart || 0, openEnd = json.openEnd || 0;\n        if (typeof openStart != \"number\" || typeof openEnd != \"number\")\n            throw new RangeError(\"Invalid input for Slice.fromJSON\");\n        return new Slice(Fragment.fromJSON(schema, json.content), openStart, openEnd);\n    }\n    /**\n    Create a slice from a fragment by taking the maximum possible\n    open value on both side of the fragment.\n    */\n    static maxOpen(fragment, openIsolating = true) {\n        let openStart = 0, openEnd = 0;\n        for (let n = fragment.firstChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.firstChild)\n            openStart++;\n        for (let n = fragment.lastChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.lastChild)\n            openEnd++;\n        return new Slice(fragment, openStart, openEnd);\n    }\n}\n/**\nThe empty slice.\n*/\nSlice.empty = new Slice(Fragment.empty, 0, 0);\nfunction removeRange(content, from, to) {\n    let { index, offset } = content.findIndex(from), child = content.maybeChild(index);\n    let { index: indexTo, offset: offsetTo } = content.findIndex(to);\n    if (offset == from || child.isText) {\n        if (offsetTo != to && !content.child(indexTo).isText)\n            throw new RangeError(\"Removing non-flat range\");\n        return content.cut(0, from).append(content.cut(to));\n    }\n    if (index != indexTo)\n        throw new RangeError(\"Removing non-flat range\");\n    return content.replaceChild(index, child.copy(removeRange(child.content, from - offset - 1, to - offset - 1)));\n}\nfunction insertInto(content, dist, insert, parent) {\n    let { index, offset } = content.findIndex(dist), child = content.maybeChild(index);\n    if (offset == dist || child.isText) {\n        if (parent && !parent.canReplace(index, index, insert))\n            return null;\n        return content.cut(0, dist).append(insert).append(content.cut(dist));\n    }\n    let inner = insertInto(child.content, dist - offset - 1, insert);\n    return inner && content.replaceChild(index, child.copy(inner));\n}\nfunction replace($from, $to, slice) {\n    if (slice.openStart > $from.depth)\n        throw new ReplaceError(\"Inserted content deeper than insertion position\");\n    if ($from.depth - slice.openStart != $to.depth - slice.openEnd)\n        throw new ReplaceError(\"Inconsistent open depths\");\n    return replaceOuter($from, $to, slice, 0);\n}\nfunction replaceOuter($from, $to, slice, depth) {\n    let index = $from.index(depth), node = $from.node(depth);\n    if (index == $to.index(depth) && depth < $from.depth - slice.openStart) {\n        let inner = replaceOuter($from, $to, slice, depth + 1);\n        return node.copy(node.content.replaceChild(index, inner));\n    }\n    else if (!slice.content.size) {\n        return close(node, replaceTwoWay($from, $to, depth));\n    }\n    else if (!slice.openStart && !slice.openEnd && $from.depth == depth && $to.depth == depth) { // Simple, flat case\n        let parent = $from.parent, content = parent.content;\n        return close(parent, content.cut(0, $from.parentOffset).append(slice.content).append(content.cut($to.parentOffset)));\n    }\n    else {\n        let { start, end } = prepareSliceForReplace(slice, $from);\n        return close(node, replaceThreeWay($from, start, end, $to, depth));\n    }\n}\nfunction checkJoin(main, sub) {\n    if (!sub.type.compatibleContent(main.type))\n        throw new ReplaceError(\"Cannot join \" + sub.type.name + \" onto \" + main.type.name);\n}\nfunction joinable($before, $after, depth) {\n    let node = $before.node(depth);\n    checkJoin(node, $after.node(depth));\n    return node;\n}\nfunction addNode(child, target) {\n    let last = target.length - 1;\n    if (last >= 0 && child.isText && child.sameMarkup(target[last]))\n        target[last] = child.withText(target[last].text + child.text);\n    else\n        target.push(child);\n}\nfunction addRange($start, $end, depth, target) {\n    let node = ($end || $start).node(depth);\n    let startIndex = 0, endIndex = $end ? $end.index(depth) : node.childCount;\n    if ($start) {\n        startIndex = $start.index(depth);\n        if ($start.depth > depth) {\n            startIndex++;\n        }\n        else if ($start.textOffset) {\n            addNode($start.nodeAfter, target);\n            startIndex++;\n        }\n    }\n    for (let i = startIndex; i < endIndex; i++)\n        addNode(node.child(i), target);\n    if ($end && $end.depth == depth && $end.textOffset)\n        addNode($end.nodeBefore, target);\n}\nfunction close(node, content) {\n    node.type.checkContent(content);\n    return node.copy(content);\n}\nfunction replaceThreeWay($from, $start, $end, $to, depth) {\n    let openStart = $from.depth > depth && joinable($from, $start, depth + 1);\n    let openEnd = $to.depth > depth && joinable($end, $to, depth + 1);\n    let content = [];\n    addRange(null, $from, depth, content);\n    if (openStart && openEnd && $start.index(depth) == $end.index(depth)) {\n        checkJoin(openStart, openEnd);\n        addNode(close(openStart, replaceThreeWay($from, $start, $end, $to, depth + 1)), content);\n    }\n    else {\n        if (openStart)\n            addNode(close(openStart, replaceTwoWay($from, $start, depth + 1)), content);\n        addRange($start, $end, depth, content);\n        if (openEnd)\n            addNode(close(openEnd, replaceTwoWay($end, $to, depth + 1)), content);\n    }\n    addRange($to, null, depth, content);\n    return new Fragment(content);\n}\nfunction replaceTwoWay($from, $to, depth) {\n    let content = [];\n    addRange(null, $from, depth, content);\n    if ($from.depth > depth) {\n        let type = joinable($from, $to, depth + 1);\n        addNode(close(type, replaceTwoWay($from, $to, depth + 1)), content);\n    }\n    addRange($to, null, depth, content);\n    return new Fragment(content);\n}\nfunction prepareSliceForReplace(slice, $along) {\n    let extra = $along.depth - slice.openStart, parent = $along.node(extra);\n    let node = parent.copy(slice.content);\n    for (let i = extra - 1; i >= 0; i--)\n        node = $along.node(i).copy(Fragment.from(node));\n    return { start: node.resolveNoCache(slice.openStart + extra),\n        end: node.resolveNoCache(node.content.size - slice.openEnd - extra) };\n}\n\n/**\nYou can [_resolve_](https://prosemirror.net/docs/ref/#model.Node.resolve) a position to get more\ninformation about it. Objects of this class represent such a\nresolved position, providing various pieces of context\ninformation, and some helper methods.\n\nThroughout this interface, methods that take an optional `depth`\nparameter will interpret undefined as `this.depth` and negative\nnumbers as `this.depth + value`.\n*/\nclass ResolvedPos {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The position that was resolved.\n    */\n    pos, \n    /**\n    @internal\n    */\n    path, \n    /**\n    The offset this position has into its parent node.\n    */\n    parentOffset) {\n        this.pos = pos;\n        this.path = path;\n        this.parentOffset = parentOffset;\n        this.depth = path.length / 3 - 1;\n    }\n    /**\n    @internal\n    */\n    resolveDepth(val) {\n        if (val == null)\n            return this.depth;\n        if (val < 0)\n            return this.depth + val;\n        return val;\n    }\n    /**\n    The parent node that the position points into. Note that even if\n    a position points into a text node, that node is not considered\n    the parent—text nodes are ‘flat’ in this model, and have no content.\n    */\n    get parent() { return this.node(this.depth); }\n    /**\n    The root node in which the position was resolved.\n    */\n    get doc() { return this.node(0); }\n    /**\n    The ancestor node at the given level. `p.node(p.depth)` is the\n    same as `p.parent`.\n    */\n    node(depth) { return this.path[this.resolveDepth(depth) * 3]; }\n    /**\n    The index into the ancestor at the given level. If this points\n    at the 3rd node in the 2nd paragraph on the top level, for\n    example, `p.index(0)` is 1 and `p.index(1)` is 2.\n    */\n    index(depth) { return this.path[this.resolveDepth(depth) * 3 + 1]; }\n    /**\n    The index pointing after this position into the ancestor at the\n    given level.\n    */\n    indexAfter(depth) {\n        depth = this.resolveDepth(depth);\n        return this.index(depth) + (depth == this.depth && !this.textOffset ? 0 : 1);\n    }\n    /**\n    The (absolute) position at the start of the node at the given\n    level.\n    */\n    start(depth) {\n        depth = this.resolveDepth(depth);\n        return depth == 0 ? 0 : this.path[depth * 3 - 1] + 1;\n    }\n    /**\n    The (absolute) position at the end of the node at the given\n    level.\n    */\n    end(depth) {\n        depth = this.resolveDepth(depth);\n        return this.start(depth) + this.node(depth).content.size;\n    }\n    /**\n    The (absolute) position directly before the wrapping node at the\n    given level, or, when `depth` is `this.depth + 1`, the original\n    position.\n    */\n    before(depth) {\n        depth = this.resolveDepth(depth);\n        if (!depth)\n            throw new RangeError(\"There is no position before the top-level node\");\n        return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1];\n    }\n    /**\n    The (absolute) position directly after the wrapping node at the\n    given level, or the original position when `depth` is `this.depth + 1`.\n    */\n    after(depth) {\n        depth = this.resolveDepth(depth);\n        if (!depth)\n            throw new RangeError(\"There is no position after the top-level node\");\n        return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1] + this.path[depth * 3].nodeSize;\n    }\n    /**\n    When this position points into a text node, this returns the\n    distance between the position and the start of the text node.\n    Will be zero for positions that point between nodes.\n    */\n    get textOffset() { return this.pos - this.path[this.path.length - 1]; }\n    /**\n    Get the node directly after the position, if any. If the position\n    points into a text node, only the part of that node after the\n    position is returned.\n    */\n    get nodeAfter() {\n        let parent = this.parent, index = this.index(this.depth);\n        if (index == parent.childCount)\n            return null;\n        let dOff = this.pos - this.path[this.path.length - 1], child = parent.child(index);\n        return dOff ? parent.child(index).cut(dOff) : child;\n    }\n    /**\n    Get the node directly before the position, if any. If the\n    position points into a text node, only the part of that node\n    before the position is returned.\n    */\n    get nodeBefore() {\n        let index = this.index(this.depth);\n        let dOff = this.pos - this.path[this.path.length - 1];\n        if (dOff)\n            return this.parent.child(index).cut(0, dOff);\n        return index == 0 ? null : this.parent.child(index - 1);\n    }\n    /**\n    Get the position at the given index in the parent node at the\n    given depth (which defaults to `this.depth`).\n    */\n    posAtIndex(index, depth) {\n        depth = this.resolveDepth(depth);\n        let node = this.path[depth * 3], pos = depth == 0 ? 0 : this.path[depth * 3 - 1] + 1;\n        for (let i = 0; i < index; i++)\n            pos += node.child(i).nodeSize;\n        return pos;\n    }\n    /**\n    Get the marks at this position, factoring in the surrounding\n    marks' [`inclusive`](https://prosemirror.net/docs/ref/#model.MarkSpec.inclusive) property. If the\n    position is at the start of a non-empty node, the marks of the\n    node after it (if any) are returned.\n    */\n    marks() {\n        let parent = this.parent, index = this.index();\n        // In an empty parent, return the empty array\n        if (parent.content.size == 0)\n            return Mark.none;\n        // When inside a text node, just return the text node's marks\n        if (this.textOffset)\n            return parent.child(index).marks;\n        let main = parent.maybeChild(index - 1), other = parent.maybeChild(index);\n        // If the `after` flag is true of there is no node before, make\n        // the node after this position the main reference.\n        if (!main) {\n            let tmp = main;\n            main = other;\n            other = tmp;\n        }\n        // Use all marks in the main node, except those that have\n        // `inclusive` set to false and are not present in the other node.\n        let marks = main.marks;\n        for (var i = 0; i < marks.length; i++)\n            if (marks[i].type.spec.inclusive === false && (!other || !marks[i].isInSet(other.marks)))\n                marks = marks[i--].removeFromSet(marks);\n        return marks;\n    }\n    /**\n    Get the marks after the current position, if any, except those\n    that are non-inclusive and not present at position `$end`. This\n    is mostly useful for getting the set of marks to preserve after a\n    deletion. Will return `null` if this position is at the end of\n    its parent node or its parent node isn't a textblock (in which\n    case no marks should be preserved).\n    */\n    marksAcross($end) {\n        let after = this.parent.maybeChild(this.index());\n        if (!after || !after.isInline)\n            return null;\n        let marks = after.marks, next = $end.parent.maybeChild($end.index());\n        for (var i = 0; i < marks.length; i++)\n            if (marks[i].type.spec.inclusive === false && (!next || !marks[i].isInSet(next.marks)))\n                marks = marks[i--].removeFromSet(marks);\n        return marks;\n    }\n    /**\n    The depth up to which this position and the given (non-resolved)\n    position share the same parent nodes.\n    */\n    sharedDepth(pos) {\n        for (let depth = this.depth; depth > 0; depth--)\n            if (this.start(depth) <= pos && this.end(depth) >= pos)\n                return depth;\n        return 0;\n    }\n    /**\n    Returns a range based on the place where this position and the\n    given position diverge around block content. If both point into\n    the same textblock, for example, a range around that textblock\n    will be returned. If they point into different blocks, the range\n    around those blocks in their shared ancestor is returned. You can\n    pass in an optional predicate that will be called with a parent\n    node to see if a range into that parent is acceptable.\n    */\n    blockRange(other = this, pred) {\n        if (other.pos < this.pos)\n            return other.blockRange(this);\n        for (let d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)\n            if (other.pos <= this.end(d) && (!pred || pred(this.node(d))))\n                return new NodeRange(this, other, d);\n        return null;\n    }\n    /**\n    Query whether the given position shares the same parent node.\n    */\n    sameParent(other) {\n        return this.pos - this.parentOffset == other.pos - other.parentOffset;\n    }\n    /**\n    Return the greater of this and the given position.\n    */\n    max(other) {\n        return other.pos > this.pos ? other : this;\n    }\n    /**\n    Return the smaller of this and the given position.\n    */\n    min(other) {\n        return other.pos < this.pos ? other : this;\n    }\n    /**\n    @internal\n    */\n    toString() {\n        let str = \"\";\n        for (let i = 1; i <= this.depth; i++)\n            str += (str ? \"/\" : \"\") + this.node(i).type.name + \"_\" + this.index(i - 1);\n        return str + \":\" + this.parentOffset;\n    }\n    /**\n    @internal\n    */\n    static resolve(doc, pos) {\n        if (!(pos >= 0 && pos <= doc.content.size))\n            throw new RangeError(\"Position \" + pos + \" out of range\");\n        let path = [];\n        let start = 0, parentOffset = pos;\n        for (let node = doc;;) {\n            let { index, offset } = node.content.findIndex(parentOffset);\n            let rem = parentOffset - offset;\n            path.push(node, index, start + offset);\n            if (!rem)\n                break;\n            node = node.child(index);\n            if (node.isText)\n                break;\n            parentOffset = rem - 1;\n            start += offset + 1;\n        }\n        return new ResolvedPos(pos, path, parentOffset);\n    }\n    /**\n    @internal\n    */\n    static resolveCached(doc, pos) {\n        for (let i = 0; i < resolveCache.length; i++) {\n            let cached = resolveCache[i];\n            if (cached.pos == pos && cached.doc == doc)\n                return cached;\n        }\n        let result = resolveCache[resolveCachePos] = ResolvedPos.resolve(doc, pos);\n        resolveCachePos = (resolveCachePos + 1) % resolveCacheSize;\n        return result;\n    }\n}\nlet resolveCache = [], resolveCachePos = 0, resolveCacheSize = 12;\n/**\nRepresents a flat range of content, i.e. one that starts and\nends in the same node.\n*/\nclass NodeRange {\n    /**\n    Construct a node range. `$from` and `$to` should point into the\n    same node until at least the given `depth`, since a node range\n    denotes an adjacent set of nodes in a single parent node.\n    */\n    constructor(\n    /**\n    A resolved position along the start of the content. May have a\n    `depth` greater than this object's `depth` property, since\n    these are the positions that were used to compute the range,\n    not re-resolved positions directly at its boundaries.\n    */\n    $from, \n    /**\n    A position along the end of the content. See\n    caveat for [`$from`](https://prosemirror.net/docs/ref/#model.NodeRange.$from).\n    */\n    $to, \n    /**\n    The depth of the node that this range points into.\n    */\n    depth) {\n        this.$from = $from;\n        this.$to = $to;\n        this.depth = depth;\n    }\n    /**\n    The position at the start of the range.\n    */\n    get start() { return this.$from.before(this.depth + 1); }\n    /**\n    The position at the end of the range.\n    */\n    get end() { return this.$to.after(this.depth + 1); }\n    /**\n    The parent node that the range points into.\n    */\n    get parent() { return this.$from.node(this.depth); }\n    /**\n    The start index of the range in the parent node.\n    */\n    get startIndex() { return this.$from.index(this.depth); }\n    /**\n    The end index of the range in the parent node.\n    */\n    get endIndex() { return this.$to.indexAfter(this.depth); }\n}\n\nconst emptyAttrs = Object.create(null);\n/**\nThis class represents a node in the tree that makes up a\nProseMirror document. So a document is an instance of `Node`, with\nchildren that are also instances of `Node`.\n\nNodes are persistent data structures. Instead of changing them, you\ncreate new ones with the content you want. Old ones keep pointing\nat the old document shape. This is made cheaper by sharing\nstructure between the old and new data as much as possible, which a\ntree shape like this (without back pointers) makes easy.\n\n**Do not** directly mutate the properties of a `Node` object. See\n[the guide](/docs/guide/#doc) for more information.\n*/\nclass Node {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The type of node that this is.\n    */\n    type, \n    /**\n    An object mapping attribute names to values. The kind of\n    attributes allowed and required are\n    [determined](https://prosemirror.net/docs/ref/#model.NodeSpec.attrs) by the node type.\n    */\n    attrs, \n    // A fragment holding the node's children.\n    content, \n    /**\n    The marks (things like whether it is emphasized or part of a\n    link) applied to this node.\n    */\n    marks = Mark.none) {\n        this.type = type;\n        this.attrs = attrs;\n        this.marks = marks;\n        this.content = content || Fragment.empty;\n    }\n    /**\n    The size of this node, as defined by the integer-based [indexing\n    scheme](/docs/guide/#doc.indexing). For text nodes, this is the\n    amount of characters. For other leaf nodes, it is one. For\n    non-leaf nodes, it is the size of the content plus two (the\n    start and end token).\n    */\n    get nodeSize() { return this.isLeaf ? 1 : 2 + this.content.size; }\n    /**\n    The number of children that the node has.\n    */\n    get childCount() { return this.content.childCount; }\n    /**\n    Get the child node at the given index. Raises an error when the\n    index is out of range.\n    */\n    child(index) { return this.content.child(index); }\n    /**\n    Get the child node at the given index, if it exists.\n    */\n    maybeChild(index) { return this.content.maybeChild(index); }\n    /**\n    Call `f` for every child node, passing the node, its offset\n    into this parent node, and its index.\n    */\n    forEach(f) { this.content.forEach(f); }\n    /**\n    Invoke a callback for all descendant nodes recursively between\n    the given two positions that are relative to start of this\n    node's content. The callback is invoked with the node, its\n    position relative to the original node (method receiver),\n    its parent node, and its child index. When the callback returns\n    false for a given node, that node's children will not be\n    recursed over. The last parameter can be used to specify a\n    starting position to count from.\n    */\n    nodesBetween(from, to, f, startPos = 0) {\n        this.content.nodesBetween(from, to, f, startPos, this);\n    }\n    /**\n    Call the given callback for every descendant node. Doesn't\n    descend into a node when the callback returns `false`.\n    */\n    descendants(f) {\n        this.nodesBetween(0, this.content.size, f);\n    }\n    /**\n    Concatenates all the text nodes found in this fragment and its\n    children.\n    */\n    get textContent() {\n        return (this.isLeaf && this.type.spec.leafText)\n            ? this.type.spec.leafText(this)\n            : this.textBetween(0, this.content.size, \"\");\n    }\n    /**\n    Get all text between positions `from` and `to`. When\n    `blockSeparator` is given, it will be inserted to separate text\n    from different block nodes. If `leafText` is given, it'll be\n    inserted for every non-text leaf node encountered, otherwise\n    [`leafText`](https://prosemirror.net/docs/ref/#model.NodeSpec^leafText) will be used.\n    */\n    textBetween(from, to, blockSeparator, leafText) {\n        return this.content.textBetween(from, to, blockSeparator, leafText);\n    }\n    /**\n    Returns this node's first child, or `null` if there are no\n    children.\n    */\n    get firstChild() { return this.content.firstChild; }\n    /**\n    Returns this node's last child, or `null` if there are no\n    children.\n    */\n    get lastChild() { return this.content.lastChild; }\n    /**\n    Test whether two nodes represent the same piece of document.\n    */\n    eq(other) {\n        return this == other || (this.sameMarkup(other) && this.content.eq(other.content));\n    }\n    /**\n    Compare the markup (type, attributes, and marks) of this node to\n    those of another. Returns `true` if both have the same markup.\n    */\n    sameMarkup(other) {\n        return this.hasMarkup(other.type, other.attrs, other.marks);\n    }\n    /**\n    Check whether this node's markup correspond to the given type,\n    attributes, and marks.\n    */\n    hasMarkup(type, attrs, marks) {\n        return this.type == type &&\n            compareDeep(this.attrs, attrs || type.defaultAttrs || emptyAttrs) &&\n            Mark.sameSet(this.marks, marks || Mark.none);\n    }\n    /**\n    Create a new node with the same markup as this node, containing\n    the given content (or empty, if no content is given).\n    */\n    copy(content = null) {\n        if (content == this.content)\n            return this;\n        return new Node(this.type, this.attrs, content, this.marks);\n    }\n    /**\n    Create a copy of this node, with the given set of marks instead\n    of the node's own marks.\n    */\n    mark(marks) {\n        return marks == this.marks ? this : new Node(this.type, this.attrs, this.content, marks);\n    }\n    /**\n    Create a copy of this node with only the content between the\n    given positions. If `to` is not given, it defaults to the end of\n    the node.\n    */\n    cut(from, to = this.content.size) {\n        if (from == 0 && to == this.content.size)\n            return this;\n        return this.copy(this.content.cut(from, to));\n    }\n    /**\n    Cut out the part of the document between the given positions, and\n    return it as a `Slice` object.\n    */\n    slice(from, to = this.content.size, includeParents = false) {\n        if (from == to)\n            return Slice.empty;\n        let $from = this.resolve(from), $to = this.resolve(to);\n        let depth = includeParents ? 0 : $from.sharedDepth(to);\n        let start = $from.start(depth), node = $from.node(depth);\n        let content = node.content.cut($from.pos - start, $to.pos - start);\n        return new Slice(content, $from.depth - depth, $to.depth - depth);\n    }\n    /**\n    Replace the part of the document between the given positions with\n    the given slice. The slice must 'fit', meaning its open sides\n    must be able to connect to the surrounding content, and its\n    content nodes must be valid children for the node they are placed\n    into. If any of this is violated, an error of type\n    [`ReplaceError`](https://prosemirror.net/docs/ref/#model.ReplaceError) is thrown.\n    */\n    replace(from, to, slice) {\n        return replace(this.resolve(from), this.resolve(to), slice);\n    }\n    /**\n    Find the node directly after the given position.\n    */\n    nodeAt(pos) {\n        for (let node = this;;) {\n            let { index, offset } = node.content.findIndex(pos);\n            node = node.maybeChild(index);\n            if (!node)\n                return null;\n            if (offset == pos || node.isText)\n                return node;\n            pos -= offset + 1;\n        }\n    }\n    /**\n    Find the (direct) child node after the given offset, if any,\n    and return it along with its index and offset relative to this\n    node.\n    */\n    childAfter(pos) {\n        let { index, offset } = this.content.findIndex(pos);\n        return { node: this.content.maybeChild(index), index, offset };\n    }\n    /**\n    Find the (direct) child node before the given offset, if any,\n    and return it along with its index and offset relative to this\n    node.\n    */\n    childBefore(pos) {\n        if (pos == 0)\n            return { node: null, index: 0, offset: 0 };\n        let { index, offset } = this.content.findIndex(pos);\n        if (offset < pos)\n            return { node: this.content.child(index), index, offset };\n        let node = this.content.child(index - 1);\n        return { node, index: index - 1, offset: offset - node.nodeSize };\n    }\n    /**\n    Resolve the given position in the document, returning an\n    [object](https://prosemirror.net/docs/ref/#model.ResolvedPos) with information about its context.\n    */\n    resolve(pos) { return ResolvedPos.resolveCached(this, pos); }\n    /**\n    @internal\n    */\n    resolveNoCache(pos) { return ResolvedPos.resolve(this, pos); }\n    /**\n    Test whether a given mark or mark type occurs in this document\n    between the two given positions.\n    */\n    rangeHasMark(from, to, type) {\n        let found = false;\n        if (to > from)\n            this.nodesBetween(from, to, node => {\n                if (type.isInSet(node.marks))\n                    found = true;\n                return !found;\n            });\n        return found;\n    }\n    /**\n    True when this is a block (non-inline node)\n    */\n    get isBlock() { return this.type.isBlock; }\n    /**\n    True when this is a textblock node, a block node with inline\n    content.\n    */\n    get isTextblock() { return this.type.isTextblock; }\n    /**\n    True when this node allows inline content.\n    */\n    get inlineContent() { return this.type.inlineContent; }\n    /**\n    True when this is an inline node (a text node or a node that can\n    appear among text).\n    */\n    get isInline() { return this.type.isInline; }\n    /**\n    True when this is a text node.\n    */\n    get isText() { return this.type.isText; }\n    /**\n    True when this is a leaf node.\n    */\n    get isLeaf() { return this.type.isLeaf; }\n    /**\n    True when this is an atom, i.e. when it does not have directly\n    editable content. This is usually the same as `isLeaf`, but can\n    be configured with the [`atom` property](https://prosemirror.net/docs/ref/#model.NodeSpec.atom)\n    on a node's spec (typically used when the node is displayed as\n    an uneditable [node view](https://prosemirror.net/docs/ref/#view.NodeView)).\n    */\n    get isAtom() { return this.type.isAtom; }\n    /**\n    Return a string representation of this node for debugging\n    purposes.\n    */\n    toString() {\n        if (this.type.spec.toDebugString)\n            return this.type.spec.toDebugString(this);\n        let name = this.type.name;\n        if (this.content.size)\n            name += \"(\" + this.content.toStringInner() + \")\";\n        return wrapMarks(this.marks, name);\n    }\n    /**\n    Get the content match in this node at the given index.\n    */\n    contentMatchAt(index) {\n        let match = this.type.contentMatch.matchFragment(this.content, 0, index);\n        if (!match)\n            throw new Error(\"Called contentMatchAt on a node with invalid content\");\n        return match;\n    }\n    /**\n    Test whether replacing the range between `from` and `to` (by\n    child index) with the given replacement fragment (which defaults\n    to the empty fragment) would leave the node's content valid. You\n    can optionally pass `start` and `end` indices into the\n    replacement fragment.\n    */\n    canReplace(from, to, replacement = Fragment.empty, start = 0, end = replacement.childCount) {\n        let one = this.contentMatchAt(from).matchFragment(replacement, start, end);\n        let two = one && one.matchFragment(this.content, to);\n        if (!two || !two.validEnd)\n            return false;\n        for (let i = start; i < end; i++)\n            if (!this.type.allowsMarks(replacement.child(i).marks))\n                return false;\n        return true;\n    }\n    /**\n    Test whether replacing the range `from` to `to` (by index) with\n    a node of the given type would leave the node's content valid.\n    */\n    canReplaceWith(from, to, type, marks) {\n        if (marks && !this.type.allowsMarks(marks))\n            return false;\n        let start = this.contentMatchAt(from).matchType(type);\n        let end = start && start.matchFragment(this.content, to);\n        return end ? end.validEnd : false;\n    }\n    /**\n    Test whether the given node's content could be appended to this\n    node. If that node is empty, this will only return true if there\n    is at least one node type that can appear in both nodes (to avoid\n    merging completely incompatible nodes).\n    */\n    canAppend(other) {\n        if (other.content.size)\n            return this.canReplace(this.childCount, this.childCount, other.content);\n        else\n            return this.type.compatibleContent(other.type);\n    }\n    /**\n    Check whether this node and its descendants conform to the\n    schema, and raise error when they do not.\n    */\n    check() {\n        this.type.checkContent(this.content);\n        let copy = Mark.none;\n        for (let i = 0; i < this.marks.length; i++)\n            copy = this.marks[i].addToSet(copy);\n        if (!Mark.sameSet(copy, this.marks))\n            throw new RangeError(`Invalid collection of marks for node ${this.type.name}: ${this.marks.map(m => m.type.name)}`);\n        this.content.forEach(node => node.check());\n    }\n    /**\n    Return a JSON-serializeable representation of this node.\n    */\n    toJSON() {\n        let obj = { type: this.type.name };\n        for (let _ in this.attrs) {\n            obj.attrs = this.attrs;\n            break;\n        }\n        if (this.content.size)\n            obj.content = this.content.toJSON();\n        if (this.marks.length)\n            obj.marks = this.marks.map(n => n.toJSON());\n        return obj;\n    }\n    /**\n    Deserialize a node from its JSON representation.\n    */\n    static fromJSON(schema, json) {\n        if (!json)\n            throw new RangeError(\"Invalid input for Node.fromJSON\");\n        let marks = null;\n        if (json.marks) {\n            if (!Array.isArray(json.marks))\n                throw new RangeError(\"Invalid mark data for Node.fromJSON\");\n            marks = json.marks.map(schema.markFromJSON);\n        }\n        if (json.type == \"text\") {\n            if (typeof json.text != \"string\")\n                throw new RangeError(\"Invalid text node in JSON\");\n            return schema.text(json.text, marks);\n        }\n        let content = Fragment.fromJSON(schema, json.content);\n        return schema.nodeType(json.type).create(json.attrs, content, marks);\n    }\n}\nNode.prototype.text = undefined;\nclass TextNode extends Node {\n    /**\n    @internal\n    */\n    constructor(type, attrs, content, marks) {\n        super(type, attrs, null, marks);\n        if (!content)\n            throw new RangeError(\"Empty text nodes are not allowed\");\n        this.text = content;\n    }\n    toString() {\n        if (this.type.spec.toDebugString)\n            return this.type.spec.toDebugString(this);\n        return wrapMarks(this.marks, JSON.stringify(this.text));\n    }\n    get textContent() { return this.text; }\n    textBetween(from, to) { return this.text.slice(from, to); }\n    get nodeSize() { return this.text.length; }\n    mark(marks) {\n        return marks == this.marks ? this : new TextNode(this.type, this.attrs, this.text, marks);\n    }\n    withText(text) {\n        if (text == this.text)\n            return this;\n        return new TextNode(this.type, this.attrs, text, this.marks);\n    }\n    cut(from = 0, to = this.text.length) {\n        if (from == 0 && to == this.text.length)\n            return this;\n        return this.withText(this.text.slice(from, to));\n    }\n    eq(other) {\n        return this.sameMarkup(other) && this.text == other.text;\n    }\n    toJSON() {\n        let base = super.toJSON();\n        base.text = this.text;\n        return base;\n    }\n}\nfunction wrapMarks(marks, str) {\n    for (let i = marks.length - 1; i >= 0; i--)\n        str = marks[i].type.name + \"(\" + str + \")\";\n    return str;\n}\n\n/**\nInstances of this class represent a match state of a node type's\n[content expression](https://prosemirror.net/docs/ref/#model.NodeSpec.content), and can be used to\nfind out whether further content matches here, and whether a given\nposition is a valid end of the node.\n*/\nclass ContentMatch {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    True when this match state represents a valid end of the node.\n    */\n    validEnd) {\n        this.validEnd = validEnd;\n        /**\n        @internal\n        */\n        this.next = [];\n        /**\n        @internal\n        */\n        this.wrapCache = [];\n    }\n    /**\n    @internal\n    */\n    static parse(string, nodeTypes) {\n        let stream = new TokenStream(string, nodeTypes);\n        if (stream.next == null)\n            return ContentMatch.empty;\n        let expr = parseExpr(stream);\n        if (stream.next)\n            stream.err(\"Unexpected trailing text\");\n        let match = dfa(nfa(expr));\n        checkForDeadEnds(match, stream);\n        return match;\n    }\n    /**\n    Match a node type, returning a match after that node if\n    successful.\n    */\n    matchType(type) {\n        for (let i = 0; i < this.next.length; i++)\n            if (this.next[i].type == type)\n                return this.next[i].next;\n        return null;\n    }\n    /**\n    Try to match a fragment. Returns the resulting match when\n    successful.\n    */\n    matchFragment(frag, start = 0, end = frag.childCount) {\n        let cur = this;\n        for (let i = start; cur && i < end; i++)\n            cur = cur.matchType(frag.child(i).type);\n        return cur;\n    }\n    /**\n    @internal\n    */\n    get inlineContent() {\n        return this.next.length != 0 && this.next[0].type.isInline;\n    }\n    /**\n    Get the first matching node type at this match position that can\n    be generated.\n    */\n    get defaultType() {\n        for (let i = 0; i < this.next.length; i++) {\n            let { type } = this.next[i];\n            if (!(type.isText || type.hasRequiredAttrs()))\n                return type;\n        }\n        return null;\n    }\n    /**\n    @internal\n    */\n    compatible(other) {\n        for (let i = 0; i < this.next.length; i++)\n            for (let j = 0; j < other.next.length; j++)\n                if (this.next[i].type == other.next[j].type)\n                    return true;\n        return false;\n    }\n    /**\n    Try to match the given fragment, and if that fails, see if it can\n    be made to match by inserting nodes in front of it. When\n    successful, return a fragment of inserted nodes (which may be\n    empty if nothing had to be inserted). When `toEnd` is true, only\n    return a fragment if the resulting match goes to the end of the\n    content expression.\n    */\n    fillBefore(after, toEnd = false, startIndex = 0) {\n        let seen = [this];\n        function search(match, types) {\n            let finished = match.matchFragment(after, startIndex);\n            if (finished && (!toEnd || finished.validEnd))\n                return Fragment.from(types.map(tp => tp.createAndFill()));\n            for (let i = 0; i < match.next.length; i++) {\n                let { type, next } = match.next[i];\n                if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {\n                    seen.push(next);\n                    let found = search(next, types.concat(type));\n                    if (found)\n                        return found;\n                }\n            }\n            return null;\n        }\n        return search(this, []);\n    }\n    /**\n    Find a set of wrapping node types that would allow a node of the\n    given type to appear at this position. The result may be empty\n    (when it fits directly) and will be null when no such wrapping\n    exists.\n    */\n    findWrapping(target) {\n        for (let i = 0; i < this.wrapCache.length; i += 2)\n            if (this.wrapCache[i] == target)\n                return this.wrapCache[i + 1];\n        let computed = this.computeWrapping(target);\n        this.wrapCache.push(target, computed);\n        return computed;\n    }\n    /**\n    @internal\n    */\n    computeWrapping(target) {\n        let seen = Object.create(null), active = [{ match: this, type: null, via: null }];\n        while (active.length) {\n            let current = active.shift(), match = current.match;\n            if (match.matchType(target)) {\n                let result = [];\n                for (let obj = current; obj.type; obj = obj.via)\n                    result.push(obj.type);\n                return result.reverse();\n            }\n            for (let i = 0; i < match.next.length; i++) {\n                let { type, next } = match.next[i];\n                if (!type.isLeaf && !type.hasRequiredAttrs() && !(type.name in seen) && (!current.type || next.validEnd)) {\n                    active.push({ match: type.contentMatch, type, via: current });\n                    seen[type.name] = true;\n                }\n            }\n        }\n        return null;\n    }\n    /**\n    The number of outgoing edges this node has in the finite\n    automaton that describes the content expression.\n    */\n    get edgeCount() {\n        return this.next.length;\n    }\n    /**\n    Get the _n_​th outgoing edge from this node in the finite\n    automaton that describes the content expression.\n    */\n    edge(n) {\n        if (n >= this.next.length)\n            throw new RangeError(`There's no ${n}th edge in this content match`);\n        return this.next[n];\n    }\n    /**\n    @internal\n    */\n    toString() {\n        let seen = [];\n        function scan(m) {\n            seen.push(m);\n            for (let i = 0; i < m.next.length; i++)\n                if (seen.indexOf(m.next[i].next) == -1)\n                    scan(m.next[i].next);\n        }\n        scan(this);\n        return seen.map((m, i) => {\n            let out = i + (m.validEnd ? \"*\" : \" \") + \" \";\n            for (let i = 0; i < m.next.length; i++)\n                out += (i ? \", \" : \"\") + m.next[i].type.name + \"->\" + seen.indexOf(m.next[i].next);\n            return out;\n        }).join(\"\\n\");\n    }\n}\n/**\n@internal\n*/\nContentMatch.empty = new ContentMatch(true);\nclass TokenStream {\n    constructor(string, nodeTypes) {\n        this.string = string;\n        this.nodeTypes = nodeTypes;\n        this.inline = null;\n        this.pos = 0;\n        this.tokens = string.split(/\\s*(?=\\b|\\W|$)/);\n        if (this.tokens[this.tokens.length - 1] == \"\")\n            this.tokens.pop();\n        if (this.tokens[0] == \"\")\n            this.tokens.shift();\n    }\n    get next() { return this.tokens[this.pos]; }\n    eat(tok) { return this.next == tok && (this.pos++ || true); }\n    err(str) { throw new SyntaxError(str + \" (in content expression '\" + this.string + \"')\"); }\n}\nfunction parseExpr(stream) {\n    let exprs = [];\n    do {\n        exprs.push(parseExprSeq(stream));\n    } while (stream.eat(\"|\"));\n    return exprs.length == 1 ? exprs[0] : { type: \"choice\", exprs };\n}\nfunction parseExprSeq(stream) {\n    let exprs = [];\n    do {\n        exprs.push(parseExprSubscript(stream));\n    } while (stream.next && stream.next != \")\" && stream.next != \"|\");\n    return exprs.length == 1 ? exprs[0] : { type: \"seq\", exprs };\n}\nfunction parseExprSubscript(stream) {\n    let expr = parseExprAtom(stream);\n    for (;;) {\n        if (stream.eat(\"+\"))\n            expr = { type: \"plus\", expr };\n        else if (stream.eat(\"*\"))\n            expr = { type: \"star\", expr };\n        else if (stream.eat(\"?\"))\n            expr = { type: \"opt\", expr };\n        else if (stream.eat(\"{\"))\n            expr = parseExprRange(stream, expr);\n        else\n            break;\n    }\n    return expr;\n}\nfunction parseNum(stream) {\n    if (/\\D/.test(stream.next))\n        stream.err(\"Expected number, got '\" + stream.next + \"'\");\n    let result = Number(stream.next);\n    stream.pos++;\n    return result;\n}\nfunction parseExprRange(stream, expr) {\n    let min = parseNum(stream), max = min;\n    if (stream.eat(\",\")) {\n        if (stream.next != \"}\")\n            max = parseNum(stream);\n        else\n            max = -1;\n    }\n    if (!stream.eat(\"}\"))\n        stream.err(\"Unclosed braced range\");\n    return { type: \"range\", min, max, expr };\n}\nfunction resolveName(stream, name) {\n    let types = stream.nodeTypes, type = types[name];\n    if (type)\n        return [type];\n    let result = [];\n    for (let typeName in types) {\n        let type = types[typeName];\n        if (type.groups.indexOf(name) > -1)\n            result.push(type);\n    }\n    if (result.length == 0)\n        stream.err(\"No node type or group '\" + name + \"' found\");\n    return result;\n}\nfunction parseExprAtom(stream) {\n    if (stream.eat(\"(\")) {\n        let expr = parseExpr(stream);\n        if (!stream.eat(\")\"))\n            stream.err(\"Missing closing paren\");\n        return expr;\n    }\n    else if (!/\\W/.test(stream.next)) {\n        let exprs = resolveName(stream, stream.next).map(type => {\n            if (stream.inline == null)\n                stream.inline = type.isInline;\n            else if (stream.inline != type.isInline)\n                stream.err(\"Mixing inline and block content\");\n            return { type: \"name\", value: type };\n        });\n        stream.pos++;\n        return exprs.length == 1 ? exprs[0] : { type: \"choice\", exprs };\n    }\n    else {\n        stream.err(\"Unexpected token '\" + stream.next + \"'\");\n    }\n}\n/**\nConstruct an NFA from an expression as returned by the parser. The\nNFA is represented as an array of states, which are themselves\narrays of edges, which are `{term, to}` objects. The first state is\nthe entry state and the last node is the success state.\n\nNote that unlike typical NFAs, the edge ordering in this one is\nsignificant, in that it is used to contruct filler content when\nnecessary.\n*/\nfunction nfa(expr) {\n    let nfa = [[]];\n    connect(compile(expr, 0), node());\n    return nfa;\n    function node() { return nfa.push([]) - 1; }\n    function edge(from, to, term) {\n        let edge = { term, to };\n        nfa[from].push(edge);\n        return edge;\n    }\n    function connect(edges, to) {\n        edges.forEach(edge => edge.to = to);\n    }\n    function compile(expr, from) {\n        if (expr.type == \"choice\") {\n            return expr.exprs.reduce((out, expr) => out.concat(compile(expr, from)), []);\n        }\n        else if (expr.type == \"seq\") {\n            for (let i = 0;; i++) {\n                let next = compile(expr.exprs[i], from);\n                if (i == expr.exprs.length - 1)\n                    return next;\n                connect(next, from = node());\n            }\n        }\n        else if (expr.type == \"star\") {\n            let loop = node();\n            edge(from, loop);\n            connect(compile(expr.expr, loop), loop);\n            return [edge(loop)];\n        }\n        else if (expr.type == \"plus\") {\n            let loop = node();\n            connect(compile(expr.expr, from), loop);\n            connect(compile(expr.expr, loop), loop);\n            return [edge(loop)];\n        }\n        else if (expr.type == \"opt\") {\n            return [edge(from)].concat(compile(expr.expr, from));\n        }\n        else if (expr.type == \"range\") {\n            let cur = from;\n            for (let i = 0; i < expr.min; i++) {\n                let next = node();\n                connect(compile(expr.expr, cur), next);\n                cur = next;\n            }\n            if (expr.max == -1) {\n                connect(compile(expr.expr, cur), cur);\n            }\n            else {\n                for (let i = expr.min; i < expr.max; i++) {\n                    let next = node();\n                    edge(cur, next);\n                    connect(compile(expr.expr, cur), next);\n                    cur = next;\n                }\n            }\n            return [edge(cur)];\n        }\n        else if (expr.type == \"name\") {\n            return [edge(from, undefined, expr.value)];\n        }\n        else {\n            throw new Error(\"Unknown expr type\");\n        }\n    }\n}\nfunction cmp(a, b) { return b - a; }\n// Get the set of nodes reachable by null edges from `node`. Omit\n// nodes with only a single null-out-edge, since they may lead to\n// needless duplicated nodes.\nfunction nullFrom(nfa, node) {\n    let result = [];\n    scan(node);\n    return result.sort(cmp);\n    function scan(node) {\n        let edges = nfa[node];\n        if (edges.length == 1 && !edges[0].term)\n            return scan(edges[0].to);\n        result.push(node);\n        for (let i = 0; i < edges.length; i++) {\n            let { term, to } = edges[i];\n            if (!term && result.indexOf(to) == -1)\n                scan(to);\n        }\n    }\n}\n// Compiles an NFA as produced by `nfa` into a DFA, modeled as a set\n// of state objects (`ContentMatch` instances) with transitions\n// between them.\nfunction dfa(nfa) {\n    let labeled = Object.create(null);\n    return explore(nullFrom(nfa, 0));\n    function explore(states) {\n        let out = [];\n        states.forEach(node => {\n            nfa[node].forEach(({ term, to }) => {\n                if (!term)\n                    return;\n                let set;\n                for (let i = 0; i < out.length; i++)\n                    if (out[i][0] == term)\n                        set = out[i][1];\n                nullFrom(nfa, to).forEach(node => {\n                    if (!set)\n                        out.push([term, set = []]);\n                    if (set.indexOf(node) == -1)\n                        set.push(node);\n                });\n            });\n        });\n        let state = labeled[states.join(\",\")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1);\n        for (let i = 0; i < out.length; i++) {\n            let states = out[i][1].sort(cmp);\n            state.next.push({ type: out[i][0], next: labeled[states.join(\",\")] || explore(states) });\n        }\n        return state;\n    }\n}\nfunction checkForDeadEnds(match, stream) {\n    for (let i = 0, work = [match]; i < work.length; i++) {\n        let state = work[i], dead = !state.validEnd, nodes = [];\n        for (let j = 0; j < state.next.length; j++) {\n            let { type, next } = state.next[j];\n            nodes.push(type.name);\n            if (dead && !(type.isText || type.hasRequiredAttrs()))\n                dead = false;\n            if (work.indexOf(next) == -1)\n                work.push(next);\n        }\n        if (dead)\n            stream.err(\"Only non-generatable nodes (\" + nodes.join(\", \") + \") in a required position (see https://prosemirror.net/docs/guide/#generatable)\");\n    }\n}\n\n// For node types where all attrs have a default value (or which don't\n// have any attributes), build up a single reusable default attribute\n// object, and use it for all nodes that don't specify specific\n// attributes.\nfunction defaultAttrs(attrs) {\n    let defaults = Object.create(null);\n    for (let attrName in attrs) {\n        let attr = attrs[attrName];\n        if (!attr.hasDefault)\n            return null;\n        defaults[attrName] = attr.default;\n    }\n    return defaults;\n}\nfunction computeAttrs(attrs, value) {\n    let built = Object.create(null);\n    for (let name in attrs) {\n        let given = value && value[name];\n        if (given === undefined) {\n            let attr = attrs[name];\n            if (attr.hasDefault)\n                given = attr.default;\n            else\n                throw new RangeError(\"No value supplied for attribute \" + name);\n        }\n        built[name] = given;\n    }\n    return built;\n}\nfunction initAttrs(attrs) {\n    let result = Object.create(null);\n    if (attrs)\n        for (let name in attrs)\n            result[name] = new Attribute(attrs[name]);\n    return result;\n}\n/**\nNode types are objects allocated once per `Schema` and used to\n[tag](https://prosemirror.net/docs/ref/#model.Node.type) `Node` instances. They contain information\nabout the node type, such as its name and what kind of node it\nrepresents.\n*/\nclass NodeType {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The name the node type has in this schema.\n    */\n    name, \n    /**\n    A link back to the `Schema` the node type belongs to.\n    */\n    schema, \n    /**\n    The spec that this type is based on\n    */\n    spec) {\n        this.name = name;\n        this.schema = schema;\n        this.spec = spec;\n        /**\n        The set of marks allowed in this node. `null` means all marks\n        are allowed.\n        */\n        this.markSet = null;\n        this.groups = spec.group ? spec.group.split(\" \") : [];\n        this.attrs = initAttrs(spec.attrs);\n        this.defaultAttrs = defaultAttrs(this.attrs);\n        this.contentMatch = null;\n        this.inlineContent = null;\n        this.isBlock = !(spec.inline || name == \"text\");\n        this.isText = name == \"text\";\n    }\n    /**\n    True if this is an inline type.\n    */\n    get isInline() { return !this.isBlock; }\n    /**\n    True if this is a textblock type, a block that contains inline\n    content.\n    */\n    get isTextblock() { return this.isBlock && this.inlineContent; }\n    /**\n    True for node types that allow no content.\n    */\n    get isLeaf() { return this.contentMatch == ContentMatch.empty; }\n    /**\n    True when this node is an atom, i.e. when it does not have\n    directly editable content.\n    */\n    get isAtom() { return this.isLeaf || !!this.spec.atom; }\n    /**\n    The node type's [whitespace](https://prosemirror.net/docs/ref/#model.NodeSpec.whitespace) option.\n    */\n    get whitespace() {\n        return this.spec.whitespace || (this.spec.code ? \"pre\" : \"normal\");\n    }\n    /**\n    Tells you whether this node type has any required attributes.\n    */\n    hasRequiredAttrs() {\n        for (let n in this.attrs)\n            if (this.attrs[n].isRequired)\n                return true;\n        return false;\n    }\n    /**\n    Indicates whether this node allows some of the same content as\n    the given node type.\n    */\n    compatibleContent(other) {\n        return this == other || this.contentMatch.compatible(other.contentMatch);\n    }\n    /**\n    @internal\n    */\n    computeAttrs(attrs) {\n        if (!attrs && this.defaultAttrs)\n            return this.defaultAttrs;\n        else\n            return computeAttrs(this.attrs, attrs);\n    }\n    /**\n    Create a `Node` of this type. The given attributes are\n    checked and defaulted (you can pass `null` to use the type's\n    defaults entirely, if no required attributes exist). `content`\n    may be a `Fragment`, a node, an array of nodes, or\n    `null`. Similarly `marks` may be `null` to default to the empty\n    set of marks.\n    */\n    create(attrs = null, content, marks) {\n        if (this.isText)\n            throw new Error(\"NodeType.create can't construct text nodes\");\n        return new Node(this, this.computeAttrs(attrs), Fragment.from(content), Mark.setFrom(marks));\n    }\n    /**\n    Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but check the given content\n    against the node type's content restrictions, and throw an error\n    if it doesn't match.\n    */\n    createChecked(attrs = null, content, marks) {\n        content = Fragment.from(content);\n        this.checkContent(content);\n        return new Node(this, this.computeAttrs(attrs), content, Mark.setFrom(marks));\n    }\n    /**\n    Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but see if it is\n    necessary to add nodes to the start or end of the given fragment\n    to make it fit the node. If no fitting wrapping can be found,\n    return null. Note that, due to the fact that required nodes can\n    always be created, this will always succeed if you pass null or\n    `Fragment.empty` as content.\n    */\n    createAndFill(attrs = null, content, marks) {\n        attrs = this.computeAttrs(attrs);\n        content = Fragment.from(content);\n        if (content.size) {\n            let before = this.contentMatch.fillBefore(content);\n            if (!before)\n                return null;\n            content = before.append(content);\n        }\n        let matched = this.contentMatch.matchFragment(content);\n        let after = matched && matched.fillBefore(Fragment.empty, true);\n        if (!after)\n            return null;\n        return new Node(this, attrs, content.append(after), Mark.setFrom(marks));\n    }\n    /**\n    Returns true if the given fragment is valid content for this node\n    type with the given attributes.\n    */\n    validContent(content) {\n        let result = this.contentMatch.matchFragment(content);\n        if (!result || !result.validEnd)\n            return false;\n        for (let i = 0; i < content.childCount; i++)\n            if (!this.allowsMarks(content.child(i).marks))\n                return false;\n        return true;\n    }\n    /**\n    Throws a RangeError if the given fragment is not valid content for this\n    node type.\n    @internal\n    */\n    checkContent(content) {\n        if (!this.validContent(content))\n            throw new RangeError(`Invalid content for node ${this.name}: ${content.toString().slice(0, 50)}`);\n    }\n    /**\n    Check whether the given mark type is allowed in this node.\n    */\n    allowsMarkType(markType) {\n        return this.markSet == null || this.markSet.indexOf(markType) > -1;\n    }\n    /**\n    Test whether the given set of marks are allowed in this node.\n    */\n    allowsMarks(marks) {\n        if (this.markSet == null)\n            return true;\n        for (let i = 0; i < marks.length; i++)\n            if (!this.allowsMarkType(marks[i].type))\n                return false;\n        return true;\n    }\n    /**\n    Removes the marks that are not allowed in this node from the given set.\n    */\n    allowedMarks(marks) {\n        if (this.markSet == null)\n            return marks;\n        let copy;\n        for (let i = 0; i < marks.length; i++) {\n            if (!this.allowsMarkType(marks[i].type)) {\n                if (!copy)\n                    copy = marks.slice(0, i);\n            }\n            else if (copy) {\n                copy.push(marks[i]);\n            }\n        }\n        return !copy ? marks : copy.length ? copy : Mark.none;\n    }\n    /**\n    @internal\n    */\n    static compile(nodes, schema) {\n        let result = Object.create(null);\n        nodes.forEach((name, spec) => result[name] = new NodeType(name, schema, spec));\n        let topType = schema.spec.topNode || \"doc\";\n        if (!result[topType])\n            throw new RangeError(\"Schema is missing its top node type ('\" + topType + \"')\");\n        if (!result.text)\n            throw new RangeError(\"Every schema needs a 'text' type\");\n        for (let _ in result.text.attrs)\n            throw new RangeError(\"The text node type should not have attributes\");\n        return result;\n    }\n}\n// Attribute descriptors\nclass Attribute {\n    constructor(options) {\n        this.hasDefault = Object.prototype.hasOwnProperty.call(options, \"default\");\n        this.default = options.default;\n    }\n    get isRequired() {\n        return !this.hasDefault;\n    }\n}\n// Marks\n/**\nLike nodes, marks (which are associated with nodes to signify\nthings like emphasis or being part of a link) are\n[tagged](https://prosemirror.net/docs/ref/#model.Mark.type) with type objects, which are\ninstantiated once per `Schema`.\n*/\nclass MarkType {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The name of the mark type.\n    */\n    name, \n    /**\n    @internal\n    */\n    rank, \n    /**\n    The schema that this mark type instance is part of.\n    */\n    schema, \n    /**\n    The spec on which the type is based.\n    */\n    spec) {\n        this.name = name;\n        this.rank = rank;\n        this.schema = schema;\n        this.spec = spec;\n        this.attrs = initAttrs(spec.attrs);\n        this.excluded = null;\n        let defaults = defaultAttrs(this.attrs);\n        this.instance = defaults ? new Mark(this, defaults) : null;\n    }\n    /**\n    Create a mark of this type. `attrs` may be `null` or an object\n    containing only some of the mark's attributes. The others, if\n    they have defaults, will be added.\n    */\n    create(attrs = null) {\n        if (!attrs && this.instance)\n            return this.instance;\n        return new Mark(this, computeAttrs(this.attrs, attrs));\n    }\n    /**\n    @internal\n    */\n    static compile(marks, schema) {\n        let result = Object.create(null), rank = 0;\n        marks.forEach((name, spec) => result[name] = new MarkType(name, rank++, schema, spec));\n        return result;\n    }\n    /**\n    When there is a mark of this type in the given set, a new set\n    without it is returned. Otherwise, the input set is returned.\n    */\n    removeFromSet(set) {\n        for (var i = 0; i < set.length; i++)\n            if (set[i].type == this) {\n                set = set.slice(0, i).concat(set.slice(i + 1));\n                i--;\n            }\n        return set;\n    }\n    /**\n    Tests whether there is a mark of this type in the given set.\n    */\n    isInSet(set) {\n        for (let i = 0; i < set.length; i++)\n            if (set[i].type == this)\n                return set[i];\n    }\n    /**\n    Queries whether a given mark type is\n    [excluded](https://prosemirror.net/docs/ref/#model.MarkSpec.excludes) by this one.\n    */\n    excludes(other) {\n        return this.excluded.indexOf(other) > -1;\n    }\n}\n/**\nA document schema. Holds [node](https://prosemirror.net/docs/ref/#model.NodeType) and [mark\ntype](https://prosemirror.net/docs/ref/#model.MarkType) objects for the nodes and marks that may\noccur in conforming documents, and provides functionality for\ncreating and deserializing such documents.\n\nWhen given, the type parameters provide the names of the nodes and\nmarks in this schema.\n*/\nclass Schema {\n    /**\n    Construct a schema from a schema [specification](https://prosemirror.net/docs/ref/#model.SchemaSpec).\n    */\n    constructor(spec) {\n        /**\n        An object for storing whatever values modules may want to\n        compute and cache per schema. (If you want to store something\n        in it, try to use property names unlikely to clash.)\n        */\n        this.cached = Object.create(null);\n        let instanceSpec = this.spec = {};\n        for (let prop in spec)\n            instanceSpec[prop] = spec[prop];\n        instanceSpec.nodes = OrderedMap.from(spec.nodes),\n            instanceSpec.marks = OrderedMap.from(spec.marks || {}),\n            this.nodes = NodeType.compile(this.spec.nodes, this);\n        this.marks = MarkType.compile(this.spec.marks, this);\n        let contentExprCache = Object.create(null);\n        for (let prop in this.nodes) {\n            if (prop in this.marks)\n                throw new RangeError(prop + \" can not be both a node and a mark\");\n            let type = this.nodes[prop], contentExpr = type.spec.content || \"\", markExpr = type.spec.marks;\n            type.contentMatch = contentExprCache[contentExpr] ||\n                (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes));\n            type.inlineContent = type.contentMatch.inlineContent;\n            type.markSet = markExpr == \"_\" ? null :\n                markExpr ? gatherMarks(this, markExpr.split(\" \")) :\n                    markExpr == \"\" || !type.inlineContent ? [] : null;\n        }\n        for (let prop in this.marks) {\n            let type = this.marks[prop], excl = type.spec.excludes;\n            type.excluded = excl == null ? [type] : excl == \"\" ? [] : gatherMarks(this, excl.split(\" \"));\n        }\n        this.nodeFromJSON = this.nodeFromJSON.bind(this);\n        this.markFromJSON = this.markFromJSON.bind(this);\n        this.topNodeType = this.nodes[this.spec.topNode || \"doc\"];\n        this.cached.wrappings = Object.create(null);\n    }\n    /**\n    Create a node in this schema. The `type` may be a string or a\n    `NodeType` instance. Attributes will be extended with defaults,\n    `content` may be a `Fragment`, `null`, a `Node`, or an array of\n    nodes.\n    */\n    node(type, attrs = null, content, marks) {\n        if (typeof type == \"string\")\n            type = this.nodeType(type);\n        else if (!(type instanceof NodeType))\n            throw new RangeError(\"Invalid node type: \" + type);\n        else if (type.schema != this)\n            throw new RangeError(\"Node type from different schema used (\" + type.name + \")\");\n        return type.createChecked(attrs, content, marks);\n    }\n    /**\n    Create a text node in the schema. Empty text nodes are not\n    allowed.\n    */\n    text(text, marks) {\n        let type = this.nodes.text;\n        return new TextNode(type, type.defaultAttrs, text, Mark.setFrom(marks));\n    }\n    /**\n    Create a mark with the given type and attributes.\n    */\n    mark(type, attrs) {\n        if (typeof type == \"string\")\n            type = this.marks[type];\n        return type.create(attrs);\n    }\n    /**\n    Deserialize a node from its JSON representation. This method is\n    bound.\n    */\n    nodeFromJSON(json) {\n        return Node.fromJSON(this, json);\n    }\n    /**\n    Deserialize a mark from its JSON representation. This method is\n    bound.\n    */\n    markFromJSON(json) {\n        return Mark.fromJSON(this, json);\n    }\n    /**\n    @internal\n    */\n    nodeType(name) {\n        let found = this.nodes[name];\n        if (!found)\n            throw new RangeError(\"Unknown node type: \" + name);\n        return found;\n    }\n}\nfunction gatherMarks(schema, marks) {\n    let found = [];\n    for (let i = 0; i < marks.length; i++) {\n        let name = marks[i], mark = schema.marks[name], ok = mark;\n        if (mark) {\n            found.push(mark);\n        }\n        else {\n            for (let prop in schema.marks) {\n                let mark = schema.marks[prop];\n                if (name == \"_\" || (mark.spec.group && mark.spec.group.split(\" \").indexOf(name) > -1))\n                    found.push(ok = mark);\n            }\n        }\n        if (!ok)\n            throw new SyntaxError(\"Unknown mark type: '\" + marks[i] + \"'\");\n    }\n    return found;\n}\n\n/**\nA DOM parser represents a strategy for parsing DOM content into a\nProseMirror document conforming to a given schema. Its behavior is\ndefined by an array of [rules](https://prosemirror.net/docs/ref/#model.ParseRule).\n*/\nclass DOMParser {\n    /**\n    Create a parser that targets the given schema, using the given\n    parsing rules.\n    */\n    constructor(\n    /**\n    The schema into which the parser parses.\n    */\n    schema, \n    /**\n    The set of [parse rules](https://prosemirror.net/docs/ref/#model.ParseRule) that the parser\n    uses, in order of precedence.\n    */\n    rules) {\n        this.schema = schema;\n        this.rules = rules;\n        /**\n        @internal\n        */\n        this.tags = [];\n        /**\n        @internal\n        */\n        this.styles = [];\n        rules.forEach(rule => {\n            if (rule.tag)\n                this.tags.push(rule);\n            else if (rule.style)\n                this.styles.push(rule);\n        });\n        // Only normalize list elements when lists in the schema can't directly contain themselves\n        this.normalizeLists = !this.tags.some(r => {\n            if (!/^(ul|ol)\\b/.test(r.tag) || !r.node)\n                return false;\n            let node = schema.nodes[r.node];\n            return node.contentMatch.matchType(node);\n        });\n    }\n    /**\n    Parse a document from the content of a DOM node.\n    */\n    parse(dom, options = {}) {\n        let context = new ParseContext(this, options, false);\n        context.addAll(dom, options.from, options.to);\n        return context.finish();\n    }\n    /**\n    Parses the content of the given DOM node, like\n    [`parse`](https://prosemirror.net/docs/ref/#model.DOMParser.parse), and takes the same set of\n    options. But unlike that method, which produces a whole node,\n    this one returns a slice that is open at the sides, meaning that\n    the schema constraints aren't applied to the start of nodes to\n    the left of the input and the end of nodes at the end.\n    */\n    parseSlice(dom, options = {}) {\n        let context = new ParseContext(this, options, true);\n        context.addAll(dom, options.from, options.to);\n        return Slice.maxOpen(context.finish());\n    }\n    /**\n    @internal\n    */\n    matchTag(dom, context, after) {\n        for (let i = after ? this.tags.indexOf(after) + 1 : 0; i < this.tags.length; i++) {\n            let rule = this.tags[i];\n            if (matches(dom, rule.tag) &&\n                (rule.namespace === undefined || dom.namespaceURI == rule.namespace) &&\n                (!rule.context || context.matchesContext(rule.context))) {\n                if (rule.getAttrs) {\n                    let result = rule.getAttrs(dom);\n                    if (result === false)\n                        continue;\n                    rule.attrs = result || undefined;\n                }\n                return rule;\n            }\n        }\n    }\n    /**\n    @internal\n    */\n    matchStyle(prop, value, context, after) {\n        for (let i = after ? this.styles.indexOf(after) + 1 : 0; i < this.styles.length; i++) {\n            let rule = this.styles[i], style = rule.style;\n            if (style.indexOf(prop) != 0 ||\n                rule.context && !context.matchesContext(rule.context) ||\n                // Test that the style string either precisely matches the prop,\n                // or has an '=' sign after the prop, followed by the given\n                // value.\n                style.length > prop.length &&\n                    (style.charCodeAt(prop.length) != 61 || style.slice(prop.length + 1) != value))\n                continue;\n            if (rule.getAttrs) {\n                let result = rule.getAttrs(value);\n                if (result === false)\n                    continue;\n                rule.attrs = result || undefined;\n            }\n            return rule;\n        }\n    }\n    /**\n    @internal\n    */\n    static schemaRules(schema) {\n        let result = [];\n        function insert(rule) {\n            let priority = rule.priority == null ? 50 : rule.priority, i = 0;\n            for (; i < result.length; i++) {\n                let next = result[i], nextPriority = next.priority == null ? 50 : next.priority;\n                if (nextPriority < priority)\n                    break;\n            }\n            result.splice(i, 0, rule);\n        }\n        for (let name in schema.marks) {\n            let rules = schema.marks[name].spec.parseDOM;\n            if (rules)\n                rules.forEach(rule => {\n                    insert(rule = copy(rule));\n                    if (!(rule.mark || rule.ignore || rule.clearMark))\n                        rule.mark = name;\n                });\n        }\n        for (let name in schema.nodes) {\n            let rules = schema.nodes[name].spec.parseDOM;\n            if (rules)\n                rules.forEach(rule => {\n                    insert(rule = copy(rule));\n                    if (!(rule.node || rule.ignore || rule.mark))\n                        rule.node = name;\n                });\n        }\n        return result;\n    }\n    /**\n    Construct a DOM parser using the parsing rules listed in a\n    schema's [node specs](https://prosemirror.net/docs/ref/#model.NodeSpec.parseDOM), reordered by\n    [priority](https://prosemirror.net/docs/ref/#model.ParseRule.priority).\n    */\n    static fromSchema(schema) {\n        return schema.cached.domParser ||\n            (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)));\n    }\n}\nconst blockTags = {\n    address: true, article: true, aside: true, blockquote: true, canvas: true,\n    dd: true, div: true, dl: true, fieldset: true, figcaption: true, figure: true,\n    footer: true, form: true, h1: true, h2: true, h3: true, h4: true, h5: true,\n    h6: true, header: true, hgroup: true, hr: true, li: true, noscript: true, ol: true,\n    output: true, p: true, pre: true, section: true, table: true, tfoot: true, ul: true\n};\nconst ignoreTags = {\n    head: true, noscript: true, object: true, script: true, style: true, title: true\n};\nconst listTags = { ol: true, ul: true };\n// Using a bitfield for node context options\nconst OPT_PRESERVE_WS = 1, OPT_PRESERVE_WS_FULL = 2, OPT_OPEN_LEFT = 4;\nfunction wsOptionsFor(type, preserveWhitespace, base) {\n    if (preserveWhitespace != null)\n        return (preserveWhitespace ? OPT_PRESERVE_WS : 0) |\n            (preserveWhitespace === \"full\" ? OPT_PRESERVE_WS_FULL : 0);\n    return type && type.whitespace == \"pre\" ? OPT_PRESERVE_WS | OPT_PRESERVE_WS_FULL : base & ~OPT_OPEN_LEFT;\n}\nclass NodeContext {\n    constructor(type, attrs, \n    // Marks applied to this node itself\n    marks, \n    // Marks that can't apply here, but will be used in children if possible\n    pendingMarks, solid, match, options) {\n        this.type = type;\n        this.attrs = attrs;\n        this.marks = marks;\n        this.pendingMarks = pendingMarks;\n        this.solid = solid;\n        this.options = options;\n        this.content = [];\n        // Marks applied to the node's children\n        this.activeMarks = Mark.none;\n        // Nested Marks with same type\n        this.stashMarks = [];\n        this.match = match || (options & OPT_OPEN_LEFT ? null : type.contentMatch);\n    }\n    findWrapping(node) {\n        if (!this.match) {\n            if (!this.type)\n                return [];\n            let fill = this.type.contentMatch.fillBefore(Fragment.from(node));\n            if (fill) {\n                this.match = this.type.contentMatch.matchFragment(fill);\n            }\n            else {\n                let start = this.type.contentMatch, wrap;\n                if (wrap = start.findWrapping(node.type)) {\n                    this.match = start;\n                    return wrap;\n                }\n                else {\n                    return null;\n                }\n            }\n        }\n        return this.match.findWrapping(node.type);\n    }\n    finish(openEnd) {\n        if (!(this.options & OPT_PRESERVE_WS)) { // Strip trailing whitespace\n            let last = this.content[this.content.length - 1], m;\n            if (last && last.isText && (m = /[ \\t\\r\\n\\u000c]+$/.exec(last.text))) {\n                let text = last;\n                if (last.text.length == m[0].length)\n                    this.content.pop();\n                else\n                    this.content[this.content.length - 1] = text.withText(text.text.slice(0, text.text.length - m[0].length));\n            }\n        }\n        let content = Fragment.from(this.content);\n        if (!openEnd && this.match)\n            content = content.append(this.match.fillBefore(Fragment.empty, true));\n        return this.type ? this.type.create(this.attrs, content, this.marks) : content;\n    }\n    popFromStashMark(mark) {\n        for (let i = this.stashMarks.length - 1; i >= 0; i--)\n            if (mark.eq(this.stashMarks[i]))\n                return this.stashMarks.splice(i, 1)[0];\n    }\n    applyPending(nextType) {\n        for (let i = 0, pending = this.pendingMarks; i < pending.length; i++) {\n            let mark = pending[i];\n            if ((this.type ? this.type.allowsMarkType(mark.type) : markMayApply(mark.type, nextType)) &&\n                !mark.isInSet(this.activeMarks)) {\n                this.activeMarks = mark.addToSet(this.activeMarks);\n                this.pendingMarks = mark.removeFromSet(this.pendingMarks);\n            }\n        }\n    }\n    inlineContext(node) {\n        if (this.type)\n            return this.type.inlineContent;\n        if (this.content.length)\n            return this.content[0].isInline;\n        return node.parentNode && !blockTags.hasOwnProperty(node.parentNode.nodeName.toLowerCase());\n    }\n}\nclass ParseContext {\n    constructor(\n    // The parser we are using.\n    parser, \n    // The options passed to this parse.\n    options, isOpen) {\n        this.parser = parser;\n        this.options = options;\n        this.isOpen = isOpen;\n        this.open = 0;\n        let topNode = options.topNode, topContext;\n        let topOptions = wsOptionsFor(null, options.preserveWhitespace, 0) | (isOpen ? OPT_OPEN_LEFT : 0);\n        if (topNode)\n            topContext = new NodeContext(topNode.type, topNode.attrs, Mark.none, Mark.none, true, options.topMatch || topNode.type.contentMatch, topOptions);\n        else if (isOpen)\n            topContext = new NodeContext(null, null, Mark.none, Mark.none, true, null, topOptions);\n        else\n            topContext = new NodeContext(parser.schema.topNodeType, null, Mark.none, Mark.none, true, null, topOptions);\n        this.nodes = [topContext];\n        this.find = options.findPositions;\n        this.needsBlock = false;\n    }\n    get top() {\n        return this.nodes[this.open];\n    }\n    // Add a DOM node to the content. Text is inserted as text node,\n    // otherwise, the node is passed to `addElement` or, if it has a\n    // `style` attribute, `addElementWithStyles`.\n    addDOM(dom) {\n        if (dom.nodeType == 3)\n            this.addTextNode(dom);\n        else if (dom.nodeType == 1)\n            this.addElement(dom);\n    }\n    withStyleRules(dom, f) {\n        let style = dom.getAttribute(\"style\");\n        if (!style)\n            return f();\n        let marks = this.readStyles(parseStyles(style));\n        if (!marks)\n            return; // A style with ignore: true\n        let [addMarks, removeMarks] = marks, top = this.top;\n        for (let i = 0; i < removeMarks.length; i++)\n            this.removePendingMark(removeMarks[i], top);\n        for (let i = 0; i < addMarks.length; i++)\n            this.addPendingMark(addMarks[i]);\n        f();\n        for (let i = 0; i < addMarks.length; i++)\n            this.removePendingMark(addMarks[i], top);\n        for (let i = 0; i < removeMarks.length; i++)\n            this.addPendingMark(removeMarks[i]);\n    }\n    addTextNode(dom) {\n        let value = dom.nodeValue;\n        let top = this.top;\n        if (top.options & OPT_PRESERVE_WS_FULL ||\n            top.inlineContext(dom) ||\n            /[^ \\t\\r\\n\\u000c]/.test(value)) {\n            if (!(top.options & OPT_PRESERVE_WS)) {\n                value = value.replace(/[ \\t\\r\\n\\u000c]+/g, \" \");\n                // If this starts with whitespace, and there is no node before it, or\n                // a hard break, or a text node that ends with whitespace, strip the\n                // leading space.\n                if (/^[ \\t\\r\\n\\u000c]/.test(value) && this.open == this.nodes.length - 1) {\n                    let nodeBefore = top.content[top.content.length - 1];\n                    let domNodeBefore = dom.previousSibling;\n                    if (!nodeBefore ||\n                        (domNodeBefore && domNodeBefore.nodeName == 'BR') ||\n                        (nodeBefore.isText && /[ \\t\\r\\n\\u000c]$/.test(nodeBefore.text)))\n                        value = value.slice(1);\n                }\n            }\n            else if (!(top.options & OPT_PRESERVE_WS_FULL)) {\n                value = value.replace(/\\r?\\n|\\r/g, \" \");\n            }\n            else {\n                value = value.replace(/\\r\\n?/g, \"\\n\");\n            }\n            if (value)\n                this.insertNode(this.parser.schema.text(value));\n            this.findInText(dom);\n        }\n        else {\n            this.findInside(dom);\n        }\n    }\n    // Try to find a handler for the given tag and use that to parse. If\n    // none is found, the element's content nodes are added directly.\n    addElement(dom, matchAfter) {\n        let name = dom.nodeName.toLowerCase(), ruleID;\n        if (listTags.hasOwnProperty(name) && this.parser.normalizeLists)\n            normalizeList(dom);\n        let rule = (this.options.ruleFromNode && this.options.ruleFromNode(dom)) ||\n            (ruleID = this.parser.matchTag(dom, this, matchAfter));\n        if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {\n            this.findInside(dom);\n            this.ignoreFallback(dom);\n        }\n        else if (!rule || rule.skip || rule.closeParent) {\n            if (rule && rule.closeParent)\n                this.open = Math.max(0, this.open - 1);\n            else if (rule && rule.skip.nodeType)\n                dom = rule.skip;\n            let sync, top = this.top, oldNeedsBlock = this.needsBlock;\n            if (blockTags.hasOwnProperty(name)) {\n                if (top.content.length && top.content[0].isInline && this.open) {\n                    this.open--;\n                    top = this.top;\n                }\n                sync = true;\n                if (!top.type)\n                    this.needsBlock = true;\n            }\n            else if (!dom.firstChild) {\n                this.leafFallback(dom);\n                return;\n            }\n            if (rule && rule.skip)\n                this.addAll(dom);\n            else\n                this.withStyleRules(dom, () => this.addAll(dom));\n            if (sync)\n                this.sync(top);\n            this.needsBlock = oldNeedsBlock;\n        }\n        else {\n            this.withStyleRules(dom, () => {\n                this.addElementByRule(dom, rule, rule.consuming === false ? ruleID : undefined);\n            });\n        }\n    }\n    // Called for leaf DOM nodes that would otherwise be ignored\n    leafFallback(dom) {\n        if (dom.nodeName == \"BR\" && this.top.type && this.top.type.inlineContent)\n            this.addTextNode(dom.ownerDocument.createTextNode(\"\\n\"));\n    }\n    // Called for ignored nodes\n    ignoreFallback(dom) {\n        // Ignored BR nodes should at least create an inline context\n        if (dom.nodeName == \"BR\" && (!this.top.type || !this.top.type.inlineContent))\n            this.findPlace(this.parser.schema.text(\"-\"));\n    }\n    // Run any style parser associated with the node's styles. Either\n    // return an array of marks, or null to indicate some of the styles\n    // had a rule with `ignore` set.\n    readStyles(styles) {\n        let add = Mark.none, remove = Mark.none;\n        for (let i = 0; i < styles.length; i += 2) {\n            for (let after = undefined;;) {\n                let rule = this.parser.matchStyle(styles[i], styles[i + 1], this, after);\n                if (!rule)\n                    break;\n                if (rule.ignore)\n                    return null;\n                if (rule.clearMark) {\n                    this.top.pendingMarks.concat(this.top.activeMarks).forEach(m => {\n                        if (rule.clearMark(m))\n                            remove = m.addToSet(remove);\n                    });\n                }\n                else {\n                    add = this.parser.schema.marks[rule.mark].create(rule.attrs).addToSet(add);\n                }\n                if (rule.consuming === false)\n                    after = rule;\n                else\n                    break;\n            }\n        }\n        return [add, remove];\n    }\n    // Look up a handler for the given node. If none are found, return\n    // false. Otherwise, apply it, use its return value to drive the way\n    // the node's content is wrapped, and return true.\n    addElementByRule(dom, rule, continueAfter) {\n        let sync, nodeType, mark;\n        if (rule.node) {\n            nodeType = this.parser.schema.nodes[rule.node];\n            if (!nodeType.isLeaf) {\n                sync = this.enter(nodeType, rule.attrs || null, rule.preserveWhitespace);\n            }\n            else if (!this.insertNode(nodeType.create(rule.attrs))) {\n                this.leafFallback(dom);\n            }\n        }\n        else {\n            let markType = this.parser.schema.marks[rule.mark];\n            mark = markType.create(rule.attrs);\n            this.addPendingMark(mark);\n        }\n        let startIn = this.top;\n        if (nodeType && nodeType.isLeaf) {\n            this.findInside(dom);\n        }\n        else if (continueAfter) {\n            this.addElement(dom, continueAfter);\n        }\n        else if (rule.getContent) {\n            this.findInside(dom);\n            rule.getContent(dom, this.parser.schema).forEach(node => this.insertNode(node));\n        }\n        else {\n            let contentDOM = dom;\n            if (typeof rule.contentElement == \"string\")\n                contentDOM = dom.querySelector(rule.contentElement);\n            else if (typeof rule.contentElement == \"function\")\n                contentDOM = rule.contentElement(dom);\n            else if (rule.contentElement)\n                contentDOM = rule.contentElement;\n            this.findAround(dom, contentDOM, true);\n            this.addAll(contentDOM);\n        }\n        if (sync && this.sync(startIn))\n            this.open--;\n        if (mark)\n            this.removePendingMark(mark, startIn);\n    }\n    // Add all child nodes between `startIndex` and `endIndex` (or the\n    // whole node, if not given). If `sync` is passed, use it to\n    // synchronize after every block element.\n    addAll(parent, startIndex, endIndex) {\n        let index = startIndex || 0;\n        for (let dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild, end = endIndex == null ? null : parent.childNodes[endIndex]; dom != end; dom = dom.nextSibling, ++index) {\n            this.findAtPoint(parent, index);\n            this.addDOM(dom);\n        }\n        this.findAtPoint(parent, index);\n    }\n    // Try to find a way to fit the given node type into the current\n    // context. May add intermediate wrappers and/or leave non-solid\n    // nodes that we're in.\n    findPlace(node) {\n        let route, sync;\n        for (let depth = this.open; depth >= 0; depth--) {\n            let cx = this.nodes[depth];\n            let found = cx.findWrapping(node);\n            if (found && (!route || route.length > found.length)) {\n                route = found;\n                sync = cx;\n                if (!found.length)\n                    break;\n            }\n            if (cx.solid)\n                break;\n        }\n        if (!route)\n            return false;\n        this.sync(sync);\n        for (let i = 0; i < route.length; i++)\n            this.enterInner(route[i], null, false);\n        return true;\n    }\n    // Try to insert the given node, adjusting the context when needed.\n    insertNode(node) {\n        if (node.isInline && this.needsBlock && !this.top.type) {\n            let block = this.textblockFromContext();\n            if (block)\n                this.enterInner(block);\n        }\n        if (this.findPlace(node)) {\n            this.closeExtra();\n            let top = this.top;\n            top.applyPending(node.type);\n            if (top.match)\n                top.match = top.match.matchType(node.type);\n            let marks = top.activeMarks;\n            for (let i = 0; i < node.marks.length; i++)\n                if (!top.type || top.type.allowsMarkType(node.marks[i].type))\n                    marks = node.marks[i].addToSet(marks);\n            top.content.push(node.mark(marks));\n            return true;\n        }\n        return false;\n    }\n    // Try to start a node of the given type, adjusting the context when\n    // necessary.\n    enter(type, attrs, preserveWS) {\n        let ok = this.findPlace(type.create(attrs));\n        if (ok)\n            this.enterInner(type, attrs, true, preserveWS);\n        return ok;\n    }\n    // Open a node of the given type\n    enterInner(type, attrs = null, solid = false, preserveWS) {\n        this.closeExtra();\n        let top = this.top;\n        top.applyPending(type);\n        top.match = top.match && top.match.matchType(type);\n        let options = wsOptionsFor(type, preserveWS, top.options);\n        if ((top.options & OPT_OPEN_LEFT) && top.content.length == 0)\n            options |= OPT_OPEN_LEFT;\n        this.nodes.push(new NodeContext(type, attrs, top.activeMarks, top.pendingMarks, solid, null, options));\n        this.open++;\n    }\n    // Make sure all nodes above this.open are finished and added to\n    // their parents\n    closeExtra(openEnd = false) {\n        let i = this.nodes.length - 1;\n        if (i > this.open) {\n            for (; i > this.open; i--)\n                this.nodes[i - 1].content.push(this.nodes[i].finish(openEnd));\n            this.nodes.length = this.open + 1;\n        }\n    }\n    finish() {\n        this.open = 0;\n        this.closeExtra(this.isOpen);\n        return this.nodes[0].finish(this.isOpen || this.options.topOpen);\n    }\n    sync(to) {\n        for (let i = this.open; i >= 0; i--)\n            if (this.nodes[i] == to) {\n                this.open = i;\n                return true;\n            }\n        return false;\n    }\n    get currentPos() {\n        this.closeExtra();\n        let pos = 0;\n        for (let i = this.open; i >= 0; i--) {\n            let content = this.nodes[i].content;\n            for (let j = content.length - 1; j >= 0; j--)\n                pos += content[j].nodeSize;\n            if (i)\n                pos++;\n        }\n        return pos;\n    }\n    findAtPoint(parent, offset) {\n        if (this.find)\n            for (let i = 0; i < this.find.length; i++) {\n                if (this.find[i].node == parent && this.find[i].offset == offset)\n                    this.find[i].pos = this.currentPos;\n            }\n    }\n    findInside(parent) {\n        if (this.find)\n            for (let i = 0; i < this.find.length; i++) {\n                if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node))\n                    this.find[i].pos = this.currentPos;\n            }\n    }\n    findAround(parent, content, before) {\n        if (parent != content && this.find)\n            for (let i = 0; i < this.find.length; i++) {\n                if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node)) {\n                    let pos = content.compareDocumentPosition(this.find[i].node);\n                    if (pos & (before ? 2 : 4))\n                        this.find[i].pos = this.currentPos;\n                }\n            }\n    }\n    findInText(textNode) {\n        if (this.find)\n            for (let i = 0; i < this.find.length; i++) {\n                if (this.find[i].node == textNode)\n                    this.find[i].pos = this.currentPos - (textNode.nodeValue.length - this.find[i].offset);\n            }\n    }\n    // Determines whether the given context string matches this context.\n    matchesContext(context) {\n        if (context.indexOf(\"|\") > -1)\n            return context.split(/\\s*\\|\\s*/).some(this.matchesContext, this);\n        let parts = context.split(\"/\");\n        let option = this.options.context;\n        let useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type);\n        let minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1);\n        let match = (i, depth) => {\n            for (; i >= 0; i--) {\n                let part = parts[i];\n                if (part == \"\") {\n                    if (i == parts.length - 1 || i == 0)\n                        continue;\n                    for (; depth >= minDepth; depth--)\n                        if (match(i - 1, depth))\n                            return true;\n                    return false;\n                }\n                else {\n                    let next = depth > 0 || (depth == 0 && useRoot) ? this.nodes[depth].type\n                        : option && depth >= minDepth ? option.node(depth - minDepth).type\n                            : null;\n                    if (!next || (next.name != part && next.groups.indexOf(part) == -1))\n                        return false;\n                    depth--;\n                }\n            }\n            return true;\n        };\n        return match(parts.length - 1, this.open);\n    }\n    textblockFromContext() {\n        let $context = this.options.context;\n        if ($context)\n            for (let d = $context.depth; d >= 0; d--) {\n                let deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType;\n                if (deflt && deflt.isTextblock && deflt.defaultAttrs)\n                    return deflt;\n            }\n        for (let name in this.parser.schema.nodes) {\n            let type = this.parser.schema.nodes[name];\n            if (type.isTextblock && type.defaultAttrs)\n                return type;\n        }\n    }\n    addPendingMark(mark) {\n        let found = findSameMarkInSet(mark, this.top.pendingMarks);\n        if (found)\n            this.top.stashMarks.push(found);\n        this.top.pendingMarks = mark.addToSet(this.top.pendingMarks);\n    }\n    removePendingMark(mark, upto) {\n        for (let depth = this.open; depth >= 0; depth--) {\n            let level = this.nodes[depth];\n            let found = level.pendingMarks.lastIndexOf(mark);\n            if (found > -1) {\n                level.pendingMarks = mark.removeFromSet(level.pendingMarks);\n            }\n            else {\n                level.activeMarks = mark.removeFromSet(level.activeMarks);\n                let stashMark = level.popFromStashMark(mark);\n                if (stashMark && level.type && level.type.allowsMarkType(stashMark.type))\n                    level.activeMarks = stashMark.addToSet(level.activeMarks);\n            }\n            if (level == upto)\n                break;\n        }\n    }\n}\n// Kludge to work around directly nested list nodes produced by some\n// tools and allowed by browsers to mean that the nested list is\n// actually part of the list item above it.\nfunction normalizeList(dom) {\n    for (let child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {\n        let name = child.nodeType == 1 ? child.nodeName.toLowerCase() : null;\n        if (name && listTags.hasOwnProperty(name) && prevItem) {\n            prevItem.appendChild(child);\n            child = prevItem;\n        }\n        else if (name == \"li\") {\n            prevItem = child;\n        }\n        else if (name) {\n            prevItem = null;\n        }\n    }\n}\n// Apply a CSS selector.\nfunction matches(dom, selector) {\n    return (dom.matches || dom.msMatchesSelector || dom.webkitMatchesSelector || dom.mozMatchesSelector).call(dom, selector);\n}\n// Tokenize a style attribute into property/value pairs.\nfunction parseStyles(style) {\n    let re = /\\s*([\\w-]+)\\s*:\\s*([^;]+)/g, m, result = [];\n    while (m = re.exec(style))\n        result.push(m[1], m[2].trim());\n    return result;\n}\nfunction copy(obj) {\n    let copy = {};\n    for (let prop in obj)\n        copy[prop] = obj[prop];\n    return copy;\n}\n// Used when finding a mark at the top level of a fragment parse.\n// Checks whether it would be reasonable to apply a given mark type to\n// a given node, by looking at the way the mark occurs in the schema.\nfunction markMayApply(markType, nodeType) {\n    let nodes = nodeType.schema.nodes;\n    for (let name in nodes) {\n        let parent = nodes[name];\n        if (!parent.allowsMarkType(markType))\n            continue;\n        let seen = [], scan = (match) => {\n            seen.push(match);\n            for (let i = 0; i < match.edgeCount; i++) {\n                let { type, next } = match.edge(i);\n                if (type == nodeType)\n                    return true;\n                if (seen.indexOf(next) < 0 && scan(next))\n                    return true;\n            }\n        };\n        if (scan(parent.contentMatch))\n            return true;\n    }\n}\nfunction findSameMarkInSet(mark, set) {\n    for (let i = 0; i < set.length; i++) {\n        if (mark.eq(set[i]))\n            return set[i];\n    }\n}\n\n/**\nA DOM serializer knows how to convert ProseMirror nodes and\nmarks of various types to DOM nodes.\n*/\nclass DOMSerializer {\n    /**\n    Create a serializer. `nodes` should map node names to functions\n    that take a node and return a description of the corresponding\n    DOM. `marks` does the same for mark names, but also gets an\n    argument that tells it whether the mark's content is block or\n    inline content (for typical use, it'll always be inline). A mark\n    serializer may be `null` to indicate that marks of that type\n    should not be serialized.\n    */\n    constructor(\n    /**\n    The node serialization functions.\n    */\n    nodes, \n    /**\n    The mark serialization functions.\n    */\n    marks) {\n        this.nodes = nodes;\n        this.marks = marks;\n    }\n    /**\n    Serialize the content of this fragment to a DOM fragment. When\n    not in the browser, the `document` option, containing a DOM\n    document, should be passed so that the serializer can create\n    nodes.\n    */\n    serializeFragment(fragment, options = {}, target) {\n        if (!target)\n            target = doc(options).createDocumentFragment();\n        let top = target, active = [];\n        fragment.forEach(node => {\n            if (active.length || node.marks.length) {\n                let keep = 0, rendered = 0;\n                while (keep < active.length && rendered < node.marks.length) {\n                    let next = node.marks[rendered];\n                    if (!this.marks[next.type.name]) {\n                        rendered++;\n                        continue;\n                    }\n                    if (!next.eq(active[keep][0]) || next.type.spec.spanning === false)\n                        break;\n                    keep++;\n                    rendered++;\n                }\n                while (keep < active.length)\n                    top = active.pop()[1];\n                while (rendered < node.marks.length) {\n                    let add = node.marks[rendered++];\n                    let markDOM = this.serializeMark(add, node.isInline, options);\n                    if (markDOM) {\n                        active.push([add, top]);\n                        top.appendChild(markDOM.dom);\n                        top = markDOM.contentDOM || markDOM.dom;\n                    }\n                }\n            }\n            top.appendChild(this.serializeNodeInner(node, options));\n        });\n        return target;\n    }\n    /**\n    @internal\n    */\n    serializeNodeInner(node, options) {\n        let { dom, contentDOM } = DOMSerializer.renderSpec(doc(options), this.nodes[node.type.name](node));\n        if (contentDOM) {\n            if (node.isLeaf)\n                throw new RangeError(\"Content hole not allowed in a leaf node spec\");\n            this.serializeFragment(node.content, options, contentDOM);\n        }\n        return dom;\n    }\n    /**\n    Serialize this node to a DOM node. This can be useful when you\n    need to serialize a part of a document, as opposed to the whole\n    document. To serialize a whole document, use\n    [`serializeFragment`](https://prosemirror.net/docs/ref/#model.DOMSerializer.serializeFragment) on\n    its [content](https://prosemirror.net/docs/ref/#model.Node.content).\n    */\n    serializeNode(node, options = {}) {\n        let dom = this.serializeNodeInner(node, options);\n        for (let i = node.marks.length - 1; i >= 0; i--) {\n            let wrap = this.serializeMark(node.marks[i], node.isInline, options);\n            if (wrap) {\n                (wrap.contentDOM || wrap.dom).appendChild(dom);\n                dom = wrap.dom;\n            }\n        }\n        return dom;\n    }\n    /**\n    @internal\n    */\n    serializeMark(mark, inline, options = {}) {\n        let toDOM = this.marks[mark.type.name];\n        return toDOM && DOMSerializer.renderSpec(doc(options), toDOM(mark, inline));\n    }\n    /**\n    Render an [output spec](https://prosemirror.net/docs/ref/#model.DOMOutputSpec) to a DOM node. If\n    the spec has a hole (zero) in it, `contentDOM` will point at the\n    node with the hole.\n    */\n    static renderSpec(doc, structure, xmlNS = null) {\n        if (typeof structure == \"string\")\n            return { dom: doc.createTextNode(structure) };\n        if (structure.nodeType != null)\n            return { dom: structure };\n        if (structure.dom && structure.dom.nodeType != null)\n            return structure;\n        let tagName = structure[0], space = tagName.indexOf(\" \");\n        if (space > 0) {\n            xmlNS = tagName.slice(0, space);\n            tagName = tagName.slice(space + 1);\n        }\n        let contentDOM;\n        let dom = (xmlNS ? doc.createElementNS(xmlNS, tagName) : doc.createElement(tagName));\n        let attrs = structure[1], start = 1;\n        if (attrs && typeof attrs == \"object\" && attrs.nodeType == null && !Array.isArray(attrs)) {\n            start = 2;\n            for (let name in attrs)\n                if (attrs[name] != null) {\n                    let space = name.indexOf(\" \");\n                    if (space > 0)\n                        dom.setAttributeNS(name.slice(0, space), name.slice(space + 1), attrs[name]);\n                    else\n                        dom.setAttribute(name, attrs[name]);\n                }\n        }\n        for (let i = start; i < structure.length; i++) {\n            let child = structure[i];\n            if (child === 0) {\n                if (i < structure.length - 1 || i > start)\n                    throw new RangeError(\"Content hole must be the only child of its parent node\");\n                return { dom, contentDOM: dom };\n            }\n            else {\n                let { dom: inner, contentDOM: innerContent } = DOMSerializer.renderSpec(doc, child, xmlNS);\n                dom.appendChild(inner);\n                if (innerContent) {\n                    if (contentDOM)\n                        throw new RangeError(\"Multiple content holes\");\n                    contentDOM = innerContent;\n                }\n            }\n        }\n        return { dom, contentDOM };\n    }\n    /**\n    Build a serializer using the [`toDOM`](https://prosemirror.net/docs/ref/#model.NodeSpec.toDOM)\n    properties in a schema's node and mark specs.\n    */\n    static fromSchema(schema) {\n        return schema.cached.domSerializer ||\n            (schema.cached.domSerializer = new DOMSerializer(this.nodesFromSchema(schema), this.marksFromSchema(schema)));\n    }\n    /**\n    Gather the serializers in a schema's node specs into an object.\n    This can be useful as a base to build a custom serializer from.\n    */\n    static nodesFromSchema(schema) {\n        let result = gatherToDOM(schema.nodes);\n        if (!result.text)\n            result.text = node => node.text;\n        return result;\n    }\n    /**\n    Gather the serializers in a schema's mark specs into an object.\n    */\n    static marksFromSchema(schema) {\n        return gatherToDOM(schema.marks);\n    }\n}\nfunction gatherToDOM(obj) {\n    let result = {};\n    for (let name in obj) {\n        let toDOM = obj[name].spec.toDOM;\n        if (toDOM)\n            result[name] = toDOM;\n    }\n    return result;\n}\nfunction doc(options) {\n    return options.document || window.document;\n}\n\nexport { ContentMatch, DOMParser, DOMSerializer, Fragment, Mark, MarkType, Node, NodeRange, NodeType, ReplaceError, ResolvedPos, Schema, Slice };\n","import { Slice, Fragment, Mark, Node } from 'prosemirror-model';\nimport { ReplaceStep, ReplaceAroundStep, Transform } from 'prosemirror-transform';\n\nconst classesById = Object.create(null);\n/**\nSuperclass for editor selections. Every selection type should\nextend this. Should not be instantiated directly.\n*/\nclass Selection {\n    /**\n    Initialize a selection with the head and anchor and ranges. If no\n    ranges are given, constructs a single range across `$anchor` and\n    `$head`.\n    */\n    constructor(\n    /**\n    The resolved anchor of the selection (the side that stays in\n    place when the selection is modified).\n    */\n    $anchor, \n    /**\n    The resolved head of the selection (the side that moves when\n    the selection is modified).\n    */\n    $head, ranges) {\n        this.$anchor = $anchor;\n        this.$head = $head;\n        this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];\n    }\n    /**\n    The selection's anchor, as an unresolved position.\n    */\n    get anchor() { return this.$anchor.pos; }\n    /**\n    The selection's head.\n    */\n    get head() { return this.$head.pos; }\n    /**\n    The lower bound of the selection's main range.\n    */\n    get from() { return this.$from.pos; }\n    /**\n    The upper bound of the selection's main range.\n    */\n    get to() { return this.$to.pos; }\n    /**\n    The resolved lower  bound of the selection's main range.\n    */\n    get $from() {\n        return this.ranges[0].$from;\n    }\n    /**\n    The resolved upper bound of the selection's main range.\n    */\n    get $to() {\n        return this.ranges[0].$to;\n    }\n    /**\n    Indicates whether the selection contains any content.\n    */\n    get empty() {\n        let ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++)\n            if (ranges[i].$from.pos != ranges[i].$to.pos)\n                return false;\n        return true;\n    }\n    /**\n    Get the content of this selection as a slice.\n    */\n    content() {\n        return this.$from.doc.slice(this.from, this.to, true);\n    }\n    /**\n    Replace the selection with a slice or, if no slice is given,\n    delete the selection. Will append to the given transaction.\n    */\n    replace(tr, content = Slice.empty) {\n        // Put the new selection at the position after the inserted\n        // content. When that ended in an inline node, search backwards,\n        // to get the position after that node. If not, search forward.\n        let lastNode = content.content.lastChild, lastParent = null;\n        for (let i = 0; i < content.openEnd; i++) {\n            lastParent = lastNode;\n            lastNode = lastNode.lastChild;\n        }\n        let mapFrom = tr.steps.length, ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++) {\n            let { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n            tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i ? Slice.empty : content);\n            if (i == 0)\n                selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1);\n        }\n    }\n    /**\n    Replace the selection with the given node, appending the changes\n    to the given transaction.\n    */\n    replaceWith(tr, node) {\n        let mapFrom = tr.steps.length, ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++) {\n            let { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n            let from = mapping.map($from.pos), to = mapping.map($to.pos);\n            if (i) {\n                tr.deleteRange(from, to);\n            }\n            else {\n                tr.replaceRangeWith(from, to, node);\n                selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1);\n            }\n        }\n    }\n    /**\n    Find a valid cursor or leaf node selection starting at the given\n    position and searching back if `dir` is negative, and forward if\n    positive. When `textOnly` is true, only consider cursor\n    selections. Will return null when no valid selection position is\n    found.\n    */\n    static findFrom($pos, dir, textOnly = false) {\n        let inner = $pos.parent.inlineContent ? new TextSelection($pos)\n            : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);\n        if (inner)\n            return inner;\n        for (let depth = $pos.depth - 1; depth >= 0; depth--) {\n            let found = dir < 0\n                ? findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)\n                : findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly);\n            if (found)\n                return found;\n        }\n        return null;\n    }\n    /**\n    Find a valid cursor or leaf node selection near the given\n    position. Searches forward first by default, but if `bias` is\n    negative, it will search backwards first.\n    */\n    static near($pos, bias = 1) {\n        return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0));\n    }\n    /**\n    Find the cursor or leaf node selection closest to the start of\n    the given document. Will return an\n    [`AllSelection`](https://prosemirror.net/docs/ref/#state.AllSelection) if no valid position\n    exists.\n    */\n    static atStart(doc) {\n        return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc);\n    }\n    /**\n    Find the cursor or leaf node selection closest to the end of the\n    given document.\n    */\n    static atEnd(doc) {\n        return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc);\n    }\n    /**\n    Deserialize the JSON representation of a selection. Must be\n    implemented for custom classes (as a static class method).\n    */\n    static fromJSON(doc, json) {\n        if (!json || !json.type)\n            throw new RangeError(\"Invalid input for Selection.fromJSON\");\n        let cls = classesById[json.type];\n        if (!cls)\n            throw new RangeError(`No selection type ${json.type} defined`);\n        return cls.fromJSON(doc, json);\n    }\n    /**\n    To be able to deserialize selections from JSON, custom selection\n    classes must register themselves with an ID string, so that they\n    can be disambiguated. Try to pick something that's unlikely to\n    clash with classes from other modules.\n    */\n    static jsonID(id, selectionClass) {\n        if (id in classesById)\n            throw new RangeError(\"Duplicate use of selection JSON ID \" + id);\n        classesById[id] = selectionClass;\n        selectionClass.prototype.jsonID = id;\n        return selectionClass;\n    }\n    /**\n    Get a [bookmark](https://prosemirror.net/docs/ref/#state.SelectionBookmark) for this selection,\n    which is a value that can be mapped without having access to a\n    current document, and later resolved to a real selection for a\n    given document again. (This is used mostly by the history to\n    track and restore old selections.) The default implementation of\n    this method just converts the selection to a text selection and\n    returns the bookmark for that.\n    */\n    getBookmark() {\n        return TextSelection.between(this.$anchor, this.$head).getBookmark();\n    }\n}\nSelection.prototype.visible = true;\n/**\nRepresents a selected range in a document.\n*/\nclass SelectionRange {\n    /**\n    Create a range.\n    */\n    constructor(\n    /**\n    The lower bound of the range.\n    */\n    $from, \n    /**\n    The upper bound of the range.\n    */\n    $to) {\n        this.$from = $from;\n        this.$to = $to;\n    }\n}\nlet warnedAboutTextSelection = false;\nfunction checkTextSelection($pos) {\n    if (!warnedAboutTextSelection && !$pos.parent.inlineContent) {\n        warnedAboutTextSelection = true;\n        console[\"warn\"](\"TextSelection endpoint not pointing into a node with inline content (\" + $pos.parent.type.name + \")\");\n    }\n}\n/**\nA text selection represents a classical editor selection, with a\nhead (the moving side) and anchor (immobile side), both of which\npoint into textblock nodes. It can be empty (a regular cursor\nposition).\n*/\nclass TextSelection extends Selection {\n    /**\n    Construct a text selection between the given points.\n    */\n    constructor($anchor, $head = $anchor) {\n        checkTextSelection($anchor);\n        checkTextSelection($head);\n        super($anchor, $head);\n    }\n    /**\n    Returns a resolved position if this is a cursor selection (an\n    empty text selection), and null otherwise.\n    */\n    get $cursor() { return this.$anchor.pos == this.$head.pos ? this.$head : null; }\n    map(doc, mapping) {\n        let $head = doc.resolve(mapping.map(this.head));\n        if (!$head.parent.inlineContent)\n            return Selection.near($head);\n        let $anchor = doc.resolve(mapping.map(this.anchor));\n        return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head);\n    }\n    replace(tr, content = Slice.empty) {\n        super.replace(tr, content);\n        if (content == Slice.empty) {\n            let marks = this.$from.marksAcross(this.$to);\n            if (marks)\n                tr.ensureMarks(marks);\n        }\n    }\n    eq(other) {\n        return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head;\n    }\n    getBookmark() {\n        return new TextBookmark(this.anchor, this.head);\n    }\n    toJSON() {\n        return { type: \"text\", anchor: this.anchor, head: this.head };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(doc, json) {\n        if (typeof json.anchor != \"number\" || typeof json.head != \"number\")\n            throw new RangeError(\"Invalid input for TextSelection.fromJSON\");\n        return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head));\n    }\n    /**\n    Create a text selection from non-resolved positions.\n    */\n    static create(doc, anchor, head = anchor) {\n        let $anchor = doc.resolve(anchor);\n        return new this($anchor, head == anchor ? $anchor : doc.resolve(head));\n    }\n    /**\n    Return a text selection that spans the given positions or, if\n    they aren't text positions, find a text selection near them.\n    `bias` determines whether the method searches forward (default)\n    or backwards (negative number) first. Will fall back to calling\n    [`Selection.near`](https://prosemirror.net/docs/ref/#state.Selection^near) when the document\n    doesn't contain a valid text position.\n    */\n    static between($anchor, $head, bias) {\n        let dPos = $anchor.pos - $head.pos;\n        if (!bias || dPos)\n            bias = dPos >= 0 ? 1 : -1;\n        if (!$head.parent.inlineContent) {\n            let found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);\n            if (found)\n                $head = found.$head;\n            else\n                return Selection.near($head, bias);\n        }\n        if (!$anchor.parent.inlineContent) {\n            if (dPos == 0) {\n                $anchor = $head;\n            }\n            else {\n                $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;\n                if (($anchor.pos < $head.pos) != (dPos < 0))\n                    $anchor = $head;\n            }\n        }\n        return new TextSelection($anchor, $head);\n    }\n}\nSelection.jsonID(\"text\", TextSelection);\nclass TextBookmark {\n    constructor(anchor, head) {\n        this.anchor = anchor;\n        this.head = head;\n    }\n    map(mapping) {\n        return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head));\n    }\n    resolve(doc) {\n        return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head));\n    }\n}\n/**\nA node selection is a selection that points at a single node. All\nnodes marked [selectable](https://prosemirror.net/docs/ref/#model.NodeSpec.selectable) can be the\ntarget of a node selection. In such a selection, `from` and `to`\npoint directly before and after the selected node, `anchor` equals\n`from`, and `head` equals `to`..\n*/\nclass NodeSelection extends Selection {\n    /**\n    Create a node selection. Does not verify the validity of its\n    argument.\n    */\n    constructor($pos) {\n        let node = $pos.nodeAfter;\n        let $end = $pos.node(0).resolve($pos.pos + node.nodeSize);\n        super($pos, $end);\n        this.node = node;\n    }\n    map(doc, mapping) {\n        let { deleted, pos } = mapping.mapResult(this.anchor);\n        let $pos = doc.resolve(pos);\n        if (deleted)\n            return Selection.near($pos);\n        return new NodeSelection($pos);\n    }\n    content() {\n        return new Slice(Fragment.from(this.node), 0, 0);\n    }\n    eq(other) {\n        return other instanceof NodeSelection && other.anchor == this.anchor;\n    }\n    toJSON() {\n        return { type: \"node\", anchor: this.anchor };\n    }\n    getBookmark() { return new NodeBookmark(this.anchor); }\n    /**\n    @internal\n    */\n    static fromJSON(doc, json) {\n        if (typeof json.anchor != \"number\")\n            throw new RangeError(\"Invalid input for NodeSelection.fromJSON\");\n        return new NodeSelection(doc.resolve(json.anchor));\n    }\n    /**\n    Create a node selection from non-resolved positions.\n    */\n    static create(doc, from) {\n        return new NodeSelection(doc.resolve(from));\n    }\n    /**\n    Determines whether the given node may be selected as a node\n    selection.\n    */\n    static isSelectable(node) {\n        return !node.isText && node.type.spec.selectable !== false;\n    }\n}\nNodeSelection.prototype.visible = false;\nSelection.jsonID(\"node\", NodeSelection);\nclass NodeBookmark {\n    constructor(anchor) {\n        this.anchor = anchor;\n    }\n    map(mapping) {\n        let { deleted, pos } = mapping.mapResult(this.anchor);\n        return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos);\n    }\n    resolve(doc) {\n        let $pos = doc.resolve(this.anchor), node = $pos.nodeAfter;\n        if (node && NodeSelection.isSelectable(node))\n            return new NodeSelection($pos);\n        return Selection.near($pos);\n    }\n}\n/**\nA selection type that represents selecting the whole document\n(which can not necessarily be expressed with a text selection, when\nthere are for example leaf block nodes at the start or end of the\ndocument).\n*/\nclass AllSelection extends Selection {\n    /**\n    Create an all-selection over the given document.\n    */\n    constructor(doc) {\n        super(doc.resolve(0), doc.resolve(doc.content.size));\n    }\n    replace(tr, content = Slice.empty) {\n        if (content == Slice.empty) {\n            tr.delete(0, tr.doc.content.size);\n            let sel = Selection.atStart(tr.doc);\n            if (!sel.eq(tr.selection))\n                tr.setSelection(sel);\n        }\n        else {\n            super.replace(tr, content);\n        }\n    }\n    toJSON() { return { type: \"all\" }; }\n    /**\n    @internal\n    */\n    static fromJSON(doc) { return new AllSelection(doc); }\n    map(doc) { return new AllSelection(doc); }\n    eq(other) { return other instanceof AllSelection; }\n    getBookmark() { return AllBookmark; }\n}\nSelection.jsonID(\"all\", AllSelection);\nconst AllBookmark = {\n    map() { return this; },\n    resolve(doc) { return new AllSelection(doc); }\n};\n// FIXME we'll need some awareness of text direction when scanning for selections\n// Try to find a selection inside the given node. `pos` points at the\n// position where the search starts. When `text` is true, only return\n// text selections.\nfunction findSelectionIn(doc, node, pos, index, dir, text = false) {\n    if (node.inlineContent)\n        return TextSelection.create(doc, pos);\n    for (let i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {\n        let child = node.child(i);\n        if (!child.isAtom) {\n            let inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);\n            if (inner)\n                return inner;\n        }\n        else if (!text && NodeSelection.isSelectable(child)) {\n            return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0));\n        }\n        pos += child.nodeSize * dir;\n    }\n    return null;\n}\nfunction selectionToInsertionEnd(tr, startLen, bias) {\n    let last = tr.steps.length - 1;\n    if (last < startLen)\n        return;\n    let step = tr.steps[last];\n    if (!(step instanceof ReplaceStep || step instanceof ReplaceAroundStep))\n        return;\n    let map = tr.mapping.maps[last], end;\n    map.forEach((_from, _to, _newFrom, newTo) => { if (end == null)\n        end = newTo; });\n    tr.setSelection(Selection.near(tr.doc.resolve(end), bias));\n}\n\nconst UPDATED_SEL = 1, UPDATED_MARKS = 2, UPDATED_SCROLL = 4;\n/**\nAn editor state transaction, which can be applied to a state to\ncreate an updated state. Use\n[`EditorState.tr`](https://prosemirror.net/docs/ref/#state.EditorState.tr) to create an instance.\n\nTransactions track changes to the document (they are a subclass of\n[`Transform`](https://prosemirror.net/docs/ref/#transform.Transform)), but also other state changes,\nlike selection updates and adjustments of the set of [stored\nmarks](https://prosemirror.net/docs/ref/#state.EditorState.storedMarks). In addition, you can store\nmetadata properties in a transaction, which are extra pieces of\ninformation that client code or plugins can use to describe what a\ntransaction represents, so that they can update their [own\nstate](https://prosemirror.net/docs/ref/#state.StateField) accordingly.\n\nThe [editor view](https://prosemirror.net/docs/ref/#view.EditorView) uses a few metadata\nproperties: it will attach a property `\"pointer\"` with the value\n`true` to selection transactions directly caused by mouse or touch\ninput, a `\"composition\"` property holding an ID identifying the\ncomposition that caused it to transactions caused by composed DOM\ninput, and a `\"uiEvent\"` property of that may be `\"paste\"`,\n`\"cut\"`, or `\"drop\"`.\n*/\nclass Transaction extends Transform {\n    /**\n    @internal\n    */\n    constructor(state) {\n        super(state.doc);\n        // The step count for which the current selection is valid.\n        this.curSelectionFor = 0;\n        // Bitfield to track which aspects of the state were updated by\n        // this transaction.\n        this.updated = 0;\n        // Object used to store metadata properties for the transaction.\n        this.meta = Object.create(null);\n        this.time = Date.now();\n        this.curSelection = state.selection;\n        this.storedMarks = state.storedMarks;\n    }\n    /**\n    The transaction's current selection. This defaults to the editor\n    selection [mapped](https://prosemirror.net/docs/ref/#state.Selection.map) through the steps in the\n    transaction, but can be overwritten with\n    [`setSelection`](https://prosemirror.net/docs/ref/#state.Transaction.setSelection).\n    */\n    get selection() {\n        if (this.curSelectionFor < this.steps.length) {\n            this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor));\n            this.curSelectionFor = this.steps.length;\n        }\n        return this.curSelection;\n    }\n    /**\n    Update the transaction's current selection. Will determine the\n    selection that the editor gets when the transaction is applied.\n    */\n    setSelection(selection) {\n        if (selection.$from.doc != this.doc)\n            throw new RangeError(\"Selection passed to setSelection must point at the current document\");\n        this.curSelection = selection;\n        this.curSelectionFor = this.steps.length;\n        this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS;\n        this.storedMarks = null;\n        return this;\n    }\n    /**\n    Whether the selection was explicitly updated by this transaction.\n    */\n    get selectionSet() {\n        return (this.updated & UPDATED_SEL) > 0;\n    }\n    /**\n    Set the current stored marks.\n    */\n    setStoredMarks(marks) {\n        this.storedMarks = marks;\n        this.updated |= UPDATED_MARKS;\n        return this;\n    }\n    /**\n    Make sure the current stored marks or, if that is null, the marks\n    at the selection, match the given set of marks. Does nothing if\n    this is already the case.\n    */\n    ensureMarks(marks) {\n        if (!Mark.sameSet(this.storedMarks || this.selection.$from.marks(), marks))\n            this.setStoredMarks(marks);\n        return this;\n    }\n    /**\n    Add a mark to the set of stored marks.\n    */\n    addStoredMark(mark) {\n        return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()));\n    }\n    /**\n    Remove a mark or mark type from the set of stored marks.\n    */\n    removeStoredMark(mark) {\n        return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()));\n    }\n    /**\n    Whether the stored marks were explicitly set for this transaction.\n    */\n    get storedMarksSet() {\n        return (this.updated & UPDATED_MARKS) > 0;\n    }\n    /**\n    @internal\n    */\n    addStep(step, doc) {\n        super.addStep(step, doc);\n        this.updated = this.updated & ~UPDATED_MARKS;\n        this.storedMarks = null;\n    }\n    /**\n    Update the timestamp for the transaction.\n    */\n    setTime(time) {\n        this.time = time;\n        return this;\n    }\n    /**\n    Replace the current selection with the given slice.\n    */\n    replaceSelection(slice) {\n        this.selection.replace(this, slice);\n        return this;\n    }\n    /**\n    Replace the selection with the given node. When `inheritMarks` is\n    true and the content is inline, it inherits the marks from the\n    place where it is inserted.\n    */\n    replaceSelectionWith(node, inheritMarks = true) {\n        let selection = this.selection;\n        if (inheritMarks)\n            node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || Mark.none)));\n        selection.replaceWith(this, node);\n        return this;\n    }\n    /**\n    Delete the selection.\n    */\n    deleteSelection() {\n        this.selection.replace(this);\n        return this;\n    }\n    /**\n    Replace the given range, or the selection if no range is given,\n    with a text node containing the given string.\n    */\n    insertText(text, from, to) {\n        let schema = this.doc.type.schema;\n        if (from == null) {\n            if (!text)\n                return this.deleteSelection();\n            return this.replaceSelectionWith(schema.text(text), true);\n        }\n        else {\n            if (to == null)\n                to = from;\n            to = to == null ? from : to;\n            if (!text)\n                return this.deleteRange(from, to);\n            let marks = this.storedMarks;\n            if (!marks) {\n                let $from = this.doc.resolve(from);\n                marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));\n            }\n            this.replaceRangeWith(from, to, schema.text(text, marks));\n            if (!this.selection.empty)\n                this.setSelection(Selection.near(this.selection.$to));\n            return this;\n        }\n    }\n    /**\n    Store a metadata property in this transaction, keyed either by\n    name or by plugin.\n    */\n    setMeta(key, value) {\n        this.meta[typeof key == \"string\" ? key : key.key] = value;\n        return this;\n    }\n    /**\n    Retrieve a metadata property for a given name or plugin.\n    */\n    getMeta(key) {\n        return this.meta[typeof key == \"string\" ? key : key.key];\n    }\n    /**\n    Returns true if this transaction doesn't contain any metadata,\n    and can thus safely be extended.\n    */\n    get isGeneric() {\n        for (let _ in this.meta)\n            return false;\n        return true;\n    }\n    /**\n    Indicate that the editor should scroll the selection into view\n    when updated to the state produced by this transaction.\n    */\n    scrollIntoView() {\n        this.updated |= UPDATED_SCROLL;\n        return this;\n    }\n    /**\n    True when this transaction has had `scrollIntoView` called on it.\n    */\n    get scrolledIntoView() {\n        return (this.updated & UPDATED_SCROLL) > 0;\n    }\n}\n\nfunction bind(f, self) {\n    return !self || !f ? f : f.bind(self);\n}\nclass FieldDesc {\n    constructor(name, desc, self) {\n        this.name = name;\n        this.init = bind(desc.init, self);\n        this.apply = bind(desc.apply, self);\n    }\n}\nconst baseFields = [\n    new FieldDesc(\"doc\", {\n        init(config) { return config.doc || config.schema.topNodeType.createAndFill(); },\n        apply(tr) { return tr.doc; }\n    }),\n    new FieldDesc(\"selection\", {\n        init(config, instance) { return config.selection || Selection.atStart(instance.doc); },\n        apply(tr) { return tr.selection; }\n    }),\n    new FieldDesc(\"storedMarks\", {\n        init(config) { return config.storedMarks || null; },\n        apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null; }\n    }),\n    new FieldDesc(\"scrollToSelection\", {\n        init() { return 0; },\n        apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev; }\n    })\n];\n// Object wrapping the part of a state object that stays the same\n// across transactions. Stored in the state's `config` property.\nclass Configuration {\n    constructor(schema, plugins) {\n        this.schema = schema;\n        this.plugins = [];\n        this.pluginsByKey = Object.create(null);\n        this.fields = baseFields.slice();\n        if (plugins)\n            plugins.forEach(plugin => {\n                if (this.pluginsByKey[plugin.key])\n                    throw new RangeError(\"Adding different instances of a keyed plugin (\" + plugin.key + \")\");\n                this.plugins.push(plugin);\n                this.pluginsByKey[plugin.key] = plugin;\n                if (plugin.spec.state)\n                    this.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin));\n            });\n    }\n}\n/**\nThe state of a ProseMirror editor is represented by an object of\nthis type. A state is a persistent data structure—it isn't\nupdated, but rather a new state value is computed from an old one\nusing the [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) method.\n\nA state holds a number of built-in fields, and plugins can\n[define](https://prosemirror.net/docs/ref/#state.PluginSpec.state) additional fields.\n*/\nclass EditorState {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    @internal\n    */\n    config) {\n        this.config = config;\n    }\n    /**\n    The schema of the state's document.\n    */\n    get schema() {\n        return this.config.schema;\n    }\n    /**\n    The plugins that are active in this state.\n    */\n    get plugins() {\n        return this.config.plugins;\n    }\n    /**\n    Apply the given transaction to produce a new state.\n    */\n    apply(tr) {\n        return this.applyTransaction(tr).state;\n    }\n    /**\n    @internal\n    */\n    filterTransaction(tr, ignore = -1) {\n        for (let i = 0; i < this.config.plugins.length; i++)\n            if (i != ignore) {\n                let plugin = this.config.plugins[i];\n                if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this))\n                    return false;\n            }\n        return true;\n    }\n    /**\n    Verbose variant of [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) that\n    returns the precise transactions that were applied (which might\n    be influenced by the [transaction\n    hooks](https://prosemirror.net/docs/ref/#state.PluginSpec.filterTransaction) of\n    plugins) along with the new state.\n    */\n    applyTransaction(rootTr) {\n        if (!this.filterTransaction(rootTr))\n            return { state: this, transactions: [] };\n        let trs = [rootTr], newState = this.applyInner(rootTr), seen = null;\n        // This loop repeatedly gives plugins a chance to respond to\n        // transactions as new transactions are added, making sure to only\n        // pass the transactions the plugin did not see before.\n        for (;;) {\n            let haveNew = false;\n            for (let i = 0; i < this.config.plugins.length; i++) {\n                let plugin = this.config.plugins[i];\n                if (plugin.spec.appendTransaction) {\n                    let n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this;\n                    let tr = n < trs.length &&\n                        plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState);\n                    if (tr && newState.filterTransaction(tr, i)) {\n                        tr.setMeta(\"appendedTransaction\", rootTr);\n                        if (!seen) {\n                            seen = [];\n                            for (let j = 0; j < this.config.plugins.length; j++)\n                                seen.push(j < i ? { state: newState, n: trs.length } : { state: this, n: 0 });\n                        }\n                        trs.push(tr);\n                        newState = newState.applyInner(tr);\n                        haveNew = true;\n                    }\n                    if (seen)\n                        seen[i] = { state: newState, n: trs.length };\n                }\n            }\n            if (!haveNew)\n                return { state: newState, transactions: trs };\n        }\n    }\n    /**\n    @internal\n    */\n    applyInner(tr) {\n        if (!tr.before.eq(this.doc))\n            throw new RangeError(\"Applying a mismatched transaction\");\n        let newInstance = new EditorState(this.config), fields = this.config.fields;\n        for (let i = 0; i < fields.length; i++) {\n            let field = fields[i];\n            newInstance[field.name] = field.apply(tr, this[field.name], this, newInstance);\n        }\n        return newInstance;\n    }\n    /**\n    Start a [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.\n    */\n    get tr() { return new Transaction(this); }\n    /**\n    Create a new state.\n    */\n    static create(config) {\n        let $config = new Configuration(config.doc ? config.doc.type.schema : config.schema, config.plugins);\n        let instance = new EditorState($config);\n        for (let i = 0; i < $config.fields.length; i++)\n            instance[$config.fields[i].name] = $config.fields[i].init(config, instance);\n        return instance;\n    }\n    /**\n    Create a new state based on this one, but with an adjusted set\n    of active plugins. State fields that exist in both sets of\n    plugins are kept unchanged. Those that no longer exist are\n    dropped, and those that are new are initialized using their\n    [`init`](https://prosemirror.net/docs/ref/#state.StateField.init) method, passing in the new\n    configuration object..\n    */\n    reconfigure(config) {\n        let $config = new Configuration(this.schema, config.plugins);\n        let fields = $config.fields, instance = new EditorState($config);\n        for (let i = 0; i < fields.length; i++) {\n            let name = fields[i].name;\n            instance[name] = this.hasOwnProperty(name) ? this[name] : fields[i].init(config, instance);\n        }\n        return instance;\n    }\n    /**\n    Serialize this state to JSON. If you want to serialize the state\n    of plugins, pass an object mapping property names to use in the\n    resulting JSON object to plugin objects. The argument may also be\n    a string or number, in which case it is ignored, to support the\n    way `JSON.stringify` calls `toString` methods.\n    */\n    toJSON(pluginFields) {\n        let result = { doc: this.doc.toJSON(), selection: this.selection.toJSON() };\n        if (this.storedMarks)\n            result.storedMarks = this.storedMarks.map(m => m.toJSON());\n        if (pluginFields && typeof pluginFields == 'object')\n            for (let prop in pluginFields) {\n                if (prop == \"doc\" || prop == \"selection\")\n                    throw new RangeError(\"The JSON fields `doc` and `selection` are reserved\");\n                let plugin = pluginFields[prop], state = plugin.spec.state;\n                if (state && state.toJSON)\n                    result[prop] = state.toJSON.call(plugin, this[plugin.key]);\n            }\n        return result;\n    }\n    /**\n    Deserialize a JSON representation of a state. `config` should\n    have at least a `schema` field, and should contain array of\n    plugins to initialize the state with. `pluginFields` can be used\n    to deserialize the state of plugins, by associating plugin\n    instances with the property names they use in the JSON object.\n    */\n    static fromJSON(config, json, pluginFields) {\n        if (!json)\n            throw new RangeError(\"Invalid input for EditorState.fromJSON\");\n        if (!config.schema)\n            throw new RangeError(\"Required config field 'schema' missing\");\n        let $config = new Configuration(config.schema, config.plugins);\n        let instance = new EditorState($config);\n        $config.fields.forEach(field => {\n            if (field.name == \"doc\") {\n                instance.doc = Node.fromJSON(config.schema, json.doc);\n            }\n            else if (field.name == \"selection\") {\n                instance.selection = Selection.fromJSON(instance.doc, json.selection);\n            }\n            else if (field.name == \"storedMarks\") {\n                if (json.storedMarks)\n                    instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON);\n            }\n            else {\n                if (pluginFields)\n                    for (let prop in pluginFields) {\n                        let plugin = pluginFields[prop], state = plugin.spec.state;\n                        if (plugin.key == field.name && state && state.fromJSON &&\n                            Object.prototype.hasOwnProperty.call(json, prop)) {\n                            instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance);\n                            return;\n                        }\n                    }\n                instance[field.name] = field.init(config, instance);\n            }\n        });\n        return instance;\n    }\n}\n\nfunction bindProps(obj, self, target) {\n    for (let prop in obj) {\n        let val = obj[prop];\n        if (val instanceof Function)\n            val = val.bind(self);\n        else if (prop == \"handleDOMEvents\")\n            val = bindProps(val, self, {});\n        target[prop] = val;\n    }\n    return target;\n}\n/**\nPlugins bundle functionality that can be added to an editor.\nThey are part of the [editor state](https://prosemirror.net/docs/ref/#state.EditorState) and\nmay influence that state and the view that contains it.\n*/\nclass Plugin {\n    /**\n    Create a plugin.\n    */\n    constructor(\n    /**\n    The plugin's [spec object](https://prosemirror.net/docs/ref/#state.PluginSpec).\n    */\n    spec) {\n        this.spec = spec;\n        /**\n        The [props](https://prosemirror.net/docs/ref/#view.EditorProps) exported by this plugin.\n        */\n        this.props = {};\n        if (spec.props)\n            bindProps(spec.props, this, this.props);\n        this.key = spec.key ? spec.key.key : createKey(\"plugin\");\n    }\n    /**\n    Extract the plugin's state field from an editor state.\n    */\n    getState(state) { return state[this.key]; }\n}\nconst keys = Object.create(null);\nfunction createKey(name) {\n    if (name in keys)\n        return name + \"$\" + ++keys[name];\n    keys[name] = 0;\n    return name + \"$\";\n}\n/**\nA key is used to [tag](https://prosemirror.net/docs/ref/#state.PluginSpec.key) plugins in a way\nthat makes it possible to find them, given an editor state.\nAssigning a key does mean only one plugin of that type can be\nactive in a state.\n*/\nclass PluginKey {\n    /**\n    Create a plugin key.\n    */\n    constructor(name = \"key\") { this.key = createKey(name); }\n    /**\n    Get the active plugin with this key, if any, from an editor\n    state.\n    */\n    get(state) { return state.config.pluginsByKey[this.key]; }\n    /**\n    Get the plugin's state from an editor state.\n    */\n    getState(state) { return state[this.key]; }\n}\n\nexport { AllSelection, EditorState, NodeSelection, Plugin, PluginKey, Selection, SelectionRange, TextSelection, Transaction };\n","import { ReplaceError, Slice, Fragment, MarkType, Mark } from 'prosemirror-model';\n\n// Recovery values encode a range index and an offset. They are\n// represented as numbers, because tons of them will be created when\n// mapping, for example, a large number of decorations. The number's\n// lower 16 bits provide the index, the remaining bits the offset.\n//\n// Note: We intentionally don't use bit shift operators to en- and\n// decode these, since those clip to 32 bits, which we might in rare\n// cases want to overflow. A 64-bit float can represent 48-bit\n// integers precisely.\nconst lower16 = 0xffff;\nconst factor16 = Math.pow(2, 16);\nfunction makeRecover(index, offset) { return index + offset * factor16; }\nfunction recoverIndex(value) { return value & lower16; }\nfunction recoverOffset(value) { return (value - (value & lower16)) / factor16; }\nconst DEL_BEFORE = 1, DEL_AFTER = 2, DEL_ACROSS = 4, DEL_SIDE = 8;\n/**\nAn object representing a mapped position with extra\ninformation.\n*/\nclass MapResult {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The mapped version of the position.\n    */\n    pos, \n    /**\n    @internal\n    */\n    delInfo, \n    /**\n    @internal\n    */\n    recover) {\n        this.pos = pos;\n        this.delInfo = delInfo;\n        this.recover = recover;\n    }\n    /**\n    Tells you whether the position was deleted, that is, whether the\n    step removed the token on the side queried (via the `assoc`)\n    argument from the document.\n    */\n    get deleted() { return (this.delInfo & DEL_SIDE) > 0; }\n    /**\n    Tells you whether the token before the mapped position was deleted.\n    */\n    get deletedBefore() { return (this.delInfo & (DEL_BEFORE | DEL_ACROSS)) > 0; }\n    /**\n    True when the token after the mapped position was deleted.\n    */\n    get deletedAfter() { return (this.delInfo & (DEL_AFTER | DEL_ACROSS)) > 0; }\n    /**\n    Tells whether any of the steps mapped through deletes across the\n    position (including both the token before and after the\n    position).\n    */\n    get deletedAcross() { return (this.delInfo & DEL_ACROSS) > 0; }\n}\n/**\nA map describing the deletions and insertions made by a step, which\ncan be used to find the correspondence between positions in the\npre-step version of a document and the same position in the\npost-step version.\n*/\nclass StepMap {\n    /**\n    Create a position map. The modifications to the document are\n    represented as an array of numbers, in which each group of three\n    represents a modified chunk as `[start, oldSize, newSize]`.\n    */\n    constructor(\n    /**\n    @internal\n    */\n    ranges, \n    /**\n    @internal\n    */\n    inverted = false) {\n        this.ranges = ranges;\n        this.inverted = inverted;\n        if (!ranges.length && StepMap.empty)\n            return StepMap.empty;\n    }\n    /**\n    @internal\n    */\n    recover(value) {\n        let diff = 0, index = recoverIndex(value);\n        if (!this.inverted)\n            for (let i = 0; i < index; i++)\n                diff += this.ranges[i * 3 + 2] - this.ranges[i * 3 + 1];\n        return this.ranges[index * 3] + diff + recoverOffset(value);\n    }\n    mapResult(pos, assoc = 1) { return this._map(pos, assoc, false); }\n    map(pos, assoc = 1) { return this._map(pos, assoc, true); }\n    /**\n    @internal\n    */\n    _map(pos, assoc, simple) {\n        let diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n        for (let i = 0; i < this.ranges.length; i += 3) {\n            let start = this.ranges[i] - (this.inverted ? diff : 0);\n            if (start > pos)\n                break;\n            let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex], end = start + oldSize;\n            if (pos <= end) {\n                let side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc;\n                let result = start + diff + (side < 0 ? 0 : newSize);\n                if (simple)\n                    return result;\n                let recover = pos == (assoc < 0 ? start : end) ? null : makeRecover(i / 3, pos - start);\n                let del = pos == start ? DEL_AFTER : pos == end ? DEL_BEFORE : DEL_ACROSS;\n                if (assoc < 0 ? pos != start : pos != end)\n                    del |= DEL_SIDE;\n                return new MapResult(result, del, recover);\n            }\n            diff += newSize - oldSize;\n        }\n        return simple ? pos + diff : new MapResult(pos + diff, 0, null);\n    }\n    /**\n    @internal\n    */\n    touches(pos, recover) {\n        let diff = 0, index = recoverIndex(recover);\n        let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n        for (let i = 0; i < this.ranges.length; i += 3) {\n            let start = this.ranges[i] - (this.inverted ? diff : 0);\n            if (start > pos)\n                break;\n            let oldSize = this.ranges[i + oldIndex], end = start + oldSize;\n            if (pos <= end && i == index * 3)\n                return true;\n            diff += this.ranges[i + newIndex] - oldSize;\n        }\n        return false;\n    }\n    /**\n    Calls the given function on each of the changed ranges included in\n    this map.\n    */\n    forEach(f) {\n        let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n        for (let i = 0, diff = 0; i < this.ranges.length; i += 3) {\n            let start = this.ranges[i], oldStart = start - (this.inverted ? diff : 0), newStart = start + (this.inverted ? 0 : diff);\n            let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex];\n            f(oldStart, oldStart + oldSize, newStart, newStart + newSize);\n            diff += newSize - oldSize;\n        }\n    }\n    /**\n    Create an inverted version of this map. The result can be used to\n    map positions in the post-step document to the pre-step document.\n    */\n    invert() {\n        return new StepMap(this.ranges, !this.inverted);\n    }\n    /**\n    @internal\n    */\n    toString() {\n        return (this.inverted ? \"-\" : \"\") + JSON.stringify(this.ranges);\n    }\n    /**\n    Create a map that moves all positions by offset `n` (which may be\n    negative). This can be useful when applying steps meant for a\n    sub-document to a larger document, or vice-versa.\n    */\n    static offset(n) {\n        return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n]);\n    }\n}\n/**\nA StepMap that contains no changed ranges.\n*/\nStepMap.empty = new StepMap([]);\n/**\nA mapping represents a pipeline of zero or more [step\nmaps](https://prosemirror.net/docs/ref/#transform.StepMap). It has special provisions for losslessly\nhandling mapping positions through a series of steps in which some\nsteps are inverted versions of earlier steps. (This comes up when\n‘[rebasing](/docs/guide/#transform.rebasing)’ steps for\ncollaboration or history management.)\n*/\nclass Mapping {\n    /**\n    Create a new mapping with the given position maps.\n    */\n    constructor(\n    /**\n    The step maps in this mapping.\n    */\n    maps = [], \n    /**\n    @internal\n    */\n    mirror, \n    /**\n    The starting position in the `maps` array, used when `map` or\n    `mapResult` is called.\n    */\n    from = 0, \n    /**\n    The end position in the `maps` array.\n    */\n    to = maps.length) {\n        this.maps = maps;\n        this.mirror = mirror;\n        this.from = from;\n        this.to = to;\n    }\n    /**\n    Create a mapping that maps only through a part of this one.\n    */\n    slice(from = 0, to = this.maps.length) {\n        return new Mapping(this.maps, this.mirror, from, to);\n    }\n    /**\n    @internal\n    */\n    copy() {\n        return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to);\n    }\n    /**\n    Add a step map to the end of this mapping. If `mirrors` is\n    given, it should be the index of the step map that is the mirror\n    image of this one.\n    */\n    appendMap(map, mirrors) {\n        this.to = this.maps.push(map);\n        if (mirrors != null)\n            this.setMirror(this.maps.length - 1, mirrors);\n    }\n    /**\n    Add all the step maps in a given mapping to this one (preserving\n    mirroring information).\n    */\n    appendMapping(mapping) {\n        for (let i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {\n            let mirr = mapping.getMirror(i);\n            this.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : undefined);\n        }\n    }\n    /**\n    Finds the offset of the step map that mirrors the map at the\n    given offset, in this mapping (as per the second argument to\n    `appendMap`).\n    */\n    getMirror(n) {\n        if (this.mirror)\n            for (let i = 0; i < this.mirror.length; i++)\n                if (this.mirror[i] == n)\n                    return this.mirror[i + (i % 2 ? -1 : 1)];\n    }\n    /**\n    @internal\n    */\n    setMirror(n, m) {\n        if (!this.mirror)\n            this.mirror = [];\n        this.mirror.push(n, m);\n    }\n    /**\n    Append the inverse of the given mapping to this one.\n    */\n    appendMappingInverted(mapping) {\n        for (let i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {\n            let mirr = mapping.getMirror(i);\n            this.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : undefined);\n        }\n    }\n    /**\n    Create an inverted version of this mapping.\n    */\n    invert() {\n        let inverse = new Mapping;\n        inverse.appendMappingInverted(this);\n        return inverse;\n    }\n    /**\n    Map a position through this mapping.\n    */\n    map(pos, assoc = 1) {\n        if (this.mirror)\n            return this._map(pos, assoc, true);\n        for (let i = this.from; i < this.to; i++)\n            pos = this.maps[i].map(pos, assoc);\n        return pos;\n    }\n    /**\n    Map a position through this mapping, returning a mapping\n    result.\n    */\n    mapResult(pos, assoc = 1) { return this._map(pos, assoc, false); }\n    /**\n    @internal\n    */\n    _map(pos, assoc, simple) {\n        let delInfo = 0;\n        for (let i = this.from; i < this.to; i++) {\n            let map = this.maps[i], result = map.mapResult(pos, assoc);\n            if (result.recover != null) {\n                let corr = this.getMirror(i);\n                if (corr != null && corr > i && corr < this.to) {\n                    i = corr;\n                    pos = this.maps[corr].recover(result.recover);\n                    continue;\n                }\n            }\n            delInfo |= result.delInfo;\n            pos = result.pos;\n        }\n        return simple ? pos : new MapResult(pos, delInfo, null);\n    }\n}\n\nconst stepsByID = Object.create(null);\n/**\nA step object represents an atomic change. It generally applies\nonly to the document it was created for, since the positions\nstored in it will only make sense for that document.\n\nNew steps are defined by creating classes that extend `Step`,\noverriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`\nmethods, and registering your class with a unique\nJSON-serialization identifier using\n[`Step.jsonID`](https://prosemirror.net/docs/ref/#transform.Step^jsonID).\n*/\nclass Step {\n    /**\n    Get the step map that represents the changes made by this step,\n    and which can be used to transform between positions in the old\n    and the new document.\n    */\n    getMap() { return StepMap.empty; }\n    /**\n    Try to merge this step with another one, to be applied directly\n    after it. Returns the merged step when possible, null if the\n    steps can't be merged.\n    */\n    merge(other) { return null; }\n    /**\n    Deserialize a step from its JSON representation. Will call\n    through to the step class' own implementation of this method.\n    */\n    static fromJSON(schema, json) {\n        if (!json || !json.stepType)\n            throw new RangeError(\"Invalid input for Step.fromJSON\");\n        let type = stepsByID[json.stepType];\n        if (!type)\n            throw new RangeError(`No step type ${json.stepType} defined`);\n        return type.fromJSON(schema, json);\n    }\n    /**\n    To be able to serialize steps to JSON, each step needs a string\n    ID to attach to its JSON representation. Use this method to\n    register an ID for your step classes. Try to pick something\n    that's unlikely to clash with steps from other modules.\n    */\n    static jsonID(id, stepClass) {\n        if (id in stepsByID)\n            throw new RangeError(\"Duplicate use of step JSON ID \" + id);\n        stepsByID[id] = stepClass;\n        stepClass.prototype.jsonID = id;\n        return stepClass;\n    }\n}\n/**\nThe result of [applying](https://prosemirror.net/docs/ref/#transform.Step.apply) a step. Contains either a\nnew document or a failure value.\n*/\nclass StepResult {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The transformed document, if successful.\n    */\n    doc, \n    /**\n    The failure message, if unsuccessful.\n    */\n    failed) {\n        this.doc = doc;\n        this.failed = failed;\n    }\n    /**\n    Create a successful step result.\n    */\n    static ok(doc) { return new StepResult(doc, null); }\n    /**\n    Create a failed step result.\n    */\n    static fail(message) { return new StepResult(null, message); }\n    /**\n    Call [`Node.replace`](https://prosemirror.net/docs/ref/#model.Node.replace) with the given\n    arguments. Create a successful result if it succeeds, and a\n    failed one if it throws a `ReplaceError`.\n    */\n    static fromReplace(doc, from, to, slice) {\n        try {\n            return StepResult.ok(doc.replace(from, to, slice));\n        }\n        catch (e) {\n            if (e instanceof ReplaceError)\n                return StepResult.fail(e.message);\n            throw e;\n        }\n    }\n}\n\nfunction mapFragment(fragment, f, parent) {\n    let mapped = [];\n    for (let i = 0; i < fragment.childCount; i++) {\n        let child = fragment.child(i);\n        if (child.content.size)\n            child = child.copy(mapFragment(child.content, f, child));\n        if (child.isInline)\n            child = f(child, parent, i);\n        mapped.push(child);\n    }\n    return Fragment.fromArray(mapped);\n}\n/**\nAdd a mark to all inline content between two positions.\n*/\nclass AddMarkStep extends Step {\n    /**\n    Create a mark step.\n    */\n    constructor(\n    /**\n    The start of the marked range.\n    */\n    from, \n    /**\n    The end of the marked range.\n    */\n    to, \n    /**\n    The mark to add.\n    */\n    mark) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from);\n        let parent = $from.node($from.sharedDepth(this.to));\n        let slice = new Slice(mapFragment(oldSlice.content, (node, parent) => {\n            if (!node.isAtom || !parent.type.allowsMarkType(this.mark.type))\n                return node;\n            return node.mark(this.mark.addToSet(node.marks));\n        }, parent), oldSlice.openStart, oldSlice.openEnd);\n        return StepResult.fromReplace(doc, this.from, this.to, slice);\n    }\n    invert() {\n        return new RemoveMarkStep(this.from, this.to, this.mark);\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        if (from.deleted && to.deleted || from.pos >= to.pos)\n            return null;\n        return new AddMarkStep(from.pos, to.pos, this.mark);\n    }\n    merge(other) {\n        if (other instanceof AddMarkStep &&\n            other.mark.eq(this.mark) &&\n            this.from <= other.to && this.to >= other.from)\n            return new AddMarkStep(Math.min(this.from, other.from), Math.max(this.to, other.to), this.mark);\n        return null;\n    }\n    toJSON() {\n        return { stepType: \"addMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\")\n            throw new RangeError(\"Invalid input for AddMarkStep.fromJSON\");\n        return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"addMark\", AddMarkStep);\n/**\nRemove a mark from all inline content between two positions.\n*/\nclass RemoveMarkStep extends Step {\n    /**\n    Create a mark-removing step.\n    */\n    constructor(\n    /**\n    The start of the unmarked range.\n    */\n    from, \n    /**\n    The end of the unmarked range.\n    */\n    to, \n    /**\n    The mark to remove.\n    */\n    mark) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let oldSlice = doc.slice(this.from, this.to);\n        let slice = new Slice(mapFragment(oldSlice.content, node => {\n            return node.mark(this.mark.removeFromSet(node.marks));\n        }, doc), oldSlice.openStart, oldSlice.openEnd);\n        return StepResult.fromReplace(doc, this.from, this.to, slice);\n    }\n    invert() {\n        return new AddMarkStep(this.from, this.to, this.mark);\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        if (from.deleted && to.deleted || from.pos >= to.pos)\n            return null;\n        return new RemoveMarkStep(from.pos, to.pos, this.mark);\n    }\n    merge(other) {\n        if (other instanceof RemoveMarkStep &&\n            other.mark.eq(this.mark) &&\n            this.from <= other.to && this.to >= other.from)\n            return new RemoveMarkStep(Math.min(this.from, other.from), Math.max(this.to, other.to), this.mark);\n        return null;\n    }\n    toJSON() {\n        return { stepType: \"removeMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\")\n            throw new RangeError(\"Invalid input for RemoveMarkStep.fromJSON\");\n        return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"removeMark\", RemoveMarkStep);\n/**\nAdd a mark to a specific node.\n*/\nclass AddNodeMarkStep extends Step {\n    /**\n    Create a node mark step.\n    */\n    constructor(\n    /**\n    The position of the target node.\n    */\n    pos, \n    /**\n    The mark to add.\n    */\n    mark) {\n        super();\n        this.pos = pos;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node)\n            return StepResult.fail(\"No node at mark step's position\");\n        let updated = node.type.create(node.attrs, null, this.mark.addToSet(node.marks));\n        return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));\n    }\n    invert(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (node) {\n            let newSet = this.mark.addToSet(node.marks);\n            if (newSet.length == node.marks.length) {\n                for (let i = 0; i < node.marks.length; i++)\n                    if (!node.marks[i].isInSet(newSet))\n                        return new AddNodeMarkStep(this.pos, node.marks[i]);\n                return new AddNodeMarkStep(this.pos, this.mark);\n            }\n        }\n        return new RemoveNodeMarkStep(this.pos, this.mark);\n    }\n    map(mapping) {\n        let pos = mapping.mapResult(this.pos, 1);\n        return pos.deletedAfter ? null : new AddNodeMarkStep(pos.pos, this.mark);\n    }\n    toJSON() {\n        return { stepType: \"addNodeMark\", pos: this.pos, mark: this.mark.toJSON() };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.pos != \"number\")\n            throw new RangeError(\"Invalid input for AddNodeMarkStep.fromJSON\");\n        return new AddNodeMarkStep(json.pos, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"addNodeMark\", AddNodeMarkStep);\n/**\nRemove a mark from a specific node.\n*/\nclass RemoveNodeMarkStep extends Step {\n    /**\n    Create a mark-removing step.\n    */\n    constructor(\n    /**\n    The position of the target node.\n    */\n    pos, \n    /**\n    The mark to remove.\n    */\n    mark) {\n        super();\n        this.pos = pos;\n        this.mark = mark;\n    }\n    apply(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node)\n            return StepResult.fail(\"No node at mark step's position\");\n        let updated = node.type.create(node.attrs, null, this.mark.removeFromSet(node.marks));\n        return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));\n    }\n    invert(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node || !this.mark.isInSet(node.marks))\n            return this;\n        return new AddNodeMarkStep(this.pos, this.mark);\n    }\n    map(mapping) {\n        let pos = mapping.mapResult(this.pos, 1);\n        return pos.deletedAfter ? null : new RemoveNodeMarkStep(pos.pos, this.mark);\n    }\n    toJSON() {\n        return { stepType: \"removeNodeMark\", pos: this.pos, mark: this.mark.toJSON() };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.pos != \"number\")\n            throw new RangeError(\"Invalid input for RemoveNodeMarkStep.fromJSON\");\n        return new RemoveNodeMarkStep(json.pos, schema.markFromJSON(json.mark));\n    }\n}\nStep.jsonID(\"removeNodeMark\", RemoveNodeMarkStep);\n\n/**\nReplace a part of the document with a slice of new content.\n*/\nclass ReplaceStep extends Step {\n    /**\n    The given `slice` should fit the 'gap' between `from` and\n    `to`—the depths must line up, and the surrounding nodes must be\n    able to be joined with the open sides of the slice. When\n    `structure` is true, the step will fail if the content between\n    from and to is not just a sequence of closing and then opening\n    tokens (this is to guard against rebased replace steps\n    overwriting something they weren't supposed to).\n    */\n    constructor(\n    /**\n    The start position of the replaced range.\n    */\n    from, \n    /**\n    The end position of the replaced range.\n    */\n    to, \n    /**\n    The slice to insert.\n    */\n    slice, \n    /**\n    @internal\n    */\n    structure = false) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.slice = slice;\n        this.structure = structure;\n    }\n    apply(doc) {\n        if (this.structure && contentBetween(doc, this.from, this.to))\n            return StepResult.fail(\"Structure replace would overwrite content\");\n        return StepResult.fromReplace(doc, this.from, this.to, this.slice);\n    }\n    getMap() {\n        return new StepMap([this.from, this.to - this.from, this.slice.size]);\n    }\n    invert(doc) {\n        return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to));\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        if (from.deletedAcross && to.deletedAcross)\n            return null;\n        return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice);\n    }\n    merge(other) {\n        if (!(other instanceof ReplaceStep) || other.structure || this.structure)\n            return null;\n        if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {\n            let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n                : new Slice(this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd);\n            return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure);\n        }\n        else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {\n            let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n                : new Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd);\n            return new ReplaceStep(other.from, this.to, slice, this.structure);\n        }\n        else {\n            return null;\n        }\n    }\n    toJSON() {\n        let json = { stepType: \"replace\", from: this.from, to: this.to };\n        if (this.slice.size)\n            json.slice = this.slice.toJSON();\n        if (this.structure)\n            json.structure = true;\n        return json;\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\")\n            throw new RangeError(\"Invalid input for ReplaceStep.fromJSON\");\n        return new ReplaceStep(json.from, json.to, Slice.fromJSON(schema, json.slice), !!json.structure);\n    }\n}\nStep.jsonID(\"replace\", ReplaceStep);\n/**\nReplace a part of the document with a slice of content, but\npreserve a range of the replaced content by moving it into the\nslice.\n*/\nclass ReplaceAroundStep extends Step {\n    /**\n    Create a replace-around step with the given range and gap.\n    `insert` should be the point in the slice into which the content\n    of the gap should be moved. `structure` has the same meaning as\n    it has in the [`ReplaceStep`](https://prosemirror.net/docs/ref/#transform.ReplaceStep) class.\n    */\n    constructor(\n    /**\n    The start position of the replaced range.\n    */\n    from, \n    /**\n    The end position of the replaced range.\n    */\n    to, \n    /**\n    The start of preserved range.\n    */\n    gapFrom, \n    /**\n    The end of preserved range.\n    */\n    gapTo, \n    /**\n    The slice to insert.\n    */\n    slice, \n    /**\n    The position in the slice where the preserved range should be\n    inserted.\n    */\n    insert, \n    /**\n    @internal\n    */\n    structure = false) {\n        super();\n        this.from = from;\n        this.to = to;\n        this.gapFrom = gapFrom;\n        this.gapTo = gapTo;\n        this.slice = slice;\n        this.insert = insert;\n        this.structure = structure;\n    }\n    apply(doc) {\n        if (this.structure && (contentBetween(doc, this.from, this.gapFrom) ||\n            contentBetween(doc, this.gapTo, this.to)))\n            return StepResult.fail(\"Structure gap-replace would overwrite content\");\n        let gap = doc.slice(this.gapFrom, this.gapTo);\n        if (gap.openStart || gap.openEnd)\n            return StepResult.fail(\"Gap is not a flat range\");\n        let inserted = this.slice.insertAt(this.insert, gap.content);\n        if (!inserted)\n            return StepResult.fail(\"Content does not fit in gap\");\n        return StepResult.fromReplace(doc, this.from, this.to, inserted);\n    }\n    getMap() {\n        return new StepMap([this.from, this.gapFrom - this.from, this.insert,\n            this.gapTo, this.to - this.gapTo, this.slice.size - this.insert]);\n    }\n    invert(doc) {\n        let gap = this.gapTo - this.gapFrom;\n        return new ReplaceAroundStep(this.from, this.from + this.slice.size + gap, this.from + this.insert, this.from + this.insert + gap, doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);\n    }\n    map(mapping) {\n        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n        let gapFrom = mapping.map(this.gapFrom, -1), gapTo = mapping.map(this.gapTo, 1);\n        if ((from.deletedAcross && to.deletedAcross) || gapFrom < from.pos || gapTo > to.pos)\n            return null;\n        return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure);\n    }\n    toJSON() {\n        let json = { stepType: \"replaceAround\", from: this.from, to: this.to,\n            gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert };\n        if (this.slice.size)\n            json.slice = this.slice.toJSON();\n        if (this.structure)\n            json.structure = true;\n        return json;\n    }\n    /**\n    @internal\n    */\n    static fromJSON(schema, json) {\n        if (typeof json.from != \"number\" || typeof json.to != \"number\" ||\n            typeof json.gapFrom != \"number\" || typeof json.gapTo != \"number\" || typeof json.insert != \"number\")\n            throw new RangeError(\"Invalid input for ReplaceAroundStep.fromJSON\");\n        return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo, Slice.fromJSON(schema, json.slice), json.insert, !!json.structure);\n    }\n}\nStep.jsonID(\"replaceAround\", ReplaceAroundStep);\nfunction contentBetween(doc, from, to) {\n    let $from = doc.resolve(from), dist = to - from, depth = $from.depth;\n    while (dist > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {\n        depth--;\n        dist--;\n    }\n    if (dist > 0) {\n        let next = $from.node(depth).maybeChild($from.indexAfter(depth));\n        while (dist > 0) {\n            if (!next || next.isLeaf)\n                return true;\n            next = next.firstChild;\n            dist--;\n        }\n    }\n    return false;\n}\n\nfunction addMark(tr, from, to, mark) {\n    let removed = [], added = [];\n    let removing, adding;\n    tr.doc.nodesBetween(from, to, (node, pos, parent) => {\n        if (!node.isInline)\n            return;\n        let marks = node.marks;\n        if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {\n            let start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to);\n            let newSet = mark.addToSet(marks);\n            for (let i = 0; i < marks.length; i++) {\n                if (!marks[i].isInSet(newSet)) {\n                    if (removing && removing.to == start && removing.mark.eq(marks[i]))\n                        removing.to = end;\n                    else\n                        removed.push(removing = new RemoveMarkStep(start, end, marks[i]));\n                }\n            }\n            if (adding && adding.to == start)\n                adding.to = end;\n            else\n                added.push(adding = new AddMarkStep(start, end, mark));\n        }\n    });\n    removed.forEach(s => tr.step(s));\n    added.forEach(s => tr.step(s));\n}\nfunction removeMark(tr, from, to, mark) {\n    let matched = [], step = 0;\n    tr.doc.nodesBetween(from, to, (node, pos) => {\n        if (!node.isInline)\n            return;\n        step++;\n        let toRemove = null;\n        if (mark instanceof MarkType) {\n            let set = node.marks, found;\n            while (found = mark.isInSet(set)) {\n                (toRemove || (toRemove = [])).push(found);\n                set = found.removeFromSet(set);\n            }\n        }\n        else if (mark) {\n            if (mark.isInSet(node.marks))\n                toRemove = [mark];\n        }\n        else {\n            toRemove = node.marks;\n        }\n        if (toRemove && toRemove.length) {\n            let end = Math.min(pos + node.nodeSize, to);\n            for (let i = 0; i < toRemove.length; i++) {\n                let style = toRemove[i], found;\n                for (let j = 0; j < matched.length; j++) {\n                    let m = matched[j];\n                    if (m.step == step - 1 && style.eq(matched[j].style))\n                        found = m;\n                }\n                if (found) {\n                    found.to = end;\n                    found.step = step;\n                }\n                else {\n                    matched.push({ style, from: Math.max(pos, from), to: end, step });\n                }\n            }\n        }\n    });\n    matched.forEach(m => tr.step(new RemoveMarkStep(m.from, m.to, m.style)));\n}\nfunction clearIncompatible(tr, pos, parentType, match = parentType.contentMatch) {\n    let node = tr.doc.nodeAt(pos);\n    let replSteps = [], cur = pos + 1;\n    for (let i = 0; i < node.childCount; i++) {\n        let child = node.child(i), end = cur + child.nodeSize;\n        let allowed = match.matchType(child.type);\n        if (!allowed) {\n            replSteps.push(new ReplaceStep(cur, end, Slice.empty));\n        }\n        else {\n            match = allowed;\n            for (let j = 0; j < child.marks.length; j++)\n                if (!parentType.allowsMarkType(child.marks[j].type))\n                    tr.step(new RemoveMarkStep(cur, end, child.marks[j]));\n            if (child.isText && !parentType.spec.code) {\n                let m, newline = /\\r?\\n|\\r/g, slice;\n                while (m = newline.exec(child.text)) {\n                    if (!slice)\n                        slice = new Slice(Fragment.from(parentType.schema.text(\" \", parentType.allowedMarks(child.marks))), 0, 0);\n                    replSteps.push(new ReplaceStep(cur + m.index, cur + m.index + m[0].length, slice));\n                }\n            }\n        }\n        cur = end;\n    }\n    if (!match.validEnd) {\n        let fill = match.fillBefore(Fragment.empty, true);\n        tr.replace(cur, cur, new Slice(fill, 0, 0));\n    }\n    for (let i = replSteps.length - 1; i >= 0; i--)\n        tr.step(replSteps[i]);\n}\n\nfunction canCut(node, start, end) {\n    return (start == 0 || node.canReplace(start, node.childCount)) &&\n        (end == node.childCount || node.canReplace(0, end));\n}\n/**\nTry to find a target depth to which the content in the given range\ncan be lifted. Will not go across\n[isolating](https://prosemirror.net/docs/ref/#model.NodeSpec.isolating) parent nodes.\n*/\nfunction liftTarget(range) {\n    let parent = range.parent;\n    let content = parent.content.cutByIndex(range.startIndex, range.endIndex);\n    for (let depth = range.depth;; --depth) {\n        let node = range.$from.node(depth);\n        let index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth);\n        if (depth < range.depth && node.canReplace(index, endIndex, content))\n            return depth;\n        if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex))\n            break;\n    }\n    return null;\n}\nfunction lift(tr, range, target) {\n    let { $from, $to, depth } = range;\n    let gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1);\n    let start = gapStart, end = gapEnd;\n    let before = Fragment.empty, openStart = 0;\n    for (let d = depth, splitting = false; d > target; d--)\n        if (splitting || $from.index(d) > 0) {\n            splitting = true;\n            before = Fragment.from($from.node(d).copy(before));\n            openStart++;\n        }\n        else {\n            start--;\n        }\n    let after = Fragment.empty, openEnd = 0;\n    for (let d = depth, splitting = false; d > target; d--)\n        if (splitting || $to.after(d + 1) < $to.end(d)) {\n            splitting = true;\n            after = Fragment.from($to.node(d).copy(after));\n            openEnd++;\n        }\n        else {\n            end++;\n        }\n    tr.step(new ReplaceAroundStep(start, end, gapStart, gapEnd, new Slice(before.append(after), openStart, openEnd), before.size - openStart, true));\n}\n/**\nTry to find a valid way to wrap the content in the given range in a\nnode of the given type. May introduce extra nodes around and inside\nthe wrapper node, if necessary. Returns null if no valid wrapping\ncould be found. When `innerRange` is given, that range's content is\nused as the content to fit into the wrapping, instead of the\ncontent of `range`.\n*/\nfunction findWrapping(range, nodeType, attrs = null, innerRange = range) {\n    let around = findWrappingOutside(range, nodeType);\n    let inner = around && findWrappingInside(innerRange, nodeType);\n    if (!inner)\n        return null;\n    return around.map(withAttrs)\n        .concat({ type: nodeType, attrs }).concat(inner.map(withAttrs));\n}\nfunction withAttrs(type) { return { type, attrs: null }; }\nfunction findWrappingOutside(range, type) {\n    let { parent, startIndex, endIndex } = range;\n    let around = parent.contentMatchAt(startIndex).findWrapping(type);\n    if (!around)\n        return null;\n    let outer = around.length ? around[0] : type;\n    return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null;\n}\nfunction findWrappingInside(range, type) {\n    let { parent, startIndex, endIndex } = range;\n    let inner = parent.child(startIndex);\n    let inside = type.contentMatch.findWrapping(inner.type);\n    if (!inside)\n        return null;\n    let lastType = inside.length ? inside[inside.length - 1] : type;\n    let innerMatch = lastType.contentMatch;\n    for (let i = startIndex; innerMatch && i < endIndex; i++)\n        innerMatch = innerMatch.matchType(parent.child(i).type);\n    if (!innerMatch || !innerMatch.validEnd)\n        return null;\n    return inside;\n}\nfunction wrap(tr, range, wrappers) {\n    let content = Fragment.empty;\n    for (let i = wrappers.length - 1; i >= 0; i--) {\n        if (content.size) {\n            let match = wrappers[i].type.contentMatch.matchFragment(content);\n            if (!match || !match.validEnd)\n                throw new RangeError(\"Wrapper type given to Transform.wrap does not form valid content of its parent wrapper\");\n        }\n        content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));\n    }\n    let start = range.start, end = range.end;\n    tr.step(new ReplaceAroundStep(start, end, start, end, new Slice(content, 0, 0), wrappers.length, true));\n}\nfunction setBlockType(tr, from, to, type, attrs) {\n    if (!type.isTextblock)\n        throw new RangeError(\"Type given to setBlockType should be a textblock\");\n    let mapFrom = tr.steps.length;\n    tr.doc.nodesBetween(from, to, (node, pos) => {\n        if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(tr.doc, tr.mapping.slice(mapFrom).map(pos), type)) {\n            // Ensure all markup that isn't allowed in the new node type is cleared\n            tr.clearIncompatible(tr.mapping.slice(mapFrom).map(pos, 1), type);\n            let mapping = tr.mapping.slice(mapFrom);\n            let startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1);\n            tr.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1, new Slice(Fragment.from(type.create(attrs, null, node.marks)), 0, 0), 1, true));\n            return false;\n        }\n    });\n}\nfunction canChangeType(doc, pos, type) {\n    let $pos = doc.resolve(pos), index = $pos.index();\n    return $pos.parent.canReplaceWith(index, index + 1, type);\n}\n/**\nChange the type, attributes, and/or marks of the node at `pos`.\nWhen `type` isn't given, the existing node type is preserved,\n*/\nfunction setNodeMarkup(tr, pos, type, attrs, marks) {\n    let node = tr.doc.nodeAt(pos);\n    if (!node)\n        throw new RangeError(\"No node at given position\");\n    if (!type)\n        type = node.type;\n    let newNode = type.create(attrs, null, marks || node.marks);\n    if (node.isLeaf)\n        return tr.replaceWith(pos, pos + node.nodeSize, newNode);\n    if (!type.validContent(node.content))\n        throw new RangeError(\"Invalid content for node type \" + type.name);\n    tr.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1, new Slice(Fragment.from(newNode), 0, 0), 1, true));\n}\n/**\nCheck whether splitting at the given position is allowed.\n*/\nfunction canSplit(doc, pos, depth = 1, typesAfter) {\n    let $pos = doc.resolve(pos), base = $pos.depth - depth;\n    let innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent;\n    if (base < 0 || $pos.parent.type.spec.isolating ||\n        !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||\n        !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount)))\n        return false;\n    for (let d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {\n        let node = $pos.node(d), index = $pos.index(d);\n        if (node.type.spec.isolating)\n            return false;\n        let rest = node.content.cutByIndex(index, node.childCount);\n        let overrideChild = typesAfter && typesAfter[i + 1];\n        if (overrideChild)\n            rest = rest.replaceChild(0, overrideChild.type.create(overrideChild.attrs));\n        let after = (typesAfter && typesAfter[i]) || node;\n        if (!node.canReplace(index + 1, node.childCount) || !after.type.validContent(rest))\n            return false;\n    }\n    let index = $pos.indexAfter(base);\n    let baseType = typesAfter && typesAfter[0];\n    return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type);\n}\nfunction split(tr, pos, depth = 1, typesAfter) {\n    let $pos = tr.doc.resolve(pos), before = Fragment.empty, after = Fragment.empty;\n    for (let d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {\n        before = Fragment.from($pos.node(d).copy(before));\n        let typeAfter = typesAfter && typesAfter[i];\n        after = Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after));\n    }\n    tr.step(new ReplaceStep(pos, pos, new Slice(before.append(after), depth, depth), true));\n}\n/**\nTest whether the blocks before and after a given position can be\njoined.\n*/\nfunction canJoin(doc, pos) {\n    let $pos = doc.resolve(pos), index = $pos.index();\n    return joinable($pos.nodeBefore, $pos.nodeAfter) &&\n        $pos.parent.canReplace(index, index + 1);\n}\nfunction joinable(a, b) {\n    return !!(a && b && !a.isLeaf && a.canAppend(b));\n}\n/**\nFind an ancestor of the given position that can be joined to the\nblock before (or after if `dir` is positive). Returns the joinable\npoint, if any.\n*/\nfunction joinPoint(doc, pos, dir = -1) {\n    let $pos = doc.resolve(pos);\n    for (let d = $pos.depth;; d--) {\n        let before, after, index = $pos.index(d);\n        if (d == $pos.depth) {\n            before = $pos.nodeBefore;\n            after = $pos.nodeAfter;\n        }\n        else if (dir > 0) {\n            before = $pos.node(d + 1);\n            index++;\n            after = $pos.node(d).maybeChild(index);\n        }\n        else {\n            before = $pos.node(d).maybeChild(index - 1);\n            after = $pos.node(d + 1);\n        }\n        if (before && !before.isTextblock && joinable(before, after) &&\n            $pos.node(d).canReplace(index, index + 1))\n            return pos;\n        if (d == 0)\n            break;\n        pos = dir < 0 ? $pos.before(d) : $pos.after(d);\n    }\n}\nfunction join(tr, pos, depth) {\n    let step = new ReplaceStep(pos - depth, pos + depth, Slice.empty, true);\n    tr.step(step);\n}\n/**\nTry to find a point where a node of the given type can be inserted\nnear `pos`, by searching up the node hierarchy when `pos` itself\nisn't a valid place but is at the start or end of a node. Return\nnull if no position was found.\n*/\nfunction insertPoint(doc, pos, nodeType) {\n    let $pos = doc.resolve(pos);\n    if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType))\n        return pos;\n    if ($pos.parentOffset == 0)\n        for (let d = $pos.depth - 1; d >= 0; d--) {\n            let index = $pos.index(d);\n            if ($pos.node(d).canReplaceWith(index, index, nodeType))\n                return $pos.before(d + 1);\n            if (index > 0)\n                return null;\n        }\n    if ($pos.parentOffset == $pos.parent.content.size)\n        for (let d = $pos.depth - 1; d >= 0; d--) {\n            let index = $pos.indexAfter(d);\n            if ($pos.node(d).canReplaceWith(index, index, nodeType))\n                return $pos.after(d + 1);\n            if (index < $pos.node(d).childCount)\n                return null;\n        }\n    return null;\n}\n/**\nFinds a position at or around the given position where the given\nslice can be inserted. Will look at parent nodes' nearest boundary\nand try there, even if the original position wasn't directly at the\nstart or end of that node. Returns null when no position was found.\n*/\nfunction dropPoint(doc, pos, slice) {\n    let $pos = doc.resolve(pos);\n    if (!slice.content.size)\n        return pos;\n    let content = slice.content;\n    for (let i = 0; i < slice.openStart; i++)\n        content = content.firstChild.content;\n    for (let pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {\n        for (let d = $pos.depth; d >= 0; d--) {\n            let bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1;\n            let insertPos = $pos.index(d) + (bias > 0 ? 1 : 0);\n            let parent = $pos.node(d), fits = false;\n            if (pass == 1) {\n                fits = parent.canReplace(insertPos, insertPos, content);\n            }\n            else {\n                let wrapping = parent.contentMatchAt(insertPos).findWrapping(content.firstChild.type);\n                fits = wrapping && parent.canReplaceWith(insertPos, insertPos, wrapping[0]);\n            }\n            if (fits)\n                return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1);\n        }\n    }\n    return null;\n}\n\n/**\n‘Fit’ a slice into a given position in the document, producing a\n[step](https://prosemirror.net/docs/ref/#transform.Step) that inserts it. Will return null if\nthere's no meaningful way to insert the slice here, or inserting it\nwould be a no-op (an empty slice over an empty range).\n*/\nfunction replaceStep(doc, from, to = from, slice = Slice.empty) {\n    if (from == to && !slice.size)\n        return null;\n    let $from = doc.resolve(from), $to = doc.resolve(to);\n    // Optimization -- avoid work if it's obvious that it's not needed.\n    if (fitsTrivially($from, $to, slice))\n        return new ReplaceStep(from, to, slice);\n    return new Fitter($from, $to, slice).fit();\n}\nfunction fitsTrivially($from, $to, slice) {\n    return !slice.openStart && !slice.openEnd && $from.start() == $to.start() &&\n        $from.parent.canReplace($from.index(), $to.index(), slice.content);\n}\n// Algorithm for 'placing' the elements of a slice into a gap:\n//\n// We consider the content of each node that is open to the left to be\n// independently placeable. I.e. in <p(\"foo\"), p(\"bar\")>, when the\n// paragraph on the left is open, \"foo\" can be placed (somewhere on\n// the left side of the replacement gap) independently from p(\"bar\").\n//\n// This class tracks the state of the placement progress in the\n// following properties:\n//\n//  - `frontier` holds a stack of `{type, match}` objects that\n//    represent the open side of the replacement. It starts at\n//    `$from`, then moves forward as content is placed, and is finally\n//    reconciled with `$to`.\n//\n//  - `unplaced` is a slice that represents the content that hasn't\n//    been placed yet.\n//\n//  - `placed` is a fragment of placed content. Its open-start value\n//    is implicit in `$from`, and its open-end value in `frontier`.\nclass Fitter {\n    constructor($from, $to, unplaced) {\n        this.$from = $from;\n        this.$to = $to;\n        this.unplaced = unplaced;\n        this.frontier = [];\n        this.placed = Fragment.empty;\n        for (let i = 0; i <= $from.depth; i++) {\n            let node = $from.node(i);\n            this.frontier.push({\n                type: node.type,\n                match: node.contentMatchAt($from.indexAfter(i))\n            });\n        }\n        for (let i = $from.depth; i > 0; i--)\n            this.placed = Fragment.from($from.node(i).copy(this.placed));\n    }\n    get depth() { return this.frontier.length - 1; }\n    fit() {\n        // As long as there's unplaced content, try to place some of it.\n        // If that fails, either increase the open score of the unplaced\n        // slice, or drop nodes from it, and then try again.\n        while (this.unplaced.size) {\n            let fit = this.findFittable();\n            if (fit)\n                this.placeNodes(fit);\n            else\n                this.openMore() || this.dropNode();\n        }\n        // When there's inline content directly after the frontier _and_\n        // directly after `this.$to`, we must generate a `ReplaceAround`\n        // step that pulls that content into the node after the frontier.\n        // That means the fitting must be done to the end of the textblock\n        // node after `this.$to`, not `this.$to` itself.\n        let moveInline = this.mustMoveInline(), placedSize = this.placed.size - this.depth - this.$from.depth;\n        let $from = this.$from, $to = this.close(moveInline < 0 ? this.$to : $from.doc.resolve(moveInline));\n        if (!$to)\n            return null;\n        // If closing to `$to` succeeded, create a step\n        let content = this.placed, openStart = $from.depth, openEnd = $to.depth;\n        while (openStart && openEnd && content.childCount == 1) { // Normalize by dropping open parent nodes\n            content = content.firstChild.content;\n            openStart--;\n            openEnd--;\n        }\n        let slice = new Slice(content, openStart, openEnd);\n        if (moveInline > -1)\n            return new ReplaceAroundStep($from.pos, moveInline, this.$to.pos, this.$to.end(), slice, placedSize);\n        if (slice.size || $from.pos != this.$to.pos) // Don't generate no-op steps\n            return new ReplaceStep($from.pos, $to.pos, slice);\n        return null;\n    }\n    // Find a position on the start spine of `this.unplaced` that has\n    // content that can be moved somewhere on the frontier. Returns two\n    // depths, one for the slice and one for the frontier.\n    findFittable() {\n        let startDepth = this.unplaced.openStart;\n        for (let cur = this.unplaced.content, d = 0, openEnd = this.unplaced.openEnd; d < startDepth; d++) {\n            let node = cur.firstChild;\n            if (cur.childCount > 1)\n                openEnd = 0;\n            if (node.type.spec.isolating && openEnd <= d) {\n                startDepth = d;\n                break;\n            }\n            cur = node.content;\n        }\n        // Only try wrapping nodes (pass 2) after finding a place without\n        // wrapping failed.\n        for (let pass = 1; pass <= 2; pass++) {\n            for (let sliceDepth = pass == 1 ? startDepth : this.unplaced.openStart; sliceDepth >= 0; sliceDepth--) {\n                let fragment, parent = null;\n                if (sliceDepth) {\n                    parent = contentAt(this.unplaced.content, sliceDepth - 1).firstChild;\n                    fragment = parent.content;\n                }\n                else {\n                    fragment = this.unplaced.content;\n                }\n                let first = fragment.firstChild;\n                for (let frontierDepth = this.depth; frontierDepth >= 0; frontierDepth--) {\n                    let { type, match } = this.frontier[frontierDepth], wrap, inject = null;\n                    // In pass 1, if the next node matches, or there is no next\n                    // node but the parents look compatible, we've found a\n                    // place.\n                    if (pass == 1 && (first ? match.matchType(first.type) || (inject = match.fillBefore(Fragment.from(first), false))\n                        : parent && type.compatibleContent(parent.type)))\n                        return { sliceDepth, frontierDepth, parent, inject };\n                    // In pass 2, look for a set of wrapping nodes that make\n                    // `first` fit here.\n                    else if (pass == 2 && first && (wrap = match.findWrapping(first.type)))\n                        return { sliceDepth, frontierDepth, parent, wrap };\n                    // Don't continue looking further up if the parent node\n                    // would fit here.\n                    if (parent && match.matchType(parent.type))\n                        break;\n                }\n            }\n        }\n    }\n    openMore() {\n        let { content, openStart, openEnd } = this.unplaced;\n        let inner = contentAt(content, openStart);\n        if (!inner.childCount || inner.firstChild.isLeaf)\n            return false;\n        this.unplaced = new Slice(content, openStart + 1, Math.max(openEnd, inner.size + openStart >= content.size - openEnd ? openStart + 1 : 0));\n        return true;\n    }\n    dropNode() {\n        let { content, openStart, openEnd } = this.unplaced;\n        let inner = contentAt(content, openStart);\n        if (inner.childCount <= 1 && openStart > 0) {\n            let openAtEnd = content.size - openStart <= openStart + inner.size;\n            this.unplaced = new Slice(dropFromFragment(content, openStart - 1, 1), openStart - 1, openAtEnd ? openStart - 1 : openEnd);\n        }\n        else {\n            this.unplaced = new Slice(dropFromFragment(content, openStart, 1), openStart, openEnd);\n        }\n    }\n    // Move content from the unplaced slice at `sliceDepth` to the\n    // frontier node at `frontierDepth`. Close that frontier node when\n    // applicable.\n    placeNodes({ sliceDepth, frontierDepth, parent, inject, wrap }) {\n        while (this.depth > frontierDepth)\n            this.closeFrontierNode();\n        if (wrap)\n            for (let i = 0; i < wrap.length; i++)\n                this.openFrontierNode(wrap[i]);\n        let slice = this.unplaced, fragment = parent ? parent.content : slice.content;\n        let openStart = slice.openStart - sliceDepth;\n        let taken = 0, add = [];\n        let { match, type } = this.frontier[frontierDepth];\n        if (inject) {\n            for (let i = 0; i < inject.childCount; i++)\n                add.push(inject.child(i));\n            match = match.matchFragment(inject);\n        }\n        // Computes the amount of (end) open nodes at the end of the\n        // fragment. When 0, the parent is open, but no more. When\n        // negative, nothing is open.\n        let openEndCount = (fragment.size + sliceDepth) - (slice.content.size - slice.openEnd);\n        // Scan over the fragment, fitting as many child nodes as\n        // possible.\n        while (taken < fragment.childCount) {\n            let next = fragment.child(taken), matches = match.matchType(next.type);\n            if (!matches)\n                break;\n            taken++;\n            if (taken > 1 || openStart == 0 || next.content.size) { // Drop empty open nodes\n                match = matches;\n                add.push(closeNodeStart(next.mark(type.allowedMarks(next.marks)), taken == 1 ? openStart : 0, taken == fragment.childCount ? openEndCount : -1));\n            }\n        }\n        let toEnd = taken == fragment.childCount;\n        if (!toEnd)\n            openEndCount = -1;\n        this.placed = addToFragment(this.placed, frontierDepth, Fragment.from(add));\n        this.frontier[frontierDepth].match = match;\n        // If the parent types match, and the entire node was moved, and\n        // it's not open, close this frontier node right away.\n        if (toEnd && openEndCount < 0 && parent && parent.type == this.frontier[this.depth].type && this.frontier.length > 1)\n            this.closeFrontierNode();\n        // Add new frontier nodes for any open nodes at the end.\n        for (let i = 0, cur = fragment; i < openEndCount; i++) {\n            let node = cur.lastChild;\n            this.frontier.push({ type: node.type, match: node.contentMatchAt(node.childCount) });\n            cur = node.content;\n        }\n        // Update `this.unplaced`. Drop the entire node from which we\n        // placed it we got to its end, otherwise just drop the placed\n        // nodes.\n        this.unplaced = !toEnd ? new Slice(dropFromFragment(slice.content, sliceDepth, taken), slice.openStart, slice.openEnd)\n            : sliceDepth == 0 ? Slice.empty\n                : new Slice(dropFromFragment(slice.content, sliceDepth - 1, 1), sliceDepth - 1, openEndCount < 0 ? slice.openEnd : sliceDepth - 1);\n    }\n    mustMoveInline() {\n        if (!this.$to.parent.isTextblock)\n            return -1;\n        let top = this.frontier[this.depth], level;\n        if (!top.type.isTextblock || !contentAfterFits(this.$to, this.$to.depth, top.type, top.match, false) ||\n            (this.$to.depth == this.depth && (level = this.findCloseLevel(this.$to)) && level.depth == this.depth))\n            return -1;\n        let { depth } = this.$to, after = this.$to.after(depth);\n        while (depth > 1 && after == this.$to.end(--depth))\n            ++after;\n        return after;\n    }\n    findCloseLevel($to) {\n        scan: for (let i = Math.min(this.depth, $to.depth); i >= 0; i--) {\n            let { match, type } = this.frontier[i];\n            let dropInner = i < $to.depth && $to.end(i + 1) == $to.pos + ($to.depth - (i + 1));\n            let fit = contentAfterFits($to, i, type, match, dropInner);\n            if (!fit)\n                continue;\n            for (let d = i - 1; d >= 0; d--) {\n                let { match, type } = this.frontier[d];\n                let matches = contentAfterFits($to, d, type, match, true);\n                if (!matches || matches.childCount)\n                    continue scan;\n            }\n            return { depth: i, fit, move: dropInner ? $to.doc.resolve($to.after(i + 1)) : $to };\n        }\n    }\n    close($to) {\n        let close = this.findCloseLevel($to);\n        if (!close)\n            return null;\n        while (this.depth > close.depth)\n            this.closeFrontierNode();\n        if (close.fit.childCount)\n            this.placed = addToFragment(this.placed, close.depth, close.fit);\n        $to = close.move;\n        for (let d = close.depth + 1; d <= $to.depth; d++) {\n            let node = $to.node(d), add = node.type.contentMatch.fillBefore(node.content, true, $to.index(d));\n            this.openFrontierNode(node.type, node.attrs, add);\n        }\n        return $to;\n    }\n    openFrontierNode(type, attrs = null, content) {\n        let top = this.frontier[this.depth];\n        top.match = top.match.matchType(type);\n        this.placed = addToFragment(this.placed, this.depth, Fragment.from(type.create(attrs, content)));\n        this.frontier.push({ type, match: type.contentMatch });\n    }\n    closeFrontierNode() {\n        let open = this.frontier.pop();\n        let add = open.match.fillBefore(Fragment.empty, true);\n        if (add.childCount)\n            this.placed = addToFragment(this.placed, this.frontier.length, add);\n    }\n}\nfunction dropFromFragment(fragment, depth, count) {\n    if (depth == 0)\n        return fragment.cutByIndex(count, fragment.childCount);\n    return fragment.replaceChild(0, fragment.firstChild.copy(dropFromFragment(fragment.firstChild.content, depth - 1, count)));\n}\nfunction addToFragment(fragment, depth, content) {\n    if (depth == 0)\n        return fragment.append(content);\n    return fragment.replaceChild(fragment.childCount - 1, fragment.lastChild.copy(addToFragment(fragment.lastChild.content, depth - 1, content)));\n}\nfunction contentAt(fragment, depth) {\n    for (let i = 0; i < depth; i++)\n        fragment = fragment.firstChild.content;\n    return fragment;\n}\nfunction closeNodeStart(node, openStart, openEnd) {\n    if (openStart <= 0)\n        return node;\n    let frag = node.content;\n    if (openStart > 1)\n        frag = frag.replaceChild(0, closeNodeStart(frag.firstChild, openStart - 1, frag.childCount == 1 ? openEnd - 1 : 0));\n    if (openStart > 0) {\n        frag = node.type.contentMatch.fillBefore(frag).append(frag);\n        if (openEnd <= 0)\n            frag = frag.append(node.type.contentMatch.matchFragment(frag).fillBefore(Fragment.empty, true));\n    }\n    return node.copy(frag);\n}\nfunction contentAfterFits($to, depth, type, match, open) {\n    let node = $to.node(depth), index = open ? $to.indexAfter(depth) : $to.index(depth);\n    if (index == node.childCount && !type.compatibleContent(node.type))\n        return null;\n    let fit = match.fillBefore(node.content, true, index);\n    return fit && !invalidMarks(type, node.content, index) ? fit : null;\n}\nfunction invalidMarks(type, fragment, start) {\n    for (let i = start; i < fragment.childCount; i++)\n        if (!type.allowsMarks(fragment.child(i).marks))\n            return true;\n    return false;\n}\nfunction definesContent(type) {\n    return type.spec.defining || type.spec.definingForContent;\n}\nfunction replaceRange(tr, from, to, slice) {\n    if (!slice.size)\n        return tr.deleteRange(from, to);\n    let $from = tr.doc.resolve(from), $to = tr.doc.resolve(to);\n    if (fitsTrivially($from, $to, slice))\n        return tr.step(new ReplaceStep(from, to, slice));\n    let targetDepths = coveredDepths($from, tr.doc.resolve(to));\n    // Can't replace the whole document, so remove 0 if it's present\n    if (targetDepths[targetDepths.length - 1] == 0)\n        targetDepths.pop();\n    // Negative numbers represent not expansion over the whole node at\n    // that depth, but replacing from $from.before(-D) to $to.pos.\n    let preferredTarget = -($from.depth + 1);\n    targetDepths.unshift(preferredTarget);\n    // This loop picks a preferred target depth, if one of the covering\n    // depths is not outside of a defining node, and adds negative\n    // depths for any depth that has $from at its start and does not\n    // cross a defining node.\n    for (let d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {\n        let spec = $from.node(d).type.spec;\n        if (spec.defining || spec.definingAsContext || spec.isolating)\n            break;\n        if (targetDepths.indexOf(d) > -1)\n            preferredTarget = d;\n        else if ($from.before(d) == pos)\n            targetDepths.splice(1, 0, -d);\n    }\n    // Try to fit each possible depth of the slice into each possible\n    // target depth, starting with the preferred depths.\n    let preferredTargetIndex = targetDepths.indexOf(preferredTarget);\n    let leftNodes = [], preferredDepth = slice.openStart;\n    for (let content = slice.content, i = 0;; i++) {\n        let node = content.firstChild;\n        leftNodes.push(node);\n        if (i == slice.openStart)\n            break;\n        content = node.content;\n    }\n    // Back up preferredDepth to cover defining textblocks directly\n    // above it, possibly skipping a non-defining textblock.\n    for (let d = preferredDepth - 1; d >= 0; d--) {\n        let leftNode = leftNodes[d], def = definesContent(leftNode.type);\n        if (def && !leftNode.sameMarkup($from.node(Math.abs(preferredTarget) - 1)))\n            preferredDepth = d;\n        else if (def || !leftNode.type.isTextblock)\n            break;\n    }\n    for (let j = slice.openStart; j >= 0; j--) {\n        let openDepth = (j + preferredDepth + 1) % (slice.openStart + 1);\n        let insert = leftNodes[openDepth];\n        if (!insert)\n            continue;\n        for (let i = 0; i < targetDepths.length; i++) {\n            // Loop over possible expansion levels, starting with the\n            // preferred one\n            let targetDepth = targetDepths[(i + preferredTargetIndex) % targetDepths.length], expand = true;\n            if (targetDepth < 0) {\n                expand = false;\n                targetDepth = -targetDepth;\n            }\n            let parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1);\n            if (parent.canReplaceWith(index, index, insert.type, insert.marks))\n                return tr.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to, new Slice(closeFragment(slice.content, 0, slice.openStart, openDepth), openDepth, slice.openEnd));\n        }\n    }\n    let startSteps = tr.steps.length;\n    for (let i = targetDepths.length - 1; i >= 0; i--) {\n        tr.replace(from, to, slice);\n        if (tr.steps.length > startSteps)\n            break;\n        let depth = targetDepths[i];\n        if (depth < 0)\n            continue;\n        from = $from.before(depth);\n        to = $to.after(depth);\n    }\n}\nfunction closeFragment(fragment, depth, oldOpen, newOpen, parent) {\n    if (depth < oldOpen) {\n        let first = fragment.firstChild;\n        fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)));\n    }\n    if (depth > newOpen) {\n        let match = parent.contentMatchAt(0);\n        let start = match.fillBefore(fragment).append(fragment);\n        fragment = start.append(match.matchFragment(start).fillBefore(Fragment.empty, true));\n    }\n    return fragment;\n}\nfunction replaceRangeWith(tr, from, to, node) {\n    if (!node.isInline && from == to && tr.doc.resolve(from).parent.content.size) {\n        let point = insertPoint(tr.doc, from, node.type);\n        if (point != null)\n            from = to = point;\n    }\n    tr.replaceRange(from, to, new Slice(Fragment.from(node), 0, 0));\n}\nfunction deleteRange(tr, from, to) {\n    let $from = tr.doc.resolve(from), $to = tr.doc.resolve(to);\n    let covered = coveredDepths($from, $to);\n    for (let i = 0; i < covered.length; i++) {\n        let depth = covered[i], last = i == covered.length - 1;\n        if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)\n            return tr.delete($from.start(depth), $to.end(depth));\n        if (depth > 0 && (last || $from.node(depth - 1).canReplace($from.index(depth - 1), $to.indexAfter(depth - 1))))\n            return tr.delete($from.before(depth), $to.after(depth));\n    }\n    for (let d = 1; d <= $from.depth && d <= $to.depth; d++) {\n        if (from - $from.start(d) == $from.depth - d && to > $from.end(d) && $to.end(d) - to != $to.depth - d)\n            return tr.delete($from.before(d), to);\n    }\n    tr.delete(from, to);\n}\n// Returns an array of all depths for which $from - $to spans the\n// whole content of the nodes at that depth.\nfunction coveredDepths($from, $to) {\n    let result = [], minDepth = Math.min($from.depth, $to.depth);\n    for (let d = minDepth; d >= 0; d--) {\n        let start = $from.start(d);\n        if (start < $from.pos - ($from.depth - d) ||\n            $to.end(d) > $to.pos + ($to.depth - d) ||\n            $from.node(d).type.spec.isolating ||\n            $to.node(d).type.spec.isolating)\n            break;\n        if (start == $to.start(d) ||\n            (d == $from.depth && d == $to.depth && $from.parent.inlineContent && $to.parent.inlineContent &&\n                d && $to.start(d - 1) == start - 1))\n            result.push(d);\n    }\n    return result;\n}\n\n/**\nUpdate an attribute in a specific node.\n*/\nclass AttrStep extends Step {\n    /**\n    Construct an attribute step.\n    */\n    constructor(\n    /**\n    The position of the target node.\n    */\n    pos, \n    /**\n    The attribute to set.\n    */\n    attr, \n    // The attribute's new value.\n    value) {\n        super();\n        this.pos = pos;\n        this.attr = attr;\n        this.value = value;\n    }\n    apply(doc) {\n        let node = doc.nodeAt(this.pos);\n        if (!node)\n            return StepResult.fail(\"No node at attribute step's position\");\n        let attrs = Object.create(null);\n        for (let name in node.attrs)\n            attrs[name] = node.attrs[name];\n        attrs[this.attr] = this.value;\n        let updated = node.type.create(attrs, null, node.marks);\n        return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));\n    }\n    getMap() {\n        return StepMap.empty;\n    }\n    invert(doc) {\n        return new AttrStep(this.pos, this.attr, doc.nodeAt(this.pos).attrs[this.attr]);\n    }\n    map(mapping) {\n        let pos = mapping.mapResult(this.pos, 1);\n        return pos.deletedAfter ? null : new AttrStep(pos.pos, this.attr, this.value);\n    }\n    toJSON() {\n        return { stepType: \"attr\", pos: this.pos, attr: this.attr, value: this.value };\n    }\n    static fromJSON(schema, json) {\n        if (typeof json.pos != \"number\" || typeof json.attr != \"string\")\n            throw new RangeError(\"Invalid input for AttrStep.fromJSON\");\n        return new AttrStep(json.pos, json.attr, json.value);\n    }\n}\nStep.jsonID(\"attr\", AttrStep);\n/**\nUpdate an attribute in the doc node.\n*/\nclass DocAttrStep extends Step {\n    /**\n    Construct an attribute step.\n    */\n    constructor(\n    /**\n    The attribute to set.\n    */\n    attr, \n    // The attribute's new value.\n    value) {\n        super();\n        this.attr = attr;\n        this.value = value;\n    }\n    apply(doc) {\n        let attrs = Object.create(null);\n        for (let name in doc.attrs)\n            attrs[name] = doc.attrs[name];\n        attrs[this.attr] = this.value;\n        let updated = doc.type.create(attrs, doc.content, doc.marks);\n        return StepResult.ok(updated);\n    }\n    getMap() {\n        return StepMap.empty;\n    }\n    invert(doc) {\n        return new DocAttrStep(this.attr, doc.attrs[this.attr]);\n    }\n    map(mapping) {\n        return this;\n    }\n    toJSON() {\n        return { stepType: \"docAttr\", attr: this.attr, value: this.value };\n    }\n    static fromJSON(schema, json) {\n        if (typeof json.attr != \"string\")\n            throw new RangeError(\"Invalid input for DocAttrStep.fromJSON\");\n        return new DocAttrStep(json.attr, json.value);\n    }\n}\nStep.jsonID(\"docAttr\", DocAttrStep);\n\n/**\n@internal\n*/\nlet TransformError = class extends Error {\n};\nTransformError = function TransformError(message) {\n    let err = Error.call(this, message);\n    err.__proto__ = TransformError.prototype;\n    return err;\n};\nTransformError.prototype = Object.create(Error.prototype);\nTransformError.prototype.constructor = TransformError;\nTransformError.prototype.name = \"TransformError\";\n/**\nAbstraction to build up and track an array of\n[steps](https://prosemirror.net/docs/ref/#transform.Step) representing a document transformation.\n\nMost transforming methods return the `Transform` object itself, so\nthat they can be chained.\n*/\nclass Transform {\n    /**\n    Create a transform that starts with the given document.\n    */\n    constructor(\n    /**\n    The current document (the result of applying the steps in the\n    transform).\n    */\n    doc) {\n        this.doc = doc;\n        /**\n        The steps in this transform.\n        */\n        this.steps = [];\n        /**\n        The documents before each of the steps.\n        */\n        this.docs = [];\n        /**\n        A mapping with the maps for each of the steps in this transform.\n        */\n        this.mapping = new Mapping;\n    }\n    /**\n    The starting document.\n    */\n    get before() { return this.docs.length ? this.docs[0] : this.doc; }\n    /**\n    Apply a new step in this transform, saving the result. Throws an\n    error when the step fails.\n    */\n    step(step) {\n        let result = this.maybeStep(step);\n        if (result.failed)\n            throw new TransformError(result.failed);\n        return this;\n    }\n    /**\n    Try to apply a step in this transformation, ignoring it if it\n    fails. Returns the step result.\n    */\n    maybeStep(step) {\n        let result = step.apply(this.doc);\n        if (!result.failed)\n            this.addStep(step, result.doc);\n        return result;\n    }\n    /**\n    True when the document has been changed (when there are any\n    steps).\n    */\n    get docChanged() {\n        return this.steps.length > 0;\n    }\n    /**\n    @internal\n    */\n    addStep(step, doc) {\n        this.docs.push(this.doc);\n        this.steps.push(step);\n        this.mapping.appendMap(step.getMap());\n        this.doc = doc;\n    }\n    /**\n    Replace the part of the document between `from` and `to` with the\n    given `slice`.\n    */\n    replace(from, to = from, slice = Slice.empty) {\n        let step = replaceStep(this.doc, from, to, slice);\n        if (step)\n            this.step(step);\n        return this;\n    }\n    /**\n    Replace the given range with the given content, which may be a\n    fragment, node, or array of nodes.\n    */\n    replaceWith(from, to, content) {\n        return this.replace(from, to, new Slice(Fragment.from(content), 0, 0));\n    }\n    /**\n    Delete the content between the given positions.\n    */\n    delete(from, to) {\n        return this.replace(from, to, Slice.empty);\n    }\n    /**\n    Insert the given content at the given position.\n    */\n    insert(pos, content) {\n        return this.replaceWith(pos, pos, content);\n    }\n    /**\n    Replace a range of the document with a given slice, using\n    `from`, `to`, and the slice's\n    [`openStart`](https://prosemirror.net/docs/ref/#model.Slice.openStart) property as hints, rather\n    than fixed start and end points. This method may grow the\n    replaced area or close open nodes in the slice in order to get a\n    fit that is more in line with WYSIWYG expectations, by dropping\n    fully covered parent nodes of the replaced region when they are\n    marked [non-defining as\n    context](https://prosemirror.net/docs/ref/#model.NodeSpec.definingAsContext), or including an\n    open parent node from the slice that _is_ marked as [defining\n    its content](https://prosemirror.net/docs/ref/#model.NodeSpec.definingForContent).\n    \n    This is the method, for example, to handle paste. The similar\n    [`replace`](https://prosemirror.net/docs/ref/#transform.Transform.replace) method is a more\n    primitive tool which will _not_ move the start and end of its given\n    range, and is useful in situations where you need more precise\n    control over what happens.\n    */\n    replaceRange(from, to, slice) {\n        replaceRange(this, from, to, slice);\n        return this;\n    }\n    /**\n    Replace the given range with a node, but use `from` and `to` as\n    hints, rather than precise positions. When from and to are the same\n    and are at the start or end of a parent node in which the given\n    node doesn't fit, this method may _move_ them out towards a parent\n    that does allow the given node to be placed. When the given range\n    completely covers a parent node, this method may completely replace\n    that parent node.\n    */\n    replaceRangeWith(from, to, node) {\n        replaceRangeWith(this, from, to, node);\n        return this;\n    }\n    /**\n    Delete the given range, expanding it to cover fully covered\n    parent nodes until a valid replace is found.\n    */\n    deleteRange(from, to) {\n        deleteRange(this, from, to);\n        return this;\n    }\n    /**\n    Split the content in the given range off from its parent, if there\n    is sibling content before or after it, and move it up the tree to\n    the depth specified by `target`. You'll probably want to use\n    [`liftTarget`](https://prosemirror.net/docs/ref/#transform.liftTarget) to compute `target`, to make\n    sure the lift is valid.\n    */\n    lift(range, target) {\n        lift(this, range, target);\n        return this;\n    }\n    /**\n    Join the blocks around the given position. If depth is 2, their\n    last and first siblings are also joined, and so on.\n    */\n    join(pos, depth = 1) {\n        join(this, pos, depth);\n        return this;\n    }\n    /**\n    Wrap the given [range](https://prosemirror.net/docs/ref/#model.NodeRange) in the given set of wrappers.\n    The wrappers are assumed to be valid in this position, and should\n    probably be computed with [`findWrapping`](https://prosemirror.net/docs/ref/#transform.findWrapping).\n    */\n    wrap(range, wrappers) {\n        wrap(this, range, wrappers);\n        return this;\n    }\n    /**\n    Set the type of all textblocks (partly) between `from` and `to` to\n    the given node type with the given attributes.\n    */\n    setBlockType(from, to = from, type, attrs = null) {\n        setBlockType(this, from, to, type, attrs);\n        return this;\n    }\n    /**\n    Change the type, attributes, and/or marks of the node at `pos`.\n    When `type` isn't given, the existing node type is preserved,\n    */\n    setNodeMarkup(pos, type, attrs = null, marks) {\n        setNodeMarkup(this, pos, type, attrs, marks);\n        return this;\n    }\n    /**\n    Set a single attribute on a given node to a new value.\n    The `pos` addresses the document content. Use `setDocAttribute`\n    to set attributes on the document itself.\n    */\n    setNodeAttribute(pos, attr, value) {\n        this.step(new AttrStep(pos, attr, value));\n        return this;\n    }\n    /**\n    Set a single attribute on the document to a new value.\n    */\n    setDocAttribute(attr, value) {\n        this.step(new DocAttrStep(attr, value));\n        return this;\n    }\n    /**\n    Add a mark to the node at position `pos`.\n    */\n    addNodeMark(pos, mark) {\n        this.step(new AddNodeMarkStep(pos, mark));\n        return this;\n    }\n    /**\n    Remove a mark (or a mark of the given type) from the node at\n    position `pos`.\n    */\n    removeNodeMark(pos, mark) {\n        if (!(mark instanceof Mark)) {\n            let node = this.doc.nodeAt(pos);\n            if (!node)\n                throw new RangeError(\"No node at position \" + pos);\n            mark = mark.isInSet(node.marks);\n            if (!mark)\n                return this;\n        }\n        this.step(new RemoveNodeMarkStep(pos, mark));\n        return this;\n    }\n    /**\n    Split the node at the given position, and optionally, if `depth` is\n    greater than one, any number of nodes above that. By default, the\n    parts split off will inherit the node type of the original node.\n    This can be changed by passing an array of types and attributes to\n    use after the split.\n    */\n    split(pos, depth = 1, typesAfter) {\n        split(this, pos, depth, typesAfter);\n        return this;\n    }\n    /**\n    Add the given mark to the inline content between `from` and `to`.\n    */\n    addMark(from, to, mark) {\n        addMark(this, from, to, mark);\n        return this;\n    }\n    /**\n    Remove marks from inline nodes between `from` and `to`. When\n    `mark` is a single mark, remove precisely that mark. When it is\n    a mark type, remove all marks of that type. When it is null,\n    remove all marks of any type.\n    */\n    removeMark(from, to, mark) {\n        removeMark(this, from, to, mark);\n        return this;\n    }\n    /**\n    Removes all marks and nodes from the content of the node at\n    `pos` that don't match the given new parent node type. Accepts\n    an optional starting [content match](https://prosemirror.net/docs/ref/#model.ContentMatch) as\n    third argument.\n    */\n    clearIncompatible(pos, parentType, match) {\n        clearIncompatible(this, pos, parentType, match);\n        return this;\n    }\n}\n\nexport { AddMarkStep, AddNodeMarkStep, AttrStep, DocAttrStep, MapResult, Mapping, RemoveMarkStep, RemoveNodeMarkStep, ReplaceAroundStep, ReplaceStep, Step, StepMap, StepResult, Transform, TransformError, canJoin, canSplit, dropPoint, findWrapping, insertPoint, joinPoint, liftTarget, replaceStep };\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n *   Check that an arbitrary value is a node.\n * @param {unknown} this\n *   The given context.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n *\n * @typedef {Record<string, unknown> | Node} Props\n *   Object to check for equivalence.\n *\n *   Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array<Props | TestFunction | string> | Props | TestFunction | string | null | undefined} Test\n *   Check for an arbitrary node.\n *\n * @callback TestFunction\n *   Check if a node passes a test.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | undefined | void}\n *   Whether this node passes the test.\n *\n *   Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n *   Thing to check, typically `Node`.\n * @param {Test} test\n *   A check for a specific node.\n * @param {number | null | undefined} index\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n *   The node’s parent.\n * @param {unknown} context\n *   Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((node?: null | undefined) => false) &\n   *   ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function (node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      return looksLikeANode(node)\n        ? check.call(context, node, index, parent)\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n *   An assertion.\n */\nexport const convert =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((test?: Test) => Check)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {Check}\n     */\n    function (test) {\n      if (test === null || test === undefined) {\n        return ok\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test) ? anyFactory(test) : propsFactory(test)\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<Props | TestFunction | string>} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<Check>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @type {TestFunction}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].apply(this, parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propsFactory(check) {\n  const checkAsRecord = /** @type {Record<string, unknown>} */ (check)\n\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    const nodeAsRecord = /** @type {Record<string, unknown>} */ (\n      /** @type {unknown} */ (node)\n    )\n\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n  return check\n\n  /**\n   * @this {unknown}\n   * @type {Check}\n   */\n  function check(value, index, parent) {\n    return Boolean(\n      looksLikeANode(value) &&\n        testFunction.call(\n          this,\n          value,\n          typeof index === 'number' ? index : undefined,\n          parent || undefined\n        )\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n  return value !== null && typeof value === 'object' && 'type' in value\n}\n","/**\n * @typedef {import('unist').Node} UnistNode\n * @typedef {import('unist').Parent} UnistParent\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends Array<any>\n *   ? MatchesOne<Value, Check[keyof Check]>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {InternalAncestor<InclusiveDescendant<Tree>, Child>} Ancestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {'skip' | boolean} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<VisitedParents>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [VisitedParents=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Matches<InclusiveDescendant<Tree>, Check>, Ancestor<Tree, Matches<InclusiveDescendant<Tree>, Check>>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Tree type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from 'unist-util-visit-parents/do-not-use-color'\n\n/** @type {Readonly<ActionTuple>} */\nconst empty = []\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} test\n *   `unist-util-is`-compatible test\n * @param {Visitor | boolean | null | undefined} [visitor]\n *   Handle each node.\n * @param {boolean | null | undefined} [reverse]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visitParents(tree, test, visitor, reverse) {\n  /** @type {Test} */\n  let check\n\n  if (typeof test === 'function' && typeof visitor !== 'function') {\n    reverse = visitor\n    // @ts-expect-error no visitor given, so `visitor` is test.\n    visitor = test\n  } else {\n    // @ts-expect-error visitor given, so `test` isn’t a visitor.\n    check = test\n  }\n\n  const is = convert(check)\n  const step = reverse ? -1 : 1\n\n  factory(tree, undefined, [])()\n\n  /**\n   * @param {UnistNode} node\n   * @param {number | undefined} index\n   * @param {Array<UnistParent>} parents\n   */\n  function factory(node, index, parents) {\n    const value = /** @type {Record<string, unknown>} */ (\n      node && typeof node === 'object' ? node : {}\n    )\n\n    if (typeof value.type === 'string') {\n      const name =\n        // `hast`\n        typeof value.tagName === 'string'\n          ? value.tagName\n          : // `xast`\n          typeof value.name === 'string'\n          ? value.name\n          : undefined\n\n      Object.defineProperty(visit, 'name', {\n        value:\n          'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n      })\n    }\n\n    return visit\n\n    function visit() {\n      /** @type {Readonly<ActionTuple>} */\n      let result = empty\n      /** @type {Readonly<ActionTuple>} */\n      let subresult\n      /** @type {number} */\n      let offset\n      /** @type {Array<UnistParent>} */\n      let grandparents\n\n      if (!test || is(node, index, parents[parents.length - 1] || undefined)) {\n        // @ts-expect-error: `visitor` is now a visitor.\n        result = toResult(visitor(node, parents))\n\n        if (result[0] === EXIT) {\n          return result\n        }\n      }\n\n      if ('children' in node && node.children) {\n        const nodeAsParent = /** @type {UnistParent} */ (node)\n\n        if (nodeAsParent.children && result[0] !== SKIP) {\n          offset = (reverse ? nodeAsParent.children.length : -1) + step\n          grandparents = parents.concat(nodeAsParent)\n\n          while (offset > -1 && offset < nodeAsParent.children.length) {\n            const child = nodeAsParent.children[offset]\n\n            subresult = factory(child, offset, grandparents)()\n\n            if (subresult[0] === EXIT) {\n              return subresult\n            }\n\n            offset =\n              typeof subresult[1] === 'number' ? subresult[1] : offset + step\n          }\n        }\n      }\n\n      return result\n    }\n  }\n}\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {Readonly<ActionTuple>}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return value === null || value === undefined ? empty : [value]\n}\n","/**\n * @typedef {import('unist').Node} UnistNode\n * @typedef {import('unist').Parent} UnistParent\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n// To do: use types from `unist-util-visit-parents` when it’s released.\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends Array<any>\n *   ? MatchesOne<Value, Check[keyof Check]>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform `parent`.\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of `parent` still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Visited extends UnistNode ? number | undefined : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends UnistParent ? Ancestor | undefined : never} parent\n *   Parent of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [Ancestor=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Visited, Parent<Ancestor, Visited>>} BuildVisitorFromMatch\n *   Build a typed `Visitor` function from a node and all possible parents.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Visited\n *   Node type.\n * @template {UnistParent} Ancestor\n *   Parent type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     Matches<Descendant, Check>,\n *     Extract<Descendant, UnistParent>\n *   >\n * )} BuildVisitorFromDescendants\n *   Build a typed `Visitor` function from a list of descendants and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Node type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} testOrVisitor\n *   `unist-util-is`-compatible test (optional, omit to pass a visitor).\n * @param {Visitor | boolean | null | undefined} [visitorOrReverse]\n *   Handle each node (when test is omitted, pass `reverse`).\n * @param {boolean | null | undefined} [maybeReverse=false]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visit(tree, testOrVisitor, visitorOrReverse, maybeReverse) {\n  /** @type {boolean | null | undefined} */\n  let reverse\n  /** @type {Test} */\n  let test\n  /** @type {Visitor} */\n  let visitor\n\n  if (\n    typeof testOrVisitor === 'function' &&\n    typeof visitorOrReverse !== 'function'\n  ) {\n    test = undefined\n    visitor = testOrVisitor\n    reverse = visitorOrReverse\n  } else {\n    // @ts-expect-error: assume the overload with test was given.\n    test = testOrVisitor\n    // @ts-expect-error: assume the overload with test was given.\n    visitor = visitorOrReverse\n    reverse = maybeReverse\n  }\n\n  visitParents(tree, test, overload, reverse)\n\n  /**\n   * @param {UnistNode} node\n   * @param {Array<UnistParent>} parents\n   */\n  function overload(node, parents) {\n    const parent = parents[parents.length - 1]\n    const index = parent ? parent.children.indexOf(node) : undefined\n    return visitor(node, index, parent)\n  }\n}\n"],"names":["hasOwn","Object","prototype","hasOwnProperty","toStr","toString","defineProperty","gOPD","getOwnPropertyDescriptor","isArray","arr","Array","call","isPlainObject","obj","key","hasOwnConstructor","hasIsPrototypeOf","constructor","setProperty","target","options","name","enumerable","configurable","value","newValue","writable","getProperty","module","exports","extend","src","copy","copyIsArray","clone","arguments","i","length","deep","string","split","array","start","end","index","result","baseSlice","undefined","castSlice","hasUnicode","stringToArray","methodName","strSymbols","chr","charAt","trailing","join","slice","reHasUnicode","RegExp","test","asciiToArray","unicodeToArray","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsOptVar","rsSeq","rsSymbol","reUnicode","match","upperFirst","toLowerCase","createCaseFirst","emptyOptions","settings","one","includeImageAlt","includeHtml","Boolean","node","type","alt","children","values","splice","list","remove","items","parameters","chunkStart","from","unshift","push","subtokenize","events","jumps","event","lineIndex","otherIndex","otherEvent","subevents","more","_tokenizer","_isInFirstContentOfListItem","contentType","assign","subcontent","_container","eventIndex","token","context","startPosition","startPositions","tokenizer","parser","childEvents","gaps","stream","previous","current","adjust","breaks","sliceStream","next","defineSkip","_gfmTasklistFirstContentOfListItem","write","line","pop","syntaxExtension","all","extension","hook","left","right","code","constructs","existing","before","add","asciiAlpha","regexCheck","asciiAlphanumeric","asciiAtext","asciiControl","asciiDigit","asciiHexDigit","asciiPunctuation","markdownLineEnding","markdownLineEndingOrSpace","markdownSpace","unicodePunctuation","unicodeWhitespace","regex","String","fromCharCode","factorySpace","effects","ok","max","limit","Number","POSITIVE_INFINITY","size","enter","prefix","consume","exit","content","tokenize","contentStart","attempt","this","contentInitial","lineStart","data","self","stack","childFlow","childToken","lineStartOffset","continued","item","containerState","continuation","documentContinue","checkNewContainers","_closeFlow","closeFlow","indexBeforeExits","point","indexBeforeFlow","exitContainers","documentContinued","currentConstruct","concrete","flowStart","interrupt","_gfmTableDynamicInterruptHack","check","containerConstruct","thereIsANewContainer","thereIsNoNewContainer","lazy","now","offset","containerContinue","flow","flowContinue","writeToChild","eof","seen","entry","nok","document","disable","null","includes","blankLine","after","partial","chunkInside","contentEnd","continuationConstruct","contentContinue","resolve","prefixed","tail","sliceSerialize","initial","flowInitial","afterConstruct","resolver","resolveAll","createResolver","initializeFactory","field","text","notText","atBreak","resolveAllLineSuffixes","extraResolver","chunks","tabs","bufferIndex","chunk","charCodeAt","column","_index","_bufferIndex","called","createTokenizer","initialize","columnStart","resolveAllConstructs","consumed","accountForPotentialSkip","fields","constructFactory","construct","info","addResult","onsuccessfulcheck","expandTabs","atTab","serializeChunks","main","expectedCode","state","startIndex","startBufferIndex","endIndex","endBufferIndex","view","head","shift","sliceChunks","chunkIndex","go","_","restore","onreturn","returnState","bogusState","listOfConstructs","constructIndex","handleListOfConstructs","map","def","handleMapOfConstructs","handleConstruct","startPoint","startPrevious","startCurrentConstruct","startEventsIndex","startStack","store","create","resolveTo","thematicBreak","marker","sequence","initialSize","kind","atMarker","inside","onBlank","listItemPrefixWhitespaceConstruct","endOfPrefix","otherPrefix","initialBlankLine","notBlank","furtherBlankLines","notInCurrentItem","indentConstruct","blockQuote","open","contBefore","factoryDestination","literalType","literalMarkerType","rawType","stringType","balance","enclosedBefore","raw","enclosed","enclosedEscape","rawEscape","factoryLabel","markerType","labelInside","labelEscape","factoryTitle","begin","escape","factoryWhitespace","normalizeIdentifier","replace","toUpperCase","definition","identifier","labelAfter","markerAfter","destinationBefore","destinationAfter","titleBefore","afterWhitespace","defined","beforeMarker","titleAfter","titleAfterOptionalWhitespace","codeIndented","afterPrefix","furtherStart","headingAtx","sequenceOpen","sequenceFurther","setextUnderline","paragraph","heading","htmlBlockNames","htmlRawNames","htmlFlow","closingTag","buffer","markerB","declarationOpen","tagCloseStart","continuationDeclarationInside","tagName","commentOpenInside","cdataOpenInside","slash","basicSelfClosing","completeClosingTagAfter","completeAttributeNameBefore","completeEnd","completeAttributeName","completeAttributeNameAfter","completeAttributeValueBefore","completeAttributeValueQuoted","completeAttributeValueUnquoted","completeAttributeValueQuotedAfter","completeAfter","continuationCommentInside","continuationRawTagOpen","continuationClose","continuationCdataInside","continuationStart","blankLineBefore","continuationAfter","nonLazyContinuationStart","continuationStartNonLazy","continuationBefore","continuationRawEndTag","nonLazyContinuation","codeFenced","closeStart","startBefore","beforeSequenceClose","sequenceClose","sizeOpen","sequenceCloseAfter","initialPrefix","beforeSequenceOpen","infoBefore","atNonLazyBreak","metaBefore","meta","contentBefore","beforeContentChunk","contentChunk","createElement","decodeNamedCharacterReference","characterReference","innerHTML","char","textContent","numeric","characterEscape","lineEnding","labelEnd","labelStart","_balanced","_inactive","labelEndNok","resourceConstruct","labelEndOk","referenceFullConstruct","referenceNotFull","referenceCollapsedConstruct","close","media","group","label","insideSpan","resourceBefore","resourceOpen","resourceEnd","resourceDestinationAfter","resourceDestinationMissing","resourceBetween","resourceTitleAfter","referenceFullAfter","referenceFullMissing","referenceCollapsedOpen","labelStartImage","classifyCharacter","attention","attentionMarkers","_open","_close","openingSequence","closingSequence","use","nextEvents","movePoint","autolink","schemeOrEmailAtext","emailAtext","schemeInsideOrEmailAtext","urlInside","emailAtSignOrDot","emailLabel","emailValue","htmlText","instruction","tagOpen","declaration","commentEnd","comment","commentClose","lineEndingBefore","cdata","cdataClose","cdataEnd","instructionClose","tagClose","tagCloseBetween","tagOpenBetween","tagOpenAttributeName","tagOpenAttributeNameAfter","tagOpenAttributeValueBefore","tagOpenAttributeValueQuoted","tagOpenAttributeValueUnquoted","tagOpenAttributeValueQuotedAfter","lineEndingAfter","lineEndingAfterPrefix","labelStartLink","hardBreakEscape","codeText","between","tailExitIndex","headEnterIndex","parse","extensions","combineExtensions","search","decodeNumericCharacterReference","base","parseInt","fromCodePoint","characterEscapeOrReference","decodeString","decode","$0","$1","$2","hex","stringifyPosition","position","pos","own","fromMarkdown","encoding","config","transforms","canContainEols","opener","link","autolinkProtocol","onenterdata","autolinkEmail","atxHeading","codeFlow","codeFencedFenceInfo","codeFencedFenceMeta","codeTextData","codeFlowValue","definitionDestinationString","definitionLabelString","definitionTitleString","emphasis","hardBreak","hardBreakTrailing","html","htmlFlowData","htmlTextData","image","listItem","listItemValue","onenterlistitemvalue","listOrdered","onenterlistordered","listUnordered","reference","onenterreference","referenceString","resourceDestinationString","resourceTitleString","setextHeading","strong","closer","atxHeadingSequence","onexitatxheadingsequence","onexitautolinkemail","onexitautolinkprotocol","characterEscapeValue","onexitdata","characterReferenceMarkerHexadecimal","onexitcharacterreferencemarker","characterReferenceMarkerNumeric","characterReferenceValue","onexitcharacterreferencevalue","onexitcodefenced","codeFencedFence","onexitcodefencedfence","onexitcodefencedfenceinfo","onexitcodefencedfencemeta","onexitcodeindented","onexitcodetext","onexitdefinitiondestinationstring","onexitdefinitionlabelstring","onexitdefinitiontitlestring","onexithardbreak","onexithtmlflow","onexithtmltext","onexitimage","onexitlabel","labelText","onexitlabeltext","onexitlineending","onexitlink","onexitreferencestring","onexitresourcedestinationstring","onexitresourcetitlestring","resource","onexitresource","onexitsetextheading","setextHeadingLineSequence","onexitsetextheadinglinesequence","setextHeadingText","onexitsetextheadingtext","configure","mdastExtensions","compile","tree","tokenStack","resume","listStack","prepareList","handler","defaultOnError","firstBlankLineIndex","containerBalance","listSpread","tailIndex","tailEvent","_spread","and","errorHandler","onExitError","Error","expectingFirstListItemValue","lang","flowCodeInside","title","url","depth","setextHeadingSlurpLineEnding","codePointAt","siblings","atHardBreak","inReference","referenceType","ancestor","fragment","characterReferenceType","ordered","spread","checked","compiler","postprocess","atCarriageReturn","endPosition","TextDecoder","lastIndex","exec","Math","ceil","preprocess","d","combined","remarkParse","doc","blank","patternInScope","pattern","listInScope","inConstruct","notInConstruct","none","_1","unsafe","character","formatCodeAsIndented","fences","checkQuote","quote","checkEmphasis","tracker","createTracker","move","containerPhrasing","peek","formatHeadingAsSetext","literalWithBreak","setext","suffix","subexit","safe","imageReference","associationId","inlineCode","expression","compilePattern","formatLinkAsAutolink","resourceLink","linkReference","checkBullet","bullet","checkRule","rule","phrasing","checkStrong","handle","blockquote","indentLines","containerFlow","break","fence","checkFence","repeat","substring","source","indexOf","expected","count","TypeError","longestStreak","encode","rank","min","lastIndexOf","closeAtx","parent","bulletCurrent","bulletOrdered","checkBulletOrdered","bulletOther","checkBulletOther","useDifferentMarker","bulletLastUsed","firstListItem","indexStack","listItemIndent","style","checkListItemIndent","incrementListMarker","root","hasPhrasing","some","ruleSpaces","repetition","ruleRepetition","checkRuleRepetition","fullPhrasingSpans","association","_compiled","eol","numerical","a","b","escapeBackslashes","positions","results","whole","track","lineShift","input","toMarkdown","containerPhrasingBound","containerFlowBound","safeBound","handlers","tightDefinitions","joinDefinition","fn","invalid","id","unknown","zwitch","child","infos","sort","remarkStringify","bail","error","getPrototypeOf","Symbol","toStringTag","iterator","trough","fns","pipeline","run","middlewareIndex","callback","output","middleware","wrapped","fnExpectsCallback","done","apply","exception","then","wrap","middelware","VFileMessage","causeOrReason","optionsOrParentOrPlace","origin","super","reason","legacyCause","place","ancestors","cause","message","ruleId","fatal","file","actual","note","path","basename","ext","assertPath","seenNonSlash","firstNonSlashEnd","extIndex","dirname","unmatchedSlash","extname","startPart","startDot","preDotState","segments","joined","absolute","allowAboveRoot","lastSlashIndex","lastSegmentLength","lastSlash","dots","normalizeString","normalize","JSON","stringify","proc","cwd","isUrl","fileUrlOrPath","href","protocol","auth","urlToPath","URL","hostname","pathname","third","decodeURIComponent","getPathFromURLPosix","order","VFile","isUint8Array","history","messages","stored","prop","assertNonEmpty","assertPart","stem","fail","part","sep","CallableInstance","property","proto","func","setPrototypeOf","names","getOwnPropertyNames","p","descriptor","Processor","Compiler","Parser","attachers","freezeIndex","frozen","namespace","transformers","destination","attacher","assertUnfrozen","freeze","transformer","realFile","vfile","assertParser","process","assertCompiler","executor","Promise","reject","parseTree","realDone","compileTree","compileResult","processSync","complete","assertDone","assertNode","outputTree","resultingTree","runSync","addPlugin","addList","addPreset","plugin","plugins","entryIndex","primary","rest","currentPrimary","unified","asyncName","looksLikeAVFile","N","O","T","F","k","M","G","h","n","has","r","get","c","WeakSet","set","o","t","Q","U","elements","top","at","B","attrs","static","S","isText","s","marks","schema","nodes","find","e","spec","parseMarkdown","runner","injectRoot","openNode","closeNode","createAndFill","addNode","openMark","addToSet","closeMark","removeFromSet","addText","build","flat","forEach","toDoc","WeakMap","H","q","props","J","l","v","A","E","w","j","x","R","m","g","C","P","z","u","priority","f","every","y","I","reduce","isMark","V","concat","isInSet","withMark","Z","K","ve","package","De","L","ke","ue","pe","fe","ye","inject","record","async","waitTimers","clearTimer","displayName","X","Te","parseDOM","Ee","fromEntries","W","Ie","Y","Ve","$","ee","Me","te","Ne","re","se","ie","mt","dt","Backspace","_e","dom","ct","init","Be","ft","Le","rules","ne","oe","ae","ce","we","ge","ut","ze","body","wait","querySelector","update","className","appendChild","entries","setAttribute","ht","replaceChild","destroy","parentNode","nodeViews","markViews","classList","lt","Ke","setCtx","ctx","sliceMap","dispatch","Et","je","me","Ae","D","Oe","Ce","Map","ot","produce","cleanup","delete","clear","enableInspector","onStatusChange","removeConfig","filter","console","warn","setTimeout","keys","action","inspect","inspector","read","status","on","once","off","offAll","_defaultValue","_typeInfo","Set","metadata","injectedSlices","consumedSlices","recordedTimers","duration","onRecord","Date","onClear","onDone","onWait","finally","onInject","onRemove","onUse","isInjected","isRecorded","timer","CustomEvent","detail","stopImmediatePropagation","addEventListener","dispatchEvent","removeEventListener","timeout","docTypeError","contextNotFound","timerNotFound","ctxCallOutOfScope","createNodeInParserFail","stackOverFlow","parserMatchError","serializerMatchError","getAtomFromSchemaFail","expectDomTypeError","callCommandBeforeEditorView","missingRootElement","missingNodeInSchema","missingMarkInSchema","ctxNotBind","missingYjsDoc","toJSON","escapeStringRegexp","transliterate","customReplacements","replacements","doCustomReplacements","slugify","shouldPrependUnderscore","separator","lowercase","decamelize","preserveLeadingUnderscore","preserveTrailingDash","preserveCharacters","startsWith","shouldAppendDash","endsWith","patternSlug","negationSetPattern","buildPatternSlug","escapedSeparator","removeMootSeparators","liftListItem","itemType","$from","$to","selection","range","blockRange","childCount","firstChild","tr","endOfList","step","lift","mapping","scrollIntoView","liftToOuterList","nodeSize","$start","nodeAfter","atStart","atEnd","indexBefore","canReplace","append","liftOutOfList","clean","remarkInlineLinks","cache","definitions","lastChild","default","tag","getAttrs","toDOM","mark","nt","updateCaptured","fullMatch","ToggleEmphasis","shortcuts","command","st","ToggleBold","inclusive","empty","to","rangeHasMark","removeMark","addMark","le","ToggleInlineCode","HTMLElement","getAttribute","it","nodesBetween","setSelection","$anchor","de","TurnIntoText","Dt","fill","defining","level","pt","groups","hashes","parentOffset","setNodeMarkup","TurnIntoH1","TurnIntoH2","TurnIntoH3","TurnIntoH4","TurnIntoH5","TurnIntoH6","DowngradeHeading","he","WrapInBlockquote","pre","language","preserveWhitespace","dataset","setNodeAttribute","CreateCodeBlock","inline","selectable","draggable","atom","isolating","gt","replaceSelectionWith","yt","replaceWith","isInline","leafText","be","replaceRangeWith","setMeta","InsertHardbreak","xe","kt","insert","Se","WrapInBulletList","He","hasAttribute","Nt","Re","WrapInOrderedList","listType","nodeBefore","nestedBefore","inner","isBlock","sameParent","grandParent","indexAfter","depthBefore","depthAfter","sel","isTextblock","nextType","contentMatchAt","defaultType","types","itemAttrs","$t","NextListItem","SinkListItem","LiftListItem","LiftFirstListItem","It","Pe","qt","Wt","Ft","Vt","Ut","$e","qe","We","Fe","Gt","zt","jt","Ct","handleDOMEvents","compositionend","requestAnimationFrame","getState","preventDefault","insertText","compositionstart","beforeinput","InputEvent","decorations","side","contentEditable","Mt","appendTransaction","steps","getMeta","Ue","bt","filterTransaction","Lt","composing","editable","descendants","trim","xt","maybeChild","Ge","Qt","St","cr","nav","navigator","agent","userAgent","ie_edge","ie_upto10","ie_11up","gecko","documentMode","_chrome","safari","vendor","ios","maxTouchPoints","webkit","platform","documentElement","textBefore","textBetween","transform","customInputRulesKey","customInputRules","isInputRules","prev","selectionSet","docChanged","handleTextInput","$cursor","handleKeyDown","markRule","regexp","markType","_a","_b","_c","_d","initialStoredMarks","markEnd","captured","startSpaces","textStart","textEnd","storedMarks","getAttr","setStoredMarks","beforeDispatch","defineProperties","getOwnPropertyDescriptors","getOwnPropertySymbols","propertyIsEnumerable","findSelectedNodeOfType","nodeType","equalNodeType","editor","setLoading","editorFactory","catch","ref","loading","setEditorFactory","Provider","random","bytes","crypto","getRandomValues","Uint8Array","alphabet","defaultSize","getRandom","mask","log","LN2","customRandom","inputRule","extendSchema","keymap","flatMap","updateState","deleteSelection","atBlockStart","endOfTextblock","joinBackward","$cut","findCutBefore","deleteBarrier","textblockAt","delStep","isAtom","only","scan","selectNodeBackward","$head","$pos","atBlockEnd","findCutAfter","defaultBlockAt","edgeCount","edge","hasRequiredAttrs","splitBlock","deflt","splitType","splitNode","can","first","$first","canReplaceWith","conn","compatibleContent","clearIncompatible","joinMaybeClear","canDelAfter","findWrapping","matchType","validEnd","joinAt","selAfter","afterText","afterDepth","selectTextblockSide","selectTextblockStart","selectTextblockEnd","wrapIn","wrapping","setBlockType","applicable","ranges","hasMarkup","toggleMark","inlineContent","allowsMarkType","markApplies","removeStoredMark","addStoredMark","spaceStart","spaceEnd","chainCommands","commands","backspace","del","pcBaseKeymap","above","macBaseKeymap","baseKeymap","os","InputRule","cutOff","undoable","inCode","undoInputRule","toUndo","invert","docs","wrappingInputRule","joinPredicate","Function","textblockTypeInputRule","mac","normalizeKeyName","ctrl","parts","mod","modifiers","altKey","ctrlKey","metaKey","shiftKey","bindings","keydownHandler","baseName","keyCode","keyName","direct","noShift","fromCode","OrderedMap","found","newKey","addToStart","addToEnd","addBefore","without","prepend","subtract","toObject","findDiffStart","childA","childB","sameMarkup","findDiffEnd","posA","posB","iA","iB","same","minSize","Fragment","nodeStart","blockSeparator","nodeText","isLeaf","other","last","withText","cut","cutByIndex","eq","RangeError","otherPos","findIndex","round","retIndex","curPos","toStringInner","nodeFromJSON","fromArray","compareDeep","Mark","placed","excludes","json","ReplaceError","Slice","openStart","openEnd","insertAt","insertInto","removeBetween","removeRange","fromJSON","openIsolating","indexTo","offsetTo","dist","replaceOuter","$along","extra","resolveNoCache","prepareSliceForReplace","replaceThreeWay","replaceTwoWay","checkJoin","sub","joinable","$before","$after","addRange","$end","textOffset","checkContent","ResolvedPos","resolveDepth","val","dOff","posAtIndex","tmp","marksAcross","sharedDepth","pred","NodeRange","str","rem","resolveCache","cached","resolveCachePos","resolveCacheSize","emptyAttrs","Node","startPos","defaultAttrs","sameSet","includeParents","nodeAt","childAfter","childBefore","resolveCached","toDebugString","wrapMarks","contentMatch","matchFragment","replacement","two","allowsMarks","canAppend","markFromJSON","TextNode","ContentMatch","wrapCache","nodeTypes","TokenStream","expr","parseExpr","err","nfa","labeled","explore","nullFrom","states","out","term","cmp","dfa","connect","edges","exprs","loop","cur","work","dead","checkForDeadEnds","frag","compatible","fillBefore","toEnd","finished","tp","computed","computeWrapping","active","via","reverse","tokens","eat","tok","SyntaxError","parseExprSeq","parseExprSubscript","typeName","resolveName","parseExprAtom","parseExprRange","parseNum","defaults","attrName","attr","hasDefault","computeAttrs","built","given","initAttrs","Attribute","NodeType","markSet","whitespace","isRequired","setFrom","createChecked","matched","validContent","allowedMarks","topType","topNode","MarkType","excluded","instance","Schema","instanceSpec","contentExprCache","contentExpr","markExpr","gatherMarks","excl","bind","topNodeType","wrappings","DOMParser","tags","styles","normalizeLists","ParseContext","addAll","finish","parseSlice","maxOpen","matchTag","matches","namespaceURI","matchesContext","matchStyle","ignore","clearMark","domParser","schemaRules","blockTags","address","article","aside","canvas","dd","div","dl","fieldset","figcaption","figure","footer","form","h1","h2","h3","h4","h5","h6","header","hgroup","hr","li","noscript","ol","section","table","tfoot","ul","ignoreTags","object","script","listTags","wsOptionsFor","OPT_PRESERVE_WS","NodeContext","pendingMarks","solid","activeMarks","stashMarks","popFromStashMark","applyPending","pending","markMayApply","inlineContext","nodeName","isOpen","topContext","topOptions","topMatch","findPositions","needsBlock","addDOM","addTextNode","addElement","withStyleRules","readStyles","parseStyles","addMarks","removeMarks","removePendingMark","addPendingMark","nodeValue","domNodeBefore","previousSibling","insertNode","findInText","findInside","matchAfter","ruleID","prevItem","nextSibling","normalizeList","ruleFromNode","ignoreFallback","skip","closeParent","sync","oldNeedsBlock","leafFallback","addElementByRule","consuming","ownerDocument","createTextNode","findPlace","continueAfter","startIn","getContent","contentDOM","contentElement","findAround","childNodes","findAtPoint","route","cx","enterInner","block","textblockFromContext","closeExtra","preserveWS","topOpen","currentPos","contains","compareDocumentPosition","textNode","option","useRoot","minDepth","$context","findSameMarkInSet","upto","stashMark","selector","msMatchesSelector","webkitMatchesSelector","mozMatchesSelector","DOMSerializer","serializeFragment","createDocumentFragment","keep","rendered","spanning","markDOM","serializeMark","serializeNodeInner","renderSpec","serializeNode","structure","xmlNS","space","createElementNS","setAttributeNS","innerContent","domSerializer","nodesFromSchema","marksFromSchema","gatherToDOM","window","classesById","Selection","SelectionRange","anchor","lastNode","lastParent","mapFrom","replaceRange","selectionToInsertionEnd","deleteRange","dir","textOnly","TextSelection","findSelectionIn","bias","findFrom","AllSelection","cls","selectionClass","jsonID","getBookmark","visible","warnedAboutTextSelection","checkTextSelection","near","ensureMarks","TextBookmark","dPos","NodeSelection","deleted","mapResult","NodeBookmark","isSelectable","AllBookmark","startLen","maps","_from","_to","_newFrom","newTo","Transaction","curSelectionFor","updated","time","curSelection","storedMarksSet","addStep","setTime","replaceSelection","inheritMarks","isGeneric","scrolledIntoView","FieldDesc","desc","baseFields","_marks","_old","Configuration","pluginsByKey","EditorState","applyTransaction","rootTr","transactions","trs","newState","applyInner","haveNew","oldState","newInstance","$config","reconfigure","pluginFields","bindProps","Plugin","createKey","PluginKey","factor16","pow","recoverIndex","MapResult","delInfo","recover","deletedBefore","deletedAfter","deletedAcross","StepMap","inverted","diff","recoverOffset","assoc","_map","simple","oldIndex","newIndex","oldSize","newSize","touches","oldStart","newStart","Mapping","mirror","appendMap","mirrors","setMirror","appendMapping","startSize","mirr","getMirror","appendMappingInverted","totalSize","inverse","corr","stepsByID","Step","getMap","merge","stepType","stepClass","StepResult","failed","mapFragment","mapped","AddMarkStep","oldSlice","fromReplace","RemoveMarkStep","AddNodeMarkStep","newSet","RemoveNodeMarkStep","ReplaceStep","contentBetween","ReplaceAroundStep","gapFrom","gapTo","gap","inserted","canCut","liftTarget","innerRange","around","outer","findWrappingOutside","innerMatch","findWrappingInside","withAttrs","canSplit","typesAfter","innerType","overrideChild","baseType","canJoin","dropPoint","pass","insertPos","fits","replaceStep","fitsTrivially","Fitter","fit","unplaced","frontier","findFittable","placeNodes","openMore","dropNode","moveInline","mustMoveInline","placedSize","startDepth","sliceDepth","contentAt","frontierDepth","openAtEnd","dropFromFragment","closeFrontierNode","openFrontierNode","taken","openEndCount","closeNodeStart","addToFragment","contentAfterFits","findCloseLevel","dropInner","invalidMarks","closeFragment","oldOpen","newOpen","coveredDepths","AttrStep","DocAttrStep","TransformError","__proto__","Transform","maybeStep","targetDepths","preferredTarget","definingAsContext","preferredTargetIndex","leftNodes","preferredDepth","leftNode","definingForContent","abs","openDepth","targetDepth","expand","startSteps","insertPoint","covered","gapStart","gapEnd","splitting","wrappers","canChangeType","startM","endM","newNode","setDocAttribute","addNodeMark","removeNodeMark","typeAfter","removing","adding","removed","added","toRemove","parentType","replSteps","allowed","newline","convert","castFactory","tests","checks","any","anyFactory","checkAsRecord","nodeAsRecord","propsFactory","typeFactory","testFunction","looksLikeANode","EXIT","SKIP","visitParents","visitor","is","factory","parents","visit","subresult","grandparents","toResult","nodeAsParent","testOrVisitor","visitorOrReverse","maybeReverse"],"sourceRoot":""}