@next-bricks/markdown 1.0.5 → 1.2.0

package/dist/chunks/287.13f9cb86.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"chunks/287.13f9cb86.js","mappings":";2HAMAA,EAAOC,QAAU,SAAUC,GACzB,IAAIC,EAAO,GA4EX,OAzEAA,EAAKC,SAAW,WACd,OAAOC,KAAKC,KAAI,SAAUC,GACxB,IAAIC,EAAU,GACVC,OAA+B,IAAZF,EAAK,GAoB5B,OAnBIA,EAAK,KACPC,GAAW,cAAcE,OAAOH,EAAK,GAAI,QAEvCA,EAAK,KACPC,GAAW,UAAUE,OAAOH,EAAK,GAAI,OAEnCE,IACFD,GAAW,SAASE,OAAOH,EAAK,GAAGI,OAAS,EAAI,IAAID,OAAOH,EAAK,IAAM,GAAI,OAE5EC,GAAWN,EAAuBK,GAC9BE,IACFD,GAAW,KAETD,EAAK,KACPC,GAAW,KAETD,EAAK,KACPC,GAAW,KAENA,CACT,IAAGI,KAAK,GACV,EAGAT,EAAKU,EAAI,SAAWC,EAASC,EAAOC,EAAQC,EAAUC,GAC7B,iBAAZJ,IACTA,EAAU,CAAC,CAAC,KAAMA,OAASK,KAE7B,IAAIC,EAAyB,CAAC,EAC9B,GAAIJ,EACF,IAAK,IAAIK,EAAI,EAAGA,EAAIhB,KAAKM,OAAQU,IAAK,CACpC,IAAIC,EAAKjB,KAAKgB,GAAG,GACP,MAANC,IACFF,EAAuBE,IAAM,EAEjC,CAEF,IAAK,IAAIC,EAAK,EAAGA,EAAKT,EAAQH,OAAQY,IAAM,CAC1C,IAAIhB,EAAO,GAAGG,OAAOI,EAAQS,IACzBP,GAAUI,EAAuBb,EAAK,WAGrB,IAAVW,SACc,IAAZX,EAAK,KAGdA,EAAK,GAAK,SAASG,OAAOH,EAAK,GAAGI,OAAS,EAAI,IAAID,OAAOH,EAAK,IAAM,GAAI,MAAMG,OAAOH,EAAK,GAAI,MAF/FA,EAAK,GAAKW,GAMVH,IACGR,EAAK,IAGRA,EAAK,GAAK,UAAUG,OAAOH,EAAK,GAAI,MAAMG,OAAOH,EAAK,GAAI,KAC1DA,EAAK,GAAKQ,GAHVR,EAAK,GAAKQ,GAMVE,IACGV,EAAK,IAGRA,EAAK,GAAK,cAAcG,OAAOH,EAAK,GAAI,OAAOG,OAAOH,EAAK,GAAI,KAC/DA,EAAK,GAAKU,GAHVV,EAAK,GAAK,GAAGG,OAAOO,IAMxBd,EAAKqB,KAAKjB,GACZ,CACF,EACOJ,CACT,yBClFAH,EAAOC,QAAU,SAAUY,GACzB,OAAOA,EAAE,EACX,yBCFA,IAAIY,EAASC,OAAOC,UAAUC,eAC1BC,EAAQH,OAAOC,UAAUvB,SACzB0B,EAAiBJ,OAAOI,eACxBC,EAAOL,OAAOM,yBAEdC,EAAU,SAAiBC,GAC9B,MAA6B,mBAAlBC,MAAMF,QACTE,MAAMF,QAAQC,GAGK,mBAApBL,EAAMO,KAAKF,EACnB,EAEIG,EAAgB,SAAuBC,GAC1C,IAAKA,GAA2B,oBAApBT,EAAMO,KAAKE,GACtB,OAAO,EAGR,IASIC,EATAC,EAAoBf,EAAOW,KAAKE,EAAK,eACrCG,EAAmBH,EAAII,aAAeJ,EAAII,YAAYf,WAAaF,EAAOW,KAAKE,EAAII,YAAYf,UAAW,iBAE9G,GAAIW,EAAII,cAAgBF,IAAsBC,EAC7C,OAAO,EAMR,IAAKF,KAAOD,GAEZ,YAAsB,IAARC,GAAuBd,EAAOW,KAAKE,EAAKC,EACvD,EAGII,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,QAEjC,EAGIE,EAAc,SAAqBd,EAAKQ,GAC3C,GAAa,cAATA,EAAsB,CACzB,IAAKrB,EAAOW,KAAKE,EAAKQ,GACrB,OACM,GAAIf,EAGV,OAAOA,EAAKO,EAAKQ,GAAMG,KAEzB,CAEA,OAAOX,EAAIQ,EACZ,EAEA9C,EAAOC,QAAU,SAASoD,IACzB,IAAIR,EAASC,EAAMQ,EAAKC,EAAMC,EAAaC,EACvCb,EAASc,UAAU,GACnB7C,EAAI,EACJF,EAAS+C,UAAU/C,OACnBgD,GAAO,EAaX,IAVsB,kBAAXf,IACVe,EAAOf,EACPA,EAASc,UAAU,IAAM,CAAC,EAE1B7C,EAAI,IAES,MAAV+B,GAAqC,iBAAXA,GAAyC,mBAAXA,KAC3DA,EAAS,CAAC,GAGJ/B,EAAIF,IAAUE,EAGpB,GAAe,OAFfgC,EAAUa,UAAU7C,IAInB,IAAKiC,KAAQD,EACZS,EAAMF,EAAYR,EAAQE,GAItBF,KAHJW,EAAOH,EAAYP,EAASC,MAKvBa,GAAQJ,IAASlB,EAAckB,KAAUC,EAAcvB,EAAQsB,MAC9DC,GACHA,GAAc,EACdC,EAAQH,GAAOrB,EAAQqB,GAAOA,EAAM,IAEpCG,EAAQH,GAAOjB,EAAciB,GAAOA,EAAM,CAAC,EAI5CX,EAAYC,EAAQ,CAAEE,KAAMA,EAAMI,SAAUG,EAAOM,EAAMF,EAAOF,WAGtC,IAATA,GACjBZ,EAAYC,EAAQ,CAAEE,KAAMA,EAAMI,SAAUK,KAQjD,OAAOX,CACR,YC7GA5C,EAAOC,QAAU,SAAmBqC,GAClC,OAAc,MAAPA,GAAkC,MAAnBA,EAAII,aACY,mBAA7BJ,EAAII,YAAYkB,UAA2BtB,EAAII,YAAYkB,SAAStB,EAC/E,iBCAA,IASIuB,EAAS,aAGTC,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAeC,SAGfC,EAA8B,iBAAV,EAAAC,GAAsB,EAAAA,GAAU,EAAAA,EAAO1C,SAAWA,QAAU,EAAA0C,EAGhFC,EAA0B,iBAARC,MAAoBA,MAAQA,KAAK5C,SAAWA,QAAU4C,KAGxEC,EAAOJ,GAAcE,GAAYG,SAAS,cAATA,GAUjCC,EAPc/C,OAAOC,UAOQvB,SAG7BsE,EAAYC,KAAKC,IACjBC,EAAYF,KAAKG,IAkBjBC,EAAM,WACR,OAAOR,EAAKS,KAAKD,KACnB,EA2MA,SAASE,EAAShC,GAChB,IAAIiC,SAAcjC,EAClB,QAASA,IAAkB,UAARiC,GAA4B,YAARA,EACzC,CA2EA,SAASC,EAASlC,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAhCF,SAAkBA,GAChB,MAAuB,iBAATA,GAtBhB,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,CAC3B,CAqBKmC,CAAanC,IAzTF,mBAyTYwB,EAAerC,KAAKa,EAChD,CA6BMoC,CAASpC,GACX,OA3VM,IA6VR,GAAIgC,EAAShC,GAAQ,CACnB,IAAIqC,EAAgC,mBAAjBrC,EAAMsC,QAAwBtC,EAAMsC,UAAYtC,EACnEA,EAAQgC,EAASK,GAAUA,EAAQ,GAAMA,CAC3C,CACA,GAAoB,iBAATrC,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQA,EAAMuC,QAAQ3B,EAAQ,IAC9B,IAAI4B,EAAW1B,EAAW2B,KAAKzC,GAC/B,OAAQwC,GAAYzB,EAAU0B,KAAKzC,GAC/BgB,EAAahB,EAAM0C,MAAM,GAAIF,EAAW,EAAI,GAC3C3B,EAAW4B,KAAKzC,GAxWb,KAwW6BA,CACvC,CAEAjD,EAAOC,QAtPP,SAAkB2F,EAAMC,EAAMhD,GAC5B,IAAIiD,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTC,GAAW,EAEf,GAAmB,mBAARX,EACT,MAAM,IAAIY,UArIQ,uBA+IpB,SAASC,EAAWC,GAClB,IAAIC,EAAOb,EACPc,EAAUb,EAKd,OAHAD,EAAWC,OAAW5E,EACtBiF,EAAiBM,EACjBT,EAASL,EAAKiB,MAAMD,EAASD,EAE/B,CAmBA,SAASG,EAAaJ,GACpB,IAAIK,EAAoBL,EAAOP,EAM/B,YAAyBhF,IAAjBgF,GAA+BY,GAAqBlB,GACzDkB,EAAoB,GAAOT,GANJI,EAAON,GAM8BJ,CACjE,CAEA,SAASgB,IACP,IAAIN,EAAO3B,IACX,GAAI+B,EAAaJ,GACf,OAAOO,EAAaP,GAGtBR,EAAUgB,WAAWF,EAzBvB,SAAuBN,GACrB,IAEIT,EAASJ,GAFWa,EAAOP,GAI/B,OAAOG,EAASzB,EAAUoB,EAAQD,GAHRU,EAAON,IAGkCH,CACrE,CAmBqCkB,CAAcT,GACnD,CAEA,SAASO,EAAaP,GAKpB,OAJAR,OAAU/E,EAINoF,GAAYT,EACPW,EAAWC,IAEpBZ,EAAWC,OAAW5E,EACf8E,EACT,CAcA,SAASmB,IACP,IAAIV,EAAO3B,IACPsC,EAAaP,EAAaJ,GAM9B,GAJAZ,EAAWpC,UACXqC,EAAW1F,KACX8F,EAAeO,EAEXW,EAAY,CACd,QAAgBlG,IAAZ+E,EACF,OAvEN,SAAqBQ,GAMnB,OAJAN,EAAiBM,EAEjBR,EAAUgB,WAAWF,EAAcnB,GAE5BQ,EAAUI,EAAWC,GAAQT,CACtC,CAgEaqB,CAAYnB,GAErB,GAAIG,EAGF,OADAJ,EAAUgB,WAAWF,EAAcnB,GAC5BY,EAAWN,EAEtB,CAIA,YAHgBhF,IAAZ+E,IACFA,EAAUgB,WAAWF,EAAcnB,IAE9BI,CACT,CAGA,OAxGAJ,EAAOV,EAASU,IAAS,EACrBZ,EAASpC,KACXwD,IAAYxD,EAAQwD,QAEpBL,GADAM,EAAS,YAAazD,GACH6B,EAAUS,EAAStC,EAAQmD,UAAY,EAAGH,GAAQG,EACrEO,EAAW,aAAc1D,IAAYA,EAAQ0D,SAAWA,GAiG1Da,EAAUG,OAnCV,gBACkBpG,IAAZ+E,GACFsB,aAAatB,GAEfE,EAAiB,EACjBN,EAAWK,EAAeJ,EAAWG,OAAU/E,CACjD,EA8BAiG,EAAUK,MA5BV,WACE,YAAmBtG,IAAZ+E,EAAwBD,EAASgB,EAAalC,IACvD,EA2BOqC,CACT,8DC/De,SAASM,EAAeC,EAAaC,EAAYC,GAC9D,OAAQH,EA3LV,WACE,SAASI,EAA2BC,EAAcC,GAChD,OAAO,SAAUC,IACd,SAAUD,EAAsBE,GAC/B,GAAIF,EAAqBG,EAAG,MAAM,IAAIC,MAAM,iEAC9C,CAFC,CAECJ,GAAyCK,EAAeJ,EAAa,kBAAmBF,EAAavG,KAAKyG,EAC9G,CACF,CACA,SAASK,EAAUC,EAAKzF,EAAM0F,EAAMT,EAAcU,EAAMC,EAAUC,EAAW1F,GAC3E,IAAI2F,EACJ,OAAQH,GACN,KAAK,EACHG,EAAU,WACV,MACF,KAAK,EACHA,EAAU,SACV,MACF,KAAK,EACHA,EAAU,SACV,MACF,KAAK,EACHA,EAAU,SACV,MACF,QACEA,EAAU,QAEd,IAAIC,EACFC,EACAC,EAAM,CACJN,KAAMG,EACN9F,KAAM6F,EAAY,IAAM7F,EAAOA,EAC/B,OAAU4F,EACV,QAAWC,GAEbX,EAAuB,CACrBG,GAAG,GAEP,IAAMM,IAASM,EAAIC,eAAiBlB,EAA2BC,EAAcC,IAAwB,IAAMS,EAAOE,GAAaE,EAAML,EAAKK,IAAKC,EAAMN,EAAKM,MAAQD,EAAM,WACtK,OAAOxI,KAAKyC,EACd,EAAGgG,EAAM,SAAaX,GACpB9H,KAAKyC,GAAQqF,CACf,GAAK,IAAMM,EAAOI,EAAM,WACtB,OAAOL,EAAKvF,KACd,GAAK,IAAMwF,GAAQ,IAAMA,IAASI,EAAM,WACtC,OAAOL,EAAKK,IAAIzG,KAAK/B,KACvB,GAAI,IAAMoI,GAAQ,IAAMA,IAASK,EAAM,SAAaX,GAClDK,EAAKM,IAAI1G,KAAK/B,KAAM8H,EACtB,IAAKY,EAAIE,OAASJ,GAAOC,EAAM,CAC7BD,IAAKA,EACLC,IAAKA,GACHD,EAAM,CACRA,IAAKA,GACH,CACFC,IAAKA,GAEP,IACE,OAAOP,EAAItF,EAAO8F,EACpB,CAAE,QACAf,EAAqBG,GAAI,CAC3B,CACF,CACA,SAASE,EAAea,EAAIC,GAC1B,GAAI,mBAAqBD,EAAI,MAAM,IAAI1C,UAAU2C,EAAO,sBAC1D,CACA,SAASC,EAAuBX,EAAMxF,GACpC,IAAIiC,GAAO,OAAQjC,GACnB,GAAI,IAAMwF,EAAM,CACd,GAAI,WAAavD,GAAQ,OAASjC,EAAO,MAAM,IAAIuD,UAAU,8FAC7D,IAAWvD,EAAM4F,KAAOR,EAAepF,EAAM4F,IAAK,qBAAiB,IAAW5F,EAAM6F,KAAOT,EAAepF,EAAM6F,IAAK,qBAAiB,IAAW7F,EAAMoG,MAAQhB,EAAepF,EAAMoG,KAAM,gBAC5L,MAAO,GAAI,aAAenE,EAExB,MAAsE,IAAIsB,WAA7D,IAAMiC,EAAO,QAAU,KAAOA,EAAO,QAAU,UAA+B,+CAE/F,CACA,SAASa,EAAeC,EAAKC,EAAMC,EAAS3G,EAAM2F,EAAMC,EAAUC,EAAWZ,GAC3E,IAAIS,EACFa,EACApG,EACAC,EACA2F,EACAC,EACAY,EAAOD,EAAQ,GACjB,GAAId,EAAYH,EAAO,IAAMC,GAAQ,IAAMA,EAAO,CAChDI,IAAKY,EAAQ,GACbX,IAAKW,EAAQ,IACX,IAAMhB,EAAO,CACfI,IAAKY,EAAQ,IACX,IAAMhB,EAAO,CACfK,IAAKW,EAAQ,IACX,CACFxG,MAAOwG,EAAQ,IACb,IAAMhB,IAASD,EAAO9G,OAAOM,yBAAyBwH,EAAM1G,IAAQ,IAAM2F,EAAOxF,EAAQ,CAC3F4F,IAAKL,EAAKK,IACVC,IAAKN,EAAKM,KACR,IAAML,EAAOxF,EAAQuF,EAAKvF,MAAQ,IAAMwF,EAAOxF,EAAQuF,EAAKK,IAAM,IAAMJ,IAASxF,EAAQuF,EAAKM,KAAM,mBAAqBY,OAAM,KAAYxG,EAAWoF,EAAUoB,EAAM5G,EAAM0F,EAAMT,EAAcU,EAAMC,EAAUC,EAAW1F,MAAYmG,EAAuBX,EAAMvF,GAAW,IAAMuF,EAAOY,EAAOnG,EAAW,IAAMuF,GAAQY,EAAOnG,EAASmG,KAAMR,EAAM3F,EAAS2F,KAAO5F,EAAM4F,IAAKC,EAAM5F,EAAS4F,KAAO7F,EAAM6F,IAAK7F,EAAQ,CAC9Z4F,IAAKA,EACLC,IAAKA,IACF7F,EAAQC,QAAe,IAAK,IAAIrC,EAAI6I,EAAK/I,OAAS,EAAGE,GAAK,EAAGA,IAAK,CACrE,IAAI8I,OACA,KAAYzG,EAAWoF,EAAUoB,EAAK7I,GAAIiC,EAAM0F,EAAMT,EAAcU,EAAMC,EAAUC,EAAW1F,MAASmG,EAAuBX,EAAMvF,GAAW,IAAMuF,EAAOkB,EAAUzG,EAAW,IAAMuF,GAAQkB,EAAUzG,EAASmG,KAAMR,EAAM3F,EAAS2F,KAAO5F,EAAM4F,IAAKC,EAAM5F,EAAS4F,KAAO7F,EAAM6F,IAAK7F,EAAQ,CACrS4F,IAAKA,EACLC,IAAKA,IACF7F,EAAQC,OAAU,IAAWyG,SAAY,IAAWN,EAAOA,EAAOM,EAAU,mBAAqBN,EAAOA,EAAO,CAACA,EAAMM,GAAWN,EAAK7H,KAAKmI,IAClJ,CACA,GAAI,IAAMlB,GAAQ,IAAMA,EAAM,CAC5B,QAAI,IAAWY,EAAMA,EAAO,SAAcO,EAAUC,GAClD,OAAOA,CACT,OAAO,GAAI,mBAAqBR,EAAM,CACpC,IAAIS,EAAkBT,EACtBA,EAAO,SAAcO,EAAUG,GAC7B,IAAK,IAAI9G,EAAQ8G,EAAQlJ,EAAI,EAAGA,EAAIiJ,EAAgBnJ,OAAQE,IAAKoC,EAAQ6G,EAAgBjJ,GAAGuB,KAAKwH,EAAU3G,GAC3G,OAAOA,CACT,CACF,KAAO,CACL,IAAI+G,EAAsBX,EAC1BA,EAAO,SAAcO,EAAUK,GAC7B,OAAOD,EAAoB5H,KAAKwH,EAAUK,EAC5C,CACF,CACAV,EAAI/H,KAAK6H,EACX,CACA,IAAMZ,IAAS,IAAMA,GAAQD,EAAKK,IAAM5F,EAAM4F,IAAKL,EAAKM,IAAM7F,EAAM6F,KAAO,IAAML,EAAOD,EAAKvF,MAAQA,EAAQ,IAAMwF,EAAOD,EAAKK,IAAM5F,EAAQ,IAAMwF,IAASD,EAAKM,IAAM7F,GAAQ0F,EAAY,IAAMF,GAAQc,EAAI/H,MAAK,SAAUoI,EAAUjD,GACpO,OAAO1D,EAAM4F,IAAIzG,KAAKwH,EAAUjD,EAClC,IAAI4C,EAAI/H,MAAK,SAAUoI,EAAUjD,GAC/B,OAAO1D,EAAM6F,IAAI1G,KAAKwH,EAAUjD,EAClC,KAAM,IAAM8B,EAAOc,EAAI/H,KAAKyB,GAASsG,EAAI/H,MAAK,SAAUoI,EAAUjD,GAChE,OAAO1D,EAAMb,KAAKwH,EAAUjD,EAC9B,IAAKjF,OAAOI,eAAe0H,EAAM1G,EAAM0F,GACzC,CACA,SAAS0B,EAAgBC,EAAOC,GAC9B,IAAK,IAAIC,EAAmBC,EAAoBf,EAAM,GAAIgB,EAAyB,IAAIC,IAAOC,EAA0B,IAAID,IAAO3J,EAAI,EAAGA,EAAIuJ,EAASzJ,OAAQE,IAAK,CAClK,IAAI4I,EAAUW,EAASvJ,GACvB,GAAIsB,MAAMF,QAAQwH,GAAU,CAC1B,IAAID,EACFzB,EACAU,EAAOgB,EAAQ,GACf3G,EAAO2G,EAAQ,GACfd,EAAYc,EAAQ9I,OAAS,EAC7B+H,EAAWD,GAAQ,EACrB,GAAIC,GAAYc,EAAOW,EAAO,IAAO1B,GAAQ,KAAOV,EAAeuC,EAAqBA,GAAsB,MAAQd,EAAOW,EAAMxI,UAAW,IAAM8G,IAASV,EAAesC,EAAoBA,GAAqB,KAAM,IAAM5B,IAASE,EAAW,CACnP,IAAI+B,EAAoBhC,EAAW+B,EAA0BF,EAC3DI,EAAeD,EAAkB7B,IAAI/F,IAAS,EAChD,IAAI,IAAO6H,GAAgB,IAAMA,GAAgB,IAAMlC,GAAQ,IAAMkC,GAAgB,IAAMlC,EAAM,MAAM,IAAIL,MAAM,wMAA0MtF,IAC1T6H,GAAgBlC,EAAO,EAAIiC,EAAkB5B,IAAIhG,EAAM2F,GAAQiC,EAAkB5B,IAAIhG,GAAM,EAC9F,CACAwG,EAAeC,EAAKC,EAAMC,EAAS3G,EAAM2F,EAAMC,EAAUC,EAAWZ,EACtE,CACF,CACA,OAAO6C,EAAiBrB,EAAKc,GAAoBO,EAAiBrB,EAAKe,GAAqBf,CAC9F,CACA,SAASqB,EAAiBrB,EAAKxB,GAC7BA,GAAgBwB,EAAI/H,MAAK,SAAUoI,GACjC,IAAK,IAAI/I,EAAI,EAAGA,EAAIkH,EAAapH,OAAQE,IAAKkH,EAAalH,GAAGuB,KAAKwH,GACnE,OAAOA,CACT,GACF,CACA,OAAO,SAAUjC,EAAaC,EAAYC,GACxC,MAAO,CACLgD,EAAGX,EAAgBvC,EAAaC,GAC5BkD,QACF,OAAO,SAAUnD,EAAaE,GAC5B,GAAIA,EAAUlH,OAAS,EAAG,CACxB,IAAK,IAAIoH,EAAe,GAAIgD,EAAWpD,EAAa7E,EAAO6E,EAAY7E,KAAMjC,EAAIgH,EAAUlH,OAAS,EAAGE,GAAK,EAAGA,IAAK,CAClH,IAAImH,EAAuB,CACzBG,GAAG,GAEL,IACE,IAAI6C,EAAenD,EAAUhH,GAAGkK,EAAU,CACxCtC,KAAM,QACN3F,KAAMA,EACNkG,eAAgBlB,EAA2BC,EAAcC,IAE7D,CAAE,QACAA,EAAqBG,GAAI,CAC3B,MACA,IAAW6C,IAAiB5B,EAAuB,GAAI4B,GAAeD,EAAWC,EACnF,CACA,MAAO,CAACD,EAAU,WAChB,IAAK,IAAIlK,EAAI,EAAGA,EAAIkH,EAAapH,OAAQE,IAAKkH,EAAalH,GAAGuB,KAAK2I,EACrE,EACF,CACF,CArBO,CAqBLpD,EAAaE,EACjB,EAEJ,CACF,CAE2BoD,IAAyBtD,EAAaC,EAAYC,EAC7E,+BC7LA,SAASqD,EAAmBC,EAAKC,EAASC,EAAQC,EAAOC,EAAQhJ,EAAKiJ,GACpE,IACE,IAAIC,EAAON,EAAI5I,GAAKiJ,GAChBvI,EAAQwI,EAAKxI,KACnB,CAAE,MAAOyI,GAEP,YADAL,EAAOK,EAET,CACID,EAAKE,KACPP,EAAQnI,GAER2I,QAAQR,QAAQnI,GAAO4I,KAAKP,EAAOC,EAEvC,CACe,SAASO,EAAkB5C,GACxC,OAAO,WACL,IAAI5E,EAAOjE,KACTsG,EAAOjD,UACT,OAAO,IAAIkI,SAAQ,SAAUR,EAASC,GACpC,IAAIF,EAAMjC,EAAGrC,MAAMvC,EAAMqC,GACzB,SAAS2E,EAAMrI,GACbiI,EAAmBC,EAAKC,EAASC,EAAQC,EAAOC,EAAQ,OAAQtI,EAClE,CACA,SAASsI,EAAOQ,GACdb,EAAmBC,EAAKC,EAASC,EAAQC,EAAOC,EAAQ,QAASQ,EACnE,CACAT,OAAMnK,EACR,GACF,CACF,+CC7Be,SAAS6K,EAA2B1J,EAAK2J,GACtD,GAAIA,EAAkBC,IAAI5J,GACxB,MAAM,IAAIkE,UAAU,iEAExB,8CCJe,SAAS2F,EAA6BC,EAAUC,EAAYC,GACzE,IAAKD,EAAWH,IAAIE,GAClB,MAAM,IAAI5F,UAAU,gBAAkB8F,EAAS,kCAEjD,OAAOD,EAAWxD,IAAIuD,EACxB,4ECHe,SAASG,EAAsBH,EAAUC,GAEtD,OCJa,SAAkCD,EAAUI,GACzD,OAAIA,EAAW3D,IACN2D,EAAW3D,IAAIzG,KAAKgK,GAEtBI,EAAWvJ,KACpB,CDDS,CAAwBmJ,GADd,EAAAK,EAAA,GAA4BL,EAAUC,EAAY,OAErE,8DEJe,SAASK,EAA2BpK,EAAK+J,EAAYpJ,IAClE,OAA0BX,EAAK+J,GAC/BA,EAAWvD,IAAIxG,EAAKW,EACtB,4DCFe,SAAS0J,EAAsBP,EAAUC,EAAYpJ,GAGlE,OCLa,SAAkCmJ,EAAUI,EAAYvJ,GACrE,GAAIuJ,EAAW1D,IACb0D,EAAW1D,IAAI1G,KAAKgK,EAAUnJ,OACzB,CACL,IAAKuJ,EAAWrJ,SACd,MAAM,IAAIqD,UAAU,4CAEtBgG,EAAWvJ,MAAQA,CACrB,CACF,CDLE,CAAwBmJ,GADP,EAAAK,EAAA,GAA4BL,EAAUC,EAAY,OACrBpJ,GACvCA,CACT,8DELe,SAAS2J,EAAgBtK,EAAKC,EAAKU,GAYhD,OAXAV,ECAa,SAAwBiJ,GACrC,IAAIjJ,ECFS,SAAsBsK,EAAO1D,GAC1C,GAAuB,YAAnB,OAAQ0D,IAAiC,OAAVA,EAAgB,OAAOA,EAC1D,IAAIC,EAAOD,EAAME,OAAOC,aACxB,QAAa7L,IAAT2L,EAAoB,CACtB,IAAIG,EAAMH,EAAK1K,KAAKyK,EAAO1D,UAC3B,GAAqB,YAAjB,OAAQ8D,GAAmB,OAAOA,EACtC,MAAM,IAAIzG,UAAU,+CACtB,CACA,OAA4B0G,OAAiBL,EAC/C,CDPY,CAAYrB,GACtB,MAAwB,YAAjB,OAAQjJ,GAAoBA,EAAM2K,OAAO3K,EAClD,CDHQ,CAAcA,MACTD,EACTZ,OAAOI,eAAeQ,EAAKC,EAAK,CAC9BU,MAAOA,EACPF,YAAY,EACZC,cAAc,EACdG,UAAU,IAGZb,EAAIC,GAAOU,EAENX,CACT,8DGbA,SAAS6K,EAAQC,EAAQC,GACvB,IAAIC,EAAO5L,OAAO4L,KAAKF,GACvB,GAAI1L,OAAO6L,sBAAuB,CAChC,IAAIC,EAAU9L,OAAO6L,sBAAsBH,GAC3CC,IAAmBG,EAAUA,EAAQC,QAAO,SAAUC,GACpD,OAAOhM,OAAOM,yBAAyBoL,EAAQM,GAAK3K,UACtD,KAAKuK,EAAK9L,KAAKqF,MAAMyG,EAAME,EAC7B,CACA,OAAOF,CACT,CACe,SAASK,EAAe/K,GACrC,IAAK,IAAI/B,EAAI,EAAGA,EAAI6C,UAAU/C,OAAQE,IAAK,CACzC,IAAI+M,EAAS,MAAQlK,UAAU7C,GAAK6C,UAAU7C,GAAK,CAAC,EACpDA,EAAI,EAAIsM,EAAQzL,OAAOkM,IAAS,GAAIC,SAAQ,SAAUtL,IACpD,OAAeK,EAAQL,EAAKqL,EAAOrL,GACrC,IAAKb,OAAOoM,0BAA4BpM,OAAOqM,iBAAiBnL,EAAQlB,OAAOoM,0BAA0BF,IAAWT,EAAQzL,OAAOkM,IAASC,SAAQ,SAAUtL,GAC5Jb,OAAOI,eAAec,EAAQL,EAAKb,OAAOM,yBAAyB4L,EAAQrL,GAC7E,GACF,CACA,OAAOK,CACT,+BCrBe,SAASoL,EAAQ1L,GAG9B,OAAO0L,EAAU,mBAAqBjB,QAAU,iBAAmBA,OAAOkB,SAAW,SAAU3L,GAC7F,cAAcA,CAChB,EAAI,SAAUA,GACZ,OAAOA,GAAO,mBAAqByK,QAAUzK,EAAII,cAAgBqK,QAAUzK,IAAQyK,OAAOpL,UAAY,gBAAkBW,CAC1H,EAAG0L,EAAQ1L,EACb,6bCIA,MAAM4L,EAAe,CAAC,EAef,SAAS,EAASjL,EAAOJ,GAC9B,MAAMsL,EAAWtL,GAAWqL,EAQ5B,OAAOE,EAAInL,EAN2B,kBAA7BkL,EAASE,iBACZF,EAASE,gBAGmB,kBAAzBF,EAASG,aAA4BH,EAASG,YAGzD,CAcA,SAASF,EAAInL,EAAOoL,EAAiBC,GACnC,GAqDF,SAAcrL,GACZ,OAAOsL,QAAQtL,GAA0B,iBAAVA,EACjC,CAvDMuL,CAAKvL,GAAQ,CACf,GAAI,UAAWA,EACb,MAAsB,SAAfA,EAAMiC,MAAoBoJ,EAAmBrL,EAAMA,MAAX,GAGjD,GAAIoL,GAAmB,QAASpL,GAASA,EAAMwL,IAC7C,OAAOxL,EAAMwL,IAGf,GAAI,aAAcxL,EAChB,OAAO,EAAIA,EAAMyL,SAAUL,EAAiBC,EAEhD,CAEA,OAAInM,MAAMF,QAAQgB,GACT,EAAIA,EAAOoL,EAAiBC,GAG9B,EACT,CAcA,SAAS,EAAIK,EAAQN,EAAiBC,GAEpC,MAAMrI,EAAS,GACf,IAAI2I,GAAS,EAEb,OAASA,EAAQD,EAAOhO,QACtBsF,EAAO2I,GAASR,EAAIO,EAAOC,GAAQP,EAAiBC,GAGtD,OAAOrI,EAAOrF,KAAK,GACrB,CC/EO,SAASiO,EAAO1O,EAAM2O,EAAOC,EAAQC,GAC1C,MAAMC,EAAM9O,EAAKQ,OACjB,IAGIuO,EAHAC,EAAa,EAajB,GAPEL,EADEA,EAAQ,GACDA,EAAQG,EAAM,EAAIA,EAAMH,EAEzBA,EAAQG,EAAMA,EAAMH,EAG9BC,EAASA,EAAS,EAAIA,EAAS,EAE3BC,EAAMrO,OAAS,IACjBuO,EAAa/M,MAAMiN,KAAKJ,GACxBE,EAAWG,QAAQP,EAAOC,GACzB,GAAGF,OAAOhI,MAAM1G,EAAM+O,QAKvB,IAFIH,GAAQ,GAAGF,OAAOhI,MAAM1G,EAAM,CAAC2O,EAAOC,IAEnCI,EAAaH,EAAMrO,QACxBuO,EAAaF,EAAMrJ,MAAMwJ,EAAYA,EAAa,KAClDD,EAAWG,QAAQP,EAAO,GACzB,GAAGD,OAAOhI,MAAM1G,EAAM+O,GACvBC,GAAc,IACdL,GAAS,GAGf,CAcO,SAAStN,EAAKrB,EAAM6O,GACzB,OAAI7O,EAAKQ,OAAS,GAChBkO,EAAO1O,EAAMA,EAAKQ,OAAQ,EAAGqO,GACtB7O,GAGF6O,CACT,CC3DA,MAAM,EAAiB,CAAC,EAAEpN,eA2B1B,SAAS0N,EAAgBC,EAAKC,GAE5B,IAAIC,EAEJ,IAAKA,KAAQD,EAAW,CACtB,MACME,GADQ,EAAetN,KAAKmN,EAAKE,GAAQF,EAAIE,QAAQtO,KACpCoO,EAAIE,GAAQ,CAAC,GAC9BE,EAAQH,EAAUC,GAExB,IAAIG,EAEJ,IAAKA,KAAQD,EAAO,CACb,EAAevN,KAAKsN,EAAME,KAAOF,EAAKE,GAAQ,IACnD,MAAM3M,EAAQ0M,EAAMC,GACpBC,EAEEH,EAAKE,GACLzN,MAAMF,QAAQgB,GAASA,EAAQA,EAAQ,CAACA,GAAS,GAErD,CACF,CACF,CAUA,SAAS4M,EAAWC,EAAU3P,GAC5B,IAAIyO,GAAS,EAEb,MAAMmB,EAAS,GAEf,OAASnB,EAAQzO,EAAKQ,SAEE,UAApBR,EAAKyO,GAAOoB,IAAkBF,EAAWC,GAAQvO,KAAKrB,EAAKyO,IAG/DC,EAAOiB,EAAU,EAAG,EAAGC,EACzB,CCxEO,MCWME,EAAaC,EAAW,YAQxBC,EAAaD,EAAW,MAexBE,EAAgBF,EAAW,cAS3BG,EAAoBH,EAAW,cAU/BI,EAAmBJ,EAAW,kBAkB9BK,EAAaL,EAAW,uBAW9B,SAASM,EAAaZ,GAC3B,OAGW,OAATA,IAAkBA,EAAO,IAAe,MAATA,EAEnC,CASO,SAASa,EAA0Bb,GACxC,OAAgB,OAATA,IAAkBA,EAAO,GAAc,KAATA,EACvC,CAeO,SAASc,EAAmBd,GACjC,OAAgB,OAATA,GAAiBA,GAAQ,CAClC,CAeO,SAASe,EAAcf,GAC5B,OAAiB,IAAVA,IAAyB,IAAVA,GAAwB,KAATA,CACvC,CAiBO,MAAMgB,EAAoBV,EAAW,MAkB/BW,EAAqBX,EDvKhC,+vCC+KF,SAASA,EAAWY,GAClB,OAQA,SAAelB,GACb,OAAgB,OAATA,GAAiBkB,EAAMpL,KAAKwH,OAAO6D,aAAanB,GACzD,CACF,CCrLO,SAASoB,EAAaC,EAASC,EAAIhM,EAAMN,GAC9C,MAAMuM,EAAQvM,EAAMA,EAAM,EAAIwM,OAAOC,kBACrC,IAAIC,EAAO,EACX,OAGA,SAAe1B,GACb,OAAIe,EAAcf,IAChBqB,EAAQM,MAAMrM,GACPsM,EAAO5B,IAGTsB,EAAGtB,EACZ,EAGA,SAAS4B,EAAO5B,GACd,OAAIe,EAAcf,IAAS0B,IAASH,GAClCF,EAAQQ,QAAQ7B,GACT4B,IAGTP,EAAQS,KAAKxM,GACNgM,EAAGtB,GACZ,CACF,CC5BO,MAAMpP,EAAU,CACrBmR,SAIF,SAA2BV,GACzB,MAAMW,EAAeX,EAAQY,QAC3BxR,KAAKyR,OAAOjC,WAAWkC,gBAUzB,SAAoCnC,GAClC,GAAa,OAATA,EAQJ,OAHAqB,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACNV,EAAaC,EAASW,EAAc,cAPzCX,EAAQQ,QAAQ7B,EAQpB,IAGA,SAA0BA,GAExB,OADAqB,EAAQM,MAAM,aACPS,EAAUpC,EACnB,IApBA,IAAIqC,EACJ,OAAOL,EAsBP,SAASI,EAAUpC,GACjB,MAAMsC,EAAQjB,EAAQM,MAAM,YAAa,CACvCY,YAAa,OACbF,aAQF,OALIA,IACFA,EAASG,KAAOF,GAGlBD,EAAWC,EACJG,EAAKzC,EACd,CAGA,SAASyC,EAAKzC,GACZ,OAAa,OAATA,GACFqB,EAAQS,KAAK,aACbT,EAAQS,KAAK,kBACbT,EAAQQ,QAAQ7B,IAIdc,EAAmBd,IACrBqB,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,aACNM,IAGTf,EAAQQ,QAAQ7B,GACTyC,EACT,CACF,GC1Da,EAAW,CACtBV,SASF,SAA4BV,GAC1B,MAAM3M,EAAOjE,KAGPiS,EAAQ,GACd,IAGIC,EAGAC,EAGAC,EATAC,EAAY,EAUhB,OAAO5D,EAGP,SAASA,EAAMc,GAWb,GAAI8C,EAAYJ,EAAM3R,OAAQ,CAC5B,MAAMJ,EAAO+R,EAAMI,GAEnB,OADApO,EAAKqO,eAAiBpS,EAAK,GACpB0Q,EAAQY,QACbtR,EAAK,GAAGqS,aACRC,EACAC,EAHK7B,CAILrB,EACJ,CAEA,OAAOkD,EAAmBlD,EAC5B,CAGA,SAASiD,EAAiBjD,GAKxB,GAJA8C,IAIIpO,EAAKqO,eAAeI,WAAY,CAClCzO,EAAKqO,eAAeI,gBAAa5R,EAE7BoR,GACFS,IAIF,MAAMC,EAAmB3O,EAAK4O,OAAOvS,OACrC,IAGIwS,EAHAC,EAAkBH,EAKtB,KAAOG,KACL,GACsC,SAApC9O,EAAK4O,OAAOE,GAAiB,IACY,cAAzC9O,EAAK4O,OAAOE,GAAiB,GAAGlO,KAChC,CACAiO,EAAQ7O,EAAK4O,OAAOE,GAAiB,GAAGnE,IACxC,KACF,CAGFoE,EAAeX,GAEf,IAAI9D,EAAQqE,EAEZ,KAAOrE,EAAQtK,EAAK4O,OAAOvS,QACzB2D,EAAK4O,OAAOtE,GAAO,GAAGK,IAAMvN,OAAO4R,OAAO,CAAC,EAAGH,GAC9CvE,IAWF,OARAC,EACEvK,EAAK4O,OACLE,EAAkB,EAClB,EACA9O,EAAK4O,OAAOvN,MAAMsN,IAGpB3O,EAAK4O,OAAOvS,OAASiO,EACdkE,EAAmBlD,EAC5B,CAEA,OAAOd,EAAMc,EACf,CAGA,SAASkD,EAAmBlD,GAM1B,GAAI8C,IAAcJ,EAAM3R,OAAQ,CAI9B,IAAK4R,EACH,OAAOgB,EAAkB3D,GAK3B,GAAI2C,EAAUiB,kBAAoBjB,EAAUiB,iBAAiBC,SAC3D,OAAOC,EAAU9D,GAKnBtL,EAAKqP,UAAYpF,QACfgE,EAAUiB,mBAAqBjB,EAAUqB,8BAE7C,CAGA,OADAtP,EAAKqO,eAAiB,CAAC,EAChB1B,EAAQ4C,MACbC,EACAC,EACAC,EAHK/C,CAILrB,EACJ,CAGA,SAASmE,EAAqBnE,GAG5B,OAFI2C,GAAWS,IACfK,EAAeX,GACRa,EAAkB3D,EAC3B,CAGA,SAASoE,EAAsBpE,GAG7B,OAFAtL,EAAKwN,OAAOmC,KAAK3P,EAAKS,MAAMmP,MAAQxB,IAAcJ,EAAM3R,OACxD8R,EAAkBnO,EAAKS,MAAMoP,OACtBT,EAAU9D,EACnB,CAGA,SAAS2D,EAAkB3D,GAGzB,OADAtL,EAAKqO,eAAiB,CAAC,EAChB1B,EAAQY,QACbiC,EACAM,EACAV,EAHKzC,CAILrB,EACJ,CAGA,SAASwE,EAAkBxE,GAIzB,OAHA8C,IACAJ,EAAM9Q,KAAK,CAAC8C,EAAKkP,iBAAkBlP,EAAKqO,iBAEjCY,EAAkB3D,EAC3B,CAGA,SAAS8D,EAAU9D,GACjB,OAAa,OAATA,GACE2C,GAAWS,IACfK,EAAe,QACfpC,EAAQQ,QAAQ7B,KAIlB2C,EAAYA,GAAajO,EAAKwN,OAAOuC,KAAK/P,EAAKS,OAC/CkM,EAAQM,MAAM,YAAa,CACzBY,YAAa,OACbF,SAAUO,EACV8B,WAAY/B,IAEPgC,EAAa3E,GACtB,CAGA,SAAS2E,EAAa3E,GACpB,OAAa,OAATA,GACF4E,EAAavD,EAAQS,KAAK,cAAc,GACxC2B,EAAe,QACfpC,EAAQQ,QAAQ7B,IAIdc,EAAmBd,IACrBqB,EAAQQ,QAAQ7B,GAChB4E,EAAavD,EAAQS,KAAK,cAE1BgB,EAAY,EACZpO,EAAKqP,eAAYxS,EACV2N,IAGTmC,EAAQQ,QAAQ7B,GACT2E,EACT,CAOA,SAASC,EAAatC,EAAOuC,GAC3B,MAAMC,EAASpQ,EAAKqQ,YAAYzC,GAwChC,GAvCIuC,GAAKC,EAAOlT,KAAK,MACrB0Q,EAAMD,SAAWO,EACbA,IAAYA,EAAWJ,KAAOF,GAClCM,EAAaN,EACbK,EAAUqC,WAAW1C,EAAMpD,OAC3ByD,EAAUsC,MAAMH,GAkCZpQ,EAAKwN,OAAOmC,KAAK/B,EAAMpD,MAAMoF,MAAO,CACtC,IAAItF,EAAQ2D,EAAUW,OAAOvS,OAE7B,KAAOiO,KACL,GAEE2D,EAAUW,OAAOtE,GAAO,GAAGE,MAAMqF,OAAS1B,KACxCF,EAAUW,OAAOtE,GAAO,GAAGK,KAC3BsD,EAAUW,OAAOtE,GAAO,GAAGK,IAAIkF,OAAS1B,GAI1C,OAKJ,MAAMQ,EAAmB3O,EAAK4O,OAAOvS,OACrC,IAGImU,EAGA3B,EANAC,EAAkBH,EAQtB,KAAOG,KACL,GACsC,SAApC9O,EAAK4O,OAAOE,GAAiB,IACY,cAAzC9O,EAAK4O,OAAOE,GAAiB,GAAGlO,KAChC,CACA,GAAI4P,EAAM,CACR3B,EAAQ7O,EAAK4O,OAAOE,GAAiB,GAAGnE,IACxC,KACF,CAEA6F,GAAO,CACT,CAOF,IAJAzB,EAAeX,GAEf9D,EAAQqE,EAEDrE,EAAQtK,EAAK4O,OAAOvS,QACzB2D,EAAK4O,OAAOtE,GAAO,GAAGK,IAAMvN,OAAO4R,OAAO,CAAC,EAAGH,GAC9CvE,IAGFC,EACEvK,EAAK4O,OACLE,EAAkB,EAClB,EACA9O,EAAK4O,OAAOvN,MAAMsN,IAGpB3O,EAAK4O,OAAOvS,OAASiO,CACvB,CACF,CAMA,SAASyE,EAAe/B,GACtB,IAAI1C,EAAQ0D,EAAM3R,OAElB,KAAOiO,KAAU0C,GAAM,CACrB,MAAMyD,EAAQzC,EAAM1D,GACpBtK,EAAKqO,eAAiBoC,EAAM,GAC5BA,EAAM,GAAGrD,KAAKtP,KAAKkC,EAAM2M,EAC3B,CAEAqB,EAAM3R,OAAS2Q,CACjB,CAEA,SAAS0B,IACPT,EAAUsC,MAAM,CAAC,OACjBrC,OAAarR,EACboR,OAAYpR,EACZmD,EAAKqO,eAAeI,gBAAa5R,CACnC,CACF,GAjVM2S,EAAqB,CACzBnC,SAmVF,SAA2BV,EAASC,EAAI8D,GACtC,OAAOhE,EACLC,EACAA,EAAQY,QAAQxR,KAAKyR,OAAOjC,WAAWoF,SAAU/D,EAAI8D,GACrD,aACA3U,KAAKyR,OAAOjC,WAAWqF,QAAQC,KAAKC,SAAS,qBAAkBjU,EAAY,EAE/E,GC3WakU,EAAY,CACvB1D,SAKF,SAA2BV,EAASC,EAAI8D,GACtC,OAAOhE,EAAaC,GAGpB,SAAyBrB,GACvB,OAAgB,OAATA,GAAiBc,EAAmBd,GAAQsB,EAAGtB,GAAQoF,EAAIpF,EACpE,GAL8C,aAMhD,EAXE0F,SAAS,GCEJ,SAASC,EAAYrC,GAE1B,MAAMsC,EAAQ,CAAC,EACf,IAGIC,EAGAC,EAGAC,EAGAC,EAGA1G,EAGA2G,EAGAC,EArBAlH,GAAS,EAuBb,OAASA,EAAQsE,EAAOvS,QAAQ,CAC9B,KAAOiO,KAAS4G,GACd5G,EAAQ4G,EAAM5G,GAMhB,GAHA6G,EAAQvC,EAAOtE,GAIbA,GACkB,cAAlB6G,EAAM,GAAGvQ,MACqB,mBAA9BgO,EAAOtE,EAAQ,GAAG,GAAG1J,OAErB2Q,EAAYJ,EAAM,GAAGnB,WAAWpB,OAChCyC,EAAa,EAGXA,EAAaE,EAAUlV,QACW,oBAAlCkV,EAAUF,GAAY,GAAGzQ,OAEzByQ,GAAc,GAIdA,EAAaE,EAAUlV,QACW,YAAlCkV,EAAUF,GAAY,GAAGzQ,MAEzB,OAASyQ,EAAaE,EAAUlV,QACQ,YAAlCkV,EAAUF,GAAY,GAAGzQ,MAIS,cAAlC2Q,EAAUF,GAAY,GAAGzQ,OAC3B2Q,EAAUF,GAAY,GAAGI,6BAA8B,EACvDJ,KAMR,GAAiB,UAAbF,EAAM,GACJA,EAAM,GAAGtD,cACXzQ,OAAO4R,OAAOkC,EAAOQ,EAAW9C,EAAQtE,IACxCA,EAAQ4G,EAAM5G,GACdkH,GAAO,QAGN,GAAIL,EAAM,GAAGQ,WAAY,CAI5B,IAHAN,EAAa/G,EACb8G,OAAYvU,EAELwU,MACLC,EAAa1C,EAAOyC,GAGK,eAAvBC,EAAW,GAAG1Q,MACS,oBAAvB0Q,EAAW,GAAG1Q,OAEQ,UAAlB0Q,EAAW,KACTF,IACFxC,EAAOwC,GAAW,GAAGxQ,KAAO,mBAG9B0Q,EAAW,GAAG1Q,KAAO,aACrBwQ,EAAYC,GAOdD,IAEFD,EAAM,GAAGxG,IAAMvN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOwC,GAAW,GAAG5G,OAEtDI,EAAagE,EAAOvN,MAAM+P,EAAW9G,GACrCM,EAAWG,QAAQoG,GACnB5G,EAAOqE,EAAQwC,EAAW9G,EAAQ8G,EAAY,EAAGxG,GAErD,CACF,CAEA,OAAQ4G,CACV,CASA,SAASE,EAAW9C,EAAQgD,GAC1B,MAAMhE,EAAQgB,EAAOgD,GAAY,GAC3BC,EAAUjD,EAAOgD,GAAY,GACnC,IAAIE,EAAgBF,EAAa,EAGjC,MAAMG,EAAiB,GACjBC,EACJpE,EAAMoC,YAAc6B,EAAQrE,OAAOI,EAAMC,aAAaD,EAAMpD,OACxDyH,EAAcD,EAAUpD,OAGxBsC,EAAQ,GAGRgB,EAAO,CAAC,EAGd,IAAI9B,EAGAzC,EACArD,GAAS,EAGT6H,EAAUvE,EACVwE,EAAS,EACT5H,EAAQ,EACZ,MAAM6H,EAAS,CAAC7H,GAGhB,KAAO2H,GAAS,CAEd,KAAOvD,IAASkD,GAAe,KAAOK,IAItCJ,EAAe7U,KAAK4U,GAEfK,EAAQnC,aACXI,EAASyB,EAAQxB,YAAY8B,GAExBA,EAAQrE,MACXsC,EAAOlT,KAAK,MAGVyQ,GACFqE,EAAU1B,WAAW6B,EAAQ3H,OAG3B2H,EAAQV,8BACVO,EAAUM,oCAAqC,GAGjDN,EAAUzB,MAAMH,GAEZ+B,EAAQV,8BACVO,EAAUM,wCAAqCzV,IAInD8Q,EAAWwE,EACXA,EAAUA,EAAQrE,IACpB,CAKA,IAFAqE,EAAUvE,IAEDtD,EAAQ2H,EAAY5V,QAGC,SAA1B4V,EAAY3H,GAAO,IACW,UAA9B2H,EAAY3H,EAAQ,GAAG,IACvB2H,EAAY3H,GAAO,GAAG1J,OAASqR,EAAY3H,EAAQ,GAAG,GAAG1J,MACzDqR,EAAY3H,GAAO,GAAGE,MAAMoF,OAASqC,EAAY3H,GAAO,GAAGK,IAAIiF,OAE/DpF,EAAQF,EAAQ,EAChB+H,EAAOnV,KAAKsN,GAEZ2H,EAAQnC,gBAAanT,EACrBsV,EAAQxE,cAAW9Q,EACnBsV,EAAUA,EAAQrE,MAmBtB,IAfAkE,EAAUpD,OAAS,GAIfuD,GAEFA,EAAQnC,gBAAanT,EACrBsV,EAAQxE,cAAW9Q,GAEnBwV,EAAOE,MAITjI,EAAQ+H,EAAOhW,OAERiO,KAAS,CACd,MAAMjJ,EAAQ4Q,EAAY5Q,MAAMgR,EAAO/H,GAAQ+H,EAAO/H,EAAQ,IACxDE,EAAQuH,EAAeQ,MAC7BrB,EAAMnG,QAAQ,CAACP,EAAOA,EAAQnJ,EAAMhF,OAAS,IAC7CkO,EAAOqE,EAAQpE,EAAO,EAAGnJ,EAC3B,CAIA,IAFAiJ,GAAS,IAEAA,EAAQ4G,EAAM7U,QACrB6V,EAAKE,EAASlB,EAAM5G,GAAO,IAAM8H,EAASlB,EAAM5G,GAAO,GACvD8H,GAAUlB,EAAM5G,GAAO,GAAK4G,EAAM5G,GAAO,GAAK,EAGhD,OAAO4H,CACT,CCvOO,MAAM,EAAU,CACrB7E,SAsBF,SAAyBV,EAASC,GAEhC,IAAIe,EACJ,OAGA,SAAerC,GAKb,OAJAqB,EAAQM,MAAM,WACdU,EAAWhB,EAAQM,MAAM,eAAgB,CACvCY,YAAa,YAERE,EAAKzC,EACd,EAGA,SAASyC,EAAKzC,GACZ,OAAa,OAATA,EACKkH,EAAWlH,GAGhBc,EAAmBd,GACdqB,EAAQ4C,MACbkD,EACAC,EACAF,EAHK7F,CAILrB,IAGJqB,EAAQQ,QAAQ7B,GACTyC,EACT,CAGA,SAASyE,EAAWlH,GAGlB,OAFAqB,EAAQS,KAAK,gBACbT,EAAQS,KAAK,WACNR,EAAGtB,EACZ,CAGA,SAASoH,EAAgBpH,GAQvB,OAPAqB,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,gBACbO,EAASG,KAAOnB,EAAQM,MAAM,eAAgB,CAC5CY,YAAa,UACbF,aAEFA,EAAWA,EAASG,KACbC,CACT,CACF,EAvEEjH,QAeF,SAAwB8H,GAEtB,OADAqC,EAAYrC,GACLA,CACT,GAdM6D,EAAwB,CAC5BpF,SAqEF,SAA8BV,EAASC,EAAI8D,GACzC,MAAM1Q,EAAOjE,KACb,OAGA,SAAwBuP,GAKtB,OAJAqB,EAAQS,KAAK,gBACbT,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACNV,EAAaC,EAASgG,EAAU,aACzC,EAGA,SAASA,EAASrH,GAChB,GAAa,OAATA,GAAiBc,EAAmBd,GACtC,OAAOoF,EAAIpF,GAGb,MAAMsH,EAAO5S,EAAK4O,OAAO5O,EAAK4O,OAAOvS,OAAS,GAE9C,OACG2D,EAAKwN,OAAOjC,WAAWqF,QAAQC,KAAKC,SAAS,iBAC9C8B,GACiB,eAAjBA,EAAK,GAAGhS,MACRgS,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMvW,QAAU,EAEzCuQ,EAAGtB,GAGLqB,EAAQ0C,UAAUrP,EAAKwN,OAAOjC,WAAWwE,KAAMW,EAAK9D,EAApDD,CAAwDrB,EACjE,CACF,EApGE0F,SAAS,GCbEjB,EAAO,CAClB1C,SAIF,SAAwBV,GACtB,MAAM3M,EAAOjE,KACP+W,EAAUnG,EAAQY,QAEtBwD,GAmBF,SAAuBzF,GACrB,GAAa,OAATA,EASJ,OAJAqB,EAAQM,MAAM,mBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,mBACbpN,EAAKkP,sBAAmBrS,EACjBiW,EARLnG,EAAQQ,QAAQ7B,EASpB,GA5BEqB,EAAQY,QACNxR,KAAKyR,OAAOjC,WAAWwH,YACvBC,EACAtG,EACEC,EACAA,EAAQY,QACNxR,KAAKyR,OAAOjC,WAAWwE,KACvBiD,EACArG,EAAQY,QAAQ,EAASyF,IAE3B,gBAIN,OAAOF,EAiBP,SAASE,EAAe1H,GACtB,GAAa,OAATA,EASJ,OAJAqB,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACbpN,EAAKkP,sBAAmBrS,EACjBiW,EARLnG,EAAQQ,QAAQ7B,EASpB,CACF,GCxDa2H,EAAW,CACtBC,WAAYC,KAEDC,EAASC,EAAkB,UAC3B,EAAOA,EAAkB,QAMtC,SAASA,EAAkBC,GACzB,MAAO,CACLjG,SAOF,SAAwBV,GACtB,MAAM3M,EAAOjE,KACPwP,EAAaxP,KAAKyR,OAAOjC,WAAW+H,GACpCC,EAAO5G,EAAQY,QAAQhC,EAAYf,EAAOgJ,GAChD,OAAOhJ,EAGP,SAASA,EAAMc,GACb,OAAOmI,EAAQnI,GAAQiI,EAAKjI,GAAQkI,EAAQlI,EAC9C,CAGA,SAASkI,EAAQlI,GACf,GAAa,OAATA,EAOJ,OAFAqB,EAAQM,MAAM,QACdN,EAAQQ,QAAQ7B,GACTyC,EANLpB,EAAQQ,QAAQ7B,EAOpB,CAGA,SAASyC,EAAKzC,GACZ,OAAImI,EAAQnI,IACVqB,EAAQS,KAAK,QACNmG,EAAKjI,KAGdqB,EAAQQ,QAAQ7B,GACTyC,EACT,CAMA,SAAS0F,EAAQnI,GACf,GAAa,OAATA,EACF,OAAO,EAGT,MAAMzP,EAAO0P,EAAWD,GACxB,IAAIhB,GAAS,EAEb,GAAIzO,EACF,OAASyO,EAAQzO,EAAKQ,QAAQ,CAC5B,MAAMJ,EAAOJ,EAAKyO,GAElB,IAAKrO,EAAK0R,UAAY1R,EAAK0R,SAAS7P,KAAKkC,EAAMA,EAAK2N,UAClD,OAAO,CAEX,CAGF,OAAO,CACT,CACF,EAhEEuF,WAAYC,EACA,SAAVG,EAAmBI,OAAyB7W,GAgElD,CAMA,SAASsW,EAAeQ,GACtB,OAGA,SAAwB/E,EAAQiD,GAC9B,IAGI5E,EAHA3C,GAAS,EAMb,OAASA,GAASsE,EAAOvS,aACTQ,IAAVoQ,EACE2B,EAAOtE,IAAoC,SAA1BsE,EAAOtE,GAAO,GAAG1J,OACpCqM,EAAQ3C,EACRA,KAEQsE,EAAOtE,IAAoC,SAA1BsE,EAAOtE,GAAO,GAAG1J,OAExC0J,IAAU2C,EAAQ,IACpB2B,EAAO3B,GAAO,GAAGtC,IAAMiE,EAAOtE,EAAQ,GAAG,GAAGK,IAC5CiE,EAAOrE,OAAO0C,EAAQ,EAAG3C,EAAQ2C,EAAQ,GACzC3C,EAAQ2C,EAAQ,GAGlBA,OAAQpQ,GAIZ,OAAO8W,EAAgBA,EAAc/E,EAAQiD,GAAWjD,CAC1D,CACF,CAaA,SAAS8E,EAAuB9E,EAAQiD,GACtC,IAAID,EAAa,EAEjB,OAASA,GAAchD,EAAOvS,QAC5B,IACGuV,IAAehD,EAAOvS,QACU,eAA/BuS,EAAOgD,GAAY,GAAGhR,OACW,SAAnCgO,EAAOgD,EAAa,GAAG,GAAGhR,KAC1B,CACA,MAAMmN,EAAOa,EAAOgD,EAAa,GAAG,GAC9BgC,EAAS/B,EAAQxB,YAAYtC,GACnC,IAKI8F,EALAvJ,EAAQsJ,EAAOvX,OACfyX,GAAe,EACf9G,EAAO,EAKX,KAAO1C,KAAS,CACd,MAAMyJ,EAAQH,EAAOtJ,GAErB,GAAqB,iBAAVyJ,EAAoB,CAG7B,IAFAD,EAAcC,EAAM1X,OAEyB,KAAtC0X,EAAMC,WAAWF,EAAc,IACpC9G,IACA8G,IAGF,GAAIA,EAAa,MACjBA,GAAe,CACjB,MACK,IAAe,IAAXC,EACPF,GAAO,EACP7G,SACK,IAAe,IAAX+G,EAEJ,CAELzJ,IACA,KACF,CACF,CAEA,GAAI0C,EAAM,CACR,MAAMY,EAAQ,CACZhN,KACEgR,IAAehD,EAAOvS,QAAUwX,GAAQ7G,EAAO,EAC3C,aACA,oBACNxC,MAAO,CACLoF,KAAM7B,EAAKpD,IAAIiF,KACfqE,OAAQlG,EAAKpD,IAAIsJ,OAASjH,EAC1B6C,OAAQ9B,EAAKpD,IAAIkF,OAAS7C,EAC1BkH,OAAQnG,EAAKvD,MAAM0J,OAAS5J,EAC5B6J,aAAc7J,EACVwJ,EACA/F,EAAKvD,MAAM2J,aAAeL,GAEhCnJ,IAAKvN,OAAO4R,OAAO,CAAC,EAAGjB,EAAKpD,MAE9BoD,EAAKpD,IAAMvN,OAAO4R,OAAO,CAAC,EAAGpB,EAAMpD,OAE/BuD,EAAKvD,MAAMqF,SAAW9B,EAAKpD,IAAIkF,OACjCzS,OAAO4R,OAAOjB,EAAMH,IAEpBgB,EAAOrE,OACLqH,EACA,EACA,CAAC,QAAShE,EAAOiE,GACjB,CAAC,OAAQjE,EAAOiE,IAElBD,GAAc,EAElB,CAEAA,GACF,CAGF,OAAOhD,CACT,CC3MO,SAASsE,EAAW3H,EAAYqD,EAAQiD,GAE7C,MAAMuC,EAAS,GACf,IAAI9J,GAAS,EAEb,OAASA,EAAQiB,EAAWlP,QAAQ,CAClC,MAAMyK,EAAUyE,EAAWjB,GAAO4I,WAE9BpM,IAAYsN,EAAOtD,SAAShK,KAC9B8H,EAAS9H,EAAQ8H,EAAQiD,GACzBuC,EAAOlX,KAAK4J,GAEhB,CAEA,OAAO8H,CACT,CCcO,SAASyF,EAAgB7G,EAAQ8G,EAAYxJ,GAElD,IAAI+D,EAAQzR,OAAO4R,OACjBlE,EACI1N,OAAO4R,OAAO,CAAC,EAAGlE,GAClB,CACE8E,KAAM,EACNqE,OAAQ,EACRpE,OAAQ,GAEd,CACEqE,OAAQ,EACRC,cAAe,IAKnB,MAAMI,EAAc,CAAC,EAGfC,EAAuB,GAG7B,IAAIZ,EAAS,GAGT5F,EAAQ,GAGRyG,GAAW,EAOf,MAAM9H,EAAU,CACdQ,QA2IF,SAAiB7B,GACXc,EAAmBd,IACrBuD,EAAMe,OACNf,EAAMoF,OAAS,EACfpF,EAAMgB,SAAoB,IAAVvE,EAAc,EAAI,EAClCoJ,MACmB,IAAVpJ,IACTuD,EAAMoF,SACNpF,EAAMgB,UAGJhB,EAAMsF,aAAe,EACvBtF,EAAMqF,UAENrF,EAAMsF,eAIFtF,EAAMsF,eAAiBP,EAAO/E,EAAMqF,QAAQ7X,SAC9CwS,EAAMsF,cAAgB,EACtBtF,EAAMqF,WAIVrC,EAAQlE,SAAWrC,EAEnBmJ,GAAW,CACb,EArKExH,MAwKF,SAAerM,EAAM+T,GAGnB,MAAM/G,EAAQ+G,GAAU,CAAC,EAKzB,OAJA/G,EAAMhN,KAAOA,EACbgN,EAAMpD,MAAQ/J,IACdoR,EAAQjD,OAAO1R,KAAK,CAAC,QAAS0Q,EAAOiE,IACrC7D,EAAM9Q,KAAK0Q,GACJA,CACT,EAhLER,KAmLF,SAAcxM,GACZ,MAAMgN,EAAQI,EAAMuE,MAGpB,OAFA3E,EAAMjD,IAAMlK,IACZoR,EAAQjD,OAAO1R,KAAK,CAAC,OAAQ0Q,EAAOiE,IAC7BjE,CACT,EAvLEL,QAASqH,GA8LX,SAA+BC,EAAW1N,GACxC2N,EAAUD,EAAW1N,EAAK2D,KAC5B,IA/LEyE,MAAOqF,EAAiBG,GACxB1F,UAAWuF,EAAiBG,EAAmB,CAC7C1F,WAAW,KASTwC,EAAU,CACdlE,SAAU,KACVrC,KAAM,KACN+C,eAAgB,CAAC,EACjBO,OAAQ,GACRpB,SACA6C,cACAwC,eA6CF,SAAwBjF,EAAOoH,GAC7B,OAsYJ,SAAyBpB,EAAQoB,GAC/B,IAAI1K,GAAS,EAGb,MAAM3I,EAAS,GAGf,IAAIsT,EAEJ,OAAS3K,EAAQsJ,EAAOvX,QAAQ,CAC9B,MAAM0X,EAAQH,EAAOtJ,GAGrB,IAAI3L,EAEJ,GAAqB,iBAAVoV,EACTpV,EAAQoV,OAER,OAAQA,GACN,KAAM,EACJpV,EAAQ,KACR,MAGF,KAAM,EACJA,EAAQ,KACR,MAGF,KAAM,EACJA,EAAQ,OACR,MAGF,KAAM,EACJA,EAAQqW,EAAa,IAAM,KAC3B,MAGF,KAAM,EACJ,IAAKA,GAAcC,EAAO,SAC1BtW,EAAQ,IACR,MAGF,QAEEA,EAAQiK,OAAO6D,aAAasH,GAIlCkB,GAAmB,IAAXlB,EACRpS,EAAOzE,KAAKyB,EACd,CAEA,OAAOgD,EAAOrF,KAAK,GACrB,CA9bW4Y,CAAgB7E,EAAYzC,GAAQoH,EAC7C,EA9CEvU,MACA6P,WA0DF,SAAoB3R,GAClB4V,EAAY5V,EAAMiR,MAAQjR,EAAMsV,OAChCS,GACF,EA5DEnE,MAwBF,SAAelP,GAIb,OAHAuS,EAAS1W,EAAK0W,EAAQvS,GAkDxB,WAEE,IAAI8T,EAEJ,KAAOtG,EAAMqF,OAASN,EAAOvX,QAAQ,CACnC,MAAM0X,EAAQH,EAAO/E,EAAMqF,QAE3B,GAAqB,iBAAVH,EAOT,IANAoB,EAAatG,EAAMqF,OAEfrF,EAAMsF,aAAe,IACvBtF,EAAMsF,aAAe,GAIrBtF,EAAMqF,SAAWiB,GACjBtG,EAAMsF,aAAeJ,EAAM1X,QAE3B+Y,EAAGrB,EAAMC,WAAWnF,EAAMsF,oBAG5BiB,EAAGrB,EAEP,CACF,CAzEEsB,GAEkC,OAA9BzB,EAAOA,EAAOvX,OAAS,GAClB,IAGTyY,EAAUR,EAAY,GAEtBzC,EAAQjD,OAASsE,EAAWsB,EAAsB3C,EAAQjD,OAAQiD,GAC3DA,EAAQjD,OACjB,GA5BA,IAOI0G,EAPAC,EAAQjB,EAAWjH,SAASvP,KAAK+T,EAASlF,GAa9C,OAJI2H,EAAWpB,YACbsB,EAAqBtX,KAAKoX,GAGrBzC,EA0BP,SAASxB,EAAYzC,GACnB,OA6VJ,SAAqBgG,EAAQhG,GAC3B,MAAM4H,EAAa5H,EAAMpD,MAAM0J,OACzBuB,EAAmB7H,EAAMpD,MAAM2J,aAC/BuB,EAAW9H,EAAMjD,IAAIuJ,OACrByB,EAAiB/H,EAAMjD,IAAIwJ,aAGjC,IAAIyB,EAmBJ,OAjBIJ,IAAeE,EAEjBE,EAAO,CAAChC,EAAO4B,GAAYnU,MAAMoU,EAAkBE,KAEnDC,EAAOhC,EAAOvS,MAAMmU,EAAYE,GAE5BD,GAAoB,IAEtBG,EAAK,GAAKA,EAAK,GAAGvU,MAAMoU,IAGtBE,EAAiB,GAEnBC,EAAK1Y,KAAK0W,EAAO8B,GAAUrU,MAAM,EAAGsU,KAIjCC,CACT,CAxXWC,CAAYjC,EAAQhG,EAC7B,CAGA,SAASnN,IACP,OAAOrD,OAAO4R,OAAO,CAAC,EAAGH,EAC3B,CAqDA,SAASuG,EAAG9J,GACVmJ,OAAW5X,EACXyY,EAAehK,EACfiK,EAAQA,EAAMjK,EAChB,CAkEA,SAASyJ,EAAkBe,EAAG3O,GAC5BA,EAAK4O,SACP,CAQA,SAASnB,EAAiBoB,EAAUrB,GAClC,OAWA,SAAcpJ,EAAY0K,EAAaC,GAErC,IAAIC,EAGAC,EAGAlH,EAGA/H,EACJ,OAAOtJ,MAAMF,QAAQ4N,GAEjB8K,EAAuB9K,GACvB,aAAcA,EACd8K,EAAuB,CAAC9K,IAS5B,SAA+BvP,GAC7B,OAGA,SAAesP,GACb,MAAMgL,EAAe,OAAThL,GAAiBtP,EAAIsP,GAC3BL,EAAe,OAATK,GAAiBtP,EAAI6U,KAQjC,OAAOwF,EAPM,IAIPxY,MAAMF,QAAQ2Y,GAAOA,EAAMA,EAAM,CAACA,GAAO,MACzCzY,MAAMF,QAAQsN,GAAOA,EAAMA,EAAM,CAACA,GAAO,IAExCoL,CAA6B/K,EACtC,CACF,CAxBIiL,CAAsBhL,GAgC1B,SAAS8K,EAAuBxa,GAI9B,OAHAsa,EAAmBta,EACnBua,EAAiB,EAEG,IAAhBva,EAAKQ,OACA6Z,EAGFM,EAAgB3a,EAAKua,GAC9B,CAQA,SAASI,EAAgB3B,GACvB,OAGA,SAAevJ,GAYb,OAPAnE,EA4ER,WACE,MAAMsP,EAAahW,IACbiW,EAAgB7E,EAAQlE,SACxBgJ,EAAwB9E,EAAQ3C,iBAChC0H,EAAmB/E,EAAQjD,OAAOvS,OAClCwa,EAAahZ,MAAMiN,KAAKkD,GAC9B,MAAO,CACL+H,QASF,WACElH,EAAQ4H,EACR5E,EAAQlE,SAAW+I,EACnB7E,EAAQ3C,iBAAmByH,EAC3B9E,EAAQjD,OAAOvS,OAASua,EACxB5I,EAAQ6I,EACRnC,GACF,EAfE5J,KAAM8L,EAgBV,CApGeE,GACP5H,EAAmB2F,EAEdA,EAAU7D,UACba,EAAQ3C,iBAAmB2F,GAI3BA,EAAUrW,MACVqT,EAAQrE,OAAOjC,WAAWqF,QAAQC,KAAKC,SAAS+D,EAAUrW,MAEnDkS,IAGFmE,EAAUxH,SAASvP,KAIxB6W,EAASvX,OAAO4R,OAAO5R,OAAO2Z,OAAOlF,GAAU8C,GAAU9C,EACzDlF,EACAC,EACA8D,EAPKmE,CAQLvJ,EACJ,CACF,CAGA,SAASsB,EAAGtB,GAGV,OAFAmJ,GAAW,EACXuB,EAAS9G,EAAkB/H,GACpB8O,CACT,CAGA,SAASvF,EAAIpF,GAIX,OAHAmJ,GAAW,EACXtN,EAAK4O,YAECK,EAAiBD,EAAiB9Z,OAC/Bma,EAAgBL,EAAiBC,IAGnCF,CACT,CACF,CACF,CAOA,SAASpB,EAAUD,EAAW/J,GACxB+J,EAAU3B,aAAesB,EAAqB1D,SAAS+D,IACzDL,EAAqBtX,KAAK2X,GAGxBA,EAAU/N,SACZyD,EACEsH,EAAQjD,OACR9D,EACA+G,EAAQjD,OAAOvS,OAASyO,EACxB+J,EAAU/N,QAAQ+K,EAAQjD,OAAOvN,MAAMyJ,GAAO+G,IAI9CgD,EAAUmC,YACZnF,EAAQjD,OAASiG,EAAUmC,UAAUnF,EAAQjD,OAAQiD,GAEzD,CAuCA,SAAS6C,IACH7F,EAAMe,QAAQ2E,GAAe1F,EAAMoF,OAAS,IAC9CpF,EAAMoF,OAASM,EAAY1F,EAAMe,MACjCf,EAAMgB,QAAU0E,EAAY1F,EAAMe,MAAQ,EAE9C,CACF,CCneO,MAAMqH,EAAgB,CAC3BzY,KAAM,gBACN6O,SAIF,SAA+BV,EAASC,EAAI8D,GAC1C,IAGIwG,EAHAlK,EAAO,EAIX,OAGA,SAAe1B,GAGb,OAFAqB,EAAQM,MAAM,iBACdiK,EAAS5L,EACFmI,EAAQnI,EACjB,EAGA,SAASmI,EAAQnI,GACf,OAAIA,IAAS4L,GACXvK,EAAQM,MAAM,yBACPkK,EAAS7L,IAGde,EAAcf,GACToB,EAAaC,EAAS8G,EAAS,aAA/B/G,CAA6CpB,GAGlD0B,EAAO,GAAe,OAAT1B,IAAkBc,EAAmBd,GAC7CoF,EAAIpF,IAGbqB,EAAQS,KAAK,iBACNR,EAAGtB,GACZ,CAGA,SAAS6L,EAAS7L,GAChB,OAAIA,IAAS4L,GACXvK,EAAQQ,QAAQ7B,GAChB0B,IACOmK,IAGTxK,EAAQS,KAAK,yBACNqG,EAAQnI,GACjB,CACF,GCzCazP,EAAO,CAClB2C,KAAM,OACN6O,SAuBF,SAA2BV,EAASC,EAAI8D,GACtC,MAAM1Q,EAAOjE,KACP6W,EAAO5S,EAAK4O,OAAO5O,EAAK4O,OAAOvS,OAAS,GAC9C,IAAI+a,EACFxE,GAAyB,eAAjBA,EAAK,GAAGhS,KACZgS,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMvW,OACtC,EACF2Q,EAAO,EACX,OAGA,SAAe1B,GACb,MAAMnH,EACJnE,EAAKqO,eAAezN,OACV,KAAT0K,GAAwB,KAATA,GAAwB,KAATA,EAC3B,gBACA,eAEN,GACW,kBAATnH,GACKnE,EAAKqO,eAAe6I,QAAU5L,IAAStL,EAAKqO,eAAe6I,OAC5DrL,EAAWP,GACf,CAQA,GAPKtL,EAAKqO,eAAezN,OACvBZ,EAAKqO,eAAezN,KAAOuD,EAC3BwI,EAAQM,MAAM9I,EAAM,CAClBwN,YAAY,KAIH,kBAATxN,EAEF,OADAwI,EAAQM,MAAM,kBACE,KAAT3B,GAAwB,KAATA,EAClBqB,EAAQ4C,MAAM0H,EAAevG,EAAK2G,EAAlC1K,CAA4CrB,GAC5C+L,EAAS/L,GAGf,IAAKtL,EAAKqP,WAAsB,KAAT/D,EAGrB,OAFAqB,EAAQM,MAAM,kBACdN,EAAQM,MAAM,iBACPqK,EAAOhM,EAElB,CAEA,OAAOoF,EAAIpF,EACb,EAGA,SAASgM,EAAOhM,GACd,OAAIO,EAAWP,MAAW0B,EAAO,IAC/BL,EAAQQ,QAAQ7B,GACTgM,KAILtX,EAAKqP,WAAarC,EAAO,KAC1BhN,EAAKqO,eAAe6I,OACjB5L,IAAStL,EAAKqO,eAAe6I,OACpB,KAAT5L,GAAwB,KAATA,IAEnBqB,EAAQS,KAAK,iBACNiK,EAAS/L,IAGXoF,EAAIpF,EACb,CAKA,SAAS+L,EAAS/L,GAKhB,OAJAqB,EAAQM,MAAM,kBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,kBACbpN,EAAKqO,eAAe6I,OAASlX,EAAKqO,eAAe6I,QAAU5L,EACpDqB,EAAQ4C,MACbwB,EACA/Q,EAAKqP,UAAYqB,EAAM6G,EACvB5K,EAAQY,QACNiK,EACAC,EACAC,GAGN,CAGA,SAASH,EAAQjM,GAGf,OAFAtL,EAAKqO,eAAesJ,kBAAmB,EACvCP,IACOK,EAAYnM,EACrB,CAGA,SAASoM,EAAYpM,GACnB,OAAIe,EAAcf,IAChBqB,EAAQM,MAAM,4BACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,4BACNqK,GAGF/G,EAAIpF,EACb,CAGA,SAASmM,EAAYnM,GAInB,OAHAtL,EAAKqO,eAAerB,KAClBoK,EACApX,EAAK6S,eAAelG,EAAQS,KAAK,mBAAmB,GAAM/Q,OACrDuQ,EAAGtB,EACZ,CACF,EAtIEgD,aAAc,CACZjB,SA2IJ,SAAkCV,EAASC,EAAI8D,GAC7C,MAAM1Q,EAAOjE,KAEb,OADAiE,EAAKqO,eAAeI,gBAAa5R,EAC1B8P,EAAQ4C,MAAMwB,GAGrB,SAAiBzF,GAMf,OALAtL,EAAKqO,eAAeuJ,kBAClB5X,EAAKqO,eAAeuJ,mBACpB5X,EAAKqO,eAAesJ,iBAGfjL,EACLC,EACAC,EACA,iBACA5M,EAAKqO,eAAerB,KAAO,EAJtBN,CAKLpB,EACJ,IAGA,SAAkBA,GAChB,OAAItL,EAAKqO,eAAeuJ,oBAAsBvL,EAAcf,IAC1DtL,EAAKqO,eAAeuJ,uBAAoB/a,EACxCmD,EAAKqO,eAAesJ,sBAAmB9a,EAChCgb,EAAiBvM,KAG1BtL,EAAKqO,eAAeuJ,uBAAoB/a,EACxCmD,EAAKqO,eAAesJ,sBAAmB9a,EAChC8P,EAAQY,QAAQuK,EAAiBlL,EAAIiL,EAArClL,CAAuDrB,GAChE,IAGA,SAASuM,EAAiBvM,GAKxB,OAHAtL,EAAKqO,eAAeI,YAAa,EAEjCzO,EAAKqP,eAAYxS,EACV6P,EACLC,EACAA,EAAQY,QAAQ1R,EAAM+Q,EAAI8D,GAC1B,aACA1Q,EAAKwN,OAAOjC,WAAWqF,QAAQC,KAAKC,SAAS,qBACzCjU,EACA,EANC6P,CAOLpB,EACJ,CACF,GAzLE8B,KAuNF,SAAyBT,GACvBA,EAAQS,KAAKrR,KAAKsS,eAAezN,KACnC,GArNM4W,EAAoC,CACxCnK,SA0NF,SAA0CV,EAASC,EAAI8D,GACrD,MAAM1Q,EAAOjE,KACb,OAAO2Q,EACLC,GASF,SAAqBrB,GACnB,MAAMsH,EAAO5S,EAAK4O,OAAO5O,EAAK4O,OAAOvS,OAAS,GAC9C,OAAQgQ,EAAcf,IACpBsH,GACiB,6BAAjBA,EAAK,GAAGhS,KACNgM,EAAGtB,GACHoF,EAAIpF,EACV,GAdE,2BACAtL,EAAKwN,OAAOjC,WAAWqF,QAAQC,KAAKC,SAAS,qBACzCjU,EACA,EAYR,EA7OEmU,SAAS,GAIL8G,EAAkB,CACtBzK,SAoLF,SAAwBV,EAASC,EAAI8D,GACnC,MAAM1Q,EAAOjE,KACb,OAAO2Q,EACLC,GAOF,SAAqBrB,GACnB,MAAMsH,EAAO5S,EAAK4O,OAAO5O,EAAK4O,OAAOvS,OAAS,GAC9C,OAAOuW,GACY,mBAAjBA,EAAK,GAAGhS,MACRgS,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMvW,SAAW2D,EAAKqO,eAAerB,KACnEJ,EAAGtB,GACHoF,EAAIpF,EACV,GAZE,iBACAtL,EAAKqO,eAAerB,KAAO,EAY/B,EArMEgE,SAAS,GC3BE+G,EAAa,CACxBvZ,KAAM,aACN6O,SAQF,SAAiCV,EAASC,EAAI8D,GAC5C,MAAM1Q,EAAOjE,KACb,OAGA,SAAeuP,GACb,GAAa,KAATA,EAAa,CACf,MAAMiK,EAAQvV,EAAKqO,eAanB,OAXKkH,EAAMyC,OACTrL,EAAQM,MAAM,aAAc,CAC1B0E,YAAY,IAEd4D,EAAMyC,MAAO,GAGfrL,EAAQM,MAAM,oBACdN,EAAQM,MAAM,oBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,oBACN6K,CACT,CAEA,OAAOvH,EAAIpF,EACb,EAGA,SAAS2M,EAAM3M,GACb,OAAIe,EAAcf,IAChBqB,EAAQM,MAAM,8BACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,8BACbT,EAAQS,KAAK,oBACNR,IAGTD,EAAQS,KAAK,oBACNR,EAAGtB,GACZ,CACF,EA9CEgD,aAAc,CACZjB,SAgDJ,SAAwCV,EAASC,EAAI8D,GACnD,OAAOhE,EACLC,EACAA,EAAQY,QAAQwK,EAAYnL,EAAI8D,GAChC,aACA3U,KAAKyR,OAAOjC,WAAWqF,QAAQC,KAAKC,SAAS,qBAAkBjU,EAAY,EAE/E,GArDEuQ,KAwDF,SAAcT,GACZA,EAAQS,KAAK,aACf,GCnDO,SAAS8K,EACdvL,EACAC,EACA8D,EACA9P,EACAuX,EACAC,EACAC,EACAC,EACAhY,GAEA,MAAMuM,EAAQvM,GAAOwM,OAAOC,kBAC5B,IAAIwL,EAAU,EACd,OAGA,SAAejN,GACb,OAAa,KAATA,GACFqB,EAAQM,MAAMrM,GACd+L,EAAQM,MAAMkL,GACdxL,EAAQM,MAAMmL,GACdzL,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAKgL,GACNI,GAGI,OAATlN,GAA0B,KAATA,GAAeY,EAAaZ,GACxCoF,EAAIpF,IAGbqB,EAAQM,MAAMrM,GACd+L,EAAQM,MAAMoL,GACd1L,EAAQM,MAAMqL,GACd3L,EAAQM,MAAM,cAAe,CAC3BY,YAAa,WAER4K,EAAenN,GACxB,EAGA,SAASkN,EAA0BlN,GACjC,OAAa,KAATA,GACFqB,EAAQM,MAAMmL,GACdzL,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAKgL,GACbzL,EAAQS,KAAK+K,GACbxL,EAAQS,KAAKxM,GACNgM,IAGTD,EAAQM,MAAMqL,GACd3L,EAAQM,MAAM,cAAe,CAC3BY,YAAa,WAER6K,EAAoBpN,GAC7B,CAGA,SAASoN,EAAoBpN,GAC3B,OAAa,KAATA,GACFqB,EAAQS,KAAK,eACbT,EAAQS,KAAKkL,GACNE,EAA0BlN,IAGtB,OAATA,GAA0B,KAATA,GAAec,EAAmBd,GAC9CoF,EAAIpF,IAGbqB,EAAQQ,QAAQ7B,GACA,KAATA,EAAcqN,EAA4BD,EACnD,CAGA,SAASC,EAA0BrN,GACjC,OAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChCqB,EAAQQ,QAAQ7B,GACToN,GAGFA,EAAoBpN,EAC7B,CAGA,SAASmN,EAAenN,GACtB,OAAa,KAATA,IACIiN,EAAU1L,EAAc6D,EAAIpF,IAClCqB,EAAQQ,QAAQ7B,GACTmN,GAGI,KAATnN,EACGiN,KAQL5L,EAAQQ,QAAQ7B,GACTmN,IARL9L,EAAQS,KAAK,eACbT,EAAQS,KAAKkL,GACb3L,EAAQS,KAAKiL,GACb1L,EAAQS,KAAKxM,GACNgM,EAAGtB,IAOD,OAATA,GAAiBa,EAA0Bb,GACzCiN,EAAgB7H,EAAIpF,IACxBqB,EAAQS,KAAK,eACbT,EAAQS,KAAKkL,GACb3L,EAAQS,KAAKiL,GACb1L,EAAQS,KAAKxM,GACNgM,EAAGtB,IAGRY,EAAaZ,GAAcoF,EAAIpF,IACnCqB,EAAQQ,QAAQ7B,GACA,KAATA,EAAcsN,EAAuBH,EAC9C,CAGA,SAASG,EAAqBtN,GAC5B,OAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChCqB,EAAQQ,QAAQ7B,GACTmN,GAGFA,EAAenN,EACxB,CACF,CCpIO,SAASuN,EAAalM,EAASC,EAAI8D,EAAK9P,EAAMkY,EAAYR,GAC/D,MAAMtY,EAAOjE,KACb,IAGIgS,EAHAf,EAAO,EAIX,OAGA,SAAe1B,GAMb,OALAqB,EAAQM,MAAMrM,GACd+L,EAAQM,MAAM6L,GACdnM,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK0L,GACbnM,EAAQM,MAAMqL,GACP7E,CACT,EAGA,SAASA,EAAQnI,GACf,OACW,OAATA,GACS,KAATA,GACU,KAATA,IAAgByC,GAQP,KAATzC,IACE0B,GACD,2BAA4BhN,EAAKwN,OAAOjC,YAC1CyB,EAAO,IAEA0D,EAAIpF,GAGA,KAATA,GACFqB,EAAQS,KAAKkL,GACb3L,EAAQM,MAAM6L,GACdnM,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK0L,GACbnM,EAAQS,KAAKxM,GACNgM,GAGLR,EAAmBd,IACrBqB,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACNqG,IAGT9G,EAAQM,MAAM,cAAe,CAC3BY,YAAa,WAERkL,EAAMzN,GACf,CAGA,SAASyN,EAAMzN,GACb,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACAc,EAAmBd,IACnB0B,IAAS,KAETL,EAAQS,KAAK,eACNqG,EAAQnI,KAGjBqB,EAAQQ,QAAQ7B,GAChByC,EAAOA,IAAS1B,EAAcf,GACd,KAATA,EAAc0N,EAAcD,EACrC,CAGA,SAASC,EAAY1N,GACnB,OAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAChCqB,EAAQQ,QAAQ7B,GAChB0B,IACO+L,GAGFA,EAAMzN,EACf,CACF,CCzFO,SAAS2N,EAAatM,EAASC,EAAI8D,EAAK9P,EAAMkY,EAAYR,GAE/D,IAAIpB,EACJ,OAGA,SAAe5L,GAMb,OALAqB,EAAQM,MAAMrM,GACd+L,EAAQM,MAAM6L,GACdnM,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK0L,GACb5B,EAAkB,KAAT5L,EAAc,GAAKA,EACrB4N,CACT,EAGA,SAASA,EAAkB5N,GACzB,OAAIA,IAAS4L,GACXvK,EAAQM,MAAM6L,GACdnM,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK0L,GACbnM,EAAQS,KAAKxM,GACNgM,IAGTD,EAAQM,MAAMqL,GACPa,EAAa7N,GACtB,CAGA,SAAS6N,EAAa7N,GACpB,OAAIA,IAAS4L,GACXvK,EAAQS,KAAKkL,GACNY,EAAkBhC,IAGd,OAAT5L,EACKoF,EAAIpF,GAGTc,EAAmBd,IACrBqB,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACNV,EAAaC,EAASwM,EAAc,gBAG7CxM,EAAQM,MAAM,cAAe,CAC3BY,YAAa,WAERuL,EAAM9N,GACf,CAGA,SAAS8N,EAAM9N,GACb,OAAIA,IAAS4L,GAAmB,OAAT5L,GAAiBc,EAAmBd,IACzDqB,EAAQS,KAAK,eACN+L,EAAa7N,KAGtBqB,EAAQQ,QAAQ7B,GACA,KAATA,EAAc+N,EAAcD,EACrC,CAGA,SAASC,EAAY/N,GACnB,OAAIA,IAAS4L,GAAmB,KAAT5L,GACrBqB,EAAQQ,QAAQ7B,GACT8N,GAGFA,EAAM9N,EACf,CACF,CChFO,SAASgO,GAAkB3M,EAASC,GAEzC,IAAI4D,EACJ,OAGA,SAAShG,EAAMc,GACb,OAAIc,EAAmBd,IACrBqB,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACboD,GAAO,EACAhG,GAGL6B,EAAcf,GACToB,EACLC,EACAnC,EACAgG,EAAO,aAAe,aAHjB9D,CAILpB,GAGGsB,EAAGtB,EACZ,CACF,CC9BO,SAASiO,GAAoB5a,GAClC,OACEA,EACGuC,QAAQ,cAAe,KACvBA,QAAQ,SAAU,IAMlBsY,cACAC,aAEP,CCFO,MAAMC,GAAa,CACxBlb,KAAM,aACN6O,SAUF,SAA4BV,EAASC,EAAI8D,GACvC,MAAM1Q,EAAOjE,KAGb,IAAI4d,EACJ,OAGA,SAAerO,GAEb,OADAqB,EAAQM,MAAM,cACP4L,EAAa/a,KAClBkC,EACA2M,EACAiN,EACAlJ,EACA,kBACA,wBACA,wBAPKmI,CAQLvN,EACJ,EAGA,SAASsO,EAAWtO,GAKlB,OAJAqO,EAAaJ,GACXvZ,EAAK6S,eAAe7S,EAAK4O,OAAO5O,EAAK4O,OAAOvS,OAAS,GAAG,IAAIgF,MAAM,GAAI,IAG3D,KAATiK,GACFqB,EAAQM,MAAM,oBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,oBAENkM,GACL3M,EACAuL,EACEvL,EACAA,EAAQY,QACNsM,GACAnN,EAAaC,EAASsL,EAAO,cAC7BvL,EAAaC,EAASsL,EAAO,eAE/BvH,EACA,wBACA,+BACA,qCACA,2BACA,iCAKCA,EAAIpF,EACb,CAGA,SAAS2M,EAAM3M,GACb,OAAa,OAATA,GAAiBc,EAAmBd,IACtCqB,EAAQS,KAAK,cAERpN,EAAKwN,OAAOsM,QAAQhJ,SAAS6I,IAChC3Z,EAAKwN,OAAOsM,QAAQ5c,KAAKyc,GAGpB/M,EAAGtB,IAGLoF,EAAIpF,EACb,CACF,GA1EMuO,GAAiB,CACrBxM,SA4EF,SAAuBV,EAASC,EAAI8D,GAClC,OAGA,SAAepF,GACb,OAAOa,EAA0Bb,GAC7BgO,GAAkB3M,EAASlB,EAA3B6N,CAAmChO,GACnCoF,EAAIpF,EACV,EAGA,SAASG,EAAOH,GACd,OAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,EACzB2N,EACLtM,EACAD,EAAaC,EAASsL,EAAO,cAC7BvH,EACA,kBACA,wBACA,wBANKuI,CAOL3N,GAGGoF,EAAIpF,EACb,CAGA,SAAS2M,EAAM3M,GACb,OAAgB,OAATA,GAAiBc,EAAmBd,GAAQsB,EAAGtB,GAAQoF,EAAIpF,EACpE,CACF,EAzGE0F,SAAS,GCdE+I,GAAe,CAC1Bvb,KAAM,eACN6O,SAUF,SAA8BV,EAASC,EAAI8D,GACzC,MAAM1Q,EAAOjE,KACb,OAGA,SAAeuP,GAEb,OADAqB,EAAQM,MAAM,gBACPP,EAAaC,EAASqN,EAAkB,aAAc,EAAtDtN,CAA6DpB,EACtE,EAGA,SAAS0O,EAAiB1O,GACxB,MAAMsH,EAAO5S,EAAK4O,OAAO5O,EAAK4O,OAAOvS,OAAS,GAC9C,OAAOuW,GACY,eAAjBA,EAAK,GAAGhS,MACRgS,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMvW,QAAU,EAC9C4d,EAAY3O,GACZoF,EAAIpF,EACV,CAGA,SAAS2O,EAAY3O,GACnB,OAAa,OAATA,EACK2M,EAAM3M,GAGXc,EAAmBd,GACdqB,EAAQY,QAAQ2M,GAAiBD,EAAahC,EAA9CtL,CAAqDrB,IAG9DqB,EAAQM,MAAM,iBACP/Q,EAAQoP,GACjB,CAGA,SAASpP,EAAQoP,GACf,OAAa,OAATA,GAAiBc,EAAmBd,IACtCqB,EAAQS,KAAK,iBACN6M,EAAY3O,KAGrBqB,EAAQQ,QAAQ7B,GACTpP,EACT,CAGA,SAAS+b,EAAM3M,GAEb,OADAqB,EAAQS,KAAK,gBACNR,EAAGtB,EACZ,CACF,GAxDM4O,GAAkB,CACtB7M,SA0DF,SAAiCV,EAASC,EAAI8D,GAC5C,MAAM1Q,EAAOjE,KACb,OAAOyO,EAGP,SAASA,EAAMc,GAEb,OAAItL,EAAKwN,OAAOmC,KAAK3P,EAAKS,MAAMmP,MACvBc,EAAIpF,GAGTc,EAAmBd,IACrBqB,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACN5C,GAGFkC,EAAaC,EAASsN,EAAa,aAAc,EAAjDvN,CAAwDpB,EACjE,CAGA,SAAS2O,EAAY3O,GACnB,MAAMsH,EAAO5S,EAAK4O,OAAO5O,EAAK4O,OAAOvS,OAAS,GAC9C,OAAOuW,GACY,eAAjBA,EAAK,GAAGhS,MACRgS,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMvW,QAAU,EAC9CuQ,EAAGtB,GACHc,EAAmBd,GACnBd,EAAMc,GACNoF,EAAIpF,EACV,CACF,EAzFE0F,SAAS,GCHEmJ,GAAa,CACxB3b,KAAM,aACN6O,SA4DF,SAA4BV,EAASC,EAAI8D,GACvC,MAAM1Q,EAAOjE,KACb,IAAIiR,EAAO,EACX,OAGA,SAAe1B,GAGb,OAFAqB,EAAQM,MAAM,cACdN,EAAQM,MAAM,sBACPmN,EAAgB9O,EACzB,EAGA,SAAS8O,EAAgB9O,GACvB,OAAa,KAATA,GAAe0B,IAAS,GAC1BL,EAAQQ,QAAQ7B,GACT8O,GAGI,OAAT9O,GAAiBa,EAA0Bb,IAC7CqB,EAAQS,KAAK,sBACNpN,EAAKqP,UAAYzC,EAAGtB,GAAQ+O,EAAa/O,IAG3CoF,EAAIpF,EACb,CAGA,SAAS+O,EAAa/O,GACpB,OAAa,KAATA,GACFqB,EAAQM,MAAM,sBACPkK,EAAS7L,IAGL,OAATA,GAAiBc,EAAmBd,IACtCqB,EAAQS,KAAK,cACNR,EAAGtB,IAGRe,EAAcf,GACToB,EAAaC,EAAS0N,EAAc,aAApC3N,CAAkDpB,IAG3DqB,EAAQM,MAAM,kBACPc,EAAKzC,GACd,CAGA,SAAS6L,EAAS7L,GAChB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT6L,IAGTxK,EAAQS,KAAK,sBACNiN,EAAa/O,GACtB,CAGA,SAASyC,EAAKzC,GACZ,OAAa,OAATA,GAA0B,KAATA,GAAea,EAA0Bb,IAC5DqB,EAAQS,KAAK,kBACNiN,EAAa/O,KAGtBqB,EAAQQ,QAAQ7B,GACTyC,EACT,CACF,EA/HEjH,QAIF,SAA2B8H,EAAQiD,GACjC,IAII3V,EAGAqX,EAPAf,EAAa5D,EAAOvS,OAAS,EAC7BiR,EAAe,EAiDnB,MAzCqC,eAAjCsB,EAAOtB,GAAc,GAAG1M,OAC1B0M,GAAgB,GAIhBkF,EAAa,EAAIlF,GACc,eAA/BsB,EAAO4D,GAAY,GAAG5R,OAEtB4R,GAAc,GAIiB,uBAA/B5D,EAAO4D,GAAY,GAAG5R,OACrB0M,IAAiBkF,EAAa,GAC5BA,EAAa,EAAIlF,GACmB,eAAnCsB,EAAO4D,EAAa,GAAG,GAAG5R,QAE9B4R,GAAclF,EAAe,IAAMkF,EAAa,EAAI,GAGlDA,EAAalF,IACfpR,EAAU,CACR0E,KAAM,iBACN4J,MAAOoE,EAAOtB,GAAc,GAAG9C,MAC/BG,IAAKiE,EAAO4D,GAAY,GAAG7H,KAE7B4I,EAAO,CACL3S,KAAM,YACN4J,MAAOoE,EAAOtB,GAAc,GAAG9C,MAC/BG,IAAKiE,EAAO4D,GAAY,GAAG7H,IAE3BkD,YAAa,QAEftD,EAAOqE,EAAQtB,EAAckF,EAAalF,EAAe,EAAG,CAC1D,CAAC,QAASpR,EAAS2V,GACnB,CAAC,QAAS0B,EAAM1B,GAChB,CAAC,OAAQ0B,EAAM1B,GACf,CAAC,OAAQ3V,EAAS2V,MAIfjD,CACT,GChEa0L,GAAkB,CAC7B9b,KAAM,kBACN6O,SA+DF,SAAiCV,EAASC,EAAI8D,GAC5C,MAAM1Q,EAAOjE,KACb,IAGImb,EAGAqD,EANAjQ,EAAQtK,EAAK4O,OAAOvS,OAQxB,KAAOiO,KAGL,GACiC,eAA/BtK,EAAK4O,OAAOtE,GAAO,GAAG1J,MACS,eAA/BZ,EAAK4O,OAAOtE,GAAO,GAAG1J,MACS,YAA/BZ,EAAK4O,OAAOtE,GAAO,GAAG1J,KACtB,CACA2Z,EAA2C,cAA/Bva,EAAK4O,OAAOtE,GAAO,GAAG1J,KAClC,KACF,CAGF,OAGA,SAAe0K,GACb,OAAKtL,EAAKwN,OAAOmC,KAAK3P,EAAKS,MAAMmP,QAAU5P,EAAKqP,YAAakL,EAOtD7J,EAAIpF,IANTqB,EAAQM,MAAM,qBACdN,EAAQM,MAAM,6BACdiK,EAAS5L,EACFkP,EAAgBlP,GAI3B,EAGA,SAASkP,EAAgBlP,GACvB,OAAIA,IAAS4L,GACXvK,EAAQQ,QAAQ7B,GACTkP,IAGT7N,EAAQS,KAAK,6BACNV,EAAaC,EAAS8N,EAAoB,aAA1C/N,CAAwDpB,GACjE,CAGA,SAASmP,EAAmBnP,GAC1B,OAAa,OAATA,GAAiBc,EAAmBd,IACtCqB,EAAQS,KAAK,qBACNR,EAAGtB,IAGLoF,EAAIpF,EACb,CACF,EAvHE0L,UAIF,SAAkCpI,EAAQiD,GACxC,IAGI3V,EAGAqX,EAGAmG,EATApP,EAAQsE,EAAOvS,OAYnB,KAAOiO,KACL,GAAyB,UAArBsE,EAAOtE,GAAO,GAAgB,CAChC,GAA8B,YAA1BsE,EAAOtE,GAAO,GAAG1J,KAAoB,CACvC1E,EAAUoO,EACV,KACF,CAE8B,cAA1BsE,EAAOtE,GAAO,GAAG1J,OACnB2S,EAAOjJ,EAEX,KAEgC,YAA1BsE,EAAOtE,GAAO,GAAG1J,MAEnBgO,EAAOrE,OAAOD,EAAO,GAGlBoP,GAAwC,eAA1B9K,EAAOtE,GAAO,GAAG1J,OAClC8Y,EAAapP,GAKnB,MAAMoQ,EAAU,CACd9Z,KAAM,gBACN4J,MAAOpN,OAAO4R,OAAO,CAAC,EAAGJ,EAAO2E,GAAM,GAAG/I,OACzCG,IAAKvN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOA,EAAOvS,OAAS,GAAG,GAAGsO,MAetD,OAZAiE,EAAO2E,GAAM,GAAG3S,KAAO,oBAGnB8Y,GACF9K,EAAOrE,OAAOgJ,EAAM,EAAG,CAAC,QAASmH,EAAS7I,IAC1CjD,EAAOrE,OAAOmP,EAAa,EAAG,EAAG,CAAC,OAAQ9K,EAAO1S,GAAS,GAAI2V,IAC9DjD,EAAO1S,GAAS,GAAGyO,IAAMvN,OAAO4R,OAAO,CAAC,EAAGJ,EAAO8K,GAAY,GAAG/O,MAEjEiE,EAAO1S,GAAS,GAAKwe,EAGvB9L,EAAO1R,KAAK,CAAC,OAAQwd,EAAS7I,IACvBjD,CACT,GC/Da+L,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,UACA,UACA,QACA,QACA,KACA,QACA,KACA,QACA,QACA,KACA,QACA,MAaWC,GAAe,CAAC,MAAO,SAAU,QAAS,YClE1CC,GAAW,CACtBrc,KAAM,WACN6O,SAkCF,SAA0BV,EAASC,EAAI8D,GACrC,MAAM1Q,EAAOjE,KAGb,IAAIoI,EAGA2W,EAGAC,EAGAzQ,EAGA4M,EACJ,OAGA,SAAe5L,GAIb,OAHAqB,EAAQM,MAAM,YACdN,EAAQM,MAAM,gBACdN,EAAQQ,QAAQ7B,GACT0M,CACT,EAGA,SAASA,EAAK1M,GACZ,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT0P,GAGI,KAAT1P,GACFqB,EAAQQ,QAAQ7B,GACT2P,GAGI,KAAT3P,GACFqB,EAAQQ,QAAQ7B,GAChBnH,EAAO,EAGAnE,EAAKqP,UAAYzC,EAAKsO,GAG3BvP,EAAWL,IACbqB,EAAQQ,QAAQ7B,GAChByP,EAASnS,OAAO6D,aAAanB,GAC7BwP,GAAW,EACJK,GAGFzK,EAAIpF,EACb,CAGA,SAAS0P,EAAiB1P,GACxB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GAChBnH,EAAO,EACAiX,GAGI,KAAT9P,GACFqB,EAAQQ,QAAQ7B,GAChBnH,EAAO,EACP4W,EAAS,SACTzQ,EAAQ,EACD+Q,GAGL1P,EAAWL,IACbqB,EAAQQ,QAAQ7B,GAChBnH,EAAO,EACAnE,EAAKqP,UAAYzC,EAAKsO,GAGxBxK,EAAIpF,EACb,CAGA,SAAS8P,EAAkB9P,GACzB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTtL,EAAKqP,UAAYzC,EAAKsO,GAGxBxK,EAAIpF,EACb,CAGA,SAAS+P,EAAgB/P,GACvB,OAAIA,IAASyP,EAAO/G,WAAW1J,MAC7BqC,EAAQQ,QAAQ7B,GACThB,IAAUyQ,EAAO1e,OACpB2D,EAAKqP,UACHzC,EACA0B,EACF+M,GAGC3K,EAAIpF,EACb,CAGA,SAAS2P,EAAc3P,GACrB,OAAIK,EAAWL,IACbqB,EAAQQ,QAAQ7B,GAChByP,EAASnS,OAAO6D,aAAanB,GACtB6P,GAGFzK,EAAIpF,EACb,CAGA,SAAS6P,EAAQ7P,GACf,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACAa,EAA0Bb,GAGf,KAATA,GACAwP,GACAF,GAAa9J,SAASiK,EAAOvB,gBAE7BrV,EAAO,EACAnE,EAAKqP,UAAYzC,EAAGtB,GAAQgD,EAAahD,IAG9CqP,GAAe7J,SAASiK,EAAOvB,gBACjCrV,EAAO,EAEM,KAATmH,GACFqB,EAAQQ,QAAQ7B,GACTgQ,GAGFtb,EAAKqP,UAAYzC,EAAGtB,GAAQgD,EAAahD,KAGlDnH,EAAO,EAEAnE,EAAKqP,YAAcrP,EAAKwN,OAAOmC,KAAK3P,EAAKS,MAAMmP,MAClDc,EAAIpF,GACJwP,EACAS,EAA4BjQ,GAC5BkQ,EAAwBlQ,IAGjB,KAATA,GAAeS,EAAkBT,IACnCqB,EAAQQ,QAAQ7B,GAChByP,GAAUnS,OAAO6D,aAAanB,GACvB6P,GAGFzK,EAAIpF,EACb,CAGA,SAASgQ,EAAiBhQ,GACxB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTtL,EAAKqP,UAAYzC,EAAK0B,GAGxBoC,EAAIpF,EACb,CAGA,SAASkQ,EAAwBlQ,GAC/B,OAAIe,EAAcf,IAChBqB,EAAQQ,QAAQ7B,GACTkQ,GAGFC,EAAYnQ,EACrB,CAGA,SAASiQ,EAA4BjQ,GACnC,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTmQ,GAGI,KAATnQ,GAAwB,KAATA,GAAeK,EAAWL,IAC3CqB,EAAQQ,QAAQ7B,GACToQ,GAGLrP,EAAcf,IAChBqB,EAAQQ,QAAQ7B,GACTiQ,GAGFE,EAAYnQ,EACrB,CAGA,SAASoQ,EAAsBpQ,GAC7B,OACW,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACAS,EAAkBT,IAElBqB,EAAQQ,QAAQ7B,GACToQ,GAGFC,EAA2BrQ,EACpC,CAGA,SAASqQ,EAA2BrQ,GAClC,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTsQ,GAGLvP,EAAcf,IAChBqB,EAAQQ,QAAQ7B,GACTqQ,GAGFJ,EAA4BjQ,EACrC,CAGA,SAASsQ,EAA6BtQ,GACpC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,EAEOoF,EAAIpF,GAGA,KAATA,GAAwB,KAATA,GACjBqB,EAAQQ,QAAQ7B,GAChB4L,EAAS5L,EACFuQ,GAGLxP,EAAcf,IAChBqB,EAAQQ,QAAQ7B,GACTsQ,IAGT1E,EAAS,KACF4E,EAA+BxQ,GACxC,CAGA,SAASuQ,EAA6BvQ,GACpC,OAAa,OAATA,GAAiBc,EAAmBd,GAC/BoF,EAAIpF,GAGTA,IAAS4L,GACXvK,EAAQQ,QAAQ7B,GACTyQ,IAGTpP,EAAQQ,QAAQ7B,GACTuQ,EACT,CAGA,SAASC,EAA+BxQ,GACtC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACAa,EAA0Bb,GAEnBqQ,EAA2BrQ,IAGpCqB,EAAQQ,QAAQ7B,GACTwQ,EACT,CAGA,SAASC,EAAkCzQ,GACzC,OAAa,KAATA,GAAwB,KAATA,GAAee,EAAcf,GACvCiQ,EAA4BjQ,GAG9BoF,EAAIpF,EACb,CAGA,SAASmQ,EAAYnQ,GACnB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT0Q,GAGFtL,EAAIpF,EACb,CAGA,SAAS0Q,EAAc1Q,GACrB,OAAIe,EAAcf,IAChBqB,EAAQQ,QAAQ7B,GACT0Q,GAGO,OAAT1Q,GAAiBc,EAAmBd,GACvCgD,EAAahD,GACboF,EAAIpF,EACV,CAGA,SAASgD,EAAahD,GACpB,OAAa,KAATA,GAAwB,IAATnH,GACjBwI,EAAQQ,QAAQ7B,GACT2Q,GAGI,KAAT3Q,GAAwB,IAATnH,GACjBwI,EAAQQ,QAAQ7B,GACT4Q,GAGI,KAAT5Q,GAAwB,IAATnH,GACjBwI,EAAQQ,QAAQ7B,GACT6Q,GAGI,KAAT7Q,GAAwB,IAATnH,GACjBwI,EAAQQ,QAAQ7B,GACT4P,GAGI,KAAT5P,GAAwB,IAATnH,GACjBwI,EAAQQ,QAAQ7B,GACT8Q,IAGLhQ,EAAmBd,IAAmB,IAATnH,GAAuB,IAATA,EAQlC,OAATmH,GAAiBc,EAAmBd,GAC/B+Q,EAAyB/Q,IAGlCqB,EAAQQ,QAAQ7B,GACTgD,GAZE3B,EAAQ4C,MACb+M,GACAH,EACAE,EAHK1P,CAILrB,EASN,CAGA,SAAS+Q,EAAyB/Q,GAEhC,OADAqB,EAAQS,KAAK,gBACNmP,EAAkBjR,EAC3B,CAGA,SAASiR,EAAkBjR,GACzB,OAAa,OAATA,EACKjE,EAAKiE,GAGVc,EAAmBd,GACdqB,EAAQY,QACb,CACEF,SAAUmP,EACVxL,SAAS,GAEXuL,EACAlV,EANKsF,CAOLrB,IAGJqB,EAAQM,MAAM,gBACPqB,EAAahD,GACtB,CAGA,SAASkR,EAAY7P,EAASC,EAAI8D,GAChC,OAGA,SAAepF,GAIb,OAHAqB,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACNM,CACT,EAGA,SAASA,EAAUpC,GACjB,OAAOtL,EAAKwN,OAAOmC,KAAK3P,EAAKS,MAAMmP,MAAQc,EAAIpF,GAAQsB,EAAGtB,EAC5D,CACF,CAGA,SAAS2Q,EAA0B3Q,GACjC,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT4P,GAGF5M,EAAahD,EACtB,CAGA,SAAS4Q,EAAuB5Q,GAC9B,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GAChByP,EAAS,GACF0B,GAGFnO,EAAahD,EACtB,CAGA,SAASmR,EAAsBnR,GAC7B,OAAa,KAATA,GAAesP,GAAa9J,SAASiK,EAAOvB,gBAC9C7M,EAAQQ,QAAQ7B,GACT6Q,GAGLxQ,EAAWL,IAASyP,EAAO1e,OAAS,GACtCsQ,EAAQQ,QAAQ7B,GAChByP,GAAUnS,OAAO6D,aAAanB,GACvBmR,GAGFnO,EAAahD,EACtB,CAGA,SAAS8Q,EAAgC9Q,GACvC,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT4P,GAGF5M,EAAahD,EACtB,CAGA,SAAS4P,EAA8B5P,GACrC,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT6Q,GAGI,KAAT7Q,GAAwB,IAATnH,GACjBwI,EAAQQ,QAAQ7B,GACT4P,GAGF5M,EAAahD,EACtB,CAGA,SAAS6Q,EAAkB7Q,GACzB,OAAa,OAATA,GAAiBc,EAAmBd,IACtCqB,EAAQS,KAAK,gBACN/F,EAAKiE,KAGdqB,EAAQQ,QAAQ7B,GACT6Q,EACT,CAGA,SAAS9U,EAAKiE,GAEZ,OADAqB,EAAQS,KAAK,YACNR,EAAGtB,EACZ,CACF,EA7gBE0L,UAWF,SAA2BpI,GACzB,IAAItE,EAAQsE,EAAOvS,OAEnB,KAAOiO,MACoB,UAArBsE,EAAOtE,GAAO,IAA4C,aAA1BsE,EAAOtE,GAAO,GAAG1J,QAcvD,OATI0J,EAAQ,GAAmC,eAA9BsE,EAAOtE,EAAQ,GAAG,GAAG1J,OAEpCgO,EAAOtE,GAAO,GAAGE,MAAQoE,EAAOtE,EAAQ,GAAG,GAAGE,MAE9CoE,EAAOtE,EAAQ,GAAG,GAAGE,MAAQoE,EAAOtE,EAAQ,GAAG,GAAGE,MAElDoE,EAAOrE,OAAOD,EAAQ,EAAG,IAGpBsE,CACT,EA7BEO,UAAU,GAINmN,GAAqB,CACzBjP,SA0gBF,SAA2BV,EAASC,EAAI8D,GACtC,OAGA,SAAepF,GAKb,OAJAqB,EAAQS,KAAK,gBACbT,EAAQM,MAAM,mBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,mBACNT,EAAQY,QAAQwD,EAAWnE,EAAI8D,EACxC,CACF,EAphBEM,SAAS,GCfE0L,GAAa,CACxBle,KAAM,aACN6O,SAKF,SAA4BV,EAASC,EAAI8D,GACvC,MAAM1Q,EAAOjE,KAGP4gB,EAAwB,CAC5BtP,SAuKF,SAA8BV,EAASC,EAAI8D,GACzC,IAAI1D,EAAO,EACX,OAAON,EACLC,GASF,SAA8BrB,GAG5B,OAFAqB,EAAQM,MAAM,mBACdN,EAAQM,MAAM,2BACPuN,EAAgBlP,EACzB,GAXE,aACAvP,KAAKyR,OAAOjC,WAAWqF,QAAQC,KAAKC,SAAS,qBACzCjU,EACA,GAWN,SAAS2d,EAAgBlP,GACvB,OAAIA,IAAS4L,GACXvK,EAAQQ,QAAQ7B,GAChB0B,IACOwN,GAGLxN,EAAO4P,EAAiBlM,EAAIpF,IAChCqB,EAAQS,KAAK,2BACNV,EAAaC,EAAS8N,EAAoB,aAA1C/N,CAAwDpB,GACjE,CAGA,SAASmP,EAAmBnP,GAC1B,OAAa,OAATA,GAAiBc,EAAmBd,IACtCqB,EAAQS,KAAK,mBACNR,EAAGtB,IAGLoF,EAAIpF,EACb,CACF,EA9ME0F,SAAS,GAIL6L,EAAc,CAClBxP,SA8IF,SAA6BV,EAASC,EAAI8D,GACxC,MAAM1Q,EAAOjE,KACb,OAGA,SAAeuP,GAIb,OAHAqB,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACNM,CACT,EAGA,SAASA,EAAUpC,GACjB,OAAOtL,EAAKwN,OAAOmC,KAAK3P,EAAKS,MAAMmP,MAAQc,EAAIpF,GAAQsB,EAAGtB,EAC5D,CACF,EA7JE0F,SAAS,GAEL4B,EAAO7W,KAAK6S,OAAO7S,KAAK6S,OAAOvS,OAAS,GACxCygB,EACJlK,GAAyB,eAAjBA,EAAK,GAAGhS,KACZgS,EAAK,GAAGC,eAAeD,EAAK,IAAI,GAAMvW,OACtC,EACN,IAGI6a,EAHA0F,EAAW,EAIf,OAGA,SAAetR,GAKb,OAJAqB,EAAQM,MAAM,cACdN,EAAQM,MAAM,mBACdN,EAAQM,MAAM,2BACdiK,EAAS5L,EACFyR,EAAazR,EACtB,EAGA,SAASyR,EAAazR,GACpB,OAAIA,IAAS4L,GACXvK,EAAQQ,QAAQ7B,GAChBsR,IACOG,IAGTpQ,EAAQS,KAAK,2BACNwP,EAAW,EACdlM,EAAIpF,GACJoB,EAAaC,EAASqQ,EAAU,aAAhCtQ,CAA8CpB,GACpD,CAGA,SAAS0R,EAAS1R,GAChB,OAAa,OAATA,GAAiBc,EAAmBd,GAC/B2R,EAAU3R,IAGnBqB,EAAQM,MAAM,uBACdN,EAAQM,MAAM,cAAe,CAC3BY,YAAa,WAER1G,EAAKmE,GACd,CAGA,SAASnE,EAAKmE,GACZ,OAAa,OAATA,GAAiBa,EAA0Bb,IAC7CqB,EAAQS,KAAK,eACbT,EAAQS,KAAK,uBACNV,EAAaC,EAASuQ,EAAW,aAAjCxQ,CAA+CpB,IAG3C,KAATA,GAAeA,IAAS4L,EAAexG,EAAIpF,IAC/CqB,EAAQQ,QAAQ7B,GACTnE,EACT,CAGA,SAAS+V,EAAU5R,GACjB,OAAa,OAATA,GAAiBc,EAAmBd,GAC/B2R,EAAU3R,IAGnBqB,EAAQM,MAAM,uBACdN,EAAQM,MAAM,cAAe,CAC3BY,YAAa,WAERsP,EAAK7R,GACd,CAGA,SAAS6R,EAAK7R,GACZ,OAAa,OAATA,GAAiBc,EAAmBd,IACtCqB,EAAQS,KAAK,eACbT,EAAQS,KAAK,uBACN6P,EAAU3R,IAGN,KAATA,GAAeA,IAAS4L,EAAexG,EAAIpF,IAC/CqB,EAAQQ,QAAQ7B,GACT6R,EACT,CAGA,SAASF,EAAU3R,GAEjB,OADAqB,EAAQS,KAAK,mBACNpN,EAAKqP,UAAYzC,EAAGtB,GAAQgC,EAAahC,EAClD,CAGA,SAASgC,EAAahC,GACpB,OAAa,OAATA,EACK2M,EAAM3M,GAGXc,EAAmBd,GACdqB,EAAQY,QACbsP,EACAlQ,EAAQY,QACNoP,EACA1E,EACA6E,EACIpQ,EACEC,EACAW,EACA,aACAwP,EAAgB,GAElBxP,GAEN2K,EAdKtL,CAeLrB,IAGJqB,EAAQM,MAAM,iBACPyF,EAAgBpH,GACzB,CAGA,SAASoH,EAAgBpH,GACvB,OAAa,OAATA,GAAiBc,EAAmBd,IACtCqB,EAAQS,KAAK,iBACNE,EAAahC,KAGtBqB,EAAQQ,QAAQ7B,GACToH,EACT,CAGA,SAASuF,EAAM3M,GAEb,OADAqB,EAAQS,KAAK,cACNR,EAAGtB,EACZ,CA+DF,EAzNE6D,UAAU,GCZN,GAAUwB,SAASyM,cAAc,KAMhC,SAASC,GAA8B1e,GAC5C,MAAM2e,EAAqB,IAAM3e,EAAQ,IACzC,GAAQ4e,UAAYD,EACpB,MAAME,EAAO,GAAQC,YAUrB,OAAyC,KAArCD,EAAKxJ,WAAWwJ,EAAKnhB,OAAS,IAAiC,SAAVsC,IAQlD6e,IAASF,GAA6BE,CAC/C,CCjBO,MAAMF,GAAqB,CAChC9e,KAAM,qBACN6O,SAIF,SAAoCV,EAASC,EAAI8D,GAC/C,MAAM1Q,EAAOjE,KACb,IAGIuE,EAGAc,EANA4L,EAAO,EAOX,OAGA,SAAe1B,GAKb,OAJAqB,EAAQM,MAAM,sBACdN,EAAQM,MAAM,4BACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,4BACN4K,CACT,EAGA,SAASA,EAAK1M,GACZ,OAAa,KAATA,GACFqB,EAAQM,MAAM,mCACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,mCACNsQ,IAGT/Q,EAAQM,MAAM,2BACd3M,EAAM,GACNc,EAAO2K,EACApN,EAAM2M,GACf,CAGA,SAASoS,EAAQpS,GACf,OAAa,KAATA,GAAwB,MAATA,GACjBqB,EAAQM,MAAM,uCACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,uCACbT,EAAQM,MAAM,2BACd3M,EAAM,EACNc,EAAO0K,EACAnN,IAGTgO,EAAQM,MAAM,2BACd3M,EAAM,EACNc,EAAOyK,EACAlN,EAAM2M,GACf,CAGA,SAAS3M,EAAM2M,GAEb,IAAIsC,EAEJ,OAAa,KAATtC,GAAe0B,GACjBY,EAAQjB,EAAQS,KAAK,2BAGnBhM,IAAS2K,GACRsR,GAA8Brd,EAAK6S,eAAejF,KAKrDjB,EAAQM,MAAM,4BACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,4BACbT,EAAQS,KAAK,sBACNR,GAPE8D,EAAIpF,IAUXlK,EAAKkK,IAAS0B,IAAS1M,GACzBqM,EAAQQ,QAAQ7B,GACT3M,GAGF+R,EAAIpF,EACb,CACF,GC/FaqS,GAAkB,CAC7Bnf,KAAM,kBACN6O,SAIF,SAAiCV,EAASC,EAAI8D,GAC5C,OAGA,SAAepF,GAKb,OAJAqB,EAAQM,MAAM,mBACdN,EAAQM,MAAM,gBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,gBACN4K,CACT,EAGA,SAASA,EAAK1M,GACZ,OAAIU,EAAiBV,IACnBqB,EAAQM,MAAM,wBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,wBACbT,EAAQS,KAAK,mBACNR,GAGF8D,EAAIpF,EACb,CACF,GC7BasS,GAAa,CACxBpf,KAAM,aACN6O,SAIF,SAA4BV,EAASC,GACnC,OAGA,SAAetB,GAIb,OAHAqB,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACNV,EAAaC,EAASC,EAAI,aACnC,CACF,GCNaiR,GAAW,CACtBrf,KAAM,WACN6O,SAgJF,SAA0BV,EAASC,EAAI8D,GACrC,MAAM1Q,EAAOjE,KACb,IAGI+hB,EAGAhE,EANAxP,EAAQtK,EAAK4O,OAAOvS,OAQxB,KAAOiO,KACL,IACkC,eAA/BtK,EAAK4O,OAAOtE,GAAO,GAAG1J,MACU,cAA/BZ,EAAK4O,OAAOtE,GAAO,GAAG1J,QACvBZ,EAAK4O,OAAOtE,GAAO,GAAGyT,UACvB,CACAD,EAAa9d,EAAK4O,OAAOtE,GAAO,GAChC,KACF,CAGF,OAGA,SAAegB,GACb,OAAKwS,EAIDA,EAAWE,UAAkBC,EAAS3S,IAC1CwO,EAAU9Z,EAAKwN,OAAOsM,QAAQhJ,SAC5ByI,GACEvZ,EAAK6S,eAAe,CAClBrI,MAAOsT,EAAWnT,IAClBA,IAAK3K,EAAKS,UAIhBkM,EAAQM,MAAM,YACdN,EAAQM,MAAM,eACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,eACbT,EAAQS,KAAK,YACN8Q,GAjBExN,EAAIpF,EAkBf,EAGA,SAAS4S,EAAc5S,GAErB,OAAa,KAATA,EACKqB,EAAQY,QACb4Q,GACAvR,EACAkN,EAAUlN,EAAKqR,EAHVtR,CAILrB,GAGS,KAATA,EACKqB,EAAQY,QACb6Q,GACAxR,EACAkN,EACInN,EAAQY,QAAQ8Q,GAA6BzR,EAAIqR,GACjDA,EALCtR,CAMLrB,GAGGwO,EAAUlN,EAAGtB,GAAQ2S,EAAS3S,EACvC,CAGA,SAAS2S,EAAS3S,GAEhB,OADAwS,EAAWC,WAAY,EAChBrN,EAAIpF,EACb,CACF,EA1NE0L,UA6CF,SAA2BpI,EAAQiD,GACjC,IAIIjE,EAGAoK,EAGAsG,EAGA7hB,EAbA6N,EAAQsE,EAAOvS,OACfwT,EAAS,EAcb,KAAOvF,KAGL,GAFAsD,EAAQgB,EAAOtE,GAAO,GAElB0N,EAAM,CAER,GACiB,SAAfpK,EAAMhN,MACU,cAAfgN,EAAMhN,MAAwBgN,EAAMoQ,UAErC,MAIuB,UAArBpP,EAAOtE,GAAO,IAAiC,cAAfsD,EAAMhN,OACxCgN,EAAMoQ,WAAY,EAEtB,MAAO,GAAIM,GACT,GACuB,UAArB1P,EAAOtE,GAAO,KACE,eAAfsD,EAAMhN,MAAwC,cAAfgN,EAAMhN,QACrCgN,EAAMmQ,YAEP/F,EAAO1N,EAEY,cAAfsD,EAAMhN,MAAsB,CAC9BiP,EAAS,EACT,KACF,MAEsB,aAAfjC,EAAMhN,OACf0d,EAAQhU,GAIZ,MAAMiU,EAAQ,CACZ3d,KAA+B,cAAzBgO,EAAOoJ,GAAM,GAAGpX,KAAuB,OAAS,QACtD4J,MAAOpN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOoJ,GAAM,GAAGxN,OACzCG,IAAKvN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOA,EAAOvS,OAAS,GAAG,GAAGsO,MAEhDoO,EAAQ,CACZnY,KAAM,QACN4J,MAAOpN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOoJ,GAAM,GAAGxN,OACzCG,IAAKvN,OAAO4R,OAAO,CAAC,EAAGJ,EAAO0P,GAAO,GAAG3T,MAEpC4I,EAAO,CACX3S,KAAM,YACN4J,MAAOpN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOoJ,EAAOnI,EAAS,GAAG,GAAGlF,KACtDA,IAAKvN,OAAO4R,OAAO,CAAC,EAAGJ,EAAO0P,EAAQ,GAAG,GAAG9T,QA+B9C,OA7BA/N,EAAQ,CACN,CAAC,QAAS8hB,EAAO1M,GACjB,CAAC,QAASkH,EAAOlH,IAGnBpV,EAAQS,EAAKT,EAAOmS,EAAOvN,MAAM2W,EAAO,EAAGA,EAAOnI,EAAS,IAE3DpT,EAAQS,EAAKT,EAAO,CAAC,CAAC,QAAS8W,EAAM1B,KAErCpV,EAAQS,EACNT,EACAyW,EACErB,EAAQrE,OAAOjC,WAAWiT,WAAW3N,KACrCjC,EAAOvN,MAAM2W,EAAOnI,EAAS,EAAGyO,EAAQ,GACxCzM,IAIJpV,EAAQS,EAAKT,EAAO,CAClB,CAAC,OAAQ8W,EAAM1B,GACfjD,EAAO0P,EAAQ,GACf1P,EAAO0P,EAAQ,GACf,CAAC,OAAQvF,EAAOlH,KAGlBpV,EAAQS,EAAKT,EAAOmS,EAAOvN,MAAMid,EAAQ,IAEzC7hB,EAAQS,EAAKT,EAAO,CAAC,CAAC,OAAQ8hB,EAAO1M,KACrCtH,EAAOqE,EAAQoJ,EAAMpJ,EAAOvS,OAAQI,GAC7BmS,CACT,EA3IEsE,WAmBF,SAA4BtE,GAC1B,IAGIhB,EAHAtD,GAAS,EAKb,OAASA,EAAQsE,EAAOvS,QACtBuR,EAAQgB,EAAOtE,GAAO,GAGL,eAAfsD,EAAMhN,MACS,cAAfgN,EAAMhN,MACS,aAAfgN,EAAMhN,OAGNgO,EAAOrE,OAAOD,EAAQ,EAAkB,eAAfsD,EAAMhN,KAAwB,EAAI,GAC3DgN,EAAMhN,KAAO,OACb0J,KAIJ,OAAOsE,CACT,GArCMuP,GAAoB,CACxB9Q,SAuNF,SAA0BV,EAASC,EAAI8D,GACrC,OAGA,SAAepF,GAKb,OAJAqB,EAAQM,MAAM,YACdN,EAAQM,MAAM,kBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,kBACNkM,GAAkB3M,EAASqL,EACpC,EAGA,SAASA,EAAK1M,GACZ,OAAa,KAATA,EACKX,EAAIW,GAGN4M,EACLvL,EACA8R,EACA/N,EACA,sBACA,6BACA,mCACA,yBACA,4BACA,GATKwH,CAUL5M,EACJ,CAGA,SAASmT,EAAiBnT,GACxB,OAAOa,EAA0Bb,GAC7BgO,GAAkB3M,EAAS+R,EAA3BpF,CAAoChO,GACpCX,EAAIW,EACV,CAGA,SAASoT,EAAQpT,GACf,OAAa,KAATA,GAAwB,KAATA,GAAwB,KAATA,EACzB2N,EACLtM,EACA2M,GAAkB3M,EAAShC,GAC3B+F,EACA,gBACA,sBACA,sBANKuI,CAOL3N,GAGGX,EAAIW,EACb,CAGA,SAASX,EAAIW,GACX,OAAa,KAATA,GACFqB,EAAQM,MAAM,kBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,kBACbT,EAAQS,KAAK,YACNR,GAGF8D,EAAIpF,EACb,CACF,GArRM8S,GAAyB,CAC7B/Q,SAuRF,SAA+BV,EAASC,EAAI8D,GAC1C,MAAM1Q,EAAOjE,KACb,OAGA,SAAeuP,GACb,OAAOuN,EAAa/a,KAClBkC,EACA2M,EACAgS,EACAjO,EACA,YACA,kBACA,kBAPKmI,CAQLvN,EACJ,EAGA,SAASqT,EAAWrT,GAClB,OAAOtL,EAAKwN,OAAOsM,QAAQhJ,SACzByI,GACEvZ,EAAK6S,eAAe7S,EAAK4O,OAAO5O,EAAK4O,OAAOvS,OAAS,GAAG,IAAIgF,MAAM,GAAI,KAGtEuL,EAAGtB,GACHoF,EAAIpF,EACV,CACF,GA9SM+S,GAA8B,CAClChR,SAgTF,SAAoCV,EAASC,EAAI8D,GAC/C,OAGA,SAAepF,GAKb,OAJAqB,EAAQM,MAAM,aACdN,EAAQM,MAAM,mBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,mBACN4K,CACT,EAGA,SAASA,EAAK1M,GACZ,OAAa,KAATA,GACFqB,EAAQM,MAAM,mBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,mBACbT,EAAQS,KAAK,aACNR,GAGF8D,EAAIpF,EACb,CACF,GCzVO,SAASsT,GAAkBtT,GAChC,OACW,OAATA,GACAa,EAA0Bb,IAC1BgB,EAAkBhB,GAEX,EAGLiB,EAAmBjB,GACd,OADT,CAGF,CClBO,MAAMuT,GAAY,CACvBrgB,KAAM,YACN6O,SAwKF,SAA2BV,EAASC,GAClC,MAAMkS,EAAmB/iB,KAAKyR,OAAOjC,WAAWuT,iBAAiBjO,KAC3DlD,EAAW5R,KAAK4R,SAChBlC,EAASmT,GAAkBjR,GAGjC,IAAIuJ,EACJ,OAGA,SAAe5L,GAGb,OAFAqB,EAAQM,MAAM,qBACdiK,EAAS5L,EACF6L,EAAS7L,EAClB,EAGA,SAAS6L,EAAS7L,GAChB,GAAIA,IAAS4L,EAEX,OADAvK,EAAQQ,QAAQ7B,GACT6L,EAGT,MAAMvJ,EAAQjB,EAAQS,KAAK,qBACrB6K,EAAQ2G,GAAkBtT,GAC1B0M,GACHC,GAAoB,IAAVA,GAAexM,GAAWqT,EAAiBhO,SAASxF,GAC3DgT,GACH7S,GAAsB,IAAXA,GAAgBwM,GAAU6G,EAAiBhO,SAASnD,GAGlE,OAFAC,EAAMmR,MAAQ9U,QAAmB,KAAXiN,EAAgBc,EAAOA,IAASvM,IAAW6S,IACjE1Q,EAAMoR,OAAS/U,QAAmB,KAAXiN,EAAgBoH,EAAQA,IAAUrG,IAAUD,IAC5DpL,EAAGtB,EACZ,CACF,EAxME4H,WAQF,SAA6BtE,EAAQiD,GACnC,IAGImG,EAGAuG,EAGAhL,EAGA0L,EAGAzE,EAGA0E,EAGAC,EAGAtP,EAxBAvF,GAAS,EA6Bb,OAASA,EAAQsE,EAAOvS,QAEtB,GACuB,UAArBuS,EAAOtE,GAAO,IACY,sBAA1BsE,EAAOtE,GAAO,GAAG1J,MACjBgO,EAAOtE,GAAO,GAAG0U,OAIjB,IAFAhH,EAAO1N,EAEA0N,KAEL,GACsB,SAApBpJ,EAAOoJ,GAAM,IACY,sBAAzBpJ,EAAOoJ,GAAM,GAAGpX,MAChBgO,EAAOoJ,GAAM,GAAG+G,OAChBlN,EAAQgB,eAAejE,EAAOoJ,GAAM,IAAIhE,WAAW,KACjDnC,EAAQgB,eAAejE,EAAOtE,GAAO,IAAI0J,WAAW,GACtD,CAKA,IACGpF,EAAOoJ,GAAM,GAAGgH,QAAUpQ,EAAOtE,GAAO,GAAGyU,SAC3CnQ,EAAOtE,GAAO,GAAGK,IAAIkF,OAASjB,EAAOtE,GAAO,GAAGE,MAAMqF,QAAU,MAE7DjB,EAAOoJ,GAAM,GAAGrN,IAAIkF,OACnBjB,EAAOoJ,GAAM,GAAGxN,MAAMqF,OACtBjB,EAAOtE,GAAO,GAAGK,IAAIkF,OACrBjB,EAAOtE,GAAO,GAAGE,MAAMqF,QACzB,GAGF,SAGFqP,EACEtQ,EAAOoJ,GAAM,GAAGrN,IAAIkF,OAASjB,EAAOoJ,GAAM,GAAGxN,MAAMqF,OAAS,GAC5DjB,EAAOtE,GAAO,GAAGK,IAAIkF,OAASjB,EAAOtE,GAAO,GAAGE,MAAMqF,OAAS,EAC1D,EACA,EACN,MAAMrF,EAAQpN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOoJ,GAAM,GAAGrN,KAC1CA,EAAMvN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOtE,GAAO,GAAGE,OAC/C4U,GAAU5U,GAAQ0U,GAClBE,GAAUzU,EAAKuU,GACfD,EAAkB,CAChBre,KAAMse,EAAM,EAAI,iBAAmB,mBACnC1U,QACAG,IAAKvN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOoJ,GAAM,GAAGrN,MAEzC6P,EAAkB,CAChB5Z,KAAMse,EAAM,EAAI,iBAAmB,mBACnC1U,MAAOpN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOtE,GAAO,GAAGE,OAC1CG,OAEF4I,EAAO,CACL3S,KAAMse,EAAM,EAAI,aAAe,eAC/B1U,MAAOpN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOoJ,GAAM,GAAGrN,KACzCA,IAAKvN,OAAO4R,OAAO,CAAC,EAAGJ,EAAOtE,GAAO,GAAGE,QAE1C+T,EAAQ,CACN3d,KAAMse,EAAM,EAAI,SAAW,WAC3B1U,MAAOpN,OAAO4R,OAAO,CAAC,EAAGiQ,EAAgBzU,OACzCG,IAAKvN,OAAO4R,OAAO,CAAC,EAAGwL,EAAgB7P,MAEzCiE,EAAOoJ,GAAM,GAAGrN,IAAMvN,OAAO4R,OAAO,CAAC,EAAGiQ,EAAgBzU,OACxDoE,EAAOtE,GAAO,GAAGE,MAAQpN,OAAO4R,OAAO,CAAC,EAAGwL,EAAgB7P,KAC3DwU,EAAa,GAETvQ,EAAOoJ,GAAM,GAAGrN,IAAIkF,OAASjB,EAAOoJ,GAAM,GAAGxN,MAAMqF,SACrDsP,EAAajiB,EAAKiiB,EAAY,CAC5B,CAAC,QAASvQ,EAAOoJ,GAAM,GAAInG,GAC3B,CAAC,OAAQjD,EAAOoJ,GAAM,GAAInG,MAI9BsN,EAAajiB,EAAKiiB,EAAY,CAC5B,CAAC,QAASZ,EAAO1M,GACjB,CAAC,QAASoN,EAAiBpN,GAC3B,CAAC,OAAQoN,EAAiBpN,GAC1B,CAAC,QAAS0B,EAAM1B,KAGlBsN,EAAajiB,EACXiiB,EACAjM,EACErB,EAAQrE,OAAOjC,WAAWiT,WAAW3N,KACrCjC,EAAOvN,MAAM2W,EAAO,EAAG1N,GACvBuH,IAIJsN,EAAajiB,EAAKiiB,EAAY,CAC5B,CAAC,OAAQ5L,EAAM1B,GACf,CAAC,QAAS2I,EAAiB3I,GAC3B,CAAC,OAAQ2I,EAAiB3I,GAC1B,CAAC,OAAQ0M,EAAO1M,KAGdjD,EAAOtE,GAAO,GAAGK,IAAIkF,OAASjB,EAAOtE,GAAO,GAAGE,MAAMqF,QACvDA,EAAS,EACTsP,EAAajiB,EAAKiiB,EAAY,CAC5B,CAAC,QAASvQ,EAAOtE,GAAO,GAAIuH,GAC5B,CAAC,OAAQjD,EAAOtE,GAAO,GAAIuH,MAG7BhC,EAAS,EAGXtF,EAAOqE,EAAQoJ,EAAO,EAAG1N,EAAQ0N,EAAO,EAAGmH,GAC3C7U,EAAQ0N,EAAOmH,EAAW9iB,OAASwT,EAAS,EAC5C,KACF,CAON,IAFAvF,GAAS,IAEAA,EAAQsE,EAAOvS,QACQ,sBAA1BuS,EAAOtE,GAAO,GAAG1J,OACnBgO,EAAOtE,GAAO,GAAG1J,KAAO,QAI5B,OAAOgO,CACT,GAgDA,SAASwQ,GAAUvQ,EAAOgB,GACxBhB,EAAMoF,QAAUpE,EAChBhB,EAAMgB,QAAUA,EAChBhB,EAAMsF,cAAgBtE,CACxB,CC7NO,MCGMwP,GAAW,CACtB7gB,KAAM,WACN6O,SAIF,SAA0BV,EAASC,EAAI8D,GACrC,MAAM1Q,EAAOjE,KAGb,IAAImb,EAGA6D,EAGAzQ,EAGA2L,EACJ,OAGA,SAAe3K,GAIb,OAHAqB,EAAQM,MAAM,YACdN,EAAQM,MAAM,gBACdN,EAAQQ,QAAQ7B,GACT0M,CACT,EAGA,SAASA,EAAK1M,GACZ,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTgU,GAGI,KAAThU,GACFqB,EAAQQ,QAAQ7B,GACT2P,GAGI,KAAT3P,GACFqB,EAAQQ,QAAQ7B,GACTiU,GAGL5T,EAAWL,IACbqB,EAAQQ,QAAQ7B,GACTkU,GAGF9O,EAAIpF,EACb,CAGA,SAASgU,EAAgBhU,GACvB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTmU,GAGI,KAATnU,GACFqB,EAAQQ,QAAQ7B,GAChByP,EAAS,SACTzQ,EAAQ,EACDoV,GAGL/T,EAAWL,IACbqB,EAAQQ,QAAQ7B,GACTqU,GAGFjP,EAAIpF,EACb,CAGA,SAASmU,EAAYnU,GACnB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTsU,GAGFlP,EAAIpF,EACb,CAGA,SAASsU,EAAatU,GACpB,OAAa,OAATA,GAA0B,KAATA,EACZoF,EAAIpF,GAGA,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTuU,GAGFC,EAAQxU,EACjB,CAGA,SAASuU,EAAiBvU,GACxB,OAAa,OAATA,GAA0B,KAATA,EACZoF,EAAIpF,GAGNwU,EAAQxU,EACjB,CAGA,SAASwU,EAAQxU,GACf,OAAa,OAATA,EACKoF,EAAIpF,GAGA,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTyU,GAGL3T,EAAmBd,IACrB2K,EAAc6J,EACPE,EAAa1U,KAGtBqB,EAAQQ,QAAQ7B,GACTwU,EACT,CAGA,SAASC,EAAazU,GACpB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTX,GAGFmV,EAAQxU,EACjB,CAGA,SAASoU,EAAUpU,GACjB,OAAIA,IAASyP,EAAO/G,WAAW1J,MAC7BqC,EAAQQ,QAAQ7B,GACThB,IAAUyQ,EAAO1e,OAAS4jB,EAAQP,GAGpChP,EAAIpF,EACb,CAGA,SAAS2U,EAAM3U,GACb,OAAa,OAATA,EACKoF,EAAIpF,GAGA,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT4U,GAGL9T,EAAmBd,IACrB2K,EAAcgK,EACPD,EAAa1U,KAGtBqB,EAAQQ,QAAQ7B,GACT2U,EACT,CAGA,SAASC,EAAW5U,GAClB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT6U,GAGFF,EAAM3U,EACf,CAGA,SAAS6U,EAAS7U,GAChB,OAAa,KAATA,EACKX,EAAIW,GAGA,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT6U,GAGFF,EAAM3U,EACf,CAGA,SAASqU,EAAYrU,GACnB,OAAa,OAATA,GAA0B,KAATA,EACZX,EAAIW,GAGTc,EAAmBd,IACrB2K,EAAc0J,EACPK,EAAa1U,KAGtBqB,EAAQQ,QAAQ7B,GACTqU,EACT,CAGA,SAASJ,EAAYjU,GACnB,OAAa,OAATA,EACKoF,EAAIpF,GAGA,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT8U,GAGLhU,EAAmBd,IACrB2K,EAAcsJ,EACPS,EAAa1U,KAGtBqB,EAAQQ,QAAQ7B,GACTiU,EACT,CAGA,SAASa,EAAiB9U,GACxB,OAAgB,KAATA,EAAcX,EAAIW,GAAQiU,EAAYjU,EAC/C,CAGA,SAAS2P,EAAc3P,GACrB,OAAIK,EAAWL,IACbqB,EAAQQ,QAAQ7B,GACT+U,GAGF3P,EAAIpF,EACb,CAGA,SAAS+U,EAAS/U,GAChB,OAAa,KAATA,GAAeS,EAAkBT,IACnCqB,EAAQQ,QAAQ7B,GACT+U,GAGFC,EAAgBhV,EACzB,CAGA,SAASgV,EAAgBhV,GACvB,OAAIc,EAAmBd,IACrB2K,EAAcqK,EACPN,EAAa1U,IAGlBe,EAAcf,IAChBqB,EAAQQ,QAAQ7B,GACTgV,GAGF3V,EAAIW,EACb,CAGA,SAASkU,EAAQlU,GACf,OAAa,KAATA,GAAeS,EAAkBT,IACnCqB,EAAQQ,QAAQ7B,GACTkU,GAGI,KAATlU,GAAwB,KAATA,GAAea,EAA0Bb,GACnDiV,EAAejV,GAGjBoF,EAAIpF,EACb,CAGA,SAASiV,EAAejV,GACtB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACTX,GAGI,KAATW,GAAwB,KAATA,GAAeK,EAAWL,IAC3CqB,EAAQQ,QAAQ7B,GACTkV,GAGLpU,EAAmBd,IACrB2K,EAAcsK,EACPP,EAAa1U,IAGlBe,EAAcf,IAChBqB,EAAQQ,QAAQ7B,GACTiV,GAGF5V,EAAIW,EACb,CAGA,SAASkV,EAAqBlV,GAC5B,OACW,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACAS,EAAkBT,IAElBqB,EAAQQ,QAAQ7B,GACTkV,GAGFC,EAA0BnV,EACnC,CAGA,SAASmV,EAA0BnV,GACjC,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACToV,GAGLtU,EAAmBd,IACrB2K,EAAcwK,EACPT,EAAa1U,IAGlBe,EAAcf,IAChBqB,EAAQQ,QAAQ7B,GACTmV,GAGFF,EAAejV,EACxB,CAGA,SAASoV,EAA4BpV,GACnC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,EAEOoF,EAAIpF,GAGA,KAATA,GAAwB,KAATA,GACjBqB,EAAQQ,QAAQ7B,GAChB4L,EAAS5L,EACFqV,GAGLvU,EAAmBd,IACrB2K,EAAcyK,EACPV,EAAa1U,IAGlBe,EAAcf,IAChBqB,EAAQQ,QAAQ7B,GACToV,IAGT/T,EAAQQ,QAAQ7B,GAChB4L,OAASra,EACF+jB,EACT,CAGA,SAASD,EAA4BrV,GACnC,OAAIA,IAAS4L,GACXvK,EAAQQ,QAAQ7B,GACTuV,GAGI,OAATvV,EACKoF,EAAIpF,GAGTc,EAAmBd,IACrB2K,EAAc0K,EACPX,EAAa1U,KAGtBqB,EAAQQ,QAAQ7B,GACTqV,EACT,CAGA,SAASE,EAAiCvV,GACxC,OAAa,KAATA,GAAwB,KAATA,GAAea,EAA0Bb,GACnDiV,EAAejV,GAGjBoF,EAAIpF,EACb,CAGA,SAASsV,EAA8BtV,GACrC,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,GACS,KAATA,EAEOoF,EAAIpF,GAGA,KAATA,GAAea,EAA0Bb,GACpCiV,EAAejV,IAGxBqB,EAAQQ,QAAQ7B,GACTsV,EACT,CAKA,SAASZ,EAAa1U,GAKpB,OAJAqB,EAAQS,KAAK,gBACbT,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACNV,EACLC,EACAsN,EACA,aACAja,EAAKwN,OAAOjC,WAAWqF,QAAQC,KAAKC,SAAS,qBACzCjU,EACA,EAER,CAGA,SAASod,EAAY3O,GAEnB,OADAqB,EAAQM,MAAM,gBACPgJ,EAAY3K,EACrB,CAGA,SAASX,EAAIW,GACX,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,gBACbT,EAAQS,KAAK,YACNR,GAGF8D,EAAIpF,EACb,CACF,GCndawV,GAAW,CACtBtiB,KAAM,WACN6O,SA0EF,SAA0BV,EAASC,EAAI8D,GAErC,IAGI1D,EAGAY,EANAgP,EAAW,EAOf,OAGA,SAAetR,GAGb,OAFAqB,EAAQM,MAAM,YACdN,EAAQM,MAAM,oBACPgS,EAAgB3T,EACzB,EAGA,SAAS2T,EAAgB3T,GACvB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GAChBsR,IACOqC,IAGTtS,EAAQS,KAAK,oBACN2T,EAAIzV,GACb,CAGA,SAASyV,EAAIzV,GAEX,OAAa,OAATA,EACKoF,EAAIpF,GAIA,KAATA,GACFsC,EAAQjB,EAAQM,MAAM,oBACtBD,EAAO,EACAwN,EAAgBlP,IAGZ,KAATA,GACFqB,EAAQM,MAAM,SACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,SACN2T,GAGL3U,EAAmBd,IACrBqB,EAAQM,MAAM,cACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,cACN2T,IAGTpU,EAAQM,MAAM,gBACPc,EAAKzC,GACd,CAIA,SAASyC,EAAKzC,GACZ,OACW,OAATA,GACS,KAATA,GACS,KAATA,GACAc,EAAmBd,IAEnBqB,EAAQS,KAAK,gBACN2T,EAAIzV,KAGbqB,EAAQQ,QAAQ7B,GACTyC,EACT,CAIA,SAASyM,EAAgBlP,GAEvB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GAChB0B,IACOwN,GAGLxN,IAAS4P,GACXjQ,EAAQS,KAAK,oBACbT,EAAQS,KAAK,YACNR,EAAGtB,KAGZsC,EAAMhN,KAAO,eACNmN,EAAKzC,GACd,CACF,EA3KExE,QAKF,SAAyB8H,GACvB,IAIItE,EAGA2C,EAPA+T,EAAgBpS,EAAOvS,OAAS,EAChC4kB,EAAiB,EAQrB,KACsC,eAAnCrS,EAAOqS,GAAgB,GAAGrgB,MACU,UAAnCgO,EAAOqS,GAAgB,GAAGrgB,MACO,eAAlCgO,EAAOoS,GAAe,GAAGpgB,MACU,UAAlCgO,EAAOoS,GAAe,GAAGpgB,MAI3B,IAFA0J,EAAQ2W,IAEC3W,EAAQ0W,GACf,GAA8B,iBAA1BpS,EAAOtE,GAAO,GAAG1J,KAAyB,CAE5CgO,EAAOqS,GAAgB,GAAGrgB,KAAO,kBACjCgO,EAAOoS,GAAe,GAAGpgB,KAAO,kBAChCqgB,GAAkB,EAClBD,GAAiB,EACjB,KACF,CAOJ,IAHA1W,EAAQ2W,EAAiB,EACzBD,MAES1W,GAAS0W,QACFnkB,IAAVoQ,EACE3C,IAAU0W,GAA2C,eAA1BpS,EAAOtE,GAAO,GAAG1J,OAC9CqM,EAAQ3C,GAGVA,IAAU0W,GACgB,eAA1BpS,EAAOtE,GAAO,GAAG1J,OAEjBgO,EAAO3B,GAAO,GAAGrM,KAAO,eAEpB0J,IAAU2C,EAAQ,IACpB2B,EAAO3B,GAAO,GAAGtC,IAAMiE,EAAOtE,EAAQ,GAAG,GAAGK,IAC5CiE,EAAOrE,OAAO0C,EAAQ,EAAG3C,EAAQ2C,EAAQ,GACzC+T,GAAiB1W,EAAQ2C,EAAQ,EACjC3C,EAAQ2C,EAAQ,GAGlBA,OAAQpQ,GAIZ,OAAO+R,CACT,EA5DEjB,SA+DF,SAAkBrC,GAEhB,OACW,KAATA,GACgD,oBAAhDvP,KAAK6S,OAAO7S,KAAK6S,OAAOvS,OAAS,GAAG,GAAGuE,IAE3C,GCxDa,GAAW,CACtB,GAAM/E,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,GAAMkc,GAIKtK,GAAiB,CAC5B,GAAMiM,IAIK3G,GAAc,CACzB,EAAE,GAAIgH,GACN,EAAE,GAAIA,GACN,GAAMA,IAIK,GAAO,CAClB,GAAMI,GACN,GAAMlD,EACN,GAAM,CAACqD,GAAiBrD,GACxB,GAAM4D,GACN,GAAMP,GACN,GAAMrD,EACN,GAAMyF,GACN,IAAOA,IAII,GAAS,CACpB,GAAMY,GACN,GAAMK,IAIK,GAAO,CAClB,EAAE,GAAIC,GACN,EAAE,GAAIA,GACN,EAAE,GAAIA,GACN,GCxE6B,CAC7Bpf,KAAM,kBACN6O,SAKF,SAAiCV,EAASC,EAAI8D,GAC5C,MAAM1Q,EAAOjE,KACb,OAGA,SAAeuP,GAKb,OAJAqB,EAAQM,MAAM,cACdN,EAAQM,MAAM,oBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,oBACN4K,CACT,EAGA,SAASA,EAAK1M,GACZ,OAAa,KAATA,GACFqB,EAAQM,MAAM,eACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,eACbT,EAAQS,KAAK,cACN6K,GAGFvH,EAAIpF,EACb,CAGA,SAAS2M,EAAM3M,GAQb,OAAgB,KAATA,GAAe,2BAA4BtL,EAAKwN,OAAOjC,WAC1DmF,EAAIpF,GACJsB,EAAGtB,EACT,CACF,EA3CE4H,WAAY2K,GAAS3K,YDsErB,GAAMoK,GACN,GAAMuB,GACN,GAAM,CHtEgB,CACtBrgB,KAAM,WACN6O,SAIF,SAA0BV,EAASC,EAAI8D,GACrC,IAAI1D,EAAO,EACX,OAGA,SAAe1B,GAMb,OALAqB,EAAQM,MAAM,YACdN,EAAQM,MAAM,kBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,kBACbT,EAAQM,MAAM,oBACP+K,CACT,EAGA,SAASA,EAAK1M,GACZ,OAAIK,EAAWL,IACbqB,EAAQQ,QAAQ7B,GACT4V,GAGFjV,EAAWX,GAAQ6V,EAAW7V,GAAQoF,EAAIpF,EACnD,CAGA,SAAS4V,EAAmB5V,GAC1B,OAAgB,KAATA,GAAwB,KAATA,GAAwB,KAATA,GAAeS,EAAkBT,GAClE8V,EAAyB9V,GACzB6V,EAAW7V,EACjB,CAGA,SAAS8V,EAAyB9V,GAChC,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GACT+V,IAIG,KAAT/V,GAAwB,KAATA,GAAwB,KAATA,GAAeS,EAAkBT,KAChE0B,IAAS,IAETL,EAAQQ,QAAQ7B,GACT8V,GAGFD,EAAW7V,EACpB,CAGA,SAAS+V,EAAU/V,GACjB,OAAa,KAATA,GACFqB,EAAQS,KAAK,oBACNzC,EAAIW,IAGA,OAATA,GAA0B,KAATA,GAAwB,KAATA,GAAeY,EAAaZ,GACvDoF,EAAIpF,IAGbqB,EAAQQ,QAAQ7B,GACT+V,EACT,CAGA,SAASF,EAAW7V,GAClB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GAChB0B,EAAO,EACAsU,GAGLrV,EAAWX,IACbqB,EAAQQ,QAAQ7B,GACT6V,GAGFzQ,EAAIpF,EACb,CAGA,SAASgW,EAAiBhW,GACxB,OAAOS,EAAkBT,GAAQiW,EAAWjW,GAAQoF,EAAIpF,EAC1D,CAGA,SAASiW,EAAWjW,GAClB,OAAa,KAATA,GACFqB,EAAQQ,QAAQ7B,GAChB0B,EAAO,EACAsU,GAGI,KAAThW,GAEFqB,EAAQS,KAAK,oBAAoBxM,KAAO,gBACjC+J,EAAIW,IAGNkW,EAAWlW,EACpB,CAGA,SAASkW,EAAWlW,GAClB,OAAc,KAATA,GAAeS,EAAkBT,KAAU0B,IAAS,IACvDL,EAAQQ,QAAQ7B,GACA,KAATA,EAAckW,EAAaD,GAG7B7Q,EAAIpF,EACb,CAGA,SAASX,EAAIW,GAKX,OAJAqB,EAAQM,MAAM,kBACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,kBACbT,EAAQS,KAAK,YACNR,CACT,CACF,GGxDmByS,IACjB,GE5E4B,CAC5B7gB,KAAM,iBACN6O,SAKF,SAAgCV,EAASC,EAAI8D,GAC3C,MAAM1Q,EAAOjE,KACb,OAGA,SAAeuP,GAMb,OALAqB,EAAQM,MAAM,aACdN,EAAQM,MAAM,eACdN,EAAQQ,QAAQ7B,GAChBqB,EAAQS,KAAK,eACbT,EAAQS,KAAK,aACN6K,CACT,EAGA,SAASA,EAAM3M,GAQb,OAAgB,KAATA,GAAe,2BAA4BtL,EAAKwN,OAAOjC,WAC1DmF,EAAIpF,GACJsB,EAAGtB,EACT,CACF,EA/BE4H,WAAY2K,GAAS3K,YF0ErB,GAAM,CG7EuB,CAC7B1U,KAAM,kBACN6O,SAIF,SAAiCV,EAASC,EAAI8D,GAC5C,OAGA,SAAepF,GAIb,OAHAqB,EAAQM,MAAM,mBACdN,EAAQM,MAAM,gBACdN,EAAQQ,QAAQ7B,GACT0M,CACT,EAGA,SAASA,EAAK1M,GACZ,OAAIc,EAAmBd,IACrBqB,EAAQS,KAAK,gBACbT,EAAQS,KAAK,mBACNR,EAAGtB,IAGLoF,EAAIpF,EACb,CACF,GHkD0BqS,IACxB,GAAME,GACN,GAAMgB,GACN,GAAMiC,IAIKtC,GAAa,CACxB3N,KAAM,CAACgO,GAAW,IAIPC,GAAmB,CAC9BjO,KAAM,CAAC,GAAI,KAIAD,GAAU,CACrBC,KAAM,IIzFR,MAAM4Q,GAAS,cCJR,SAASC,GAAgC/iB,EAAOuG,GACrD,MAAMoG,EAAOwB,OAAOlN,SAASjB,EAAOuG,GAEpC,OAEEoG,EAAO,GACE,KAATA,GACCA,EAAO,IAAMA,EAAO,IACpBA,EAAO,KAAOA,EAAO,KACrBA,EAAO,OAASA,EAAO,OACvBA,EAAO,OAASA,EAAO,OACL,QAAX,MAAPA,IACkB,QAAX,MAAPA,IACDA,EAAO,QAEA,IAGF1C,OAAO6D,aAAanB,EAC7B,CC3BA,MAAMqW,GACJ,oEAWK,SAASC,GAAajjB,GAC3B,OAAOA,EAAMuC,QAAQygB,GAA4BE,GACnD,CAQA,SAASA,GAAOC,EAAIC,EAAIC,GACtB,GAAID,EAEF,OAAOA,EAKT,GAAa,KAFAC,EAAGhO,WAAW,GAEV,CACf,MAAMiO,EAAOD,EAAGhO,WAAW,GACrBkO,EAAe,MAATD,GAAyB,KAATA,EAC5B,OAAOP,GAAgCM,EAAG3gB,MAAM6gB,EAAM,EAAI,GAAIA,EAAM,GAAK,GAC3E,CAEA,OAAO7E,GAA8B2E,IAAOF,CAC9C,CCHO,SAASK,GAAkBxjB,GAEhC,OAAKA,GAA0B,iBAAVA,EAKjB,aAAcA,GAAS,SAAUA,EAC5ByjB,GAASzjB,EAAMyjB,UAIpB,UAAWzjB,GAAS,QAASA,EACxByjB,GAASzjB,GAId,SAAUA,GAAS,WAAYA,EAC1BkQ,GAAMlQ,GAIR,GAnBE,EAoBX,CAMA,SAASkQ,GAAMA,GACb,OAAOvE,GAAMuE,GAASA,EAAMe,MAAQ,IAAMtF,GAAMuE,GAASA,EAAMoF,OACjE,CAMA,SAASmO,GAASC,GAChB,OAAOxT,GAAMwT,GAAOA,EAAI7X,OAAS,IAAMqE,GAAMwT,GAAOA,EAAI1X,IAC1D,CAMA,SAASL,GAAM3L,GACb,OAAOA,GAA0B,iBAAVA,EAAqBA,EAAQ,CACtD,CCwEA,MAAM2jB,GAAM,CAAC,EAAEhlB,eAYFilB,GAcX,SAAU5jB,EAAO6jB,EAAUjkB,GAKzB,MAJwB,iBAAbikB,IACTjkB,EAAUikB,EACVA,OAAW3lB,GAejB,SAAkB0B,GAEhB,MAAMkkB,EAAS,CACbC,WAAY,GACZC,eAAgB,CAAC,WAAY,WAAY,UAAW,YAAa,UACjE1V,MAAO,CACL2V,SAAUC,EAAOC,GACjBC,iBAAkBC,EAClBC,cAAeD,EACfE,WAAYL,EAAOnI,GACnB3C,WAAY8K,GAu6BhB,WACE,MAAO,CACLjiB,KAAM,aACNwJ,SAAU,GAEd,IA36BIuT,gBAAiBqF,EACjB1F,mBAAoB0F,EACpBtG,WAAYmG,EAAOM,GACnBC,oBAAqBrI,EACrBsI,oBAAqBtI,EACrBhB,aAAc8I,EAAOM,EAAUpI,GAC/B+F,SAAU+B,GAk7Bd,WACE,MAAO,CACLjiB,KAAM,aACNjC,MAAO,GAEX,GAv7B+Boc,GAC3BuI,aAAcN,EACdjV,KAAMiV,EACNO,cAAeP,EACftJ,WAAYmJ,GAs7BhB,WACE,MAAO,CACLjiB,KAAM,aACN+Y,WAAY,GACZZ,MAAO,KACPK,MAAO,KACPoK,IAAK,GAET,IA77BIC,4BAA6B1I,EAC7B2I,sBAAuB3I,EACvB4I,sBAAuB5I,EACvB6I,SAAUf,GA67Bd,WACE,MAAO,CACLjiB,KAAM,WACNwJ,SAAU,GAEd,IAj8BIyZ,gBAAiBhB,EAAOiB,GACxBC,kBAAmBlB,EAAOiB,GAC1BjJ,SAAUgI,EAAOmB,EAAMjJ,GACvBkJ,aAAcjB,EACd3D,SAAUwD,EAAOmB,EAAMjJ,GACvBmJ,aAAclB,EACdmB,MAAOtB,GAu9BX,WACE,MAAO,CACLjiB,KAAM,QACNwY,MAAO,KACPoK,IAAK,GACLrZ,IAAK,KAET,IA79BI4O,MAAOgC,EACP+H,KAAMD,EAAOC,GACbsB,SAAUvB,GA0/Bd,SAAkBjV,GAChB,MAAO,CACLhN,KAAM,WAENyjB,OAAQzW,EAAM0W,QACdC,QAAS,KACTna,SAAU,GAEd,IAjgCIoa,cAwdJ,SAA8B5W,GACxB6W,EAAQ,iCACO1oB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCmO,MAAQsC,OAAOlN,SAAS7D,KAAK8W,eAAejF,GAAQ,IAC7D8W,EAAQ,+BAEZ,EA7dIC,YAAa9B,EAAOhnB,GA+cxB,WACE6oB,EAAQ,+BAA+B,EACzC,IAhdIE,cAAe/B,EAAOhnB,GACtB0e,UAAWsI,GAigCf,WACE,MAAO,CACLjiB,KAAM,YACNwJ,SAAU,GAEd,IArgCIya,UAyzBJ,WACEH,EAAQ,gBAAiB,YAC3B,EA1zBII,gBAAiB/J,EACjBgK,0BAA2BhK,EAC3BiK,oBAAqBjK,EACrBkK,cAAepC,EAAOnI,GACtBwK,OAAQrC,GAmgCZ,WACE,MAAO,CACLjiB,KAAM,SACNwJ,SAAU,GAEd,IAvgCI6M,cAAe4L,GAkhCnB,WACE,MAAO,CACLjiB,KAAM,gBAEV,KAphCEwM,KAAM,CACJ8V,WAAYiC,IACZC,mBA2iBJ,SAAkCxX,GAChC,MAAM1D,EAAOnO,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAC5C,IAAK6N,EAAKmb,MAAO,CACf,MAAMA,EAAQtpB,KAAK8W,eAAejF,GAAOvR,OACzC6N,EAAKmb,MAAQA,CACf,CACF,EAhjBIzC,SAAUuC,IACVlC,cAk3BJ,SAA6BrV,GAC3B0X,EAAWxnB,KAAK/B,KAAM6R,GACT7R,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCmnB,IAAM,UAAYznB,KAAK8W,eAAejF,EAC7C,EAr3BImV,iBAu2BJ,SAAgCnV,GAC9B0X,EAAWxnB,KAAK/B,KAAM6R,GACT7R,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCmnB,IAAMznB,KAAK8W,eAAejF,EACjC,EA12BImK,WAAYoN,IACZI,qBAAsBD,EACtBE,oCAAqCC,EACrCC,gCAAiCD,EACjCE,wBA00BJ,SAAuC/X,GACrC,MAAMG,EAAOhS,KAAK8W,eAAejF,GAC3BhN,EAAO6jB,EAAQ,0BAErB,IAAI9lB,EACAiC,GACFjC,EAAQ+iB,GACN3T,EACS,oCAATnN,EAA6C,GAAK,IAEpD8jB,EAAQ,2BAGR/lB,EADe0e,GAA8BtP,GAG/C,MAAM6E,EAAO7W,KAAKiS,MAAMuE,MACxBK,EAAKjU,OAASA,EACdiU,EAAKwP,SAASzX,IAAM,GAAMiD,EAAMjD,IAClC,EA31BI+R,WAAYyI,GA4ehB,WACE,MAAMpX,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCsC,MAAQoP,EAAK7M,QAAQ,2BAA4B,IACtDwjB,EAAQ,iBACV,IAhfImB,gBAgeJ,WAEMpB,EAAQ,oBACZ1oB,KAAKgf,SACL2J,EAAQ,kBAAkB,GAC5B,EApeItB,oBA2cJ,WACE,MAAMrV,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCypB,KAAO/X,CACd,EA9cIsV,oBAodJ,WACE,MAAMtV,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvC8gB,KAAOpP,CACd,EAvdIwV,cAAe+B,EACfvL,aAAcoL,GAkflB,WACE,MAAMpX,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCsC,MAAQoP,EAAK7M,QAAQ,eAAgB,GAC5C,IArfI4f,SAAUqE,GAwpBd,WACE,MAAMpX,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCsC,MAAQoP,CACf,IA3pBIuV,aAAcgC,EACdvX,KAAMuX,EACN5L,WAAYyL,IACZ1B,4BA8gBJ,WACE,MAAM1V,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCmnB,IAAMzV,CACb,EAjhBI2V,sBAsfJ,SAAqC9V,GACnC,MAAMmL,EAAQhd,KAAK6pB,SACb1b,EAAOnO,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAC5C6N,EAAK6O,MAAQA,EACb7O,EAAKyP,WAAaJ,GAChBxd,KAAK8W,eAAejF,IACpB4L,aACJ,EA5fImK,sBAkgBJ,WACE,MAAM5V,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvC+c,MAAQrL,CACf,EArgBI6V,SAAUuB,IACVtB,gBAAiBsB,EAAOY,GACxBhC,kBAAmBoB,EAAOY,GAC1BlL,SAAUsK,GAwnBd,WACE,MAAMpX,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCsC,MAAQoP,CACf,IA3nBIkW,aAAcqB,EACdjG,SAAU8F,GAioBd,WACE,MAAMpX,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCsC,MAAQoP,CACf,IApoBImW,aAAcoB,EACdnB,MAAOgB,GAkrBX,WACE,MAAMjb,EAAOnO,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAK5C,GAAIooB,EAAQ,eAAgB,CAE1B,MAAMuB,EAAgBvB,EAAQ,kBAAoB,WAClDva,EAAKtJ,MAAQ,YAEbsJ,EAAK8b,cAAgBA,SAEd9b,EAAKsZ,WACLtZ,EAAKkP,KACd,aAESlP,EAAKyP,kBAELzP,EAAK6O,MAEd2L,EAAQ,gBACV,IAvsBI3L,MA6tBJ,WACE,MAAMkN,EAAWlqB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAC1CsC,EAAQ5C,KAAK6pB,SACb1b,EAAOnO,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAG5C,GADAqoB,EAAQ,eAAe,GACL,SAAdxa,EAAKtJ,KAAiB,CAGxB,MAAMwJ,EAAW6b,EAAS7b,SAC1BF,EAAKE,SAAWA,CAClB,MACEF,EAAKC,IAAMxL,CAEf,EA1uBIunB,UA6sBJ,SAAyBtY,GACvB,MAAMwF,EAASrX,KAAK8W,eAAejF,GAC7BuY,EAAWpqB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAGhD8pB,EAASpN,MAAQ6I,GAAaxO,GAE9B+S,EAASxM,WAAaJ,GAAoBnG,GAAQoG,aACpD,EAptBIoE,WAilBJ,SAA0BhQ,GACxB,MAAMiE,EAAU9V,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAE/C,GAAIooB,EAAQ,eAIV,OAHa5S,EAAQzH,SAASyH,EAAQzH,SAAS/N,OAAS,GACnD+lB,SAASzX,IAAM,GAAMiD,EAAMjD,UAChC+Z,EAAQ,gBAIPD,EAAQ,iCACThC,EAAOE,eAAe7R,SAASe,EAAQjR,QAEvCoiB,EAAYllB,KAAK/B,KAAM6R,GACvB0X,EAAWxnB,KAAK/B,KAAM6R,GAE1B,EAhmBIkV,KAAMqC,GAipBV,WACE,MAAMjb,EAAOnO,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAK5C,GAAIooB,EAAQ,eAAgB,CAE1B,MAAMuB,EAAgBvB,EAAQ,kBAAoB,WAClDva,EAAKtJ,MAAQ,YAEbsJ,EAAK8b,cAAgBA,SAEd9b,EAAKsZ,WACLtZ,EAAKkP,KACd,aAESlP,EAAKyP,kBAELzP,EAAK6O,MAEd2L,EAAQ,gBACV,IAtqBIN,SAAUe,IACVR,YAAaQ,IACbP,cAAeO,IACf5K,UAAW4K,IACXL,gBAkxBJ,SAA+BlX,GAC7B,MAAMmL,EAAQhd,KAAK6pB,SACb1b,EAAOnO,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAG5C6N,EAAK6O,MAAQA,EAEb7O,EAAKyP,WAAaJ,GAChBxd,KAAK8W,eAAejF,IACpB4L,cACFkL,EAAQ,gBAAiB,OAC3B,EA5xBIK,0BAyuBJ,WACE,MAAMhX,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCmnB,IAAMzV,CACb,EA5uBIiX,oBAmvBJ,WACE,MAAMjX,EAAOhS,KAAK6pB,SACL7pB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvC+c,MAAQrL,CACf,EAtvBIqY,SA6vBJ,WACE1B,EAAQ,cACV,EA9vBIO,cAAeE,GA8hBnB,WACET,EAAQ,+BACV,IA/hBI2B,0BAohBJ,SAAyCzY,GAC1B7R,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GACvCgpB,MAAqD,KAA7CtpB,KAAK8W,eAAejF,GAAOoG,WAAW,GAAY,EAAI,CACrE,EAthBIsS,kBA2gBJ,WACE5B,EAAQ,gCAAgC,EAC1C,EA5gBIQ,OAAQC,IACRlO,cAAekO,MAGnBoB,GAAU9D,GAASlkB,GAAW,CAAC,GAAGioB,iBAAmB,IAGrD,MAAMzY,EAAO,CAAC,EACd,OAUA,SAAiBa,GAEf,IAAI6X,EAAO,CACT7lB,KAAM,OACNwJ,SAAU,IAGZ,MAAMyH,EAAU,CACd7D,MAAO,CAACyY,GACRC,WAAY,GACZjE,SACAxV,QACAG,OACA2N,SACA6K,SACAlB,UACAD,WAGIkC,EAAY,GAClB,IAAIrc,GAAS,EACb,OAASA,EAAQsE,EAAOvS,QAIM,gBAA1BuS,EAAOtE,GAAO,GAAG1J,MACS,kBAA1BgO,EAAOtE,GAAO,GAAG1J,OAEQ,UAArBgO,EAAOtE,GAAO,GAChBqc,EAAUzpB,KAAKoN,GAGfA,EAAQsc,EAAYhY,EADP+X,EAAUpU,MACWjI,IAKxC,IADAA,GAAS,IACAA,EAAQsE,EAAOvS,QAAQ,CAC9B,MAAMwqB,EAAUpE,EAAO7T,EAAOtE,GAAO,IACjCgY,GAAIxkB,KAAK+oB,EAASjY,EAAOtE,GAAO,GAAG1J,OACrCimB,EAAQjY,EAAOtE,GAAO,GAAG1J,MAAM9C,KAC7BV,OAAO4R,OACL,CACE6D,eAAgBjE,EAAOtE,GAAO,GAAGuI,gBAEnChB,GAEFjD,EAAOtE,GAAO,GAGpB,CAGA,GAAIuH,EAAQ6U,WAAWrqB,OAAS,EAAG,CACjC,MAAMuW,EAAOf,EAAQ6U,WAAW7U,EAAQ6U,WAAWrqB,OAAS,IAC5CuW,EAAK,IAAMkU,IACnBhpB,KAAK+T,OAAShV,EAAW+V,EAAK,GACxC,CA0BA,IAvBA6T,EAAKrE,SAAW,CACd5X,MAAO,GACLoE,EAAOvS,OAAS,EACZuS,EAAO,GAAG,GAAGpE,MACb,CACEoF,KAAM,EACNqE,OAAQ,EACRpE,OAAQ,IAGhBlF,IAAK,GACHiE,EAAOvS,OAAS,EACZuS,EAAOA,EAAOvS,OAAS,GAAG,GAAGsO,IAC7B,CACEiF,KAAM,EACNqE,OAAQ,EACRpE,OAAQ,KAMlBvF,GAAS,IACAA,EAAQmY,EAAOC,WAAWrmB,QACjCoqB,EAAOhE,EAAOC,WAAWpY,GAAOmc,IAASA,EAE3C,OAAOA,CACT,EAQA,SAASG,EAAYhY,EAAQpE,EAAOnO,GAClC,IAII+nB,EAEAhT,EAEA2V,EAEA1P,EAVA/M,EAAQE,EAAQ,EAChBwc,GAAoB,EACpBC,GAAa,EASjB,OAAS3c,GAASjO,GAAQ,CACxB,MAAM8U,EAAQvC,EAAOtE,GAmCrB,GAjCoB,kBAAlB6G,EAAM,GAAGvQ,MACS,gBAAlBuQ,EAAM,GAAGvQ,MACS,eAAlBuQ,EAAM,GAAGvQ,MAEQ,UAAbuQ,EAAM,GACR6V,IAEAA,IAEF3P,OAAWxa,GACgB,oBAAlBsU,EAAM,GAAGvQ,KACD,UAAbuQ,EAAM,MAENiT,GACC/M,GACA2P,GACAD,IAEDA,EAAsBzc,GAExB+M,OAAWxa,GAGK,eAAlBsU,EAAM,GAAGvQ,MACS,kBAAlBuQ,EAAM,GAAGvQ,MACS,mBAAlBuQ,EAAM,GAAGvQ,MACS,mBAAlBuQ,EAAM,GAAGvQ,MACS,6BAAlBuQ,EAAM,GAAGvQ,OAITyW,OAAWxa,IAGTmqB,GACa,UAAb7V,EAAM,IACY,mBAAlBA,EAAM,GAAGvQ,OACY,IAAtBomB,GACc,SAAb7V,EAAM,KACa,kBAAlBA,EAAM,GAAGvQ,MACU,gBAAlBuQ,EAAM,GAAGvQ,MACb,CACA,GAAIwjB,EAAU,CACZ,IAAI8C,EAAY5c,EAEhB,IADA8G,OAAYvU,EACLqqB,KAAa,CAClB,MAAMC,EAAYvY,EAAOsY,GACzB,GACwB,eAAtBC,EAAU,GAAGvmB,MACS,oBAAtBumB,EAAU,GAAGvmB,KACb,CACA,GAAqB,SAAjBumB,EAAU,GAAe,SACzB/V,IACFxC,EAAOwC,GAAW,GAAGxQ,KAAO,kBAC5BqmB,GAAa,GAEfE,EAAU,GAAGvmB,KAAO,aACpBwQ,EAAY8V,CACd,MAAO,GACiB,eAAtBC,EAAU,GAAGvmB,MACS,qBAAtBumB,EAAU,GAAGvmB,MACS,+BAAtBumB,EAAU,GAAGvmB,MACS,qBAAtBumB,EAAU,GAAGvmB,MACS,mBAAtBumB,EAAU,GAAGvmB,KAIb,KAEJ,CAEEmmB,KACE3V,GAAa2V,EAAsB3V,KAGrCgT,EAASE,SAAU,GAIrBF,EAASzZ,IAAMvN,OAAO4R,OACpB,CAAC,EACDoC,EAAYxC,EAAOwC,GAAW,GAAG5G,MAAQ2G,EAAM,GAAGxG,KAEpDiE,EAAOrE,OAAO6G,GAAa9G,EAAO,EAAG,CAAC,OAAQ8Z,EAAUjT,EAAM,KAC9D7G,IACAjO,GACF,CAGsB,mBAAlB8U,EAAM,GAAGvQ,OACXwjB,EAAW,CACTxjB,KAAM,WAEN0jB,SAAS,EACT9Z,MAAOpN,OAAO4R,OAAO,CAAC,EAAGmC,EAAM,GAAG3G,QAGpCoE,EAAOrE,OAAOD,EAAO,EAAG,CAAC,QAAS8Z,EAAUjT,EAAM,KAClD7G,IACAjO,IACA0qB,OAAsBlqB,EACtBwa,GAAW,EAEf,CACF,CAIA,OADAzI,EAAOpE,GAAO,GAAG8Z,QAAU2C,EACpB5qB,CACT,CAcA,SAASqoB,EAAQzmB,EAAKU,GACpBoP,EAAK9P,GAAOU,CACd,CAYA,SAAS8lB,EAAQxmB,GACf,OAAO8P,EAAK9P,EACd,CAYA,SAAS4kB,EAAO9L,EAAQqQ,GACtB,OAOA,SAAcxZ,GACZX,EAAMnP,KAAK/B,KAAMgb,EAAOnJ,GAAQA,GAC5BwZ,GAAKA,EAAItpB,KAAK/B,KAAM6R,EAC1B,CACF,CAMA,SAASmN,IACPhf,KAAKiS,MAAM9Q,KAAK,CACd0D,KAAM,WACNwJ,SAAU,IAEd,CAgBA,SAAS6C,EAAM/C,EAAM0D,EAAOyZ,GAU1B,OATetrB,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAEvC+N,SAASlN,KAAKgN,GACrBnO,KAAKiS,MAAM9Q,KAAKgN,GAChBnO,KAAK2qB,WAAWxpB,KAAK,CAAC0Q,EAAOyZ,IAE7Bnd,EAAKkY,SAAW,CACd5X,MAAO,GAAMoD,EAAMpD,QAEdN,CACT,CAUA,SAASib,EAAOiC,GACd,OAOA,SAAexZ,GACTwZ,GAAKA,EAAItpB,KAAK/B,KAAM6R,GACxBR,EAAKtP,KAAK/B,KAAM6R,EAClB,CACF,CAYA,SAASR,EAAKQ,EAAO0Z,GACnB,MAAMpd,EAAOnO,KAAKiS,MAAMuE,MAClByF,EAAOjc,KAAK2qB,WAAWnU,MAC7B,IAAKyF,EACH,MAAM,IAAIlU,MACR,iBACE8J,EAAMhN,KACN,MACAuhB,GAAkB,CAChB3X,MAAOoD,EAAMpD,MACbG,IAAKiD,EAAMjD,MAEb,oBAWN,OATWqN,EAAK,GAAGpX,OAASgN,EAAMhN,OAC5B0mB,EACFA,EAAYxpB,KAAK/B,KAAM6R,EAAOoK,EAAK,KAEnBA,EAAK,IAAM8O,IACnBhpB,KAAK/B,KAAM6R,EAAOoK,EAAK,KAGnC9N,EAAKkY,SAASzX,IAAM,GAAMiD,EAAMjD,KACzBT,CACT,CAMA,SAAS0b,IACP,OAAO,EAAS7pB,KAAKiS,MAAMuE,MAC7B,CAyJA,SAASyQ,EAAYpV,GACnB,MAAM1D,EAAOnO,KAAKiS,MAAMjS,KAAKiS,MAAM3R,OAAS,GAC5C,IAAIuW,EAAO1I,EAAKE,SAASF,EAAKE,SAAS/N,OAAS,GAC3CuW,GAAsB,SAAdA,EAAKhS,OAEhBgS,EAibK,CACLhS,KAAM,OACNjC,MAAO,IAjbPiU,EAAKwP,SAAW,CACd5X,MAAO,GAAMoD,EAAMpD,QAGrBN,EAAKE,SAASlN,KAAK0V,IAErB7W,KAAKiS,MAAM9Q,KAAK0V,EAClB,CAOA,SAAS0S,EAAW1X,GAClB,MAAMgF,EAAO7W,KAAKiS,MAAMuE,MACxBK,EAAKjU,OAAS5C,KAAK8W,eAAejF,GAClCgF,EAAKwP,SAASzX,IAAM,GAAMiD,EAAMjD,IAClC,CA8BA,SAASob,IACPrB,EAAQ,eAAe,EACzB,CAgMA,SAASe,EAA+B7X,GACtC8W,EAAQ,yBAA0B9W,EAAMhN,KAC1C,CA2DA,SAASuiB,IACP,MAAO,CACLviB,KAAM,OACNklB,KAAM,KACN3I,KAAM,KACNxe,MAAO,GAEX,CA8BA,SAAS+b,IAEP,MAAO,CACL9Z,KAAM,UACNykB,WAAOxoB,EACPuN,SAAU,GAEd,CAGA,SAAS0Z,IACP,MAAO,CACLljB,KAAM,QAEV,CAGA,SAASojB,IACP,MAAO,CACLpjB,KAAM,OACNjC,MAAO,GAEX,CAaA,SAASmkB,IACP,MAAO,CACLliB,KAAM,OACNwY,MAAO,KACPoK,IAAK,GACLpZ,SAAU,GAEd,CAMA,SAASvO,EAAK+R,GACZ,MAAO,CACLhN,KAAM,OACN2mB,QAAwB,gBAAf3Z,EAAMhN,KACf4J,MAAO,KAEP6Z,OAAQzW,EAAM0W,QACdla,SAAU,GAEd,CA8CF,CAllCWod,CAASjpB,EAATipB,CCjLJ,SAAqB5Y,GAC1B,MAAQqC,EAAYrC,KAIpB,OAAOA,CACT,CD4KM6Y,CExKC,SAAelpB,EAAU,CAAC,GAG/B,MAAMgN,EhDLD,SAA2Bmc,GAEhC,MAAMzc,EAAM,CAAC,EACb,IAAIX,GAAS,EAEb,OAASA,EAAQod,EAAWrrB,QAC1B2O,EAAgBC,EAAKyc,EAAWpd,IAGlC,OAAOW,CACT,CgDLqB0c,CAEjB,CAAC,GAAmBvrB,OAAOmC,EAAQmpB,YAAc,KAI7Cla,EAAS,CACbsM,QAAS,GACTnK,KAAM,CAAC,EACPpE,aACArP,QAAS6a,EAAO7a,GAChByU,SAAUoG,EAAO,GACjBhH,KAAMgH,EAAOhH,GACbqD,OAAQ2D,EAAO3D,GACfG,KAAMwD,EAAO,IAEf,OAAOvJ,EAKP,SAASuJ,EAAOjE,GACd,OAGA,SAAiBhI,GACf,OAAOuJ,EAAgB7G,EAAQsF,EAAShI,EAC1C,CACF,CACF,CF0IQ8c,CAAMrpB,GAASoS,WAAWJ,MJ1K3B,WACL,IAOIsX,EAPA5T,EAAS,EACT8G,EAAS,GAGTvQ,GAAQ,EAIZ,OAGA,SAAsB7L,EAAO6jB,EAAU7X,GAErC,MAAMiJ,EAAS,GAGf,IAAIkU,EAGAha,EAGAgE,EAGAiW,EAGAzc,EAcJ,IAZA3M,EAAQoc,EAASpc,EAAM7C,SAAS0mB,GAChC1Q,EAAgB,EAChBiJ,EAAS,GAELvQ,IAC0B,QAAxB7L,EAAMqV,WAAW,IACnBlC,IAGFtH,OAAQ3N,GAGHiV,EAAgBnT,EAAMtC,QAAQ,CAOnC,GANAolB,GAAOuG,UAAYlW,EACnBgW,EAAQrG,GAAOwG,KAAKtpB,GACpBopB,EACED,QAAyBjrB,IAAhBirB,EAAMxd,MAAsBwd,EAAMxd,MAAQ3L,EAAMtC,OAC3DiP,EAAO3M,EAAMqV,WAAW+T,IAEnBD,EAAO,CACV/M,EAASpc,EAAM0C,MAAMyQ,GACrB,KACF,CAEA,GAAa,KAATxG,GAAewG,IAAkBiW,GAAeF,EAClDjU,EAAO1W,MAAM,GACb2qB,OAAmBhrB,OAYnB,OAVIgrB,IACFjU,EAAO1W,MAAM,GACb2qB,OAAmBhrB,GAGjBiV,EAAgBiW,IAClBnU,EAAO1W,KAAKyB,EAAM0C,MAAMyQ,EAAeiW,IACvC9T,GAAU8T,EAAcjW,GAGlBxG,GACN,KAAK,EACHsI,EAAO1W,KAAK,OACZ+W,IACA,MAGF,KAAK,EAIH,IAHAnG,EAA+B,EAAxBzN,KAAK6nB,KAAKjU,EAAS,GAC1BL,EAAO1W,MAAM,GAEN+W,IAAWnG,GAAM8F,EAAO1W,MAAM,GAErC,MAGF,KAAK,GACH0W,EAAO1W,MAAM,GACb+W,EAAS,EACT,MAGF,QACE4T,GAAmB,EACnB5T,EAAS,EAKfnC,EAAgBiW,EAAc,CAChC,CAQA,OANIpd,IACEkd,GAAkBjU,EAAO1W,MAAM,GAC/B6d,GAAQnH,EAAO1W,KAAK6d,GACxBnH,EAAO1W,KAAK,OAGP0W,CACT,CACF,CI6DwCuU,GAAaxpB,EAAO6jB,GAAU,KAGpE,EAslCF,SAAS,GAAM4F,GACb,MAAO,CACLxY,KAAMwY,EAAExY,KACRqE,OAAQmU,EAAEnU,OACVpE,OAAQuY,EAAEvY,OAEd,CAOA,SAAS0W,GAAU8B,EAAUX,GAC3B,IAAIpd,GAAS,EACb,OAASA,EAAQod,EAAWrrB,QAAQ,CAClC,MAAMsC,EAAQ+oB,EAAWpd,GACrBzM,MAAMF,QAAQgB,GAChB4nB,GAAU8B,EAAU1pB,GAEpBuM,GAAUmd,EAAU1pB,EAExB,CACF,CAOA,SAASuM,GAAUmd,EAAUnd,GAE3B,IAAIjN,EACJ,IAAKA,KAAOiN,EACV,GAAIoX,GAAIxkB,KAAKoN,EAAWjN,GACtB,GAAY,mBAARA,EAA0B,CAC5B,MAAMoN,EAAQH,EAAUjN,GACpBoN,GACFgd,EAASpqB,GAAKf,QAAQmO,EAE1B,MAAO,GAAY,eAARpN,EAAsB,CAC/B,MAAMoN,EAAQH,EAAUjN,GACpBoN,GACFgd,EAASpqB,GAAKf,QAAQmO,EAE1B,MAAO,GAAY,UAARpN,GAA2B,SAARA,EAAgB,CAC5C,MAAMoN,EAAQH,EAAUjN,GACpBoN,GACFjO,OAAO4R,OAAOqZ,EAASpqB,GAAMoN,EAEjC,CAGN,CAGA,SAASyb,GAAe1b,EAAMC,GAC5B,MAAID,EACI,IAAItH,MACR,iBACEsH,EAAKxK,KACL,MACAuhB,GAAkB,CAChB3X,MAAOY,EAAKZ,MACZG,IAAKS,EAAKT,MAEZ,0BACAU,EAAMzK,KACN,MACAuhB,GAAkB,CAChB3X,MAAOa,EAAMb,MACbG,IAAKU,EAAMV,MAEb,aAGE,IAAI7G,MACR,oCACEuH,EAAMzK,KACN,MACAuhB,GAAkB,CAChB3X,MAAOa,EAAMb,MACbG,IAAKU,EAAMV,MAEb,kBAGR,CGl2Ce,SAAS2d,GAAY/pB,GAkBlCnB,OAAO4R,OAAOjT,KAAM,CAACwsB,OAhBLC,IAEd,MAAM3e,EAAmC9N,KAAKgS,KAAK,YAEnD,OAAOwU,GACLiG,EACAprB,OAAO4R,OAAO,CAAC,EAAGnF,EAAUtL,EAAS,CAInCmpB,WAAY3rB,KAAKgS,KAAK,wBAA0B,GAChDyY,gBAAiBzqB,KAAKgS,KAAK,2BAA6B,KAE5D,GAIJ,CCmBA,MAAM,GAAM,CAAC,EAAEzQ,eCvCR,SAAS,GAAU4H,EAAMgG,GAC9B,IAEIjN,EAFAqM,GAAS,EAKb,GAAIY,EAAUwc,WACZ,OAASpd,EAAQY,EAAUwc,WAAWrrB,QACpC,GAAU6I,EAAMgG,EAAUwc,WAAWpd,IAIzC,IAAKrM,KAAOiN,EACE,eAARjN,IAEe,WAARA,GAA4B,SAARA,EAG7BiH,EAAKjH,GAAO,IAAKiH,EAAKjH,IAAQ,MAASiN,EAAUjN,IAAQ,IACxC,aAARA,EACTiH,EAAKjH,GAAOb,OAAO4R,OAAO9J,EAAKjH,GAAMiN,EAAUjN,IAAQ,CAAC,GAGxDiH,EAAK3G,QAAQN,GAAOiN,EAAUjN,IAIlC,OAAOiH,CACT,CCTA,SAASlJ,GAAI4T,EAAMkG,EAAG2S,GACpB,MAAO,KAAOA,EAAQ,GAAK,KAAO7Y,CACpC,CCrBO,SAAS8Y,GAAe1a,EAAO2a,GACpC,OACEC,GAAY5a,EAAO2a,EAAQE,aAAa,KACvCD,GAAY5a,EAAO2a,EAAQG,gBAAgB,EAEhD,CAQA,SAASF,GAAY5a,EAAOnS,EAAMktB,GAKhC,GAJoB,iBAATltB,IACTA,EAAO,CAACA,KAGLA,GAAwB,IAAhBA,EAAKQ,OAChB,OAAO0sB,EAGT,IAAIze,GAAS,EAEb,OAASA,EAAQzO,EAAKQ,QACpB,GAAI2R,EAAM8C,SAASjV,EAAKyO,IACtB,OAAO,EAIX,OAAO,CACT,CCzBO,SAASwZ,GAAUhO,EAAGkT,EAAIzT,EAAOpO,GACtC,IAAImD,GAAS,EAEb,OAASA,EAAQiL,EAAM0T,OAAO5sB,QAG5B,GACoC,OAAlCkZ,EAAM0T,OAAO3e,GAAO4e,WACpBR,GAAenT,EAAMvH,MAAOuH,EAAM0T,OAAO3e,IAEzC,MAAO,QAAQlJ,KAAK+F,EAAKsE,QAAU,GAAK,IAI5C,MAAO,MACT,CCrBO,SAAS0d,GAAqBjf,EAAMqL,GACzC,OAAOtL,SACJsL,EAAMhX,QAAQ6qB,QACblf,EAAKvL,QAEJuL,EAAK4b,MAEN,WAAW1kB,KAAK8I,EAAKvL,SAEpB,0CAA0CyC,KAAK8I,EAAKvL,OAE3D,CCsDA,SAAS,GAAIiR,EAAMkG,EAAG2S,GACpB,OAAQA,EAAQ,GAAK,QAAU7Y,CACjC,CCpEO,SAASyZ,GAAW9T,GACzB,MAAM2B,EAAS3B,EAAMhX,QAAQ+qB,OAAS,IAEtC,GAAe,MAAXpS,GAA6B,MAAXA,EACpB,MAAM,IAAIpT,MACR,gCACEoT,EACA,gDAIN,OAAOA,CACT,CCCO,SAAS0M,GAAS1Z,EAAM4L,EAAGP,EAAOpO,GACvC,MAAM+P,ECdD,SAAuB3B,GAC5B,MAAM2B,EAAS3B,EAAMhX,QAAQqlB,UAAY,IAEzC,GAAe,MAAX1M,GAA6B,MAAXA,EACpB,MAAM,IAAIpT,MACR,mCACEoT,EACA,kDAIN,OAAOA,CACT,CDEiBqS,CAAchU,GACvBnI,EAAOmI,EAAMtI,MAAM,YACnBuc,EAAUjU,EAAMkU,cAActiB,GACpC,IAAIxI,EAAQ6qB,EAAQE,KAAKxS,GAUzB,OATAvY,GAAS6qB,EAAQE,KACfnU,EAAMoU,kBAAkBzf,EAAM,CAC5BuB,OAAQ9M,EACRsZ,MAAOf,KACJsS,EAAQrX,aAGfxT,GAAS6qB,EAAQE,KAAKxS,GACtB9J,IACOzO,CACT,CA5BAilB,GAASgG,KAoCT,SAAsB9T,EAAGkT,EAAIzT,GAC3B,OAAOA,EAAMhX,QAAQqlB,UAAY,GACnC,4BElCO,SAASiG,GAAsB3f,EAAMqL,GAC1C,IAAIuU,GAAmB,EAcvB,OAVA,SAAM5f,GAAOA,IACX,GACG,UAAWA,GAAQ,WAAW9I,KAAK8I,EAAKvL,QAC3B,UAAduL,EAAKtJ,KAGL,OADAkpB,GAAmB,EACZ,KACT,IAGK7f,UACHC,EAAKmb,OAASnb,EAAKmb,MAAQ,IAC3B,EAASnb,KACRqL,EAAMhX,QAAQwrB,QAAUD,GAE/B,CCvBO,SAAS9F,GAAK9Z,GACnB,OAAOA,EAAKvL,OAAS,EACvB,CCMO,SAAS,GAAMuL,EAAM4L,EAAGP,EAAOpO,GACpC,MAAMmiB,EAAQD,GAAW9T,GACnByU,EAAmB,MAAVV,EAAgB,QAAU,aACnClc,EAAOmI,EAAMtI,MAAM,SACzB,IAAIgd,EAAU1U,EAAMtI,MAAM,SAC1B,MAAMuc,EAAUjU,EAAMkU,cAActiB,GACpC,IAAIxI,EAAQ6qB,EAAQE,KAAK,MAmDzB,OAlDA/qB,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKC,IAAK,CAACsB,OAAQ9M,EAAOsZ,MAAO,OAAQuR,EAAQrX,aAE9DxT,GAAS6qB,EAAQE,KAAK,MAEtBO,KAII/f,EAAKsZ,KAAOtZ,EAAKkP,OAEnB,eAAehY,KAAK8I,EAAKsZ,MAEzByG,EAAU1U,EAAMtI,MAAM,sBACtBtO,GAAS6qB,EAAQE,KAAK,KACtB/qB,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKsZ,IAAK,CAAC/X,OAAQ9M,EAAOsZ,MAAO,OAAQuR,EAAQrX,aAE9DxT,GAAS6qB,EAAQE,KAAK,OAGtBO,EAAU1U,EAAMtI,MAAM,kBACtBtO,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKsZ,IAAK,CACnB/X,OAAQ9M,EACRsZ,MAAO/N,EAAKkP,MAAQ,IAAM,OACvBoQ,EAAQrX,cAKjB8X,IAEI/f,EAAKkP,QACP6Q,EAAU1U,EAAMtI,MAAM,QAAQ+c,KAC9BrrB,GAAS6qB,EAAQE,KAAK,IAAMJ,GAC5B3qB,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKkP,MAAO,CACrB3N,OAAQ9M,EACRsZ,MAAOqR,KACJE,EAAQrX,aAGfxT,GAAS6qB,EAAQE,KAAKJ,GACtBW,KAGFtrB,GAAS6qB,EAAQE,KAAK,KACtBtc,IAEOzO,CACT,CC5DO,SAASwrB,GAAejgB,EAAM4L,EAAGP,EAAOpO,GAC7C,MAAMvG,EAAOsJ,EAAK8b,cACZ5Y,EAAOmI,EAAMtI,MAAM,kBACzB,IAAIgd,EAAU1U,EAAMtI,MAAM,SAC1B,MAAMuc,EAAUjU,EAAMkU,cAActiB,GACpC,IAAIxI,EAAQ6qB,EAAQE,KAAK,MACzB,MAAMvf,EAAMoL,EAAM2U,KAAKhgB,EAAKC,IAAK,CAC/BsB,OAAQ9M,EACRsZ,MAAO,OACJuR,EAAQrX,YAEbxT,GAAS6qB,EAAQE,KAAKvf,EAAM,MAE5B8f,IAEA,MAAMjc,EAAQuH,EAAMvH,MACpBuH,EAAMvH,MAAQ,GACdic,EAAU1U,EAAMtI,MAAM,aAKtB,MAAM4X,EAAYtP,EAAM2U,KAAK3U,EAAM6U,cAAclgB,GAAO,CACtDuB,OAAQ9M,EACRsZ,MAAO,OACJuR,EAAQrX,YAeb,OAbA8X,IACA1U,EAAMvH,MAAQA,EACdZ,IAEa,SAATxM,GAAoBuJ,GAAOA,IAAQ0a,EAEnB,aAATjkB,EAETjC,EAAQA,EAAM0C,MAAM,GAAI,GAExB1C,GAAS6qB,EAAQE,KAAK,KALtB/qB,GAAS6qB,EAAQE,KAAK7E,EAAY,KAQ7BlmB,CACT,CCjDO,SAAS0rB,GAAe1B,GAC7B,IAAKA,EAAQ2B,UAAW,CACtB,MAAM7e,GACHkd,EAAQlV,QAAU,kBAAoB,KACtCkV,EAAQld,OAAS,MAAQkd,EAAQld,OAAS,IAAM,IAEnDkd,EAAQ2B,UAAY,IAAIC,QACrB9e,EAAS,IAAMA,EAAS,IAAM,KAC5B,sBAAsBrK,KAAKunB,EAAQO,WAAa,KAAO,IACxDP,EAAQO,WACPP,EAAQ1Q,MAAQ,MAAQ0Q,EAAQ1Q,MAAQ,IAAM,IACjD,IAEJ,CAEA,OAAO0Q,EAAQ2B,SACjB,CCRO,SAASE,GAAWtgB,EAAM4L,EAAGP,GAClC,IAAI5W,EAAQuL,EAAKvL,OAAS,GACtBwY,EAAW,IACX7M,GAAS,EAKb,KAAO,IAAIigB,OAAO,WAAapT,EAAW,YAAY/V,KAAKzC,IACzDwY,GAAY,IAmBd,IAbE,WAAW/V,KAAKzC,KACd,WAAWyC,KAAKzC,IAAU,WAAWyC,KAAKzC,IAAW,QAAQyC,KAAKzC,MAEpEA,EAAQ,IAAMA,EAAQ,OAUf2L,EAAQiL,EAAM0T,OAAO5sB,QAAQ,CACpC,MAAMssB,EAAUpT,EAAM0T,OAAO3e,GACvBmgB,EAAaJ,GAAe1B,GAElC,IAAIb,EAKJ,GAAKa,EAAQlV,QAEb,KAAQqU,EAAQ2C,EAAWxC,KAAKtpB,IAAS,CACvC,IAAIyjB,EAAW0F,EAAMxd,MAIY,KAA/B3L,EAAMqV,WAAWoO,IACkB,KAAnCzjB,EAAMqV,WAAWoO,EAAW,IAE5BA,IAGFzjB,EAAQA,EAAM0C,MAAM,EAAG+gB,GAAY,IAAMzjB,EAAM0C,MAAMymB,EAAMxd,MAAQ,EACrE,CACF,CAEA,OAAO6M,EAAWxY,EAAQwY,CAC5B,CC3DO,SAASuT,GAAqBxgB,EAAMqL,GACzC,MAAMoV,EAAM,EAASzgB,GAErB,OAAOD,SACJsL,EAAMhX,QAAQqsB,cAEb1gB,EAAKsZ,MAEJtZ,EAAKkP,OAENlP,EAAKE,UACoB,IAAzBF,EAAKE,SAAS/N,QACY,SAA1B6N,EAAKE,SAAS,GAAGxJ,OAEhB+pB,IAAQzgB,EAAKsZ,KAAO,UAAYmH,IAAQzgB,EAAKsZ,MAE9C,oBAAoBpiB,KAAK8I,EAAKsZ,OAG7B,iBAAiBpiB,KAAK8I,EAAKsZ,KAElC,CCbO,SAAS,GAAKtZ,EAAM4L,EAAGP,EAAOpO,GACnC,MAAMmiB,EAAQD,GAAW9T,GACnByU,EAAmB,MAAVV,EAAgB,QAAU,aACnCE,EAAUjU,EAAMkU,cAActiB,GAEpC,IAAIiG,EAEA6c,EAEJ,GAAIS,GAAqBxgB,EAAMqL,GAAQ,CAErC,MAAMvH,EAAQuH,EAAMvH,MACpBuH,EAAMvH,MAAQ,GACdZ,EAAOmI,EAAMtI,MAAM,YACnB,IAAItO,EAAQ6qB,EAAQE,KAAK,KAWzB,OAVA/qB,GAAS6qB,EAAQE,KACfnU,EAAMoU,kBAAkBzf,EAAM,CAC5BuB,OAAQ9M,EACRsZ,MAAO,OACJuR,EAAQrX,aAGfxT,GAAS6qB,EAAQE,KAAK,KACtBtc,IACAmI,EAAMvH,MAAQA,EACPrP,CACT,CAEAyO,EAAOmI,EAAMtI,MAAM,QACnBgd,EAAU1U,EAAMtI,MAAM,SACtB,IAAItO,EAAQ6qB,EAAQE,KAAK,KAsDzB,OArDA/qB,GAAS6qB,EAAQE,KACfnU,EAAMoU,kBAAkBzf,EAAM,CAC5BuB,OAAQ9M,EACRsZ,MAAO,QACJuR,EAAQrX,aAGfxT,GAAS6qB,EAAQE,KAAK,MACtBO,KAII/f,EAAKsZ,KAAOtZ,EAAKkP,OAEnB,eAAehY,KAAK8I,EAAKsZ,MAEzByG,EAAU1U,EAAMtI,MAAM,sBACtBtO,GAAS6qB,EAAQE,KAAK,KACtB/qB,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKsZ,IAAK,CAAC/X,OAAQ9M,EAAOsZ,MAAO,OAAQuR,EAAQrX,aAE9DxT,GAAS6qB,EAAQE,KAAK,OAGtBO,EAAU1U,EAAMtI,MAAM,kBACtBtO,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKsZ,IAAK,CACnB/X,OAAQ9M,EACRsZ,MAAO/N,EAAKkP,MAAQ,IAAM,OACvBoQ,EAAQrX,cAKjB8X,IAEI/f,EAAKkP,QACP6Q,EAAU1U,EAAMtI,MAAM,QAAQ+c,KAC9BrrB,GAAS6qB,EAAQE,KAAK,IAAMJ,GAC5B3qB,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKkP,MAAO,CACrB3N,OAAQ9M,EACRsZ,MAAOqR,KACJE,EAAQrX,aAGfxT,GAAS6qB,EAAQE,KAAKJ,GACtBW,KAGFtrB,GAAS6qB,EAAQE,KAAK,KAEtBtc,IACOzO,CACT,CCzFO,SAASksB,GAAc3gB,EAAM4L,EAAGP,EAAOpO,GAC5C,MAAMvG,EAAOsJ,EAAK8b,cACZ5Y,EAAOmI,EAAMtI,MAAM,iBACzB,IAAIgd,EAAU1U,EAAMtI,MAAM,SAC1B,MAAMuc,EAAUjU,EAAMkU,cAActiB,GACpC,IAAIxI,EAAQ6qB,EAAQE,KAAK,KACzB,MAAMnW,EAAOgC,EAAMoU,kBAAkBzf,EAAM,CACzCuB,OAAQ9M,EACRsZ,MAAO,OACJuR,EAAQrX,YAEbxT,GAAS6qB,EAAQE,KAAKnW,EAAO,MAE7B0W,IAEA,MAAMjc,EAAQuH,EAAMvH,MACpBuH,EAAMvH,MAAQ,GACdic,EAAU1U,EAAMtI,MAAM,aAKtB,MAAM4X,EAAYtP,EAAM2U,KAAK3U,EAAM6U,cAAclgB,GAAO,CACtDuB,OAAQ9M,EACRsZ,MAAO,OACJuR,EAAQrX,YAeb,OAbA8X,IACA1U,EAAMvH,MAAQA,EACdZ,IAEa,SAATxM,GAAoB2S,GAAQA,IAASsR,EAErB,aAATjkB,EAETjC,EAAQA,EAAM0C,MAAM,GAAI,GAExB1C,GAAS6qB,EAAQE,KAAK,KALtB/qB,GAAS6qB,EAAQE,KAAK7E,EAAY,KAQ7BlmB,CACT,CChDO,SAASmsB,GAAYvV,GAC1B,MAAM2B,EAAS3B,EAAMhX,QAAQwsB,QAAU,IAEvC,GAAe,MAAX7T,GAA6B,MAAXA,GAA6B,MAAXA,EACtC,MAAM,IAAIpT,MACR,gCACEoT,EACA,qDAIN,OAAOA,CACT,CCZO,SAAS8T,GAAmBzV,GACjC,MAAM2B,EAAS3B,EAAMhX,QAAQ0sB,eAAiB,IAE9C,GAAe,MAAX/T,GAA6B,MAAXA,EACpB,MAAM,IAAIpT,MACR,gCACEoT,EACA,sDAIN,OAAOA,CACT,CCZO,SAASgU,GAAU3V,GACxB,MAAM2B,EAAS3B,EAAMhX,QAAQ4sB,MAAQ,IAErC,GAAe,MAAXjU,GAA6B,MAAXA,GAA6B,MAAXA,EACtC,MAAM,IAAIpT,MACR,gCACEoT,EACA,mDAIN,OAAOA,CACT,CVjBA8M,GAAK4F,KAaL,WACE,MAAO,GACT,ECVA,GAAMA,KAwEN,WACE,MAAO,GACT,EC5EAO,GAAeP,KAuDf,WACE,MAAO,GACT,EExDAY,GAAWZ,KAoEX,WACE,MAAO,GACT,EEnEA,GAAKA,KAsGL,SAAkB1f,EAAM4L,EAAGP,GACzB,OAAOmV,GAAqBxgB,EAAMqL,GAAS,IAAM,GACnD,EC5GAsV,GAAcjB,KAuDd,WACE,MAAO,GACT,EIjDO,MAAMwB,IACX,aAAQ,CACN,QACA,SACA,WACA,WACA,oBACA,QACA,iBACA,aACA,OACA,gBACA,SACA,SCNG,SAASlG,GAAOhb,EAAM4L,EAAGP,EAAOpO,GACrC,MAAM+P,ECdD,SAAqB3B,GAC1B,MAAM2B,EAAS3B,EAAMhX,QAAQ2mB,QAAU,IAEvC,GAAe,MAAXhO,GAA6B,MAAXA,EACpB,MAAM,IAAIpT,MACR,iCACEoT,EACA,gDAIN,OAAOA,CACT,CDEiBmU,CAAY9V,GACrBnI,EAAOmI,EAAMtI,MAAM,UACnBuc,EAAUjU,EAAMkU,cAActiB,GACpC,IAAIxI,EAAQ6qB,EAAQE,KAAKxS,EAASA,GAUlC,OATAvY,GAAS6qB,EAAQE,KACfnU,EAAMoU,kBAAkBzf,EAAM,CAC5BuB,OAAQ9M,EACRsZ,MAAOf,KACJsS,EAAQrX,aAGfxT,GAAS6qB,EAAQE,KAAKxS,EAASA,GAC/B9J,IACOzO,CACT,CA5BAumB,GAAO0E,KAoCP,SAAoB9T,EAAGkT,EAAIzT,GACzB,OAAOA,EAAMhX,QAAQ2mB,QAAU,GACjC,EExBO,MAAMoG,GAAS,CACpBC,WvBTK,SAAoBrhB,EAAM4L,EAAGP,EAAOpO,GACzC,MAAMiG,EAAOmI,EAAMtI,MAAM,cACnBuc,EAAUjU,EAAMkU,cAActiB,GACpCqiB,EAAQE,KAAK,MACbF,EAAQgC,MAAM,GACd,MAAM7sB,EAAQ4W,EAAMkW,YAClBlW,EAAMmW,cAAcxhB,EAAMsf,EAAQrX,WAClCnW,IAGF,OADAoR,IACOzO,CACT,EuBDEgtB,MAAO7H,GACPxY,KnBPK,SAAcpB,EAAM4L,EAAGP,EAAOpO,GACnC,MAAM+P,EoBXD,SAAoB3B,GACzB,MAAM2B,EAAS3B,EAAMhX,QAAQqtB,OAAS,IAEtC,GAAe,MAAX1U,GAA6B,MAAXA,EACpB,MAAM,IAAIpT,MACR,+BACEoT,EACA,kDAIN,OAAOA,CACT,CpBDiB2U,CAAWtW,GACpBoV,EAAMzgB,EAAKvL,OAAS,GACpBqrB,EAAoB,MAAX9S,EAAiB,cAAgB,QAEhD,GAAIiS,GAAqBjf,EAAMqL,GAAQ,CACrC,MAAMnI,EAAOmI,EAAMtI,MAAM,gBACnBtO,EAAQ4W,EAAMkW,YAAYd,EAAK,IAErC,OADAvd,IACOzO,CACT,CAEA,MAAM6qB,EAAUjU,EAAMkU,cAActiB,GAC9BgQ,EAAWD,EAAO4U,OAAOzrB,KAAKC,IqBtB/B,SAAuB3B,EAAOotB,GACnC,MAAMziB,EAASV,OAAOjK,GACtB,IAAI2L,EAAQhB,EAAO0iB,QAAQD,GACvBE,EAAW3hB,EACX4hB,EAAQ,EACR5rB,EAAM,EAEV,GAAyB,iBAAdyrB,EACT,MAAM,IAAI7pB,UAAU,sBAGtB,MAAkB,IAAXoI,GACDA,IAAU2hB,IACNC,EAAQ5rB,IACZA,EAAM4rB,GAGRA,EAAQ,EAGVD,EAAW3hB,EAAQyhB,EAAU1vB,OAC7BiO,EAAQhB,EAAO0iB,QAAQD,EAAWE,GAGpC,OAAO3rB,CACT,CrBH0C6rB,CAAcxB,EAAKzT,GAAU,EAAG,IAClE9J,EAAOmI,EAAMtI,MAAM,cACzB,IAAItO,EAAQ6qB,EAAQE,KAAKvS,GAEzB,GAAIjN,EAAK4b,KAAM,CACb,MAAMmE,EAAU1U,EAAMtI,MAAM,iBAAiB+c,KAC7CrrB,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAK4b,KAAM,CACpBra,OAAQ9M,EACRsZ,MAAO,IACPmU,OAAQ,CAAC,QACN5C,EAAQrX,aAGf8X,GACF,CAEA,GAAI/f,EAAK4b,MAAQ5b,EAAKiT,KAAM,CAC1B,MAAM8M,EAAU1U,EAAMtI,MAAM,iBAAiB+c,KAC7CrrB,GAAS6qB,EAAQE,KAAK,KACtB/qB,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKiT,KAAM,CACpB1R,OAAQ9M,EACRsZ,MAAO,KACPmU,OAAQ,CAAC,QACN5C,EAAQrX,aAGf8X,GACF,CAUA,OARAtrB,GAAS6qB,EAAQE,KAAK,MAElBiB,IACFhsB,GAAS6qB,EAAQE,KAAKiB,EAAM,OAG9BhsB,GAAS6qB,EAAQE,KAAKvS,GACtB/J,IACOzO,CACT,EmB7CE+a,WGXK,SAAoBxP,EAAM4L,EAAGP,EAAOpO,GACzC,MAAMmiB,EAAQD,GAAW9T,GACnByU,EAAmB,MAAVV,EAAgB,QAAU,aACnClc,EAAOmI,EAAMtI,MAAM,cACzB,IAAIgd,EAAU1U,EAAMtI,MAAM,SAC1B,MAAMuc,EAAUjU,EAAMkU,cAActiB,GACpC,IAAIxI,EAAQ6qB,EAAQE,KAAK,KAsDzB,OArDA/qB,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAK3U,EAAM6U,cAAclgB,GAAO,CACpCuB,OAAQ9M,EACRsZ,MAAO,OACJuR,EAAQrX,aAGfxT,GAAS6qB,EAAQE,KAAK,OAEtBO,KAIG/f,EAAKsZ,KAEN,eAAepiB,KAAK8I,EAAKsZ,MAEzByG,EAAU1U,EAAMtI,MAAM,sBACtBtO,GAAS6qB,EAAQE,KAAK,KACtB/qB,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKsZ,IAAK,CAAC/X,OAAQ9M,EAAOsZ,MAAO,OAAQuR,EAAQrX,aAE9DxT,GAAS6qB,EAAQE,KAAK,OAGtBO,EAAU1U,EAAMtI,MAAM,kBACtBtO,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKsZ,IAAK,CACnB/X,OAAQ9M,EACRsZ,MAAO/N,EAAKkP,MAAQ,IAAM,QACvBoQ,EAAQrX,cAKjB8X,IAEI/f,EAAKkP,QACP6Q,EAAU1U,EAAMtI,MAAM,QAAQ+c,KAC9BrrB,GAAS6qB,EAAQE,KAAK,IAAMJ,GAC5B3qB,GAAS6qB,EAAQE,KACfnU,EAAM2U,KAAKhgB,EAAKkP,MAAO,CACrB3N,OAAQ9M,EACRsZ,MAAOqR,KACJE,EAAQrX,aAGfxT,GAAS6qB,EAAQE,KAAKJ,GACtBW,KAGF7c,IAEOzO,CACT,EHjDEilB,SAAQ,GACRE,UAAS,GACTpJ,QIdK,SAAiBxQ,EAAM4L,EAAGP,EAAOpO,GACtC,MAAMklB,EAAOhsB,KAAKC,IAAID,KAAKG,IAAI,EAAG0J,EAAKmb,OAAS,GAAI,GAC9CmE,EAAUjU,EAAMkU,cAActiB,GAEpC,GAAI0iB,GAAsB3f,EAAMqL,GAAQ,CACtC,MAAMnI,EAAOmI,EAAMtI,MAAM,iBACnBgd,EAAU1U,EAAMtI,MAAM,YACtBtO,EAAQ4W,EAAMoU,kBAAkBzf,EAAM,IACvCsf,EAAQrX,UACX1G,OAAQ,KACRwM,MAAO,OAKT,OAHAgS,IACA7c,IAGEzO,EACA,MACU,IAAT0tB,EAAa,IAAM,KAAKP,OAEvBntB,EAAMtC,QAGHgE,KAAKC,IAAI3B,EAAM2tB,YAAY,MAAO3tB,EAAM2tB,YAAY,OAAS,GAGtE,CAEA,MAAMnV,EAAW,IAAI2U,OAAOO,GACtBjf,EAAOmI,EAAMtI,MAAM,cACnBgd,EAAU1U,EAAMtI,MAAM,YAM5Buc,EAAQE,KAAKvS,EAAW,KAExB,IAAIxY,EAAQ4W,EAAMoU,kBAAkBzf,EAAM,CACxCuB,OAAQ,KACRwM,MAAO,QACJuR,EAAQrX,YAqBb,MAlBI,SAAS/Q,KAAKzC,KAEhBA,EACE,MACAA,EAAMqV,WAAW,GAAGlY,SAAS,IAAI2d,cACjC,IACA9a,EAAM0C,MAAM,IAGhB1C,EAAQA,EAAQwY,EAAW,IAAMxY,EAAQwY,EAErC5B,EAAMhX,QAAQguB,WAChB5tB,GAAS,IAAMwY,GAGjB8S,IACA7c,IAEOzO,CACT,EJhDEqlB,KAAI,GACJG,MAAK,GACLgG,eAAc,GACdK,WAAU,GACV1H,KAAI,GACJ+H,cAAa,GACbhvB,KKjBK,SAAcqO,EAAMsiB,EAAQjX,EAAOpO,GACxC,MAAMiG,EAAOmI,EAAMtI,MAAM,QACnBwf,EAAgBlX,EAAMkX,cAE5B,IAAI1B,EAAS7gB,EAAKqd,QAAUyD,GAAmBzV,GAASuV,GAAYvV,GAEpE,MAAMmX,EAAcxiB,EAAKqd,QCfpB,SAAiChS,GACtC,MAAM0V,EAAgBD,GAAmBzV,GACnCoX,EAAqBpX,EAAMhX,QAAQouB,mBAEzC,IAAKA,EACH,MAAyB,MAAlB1B,EAAwB,IAAM,IAGvC,GAA2B,MAAvB0B,GAAqD,MAAvBA,EAChC,MAAM,IAAI7oB,MACR,gCACE6oB,EACA,iEAIN,GAAIA,IAAuB1B,EACzB,MAAM,IAAInnB,MACR,8BACEmnB,EACA,iCACA0B,EACA,sBAIN,OAAOA,CACT,CDXMC,CAAwBrX,GEhBvB,SAA0BA,GAC/B,MAAMwV,EAASD,GAAYvV,GACrBmX,EAAcnX,EAAMhX,QAAQmuB,YAElC,IAAKA,EACH,MAAkB,MAAX3B,EAAiB,IAAM,IAGhC,GAAoB,MAAhB2B,GAAuC,MAAhBA,GAAuC,MAAhBA,EAChD,MAAM,IAAI5oB,MACR,gCACE4oB,EACA,0DAIN,GAAIA,IAAgB3B,EAClB,MAAM,IAAIjnB,MACR,uBACEinB,EACA,0BACA2B,EACA,sBAIN,OAAOA,CACT,CFVMG,CAAiBtX,GACfuX,EAAiBvX,EAAMuX,eAC7B,IAAIC,GAAqB,EAczB,GAXEP,IAECtiB,EAAKqd,QACFhS,EAAMhX,QAAQouB,mBACdpX,EAAMhX,QAAQmuB,cAClBI,GACA/B,IAAW+B,IAEXC,GAAqB,IAGlB7iB,EAAKqd,QAAS,CACjB,MAAMyF,EAAgB9iB,EAAKE,SAAWF,EAAKE,SAAS,QAAKvN,EAqCzD,GAzBc,MAAXkuB,GAA6B,MAAXA,IAEnBiC,GACEA,EAAc5iB,UAAa4iB,EAAc5iB,SAAS,IAEZ,SAAxCmL,EAAMvH,MAAMuH,EAAMvH,MAAM3R,OAAS,IACO,aAAxCkZ,EAAMvH,MAAMuH,EAAMvH,MAAM3R,OAAS,IACO,SAAxCkZ,EAAMvH,MAAMuH,EAAMvH,MAAM3R,OAAS,IACO,aAAxCkZ,EAAMvH,MAAMuH,EAAMvH,MAAM3R,OAAS,IAEiB,IAAlDkZ,EAAM0X,WAAW1X,EAAM0X,WAAW5wB,OAAS,IACO,IAAlDkZ,EAAM0X,WAAW1X,EAAM0X,WAAW5wB,OAAS,IACO,IAAlDkZ,EAAM0X,WAAW1X,EAAM0X,WAAW5wB,OAAS,KAE3C0wB,GAAqB,GAWnB7B,GAAU3V,KAAWwV,GAAUiC,EAAe,CAChD,IAAI1iB,GAAS,EAEb,OAASA,EAAQJ,EAAKE,SAAS/N,QAAQ,CACrC,MAAMJ,EAAOiO,EAAKE,SAASE,GAE3B,GACErO,GACc,aAAdA,EAAK2E,MACL3E,EAAKmO,UACLnO,EAAKmO,SAAS,IACY,kBAA1BnO,EAAKmO,SAAS,GAAGxJ,KACjB,CACAmsB,GAAqB,EACrB,KACF,CACF,CACF,CACF,CAEIA,IACFhC,EAAS2B,GAGXnX,EAAMkX,cAAgB1B,EACtB,MAAMpsB,EAAQ4W,EAAMmW,cAAcxhB,EAAM/C,GAIxC,OAHAoO,EAAMuX,eAAiB/B,EACvBxV,EAAMkX,cAAgBA,EACtBrf,IACOzO,CACT,EL1EEylB,SQpBK,SAAkBla,EAAMsiB,EAAQjX,EAAOpO,GAC5C,MAAM+lB,ECVD,SAA6B3X,GAClC,MAAM4X,EAAQ5X,EAAMhX,QAAQ2uB,gBAAkB,MAI9C,GAAc,IAAVC,GAAyB,MAAVA,EACjB,MAAO,MAGT,GAAc,QAAVA,GAA6B,QAAVA,GAA6B,UAAVA,EACxC,MAAM,IAAIrpB,MACR,gCACEqpB,EACA,qEAIN,OAAOA,CACT,CDRyBC,CAAoB7X,GAC3C,IAAIwV,EAASxV,EAAMkX,eAAiB3B,GAAYvV,GAG5CiX,GAA0B,SAAhBA,EAAO5rB,MAAmB4rB,EAAOjF,UAC7CwD,GAC2B,iBAAjByB,EAAOhiB,OAAsBgiB,EAAOhiB,OAAS,EACjDgiB,EAAOhiB,MACP,KACmC,IAAtC+K,EAAMhX,QAAQ8uB,oBACX,EACAb,EAAOpiB,SAAS4hB,QAAQ9hB,IAC5B6gB,GAGJ,IAAI/d,EAAO+d,EAAO1uB,OAAS,GAGN,QAAnB6wB,GACoB,UAAnBA,IACGV,GAA0B,SAAhBA,EAAO5rB,MAAmB4rB,EAAOnI,QAAWna,EAAKma,WAE/DrX,EAA6B,EAAtB3M,KAAK6nB,KAAKlb,EAAO,IAG1B,MAAMwc,EAAUjU,EAAMkU,cAActiB,GACpCqiB,EAAQE,KAAKqB,EAAS,IAAIe,OAAO9e,EAAO+d,EAAO1uB,SAC/CmtB,EAAQgC,MAAMxe,GACd,MAAMI,EAAOmI,EAAMtI,MAAM,YACnBtO,EAAQ4W,EAAMkW,YAClBlW,EAAMmW,cAAcxhB,EAAMsf,EAAQrX,YAQpC,SAAavC,EAAMtF,EAAOme,GACxB,OAAIne,GACMme,EAAQ,GAAK,IAAIqD,OAAO9e,IAAS4C,GAGnC6Y,EAAQsC,EAASA,EAAS,IAAIe,OAAO9e,EAAO+d,EAAO1uB,SAAWuT,CACxE,IATA,OAFAxC,IAEOzO,CAUT,ERzBE4b,UUzBK,SAAmBrQ,EAAM4L,EAAGP,EAAOpO,GACxC,MAAMiG,EAAOmI,EAAMtI,MAAM,aACnBgd,EAAU1U,EAAMtI,MAAM,YACtBtO,EAAQ4W,EAAMoU,kBAAkBzf,EAAM/C,GAG5C,OAFA8iB,IACA7c,IACOzO,CACT,EVmBEsB,KWxBK,SAAciK,EAAM4L,EAAGP,EAAOpO,GAEnC,MAAMmmB,EAAcpjB,EAAKE,SAASmjB,MAAMnF,GAAMgD,GAAShD,KAGvD,OAFWkF,EAAc/X,EAAMoU,kBAAoBpU,EAAMmW,eAE/C5tB,KAAKyX,EAAOrL,EAAM/C,EAC9B,EXmBE+d,OAAM,GACN3R,KY5BK,SAAcrJ,EAAM4L,EAAGP,EAAOpO,GACnC,OAAOoO,EAAM2U,KAAKhgB,EAAKvL,MAAOwI,EAChC,EZ2BE8P,ca5BK,SAAuBnB,EAAGkT,EAAIzT,GACnC,MAAM5W,GACJusB,GAAU3V,IAAUA,EAAMhX,QAAQivB,WAAa,IAAM,KACrD1B,OCTG,SAA6BvW,GAClC,MAAMkY,EAAalY,EAAMhX,QAAQmvB,gBAAkB,EAEnD,GAAID,EAAa,EACf,MAAM,IAAI3pB,MACR,2CACE2pB,EACA,wDAIN,OAAOA,CACT,CDHWE,CAAoBpY,IAE7B,OAAOA,EAAMhX,QAAQivB,WAAa7uB,EAAM0C,MAAM,GAAI,GAAK1C,CACzD,GEbarC,GAAO,CAGpB,SAAsB8O,EAAMC,EAAOmhB,EAAQjX,GAEzC,GACiB,SAAflK,EAAMzK,MACNuoB,GAAqB9d,EAAOkK,KACb,SAAdnK,EAAKxK,MACHwK,EAAKxK,OAASyK,EAAMzK,MAAQuoB,GAAqB/d,EAAMmK,IAE1D,OAAO,EAIT,GACgB,SAAdnK,EAAKxK,MACLwK,EAAKxK,OAASyK,EAAMzK,MACpBqJ,QAAQmB,EAAKmc,WAAatd,QAAQoB,EAAMkc,YACtCnc,EAAKmc,QACHhS,EAAMhX,QAAQouB,mBACdpX,EAAMhX,QAAQmuB,aAElB,OAAO,EAKT,GAAI,WAAYF,GAAmC,kBAAlBA,EAAOnI,OAAsB,CAC5D,GACgB,cAAdjZ,EAAKxK,OAEJwK,EAAKxK,OAASyK,EAAMzK,MACJ,eAAfyK,EAAMzK,MAEU,YAAfyK,EAAMzK,MAAsBipB,GAAsBxe,EAAOkK,IAE5D,OAGF,OAAOiX,EAAOnI,OAAS,EAAI,CAC7B,CACF,GCrCMuJ,GAAoB,CACxB,WACA,qBACA,iBACA,YACA,aACA,mBAIW3E,GAAS,CACpB,CAACC,UAAW,KAAMjR,MAAO,WAAY4Q,YAAa,YAClD,CAACK,UAAW,KAAMzd,OAAQ,WAAYod,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,IAAKjR,MAAO,WAAY4Q,YAAa,YACjD,CAACK,UAAW,IAAKzd,OAAQ,WAAYod,YAAa,YAClD,CACEK,UAAW,IACXL,YAAa,CAAC,4BAA6B,wBAI7C,CACEK,UAAW,IACXjR,MAAO,MACP4Q,YAAa,WACbC,eAAgB8E,IAGlB,CAAC1E,UAAW,IAAKL,YAAa,cAE9B,CAACpV,SAAS,EAAMyV,UAAW,KAC3B,CAACA,UAAW,IAAKL,YAAa,aAAc5Q,MAAO,gBAGnD,CAACiR,UAAW,IAAKjR,MAAO,YAAa4Q,YAAa,YAElD,CAACK,UAAW,IAAKL,YAAa,mBAE9B,CAACK,UAAW,IAAKL,YAAa,kBAE9B,CACEpd,OAAQ,MACRyd,UAAW,IACXL,YAAa,WACbC,eAAgB8E,IAIlB,CAACna,SAAS,EAAMhI,OAAQ,OAAQyd,UAAW,KAC3C,CAACA,UAAW,IAAKL,YAAa,kBAE9B,CAACpV,SAAS,EAAMyV,UAAW,IAAKjR,MAAO,kBACvC,CAACiR,UAAW,IAAKL,YAAa,WAAYC,eAAgB8E,IAE1D,CAACna,SAAS,EAAMyV,UAAW,IAAKjR,MAAO,iBAGvC,CAACxE,SAAS,EAAMyV,UAAW,IAAKjR,MAAO,kBAEvC,CAACxE,SAAS,EAAMhI,OAAQ,OAAQyd,UAAW,IAAKjR,MAAO,mBAOvD,CAACxE,SAAS,EAAMyV,UAAW,IAAKjR,MAAO,eACvC,CACEiR,UAAW,IACXjR,MAAO,cACP4Q,YAAa,WACbC,eAAgB8E,IAElB,CAAC1E,UAAW,IAAKL,YAAa,sBAE9B,CAACpV,SAAS,EAAMyV,UAAW,KAG3B,CAACzV,SAAS,EAAMyV,UAAW,KAC3B,CAACA,UAAW,IAAKL,YAAa,sBAG9B,CAACpV,SAAS,EAAMyV,UAAW,KAC3B,CAACA,UAAW,IAAKL,YAAa,WAAYC,eAAgB8E,IAC1D,CAAC1E,UAAW,IAAKL,YAAa,CAAC,QAAS,cAIxC,CAACK,UAAW,KAAMjR,MAAO,WAAY4Q,YAAa,YAElD,CAACK,UAAW,IAAKL,YAAa,CAAC,QAAS,cAGxC,CAACpV,SAAS,EAAMyV,UAAW,KAC3B,CAACA,UAAW,IAAKL,YAAa,WAAYC,eAAgB8E,IAG1D,CAACna,SAAS,EAAMyV,UAAW,KAC3B,CACEA,UAAW,IACXL,YAAa,CAAC,4BAA6B,8BAE7C,CAACK,UAAW,IAAKL,YAAa,WAAYC,eAAgB8E,IAI1D,CAACna,SAAS,EAAMyV,UAAW,MCvHtB,SAAS2E,GAAY3jB,GAC1B,OAAIA,EAAK6O,QAAU7O,EAAKyP,WACfzP,EAAK6O,OAAS,GAGhB6I,GAAa1X,EAAKyP,WAC3B,CCkCA,SAAS+E,GAAQtT,EAAMC,EAAOmhB,EAAQjX,GACpC,IAAIjL,EAAQiL,EAAMjZ,KAAKD,OAEvB,KAAOiO,KAAS,CACd,MAAM3I,EAAS4T,EAAMjZ,KAAKgO,GAAOc,EAAMC,EAAOmhB,EAAQjX,GAEtD,IAAe,IAAX5T,GAA8B,IAAXA,EACrB,MAGF,GAAsB,iBAAXA,EACT,MAAO,KAAKmqB,OAAO,EAAInqB,GAGzB,IAAe,IAAXA,EACF,MAAO,uBAEX,CAEA,MAAO,MACT,CClFA,MAAMmsB,GAAM,YAKL,SAASrC,GAAY9sB,EAAO3C,GAEjC,MAAM2F,EAAS,GACf,IAGImmB,EAHAtd,EAAQ,EACRoF,EAAO,EAIX,KAAQkY,EAAQgG,GAAI7F,KAAKtpB,IACvBmL,EAAInL,EAAM0C,MAAMmJ,EAAOsd,EAAMxd,QAC7B3I,EAAOzE,KAAK4qB,EAAM,IAClBtd,EAAQsd,EAAMxd,MAAQwd,EAAM,GAAGzrB,OAC/BuT,IAKF,OAFA9F,EAAInL,EAAM0C,MAAMmJ,IAET7I,EAAOrF,KAAK,IAKnB,SAASwN,EAAInL,GACXgD,EAAOzE,KAAKlB,EAAI2C,EAAOiR,GAAOjR,GAChC,CACF,CCyGA,SAASovB,GAAUC,EAAGC,GACpB,OAAOD,EAAIC,CACb,CAOA,SAASC,GAAkBvvB,EAAOsZ,GAChC,MAAMwS,EAAa,wBAEb0D,EAAY,GAEZC,EAAU,GACVC,EAAQ1vB,EAAQsZ,EACtB,IAGI6P,EAHAxd,GAAS,EACTE,EAAQ,EAIZ,KAAQsd,EAAQ2C,EAAWxC,KAAKoG,IAC9BF,EAAUjxB,KAAK4qB,EAAMxd,OAGvB,OAASA,EAAQ6jB,EAAU9xB,QACrBmO,IAAU2jB,EAAU7jB,IACtB8jB,EAAQlxB,KAAKyB,EAAM0C,MAAMmJ,EAAO2jB,EAAU7jB,KAG5C8jB,EAAQlxB,KAAK,MACbsN,EAAQ2jB,EAAU7jB,GAKpB,OAFA8jB,EAAQlxB,KAAKyB,EAAM0C,MAAMmJ,IAElB4jB,EAAQ9xB,KAAK,GACtB,CCpKO,SAASgyB,GAAM7L,GAIpB,MAAMlkB,EAAUkkB,GAAU,CAAC,EACrBhiB,EAAMlC,EAAQkC,KAAO,CAAC,EAC5B,IAAI8tB,EAAYhwB,EAAQgwB,WAAa,EACjC3e,EAAOnP,EAAImP,MAAQ,EACnBqE,EAASxT,EAAIwT,QAAU,EAE3B,MAAO,CAACyV,KAyBR,SAAcnhB,GAEZ,MAAM5J,EAAQ4J,GAAS,GACjBqL,EAASjV,EAAM6vB,MAAM,aACrB5b,EAAOgB,EAAOA,EAAOvX,OAAS,GAIpC,OAHAuT,GAAQgE,EAAOvX,OAAS,EACxB4X,EACoB,IAAlBL,EAAOvX,OAAe4X,EAASrB,EAAKvW,OAAS,EAAIuW,EAAKvW,OAASkyB,EAC1D5vB,CACT,EAlCcwT,QAOd,WACE,MAAO,CAAC1R,IAAK,CAACmP,OAAMqE,UAASsa,YAC/B,EATuB/C,MAgBvB,SAAe7sB,GACb4vB,GAAa5vB,CACf,EAiBF,CC6CA,SAAS8vB,GAAQ9vB,GACf,MAAM,IAAImF,MAAM,wBAA0BnF,EAAQ,mBACpD,CAMA,SAAS+vB,GAAQxkB,GAEf,MAAM,IAAIpG,MAAM,+BAAiCoG,EAAKtJ,KAAO,IAC/D,CAGA,SAAS+tB,GAAevjB,EAAMC,GAE5B,GAAkB,eAAdD,EAAKxK,MAAyBwK,EAAKxK,OAASyK,EAAMzK,KACpD,OAAO,CAEX,CAgBA,SAASguB,GAAuBpC,EAAQrlB,GACtC,OCpHK,SAA2BqlB,EAAQjX,EAAOpO,GAC/C,MAAM8lB,EAAa1X,EAAM0X,WACnB7iB,EAAWoiB,EAAOpiB,UAAY,GAE9BgkB,EAAU,GAChB,IAAI9jB,GAAS,EACTmB,EAAStE,EAAKsE,OAElBwhB,EAAW/vB,MAAM,GACjB,IAAIssB,EAAUjU,EAAMkU,cAActiB,GAElC,OAASmD,EAAQF,EAAS/N,QAAQ,CAChC,MAAMwyB,EAAQzkB,EAASE,GAEvB,IAAI2N,EAIJ,GAFAgV,EAAWA,EAAW5wB,OAAS,GAAKiO,EAEhCA,EAAQ,EAAIF,EAAS/N,OAAQ,CAG/B,IAAIivB,EAAS/V,EAAM+V,OAAOwD,SAAS1kB,EAASE,EAAQ,GAAG1J,MAGnD0qB,GAAUA,EAAO1B,OAAM0B,EAASA,EAAO1B,MAC3C3R,EAAQqT,EACJA,EAAOlhB,EAASE,EAAQ,GAAIkiB,EAAQjX,EAAO,CACzC9J,OAAQ,GACRwM,MAAO,MACJuR,EAAQrX,YACV4c,OAAO,GACV,EACN,MACE9W,EAAQ9Q,EAAK8Q,MAUbmW,EAAQ/xB,OAAS,IACL,OAAXoP,GAA8B,OAAXA,IACL,SAAfojB,EAAMjuB,OAENwtB,EAAQA,EAAQ/xB,OAAS,GAAK+xB,EAAQA,EAAQ/xB,OAAS,GAAG6E,QACxD,cACA,KAEFuK,EAAS,IAGT+d,EAAUjU,EAAMkU,cAActiB,GAC9BqiB,EAAQE,KAAK0E,EAAQ9xB,KAAK,MAG5B8xB,EAAQlxB,KACNssB,EAAQE,KACNnU,EAAM+V,OAAOuD,EAAOrC,EAAQjX,EAAO,IAC9BiU,EAAQrX,UACX1G,SACAwM,YAKNxM,EAAS2iB,EAAQA,EAAQ/xB,OAAS,GAAGgF,OAAO,EAC9C,CAIA,OAFA4rB,EAAW1a,MAEJ6b,EAAQ9xB,KAAK,GACtB,CD0CSqtB,CAAkB6C,EAAQzwB,KAAMoL,EACzC,CAiBA,SAAS6nB,GAAmBxC,EAAQrlB,GAClC,OJ3IK,SAAuBqlB,EAAQjX,EAAOpO,GAC3C,MAAM8lB,EAAa1X,EAAM0X,WACnB7iB,EAAWoiB,EAAOpiB,UAAY,GAC9Bof,EAAUjU,EAAMkU,cAActiB,GAE9BinB,EAAU,GAChB,IAAI9jB,GAAS,EAIb,IAFA2iB,EAAW/vB,MAAM,KAERoN,EAAQF,EAAS/N,QAAQ,CAChC,MAAMwyB,EAAQzkB,EAASE,GAEvB2iB,EAAWA,EAAW5wB,OAAS,GAAKiO,EAEpC8jB,EAAQlxB,KACNssB,EAAQE,KACNnU,EAAM+V,OAAOuD,EAAOrC,EAAQjX,EAAO,CACjC9J,OAAQ,KACRwM,MAAO,QACJuR,EAAQrX,cAKE,SAAf0c,EAAMjuB,OACR2U,EAAMuX,oBAAiBjwB,GAGrByN,EAAQF,EAAS/N,OAAS,GAC5B+xB,EAAQlxB,KACNssB,EAAQE,KAAKhL,GAAQmQ,EAAOzkB,EAASE,EAAQ,GAAIkiB,EAAQjX,IAG/D,CAIA,OAFA0X,EAAW1a,MAEJ6b,EAAQ9xB,KAAK,GACtB,CIoGSovB,CAAcc,EAAQzwB,KAAMoL,EACrC,CA2BA,SAAS8nB,GAAUtwB,EAAO8jB,GACxB,OFzJK,SAAclN,EAAOhN,EAAOka,GACjC,MAAM9jB,GAAS8jB,EAAOhX,QAAU,KAAOlD,GAAS,KAAOka,EAAOxK,OAAS,IAEjEkW,EAAY,GAEZxsB,EAAS,GAETutB,EAAQ,CAAC,EACf,IAAI5kB,GAAS,EAEb,OAASA,EAAQiL,EAAM0T,OAAO5sB,QAAQ,CACpC,MAAMssB,EAAUpT,EAAM0T,OAAO3e,GAE7B,IAAKoe,GAAenT,EAAMvH,MAAO2a,GAC/B,SAGF,MAAM8B,EAAaJ,GAAe1B,GAElC,IAAIb,EAEJ,KAAQA,EAAQ2C,EAAWxC,KAAKtpB,IAAS,CACvC,MAAM8M,EAAS,WAAYkd,GAAW1e,QAAQ0e,EAAQlV,SAChDwE,EAAQ,UAAW0Q,EACnBvG,EAAW0F,EAAMxd,OAASmB,EAASqc,EAAM,GAAGzrB,OAAS,GAEvD8xB,EAAUrd,SAASsR,IACjB8M,EAAM9M,GAAU3W,SAAWA,IAC7ByjB,EAAM9M,GAAU3W,QAAS,GAGvByjB,EAAM9M,GAAUnK,QAAUA,IAC5BiX,EAAM9M,GAAUnK,OAAQ,KAG1BkW,EAAUjxB,KAAKklB,GACf8M,EAAM9M,GAAY,CAAC3W,SAAQwM,SAE/B,CACF,CAEAkW,EAAUgB,KAAKpB,IAEf,IAAIvjB,EAAQiY,EAAOhX,OAASgX,EAAOhX,OAAOpP,OAAS,EACnD,MAAMsO,EAAMhM,EAAMtC,QAAUomB,EAAOxK,MAAQwK,EAAOxK,MAAM5b,OAAS,GAGjE,IAFAiO,GAAS,IAEAA,EAAQ6jB,EAAU9xB,QAAQ,CACjC,MAAM+lB,EAAW+L,EAAU7jB,GAGvB8X,EAAW5X,GAAS4X,GAAYzX,GAQjCyX,EAAW,EAAIzX,GACdwjB,EAAU7jB,EAAQ,KAAO8X,EAAW,GACpC8M,EAAM9M,GAAUnK,QACfiX,EAAM9M,EAAW,GAAG3W,SACpByjB,EAAM9M,EAAW,GAAGnK,OACtBkW,EAAU7jB,EAAQ,KAAO8X,EAAW,GACnC8M,EAAM9M,GAAU3W,SACfyjB,EAAM9M,EAAW,GAAG3W,SACpByjB,EAAM9M,EAAW,GAAGnK,QAKrBzN,IAAU4X,GAIZzgB,EAAOzE,KAAKgxB,GAAkBvvB,EAAM0C,MAAMmJ,EAAO4X,GAAW,OAG9D5X,EAAQ4X,GAGN,iBAAiBhhB,KAAKzC,EAAMowB,OAAO3M,KACjCK,EAAO2J,QAAW3J,EAAO2J,OAAOtb,SAASnS,EAAMowB,OAAO3M,KAMxDzgB,EAAOzE,KACL,MAAQyB,EAAMqV,WAAWoO,GAAUtmB,SAAS,IAAI2d,cAAgB,KAElEjP,KANA7I,EAAOzE,KAAK,MAQhB,CAIA,OAFAyE,EAAOzE,KAAKgxB,GAAkBvvB,EAAM0C,MAAMmJ,EAAOG,GAAM8X,EAAOxK,QAEvDtW,EAAOrF,KAAK,GACrB,CEsDS4tB,CAAKnuB,KAAM4C,EAAO8jB,EAC3B,CE/Ke,SAAS2M,GAAgB7wB,GAoBtCnB,OAAO4R,OAAOjT,KAAM,CAACszB,SAlBH5I,IAEhB,MAAM5c,EAAmC9N,KAAKgS,KAAK,YAEnD,OFkBG,SAAoB0Y,EAAMloB,EAAU,CAAC,GAE1C,MAAMgX,EAAQ,CACZtI,MAiDF,SAAezO,GAEb,OADA+W,EAAMvH,MAAM9Q,KAAKsB,GAGjB,WACE+W,EAAMvH,MAAMuE,KACd,CACF,EAvDEkZ,YAAW,GACXrB,cAAeyD,GACflE,kBAAmBiF,GACnBlD,cAAesD,GACfvF,cAAe6E,GACfpE,KAAM+E,GACNjhB,MAAO,GACPib,OAAQ,GACR3sB,KAAM,GAENwyB,SAAU,CAAC,EACXvwB,QAAS,CAAC,EACV0uB,WAAY,GAEZ3B,YAAQzuB,GAGV,GAAU0Y,EAAO,CAAC0T,OAAM,QAAM,YAAU,KACxC,GAAU1T,EAAOhX,GAEbgX,EAAMhX,QAAQ+wB,kBAChB,GAAU/Z,EAAO,CAACjZ,KAAM,CAACqyB,MAG3BpZ,EAAM+V,O/CDD,SAAgBrtB,EAAKM,GAC1B,MAAMsL,EAAWtL,GAAW,CAAC,EA8B7B,SAASuL,EAAInL,KAAUiM,GAErB,IAAIhG,EAAKkF,EAAI2kB,QACb,MAAMK,EAAWhlB,EAAIglB,SAErB,GAAInwB,GAAS,GAAIb,KAAKa,EAAOV,GAAM,CAEjC,MAAMjB,EAAK4L,OAAOjK,EAAMV,IAExB2G,EAAK,GAAI9G,KAAKgxB,EAAU9xB,GAAM8xB,EAAS9xB,GAAM8M,EAAI4kB,OACnD,CAEA,GAAI9pB,EACF,OAAOA,EAAG9G,KAAK/B,KAAM4C,KAAUiM,EAEnC,CAOA,OALAd,EAAIglB,SAAWjlB,EAASilB,UAAY,CAAC,EACrChlB,EAAI2kB,QAAU5kB,EAAS4kB,QACvB3kB,EAAI4kB,QAAU7kB,EAAS6kB,QAGhB5kB,CACT,C+CrDiBylB,CAAO,OAAQ,CAC5Bd,WACAC,WACAI,SAAUvZ,EAAMuZ,WAGlB,IAAIntB,EAAS4T,EAAM+V,OAAO7E,OAAM5pB,EAAW0Y,EAAO,CAChD9J,OAAQ,KACRwM,MAAO,KACPxX,IAAK,CAACmP,KAAM,EAAGqE,OAAQ,GACvBsa,UAAW,IAWb,OAPE5sB,GACyC,KAAzCA,EAAOqS,WAAWrS,EAAOtF,OAAS,IACO,KAAzCsF,EAAOqS,WAAWrS,EAAOtF,OAAS,KAElCsF,GAAU,MAGLA,CAWT,CE9EW6tB,CACL/I,EACArpB,OAAO4R,OAAO,CAAC,EAAGnF,EAAUtL,EAAS,CAInCmpB,WAEI3rB,KAAKgS,KAAK,yBACP,KAEX,GAIJ,CC1BO,SAAS0hB,GAAKroB,GACnB,GAAIA,EACF,MAAMA,CAEV,2BCXe,SAASrJ,GAAcY,GACrC,GAAqB,iBAAVA,GAAgC,OAAVA,EAChC,OAAO,EAGR,MAAMtB,EAAYD,OAAOsyB,eAAe/wB,GACxC,QAAsB,OAAdtB,GAAsBA,IAAcD,OAAOC,WAAkD,OAArCD,OAAOsyB,eAAeryB,IAA0BoL,OAAOknB,eAAehxB,GAAY8J,OAAOkB,YAAYhL,EACtK,CCKO,MAAMixB,WAAqB9rB,MAmBhC1F,YAAYyxB,EAAQC,EAAOC,GAEzB,MAAMC,EAAQ,CAAC,KAAM,MAErB,IAAI5N,EAAW,CAEb5X,MAAO,CAACoF,KAAM,KAAMqE,OAAQ,MAE5BtJ,IAAK,CAACiF,KAAM,KAAMqE,OAAQ,OAU5B,GAPAgc,QAEqB,iBAAVH,IACTC,EAASD,EACTA,OAAQjzB,GAGY,iBAAXkzB,EAAqB,CAC9B,MAAMzlB,EAAQylB,EAAO/D,QAAQ,MAEd,IAAX1hB,EACF0lB,EAAM,GAAKD,GAEXC,EAAM,GAAKD,EAAO1uB,MAAM,EAAGiJ,GAC3B0lB,EAAM,GAAKD,EAAO1uB,MAAMiJ,EAAQ,GAEpC,CAEIwlB,IAEE,SAAUA,GAAS,aAAcA,EAC/BA,EAAM1N,WAGRA,EAAW0N,EAAM1N,UAIZ,UAAW0N,GAAS,QAASA,EAGpC1N,EAAW0N,GAGJ,SAAUA,GAAS,WAAYA,KAEtC1N,EAAS5X,MAAQslB,IAWrB/zB,KAAKyC,KAAO2jB,GAAkB2N,IAAU,MAOxC/zB,KAAKm0B,QAA4B,iBAAXL,EAAsBA,EAAOK,QAAUL,EAU7D9zB,KAAKiS,MAAQ,GAES,iBAAX6hB,GAAuBA,EAAO7hB,QACvCjS,KAAKiS,MAAQ6hB,EAAO7hB,OAUtBjS,KAAK8zB,OAAS9zB,KAAKm0B,QAYnBn0B,KAAKo0B,MAOLp0B,KAAK6T,KAAOwS,EAAS5X,MAAMoF,KAO3B7T,KAAKkY,OAASmO,EAAS5X,MAAMyJ,OAO7BlY,KAAKqmB,SAAWA,EAOhBrmB,KAAKuN,OAAS0mB,EAAM,GAOpBj0B,KAAKq0B,OAASJ,EAAM,GAOpBj0B,KAAKs0B,KAYLt0B,KAAKu0B,OAOLv0B,KAAKkwB,SAULlwB,KAAKynB,IAOLznB,KAAKw0B,IAEP,EAGFX,GAAavyB,UAAUgzB,KAAO,GAC9BT,GAAavyB,UAAUmB,KAAO,GAC9BoxB,GAAavyB,UAAUwyB,OAAS,GAChCD,GAAavyB,UAAU6yB,QAAU,GACjCN,GAAavyB,UAAU2Q,MAAQ,GAC/B4hB,GAAavyB,UAAU8yB,MAAQ,KAC/BP,GAAavyB,UAAU4W,OAAS,KAChC2b,GAAavyB,UAAUuS,KAAO,KAC9BggB,GAAavyB,UAAUiM,OAAS,KAChCsmB,GAAavyB,UAAU+yB,OAAS,KAChCR,GAAavyB,UAAU+kB,SAAW,KC7K3B,MAAMoO,GAcb,SAAkBA,EAAMC,GACtB,QAAY5zB,IAAR4zB,GAAoC,iBAARA,EAC9B,MAAM,IAAIvuB,UAAU,mCAGtBwuB,GAAWF,GACX,IAIIG,EAJAnmB,EAAQ,EACRG,GAAO,EACPL,EAAQkmB,EAAKn0B,OAIjB,QAAYQ,IAAR4zB,GAAoC,IAAfA,EAAIp0B,QAAgBo0B,EAAIp0B,OAASm0B,EAAKn0B,OAAQ,CACrE,KAAOiO,KACL,GAA+B,KAA3BkmB,EAAKxc,WAAW1J,IAGlB,GAAIqmB,EAAc,CAChBnmB,EAAQF,EAAQ,EAChB,KACF,OACSK,EAAM,IAGfgmB,GAAe,EACfhmB,EAAML,EAAQ,GAIlB,OAAOK,EAAM,EAAI,GAAK6lB,EAAKnvB,MAAMmJ,EAAOG,EAC1C,CAEA,GAAI8lB,IAAQD,EACV,MAAO,GAGT,IAAII,GAAoB,EACpBC,EAAWJ,EAAIp0B,OAAS,EAE5B,KAAOiO,KACL,GAA+B,KAA3BkmB,EAAKxc,WAAW1J,IAGlB,GAAIqmB,EAAc,CAChBnmB,EAAQF,EAAQ,EAChB,KACF,OAEIsmB,EAAmB,IAGrBD,GAAe,EACfC,EAAmBtmB,EAAQ,GAGzBumB,GAAY,IAEVL,EAAKxc,WAAW1J,KAAWmmB,EAAIzc,WAAW6c,KACxCA,EAAW,IAGblmB,EAAML,IAKRumB,GAAY,EACZlmB,EAAMimB,IAYd,OANIpmB,IAAUG,EACZA,EAAMimB,EACGjmB,EAAM,IACfA,EAAM6lB,EAAKn0B,QAGNm0B,EAAKnvB,MAAMmJ,EAAOG,EAC3B,EA9Fa6lB,GAwGb,SAAiBA,GAGf,GAFAE,GAAWF,GAES,IAAhBA,EAAKn0B,OACP,MAAO,IAGT,IAGIy0B,EAHAnmB,GAAO,EACPL,EAAQkmB,EAAKn0B,OAKjB,OAASiO,GACP,GAA+B,KAA3BkmB,EAAKxc,WAAW1J,IAClB,GAAIwmB,EAAgB,CAClBnmB,EAAML,EACN,KACF,OACUwmB,IAEVA,GAAiB,GAIrB,OAAOnmB,EAAM,EACc,KAAvB6lB,EAAKxc,WAAW,GACd,IACA,IACM,IAARrJ,GAAoC,KAAvB6lB,EAAKxc,WAAW,GAC7B,KACAwc,EAAKnvB,MAAM,EAAGsJ,EACpB,EAxIa6lB,GAkJb,SAAiBA,GACfE,GAAWF,GAEX,IASIM,EATAxmB,EAAQkmB,EAAKn0B,OAEbsO,GAAO,EACPomB,EAAY,EACZC,GAAY,EAGZC,EAAc,EAIlB,KAAO3mB,KAAS,CACd,MAAMgB,EAAOklB,EAAKxc,WAAW1J,GAE7B,GAAa,KAATgB,EAWAX,EAAM,IAGRmmB,GAAiB,EACjBnmB,EAAML,EAAQ,GAGH,KAATgB,EAEE0lB,EAAW,EACbA,EAAW1mB,EACc,IAAhB2mB,IACTA,EAAc,GAEPD,GAAY,IAGrBC,GAAe,QAzBf,GAAIH,EAAgB,CAClBC,EAAYzmB,EAAQ,EACpB,KACF,CAwBJ,CAEA,OACE0mB,EAAW,GACXrmB,EAAM,GAEU,IAAhBsmB,GAEiB,IAAhBA,GAAqBD,IAAarmB,EAAM,GAAKqmB,IAAaD,EAAY,EAEhE,GAGFP,EAAKnvB,MAAM2vB,EAAUrmB,EAC9B,EA/Ma6lB,GAyNb,YAAiBU,GACf,IAEIC,EAFA7mB,GAAS,EAIb,OAASA,EAAQ4mB,EAAS70B,QACxBq0B,GAAWQ,EAAS5mB,IAEhB4mB,EAAS5mB,KACX6mB,OACat0B,IAAXs0B,EAAuBD,EAAS5mB,GAAS6mB,EAAS,IAAMD,EAAS5mB,IAIvE,YAAkBzN,IAAXs0B,EAAuB,IAahC,SAAmBX,GACjBE,GAAWF,GAEX,MAAMY,EAAkC,KAAvBZ,EAAKxc,WAAW,GAGjC,IAAIrV,EAuBN,SAAyB6xB,EAAMa,GAC7B,IAMI/lB,EAEAgmB,EARA3vB,EAAS,GACT4vB,EAAoB,EACpBC,GAAa,EACbC,EAAO,EACPnnB,GAAS,EAMb,OAASA,GAASkmB,EAAKn0B,QAAQ,CAC7B,GAAIiO,EAAQkmB,EAAKn0B,OACfiP,EAAOklB,EAAKxc,WAAW1J,OAClB,IAAa,KAATgB,EACT,MAEAA,EAAO,EACT,CAEA,GAAa,KAATA,EAAuB,CACzB,GAAIkmB,IAAclnB,EAAQ,GAAc,IAATmnB,QAExB,GAAID,IAAclnB,EAAQ,GAAc,IAATmnB,EAAY,CAChD,GACE9vB,EAAOtF,OAAS,GACM,IAAtBk1B,GACyC,KAAzC5vB,EAAOqS,WAAWrS,EAAOtF,OAAS,IACO,KAAzCsF,EAAOqS,WAAWrS,EAAOtF,OAAS,GAElC,GAAIsF,EAAOtF,OAAS,GAGlB,GAFAi1B,EAAiB3vB,EAAO2qB,YAAY,KAEhCgF,IAAmB3vB,EAAOtF,OAAS,EAAG,CACpCi1B,EAAiB,GACnB3vB,EAAS,GACT4vB,EAAoB,IAEpB5vB,EAASA,EAAON,MAAM,EAAGiwB,GACzBC,EAAoB5vB,EAAOtF,OAAS,EAAIsF,EAAO2qB,YAAY,MAG7DkF,EAAYlnB,EACZmnB,EAAO,EACP,QACF,OACK,GAAI9vB,EAAOtF,OAAS,EAAG,CAC5BsF,EAAS,GACT4vB,EAAoB,EACpBC,EAAYlnB,EACZmnB,EAAO,EACP,QACF,CAGEJ,IACF1vB,EAASA,EAAOtF,OAAS,EAAIsF,EAAS,MAAQ,KAC9C4vB,EAAoB,EAExB,MACM5vB,EAAOtF,OAAS,EAClBsF,GAAU,IAAM6uB,EAAKnvB,MAAMmwB,EAAY,EAAGlnB,GAE1C3I,EAAS6uB,EAAKnvB,MAAMmwB,EAAY,EAAGlnB,GAGrCinB,EAAoBjnB,EAAQknB,EAAY,EAG1CA,EAAYlnB,EACZmnB,EAAO,CACT,MAAoB,KAATnmB,GAAyBmmB,GAAQ,EAC1CA,IAEAA,GAAQ,CAEZ,CAEA,OAAO9vB,CACT,CAtGc+vB,CAAgBlB,GAAOY,GAUnC,OARqB,IAAjBzyB,EAAMtC,QAAiB+0B,IACzBzyB,EAAQ,KAGNA,EAAMtC,OAAS,GAA0C,KAArCm0B,EAAKxc,WAAWwc,EAAKn0B,OAAS,KACpDsC,GAAS,KAGJyyB,EAAW,IAAMzyB,EAAQA,CAClC,CA9BsCgzB,CAAUR,EAChD,EAxOaX,GAAwC,IA0WrD,SAASE,GAAWF,GAClB,GAAoB,iBAATA,EACT,MAAM,IAAItuB,UACR,mCAAqC0vB,KAAKC,UAAUrB,GAG1D,CChaO,MAAMsB,GAEb,WACE,MAAO,GACT,ECoBO,SAASC,GAAMC,GACpB,OACoB,OAAlBA,GACyB,iBAAlBA,GAEPA,EAAcC,MAEdD,EAAcjC,MAElB,CC8DA,MAAMmC,GAAQ,CAAC,UAAW,OAAQ,WAAY,OAAQ,UAAW,WAE1D,MAAMC,GAuBX/zB,YAAYO,GAEV,IAAIJ,EAKFA,EAHGI,EAEuB,iBAAVA,GAoYtB,SAAgBA,GACd,OAAO,GAAWA,EACpB,CAtY4Coc,CAAOpc,GACnC,CAACA,SACFozB,GAAMpzB,GACL,CAAC6xB,KAAM7xB,GAEPA,EANA,CAAC,EAiBb5C,KAAKgS,KAAO,CAAC,EAObhS,KAAKq2B,SAAW,GAShBr2B,KAAKs2B,QAAU,GAOft2B,KAAKu2B,IAAMR,KAQX/1B,KAAK4C,MAYL5C,KAAKw2B,OAULx2B,KAAK4F,OAUL5F,KAAKC,IAIL,IAkBIw2B,EAlBAloB,GAAS,EAEb,OAASA,EAAQ4nB,GAAM71B,QAAQ,CAC7B,MAAMm2B,EAAON,GAAM5nB,GAKjBkoB,KAAQj0B,QACU1B,IAAlB0B,EAAQi0B,IACU,OAAlBj0B,EAAQi0B,KAGRz2B,KAAKy2B,GAAiB,YAATA,EAAqB,IAAIj0B,EAAQi0B,IAASj0B,EAAQi0B,GAEnE,CAMA,IAAKA,KAAQj0B,EAEN2zB,GAAMphB,SAAS0hB,KAElBz2B,KAAKy2B,GAAQj0B,EAAQi0B,GAG3B,CAOIhC,WACF,OAAOz0B,KAAKs2B,QAAQt2B,KAAKs2B,QAAQh2B,OAAS,EAC5C,CAWIm0B,SAAKA,GACHuB,GAAMvB,KACRA,EC1PC,SAAmBA,GACxB,GAAoB,iBAATA,EACTA,EAAO,IAAIiC,IAAIjC,QACV,IAAKuB,GAAMvB,GAAO,CAEvB,MAAMppB,EAAQ,IAAIlF,UAChB,+EACEsuB,EACA,KAGJ,MADAppB,EAAMkE,KAAO,uBACPlE,CACR,CAEA,GAAsB,UAAlBopB,EAAKkC,SAAsB,CAE7B,MAAMtrB,EAAQ,IAAIlF,UAAU,kCAE5B,MADAkF,EAAMkE,KAAO,yBACPlE,CACR,CAEA,OAWF,SAA6Boc,GAC3B,GAAqB,KAAjBA,EAAImP,SAAiB,CAEvB,MAAMvrB,EAAQ,IAAIlF,UAChB,wDAGF,MADAkF,EAAMkE,KAAO,4BACPlE,CACR,CAEA,MAAMwrB,EAAWpP,EAAIoP,SACrB,IAAItoB,GAAS,EAEb,OAASA,EAAQsoB,EAASv2B,QACxB,GACiC,KAA/Bu2B,EAAS5e,WAAW1J,IACe,KAAnCsoB,EAAS5e,WAAW1J,EAAQ,GAC5B,CACA,MAAMuoB,EAAQD,EAAS5e,WAAW1J,EAAQ,GAC1C,GAAc,KAAVuoB,GAAoC,MAAVA,EAAyB,CAErD,MAAMzrB,EAAQ,IAAIlF,UAChB,uDAGF,MADAkF,EAAMkE,KAAO,4BACPlE,CACR,CACF,CAGF,OAAO0rB,mBAAmBF,EAC5B,CA1CSG,CAAoBvC,EAC7B,CDoOawC,CAAUxC,IAGnByC,GAAezC,EAAM,QAEjBz0B,KAAKy0B,OAASA,GAChBz0B,KAAKs2B,QAAQn1B,KAAKszB,EAEtB,CAKI0C,cACF,MAA4B,iBAAdn3B,KAAKy0B,KAAoBA,GAAaz0B,KAAKy0B,WAAQ3zB,CACnE,CAOIq2B,YAAQA,GACV,GAAWn3B,KAAKo3B,SAAU,WAC1Bp3B,KAAKy0B,KAAOA,GAAU0C,GAAW,GAAIn3B,KAAKo3B,SAC5C,CAKIA,eACF,MAA4B,iBAAdp3B,KAAKy0B,KAAoBA,GAAcz0B,KAAKy0B,WAAQ3zB,CACpE,CASIs2B,aAASA,GACXF,GAAeE,EAAU,YACzBC,GAAWD,EAAU,YACrBp3B,KAAKy0B,KAAOA,GAAUz0B,KAAKm3B,SAAW,GAAIC,EAC5C,CAKIE,cACF,MAA4B,iBAAdt3B,KAAKy0B,KAAoBA,GAAaz0B,KAAKy0B,WAAQ3zB,CACnE,CASIw2B,YAAQA,GAIV,GAHAD,GAAWC,EAAS,WACpB,GAAWt3B,KAAKm3B,QAAS,WAErBG,EAAS,CACX,GAA8B,KAA1BA,EAAQrf,WAAW,GACrB,MAAM,IAAIlQ,MAAM,iCAGlB,GAAIuvB,EAAQviB,SAAS,IAAK,GACxB,MAAM,IAAIhN,MAAM,yCAEpB,CAEA/H,KAAKy0B,KAAOA,GAAUz0B,KAAKm3B,QAASn3B,KAAKu3B,MAAQD,GAAW,IAC9D,CAKIC,WACF,MAA4B,iBAAdv3B,KAAKy0B,KACfA,GAAcz0B,KAAKy0B,KAAMz0B,KAAKs3B,cAC9Bx2B,CACN,CASIy2B,SAAKA,GACPL,GAAeK,EAAM,QACrBF,GAAWE,EAAM,QACjBv3B,KAAKy0B,KAAOA,GAAUz0B,KAAKm3B,SAAW,GAAII,GAAQv3B,KAAKs3B,SAAW,IACpE,CAWAv3B,SAAS0mB,GACP,OAAQzmB,KAAK4C,OAAS,IAAI7C,SAAS0mB,QAAY3lB,EACjD,CAkBAqzB,QAAQL,EAAQC,EAAOC,GACrB,MAAMG,EAAU,IAAIN,GAAaC,EAAQC,EAAOC,GAWhD,OATIh0B,KAAKy0B,OACPN,EAAQ1xB,KAAOzC,KAAKy0B,KAAO,IAAMN,EAAQ1xB,KACzC0xB,EAAQG,KAAOt0B,KAAKy0B,MAGtBN,EAAQC,OAAQ,EAEhBp0B,KAAKq2B,SAASl1B,KAAKgzB,GAEZA,CACT,CAkBA/oB,KAAK0oB,EAAQC,EAAOC,GAClB,MAAMG,EAAUn0B,KAAKm0B,QAAQL,EAAQC,EAAOC,GAI5C,OAFAG,EAAQC,MAAQ,KAETD,CACT,CAsBAqD,KAAK1D,EAAQC,EAAOC,GAClB,MAAMG,EAAUn0B,KAAKm0B,QAAQL,EAAQC,EAAOC,GAI5C,MAFAG,EAAQC,OAAQ,EAEVD,CACR,EAaF,SAASkD,GAAWI,EAAMh1B,GACxB,GAAIg1B,GAAQA,EAAK1iB,SAAS0f,IACxB,MAAM,IAAI1sB,MACR,IAAMtF,EAAO,uCAAyCgyB,GAAW,IAGvE,CAYA,SAASyC,GAAeO,EAAMh1B,GAC5B,IAAKg1B,EACH,MAAM,IAAI1vB,MAAM,IAAMtF,EAAO,oBAEjC,CAYA,SAAS,GAAWgyB,EAAMhyB,GACxB,IAAKgyB,EACH,MAAM,IAAI1sB,MAAM,YAActF,EAAO,kCAEzC,CE/dO,MAAMi1B,GAQb,SAASvuB,IACP,MAAMwuB,ECpBD,WAEL,MAAMC,EAAM,GAENC,EAAW,CAACC,IAKlB,YAAgBxpB,GACd,IAAIypB,GAAmB,EAEvB,MAAMC,EAAW1pB,EAAOkI,MAExB,GAAwB,mBAAbwhB,EACT,MAAM,IAAI7xB,UAAU,2CAA6C6xB,IAWnE,SAASjmB,EAAK1G,KAAU4sB,GACtB,MAAMpvB,EAAK+uB,IAAMG,GACjB,IAAIxpB,GAAS,EAEb,GAAIlD,EACF2sB,EAAS3sB,OADX,CAMA,OAASkD,EAAQD,EAAOhO,QACA,OAAlB23B,EAAO1pB,SAAqCzN,IAAlBm3B,EAAO1pB,KACnC0pB,EAAO1pB,GAASD,EAAOC,IAK3BD,EAAS2pB,EAGLpvB,EA6BH,SAAcqvB,EAAYF,GAE/B,IAAI3f,EAEJ,OAQA,YAAoBxJ,GAClB,MAAMspB,EAAoBD,EAAW53B,OAASuO,EAAWvO,OAEzD,IAAIsF,EAEAuyB,GACFtpB,EAAW1N,KAAKmK,GAGlB,IACE1F,EAASsyB,EAAW1xB,MAAMxG,KAAM6O,EAClC,CAAE,MAAOxD,GAOP,GAAI8sB,GAAqB9f,EACvB,MAPqC,EAUvC,OAAO/M,EAVgC,EAWzC,CAEK6sB,IACCvyB,aAAkB2F,QACpB3F,EAAO4F,KAAKA,EAAMF,GACT1F,aAAkBmC,MAC3BuD,EAAK1F,GAEL4F,EAAK5F,GAGX,EAMA,SAAS0F,EAAKD,KAAU4sB,GACjB5f,IACHA,GAAS,EACT2f,EAAS3sB,KAAU4sB,GAEvB,CAOA,SAASzsB,EAAK5I,GACZ0I,EAAK,KAAM1I,EACb,CACF,CA/FQw1B,CAAKvvB,EAAIkJ,EAATqmB,IAAkBH,GAElBD,EAAS,QAASC,EAhBpB,CAkBF,CAjCAlmB,CAAK,QAASzD,EAkChB,EAhDuB6U,IAmDvB,SAAakV,GACX,GAA0B,mBAAfA,EACT,MAAM,IAAIlyB,UACR,+CAAiDkyB,GAKrD,OADAT,EAAIz2B,KAAKk3B,GACFR,CACT,GA1DA,OAAOA,CA2DT,CD7CuBS,GAEfC,EAAY,GAElB,IAEIC,EAFAC,EAAY,CAAC,EAGbC,GAAe,EA2BnB,OAvBAC,EAAU3mB,KA6CV,SAAc9P,EAAKU,GACjB,MAAmB,iBAARV,EAEgB,IAArBmB,UAAU/C,QACZs4B,GAAe,OAAQJ,GACvBC,EAAUv2B,GAAOU,EACV+1B,GAID,GAAI52B,KAAK02B,EAAWv2B,IAAQu2B,EAAUv2B,IAAS,KAIrDA,GACF02B,GAAe,OAAQJ,GACvBC,EAAYv2B,EACLy2B,GAIFF,CACT,EAlEAE,EAAUnM,YAAS1rB,EACnB63B,EAAUrF,cAAWxyB,EAGrB63B,EAAUE,OAiEV,WACE,GAAIL,EACF,OAAOG,EAGT,OAASD,EAAcH,EAAUj4B,QAAQ,CACvC,MAAOw4B,KAAat2B,GAAW+1B,EAAUG,GAEzC,IAAmB,IAAfl2B,EAAQ,GACV,UAGiB,IAAfA,EAAQ,KACVA,EAAQ,QAAK1B,GAIf,MAAMi4B,EAAcD,EAAS/2B,KAAK42B,KAAcn2B,GAErB,mBAAhBu2B,GACTpB,EAAaxU,IAAI4V,EAErB,CAKA,OAHAP,GAAS,EACTE,EAAc3nB,OAAOC,kBAEd2nB,CACT,EA1FAA,EAAUJ,UAAYA,EAEtBI,EAAUxV,IA+FV,SAAavgB,KAAUJ,GAErB,IAAIsL,EAIJ,GAFA8qB,GAAe,MAAOJ,GAElB51B,cAEG,GAAqB,mBAAVA,EAChBo2B,EAAUp2B,KAAUJ,OACf,IAAqB,iBAAVI,EAOhB,MAAM,IAAIuD,UAAU,+BAAiCvD,EAAQ,KANzDd,MAAMF,QAAQgB,GAChBq2B,EAAQr2B,GAERs2B,EAAUt2B,EAId,CAMA,OAJIkL,IACF2qB,EAAU3qB,SAAWzM,OAAO4R,OAAOwlB,EAAU3qB,UAAY,CAAC,EAAGA,IAGxD6qB,EAMP,SAAShpB,EAAI/M,GACX,GAAqB,mBAAVA,EACTo2B,EAAUp2B,OACL,IAAqB,iBAAVA,EAQhB,MAAM,IAAIuD,UAAU,+BAAiCvD,EAAQ,KAP7D,GAAId,MAAMF,QAAQgB,GAAQ,CACxB,MAAOu2B,KAAW32B,GAAWI,EAC7Bo2B,EAAUG,KAAW32B,EACvB,MACE02B,EAAUt2B,EAId,CACF,CAMA,SAASs2B,EAAUtzB,GACjBqzB,EAAQrzB,EAAOwzB,SAEXxzB,EAAOkI,WACTA,EAAWzM,OAAO4R,OAAOnF,GAAY,CAAC,EAAGlI,EAAOkI,UAEpD,CAMA,SAASmrB,EAAQG,GACf,IAAI7qB,GAAS,EAEb,GAAI6qB,aAEG,KAAIt3B,MAAMF,QAAQw3B,GAMvB,MAAM,IAAIjzB,UAAU,oCAAsCizB,EAAU,KALpE,OAAS7qB,EAAQ6qB,EAAQ94B,QAEvBqP,EADcypB,EAAQ7qB,GAK1B,CACF,CAOA,SAASyqB,EAAUG,EAAQv2B,GACzB,IAEI8R,EAFAnG,GAAS,EAIb,OAASA,EAAQgqB,EAAUj4B,QACzB,GAAIi4B,EAAUhqB,GAAO,KAAO4qB,EAAQ,CAClCzkB,EAAQ6jB,EAAUhqB,GAClB,KACF,CAGEmG,GACE,GAAWA,EAAM,KAAO,GAAW9R,KACrCA,EAAQI,IAAO,EAAM0R,EAAM,GAAI9R,IAGjC8R,EAAM,GAAK9R,GAGX21B,EAAUp3B,KAAK,IAAIkC,WAEvB,CACF,EApMAs1B,EAAU9M,MAuMV,SAAeY,GACbkM,EAAUE,SACV,MAAMvE,EAAO+E,GAAM5M,GACbD,EAASmM,EAAUnM,OAGzB,OAFA8M,GAAa,QAAS9M,GAElB+M,GAAQ/M,EAAQ,SAEX,IAAIA,EAAO3f,OAAOynB,GAAOA,GAAMzI,QAIjCW,EAAO3f,OAAOynB,GAAOA,EAC9B,EAnNAqE,EAAU7C,UAsNV,SAAmB3nB,EAAMse,GACvBkM,EAAUE,SACV,MAAMvE,EAAO+E,GAAM5M,GACb6G,EAAWqF,EAAUrF,SAI3B,OAHAkG,GAAe,YAAalG,GAC5BmG,GAAWtrB,GAEPorB,GAAQjG,EAAU,WAEb,IAAIA,EAASnlB,EAAMmmB,GAAMoF,UAI3BpG,EAASnlB,EAAMmmB,EACxB,EAlOAqE,EAAUb,IA0OV,SAAa3pB,EAAMse,EAAKuL,GAStB,GARAyB,GAAWtrB,GACXwqB,EAAUE,SAELb,GAA2B,mBAARvL,IACtBuL,EAAWvL,EACXA,OAAM3rB,IAGHk3B,EACH,OAAO,IAAIzsB,QAAQouB,GAUrB,SAASA,EAAS5uB,EAASC,GAEzB2sB,EAAaG,IAAI3pB,EAAMkrB,GAAM5M,IAQ7B,SAAcphB,EAAOqf,EAAM4J,GACzB5J,EAAOA,GAAQvc,EACX9C,EACFL,EAAOK,GACEN,EACTA,EAAQ2f,GAGRsN,EAAS,KAAMtN,EAAM4J,EAEzB,GACF,CA5BAqF,EAAS,KAAM3B,EA6BjB,EAnRAW,EAAUiB,QAsRV,SAAiBzrB,EAAMmmB,GAErB,IAAI1uB,EAEAi0B,EAOJ,OALAlB,EAAUb,IAAI3pB,EAAMmmB,GAYpB,SAAcjpB,EAAOqf,GACnBgJ,GAAKroB,GACLzF,EAAS8kB,EACTmP,GAAW,CACb,IAdAC,GAAW,UAAW,MAAOD,GAGtBj0B,CAYT,EA3SA+yB,EAAUoB,QAkTV,SAAiBtN,EAAKuL,GAKpB,GAJAW,EAAUE,SACVS,GAAa,UAAWX,EAAUnM,QAClCgN,GAAe,UAAWb,EAAUrF,WAE/B0E,EACH,OAAO,IAAIzsB,QAAQouB,GAUrB,SAASA,EAAS5uB,EAASC,GACzB,MAAMspB,EAAO+E,GAAM5M,GA0BnB,SAASnhB,EAAKD,EAAOipB,GACfjpB,IAAUipB,EACZtpB,EAAOK,GACEN,EACTA,EAAQupB,GAGR0D,EAAS,KAAM1D,EAEnB,CAjCAqE,EAAUb,IAAIa,EAAU9M,MAAMyI,GAAOA,GAAM,CAACjpB,EAAOqf,EAAM4J,KACvD,IAAIjpB,GAAUqf,GAAS4J,EAEhB,CAEL,MAAM1uB,EAAS+yB,EAAU7C,UAAUpL,EAAM4J,GAErC1uB,UAsMY,iBADIhD,EAnMYgD,IAoMJ,GAAShD,GAnMnC0xB,EAAK1xB,MAAQgD,EAEb0uB,EAAK1uB,OAASA,GAGhB0F,EAAKD,EAAOipB,EACd,MAdEhpB,EAAKD,GA0Mf,IAA8BzI,CA5LtB,GAkBJ,CA5CA+2B,EAAS,KAAM3B,EA6CjB,EAvWAW,EAAUqB,YA0WV,SAAqBvN,GAEnB,IAAIoN,EAEJlB,EAAUE,SACVS,GAAa,cAAeX,EAAUnM,QACtCgN,GAAe,cAAeb,EAAUrF,UAExC,MAAMgB,EAAO+E,GAAM5M,GAMnB,OAJAkM,EAAUoB,QAAQzF,GAUlB,SAAcjpB,GACZwuB,GAAW,EACXnG,GAAKroB,EACP,IAXAyuB,GAAW,cAAe,UAAWD,GAE9BvF,CAUT,EA/XOqE,EAIP,SAASA,IACP,MAAMsB,EAAc9wB,IACpB,IAAIoF,GAAS,EAEb,OAASA,EAAQgqB,EAAUj4B,QACzB25B,EAAY9W,OAAOoV,EAAUhqB,IAK/B,OAFA0rB,EAAYjoB,KAAKhP,IAAO,EAAM,CAAC,EAAGy1B,IAE3BwB,CACT,CAiXF,CA3auB9wB,GAAO0vB,SAExB,GAAM,CAAC,EAAEt3B,eAkbf,SAASg4B,GAAQ32B,EAAOH,GACtB,MACmB,mBAAVG,GAGPA,EAAMtB,YAeV,SAAcsB,GAEZ,IAAIV,EAEJ,IAAKA,KAAOU,EACV,GAAI,GAAIb,KAAKa,EAAOV,GAClB,OAAO,EAIX,OAAO,CACT,CArBK+K,CAAKrK,EAAMtB,YAAcmB,KAAQG,EAAMtB,UAE5C,CA4BA,SAASg4B,GAAa72B,EAAMG,GAC1B,GAAqB,mBAAVA,EACT,MAAM,IAAIuD,UAAU,WAAa1D,EAAO,qBAE5C,CASA,SAAS+2B,GAAe/2B,EAAMG,GAC5B,GAAqB,mBAAVA,EACT,MAAM,IAAIuD,UAAU,WAAa1D,EAAO,uBAE5C,CASA,SAASm2B,GAAen2B,EAAM+1B,GAC5B,GAAIA,EACF,MAAM,IAAIzwB,MACR,gBACEtF,EACA,mHAGR,CAQA,SAASg3B,GAAWtrB,GAGlB,IAAK,GAAWA,IAA8B,iBAAdA,EAAKtJ,KACnC,MAAM,IAAIsB,UAAU,uBAAyBgI,EAAO,IAGxD,CAUA,SAAS2rB,GAAWr3B,EAAMy3B,EAAWL,GACnC,IAAKA,EACH,MAAM,IAAI9xB,MACR,IAAMtF,EAAO,0BAA4By3B,EAAY,YAG3D,CAMA,SAASb,GAAMz2B,GACb,OAOF,SAAyBA,GACvB,OAAOsL,QACLtL,GACmB,iBAAVA,GACP,YAAaA,GACb,aAAcA,EAEpB,CAdSu3B,CAAgBv3B,GAASA,EAAQ,IAAIwzB,GAAMxzB,EACpD,KEhhBIqvB,GAAGnqB,GAAGsyB,GAAGC,GAAGC,GAAGC,GAAGC,aAjDlBC,GAAIp5B,OAAOI,eAEXi5B,GAAI,CAACC,EAAGC,EAAGC,KADP,EAACF,EAAGC,EAAGC,KAAMD,KAAKD,EAAIF,GAAEE,EAAGC,EAAG,CAAEl4B,YAAY,EAAIC,cAAc,EAAIG,UAAU,EAAIF,MAAOi4B,IAAOF,EAAEC,GAAKC,CAAC,EACxFC,CAAEH,EAAe,iBAALC,EAAgBA,EAAI,GAAKA,EAAGC,GAAIA,GAAIE,GAAI,CAACJ,EAAGC,EAAGC,KAC/E,IAAKD,EAAE/uB,IAAI8uB,GACT,MAAMx0B,UAAU,UAAY00B,EAAE,EAE9Br6B,GAAI,CAACm6B,EAAGC,EAAGC,KAAOE,GAAEJ,EAAGC,EAAG,2BAA4BC,EAAIA,EAAE94B,KAAK44B,GAAKC,EAAEpyB,IAAImyB,IAAKlwB,GAAI,CAACkwB,EAAGC,EAAGC,KAC9F,GAAID,EAAE/uB,IAAI8uB,GACR,MAAMx0B,UAAU,qDAClBy0B,aAAaI,QAAUJ,EAAEjrB,IAAIgrB,GAAKC,EAAEnyB,IAAIkyB,EAAGE,EAAE,EAC5CI,GAAI,CAACN,EAAGC,EAAGC,EAAGrwB,KAAOuwB,GAAEJ,EAAGC,EAAG,0BAA2BpwB,EAAIA,EAAEzI,KAAK44B,EAAGE,GAAKD,EAAEnyB,IAAIkyB,EAAGE,GAAIA,GAG3F,MAAMK,IAEN,MAAMC,GACJ94B,cACEq4B,GAAE16B,KAAM,WAAY,IACpB06B,GAAE16B,KAAM,QAAQ,IAAMA,KAAKo7B,SAAS96B,SACpCo6B,GAAE16B,KAAM,OAAO,IAAMA,KAAKo7B,SAASC,IAAI,KACvCX,GAAE16B,KAAM,QAAS46B,IACf,IAAIC,EACgB,OAAnBA,EAAI76B,KAAKs7B,QAAkBT,EAAE15B,KAAKy5B,EAAE,IAEvCF,GAAE16B,KAAM,QAAS46B,IACf56B,KAAKo7B,SAASj6B,KAAKy5B,EAAE,IAEvBF,GAAE16B,KAAM,SAAS,KACf,MAAM46B,EAAI56B,KAAKo7B,SAAS5kB,MACxB,IAAKokB,EACH,MAAM,WACR,OAAOA,CAAC,GAEZ,EAEF,MAAMW,WAAUL,GACd74B,YAAYu4B,EAAGC,EAAGrwB,GAChB0pB,QAASl0B,KAAK6E,KAAO+1B,EAAG56B,KAAKG,QAAU06B,EAAG76B,KAAKw7B,MAAQhxB,CACzD,CACArJ,KAAKy5B,KAAMC,GACT76B,KAAKG,QAAQgB,KAAKy5B,KAAMC,EAC1B,CACArkB,MACE,OAAOxW,KAAKG,QAAQqW,KACtB,CACAilB,cAAcb,EAAGC,EAAGrwB,GAClB,OAAO,IAAI+wB,GAAEX,EAAGC,EAAGrwB,EACrB,EAGF,MAAMkxB,GAAI,cAAcP,GACtB94B,YAAYw4B,GACV3G,QACAwG,GAAE16B,KAAM,UACRyK,GAAEzK,KAAMiyB,GAAG,WACXxnB,GAAEzK,KAAM8H,IAAI+yB,GAAMA,EAAEc,SACpBlxB,GAAEzK,KAAMo6B,IAAG,CAACS,EAAGrwB,KACb,GAAIhK,GAAER,KAAM8H,IAAG/F,KAAK/B,KAAM66B,IAAMr6B,GAAER,KAAM8H,IAAG/F,KAAK/B,KAAMwK,IAAM,aAAUqwB,EAAEe,MAAOpxB,EAAEoxB,OAC/E,OAAO57B,KAAK67B,OAAOrkB,KAAKqjB,EAAErjB,KAAOhN,EAAEgN,KAAMqjB,EAAEe,MAAM,IAErDnxB,GAAEzK,KAAMq6B,IAAIQ,IACV,MAAMrwB,EAAInJ,OAAOiN,OAAO,IAAKtO,KAAK67B,OAAOC,SAAU97B,KAAK67B,OAAOD,QAASG,MAAMC,GAAMA,EAAEC,KAAKC,cAAcnQ,MAAM8O,KAC/G,IAAKrwB,EACH,MAAM,SAAEqwB,GACV,OAAOrwB,CAAC,IAEVC,GAAEzK,KAAMs6B,IAAIO,IACV,MAAMrwB,EAAIhK,GAAER,KAAMq6B,IAAGt4B,KAAK/B,KAAM66B,GAChCrwB,EAAEyxB,KAAKC,cAAcC,OAAOn8B,KAAM66B,EAAGrwB,EAAE,IAEzCkwB,GAAE16B,KAAM,cAAc,CAAC66B,EAAGrwB,EAAGwxB,KAAOh8B,KAAKo8B,SAAS5xB,EAAGwxB,GAAIh8B,KAAK+R,KAAK8oB,EAAExsB,UAAWrO,QAChF06B,GAAE16B,KAAM,YAAY,CAAC66B,EAAGrwB,KAAOxK,KAAKic,KAAKsf,GAAEvgB,OAAO6f,EAAG,GAAIrwB,IAAKxK,QAC9DyK,GAAEzK,KAAMu6B,IAAG,KACTU,GAAEj7B,KAAMiyB,GAAG,WACX,MAAM4I,EAAI76B,KAAKuiB,QACf,OAAO/hB,GAAER,KAAMw6B,IAAGz4B,KAAK/B,KAAM66B,EAAEh2B,KAAMg2B,EAAEW,MAAOX,EAAE16B,QAAQ,IAE1Du6B,GAAE16B,KAAM,aAAa,KAAOQ,GAAER,KAAMu6B,IAAGx4B,KAAK/B,MAAOA,QACnDyK,GAAEzK,KAAMw6B,IAAG,CAACK,EAAGrwB,EAAGwxB,KAChB,MAAMK,EAAIxB,EAAEyB,cAAc9xB,EAAGwxB,EAAGx7B,GAAER,KAAMiyB,KACxC,IAAKoK,EACH,MAAM,SAAExB,EAAGrwB,EAAGwxB,GAChB,OAAOh8B,KAAKmB,KAAKk7B,GAAIA,CAAC,IAExB3B,GAAE16B,KAAM,WAAW,CAAC66B,EAAGrwB,EAAGwxB,KAAOx7B,GAAER,KAAMw6B,IAAGz4B,KAAK/B,KAAM66B,EAAGrwB,EAAGwxB,GAAIh8B,QACjE06B,GAAE16B,KAAM,YAAY,CAAC66B,EAAGrwB,KACtB,MAAMwxB,EAAInB,EAAE7f,OAAOxQ,GACnB,OAAOywB,GAAEj7B,KAAMiyB,GAAG+J,EAAEO,SAAS/7B,GAAER,KAAMiyB,MAAMjyB,IAAI,IAEjD06B,GAAE16B,KAAM,aAAc66B,IAAOI,GAAEj7B,KAAMiyB,GAAG4I,EAAE2B,cAAch8B,GAAER,KAAMiyB,MAAMjyB,QACtE06B,GAAE16B,KAAM,WAAY66B,IAClB,MAAMrwB,EAAIxK,KAAKs7B,MACf,IAAK9wB,EACH,MAAM,WACR,MAAMwxB,EAAIxxB,EAAEgM,MAAO6lB,EAAIr8B,KAAK67B,OAAOrkB,KAAKqjB,EAAGr6B,GAAER,KAAMiyB,KACnD,IAAK+J,EACH,OAAOxxB,EAAErJ,KAAKk7B,GAAIr8B,KACpB,MAAMy8B,EAAIj8B,GAAER,KAAMo6B,IAAGr4B,KAAK/B,KAAMg8B,EAAGK,GACnC,OAAOI,GAAKjyB,EAAErJ,KAAKs7B,GAAIz8B,OAASwK,EAAErJ,KAAK66B,EAAGK,GAAIr8B,KAAK,IAErD06B,GAAE16B,KAAM,SAAS,KACf,IAAI66B,EACJ,GACEA,EAAIr6B,GAAER,KAAMu6B,IAAGx4B,KAAK/B,YACfA,KAAKiR,QACZ,OAAO4pB,CAAC,IAEVH,GAAE16B,KAAM,QAAQ,CAAC66B,EAAI,MAAQ,CAACA,GAAG6B,OAAOlvB,SAAShD,GAAMhK,GAAER,KAAMs6B,IAAGv4B,KAAK/B,KAAMwK,KAAKxK,QAClF06B,GAAE16B,KAAM,SAAS,IAAMA,KAAK28B,UAC5BjC,GAAE16B,KAAM,OAAO,CAAC66B,EAAGrwB,KACjB,MAAMwxB,EAAInB,EAAEjB,QAAQiB,EAAEhP,MAAMrhB,GAAIA,GAChC,OAAOxK,KAAK+R,KAAKiqB,GAAIh8B,IAAI,IAE3BA,KAAK67B,OAAShB,CAChB,GAEF,IAAI+B,GAAIlB,GACRzJ,GAAI,IAAI4K,QAAW/0B,GAAI,IAAI+0B,QAAWzC,GAAI,IAAIyC,QAAWxC,GAAI,IAAIwC,QAAWvC,GAAI,IAAIuC,QAAWtC,GAAI,IAAIsC,QAAWrC,GAAI,IAAIqC,QAAWnC,GAAEkC,GAAG,UAAU,CAAC/B,EAAGrwB,KACtJ,MAAMwxB,EAAI,IAAIN,GAAEb,GAChB,OAAQwB,IAAOL,EAAElE,IAAIttB,EAAG6xB,GAAIL,EAAEc,QAAQ,IAExC,MAAMC,GAAI,cAAc7B,GACtB74B,YAAYw4B,EAAGrwB,EAAGwxB,EAAGK,EAAI,CAAC,GACxBnI,QACAwG,GAAE16B,KAAM,QAAQ,CAAC66B,KAAMrwB,KACrBxK,KAAKqO,WAAarO,KAAKqO,SAAW,IAAKrO,KAAKqO,SAASlN,KAAK05B,KAAMrwB,EAAE,IAEpEkwB,GAAE16B,KAAM,OAAO,KACb,IAAI66B,EACJ,OAA8B,OAAtBA,EAAI76B,KAAKqO,eAAoB,EAASwsB,EAAErkB,KAAK,IAEvDxW,KAAK6E,KAAOg2B,EAAG76B,KAAKqO,SAAW7D,EAAGxK,KAAK4C,MAAQo5B,EAAGh8B,KAAKg9B,MAAQX,CACjE,GAEF,IAAIY,GAAIF,GAGR,IAAI1Q,GAAGtoB,GAAGm5B,GAAGC,GAAGC,GAAGC,GAAGnL,GAAGoL,GAAGC,GAAGC,GAAGC,GAAGC,GAFrChD,GAAEuC,GAAG,UAAU,CAACpC,EAAGrwB,EAAGwxB,EAAGK,EAAI,CAAC,IAAM,IAAIU,GAAElC,EAAGrwB,EAAGwxB,EAAGK,KAGnD,MAAMsB,GAAI,cAAcxC,GACtB94B,YAAYw4B,GACV3G,QACAzpB,GAAEzK,KAAMqsB,GAAG,WACXqO,GAAE16B,KAAM,UACRyK,GAAEzK,KAAM+D,IAAI82B,IACV,MAAMrwB,EAAInJ,OAAOiN,OAAO,IAAKtO,KAAK67B,OAAOC,SAAU97B,KAAK67B,OAAOD,QAASG,MAAMC,GAAMA,EAAEC,KAAKxI,WAAW1H,MAAM8O,KAC5G,IAAKrwB,EACH,MAAM,SAAEqwB,EAAEh2B,MACZ,OAAO2F,CAAC,IAEVC,GAAEzK,KAAMk9B,IAAIrC,GAAMr6B,GAAER,KAAM+D,IAAGhC,KAAK/B,KAAM66B,GAAGoB,KAAKxI,WAAW0I,OAAOn8B,KAAM66B,KACxEpwB,GAAEzK,KAAMm9B,IAAG,CAACtC,EAAGrwB,IAAMhK,GAAER,KAAM+D,IAAGhC,KAAK/B,KAAM66B,GAAGoB,KAAKxI,WAAW0I,OAAOn8B,KAAM66B,EAAGrwB,KAC9EC,GAAEzK,KAAMo9B,IAAIvC,IACV,MAAQe,MAAOpxB,GAAMqwB,EAAGmB,EAAK4B,GAAMA,EAAE/4B,KAAKo3B,KAAK4B,UAAY,GAC3D,IAAIrzB,GAAG4oB,MAAK,CAACwK,EAAGE,IAAM9B,EAAE4B,GAAK5B,EAAE8B,KAAIC,OAAOH,IAAOp9B,GAAER,KAAMm9B,IAAGp7B,KAAK/B,KAAM49B,EAAG/C,MAAOr6B,GAAER,KAAMk9B,IAAGn7B,KAAK/B,KAAM66B,GAAIrwB,EAAEgD,SAASowB,GAAMp9B,GAAER,KAAM09B,IAAG37B,KAAK/B,KAAM49B,IAAG,IAEvJnzB,GAAEzK,KAAMq9B,IAAG,CAACxC,EAAGrwB,KACb,IAAIszB,EACJ,GAAIjD,EAAEh2B,OAAS2F,GAAwD,KAA9B,OAAnBszB,EAAIjD,EAAExsB,eAAoB,EAASyvB,EAAEx9B,QACzD,OAAOu6B,EACT,MAAMmB,EAAKgC,IACT,IAAIh9B,EACJ,GAAIg9B,EAAEn5B,OAAS2F,EACb,OAAOwzB,EACT,GAAuD,KAA9B,OAAnBh9B,EAAIg9B,EAAE3vB,eAAoB,EAASrN,EAAEV,QACzC,OAAO,KACT,MAAO29B,GAAKD,EAAE3vB,SACd,OAAO4vB,EAAIjC,EAAEiC,GAAK,IAAI,EACrB5B,EAAIL,EAAEnB,GACT,IAAKwB,EACH,OAAOxB,EACT,MAAM4B,EAAIJ,EAAEhuB,SAAW,IAAIguB,EAAEhuB,eAAY,EAAQuvB,EAAI,IAAK/C,EAAGxsB,SAAUouB,GACvE,OAAOmB,EAAEvvB,SAAWouB,EAAGJ,EAAEhuB,SAAW,CAACuvB,GAAIvB,CAAC,IAE5C5xB,GAAEzK,KAAMkyB,IAAI2I,IACV,MAAQxsB,SAAU7D,GAAMqwB,EACxB,OAAOrwB,IAAMqwB,EAAExsB,SAAW7D,EAAE0zB,QAAO,CAAClC,EAAGK,EAAGI,KACxC,GAAU,IAANA,EACF,MAAO,CAACJ,GACV,MAAMuB,EAAI5B,EAAEX,IAAI,GAChB,GAAIuC,GAAKA,EAAEO,QAAU9B,EAAE8B,OAAQ,CAC7B9B,EAAI77B,GAAER,KAAMq9B,IAAGt7B,KAAK/B,KAAMq8B,EAAGuB,EAAE/4B,MAC/B,MAAQwJ,SAAUyvB,KAAME,GAAM3B,GAAKhuB,SAAU4vB,KAAMj9B,GAAM48B,EACzD,GAAIvB,EAAEx3B,OAAS+4B,EAAE/4B,MAAQi5B,GAAKG,GAAKpI,KAAKC,UAAUkI,KAAOnI,KAAKC,UAAU90B,GAAI,CAC1E,MAAMo9B,EAAI,IACLp9B,EACHqN,SAAU,IAAI4vB,KAAMH,IAEtB,OAAO9B,EAAE12B,MAAM,GAAI,GAAGjF,OAAOG,GAAER,KAAMkyB,IAAGnwB,KAAK/B,KAAMo+B,GACrD,CACF,CACA,OAAOpC,EAAE37B,OAAOg8B,EAAE,GACjB,KAAMxB,CAAC,IAEZpwB,GAAEzK,KAAMs9B,IAAIzC,IACV,MAAMrwB,EAAI,IACLqwB,EAAEmC,MACLn4B,KAAMg2B,EAAEh2B,MAEV,OAAOg2B,EAAExsB,WAAa7D,EAAE6D,SAAWwsB,EAAExsB,UAAWwsB,EAAEj4B,QAAU4H,EAAE5H,MAAQi4B,EAAEj4B,OAAQ4H,CAAC,IAEnFkwB,GAAE16B,KAAM,YAAY,CAAC66B,EAAGrwB,EAAGwxB,KAAOh8B,KAAKic,KAAKghB,GAAEjiB,OAAO6f,OAAG,EAAQrwB,EAAGwxB,IAAKh8B,QACxEyK,GAAEzK,KAAMu9B,IAAG,KACT,MAAM1C,EAAI76B,KAAKuiB,QACf,OAAO/hB,GAAER,KAAMw9B,IAAGz7B,KAAK/B,KAAM66B,EAAEh2B,KAAMg2B,EAAExsB,SAAUwsB,EAAEj4B,MAAOi4B,EAAEmC,MAAM,IAEpEtC,GAAE16B,KAAM,aAAa,KAAOQ,GAAER,KAAMu9B,IAAGx7B,KAAK/B,MAAOA,QACnDyK,GAAEzK,KAAMw9B,IAAG,CAAC3C,EAAGrwB,EAAGwxB,EAAGK,KACnB,MAAMI,EAAIQ,GAAEjiB,OAAO6f,EAAGrwB,EAAGwxB,EAAGK,GAAIuB,EAAIp9B,GAAER,KAAMkyB,IAAGnwB,KAAK/B,KAAMQ,GAAER,KAAMs9B,IAAGv7B,KAAK/B,KAAMy8B,IAChF,OAAOz8B,KAAKmB,KAAKy8B,GAAIA,CAAC,IAExBlD,GAAE16B,KAAM,WAAW,CAAC66B,EAAGrwB,EAAGwxB,EAAGK,KAAO77B,GAAER,KAAMw9B,IAAGz7B,KAAK/B,KAAM66B,EAAGrwB,EAAGwxB,EAAGK,GAAIr8B,QACvEyK,GAAEzK,KAAMy9B,IAAG,CAAC5C,EAAGrwB,EAAGwxB,EAAGK,IAAMxB,EAAEwD,QAAQ79B,GAAER,KAAMqsB,KAAMrsB,MAAQi7B,GAAEj7B,KAAMqsB,GAAGwO,EAAE0B,SAAS/7B,GAAER,KAAMqsB,MAAMrsB,KAAKo8B,SAAS5xB,EAAGwxB,EAAG,IAAKK,EAAG8B,QAAQ,OACnI1zB,GAAEzK,KAAM09B,IAAI7C,KACTA,EAAEwD,QAAQ79B,GAAER,KAAMqsB,OAAQ4O,GAAEj7B,KAAMqsB,GAAGwO,EAAEh2B,KAAK23B,cAAch8B,GAAER,KAAMqsB,MAAM7rB,GAAER,KAAMu9B,IAAGx7B,KAAK/B,MAAM,IAEjG06B,GAAE16B,KAAM,YAAY,CAAC66B,EAAGrwB,EAAGwxB,EAAGK,KAAO77B,GAAER,KAAMy9B,IAAG17B,KAAK/B,KAAM66B,EAAGrwB,EAAGwxB,EAAGK,GAAIr8B,QACxE06B,GAAE16B,KAAM,aAAc66B,IAAOr6B,GAAER,KAAM09B,IAAG37B,KAAK/B,KAAM66B,GAAI76B,QACvD06B,GAAE16B,KAAM,SAAS,KACf,IAAI66B,EAAI,KACR,GACEA,EAAIr6B,GAAER,KAAMu9B,IAAGx7B,KAAK/B,YACfA,KAAKiR,QACZ,OAAO4pB,CAAC,IAEVH,GAAE16B,KAAM,QAAS66B,IAAM9gB,OAxFhB4gB,EAwFkBE,EAxFZx5B,OAAOC,UAAUC,eAAeQ,KAAK44B,EAAG,SAwFtBE,EAAErtB,SAAShD,IACxChK,GAAER,KAAMo9B,IAAGr7B,KAAK/B,KAAMwK,EAAE,IACtBxK,OAASQ,GAAER,KAAMo9B,IAAGr7B,KAAK/B,KAAM66B,GAAI76B,MA1FjC,IAAC26B,CA0FqC,IAC5CD,GAAE16B,KAAM,YAAa66B,GAAMA,EAAE/E,UAAU91B,KAAK28B,WAC5CjC,GAAE16B,KAAM,OAAQ66B,IAAO76B,KAAK+R,KAAK8oB,GAAI76B,QACrCA,KAAK67B,OAAShB,CAChB,GAEF,IAAIyD,GAAIX,GACRtR,GAAI,IAAIwQ,QAAW94B,GAAI,IAAI84B,QAAWK,GAAI,IAAIL,QAAWM,GAAI,IAAIN,QAAWO,GAAI,IAAIP,QAAWQ,GAAI,IAAIR,QAAW3K,GAAI,IAAI2K,QAAWS,GAAI,IAAIT,QAAWU,GAAI,IAAIV,QAAWW,GAAI,IAAIX,QAAWY,GAAI,IAAIZ,QAAWa,GAAI,IAAIb,QAAWnC,GAAE4D,GAAG,UAAU,CAACzD,EAAGrwB,KACrP,MAAMwxB,EAAI,IAAI2B,GAAE9C,GAChB,OAAQwB,IAAOL,EAAElE,IAAIuE,GAAIL,EAAEj8B,SAASyK,GAAG,6DC3OrC+zB,GAAKl9B,OAAOI,eAEZm8B,GAAI,CAACpzB,EAAGqwB,EAAGwB,KADN,EAAC7xB,EAAGqwB,EAAGwB,KAAMxB,KAAKrwB,EAAI+zB,GAAG/zB,EAAGqwB,EAAG,CAAEn4B,YAAY,EAAIC,cAAc,EAAIG,UAAU,EAAIF,MAAOy5B,IAAO7xB,EAAEqwB,GAAKwB,CAAC,EAC1FmC,CAAGh0B,EAAe,iBAALqwB,EAAgBA,EAAI,GAAKA,EAAGwB,GAAIA,GAAIoC,GAAK,CAACj0B,EAAGqwB,EAAGwB,KACjF,IAAKxB,EAAEhvB,IAAIrB,GACT,MAAMrE,UAAU,UAAYk2B,EAAE,EAE9BL,GAAI,CAACxxB,EAAGqwB,EAAGwB,KAAOoC,GAAGj0B,EAAGqwB,EAAG,2BAA4BwB,EAAIA,EAAEt6B,KAAKyI,GAAKqwB,EAAEryB,IAAIgC,IAAK,GAAI,CAACA,EAAGqwB,EAAGwB,KAC/F,GAAIxB,EAAEhvB,IAAIrB,GACR,MAAMrE,UAAU,qDAClB00B,aAAaG,QAAUH,EAAElrB,IAAInF,GAAKqwB,EAAEpyB,IAAI+B,EAAG6xB,EAAE,EAC5C,GAAI,CAAC7xB,EAAGqwB,EAAGwB,EAAG77B,KAAOi+B,GAAGj0B,EAAGqwB,EAAG,0BAA2Br6B,EAAIA,EAAEuB,KAAKyI,EAAG6xB,GAAKxB,EAAEpyB,IAAI+B,EAAG6xB,GAAIA,GAa5F,MAAM,GAAI,CAAC7xB,EAAGqwB,KAAOrwB,EAAE4W,KAAO,CAC5Bsd,QAAS,iBACTlc,MAAO,YACJqY,GACFrwB,GAAI,IAAI,QAAE,eAOV,IAAI,QAAE,aAAc,IAAI,QAAE,GAAI,aAAcm0B,IAAK,QAAE,CAAC,EAAG,UAAWC,IAAK,QAAE,GAAI,cAAeR,IAAI,QAAE,GAAI,gBAAiBS,IAAK,QAAE,GAAI,iBAAkBC,IAAK,QAAE,GAAI,YAAaC,IAAK,QAAE,GAAI,YAAaC,IAAI,QAAE,KAAK7b,IAAI,IAAIA,IAAI,IAAK,UAAoB,IAAI,QAAR,CAAC,EAAa,0BAA2B8b,GAAMz0B,IAChS,MAAMqwB,EAAKwB,IAAOA,EAAE6C,OAAOP,GAAIn0B,GAAG00B,OAAOd,IAAGc,OAAOL,IAAIK,OAAON,IAAIM,OAAOJ,IAAII,OAAOH,IAAIG,OAAO,IAAGA,OAAOF,GAAG,KAAK7b,IAAI,IAAIA,IAAI,KAAK+b,OAAO,GAAG,CAAC,KAAIC,OAAO,IAAIC,gBACpJ/C,EAAEgD,WAAW,IACnB,MAAM7+B,EAAI67B,EAAE7zB,IAAI,IAChB,OAAO6zB,EAAE5zB,IAAIu2B,GAAG,KAAK7b,IAAI,IAAIA,IAAI,GAAI3iB,IAAK67B,EAAE/wB,KAAK,IAAI,KACnD+wB,EAAE3tB,OAAOiwB,IAAIjwB,OAAO0vB,IAAG1vB,OAAOmwB,IAAInwB,OAAOkwB,IAAIlwB,OAAOowB,IAAIpwB,OAAOqwB,IAAIrwB,OAAO,IAAGA,OAAOswB,IAAGtwB,OAAO,IAAG4wB,WAAW,GAAE,CAC/G,GAEH,OAAO,GAAEzE,EAAG,CACV0E,YAAa,SACX1E,CAAC,EACJ,IAAI,QAAE,eAAgB,IAAI,QAAE,GAAI,eAAgB75B,IAAI,QAAE,CAAC,EAAG,UAAWw+B,IAAI,QAAE,GAAI,SAAU,IAAI,QAAE,GAAI,SAAUC,GAAMj1B,IACpH,IAAIqwB,EACJ,MAAO,IACFrwB,EACHk1B,SAA8B,OAAnB7E,EAAIrwB,EAAEk1B,eAAoB,EAAS7E,EAAE56B,KAAKo8B,IAAM,CAAGwB,SAAUrzB,EAAEqzB,YAAaxB,MACxF,EACAsD,GAAMn1B,IAAOA,EAAE00B,OAAOl+B,IAAGk+B,OAAOM,IAAGN,OAAO,IAAGA,OAAO,GAAG,CAAC,KAAIC,OAAO,IAAIC,gBAClE50B,EAAE60B,WAAW,IACnB,MAAMxE,EAAIrwB,EAAEhC,IAAIw2B,IAAIx+B,EAAIgK,EAAEhC,IAAIq2B,IAAIX,QAAO,CAACzB,EAAGpQ,IAAMoQ,EAAEtZ,IAAIkJ,IAAIwO,GAC7DrwB,EAAE/B,IAAIu2B,GAAGx+B,GACT,MAAMyxB,EAAI5wB,OAAOu+B,YAAYp1B,EAAEhC,IAAIg3B,IAAGv/B,KAAI,EAAEw8B,EAAGpQ,KAAO,CAACoQ,EAAGgD,GAAGpT,OAAOsO,EAAIt5B,OAAOu+B,YAAYp1B,EAAEhC,IAAI,IAAGvI,KAAI,EAAEw8B,EAAGpQ,KAAO,CAACoQ,EAAGgD,GAAGpT,OAC3H,OAAO7hB,EAAE/B,IACPzH,GACA,IAAI,KAAG,CACL86B,MAAO7J,EACP2J,MAAOjB,KAERnwB,EAAEc,KAAK,IAAI,KACZd,EAAEkE,OAAO1N,IAAG0N,OAAO8wB,IAAG9wB,OAAO,IAAGA,OAAO,IAAG4wB,WAAW,GAAE,CACxD,GAEH,GAAEK,GAAI,CACJJ,YAAa,WAEf,MAAM,IAAI,QAAE,eAAgBM,IAAI,SAAE,KAChC,MAAM,UAAI,GACT,UAAWC,IAAK,QAAE,GAAI,eAAgBC,GAAMv1B,IAAOA,EAAE00B,OAAOW,IAAGX,OAAOY,GAAI,CAAC,KAAIX,OAAO,IAAIC,gBACrF50B,EAAE60B,WAAWS,IACnB,MAAMjF,EAAIrwB,EAAEhC,IAAIw2B,IAAI3C,EAAI7xB,EAAEhC,IAAIxH,IAC9B,OAAOwJ,EAAE/B,IAAIo3B,GAAG,UAAUxD,EAAGxB,IAAKrwB,EAAEc,KAAK,IAAI,KAC3Cd,EAAEkE,OAAOmxB,IAAGnxB,OAAOoxB,IAAIR,WAAW,GAAE,CACrC,GAEH,GAAES,GAAI,CACJR,YAAa,WAEf,MAAM,IAAI,QAAE,mBAAoBS,IAAK,QAAE,GAAI,mBAAoBC,IAAK,SAAE,IAAM,IAAI,cAAeC,GAAM11B,IAAOA,EAAE00B,OAAOe,IAAIf,OAAOc,GAAI,CAAC,KAAIb,OAAO,IAAIC,gBAC5I50B,EAAE60B,WAAWW,IACnB,MAAMnF,EAAIrwB,EAAEhC,IAAIw2B,IAAI3C,EAAI7xB,EAAEhC,IAAIxH,IAC9B,OAAOwJ,EAAE/B,IAAIw3B,GAAI,UAAU5D,EAAGxB,IAAKrwB,EAAEc,KAAK,IAAI,KAC5Cd,EAAEkE,OAAOuxB,IAAIvxB,OAAOsxB,IAAIV,WAAW,GAAE,CACtC,GAEH,GAAEY,GAAI,CACJX,YAAa,eAEf,MAAMY,IAAK,QAAE,GAAI,gBAAiB,IAAI,QAAE,CAAC,EAAG,eAAgBC,IAAK,SAAG51B,GAAMA,GAAG,gBAAiB61B,IAAK,QAAE,GAAI,oBAAqB,IAAI,QAAE,oBAQjIC,GAAK,IAAI,MAAG,0BAA2BC,GAAM/1B,IAAOA,EAAE00B,OAAOiB,IAAIjB,OAAO,IAAGA,OAAOkB,IAAIlB,OAAOmB,GAAI,CAAC,GAAG,GAAG,KAAIlB,OAAO,IAAIC,gBAClH50B,EAAE60B,WAAWgB,IACnB,MAAMxF,EAAIrwB,EAAEhC,IAAIxH,IAAIq7B,EAAI7xB,EAAEhC,IAAIq3B,IAAIr/B,EAAIgK,EAAEhC,IAAIo2B,IAAK3M,EAAIznB,EAAEhC,IAAI43B,IAAKzF,EAAInwB,EAAEhC,IAAI41B,IAAmB/R,EAV+D,EAAC7hB,EAAGqwB,EAAGwB,KACnK,GAAgB,iBAAL7xB,EACT,OAAOqwB,EAAErwB,GACX,GAAe,SAAXA,EAAE3F,KACJ,OAAO,gBAAcw3B,GAAGxQ,MAAMrhB,EAAEg2B,KAClC,GAAe,SAAXh2B,EAAE3F,KACJ,OAAO,cAAYw3B,EAAG7xB,EAAE5H,OAC1B,MAAM,SAAG4H,EAAE,EAGsFi2B,CAAfj2B,EAAEhC,IAAI23B,IAAe9D,EAAGxB,GAAIU,EAAI,IAC7GZ,EACH,IAAI,MAAG,CACLz4B,IAAKo+B,GACL9mB,MAAO,CACLxQ,KAAM,OAENxC,MAAO,CAACk6B,EAAI/C,EAAGgD,EAAIC,KACjBp2B,EAAE/B,IAAI,GAAGm4B,EAAG,MAIlB,SAAG,CAAEC,MAAOrgC,KACZ,QAAG,QAELgK,EAAE/B,IAAI21B,GAAG7C,GACT,MAAMxhB,EAAIkY,EAAE,CACV4J,OAAQhB,EACRpO,IAAKJ,EACL+M,QAASmC,IACPN,EAAI,aAAUlhB,GAClB,OAAOvP,EAAE/B,IAAI,GAAGwyB,GAAIzwB,EAAEc,KAAK,IAAI,KAC7Bd,EAAEkE,OAAOyxB,IAAIzxB,OAAO,IAAGA,OAAO0xB,IAAI1xB,OAAO2xB,IAAIf,WAAW,GAAE,CAC3D,GAEH,GAAEiB,GAAI,CACJhB,YAAa,gBAEf,MAAMuB,IAAK,QAAE,mBAAoBC,IAAI,QAAE,CAAC,EAAG,cAAeC,IAAK,QAAE,GAAI,mBAAoBC,IAAK,QAAE,CAAC,EAAG,qBAAsBC,IAAK,QAAE,KAAM,QAASC,IAAK,QAAE,KAAM,WAAYC,IAAK,QAAE,CAAC,EAAG,aAOjL/F,GAAK,IAAI,MAAG,uBAAwBgG,GAAM72B,IAAOA,EAAE00B,OAAOgC,GAAItsB,SAAS0sB,MAAMpC,OAAO6B,IAAG7B,OAAO+B,IAAI/B,OAAOiC,IAAIjC,OAAOkC,IAAIlC,OAAO8B,GAAI,CAAC,KAAI7B,OAAO2B,IAAK1B,gBAC/I50B,EAAEhF,KAAK,IACb,MAAMq1B,EAAIrwB,EAAEhC,IAAI04B,KAAOtsB,SAAS0sB,KAAMjF,EAAgB,iBAALxB,EAAgBjmB,SAAS2sB,cAAc1G,GAAKA,EAC7FrwB,EAAEg3B,OAAOpD,IAAI7C,GAAM,CACjB,IAAI,MAAG,CACLr5B,IAAKm5B,GACLxhB,KAAOE,IACL,MAAMkhB,EAAIoB,EAdqL,EAAC7xB,EAAGqwB,KACzM,MAAMwB,EAAIznB,SAASyM,cAAc,OACjCgb,EAAEoF,UAAY,WAAYj3B,EAAEk3B,YAAYrF,GAAIxB,EAAEpyB,IAAI04B,GAAI9E,GACtD,MAAM77B,EAAIq6B,EAAEryB,IAAI44B,IAChB,OAAO//B,OAAOsgC,QAAQnhC,GAAGgN,SAAQ,EAAEykB,EAAG0I,KAAO0B,EAAEuF,aAAa3P,EAAG0I,KAAK0B,CAAC,EAUjDwF,CAAGxF,EAAG7xB,QAAK,EACzB,MAAO,MACL,GAAIywB,GAAKoB,EAAG,CACV,MAAMsB,EAAI5jB,EAAEymB,IACZnE,EAAEyF,aAAa7G,EAAG0C,GAAI1C,EAAEyG,YAAY/D,EACtC,CACD,EALM,GAKD,CACJoE,QAAS,KACF,MAAL9G,GAAaA,EAAE+G,aAAoB,MAAL/G,GAAaA,EAAE+G,WAAWF,aAAa/nB,EAAEymB,IAAKvF,IAAU,MAALA,GAAaA,EAAEvsB,QAAQ,EAE3G,OAGF6sB,WACK/wB,EAAE60B,WAAW2B,IACvB,MAAMxgC,EAAIgK,EAAEhC,IAAI,IAAIypB,EAAIznB,EAAEhC,IAAIy4B,IAAKtG,EAAIt5B,OAAOu+B,YAAYp1B,EAAEhC,IAAIs2B,KAAMrC,EAAIp7B,OAAOu+B,YAAYp1B,EAAEhC,IAAIu2B,KAAM1S,EAAI,IAAI,MAAGgQ,EAAG,CACrH7iB,MAAOhZ,EACPyhC,UAAWtH,EACXuH,UAAWzF,KACRxK,IAEL,MA9BM,CAACznB,IACPA,EAAE23B,UAAUxyB,IAAI,UAAWnF,EAAEo3B,aAAa,OAAQ,UAAU,EA6BrDQ,CAAG/V,EAAEmU,KAAMh2B,EAAE/B,IAAIs4B,GAAG1U,GAAI7hB,EAAEc,KAAKw1B,IAAK,KACpC,MAALzU,GAAaA,EAAE0V,UAAWv3B,EAAEkE,OAAOwyB,IAAIxyB,OAAOqyB,IAAGryB,OAAOuyB,IAAIvyB,OAAOyyB,IAAIzyB,OAAO0yB,IAAI1yB,OAAOsyB,IAAI1B,WAAWwB,GAAG,CAC5G,GAKH,IAAI,GAAG,GAHP,GAAEO,GAAI,CACJ9B,YAAa,eA4Bf,GAAI,IAAI1C,QAAW,GAAI,IAAIA,QAC3B,MAA6BwF,GAAK,CAAC73B,EAAI,YAAa,SAAE,IAAM,KAAM,GAAIA,GAAI83B,IAAK,QAAE,IA1BjF,MACEjgC,cACE,GAAErC,KAAM,GAAG,IAAI,MACf,GAAEA,KAAM,GAAG,MACX49B,GAAE59B,KAAM,UAAW66B,IACjB,GAAE76B,KAAM,GAAG66B,EAAE,GAEjB,CACA7f,OAAO6f,EAAGwB,GACR,MAAM77B,EAAIq6B,EAAE7f,OAAOghB,GAAEh8B,KAAM,IAAGuiC,UAC9B,OAAO/hC,EAAEiI,IAAI4zB,GAAI77B,CACnB,CACAgI,IAAIqyB,GACF,OAAOmB,GAAEh8B,KAAM,IAAGwI,IAAIqyB,GAAGryB,KAC3B,CACAkG,OAAOmsB,GACL,OAAOmB,GAAEh8B,KAAM,IAAG0O,OAAOmsB,EAC3B,CACA94B,KAAK84B,EAAGwB,GACN,GAAkB,MAAdL,GAAEh8B,KAAM,IACV,MAAM,WACR,MAAMiyB,EAAIjyB,KAAKwI,IAAIqyB,EAAT76B,CAAYq8B,GAAI1B,EAAIqB,GAAEh8B,KAAM,IAAGwI,IAAIu4B,IAC7C,OAAO9O,EAAE0I,EAAEnhB,MAAOmhB,EAAE6H,SAAU7H,EAChC,GAGyF,YAAa8H,IAAK,QAAE,CAAC,IAAI,iBAAkB,IAAI,QAAE,iBAAkBC,GAAMl4B,IAAOA,EAAE00B,OAAOoD,IAAIpD,OAAOuD,IAAItD,OAAO,IAAI30B,EAAEhC,IAAI85B,IAAIK,OAAOn4B,GAAI40B,gBAAmB50B,EAAE60B,WAAWoD,IAAKj4B,EAAEc,KAAK,IAAI,KACjRd,EAAEkE,OAAO4zB,IAAI5zB,OAAO+zB,IAAInD,WAAW,GAAE,IAKvC,IAAwK,GAAG,GAAG,GAAG,GAAG,GAAGsD,GAAG9E,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGG,GAHlN,GAAEyE,GAAI,CACJnD,YAAa,aAGf,MAAMsD,GAAK,MACTxgC,cACE,GAAErC,KAAM,IAAG,GACX,GAAEA,KAAM,GAAG,QACX,GAAEA,KAAM,GAAG,IACX,GAAEA,KAAM,IAAG,SAEX,GAAEA,KAAM,GAAG,IAAI,MACf,GAAEA,KAAM4iC,GAAG,IAAI,MACf,GAAE5iC,KAAM89B,GAAmB,IAAI3zB,KAC/B,GAAEnK,KAAM,GAAmB,IAAImK,KAC/B,GAAEnK,KAAM,GAAG,IAAI,KAAGg8B,GAAEh8B,KAAM,IAAIg8B,GAAEh8B,KAAM4iC,MACtC,GAAE5iC,KAAM,IAAG,KACT,MAAM66B,EA/LsB,CAACrwB,IACjC,MAAMqwB,EAAKwB,IAAOA,EAAE8C,OAAO,IAAIC,gBAAmB50B,EAAE6xB,GAAIA,EAAE/wB,KAAK,IAAI,KACjE+wB,EAAEiD,WAAW,GAAE,IAEjB,OAAO,GAAEzE,EAAG,CACV0E,YAAa,WACX1E,CAAC,EAyLSiI,EAAG1D,MAAO5+B,UACZ+K,QAAQ2D,IAAI8sB,GAAEh8B,KAAM,IAAGC,KAAKgyB,GAAMA,EAAEzxB,KAAI,IAC5C67B,EAAI,CACNsD,GACAI,GACAG,GACAwC,GACAnC,GACAc,GACApC,GAAGj/B,MACH66B,GAEFmB,GAAEh8B,KAAM,IAAG+B,KAAK/B,KAAMq8B,EAAGL,GAAEh8B,KAAM,IAAG,IAEtC,GAAEA,KAAM,IAAG,CAAC66B,EAAGwB,KACbxB,EAAErtB,SAAShN,IACT,MAAMyxB,EAAI+J,GAAEh8B,KAAM,IAAG+iC,QAAQ/G,GAAEh8B,KAAM,IAAKQ,EAAE4gB,UAAO,GAASuZ,EAAIn6B,EAAEyxB,GAClEoK,EAAE5zB,IAAIjI,EAAG,CAAEkI,IAAKupB,EAAGnH,QAAS6P,EAAGqI,aAAS,GAAS,GACjD,IAEJ,GAAEhjC,KAAM,IAAG,CAAC66B,EAAGwB,GAAI,IAAO9wB,QAAQ2D,IAChC,CAAC2rB,GAAG6B,OAAOz8B,KAAKO,IACd,MAAMyxB,EAAI+J,GAAEh8B,KAAM89B,IAAGt1B,IAAIhI,GAAIm6B,EAAS,MAAL1I,OAAY,EAASA,EAAE+Q,QACxD,OAAO3G,EAAIL,GAAEh8B,KAAM89B,IAAGmF,OAAOziC,GAAKw7B,GAAEh8B,KAAM89B,IAAGr1B,IAAIjI,EAAG,CAAEkI,SAAK,EAAQoiB,aAAS,EAAQkY,aAAS,IAAuB,mBAALrI,EAAkBA,IAAMA,CAAC,OAG5I,GAAE36B,KAAM,IAAGo/B,gBACH7zB,QAAQ2D,IAAI,IAAI8sB,GAAEh8B,KAAM,IAAG2hC,WAAW1hC,KAAI,EAAE46B,GAAKmI,QAAS3G,MAAqB,mBAALA,EAAkBA,IAAMA,KAAKL,GAAEh8B,KAAM,IAAGkjC,OAAO,IAEjI,GAAEljC,KAAM,IAAI66B,IACV,GAAE76B,KAAM,GAAG66B,GAAImB,GAAEh8B,KAAM,IAAG+B,KAAK/B,KAAM66B,EAAE,IAEzC,GAAE76B,KAAMi+B,IAAIpD,GAAM,IAAIA,EAAE8G,WAAW1hC,KAAIm/B,OAAQ/C,EAAG77B,MAChD,MAAQkI,IAAKupB,EAAGnH,QAAS6P,GAAMn6B,EAC/B,IAAKm6B,EACH,OACF,MAAM8B,QAAU9B,IAChBE,EAAEpyB,IAAI4zB,EAAG,CAAE3zB,IAAKupB,EAAGnH,QAAS6P,EAAGqI,QAASvG,GAAI,MAE9CmB,GAAE59B,KAAM,mBAAmB,CAAC66B,GAAI,KAAQ,GAAE76B,KAAM,GAAG66B,GAAI76B,QACvD49B,GAAE59B,KAAM,kBAAmB66B,IAAO,GAAE76B,KAAM,GAAG66B,GAAI76B,QACjD49B,GAAE59B,KAAM,UAAW66B,IAAOmB,GAAEh8B,KAAM,IAAGmB,KAAK05B,GAAI76B,QAC9C49B,GAAE59B,KAAM,gBAAiB66B,IAAO,GAAE76B,KAAM,GAAGg8B,GAAEh8B,KAAM,IAAGoN,QAAQivB,GAAMA,IAAMxB,KAAK76B,QAC/E49B,GAAE59B,KAAM,OAAQ66B,IACd,MAAMwB,EAAI,CAACxB,GAAG6B,OACd,OAAOL,EAAEK,OAAOlvB,SAAShN,IACvBw7B,GAAEh8B,KAAM89B,IAAGr1B,IAAIjI,EAAG,CAChBkI,SAAK,EACLoiB,aAAS,EACTkY,aAAS,GACT,IACe,YAAfhH,GAAEh8B,KAAM,KAAoBg8B,GAAEh8B,KAAM,IAAG+B,KAAK/B,KAAMq8B,EAAGL,GAAEh8B,KAAM89B,KAAK99B,IAAI,IAE5E49B,GAAE59B,KAAM,UAAUo/B,MAAOvE,GAAqB,aAAfmB,GAAEh8B,KAAM,KAAqBmjC,QAAQC,KAAK,8HAA+H,IAAI73B,SAAS8wB,IACnNx1B,YAAW,KACTw1B,EAAEr8B,KAAK0O,OAAOmsB,GAAG,GAChB,GAAG,YACKmB,GAAEh8B,KAAM,IAAG+B,KAAK/B,KAAM,CAAC66B,GAAG6B,QAAQ,GAAK18B,QACpD49B,GAAE59B,KAAM,UAAUo/B,UAA2B,aAAfpD,GAAEh8B,KAAM,MAA2C,YAAfg8B,GAAEh8B,KAAM,WAA0BA,KAAK+hC,UAAW/F,GAAEh8B,KAAM,IAAG+B,KAAK/B,KAAM,YAAag8B,GAAEh8B,KAAM,IAAG+B,KAAK/B,MAAOg8B,GAAEh8B,KAAM,IAAG+B,KAAK/B,KAAM,IAAIg8B,GAAEh8B,KAAM89B,IAAG7wB,QAAS+uB,GAAEh8B,KAAM89B,WAAWvyB,QAAQ2D,IACrP,CACE8sB,GAAEh8B,KAAMi+B,IAAGl8B,KAAK/B,KAAMg8B,GAAEh8B,KAAM,KAC9Bg8B,GAAEh8B,KAAMi+B,IAAGl8B,KAAK/B,KAAMg8B,GAAEh8B,KAAM89B,MAC9BpB,QACDV,GAAEh8B,KAAM,IAAG+B,KAAK/B,KAAM,YALiCA,QAM1D49B,GAAE59B,KAAM,WAAWo/B,MAAOvE,GAAI,IAAsB,cAAfmB,GAAEh8B,KAAM,KAAqC,cAAfg8B,GAAEh8B,KAAM,IAAqBA,KAAsB,aAAfg8B,GAAEh8B,KAAM,IAAoB,IAAIuL,SAAS8wB,IAC9Ix1B,YAAW,KACTw1B,EAAEr8B,KAAK+hC,QAAQlH,GAAG,GACjB,GAAG,KACFA,GAAK,GAAE76B,KAAM,GAAG,IAAKg8B,GAAEh8B,KAAM,IAAG+B,KAAK/B,KAAM,mBAAoBg8B,GAAEh8B,KAAM,IAAG+B,KAAK/B,KAAM,IAAIg8B,GAAEh8B,KAAM89B,IAAG7wB,QAAS4tB,SAAUmB,GAAEh8B,KAAM,IAAG+B,KAAK/B,MAAOg8B,GAAEh8B,KAAM,IAAG+B,KAAK/B,KAAM,aAAcA,QACxL49B,GAAE59B,KAAM,UAAW66B,GAAMA,EAAEmB,GAAEh8B,KAAM,OACnC49B,GAAE59B,KAAM,WAAW,IAAMg8B,GAAEh8B,KAAM,IAAK,IAAIg8B,GAAEh8B,KAAM,IAAGsO,YAAa0tB,GAAEh8B,KAAM89B,IAAGxvB,UAAUrO,KAAI,EAAGyI,IAAKmyB,MACjG,IAAIwB,EACJ,OAAiD,OAAzCA,EAAS,MAALxB,OAAY,EAASA,EAAEwI,gBAAqB,EAAShH,EAAEiH,MAAM,IACxEl2B,QAAQytB,GAAM3sB,QAAQ2sB,MAAOsI,QAAQC,KAAK,6IAA8I,KAC7L,CACA3H,cACE,OAAO,IAAIoH,EACb,CACIn6B,UACF,OAAOszB,GAAEh8B,KAAM,GACjB,CACIujC,aACF,OAAOvH,GAAEh8B,KAAM,GACjB,GAEF,IAAIwjC,GAAKX,GACT,GAAI,IAAIhG,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW+F,GAAI,IAAI/F,QAAWiB,GAAI,IAAIjB,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAW,GAAI,IAAIA,QAAWoB,GAAI,IAAIpB,6FClR9Qe,EAAGnzB,EAAG3C,WA9BN41B,EAAIr8B,OAAOI,eAEXjB,EAAI,CAACo6B,EAAGC,EAAGrwB,KADP,EAACowB,EAAGC,EAAGrwB,KAAMqwB,KAAKD,EAAI8C,EAAE9C,EAAGC,EAAG,CAAEn4B,YAAY,EAAIC,cAAc,EAAIG,UAAU,EAAIF,MAAO4H,IAAOowB,EAAEC,GAAKrwB,CAAC,EACxF4yB,CAAExC,EAAe,iBAALC,EAAgBA,EAAI,GAAKA,EAAGrwB,GAAIA,GAAIxJ,EAAI,CAAC45B,EAAGC,EAAGrwB,KAC/E,IAAKqwB,EAAEhvB,IAAI+uB,GACT,MAAMz0B,UAAU,UAAYqE,EAAE,EAE9BwxB,EAAI,CAACpB,EAAGC,EAAGrwB,KAAOxJ,EAAE45B,EAAGC,EAAG,2BAA4BrwB,EAAIA,EAAEzI,KAAK64B,GAAKC,EAAEryB,IAAIoyB,IAAKD,EAAI,CAACC,EAAGC,EAAGrwB,KAC9F,GAAIqwB,EAAEhvB,IAAI+uB,GACR,MAAMz0B,UAAU,qDAClB00B,aAAaG,QAAUH,EAAElrB,IAAIirB,GAAKC,EAAEpyB,IAAImyB,EAAGpwB,EAAE,EAC5CkwB,EAAI,CAACE,EAAGC,EAAGrwB,EAAG6xB,KAAOr7B,EAAE45B,EAAGC,EAAG,0BAA2BwB,EAAIA,EAAEt6B,KAAK64B,EAAGpwB,GAAKqwB,EAAEpyB,IAAImyB,EAAGpwB,GAAIA,GAE3F,MAAMuyB,EACJ16B,cACE7B,EAAER,KAAM,WAA4B,IAAImK,KACxC3J,EAAER,KAAM,OAAQ66B,IACd,MAAMrwB,EAAgB,iBAALqwB,EAAgB,IAAI76B,KAAKuiC,SAASj0B,UAAUytB,MAAMM,GAAMA,EAAEx3B,KAAKpC,OAASo4B,IAAK76B,KAAKuiC,SAAS/5B,IAAIqyB,EAAE55B,IAClH,IAAKuJ,EAAG,CACN,MAAM6xB,EAAgB,iBAALxB,EAAgBA,EAAIA,EAAEp4B,KACvC,MAAM,QAAE45B,EACV,CACA,OAAO7xB,CAAC,IAEVhK,EAAER,KAAM,UAAW66B,IACjB,MAAMrwB,EAAgB,iBAALqwB,EAAgB,IAAI76B,KAAKuiC,SAASj0B,UAAUytB,MAAMM,GAAMA,EAAEx3B,KAAKpC,OAASo4B,IAAK76B,KAAKuiC,SAAS/5B,IAAIqyB,EAAE55B,KACjHuJ,GAAKxK,KAAKuiC,SAASU,OAAOz4B,EAAE3F,KAAK5D,GAAG,IAEvCT,EAAER,KAAM,OAAQ66B,GAAkB,iBAALA,EAAgB,IAAI76B,KAAKuiC,SAASj0B,UAAUkjB,MAAMhnB,GAAMA,EAAE3F,KAAKpC,OAASo4B,IAAK76B,KAAKuiC,SAAS12B,IAAIgvB,EAAE55B,KAChI,EAGF,MAAMm5B,EACJ/3B,YAAYw4B,EAAGrwB,EAAG6xB,GAChB77B,EAAER,KAAM,QACR26B,EAAE36B,KAAM49B,EAAG,IACXjD,EAAE36B,KAAMyK,OAAG,GACXkwB,EAAE36B,KAAM8H,GAAG,KACTk0B,EAAEh8B,KAAM49B,GAAGpwB,SAASqtB,GAAMA,EAAEmB,EAAEh8B,KAAMyK,KAAI,IAE1CjK,EAAER,KAAM,OAAQ66B,IACdH,EAAE16B,KAAMyK,EAAGowB,GAAImB,EAAEh8B,KAAM8H,GAAG/F,KAAK/B,KAAK,IAEtCQ,EAAER,KAAM,OAAO,IAAMg8B,EAAEh8B,KAAMyK,KAC7BjK,EAAER,KAAM,UAAW66B,IACjBH,EAAE16B,KAAMyK,EAAGowB,EAAEmB,EAAEh8B,KAAMyK,KAAMuxB,EAAEh8B,KAAM8H,GAAG/F,KAAK/B,KAAK,IAElDA,KAAK6E,KAAOw3B,EAAG3B,EAAE16B,KAAMyK,EAAGD,GAAIqwB,EAAEpyB,IAAI4zB,EAAEp7B,GAAIjB,KAC5C,CACAyjC,GAAG5I,GACD,OAAOmB,EAAEh8B,KAAM49B,GAAGz8B,KAAK05B,GAAI,KACzBH,EAAE16B,KAAM49B,EAAG5B,EAAEh8B,KAAM49B,GAAGxwB,QAAQ5C,GAAMA,IAAMqwB,IAAG,CAEjD,CACA6I,KAAK7I,GACH,MAAMrwB,EAAIxK,KAAKyjC,IAAIpH,IACjBxB,EAAEwB,GAAI7xB,GAAG,IAEX,OAAOA,CACT,CACAm5B,IAAI9I,GACFH,EAAE16B,KAAM49B,EAAG5B,EAAEh8B,KAAM49B,GAAGxwB,QAAQ5C,GAAMA,IAAMqwB,IAC5C,CACA+I,SACElJ,EAAE16B,KAAM49B,EAAG,GACb,EAEFA,EAAI,IAAIf,QAAWpyB,EAAI,IAAIoyB,QAAW/0B,EAAI,IAAI+0B,QAC9C,MAAMoB,EACJ57B,YAAYw4B,EAAGrwB,GACbhK,EAAER,KAAM,MACRQ,EAAER,KAAM,QACRQ,EAAER,KAAM,aACRQ,EAAER,KAAM,iBACRA,KAAKiB,GAAKyL,OAAO,WAAWlC,KAAMxK,KAAKyC,KAAO+H,EAAGxK,KAAK6jC,cAAgBhJ,EAAG76B,KAAK8jC,UAAY,KACxF,MAAM,SAAG,CAEb,CACA9oB,OAAO6f,EAAGrwB,EAAIxK,KAAK6jC,eACjB,OAAO,IAAIzJ,EAAES,EAAGrwB,EAAGxK,KACrB,EAEF,MAAM29B,EAAI,CAAC/C,EAAGC,IAAM,IAAIoD,EAAErD,EAAGC,GAC7B,IAAI0C,EAAGX,EAAGK,EAAGl5B,EAAGi7B,EAAGvC,EAAGS,EAAGM,EAAGH,EA8DxBpC,EAAG5O,EAAGiO,EAAGrI,EA7Db,MAAMwI,EACJp4B,YAAYw4B,EAAGrwB,EAAG6xB,GAChB1B,EAAE36B,KAAMu9B,OAAG,GACX5C,EAAE36B,KAAM48B,OAAG,GACXjC,EAAE36B,KAAMi9B,OAAG,GACXtC,EAAE36B,KAAM+D,EAAmB,IAAIggC,KAC/BpJ,EAAE36B,KAAMg/B,EAAmB,IAAI+E,KAC/BpJ,EAAE36B,KAAMy8B,EAAmB,IAAItyB,KAC/BwwB,EAAE36B,KAAMk9B,EAAmB,IAAI/yB,KAC/B3J,EAAER,KAAM,QAAQ,KAAM,CACpBgkC,SAAUhI,EAAEh8B,KAAMu9B,GAClB0G,eAAgB,IAAIjI,EAAEh8B,KAAM+D,IAAI9D,KAAK46B,IAAM,CACzCp4B,KAAkB,iBAALo4B,EAAgBA,EAAIA,EAAEp4B,KACnCG,MAAOo5B,EAAEh8B,KAAMw9B,GAAGz7B,KAAK/B,KAAM66B,OAE/BqJ,eAAgB,IAAIlI,EAAEh8B,KAAMg/B,IAAI/+B,KAAK46B,IAAM,CACzCp4B,KAAkB,iBAALo4B,EAAgBA,EAAIA,EAAEp4B,KACnCG,MAAOo5B,EAAEh8B,KAAMw9B,GAAGz7B,KAAK/B,KAAM66B,OAE/BsJ,eAAgB,IAAInI,EAAEh8B,KAAMy8B,IAAIx8B,KAAI,EAAE46B,GAAKuJ,SAAU55B,OAAS,CAC5D/H,KAAMo4B,EAAEp4B,KACR2hC,SAAU55B,EACV+4B,OAAQvH,EAAEh8B,KAAMq9B,GAAGt7B,KAAK/B,KAAM66B,OAEhCwE,WAAY,IAAIrD,EAAEh8B,KAAMk9B,IAAIj9B,KAAI,EAAE46B,GAAKuJ,SAAU55B,OAAS,CACxD/H,KAAMo4B,EAAEp4B,KACR2hC,SAAU55B,EACV+4B,OAAQvH,EAAEh8B,KAAMq9B,GAAGt7B,KAAK/B,KAAM66B,WAGlCr6B,EAAER,KAAM,YAAa66B,IACnBmB,EAAEh8B,KAAMy8B,GAAGh0B,IAAIoyB,EAAG,CAAEpsB,MAAO9J,KAAKD,MAAO0/B,SAAU,GAAI,IAEvD5jC,EAAER,KAAM,WAAY66B,IAClBmB,EAAEh8B,KAAMy8B,GAAGwG,OAAOpI,EAAE,IAEtBr6B,EAAER,KAAM,UAAW66B,IACjB,MAAMrwB,EAAIwxB,EAAEh8B,KAAMy8B,GAAGj0B,IAAIqyB,IACxBrwB,IAAMA,EAAE45B,SAAWz/B,KAAKD,MAAQ8F,EAAEiE,MAAM,IAE3CjO,EAAER,KAAM,UAAU,CAAC66B,EAAGrwB,KACpB,MAAM6xB,EAAI13B,KAAKD,MACf8F,EAAE65B,SAAQ,KACRrI,EAAEh8B,KAAMk9B,GAAGz0B,IAAIoyB,EAAG,CAAEuJ,SAAUz/B,KAAKD,MAAQ23B,GAAI,GAC/C,IAEJ77B,EAAER,KAAM,YAAa66B,IACnBmB,EAAEh8B,KAAM+D,GAAG4L,IAAIkrB,EAAE,IAEnBr6B,EAAER,KAAM,YAAa66B,IACnBmB,EAAEh8B,KAAM+D,GAAGk/B,OAAOpI,EAAE,IAEtBr6B,EAAER,KAAM,SAAU66B,IAChBmB,EAAEh8B,KAAMg/B,GAAGrvB,IAAIkrB,EAAE,IAEnBF,EAAE36B,KAAMw9B,GAAI3C,GAAMmB,EAAEh8B,KAAM48B,GAAGp0B,IAAIqyB,GAAGryB,QACpCmyB,EAAE36B,KAAMq9B,GAAIxC,GAAMmB,EAAEh8B,KAAMi9B,GAAGz0B,IAAIqyB,GAAG0I,SACpC7I,EAAE16B,KAAM48B,EAAG/B,GAAIH,EAAE16B,KAAMi9B,EAAGzyB,GAAIkwB,EAAE16B,KAAMu9B,EAAGlB,EAC3C,EAEFkB,EAAI,IAAIV,QAAWD,EAAI,IAAIC,QAAWI,EAAI,IAAIJ,QAAW94B,EAAI,IAAI84B,QAAWmC,EAAI,IAAInC,QAAWJ,EAAI,IAAII,QAAWK,EAAI,IAAIL,QAAWW,EAAI,IAAIX,QAAWQ,EAAI,IAAIR,QAEhK,MAAM3K,EAAI,MACR7vB,YAAYw4B,EAAGrwB,EAAG6xB,GAChB1B,EAAE36B,KAAMi7B,OAAG,GACXN,EAAE36B,KAAMqsB,OAAG,GACXsO,EAAE36B,KAAMs6B,OAAG,GACXK,EAAE36B,KAAMiyB,OAAG,GACXzxB,EAAER,KAAM,WAAY66B,GAAMA,GAAKx5B,OAAO4L,KAAK4tB,GAAGv6B,OAAS,IAAI4xB,EAAE8J,EAAEh8B,KAAMi7B,GAAIe,EAAEh8B,KAAMqsB,GAAI,IAAKwO,IAAO76B,OACjGQ,EAAER,KAAM,UAAU,CAAC66B,EAAGrwB,KACpB,IAAIuP,EACJ,MAAMsiB,EAAIxB,EAAE7f,OAAOghB,EAAEh8B,KAAMi7B,GAAGsH,UAC9B,OAAY,MAAL/3B,GAAa6xB,EAAE5zB,IAAI+B,GAAwB,OAAnBuP,EAAIiiB,EAAEh8B,KAAMiyB,KAAelY,EAAEuqB,SAASzJ,GAAI76B,IAAI,IAE/EQ,EAAER,KAAM,UAAW66B,IACjB,IAAIrwB,EACJ,OAAOwxB,EAAEh8B,KAAMi7B,GAAGvsB,OAAOmsB,GAAwB,OAAnBrwB,EAAIwxB,EAAEh8B,KAAMiyB,KAAeznB,EAAE+5B,SAAS1J,GAAI76B,IAAI,IAE9EQ,EAAER,KAAM,UAAW66B,IACjB,IAAIrwB,EACJ,OAAOqwB,EAAE7f,OAAOghB,EAAEh8B,KAAMqsB,GAAGtR,OAA4B,OAAnBvQ,EAAIwxB,EAAEh8B,KAAMiyB,KAAeznB,EAAEg6B,SAAS3J,GAAI76B,IAAI,IAEpFQ,EAAER,KAAM,cAAe66B,IACrB,IAAIrwB,EACJ,OAAOwxB,EAAEh8B,KAAMqsB,GAAG3d,OAAOmsB,GAAwB,OAAnBrwB,EAAIwxB,EAAEh8B,KAAMiyB,KAAeznB,EAAEi6B,QAAQ5J,GAAI76B,IAAI,IAE7EQ,EAAER,KAAM,cAAe66B,GAAMmB,EAAEh8B,KAAMi7B,GAAGpvB,IAAIgvB,KAC5Cr6B,EAAER,KAAM,cAAe66B,GAAMmB,EAAEh8B,KAAMqsB,GAAGxgB,IAAIgvB,KAC5Cr6B,EAAER,KAAM,OAAQ66B,IACd,IAAIrwB,EACJ,OAA2B,OAAnBA,EAAIwxB,EAAEh8B,KAAMiyB,KAAeznB,EAAEk6B,MAAM7J,GAAImB,EAAEh8B,KAAMi7B,GAAGzyB,IAAIqyB,EAAE,IAElEr6B,EAAER,KAAM,OAAQ66B,GAAM76B,KAAKmjB,IAAI0X,GAAGryB,QAClChI,EAAER,KAAM,OAAO,CAAC66B,EAAGrwB,IAAMxK,KAAKmjB,IAAI0X,GAAGpyB,IAAI+B,KACzChK,EAAER,KAAM,UAAU,CAAC66B,EAAGrwB,IAAMxK,KAAKmjB,IAAI0X,GAAG2G,OAAOh3B,KAC/ChK,EAAER,KAAM,SAAU66B,GAAMmB,EAAEh8B,KAAMqsB,GAAG7jB,IAAIqyB,KACvCr6B,EAAER,KAAM,QAAS66B,IACf,IAAIrwB,EACJxK,KAAK2kC,MAAM9J,GAAGvvB,OAA4B,OAAnBd,EAAIwxB,EAAEh8B,KAAMiyB,KAAeznB,EAAEo6B,OAAO/J,EAAE,IAE/Dr6B,EAAER,KAAM,QAAS66B,IACf,IAAIwB,EACJ,MAAM7xB,EAAIxK,KAAK2kC,MAAM9J,GAAGpsB,QACxB,OAA2B,OAAnB4tB,EAAIL,EAAEh8B,KAAMiyB,KAAeoK,EAAEwI,OAAOhK,EAAGrwB,GAAIA,CAAC,IAEtDhK,EAAER,KAAM,cAAco/B,MAAOvE,UACrBtvB,QAAQ2D,IAAIlP,KAAKwI,IAAIqyB,GAAG56B,KAAKuK,GAAMxK,KAAKwF,KAAKgF,KAAI,IAEzDkwB,EAAE16B,KAAMi7B,EAAGJ,GAAIH,EAAE16B,KAAMqsB,EAAG7hB,GAAIkwB,EAAE16B,KAAMs6B,EAAG+B,GAAIA,GAAK3B,EAAE16B,KAAMiyB,EAAG,IAAIwI,EAAEI,EAAGrwB,EAAG6xB,GAC3E,CACIjb,WACF,OAAO4a,EAAEh8B,KAAMs6B,EACjB,CACI+I,gBACF,OAAOrH,EAAEh8B,KAAMiyB,EACjB,GAEF,IAAI4N,EAAI3N,EACR+I,EAAI,IAAI4B,QAAWxQ,EAAI,IAAIwQ,QAAWvC,EAAI,IAAIuC,QAAW5K,EAAI,IAAI4K,QACjE,MAAMY,EACJp7B,cACE7B,EAAER,KAAM,QAAyB,IAAImK,KACrC3J,EAAER,KAAM,OAAQ66B,IACd,MAAMrwB,EAAIxK,KAAK+a,MAAMvS,IAAIqyB,EAAE55B,IAC3B,IAAKuJ,EACH,MAAM,QAAEqwB,EAAEp4B,MACZ,OAAO+H,CAAC,IAEVhK,EAAER,KAAM,UAAW66B,IACjB76B,KAAK+a,MAAMkoB,OAAOpI,EAAE55B,GAAG,IAEzBT,EAAER,KAAM,OAAQ66B,GAAM76B,KAAK+a,MAAMlP,IAAIgvB,EAAE55B,KACzC,EAEF,IAAIq8B,EAAGU,EAAGzD,EAAGuD,EAAGtD,EAAG2C,EACnB,MAAMmB,EACJj8B,YAAYw4B,EAAGrwB,GACbhK,EAAER,KAAM,QACR26B,EAAE36B,KAAMs9B,EAAG,MACX3C,EAAE36B,KAAMg+B,EAAG,MACXrD,EAAE36B,KAAMu6B,OAAG,GACXI,EAAE36B,KAAM89B,EAAG,WACXt9B,EAAER,KAAM,SAAS,KAAOg8B,EAAEh8B,KAAMs9B,IAAM5C,EAAE16B,KAAMs9B,EAAG,IAAI/xB,SAAQ,CAACsvB,EAAGrwB,KAC/DkwB,EAAE16B,KAAMg+B,GAAI3B,IACVA,aAAayI,aAAezI,EAAE0I,OAAO9jC,KAAO+6B,EAAEh8B,KAAMu6B,KAAOG,EAAE16B,KAAM89B,EAAG,YAAa9B,EAAEh8B,KAAMw6B,GAAGz4B,KAAK/B,MAAOq8B,EAAE2I,2BAA4BnK,IAAI,IAC1ImB,EAAEh8B,KAAMm9B,GAAGp7B,KAAK/B,MAAM,KACT,YAAfg8B,EAAEh8B,KAAM89B,IAAoBpD,EAAE16B,KAAM89B,EAAG,YAAa9B,EAAEh8B,KAAMw6B,GAAGz4B,KAAK/B,MAAOwK,EAAE,IAAIzC,MAAM,UAAU/H,KAAK6E,KAAKpC,iBAAiB,IAC1Hi4B,EAAE16B,KAAM89B,EAAG,WAAYmH,iBAAiBjlC,KAAK6E,KAAKpC,KAAMu5B,EAAEh8B,KAAMg+B,GAAG,KACpEhC,EAAEh8B,KAAMs9B,MACb98B,EAAER,KAAM,QAAQ,KACd,MAAM66B,EAAI,IAAIiK,YAAY9kC,KAAK6E,KAAKpC,KAAM,CAAEsiC,OAAQ,CAAE9jC,GAAI+6B,EAAEh8B,KAAMu6B,MAClE2K,cAAcrK,EAAE,IAElBF,EAAE36B,KAAMw6B,GAAG,KACTwB,EAAEh8B,KAAMg+B,IAAMmH,oBAAoBnlC,KAAK6E,KAAKpC,KAAMu5B,EAAEh8B,KAAMg+B,GAAG,IAE/DrD,EAAE36B,KAAMm9B,GAAItC,IACVh0B,YAAW,KACTg0B,GAAG,GACF76B,KAAK6E,KAAKugC,QAAQ,IAEvB1K,EAAE16B,KAAMu6B,EAAG7tB,OAAOlC,EAAE/H,OAAQzC,KAAK6E,KAAO2F,EAAGqwB,EAAEpyB,IAAI+B,EAAEvJ,GAAIjB,KACzD,CACIujC,aACF,OAAOvH,EAAEh8B,KAAM89B,EACjB,EAEFR,EAAI,IAAIT,QAAWmB,EAAI,IAAInB,QAAWtC,EAAI,IAAIsC,QAAWiB,EAAI,IAAIjB,QAAWrC,EAAI,IAAIqC,QAAWM,EAAI,IAAIN,QACvG,MAAMxC,EACJh4B,YAAYw4B,EAAGrwB,EAAI,KACjBhK,EAAER,KAAM,MACRQ,EAAER,KAAM,QACRQ,EAAER,KAAM,WACRQ,EAAER,KAAM,UAAW66B,GAAM,IAAIyD,EAAEzD,EAAG76B,QAClCA,KAAKiB,GAAKyL,OAAO,SAASmuB,KAAM76B,KAAKyC,KAAOo4B,EAAG76B,KAAKolC,QAAU56B,CAChE,EAEF,MAAMuwB,EAAI,CAACH,EAAGC,EAAI,MAAQ,IAAIR,EAAEO,EAAGC,oJCpQnC,IAAIxO,EAAIhrB,OAAOI,eAGXo5B,EAAoB,CAAErwB,IAAOA,EAAE66B,aAAe,eAAgB76B,EAAE86B,gBAAkB,kBAAmB96B,EAAE+6B,cAAgB,gBAAiB/6B,EAAEg7B,kBAAoB,oBAAqBh7B,EAAEi7B,uBAAyB,yBAA0Bj7B,EAAEk7B,cAAgB,gBAAiBl7B,EAAEm7B,iBAAmB,mBAAoBn7B,EAAEo7B,qBAAuB,uBAAwBp7B,EAAEq7B,sBAAwB,wBAAyBr7B,EAAEs7B,mBAAqB,qBAAsBt7B,EAAEu7B,4BAA8B,8BAA+Bv7B,EAAEw7B,mBAAqB,qBAAsBx7B,EAAEy7B,oBAAsB,sBAAuBz7B,EAAE07B,oBAAsB,sBAAuB17B,EAAE27B,WAAa,aAAc37B,EAAE47B,cAAgB,gBAAiB57B,GAA3rB,CAA+rBqwB,GAAK,CAAC,GAC7tB,MAAMD,UAAU7yB,MACd1F,YAAYg6B,EAAG5xB,GACbypB,MAAMzpB,GAJF,EAACD,EAAGmwB,EAAG0B,KADP,EAAC7xB,EAAGmwB,EAAG0B,KAAM1B,KAAKnwB,EAAI6hB,EAAE7hB,EAAGmwB,EAAG,CAAEj4B,YAAY,EAAIC,cAAc,EAAIG,UAAU,EAAIF,MAAOy5B,IAAO7xB,EAAEmwB,GAAK0B,CAAC,EACxFI,CAAEjyB,EAAe,iBAALmwB,EAAgBA,EAAI,GAAKA,EAAG0B,EAAM,EAKhEpB,CAAEj7B,KAAM,QACRA,KAAKyC,KAAO,gBAAiBzC,KAAKuP,KAAO8sB,CAC3C,EAEF,MAAMuB,EAAI,CAACpzB,EAAGmwB,IAAkB,mBAALA,EAAkB,aAAeA,EAAG1I,EAAKznB,GAAMqrB,KAAKC,UAAUtrB,EAAGozB,GAAIlD,EAAKlwB,GAAM,IAAIowB,EAAEC,EAAEwK,aAAc,qCAAqCpT,EAAEznB,MAAOwzB,EAAKxzB,GAAM,IAAIowB,EAAEC,EAAEyK,gBAAiB,YAAY96B,6CAA8C+vB,EAAK/vB,GAAM,IAAIowB,EAAEC,EAAE0K,cAAe,UAAU/6B,6CAA8C4vB,EAAI,IAAM,IAAIQ,EAAEC,EAAE2K,kBAAmB,gDAAiDvH,EAAI,IAAIzzB,KACnc,MAAMmwB,EAAInwB,EAAE0zB,QAAO,CAAC7B,EAAG5xB,KACrB,IAAKA,EACH,OAAO4xB,EACT,MAAML,EAAKx7B,GAAMsB,MAAMF,QAAQpB,GAAKA,EAAEP,KAAK69B,GAAM9B,EAAE8B,KAAIv9B,KAAK,MAAQC,EAAE6lC,OAASpU,EAAEzxB,EAAE6lC,UAAY7lC,EAAEy7B,KAAOhK,EAAEzxB,EAAEy7B,MAAQz7B,EAAET,WACtH,MAAO,GAAGs8B,MAAML,EAAEvxB,IAAI,GACrB,wDACH,OAAO,IAAImwB,EAAEC,EAAE4K,uBAAwB9K,EAAE,EACxCiC,EAAI,IAAM,IAAIhC,EAAEC,EAAE6K,cAAe,kDAAmDnI,EAAK/yB,GAAM,IAAIowB,EAAEC,EAAE8K,iBAAkB,wCAAwC1T,EAAEznB,OAAQxJ,EAAKwJ,GAAM,IAAIowB,EAAEC,EAAE+K,qBAAsB,4CAA4C3T,EAAEznB,OAA4FgwB,EAAKhwB,GAAM,IAAIowB,EAAEC,EAAEiL,mBAAoB,gCAAgC7T,EAAEznB,OAAQkzB,EAAI,IAAM,IAAI9C,EAC9bC,EAAEkL,4BACF,mJAICvI,EAAKhzB,GAAM,IAAIowB,EAChBC,EAAEoL,oBACF,iDAAiDz7B,iBAChDo4B,EAAKp4B,GAAM,IAAIowB,EAChBC,EAAEqL,oBACF,iDAAiD17B,6EC9B/C87B,EAAiB,IAKjBC,EAAe,WAA0B,EAE7CA,EAAajlC,UAAUklC,OAAS,SAAiBvhC,GAC/C,OAAKA,EAAM3E,QACX2E,EAAQshC,EAAax3B,KAAK9J,IAEjBjF,KAAKM,QAAU2E,GACrBA,EAAM3E,OAASgmC,GAAkBtmC,KAAKymC,WAAWxhC,IACjDjF,KAAKM,OAASgmC,GAAkBrhC,EAAMyhC,YAAY1mC,OACnDA,KAAK2mC,YAAY1hC,IANSjF,IAO9B,EAIAumC,EAAajlC,UAAUslC,QAAU,SAAkB3hC,GACjD,OAAKA,EAAM3E,OACJimC,EAAax3B,KAAK9J,GAAOuhC,OAAOxmC,MADXA,IAE9B,EAEAumC,EAAajlC,UAAUqlC,YAAc,SAAsB1hC,GACzD,OAAO,IAAI4hC,EAAO7mC,KAAMiF,EAC1B,EAIAshC,EAAajlC,UAAUgE,MAAQ,SAAgByJ,EAAM+3B,GAInD,YAHgB,IAAT/3B,IAAkBA,EAAO,QAClB,IAAP+3B,IAAgBA,EAAK9mC,KAAKM,QAE7ByO,GAAQ+3B,EAAaP,EAAaQ,MAC/B/mC,KAAKgnC,WAAW1iC,KAAKC,IAAI,EAAGwK,GAAOzK,KAAKG,IAAIzE,KAAKM,OAAQwmC,GAClE,EAIAP,EAAajlC,UAAUkH,IAAM,SAAchI,GACzC,KAAIA,EAAI,GAAKA,GAAKR,KAAKM,QACvB,OAAON,KAAKinC,SAASzmC,EACvB,EAOA+lC,EAAajlC,UAAUkM,QAAU,SAAkBwwB,EAAGjvB,EAAM+3B,QAC1C,IAAT/3B,IAAkBA,EAAO,QAClB,IAAP+3B,IAAgBA,EAAK9mC,KAAKM,QAE7ByO,GAAQ+3B,EACR9mC,KAAKknC,aAAalJ,EAAGjvB,EAAM+3B,EAAI,GAE/B9mC,KAAKmnC,qBAAqBnJ,EAAGjvB,EAAM+3B,EAAI,EAC7C,EAKAP,EAAajlC,UAAUrB,IAAM,SAAc+9B,EAAGjvB,EAAM+3B,QAClC,IAAT/3B,IAAkBA,EAAO,QAClB,IAAP+3B,IAAgBA,EAAK9mC,KAAKM,QAEjC,IAAIsF,EAAS,GAEb,OADA5F,KAAKwN,SAAQ,SAAU45B,EAAK5mC,GAAK,OAAOoF,EAAOzE,KAAK68B,EAAEoJ,EAAK5mC,GAAK,GAAGuO,EAAM+3B,GAClElhC,CACT,EAKA2gC,EAAax3B,KAAO,SAAeT,GACjC,OAAIA,aAAkBi4B,EAAuBj4B,EACtCA,GAAUA,EAAOhO,OAAS,IAAI+mC,EAAK/4B,GAAUi4B,EAAaQ,KACnE,EAEA,IAAIM,EAAqB,SAAUd,GACjC,SAASc,EAAK/4B,GACZi4B,EAAaxkC,KAAK/B,MAClBA,KAAKsO,OAASA,CAChB,CAEKi4B,IAAec,EAAKC,UAAYf,GACrCc,EAAK/lC,UAAYD,OAAO2Z,OAAQurB,GAAgBA,EAAajlC,WAC7D+lC,EAAK/lC,UAAUe,YAAcglC,EAE7B,IAAIE,EAAqB,CAAEjnC,OAAQ,CAAEqC,cAAc,GAAO2mB,MAAO,CAAE3mB,cAAc,IAyCjF,OAvCA0kC,EAAK/lC,UAAUkmC,QAAU,WACvB,OAAOxnC,KAAKsO,MACd,EAEA+4B,EAAK/lC,UAAU0lC,WAAa,SAAqBj4B,EAAM+3B,GACrD,OAAY,GAAR/3B,GAAa+3B,GAAM9mC,KAAKM,OAAiBN,KACtC,IAAIqnC,EAAKrnC,KAAKsO,OAAOhJ,MAAMyJ,EAAM+3B,GAC1C,EAEAO,EAAK/lC,UAAU2lC,SAAW,SAAmBzmC,GAC3C,OAAOR,KAAKsO,OAAO9N,EACrB,EAEA6mC,EAAK/lC,UAAU4lC,aAAe,SAAuBlJ,EAAGjvB,EAAM+3B,EAAIr4B,GAChE,IAAK,IAAIjO,EAAIuO,EAAMvO,EAAIsmC,EAAItmC,IACvB,IAAqC,IAAjCw9B,EAAEh+B,KAAKsO,OAAO9N,GAAIiO,EAAQjO,GAAgB,OAAO,CAC3D,EAEA6mC,EAAK/lC,UAAU6lC,qBAAuB,SAA+BnJ,EAAGjvB,EAAM+3B,EAAIr4B,GAChF,IAAK,IAAIjO,EAAIuO,EAAO,EAAGvO,GAAKsmC,EAAItmC,IAC5B,IAAqC,IAAjCw9B,EAAEh+B,KAAKsO,OAAO9N,GAAIiO,EAAQjO,GAAgB,OAAO,CAC3D,EAEA6mC,EAAK/lC,UAAUmlC,WAAa,SAAqBxhC,GAC/C,GAAIjF,KAAKM,OAAS2E,EAAM3E,QAAUgmC,EAC9B,OAAO,IAAIe,EAAKrnC,KAAKsO,OAAOjO,OAAO4E,EAAMuiC,WAC/C,EAEAH,EAAK/lC,UAAUolC,YAAc,SAAsBzhC,GACjD,GAAIjF,KAAKM,OAAS2E,EAAM3E,QAAUgmC,EAC9B,OAAO,IAAIe,EAAKpiC,EAAMuiC,UAAUnnC,OAAOL,KAAKsO,QAClD,EAEAi5B,EAAmBjnC,OAAOkI,IAAM,WAAc,OAAOxI,KAAKsO,OAAOhO,MAAO,EAExEinC,EAAmBje,MAAM9gB,IAAM,WAAc,OAAO,CAAE,EAEtDnH,OAAOqM,iBAAkB25B,EAAK/lC,UAAWimC,GAElCF,CACT,CApDwB,CAoDtBd,GAIFA,EAAaQ,MAAQ,IAAIM,EAAK,IAE9B,IAAIR,EAAuB,SAAUN,GACnC,SAASM,EAAOx3B,EAAMC,GACpBi3B,EAAaxkC,KAAK/B,MAClBA,KAAKqP,KAAOA,EACZrP,KAAKsP,MAAQA,EACbtP,KAAKM,OAAS+O,EAAK/O,OAASgP,EAAMhP,OAClCN,KAAKspB,MAAQhlB,KAAKC,IAAI8K,EAAKia,MAAOha,EAAMga,OAAS,CACnD,CA0DA,OAxDKid,IAAeM,EAAOS,UAAYf,GACvCM,EAAOvlC,UAAYD,OAAO2Z,OAAQurB,GAAgBA,EAAajlC,WAC/DulC,EAAOvlC,UAAUe,YAAcwkC,EAE/BA,EAAOvlC,UAAUkmC,QAAU,WACzB,OAAOxnC,KAAKqP,KAAKm4B,UAAUnnC,OAAOL,KAAKsP,MAAMk4B,UAC/C,EAEAX,EAAOvlC,UAAU2lC,SAAW,SAAmBzmC,GAC7C,OAAOA,EAAIR,KAAKqP,KAAK/O,OAASN,KAAKqP,KAAK7G,IAAIhI,GAAKR,KAAKsP,MAAM9G,IAAIhI,EAAIR,KAAKqP,KAAK/O,OAChF,EAEAumC,EAAOvlC,UAAU4lC,aAAe,SAAuBlJ,EAAGjvB,EAAM+3B,EAAIr4B,GAClE,IAAIg5B,EAAUznC,KAAKqP,KAAK/O,OACxB,QAAIyO,EAAO04B,IAC2D,IAAlEznC,KAAKqP,KAAK63B,aAAalJ,EAAGjvB,EAAMzK,KAAKG,IAAIqiC,EAAIW,GAAUh5B,OAEvDq4B,EAAKW,IAC6G,IAAlHznC,KAAKsP,MAAM43B,aAAalJ,EAAG15B,KAAKC,IAAIwK,EAAO04B,EAAS,GAAInjC,KAAKG,IAAIzE,KAAKM,OAAQwmC,GAAMW,EAASh5B,EAAQg5B,UADzG,CAGF,EAEAZ,EAAOvlC,UAAU6lC,qBAAuB,SAA+BnJ,EAAGjvB,EAAM+3B,EAAIr4B,GAClF,IAAIg5B,EAAUznC,KAAKqP,KAAK/O,OACxB,QAAIyO,EAAO04B,IACkG,IAAzGznC,KAAKsP,MAAM63B,qBAAqBnJ,EAAGjvB,EAAO04B,EAASnjC,KAAKC,IAAIuiC,EAAIW,GAAWA,EAASh5B,EAAQg5B,OAE5FX,EAAKW,IACqE,IAA1EznC,KAAKqP,KAAK83B,qBAAqBnJ,EAAG15B,KAAKG,IAAIsK,EAAM04B,GAAUX,EAAIr4B,UADnE,CAGF,EAEAo4B,EAAOvlC,UAAU0lC,WAAa,SAAqBj4B,EAAM+3B,GACvD,GAAY,GAAR/3B,GAAa+3B,GAAM9mC,KAAKM,OAAU,OAAON,KAC7C,IAAIynC,EAAUznC,KAAKqP,KAAK/O,OACxB,OAAIwmC,GAAMW,EAAkBznC,KAAKqP,KAAK/J,MAAMyJ,EAAM+3B,GAC9C/3B,GAAQ04B,EAAkBznC,KAAKsP,MAAMhK,MAAMyJ,EAAO04B,EAASX,EAAKW,GAC7DznC,KAAKqP,KAAK/J,MAAMyJ,EAAM04B,GAASjB,OAAOxmC,KAAKsP,MAAMhK,MAAM,EAAGwhC,EAAKW,GACxE,EAEAZ,EAAOvlC,UAAUmlC,WAAa,SAAqBxhC,GACjD,IAAIyiC,EAAQ1nC,KAAKsP,MAAMm3B,WAAWxhC,GAClC,GAAIyiC,EAAS,OAAO,IAAIb,EAAO7mC,KAAKqP,KAAMq4B,EAC5C,EAEAb,EAAOvlC,UAAUolC,YAAc,SAAsBzhC,GACnD,IAAIyiC,EAAQ1nC,KAAKqP,KAAKq3B,YAAYzhC,GAClC,GAAIyiC,EAAS,OAAO,IAAIb,EAAOa,EAAO1nC,KAAKsP,MAC7C,EAEAu3B,EAAOvlC,UAAUqlC,YAAc,SAAsB1hC,GACnD,OAAIjF,KAAKqP,KAAKia,OAAShlB,KAAKC,IAAIvE,KAAKsP,MAAMga,MAAOrkB,EAAMqkB,OAAS,EACtD,IAAIud,EAAO7mC,KAAKqP,KAAM,IAAIw3B,EAAO7mC,KAAKsP,MAAOrK,IACjD,IAAI4hC,EAAO7mC,KAAMiF,EAC1B,EAEO4hC,CACT,CAlE0B,CAkExBN,GAEF,kCCzLA,MAAMoB,EACFtlC,YAAYsM,EAAOi5B,GACf5nC,KAAK2O,MAAQA,EACb3O,KAAK4nC,WAAaA,CACtB,CAGAC,SAASruB,EAAOsuB,GACZ,GAAuB,GAAnB9nC,KAAK4nC,WACL,OAAO,KACX,IAQIG,EAAOC,EARPp5B,EAAM5O,KAAK2O,MAAMrO,OACrB,MAAQsO,IAEJ,GADW5O,KAAK2O,MAAMnG,IAAIoG,EAAM,GACvBq5B,UAAW,GACdr5B,EACF,KACJ,CAGAk5B,IACAC,EAAQ/nC,KAAKkoC,UAAUt5B,EAAK5O,KAAK2O,MAAMrO,QACvC0nC,EAAUD,EAAMI,KAAK7nC,QAEzB,IACI2nC,EAAWG,EADXC,EAAY7uB,EAAM8uB,GAElBC,EAAW,GAAIC,EAAY,GA+B/B,OA9BAxoC,KAAK2O,MAAMnB,SAAQ,CAACtN,EAAMM,KACtB,IAAKN,EAAKuoC,KAON,OANKV,IACDA,EAAQ/nC,KAAKkoC,UAAUt5B,EAAKpO,EAAI,GAChCwnC,EAAUD,EAAMI,KAAK7nC,QAEzB0nC,SACAQ,EAAUrnC,KAAKjB,GAGnB,GAAI6nC,EAAO,CACPS,EAAUrnC,KAAK,IAAIunC,EAAKxoC,EAAKD,MAC7B,IAAgDA,EAA5CwoC,EAAOvoC,EAAKuoC,KAAKxoC,IAAI8nC,EAAMziC,MAAM0iC,IACjCS,GAAQJ,EAAUM,UAAUF,GAAMhc,MAClCxsB,EAAMooC,EAAUO,QAAQT,KAAKE,EAAUO,QAAQT,KAAK7nC,OAAS,GAC7DioC,EAASpnC,KAAK,IAAIunC,EAAKzoC,OAAKa,OAAWA,EAAWynC,EAASjoC,OAASkoC,EAAUloC,UAElF0nC,IACI/nC,GACA8nC,EAAMc,UAAU5oC,EAAK+nC,EAC7B,MAEIK,EAAUM,UAAUzoC,EAAKuoC,MAE7B,OAAIvoC,EAAK+nC,WACLA,EAAYF,EAAQ7nC,EAAK+nC,UAAUhoC,IAAI8nC,EAAMziC,MAAM0iC,IAAY9nC,EAAK+nC,UACpEG,EAAY,IAAIT,EAAO3nC,KAAK2O,MAAMrJ,MAAM,EAAGsJ,GAAK43B,OAAOgC,EAAUM,UAAUzoC,OAAOkoC,IAAYvoC,KAAK4nC,WAAa,IACzG,QAHX,CAIA,GACD5nC,KAAK2O,MAAMrO,OAAQ,GACf,CAAE8nC,UAAWA,EAAWC,YAAWJ,UAAWA,EACzD,CAEAc,aAAaV,EAAWJ,EAAWe,EAAalB,GAC5C,IAAImB,EAAW,GAAIrB,EAAa5nC,KAAK4nC,WACjCsB,EAAWlpC,KAAK2O,MAAOw6B,GAAYrB,GAAiBoB,EAAS5oC,OAAS4oC,EAAS1gC,IAAI0gC,EAAS5oC,OAAS,GAAK,KAC9G,IAAK,IAAIE,EAAI,EAAGA,EAAI6nC,EAAUe,MAAM9oC,OAAQE,IAAK,CAC7C,IACiE6oC,EAD7DZ,EAAOJ,EAAUe,MAAM5oC,GAAG8oC,OAAOjB,EAAUkB,KAAK/oC,IAChDN,EAAO,IAAIwoC,EAAKL,EAAUO,QAAQT,KAAK3nC,GAAIioC,EAAMR,IACjDoB,EAASF,GAAYA,EAASK,MAAMtpC,MACpCA,EAAOmpC,EACH7oC,EACAyoC,EAASzyB,MAET0yB,EAAWA,EAAS5jC,MAAM,EAAG4jC,EAAS5oC,OAAS,IAEvD2oC,EAAS9nC,KAAKjB,GACV+nC,IACAL,IACAK,OAAYnnC,GAEXgnC,IACDqB,EAAWjpC,EACnB,CACA,IAAIupC,EAAW7B,EAAaoB,EAAY1f,MAKxC,OAJImgB,EAAWC,IACXR,EAwGZ,SAAsBv6B,EAAOisB,GACzB,IAAI+O,EAOJ,OANAh7B,EAAMnB,SAAQ,CAACtN,EAAMM,KACjB,GAAIN,EAAK+nC,WAAqB,GAAPrN,IAEnB,OADA+O,EAAWnpC,GACJ,CACX,IAEGmO,EAAMrJ,MAAMqkC,EACvB,CAjHuBC,CAAaV,EAAUO,GAClC7B,GAAc6B,GAEX,IAAI9B,EAAOuB,EAAS1C,OAAOyC,GAAWrB,EACjD,CACAM,UAAUn5B,EAAM+3B,GACZ,IAAIqB,EAAO,IAAI,KAMf,OALAnoC,KAAK2O,MAAMnB,SAAQ,CAACtN,EAAMM,KACtB,IAAIqpC,EAAiC,MAArB3pC,EAAK4pC,cAAwBtpC,EAAIN,EAAK4pC,cAAgB/6B,EAChEo5B,EAAKA,KAAK7nC,OAASJ,EAAK4pC,kBAAehpC,EAC7CqnC,EAAKU,UAAU3oC,EAAKD,IAAK4pC,EAAU,GACpC96B,EAAM+3B,GACFqB,CACX,CACA4B,QAAQC,GACJ,OAAuB,GAAnBhqC,KAAK4nC,WACE5nC,KACJ,IAAI2nC,EAAO3nC,KAAK2O,MAAM63B,OAAOwD,EAAM/pC,KAAIA,GAAO,IAAIyoC,EAAKzoC,MAAQD,KAAK4nC,WAC/E,CAKAqC,QAAQC,EAAkBC,GACtB,IAAKnqC,KAAK4nC,WACN,OAAO5nC,KACX,IAAIoqC,EAAe,GAAI37B,EAAQnK,KAAKC,IAAI,EAAGvE,KAAK2O,MAAMrO,OAAS6pC,GAC3DvB,EAAUsB,EAAiBtB,QAC3ByB,EAAWH,EAAiBd,MAAM9oC,OAClCsnC,EAAa5nC,KAAK4nC,WACtB5nC,KAAK2O,MAAMnB,SAAQtN,IAAcA,EAAK+nC,WAClCL,GAAY,GAAKn5B,GACrB,IAAI67B,EAAWH,EACfnqC,KAAK2O,MAAMnB,SAAQtN,IACf,IAAIomB,EAAMsiB,EAAQ2B,YAAYD,GAC9B,GAAW,MAAPhkB,EACA,OACJ+jB,EAAW/lC,KAAKG,IAAI4lC,EAAU/jB,GAC9B,IAAIrmB,EAAM2oC,EAAQT,KAAK7hB,GACvB,GAAIpmB,EAAKuoC,KAAM,CACX,IAAIA,EAAOyB,EAAiBd,MAAM9iB,GAAKgjB,OAAOY,EAAiBX,KAAKjjB,IAChE2hB,EAAY/nC,EAAK+nC,WAAa/nC,EAAK+nC,UAAUhoC,IAAI2oC,EAAQtjC,MAAMglC,EAAW,EAAGhkB,IAC7E2hB,GACAL,IACJwC,EAAajpC,KAAK,IAAIunC,EAAKzoC,EAAKwoC,EAAMR,GAC1C,MAEImC,EAAajpC,KAAK,IAAIunC,EAAKzoC,GAC/B,GACDwO,GACH,IAAI+7B,EAAU,GACd,IAAK,IAAIhqC,EAAI2pC,EAAc3pC,EAAI6pC,EAAU7pC,IACrCgqC,EAAQrpC,KAAK,IAAIunC,EAAKE,EAAQT,KAAK3nC,KACvC,IAAImO,EAAQ3O,KAAK2O,MAAMrJ,MAAM,EAAGmJ,GAAO+3B,OAAOgE,GAAShE,OAAO4D,GAC1DK,EAAS,IAAI9C,EAAOh5B,EAAOi5B,GAG/B,OAFI6C,EAAOC,iBA1IK,MA2IZD,EAASA,EAAOE,SAAS3qC,KAAK2O,MAAMrO,OAAS8pC,EAAa9pC,SACvDmqC,CACX,CACAC,iBACI,IAAIva,EAAQ,EAGZ,OAFAnwB,KAAK2O,MAAMnB,SAAQtN,IAAeA,EAAKuoC,MACnCtY,GAAO,IACJA,CACX,CAOAwa,SAASC,EAAO5qC,KAAK2O,MAAMrO,QACvB,IAAIynC,EAAQ/nC,KAAKkoC,UAAU,EAAG0C,GAAO5C,EAAUD,EAAMI,KAAK7nC,OACtDqO,EAAQ,GAAIkE,EAAS,EA2BzB,OA1BA7S,KAAK2O,MAAMnB,SAAQ,CAACtN,EAAMM,KACtB,GAAIA,GAAKoqC,EACLj8B,EAAMxN,KAAKjB,GACPA,EAAK+nC,WACLp1B,SAEH,GAAI3S,EAAKuoC,KAAM,CAChB,IAAIA,EAAOvoC,EAAKuoC,KAAKxoC,IAAI8nC,EAAMziC,MAAM0iC,IAAW/nC,EAAMwoC,GAAQA,EAAKoC,SAInE,GAHA7C,IACI/nC,GACA8nC,EAAMc,UAAU5oC,EAAK+nC,GACrBS,EAAM,CACN,IAAIR,EAAY/nC,EAAK+nC,WAAa/nC,EAAK+nC,UAAUhoC,IAAI8nC,EAAMziC,MAAM0iC,IAC7DC,GACAp1B,IACJ,IAAuDw2B,EAAnDyB,EAAU,IAAIpC,EAAKzoC,EAAIqpC,SAAUb,EAAMR,GAAoB8C,EAAOp8B,EAAMrO,OAAS,GACjF+oC,EAAS16B,EAAMrO,QAAUqO,EAAMo8B,GAAMvB,MAAMsB,IAC3Cn8B,EAAMo8B,GAAQ1B,EAEd16B,EAAMxN,KAAK2pC,EACnB,CACJ,MACS5qC,EAAKD,KACV+nC,GACJ,GACDhoC,KAAK2O,MAAMrO,OAAQ,GACf,IAAIqnC,EAAO,OAAkBh5B,EAAMm6B,WAAYj2B,EAC1D,EAEJ80B,EAAOZ,MAAQ,IAAIY,EAAO,QAAoB,GAW9C,MAAMe,EACFrmC,YAEApC,EAEAwoC,EAIAR,EAGA6B,GACI9pC,KAAKC,IAAMA,EACXD,KAAKyoC,KAAOA,EACZzoC,KAAKioC,UAAYA,EACjBjoC,KAAK8pC,aAAeA,CACxB,CACAN,MAAMvkC,GACF,GAAIjF,KAAKyoC,MAAQxjC,EAAMwjC,OAASxjC,EAAMgjC,UAAW,CAC7C,IAAIQ,EAAOxjC,EAAMwjC,KAAKe,MAAMxpC,KAAKyoC,MACjC,GAAIA,EACA,OAAO,IAAIC,EAAKD,EAAKoC,SAASvB,SAAUb,EAAMzoC,KAAKioC,UAC3D,CACJ,EAKJ,MAAM+C,EACF3oC,YAAYiJ,EAAM2/B,EAAQC,EAAYC,EAAUC,GAC5CprC,KAAKsL,KAAOA,EACZtL,KAAKirC,OAASA,EACdjrC,KAAKkrC,WAAaA,EAClBlrC,KAAKmrC,SAAWA,EAChBnrC,KAAKorC,gBAAkBA,CAC3B,EAEJ,MAAM1B,EAAiB,GAiDvB,SAAS2B,EAAUprC,GACf,IAAI2F,EAAS,GAEb,OADA3F,EAAIuN,SAAQ,CAAC89B,EAAOC,EAAKx8B,EAAM+3B,IAAOlhC,EAAOzE,KAAK4N,EAAM+3B,KACjDlhC,CACX,CACA,SAAS4lC,EAAUC,EAAQ7C,GACvB,IAAK6C,EACD,OAAO,KACX,IAAI7lC,EAAS,GACb,IAAK,IAAIpF,EAAI,EAAGA,EAAIirC,EAAOnrC,OAAQE,GAAK,EAAG,CACvC,IAAIuO,EAAO65B,EAAQ3oC,IAAIwrC,EAAOjrC,GAAI,GAAIsmC,EAAK8B,EAAQ3oC,IAAIwrC,EAAOjrC,EAAI,IAAK,GACnEuO,GAAQ+3B,GACRlhC,EAAOzE,KAAK4N,EAAM+3B,EAC1B,CACA,OAAOlhC,CACX,CAGA,SAAS8lC,EAAgBpV,EAAS9c,EAAOgpB,EAAUmJ,GAC/C,IAAI7D,EAAgB8D,EAAkBpyB,GAClCwvB,EAAc6C,EAAWrjC,IAAIgR,GAAOyiB,KAAKvV,OACzClQ,GAAOm1B,EAAOrV,EAAQ2U,OAAS3U,EAAQhrB,MAAMu8B,SAASruB,EAAOsuB,GACjE,IAAKtxB,EACD,OACJ,IAAIyxB,EAAYzxB,EAAIyxB,UAAUl9B,QAAQyL,EAAI6xB,UAAU5b,KAChDqf,GAASH,EAAOrV,EAAQhrB,KAAOgrB,EAAQ2U,QAAQlC,aAAavyB,EAAI6xB,UAAW7uB,EAAMyuB,UAAU8D,cAAe/C,EAAalB,GACvHkE,EAAU,IAAIhB,EAAaW,EAAOG,EAAQt1B,EAAI4xB,UAAWuD,EAAOn1B,EAAI4xB,UAAY0D,EAAO,KAAM,GAAI,GACrGtJ,EAAShsB,EAAI6xB,UAAU4D,aAAahE,GAAWiE,QAAQL,EAAY,CAAEF,OAAMQ,aAAcH,IAAWI,iBACxG,CACA,IAAIC,GAAsB,EAAOC,EAA6B,KAK9D,SAASV,EAAkBpyB,GACvB,IAAI4f,EAAU5f,EAAM4f,QACpB,GAAIkT,GAA8BlT,EAAS,CACvCiT,GAAsB,EACtBC,EAA6BlT,EAC7B,IAAK,IAAI54B,EAAI,EAAGA,EAAI44B,EAAQ94B,OAAQE,IAChC,GAAI44B,EAAQ54B,GAAGy7B,KAAKsQ,qBAAsB,CACtCF,GAAsB,EACtB,KACJ,CACR,CACA,OAAOA,CACX,CASA,MAAMR,EAAa,IAAI,KAAU,WAC3BW,EAAkB,IAAI,KAAU,gBAyCtC,MAAMC,EAAO,CAACjzB,EAAOgpB,KACjB,IAAIkK,EAAOb,EAAWc,SAASnzB,GAC/B,SAAKkzB,GAAgC,GAAxBA,EAAKphC,KAAKs8B,aAEnBpF,GACAkJ,EAAgBgB,EAAMlzB,EAAOgpB,GAAU,GACpC,GAAI,EAKTmJ,EAAO,CAACnyB,EAAOgpB,KACjB,IAAIkK,EAAOb,EAAWc,SAASnzB,GAC/B,SAAKkzB,GAAkC,GAA1BA,EAAKzB,OAAOrD,aAErBpF,GACAkJ,EAAgBgB,EAAMlzB,EAAOgpB,GAAU,GACpC,GAAI,eC/Zf,MAAM3H,EAAI,CAACF,EAAG0B,KAAOh7B,OAAO4R,OAAO0nB,EAAG,CACpCvZ,KAAM,CACJsd,QAAS,8BACNrC,KAEH1B,GAAIqB,GAAI,QAAE,QAAQ,IAAM,IAAM,IAClCnB,EAAEmB,EAAG,CACHuD,YAAa,kBAEf,MAAMlT,GAAI,QAAE,QAAQ,IAAM,IAAM,IAChCwO,EAAEmB,EAAG,CACHuD,YAAa,kBAEf,MAAMtE,GAAI,QAAE,CAAC,EAAG,yBAChBJ,EAAEI,EAAG,CACHsE,YAAa,+BAEf,MAAM3E,GAAI,SAAGD,GD8Vb,SAAiBjU,EAAS,CAAC,GAGvB,OAFAA,EAAS,CAAE4C,MAAO5C,EAAO4C,OAAS,IAC9BsjB,cAAelmB,EAAOkmB,eAAiB,KACpC,IAAI,KAAO,CACd1qC,IAAK2pC,EACLryB,MAAO,CACHxQ,KAAI,IACO,IAAIgiC,EAAarD,EAAOZ,MAAOY,EAAOZ,MAAO,KAAM,GAAI,GAElEvgC,MAAK,CAAC8hC,EAAIoE,EAAMlzB,IA1H5B,SAA0B8c,EAAS9c,EAAO8uB,EAAI9lC,GAC1C,IAAwCynC,EAApC4C,EAAYvE,EAAGwE,QAAQjB,GAC3B,GAAIgB,EACA,OAAOA,EAAUV,aACjB7D,EAAGwE,QAAQN,KACXlW,EAAU,IAAI0U,EAAa1U,EAAQhrB,KAAMgrB,EAAQ2U,OAAQ,KAAM,GAAI,IACvE,IAAI8B,EAAWzE,EAAGwE,QAAQ,uBAC1B,GAAuB,GAAnBxE,EAAGc,MAAM9oC,OACT,OAAOg2B,EAEN,GAAIyW,GAAYA,EAASD,QAAQjB,GAClC,OAAIkB,EAASD,QAAQjB,GAAYF,KACtB,IAAIX,EAAa1U,EAAQhrB,KAAKy9B,aAAaT,OAAIxnC,EAAW0B,EAASopC,EAAkBpyB,IAAS8c,EAAQ2U,OAAQI,EAAU/C,EAAGM,QAAQT,KAAKG,EAAGc,MAAM9oC,OAAS,IAAKg2B,EAAQ6U,SAAU7U,EAAQ8U,iBAEzL,IAAIJ,EAAa1U,EAAQhrB,KAAMgrB,EAAQ2U,OAAOlC,aAAaT,OAAIxnC,EAAW0B,EAASopC,EAAkBpyB,IAAS,KAAM8c,EAAQ6U,SAAU7U,EAAQ8U,iBAExJ,IAAmC,IAA/B9C,EAAGwE,QAAQ,iBAA+BC,IAAiD,IAArCA,EAASD,QAAQ,gBAS3E,OAAI7C,EAAU3B,EAAGwE,QAAQ,YAGnB,IAAI9B,EAAa1U,EAAQhrB,KAAK2+B,QAAQ3B,EAAI2B,GAAU3T,EAAQ2U,OAAOhB,QAAQ3B,EAAI2B,GAAUuB,EAAUlV,EAAQ4U,WAAY5C,EAAGM,SAAUtS,EAAQ6U,SAAU7U,EAAQ8U,iBAG9J,IAAIJ,EAAa1U,EAAQhrB,KAAKy+B,QAAQzB,EAAGM,QAAQT,MAAO7R,EAAQ2U,OAAOlB,QAAQzB,EAAGM,QAAQT,MAAOqD,EAAUlV,EAAQ4U,WAAY5C,EAAGM,SAAUtS,EAAQ6U,SAAU7U,EAAQ8U,iBAfrE,CAExG,IAAI4B,EAAc1E,EAAGwE,QAAQ,eACzBG,EAA+B,GAApB3W,EAAQ6U,WACjB4B,GAAYzW,EAAQ8U,iBAAmB4B,IACpC1W,EAAQ6U,UAAY7C,EAAGjiC,MAAQ,GAAK7D,EAAQoqC,gBAa7D,SAAsBvE,EAAW6C,GAC7B,IAAKA,EACD,OAAO,EACX,IAAK7C,EAAU6E,WACX,OAAO,EACX,IAAIC,GAAW,EAMf,OALA9E,EAAUO,QAAQT,KAAK,GAAG36B,SAAQ,CAACiB,EAAOG,KACtC,IAAK,IAAIpO,EAAI,EAAGA,EAAI0qC,EAAW5qC,OAAQE,GAAK,EACpCiO,GAASy8B,EAAW1qC,EAAI,IAAMoO,GAAOs8B,EAAW1qC,KAChD2sC,GAAW,EAAI,IAEpBA,CACX,CAzB+EC,CAAa9E,EAAIhS,EAAQ4U,aAC5FA,EAAa6B,EAAWvB,EAAUlV,EAAQ4U,WAAY5C,EAAGM,SAAWyC,EAAU/C,EAAGM,QAAQT,KAAKG,EAAGc,MAAM9oC,OAAS,IACpH,OAAO,IAAI0qC,EAAa1U,EAAQhrB,KAAKy9B,aAAaT,EAAI2E,EAAWzzB,EAAMyuB,UAAU8D,mBAAgBjrC,EAAW0B,EAASopC,EAAkBpyB,IAASmuB,EAAOZ,MAAOmE,EAAY5C,EAAGjiC,KAAqB,MAAf2mC,EAAsB1W,EAAQ8U,gBAAkB4B,EACvO,CASJ,CA0FuBK,CAAiBX,EAAMlzB,EAAO8uB,EAAI5hB,IAGjDA,SACAsW,MAAO,CACHsQ,gBAAiB,CACbC,YAAY1zB,EAAMrP,GACd,IAAIgjC,EAAYhjC,EAAEgjC,UACdC,EAAuB,eAAbD,EAA6Bf,EAAoB,eAAbe,EAA6B7B,EAAO,KACtF,QAAK8B,IAELjjC,EAAEkjC,iBACKD,EAAQ5zB,EAAKL,MAAOK,EAAK2oB,UACpC,KAIhB,CCzXmB,CAAE7H,EAAEnyB,IAAIyyB,EAAE/4B,QAC7B24B,EAAED,EAAG,CACH2E,YAAa,+BAEf,MAAMtN,GAAI,QAAE,gBAAiB,CAC3B0b,KAAM,CACJC,UAAW,QACXH,QAAU9S,IACR,MAAM0B,EAAI1B,EAAEnyB,IAAI,MAChB,MAAO,IAAM6zB,EAAEt6B,KAAKi6B,EAAE95B,IAAI,GAG9B2rC,KAAM,CACJD,UAAW,CAAC,QAAS,eACrBH,QAAU9S,IACR,MAAM0B,EAAI1B,EAAEnyB,IAAI,MAChB,MAAO,IAAM6zB,EAAEt6B,KAAKsqB,EAAEnqB,IAAI,KAIhC24B,EAAE5I,EAAEvpB,IAAK,CACP62B,YAAa,uBAEf1E,EAAE5I,EAAE2b,UAAW,CACbrO,YAAa,oBAEf,MAAM/E,EAAI,CAACS,EAAGL,EAAG3I,EAAG+J,EAAG3P,GAAGqQ,wGC9CtBzB,EAAI55B,OAAOI,eAEXm5B,EAAI,CAACC,EAAGrwB,EAAGwxB,KADP,EAACnB,EAAGrwB,EAAGwxB,KAAMxxB,KAAKqwB,EAAII,EAAEJ,EAAGrwB,EAAG,CAAE9H,YAAY,EAAIC,cAAc,EAAIG,UAAU,EAAIF,MAAOo5B,IAAOnB,EAAErwB,GAAKwxB,CAAC,EACxF6D,CAAEhF,EAAe,iBAALrwB,EAAgBA,EAAI,GAAKA,EAAGwxB,GAAIA,GAKlE,MAAM8B,EACJz7B,cACEu4B,EAAE56B,KAAM,yBAA0B,IAClC46B,EAAE56B,KAAM,mBAAoB,IAC5B46B,EAAE56B,KAAM,mBAAoB,IAC5B46B,EAAE56B,KAAM,2BAA4B,IACpC46B,EAAE56B,KAAM,gBAAiB,IACzB46B,EAAE56B,KAAM,iBAAkB,IAC1B46B,EAAE56B,KAAM,mBAAoB,IAC5B46B,EAAE56B,KAAM,eAAgBwK,IAAOxK,KAAK8tC,uBAAuB3sC,KAAKqJ,GAAIxK,QACpE46B,EAAE56B,KAAM,WAAYwK,IAAOxK,KAAK+tC,iBAAiB5sC,KAAKqJ,GAAIxK,QAC1D46B,EAAE56B,KAAM,WAAYwK,IAAOxK,KAAKguC,iBAAiB7sC,KAAKqJ,GAAIxK,OAC5D,CACIiuC,gBACF,MAAO,CACLC,YAAaluC,KAAK8tC,uBAClBK,QAASnuC,KAAK+tC,iBACdK,QAASpuC,KAAKguC,iBACdK,gBAAiBruC,KAAKsuC,yBACtBC,KAAMvuC,KAAKwuC,cACXC,MAAOzuC,KAAK0uC,eACZ3M,QAAS/hC,KAAK2uC,iBAElB,CACAN,gBAAgB7jC,GACd,OAAOxK,KAAKsuC,yBAAyBntC,KAAKqJ,GAAIxK,IAChD,CACAuuC,KAAK/jC,GACH,OAAOxK,KAAKwuC,cAAcrtC,KAAKqJ,GAAIxK,IACrC,CACAyuC,MAAMjkC,GACJ,OAAOxK,KAAK0uC,eAAevtC,KAAKqJ,GAAIxK,IACtC,CACA+hC,QAAQv3B,GACN,OAAOxK,KAAK2uC,iBAAiBxtC,KAAKqJ,GAAIxK,IACxC,EAEF,MAAM49B,GAAI,QAAE,IAAIE,EAAK,YAAah2B,EAAI,IAAI,KAAE,qBAAsBu1B,EAAKxC,IAAOA,EAAEqE,OAAOtB,EAAG,IAAIE,GAAMsB,gBAC5FvE,EAAEr1B,KAAK,MACb,MAAMgF,EAAIqwB,EAAEryB,IAAIo1B,IAAMqQ,UAAWjS,GAAMxxB,EACvCwxB,EAAEkS,YAAY1gC,SAAS6uB,GAAMA,EAAExB,WAAWA,EAAEr1B,KAAK,MACjD,MAAMk1B,EAAIG,EAAEryB,IAAI,MAChB,IAAIhI,EAAI,KAAMyxB,EAAI,KAClB,MAAMwK,EAAI,IAAI,KAAE,CACdv6B,IAAK4F,EACL+R,KAAM,KAAM,CACVkoB,QAAS,KACP/F,EAAE+F,QAAQv0B,SAAS6uB,GAAMA,EAAExB,IAAG,IAGlCmC,MAAO,CACLsQ,gBAAiB,CACfmB,MAAO,KAAOzS,EAAEyS,MAAMjhC,SAAS6uB,GAAMA,EAAExB,MAAK,GAC5C0T,KAAM,KAAOvS,EAAEuS,KAAK/gC,SAAS6uB,GAAMA,EAAExB,MAAK,KAG9CrhB,MAAO,CACLxQ,KAAM,OAENxC,MAAQ61B,GAAOA,EAAE6Q,aAA4C,IAA9B7Q,EAAEyQ,QAAQ,gBAAkC,GAAE,KAC3E,MAAQrgB,IAAKkO,GAAM0B,EACnB,GAAIL,EAAEoS,QAAQ9tC,OAAS,IAAW,MAALE,IAAcA,EAAEouC,GAAGjU,KAAOqB,EAAEoS,QAAQ5gC,SAAS6e,IACxEA,EAAEwO,EAAGF,EAAGn6B,EAAE,IACRw7B,EAAEqS,gBAAgB/tC,OAAS,IAAW,MAALE,IAAcA,EAAEouC,GAAGjU,IAAK,CAC3D,MAAMtO,EAAIqO,EAAEC,GACZqB,EAAEqS,gBAAgB7gC,SAASwwB,IACzBA,EAAEnD,EAAGxO,EAAG4F,EAAE,IACRA,EAAI5F,CACV,CACA7rB,EAAIm6B,CAAC,GACJ,IAXwE,QAAT,KActEE,EAAE2G,OAAO,MAAInF,GAAMA,EAAEh8B,OAAOo8B,WAAW5B,EAAEr1B,KAAK,MAAIw2B,EAAEmS,QAAQ3gC,SAAS6uB,GAAMA,EAAExB,IAAG,GAElFwC,EAAEjc,KAAO,CACPsd,QAAS,4BACTa,YAAa,wHC/Ef,MAsBG90B,GAAI,QAAE,CACPokC,SAXMzP,MAAOxE,EAAGp6B,KAChB,MAAM67B,EAAI,GACV,IAAK,IAAIxB,EAAI,EAAGA,EAAID,EAAEt6B,OAAQu6B,IAAK,CACjC,MAAMrwB,EAAIowB,EAAE16B,KAAK26B,IAChBrwB,IAAMA,EAAE3F,KAAKkQ,SAAS,UAAYsnB,EAAEl7B,KAAKqJ,EAC5C,CACA,MAAQ4d,MAAO0V,GAAMt9B,EAAEs7B,MACvB,IAAKgC,EACH,MAAM,QAAE,SACV,aAAcvyB,QAAQ2D,IAAImtB,EAAEp8B,KAAK46B,GArBzB,CAACD,GAAM,IAAIrvB,SAAS/K,IAC5B,MAAM67B,EAAI,IAAIyS,WACdzS,EAAE4I,iBACA,QACA,KACEzkC,EAAE,CACA4N,IAAKwsB,EAAEn4B,KACPQ,IAAKo5B,EAAEz2B,QACP,IAEJ,GACCy2B,EAAE0S,cAAcnU,EAAE,IAUkBL,CAAEM,OAAM56B,KAAI,EAAGmO,IAAKysB,EAAG53B,IAAKuH,KAAQszB,EAAExB,cAAc,CAAEr5B,IAAKuH,EAAG4D,IAAKysB,KAAK,EAG/GmU,wBAAwB,EACxBC,oBAAqB,CAACrU,EAAGp6B,KACvB,MAAM67B,EAAIznB,SAASyM,cAAc,QACjC,OAAOgb,EAAE3a,YAAc,wBAAyB,WAASkZ,EAAGyB,EAAG77B,EAAE,GAElE,gBACHiK,EAAE2W,KAAO,CACPsd,QAAS,0BACTa,YAAa,qBAEf,MAAMvB,GAAI,SAAGpD,IACX,MAAMp6B,EAAI,IAAI,KAAE,mBAObs9B,EAAI,CAACnD,EAAGE,EAAGrwB,KACZ,IAAIywB,EACJ,IAAKzwB,GAAKA,EAAElK,QAAU,EACpB,OAAO,EACT,MAAM2xB,EAAIvlB,OAAO,iBAAkBsvB,EAAIpB,EAAEpyB,IAAI,OAAM8/B,GAAIjc,GAAMsO,EAAEnhB,MAAOzV,EAAI82B,aAAaqU,WAAyE,OAA3DjU,EAAIN,EAAEwU,YAAY,CAAE9/B,KAAMwrB,EAAEuU,QAAS9T,IAAKT,EAAEwU,gBAAsB,EAASpU,EAAE3U,MAAQ+F,EAAE4b,UAAUl5B,KAAOsd,EAAE4b,UAAUl5B,KACzN4rB,EAAE6H,SAASnW,EAAE6f,QAAQ1rC,EAAG,CAAEmP,IAAK,CAAE1O,GAAIgxB,EAAG3L,IAAKviB,MAC7C,MAAQ8qC,SAAUnU,GAAME,EAAEpyB,IAAIiC,EAAEvI,KAChC,OAAOw4B,EAAElwB,EAAGwxB,GAAGxwB,MAAMixB,IACnB,MAAMmB,EAf8B,EAACjD,EAAGE,KAC1C,IAAImB,EACJ,MAAMxxB,EAAIhK,EAAEmsC,SAAShS,GACrB,IAAKnwB,EACH,OAAQ,EACV,MAAMynB,EAAIznB,EAAEuxB,UAAK,OAAQ,GAAS1P,GAAMA,EAAEprB,KAAO45B,IACjD,OAAO5I,EAAE3xB,QAAwB,OAAb07B,EAAI/J,EAAE,SAAc,EAAS+J,EAAEjtB,QAAU,GAAK,CAAC,EASvDstB,CAAE1B,EAAEnhB,MAAOyY,GACrB2L,EAAI,GAAKjD,EAAE6H,SACT7H,EAAEnhB,MAAM8uB,GAAGgH,YAAY1R,EAAGA,EAAGnB,GAAGyP,QAAQ1rC,EAAG,CAAEkO,OAAQ,CAAEzN,GAAIgxB,KAC5D,IACAsd,OAAO9S,IACR0G,QAAQ93B,MAAMoxB,EAAE,KACd,CAAE,EAER,OAAO,IAAI,KAAE,CACXv6B,IAAK1B,EACLgZ,MAAO,CACLxQ,KAAI,IACK,WAETxC,MAAMm0B,EAAGE,GACP,MAAMrwB,EAAIqwB,EAAE56B,IAAI06B,EAAEiO,QAASjO,EAAElO,KAAMwF,EAAI0I,EAAEmS,QAAQ9sC,MACjD,IAAKiyB,EACH,OAAOznB,EACT,GAAIynB,EAAEtiB,IAAK,CACT,MAAQs/B,oBAAqBjT,GAAMpB,EAAEpyB,IAAIiC,EAAEvI,KAAMmqB,EAAI2P,EAAE/J,EAAEtiB,IAAI2W,IAAK,CAAErlB,GAAIgxB,EAAEtiB,IAAI1O,KAC9E,OAAOuJ,EAAEmF,IAAIgrB,EAAElO,IAAK,CAACJ,GACvB,CACA,GAAI4F,EAAEvjB,OAAQ,CACZ,MAAMstB,EAAIxxB,EAAEuxB,UAAK,OAAQ,GAAS1P,GAAMA,EAAEprB,KAAOgxB,EAAEvjB,OAAOzN,KAC1D,OAAOuJ,EAAEkE,OAAOstB,EAClB,CACA,OAAOxxB,CACT,GAEFwyB,MAAO,CACLwS,YAAY7U,GACV,OAAO36B,KAAK2sC,SAAShS,EACvB,EACA8U,YAAa,CAAC9U,EAAGE,KACf,IAAI5I,EAAG+J,EACP,MAAQgT,uBAAwBxkC,GAAMowB,EAAEpyB,IAAIiC,EAAEvI,KAC9C,UAAS24B,aAAa6U,kBAAoBllC,IAA+B,OAAxBynB,EAAI4I,EAAE8U,oBAAyB,EAAS1d,EAAEvJ,QAAQ,gBAAqBoV,EAAEnD,EAAGE,EAA4B,OAAxBmB,EAAInB,EAAE8U,oBAAyB,EAAS3T,EAAE4T,MAAM,EAEnLC,WAAY,CAAClV,EAAGE,KACd,IAAIrwB,EACJ,OAAOqwB,aAAaqU,WAAYpR,EAAEnD,EAAGE,EAA2B,OAAvBrwB,EAAIqwB,EAAEiV,mBAAwB,EAAStlC,EAAEolC,MAAW,IAGjG,IAEJ5R,EAAE5c,KAAO,CACPsd,QAAS,0BACTa,YAAa,iBAEf,MAAM9E,EAAI,CAAChwB,EAAGuzB,gHC/Fd,MAAM+R,EAkBF1tC,YAIA0pB,EAAOjB,GAMX,IAAuBzT,EALfrX,KAAK+rB,MAAQA,EACb/rB,KAAK+rB,MAAQA,EACb/rB,KAAK8qB,QAA4B,iBAAXA,GAGPzT,EAH2CyT,EAIvD,SAAUtR,EAAOuS,EAAOtd,EAAOG,GAClC,IAAIohC,EAAS34B,EACb,GAAI0U,EAAM,GAAI,CACV,IAAIjY,EAASiY,EAAM,GAAGwE,YAAYxE,EAAM,IACxCikB,GAAUjkB,EAAM,GAAGzmB,MAAMwO,EAASiY,EAAM,GAAGzrB,QAE3C,IAAI2vC,GADJxhC,GAASqF,GACYlF,EACjBqhC,EAAS,IACTD,EAASjkB,EAAM,GAAGzmB,MAAMwO,EAASm8B,EAAQn8B,GAAUk8B,EACnDvhC,EAAQG,EAEhB,CACA,OAAO4K,EAAM8uB,GAAG4H,WAAWF,EAAQvhC,EAAOG,EAC9C,GAjByEkc,CACzE,EAgJJ,SAASqlB,EAAkBC,EAAQC,EAAUC,EAAW,KAAMC,GAC1D,OAAO,IAAIR,EAAUK,GAAQ,CAAC52B,EAAOuS,EAAOtd,EAAOG,KAC/C,IAAI4sB,EAAQ8U,aAAoBnsC,SAAWmsC,EAASvkB,GAASukB,EACzDhI,EAAK9uB,EAAM8uB,GAAGrF,OAAOx0B,EAAOG,GACI4hC,EAAvBlI,EAAG7b,IAAI1hB,QAAQ0D,GAAuBgiC,aAAcC,EAAWF,IAAS,QAAaA,EAAOH,EAAU7U,GACnH,IAAKkV,EACD,OAAO,KACXpI,EAAGlQ,KAAKoY,EAAOE,GACf,IAAIhhC,EAAS44B,EAAG7b,IAAI1hB,QAAQ0D,EAAQ,GAAGkiC,WAIvC,OAHIjhC,GAAUA,EAAO7K,MAAQwrC,IAAY,QAAQ/H,EAAG7b,IAAKhe,EAAQ,MAC3D8hC,GAAiBA,EAAcxkB,EAAOrc,KACxC44B,EAAG/nC,KAAKkO,EAAQ,GACb65B,CAAE,GAEjB,CASA,SAASsI,EAAuBR,EAAQC,EAAUC,EAAW,MACzD,OAAO,IAAIP,EAAUK,GAAQ,CAAC52B,EAAOuS,EAAOtd,EAAOG,KAC/C,IAAIiiC,EAASr3B,EAAMiT,IAAI1hB,QAAQ0D,GAC3B+sB,EAAQ8U,aAAoBnsC,SAAWmsC,EAASvkB,GAASukB,EAC7D,OAAKO,EAAO1iC,MAAM,GAAG2iC,eAAeD,EAAOtiC,OAAO,GAAIsiC,EAAOE,YAAY,GAAIV,GAEtE72B,EAAM8uB,GACRrF,OAAOx0B,EAAOG,GACdoiC,aAAaviC,EAAOA,EAAO4hC,EAAU7U,GAH/B,IAGqC,GAExD,CCpNe,SAASyV,EAAmB55B,GAC1C,GAAsB,iBAAXA,EACV,MAAM,IAAIlR,UAAU,qBAKrB,OAAOkR,EACLlS,QAAQ,sBAAuB,QAC/BA,QAAQ,KAAM,QACjB,CCVe,SAAS,EAAmBkS,GAC1C,GAAsB,iBAAXA,EACV,MAAM,IAAIlR,UAAU,qBAKrB,OAAOkR,EACLlS,QAAQ,sBAAuB,QAC/BA,QAAQ,KAAM,QACjB,CF8He,IAAI4qC,EAAU,MAAO,KAInB,IAAIA,EAAU,UAAW,KAIlB,IAAIA,EAAU,uCAAwC,KAIrD,IAAIA,EAAU,KAAM,KAIrB,IAAIA,EAAU,uCAAwC,KAIrD,IAAIA,EAAU,KAAM,KG5J7C,MAugEA,EAvgEqB,CAEpB,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,KAAM,KACP,CAAC,IAAK,KACN,CAAC,KAAM,KACP,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,IACN,CAAC,IAAK,IACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,IACN,CAAC,IAAK,IACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,OAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,OACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,IAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAcN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,KAAM,MACP,CAAC,KAAM,MAGP,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KA0CN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KAGN,CAAC,IAAK,MACN,CAAC,IAAK,MAWN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KAGP,CAAC,KAAM,KACP,CAAC,KAAM,KAGP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OAGN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KAGN,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,OACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,KACN,CAAC,IAAK,MACN,CAAC,IAAK,KAGN,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,IAAK,MACN,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,MAGP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,KAAM,MAGP,CAAC,KAAM,OACP,CAAC,KAAM,QACP,CAAC,KAAM,OACP,CAAC,KAAM,OACP,CAAC,KAAM,QACP,CAAC,KAAM,OACP,CAAC,KAAM,MACP,CAAC,KAAM,OACP,CAAC,KAAM,QACP,CAAC,KAAM,QACP,CAAC,KAAM,QACP,CAAC,KAAM,QACP,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,KAAM,MACP,CAAC,MAAO,KACR,CAAC,MAAO,KACR,CAAC,KAAM,MACP,CAAC,KAAM,MACP,CAAC,MAAO,KACR,CAAC,KAAM,KACP,CAAC,KAAM,OACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,KACP,CAAC,KAAM,MC9/DR,EANgC,CAC/B,CAAC,IAAK,SACN,CAAC,KAAM,aACP,CAAC,IAAK,WCsCQ,SAASmB,EAAQ75B,EAAQ7U,GACvC,GAAsB,iBAAX6U,EACV,MAAM,IAAIlR,UAAU,mCAAmCkR,OAcxD,MAAM85B,GAXN3uC,EAAU,CACT4uC,UAAW,IACXC,WAAW,EACXC,YAAY,EACZC,mBAAoB,GACpBC,2BAA2B,EAC3BC,sBAAsB,EACtBC,mBAAoB,MACjBlvC,IAGoCgvC,2BAA6Bn6B,EAAOs6B,WAAW,KACjFC,EAAmBpvC,EAAQivC,sBAAwBp6B,EAAOw6B,SAAS,KAOzEx6B,ECrDc,SAAuBA,EAAQ7U,GAC7C,GAAsB,iBAAX6U,EACV,MAAM,IAAIlR,UAAU,mCAAmCkR,OAGxD7U,EAAU,CACT+uC,mBAAoB,MACjB/uC,GAGJ,MAAM+uC,EAAqB,IAAIpnC,IAAI,IAC/B,KACA3H,EAAQ+uC,qBAOZ,OAHAl6B,EAzB4B,EAACA,EAAQy6B,KACrC,IAAK,MAAO5vC,EAAKU,KAAUkvC,EAE1Bz6B,EAASA,EAAOlS,QAAQ,IAAIqpB,OAAO,EAAmBtsB,GAAM,KAAMU,GAGnE,OAAOyU,CAAM,EAmBJ06B,CADT16B,EAASA,EAAOue,YACsB2b,IACtB3b,UAAU,OAAOzwB,QAAQ,kBAAmB,IAAIywB,WAGjE,CDiCUoc,CAAc36B,EAAQ,CAACk6B,mBALL,IAAIpnC,IAAI,IAC/B,KACA3H,EAAQ+uC,uBAKR/uC,EAAQ8uC,aACXj6B,EAhEiBA,IACXA,EAELlS,QAAQ,oBAAqB,SAC7BA,QAAQ,yBAA0B,SAElCA,QAAQ,oBAAqB,SAG7BA,QAAQ,8BAA+B,SAuD/BmsC,CAAWj6B,IAGrB,MAAM46B,EA/CkBzvC,KACxB,IAAI0vC,EAAqB,SAGzB,GAFAA,GAAsB1vC,EAAQ6uC,UAAY,GAAK,MAE3C7uC,EAAQkvC,mBAAmBpxC,OAAS,EACvC,IAAK,MAAM6sB,KAAa3qB,EAAQkvC,mBAAoB,CACnD,GAAIvkB,IAAc3qB,EAAQ4uC,UACzB,MAAM,IAAIrpC,MAAM,6BAA6BvF,EAAQ4uC,2DAA2D5uC,EAAQkvC,sBAGzHQ,GAAsBjB,EAAmB9jB,EAC1C,CAGD,OAAO,IAAIqB,OAAO,KAAK0jB,MAAwB,IAAI,EAiC/BC,CAAiB3vC,GAyBrC,OAvBIA,EAAQ6uC,YACXh6B,EAASA,EAAOoG,eAQjBpG,GADAA,GAFAA,EAASA,EAAOlS,QAAQ,8BAA+B,WAEvCA,QAAQ8sC,EAAazvC,EAAQ4uC,YAC7BjsC,QAAQ,MAAO,IAE3B3C,EAAQ4uC,YACX/5B,EArE2B,EAACA,EAAQ+5B,KACrC,MAAMgB,EAAmBnB,EAAmBG,GAE5C,OAAO/5B,EACLlS,QAAQ,IAAIqpB,OAAO,GAAG4jB,QAAwB,KAAMhB,GACpDjsC,QAAQ,IAAIqpB,OAAO,IAAI4jB,KAAoBA,KAAqB,KAAM,GAAG,EAgEjEC,CAAqBh7B,EAAQ7U,EAAQ4uC,YAG3CD,IACH95B,EAAS,IAAIA,KAGVu6B,IACHv6B,EAAS,GAAGA,MAGNA,CACR,2DE9EA,MAAMkP,EAAM,CAAC,EAAEhlB,eA0Cf,SAAS+wC,EAAM1vC,GACb,OAAOiK,OAAOjK,GAAS,IAAI8a,aAC7B,CCjDe,SAAS60B,IACtB,OAAQ7nB,IACN,MAAM/M,EDgBH,SAAqB+M,GAE1B,MAAM8nB,EAAQnxC,OAAO2Z,OAAO,MAE5B,IAAK0P,IAASA,EAAK7lB,KACjB,MAAM,IAAIkD,MAAM,wCAUlB,OAPA,QAAM2iB,EAAM,cAAe/M,IACzB,MAAM1c,EAAKqxC,EAAM30B,EAAWC,YACxB3c,IAAOslB,EAAIxkB,KAAKywC,EAAOvxC,KACzBuxC,EAAMvxC,GAAM0c,EACd,IAMF,SAAoBC,GAClB,MAAM3c,EAAKqxC,EAAM10B,GAEjB,OAAO3c,GAAMslB,EAAIxkB,KAAKywC,EAAOvxC,GAAMuxC,EAAMvxC,GAAM,IACjD,CACF,CCvCuBwxC,CAAY/nB,IAE/B,QAAMA,GAAM,CAACvc,EAAMI,EAAOkiB,KACxB,GACgB,eAAdtiB,EAAKtJ,MACM,OAAX4rB,GACiB,iBAAVliB,EAGP,OADAkiB,EAAOpiB,SAASG,OAAOD,EAAO,GACvB,CAAC,KAAMA,GAGhB,GAAkB,mBAAdJ,EAAKtJ,MAA2C,kBAAdsJ,EAAKtJ,KAA0B,CACnE,MAAM0V,EAAMoD,EAAWxP,EAAKyP,YAE5B,GAAIrD,GAAkB,OAAXkW,GAAoC,iBAAVliB,EAAoB,CAEvD,MAAMmkC,EACU,mBAAdvkC,EAAKtJ,KACD,CAACA,KAAM,QAAS4iB,IAAKlN,EAAIkN,IAAKpK,MAAO9C,EAAI8C,MAAOjP,IAAKD,EAAKC,KAC1D,CACEvJ,KAAM,OACN4iB,IAAKlN,EAAIkN,IACTpK,MAAO9C,EAAI8C,MACXhP,SAAUF,EAAKE,UAIvB,OADAoiB,EAAOpiB,SAASE,GAASmkC,EAClB,CAAC,KAAMnkC,EAChB,CACF,IACD,CAEL,CCnCA,MAAMokC,EAAK,CAAC9X,EAAGrwB,KACb,IAAImwB,EACJ,KAAMnwB,EAAEooC,YAAc,GAA4D,eAAjC,OAApBjY,EAAInwB,EAAEqoC,gBAAqB,EAASlY,EAAE91B,KAAKpC,OAEtE,YADAo4B,EAAE9oB,KAAKvH,EAAErK,SAGX,MAAM8xB,EAAI,GACVznB,EAAErK,QAAQqN,SAAQ,CAACwuB,EAAGx7B,EAAGs9B,KACvBA,IAAMtzB,EAAEooC,WAAa,GAAK3gB,EAAE9wB,KAAK66B,EAAE,IACjCnB,EAAE9oB,KAAK,eAAakgB,GAAG,EAC1B2I,EAAI,CAACC,EAAGrwB,KAAOnJ,OAAO4R,OAAO4nB,EAAG,CACjCzZ,KAAM,CACJsd,QAAS,iCACNl0B,KAEHqwB,GAAIiF,GAAK,QAAE,YACflF,EAAEkF,EAAI,CACJP,YAAa,iBACb/c,MAAO,aAET,MAAM4b,GAAI,QAAE,YAAavD,IAAM,CAC7BiY,WAAW,EACXpT,SAAU,CACR,CAAEqT,IAAK,KACP,CAAEA,IAAK,MACP,CAAE3hB,MAAO,aAAckf,SAAW9lC,GAAY,WAANA,IAE1CwoC,MAAQxoC,GAAM,CAAC,KAAMqwB,EAAEryB,IAAIs3B,EAAG59B,IAAT24B,CAAcrwB,IACnC0xB,cAAe,CACbnQ,MAAQvhB,GAAiB,aAAXA,EAAE3F,KAChBs3B,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACbznB,EAAEyoC,SAAShhB,GAAIznB,EAAEuH,KAAKsqB,EAAEhuB,UAAW7D,EAAE0oC,UAAUjhB,EAAE,GAGrDwB,WAAY,CACV1H,MAAQvhB,GAAsB,aAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV7xB,EAAE2oC,SAAS9W,EAAG,WAAW,OAI/BzB,EAAEwD,EAAEgV,KAAM,CACR7T,YAAa,uBACb/c,MAAO,aAEToY,EAAEwD,EAAE11B,IAAK,CACP62B,YAAa,0BACb/c,MAAO,aAET,MAAMwd,GAAK,QAAE,kBAAkB,IAAM,KAAM,QAAE5B,EAAEv5B,UAC/C+1B,EAAEoF,EAAI,CACJT,YAAa,iCACb/c,MAAO,aAET,MAAMyd,GAAK,QAAE,iBAAkB,CAC7BoT,eAAgB,CACdzF,UAAW,QACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKi+B,EAAG99B,IAAI,KAIjC04B,EAAEqF,EAAGv3B,IAAK,CACR62B,YAAa,sBACb/c,MAAO,aAEToY,EAAEqF,EAAG2N,UAAW,CACdrO,YAAa,mBACb/c,MAAO,aAET,MAAMwe,GAAK,QAAE,UACbpG,EAAEoG,EAAI,CACJzB,YAAa,eACb/c,MAAO,WAET,MAAM0a,GAAI,QAAE,UAAWrC,IAAM,CAC3BiY,WAAW,EACXpT,SAAU,CACR,CAAEqT,IAAK,KACP,CAAEA,IAAK,UACP,CAAE3hB,MAAO,aAAckf,SAAW9lC,GAAY,SAANA,IAE1CwoC,MAAQxoC,GAAM,CAAC,SAAUqwB,EAAEryB,IAAIw4B,EAAG9+B,IAAT24B,CAAcrwB,IACvC0xB,cAAe,CACbnQ,MAAQvhB,GAAiB,WAAXA,EAAE3F,KAChBs3B,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACbznB,EAAEyoC,SAAShhB,GAAIznB,EAAEuH,KAAKsqB,EAAEhuB,UAAW7D,EAAE0oC,UAAUjhB,EAAE,GAGrDwB,WAAY,CACV1H,MAAQvhB,GAAsB,WAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV7xB,EAAE2oC,SAAS9W,EAAG,SAAS,OAI7BzB,EAAEsC,EAAEkW,KAAM,CACR7T,YAAa,qBACb/c,MAAO,WAEToY,EAAEsC,EAAEx0B,IAAK,CACP62B,YAAa,wBACb/c,MAAO,WAET,MAAM6d,GAAK,QAAE,gBAAgB,IAAM,KAAM,QAAEnD,EAAEr4B,UAC7C+1B,EAAEyF,EAAI,CACJd,YAAa,+BACb/c,MAAO,WAET,MAAMse,GAAK,QAAE,eAAgB,CAC3BwS,WAAY,CACV1F,UAAW,CAAC,SACZH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKs+B,EAAGn+B,IAAI,KAIjC04B,EAAEkG,EAAGp4B,IAAK,CACR62B,YAAa,oBACb/c,MAAO,WAEToY,EAAEkG,EAAG8M,UAAW,CACdrO,YAAa,iBACb/c,MAAO,WAET,MAAM2d,GAAK,QAAE,cACbvF,EAAEuF,EAAI,CACJZ,YAAa,mBACb/c,MAAO,eAET,MAAMya,GAAI,QAAE,cAAepC,IAAM,CAC/BgD,SAAU,IACVtuB,MAAM,EACNujC,WAAW,EACXpT,SAAU,CAAC,CAAEqT,IAAK,SAClBC,MAAQxoC,GAAM,CAAC,OAAQqwB,EAAEryB,IAAI23B,EAAGj+B,IAAT24B,CAAcrwB,IACrC0xB,cAAe,CACbnQ,MAAQvhB,GAAiB,eAAXA,EAAE3F,KAChBs3B,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACbznB,EAAEyoC,SAAShhB,GAAIznB,EAAE+oC,QAAQlX,EAAEz5B,OAAQ4H,EAAE0oC,UAAUjhB,EAAE,GAGrDwB,WAAY,CACV1H,MAAQvhB,GAAsB,eAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACbznB,EAAE2oC,SAAS9W,EAAG,aAAcpK,EAAEza,MAAQ,GAAG,OAI/CojB,EAAEqC,EAAEmW,KAAM,CACR7T,YAAa,yBACb/c,MAAO,eAEToY,EAAEqC,EAAEv0B,IAAK,CACP62B,YAAa,4BACb/c,MAAO,eAET,MAAMigB,GAAK,QAAE,oBAAoB,IAAM,IAAM,CAAC5H,EAAGrwB,KAC/C,MAAQy9B,UAAW5L,EAAGiM,GAAIrW,GAAM4I,EAChC,GAAIwB,EAAE0K,MACJ,OAAO,EACT,MAAQh4B,KAAM4rB,EAAGmM,GAAI9K,GAAMK,EAC3B,OAAOxB,EAAEpO,IAAI+mB,aAAa7Y,EAAGqB,EAAGiB,EAAEp4B,SAAgB,MAAL2F,GAAaA,EAAEynB,EAAEwhB,WAAW9Y,EAAGqB,EAAGiB,EAAEp4B,UAAU,IAAOxD,OAAO4L,KAAK4tB,EAAEgB,OAAOD,OAAOxuB,QAAQ3C,GAAMA,IAAMwyB,EAAEp4B,KAAKpC,OAAMxC,KAAKwK,GAAMowB,EAAEgB,OAAOD,MAAMnxB,KAAI+C,SAAS/C,IACpMwnB,EAAEwhB,WAAW9Y,EAAGqB,EAAGvxB,EAAE,IACd,MAALD,GAAaA,EAAEynB,EAAEyhB,QAAQ/Y,EAAGqB,EAAGiB,EAAEp4B,OAAOmW,YAAY,EAAG,IAE7D4f,EAAE6H,EAAI,CACJlD,YAAa,mCACb/c,MAAO,eAET,MAAM4d,GAAK,QAAE,mBAAoB,CAC/BuT,iBAAkB,CAChB/F,UAAW,QACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAK0gC,EAAGvgC,IAAI,KAIjC04B,EAAEwF,EAAG13B,IAAK,CACR62B,YAAa,wBACb/c,MAAO,eAEToY,EAAEwF,EAAGwN,UAAW,CACdrO,YAAa,qBACb/c,MAAO,eAET,MAAMye,GAAK,QAAE,QACbrG,EAAEqG,EAAI,CACJ1B,YAAa,aACb/c,MAAO,SAET,MAAM1a,GAAI,QAAE,QAAS+yB,IAAM,CACzBW,MAAO,CACLtF,KAAM,CAAC,EACP7Y,MAAO,CAAEu2B,QAAS,OAEpBlU,SAAU,CACR,CACEqT,IAAK,UACLzC,SAAW9lC,IACT,KAAMA,aAAaqpC,aACjB,MAAM,QAAErpC,GACV,MAAO,CAAE0rB,KAAM1rB,EAAEspC,aAAa,QAASz2B,MAAO7S,EAAEspC,aAAa,SAAU,IAI7Ed,MAAQxoC,GAAM,CAAC,IAAK,IAAKqwB,EAAEryB,IAAIy4B,EAAG/+B,IAAT24B,CAAcrwB,MAAOA,EAAEgxB,QAChDU,cAAe,CACbnQ,MAAQvhB,GAAiB,SAAXA,EAAE3F,KAChBs3B,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACb,MAAM0I,EAAI0B,EAAE5U,IAAKuU,EAAIK,EAAEhf,MACvB7S,EAAEyoC,SAAShhB,EAAG,CAAEiE,KAAMyE,EAAGtd,MAAO2e,IAAMxxB,EAAEuH,KAAKsqB,EAAEhuB,UAAW7D,EAAE0oC,UAAUjhB,EAAE,GAG5EwB,WAAY,CACV1H,MAAQvhB,GAAsB,SAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV7xB,EAAE2oC,SAAS9W,EAAG,YAAQ,EAAQ,CAC5Bhf,MAAOgf,EAAEb,MAAMne,MACfoK,IAAK4U,EAAEb,MAAMtF,MACb,OAIR0E,EAAE9yB,EAAEsrC,KAAM,CACR7T,YAAa,mBACb/c,MAAO,SAET,MAAMuxB,GAAK,QAAE,cAAc,IAAM,CAAClZ,EAAI,CAAC,KAAM,QAAE/yB,EAAEjD,OAAQg2B,KACzDD,EAAEmZ,EAAI,CACJxU,YAAa,6BACb/c,MAAO,SAET,MAAMwxB,GAAK,QAAE,cAAc,IAAM,CAACnZ,EAAI,CAAC,IAAM,CAACrwB,EAAG6xB,KAC/C,IAAKA,EACH,OAAO,EACT,IAAIpK,EAAG0I,GAAK,EACZ,MAAQsN,UAAWjM,GAAMxxB,GAAKuE,KAAMvO,EAAGsmC,GAAIhJ,GAAM9B,EACjD,GAAIxxB,EAAEiiB,IAAIwnB,aAAazzC,EAAGA,IAAMs9B,EAAIA,EAAI,EAAIA,GAAG,CAACrB,EAAGz7B,KACjD,GAAI8G,EAAEjD,OAAOw5B,QAAQ5B,EAAEb,OACrB,OAAO3J,EAAIwK,EAAG9B,EAAI35B,GAAG,CAAE,KACtBixB,EACH,OAAO,EACT,MAAMxnB,EAAIwnB,EAAE2J,MAAMG,MAAK,EAAGl3B,KAAM43B,KAAQA,IAAM30B,EAAEjD,SAChD,IAAK4F,EACH,OAAO,EACT,MAAM4hB,EAAIsO,EAAGM,EAAIN,EAAI1I,EAAEiiB,UAAY5L,GAAI1K,GAAMpzB,EAAG+yB,EAAIz1B,EAAEjD,OAAOmW,OAAO,IAAKvQ,EAAE+wB,SAAUX,IACrF,QAAO0C,IAAKlB,EACVuB,EAAE6V,WAAWpnB,EAAG4O,EAAGxwB,GAAGipC,QAAQrnB,EAAG4O,EAAGsC,GAAG0O,aAAa,IAAI,KAAGrO,EAAEqK,UAAUkM,UAAU/H,mBAChF,EAAQ,IAEbxR,EAAEoZ,EAAI,CACJzU,YAAa,6BACb/c,MAAO,SAET,MAAMsgB,GAAK,QAAG,OAAO,KAAM,CACzB3iC,QAAS,SACT+7B,cAAe,CACbnQ,MAAO,EAAGlnB,KAAMg2B,KAAc,SAANA,EACxBsB,OAAQ,CAACtB,EAAGrwB,EAAG6xB,KACbxB,EAAEuZ,WAAW5pC,EAAG6xB,EAAE,GAGtB5I,WAAY,CACV1H,MAAQ8O,GAAsB,QAAhBA,EAAEh2B,KAAKpC,KACrB05B,OAAQ,CAACtB,EAAGrwB,KACVqwB,EAAEuB,SAAS,QAASvB,EAAE9oB,KAAKvH,EAAErK,QAAQ,OAI3Cy6B,EAAEkI,EAAI,CACJvD,YAAa,kBACb/c,MAAO,QAET,MAAM8f,GAAK,QAAE,aACb1H,EAAE0H,EAAI,CACJ/C,YAAa,kBACb/c,MAAO,cAET,MAAMoa,GAAI,QAAE,aAAc/B,IAAM,CAC9B16B,QAAS,UACTqiB,MAAO,QACPkd,SAAU,CAAC,CAAEqT,IAAK,MAClBC,MAAQxoC,GAAM,CAAC,IAAKqwB,EAAEryB,IAAI85B,EAAGpgC,IAAT24B,CAAcrwB,GAAI,GACtC0xB,cAAe,CACbnQ,MAAQvhB,GAAiB,cAAXA,EAAE3F,KAChBs3B,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACbznB,EAAE4xB,SAASnK,GAAIoK,EAAEhuB,SAAW7D,EAAEuH,KAAKsqB,EAAEhuB,UAAY7D,EAAE+oC,QAAQlX,EAAEz5B,OAAS,IAAK4H,EAAE6pC,WAAW,GAG5F5gB,WAAY,CACV1H,MAAQvhB,GAAsB,cAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV7xB,EAAE4xB,SAAS,aAAcuW,EAAGnoC,EAAG6xB,GAAI7xB,EAAE6pC,WAAW,OAItDzZ,EAAEgC,EAAEzuB,KAAM,CACRoxB,YAAa,wBACb/c,MAAO,cAEToY,EAAEgC,EAAEl0B,IAAK,CACP62B,YAAa,2BACb/c,MAAO,cAET,MAAM0e,GAAK,QAAE,gBAAgB,IAAM,KAAM,QAAEtE,EAAE/3B,UAC7C+1B,EAAEsG,EAAI,CACJ3B,YAAa,+BACb/c,MAAO,cAET,MAAM8xB,GAAK,QAAE,kBAAmB,CAC9BC,aAAc,CACZ3G,UAAW,YACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKm/B,EAAGh/B,IAAI,KAIjC04B,EAAE0Z,EAAG5rC,IAAK,CACR62B,YAAa,uBACb/c,MAAO,cAEToY,EAAE0Z,EAAG1G,UAAW,CACdrO,YAAa,oBACb/c,MAAO,cAET,MAAMgyB,EAAK1yC,MAAM,GAAG2yC,KAAK,GAAGx0C,KAAI,CAAC46B,EAAGrwB,IAAMA,EAAI,IAAmC+wB,GAAI,SAA7BV,GAAM,EAAGA,EAAEnZ,cAAwB,sBAC3FkZ,EAAEW,EAAG,CACHgE,YAAa,0BACb/c,MAAO,YAET,MAAMkyB,GAAK,QAAE,WACb9Z,EAAE8Z,EAAI,CACJnV,YAAa,gBACb/c,MAAO,YAET,MAAM+X,GAAI,QAAE,WAAYM,IACtB,MAAMrwB,EAAIqwB,EAAEryB,IAAI+yB,EAAEr5B,KAClB,MAAO,CACL/B,QAAS,UACTqiB,MAAO,QACPmyB,UAAU,EACVnZ,MAAO,CACLv6B,GAAI,CACF2yC,QAAS,IAEXgB,MAAO,CACLhB,QAAS,IAGblU,SAAU8U,EAAGv0C,KAAKo8B,IAAM,CACtB0W,IAAK,IAAI1W,IACTiU,SAAWre,IACT,KAAMA,aAAa4hB,aACjB,MAAM,QAAE5hB,GACV,MAAO,CAAE2iB,MAAOvY,EAAGp7B,GAAIgxB,EAAEhxB,GAAI,MAGjC+xC,MAAQ3W,GAAM,CACZ,IAAIA,EAAEb,MAAMoZ,QACZ,IACK/Z,EAAEryB,IAAIksC,EAAGxyC,IAAT24B,CAAcwB,GACjBp7B,GAAIo7B,EAAEb,MAAMv6B,IAAMuJ,EAAE6xB,IAEtB,GAEFH,cAAe,CACbnQ,MAAO,EAAGlnB,KAAMw3B,KAAc,YAANA,EACxBF,OAAQ,CAACE,EAAGpK,EAAG0I,KACb,MAAMqB,EAAI/J,EAAE3I,MACZ+S,EAAED,SAASzB,EAAG,CAAEia,MAAO5Y,IAAMK,EAAEtqB,KAAKkgB,EAAE5jB,UAAWguB,EAAEgY,WAAW,GAGlE5gB,WAAY,CACV1H,MAAQsQ,GAAsB,YAAhBA,EAAEx3B,KAAKpC,KACrB05B,OAAQ,CAACE,EAAGpK,KACVoK,EAAED,SAAS,eAAW,EAAQ,CAAE9S,MAAO2I,EAAEuJ,MAAMoZ,QAAUjC,EAAGtW,EAAGpK,GAAIoK,EAAEgY,WAAW,GAGrF,IAEHzZ,EAAEL,EAAEpsB,KAAM,CACRoxB,YAAa,sBACb/c,MAAO,YAEToY,EAAEL,EAAE7xB,IAAK,CACP62B,YAAa,yBACb/c,MAAO,YAET,MAAMqyB,GAAK,SAAGha,GAAM,EAAG,oBAAqBN,EAAE11B,QAAS2F,IACrD,IAAIhK,EAAGs9B,EACP,MAAMzB,GAAyD,OAAnDyB,EAAsB,OAAjBt9B,EAAIgK,EAAEsqC,aAAkB,EAASt0C,EAAEu0C,aAAkB,EAASjX,EAAEx9B,SAAW,EAAG2xB,EAAI4I,EAAEryB,IAAI,OAAMwsC,MAAOra,GAAM1I,EAAEzY,MAAMyuB,UAAWjM,EAAIrB,EAAExsB,OACrJ,GAAoB,YAAhB6tB,EAAEn3B,KAAKpC,KAAoB,CAC7B,IAAIgI,EAAIsG,OAAOirB,EAAER,MAAMoZ,OAAS7jC,OAAOsrB,GACvC,OAAO5xB,EAAI,IAAMA,EAAI,GAAI,CAAEmqC,MAAOnqC,EACpC,CACA,MAAO,CAAEmqC,MAAOvY,EAAG,MAErBzB,EAAEia,EAAI,CACJtV,YAAa,oCACb/c,MAAO,YAET,MAAM6a,GAAI,QAAE,iBAAiB,IAAOxC,IAAOA,IAAMA,EAAI,GAAIA,EAAI,GAAI,QAAE+B,EAAE/3B,SAAU,QAAE01B,EAAE11B,OAAQ,CAAE+vC,MAAO/Z,OACpGD,EAAEyC,EAAG,CACHkC,YAAa,gCACb/c,MAAO,YAET,MAAM2e,IAAK,QAAE,oBAAoB,IAAM,IAAM,CAACtG,EAAGrwB,EAAG6xB,KAClD,MAAQ2Y,MAAO/iB,GAAM4I,EAAEoN,UAAWtN,EAAI1I,EAAE9jB,OACxC,GAAIwsB,EAAE91B,OAAS01B,EAAE11B,SAAWg2B,EAAEoN,UAAUlB,OAA4B,IAAnB9U,EAAEgjB,aACjD,OAAO,EACT,MAAMjZ,EAAIrB,EAAEa,MAAMoZ,MAAQ,EAC1B,OAAO5Y,GAAU,MAALxxB,GAAaA,EACvBqwB,EAAEyN,GAAG4M,cAAcra,EAAEoN,UAAU+M,MAAMtlC,cAAU,EAAQ,IAClDirB,EAAEa,MACLoZ,MAAO5Y,MAER,IAAM,QAAEY,EAAE/3B,OAAJ,CAAYg2B,EAAGrwB,EAAG6xB,EAAE,IAE/BzB,EAAEuG,GAAI,CACJ5B,YAAa,mCACb/c,MAAO,YAET,MAAM2yB,IAAK,QAAE,gBAAiB,CAC5BC,WAAY,CACVxH,UAAW,YACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKs7B,EAAEn7B,IAAK,EAAE,GAGjCmzC,WAAY,CACVzH,UAAW,YACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKs7B,EAAEn7B,IAAK,EAAE,GAGjCozC,WAAY,CACV1H,UAAW,YACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKs7B,EAAEn7B,IAAK,EAAE,GAGjCqzC,WAAY,CACV3H,UAAW,YACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKs7B,EAAEn7B,IAAK,EAAE,GAGjCszC,WAAY,CACV5H,UAAW,YACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKs7B,EAAEn7B,IAAK,EAAE,GAGjCuzC,WAAY,CACV7H,UAAW,YACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKs7B,EAAEn7B,IAAK,EAAE,GAGjCwzC,iBAAkB,CAChB9H,UAAW,CAAC,SAAU,aACtBH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKo/B,GAAGj/B,IAAI,KAIjC04B,EAAEua,GAAGzsC,IAAK,CACR62B,YAAa,qBACb/c,MAAO,YAEToY,EAAEua,GAAGvH,UAAW,CACdrO,YAAa,kBACb/c,MAAO,YAET,MAAMoc,IAAK,QAAE,cACbhE,EAAEgE,GAAI,CACJW,YAAa,mBACb/c,MAAO,eAET,MAAM8X,IAAI,QAAE,cAAeO,IAAM,CAC/B16B,QAAS,SACTqiB,MAAO,QACPmyB,UAAU,EACVjV,SAAU,CAAC,CAAEqT,IAAK,eAClBC,MAAQxoC,GAAM,CAAC,aAAcqwB,EAAEryB,IAAIo2B,GAAG18B,IAAT24B,CAAcrwB,GAAI,GAC/C0xB,cAAe,CACbnQ,MAAO,EAAGlnB,KAAM2F,KAAc,eAANA,EACxB2xB,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACbznB,EAAE4xB,SAASnK,GAAGlgB,KAAKsqB,EAAEhuB,UAAUgmC,WAAW,GAG9C5gB,WAAY,CACV1H,MAAQvhB,GAAsB,eAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV7xB,EAAE4xB,SAAS,cAAcrqB,KAAKsqB,EAAEl8B,SAASk0C,WAAW,OAI1DzZ,EAAEN,GAAEnsB,KAAM,CACRoxB,YAAa,yBACb/c,MAAO,eAEToY,EAAEN,GAAE5xB,IAAK,CACP62B,YAAa,4BACb/c,MAAO,eAET,MAAMyc,IAAK,SAAE,IAAM,EAAE,WAAY3E,GAAEz1B,UACnC+1B,EAAEqE,GAAI,CACJM,YAAa,uCACb/c,MAAO,eAET,MAAMmc,IAAK,QAAE,oBAAoB,IAAM,KAAM,QAAErE,GAAEz1B,UACjD+1B,EAAE+D,GAAI,CACJY,YAAa,mCACb/c,MAAO,eAET,MAAMsc,IAAK,QAAE,mBAAoB,CAC/B6W,iBAAkB,CAChB/H,UAAW,cACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAK48B,GAAGz8B,IAAI,KAIjC04B,EAAEkE,GAAGp2B,IAAK,CACR62B,YAAa,wBACb/c,MAAO,eAEToY,EAAEkE,GAAG8O,UAAW,CACdrO,YAAa,qBACb/c,MAAO,eAET,MAAMkgB,IAAK,QAAE,aAAa,KAAM,CAC9BkT,IAAK,CAAC,EACNrmC,KAAM,CAAC,MAETqrB,EAAE8H,GAAI,CACJnD,YAAa,kBACb/c,MAAO,cAET,MAAMzI,IAAI,QAAE,cAAe8gB,IAAM,CAC/B16B,QAAS,QACTqiB,MAAO,QACPoZ,MAAO,GACP+Y,UAAU,EACVplC,MAAM,EACNisB,MAAO,CACLqa,SAAU,CACRjC,QAAS,KAGblU,SAAU,CACR,CACEqT,IAAK,MACL+C,mBAAoB,OACpBxF,SAAW9lC,IACT,KAAMA,aAAaqpC,aACjB,MAAM,QAAErpC,GACV,MAAO,CAAEqrC,SAAUrrC,EAAEurC,QAAQF,SAAU,IAI7C7C,MAAQxoC,IACN,MAAM6xB,EAAIxB,EAAEryB,IAAIk6B,GAAGxgC,IAAT24B,CAAcrwB,GACxB,MAAO,CACL,MACA,IACK6xB,EAAEuZ,IACL,gBAAiBprC,EAAEgxB,MAAMqa,UAE3B,CAAC,OAAQxZ,EAAE9sB,KAAM,GAClB,EAEH2sB,cAAe,CACbnQ,MAAO,EAAGlnB,KAAM2F,KAAc,SAANA,EACxB2xB,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACb,MAAM0I,EAAI0B,EAAEtS,KAAMiS,EAAIK,EAAEz5B,MACxB4H,EAAE4xB,SAASnK,EAAG,CAAE4jB,SAAUlb,IAAMqB,GAAKxxB,EAAE+oC,QAAQvX,GAAIxxB,EAAE6pC,WAAW,GAGpE5gB,WAAY,CACV1H,MAAQvhB,GAAsB,eAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV,IAAIpK,EACJznB,EAAEwrC,QAAQ,YAAQ,GAAuC,OAA7B/jB,EAAIoK,EAAEl8B,QAAQ81C,iBAAsB,EAAShkB,EAAEza,OAAS,GAAI,CACtFuS,KAAMsS,EAAEb,MAAMqa,UACd,OAIRjb,EAAE7gB,GAAE5L,KAAM,CACRoxB,YAAa,wBACb/c,MAAO,cAEToY,EAAE7gB,GAAErR,IAAK,CACP62B,YAAa,2BACb/c,MAAO,cAET,MAAM6Y,IAAK,SAAE,IAAM,EAAG,kCAAmCthB,GAAElV,QAASg2B,IAClE,IAAIrwB,EACJ,MAAO,CACLqrC,UAA6B,OAAjBrrC,EAAIqwB,EAAEia,aAAkB,EAAStqC,EAAEqrC,WAAa,GAC7D,MAEHjb,EAAES,GAAI,CACJkE,YAAa,sCACb/c,MAAO,cAET,MAAM+d,IAAK,QAAE,mBAAmB,IAAM,CAAC1F,EAAI,MAAO,QAAE9gB,GAAElV,OAAQ,CAAEgxC,SAAUhb,MAC1ED,EAAE2F,GAAI,CACJhB,YAAa,kCACb/c,MAAO,cAGToY,GADW,QAAE,2BAA2B,IAAM,EAAGtU,IAAKuU,EAAGgb,SAAUrrC,GAAM,CAAE8b,KAAM,EAAGuvB,SAAU,MAAS,CAACxZ,EAAGpK,IAAM4I,GAAK,IAAU,MAAL5I,GAAaA,EAAEoK,EAAEiM,GAAG4N,iBAAiBrb,EAAG,WAAYrwB,KAAK,KAC9K,CACJ+0B,YAAa,0CACb/c,MAAO,cAET,MAAMuc,IAAK,QAAE,kBAAmB,CAC9BoX,gBAAiB,CACfvI,UAAW,YACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKw+B,GAAGr+B,IAAI,KAIjC04B,EAAEmE,GAAGr2B,IAAK,CACR62B,YAAa,uBACb/c,MAAO,cAEToY,EAAEmE,GAAG6O,UAAW,CACdrO,YAAa,oBACb/c,MAAO,cAET,MAAM6e,IAAK,QAAE,SACbzG,EAAEyG,GAAI,CACJ9B,YAAa,cACb/c,MAAO,UAET,MAAMkb,IAAI,QAAE,SAAU7C,IAAM,CAC1Bub,QAAQ,EACR5zB,MAAO,SACP6zB,YAAY,EACZC,WAAW,EACX1a,MAAO,GACP2a,MAAM,EACN5B,UAAU,EACV6B,WAAW,EACXhb,MAAO,CACLv4B,IAAK,CAAE2wC,QAAS,IAChBxlC,IAAK,CAAEwlC,QAAS,IAChBv2B,MAAO,CAAEu2B,QAAS,KAEpBlU,SAAU,CACR,CACEqT,IAAK,WACLzC,SAAW9lC,IACT,KAAMA,aAAaqpC,aACjB,MAAM,QAAErpC,GACV,MAAO,CACLvH,IAAKuH,EAAEspC,aAAa,QAAU,GAC9B1lC,IAAK5D,EAAEspC,aAAa,QAAU,GAC9Bz2B,MAAO7S,EAAEspC,aAAa,UAAYtpC,EAAEspC,aAAa,QAAU,GAC5D,IAIPd,MAAQxoC,GAAM,CAAC,MAAO,IAAKqwB,EAAEryB,IAAI64B,GAAGn/B,IAAT24B,CAAcrwB,MAAOA,EAAEgxB,QAClDU,cAAe,CACbnQ,MAAO,EAAGlnB,KAAM2F,KAAc,UAANA,EACxB2xB,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACb,MAAM0I,EAAI0B,EAAE5U,IAAKuU,EAAIK,EAAEjuB,IAAK5N,EAAI67B,EAAEhf,MAClC7S,EAAEwrC,QAAQ/jB,EAAG,CACXhvB,IAAK03B,EACLvsB,IAAK4tB,EACL3e,MAAO7c,GACP,GAGNizB,WAAY,CACV1H,MAAQvhB,GAAsB,UAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV7xB,EAAEwrC,QAAQ,aAAS,OAAQ,EAAQ,CACjC34B,MAAOgf,EAAEb,MAAMne,MACfoK,IAAK4U,EAAEb,MAAMv4B,IACbmL,IAAKiuB,EAAEb,MAAMptB,KACb,OAIRwsB,EAAE8C,GAAEvvB,KAAM,CACRoxB,YAAa,oBACb/c,MAAO,UAEToY,EAAE8C,GAAEh1B,IAAK,CACP62B,YAAa,uBACb/c,MAAO,UAET,MAAMqf,IAAK,QAAE,eAAe,IAAM,CAAChH,EAAI,CAAC,IAAM,CAACrwB,EAAG6xB,KAChD,IAAKA,EACH,OAAO,EACT,MAAQp5B,IAAKgvB,EAAI,GAAI7jB,IAAKusB,EAAI,GAAItd,MAAO2e,EAAI,IAAOnB,EAAGr6B,EAAIk9B,GAAE74B,OAAOmW,OAAO,CAAE/X,IAAKgvB,EAAG7jB,IAAKusB,EAAGtd,MAAO2e,IACpG,OAAOx7B,GAAK67B,EAAE7xB,EAAE89B,GAAGmO,qBAAqBj2C,GAAG4rC,mBAAmB,CAAE,IAElExR,EAAEiH,GAAI,CACJtC,YAAa,8BACb/c,MAAO,UAET,MAAM4f,IAAK,QAAE,eAAe,IAAM,CAACvH,EAAI,CAAC,IAAM,CAACrwB,EAAG6xB,KAChD,MAAMpK,GAAI,QAAGznB,EAAEy9B,UAAWvK,GAAE74B,QAC5B,IAAKotB,EACH,OAAO,EACT,MAAQ9jB,KAAMwsB,EAAGrU,IAAK0V,GAAM/J,EAAGzxB,EAAI,IAAKm6B,EAAEa,QAAWv4B,IAAK66B,EAAG1vB,IAAK3D,EAAG4S,MAAOgP,GAAMwO,EAClF,YAAa,IAANiD,IAAiBt9B,EAAEyC,IAAM66B,QAAU,IAANrzB,IAAiBjK,EAAE4N,IAAM3D,QAAU,IAAN4hB,IAAiB7rB,EAAE6c,MAAQgP,GAAS,MAALgQ,GAAaA,EAAE7xB,EAAE89B,GAAG4M,cAAclZ,OAAG,EAAQx7B,GAAG4rC,mBAAmB,CAAE,IAEvKxR,EAAEwH,GAAI,CACJ7C,YAAa,8BACb/c,MAAO,UASToY,GAPW,SAAE,IAAM,IAAI,EACrB,sEACA,CAACC,EAAGrwB,EAAG6xB,EAAGpK,KACR,MAAO0I,EAAGqB,EAAGx7B,EAAI,GAAIs9B,GAAKtzB,EAC1B,OAAOmwB,EAAIE,EAAEyN,GAAGgH,YAAYjT,EAAGpK,EAAGyL,GAAE74B,OAAOmW,OAAO,CAAE/X,IAAKzC,EAAG4N,IAAK4tB,EAAG3e,MAAOygB,KAAQ,IAAI,MAGrF,CACJyB,YAAa,kCACb/c,MAAO,UAET,MAAMmd,IAAK,QAAE,aAAc9E,IAAM,CAC/B,iBAAkBA,EAAEW,MAAMkb,aAE5B9b,EAAE+E,GAAI,CACJJ,YAAa,kBACb/c,MAAO,cAET,MAAM0P,IAAI,QAAE,aAAc2I,IAAM,CAC9Bub,QAAQ,EACR5zB,MAAO,SACPgZ,MAAO,CACLkb,SAAU,CACR9C,SAAS,IAGbyC,YAAY,EACZ3W,SAAU,CAAC,CAAEqT,IAAK,OAClBC,MAAQxoC,GAAM,CAAC,KAAMqwB,EAAEryB,IAAIm3B,GAAGz9B,IAAT24B,CAAcrwB,IACnC0xB,cAAe,CACbnQ,MAAO,EAAGlnB,KAAM2F,KAAc,UAANA,EACxB2xB,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACb,IAAI0I,EACJnwB,EAAEwrC,QAAQ/jB,EAAG,CAAEykB,SAAUxoC,QAAwB,OAAfysB,EAAI0B,EAAErqB,WAAgB,EAAS2oB,EAAE+b,WAAY,GAGnFC,SAAU,IAAM,KAEhBljB,WAAY,CACV1H,MAAQvhB,GAAsB,cAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACVA,EAAEb,MAAMkb,SAAWlsC,EAAEwrC,QAAQ,YAAQ,EAAQ,MAC9CxrC,EAAEwrC,QAAQ,QAAQ,OAIvBpb,EAAE1I,GAAE/jB,KAAM,CACRoxB,YAAa,wBACb/c,MAAO,cAEToY,EAAE1I,GAAExpB,IAAK,CACP62B,YAAa,2BACb/c,MAAO,cAET,MAAMo0B,IAAK,QAAE,mBAAmB,IAAM,IAAM,CAAC/b,EAAGrwB,KAC9C,IAAImwB,EACJ,MAAQsN,UAAW5L,EAAGiM,GAAIrW,GAAM4I,EAChC,GAAIwB,EAAE0K,MAAO,CACX,MAAM/K,EAAIK,EAAE2Y,MAAM7mC,OAClB,GAAI6tB,EAAE4W,WAAa,GAA4D,eAAjC,OAApBjY,EAAIqB,EAAE6W,gBAAqB,EAASlY,EAAE91B,KAAKpC,MACnE,OAAY,MAAL+H,GAAaA,EAClBynB,EAAE4kB,iBAAiBxa,EAAEyK,GAAK,EAAGzK,EAAEyK,GAAIjM,EAAEgB,OAAO1tB,KAAK,cAAc89B,aAAa,UAAQha,EAAExF,IAAI1hB,QAAQsxB,EAAEyK,MAAMsF,mBACzG,CACP,CACA,OAAY,MAAL5hC,GAAaA,EAAEynB,EAAEia,QAAQ,aAAa,GAAIuK,qBAAqBvkB,GAAErtB,OAAOmW,UAAUoxB,mBAAmB,CAAE,IAEhHxR,EAAEgc,GAAI,CACJrX,YAAa,kCACb/c,MAAO,cAET,MAAMs0B,IAAK,QAAE,kBAAmB,CAC9BC,gBAAiB,CACfnJ,UAAW,cACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAK60C,GAAG10C,IAAI,KAIjC04B,EAAEkc,GAAGpuC,IAAK,CACR62B,YAAa,uBACb/c,MAAO,cAEToY,EAAEkc,GAAGlJ,UAAW,CACdrO,YAAa,oBACb/c,MAAO,cAET,MAAMghB,IAAK,QAAE,MACb5I,EAAE4I,GAAI,CACJjE,YAAa,WACb/c,MAAO,OAET,MAAMogB,IAAI,QAAE,MAAO/H,IAAM,CACvBrY,MAAO,QACPkd,SAAU,CAAC,CAAEqT,IAAK,OAClBC,MAAQxoC,GAAM,CAAC,KAAMqwB,EAAEryB,IAAIg7B,GAAGthC,IAAT24B,CAAcrwB,IACnC0xB,cAAe,CACbnQ,MAAO,EAAGlnB,KAAM2F,KAAc,kBAANA,EACxB2xB,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACbznB,EAAEwrC,QAAQ/jB,EAAE,GAGhBwB,WAAY,CACV1H,MAAQvhB,GAAsB,OAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAS3xB,IACPA,EAAEwrC,QAAQ,gBAAgB,OAIhCpb,EAAEgI,GAAEz0B,KAAM,CACRoxB,YAAa,iBACb/c,MAAO,OAEToY,EAAEgI,GAAEl6B,IAAK,CACP62B,YAAa,oBACb/c,MAAO,OAET,MAAMie,IAAK,SAAE,IAAM,IAAI,EACrB,4BACA,CAAC5F,EAAGrwB,EAAG6xB,EAAGpK,KACR,MAAQqW,GAAI3N,GAAME,EAClB,OAAOrwB,EAAE,IAAMmwB,EAAE2U,YAAYjT,EAAI,EAAGpK,EAAG2Q,GAAE/9B,OAAOmW,UAAW2f,CAAC,MAGhEC,EAAE6F,GAAI,CACJlB,YAAa,+BACb/c,MAAO,OAET,MAAMw0B,IAAK,QAAE,YAAY,IAAM,IAAM,CAACnc,EAAGrwB,KACvC,IAAKA,EACH,OAAO,EACT,MAAM6xB,EAAIO,EAAEzuB,KAAKtJ,OAAOmW,UAAYstB,GAAIrW,EAAGgW,UAAWtN,GAAME,GAAK9rB,KAAMitB,GAAMrB,EAAGn6B,EAAIoiC,GAAE/9B,OAAOmW,SAC7F,IAAKxa,EACH,OAAO,EACT,MAAMs9B,EAAI7L,EAAEwkB,qBAAqBj2C,GAAGwvC,OAAOhU,EAAGK,GAAI5xB,EAAI,cAAYqzB,EAAErR,IAAI1hB,QAAQixB,GAAI,GAAG,GACvF,OAAOvxB,GAAKD,EAAEszB,EAAEmO,aAAaxhC,GAAG2hC,mBAAmB,CAAE,IAEvDxR,EAAEoc,GAAI,CACJzX,YAAa,2BACb/c,MAAO,OAET,MAAMqc,IAAK,QAAE,cACbjE,EAAEiE,GAAI,CACJU,YAAa,mBACb/c,MAAO,eAET,MAAMuY,IAAI,QAAE,eAAgBF,IAAM,CAChC16B,QAAS,YACTqiB,MAAO,QACPgZ,MAAO,CACLlT,OAAQ,CACNsrB,SAAS,IAGblU,SAAU,CACR,CACEqT,IAAK,KACLzC,SAAW9lC,IACT,KAAMA,aAAaqpC,aACjB,MAAM,QAAErpC,GACV,MAAO,CACL8d,OAAQ9d,EAAEurC,QAAQztB,OACnB,IAIP0qB,MAAQxoC,GAAM,CACZ,KACA,IACKqwB,EAAEryB,IAAIq2B,GAAG38B,IAAT24B,CAAcrwB,GACjB,cAAeA,EAAEgxB,MAAMlT,QAEzB,GAEF4T,cAAe,CACbnQ,MAAO,EAAGlnB,KAAM2F,EAAGghB,QAAS6Q,KAAc,SAAN7xB,IAAiB6xB,EACrDF,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACb,MAAM0I,EAAgB,MAAZ0B,EAAE/T,OAAiB,GAAG+T,EAAE/T,SAAW,QAC7C9d,EAAE4xB,SAASnK,EAAG,CAAE3J,OAAQqS,IAAK5oB,KAAKsqB,EAAEhuB,UAAUgmC,WAAW,GAG7D5gB,WAAY,CACV1H,MAAQvhB,GAAsB,gBAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV7xB,EAAE4xB,SAAS,YAAQ,EAAQ,CAAE5Q,SAAS,EAAIlD,OAA2B,SAAnB+T,EAAEb,MAAMlT,SAAqBvW,KAAKsqB,EAAEl8B,SAASk0C,WAAW,OAIhHzZ,EAAEG,GAAE5sB,KAAM,CACRoxB,YAAa,yBACb/c,MAAO,eAEToY,EAAEG,GAAEryB,IAAK,CACP62B,YAAa,4BACb/c,MAAO,eAET,MAAM8d,IAAK,SAAE,IAAM,EAAE,iBAAkBvF,GAAEl2B,UACzC+1B,EAAE0F,GAAI,CACJf,YAAa,uCACb/c,MAAO,eAET,MAAM+b,IAAK,QAAE,oBAAoB,IAAM,KAAM,QAAExD,GAAEl2B,UACjD+1B,EAAE2D,GAAI,CACJgB,YAAa,mCACb/c,MAAO,eAET,MAAM4e,IAAK,QAAE,mBAAoB,CAC/B6V,iBAAkB,CAChBrJ,UAAW,YACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKw8B,GAAGr8B,IAAI,KAIjC04B,EAAEwG,GAAG14B,IAAK,CACR62B,YAAa,8BACb/c,MAAO,eAEToY,EAAEwG,GAAGwM,UAAW,CACdrO,YAAa,2BACb/c,MAAO,eAET,MAAM00B,IAAK,QAAE,eACbtc,EAAEsc,GAAI,CACJ3X,YAAa,oBACb/c,MAAO,gBAET,MAAM8a,IAAI,QAAE,gBAAiBzC,IAAM,CACjC16B,QAAS,YACTqiB,MAAO,QACPgZ,MAAO,CACLrF,MAAO,CACLyd,QAAS,GAEXtrB,OAAQ,CACNsrB,SAAS,IAGblU,SAAU,CACR,CACEqT,IAAK,KACLzC,SAAW9lC,IACT,KAAMA,aAAaqpC,aACjB,MAAM,QAAErpC,GACV,MAAO,CACL8d,OAAQ9d,EAAEurC,QAAQztB,OAClB6N,MAAO3rB,EAAE2sC,aAAa,SAAWpmC,OAAOvG,EAAEspC,aAAa,UAAY,EACpE,IAIPd,MAAQxoC,GAAM,CACZ,KACA,IACKqwB,EAAEryB,IAAI0uC,GAAGh1C,IAAT24B,CAAcrwB,MACI,IAAlBA,EAAEgxB,MAAMrF,MAAc,CAAC,EAAI3rB,EAAEgxB,MAAMrF,MACtC,cAAe3rB,EAAEgxB,MAAMlT,QAEzB,GAEF4T,cAAe,CACbnQ,MAAO,EAAGlnB,KAAM2F,EAAGghB,QAAS6Q,KAAc,SAAN7xB,KAAkB6xB,EACtDF,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACb,MAAM0I,EAAgB,MAAZ0B,EAAE/T,OAAiB,GAAG+T,EAAE/T,SAAW,OAC7C9d,EAAE4xB,SAASnK,EAAG,CAAE3J,OAAQqS,IAAK5oB,KAAKsqB,EAAEhuB,UAAUgmC,WAAW,GAG7D5gB,WAAY,CACV1H,MAAQvhB,GAAsB,iBAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV7xB,EAAE4xB,SAAS,YAAQ,EAAQ,CAAE5Q,SAAS,EAAI/c,MAAO,EAAG6Z,OAA2B,SAAnB+T,EAAEb,MAAMlT,SAAsB9d,EAAEuH,KAAKsqB,EAAEl8B,SAAUqK,EAAE6pC,WAAW,OAIhIzZ,EAAE0C,GAAEnvB,KAAM,CACRoxB,YAAa,0BACb/c,MAAO,gBAEToY,EAAE0C,GAAE50B,IAAK,CACP62B,YAAa,6BACb/c,MAAO,gBAET,MAAM40B,IAAK,SAAE,IAAM,EACjB,iBACA9Z,GAAEz4B,QACDg2B,IAAM,CAAG1E,MAAOplB,OAAO8pB,EAAE,QAC1B,CAACA,EAAGrwB,IAAMA,EAAEooC,WAAapoC,EAAEgxB,MAAMrF,QAAUplB,OAAO8pB,EAAE,QAEtDD,EAAEwc,GAAI,CACJ7X,YAAa,wCACb/c,MAAO,gBAET,MAAM60B,IAAK,QAAE,qBAAqB,IAAM,KAAM,QAAE/Z,GAAEz4B,UAClD+1B,EAAEyc,GAAI,CACJ9X,YAAa,oCACb/c,MAAO,gBAET,MAAMqgB,IAAK,QAAE,oBAAqB,CAChCyU,kBAAmB,CACjB1J,UAAW,YACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKs1C,GAAGn1C,IAAI,KAIjC04B,EAAEiI,GAAGn6B,IAAK,CACR62B,YAAa,yBACb/c,MAAO,gBAEToY,EAAEiI,GAAG+K,UAAW,CACdrO,YAAa,sBACb/c,MAAO,gBAET,MAAMid,IAAK,QAAE,YACb7E,EAAE6E,GAAI,CACJF,YAAa,iBACb/c,MAAO,aAET,MAAM6X,IAAI,QAAE,aAAcQ,IAAM,CAC9BrY,MAAO,WACPriB,QAAS,mBACTq7B,MAAO,CACLxe,MAAO,CACL42B,QAAS,KAEX2D,SAAU,CACR3D,QAAS,UAEXtrB,OAAQ,CACNsrB,QAAS,SAGbe,UAAU,EACVjV,SAAU,CACR,CACEqT,IAAK,KACLzC,SAAW9lC,IACT,KAAMA,aAAaqpC,aACjB,MAAM,QAAErpC,GACV,MAAO,CACLwS,MAAOxS,EAAEurC,QAAQ/4B,MACjBu6B,SAAU/sC,EAAEurC,QAAQ,aACpBztB,OAAQ9d,EAAEurC,QAAQztB,OACnB,IAIP0qB,MAAQxoC,GAAM,CACZ,KACA,IACKqwB,EAAEryB,IAAIi3B,GAAGv9B,IAAT24B,CAAcrwB,GACjB,aAAcA,EAAEgxB,MAAMxe,MACtB,iBAAkBxS,EAAEgxB,MAAM+b,SAC1B,cAAe/sC,EAAEgxB,MAAMlT,QAEzB,GAEF4T,cAAe,CACbnQ,MAAO,EAAGlnB,KAAM2F,KAAc,aAANA,EACxB2xB,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACb,MAAM0I,EAAe,MAAX0B,EAAErf,MAAgB,GAAGqf,EAAErf,SAAW,IAAKgf,EAAe,MAAXK,EAAErf,MAAgB,UAAY,SAAUxc,EAAgB,MAAZ67B,EAAE/T,OAAiB,GAAG+T,EAAE/T,SAAW,OACpI9d,EAAE4xB,SAASnK,EAAG,CAAEjV,MAAO2d,EAAG4c,SAAUvb,EAAG1T,OAAQ9nB,IAAMgK,EAAEuH,KAAKsqB,EAAEhuB,UAAW7D,EAAE6pC,WAAW,GAG1F5gB,WAAY,CACV1H,MAAQvhB,GAAsB,cAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV7xB,EAAE4xB,SAAS,gBAAY,EAAQ,CAAE9T,OAA2B,SAAnB+T,EAAEb,MAAMlT,SAAsB9d,EAAEuH,KAAKsqB,EAAEl8B,SAAUqK,EAAE6pC,WAAW,OAI7GzZ,EAAEP,GAAElsB,KAAM,CACRoxB,YAAa,uBACb/c,MAAO,aAEToY,EAAEP,GAAE3xB,IAAK,CACP62B,YAAa,0BACb/c,MAAO,aAET,MAAMgc,IAAK,QAAE,gBAAgB,IAAM,KAAM,OC/3BnBgZ,ED+3BsBnd,GAAEx1B,OC93BnC,SAAU2U,EAAOgpB,GACpB,IAAI,MAAEwS,EAAK,IAAEyC,GAAQj+B,EAAMyuB,UACvBuI,EAAQwE,EAAMvE,WAAWgH,GAAKtpC,GAAQA,EAAKykC,WAAa,GAAKzkC,EAAK8nC,WAAWpxC,MAAQ2yC,IACzF,IAAKhH,EACD,OAAO,EACX,IAAI/2B,EAAa+2B,EAAM/2B,WACvB,GAAkB,GAAdA,EACA,OAAO,EACX,IAAIgX,EAAS+f,EAAM/f,OAAQkgB,EAAalgB,EAAOqC,MAAMrZ,EAAa,GAClE,GAAIk3B,EAAW9rC,MAAQ2yC,EACnB,OAAO,EACX,GAAIhV,EAAU,CACV,IAAIkV,EAAe/G,EAAWkC,WAAalC,EAAWkC,UAAUhuC,MAAQ4rB,EAAO5rB,KAC3E6iC,EAAQ,UAAcgQ,EAAeF,EAASx8B,SAAW,MACzD1V,EAAQ,IAAI,KAAM,UAAckyC,EAASx8B,OAAO,KAAM,UAAcyV,EAAO5rB,KAAKmW,OAAO,KAAM0sB,MAAWgQ,EAAe,EAAI,EAAG,GAC9HhoC,EAAS8gC,EAAM/hC,MAAOyN,EAAQs0B,EAAM5hC,IACxC4zB,EAAShpB,EAAM8uB,GAAGG,KAAK,IAAI,KAAkB/4B,GAAUgoC,EAAe,EAAI,GAAIx7B,EAAOxM,EAAQwM,EAAO5W,EAAO,GAAG,IACzG8mC,iBACT,CACA,OAAO,CACX,EArBJ,IAAsBoL,CD+3B+B,IACrD5c,EAAE4D,GAAI,CACJe,YAAa,+BACb/c,MAAO,aAET,MAAMm1B,IAAK,QAAE,iBAAiB,IAAM,KAAM,OC/7BpBH,ED+7BuBnd,GAAEx1B,OC97BpC,SAAU2U,EAAOgpB,GACpB,IAAI,MAAEwS,EAAK,IAAEyC,GAAQj+B,EAAMyuB,UACvBuI,EAAQwE,EAAMvE,WAAWgH,GAAKtpC,GAAQA,EAAKykC,WAAa,GAAKzkC,EAAK8nC,WAAWpxC,MAAQ2yC,IACzF,QAAKhH,KAEAhO,IAEDwS,EAAM7mC,KAAKqiC,EAAMlnB,MAAQ,GAAGzkB,MAAQ2yC,EAMhD,SAAyBh+B,EAAOgpB,EAAUgV,EAAUhH,GAChD,IAAIlI,EAAK9uB,EAAM8uB,GAAI15B,EAAM4hC,EAAM5hC,IAAKgpC,EAAYpH,EAAMiH,IAAI7oC,IAAI4hC,EAAMlnB,OAChE1a,EAAMgpC,IAGNtP,EAAGG,KAAK,IAAI,KAAkB75B,EAAM,EAAGgpC,EAAWhpC,EAAKgpC,EAAW,IAAI,KAAM,UAAcJ,EAASx8B,OAAO,KAAMw1B,EAAM/f,OAAOvtB,SAAU,EAAG,GAAI,GAAG,IACjJstC,EAAQ,IAAI,KAAUlI,EAAG7b,IAAI1hB,QAAQylC,EAAMwE,MAAM1uB,KAAMgiB,EAAG7b,IAAI1hB,QAAQ6sC,GAAYpH,EAAMlnB,QAE5F,MAAM/mB,GAAS,QAAWiuC,GAC1B,GAAc,MAAVjuC,EACA,OAAO,EACX+lC,EAAGuP,KAAKrH,EAAOjuC,GACf,IAAI2Z,EAAQosB,EAAGM,QAAQ3oC,IAAI2O,GAAM,GAAK,EAItC,OAHI,QAAQ05B,EAAG7b,IAAKvQ,IAChBosB,EAAG/nC,KAAK2b,GACZsmB,EAAS8F,EAAG8D,mBACL,CACX,CAtBmB0L,CAAgBt+B,EAAOgpB,EAAUgV,EAAUhH,GAuB9D,SAAuBh3B,EAAOgpB,EAAUgO,GACpC,IAAIlI,EAAK9uB,EAAM8uB,GAAIxoC,EAAO0wC,EAAM/f,OAEhC,IAAK,IAAInK,EAAMkqB,EAAM5hC,IAAKpO,EAAIgwC,EAAM72B,SAAW,EAAGnP,EAAIgmC,EAAM/2B,WAAYjZ,EAAIgK,EAAGhK,IAC3E8lB,GAAOxmB,EAAKgzB,MAAMtyB,GAAG0zC,SACrB5L,EAAGrF,OAAO3c,EAAM,EAAGA,EAAM,GAE7B,IAAIuqB,EAASvI,EAAG7b,IAAI1hB,QAAQylC,EAAM/hC,OAAQvO,EAAO2wC,EAAOkH,UACxD,GAAIzP,EAAGM,QAAQ3oC,IAAIuwC,EAAM5hC,MAAQ4hC,EAAM/hC,MAAQoiC,EAAOkH,UAAU7D,SAC5D,OAAO,EACX,IAAI8D,EAA8B,GAApBxH,EAAM/2B,WAAiBw+B,EAAQzH,EAAM72B,UAAY7Z,EAAK8yC,WAChEniB,EAASogB,EAAO1iC,MAAM,GAAI+pC,EAAcrH,EAAOtiC,OAAO,GAC1D,IAAKkiB,EAAO0nB,WAAWD,GAAeF,EAAU,EAAI,GAAIE,EAAc,EAAGh4C,EAAKC,QAAQqmC,OAAOyR,EAAQ,WAAiB,UAAcn4C,KAChI,OAAO,EACX,IAAI2O,EAAQoiC,EAAOvqB,IAAK1X,EAAMH,EAAQvO,EAAKg0C,SAO3C,OAHA5L,EAAGG,KAAK,IAAI,KAAkBh6B,GAASupC,EAAU,EAAI,GAAIppC,GAAOqpC,EAAQ,EAAI,GAAIxpC,EAAQ,EAAGG,EAAM,EAAG,IAAI,MAAOopC,EAAU,WAAiB,UAAcl4C,EAAKoD,KAAK,cAC7JsjC,OAAOyR,EAAQ,WAAiB,UAAcn4C,EAAKoD,KAAK,cAAmB80C,EAAU,EAAI,EAAGC,EAAQ,EAAI,GAAID,EAAU,EAAI,IAC/HxV,EAAS8F,EAAG8D,mBACL,CACX,CA3CmBgM,CAAc5+B,EAAOgpB,EAAUgO,IAC9C,EAZJ,IAAsBgH,CD+7BgC,IACtD5c,EAAE+c,GAAI,CACJpY,YAAa,+BACb/c,MAAO,aAET,MAAM61B,IAAK,QAAE,iBAAiB,IAAM,KAAM,OC3/BnBb,ED2/BsBnd,GAAEx1B,OC1/BpC,SAAU2U,EAAOgpB,GACpB,IAAI,MAAEwS,EAAK,IAAEyC,EAAG,KAAEtpC,GAASqL,EAAMyuB,UACjC,GAAK95B,GAAQA,EAAKmqC,SAAYtD,EAAM1rB,MAAQ,IAAM0rB,EAAMuD,WAAWd,GAC/D,OAAO,EACX,IAAIe,EAAcxD,EAAM7mC,MAAM,GAC9B,GAAIqqC,EAAY3zC,MAAQ2yC,EACpB,OAAO,EACX,GAAiC,GAA7BxC,EAAMvkB,OAAOtwB,QAAQ8Q,MAAa+jC,EAAM7mC,MAAM,GAAGykC,YAAcoC,EAAMjE,YAAY,GAAI,CAIrF,GAAmB,GAAfiE,EAAM1rB,OAAc0rB,EAAM7mC,MAAM,GAAGtJ,MAAQ2yC,GAC3CxC,EAAMzmC,OAAO,IAAMymC,EAAM7mC,MAAM,GAAGykC,WAAa,EAC/C,OAAO,EACX,GAAIpQ,EAAU,CACV,IAAIpK,EAAO,WACPqgB,EAAczD,EAAMzmC,OAAO,GAAK,EAAIymC,EAAMzmC,OAAO,GAAK,EAAI,EAG9D,IAAK,IAAI8d,EAAI2oB,EAAM1rB,MAAQmvB,EAAapsB,GAAK2oB,EAAM1rB,MAAQ,EAAG+C,IAC1D+L,EAAO,UAAc4c,EAAM7mC,KAAKke,GAAGnpB,KAAKk1B,IAC5C,IAAIsgB,EAAa1D,EAAMjE,YAAY,GAAKiE,EAAM7mC,MAAM,GAAGykC,WAAa,EAC9DoC,EAAMjE,YAAY,GAAKiE,EAAM7mC,MAAM,GAAGykC,WAAa,EAAI,EAE7Dxa,EAAOA,EAAKoO,OAAO,UAAcgR,EAASlb,kBAC1C,IAAI7tB,EAAQumC,EAAMtlC,OAAOslC,EAAM1rB,OAASmvB,EAAc,IAClDnQ,EAAK9uB,EAAM8uB,GAAGnjC,QAAQsJ,EAAOumC,EAAM94B,OAAOw8B,GAAa,IAAI,KAAMtgB,EAAM,EAAIqgB,EAAa,IACxFE,GAAO,EACXrQ,EAAG7b,IAAIwnB,aAAaxlC,EAAO65B,EAAG7b,IAAItsB,QAAQ8Q,MAAM,CAAC9C,EAAMmY,KACnD,GAAIqyB,GAAO,EACP,OAAO,EACPxqC,EAAKyqC,aAAoC,GAArBzqC,EAAKhO,QAAQ8Q,OACjC0nC,EAAMryB,EAAM,EAAC,IAEjBqyB,GAAO,GACPrQ,EAAG2D,aAAa,UAAe3D,EAAG7b,IAAI1hB,QAAQ4tC,KAClDnW,EAAS8F,EAAG8D,iBAChB,CACA,OAAO,CACX,CACA,IAAIyM,EAAWpB,EAAInxB,KAAO0uB,EAAMpmC,MAAQ4pC,EAAYM,eAAe,GAAGC,YAAc,KAChFzQ,EAAK9uB,EAAM8uB,GAAGrF,OAAO+R,EAAM1uB,IAAKmxB,EAAInxB,KACpC0yB,EAAQH,EAAW,CAAC,KAAM,CAAEh0C,KAAMg0C,SAAc/3C,EACpD,SAAK,QAASwnC,EAAG7b,IAAKuoB,EAAM1uB,IAAK,EAAG0yB,KAEhCxW,GACAA,EAAS8F,EAAG7V,MAAMuiB,EAAM1uB,IAAK,EAAG0yB,GAAO5M,mBACpC,EACX,EAjDJ,IAAuBoL,CD2/B+B,IACtD5c,EAAEyd,GAAI,CACJ9Y,YAAa,gCACb/c,MAAO,aAET,MAAMy2B,IAAK,QAAE,iBAAkB,CAC7BC,aAAc,CACZtL,UAAW,QACXH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKs2C,GAAGn2C,IAAI,GAG/Bi3C,aAAc,CACZvL,UAAW,CAAC,MAAO,SACnBH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAKy8B,GAAGt8B,IAAI,GAG/Bk3C,aAAc,CACZxL,UAAW,CAAC,YAAa,SACzBH,QAAU5S,IACR,MAAMrwB,EAAIqwB,EAAEryB,IAAI,MAChB,MAAO,IAAMgC,EAAEzI,KAAK41C,GAAGz1C,IAAI,KAIjC04B,EAAEqe,GAAGvwC,IAAK,CACR62B,YAAa,sBACb/c,MAAO,aAEToY,EAAEqe,GAAGrL,UAAW,CACdrO,YAAa,mBACb/c,MAAO,aAET,MAAMme,IAAK,QAAG,QAAQ,KAAM,CAC1Bne,MAAO,SACP0Z,cAAe,CACbnQ,MAAO,EAAGlnB,KAAMg2B,KAAc,SAANA,EACxBsB,OAAQ,CAACtB,EAAGrwB,KACVqwB,EAAE0Y,QAAQ/oC,EAAE5H,MAAM,GAGtB6wB,WAAY,CACV1H,MAAQ8O,GAAsB,SAAhBA,EAAEh2B,KAAKpC,KACrB05B,OAAQ,CAACtB,EAAGrwB,KACVqwB,EAAEmb,QAAQ,YAAQ,EAAQxrC,EAAEgN,KAAK,OAIvCojB,EAAE+F,GAAI,CACJpB,YAAa,mBACb/c,MAAO,SAET,MAAMud,IAAK,QAAE,QACbnF,EAAEmF,GAAI,CACJR,YAAa,aACb/c,MAAO,SAET,MAAMoe,IAAK,QAAE,QAAS/F,IAAM,CAC1B0b,MAAM,EACN/zB,MAAO,SACP4zB,QAAQ,EACR5a,MAAO,CACL54B,MAAO,CACLgxC,QAAS,KAGbZ,MAAQxoC,IACN,MAAM6xB,EAAIznB,SAASyM,cAAc,QAAS4Q,EAAI,IACzC4I,EAAEryB,IAAIu3B,GAAG79B,IAAT24B,CAAcrwB,GACjB,aAAcA,EAAEgxB,MAAM54B,MACtB,YAAa,QAEf,OAAOy5B,EAAE3a,YAAclX,EAAEgxB,MAAM54B,MAAO,CAAC,OAAQqvB,EAAGznB,EAAEgxB,MAAM54B,MAAM,EAElE88B,SAAU,CAAC,CACTqT,IAAK,yBACLzC,SAAW9lC,IAAM,CACf5H,MAAO4H,EAAEurC,QAAQnzC,OAAS,OAG9Bs5B,cAAe,CACbnQ,MAAO,EAAGlnB,KAAM2F,KAAQ0D,QAAc,SAAN1D,GAChC2xB,OAAQ,CAAC3xB,EAAG6xB,EAAGpK,KACbznB,EAAEwrC,QAAQ/jB,EAAG,CAAErvB,MAAOy5B,EAAEz5B,OAAQ,GAGpC6wB,WAAY,CACV1H,MAAQvhB,GAAsB,SAAhBA,EAAE3F,KAAKpC,KACrB05B,OAAQ,CAAC3xB,EAAG6xB,KACV7xB,EAAEwrC,QAAQ,YAAQ,EAAQ3Z,EAAEb,MAAM54B,MAAM,OAI9Cg4B,EAAEgG,GAAGzyB,KAAM,CACToxB,YAAa,mBACb/c,MAAO,SAEToY,EAAEgG,GAAGl4B,IAAK,CACR62B,YAAa,sBACb/c,MAAO,SAET,MAAM62B,GAAK,CACTvW,EACAR,EACA1F,EACArB,EACAmZ,EACAna,EACAoF,GACAzN,GACA0M,GACAtE,GACAoI,GACA3oB,GACAypB,GACAZ,GACAvB,GACA3D,GACAmB,GACA9D,GACAmc,GACA5Z,GACAmC,GACApF,GACAyF,EACA1B,EACA4C,EACA9D,EACAiD,EACAlD,EACAgE,EACAn5B,EACAi4B,GACAa,GACAD,IACAjE,OAAQ4c,GAAK,CACbra,GACAqB,GACA8W,GACA/b,GACAoF,GACAoU,GACAnY,OAAQ6c,GAAK,CACbrY,EACAvC,GACAtB,EACA8D,GACAZ,GACAqW,GACAI,GACAnV,GACAO,GACAiV,GACA9Y,GACAC,GACA6Z,GACAV,GACA3X,EACAyC,EACApC,EACA0T,EACAC,GACCwF,GAAK,CACN1a,GACAC,GACA+X,GACA3B,GACA8D,GACApW,GACAzB,GACAkT,EACArU,EACAG,EACAU,GACApE,OAAQvB,GAAI,uEAAoIse,GAAM5e,IACtJ,IAAIrwB,EAAIqwB,EAAGwB,EAAI7xB,EAAEuhB,MAAMoP,IACvB,KAAOkB,GAAKA,EAAEyY,QAAU,CACtB,MAAQ4E,KAAMznB,GAAMoK,EAAEyY,OACtBtqC,EAAIA,EAAErF,QAAQg2B,GAAGlJ,GAAIoK,EAAI7xB,EAAEuhB,MAAMoP,GACnC,CACA,OAAO3wB,CAAC,EACPmvC,GAAK,CAAC9e,EAAGrwB,EAAG6xB,KACb,MAAMpK,EAAI4I,EAAEpI,MAAM,IAAKkI,EAAI1I,EAAEznB,GAC7B,OAAOynB,EAAEznB,IAAMynB,EAAEoK,KAAOpK,EAAEznB,GAAKynB,EAAEoK,GAAIpK,EAAEoK,GAAK1B,GAAI1I,EAAE1xB,KAAK,IAAIR,UAAU,EAiBpE65C,GAAK,CACNC,kBAAmB,CACjBC,KAAM,IACNC,YAAa,IACbt4B,KAAM,KAERu4B,YAAa,CAAC,uBACdC,eAAgB,EAAGC,SAAUrf,EAAGsf,SAAU3vC,KAAQqwB,EAAEuf,eAAiB5vC,GAAKqwB,EAAEh2B,OAAS2F,EAAE3F,OAASg2B,EAAE+T,GAAGpkC,GACrG6vC,gBAAiB,CAACxf,EAAGrwB,KACnB,MAAM6xB,EAAI,CAAC,IAAK,KAChB,IAAIpK,EAAIznB,EAAEylB,QAAQ4K,GAClB,KAAOwB,EAAEtnB,SAASvK,EAAEynB,EAAI,IAAM,KAAOoK,EAAEtnB,SAASvK,EAAEynB,EAAI,IAAM,KAC1DznB,EAAImvC,GAAGnvC,EAAGynB,EAAGA,EAAI,GAAIA,GAAQ,EAC/B,OAAOznB,CAAC,GAET4yB,IAAI,QAAEwc,GAAI,oBACbhf,EAAEwC,GAAG,CACHmC,YAAa,wBACb/c,MAAO,UAET,MAqBG8lB,GAAMzN,GAAMA,EAAEpI,MAAM,QAEpB,IAAM,GAAuE6nB,GAAK,CAACzf,EAAGrwB,KACvF,IACE,MAAM6xB,EAVF,EAACxB,EAAGrwB,KACV,MAAQwvC,YAAa3d,GAAMxB,EAAEryB,IAAI40B,GAAEl7B,KAAM+vB,EAAI,GAC7C,OAAOznB,EAAEiiB,IAAI8tB,aAAa5f,IACxB,GAAI0B,EAAEtnB,SAAS4lB,EAAE91B,KAAKpC,OAAS45B,EAAEtnB,SAAS4lB,EAAE91B,MAC1C,OAAOotB,EAAE9wB,KAAKw5B,IAAI,CAAE,IACpB1I,CAAC,EAKOuoB,CAAG3f,EAAGrwB,GAAIynB,EAzBb,CAAC4I,GAAMA,EAAEoN,UAAU+M,MAAM7mC,OAyBRssC,CAAGjwC,GAAImwB,EAzBc,EAACE,EAAGrwB,EAAG6xB,EAAGpK,IAC/C4I,EAAEryB,IAAI,KACTmyB,CADkBnwB,EAAEqxB,OAAO6e,YAAY1/B,YAAO,EAAQ,CAACqhB,KAAMpK,KAwB/B0oB,CAAG9f,EAAGrwB,EAAGynB,EAAGoK,IAAKL,EAAGx7B,GAtBnD,EAACq6B,EAAGrwB,KACV,MAAM6xB,EAAIxB,EAAEryB,IAAI40B,GAAEl7B,KAAM+vB,EAAIoK,EAAEwd,kBAAkBC,MAAOnf,EAAI,MAAOqB,GAAKxxB,EAAEioB,MAAM,QAG/E,IAAIhoB,GAAI,QA3CF,CAACowB,GAAOrwB,GAAMA,EAAErF,QAVmE,CAAC01B,GAAM,IAAIrM,OAAO,kBAAkBqM,YAAa,KAU5G+f,CAAG/f,GAAI,IA2C1BggB,CAAG5oB,IADPgJ,GAAMoB,EAAEge,gBAAgBpoB,EAAGgJ,IACbwe,GAAb,CAAiB9e,GACzB,MAAMtO,EA5CyC,CAACwO,GAAOrwB,IACvD,MAAM6xB,EAAI7xB,EAAEylB,QAAQ4K,EAAEif,MAAO7nB,EAAIznB,EAAEwoB,OAAOqJ,EAAI,GAAI1B,EAAInwB,EAAEwoB,OAAOqJ,EAAI,GAAIL,EAAI,UAC3E,OAAOrB,EAAI1I,GAAK+J,EAAE32B,KAAK4sB,IAAM+J,EAAE32B,KAAKs1B,GAAKE,EAAEkf,YAAclf,EAAEpZ,KAAOoZ,EAAEkf,WAAW,EA0CrEe,CAAGze,EAAEwd,kBAALiB,CAAwBrwC,GAClC,OAAOA,EAAIA,EAAEtF,QAAQ8sB,EAAG5F,GAAI5hB,EAAI,CAACA,KAAMuxB,GAAGz7B,KAAK,QAE7C,CAACkK,EAAG4hB,EAAE,EAcsD0uB,CAAGlgB,EAAGF,GAAImD,EAblE,EAACjD,EAAGrwB,KACV,MAAMynB,EAAI4I,EAAEryB,IAAI,KAANqyB,CAAUrwB,GACpB,OAAOynB,EAAIA,EAAEgkB,WAAa,IAAI,EAW8C+E,CAAGngB,EAAGmB,GAChF,OAAQ8B,GAAK7L,EAAEptB,OAASi5B,EAAEj5B,MAHZ,CAACg2B,GAAuB,IAAjBA,EAAE+X,YAA6C,SAAzB/X,EAAE/H,MAAM,GAAGjuB,KAAKpC,KAGzBw4C,CAAGnd,GAAK,MAAQA,EAAEtC,MAAQ,IAAKvJ,EAAEuJ,OAASsC,EAAEyc,aAAa9vC,IACzF,IAAImzB,EACJ,MAAM3C,EAAIxwB,EAAEmxB,MAAMG,MAAMwB,GAAsB,SAAhBA,EAAE14B,KAAKpC,OACrCw4B,IAAsB,OAAf2C,EAAInzB,EAAE+M,WAAgB,EAASomB,EAAE7oB,SAASvU,KAAOy6B,EAAEO,MAAMtF,KAAKnhB,SAASvU,KAAOy6B,EAAEO,MAAMtF,KAAO+E,EAAEO,MAAMtF,KAAK/wB,QAAQ3E,EAAG,IAAI,IAC9H,CACFgX,KAAM8wB,GAAGtM,GACTke,SAAUjoB,EACVkoB,SAAUrc,EACVod,YAAa16C,GAEjB,CAAE,MACA,OAAO,IACT,GASC26C,IAAK,SAAGtgB,IACT,IAAIrwB,EAAI,KACR,MAAM6xB,EAAI,IAAI,KAAE,wBAChB,OAAO,IAAI,KAAE,CACXn6B,IAAKm6B,EACL7iB,MAAO,CACLxQ,KAAM,IAAM,KACZxC,MAAO,CAACyrB,EAAG0I,EAAGqB,EAAGx7B,KACf,IAAIQ,EACJ,MAAM88B,EAAIjD,EAAEryB,IAAI,MAChB,GAA0B,OAAnBxH,EAAI88B,EAAEsd,YAAqBp6C,EAAEe,KAAK+7B,KAAQA,EAAEud,WAAappB,EAAEib,YAAcjb,EAAE6a,QAAQzQ,GACxF,OAAO,KACT,MAAMhQ,EAAIiuB,GAAGzf,EAAGr6B,GAChB,IAAK6rB,EACH,OAAO,KACT7hB,IAAM8wC,qBAAqB9wC,GAAIA,EAAI,MACnC,MAAQ0vC,SAAUjf,EAAGkf,SAAUvc,EAAGpmB,KAAM+lB,GAAMlR,GAAK4tB,eAAgBxd,GAAM5B,EAAEryB,IAAI40B,GAAEl7B,KACjF,OAAOu6B,EAAE,CAAEyd,SAAUjf,EAAGkf,SAAUvc,EAAGl1B,IAAKmyB,EAAGyN,GAAIrW,EAAGza,KAAM+lB,MAAS/yB,EAAI+wC,uBAAsB,KAC3F/wC,EAAI,KACJ,MAAQg4B,SAAUlE,EAAG9kB,MAAOgiC,GAAO3gB,EAAEryB,IAAI,MA3B3C,EAACqyB,EAAGrwB,EAAG6xB,EAAGpK,EAAG0I,KACnB,MAAQkf,kBAAmB7d,GAAMnB,EAAEryB,IAAI40B,GAAEl7B,KAAM1B,EAAIw7B,EAAE8d,KACrD,IAAIhc,EAAIzB,EAAEiM,GAAG4D,QAAQ1hC,GAAG,GAAI0lC,WAAW1vC,EAAG67B,EAAE4L,UAAUl5B,MACtD,MAAMtE,EAAI4xB,EAAE71B,MAAMs3B,GAAIzR,EAAIiuB,GAAGzf,EAAGpwB,GAChC,IAAK4hB,EACH,OACF,MAAQ2oB,MAAO/Z,GAAMxwB,EAAEw9B,UAAWrK,EAAI3C,EAAEvrB,SAAU6tB,EAAItC,EAAE/e,QAASugB,EA9E3D,EAAC5B,EAAGrwB,EAAG6xB,KACb,IAAIpK,EAAIznB,EAAGmwB,GAAI,EACf,OAAOE,EAAE0f,aAAave,IACpB,IAAIx7B,EACJ,GAAIm6B,EACF,OAAO,EACT,GAAIqB,EAAEL,OAAQ,CACZ,MAAMmC,EAAoB,OAAft9B,EAAIw7B,EAAExkB,WAAgB,EAAShX,EAAEyvB,QAAQoM,GACpD,GAAS,MAALyB,GAAaA,GAAK,EACpB,OAAOnD,GAAI,EAAI1I,GAAK6L,GAAG,CAC3B,CACA7L,GAAK+J,EAAEkY,QAAQ,IACbjiB,CAAC,EAkEgEwpB,CAAGpvB,EAAE8tB,SAAUvc,EAAGvR,EAAE6uB,aACzFpd,EAAIA,EAAEwR,YAAY1R,EAAGL,EAAGlR,EAAE8tB,UAAUjF,cAActX,OAAG,EAAQjD,GAAGsI,OAAOxG,EAAI,EAAGA,EAAI,GAAIqB,EAAIA,EAAEmO,aAAa,UAAQnO,EAAErR,IAAI1hB,QAAQ0xB,EAAI,KAAMxK,EAAE6L,EAAE,EAqBrI4d,CAAG7gB,EAAGwB,EAAGmf,EAAIld,EAAGrD,EAAEO,MAAM,IACtBvJ,EAAEia,QAAQ,gBAAgB,IAAM,IAAI,IAG5C,IAEJtR,EAAEugB,GAAI,CACJ5b,YAAa,0BACb/c,MAAO,UAET,MAAMm5B,IAAK,SAAE,IAAM,IAAO9gB,KACxB,QAAGA,EAAG,QAASrwB,IACb,GAAIA,EAAEghB,QAAS,CACb,MAAM6Q,EAAI7xB,EAAEiE,OAAS,EACrBjE,EAAE6D,SAASb,SAAQ,CAACykB,EAAG0I,KACrB1I,EAAEjV,MAAQ2d,EAAI0B,CAAC,GAEnB,IACA,IAEJzB,EAAE+gB,GAAI,CACJpc,YAAa,qCACb/c,MAAO,WAET,MAAMo5B,IAAK,SAAE,IAAM,IAAO/gB,IACxB,MAAMrwB,EAAI,uBACV,QAAGqwB,EAAG,QAAQ,CAACwB,EAAGpK,EAAG0I,KACnB,IAAK0B,EAAEz5B,OAA2B,iBAAXy5B,EAAEz5B,MACvB,OACF,MAAMo5B,EAAI,GACV,IAAIx7B,EAAI,EACRgK,EAAEyhB,UAAY,EACd,IAAI6R,EAAItzB,EAAE0hB,KAAKmQ,EAAEz5B,OACjB,KAAOk7B,GAAK,CACV,MAAMzR,EAAIyR,EAAEvvB,MACZ/N,IAAM6rB,GAAK2P,EAAE76B,KAAK,CAAE0D,KAAM,OAAQjC,MAAOy5B,EAAEz5B,MAAM0C,MAAM9E,EAAG6rB,KAAO2P,EAAE76B,KAAK,CAAE0D,KAAM,QAASmN,KAAM,CAAE0kC,UAAU,KAASl2C,EAAI6rB,EAAIyR,EAAE,GAAGx9B,OAAQw9B,EAAItzB,EAAE0hB,KAAKmQ,EAAEz5B,MACxJ,CACA,OAAOo5B,EAAE17B,OAAS,GAAKq6B,GAAiB,iBAAL1I,GAC1BzxB,EAAI67B,EAAEz5B,MAAMtC,QAAU07B,EAAE76B,KAAK,CAAE0D,KAAM,OAAQjC,MAAOy5B,EAAEz5B,MAAM0C,MAAM9E,KAAOm6B,EAAEtsB,SAASG,OAAOyjB,EAAG,KAAM+J,GAAI/J,EAAI+J,EAAE17B,aADvH,CAC6H,GAC7H,IAEJs6B,EAAEghB,GAAI,CACJrc,YAAa,0BACb/c,MAAO,WAET,MAAMq5B,IAAK,SAAE,IAAM,IACnBjhB,EAAEihB,GAAI,CACJtc,YAAa,iCACb/c,MAAO,WAwBT,MAAMs5B,IAAK,SAAE,IAAM,IAAOjhB,KArB1B,SAAYA,EAAGrwB,IAEb,SAAS6xB,EAAEpK,EAAG0I,EAAGqB,GACf,GAJO,CAACnB,KAAQA,EAAExsB,SAId0tC,CAAG9pB,GAAI,CACT,MAAMzxB,EAAI,GACV,IAAK,IAAIs9B,EAAI,EAAGrzB,EAAIwnB,EAAE5jB,SAAS/N,OAAQw9B,EAAIrzB,EAAGqzB,IAAK,CACjD,MAAMzR,EAAI4F,EAAE5jB,SAASyvB,GACrB,GAAIzR,EAAG,CACL,MAAM4O,EAAIoB,EAAEhQ,EAAGyR,EAAG7L,GAClB,GAAIgJ,EACF,IAAK,IAAI2C,EAAI,EAAGL,EAAItC,EAAE36B,OAAQs9B,EAAIL,EAAGK,IAAK,CACxC,MAAMnB,EAAIxB,EAAE2C,GACZnB,GAAKj8B,EAAEW,KAAKs7B,EACd,CACJ,CACF,CACAxK,EAAE5jB,SAAW7N,CACf,CACA,MAII,EAACgK,EAAG6xB,EAAGpK,IAvBsB,CAAC4I,GAAiB,SAAXA,EAAEh2B,KAuBzBm3C,CAAGxxC,IAAwC,UAA5B,MAALynB,OAAY,EAASA,EAAEptB,QAAqB2F,EAAE6D,SAAW,CAAC,IAAK7D,WAAaA,EAAE5H,MAAO4H,EAAE3F,KAAO,aAAc,CAAC2F,IAAM,CAACA,GAJxIA,CAAEynB,EAAG0I,EAAGqB,EACjB,EAlBOK,CAAExB,EAAG,EAAG,MAAM,EAmBvB,CAEEohB,CAAGphB,EAAiJ,IAEtJD,EAAEkhB,GAAI,CACJvc,YAAa,gCACb/c,MAAO,WAET,MAAM05B,IAAK,SAAE,KACX,IAAIrhB,GAAI,EACR,MAAMrwB,EAAI,IAAI,KAAE,gCAAiC6xB,EAAI,IAAI,KAAE,CACzDn6B,IAAKsI,EACLgP,MAAO,CACLxQ,KAAI,KACK,EAETxC,MAAMyrB,GACJ,IAAKA,EAAEgW,UAAUlB,MACf,OAAO,EACT,MAAMpM,EAAI1I,EAAEgW,UAAU+M,MAAOhZ,EAAIrB,EAAEgW,WAAYnwC,EAAIm6B,EAAEod,UACrD,UAAU/b,GAAKx7B,GAAKw7B,EAAE0a,WAAa1a,EAAEL,QAAUn7B,EAAEk2C,WAAal2C,EAAEm7B,OAClE,GAEFqB,MAAO,CACLsQ,gBAAiB,CACf6O,eAAgB,CAAClqB,EAAG0I,MAAME,IAAKA,GAAI,EAAI0gB,uBAAsB,KAC3D,GAAIlf,EAAEsQ,SAAS1a,EAAEzY,OAAQ,CACvB,MAAMhZ,EAAIyxB,EAAEzY,MAAMyuB,UAAUl5B,KAC5B4rB,EAAE+S,iBAAkBzb,EAAEuQ,SAASvQ,EAAEzY,MAAM8uB,GAAG4H,WAAWvV,EAAE3oB,MAAQ,GAAIxR,GACrE,MACE,GACJ47C,iBAAmBnqB,IAAOoK,EAAEsQ,SAAS1a,EAAEzY,SAAWqhB,GAAI,IAAK,GAC3D0S,YAAa,CAACtb,EAAG0I,KACf,GAAI0B,EAAEsQ,SAAS1a,EAAEzY,QAAUmhB,aAAa0hB,YAAc1hB,EAAE3oB,OAAS6oB,EAAG,CAClE,MAAMr6B,EAAIyxB,EAAEzY,MAAMyuB,UAAUl5B,KAC5B,OAAO4rB,EAAE+S,iBAAkBzb,EAAEuQ,SAASvQ,EAAEzY,MAAM8uB,GAAG4H,WAAWvV,EAAE3oB,MAAQ,GAAIxR,KAAK,CACjF,CACA,OAAO,CAAE,GAGbgvC,YAAYvd,GACV,GAAIoK,EAAEsQ,SAAS1a,GAAI,CACjB,MAAMzxB,EAAIyxB,EAAEgW,UAAU+M,MAAM1uB,IAAKwX,EAAIlpB,SAASyM,cAAc,QAAS5W,EAAI,WAAUjK,EAAGs9B,EAAG,CACvFwe,MAAO,IACLjwB,EAAIzX,SAASyM,cAAc,QAAS4Z,EAAI,WAAUz6B,EAAG6rB,GACzD,OAAOxlB,YAAW,KAChBi3B,EAAEye,gBAAkB,OAAQlwB,EAAEkwB,gBAAkB,MAAM,IACpD,YAAUtqB,EAAExF,IAAK,CAAChiB,EAAGwwB,GAC3B,CACA,OAAO,UACT,KAGJ,OAAOoB,CAAC,IAEVzB,EAAEshB,GAAI,CACJ3c,YAAa,iCACb/c,MAAO,UAET,MAAMg6B,IAAK,SAAE,IAAM,IAAI,KAAE,CACvBt6C,IAAK,IAAI,KAAE,4BACXu6C,kBAAmB,CAAC5hB,EAAGrwB,EAAG6xB,KACxB,IAAKxB,EAAEv6B,OACL,OACF,MAAO2xB,GAAK4I,EACZ,IAAK5I,EACH,OACF,MAAO0I,GAAK1I,EAAEmX,MACd,GAAInX,EAAE6a,QAAQ,aAAc,CAC1B,KAAMnS,aAAa,MACjB,OACF,MAAQ5rB,KAAM+uB,GAAMnD,EACpB,OAAO0B,EAAEiM,GAAG4M,cAAcpX,EAAG5L,GAAErtB,YAAQ,EAAQ,GACjD,CACA,GAAI81B,aAAa,KAAI,CACnB,IAAImD,EAAIzB,EAAEiM,GACV,MAAQv5B,KAAMtE,EAAGq8B,GAAIza,GAAMsO,EAC3B,OAAO0B,EAAE5P,IAAIwnB,aAAaxpC,EAAG4hB,GAAG,CAAC4O,EAAG2C,KAClC3C,EAAEp2B,OAASqtB,GAAErtB,SAAWi5B,EAAIA,EAAEoX,cAActX,EAAG1L,GAAErtB,YAAQ,EAAQ,IAAI,IACnEi5B,CACN,OAGJlD,EAAE4hB,GAAI,CACJjd,YAAa,kCACb/c,MAAO,UAET,MAAMk6B,IAAK,QAAE,CAAC,QAAS,cAAe,wBACtC9hB,EAAE8hB,GAAI,CACJnd,YAAa,4BACb/c,MAAO,UAET,MAAMm6B,IAAK,SAAG9hB,IACZ,MAAMrwB,EAAIqwB,EAAEryB,IAAIk0C,GAAGx6C,KACnB,OAAO,IAAI,KAAE,CACXA,IAAK,IAAI,KAAE,6BACX06C,kBAAmB,CAACvgB,EAAGpK,KACrB,MAAM0I,EAAI0B,EAAEyQ,QAAQ,cAAe9Q,GAAKK,EAAE+M,MAC1C,GAAIzO,GAAKqB,EAAG,CACV,MAAQjtB,KAAMvO,GAAMw7B,EAAG8B,EAAI7L,EAAExF,IAAI1hB,QAAQvK,GACzC,IAAIiK,EAAIqzB,EAAExU,MAAO+C,GAAI,EACrB,KAAO5hB,EAAI,GACTD,EAAEuK,SAAS+oB,EAAE3vB,KAAK1D,GAAG5F,KAAKpC,QAAU4pB,GAAI,GAAK5hB,IAC/C,OAAO4hB,CACT,CACA,OAAO,CAAE,GAEX,IAEJuO,EAAE+hB,GAAI,CACJpd,YAAa,+BACb/c,MAAO,UAET,MAAMq6B,IAAK,SAAGhiB,IACZ,MAAMrwB,EAAI,IAAI,KAAE,uBAAwB6xB,EAAKpK,IAC3C,GAAIA,EAAE6qB,YAAc7qB,EAAEopB,SACpB,OACF,MAAM1gB,EAAIE,EAAEryB,IAAI+yB,EAAEr5B,KAAM85B,EAAI/J,EAAEzY,MAAM8uB,GAAG4D,QAAQ,gBAAgB,GAC/D,IAAI1rC,GAAI,EACRyxB,EAAEzY,MAAMiT,IAAI8tB,aAAY,CAACzc,EAAGrzB,KAC1B,GAAIqzB,EAAEj5B,OAAS01B,EAAE11B,OAAQ,CACvB,GAAoC,IAAhCi5B,EAAEpc,YAAYq7B,OAAOz8C,OACvB,OACF,MAAM+rB,EAAIyR,EAAEtC,MAAOP,EAAIN,EAAEmD,GACzBzR,EAAEprB,KAAOg6B,IAAMz6B,GAAI,EAAIw7B,EAAEkQ,QAAQ1hC,GAAG,GAAI0qC,cAAczqC,OAAG,EAAQ,IAC5D4hB,EACHprB,GAAIg6B,IAER,KACEz6B,GAAKyxB,EAAEuQ,SAASxG,EAAE,EAExB,OAAO,IAAI,KAAE,CACX95B,IAAKsI,EACLqP,KAAOoY,IAAOoK,EAAEpK,GAAI,CAClBuP,OAAS7G,IACP0B,EAAE1B,EAAE,KAGR,IAEJC,EAAEiiB,GAAI,CACJtd,YAAa,6BACb/c,MAAO,UAET,MAAMw6B,IAAK,SAAE,KACX,MAAMniB,EAAKrwB,IACT,GAAIA,EAAEsyC,YAActyC,EAAE6wC,SACpB,OACF,MAAMhf,EAAIiB,GAAEz4B,OAAQotB,EAAI8I,GAAEl2B,OAAQ81B,EAAIN,GAAEx1B,OAAQm3B,EAAIxxB,EAAEgP,MAAOhZ,EAAI,CAAC6rB,EAAG4O,KACnE,IAAI2C,GAAI,EACR,MAAML,EAAI,GAAGtC,EAAI,KACjB,OAAO5O,EAAErP,QAAUugB,IAAMlR,EAAErP,MAAQugB,EAAGK,GAAI,GAAKA,CAAC,EAElD,IAAIE,EAAI9B,EAAEsM,GAAI79B,GAAI,EAClBuxB,EAAEvP,IAAI8tB,aAAY,CAACluB,EAAG4O,EAAG2C,EAAGL,KAC1B,GAAIlR,EAAExnB,OAASotB,EAAG,CAChB,MAAMwK,EAAIpQ,EAAE4wB,WAAW,IACjB,MAALxgB,OAAY,EAASA,EAAE53B,QAAU81B,GAA0B,YAArB8B,EAAEjB,MAAM+b,WAA2B9sC,GAAI,EAAIqzB,EAAEoX,cAAcja,EAAGoB,EAAG,CAAE/T,OAAQ,SAAW+D,EAAEkuB,aAAY,CAACv5C,EAAGs9B,EAAGkd,EAAI0B,KACpJ,GAAIl8C,EAAE6D,OAAS81B,EAAG,CAChB,MAAMwiB,EAAK,IAAKn8C,EAAEw6B,OAClBh7B,EAAE28C,EAAID,KAAQpf,EAAIA,EAAEoX,cAAc5W,OAAG,EAAQ6e,GAC/C,CACA,OAAO,CAAE,IAEb,MAAO,GAAI9wB,EAAExnB,OAAS81B,IAAW,MAALiD,OAAY,EAASA,EAAE/4B,QAAUw3B,EAAG,CAC9D,MAAMI,EAAI,IAAKpQ,EAAEmP,OACjB,IAAIx6B,GAAI,EACO,YAAfy7B,EAAE8a,WAA2B9a,EAAE8a,SAAW,UAAWv2C,GAAI,IAAW,MAAL48B,OAAY,EAASA,EAAEqf,WAAW,MAAQj8C,EAAIR,EAAEi8B,EAAGc,IAAKv8B,IAAM88B,EAAIA,EAAEoX,cAAcja,OAAG,EAAQwB,GAAIhyB,GAAI,EACtK,KACEA,GAAKD,EAAEg4B,SAAS1E,EAAEoO,QAAQ,gBAAgB,GAAI,EAEpD,OAAO,IAAI,KAAE,CACXhqC,IAAK,IAAI,KAAE,4BACX2X,KAAOrP,IAAOqwB,EAAErwB,GAAI,CAClBg3B,OAASnF,IACPxB,EAAEwB,EAAE,KAGR,IAEJzB,EAAEoiB,GAAI,CACJzd,YAAa,6BACb/c,MAAO,UAET,MAaG46B,GAAK,CAAC/D,GAAIC,GAAIC,GAAIC,GAbV,CACTpc,GACA+d,GACAqB,GACAE,GACAC,GACAT,GACAP,GACAE,GACAD,GACAE,GACAe,GACAG,KAC2BtgB,6EE5pD7B,MAAM2gB,EAA0B,oBAAbC,UAA2BA,UAAY,KACpD7wB,EAAyB,oBAAZ7X,SAA0BA,SAAW,KAClD2oC,EAAQF,GAAOA,EAAIG,WAAa,GAChCC,EAAU,cAAcvxB,KAAKqxB,GAC7BG,EAAY,UAAUxxB,KAAKqxB,GAC3BI,EAAU,wCAAwCzxB,KAAKqxB,GACvDnd,KAAQsd,GAAaC,GAAWF,GAIhCG,IAHaF,EAAY9oC,SAASipC,aAAeF,EAAWA,EAAQ,GAAKF,GAAWA,EAAQ,IACnFrd,GAAM,gBAAgB/6B,KAAKk4C,MACT,iBAAiBrxB,KAAKqxB,IAAU,CAAC,EAAG,IAAI,IACxDnd,GAAM,gBAAgBlU,KAAKqxB,IA0B5C,SAASzlB,EAAIje,EAAM9K,EAAM+3B,EAAItvB,EAAMqpB,EAAO1H,GACxC,GAAItf,EAAKijC,UACP,OAAO,EACT,MAAMtjC,EAAQK,EAAKL,MACbw7B,EAAQx7B,EAAMiT,IAAI1hB,QAAQgE,GAChC,GAAIimC,EAAMvkB,OAAO5rB,KAAKo3B,KAAK1sB,KACzB,OAAO,EACT,MAAMuuC,EAAa9I,EAAMvkB,OAAOstB,YAAYz5C,KAAKC,IAAI,EAAGywC,EAAMC,aAAe,KAAMD,EAAMC,kBAAc,EAAQ,KAAYz9B,EAC3H,IAAK,IAAIhX,EAAI,EAAGA,EAAIqgC,EAAMvgC,OAAQE,IAAK,CACrC,MAAMurB,EAAQ8U,EAAMrgC,GAAGurB,MAAMG,KAAK4xB,GAC5BxV,EAAKvc,GAASA,EAAM,IAAM8U,EAAMrgC,GAAGsqB,QAAQtR,EAAOuS,EAAOhd,GAAQgd,EAAM,GAAGzrB,OAASkX,EAAKlX,QAASwmC,GACvG,GAAKwB,EAGL,OADAzuB,EAAK2oB,SAAS8F,EAAG4D,QAAQ/S,EAAQ,CAAEkP,UAAWC,EAAIv5B,OAAM+3B,KAAItvB,WACrD,CACT,CACA,OAAO,CACT,GAzCuBomC,GAAWA,EAAQ,IAC1Bxd,KAAQid,GAAO,iBAAiBh4C,KAAKg4C,EAAIW,WAClC,cAAc34C,KAAKk4C,MAAYF,GAAOA,EAAIY,eAAiB,MAC9DZ,GAAM,MAAMh4C,KAAKg4C,EAAIa,UACzB,aAAa74C,KAAKk4C,KACjB9wB,GAAO,wBAAyBA,EAAI0xB,gBAAgB/sB,SACnC,uBAAuBlF,KAAKoxB,UAAUE,YAAc,CAAC,EAAG,IAAI,GAoC9F,MAAMY,EAAsB,IAAI,KAAU,8BACpCC,EAAmB,EAAGxd,YAC1B,MAAM1H,EAAS,IAAI,KAAO,CACxBj3B,IAAKk8C,EACLE,cAAc,EACd9kC,MAAO,CACLxQ,KAAI,IACK,KAETxC,MAAM8hC,EAAIiW,GAER,OADejW,EAAGwE,QAAQ9sC,QAGnBsoC,EAAGkW,cAAgBlW,EAAG4E,WAAa,KAAOqR,EACnD,GAEFvhB,MAAO,CACLyhB,gBAAe,CAAC5kC,EAAM9K,EAAM+3B,EAAItvB,IACvBsgB,EAAIje,EAAM9K,EAAM+3B,EAAItvB,EAAMqpB,EAAO1H,GAE1CmU,gBAAiB,CACf6O,eAAiBtiC,IACfhT,YAAW,KACT,MAAM,QAAE63C,GAAY7kC,EAAKL,MAAMyuB,UAC3ByW,GACF5mB,EAAIje,EAAM6kC,EAAQp4B,IAAKo4B,EAAQp4B,IAAK,GAAIua,EAAO1H,EAAO,KAEnD,IAGXwlB,cAAc9kC,EAAMzE,GAClB,GAAkB,UAAdA,EAAMlT,IACR,OAAO,EACT,MAAM,QAAEw8C,GAAY7kC,EAAKL,MAAMyuB,UAC/B,QAAIyW,GACK5mB,EAAIje,EAAM6kC,EAAQp4B,IAAKo4B,EAAQp4B,IAAK,KAAMua,EAAO1H,EAE5D,KAGJ,OAAOA,CAAM,EA+CC93B,OAAOI,eACNJ,OAAOqM,iBACArM,OAAOoM,0BACLpM,OAAO6L,sBACd7L,OAAOC,UAAUC,eACjBF,OAAOC,UAAUs9C,qBA8EpC,MAkDMC,EAAyB,CAAC5W,EAAWoI,KACzC,KAAMpI,aAAqB,MACzB,OACF,MAAM,KAAE95B,EAAI,MAAE6mC,GAAU/M,EACxB,MAnDoB,EAACoI,EAAUliC,IACxBrM,MAAMF,QAAQyuC,IAAaA,EAASt7B,SAAS5G,EAAKtJ,OAASsJ,EAAKtJ,OAASwrC,EAkD5EyO,CAAczO,EAAUliC,GACnB,CAAEA,OAAMmY,IAAK0uB,EAAM1uB,IAAK7X,MAAOumC,EAAMvmC,MAAMumC,EAAM1rB,OAAQA,MAAO0rB,EAAM1rB,YAD/E,CAEa,iFC3Rf,MAAM9oB,GAAI,mBAAE,CAAC,GAkBV68B,EAAI,KACL,MAAMxC,EAnBa,MACnB,MAAQ2F,IAAK3F,EAAGkkB,OAAQpkB,EAAGqkB,WAAYx0C,EAAGy0C,cAAe5iB,IAAM,gBAAE77B,GAAI6rB,GAAI,YAAE,MAC3E,OAAO,gBAAE,KACP,MAAMuO,EAAIvO,EAAEjW,QACZ,IAAKimB,IAAMzB,EACT,OACFC,EAAEzkB,QAAUwkB,EACZ,MAAMoB,EAAIK,EAAEzB,GACZ,OAAMoB,GACGxxB,GAAE,GAAKwxB,EAAEhhB,SAASxP,MAAMf,IAC7BkwB,EAAEvkB,QAAU3L,CAAC,IACZ45B,SAAQ,KACT75B,GAAE,EAAG,IACJ+kC,MAAMpM,QAAQ93B,OAAQ,KACvB,IAAIZ,EACe,OAAlBA,EAAIkwB,EAAEvkB,UAAoB3L,EAAEs3B,SAAS,QAP1C,CAQG,GACF,CAAClH,EAAGF,EAAG0B,EAAG7xB,IAAK6hB,CAAC,EAETmR,GACV,OAAuB,gBAAgB,MAAO,CAAE,sBAAsB,EAAI0hB,IAAKrkB,GAAI,EAClFsC,EAAI,EAAG9uB,SAAUwsB,MAClB,MAAMF,GAAI,iBAAE,IAAUnwB,EAAG6xB,IAAK,mBAAE,GAAShQ,GAAI,eAAMuO,EAAGoB,IAAK,eAAE,GAAKvxB,GAAI,cAAE,KAAM,CAC5E00C,QAASvkB,EACT4F,IAAK7F,EACLokB,OAAQ1yB,EACR2yB,WAAYhjB,EACZijB,cAAez0C,EACf40C,iBAAkB/iB,KAChB,CAACzB,EAAGpwB,IACR,OAAuB,gBAAgBhK,EAAE6+C,SAAU,CAAEz8C,MAAO6H,GAAKowB,EAAE,EAClE75B,EAAI,CAAC65B,EAAGF,EAAI,MACb,MAAMnwB,GAAI,gBAAEhK,GAAI67B,GAAI,iBAAExB,EAAGF,GACzB,OAAO,sBAAE,KACPnwB,EAAE40C,kBAAiB,IAAM/iB,GAAE,GAC1B,CAAC7xB,EAAG6xB,IAAK,CACV8iB,QAAS30C,EAAE20C,QACX32C,IAAK,IAAMgC,EAAEu0C,OAAO3oC,QACrB,8DCvCH,SAASimB,EAAE7xB,GAAG,IAAIqwB,EAAEmD,EAAEpD,EAAE,GAAG,GAAG,iBAAiBpwB,GAAG,iBAAiBA,EAAEowB,GAAGpwB,OAAO,GAAG,iBAAiBA,EAAE,GAAG1I,MAAMF,QAAQ4I,GAAG,IAAIqwB,EAAE,EAAEA,EAAErwB,EAAElK,OAAOu6B,IAAIrwB,EAAEqwB,KAAKmD,EAAE3B,EAAE7xB,EAAEqwB,OAAOD,IAAIA,GAAG,KAAKA,GAAGoD,QAAQ,IAAInD,KAAKrwB,EAAEA,EAAEqwB,KAAKD,IAAIA,GAAG,KAAKA,GAAGC,GAAG,OAAOD,CAAC,CAA2H,QAAnH,WAAgB,IAAI,IAAIpwB,EAAEqwB,EAAEmD,EAAE,EAAEpD,EAAE,GAAGoD,EAAE36B,UAAU/C,SAASkK,EAAEnH,UAAU26B,QAAQnD,EAAEwB,EAAE7xB,MAAMowB,IAAIA,GAAG,KAAKA,GAAGC,GAAG,OAAOD,CAAC,ECE3VkD,EAAK9B,IACTA,EAAEwF,OAAO,MAAInF,IACX,MAAM1B,EAAI0B,EAAEijB,WACZ,MAAO,IACFjjB,EACHijB,WAAa90C,IACX,MAAMqwB,EAAgB,mBAALF,EAAkBA,EAAEnwB,GAAKmwB,EAC1C,MAAO,IACFE,EACH0kB,MAAO,EAAE,wCAA8C,MAAL1kB,OAAY,EAASA,EAAE0kB,QAAU,GAAI,uBACxF,EAEJ,GACD,+LCEwB,EAACC,EAAUvuC,EAAO,MAfpB,EAACuuC,EAAUC,EAAaC,KAC9Bp7C,KAAKq7C,IAAIH,EAASl/C,OAAS,GAAKgE,KAAKs7C,IACZJ,EAASl/C,MAWpD,EAGAu/C,CCXU,iBDWa5uC,EAClB,ECZG,CAAE,EAAkB,IAA9B,MAYGovB,EAAK,CAACxF,EAAGmB,KACV,MAAMpB,GAAI,QAAEC,GAAIwB,EAAK7xB,GAAM40B,UACzB/C,EAAEn6B,IAAM04B,QAASpwB,EAAEhF,KAAK,MACxB,MAAMysB,EAAI+J,EAAExxB,GACZ,OAAOA,EAAEhC,IAAI,MAAGwS,OAAO4f,EAAG3I,GAAIoK,EAAEvE,IAAO6C,GAAMnwB,EAAEhC,IAAI,MAAGzG,KAAK84B,EAAGF,GAAI,KAChEnwB,EAAEhC,IAAI,MAAGkG,OAAOksB,EAAE,CACnB,EAEH,OAAOyB,CAAC,EAcP2E,EAAMnG,IACP,MAAMmB,EAAKpB,GAAMwE,gBACTxE,EAAEp1B,KAAK,MACb,MAAM62B,EAAIxB,EAAED,GACZ,OAAOA,EAAE4G,OAAO,MAAIh3B,GAAM,IAAIA,EAAG6xB,KAAKL,EAAE8jB,UAAYzjB,EAAG,KACrDzB,EAAE4G,OAAO,MAAIh3B,GAAMA,EAAE4C,QAAQ6kB,GAAMA,IAAMoK,KAAG,CAC7C,EAEH,OAAOL,CAAC,EAqCPd,EAAI,CAACL,EAAGmB,KACT,IAAIpB,EACJ,MAAMyB,EAAK7xB,GAAM40B,UACf,MAAMnN,EAAI+J,EAAExxB,GACZ,GAAIA,EAAEg3B,OAAO,MAAI7G,GAAM,IAAIA,EAAEvtB,QAAQ5M,GAAMA,EAAE,KAAOq6B,IAAI,CAACA,EAAG5I,MAAMoK,EAAEp7B,GAAK45B,EAAGwB,EAAER,OAAS5J,QAASznB,EAAEhF,KAAK,MAAIo1B,EAAIpwB,EAAEhC,IAAI,MAAGszB,MAAMjB,IAAKD,EACjI,MAAM,QAAEC,GACV,MAAO,KACLrwB,EAAEg3B,OAAO,MAAI7G,GAAMA,EAAEvtB,QAAO,EAAE5M,KAAOA,IAAMq6B,KAAG,CAC/C,EAEH,OAAOwB,EAAEx3B,KAAO,IAAM+1B,EAAGyB,CAAC,EAgBzB4E,EAAMpG,IACP,IAAImB,EACJ,MAAMpB,EAAKyB,GAAM+C,gBAAmB/C,EAAE72B,KAAK,MAAIw2B,EAAInB,EAAEwB,GAAIA,EAAEmF,OAAO,MAAIh3B,GAAM,IAAIA,EAAGwxB,KAAK,KACtFK,EAAEmF,OAAO,MAAIh3B,GAAMA,EAAE4C,QAAQ6kB,GAAMA,IAAM+J,KAAG,GAE9C,OAAOpB,EAAEzB,OAAS,IAAM6C,EAAGpB,EAAE14B,IAAM,IAAM85B,EAAEC,KAAK/5B,IAAK04B,CAAC,EAWrDsG,EAAMrG,IACP,MAAMmB,EAAKpB,GAAMwE,gBACTxE,EAAEp1B,KAAK,MACb,MAAM62B,EAAIxB,EAAED,GACZ,OAAOA,EAAE4G,OAAO,MAAIh3B,GAAM,IAAIA,EAAG6xB,KAAKL,EAAE7C,OAASkD,EAAG,KAClDzB,EAAE4G,OAAO,MAAIh3B,GAAMA,EAAE4C,QAAQ6kB,GAAMA,IAAMoK,KAAG,CAC7C,EAEH,OAAOL,CAAC,EAiDPY,EAAI,CAAC/B,EAAGmB,KACT,MAAMpB,GAAI,QAAEC,EAAGmB,GAAIK,EAAK7xB,IAAOA,EAAE00B,OAAOtE,GAAI,IAAM,KAChDpwB,EAAEkE,OAAOksB,EAAE,GAEb,OAAOyB,EAAEn6B,IAAM04B,EAAGyB,CAAC,EAClBwC,EAAK,CAAChE,EAAGmB,KACV,MAAMpB,EAAIgC,EAAEZ,EAAGnB,GAAIwB,EAAInB,EAAEL,GAAI5I,GAAMA,EAAEzpB,IAAIoyB,EAAE14B,IAAR+vB,CAAaA,KAAKznB,EAAI,CAACowB,EAAGyB,GAC7D,OAAO7xB,EAAEvJ,GAAKo7B,EAAEp7B,GAAIuJ,EAAE2D,KAAOkuB,EAAG7xB,EAAE3F,KAAOw3B,EAAEx3B,KAAM2F,EAAEqxB,OAASQ,EAAER,OAAQrxB,EAAE9B,IAAMkyB,EAAGpwB,EAAEtI,IAAM04B,EAAE14B,IAAKsI,EAAEu1C,aAAgB9tB,GAAO0I,GAAM,KAC7H,MAAMn6B,EAAIm6B,EAAEnyB,IAAIoyB,EAAE14B,KAAM07B,EAAI3L,EAAEzxB,EAAFyxB,CAAK0I,GACjCA,EAAE6G,OAAO,MAAI/2B,GAAM,IAAIA,EAAE2C,QAAQif,GAAMA,EAAE,KAAOwO,IAAI,CAACA,EAAG+C,MAAMpzB,EAAEqxB,OAAS+B,CAAC,EACzEpzB,CAAC,EACH22B,EAAK,CAACtG,EAAGmB,KACV,MAAMpB,EAAIgC,EAAEZ,EAAGnB,GAAIwB,EAzId,EAACxB,EAAGmB,KACT,IAAIpB,EACJ,MAAMyB,EAAK7xB,GAAM40B,UACf,MAAMnN,EAAI+J,EAAExxB,GACZ,GAAIA,EAAEg3B,OAAO,MAAI7G,GAAM,IAAIA,EAAEvtB,QAAQ5M,GAAMA,EAAE,KAAOq6B,IAAI,CAACA,EAAG5I,MAAMoK,EAAEp7B,GAAK45B,EAAGwB,EAAER,OAAS5J,QAASznB,EAAEhF,KAAK,MAAIo1B,EAAIpwB,EAAEhC,IAAI,MAAGozB,MAAMf,IAAKD,EACjI,MAAM,QAAEC,GACV,MAAO,KACLrwB,EAAEg3B,OAAO,MAAI7G,GAAMA,EAAEvtB,QAAO,EAAE5M,KAAOA,IAAMq6B,KAAG,CAC/C,EAEH,OAAOwB,EAAEx3B,KAAO,IAAM+1B,EAAGyB,CAAC,EA+HHoB,CAAE5C,GAAI5I,GAAMA,EAAEzpB,IAAIoyB,EAAE14B,IAAR+vB,CAAaA,KAAKznB,EAAI,CAACowB,EAAGyB,GAC7D,OAAO7xB,EAAEvJ,GAAKo7B,EAAEp7B,GAAIuJ,EAAE4oC,KAAO/W,EAAG7xB,EAAE3F,KAAOw3B,EAAEx3B,KAAM2F,EAAEqxB,OAASQ,EAAER,OAAQrxB,EAAE9B,IAAMkyB,EAAGpwB,EAAEtI,IAAM04B,EAAE14B,IAAKsI,EAAEu1C,aAAgB9tB,GAAO0I,GAAM,KAC7H,MAAMn6B,EAAIm6B,EAAEnyB,IAAIoyB,EAAE14B,KAAM07B,EAAI3L,EAAEzxB,EAAFyxB,CAAK0I,GACjCA,EAAE6G,OAAO,MAAI/2B,GAAM,IAAIA,EAAE2C,QAAQif,GAAMA,EAAE,KAAOwO,IAAI,CAACA,EAAG+C,MAAMpzB,EAAEqxB,OAAS+B,CAAC,EACzEpzB,CAAC,EACHs0B,EAAK,CAACjE,EAAGmB,KACV,MAAMpB,EAAIv5B,OAAOu+B,YAAYv+B,OAAOsgC,QAAQ3F,GAAG/7B,KAAI,EAAE06B,GAAKiT,UAAWptC,MAAS,CAACm6B,EAAGn6B,MAAM67B,EAAIO,EAAEhC,EAAG,GAAGC,WAAYrwB,EAxD3G,CAACqwB,IACN,MAAMmB,EAAKpB,GAAMwE,gBACTxE,EAAEp1B,KAAK,MACb,MAAM62B,EAAIxB,EAAED,GAAIpwB,GAAI,OAAE6xB,GACtB,OAAOzB,EAAE4G,OAAO,MAAIvP,GAAM,IAAIA,EAAGznB,KAAKwxB,EAAEgkB,OAAS3jB,EAAG,KAClDzB,EAAE4G,OAAO,MAAIvP,GAAMA,EAAE7kB,QAAQutB,GAAMA,IAAMnwB,KAAG,CAC7C,EAEH,OAAOwxB,CAAC,EAgD4GvB,EAAGE,IACrH,MAAMn6B,EAAIm6B,EAAEnyB,IAAI6zB,EAAEn6B,KAAM+4B,EAAI55B,OAAOsgC,QAAQ3F,GAAGikB,SAAQ,EAAEriB,GAAK6P,QAAShjC,MAAS,CAACjK,EAAEo9B,IAAIlB,OAAOz8B,KAAKm+B,GAAM,CAACA,EAAG3zB,EAAEkwB,QAC9G,OAAOt5B,OAAOu+B,YAAY3E,EAAE,IAC1BhJ,EAAI,CAACoK,EAAG7xB,GACZ,OAAOynB,EAAEvpB,IAAM2zB,EAAGpK,EAAE2b,UAAYpjC,EAAGynB,EAAE/vB,IAAMm6B,EAAEn6B,IAAK+vB,EAAE+tB,OAASx1C,EAAEw1C,OAAQ/tB,CAAC,EACvEkjB,EAAK,CAACta,EAAGmB,EAAI,MAAM,CAAG,MAAMY,EAAEZ,EAAG,GAAGnB,SAAU8D,EAAK,CAAC9D,EAAGmB,EAAI,MAAM,CAAG,MAAMY,EAAEZ,EAAG,GAAGnB,SA+ClFkF,EAAK,IAAIlF,KACV,MAAMmB,EAAInB,EAAEv6B,OACZ,IAAIs6B,EAAIoB,EACR,KAAOpB,KACL,GAAmB,mBAARC,EAAED,GACX,MAAM,IAAIz0B,UAAU,uBACxB,MAAO,IAAIk2B,KACT,IAAI7xB,EAAI,EAAGynB,EAAI+J,EAAInB,EAAErwB,MAAM6xB,GAAKA,EAAE,GAClC,OAAS7xB,EAAIwxB,GACX/J,EAAI4I,EAAErwB,GAAGynB,GACX,OAAOA,CAAC,CACT,wECpQQiuB,EAAwC,WACjD,IAAIC,GAAO,QAAkB,UAAWC,EAAYpuC,EAAMxP,GACe,IAAI69C,EAAY,IAAIC,SACvFC,EAAQ,YACV,GAAIz+C,MAAMF,QAAQgB,GAAQ,CACxB,IAAI5B,EAAI,GAAGX,OAAO6B,EAAK,MACvBU,EAAM4K,SAAQ1F,IACZu4C,EAAU7Z,OAAOxlC,EAAG8G,EAAE,GAE1B,MACEu4C,EAAU7Z,OAAOtkC,EAAKU,EAE1B,EACA,IAAK,IAAKV,EAAKU,KAAUvB,OAAOsgC,QAAQ3vB,SAC/BuuC,IAET,aAAc,EAAAC,KAAA,IAAS,6EAA6EngD,OAAO+/C,EAAY,WAAYC,EAAW79C,IAAUwP,IAC1J,IACA,OAAO,SAAkCyuC,EAAIC,EAAKC,GAChD,OAAOR,EAAK35C,MAAMxG,KAAMqD,UAC1B,CACF,CArBmD,8GCCnD,MAAMu9C,EAAkB,CAACpnC,EAAOgpB,KACxBhpB,EAAMyuB,UAAUlB,QAEhBvE,GACAA,EAAShpB,EAAM8uB,GAAGsY,kBAAkBxU,mBACjC,GAiHX,SAASyU,EAAY1yC,EAAMmuC,EAAMwE,GAAO,GACpC,IAAK,IAAIC,EAAO5yC,EAAM4yC,EAAMA,EAAgB,SAARzE,EAAkByE,EAAK9K,WAAa8K,EAAKlO,UAAY,CACrF,GAAIkO,EAAKnI,YACL,OAAO,EACX,GAAIkI,GAA2B,GAAnBC,EAAKnO,WACb,OAAO,CACf,CACA,OAAO,CACX,CAyBA,SAASoO,EAAcC,GACnB,IAAKA,EAAKxwB,OAAO5rB,KAAKo3B,KAAKua,UACvB,IAAK,IAAIh2C,EAAIygD,EAAK33B,MAAQ,EAAG9oB,GAAK,EAAGA,IAAK,CACtC,GAAIygD,EAAK1yC,MAAM/N,GAAK,EAChB,OAAOygD,EAAKx0B,IAAI1hB,QAAQk2C,EAAKvxC,OAAOlP,EAAI,IAC5C,GAAIygD,EAAK9yC,KAAK3N,GAAGqE,KAAKo3B,KAAKua,UACvB,KACR,CACJ,OAAO,IACX,CA0EA,SAAS0K,EAAaD,GAClB,IAAKA,EAAKxwB,OAAO5rB,KAAKo3B,KAAKua,UACvB,IAAK,IAAIh2C,EAAIygD,EAAK33B,MAAQ,EAAG9oB,GAAK,EAAGA,IAAK,CACtC,IAAIiwB,EAASwwB,EAAK9yC,KAAK3N,GACvB,GAAIygD,EAAK1yC,MAAM/N,GAAK,EAAIiwB,EAAOmiB,WAC3B,OAAOqO,EAAKx0B,IAAI1hB,QAAQk2C,EAAK/kC,MAAM1b,EAAI,IAC3C,GAAIiwB,EAAO5rB,KAAKo3B,KAAKua,UACjB,KACR,CACJ,OAAO,IACX,CAwEA,SAAS2K,EAAep1B,GACpB,IAAK,IAAIvrB,EAAI,EAAGA,EAAIurB,EAAMq1B,UAAW5gD,IAAK,CACtC,IAAI,KAAEqE,GAASknB,EAAMs1B,KAAK7gD,GAC1B,GAAIqE,EAAK+zC,cAAgB/zC,EAAKy8C,mBAC1B,OAAOz8C,CACf,CACA,OAAO,IACX,CAkEA,IAAsB08C,EAgGtB,SAASC,EAAchoC,EAAOioC,EAAMjf,GAChC,IAAsDkf,EAAM31B,EAAxDrc,EAAS+xC,EAAK9Q,WAAYz0B,EAAQulC,EAAK1J,UAC3C,GAAIroC,EAAO7K,KAAKo3B,KAAKua,WAAat6B,EAAMrX,KAAKo3B,KAAKua,UAC9C,OAAO,EACX,GAtBJ,SAAwBh9B,EAAOynC,EAAMze,GACjC,IAAI9yB,EAASuxC,EAAKtQ,WAAYz0B,EAAQ+kC,EAAKlJ,UAAWxpC,EAAQ0yC,EAAK1yC,QACnE,UAAKmB,GAAWwM,GAAUxM,EAAO7K,KAAK88C,kBAAkBzlC,EAAMrX,UAEzD6K,EAAOvP,QAAQ8Q,MAAQgwC,EAAKxwB,OAAO0nB,WAAW5pC,EAAQ,EAAGA,IACtDi0B,GACAA,EAAShpB,EAAM8uB,GAAGrF,OAAOge,EAAK36B,IAAM5W,EAAOwkC,SAAU+M,EAAK36B,KAAK8lB,kBAC5D,IAEN6U,EAAKxwB,OAAO0nB,WAAW5pC,EAAOA,EAAQ,KAAQ2N,EAAM08B,eAAe,QAAQp/B,EAAMiT,IAAKw0B,EAAK36B,OAE5Fkc,GACAA,EAAShpB,EAAM8uB,GACVsZ,kBAAkBX,EAAK36B,IAAK5W,EAAO7K,KAAM6K,EAAOopC,eAAeppC,EAAOkjC,aACtEryC,KAAK0gD,EAAK36B,KACV8lB,kBACF,IACX,CAKQyV,CAAeroC,EAAOioC,EAAMjf,GAC5B,OAAO,EACX,IAAIsf,EAAcL,EAAKhxB,OAAO0nB,WAAWsJ,EAAKlzC,QAASkzC,EAAKlzC,QAAU,GACtE,GAAIuzC,IACCJ,GAAQ31B,EAAQrc,EAAOopC,eAAeppC,EAAOkjC,aAAamP,aAAa7lC,EAAMrX,QAC9EknB,EAAMi2B,UAAUN,EAAK,IAAMxlC,EAAMrX,MAAMo9C,SAAU,CACjD,GAAIzf,EAAU,CACV,IAAI5zB,EAAM6yC,EAAKn7B,IAAMpK,EAAMg4B,SAAU9b,EAAO,WAC5C,IAAK,IAAI53B,EAAIkhD,EAAKphD,OAAS,EAAGE,GAAK,EAAGA,IAClC43B,EAAO,UAAcspB,EAAKlhD,GAAGwa,OAAO,KAAMod,IAC9CA,EAAO,UAAc1oB,EAAOxM,KAAKk1B,IACjC,IAAIkQ,EAAK9uB,EAAM8uB,GAAGG,KAAK,IAAI,KAAkBgZ,EAAKn7B,IAAM,EAAG1X,EAAK6yC,EAAKn7B,IAAK1X,EAAK,IAAI,KAAMwpB,EAAM,EAAG,GAAIspB,EAAKphD,QAAQ,IAC/G4hD,EAAStzC,EAAM,EAAI8yC,EAAKphD,QACxB,QAAQgoC,EAAG7b,IAAKy1B,IAChB5Z,EAAG/nC,KAAK2hD,GACZ1f,EAAS8F,EAAG8D,iBAChB,CACA,OAAO,CACX,CACA,IAAI+V,EAAW,cAAmBV,EAAM,GACpCjR,EAAQ2R,GAAYA,EAASnN,MAAMvE,WAAW0R,EAAS1K,KAAMl1C,EAASiuC,IAAS,QAAWA,GAC9F,GAAc,MAAVjuC,GAAkBA,GAAUk/C,EAAKn4B,MAGjC,OAFIkZ,GACAA,EAAShpB,EAAM8uB,GAAGuP,KAAKrH,EAAOjuC,GAAQ6pC,mBACnC,EAEX,GAAI0V,GAAejB,EAAY3kC,EAAO,SAAS,IAAS2kC,EAAYnxC,EAAQ,OAAQ,CAChF,IAAI2rB,EAAK3rB,EAAQ0oB,EAAO,GACxB,KACIA,EAAKj3B,KAAKk6B,IACNA,EAAGud,aAEPvd,EAAKA,EAAGwX,UAEZ,IAAIuP,EAAYlmC,EAAOmmC,EAAa,EACpC,MAAQD,EAAUxJ,YAAawJ,EAAYA,EAAUnM,WACjDoM,IACJ,GAAIhnB,EAAG8c,WAAW9c,EAAGuX,WAAYvX,EAAGuX,WAAYwP,EAAUjiD,SAAU,CAChE,GAAIqiC,EAAU,CACV,IAAI5zB,EAAM,WACV,IAAK,IAAIpO,EAAI43B,EAAK93B,OAAS,EAAGE,GAAK,EAAGA,IAClCoO,EAAM,UAAcwpB,EAAK53B,GAAG0C,KAAK0L,IAErC4zB,EADShpB,EAAM8uB,GAAGG,KAAK,IAAI,KAAkBgZ,EAAKn7B,IAAM8R,EAAK93B,OAAQmhD,EAAKn7B,IAAMpK,EAAMg4B,SAAUuN,EAAKn7B,IAAM+7B,EAAYZ,EAAKn7B,IAAMpK,EAAMg4B,SAAWmO,EAAY,IAAI,KAAMzzC,EAAKwpB,EAAK93B,OAAQ,GAAI,GAAG,IACtL8rC,iBAChB,CACA,OAAO,CACX,CACJ,CACA,OAAO,CACX,CACA,SAASkW,EAAoBhG,GACzB,OAAO,SAAU9iC,EAAOgpB,GACpB,IAAImW,EAAMn/B,EAAMyuB,UAAWgZ,EAAO3E,EAAO,EAAI3D,EAAI3D,MAAQ2D,EAAIlB,IACzDnuB,EAAQ23B,EAAK33B,MACjB,KAAO23B,EAAK9yC,KAAKmb,GAAOotB,UAAU,CAC9B,IAAKptB,EACD,OAAO,EACXA,GACJ,CACA,QAAK23B,EAAK9yC,KAAKmb,GAAOsvB,cAElBpW,GACAA,EAAShpB,EAAM8uB,GAAG2D,aAAa,YAAqBzyB,EAAMiT,IAAK6vB,EAAO,EAAI2E,EAAKxyC,MAAM6a,GAAS23B,EAAKryC,IAAI0a,OACpG,EACX,CACJ,CAIA,MAAMi5B,EAAuBD,GAAqB,GAI5CE,EAAqBF,EAAoB,GAM/C,SAASG,EAAOpS,EAAU7U,EAAQ,MAC9B,OAAO,SAAUhiB,EAAOgpB,GACpB,IAAI,MAAEwS,EAAK,IAAEyC,GAAQj+B,EAAMyuB,UACvBuI,EAAQwE,EAAMvE,WAAWgH,GAAM/G,EAAWF,IAAS,QAAaA,EAAOH,EAAU7U,GACrF,QAAKkV,IAEDlO,GACAA,EAAShpB,EAAM8uB,GAAGlQ,KAAKoY,EAAOE,GAAUtE,mBACrC,EACX,CACJ,CAKA,SAAS4E,EAAaX,EAAU7U,EAAQ,MACpC,OAAO,SAAUhiB,EAAOgpB,GACpB,IAAIkgB,GAAa,EACjB,IAAK,IAAIliD,EAAI,EAAGA,EAAIgZ,EAAMyuB,UAAUwD,OAAOnrC,SAAWoiD,EAAYliD,IAAK,CACnE,IAAMw0C,OAAS1uB,IAAKvX,GAAQ0oC,KAAOnxB,IAAKwgB,IAASttB,EAAMyuB,UAAUwD,OAAOjrC,GACxEgZ,EAAMiT,IAAIwnB,aAAallC,EAAM+3B,GAAI,CAAC34B,EAAMmY,KACpC,GAAIo8B,EACA,OAAO,EACX,GAAKv0C,EAAKyqC,cAAezqC,EAAKw0C,UAAUtS,EAAU7U,GAElD,GAAIrtB,EAAKtJ,MAAQwrC,EACbqS,GAAa,MAEZ,CACD,IAAIzB,EAAOznC,EAAMiT,IAAI1hB,QAAQub,GAAM/X,EAAQ0yC,EAAK1yC,QAChDm0C,EAAazB,EAAKxwB,OAAOqgB,eAAeviC,EAAOA,EAAQ,EAAG8hC,EAC9D,IAER,CACA,IAAKqS,EACD,OAAO,EACX,GAAIlgB,EAAU,CACV,IAAI8F,EAAK9uB,EAAM8uB,GACf,IAAK,IAAI9nC,EAAI,EAAGA,EAAIgZ,EAAMyuB,UAAUwD,OAAOnrC,OAAQE,IAAK,CACpD,IAAMw0C,OAAS1uB,IAAKvX,GAAQ0oC,KAAOnxB,IAAKwgB,IAASttB,EAAMyuB,UAAUwD,OAAOjrC,GACxE8nC,EAAG0I,aAAajiC,EAAM+3B,EAAIuJ,EAAU7U,EACxC,CACAgH,EAAS8F,EAAG8D,iBAChB,CACA,OAAO,CACX,CACJ,CAwBA,SAASwW,EAAWC,EAAUrnB,EAAQ,MAClC,OAAO,SAAUhiB,EAAOgpB,GACpB,IAAI,MAAEuE,EAAK,QAAE2X,EAAO,OAAEjT,GAAWjyB,EAAMyuB,UACvC,GAAKlB,IAAU2X,IA1BvB,SAAqBjyB,EAAKgf,EAAQ5mC,GAC9B,IAAK,IAAIrE,EAAI,EAAGA,EAAIirC,EAAOnrC,OAAQE,IAAK,CACpC,IAAI,MAAEw0C,EAAK,IAAEyC,GAAQhM,EAAOjrC,GACxBsiD,EAAqB,GAAf9N,EAAM1rB,OAAamD,EAAI2tB,eAAiB3tB,EAAI5nB,KAAKk+C,eAAel+C,GAM1E,GALA4nB,EAAIwnB,aAAae,EAAM1uB,IAAKmxB,EAAInxB,KAAKnY,IACjC,GAAI20C,EACA,OAAO,EACXA,EAAM30C,EAAKisC,eAAiBjsC,EAAKtJ,KAAKk+C,eAAel+C,EAAK,IAE1Di+C,EACA,OAAO,CACf,CACA,OAAO,CACX,CAaoCE,CAAYxpC,EAAMiT,IAAKgf,EAAQoX,GACvD,OAAO,EACX,GAAIrgB,EACA,GAAIkc,EACImE,EAASxkB,QAAQ7kB,EAAMypC,aAAevE,EAAQ9iB,SAC9C4G,EAAShpB,EAAM8uB,GAAG4a,iBAAiBL,IAEnCrgB,EAAShpB,EAAM8uB,GAAG6a,cAAcN,EAAS7nC,OAAOwgB,SAEnD,CACD,IAAI3vB,GAAM,EAAOy8B,EAAK9uB,EAAM8uB,GAC5B,IAAK,IAAI9nC,EAAI,GAAIqL,GAAOrL,EAAIirC,EAAOnrC,OAAQE,IAAK,CAC5C,IAAI,MAAEw0C,EAAK,IAAEyC,GAAQhM,EAAOjrC,GAC5BqL,EAAM2N,EAAMiT,IAAI+mB,aAAawB,EAAM1uB,IAAKmxB,EAAInxB,IAAKu8B,EACrD,CACA,IAAK,IAAIriD,EAAI,EAAGA,EAAIirC,EAAOnrC,OAAQE,IAAK,CACpC,IAAI,MAAEw0C,EAAK,IAAEyC,GAAQhM,EAAOjrC,GAC5B,GAAIqL,EACAy8B,EAAGmL,WAAWuB,EAAM1uB,IAAKmxB,EAAInxB,IAAKu8B,OAEjC,CACD,IAAI9zC,EAAOimC,EAAM1uB,IAAKwgB,EAAK2Q,EAAInxB,IAAK7X,EAAQumC,EAAM+C,UAAWnpC,EAAM6oC,EAAI9G,WACnEyS,EAAa30C,GAASA,EAAMktB,OAAS,OAAOzP,KAAKzd,EAAM+I,MAAM,GAAGlX,OAAS,EACzE+iD,EAAWz0C,GAAOA,EAAI+sB,OAAS,OAAOzP,KAAKtd,EAAI4I,MAAM,GAAGlX,OAAS,EACjEyO,EAAOq0C,EAAatc,IACpB/3B,GAAQq0C,EACRtc,GAAMuc,GAEV/a,EAAGoL,QAAQ3kC,EAAM+3B,EAAI+b,EAAS7nC,OAAOwgB,GACzC,CACJ,CACAgH,EAAS8F,EAAG8D,iBAChB,CAEJ,OAAO,CACX,CACJ,CAwDA,SAASkX,KAAiBC,GACtB,OAAO,SAAU/pC,EAAOgpB,EAAU3oB,GAC9B,IAAK,IAAIrZ,EAAI,EAAGA,EAAI+iD,EAASjjD,OAAQE,IACjC,GAAI+iD,EAAS/iD,GAAGgZ,EAAOgpB,EAAU3oB,GAC7B,OAAO,EACf,OAAO,CACX,CACJ,CACA,IAAI2pC,EAAYF,EAAc1C,GA9sBT,CAACpnC,EAAOgpB,EAAU3oB,KACnC,IAAI6kC,EAjBR,SAAsBllC,EAAOK,GACzB,IAAI,QAAE6kC,GAAYllC,EAAMyuB,UACxB,OAAKyW,IAAY7kC,GAAQA,EAAK4pC,eAAe,WAAYjqC,GACnDklC,EAAQzJ,aAAe,GAClB,KACJyJ,CACX,CAWkBgF,CAAalqC,EAAOK,GAClC,IAAK6kC,EACD,OAAO,EACX,IAAI+C,EAAOT,EAActC,GAEzB,IAAK+C,EAAM,CACP,IAAIjR,EAAQkO,EAAQjO,aAAcluC,EAASiuC,IAAS,QAAWA,GAC/D,OAAc,MAAVjuC,IAEAigC,GACAA,EAAShpB,EAAM8uB,GAAGuP,KAAKrH,EAAOjuC,GAAQ6pC,mBACnC,EACX,CACA,IAAI18B,EAAS+xC,EAAK9Q,WAElB,IAAKjhC,EAAO7K,KAAKo3B,KAAKua,WAAagL,EAAchoC,EAAOioC,EAAMjf,GAC1D,OAAO,EAGX,GAAmC,GAA/Bkc,EAAQjuB,OAAOtwB,QAAQ8Q,OACtB4vC,EAAYnxC,EAAQ,QAAU,kBAA2BA,IAAU,CACpE,IAAIi0C,GAAU,QAAYnqC,EAAMiT,IAAKiyB,EAAQhvC,SAAUgvC,EAAQxiC,QAAS,YACxE,GAAIynC,GAAWA,EAAQr+C,MAAM2L,KAAO0yC,EAAQ7c,GAAK6c,EAAQ50C,KAAM,CAC3D,GAAIyzB,EAAU,CACV,IAAI8F,EAAK9uB,EAAM8uB,GAAGG,KAAKkb,GACvBrb,EAAG2D,aAAa4U,EAAYnxC,EAAQ,OAAS,cAAmB44B,EAAG7b,IAAI1hB,QAAQu9B,EAAGM,QAAQ3oC,IAAIwhD,EAAKn7B,KAAM,KAAM,GACzG,YAAqBgiB,EAAG7b,IAAKg1B,EAAKn7B,IAAM5W,EAAOwkC,WACrD1R,EAAS8F,EAAG8D,iBAChB,CACA,OAAO,CACX,CACJ,CAEA,SAAI18B,EAAOk0C,QAAUnC,EAAKn4B,OAASo1B,EAAQp1B,MAAQ,IAC3CkZ,GACAA,EAAShpB,EAAM8uB,GAAGrF,OAAOwe,EAAKn7B,IAAM5W,EAAOwkC,SAAUuN,EAAKn7B,KAAK8lB,kBAC5D,GAEC,IAyEW,CAAC5yB,EAAOgpB,EAAU3oB,KACzC,IAAI,MAAEgqC,EAAK,MAAE9c,GAAUvtB,EAAMyuB,UAAWwZ,EAAOoC,EAC/C,IAAK9c,EACD,OAAO,EACX,GAAI8c,EAAMpzB,OAAOmoB,YAAa,CAC1B,GAAI/+B,GAAQA,EAAK4pC,eAAe,WAAYjqC,GAASqqC,EAAM5O,aAAe,EACtE,OAAO,EACXwM,EAAOT,EAAc6C,EACzB,CACA,IAAI11C,EAAOszC,GAAQA,EAAK9Q,WACxB,SAAKxiC,IAAS,kBAA2BA,KAErCq0B,GACAA,EAAShpB,EAAM8uB,GAAG2D,aAAa,YAAqBzyB,EAAMiT,IAAKg1B,EAAKn7B,IAAMnY,EAAK+lC,WAAW9H,kBACvF,GAAI,IAilBX0X,EAAMR,EAAc1C,GAvjBJ,CAACpnC,EAAOgpB,EAAU3oB,KAClC,IAAI6kC,EAfR,SAAoBllC,EAAOK,GACvB,IAAI,QAAE6kC,GAAYllC,EAAMyuB,UACxB,OAAKyW,IAAY7kC,GAAQA,EAAK4pC,eAAe,UAAWjqC,GAClDklC,EAAQzJ,aAAeyJ,EAAQjuB,OAAOtwB,QAAQ8Q,MACzC,KACJytC,CACX,CASkBqF,CAAWvqC,EAAOK,GAChC,IAAK6kC,EACD,OAAO,EACX,IAAI+C,EAAOP,EAAaxC,GAExB,IAAK+C,EACD,OAAO,EACX,IAAIvlC,EAAQulC,EAAK1J,UAEjB,GAAIyJ,EAAchoC,EAAOioC,EAAMjf,GAC3B,OAAO,EAGX,GAAmC,GAA/Bkc,EAAQjuB,OAAOtwB,QAAQ8Q,OACtB4vC,EAAY3kC,EAAO,UAAY,kBAA2BA,IAAS,CACpE,IAAIynC,GAAU,QAAYnqC,EAAMiT,IAAKiyB,EAAQhvC,SAAUgvC,EAAQxiC,QAAS,YACxE,GAAIynC,GAAWA,EAAQr+C,MAAM2L,KAAO0yC,EAAQ7c,GAAK6c,EAAQ50C,KAAM,CAC3D,GAAIyzB,EAAU,CACV,IAAI8F,EAAK9uB,EAAM8uB,GAAGG,KAAKkb,GACvBrb,EAAG2D,aAAa4U,EAAY3kC,EAAO,SAAW,cAAmBosB,EAAG7b,IAAI1hB,QAAQu9B,EAAGM,QAAQ3oC,IAAIwhD,EAAKn7B,MAAO,GACrG,YAAqBgiB,EAAG7b,IAAK6b,EAAGM,QAAQ3oC,IAAIwhD,EAAKn7B,OACvDkc,EAAS8F,EAAG8D,iBAChB,CACA,OAAO,CACX,CACJ,CAEA,SAAIlwB,EAAM0nC,QAAUnC,EAAKn4B,OAASo1B,EAAQp1B,MAAQ,IAC1CkZ,GACAA,EAAShpB,EAAM8uB,GAAGrF,OAAOwe,EAAKn7B,IAAKm7B,EAAKn7B,IAAMpK,EAAMg4B,UAAU9H,kBAC3D,GAEC,IAUU,CAAC5yB,EAAOgpB,EAAU3oB,KACxC,IAAI,MAAEgqC,EAAK,MAAE9c,GAAUvtB,EAAMyuB,UAAWwZ,EAAOoC,EAC/C,IAAK9c,EACD,OAAO,EACX,GAAI8c,EAAMpzB,OAAOmoB,YAAa,CAC1B,GAAI/+B,GAAQA,EAAK4pC,eAAe,UAAWjqC,GAASqqC,EAAM5O,aAAe4O,EAAMpzB,OAAOtwB,QAAQ8Q,KAC1F,OAAO,EACXwwC,EAAOP,EAAa2C,EACxB,CACA,IAAI11C,EAAOszC,GAAQA,EAAK1J,UACxB,SAAK5pC,IAAS,kBAA2BA,KAErCq0B,GACAA,EAAShpB,EAAM8uB,GAAG2D,aAAa,YAAqBzyB,EAAMiT,IAAKg1B,EAAKn7B,MAAM8lB,kBACvE,GAAI,IA2gBf,MAAM4X,EAAe,CACjB,MAASV,GAhcS,CAAC9pC,EAAOgpB,KAC1B,IAAI,MAAEqhB,EAAK,QAAE1P,GAAY36B,EAAMyuB,UAC/B,SAAK4b,EAAMpzB,OAAO5rB,KAAKo3B,KAAK1sB,OAASs0C,EAAMtL,WAAWpE,KAElD3R,GACAA,EAAShpB,EAAM8uB,GAAG4H,WAAW,MAAM9D,kBAChC,GAAI,IAiCa,CAAC5yB,EAAOgpB,KAChC,IAAImW,EAAMn/B,EAAMyuB,WAAW,MAAE+M,EAAK,IAAEyC,GAAQkB,EAC5C,GAAIA,aAAe,MAAgB3D,EAAMvkB,OAAO2pB,eAAiB3C,EAAIhnB,OAAO2pB,cACxE,OAAO,EACX,IAAIv1C,EAAOs8C,EAAe1J,EAAIhnB,OAAOqoB,eAAerB,EAAI1G,eACxD,IAAKlsC,IAASA,EAAK+zC,YACf,OAAO,EACX,GAAIpW,EAAU,CACV,IAAI8Z,IAAStH,EAAMC,cAAgBwC,EAAIlpC,QAAUkpC,EAAIhnB,OAAOmiB,WAAaoC,EAAQyC,GAAKnxB,IAClFgiB,EAAK9uB,EAAM8uB,GAAG0H,OAAOsM,EAAMz3C,EAAKy3B,iBACpCgM,EAAG2D,aAAa,YAAqB3D,EAAG7b,IAAK6vB,EAAO,IACpD9Z,EAAS8F,EAAG8D,iBAChB,CACA,OAAO,CAAI,IAMQ,CAAC5yB,EAAOgpB,KAC3B,IAAI,QAAEkc,GAAYllC,EAAMyuB,UACxB,IAAKyW,GAAWA,EAAQjuB,OAAOtwB,QAAQ8Q,KACnC,OAAO,EACX,GAAIytC,EAAQp1B,MAAQ,GAAKo1B,EAAQxiC,SAAWwiC,EAAQ9vC,KAAK,GAAI,CACzD,IAAIc,EAASgvC,EAAQhvC,SACrB,IAAI,QAAS8J,EAAMiT,IAAK/c,GAGpB,OAFI8yB,GACAA,EAAShpB,EAAM8uB,GAAG7V,MAAM/iB,GAAQ08B,mBAC7B,CAEf,CACA,IAAIoE,EAAQkO,EAAQjO,aAAcluC,EAASiuC,IAAS,QAAWA,GAC/D,OAAc,MAAVjuC,IAEAigC,GACAA,EAAShpB,EAAM8uB,GAAGuP,KAAKrH,EAAOjuC,GAAQ6pC,mBACnC,EAAI,IAOJ,CAAC5yB,EAAOgpB,KACX,IAAI,MAAEwS,EAAK,IAAEyC,GAAQj+B,EAAMyuB,UAC3B,GAAIzuB,EAAMyuB,qBAAqB,MAAiBzuB,EAAMyuB,UAAU95B,KAAKmqC,QACjE,SAAKtD,EAAMC,gBAAiB,QAASz7B,EAAMiT,IAAKuoB,EAAM1uB,OAElDkc,GACAA,EAAShpB,EAAM8uB,GAAG7V,MAAMuiB,EAAM1uB,KAAK8lB,kBAChC,IAEX,IAAK4I,EAAMvkB,OAAO6nB,QACd,OAAO,EACX,GAAI9V,EAAU,CACV,IAAIyV,EAAQR,EAAIxC,cAAgBwC,EAAIhnB,OAAOtwB,QAAQ8Q,KAC/Cq3B,EAAK9uB,EAAM8uB,IACX9uB,EAAMyuB,qBAAqB,MAAiBzuB,EAAMyuB,qBAAqB,OACvEK,EAAGsY,kBACP,IAAIqD,EAAuB,GAAfjP,EAAM1rB,MAAa,KAAO63B,EAAenM,EAAM7mC,MAAM,GAAG2qC,eAAe9D,EAAMjE,YAAY,KAEjGiI,EADYuI,EACQ,CADRA,GACsBtJ,GAASgM,EAAQ,CAAC,CAAEp/C,KAAMo/C,SAAWnjD,EACvEgiD,GAAM,QAASxa,EAAG7b,IAAK6b,EAAGM,QAAQ3oC,IAAI+0C,EAAM1uB,KAAM,EAAG0yB,GAMzD,GALKA,GAAU8J,KAAO,QAASxa,EAAG7b,IAAK6b,EAAGM,QAAQ3oC,IAAI+0C,EAAM1uB,KAAM,EAAG29B,EAAQ,CAAC,CAAEp/C,KAAMo/C,SAAWnjD,KACzFmjD,IACAjL,EAAQ,CAAC,CAAEn0C,KAAMo/C,KACrBnB,GAAM,GAENA,IACAxa,EAAG7V,MAAM6V,EAAGM,QAAQ3oC,IAAI+0C,EAAM1uB,KAAM,EAAG0yB,IAClCf,IAAUjD,EAAMC,cAAgBD,EAAMvkB,OAAO5rB,MAAQo/C,GAAO,CAC7D,IAAIC,EAAQ5b,EAAGM,QAAQ3oC,IAAI+0C,EAAMtlC,UAAWy0C,EAAS7b,EAAG7b,IAAI1hB,QAAQm5C,GAChED,GAASjP,EAAM7mC,MAAM,GAAG2iC,eAAeqT,EAAO51C,QAAS41C,EAAO51C,QAAU,EAAG01C,IAC3E3b,EAAG4M,cAAc5M,EAAGM,QAAQ3oC,IAAI+0C,EAAMtlC,UAAWu0C,EACzD,CAEJzhB,EAAS8F,EAAG8D,iBAChB,CACA,OAAO,CAAI,IA4Uf,YA5aa,CAAC5yB,EAAOgpB,KACrB,IAAI,MAAEqhB,EAAK,QAAE1P,GAAY36B,EAAMyuB,UAC/B,IAAK4b,EAAMpzB,OAAO5rB,KAAKo3B,KAAK1sB,OAASs0C,EAAMtL,WAAWpE,GAClD,OAAO,EACX,IAAIiQ,EAAQP,EAAM11C,MAAM,GAAI+N,EAAQ2nC,EAAM9S,YAAY,GAAIlsC,EAAOs8C,EAAeiD,EAAMtL,eAAe58B,IACrG,IAAKrX,IAASu/C,EAAMtT,eAAe50B,EAAOA,EAAOrX,GAC7C,OAAO,EACX,GAAI29B,EAAU,CACV,IAAIlc,EAAMu9B,EAAM3nC,QAASosB,EAAK9uB,EAAM8uB,GAAGgH,YAAYhpB,EAAKA,EAAKzhB,EAAKy3B,iBAClEgM,EAAG2D,aAAa,UAAe3D,EAAG7b,IAAI1hB,QAAQub,GAAM,IACpDkc,EAAS8F,EAAG8D,iBAChB,CACA,OAAO,CAAI,EAiaX,UAAaoX,EACb,gBAAiBA,EACjB,kBAAmBA,EACnB,OAAUM,EACV,aAAcA,EACd,QA7Sc,CAACtqC,EAAOgpB,KAClBA,GACAA,EAAShpB,EAAM8uB,GAAG2D,aAAa,IAAI,KAAazyB,EAAMiT,QACnD,IAkTL43B,EAAgB,CAClB,SAAUL,EAAwB,UAClC,gBAAiBA,EAAa,iBAC9B,SAAUA,EAAqB,OAC/B,qBAAsBA,EAAa,cACnC,aAAcA,EAAa,cAC3B,QAASA,EAAa,cACtB,SAAUzB,EACV,SAAUC,GAEd,IAAK,IAAItgD,KAAO8hD,EACZK,EAAcniD,GAAO8hD,EAAa9hD,GACtC,MAQMoiD,GAR0B,oBAAbhH,UAA2B,qBAAqBj4C,KAAKi4C,UAAUY,UAE/D,oBAANqG,IAAqBA,GAAGrG,UAA4B,UAAjBqG,GAAGrG,YAM1BmG,EAAgBL,+CCrsBzC,IAzFO,IAAI76C,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,KAGIsmB,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,KAGH+0B,EAA6B,oBAAblH,WAA4B,gBAAgBpxB,KAAKoxB,UAAUE,WAE3EiH,GAD4B,oBAAbnH,WAA4B,aAAaj4C,KAAKi4C,UAAUE,WAC7C,oBAAbF,WAA4B,MAAMj4C,KAAKi4C,UAAUY,WAC9D9d,EAAyB,oBAAbkd,WAA4B,gDAAgDpxB,KAAKoxB,UAAUE,WACvGkH,EAAsBD,GAAOD,IAAWA,EAAO,GAAK,GAG/ChkD,EAAI,EAAGA,EAAI,GAAIA,IAAK2I,EAAK,GAAK3I,GAAK2I,EAAK,GAAK3I,GAAKqM,OAAOrM,GAGlE,IAASA,EAAI,EAAGA,GAAK,GAAIA,IAAK2I,EAAK3I,EAAI,KAAO,IAAMA,EAGpD,IAASA,EAAI,GAAIA,GAAK,GAAIA,IACxB2I,EAAK3I,GAAKqM,OAAO6D,aAAalQ,EAAI,IAClCivB,EAAMjvB,GAAKqM,OAAO6D,aAAalQ,GAIjC,IAAK,IAAI+O,KAAQpG,EAAWsmB,EAAMluB,eAAegO,KAAOkgB,EAAMlgB,GAAQpG,EAAKoG,kBClG3E,MAAM,EAA0B,oBAAb+tC,WAA2B,qBAAqBj4C,KAAKi4C,UAAUY,UAClF,SAASyG,EAAiBliD,GACtB,IAGI2L,EAAKw2C,EAAMn1B,EAAOrO,EAHlB6S,EAAQxxB,EAAKgwB,MAAM,UAAW7sB,EAASquB,EAAMA,EAAM3zB,OAAS,GAClD,SAAVsF,IACAA,EAAS,KAEb,IAAK,IAAIpF,EAAI,EAAGA,EAAIyzB,EAAM3zB,OAAS,EAAGE,IAAK,CACvC,IAAIqkD,EAAM5wB,EAAMzzB,GAChB,GAAI,kBAAkB6E,KAAKw/C,GACvBzjC,GAAO,OACN,GAAI,YAAY/b,KAAKw/C,GACtBz2C,GAAM,OACL,GAAI,sBAAsB/I,KAAKw/C,GAChCD,GAAO,OACN,GAAI,cAAcv/C,KAAKw/C,GACxBp1B,GAAQ,MACP,KAAI,SAASpqB,KAAKw/C,GAOnB,MAAM,IAAI98C,MAAM,+BAAiC88C,GAN7C,EACAzjC,GAAO,EAEPwjC,GAAO,CAG0C,CAC7D,CASA,OARIx2C,IACAxI,EAAS,OAASA,GAClBg/C,IACAh/C,EAAS,QAAUA,GACnBwb,IACAxb,EAAS,QAAUA,GACnB6pB,IACA7pB,EAAS,SAAWA,GACjBA,CACX,CAOA,SAASk/C,EAAUriD,EAAM2S,EAAOqa,GAAQ,GASpC,OARIra,EAAM2vC,SACNtiD,EAAO,OAASA,GAChB2S,EAAM4vC,UACNviD,EAAO,QAAUA,GACjB2S,EAAM6vC,UACNxiD,EAAO,QAAUA,GACjBgtB,GAASra,EAAM8vC,WACfziD,EAAO,SAAWA,GACfA,CACX,CAgCA,SAASu9C,EAAOmF,GACZ,OAAO,IAAI,KAAO,CAAEnoB,MAAO,CAAE2hB,cAAeyG,EAAeD,KAC/D,CAMA,SAASC,EAAeD,GACpB,IAAIllD,EAzDR,SAAmBA,GACf,IAAIiD,EAAO7B,OAAO2Z,OAAO,MACzB,IAAK,IAAIyb,KAAQx2B,EACbiD,EAAKyhD,EAAiBluB,IAASx2B,EAAIw2B,GACvC,OAAOvzB,CACX,CAoDc0yB,CAAUuvB,GACpB,OAAO,SAAUtrC,EAAMzE,GACnB,IAA2BiwC,EAAvB5iD,EDML,SAAiB2S,GACtB,IAGI3S,IAHYiiD,IAAwBtvC,EAAM4vC,SAAW5vC,EAAM2vC,QAAU3vC,EAAM6vC,UAC7E7kB,GAAMhrB,EAAM8vC,UAAY9vC,EAAMlT,KAA2B,GAApBkT,EAAMlT,IAAI5B,QAClC,gBAAb8U,EAAMlT,MACkBkT,EAAMlT,MAC7BkT,EAAM8vC,SAAWz1B,EAAQtmB,GAAMiM,EAAMkwC,UACtClwC,EAAMlT,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,CACT,CCtBmB8iD,CAAQnwC,GAAkBowC,EAASvlD,EAAI6kD,EAAUriD,EAAM2S,IAClE,GAAIowC,GAAUA,EAAO3rC,EAAKL,MAAOK,EAAK2oB,SAAU3oB,GAC5C,OAAO,EAEX,GAAmB,GAAfpX,EAAKnC,QAAuB,KAARmC,EAAa,CACjC,GAAI2S,EAAM8vC,SAAU,CAGhB,IAAIO,EAAUxlD,EAAI6kD,EAAUriD,EAAM2S,GAAO,IACzC,GAAIqwC,GAAWA,EAAQ5rC,EAAKL,MAAOK,EAAK2oB,SAAU3oB,GAC9C,OAAO,CACf,CACA,IAAKzE,EAAM8vC,UAAY9vC,EAAM2vC,QAAU3vC,EAAM6vC,SAAWxiD,EAAKwV,WAAW,GAAK,OACxEotC,EAAWl8C,EAAKiM,EAAMkwC,WAAaD,GAAY5iD,EAAM,CAKtD,IAAIijD,EAAWzlD,EAAI6kD,EAAUO,EAAUjwC,IACvC,GAAIswC,GAAYA,EAAS7rC,EAAKL,MAAOK,EAAK2oB,SAAU3oB,GAChD,OAAO,CACf,CACJ,CACA,OAAO,CACX,CACJ,+BCxHA,SAAS8rC,EAAWxlD,GAClBH,KAAKG,QAAUA,CACjB,qGAEAwlD,EAAWrkD,UAAY,CACrBe,YAAasjD,EAEb5pB,KAAM,SAAS75B,GACb,IAAK,IAAI1B,EAAI,EAAGA,EAAIR,KAAKG,QAAQG,OAAQE,GAAK,EAC5C,GAAIR,KAAKG,QAAQK,KAAO0B,EAAK,OAAO1B,EACtC,OAAQ,CACV,EAKAgI,IAAK,SAAStG,GACZ,IAAI0jD,EAAQ5lD,KAAK+7B,KAAK75B,GACtB,OAAiB,GAAV0jD,OAAc9kD,EAAYd,KAAKG,QAAQylD,EAAQ,EACxD,EAMApkB,OAAQ,SAASt/B,EAAKU,EAAOijD,GAC3B,IAAI5hD,EAAO4hD,GAAUA,GAAU3jD,EAAMlC,KAAK0O,OAAOm3C,GAAU7lD,KACvD4lD,EAAQ3hD,EAAK83B,KAAK75B,GAAM/B,EAAU8D,EAAK9D,QAAQmF,QAOnD,OANc,GAAVsgD,EACFzlD,EAAQgB,KAAK0kD,GAAU3jD,EAAKU,IAE5BzC,EAAQylD,EAAQ,GAAKhjD,EACjBijD,IAAQ1lD,EAAQylD,GAASC,IAExB,IAAIF,EAAWxlD,EACxB,EAIAuO,OAAQ,SAASxM,GACf,IAAI0jD,EAAQ5lD,KAAK+7B,KAAK75B,GACtB,IAAc,GAAV0jD,EAAa,OAAO5lD,KACxB,IAAIG,EAAUH,KAAKG,QAAQmF,QAE3B,OADAnF,EAAQqO,OAAOo3C,EAAO,GACf,IAAID,EAAWxlD,EACxB,EAIA2lD,WAAY,SAAS5jD,EAAKU,GACxB,OAAO,IAAI+iD,EAAW,CAACzjD,EAAKU,GAAOvC,OAAOL,KAAK0O,OAAOxM,GAAK/B,SAC7D,EAIA4lD,SAAU,SAAS7jD,EAAKU,GACtB,IAAIzC,EAAUH,KAAK0O,OAAOxM,GAAK/B,QAAQmF,QAEvC,OADAnF,EAAQgB,KAAKe,EAAKU,GACX,IAAI+iD,EAAWxlD,EACxB,EAKAqoC,UAAW,SAASzU,EAAO7xB,EAAKU,GAC9B,IAAIojD,EAAUhmD,KAAK0O,OAAOxM,GAAM/B,EAAU6lD,EAAQ7lD,QAAQmF,QACtDsgD,EAAQI,EAAQjqB,KAAKhI,GAEzB,OADA5zB,EAAQqO,QAAiB,GAAVo3C,EAAczlD,EAAQG,OAASslD,EAAO,EAAG1jD,EAAKU,GACtD,IAAI+iD,EAAWxlD,EACxB,EAKAqN,QAAS,SAASwwB,GAChB,IAAK,IAAIx9B,EAAI,EAAGA,EAAIR,KAAKG,QAAQG,OAAQE,GAAK,EAC5Cw9B,EAAEh+B,KAAKG,QAAQK,GAAIR,KAAKG,QAAQK,EAAI,GACxC,EAKAomC,QAAS,SAAS3mC,GAEhB,OADAA,EAAM0lD,EAAW52C,KAAK9O,IACbgR,KACF,IAAI00C,EAAW1lD,EAAIE,QAAQE,OAAOL,KAAKimD,SAAShmD,GAAKE,UADtCH,IAExB,EAKAwmC,OAAQ,SAASvmC,GAEf,OADAA,EAAM0lD,EAAW52C,KAAK9O,IACbgR,KACF,IAAI00C,EAAW3lD,KAAKimD,SAAShmD,GAAKE,QAAQE,OAAOJ,EAAIE,UADtCH,IAExB,EAKAimD,SAAU,SAAShmD,GACjB,IAAI2F,EAAS5F,KACbC,EAAM0lD,EAAW52C,KAAK9O,GACtB,IAAK,IAAIO,EAAI,EAAGA,EAAIP,EAAIE,QAAQG,OAAQE,GAAK,EAC3CoF,EAASA,EAAO8I,OAAOzO,EAAIE,QAAQK,IACrC,OAAOoF,CACT,EAIAsgD,SAAU,WACR,IAAItgD,EAAS,CAAC,EAEd,OADA5F,KAAKwN,SAAQ,SAAStL,EAAKU,GAASgD,EAAO1D,GAAOU,CAAO,IAClDgD,CACT,EAIIqL,WACF,OAAOjR,KAAKG,QAAQG,QAAU,CAChC,GAOFqlD,EAAW52C,KAAO,SAASnM,GACzB,GAAIA,aAAiB+iD,EAAY,OAAO/iD,EACxC,IAAIzC,EAAU,GACd,GAAIyC,EAAO,IAAK,IAAI6zB,KAAQ7zB,EAAOzC,EAAQgB,KAAKs1B,EAAM7zB,EAAM6zB,IAC5D,OAAO,IAAIkvB,EAAWxlD,EACxB,EAEA,UCtIA,SAASgmD,EAAcl0B,EAAGC,EAAG5L,GACzB,IAAK,IAAI9lB,EAAI,GAAIA,IAAK,CAClB,GAAIA,GAAKyxB,EAAE2gB,YAAcpyC,GAAK0xB,EAAE0gB,WAC5B,OAAO3gB,EAAE2gB,YAAc1gB,EAAE0gB,WAAa,KAAOtsB,EACjD,IAAI8/B,EAASn0B,EAAEa,MAAMtyB,GAAI6lD,EAASn0B,EAAEY,MAAMtyB,GAC1C,GAAI4lD,GAAUC,EAAd,CAIA,IAAKD,EAAOE,WAAWD,GACnB,OAAO//B,EACX,GAAI8/B,EAAOzqB,QAAUyqB,EAAO5uC,MAAQ6uC,EAAO7uC,KAAM,CAC7C,IAAK,IAAI0lB,EAAI,EAAGkpB,EAAO5uC,KAAK0lB,IAAMmpB,EAAO7uC,KAAK0lB,GAAIA,IAC9C5W,IACJ,OAAOA,CACX,CACA,GAAI8/B,EAAOjmD,QAAQ8Q,MAAQo1C,EAAOlmD,QAAQ8Q,KAAM,CAC5C,IAAIy2B,EAAQye,EAAcC,EAAOjmD,QAASkmD,EAAOlmD,QAASmmB,EAAM,GAChE,GAAa,MAATohB,EACA,OAAOA,CACf,CACAphB,GAAO8/B,EAAOlS,QAbd,MAFI5tB,GAAO8/B,EAAOlS,QAgBtB,CACJ,CACA,SAASqS,EAAYt0B,EAAGC,EAAGs0B,EAAMC,GAC7B,IAAK,IAAIC,EAAKz0B,EAAE2gB,WAAY+T,EAAKz0B,EAAE0gB,aAAc,CAC7C,GAAU,GAAN8T,GAAiB,GAANC,EACX,OAAOD,GAAMC,EAAK,KAAO,CAAE10B,EAAGu0B,EAAMt0B,EAAGu0B,GAC3C,IAAIL,EAASn0B,EAAEa,QAAQ4zB,GAAKL,EAASn0B,EAAEY,QAAQ6zB,GAAK11C,EAAOm1C,EAAOlS,SAClE,GAAIkS,GAAUC,EAAd,CAKA,IAAKD,EAAOE,WAAWD,GACnB,MAAO,CAAEp0B,EAAGu0B,EAAMt0B,EAAGu0B,GACzB,GAAIL,EAAOzqB,QAAUyqB,EAAO5uC,MAAQ6uC,EAAO7uC,KAAM,CAC7C,IAAIovC,EAAO,EAAGC,EAAUviD,KAAKG,IAAI2hD,EAAO5uC,KAAKlX,OAAQ+lD,EAAO7uC,KAAKlX,QACjE,KAAOsmD,EAAOC,GAAWT,EAAO5uC,KAAK4uC,EAAO5uC,KAAKlX,OAASsmD,EAAO,IAAMP,EAAO7uC,KAAK6uC,EAAO7uC,KAAKlX,OAASsmD,EAAO,IAC3GA,IACAJ,IACAC,IAEJ,MAAO,CAAEx0B,EAAGu0B,EAAMt0B,EAAGu0B,EACzB,CACA,GAAIL,EAAOjmD,QAAQ8Q,MAAQo1C,EAAOlmD,QAAQ8Q,KAAM,CAC5C,IAAIy2B,EAAQ6e,EAAYH,EAAOjmD,QAASkmD,EAAOlmD,QAASqmD,EAAO,EAAGC,EAAO,GACzE,GAAI/e,EACA,OAAOA,CACf,CACA8e,GAAQv1C,EACRw1C,GAAQx1C,CAlBR,MAHIu1C,GAAQv1C,EACRw1C,GAAQx1C,CAqBhB,CACJ,CASA,MAAM61C,EAIFzkD,YAIAlC,EAAS8Q,GAGL,GAFAjR,KAAKG,QAAUA,EACfH,KAAKiR,KAAOA,GAAQ,EACR,MAARA,EACA,IAAK,IAAIzQ,EAAI,EAAGA,EAAIL,EAAQG,OAAQE,IAChCR,KAAKiR,MAAQ9Q,EAAQK,GAAG0zC,QACpC,CAMAD,aAAallC,EAAM+3B,EAAI9I,EAAG+oB,EAAY,EAAGt2B,GACrC,IAAK,IAAIjwB,EAAI,EAAG8lB,EAAM,EAAGA,EAAMwgB,EAAItmC,IAAK,CACpC,IAAIsyB,EAAQ9yB,KAAKG,QAAQK,GAAIoO,EAAM0X,EAAMwM,EAAMohB,SAC/C,GAAItlC,EAAMG,IAAyD,IAAjDivB,EAAElL,EAAOi0B,EAAYzgC,EAAKmK,GAAU,KAAMjwB,IAAgBsyB,EAAM3yB,QAAQ8Q,KAAM,CAC5F,IAAIxC,EAAQ6X,EAAM,EAClBwM,EAAMmhB,aAAa3vC,KAAKC,IAAI,EAAGwK,EAAON,GAAQnK,KAAKG,IAAIquB,EAAM3yB,QAAQ8Q,KAAM61B,EAAKr4B,GAAQuvB,EAAG+oB,EAAYt4C,EAC3G,CACA6X,EAAM1X,CACV,CACJ,CAMA2rC,YAAYvc,GACRh+B,KAAKi0C,aAAa,EAAGj0C,KAAKiR,KAAM+sB,EACpC,CAKA+f,YAAYhvC,EAAM+3B,EAAIkgB,EAAgBrQ,GAClC,IAAIn/B,EAAO,GAAIyvC,GAAY,EAoB3B,OAnBAjnD,KAAKi0C,aAAallC,EAAM+3B,GAAI,CAAC34B,EAAMmY,KAC3BnY,EAAKwtB,QACLnkB,GAAQrJ,EAAKqJ,KAAKlS,MAAMhB,KAAKC,IAAIwK,EAAMuX,GAAOA,EAAKwgB,EAAKxgB,GACxD2gC,GAAaD,GAER74C,EAAK+4C,QACNvQ,EACAn/B,GAA4B,mBAAbm/B,EAA0BA,EAASxoC,GAAQwoC,EAErDxoC,EAAKtJ,KAAKo3B,KAAK0a,WACpBn/B,GAAQrJ,EAAKtJ,KAAKo3B,KAAK0a,SAASxoC,IAEpC84C,GAAaD,IAEPC,GAAa94C,EAAKmqC,UACxB9gC,GAAQwvC,EACRC,GAAY,EAChB,GACD,GACIzvC,CACX,CAKAgvB,OAAOvhC,GACH,IAAKA,EAAMgM,KACP,OAAOjR,KACX,IAAKA,KAAKiR,KACN,OAAOhM,EACX,IAAI8lC,EAAO/qC,KAAK6yC,UAAWqR,EAAQj/C,EAAMgxC,WAAY91C,EAAUH,KAAKG,QAAQmF,QAAS9E,EAAI,EAKzF,IAJIuqC,EAAKpP,QAAUoP,EAAKub,WAAWpC,KAC/B/jD,EAAQA,EAAQG,OAAS,GAAKyqC,EAAKoc,SAASpc,EAAKvzB,KAAO0sC,EAAM1sC,MAC9DhX,EAAI,GAEDA,EAAIyE,EAAM9E,QAAQG,OAAQE,IAC7BL,EAAQgB,KAAK8D,EAAM9E,QAAQK,IAC/B,OAAO,IAAIsmD,EAAS3mD,EAASH,KAAKiR,KAAOhM,EAAMgM,KACnD,CAIAm2C,IAAIr4C,EAAM+3B,EAAK9mC,KAAKiR,MAChB,GAAY,GAARlC,GAAa+3B,GAAM9mC,KAAKiR,KACxB,OAAOjR,KACX,IAAI4F,EAAS,GAAIqL,EAAO,EACxB,GAAI61B,EAAK/3B,EACL,IAAK,IAAIvO,EAAI,EAAG8lB,EAAM,EAAGA,EAAMwgB,EAAItmC,IAAK,CACpC,IAAIsyB,EAAQ9yB,KAAKG,QAAQK,GAAIoO,EAAM0X,EAAMwM,EAAMohB,SAC3CtlC,EAAMG,KACFuX,EAAMvX,GAAQH,EAAMk4B,KAEhBhU,EADAA,EAAM6I,OACE7I,EAAMs0B,IAAI9iD,KAAKC,IAAI,EAAGwK,EAAOuX,GAAMhiB,KAAKG,IAAIquB,EAAMtb,KAAKlX,OAAQwmC,EAAKxgB,IAEpEwM,EAAMs0B,IAAI9iD,KAAKC,IAAI,EAAGwK,EAAOuX,EAAM,GAAIhiB,KAAKG,IAAIquB,EAAM3yB,QAAQ8Q,KAAM61B,EAAKxgB,EAAM,KAE/F1gB,EAAOzE,KAAK2xB,GACZ7hB,GAAQ6hB,EAAMohB,UAElB5tB,EAAM1X,CACV,CACJ,OAAO,IAAIk4C,EAASlhD,EAAQqL,EAChC,CAIAo2C,WAAWt4C,EAAM+3B,GACb,OAAI/3B,GAAQ+3B,EACDggB,EAAS/f,MACR,GAARh4B,GAAa+3B,GAAM9mC,KAAKG,QAAQG,OACzBN,KACJ,IAAI8mD,EAAS9mD,KAAKG,QAAQmF,MAAMyJ,EAAM+3B,GACjD,CAKAhF,aAAavzB,EAAOJ,GAChB,IAAIiI,EAAUpW,KAAKG,QAAQoO,GAC3B,GAAI6H,GAAWjI,EACX,OAAOnO,KACX,IAAIkD,EAAOlD,KAAKG,QAAQmF,QACpB2L,EAAOjR,KAAKiR,KAAO9C,EAAK+lC,SAAW99B,EAAQ89B,SAE/C,OADAhxC,EAAKqL,GAASJ,EACP,IAAI24C,EAAS5jD,EAAM+N,EAC9B,CAKA60C,WAAW33C,GACP,OAAO,IAAI24C,EAAS,CAAC34C,GAAM9N,OAAOL,KAAKG,SAAUH,KAAKiR,KAAO9C,EAAK+lC,SACtE,CAKA6R,SAAS53C,GACL,OAAO,IAAI24C,EAAS9mD,KAAKG,QAAQE,OAAO8N,GAAOnO,KAAKiR,KAAO9C,EAAK+lC,SACpE,CAIAtF,GAAG3pC,GACC,GAAIjF,KAAKG,QAAQG,QAAU2E,EAAM9E,QAAQG,OACrC,OAAO,EACX,IAAK,IAAIE,EAAI,EAAGA,EAAIR,KAAKG,QAAQG,OAAQE,IACrC,IAAKR,KAAKG,QAAQK,GAAGouC,GAAG3pC,EAAM9E,QAAQK,IAClC,OAAO,EACf,OAAO,CACX,CAIIy1C,iBAAe,OAAOj2C,KAAKG,QAAQG,OAASN,KAAKG,QAAQ,GAAK,IAAM,CAIpE0yC,gBAAc,OAAO7yC,KAAKG,QAAQG,OAASN,KAAKG,QAAQH,KAAKG,QAAQG,OAAS,GAAK,IAAM,CAIzFsyC,iBAAe,OAAO5yC,KAAKG,QAAQG,MAAQ,CAK/CwyB,MAAMvkB,GACF,IAAIq3C,EAAQ5lD,KAAKG,QAAQoO,GACzB,IAAKq3C,EACD,MAAM,IAAI0B,WAAW,SAAW/4C,EAAQ,qBAAuBvO,MACnE,OAAO4lD,CACX,CAIA3I,WAAW1uC,GACP,OAAOvO,KAAKG,QAAQoO,IAAU,IAClC,CAKAf,QAAQwwB,GACJ,IAAK,IAAIx9B,EAAI,EAAGi8B,EAAI,EAAGj8B,EAAIR,KAAKG,QAAQG,OAAQE,IAAK,CACjD,IAAIsyB,EAAQ9yB,KAAKG,QAAQK,GACzBw9B,EAAElL,EAAO2J,EAAGj8B,GACZi8B,GAAK3J,EAAMohB,QACf,CACJ,CAKAiS,cAAclhD,EAAOqhB,EAAM,GACvB,OAAO6/B,EAAcnmD,KAAMiF,EAAOqhB,EACtC,CAOAigC,YAAYthD,EAAOqhB,EAAMtmB,KAAKiR,KAAMs2C,EAAWtiD,EAAMgM,MACjD,OAAOs1C,EAAYvmD,KAAMiF,EAAOqhB,EAAKihC,EACzC,CAMAC,UAAUlhC,EAAKmhC,GAAQ,GACnB,GAAW,GAAPnhC,EACA,OAAOohC,EAAS,EAAGphC,GACvB,GAAIA,GAAOtmB,KAAKiR,KACZ,OAAOy2C,EAAS1nD,KAAKG,QAAQG,OAAQgmB,GACzC,GAAIA,EAAMtmB,KAAKiR,MAAQqV,EAAM,EACzB,MAAM,IAAIghC,WAAW,YAAYhhC,0BAA4BtmB,SACjE,IAAK,IAAIQ,EAAI,EAAGmnD,EAAS,GAAInnD,IAAK,CAC9B,IAAyBoO,EAAM+4C,EAArB3nD,KAAK8yB,MAAMtyB,GAAuB0zC,SAC5C,GAAItlC,GAAO0X,EACP,OAAI1X,GAAO0X,GAAOmhC,EAAQ,EACfC,EAASlnD,EAAI,EAAGoO,GACpB84C,EAASlnD,EAAGmnD,GAEvBA,EAAS/4C,CACb,CACJ,CAIA7O,WAAa,MAAO,IAAMC,KAAK4nD,gBAAkB,GAAK,CAItDA,gBAAkB,OAAO5nD,KAAKG,QAAQI,KAAK,KAAO,CAIlD8lC,SACI,OAAOrmC,KAAKG,QAAQG,OAASN,KAAKG,QAAQF,KAAI26B,GAAKA,EAAEyL,WAAY,IACrE,CAIA5K,gBAAgBI,EAAQj5B,GACpB,IAAKA,EACD,OAAOkkD,EAAS/f,MACpB,IAAKjlC,MAAMF,QAAQgB,GACf,MAAM,IAAI0kD,WAAW,uCACzB,OAAO,IAAIR,EAASlkD,EAAM3C,IAAI47B,EAAOgsB,cACzC,CAKApsB,iBAAiBuO,GACb,IAAKA,EAAM1pC,OACP,OAAOwmD,EAAS/f,MACpB,IAAI3R,EAAQnkB,EAAO,EACnB,IAAK,IAAIzQ,EAAI,EAAGA,EAAIwpC,EAAM1pC,OAAQE,IAAK,CACnC,IAAI2N,EAAO67B,EAAMxpC,GACjByQ,GAAQ9C,EAAK+lC,SACT1zC,GAAK2N,EAAKwtB,QAAUqO,EAAMxpC,EAAI,GAAG8lD,WAAWn4C,IACvCinB,IACDA,EAAS4U,EAAM1kC,MAAM,EAAG9E,IAC5B40B,EAAOA,EAAO90B,OAAS,GAAK6N,EACvBg5C,SAAS/xB,EAAOA,EAAO90B,OAAS,GAAGkX,KAAOrJ,EAAKqJ,OAE/C4d,GACLA,EAAOj0B,KAAKgN,EAEpB,CACA,OAAO,IAAI24C,EAAS1xB,GAAU4U,EAAO/4B,EACzC,CAOAwqB,YAAYK,GACR,IAAKA,EACD,OAAOgrB,EAAS/f,MACpB,GAAIjL,aAAiBgrB,EACjB,OAAOhrB,EACX,GAAIh6B,MAAMF,QAAQk6B,GACd,OAAO97B,KAAK8nD,UAAUhsB,GAC1B,GAAIA,EAAMN,MACN,OAAO,IAAIsrB,EAAS,CAAChrB,GAAQA,EAAMoY,UACvC,MAAM,IAAIoT,WAAW,mBAAqBxrB,EAAQ,kBAC7CA,EAAMmY,aAAe,mEAAqE,IACnG,EAOJ6S,EAAS/f,MAAQ,IAAI+f,EAAS,GAAI,GAClC,MAAMlB,EAAQ,CAAEr3C,MAAO,EAAGuF,OAAQ,GAClC,SAAS4zC,EAASn5C,EAAOuF,GAGrB,OAFA8xC,EAAMr3C,MAAQA,EACdq3C,EAAM9xC,OAASA,EACR8xC,CACX,CAEA,SAASmC,EAAY91B,EAAGC,GACpB,GAAID,IAAMC,EACN,OAAO,EACX,IAAMD,GAAiB,iBAALA,IACZC,GAAiB,iBAALA,EACd,OAAO,EACX,IAAI8X,EAAQloC,MAAMF,QAAQqwB,GAC1B,GAAInwB,MAAMF,QAAQswB,IAAM8X,EACpB,OAAO,EACX,GAAIA,EAAO,CACP,GAAI/X,EAAE3xB,QAAU4xB,EAAE5xB,OACd,OAAO,EACX,IAAK,IAAIE,EAAI,EAAGA,EAAIyxB,EAAE3xB,OAAQE,IAC1B,IAAKunD,EAAY91B,EAAEzxB,GAAI0xB,EAAE1xB,IACrB,OAAO,CACnB,KACK,CACD,IAAK,IAAIi8B,KAAKxK,EACV,KAAMwK,KAAKvK,KAAO61B,EAAY91B,EAAEwK,GAAIvK,EAAEuK,IAClC,OAAO,EACf,IAAK,IAAIA,KAAKvK,EACV,KAAMuK,KAAKxK,GACP,OAAO,CACnB,CACA,OAAO,CACX,CAUA,MAAM+1B,EAIF3lD,YAIAwC,EAIA22B,GACIx7B,KAAK6E,KAAOA,EACZ7E,KAAKw7B,MAAQA,CACjB,CAQAe,SAAS9zB,GACL,IAAIvF,EAAM+kD,GAAS,EACnB,IAAK,IAAIznD,EAAI,EAAGA,EAAIiI,EAAInI,OAAQE,IAAK,CACjC,IAAIyE,EAAQwD,EAAIjI,GAChB,GAAIR,KAAK4uC,GAAG3pC,GACR,OAAOwD,EACX,GAAIzI,KAAK6E,KAAKqjD,SAASjjD,EAAMJ,MACpB3B,IACDA,EAAOuF,EAAInD,MAAM,EAAG9E,QAEvB,IAAIyE,EAAMJ,KAAKqjD,SAASloD,KAAK6E,MAC9B,OAAO4D,GAGFw/C,GAAUhjD,EAAMJ,KAAKyrB,KAAOtwB,KAAK6E,KAAKyrB,OAClCptB,IACDA,EAAOuF,EAAInD,MAAM,EAAG9E,IACxB0C,EAAK/B,KAAKnB,MACVioD,GAAS,GAET/kD,GACAA,EAAK/B,KAAK8D,EAClB,CACJ,CAKA,OAJK/B,IACDA,EAAOuF,EAAInD,SACV2iD,GACD/kD,EAAK/B,KAAKnB,MACPkD,CACX,CAKAs5B,cAAc/zB,GACV,IAAK,IAAIjI,EAAI,EAAGA,EAAIiI,EAAInI,OAAQE,IAC5B,GAAIR,KAAK4uC,GAAGnmC,EAAIjI,IACZ,OAAOiI,EAAInD,MAAM,EAAG9E,GAAGH,OAAOoI,EAAInD,MAAM9E,EAAI,IACpD,OAAOiI,CACX,CAIA41B,QAAQ51B,GACJ,IAAK,IAAIjI,EAAI,EAAGA,EAAIiI,EAAInI,OAAQE,IAC5B,GAAIR,KAAK4uC,GAAGnmC,EAAIjI,IACZ,OAAO,EACf,OAAO,CACX,CAKAouC,GAAG3pC,GACC,OAAOjF,MAAQiF,GACVjF,KAAK6E,MAAQI,EAAMJ,MAAQkjD,EAAY/nD,KAAKw7B,MAAOv2B,EAAMu2B,MAClE,CAIA6K,SACI,IAAIpkC,EAAM,CAAE4C,KAAM7E,KAAK6E,KAAKpC,MAC5B,IAAK,IAAIsX,KAAK/Z,KAAKw7B,MAAO,CACtBv5B,EAAIu5B,MAAQx7B,KAAKw7B,MACjB,KACJ,CACA,OAAOv5B,CACX,CAIAw5B,gBAAgBI,EAAQssB,GACpB,IAAKA,EACD,MAAM,IAAIb,WAAW,mCACzB,IAAIziD,EAAOg3B,EAAOD,MAAMusB,EAAKtjD,MAC7B,IAAKA,EACD,MAAM,IAAIyiD,WAAW,yBAAyBa,EAAKtjD,uBACvD,OAAOA,EAAKmW,OAAOmtC,EAAK3sB,MAC5B,CAIAC,eAAexJ,EAAGC,GACd,GAAID,GAAKC,EACL,OAAO,EACX,GAAID,EAAE3xB,QAAU4xB,EAAE5xB,OACd,OAAO,EACX,IAAK,IAAIE,EAAI,EAAGA,EAAIyxB,EAAE3xB,OAAQE,IAC1B,IAAKyxB,EAAEzxB,GAAGouC,GAAG1c,EAAE1xB,IACX,OAAO,EACf,OAAO,CACX,CAKAi7B,eAAeG,GACX,IAAKA,GAAS95B,MAAMF,QAAQg6B,IAA0B,GAAhBA,EAAMt7B,OACxC,OAAO0nD,EAAKh7B,KAChB,GAAI4O,aAAiBosB,EACjB,MAAO,CAACpsB,GACZ,IAAI14B,EAAO04B,EAAMt2B,QAEjB,OADApC,EAAKkwB,MAAK,CAACnB,EAAGC,IAAMD,EAAEptB,KAAKyrB,KAAO4B,EAAErtB,KAAKyrB,OAClCptB,CACX,EAKJ8kD,EAAKh7B,KAAO,GAMZ,MAAMo7B,UAAqBrgD,OAkB3B,MAAMsgD,EAaFhmD,YAIAlC,EAIAmoD,EAIAC,GACIvoD,KAAKG,QAAUA,EACfH,KAAKsoD,UAAYA,EACjBtoD,KAAKuoD,QAAUA,CACnB,CAIIt3C,WACA,OAAOjR,KAAKG,QAAQ8Q,KAAOjR,KAAKsoD,UAAYtoD,KAAKuoD,OACrD,CAIAC,SAASliC,EAAK4D,GACV,IAAI/pB,EAAUsoD,EAAWzoD,KAAKG,QAASmmB,EAAMtmB,KAAKsoD,UAAWp+B,GAC7D,OAAO/pB,GAAW,IAAIkoD,EAAMloD,EAASH,KAAKsoD,UAAWtoD,KAAKuoD,QAC9D,CAIAG,cAAc35C,EAAM+3B,GAChB,OAAO,IAAIuhB,EAAMM,EAAY3oD,KAAKG,QAAS4O,EAAO/O,KAAKsoD,UAAWxhB,EAAK9mC,KAAKsoD,WAAYtoD,KAAKsoD,UAAWtoD,KAAKuoD,QACjH,CAIA3Z,GAAG3pC,GACC,OAAOjF,KAAKG,QAAQyuC,GAAG3pC,EAAM9E,UAAYH,KAAKsoD,WAAarjD,EAAMqjD,WAAatoD,KAAKuoD,SAAWtjD,EAAMsjD,OACxG,CAIAxoD,WACI,OAAOC,KAAKG,QAAU,IAAMH,KAAKsoD,UAAY,IAAMtoD,KAAKuoD,QAAU,GACtE,CAIAliB,SACI,IAAKrmC,KAAKG,QAAQ8Q,KACd,OAAO,KACX,IAAIk3C,EAAO,CAAEhoD,QAASH,KAAKG,QAAQkmC,UAKnC,OAJIrmC,KAAKsoD,UAAY,IACjBH,EAAKG,UAAYtoD,KAAKsoD,WACtBtoD,KAAKuoD,QAAU,IACfJ,EAAKI,QAAUvoD,KAAKuoD,SACjBJ,CACX,CAIA1sB,gBAAgBI,EAAQssB,GACpB,IAAKA,EACD,OAAOE,EAAMthB,MACjB,IAAIuhB,EAAYH,EAAKG,WAAa,EAAGC,EAAUJ,EAAKI,SAAW,EAC/D,GAAwB,iBAAbD,GAA2C,iBAAXC,EACvC,MAAM,IAAIjB,WAAW,oCACzB,OAAO,IAAIe,EAAMvB,EAAS8B,SAAS/sB,EAAQssB,EAAKhoD,SAAUmoD,EAAWC,EACzE,CAKA9sB,eAAevR,EAAU2+B,GAAgB,GACrC,IAAIP,EAAY,EAAGC,EAAU,EAC7B,IAAK,IAAI3tB,EAAI1Q,EAAS+rB,WAAYrb,IAAMA,EAAEssB,SAAW2B,IAAkBjuB,EAAE/1B,KAAKo3B,KAAKua,WAAY5b,EAAIA,EAAEqb,WACjGqS,IACJ,IAAK,IAAI1tB,EAAI1Q,EAAS2oB,UAAWjY,IAAMA,EAAEssB,SAAW2B,IAAkBjuB,EAAE/1B,KAAKo3B,KAAKua,WAAY5b,EAAIA,EAAEiY,UAChG0V,IACJ,OAAO,IAAIF,EAAMn+B,EAAUo+B,EAAWC,EAC1C,EAMJ,SAASI,EAAYxoD,EAAS4O,EAAM+3B,GAChC,IAAI,MAAEv4B,EAAK,OAAEuF,GAAW3T,EAAQqnD,UAAUz4C,GAAO+jB,EAAQ3yB,EAAQ88C,WAAW1uC,IACtEA,MAAOu6C,EAASh1C,OAAQi1C,GAAa5oD,EAAQqnD,UAAU1gB,GAC7D,GAAIhzB,GAAU/E,GAAQ+jB,EAAM6I,OAAQ,CAChC,GAAIotB,GAAYjiB,IAAO3mC,EAAQ2yB,MAAMg2B,GAASntB,OAC1C,MAAM,IAAI2rB,WAAW,2BACzB,OAAOnnD,EAAQinD,IAAI,EAAGr4C,GAAMy3B,OAAOrmC,EAAQinD,IAAItgB,GACnD,CACA,GAAIv4B,GAASu6C,EACT,MAAM,IAAIxB,WAAW,2BACzB,OAAOnnD,EAAQ2hC,aAAavzB,EAAOukB,EAAM5vB,KAAKylD,EAAY71B,EAAM3yB,QAAS4O,EAAO+E,EAAS,EAAGgzB,EAAKhzB,EAAS,IAC9G,CACA,SAAS20C,EAAWtoD,EAAS6oD,EAAMhZ,EAAQvf,GACvC,IAAI,MAAEliB,EAAK,OAAEuF,GAAW3T,EAAQqnD,UAAUwB,GAAOl2B,EAAQ3yB,EAAQ88C,WAAW1uC,GAC5E,GAAIuF,GAAUk1C,GAAQl2B,EAAM6I,OACxB,OAAIlL,IAAWA,EAAO0nB,WAAW5pC,EAAOA,EAAOyhC,GACpC,KACJ7vC,EAAQinD,IAAI,EAAG4B,GAAMxiB,OAAOwJ,GAAQxJ,OAAOrmC,EAAQinD,IAAI4B,IAElE,IAAIthB,EAAQ+gB,EAAW31B,EAAM3yB,QAAS6oD,EAAOl1C,EAAS,EAAGk8B,GACzD,OAAOtI,GAASvnC,EAAQ2hC,aAAavzB,EAAOukB,EAAM5vB,KAAKwkC,GAC3D,CACA,SAASviC,EAAQ6vC,EAAOyC,EAAKnyC,GACzB,GAAIA,EAAMgjD,UAAYtT,EAAM1rB,MACxB,MAAM,IAAI8+B,EAAa,mDAC3B,GAAIpT,EAAM1rB,MAAQhkB,EAAMgjD,WAAa7Q,EAAInuB,MAAQhkB,EAAMijD,QACnD,MAAM,IAAIH,EAAa,4BAC3B,OAAOa,EAAajU,EAAOyC,EAAKnyC,EAAO,EAC3C,CACA,SAAS2jD,EAAajU,EAAOyC,EAAKnyC,EAAOgkB,GACrC,IAAI/a,EAAQymC,EAAMzmC,MAAM+a,GAAQnb,EAAO6mC,EAAM7mC,KAAKmb,GAClD,GAAI/a,GAASkpC,EAAIlpC,MAAM+a,IAAUA,EAAQ0rB,EAAM1rB,MAAQhkB,EAAMgjD,UAAW,CACpE,IAAI5gB,EAAQuhB,EAAajU,EAAOyC,EAAKnyC,EAAOgkB,EAAQ,GACpD,OAAOnb,EAAKjL,KAAKiL,EAAKhO,QAAQ2hC,aAAavzB,EAAOm5B,GACtD,CACK,GAAKpiC,EAAMnF,QAAQ8Q,KAGnB,IAAK3L,EAAMgjD,WAAchjD,EAAMijD,SAAWvT,EAAM1rB,OAASA,GAASmuB,EAAInuB,OAASA,EAI/E,CACD,IAAI,MAAE7a,EAAK,IAAEG,GAuErB,SAAgCtJ,EAAO4jD,GACnC,IAAIC,EAAQD,EAAO5/B,MAAQhkB,EAAMgjD,UAC7Bn6C,EADiD+6C,EAAO/6C,KAAKg7C,GAC/CjmD,KAAKoC,EAAMnF,SAC7B,IAAK,IAAIK,EAAI2oD,EAAQ,EAAG3oD,GAAK,EAAGA,IAC5B2N,EAAO+6C,EAAO/6C,KAAK3N,GAAG0C,KAAK4jD,EAAS/3C,KAAKZ,IAC7C,MAAO,CAAEM,MAAON,EAAKi7C,eAAe9jD,EAAMgjD,UAAYa,GAClDv6C,IAAKT,EAAKi7C,eAAej7C,EAAKhO,QAAQ8Q,KAAO3L,EAAMijD,QAAUY,GACrE,CA9E6BE,CAAuB/jD,EAAO0vC,GACnD,OAAO,EAAM7mC,EAAMm7C,EAAgBtU,EAAOvmC,EAAOG,EAAK6oC,EAAKnuB,GAC/D,CAP2F,CACvF,IAAImH,EAASukB,EAAMvkB,OAAQtwB,EAAUswB,EAAOtwB,QAC5C,OAAO,EAAMswB,EAAQtwB,EAAQinD,IAAI,EAAGpS,EAAMC,cAAczO,OAAOlhC,EAAMnF,SAASqmC,OAAOrmC,EAAQinD,IAAI3P,EAAIxC,eACzG,CAIA,CATI,OAAO,EAAM9mC,EAAMo7C,EAAcvU,EAAOyC,EAAKnuB,GAUrD,CACA,SAASkgC,EAAUlwC,EAAMmwC,GACrB,IAAKA,EAAI5kD,KAAK88C,kBAAkBroC,EAAKzU,MACjC,MAAM,IAAIujD,EAAa,eAAiBqB,EAAI5kD,KAAKpC,KAAO,SAAW6W,EAAKzU,KAAKpC,KACrF,CACA,SAASinD,EAASC,EAASC,EAAQtgC,GAC/B,IAAInb,EAAOw7C,EAAQx7C,KAAKmb,GAExB,OADAkgC,EAAUr7C,EAAMy7C,EAAOz7C,KAAKmb,IACrBnb,CACX,CACA,SAAS6nC,EAAQljB,EAAOvwB,GACpB,IAAIwoC,EAAOxoC,EAAOjC,OAAS,EACvByqC,GAAQ,GAAKjY,EAAM6I,QAAU7I,EAAMwzB,WAAW/jD,EAAOwoC,IACrDxoC,EAAOwoC,GAAQjY,EAAMq0B,SAAS5kD,EAAOwoC,GAAMvzB,KAAOsb,EAAMtb,MAExDjV,EAAOpB,KAAK2xB,EACpB,CACA,SAAS+2B,EAAShZ,EAAQiZ,EAAMxgC,EAAO/mB,GACnC,IAAI4L,GAAQ27C,GAAQjZ,GAAQ1iC,KAAKmb,GAC7B7P,EAAa,EAAGE,EAAWmwC,EAAOA,EAAKv7C,MAAM+a,GAASnb,EAAKykC,WAC3D/B,IACAp3B,EAAao3B,EAAOtiC,MAAM+a,GACtBunB,EAAOvnB,MAAQA,EACf7P,IAEKo3B,EAAOkZ,aACZ/T,EAAQnF,EAAOkH,UAAWx1C,GAC1BkX,MAGR,IAAK,IAAIjZ,EAAIiZ,EAAYjZ,EAAImZ,EAAUnZ,IACnCw1C,EAAQ7nC,EAAK2kB,MAAMtyB,GAAI+B,GACvBunD,GAAQA,EAAKxgC,OAASA,GAASwgC,EAAKC,YACpC/T,EAAQ8T,EAAKnZ,WAAYpuC,EACjC,CACA,SAAS,EAAM4L,EAAMhO,GAEjB,OADAgO,EAAKtJ,KAAKmlD,aAAa7pD,GAChBgO,EAAKjL,KAAK/C,EACrB,CACA,SAASmpD,EAAgBtU,EAAOnE,EAAQiZ,EAAMrS,EAAKnuB,GAC/C,IAAIg/B,EAAYtT,EAAM1rB,MAAQA,GAASogC,EAAS1U,EAAOnE,EAAQvnB,EAAQ,GACnEi/B,EAAU9Q,EAAInuB,MAAQA,GAASogC,EAASI,EAAMrS,EAAKnuB,EAAQ,GAC3DnpB,EAAU,GAcd,OAbA0pD,EAAS,KAAM7U,EAAO1rB,EAAOnpB,GACzBmoD,GAAaC,GAAW1X,EAAOtiC,MAAM+a,IAAUwgC,EAAKv7C,MAAM+a,IAC1DkgC,EAAUlB,EAAWC,GACrBvS,EAAQ,EAAMsS,EAAWgB,EAAgBtU,EAAOnE,EAAQiZ,EAAMrS,EAAKnuB,EAAQ,IAAKnpB,KAG5EmoD,GACAtS,EAAQ,EAAMsS,EAAWiB,EAAcvU,EAAOnE,EAAQvnB,EAAQ,IAAKnpB,GACvE0pD,EAAShZ,EAAQiZ,EAAMxgC,EAAOnpB,GAC1BooD,GACAvS,EAAQ,EAAMuS,EAASgB,EAAcO,EAAMrS,EAAKnuB,EAAQ,IAAKnpB,IAErE0pD,EAASpS,EAAK,KAAMnuB,EAAOnpB,GACpB,IAAI2mD,EAAS3mD,EACxB,CACA,SAASopD,EAAcvU,EAAOyC,EAAKnuB,GAC/B,IAAInpB,EAAU,GAOd,OANA0pD,EAAS,KAAM7U,EAAO1rB,EAAOnpB,GACzB60C,EAAM1rB,MAAQA,GAEd0sB,EAAQ,EADG0T,EAAS1U,EAAOyC,EAAKnuB,EAAQ,GACpBigC,EAAcvU,EAAOyC,EAAKnuB,EAAQ,IAAKnpB,GAE/D0pD,EAASpS,EAAK,KAAMnuB,EAAOnpB,GACpB,IAAI2mD,EAAS3mD,EACxB,CAlHAkoD,EAAMthB,MAAQ,IAAIshB,EAAMvB,EAAS/f,MAAO,EAAG,GAsI3C,MAAMkjB,EAIF5nD,YAIAikB,EAIAmO,EAIAwgB,GACIj1C,KAAKsmB,IAAMA,EACXtmB,KAAKy0B,KAAOA,EACZz0B,KAAKi1C,aAAeA,EACpBj1C,KAAKspB,MAAQmL,EAAKn0B,OAAS,EAAI,CACnC,CAIA4pD,aAAaC,GACT,OAAW,MAAPA,EACOnqD,KAAKspB,MACZ6gC,EAAM,EACCnqD,KAAKspB,MAAQ6gC,EACjBA,CACX,CAMI15B,aAAW,OAAOzwB,KAAKmO,KAAKnO,KAAKspB,MAAQ,CAIzCmD,UAAQ,OAAOzsB,KAAKmO,KAAK,EAAI,CAKjCA,KAAKmb,GAAS,OAAOtpB,KAAKy0B,KAAgC,EAA3Bz0B,KAAKkqD,aAAa5gC,GAAa,CAM9D/a,MAAM+a,GAAS,OAAOtpB,KAAKy0B,KAAgC,EAA3Bz0B,KAAKkqD,aAAa5gC,GAAa,EAAI,CAKnEynB,WAAWznB,GAEP,OADAA,EAAQtpB,KAAKkqD,aAAa5gC,GACnBtpB,KAAKuO,MAAM+a,IAAUA,GAAStpB,KAAKspB,OAAUtpB,KAAK+pD,WAAiB,EAAJ,EAC1E,CAKAt7C,MAAM6a,GAEF,OAAgB,IADhBA,EAAQtpB,KAAKkqD,aAAa5gC,IACN,EAAItpB,KAAKy0B,KAAa,EAARnL,EAAY,GAAK,CACvD,CAKA1a,IAAI0a,GAEA,OADAA,EAAQtpB,KAAKkqD,aAAa5gC,GACnBtpB,KAAKyO,MAAM6a,GAAStpB,KAAKmO,KAAKmb,GAAOnpB,QAAQ8Q,IACxD,CAMAvB,OAAO4Z,GAEH,KADAA,EAAQtpB,KAAKkqD,aAAa5gC,IAEtB,MAAM,IAAIg+B,WAAW,kDACzB,OAAOh+B,GAAStpB,KAAKspB,MAAQ,EAAItpB,KAAKsmB,IAAMtmB,KAAKy0B,KAAa,EAARnL,EAAY,EACtE,CAKApN,MAAMoN,GAEF,KADAA,EAAQtpB,KAAKkqD,aAAa5gC,IAEtB,MAAM,IAAIg+B,WAAW,iDACzB,OAAOh+B,GAAStpB,KAAKspB,MAAQ,EAAItpB,KAAKsmB,IAAMtmB,KAAKy0B,KAAa,EAARnL,EAAY,GAAKtpB,KAAKy0B,KAAa,EAARnL,GAAW4qB,QAChG,CAMI6V,iBAAe,OAAO/pD,KAAKsmB,IAAMtmB,KAAKy0B,KAAKz0B,KAAKy0B,KAAKn0B,OAAS,EAAI,CAMlEy3C,gBACA,IAAItnB,EAASzwB,KAAKywB,OAAQliB,EAAQvO,KAAKuO,MAAMvO,KAAKspB,OAClD,GAAI/a,GAASkiB,EAAOmiB,WAChB,OAAO,KACX,IAAIwX,EAAOpqD,KAAKsmB,IAAMtmB,KAAKy0B,KAAKz0B,KAAKy0B,KAAKn0B,OAAS,GAAIwyB,EAAQrC,EAAOqC,MAAMvkB,GAC5E,OAAO67C,EAAO35B,EAAOqC,MAAMvkB,GAAO64C,IAAIgD,GAAQt3B,CAClD,CAMI6d,iBACA,IAAIpiC,EAAQvO,KAAKuO,MAAMvO,KAAKspB,OACxB8gC,EAAOpqD,KAAKsmB,IAAMtmB,KAAKy0B,KAAKz0B,KAAKy0B,KAAKn0B,OAAS,GACnD,OAAI8pD,EACOpqD,KAAKywB,OAAOqC,MAAMvkB,GAAO64C,IAAI,EAAGgD,GAC3B,GAAT77C,EAAa,KAAOvO,KAAKywB,OAAOqC,MAAMvkB,EAAQ,EACzD,CAKA87C,WAAW97C,EAAO+a,GACdA,EAAQtpB,KAAKkqD,aAAa5gC,GAC1B,IAAInb,EAAOnO,KAAKy0B,KAAa,EAARnL,GAAYhD,EAAe,GAATgD,EAAa,EAAItpB,KAAKy0B,KAAa,EAARnL,EAAY,GAAK,EACnF,IAAK,IAAI9oB,EAAI,EAAGA,EAAI+N,EAAO/N,IACvB8lB,GAAOnY,EAAK2kB,MAAMtyB,GAAG0zC,SACzB,OAAO5tB,CACX,CAOAsV,QACI,IAAInL,EAASzwB,KAAKywB,OAAQliB,EAAQvO,KAAKuO,QAEvC,GAA2B,GAAvBkiB,EAAOtwB,QAAQ8Q,KACf,OAAO+2C,EAAKh7B,KAEhB,GAAIhtB,KAAK+pD,WACL,OAAOt5B,EAAOqC,MAAMvkB,GAAOqtB,MAC/B,IAAItiB,EAAOmX,EAAOwsB,WAAW1uC,EAAQ,GAAItJ,EAAQwrB,EAAOwsB,WAAW1uC,GAGnE,IAAK+K,EAAM,CACP,IAAIgxC,EAAMhxC,EACVA,EAAOrU,EACPA,EAAQqlD,CACZ,CAGA,IAAI1uB,EAAQtiB,EAAKsiB,MACjB,IAAK,IAAIp7B,EAAI,EAAGA,EAAIo7B,EAAMt7B,OAAQE,KACO,IAAjCo7B,EAAMp7B,GAAGqE,KAAKo3B,KAAK6W,WAAyB7tC,GAAU22B,EAAMp7B,GAAG69B,QAAQp5B,EAAM22B,SAC7EA,EAAQA,EAAMp7B,KAAKg8B,cAAcZ,IACzC,OAAOA,CACX,CASA2uB,YAAYT,GACR,IAAI5tC,EAAQlc,KAAKywB,OAAOwsB,WAAWj9C,KAAKuO,SACxC,IAAK2N,IAAUA,EAAMw6B,SACjB,OAAO,KACX,IAAI9a,EAAQ1f,EAAM0f,MAAO7pB,EAAO+3C,EAAKr5B,OAAOwsB,WAAW6M,EAAKv7C,SAC5D,IAAK,IAAI/N,EAAI,EAAGA,EAAIo7B,EAAMt7B,OAAQE,KACO,IAAjCo7B,EAAMp7B,GAAGqE,KAAKo3B,KAAK6W,WAAyB/gC,GAAS6pB,EAAMp7B,GAAG69B,QAAQtsB,EAAK6pB,SAC3EA,EAAQA,EAAMp7B,KAAKg8B,cAAcZ,IACzC,OAAOA,CACX,CAKA4uB,YAAYlkC,GACR,IAAK,IAAIgD,EAAQtpB,KAAKspB,MAAOA,EAAQ,EAAGA,IACpC,GAAItpB,KAAKyO,MAAM6a,IAAUhD,GAAOtmB,KAAK4O,IAAI0a,IAAUhD,EAC/C,OAAOgD,EACf,OAAO,CACX,CAUAmnB,WAAWxrC,EAAQjF,KAAMyqD,GACrB,GAAIxlD,EAAMqhB,IAAMtmB,KAAKsmB,IACjB,OAAOrhB,EAAMwrC,WAAWzwC,MAC5B,IAAK,IAAIqsB,EAAIrsB,KAAKspB,OAAStpB,KAAKywB,OAAO2pB,eAAiBp6C,KAAKsmB,KAAOrhB,EAAMqhB,IAAM,EAAI,GAAI+F,GAAK,EAAGA,IAC5F,GAAIpnB,EAAMqhB,KAAOtmB,KAAK4O,IAAIyd,MAAQo+B,GAAQA,EAAKzqD,KAAKmO,KAAKke,KACrD,OAAO,IAAIq+B,EAAU1qD,KAAMiF,EAAOonB,GAC1C,OAAO,IACX,CAIAksB,WAAWtzC,GACP,OAAOjF,KAAKsmB,IAAMtmB,KAAKi1C,cAAgBhwC,EAAMqhB,IAAMrhB,EAAMgwC,YAC7D,CAIA1wC,IAAIU,GACA,OAAOA,EAAMqhB,IAAMtmB,KAAKsmB,IAAMrhB,EAAQjF,IAC1C,CAIAyE,IAAIQ,GACA,OAAOA,EAAMqhB,IAAMtmB,KAAKsmB,IAAMrhB,EAAQjF,IAC1C,CAIAD,WACI,IAAI4qD,EAAM,GACV,IAAK,IAAInqD,EAAI,EAAGA,GAAKR,KAAKspB,MAAO9oB,IAC7BmqD,IAAQA,EAAM,IAAM,IAAM3qD,KAAKmO,KAAK3N,GAAGqE,KAAKpC,KAAO,IAAMzC,KAAKuO,MAAM/N,EAAI,GAC5E,OAAOmqD,EAAM,IAAM3qD,KAAKi1C,YAC5B,CAIAxZ,eAAehP,EAAKnG,GAChB,KAAMA,GAAO,GAAKA,GAAOmG,EAAItsB,QAAQ8Q,MACjC,MAAM,IAAIq2C,WAAW,YAAchhC,EAAM,iBAC7C,IAAImO,EAAO,GACPhmB,EAAQ,EAAGwmC,EAAe3uB,EAC9B,IAAK,IAAInY,EAAOse,IAAO,CACnB,IAAI,MAAEle,EAAK,OAAEuF,GAAW3F,EAAKhO,QAAQqnD,UAAUvS,GAC3C2V,EAAM3V,EAAenhC,EAEzB,GADA2gB,EAAKtzB,KAAKgN,EAAMI,EAAOE,EAAQqF,IAC1B82C,EACD,MAEJ,GADAz8C,EAAOA,EAAK2kB,MAAMvkB,GACdJ,EAAKwtB,OACL,MACJsZ,EAAe2V,EAAM,EACrBn8C,GAASqF,EAAS,CACtB,CACA,OAAO,IAAIm2C,EAAY3jC,EAAKmO,EAAMwgB,EACtC,CAIAxZ,qBAAqBhP,EAAKnG,GACtB,IAAK,IAAI9lB,EAAI,EAAGA,EAAIqqD,EAAavqD,OAAQE,IAAK,CAC1C,IAAIsqD,EAASD,EAAarqD,GAC1B,GAAIsqD,EAAOxkC,KAAOA,GAAOwkC,EAAOr+B,KAAOA,EACnC,OAAOq+B,CACf,CACA,IAAIllD,EAASilD,EAAaE,GAAmBd,EAAYl/C,QAAQ0hB,EAAKnG,GAEtE,OADAykC,GAAmBA,EAAkB,GAAKC,EACnCplD,CACX,EAEJ,IAAIilD,EAAe,GAAIE,EAAkB,EAAGC,EAAmB,GAK/D,MAAMN,EAMFroD,YAOA2yC,EAKAyC,EAIAnuB,GACItpB,KAAKg1C,MAAQA,EACbh1C,KAAKy3C,IAAMA,EACXz3C,KAAKspB,MAAQA,CACjB,CAII7a,YAAU,OAAOzO,KAAKg1C,MAAMtlC,OAAO1P,KAAKspB,MAAQ,EAAI,CAIpD1a,UAAQ,OAAO5O,KAAKy3C,IAAIv7B,MAAMlc,KAAKspB,MAAQ,EAAI,CAI/CmH,aAAW,OAAOzwB,KAAKg1C,MAAM7mC,KAAKnO,KAAKspB,MAAQ,CAI/C7P,iBAAe,OAAOzZ,KAAKg1C,MAAMzmC,MAAMvO,KAAKspB,MAAQ,CAIpD3P,eAAa,OAAO3Z,KAAKy3C,IAAI1G,WAAW/wC,KAAKspB,MAAQ,EAG7D,MAAM2hC,EAAa5pD,OAAO2Z,OAAO,MAejC,MAAMkwC,EAIF7oD,YAIAwC,EAMA22B,EAEAr7B,EAKAy7B,EAAQosB,EAAKh7B,MACThtB,KAAK6E,KAAOA,EACZ7E,KAAKw7B,MAAQA,EACbx7B,KAAK47B,MAAQA,EACb57B,KAAKG,QAAUA,GAAW2mD,EAAS/f,KACvC,CAQImN,eAAa,OAAOl0C,KAAKknD,OAAS,EAAI,EAAIlnD,KAAKG,QAAQ8Q,IAAM,CAI7D2hC,iBAAe,OAAO5yC,KAAKG,QAAQyyC,UAAY,CAKnD9f,MAAMvkB,GAAS,OAAOvO,KAAKG,QAAQ2yB,MAAMvkB,EAAQ,CAIjD0uC,WAAW1uC,GAAS,OAAOvO,KAAKG,QAAQ88C,WAAW1uC,EAAQ,CAK3Df,QAAQwwB,GAAKh+B,KAAKG,QAAQqN,QAAQwwB,EAAI,CAWtCiW,aAAallC,EAAM+3B,EAAI9I,EAAGmtB,EAAW,GACjCnrD,KAAKG,QAAQ8zC,aAAallC,EAAM+3B,EAAI9I,EAAGmtB,EAAUnrD,KACrD,CAKAu6C,YAAYvc,GACRh+B,KAAKi0C,aAAa,EAAGj0C,KAAKG,QAAQ8Q,KAAM+sB,EAC5C,CAKItc,kBACA,OAAQ1hB,KAAKknD,QAAUlnD,KAAK6E,KAAKo3B,KAAK0a,SAChC32C,KAAK6E,KAAKo3B,KAAK0a,SAAS32C,MACxBA,KAAK+9C,YAAY,EAAG/9C,KAAKG,QAAQ8Q,KAAM,GACjD,CAQA8sC,YAAYhvC,EAAM+3B,EAAIkgB,EAAgBrQ,GAClC,OAAO32C,KAAKG,QAAQ49C,YAAYhvC,EAAM+3B,EAAIkgB,EAAgBrQ,EAC9D,CAKIV,iBAAe,OAAOj2C,KAAKG,QAAQ81C,UAAY,CAK/CpD,gBAAc,OAAO7yC,KAAKG,QAAQ0yC,SAAW,CAIjDjE,GAAG3pC,GACC,OAAOjF,MAAQiF,GAAUjF,KAAKsmD,WAAWrhD,IAAUjF,KAAKG,QAAQyuC,GAAG3pC,EAAM9E,QAC7E,CAKAmmD,WAAWrhD,GACP,OAAOjF,KAAK2iD,UAAU19C,EAAMJ,KAAMI,EAAMu2B,MAAOv2B,EAAM22B,MACzD,CAKA+mB,UAAU99C,EAAM22B,EAAOI,GACnB,OAAO57B,KAAK6E,MAAQA,GAChBkjD,EAAY/nD,KAAKw7B,MAAOA,GAAS32B,EAAKumD,cAAgBH,IACtDjD,EAAKqD,QAAQrrD,KAAK47B,MAAOA,GAASosB,EAAKh7B,KAC/C,CAKA9pB,KAAK/C,EAAU,MACX,OAAIA,GAAWH,KAAKG,QACTH,KACJ,IAAIkrD,EAAKlrD,KAAK6E,KAAM7E,KAAKw7B,MAAOr7B,EAASH,KAAK47B,MACzD,CAKAwX,KAAKxX,GACD,OAAOA,GAAS57B,KAAK47B,MAAQ57B,KAAO,IAAIkrD,EAAKlrD,KAAK6E,KAAM7E,KAAKw7B,MAAOx7B,KAAKG,QAASy7B,EACtF,CAMAwrB,IAAIr4C,EAAM+3B,EAAK9mC,KAAKG,QAAQ8Q,MACxB,OAAY,GAARlC,GAAa+3B,GAAM9mC,KAAKG,QAAQ8Q,KACzBjR,KACJA,KAAKkD,KAAKlD,KAAKG,QAAQinD,IAAIr4C,EAAM+3B,GAC5C,CAKAxhC,MAAMyJ,EAAM+3B,EAAK9mC,KAAKG,QAAQ8Q,KAAMq6C,GAAiB,GACjD,GAAIv8C,GAAQ+3B,EACR,OAAOuhB,EAAMthB,MACjB,IAAIiO,EAAQh1C,KAAK+K,QAAQgE,GAAO0oC,EAAMz3C,KAAK+K,QAAQ+7B,GAC/Cxd,EAAQgiC,EAAiB,EAAItW,EAAMwV,YAAY1jB,GAC/Cr4B,EAAQumC,EAAMvmC,MAAM6a,GACpBnpB,EADmC60C,EAAM7mC,KAAKmb,GAC/BnpB,QAAQinD,IAAIpS,EAAM1uB,IAAM7X,EAAOgpC,EAAInxB,IAAM7X,GAC5D,OAAO,IAAI45C,EAAMloD,EAAS60C,EAAM1rB,MAAQA,EAAOmuB,EAAInuB,MAAQA,EAC/D,CASAnkB,QAAQ4J,EAAM+3B,EAAIxhC,GACd,OAAOH,EAAQnF,KAAK+K,QAAQgE,GAAO/O,KAAK+K,QAAQ+7B,GAAKxhC,EACzD,CAIAimD,OAAOjlC,GACH,IAAK,IAAInY,EAAOnO,OAAQ,CACpB,IAAI,MAAEuO,EAAK,OAAEuF,GAAW3F,EAAKhO,QAAQqnD,UAAUlhC,GAE/C,GADAnY,EAAOA,EAAK8uC,WAAW1uC,IAClBJ,EACD,OAAO,KACX,GAAI2F,GAAUwS,GAAOnY,EAAKwtB,OACtB,OAAOxtB,EACXmY,GAAOxS,EAAS,CACpB,CACJ,CAMA03C,WAAWllC,GACP,IAAI,MAAE/X,EAAK,OAAEuF,GAAW9T,KAAKG,QAAQqnD,UAAUlhC,GAC/C,MAAO,CAAEnY,KAAMnO,KAAKG,QAAQ88C,WAAW1uC,GAAQA,QAAOuF,SAC1D,CAMA23C,YAAYnlC,GACR,GAAW,GAAPA,EACA,MAAO,CAAEnY,KAAM,KAAMI,MAAO,EAAGuF,OAAQ,GAC3C,IAAI,MAAEvF,EAAK,OAAEuF,GAAW9T,KAAKG,QAAQqnD,UAAUlhC,GAC/C,GAAIxS,EAASwS,EACT,MAAO,CAAEnY,KAAMnO,KAAKG,QAAQ2yB,MAAMvkB,GAAQA,QAAOuF,UACrD,IAAI3F,EAAOnO,KAAKG,QAAQ2yB,MAAMvkB,EAAQ,GACtC,MAAO,CAAEJ,OAAMI,MAAOA,EAAQ,EAAGuF,OAAQA,EAAS3F,EAAK+lC,SAC3D,CAKAnpC,QAAQub,GAAO,OAAO2jC,EAAYyB,cAAc1rD,KAAMsmB,EAAM,CAI5D8iC,eAAe9iC,GAAO,OAAO2jC,EAAYl/C,QAAQ/K,KAAMsmB,EAAM,CAK7DktB,aAAazkC,EAAM+3B,EAAIjiC,GACnB,IAAI+gD,GAAQ,EAOZ,OANI9e,EAAK/3B,GACL/O,KAAKi0C,aAAallC,EAAM+3B,GAAI34B,IACpBtJ,EAAKw5B,QAAQlwB,EAAKytB,SAClBgqB,GAAQ,IACJA,KAETA,CACX,CAIItN,cAAY,OAAOt4C,KAAK6E,KAAKyzC,OAAS,CAKtCM,kBAAgB,OAAO54C,KAAK6E,KAAK+zC,WAAa,CAI9CwB,oBAAkB,OAAOp6C,KAAK6E,KAAKu1C,aAAe,CAKlD1D,eAAa,OAAO12C,KAAK6E,KAAK6xC,QAAU,CAIxC/a,aAAW,OAAO37B,KAAK6E,KAAK82B,MAAQ,CAIpCurB,aAAW,OAAOlnD,KAAK6E,KAAKqiD,MAAQ,CAQpCtD,aAAW,OAAO5jD,KAAK6E,KAAK++C,MAAQ,CAKxC7jD,WACI,GAAIC,KAAK6E,KAAKo3B,KAAK0vB,cACf,OAAO3rD,KAAK6E,KAAKo3B,KAAK0vB,cAAc3rD,MACxC,IAAIyC,EAAOzC,KAAK6E,KAAKpC,KAGrB,OAFIzC,KAAKG,QAAQ8Q,OACbxO,GAAQ,IAAMzC,KAAKG,QAAQynD,gBAAkB,KAC1CgE,EAAU5rD,KAAK47B,MAAOn5B,EACjC,CAIAq2C,eAAevqC,GACX,IAAIwd,EAAQ/rB,KAAK6E,KAAKgnD,aAAaC,cAAc9rD,KAAKG,QAAS,EAAGoO,GAClE,IAAKwd,EACD,MAAM,IAAIhkB,MAAM,wDACpB,OAAOgkB,CACX,CAQAosB,WAAWppC,EAAM+3B,EAAI4L,EAAcoU,EAAS/f,MAAOt4B,EAAQ,EAAGG,EAAM8jC,EAAYE,YAC5E,IAAI7kC,EAAM/N,KAAK84C,eAAe/pC,GAAM+8C,cAAcpZ,EAAajkC,EAAOG,GAClEm9C,EAAMh+C,GAAOA,EAAI+9C,cAAc9rD,KAAKG,QAAS2mC,GACjD,IAAKilB,IAAQA,EAAI9J,SACb,OAAO,EACX,IAAK,IAAIzhD,EAAIiO,EAAOjO,EAAIoO,EAAKpO,IACzB,IAAKR,KAAK6E,KAAKmnD,YAAYtZ,EAAY5f,MAAMtyB,GAAGo7B,OAC5C,OAAO,EACf,OAAO,CACX,CAKAkV,eAAe/hC,EAAM+3B,EAAIjiC,EAAM+2B,GAC3B,GAAIA,IAAU57B,KAAK6E,KAAKmnD,YAAYpwB,GAChC,OAAO,EACX,IAAIntB,EAAQzO,KAAK84C,eAAe/pC,GAAMizC,UAAUn9C,GAC5C+J,EAAMH,GAASA,EAAMq9C,cAAc9rD,KAAKG,QAAS2mC,GACrD,QAAOl4B,GAAMA,EAAIqzC,QACrB,CAOAgK,UAAUhnD,GACN,OAAIA,EAAM9E,QAAQ8Q,KACPjR,KAAKm4C,WAAWn4C,KAAK4yC,WAAY5yC,KAAK4yC,WAAY3tC,EAAM9E,SAExDH,KAAK6E,KAAK88C,kBAAkB18C,EAAMJ,KACjD,CAKA2O,QACIxT,KAAK6E,KAAKmlD,aAAahqD,KAAKG,SAC5B,IAAI+C,EAAO8kD,EAAKh7B,KAChB,IAAK,IAAIxsB,EAAI,EAAGA,EAAIR,KAAK47B,MAAMt7B,OAAQE,IACnC0C,EAAOlD,KAAK47B,MAAMp7B,GAAG+7B,SAASr5B,GAClC,IAAK8kD,EAAKqD,QAAQnoD,EAAMlD,KAAK47B,OACzB,MAAM,IAAI0rB,WAAW,wCAAwCtnD,KAAK6E,KAAKpC,SAASzC,KAAK47B,MAAM37B,KAAIg7B,GAAKA,EAAEp2B,KAAKpC,UAC/GzC,KAAKG,QAAQqN,SAAQW,GAAQA,EAAKqF,SACtC,CAIA6yB,SACI,IAAIpkC,EAAM,CAAE4C,KAAM7E,KAAK6E,KAAKpC,MAC5B,IAAK,IAAIsX,KAAK/Z,KAAKw7B,MAAO,CACtBv5B,EAAIu5B,MAAQx7B,KAAKw7B,MACjB,KACJ,CAKA,OAJIx7B,KAAKG,QAAQ8Q,OACbhP,EAAI9B,QAAUH,KAAKG,QAAQkmC,UAC3BrmC,KAAK47B,MAAMt7B,SACX2B,EAAI25B,MAAQ57B,KAAK47B,MAAM37B,KAAI26B,GAAKA,EAAEyL,YAC/BpkC,CACX,CAIAw5B,gBAAgBI,EAAQssB,GACpB,IAAKA,EACD,MAAM,IAAIb,WAAW,mCACzB,IAAI1rB,EAAQ,KACZ,GAAIusB,EAAKvsB,MAAO,CACZ,IAAK95B,MAAMF,QAAQumD,EAAKvsB,OACpB,MAAM,IAAI0rB,WAAW,uCACzB1rB,EAAQusB,EAAKvsB,MAAM37B,IAAI47B,EAAOqwB,aAClC,CACA,GAAiB,QAAb/D,EAAKtjD,KAAgB,CACrB,GAAwB,iBAAbsjD,EAAK3wC,KACZ,MAAM,IAAI8vC,WAAW,6BACzB,OAAOzrB,EAAOrkB,KAAK2wC,EAAK3wC,KAAMokB,EAClC,CACA,IAAIz7B,EAAU2mD,EAAS8B,SAAS/sB,EAAQssB,EAAKhoD,SAC7C,OAAO07B,EAAOwU,SAAS8X,EAAKtjD,MAAMmW,OAAOmtC,EAAK3sB,MAAOr7B,EAASy7B,EAClE,EAEJsvB,EAAK5pD,UAAUkW,UAAO1W,EACtB,MAAMqrD,UAAiBjB,EAInB7oD,YAAYwC,EAAM22B,EAAOr7B,EAASy7B,GAE9B,GADA1H,MAAMrvB,EAAM22B,EAAO,KAAMI,IACpBz7B,EACD,MAAM,IAAImnD,WAAW,oCACzBtnD,KAAKwX,KAAOrX,CAChB,CACAJ,WACI,OAAIC,KAAK6E,KAAKo3B,KAAK0vB,cACR3rD,KAAK6E,KAAKo3B,KAAK0vB,cAAc3rD,MACjC4rD,EAAU5rD,KAAK47B,MAAO/F,KAAKC,UAAU91B,KAAKwX,MACrD,CACIkK,kBAAgB,OAAO1hB,KAAKwX,IAAM,CACtCumC,YAAYhvC,EAAM+3B,GAAM,OAAO9mC,KAAKwX,KAAKlS,MAAMyJ,EAAM+3B,EAAK,CACtDoN,eAAa,OAAOl0C,KAAKwX,KAAKlX,MAAQ,CAC1C8yC,KAAKxX,GACD,OAAOA,GAAS57B,KAAK47B,MAAQ57B,KAAO,IAAImsD,EAASnsD,KAAK6E,KAAM7E,KAAKw7B,MAAOx7B,KAAKwX,KAAMokB,EACvF,CACAurB,SAAS3vC,GACL,OAAIA,GAAQxX,KAAKwX,KACNxX,KACJ,IAAImsD,EAASnsD,KAAK6E,KAAM7E,KAAKw7B,MAAOhkB,EAAMxX,KAAK47B,MAC1D,CACAwrB,IAAIr4C,EAAO,EAAG+3B,EAAK9mC,KAAKwX,KAAKlX,QACzB,OAAY,GAARyO,GAAa+3B,GAAM9mC,KAAKwX,KAAKlX,OACtBN,KACJA,KAAKmnD,SAASnnD,KAAKwX,KAAKlS,MAAMyJ,EAAM+3B,GAC/C,CACA8H,GAAG3pC,GACC,OAAOjF,KAAKsmD,WAAWrhD,IAAUjF,KAAKwX,MAAQvS,EAAMuS,IACxD,CACA6uB,SACI,IAAIl9B,EAAO+qB,MAAMmS,SAEjB,OADAl9B,EAAKqO,KAAOxX,KAAKwX,KACVrO,CACX,EAEJ,SAASyiD,EAAUhwB,EAAO+uB,GACtB,IAAK,IAAInqD,EAAIo7B,EAAMt7B,OAAS,EAAGE,GAAK,EAAGA,IACnCmqD,EAAM/uB,EAAMp7B,GAAGqE,KAAKpC,KAAO,IAAMkoD,EAAM,IAC3C,OAAOA,CACX,CAQA,MAAMyB,EAIF/pD,YAIA4/C,GACIjiD,KAAKiiD,SAAWA,EAIhBjiD,KAAK+R,KAAO,GAIZ/R,KAAKqsD,UAAY,EACrB,CAIA5wB,aAAapkB,EAAQi1C,GACjB,IAAIj4C,EAAS,IAAIk4C,EAAYl1C,EAAQi1C,GACrC,GAAmB,MAAfj4C,EAAOtC,KACP,OAAOq6C,EAAarlB,MACxB,IAAIylB,EAAOC,EAAUp4C,GACjBA,EAAOtC,MACPsC,EAAO3I,IAAI,4BACf,IAAIqgB,EAsWZ,SAAa2gC,GACT,IAAIC,EAAUtrD,OAAO2Z,OAAO,MAC5B,OACA,SAAS4xC,EAAQC,GACb,IAAIC,EAAM,GACVD,EAAOr/C,SAAQW,IACXu+C,EAAIv+C,GAAMX,SAAQ,EAAGu/C,OAAMjmB,SACvB,IAAKimB,EACD,OACJ,IAAItkD,EACJ,IAAK,IAAIjI,EAAI,EAAGA,EAAIssD,EAAIxsD,OAAQE,IACxBssD,EAAItsD,GAAG,IAAMusD,IACbtkD,EAAMqkD,EAAItsD,GAAG,IACrBwsD,EAASN,EAAK5lB,GAAIt5B,SAAQW,IACjB1F,GACDqkD,EAAI3rD,KAAK,CAAC4rD,EAAMtkD,EAAM,MACA,GAAtBA,EAAIwnB,QAAQ9hB,IACZ1F,EAAItH,KAAKgN,EAAK,GACpB,GACJ,IAEN,IAAIqL,EAAQmzC,EAAQE,EAAOtsD,KAAK,MAAQ,IAAI6rD,EAAaS,EAAO58B,QAAQy8B,EAAIpsD,OAAS,IAAM,GAC3F,IAAK,IAAIE,EAAI,EAAGA,EAAIssD,EAAIxsD,OAAQE,IAAK,CACjC,IAAIqsD,EAASC,EAAItsD,GAAG,GAAG4yB,KAAK65B,GAC5BzzC,EAAMzH,KAAK5Q,KAAK,CAAE0D,KAAMioD,EAAItsD,GAAG,GAAIuR,KAAM46C,EAAQE,EAAOtsD,KAAK,OAASqsD,EAAQC,IAClF,CACA,OAAOrzC,CACX,CAzBOozC,CAAQI,EAASN,EAAK,GA0BjC,CAlYoBQ,CA2QpB,SAAaV,GACT,IAAIE,EAAM,CAAC,IAEX,OADAS,EAWA,SAASzzB,EAAQ8yB,EAAMz9C,GACnB,GAAiB,UAAby9C,EAAK3nD,KACL,OAAO2nD,EAAKY,MAAMlvB,QAAO,CAAC4uB,EAAKN,IAASM,EAAIzsD,OAAOq5B,EAAQ8yB,EAAMz9C,KAAQ,IAExE,GAAiB,OAAby9C,EAAK3nD,KAQT,IAAiB,QAAb2nD,EAAK3nD,KAAgB,CAC1B,IAAIwoD,EAAOl/C,IAGX,OAFAkzC,EAAKtyC,EAAMs+C,GACXF,EAAQzzB,EAAQ8yB,EAAKA,KAAMa,GAAOA,GAC3B,CAAChM,EAAKgM,GACjB,CACK,GAAiB,QAAbb,EAAK3nD,KAAgB,CAC1B,IAAIwoD,EAAOl/C,IAGX,OAFAg/C,EAAQzzB,EAAQ8yB,EAAKA,KAAMz9C,GAAOs+C,GAClCF,EAAQzzB,EAAQ8yB,EAAKA,KAAMa,GAAOA,GAC3B,CAAChM,EAAKgM,GACjB,CACK,GAAiB,OAAbb,EAAK3nD,KACV,MAAO,CAACw8C,EAAKtyC,IAAO1O,OAAOq5B,EAAQ8yB,EAAKA,KAAMz9C,IAE7C,GAAiB,SAAby9C,EAAK3nD,KAAiB,CAC3B,IAAIyoD,EAAMv+C,EACV,IAAK,IAAIvO,EAAI,EAAGA,EAAIgsD,EAAK/nD,IAAKjE,IAAK,CAC/B,IAAIuR,EAAO5D,IACXg/C,EAAQzzB,EAAQ8yB,EAAKA,KAAMc,GAAMv7C,GACjCu7C,EAAMv7C,CACV,CACA,IAAiB,GAAby6C,EAAKjoD,IACL4oD,EAAQzzB,EAAQ8yB,EAAKA,KAAMc,GAAMA,QAGjC,IAAK,IAAI9sD,EAAIgsD,EAAK/nD,IAAKjE,EAAIgsD,EAAKjoD,IAAK/D,IAAK,CACtC,IAAIuR,EAAO5D,IACXkzC,EAAKiM,EAAKv7C,GACVo7C,EAAQzzB,EAAQ8yB,EAAKA,KAAMc,GAAMv7C,GACjCu7C,EAAMv7C,CACV,CAEJ,MAAO,CAACsvC,EAAKiM,GACjB,CACK,GAAiB,QAAbd,EAAK3nD,KACV,MAAO,CAACw8C,EAAKtyC,OAAMjO,EAAW0rD,EAAK5pD,QAGnC,MAAM,IAAImF,MAAM,oBACpB,CA/CI,IAAK,IAAIvH,EAAI,GAAIA,IAAK,CAClB,IAAIuR,EAAO2nB,EAAQ8yB,EAAKY,MAAM5sD,GAAIuO,GAClC,GAAIvO,GAAKgsD,EAAKY,MAAM9sD,OAAS,EACzB,OAAOyR,EACXo7C,EAAQp7C,EAAMhD,EAAOZ,IACzB,CA2CR,CAhEQurB,CAAQ8yB,EAAM,GAAIr+C,KACnBu+C,EACP,SAASv+C,IAAS,OAAOu+C,EAAIvrD,KAAK,IAAM,CAAG,CAC3C,SAASkgD,EAAKtyC,EAAM+3B,EAAIimB,GACpB,IAAI1L,EAAO,CAAE0L,OAAMjmB,MAEnB,OADA4lB,EAAI39C,GAAM5N,KAAKkgD,GACRA,CACX,CACA,SAAS8L,EAAQI,EAAOzmB,GACpBymB,EAAM//C,SAAQ6zC,GAAQA,EAAKva,GAAKA,GACpC,CAuDJ,CA9UwB4lB,CAAIF,IAEpB,OAiYR,SAA0BzgC,EAAO1X,GAC7B,IAAK,IAAI7T,EAAI,EAAGgtD,EAAO,CAACzhC,GAAQvrB,EAAIgtD,EAAKltD,OAAQE,IAAK,CAClD,IAAIgZ,EAAQg0C,EAAKhtD,GAAIitD,GAAQj0C,EAAMyoC,SAAUnmB,EAAQ,GACrD,IAAK,IAAIoB,EAAI,EAAGA,EAAI1jB,EAAMzH,KAAKzR,OAAQ48B,IAAK,CACxC,IAAI,KAAEr4B,EAAI,KAAEkN,GAASyH,EAAMzH,KAAKmrB,GAChCpB,EAAM36B,KAAK0D,EAAKpC,OACZgrD,GAAU5oD,EAAK82B,QAAU92B,EAAKy8C,qBAC9BmM,GAAO,IACgB,GAAvBD,EAAKv9B,QAAQle,IACby7C,EAAKrsD,KAAK4Q,EAClB,CACI07C,GACAp5C,EAAO3I,IAAI,+BAAiCowB,EAAMv7B,KAAK,MAAQ,iFACvE,CACJ,CAhZQmtD,CAAiB3hC,EAAO1X,GACjB0X,CACX,CAKAi2B,UAAUn9C,GACN,IAAK,IAAIrE,EAAI,EAAGA,EAAIR,KAAK+R,KAAKzR,OAAQE,IAClC,GAAIR,KAAK+R,KAAKvR,GAAGqE,MAAQA,EACrB,OAAO7E,KAAK+R,KAAKvR,GAAGuR,KAC5B,OAAO,IACX,CAKA+5C,cAAc6B,EAAMl/C,EAAQ,EAAGG,EAAM++C,EAAK/a,YACtC,IAAI0a,EAAMttD,KACV,IAAK,IAAIQ,EAAIiO,EAAO6+C,GAAO9sD,EAAIoO,EAAKpO,IAChC8sD,EAAMA,EAAItL,UAAU2L,EAAK76B,MAAMtyB,GAAGqE,MACtC,OAAOyoD,CACX,CAIIlT,oBACA,OAA2B,GAApBp6C,KAAK+R,KAAKzR,QAAeN,KAAK+R,KAAK,GAAGlN,KAAK6xC,QACtD,CAKIqC,kBACA,IAAK,IAAIv4C,EAAI,EAAGA,EAAIR,KAAK+R,KAAKzR,OAAQE,IAAK,CACvC,IAAI,KAAEqE,GAAS7E,KAAK+R,KAAKvR,GACzB,IAAMqE,EAAK82B,SAAU92B,EAAKy8C,mBACtB,OAAOz8C,CACf,CACA,OAAO,IACX,CAIA+oD,WAAW3oD,GACP,IAAK,IAAIzE,EAAI,EAAGA,EAAIR,KAAK+R,KAAKzR,OAAQE,IAClC,IAAK,IAAI08B,EAAI,EAAGA,EAAIj4B,EAAM8M,KAAKzR,OAAQ48B,IACnC,GAAIl9B,KAAK+R,KAAKvR,GAAGqE,MAAQI,EAAM8M,KAAKmrB,GAAGr4B,KACnC,OAAO,EACnB,OAAO,CACX,CASAgpD,WAAW3xC,EAAO4xC,GAAQ,EAAOr0C,EAAa,GAC1C,IAAIhF,EAAO,CAACzU,MAgBZ,OAfA,SAAS0lB,EAAOqG,EAAOitB,GACnB,IAAI+U,EAAWhiC,EAAM+/B,cAAc5vC,EAAOzC,GAC1C,GAAIs0C,KAAcD,GAASC,EAAS9L,UAChC,OAAO6E,EAAS/3C,KAAKiqC,EAAM/4C,KAAI+tD,GAAMA,EAAG1xB,mBAC5C,IAAK,IAAI97B,EAAI,EAAGA,EAAIurB,EAAMha,KAAKzR,OAAQE,IAAK,CACxC,IAAI,KAAEqE,EAAI,KAAEkN,GAASga,EAAMha,KAAKvR,GAChC,IAAMqE,EAAK82B,SAAU92B,EAAKy8C,qBAA8C,GAAvB7sC,EAAKwb,QAAQle,GAAa,CACvE0C,EAAKtT,KAAK4Q,GACV,IAAI6zC,EAAQlgC,EAAO3T,EAAMinC,EAAM34C,OAAOwE,IACtC,GAAI+gD,EACA,OAAOA,CACf,CACJ,CACA,OAAO,IACX,CACOlgC,CAAO1lB,KAAM,GACxB,CAOA+hD,aAAax/C,GACT,IAAK,IAAI/B,EAAI,EAAGA,EAAIR,KAAKqsD,UAAU/rD,OAAQE,GAAK,EAC5C,GAAIR,KAAKqsD,UAAU7rD,IAAM+B,EACrB,OAAOvC,KAAKqsD,UAAU7rD,EAAI,GAClC,IAAIytD,EAAWjuD,KAAKkuD,gBAAgB3rD,GAEpC,OADAvC,KAAKqsD,UAAUlrD,KAAKoB,EAAQ0rD,GACrBA,CACX,CAIAC,gBAAgB3rD,GACZ,IAAIkS,EAAOpT,OAAO2Z,OAAO,MAAOmzC,EAAS,CAAC,CAAEpiC,MAAO/rB,KAAM6E,KAAM,KAAMupD,IAAK,OAC1E,KAAOD,EAAO7tD,QAAQ,CAClB,IAAI8V,EAAU+3C,EAAO1+B,QAAS1D,EAAQ3V,EAAQ2V,MAC9C,GAAIA,EAAMi2B,UAAUz/C,GAAS,CACzB,IAAIqD,EAAS,GACb,IAAK,IAAI3D,EAAMmU,EAASnU,EAAI4C,KAAM5C,EAAMA,EAAImsD,IACxCxoD,EAAOzE,KAAKc,EAAI4C,MACpB,OAAOe,EAAOkjC,SAClB,CACA,IAAK,IAAItoC,EAAI,EAAGA,EAAIurB,EAAMha,KAAKzR,OAAQE,IAAK,CACxC,IAAI,KAAEqE,EAAI,KAAEkN,GAASga,EAAMha,KAAKvR,GAC3BqE,EAAKqiD,QAAWriD,EAAKy8C,oBAAwBz8C,EAAKpC,QAAQgS,GAAW2B,EAAQvR,OAAQkN,EAAKkwC,WAC3FkM,EAAOhtD,KAAK,CAAE4qB,MAAOlnB,EAAKgnD,aAAchnD,OAAMupD,IAAKh4C,IACnD3B,EAAK5P,EAAKpC,OAAQ,EAE1B,CACJ,CACA,OAAO,IACX,CAKI2+C,gBACA,OAAOphD,KAAK+R,KAAKzR,MACrB,CAKA+gD,KAAKzmB,GACD,GAAIA,GAAK56B,KAAK+R,KAAKzR,OACf,MAAM,IAAIgnD,WAAW,cAAc1sB,kCACvC,OAAO56B,KAAK+R,KAAK6oB,EACrB,CAIA76B,WACI,IAAI0U,EAAO,GAQX,OAPA,SAASssC,EAAK9lB,GACVxmB,EAAKtT,KAAK85B,GACV,IAAK,IAAIz6B,EAAI,EAAGA,EAAIy6B,EAAElpB,KAAKzR,OAAQE,KACM,GAAjCiU,EAAKwb,QAAQgL,EAAElpB,KAAKvR,GAAGuR,OACvBgvC,EAAK9lB,EAAElpB,KAAKvR,GAAGuR,KAC3B,CACAgvC,CAAK/gD,MACEyU,EAAKxU,KAAI,CAACg7B,EAAGz6B,KAChB,IAAIssD,EAAMtsD,GAAKy6B,EAAEgnB,SAAW,IAAM,KAAO,IACzC,IAAK,IAAIzhD,EAAI,EAAGA,EAAIy6B,EAAElpB,KAAKzR,OAAQE,IAC/BssD,IAAQtsD,EAAI,KAAO,IAAMy6B,EAAElpB,KAAKvR,GAAGqE,KAAKpC,KAAO,KAAOgS,EAAKwb,QAAQgL,EAAElpB,KAAKvR,GAAGuR,MACjF,OAAO+6C,CAAG,IACXvsD,KAAK,KACZ,EAKJ6rD,EAAarlB,MAAQ,IAAIqlB,GAAa,GACtC,MAAMG,EACFlqD,YAAYgV,EAAQi1C,GAChBtsD,KAAKqX,OAASA,EACdrX,KAAKssD,UAAYA,EACjBtsD,KAAKo2C,OAAS,KACdp2C,KAAKsmB,IAAM,EACXtmB,KAAKquD,OAASh3C,EAAOob,MAAM,kBACgB,IAAvCzyB,KAAKquD,OAAOruD,KAAKquD,OAAO/tD,OAAS,IACjCN,KAAKquD,OAAO73C,MACM,IAAlBxW,KAAKquD,OAAO,IACZruD,KAAKquD,OAAO5+B,OACpB,CACI1d,WAAS,OAAO/R,KAAKquD,OAAOruD,KAAKsmB,IAAM,CAC3CgoC,IAAIC,GAAO,OAAOvuD,KAAK+R,MAAQw8C,IAAQvuD,KAAKsmB,QAAS,EAAO,CAC5D5a,IAAIi/C,GAAO,MAAM,IAAI6D,YAAY7D,EAAM,4BAA8B3qD,KAAKqX,OAAS,KAAO,EAE9F,SAASo1C,EAAUp4C,GACf,IAAI+4C,EAAQ,GACZ,GACIA,EAAMjsD,KAAKstD,EAAap6C,UACnBA,EAAOi6C,IAAI,MACpB,OAAuB,GAAhBlB,EAAM9sD,OAAc8sD,EAAM,GAAK,CAAEvoD,KAAM,SAAUuoD,QAC5D,CACA,SAASqB,EAAap6C,GAClB,IAAI+4C,EAAQ,GACZ,GACIA,EAAMjsD,KAAKutD,EAAmBr6C,UACzBA,EAAOtC,MAAuB,KAAfsC,EAAOtC,MAA8B,KAAfsC,EAAOtC,MACrD,OAAuB,GAAhBq7C,EAAM9sD,OAAc8sD,EAAM,GAAK,CAAEvoD,KAAM,MAAOuoD,QACzD,CACA,SAASsB,EAAmBr6C,GACxB,IAAIm4C,EAgDR,SAAuBn4C,GACnB,GAAIA,EAAOi6C,IAAI,KAAM,CACjB,IAAI9B,EAAOC,EAAUp4C,GAGrB,OAFKA,EAAOi6C,IAAI,MACZj6C,EAAO3I,IAAI,yBACR8gD,CACX,CACK,IAAK,KAAKnnD,KAAKgP,EAAOtC,MAAO,CAC9B,IAAIq7C,EAtBZ,SAAqB/4C,EAAQ5R,GACzB,IAAIu2C,EAAQ3kC,EAAOi4C,UAAWznD,EAAOm0C,EAAMv2C,GAC3C,GAAIoC,EACA,MAAO,CAACA,GACZ,IAAIe,EAAS,GACb,IAAK,IAAI+oD,KAAY3V,EAAO,CACxB,IAAIn0C,EAAOm0C,EAAM2V,GACb9pD,EAAKiwC,OAAO7kB,QAAQxtB,IAAS,GAC7BmD,EAAOzE,KAAK0D,EACpB,CAGA,OAFqB,GAAjBe,EAAOtF,QACP+T,EAAO3I,IAAI,0BAA4BjJ,EAAO,WAC3CmD,CACX,CASoBgpD,CAAYv6C,EAAQA,EAAOtC,MAAM9R,KAAI4E,IACxB,MAAjBwP,EAAO+hC,OACP/hC,EAAO+hC,OAASvxC,EAAK6xC,SAChBriC,EAAO+hC,QAAUvxC,EAAK6xC,UAC3BriC,EAAO3I,IAAI,mCACR,CAAE7G,KAAM,OAAQjC,MAAOiC,MAGlC,OADAwP,EAAOiS,MACgB,GAAhB8mC,EAAM9sD,OAAc8sD,EAAM,GAAK,CAAEvoD,KAAM,SAAUuoD,QAC5D,CAEI/4C,EAAO3I,IAAI,qBAAuB2I,EAAOtC,KAAO,IAExD,CArEe88C,CAAcx6C,GACzB,OACI,GAAIA,EAAOi6C,IAAI,KACX9B,EAAO,CAAE3nD,KAAM,OAAQ2nD,aACtB,GAAIn4C,EAAOi6C,IAAI,KAChB9B,EAAO,CAAE3nD,KAAM,OAAQ2nD,aACtB,GAAIn4C,EAAOi6C,IAAI,KAChB9B,EAAO,CAAE3nD,KAAM,MAAO2nD,YACrB,KAAIn4C,EAAOi6C,IAAI,KAGhB,MAFA9B,EAAOsC,EAAez6C,EAAQm4C,EAEzB,CAEb,OAAOA,CACX,CACA,SAASuC,EAAS16C,GACV,KAAKhP,KAAKgP,EAAOtC,OACjBsC,EAAO3I,IAAI,yBAA2B2I,EAAOtC,KAAO,KACxD,IAAInM,EAASmL,OAAOsD,EAAOtC,MAE3B,OADAsC,EAAOiS,MACA1gB,CACX,CACA,SAASkpD,EAAez6C,EAAQm4C,GAC5B,IAAI/nD,EAAMsqD,EAAS16C,GAAS9P,EAAME,EASlC,OARI4P,EAAOi6C,IAAI,OAEP/pD,EADe,KAAf8P,EAAOtC,KACDg9C,EAAS16C,IAER,GAEVA,EAAOi6C,IAAI,MACZj6C,EAAO3I,IAAI,yBACR,CAAE7G,KAAM,QAASJ,MAAKF,MAAKioD,OACtC,CAmHA,SAASS,EAAIh7B,EAAGC,GAAK,OAAOA,EAAID,CAAG,CAInC,SAAS+6B,EAASN,EAAKv+C,GACnB,IAAIvI,EAAS,GAEb,OACA,SAASm7C,EAAK5yC,GACV,IAAIo/C,EAAQb,EAAIv+C,GAChB,GAAoB,GAAhBo/C,EAAMjtD,SAAgBitD,EAAM,GAAGR,KAC/B,OAAOhM,EAAKwM,EAAM,GAAGzmB,IACzBlhC,EAAOzE,KAAKgN,GACZ,IAAK,IAAI3N,EAAI,EAAGA,EAAI+sD,EAAMjtD,OAAQE,IAAK,CACnC,IAAI,KAAEusD,EAAI,GAAEjmB,GAAOymB,EAAM/sD,GACpBusD,IAA+B,GAAvBnnD,EAAOqqB,QAAQ6W,IACxBia,EAAKja,EACb,CACJ,CAZAia,CAAK5yC,GACEvI,EAAOwtB,KAAK65B,EAYvB,CAqDA,SAAS7B,EAAa5vB,GAClB,IAAIwzB,EAAW3tD,OAAO2Z,OAAO,MAC7B,IAAK,IAAIi0C,KAAYzzB,EAAO,CACxB,IAAI0zB,EAAO1zB,EAAMyzB,GACjB,IAAKC,EAAKC,WACN,OAAO,KACXH,EAASC,GAAYC,EAAKtb,OAC9B,CACA,OAAOob,CACX,CACA,SAASI,EAAa5zB,EAAO54B,GACzB,IAAIysD,EAAQhuD,OAAO2Z,OAAO,MAC1B,IAAK,IAAIvY,KAAQ+4B,EAAO,CACpB,IAAI8zB,EAAQ1sD,GAASA,EAAMH,GAC3B,QAAc3B,IAAVwuD,EAAqB,CACrB,IAAIJ,EAAO1zB,EAAM/4B,GACjB,IAAIysD,EAAKC,WAGL,MAAM,IAAI7H,WAAW,mCAAqC7kD,GAF1D6sD,EAAQJ,EAAKtb,OAGrB,CACAyb,EAAM5sD,GAAQ6sD,CAClB,CACA,OAAOD,CACX,CACA,SAASE,EAAU/zB,GACf,IAAI51B,EAASvE,OAAO2Z,OAAO,MAC3B,GAAIwgB,EACA,IAAK,IAAI/4B,KAAQ+4B,EACb51B,EAAOnD,GAAQ,IAAI+sD,EAAUh0B,EAAM/4B,IAC3C,OAAOmD,CACX,CAOA,MAAM6pD,EAIFptD,YAIAI,EAIAo5B,EAIAI,GACIj8B,KAAKyC,KAAOA,EACZzC,KAAK67B,OAASA,EACd77B,KAAKi8B,KAAOA,EAKZj8B,KAAK0vD,QAAU,KACf1vD,KAAK80C,OAAS7Y,EAAKzZ,MAAQyZ,EAAKzZ,MAAMiQ,MAAM,KAAO,GACnDzyB,KAAKw7B,MAAQ+zB,EAAUtzB,EAAKT,OAC5Bx7B,KAAKorD,aAAeA,EAAaprD,KAAKw7B,OACtCx7B,KAAK6rD,aAAe,KACpB7rD,KAAKo6C,cAAgB,KACrBp6C,KAAKs4C,UAAYrc,EAAKma,QAAkB,QAAR3zC,GAChCzC,KAAK27B,OAAiB,QAARl5B,CAClB,CAIIi0C,eAAa,OAAQ12C,KAAKs4C,OAAS,CAKnCM,kBAAgB,OAAO54C,KAAKs4C,SAAWt4C,KAAKo6C,aAAe,CAI3D8M,aAAW,OAAOlnD,KAAK6rD,cAAgBO,EAAarlB,KAAO,CAK3D6c,aAAW,OAAO5jD,KAAKknD,UAAYlnD,KAAKi8B,KAAKsa,IAAM,CAInDoZ,iBACA,OAAO3vD,KAAKi8B,KAAK0zB,aAAe3vD,KAAKi8B,KAAK1sB,KAAO,MAAQ,SAC7D,CAIA+xC,mBACI,IAAK,IAAI1mB,KAAK56B,KAAKw7B,MACf,GAAIx7B,KAAKw7B,MAAMZ,GAAGg1B,WACd,OAAO,EACf,OAAO,CACX,CAKAjO,kBAAkB18C,GACd,OAAOjF,MAAQiF,GAASjF,KAAK6rD,aAAa+B,WAAW3oD,EAAM4mD,aAC/D,CAIAuD,aAAa5zB,GACT,OAAKA,GAASx7B,KAAKorD,aACRprD,KAAKorD,aAELgE,EAAapvD,KAAKw7B,MAAOA,EACxC,CASAxgB,OAAOwgB,EAAQ,KAAMr7B,EAASy7B,GAC1B,GAAI57B,KAAK27B,OACL,MAAM,IAAI5zB,MAAM,8CACpB,OAAO,IAAImjD,EAAKlrD,KAAMA,KAAKovD,aAAa5zB,GAAQsrB,EAAS/3C,KAAK5O,GAAU6nD,EAAK6H,QAAQj0B,GACzF,CAMAk0B,cAAct0B,EAAQ,KAAMr7B,EAASy7B,GAGjC,OAFAz7B,EAAU2mD,EAAS/3C,KAAK5O,GACxBH,KAAKgqD,aAAa7pD,GACX,IAAI+qD,EAAKlrD,KAAMA,KAAKovD,aAAa5zB,GAAQr7B,EAAS6nD,EAAK6H,QAAQj0B,GAC1E,CASAU,cAAcd,EAAQ,KAAMr7B,EAASy7B,GAGjC,GAFAJ,EAAQx7B,KAAKovD,aAAa5zB,IAC1Br7B,EAAU2mD,EAAS/3C,KAAK5O,IACZ8Q,KAAM,CACd,IAAIvB,EAAS1P,KAAK6rD,aAAagC,WAAW1tD,GAC1C,IAAKuP,EACD,OAAO,KACXvP,EAAUuP,EAAO82B,OAAOrmC,EAC5B,CACA,IAAI4vD,EAAU/vD,KAAK6rD,aAAaC,cAAc3rD,GAC1C+b,EAAQ6zC,GAAWA,EAAQlC,WAAW/G,EAAS/f,OAAO,GAC1D,OAAK7qB,EAEE,IAAIgvC,EAAKlrD,KAAMw7B,EAAOr7B,EAAQqmC,OAAOtqB,GAAQ8rC,EAAK6H,QAAQj0B,IADtD,IAEf,CAKAo0B,aAAa7vD,GACT,IAAIyF,EAAS5F,KAAK6rD,aAAaC,cAAc3rD,GAC7C,IAAKyF,IAAWA,EAAOq8C,SACnB,OAAO,EACX,IAAK,IAAIzhD,EAAI,EAAGA,EAAIL,EAAQyyC,WAAYpyC,IACpC,IAAKR,KAAKgsD,YAAY7rD,EAAQ2yB,MAAMtyB,GAAGo7B,OACnC,OAAO,EACf,OAAO,CACX,CAMAouB,aAAa7pD,GACT,IAAKH,KAAKgwD,aAAa7vD,GACnB,MAAM,IAAImnD,WAAW,4BAA4BtnD,KAAKyC,SAAStC,EAAQJ,WAAWuF,MAAM,EAAG,MACnG,CAIAy9C,eAAeF,GACX,OAAuB,MAAhB7iD,KAAK0vD,SAAmB1vD,KAAK0vD,QAAQz/B,QAAQ4yB,IAAa,CACrE,CAIAmJ,YAAYpwB,GACR,GAAoB,MAAhB57B,KAAK0vD,QACL,OAAO,EACX,IAAK,IAAIlvD,EAAI,EAAGA,EAAIo7B,EAAMt7B,OAAQE,IAC9B,IAAKR,KAAK+iD,eAAennB,EAAMp7B,GAAGqE,MAC9B,OAAO,EACf,OAAO,CACX,CAIAorD,aAAar0B,GACT,GAAoB,MAAhB57B,KAAK0vD,QACL,OAAO9zB,EACX,IAAI14B,EACJ,IAAK,IAAI1C,EAAI,EAAGA,EAAIo7B,EAAMt7B,OAAQE,IACzBR,KAAK+iD,eAAennB,EAAMp7B,GAAGqE,MAIzB3B,GACLA,EAAK/B,KAAKy6B,EAAMp7B,IAJX0C,IACDA,EAAO04B,EAAMt2B,MAAM,EAAG9E,IAMlC,OAAQ0C,EAAeA,EAAK5C,OAAS4C,EAAO8kD,EAAKh7B,KAAlC4O,CACnB,CAIAH,eAAeK,EAAOD,GAClB,IAAIj2B,EAASvE,OAAO2Z,OAAO,MAC3B8gB,EAAMtuB,SAAQ,CAAC/K,EAAMw5B,IAASr2B,EAAOnD,GAAQ,IAAIgtD,EAAShtD,EAAMo5B,EAAQI,KACxE,IAAIi0B,EAAUr0B,EAAOI,KAAKk0B,SAAW,MACrC,IAAKvqD,EAAOsqD,GACR,MAAM,IAAI5I,WAAW,yCAA2C4I,EAAU,MAC9E,IAAKtqD,EAAO4R,KACR,MAAM,IAAI8vC,WAAW,oCACzB,IAAK,IAAIvtC,KAAKnU,EAAO4R,KAAKgkB,MACtB,MAAM,IAAI8rB,WAAW,iDACzB,OAAO1hD,CACX,EAGJ,MAAM4pD,EACFntD,YAAYG,GACRxC,KAAKmvD,WAAa9tD,OAAOC,UAAUC,eAAeQ,KAAKS,EAAS,WAChExC,KAAK4zC,QAAUpxC,EAAQoxC,OAC3B,CACIgc,iBACA,OAAQ5vD,KAAKmvD,UACjB,EASJ,MAAMiB,EAIF/tD,YAIAI,EAIA6tB,EAIAuL,EAIAI,GACIj8B,KAAKyC,KAAOA,EACZzC,KAAKswB,KAAOA,EACZtwB,KAAK67B,OAASA,EACd77B,KAAKi8B,KAAOA,EACZj8B,KAAKw7B,MAAQ+zB,EAAUtzB,EAAKT,OAC5Bx7B,KAAKqwD,SAAW,KAChB,IAAIrB,EAAW5D,EAAaprD,KAAKw7B,OACjCx7B,KAAKuJ,SAAWylD,EAAW,IAAIhH,EAAKhoD,KAAMgvD,GAAY,IAC1D,CAMAh0C,OAAOwgB,EAAQ,MACX,OAAKA,GAASx7B,KAAKuJ,SACRvJ,KAAKuJ,SACT,IAAIy+C,EAAKhoD,KAAMovD,EAAapvD,KAAKw7B,MAAOA,GACnD,CAIAC,eAAeG,EAAOC,GAClB,IAAIj2B,EAASvE,OAAO2Z,OAAO,MAAOsV,EAAO,EAEzC,OADAsL,EAAMpuB,SAAQ,CAAC/K,EAAMw5B,IAASr2B,EAAOnD,GAAQ,IAAI2tD,EAAS3tD,EAAM6tB,IAAQuL,EAAQI,KACzEr2B,CACX,CAKA42B,cAAc/zB,GACV,IAAK,IAAIjI,EAAI,EAAGA,EAAIiI,EAAInI,OAAQE,IACxBiI,EAAIjI,GAAGqE,MAAQ7E,OACfyI,EAAMA,EAAInD,MAAM,EAAG9E,GAAGH,OAAOoI,EAAInD,MAAM9E,EAAI,IAC3CA,KAER,OAAOiI,CACX,CAIA41B,QAAQ51B,GACJ,IAAK,IAAIjI,EAAI,EAAGA,EAAIiI,EAAInI,OAAQE,IAC5B,GAAIiI,EAAIjI,GAAGqE,MAAQ7E,KACf,OAAOyI,EAAIjI,EACvB,CAKA0nD,SAASjjD,GACL,OAAOjF,KAAKqwD,SAASpgC,QAAQhrB,IAAU,CAC3C,EAWJ,MAAMqrD,EAIFjuD,YAAY45B,GAMRj8B,KAAK8qD,OAASzpD,OAAO2Z,OAAO,MAC5B,IAAIu1C,EAAevwD,KAAKi8B,KAAO,CAAC,EAChC,IAAK,IAAIxF,KAAQwF,EACbs0B,EAAa95B,GAAQwF,EAAKxF,GAC9B85B,EAAaz0B,MAAQ,OAAgBG,EAAKH,OACtCy0B,EAAa30B,MAAQ,OAAgBK,EAAKL,OAAS,CAAC,GACpD57B,KAAK87B,MAAQ2zB,EAAS/1B,QAAQ15B,KAAKi8B,KAAKH,MAAO97B,MACnDA,KAAK47B,MAAQw0B,EAAS12B,QAAQ15B,KAAKi8B,KAAKL,MAAO57B,MAC/C,IAAIwwD,EAAmBnvD,OAAO2Z,OAAO,MACrC,IAAK,IAAIyb,KAAQz2B,KAAK87B,MAAO,CACzB,GAAIrF,KAAQz2B,KAAK47B,MACb,MAAM,IAAI0rB,WAAW7wB,EAAO,sCAChC,IAAI5xB,EAAO7E,KAAK87B,MAAMrF,GAAOg6B,EAAc5rD,EAAKo3B,KAAK97B,SAAW,GAAIuwD,EAAW7rD,EAAKo3B,KAAKL,MACzF/2B,EAAKgnD,aAAe2E,EAAiBC,KAChCD,EAAiBC,GAAerE,EAAavgC,MAAM4kC,EAAazwD,KAAK87B,QAC1Ej3B,EAAKu1C,cAAgBv1C,EAAKgnD,aAAazR,cACvCv1C,EAAK6qD,QAAsB,KAAZgB,EAAkB,KAC7BA,EAAWC,EAAY3wD,KAAM0wD,EAASj+B,MAAM,MAC5B,IAAZi+B,GAAmB7rD,EAAKu1C,cAAqB,KAAL,EACpD,CACA,IAAK,IAAI3jB,KAAQz2B,KAAK47B,MAAO,CACzB,IAAI/2B,EAAO7E,KAAK47B,MAAMnF,GAAOm6B,EAAO/rD,EAAKo3B,KAAKisB,SAC9CrjD,EAAKwrD,SAAmB,MAARO,EAAe,CAAC/rD,GAAgB,IAAR+rD,EAAa,GAAKD,EAAY3wD,KAAM4wD,EAAKn+B,MAAM,KAC3F,CACAzyB,KAAK6nD,aAAe7nD,KAAK6nD,aAAagJ,KAAK7wD,MAC3CA,KAAKksD,aAAelsD,KAAKksD,aAAa2E,KAAK7wD,MAC3CA,KAAK06C,YAAc16C,KAAK87B,MAAM97B,KAAKi8B,KAAKk0B,SAAW,OACnDnwD,KAAK8qD,OAAOgG,UAAYzvD,OAAO2Z,OAAO,KAC1C,CAOA7M,KAAKtJ,EAAM22B,EAAQ,KAAMr7B,EAASy7B,GAC9B,GAAmB,iBAAR/2B,EACPA,EAAO7E,KAAKqwC,SAASxrC,OACpB,MAAMA,aAAgB4qD,GACvB,MAAM,IAAInI,WAAW,sBAAwBziD,GAC5C,GAAIA,EAAKg3B,QAAU77B,KACpB,MAAM,IAAIsnD,WAAW,yCAA2CziD,EAAKpC,KAAO,IAAI,CACpF,OAAOoC,EAAKirD,cAAct0B,EAAOr7B,EAASy7B,EAC9C,CAKApkB,KAAKA,EAAMokB,GACP,IAAI/2B,EAAO7E,KAAK87B,MAAMtkB,KACtB,OAAO,IAAI20C,EAAStnD,EAAMA,EAAKumD,aAAc5zC,EAAMwwC,EAAK6H,QAAQj0B,GACpE,CAIAwX,KAAKvuC,EAAM22B,GAGP,MAFmB,iBAAR32B,IACPA,EAAO7E,KAAK47B,MAAM/2B,IACfA,EAAKmW,OAAOwgB,EACvB,CAKAqsB,aAAaM,GACT,OAAO+C,EAAKtC,SAAS5oD,KAAMmoD,EAC/B,CAKA+D,aAAa/D,GACT,OAAOH,EAAKY,SAAS5oD,KAAMmoD,EAC/B,CAIA9X,SAAS5tC,GACL,IAAImjD,EAAQ5lD,KAAK87B,MAAMr5B,GACvB,IAAKmjD,EACD,MAAM,IAAI0B,WAAW,sBAAwB7kD,GACjD,OAAOmjD,CACX,EAEJ,SAAS+K,EAAY90B,EAAQD,GACzB,IAAIgqB,EAAQ,GACZ,IAAK,IAAIplD,EAAI,EAAGA,EAAIo7B,EAAMt7B,OAAQE,IAAK,CACnC,IAAIiC,EAAOm5B,EAAMp7B,GAAI4yC,EAAOvX,EAAOD,MAAMn5B,GAAOoO,EAAKuiC,EACrD,GAAIA,EACAwS,EAAMzkD,KAAKiyC,QAGX,IAAK,IAAI3c,KAAQoF,EAAOD,MAAO,CAC3B,IAAIwX,EAAOvX,EAAOD,MAAMnF,IACZ,KAARh0B,GAAgB2wC,EAAKnX,KAAKzZ,OAAS4wB,EAAKnX,KAAKzZ,MAAMiQ,MAAM,KAAKxC,QAAQxtB,IAAS,IAC/EmjD,EAAMzkD,KAAK0P,EAAKuiC,EACxB,CAEJ,IAAKviC,EACD,MAAM,IAAI29C,YAAY,uBAAyB5yB,EAAMp7B,GAAK,IAClE,CACA,OAAOolD,CACX,CAOA,MAAMmL,EAKF1uD,YAIAw5B,EAKAgF,GACI7gC,KAAK67B,OAASA,EACd77B,KAAK6gC,MAAQA,EAIb7gC,KAAKgxD,KAAO,GAIZhxD,KAAKixD,OAAS,GACdpwB,EAAMrzB,SAAQ4hB,IACNA,EAAK2jB,IACL/yC,KAAKgxD,KAAK7vD,KAAKiuB,GACVA,EAAKgC,OACVpxB,KAAKixD,OAAO9vD,KAAKiuB,EAAK,IAG9BpvB,KAAKkxD,gBAAkBlxD,KAAKgxD,KAAKx/B,MAAK6K,IAClC,IAAK,aAAah3B,KAAKg3B,EAAE0W,OAAS1W,EAAEluB,KAChC,OAAO,EACX,IAAIA,EAAO0tB,EAAOC,MAAMO,EAAEluB,MAC1B,OAAOA,EAAK09C,aAAa7J,UAAU7zC,EAAK,GAEhD,CAIA0d,MAAM2U,EAAKh+B,EAAU,CAAC,GAClB,IAAIsT,EAAU,IAAIq7C,GAAanxD,KAAMwC,GAAS,GAE9C,OADAsT,EAAQs7C,OAAO5wB,EAAKh+B,EAAQuM,KAAMvM,EAAQskC,IACnChxB,EAAQu7C,QACnB,CASAC,WAAW9wB,EAAKh+B,EAAU,CAAC,GACvB,IAAIsT,EAAU,IAAIq7C,GAAanxD,KAAMwC,GAAS,GAE9C,OADAsT,EAAQs7C,OAAO5wB,EAAKh+B,EAAQuM,KAAMvM,EAAQskC,IACnCuhB,EAAMkJ,QAAQz7C,EAAQu7C,SACjC,CAIAG,SAAShxB,EAAK1qB,EAASoG,GACnB,IAAK,IAAI1b,EAAI0b,EAAQlc,KAAKgxD,KAAK/gC,QAAQ/T,GAAS,EAAI,EAAG1b,EAAIR,KAAKgxD,KAAK1wD,OAAQE,IAAK,CAC9E,IAAI4uB,EAAOpvB,KAAKgxD,KAAKxwD,GACrB,GAAIixD,GAAQjxB,EAAKpR,EAAK2jB,YACEjyC,IAAnBsuB,EAAKqJ,WAA2B+H,EAAIkxB,cAAgBtiC,EAAKqJ,cACxDrJ,EAAKtZ,SAAWA,EAAQ67C,eAAeviC,EAAKtZ,UAAW,CACzD,GAAIsZ,EAAKkhB,SAAU,CACf,IAAI1qC,EAASwpB,EAAKkhB,SAAS9P,GAC3B,IAAe,IAAX56B,EACA,SACJwpB,EAAKoM,MAAQ51B,QAAU9E,CAC3B,CACA,OAAOsuB,CACX,CACJ,CACJ,CAIAwiC,WAAWn7B,EAAM7zB,EAAOkT,EAASoG,GAC7B,IAAK,IAAI1b,EAAI0b,EAAQlc,KAAKixD,OAAOhhC,QAAQ/T,GAAS,EAAI,EAAG1b,EAAIR,KAAKixD,OAAO3wD,OAAQE,IAAK,CAClF,IAAI4uB,EAAOpvB,KAAKixD,OAAOzwD,GAAI4wB,EAAQhC,EAAKgC,MACxC,KAA2B,GAAvBA,EAAMnB,QAAQwG,IACdrH,EAAKtZ,UAAYA,EAAQ67C,eAAeviC,EAAKtZ,UAI7Csb,EAAM9wB,OAASm2B,EAAKn2B,SACkB,IAAjC8wB,EAAMnZ,WAAWwe,EAAKn2B,SAAiB8wB,EAAM9rB,MAAMmxB,EAAKn2B,OAAS,IAAMsC,IANhF,CAQA,GAAIwsB,EAAKkhB,SAAU,CACf,IAAI1qC,EAASwpB,EAAKkhB,SAAS1tC,GAC3B,IAAe,IAAXgD,EACA,SACJwpB,EAAKoM,MAAQ51B,QAAU9E,CAC3B,CACA,OAAOsuB,CAPK,CAQhB,CACJ,CAIAqM,mBAAmBI,GACf,IAAIj2B,EAAS,GACb,SAASoqC,EAAO5gB,GACZ,IAAIyO,EAA4B,MAAjBzO,EAAKyO,SAAmB,GAAKzO,EAAKyO,SAAUr9B,EAAI,EAC/D,KAAOA,EAAIoF,EAAOtF,OAAQE,IAAK,CAC3B,IAAIuR,EAAOnM,EAAOpF,GAClB,IADsD,MAAjBuR,EAAK8rB,SAAmB,GAAK9rB,EAAK8rB,UACpDA,EACf,KACR,CACAj4B,EAAO4I,OAAOhO,EAAG,EAAG4uB,EACxB,CACA,IAAK,IAAI3sB,KAAQo5B,EAAOD,MAAO,CAC3B,IAAIiF,EAAQhF,EAAOD,MAAMn5B,GAAMw5B,KAAKyD,SAChCmB,GACAA,EAAMrzB,SAAQ4hB,IACV4gB,EAAO5gB,EAAOlsB,GAAKksB,IACbA,EAAKgkB,MAAQhkB,EAAKyiC,QAAUziC,EAAK0iC,YACnC1iC,EAAKgkB,KAAO3wC,EAAI,GAEhC,CACA,IAAK,IAAIA,KAAQo5B,EAAOC,MAAO,CAC3B,IAAI+E,EAAQhF,EAAOC,MAAMr5B,GAAMw5B,KAAKyD,SAChCmB,GACAA,EAAMrzB,SAAQ4hB,IACV4gB,EAAO5gB,EAAOlsB,GAAKksB,IACbA,EAAKjhB,MAAQihB,EAAKyiC,QAAUziC,EAAKgkB,OACnChkB,EAAKjhB,KAAO1L,EAAI,GAEhC,CACA,OAAOmD,CACX,CAMA61B,kBAAkBI,GACd,OAAOA,EAAOivB,OAAOiH,YAChBl2B,EAAOivB,OAAOiH,UAAY,IAAIhB,EAAUl1B,EAAQk1B,EAAUiB,YAAYn2B,IAC/E,EAEJ,MAAMo2B,EAAY,CACdC,SAAS,EAAMC,SAAS,EAAMC,OAAO,EAAM5iC,YAAY,EAAM6iC,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,EAC9Ex7B,QAAQ,EAAMwE,GAAG,EAAMmZ,KAAK,EAAM8d,SAAS,EAAMC,OAAO,EAAMC,OAAO,EAAMC,IAAI,GAE7EC,EAAa,CACf5tC,MAAM,EAAMstC,UAAU,EAAMzmD,QAAQ,EAAMgnD,QAAQ,EAAM3iC,OAAO,EAAM/T,OAAO,GAE1E22C,GAAW,CAAEP,IAAI,EAAMI,IAAI,GAGjC,SAASI,GAAapvD,EAAMixC,EAAoB3sC,GAC5C,OAA0B,MAAtB2sC,GACQA,EAHQ,EAG+B,IACnB,SAAvBA,EAJqC,EAIkB,GACzDjxC,GAA2B,OAAnBA,EAAK8qD,WAAsBuE,GAAgD,EAAP/qD,CACvF,CACA,MAAMgrD,GACF9xD,YAAYwC,EAAM22B,EAElBI,EAEAw4B,EAAcC,EAAOtoC,EAAOvpB,GACxBxC,KAAK6E,KAAOA,EACZ7E,KAAKw7B,MAAQA,EACbx7B,KAAK47B,MAAQA,EACb57B,KAAKo0D,aAAeA,EACpBp0D,KAAKq0D,MAAQA,EACbr0D,KAAKwC,QAAUA,EACfxC,KAAKG,QAAU,GAEfH,KAAKs0D,YAActM,EAAKh7B,KAExBhtB,KAAKu0D,WAAa,GAClBv0D,KAAK+rB,MAAQA,IAxBgD,EAwBtCvpB,EAA0B,KAAOqC,EAAKgnD,aACjE,CACA9J,aAAa5zC,GACT,IAAKnO,KAAK+rB,MAAO,CACb,IAAK/rB,KAAK6E,KACN,MAAO,GACX,IAAI4vC,EAAOz0C,KAAK6E,KAAKgnD,aAAagC,WAAW/G,EAAS/3C,KAAKZ,IAC3D,IAAIsmC,EAGC,CACD,IAAoCrc,EAAhC3pB,EAAQzO,KAAK6E,KAAKgnD,aACtB,OAAIzzB,EAAO3pB,EAAMszC,aAAa5zC,EAAKtJ,QAC/B7E,KAAK+rB,MAAQtd,EACN2pB,GAGA,IAEf,CAXIp4B,KAAK+rB,MAAQ/rB,KAAK6E,KAAKgnD,aAAaC,cAAcrX,EAY1D,CACA,OAAOz0C,KAAK+rB,MAAMg2B,aAAa5zC,EAAKtJ,KACxC,CACAwsD,OAAO9I,GACH,KAhDgB,EAgDVvoD,KAAKwC,SAA4B,CACnC,IAAkDy4B,EAA9C8P,EAAO/qC,KAAKG,QAAQH,KAAKG,QAAQG,OAAS,GAC9C,GAAIyqC,GAAQA,EAAKpP,SAAWV,EAAI,oBAAoB/O,KAAK6e,EAAKvzB,OAAQ,CAClE,IAAIA,EAAOuzB,EACPA,EAAKvzB,KAAKlX,QAAU26B,EAAE,GAAG36B,OACzBN,KAAKG,QAAQqW,MAEbxW,KAAKG,QAAQH,KAAKG,QAAQG,OAAS,GAAKkX,EAAK2vC,SAAS3vC,EAAKA,KAAKlS,MAAM,EAAGkS,EAAKA,KAAKlX,OAAS26B,EAAE,GAAG36B,QACzG,CACJ,CACA,IAAIH,EAAU2mD,EAAS/3C,KAAK/O,KAAKG,SAGjC,OAFKooD,GAAWvoD,KAAK+rB,QACjB5rB,EAAUA,EAAQqmC,OAAOxmC,KAAK+rB,MAAM8hC,WAAW/G,EAAS/f,OAAO,KAC5D/mC,KAAK6E,KAAO7E,KAAK6E,KAAKmW,OAAOhb,KAAKw7B,MAAOr7B,EAASH,KAAK47B,OAASz7B,CAC3E,CACAq0D,iBAAiBphB,GACb,IAAK,IAAI5yC,EAAIR,KAAKu0D,WAAWj0D,OAAS,EAAGE,GAAK,EAAGA,IAC7C,GAAI4yC,EAAKxE,GAAG5uC,KAAKu0D,WAAW/zD,IACxB,OAAOR,KAAKu0D,WAAW/lD,OAAOhO,EAAG,GAAG,EAChD,CACAi0D,aAAa5b,GACT,IAAK,IAAIr4C,EAAI,EAAGk0D,EAAU10D,KAAKo0D,aAAc5zD,EAAIk0D,EAAQp0D,OAAQE,IAAK,CAClE,IAAI4yC,EAAOshB,EAAQl0D,IACdR,KAAK6E,KAAO7E,KAAK6E,KAAKk+C,eAAe3P,EAAKvuC,MAAQ8vD,GAAavhB,EAAKvuC,KAAMg0C,MAC1EzF,EAAK/U,QAAQr+B,KAAKs0D,eACnBt0D,KAAKs0D,YAAclhB,EAAK7W,SAASv8B,KAAKs0D,aACtCt0D,KAAKo0D,aAAehhB,EAAK5W,cAAcx8B,KAAKo0D,cAEpD,CACJ,CACAQ,cAAczmD,GACV,OAAInO,KAAK6E,KACE7E,KAAK6E,KAAKu1C,cACjBp6C,KAAKG,QAAQG,OACNN,KAAKG,QAAQ,GAAGu2C,SACpBvoC,EAAK6zB,aAAeiwB,EAAU1wD,eAAe4M,EAAK6zB,WAAW6yB,SAASp3C,cACjF,EAEJ,MAAM0zC,GACF9uD,YAEAoP,EAEAjP,EAASsyD,GACL90D,KAAKyR,OAASA,EACdzR,KAAKwC,QAAUA,EACfxC,KAAK80D,OAASA,EACd90D,KAAKic,KAAO,EACZ,IAA+B84C,EAA3B5E,EAAU3tD,EAAQ2tD,QAClB6E,EAAaf,GAAa,KAAMzxD,EAAQszC,mBAAoB,IAAMgf,EAjGT,EAiGkC,GAE3FC,EADA5E,EACa,IAAIgE,GAAYhE,EAAQtrD,KAAMsrD,EAAQ30B,MAAOwsB,EAAKh7B,KAAMg7B,EAAKh7B,MAAM,EAAMxqB,EAAQyyD,UAAY9E,EAAQtrD,KAAKgnD,aAAcmJ,GAExH,IAAIb,GADZW,EACwB,KAEArjD,EAAOoqB,OAAO6e,YAFR,KAAMsN,EAAKh7B,KAAMg7B,EAAKh7B,MAAM,EAAM,KAAMgoC,GAG/Eh1D,KAAK87B,MAAQ,CAACi5B,GACd/0D,KAAK+7B,KAAOv5B,EAAQ0yD,cACpBl1D,KAAKm1D,YAAa,CACtB,CACI75B,UACA,OAAOt7B,KAAK87B,MAAM97B,KAAKic,KAC3B,CAIAm5C,OAAO50B,GACH,GAAoB,GAAhBA,EAAI6P,SACJrwC,KAAKq1D,YAAY70B,QAEhB,GAAoB,GAAhBA,EAAI6P,SAAe,CACxB,IAAIjf,EAAQoP,EAAIsT,aAAa,SAC7B,GAAK1iB,EAGA,CACD,IAAIwK,EAAQ57B,KAAKs1D,WA4ZjC,SAAqBlkC,GACjB,IAAuC6J,EAAnCgF,EAAK,6BAAiCr6B,EAAS,GACnD,KAAOq1B,EAAIgF,EAAG/T,KAAKkF,IACfxrB,EAAOzE,KAAK85B,EAAE,GAAIA,EAAE,GAAG8hB,QAC3B,OAAOn3C,CACX,CAja4C2vD,CAAYnkC,IACxC,IAAKwK,EACD,OACJ,IAAK45B,EAAUC,GAAe75B,EAAON,EAAMt7B,KAAKs7B,IAChD,IAAK,IAAI96B,EAAI,EAAGA,EAAIi1D,EAAYn1D,OAAQE,IACpCR,KAAK01D,kBAAkBD,EAAYj1D,GAAI86B,GAC3C,IAAK,IAAI96B,EAAI,EAAGA,EAAIg1D,EAASl1D,OAAQE,IACjCR,KAAK21D,eAAeH,EAASh1D,IACjCR,KAAK41D,WAAWp1B,GAChB,IAAK,IAAIhgC,EAAI,EAAGA,EAAIg1D,EAASl1D,OAAQE,IACjCR,KAAK01D,kBAAkBF,EAASh1D,GAAI86B,GACxC,IAAK,IAAI96B,EAAI,EAAGA,EAAIi1D,EAAYn1D,OAAQE,IACpCR,KAAK21D,eAAeF,EAAYj1D,GACxC,MAhBIR,KAAK41D,WAAWp1B,EAiBxB,CACJ,CACA60B,YAAY70B,GACR,IAAI59B,EAAQ49B,EAAIq1B,UACZv6B,EAAMt7B,KAAKs7B,IACf,GA/I0C,EA+ItCA,EAAI94B,SACJ84B,EAAIs5B,cAAcp0B,IAClB,mBAAmBn7B,KAAKzC,GAAQ,CAChC,GAlJY,EAkJN04B,EAAI94B,QAkBNI,EApKkC,EAgK3B04B,EAAI94B,QAIHI,EAAMuC,QAAQ,SAAU,MAHxBvC,EAAMuC,QAAQ,YAAa,UAVnC,GAJAvC,EAAQA,EAAMuC,QAAQ,oBAAqB,KAIvC,mBAAmBE,KAAKzC,IAAU5C,KAAKic,MAAQjc,KAAK87B,MAAMx7B,OAAS,EAAG,CACtE,IAAIqwC,EAAarV,EAAIn7B,QAAQm7B,EAAIn7B,QAAQG,OAAS,GAC9Cw1D,EAAgBt1B,EAAIu1B,kBACnBplB,GACAmlB,GAA2C,MAA1BA,EAAcjB,UAC/BlkB,EAAWhV,QAAU,mBAAmBt2B,KAAKsrC,EAAWn5B,SACzD5U,EAAQA,EAAM0C,MAAM,GAC5B,CAQA1C,GACA5C,KAAKg2D,WAAWh2D,KAAKyR,OAAOoqB,OAAOrkB,KAAK5U,IAC5C5C,KAAKi2D,WAAWz1B,EACpB,MAEIxgC,KAAKk2D,WAAW11B,EAExB,CAGAo1B,WAAWp1B,EAAK21B,GACZ,IAAuCC,EAAnC3zD,EAAO+9B,EAAIq0B,SAASp3C,cACpBu2C,GAASzyD,eAAekB,IAASzC,KAAKyR,OAAOy/C,gBAkVzD,SAAuB1wB,GACnB,IAAK,IAAI1N,EAAQ0N,EAAIyV,WAAYogB,EAAW,KAAMvjC,EAAOA,EAAQA,EAAMwjC,YAAa,CAChF,IAAI7zD,EAAyB,GAAlBqwB,EAAMud,SAAgBvd,EAAM+hC,SAASp3C,cAAgB,KAC5Dhb,GAAQuxD,GAASzyD,eAAekB,IAAS4zD,GACzCA,EAAS30B,YAAY5O,GACrBA,EAAQujC,GAEK,MAAR5zD,EACL4zD,EAAWvjC,EAENrwB,IACL4zD,EAAW,KAEnB,CACJ,CA/VYE,CAAc/1B,GAClB,IAAIpR,EAAQpvB,KAAKwC,QAAQg0D,cAAgBx2D,KAAKwC,QAAQg0D,aAAah2B,KAC9D41B,EAASp2D,KAAKyR,OAAO+/C,SAAShxB,EAAKxgC,KAAMm2D,IAC9C,GAAI/mC,EAAOA,EAAKyiC,OAASiC,EAAWvyD,eAAekB,GAC/CzC,KAAKk2D,WAAW11B,GAChBxgC,KAAKy2D,eAAej2B,QAEnB,IAAKpR,GAAQA,EAAKsnC,MAAQtnC,EAAKunC,YAAa,CACzCvnC,GAAQA,EAAKunC,YACb32D,KAAKic,KAAO3X,KAAKC,IAAI,EAAGvE,KAAKic,KAAO,GAC/BmT,GAAQA,EAAKsnC,KAAKrmB,WACvB7P,EAAMpR,EAAKsnC,MACf,IAAIE,EAAMt7B,EAAMt7B,KAAKs7B,IAAKu7B,EAAgB72D,KAAKm1D,WAC/C,GAAIlD,EAAU1wD,eAAekB,GACrB64B,EAAIn7B,QAAQG,QAAUg7B,EAAIn7B,QAAQ,GAAGu2C,UAAY12C,KAAKic,OACtDjc,KAAKic,OACLqf,EAAMt7B,KAAKs7B,KAEfs7B,GAAO,EACFt7B,EAAIz2B,OACL7E,KAAKm1D,YAAa,QAErB,IAAK30B,EAAIyV,WAEV,YADAj2C,KAAK82D,aAAat2B,GAGtBxgC,KAAKoxD,OAAO5wB,GACRo2B,GACA52D,KAAK42D,KAAKt7B,GACdt7B,KAAKm1D,WAAa0B,CACtB,MAEI72D,KAAK+2D,iBAAiBv2B,EAAKpR,GAAyB,IAAnBA,EAAK4nC,UAAsBZ,OAASt1D,EAE7E,CAEAg2D,aAAat2B,GACW,MAAhBA,EAAIq0B,UAAoB70D,KAAKs7B,IAAIz2B,MAAQ7E,KAAKs7B,IAAIz2B,KAAKu1C,eACvDp6C,KAAKq1D,YAAY70B,EAAIy2B,cAAcC,eAAe,MAC1D,CAEAT,eAAej2B,GAES,MAAhBA,EAAIq0B,UAAsB70D,KAAKs7B,IAAIz2B,MAAS7E,KAAKs7B,IAAIz2B,KAAKu1C,eAC1Dp6C,KAAKm3D,UAAUn3D,KAAKyR,OAAOoqB,OAAOrkB,KAAK,KAC/C,CAIA89C,WAAWrE,GACP,IAAIthD,EAAMq4C,EAAKh7B,KAAMte,EAASs5C,EAAKh7B,KACnC,IAAK,IAAIxsB,EAAI,EAAGA,EAAIywD,EAAO3wD,OAAQE,GAAK,EACpC,IAAK,IAAI0b,IAAqB,CAC1B,IAAIkT,EAAOpvB,KAAKyR,OAAOmgD,WAAWX,EAAOzwD,GAAIywD,EAAOzwD,EAAI,GAAIR,KAAMkc,GAClE,IAAKkT,EACD,MACJ,GAAIA,EAAKyiC,OACL,OAAO,KAUX,GATIziC,EAAK0iC,UACL9xD,KAAKs7B,IAAI84B,aAAa/zD,OAAOL,KAAKs7B,IAAIg5B,aAAa9mD,SAAQytB,IACnD7L,EAAK0iC,UAAU72B,KACfvsB,EAASusB,EAAEsB,SAAS7tB,GAAO,IAInCiB,EAAM3P,KAAKyR,OAAOoqB,OAAOD,MAAMxM,EAAKgkB,MAAMp4B,OAAOoU,EAAKoM,OAAOe,SAAS5sB,IAEnD,IAAnByf,EAAK4nC,UAGL,MAFA96C,EAAQkT,CAGhB,CAEJ,MAAO,CAACzf,EAAKjB,EACjB,CAIAqoD,iBAAiBv2B,EAAKpR,EAAMgoC,GACxB,IAAIR,EAAMvmB,EAAU+C,EAChBhkB,EAAKjhB,MACLkiC,EAAWrwC,KAAKyR,OAAOoqB,OAAOC,MAAM1M,EAAKjhB,MACpCkiC,EAAS6W,OAGJlnD,KAAKg2D,WAAW3lB,EAASr1B,OAAOoU,EAAKoM,SAC3Cx7B,KAAK82D,aAAat2B,GAHlBo2B,EAAO52D,KAAKkR,MAAMm/B,EAAUjhB,EAAKoM,OAAS,KAAMpM,EAAK0mB,sBAQzD1C,EADepzC,KAAKyR,OAAOoqB,OAAOD,MAAMxM,EAAKgkB,MAC7Bp4B,OAAOoU,EAAKoM,OAC5Bx7B,KAAK21D,eAAeviB,IAExB,IAAIikB,EAAUr3D,KAAKs7B,IACnB,GAAI+U,GAAYA,EAAS6W,OACrBlnD,KAAKk2D,WAAW11B,QAEf,GAAI42B,EACLp3D,KAAK41D,WAAWp1B,EAAK42B,QAEpB,GAAIhoC,EAAKkoC,WACVt3D,KAAKk2D,WAAW11B,GAChBpR,EAAKkoC,WAAW92B,EAAKxgC,KAAKyR,OAAOoqB,QAAQruB,SAAQW,GAAQnO,KAAKg2D,WAAW7nD,SAExE,CACD,IAAIopD,EAAa/2B,EACiB,iBAAvBpR,EAAKooC,eACZD,EAAa/2B,EAAIe,cAAcnS,EAAKooC,gBACD,mBAAvBpoC,EAAKooC,eACjBD,EAAanoC,EAAKooC,eAAeh3B,GAC5BpR,EAAKooC,iBACVD,EAAanoC,EAAKooC,gBACtBx3D,KAAKy3D,WAAWj3B,EAAK+2B,GAAY,GACjCv3D,KAAKoxD,OAAOmG,EAChB,CACIX,GAAQ52D,KAAK42D,KAAKS,IAClBr3D,KAAKic,OACLm3B,GACApzC,KAAK01D,kBAAkBtiB,EAAMikB,EACrC,CAIAjG,OAAO3gC,EAAQhX,EAAYE,GACvB,IAAIpL,EAAQkL,GAAc,EAC1B,IAAK,IAAI+mB,EAAM/mB,EAAagX,EAAOinC,WAAWj+C,GAAcgX,EAAOwlB,WAAYrnC,EAAkB,MAAZ+K,EAAmB,KAAO8W,EAAOinC,WAAW/9C,GAAW6mB,GAAO5xB,EAAK4xB,EAAMA,EAAI81B,cAAe/nD,EAC7KvO,KAAK23D,YAAYlnC,EAAQliB,GACzBvO,KAAKo1D,OAAO50B,GAEhBxgC,KAAK23D,YAAYlnC,EAAQliB,EAC7B,CAIA4oD,UAAUhpD,GACN,IAAIypD,EAAOhB,EACX,IAAK,IAAIttC,EAAQtpB,KAAKic,KAAMqN,GAAS,EAAGA,IAAS,CAC7C,IAAIuuC,EAAK73D,KAAK87B,MAAMxS,GAChBs8B,EAAQiS,EAAG9V,aAAa5zC,GAC5B,GAAIy3C,KAAWgS,GAASA,EAAMt3D,OAASslD,EAAMtlD,UACzCs3D,EAAQhS,EACRgR,EAAOiB,GACFjS,EAAMtlD,QACP,MAER,GAAIu3D,EAAGxD,MACH,KACR,CACA,IAAKuD,EACD,OAAO,EACX53D,KAAK42D,KAAKA,GACV,IAAK,IAAIp2D,EAAI,EAAGA,EAAIo3D,EAAMt3D,OAAQE,IAC9BR,KAAK83D,WAAWF,EAAMp3D,GAAI,MAAM,GACpC,OAAO,CACX,CAEAw1D,WAAW7nD,GACP,GAAIA,EAAKuoC,UAAY12C,KAAKm1D,aAAen1D,KAAKs7B,IAAIz2B,KAAM,CACpD,IAAIkzD,EAAQ/3D,KAAKg4D,uBACbD,GACA/3D,KAAK83D,WAAWC,EACxB,CACA,GAAI/3D,KAAKm3D,UAAUhpD,GAAO,CACtBnO,KAAKi4D,aACL,IAAI38B,EAAMt7B,KAAKs7B,IACfA,EAAIm5B,aAAatmD,EAAKtJ,MAClBy2B,EAAIvP,QACJuP,EAAIvP,MAAQuP,EAAIvP,MAAMi2B,UAAU7zC,EAAKtJ,OACzC,IAAI+2B,EAAQN,EAAIg5B,YAChB,IAAK,IAAI9zD,EAAI,EAAGA,EAAI2N,EAAKytB,MAAMt7B,OAAQE,IAC9B86B,EAAIz2B,OAAQy2B,EAAIz2B,KAAKk+C,eAAe50C,EAAKytB,MAAMp7B,GAAGqE,QACnD+2B,EAAQztB,EAAKytB,MAAMp7B,GAAG+7B,SAASX,IAEvC,OADAN,EAAIn7B,QAAQgB,KAAKgN,EAAKilC,KAAKxX,KACpB,CACX,CACA,OAAO,CACX,CAGA1qB,MAAMrM,EAAM22B,EAAO08B,GACf,IAAIrnD,EAAK7Q,KAAKm3D,UAAUtyD,EAAKmW,OAAOwgB,IAGpC,OAFI3qB,GACA7Q,KAAK83D,WAAWjzD,EAAM22B,GAAO,EAAM08B,GAChCrnD,CACX,CAEAinD,WAAWjzD,EAAM22B,EAAQ,KAAM64B,GAAQ,EAAO6D,GAC1Cl4D,KAAKi4D,aACL,IAAI38B,EAAMt7B,KAAKs7B,IACfA,EAAIm5B,aAAa5vD,GACjBy2B,EAAIvP,MAAQuP,EAAIvP,OAASuP,EAAIvP,MAAMi2B,UAAUn9C,GAC7C,IAAIrC,EAAUyxD,GAAapvD,EAAMqzD,EAAY58B,EAAI94B,SAnXY,EAoXxD84B,EAAI94B,SAAkD,GAAtB84B,EAAIn7B,QAAQG,SAC7CkC,GArXyD,GAsX7DxC,KAAK87B,MAAM36B,KAAK,IAAIgzD,GAAYtvD,EAAM22B,EAAOF,EAAIg5B,YAAah5B,EAAI84B,aAAcC,EAAO,KAAM7xD,IAC7FxC,KAAKic,MACT,CAGAg8C,WAAW1P,GAAU,GACjB,IAAI/nD,EAAIR,KAAK87B,MAAMx7B,OAAS,EAC5B,GAAIE,EAAIR,KAAKic,KAAM,CACf,KAAOzb,EAAIR,KAAKic,KAAMzb,IAClBR,KAAK87B,MAAMt7B,EAAI,GAAGL,QAAQgB,KAAKnB,KAAK87B,MAAMt7B,GAAG6wD,OAAO9I,IACxDvoD,KAAK87B,MAAMx7B,OAASN,KAAKic,KAAO,CACpC,CACJ,CACAo1C,SAGI,OAFArxD,KAAKic,KAAO,EACZjc,KAAKi4D,WAAWj4D,KAAK80D,QACd90D,KAAK87B,MAAM,GAAGu1B,OAAOrxD,KAAK80D,QAAU90D,KAAKwC,QAAQ21D,QAC5D,CACAvB,KAAK9vB,GACD,IAAK,IAAItmC,EAAIR,KAAKic,KAAMzb,GAAK,EAAGA,IAC5B,GAAIR,KAAK87B,MAAMt7B,IAAMsmC,EAEjB,OADA9mC,KAAKic,KAAOzb,GACL,EAEf,OAAO,CACX,CACI43D,iBACAp4D,KAAKi4D,aACL,IAAI3xC,EAAM,EACV,IAAK,IAAI9lB,EAAIR,KAAKic,KAAMzb,GAAK,EAAGA,IAAK,CACjC,IAAIL,EAAUH,KAAK87B,MAAMt7B,GAAGL,QAC5B,IAAK,IAAI+8B,EAAI/8B,EAAQG,OAAS,EAAG48B,GAAK,EAAGA,IACrC5W,GAAOnmB,EAAQ+8B,GAAGgX,SAClB1zC,GACA8lB,GACR,CACA,OAAOA,CACX,CACAqxC,YAAYlnC,EAAQ3c,GAChB,GAAI9T,KAAK+7B,KACL,IAAK,IAAIv7B,EAAI,EAAGA,EAAIR,KAAK+7B,KAAKz7B,OAAQE,IAC9BR,KAAK+7B,KAAKv7B,GAAG2N,MAAQsiB,GAAUzwB,KAAK+7B,KAAKv7B,GAAGsT,QAAUA,IACtD9T,KAAK+7B,KAAKv7B,GAAG8lB,IAAMtmB,KAAKo4D,WAExC,CACAlC,WAAWzlC,GACP,GAAIzwB,KAAK+7B,KACL,IAAK,IAAIv7B,EAAI,EAAGA,EAAIR,KAAK+7B,KAAKz7B,OAAQE,IACV,MAApBR,KAAK+7B,KAAKv7B,GAAG8lB,KAAkC,GAAnBmK,EAAO4f,UAAiB5f,EAAO4nC,SAASr4D,KAAK+7B,KAAKv7B,GAAG2N,QACjFnO,KAAK+7B,KAAKv7B,GAAG8lB,IAAMtmB,KAAKo4D,WAExC,CACAX,WAAWhnC,EAAQtwB,EAASuP,GACxB,GAAI+gB,GAAUtwB,GAAWH,KAAK+7B,KAC1B,IAAK,IAAIv7B,EAAI,EAAGA,EAAIR,KAAK+7B,KAAKz7B,OAAQE,IACV,MAApBR,KAAK+7B,KAAKv7B,GAAG8lB,KAAkC,GAAnBmK,EAAO4f,UAAiB5f,EAAO4nC,SAASr4D,KAAK+7B,KAAKv7B,GAAG2N,OACvEhO,EAAQm4D,wBAAwBt4D,KAAK+7B,KAAKv7B,GAAG2N,OAC5CuB,EAAS,EAAI,KACpB1P,KAAK+7B,KAAKv7B,GAAG8lB,IAAMtmB,KAAKo4D,WAG5C,CACAnC,WAAWsC,GACP,GAAIv4D,KAAK+7B,KACL,IAAK,IAAIv7B,EAAI,EAAGA,EAAIR,KAAK+7B,KAAKz7B,OAAQE,IAC9BR,KAAK+7B,KAAKv7B,GAAG2N,MAAQoqD,IACrBv4D,KAAK+7B,KAAKv7B,GAAG8lB,IAAMtmB,KAAKo4D,YAAcG,EAAS1C,UAAUv1D,OAASN,KAAK+7B,KAAKv7B,GAAGsT,QAE/F,CAEA69C,eAAe77C,GACX,GAAIA,EAAQma,QAAQ,MAAQ,EACxB,OAAOna,EAAQ2c,MAAM,YAAYjB,KAAKxxB,KAAK2xD,eAAgB3xD,MAC/D,IAAIi0B,EAAQne,EAAQ2c,MAAM,KACtB+lC,EAASx4D,KAAKwC,QAAQsT,QACtB2iD,IAAWz4D,KAAK80D,QAAY0D,GAAUA,EAAO/nC,OAAO5rB,MAAQ7E,KAAK87B,MAAM,GAAGj3B,MAC1E6zD,IAAaF,EAASA,EAAOlvC,MAAQ,EAAI,IAAMmvC,EAAU,EAAI,GAC7D1sC,EAAQ,CAACvrB,EAAG8oB,KACZ,KAAO9oB,GAAK,EAAGA,IAAK,CAChB,IAAIi3B,EAAOxD,EAAMzzB,GACjB,GAAY,IAARi3B,EAAY,CACZ,GAAIj3B,GAAKyzB,EAAM3zB,OAAS,GAAU,GAALE,EACzB,SACJ,KAAO8oB,GAASovC,EAAUpvC,IACtB,GAAIyC,EAAMvrB,EAAI,EAAG8oB,GACb,OAAO,EACf,OAAO,CACX,CACK,CACD,IAAIvX,EAAOuX,EAAQ,GAAe,GAATA,GAAcmvC,EAAWz4D,KAAK87B,MAAMxS,GAAOzkB,KAC9D2zD,GAAUlvC,GAASovC,EAAWF,EAAOrqD,KAAKmb,EAAQovC,GAAU7zD,KACxD,KACV,IAAKkN,GAASA,EAAKtP,MAAQg1B,IAAsC,GAA9B1lB,EAAK+iC,OAAO7kB,QAAQwH,GACnD,OAAO,EACXnO,GACJ,CACJ,CACA,OAAO,CAAI,EAEf,OAAOyC,EAAMkI,EAAM3zB,OAAS,EAAGN,KAAKic,KACxC,CACA+7C,uBACI,IAAIW,EAAW34D,KAAKwC,QAAQsT,QAC5B,GAAI6iD,EACA,IAAK,IAAItsC,EAAIssC,EAASrvC,MAAO+C,GAAK,EAAGA,IAAK,CACtC,IAAI43B,EAAQ0U,EAASxqD,KAAKke,GAAGysB,eAAe6f,EAAS5nB,WAAW1kB,IAAI0sB,YACpE,GAAIkL,GAASA,EAAMrL,aAAeqL,EAAMmH,aACpC,OAAOnH,CACf,CACJ,IAAK,IAAIxhD,KAAQzC,KAAKyR,OAAOoqB,OAAOC,MAAO,CACvC,IAAIj3B,EAAO7E,KAAKyR,OAAOoqB,OAAOC,MAAMr5B,GACpC,GAAIoC,EAAK+zC,aAAe/zC,EAAKumD,aACzB,OAAOvmD,CACf,CACJ,CACA8wD,eAAeviB,GACX,IAAIwS,EAiFZ,SAA2BxS,EAAM3qC,GAC7B,IAAK,IAAIjI,EAAI,EAAGA,EAAIiI,EAAInI,OAAQE,IAC5B,GAAI4yC,EAAKxE,GAAGnmC,EAAIjI,IACZ,OAAOiI,EAAIjI,EAEvB,CAtFoBo4D,CAAkBxlB,EAAMpzC,KAAKs7B,IAAI84B,cACzCxO,GACA5lD,KAAKs7B,IAAIi5B,WAAWpzD,KAAKykD,GAC7B5lD,KAAKs7B,IAAI84B,aAAehhB,EAAK7W,SAASv8B,KAAKs7B,IAAI84B,aACnD,CACAsB,kBAAkBtiB,EAAMxI,GACpB,IAAK,IAAIthB,EAAQtpB,KAAKic,KAAMqN,GAAS,EAAGA,IAAS,CAC7C,IAAIsrB,EAAQ50C,KAAK87B,MAAMxS,GAEvB,GADYsrB,EAAMwf,aAAa7jC,YAAY6iB,IAC9B,EACTwB,EAAMwf,aAAehhB,EAAK5W,cAAcoY,EAAMwf,kBAE7C,CACDxf,EAAM0f,YAAclhB,EAAK5W,cAAcoY,EAAM0f,aAC7C,IAAIuE,EAAYjkB,EAAM4f,iBAAiBphB,GACnCylB,GAAajkB,EAAM/vC,MAAQ+vC,EAAM/vC,KAAKk+C,eAAe8V,EAAUh0D,QAC/D+vC,EAAM0f,YAAcuE,EAAUt8B,SAASqY,EAAM0f,aACrD,CACA,GAAI1f,GAAShK,EACT,KACR,CACJ,EAqBJ,SAAS6mB,GAAQjxB,EAAKs4B,GAClB,OAAQt4B,EAAIixB,SAAWjxB,EAAIu4B,mBAAqBv4B,EAAIw4B,uBAAyBx4B,EAAIy4B,oBAAoBl3D,KAAKy+B,EAAKs4B,EACnH,CAQA,SAAS51D,GAAKjB,GACV,IAAIiB,EAAO,CAAC,EACZ,IAAK,IAAIuzB,KAAQx0B,EACbiB,EAAKuzB,GAAQx0B,EAAIw0B,GACrB,OAAOvzB,CACX,CAIA,SAASyxD,GAAa9R,EAAUxS,GAC5B,IAAIvU,EAAQuU,EAASxU,OAAOC,MAC5B,IAAK,IAAIr5B,KAAQq5B,EAAO,CACpB,IAAIrL,EAASqL,EAAMr5B,GACnB,IAAKguB,EAAOsyB,eAAeF,GACvB,SACJ,IAAIpuC,EAAO,GAAIssC,EAAQh1B,IACnBtX,EAAKtT,KAAK4qB,GACV,IAAK,IAAIvrB,EAAI,EAAGA,EAAIurB,EAAMq1B,UAAW5gD,IAAK,CACtC,IAAI,KAAEqE,EAAI,KAAEkN,GAASga,EAAMs1B,KAAK7gD,GAChC,GAAIqE,GAAQwrC,EACR,OAAO,EACX,GAAI57B,EAAKwb,QAAQle,GAAQ,GAAKgvC,EAAKhvC,GAC/B,OAAO,CACf,GAEJ,GAAIgvC,EAAKtwB,EAAOo7B,cACZ,OAAO,CACf,CACJ,CAYA,MAAMqN,GAUF72D,YAIAy5B,EAIAF,GACI57B,KAAK87B,MAAQA,EACb97B,KAAK47B,MAAQA,CACjB,CAOAu9B,kBAAkBjvC,EAAU1nB,EAAU,CAAC,EAAGD,GACjCA,IACDA,EAASkqB,GAAIjqB,GAAS42D,0BAC1B,IAAI99B,EAAM/4B,EAAQ4rD,EAAS,GA6B3B,OA5BAjkC,EAAS1c,SAAQW,IACb,GAAIggD,EAAO7tD,QAAU6N,EAAKytB,MAAMt7B,OAAQ,CACpC,IAAI+4D,EAAO,EAAGC,EAAW,EACzB,KAAOD,EAAOlL,EAAO7tD,QAAUg5D,EAAWnrD,EAAKytB,MAAMt7B,QAAQ,CACzD,IAAIyR,EAAO5D,EAAKytB,MAAM09B,GACtB,GAAKt5D,KAAK47B,MAAM7pB,EAAKlN,KAAKpC,MAA1B,CAIA,IAAKsP,EAAK68B,GAAGuf,EAAOkL,GAAM,MAAmC,IAA5BtnD,EAAKlN,KAAKo3B,KAAKs9B,SAC5C,MACJF,IACAC,GAJA,MAFIA,GAOR,CACA,KAAOD,EAAOlL,EAAO7tD,QACjBg7B,EAAM6yB,EAAO33C,MAAM,GACvB,KAAO8iD,EAAWnrD,EAAKytB,MAAMt7B,QAAQ,CACjC,IAAIqP,EAAMxB,EAAKytB,MAAM09B,KACjBE,EAAUx5D,KAAKy5D,cAAc9pD,EAAKxB,EAAKuoC,SAAUl0C,GACjDg3D,IACArL,EAAOhtD,KAAK,CAACwO,EAAK2rB,IAClBA,EAAIoG,YAAY83B,EAAQh5B,KACxBlF,EAAMk+B,EAAQjC,YAAciC,EAAQh5B,IAE5C,CACJ,CACAlF,EAAIoG,YAAY1hC,KAAK05D,mBAAmBvrD,EAAM3L,GAAS,IAEpDD,CACX,CAIAm3D,mBAAmBvrD,EAAM3L,GACrB,IAAI,IAAEg+B,EAAG,WAAE+2B,GAAe2B,GAAcS,WAAWltC,GAAIjqB,GAAUxC,KAAK87B,MAAM3tB,EAAKtJ,KAAKpC,MAAM0L,IAC5F,GAAIopD,EAAY,CACZ,GAAIppD,EAAK+4C,OACL,MAAM,IAAII,WAAW,gDACzBtnD,KAAKm5D,kBAAkBhrD,EAAKhO,QAASqC,EAAS+0D,EAClD,CACA,OAAO/2B,CACX,CAQAo5B,cAAczrD,EAAM3L,EAAU,CAAC,GAC3B,IAAIg+B,EAAMxgC,KAAK05D,mBAAmBvrD,EAAM3L,GACxC,IAAK,IAAIhC,EAAI2N,EAAKytB,MAAMt7B,OAAS,EAAGE,GAAK,EAAGA,IAAK,CAC7C,IAAI43B,EAAOp4B,KAAKy5D,cAActrD,EAAKytB,MAAMp7B,GAAI2N,EAAKuoC,SAAUl0C,GACxD41B,KACCA,EAAKm/B,YAAcn/B,EAAKoI,KAAKkB,YAAYlB,GAC1CA,EAAMpI,EAAKoI,IAEnB,CACA,OAAOA,CACX,CAIAi5B,cAAcrmB,EAAMgD,EAAQ5zC,EAAU,CAAC,GACnC,IAAIwwC,EAAQhzC,KAAK47B,MAAMwX,EAAKvuC,KAAKpC,MACjC,OAAOuwC,GAASkmB,GAAcS,WAAWltC,GAAIjqB,GAAUwwC,EAAMI,EAAMgD,GACvE,CAMA3a,kBAAkBhP,EAAKotC,EAAWC,EAAQ,MACtC,GAAwB,iBAAbD,EACP,MAAO,CAAEr5B,IAAK/T,EAAIyqC,eAAe2C,IACrC,GAA0B,MAAtBA,EAAUxpB,SACV,MAAO,CAAE7P,IAAKq5B,GAClB,GAAIA,EAAUr5B,KAAiC,MAA1Bq5B,EAAUr5B,IAAI6P,SAC/B,OAAOwpB,EACX,IAKItC,EALAn4C,EAAUy6C,EAAU,GAAIE,EAAQ36C,EAAQ6Q,QAAQ,KAChD8pC,EAAQ,IACRD,EAAQ16C,EAAQ9Z,MAAM,EAAGy0D,GACzB36C,EAAUA,EAAQ9Z,MAAMy0D,EAAQ,IAGpC,IAAIv5B,EAAOs5B,EAAQrtC,EAAIutC,gBAAgBF,EAAO16C,GAAWqN,EAAIpL,cAAcjC,GACvEoc,EAAQq+B,EAAU,GAAIprD,EAAQ,EAClC,GAAI+sB,GAAyB,iBAATA,GAAuC,MAAlBA,EAAM6U,WAAqBvuC,MAAMF,QAAQ45B,GAAQ,CACtF/sB,EAAQ,EACR,IAAK,IAAIhM,KAAQ+4B,EACb,GAAmB,MAAfA,EAAM/4B,GAAe,CACrB,IAAIs3D,EAAQt3D,EAAKwtB,QAAQ,KACrB8pC,EAAQ,EACRv5B,EAAIy5B,eAAex3D,EAAK6C,MAAM,EAAGy0D,GAAQt3D,EAAK6C,MAAMy0D,EAAQ,GAAIv+B,EAAM/4B,IAEtE+9B,EAAIoB,aAAan/B,EAAM+4B,EAAM/4B,GACrC,CACR,CACA,IAAK,IAAIjC,EAAIiO,EAAOjO,EAAIq5D,EAAUv5D,OAAQE,IAAK,CAC3C,IAAIsyB,EAAQ+mC,EAAUr5D,GACtB,GAAc,IAAVsyB,EAAa,CACb,GAAItyB,EAAIq5D,EAAUv5D,OAAS,GAAKE,EAAIiO,EAChC,MAAM,IAAI64C,WAAW,0DACzB,MAAO,CAAE9mB,MAAK+2B,WAAY/2B,EAC9B,CACK,CACD,IAAMA,IAAKkH,EAAO6vB,WAAY2C,GAAiBhB,GAAcS,WAAWltC,EAAKqG,EAAOgnC,GAEpF,GADAt5B,EAAIkB,YAAYgG,GACZwyB,EAAc,CACd,GAAI3C,EACA,MAAM,IAAIjQ,WAAW,0BACzBiQ,EAAa2C,CACjB,CACJ,CACJ,CACA,MAAO,CAAE15B,MAAK+2B,aAClB,CAKA97B,kBAAkBI,GACd,OAAOA,EAAOivB,OAAOqP,gBAChBt+B,EAAOivB,OAAOqP,cAAgB,IAAIjB,GAAcl5D,KAAKo6D,gBAAgBv+B,GAAS77B,KAAKq6D,gBAAgBx+B,IAC5G,CAKAJ,uBAAuBI,GACnB,IAAIj2B,EAAS00D,GAAYz+B,EAAOC,OAGhC,OAFKl2B,EAAO4R,OACR5R,EAAO4R,KAAOrJ,GAAQA,EAAKqJ,MACxB5R,CACX,CAIA61B,uBAAuBI,GACnB,OAAOy+B,GAAYz+B,EAAOD,MAC9B,EAEJ,SAAS0+B,GAAYr4D,GACjB,IAAI2D,EAAS,CAAC,EACd,IAAK,IAAInD,KAAQR,EAAK,CAClB,IAAI+wC,EAAQ/wC,EAAIQ,GAAMw5B,KAAK+W,MACvBA,IACAptC,EAAOnD,GAAQuwC,EACvB,CACA,OAAOptC,CACX,CACA,SAAS6mB,GAAIjqB,GACT,OAAOA,EAAQoS,UAAY2lD,OAAO3lD,QACtC,+HCp0GA,MAAM4lD,EAAcn5D,OAAO2Z,OAAO,MAKlC,MAAMy/C,EAMFp4D,YAKA8xC,EAKA0P,EAAOpY,GACHzrC,KAAKm0C,QAAUA,EACfn0C,KAAK6jD,MAAQA,EACb7jD,KAAKyrC,OAASA,GAAU,CAAC,IAAIivB,EAAevmB,EAAQ1vC,IAAIo/C,GAAQ1P,EAAQ5vC,IAAIs/C,IAChF,CAII8W,aAAW,OAAO36D,KAAKm0C,QAAQ7tB,GAAK,CAIpCJ,WAAS,OAAOlmB,KAAK6jD,MAAMv9B,GAAK,CAIhCvX,WAAS,OAAO/O,KAAKg1C,MAAM1uB,GAAK,CAIhCwgB,SAAO,OAAO9mC,KAAKy3C,IAAInxB,GAAK,CAI5B0uB,YACA,OAAOh1C,KAAKyrC,OAAO,GAAGuJ,KAC1B,CAIIyC,UACA,OAAOz3C,KAAKyrC,OAAO,GAAGgM,GAC1B,CAII1Q,YACA,IAAI0E,EAASzrC,KAAKyrC,OAClB,IAAK,IAAIjrC,EAAI,EAAGA,EAAIirC,EAAOnrC,OAAQE,IAC/B,GAAIirC,EAAOjrC,GAAGw0C,MAAM1uB,KAAOmlB,EAAOjrC,GAAGi3C,IAAInxB,IACrC,OAAO,EACf,OAAO,CACX,CAIAnmB,UACI,OAAOH,KAAKg1C,MAAMvoB,IAAInnB,MAAMtF,KAAK+O,KAAM/O,KAAK8mC,IAAI,EACpD,CAKA3hC,QAAQmjC,EAAInoC,EAAU,YAIlB,IAAIy6D,EAAWz6D,EAAQA,QAAQ0yC,UAAWgoB,EAAa,KACvD,IAAK,IAAIr6D,EAAI,EAAGA,EAAIL,EAAQooD,QAAS/nD,IACjCq6D,EAAaD,EACbA,EAAWA,EAAS/nB,UAExB,IAAI7K,EAAUM,EAAGc,MAAM9oC,OAAQmrC,EAASzrC,KAAKyrC,OAC7C,IAAK,IAAIjrC,EAAI,EAAGA,EAAIirC,EAAOnrC,OAAQE,IAAK,CACpC,IAAI,MAAEw0C,EAAK,IAAEyC,GAAQhM,EAAOjrC,GAAIooC,EAAUN,EAAGM,QAAQtjC,MAAM0iC,GAC3DM,EAAGwyB,aAAalyB,EAAQ3oC,IAAI+0C,EAAM1uB,KAAMsiB,EAAQ3oC,IAAIw3C,EAAInxB,KAAM9lB,EAAI,WAAcL,GACvE,GAALK,GACAu6D,EAAwBzyB,EAAIN,GAAU4yB,EAAWA,EAASlkB,SAAWmkB,GAAcA,EAAWjiB,cAAgB,EAAI,EAC1H,CACJ,CAKAtJ,YAAYhH,EAAIn6B,GACZ,IAAI65B,EAAUM,EAAGc,MAAM9oC,OAAQmrC,EAASzrC,KAAKyrC,OAC7C,IAAK,IAAIjrC,EAAI,EAAGA,EAAIirC,EAAOnrC,OAAQE,IAAK,CACpC,IAAI,MAAEw0C,EAAK,IAAEyC,GAAQhM,EAAOjrC,GAAIooC,EAAUN,EAAGM,QAAQtjC,MAAM0iC,GACvDj5B,EAAO65B,EAAQ3oC,IAAI+0C,EAAM1uB,KAAMwgB,EAAK8B,EAAQ3oC,IAAIw3C,EAAInxB,KACpD9lB,EACA8nC,EAAG0yB,YAAYjsD,EAAM+3B,IAGrBwB,EAAGuO,iBAAiB9nC,EAAM+3B,EAAI34B,GAC9B4sD,EAAwBzyB,EAAIN,EAAS75B,EAAKuoC,UAAY,EAAI,GAElE,CACJ,CAQAjb,gBAAgBwlB,EAAMga,EAAKC,GAAW,GAClC,IAAIxzB,EAAQuZ,EAAKxwB,OAAO2pB,cAAgB,IAAI+gB,EAAcla,GACpDma,EAAgBna,EAAK9yC,KAAK,GAAI8yC,EAAKxwB,OAAQwwB,EAAK36B,IAAK26B,EAAK1yC,QAAS0sD,EAAKC,GAC9E,GAAIxzB,EACA,OAAOA,EACX,IAAK,IAAIpe,EAAQ23B,EAAK33B,MAAQ,EAAGA,GAAS,EAAGA,IAAS,CAClD,IAAIs8B,EAAQqV,EAAM,EACZG,EAAgBna,EAAK9yC,KAAK,GAAI8yC,EAAK9yC,KAAKmb,GAAQ23B,EAAKvxC,OAAO4Z,EAAQ,GAAI23B,EAAK1yC,MAAM+a,GAAQ2xC,EAAKC,GAChGE,EAAgBna,EAAK9yC,KAAK,GAAI8yC,EAAK9yC,KAAKmb,GAAQ23B,EAAK/kC,MAAMoN,EAAQ,GAAI23B,EAAK1yC,MAAM+a,GAAS,EAAG2xC,EAAKC,GACzG,GAAItV,EACA,OAAOA,CACf,CACA,OAAO,IACX,CAMAnqB,YAAYwlB,EAAMoa,EAAO,GACrB,OAAOr7D,KAAKs7D,SAASra,EAAMoa,IAASr7D,KAAKs7D,SAASra,GAAOoa,IAAS,IAAIE,EAAata,EAAK9yC,KAAK,GACjG,CAOAstB,eAAehP,GACX,OAAO2uC,EAAgB3uC,EAAKA,EAAK,EAAG,EAAG,IAAM,IAAI8uC,EAAa9uC,EAClE,CAKAgP,aAAahP,GACT,OAAO2uC,EAAgB3uC,EAAKA,EAAKA,EAAItsB,QAAQ8Q,KAAMwb,EAAImmB,YAAa,IAAM,IAAI2oB,EAAa9uC,EAC/F,CAKAgP,gBAAgBhP,EAAK07B,GACjB,IAAKA,IAASA,EAAKtjD,KACf,MAAM,IAAIyiD,WAAW,wCACzB,IAAIkU,EAAMhB,EAAYrS,EAAKtjD,MAC3B,IAAK22D,EACD,MAAM,IAAIlU,WAAW,qBAAqBa,EAAKtjD,gBACnD,OAAO22D,EAAI5S,SAASn8B,EAAK07B,EAC7B,CAOA1sB,cAAcx6B,EAAIw6D,GACd,GAAIx6D,KAAMu5D,EACN,MAAM,IAAIlT,WAAW,sCAAwCrmD,GAGjE,OAFAu5D,EAAYv5D,GAAMw6D,EAClBA,EAAen6D,UAAUo6D,OAASz6D,EAC3Bw6D,CACX,CAUA1vB,cACI,OAAOovB,EAAcx4C,QAAQ3iB,KAAKm0C,QAASn0C,KAAK6jD,OAAO9X,aAC3D,EAEJ0uB,EAAUn5D,UAAUq6D,SAAU,EAI9B,MAAMjB,EAIFr4D,YAIA2yC,EAIAyC,GACIz3C,KAAKg1C,MAAQA,EACbh1C,KAAKy3C,IAAMA,CACf,EAEJ,IAAImkB,GAA2B,EAC/B,SAASC,EAAmB5a,GACnB2a,GAA6B3a,EAAKxwB,OAAO2pB,gBAC1CwhB,GAA2B,EAC3Bz4B,QAAc,KAAE,wEAA0E8d,EAAKxwB,OAAO5rB,KAAKpC,KAAO,KAE1H,CAOA,MAAM04D,UAAsBV,EAIxBp4D,YAAY8xC,EAAS0P,EAAQ1P,GACzB0nB,EAAmB1nB,GACnB0nB,EAAmBhY,GACnB3vB,MAAMigB,EAAS0P,EACnB,CAKInF,cAAY,OAAO1+C,KAAKm0C,QAAQ7tB,KAAOtmB,KAAK6jD,MAAMv9B,IAAMtmB,KAAK6jD,MAAQ,IAAM,CAC/E5jD,IAAIwsB,EAAKmc,GACL,IAAIib,EAAQp3B,EAAI1hB,QAAQ69B,EAAQ3oC,IAAID,KAAKkmB,OACzC,IAAK29B,EAAMpzB,OAAO2pB,cACd,OAAOqgB,EAAUqB,KAAKjY,GAC1B,IAAI1P,EAAU1nB,EAAI1hB,QAAQ69B,EAAQ3oC,IAAID,KAAK26D,SAC3C,OAAO,IAAIQ,EAAchnB,EAAQ1jB,OAAO2pB,cAAgBjG,EAAU0P,EAAOA,EAC7E,CACA1+C,QAAQmjC,EAAInoC,EAAU,YAElB,GADA+zB,MAAM/uB,QAAQmjC,EAAInoC,GACdA,GAAW,WAAa,CACxB,IAAIy7B,EAAQ57B,KAAKg1C,MAAMuV,YAAYvqD,KAAKy3C,KACpC7b,GACA0M,EAAGyzB,YAAYngC,EACvB,CACJ,CACAgT,GAAG3pC,GACC,OAAOA,aAAiBk2D,GAAiBl2D,EAAM01D,QAAU36D,KAAK26D,QAAU11D,EAAMihB,MAAQlmB,KAAKkmB,IAC/F,CACA6lB,cACI,OAAO,IAAIiwB,EAAah8D,KAAK26D,OAAQ36D,KAAKkmB,KAC9C,CACAmgB,SACI,MAAO,CAAExhC,KAAM,OAAQ81D,OAAQ36D,KAAK26D,OAAQz0C,KAAMlmB,KAAKkmB,KAC3D,CAIAuV,gBAAgBhP,EAAK07B,GACjB,GAA0B,iBAAfA,EAAKwS,QAA0C,iBAAbxS,EAAKjiC,KAC9C,MAAM,IAAIohC,WAAW,4CACzB,OAAO,IAAI6T,EAAc1uC,EAAI1hB,QAAQo9C,EAAKwS,QAASluC,EAAI1hB,QAAQo9C,EAAKjiC,MACxE,CAIAuV,cAAchP,EAAKkuC,EAAQz0C,EAAOy0C,GAC9B,IAAIxmB,EAAU1nB,EAAI1hB,QAAQ4vD,GAC1B,OAAO,IAAI36D,KAAKm0C,EAASjuB,GAAQy0C,EAASxmB,EAAU1nB,EAAI1hB,QAAQmb,GACpE,CASAuV,eAAe0Y,EAAS0P,EAAOwX,GAC3B,IAAIY,EAAO9nB,EAAQ7tB,IAAMu9B,EAAMv9B,IAG/B,GAFK+0C,IAAQY,IACTZ,EAAOY,GAAQ,EAAI,GAAK,IACvBpY,EAAMpzB,OAAO2pB,cAAe,CAC7B,IAAIwL,EAAQ6U,EAAUa,SAASzX,EAAOwX,GAAM,IAASZ,EAAUa,SAASzX,GAAQwX,GAAM,GACtF,IAAIzV,EAGA,OAAO6U,EAAUqB,KAAKjY,EAAOwX,GAF7BxX,EAAQ+B,EAAM/B,KAGtB,CAWA,OAVK1P,EAAQ1jB,OAAO2pB,gBACJ,GAAR6hB,IAIA9nB,GAAWsmB,EAAUa,SAASnnB,GAAUknB,GAAM,IAASZ,EAAUa,SAASnnB,EAASknB,GAAM,IAAOlnB,SACnF7tB,IAAMu9B,EAAMv9B,KAAS21C,EAAO,KAJzC9nB,EAAU0P,GAQX,IAAIsX,EAAchnB,EAAS0P,EACtC,EAEJ4W,EAAUiB,OAAO,OAAQP,GACzB,MAAMa,EACF35D,YAAYs4D,EAAQz0C,GAChBlmB,KAAK26D,OAASA,EACd36D,KAAKkmB,KAAOA,CAChB,CACAjmB,IAAI2oC,GACA,OAAO,IAAIozB,EAAapzB,EAAQ3oC,IAAID,KAAK26D,QAAS/xB,EAAQ3oC,IAAID,KAAKkmB,MACvE,CACAnb,QAAQ0hB,GACJ,OAAO0uC,EAAcx4C,QAAQ8J,EAAI1hB,QAAQ/K,KAAK26D,QAASluC,EAAI1hB,QAAQ/K,KAAKkmB,MAC5E,EASJ,MAAMg2C,UAAsBzB,EAKxBp4D,YAAY4+C,GACR,IAAI9yC,EAAO8yC,EAAKlJ,UACZ+R,EAAO7I,EAAK9yC,KAAK,GAAGpD,QAAQk2C,EAAK36B,IAAMnY,EAAK+lC,UAChDhgB,MAAM+sB,EAAM6I,GACZ9pD,KAAKmO,KAAOA,CAChB,CACAlO,IAAIwsB,EAAKmc,GACL,IAAI,QAAEuzB,EAAO,IAAE71C,GAAQsiB,EAAQwzB,UAAUp8D,KAAK26D,QAC1C1Z,EAAOx0B,EAAI1hB,QAAQub,GACvB,OAAI61C,EACO1B,EAAUqB,KAAK7a,GACnB,IAAIib,EAAcjb,EAC7B,CACA9gD,UACI,OAAO,IAAI,KAAM,UAAcH,KAAKmO,MAAO,EAAG,EAClD,CACAygC,GAAG3pC,GACC,OAAOA,aAAiBi3D,GAAiBj3D,EAAM01D,QAAU36D,KAAK26D,MAClE,CACAt0B,SACI,MAAO,CAAExhC,KAAM,OAAQ81D,OAAQ36D,KAAK26D,OACxC,CACA5uB,cAAgB,OAAO,IAAIswB,EAAar8D,KAAK26D,OAAS,CAItDl/B,gBAAgBhP,EAAK07B,GACjB,GAA0B,iBAAfA,EAAKwS,OACZ,MAAM,IAAIrT,WAAW,4CACzB,OAAO,IAAI4U,EAAczvC,EAAI1hB,QAAQo9C,EAAKwS,QAC9C,CAIAl/B,cAAchP,EAAK1d,GACf,OAAO,IAAImtD,EAAczvC,EAAI1hB,QAAQgE,GACzC,CAKA0sB,oBAAoBttB,GAChB,OAAQA,EAAKwtB,SAAwC,IAA9BxtB,EAAKtJ,KAAKo3B,KAAKoa,UAC1C,EAEJ6lB,EAAc56D,UAAUq6D,SAAU,EAClClB,EAAUiB,OAAO,OAAQQ,GACzB,MAAMG,EACFh6D,YAAYs4D,GACR36D,KAAK26D,OAASA,CAClB,CACA16D,IAAI2oC,GACA,IAAI,QAAEuzB,EAAO,IAAE71C,GAAQsiB,EAAQwzB,UAAUp8D,KAAK26D,QAC9C,OAAOwB,EAAU,IAAIH,EAAa11C,EAAKA,GAAO,IAAI+1C,EAAa/1C,EACnE,CACAvb,QAAQ0hB,GACJ,IAAIw0B,EAAOx0B,EAAI1hB,QAAQ/K,KAAK26D,QAASxsD,EAAO8yC,EAAKlJ,UACjD,OAAI5pC,GAAQ+tD,EAAcI,aAAanuD,GAC5B,IAAI+tD,EAAcjb,GACtBwZ,EAAUqB,KAAK7a,EAC1B,EAQJ,MAAMsa,UAAqBd,EAIvBp4D,YAAYoqB,GACRyH,MAAMzH,EAAI1hB,QAAQ,GAAI0hB,EAAI1hB,QAAQ0hB,EAAItsB,QAAQ8Q,MAClD,CACA9L,QAAQmjC,EAAInoC,EAAU,YAClB,GAAIA,GAAW,WAAa,CACxBmoC,EAAGrF,OAAO,EAAGqF,EAAG7b,IAAItsB,QAAQ8Q,MAC5B,IAAI0nC,EAAM8hB,EAAUziB,QAAQ1P,EAAG7b,KAC1BksB,EAAI/J,GAAGtG,EAAGL,YACXK,EAAG2D,aAAa0M,EACxB,MAEIzkB,MAAM/uB,QAAQmjC,EAAInoC,EAE1B,CACAkmC,SAAW,MAAO,CAAExhC,KAAM,MAAS,CAInC42B,gBAAgBhP,GAAO,OAAO,IAAI8uC,EAAa9uC,EAAM,CACrDxsB,IAAIwsB,GAAO,OAAO,IAAI8uC,EAAa9uC,EAAM,CACzCmiB,GAAG3pC,GAAS,OAAOA,aAAiBs2D,CAAc,CAClDxvB,cAAgB,OAAOwwB,CAAa,EAExC9B,EAAUiB,OAAO,MAAOH,GACxB,MAAMgB,EAAc,CAChBt8D,MAAQ,OAAOD,IAAM,EACrB+K,QAAQ0hB,GAAc,IAAI8uC,EAAa9uC,IAM3C,SAAS2uC,EAAgB3uC,EAAKte,EAAMmY,EAAK/X,EAAO0sD,EAAKzjD,GAAO,GACxD,GAAIrJ,EAAKisC,cACL,OAAO+gB,EAAcngD,OAAOyR,EAAKnG,GACrC,IAAK,IAAI9lB,EAAI+N,GAAS0sD,EAAM,EAAI,EAAI,GAAIA,EAAM,EAAIz6D,EAAI2N,EAAKykC,WAAapyC,GAAK,EAAGA,GAAKy6D,EAAK,CACtF,IAAInoC,EAAQ3kB,EAAK2kB,MAAMtyB,GACvB,GAAKsyB,EAAM8wB,QAKN,IAAKpsC,GAAQ0kD,EAAcI,aAAaxpC,GACzC,OAAOopC,EAAclhD,OAAOyR,EAAKnG,GAAO20C,EAAM,EAAInoC,EAAMohB,SAAW,QANpD,CACf,IAAIxM,EAAQ0zB,EAAgB3uC,EAAKqG,EAAOxM,EAAM20C,EAAKA,EAAM,EAAInoC,EAAM8f,WAAa,EAAGqoB,EAAKzjD,GACxF,GAAIkwB,EACA,OAAOA,CACf,CAIAphB,GAAOwM,EAAMohB,SAAW+mB,CAC5B,CACA,OAAO,IACX,CACA,SAASF,EAAwBzyB,EAAIk0B,EAAUnB,GAC3C,IAAItwB,EAAOzC,EAAGc,MAAM9oC,OAAS,EAC7B,GAAIyqC,EAAOyxB,EACP,OACJ,IAGiC5tD,EAH7B65B,EAAOH,EAAGc,MAAM2B,IACdtC,aAAgB,MAAeA,aAAgB,QAE3CH,EAAGM,QAAQT,KAAK4C,GACtBv9B,SAAQ,CAAC89B,EAAOC,EAAKkxB,EAAUC,KAAuB,MAAP9tD,IAC/CA,EAAM8tD,EAAK,IACfp0B,EAAG2D,aAAawuB,EAAUqB,KAAKxzB,EAAG7b,IAAI1hB,QAAQ6D,GAAMysD,IACxD,CAyBA,MAAMsB,UAAoB,KAItBt6D,YAAYmX,GACR0a,MAAM1a,EAAMiT,KAEZzsB,KAAK48D,gBAAkB,EAGvB58D,KAAKouC,QAAU,EAEfpuC,KAAKohB,KAAO/f,OAAO2Z,OAAO,MAC1Bhb,KAAKqG,KAAO1B,KAAKD,MACjB1E,KAAK68D,aAAerjD,EAAMyuB,UAC1BjoC,KAAKijD,YAAczpC,EAAMypC,WAC7B,CAOIhb,gBAKA,OAJIjoC,KAAK48D,gBAAkB58D,KAAKopC,MAAM9oC,SAClCN,KAAK68D,aAAe78D,KAAK68D,aAAa58D,IAAID,KAAKysB,IAAKzsB,KAAK4oC,QAAQtjC,MAAMtF,KAAK48D,kBAC5E58D,KAAK48D,gBAAkB58D,KAAKopC,MAAM9oC,QAE/BN,KAAK68D,YAChB,CAKA5wB,aAAahE,GACT,GAAIA,EAAU+M,MAAMvoB,KAAOzsB,KAAKysB,IAC5B,MAAM,IAAI66B,WAAW,uEAKzB,OAJAtnD,KAAK68D,aAAe50B,EACpBjoC,KAAK48D,gBAAkB58D,KAAKopC,MAAM9oC,OAClCN,KAAKouC,SAAyC,GA9DlC,EA8DIpuC,KAAKouC,SACrBpuC,KAAKijD,YAAc,KACZjjD,IACX,CAIIw+C,mBACA,OAtEY,EAsEJx+C,KAAKouC,SAAyB,CAC1C,CAIA0uB,eAAelhC,GAGX,OAFA57B,KAAKijD,YAAcrnB,EACnB57B,KAAKouC,SA7E0B,EA8ExBpuC,IACX,CAMA+7D,YAAYngC,GAGR,OAFK,aAAa57B,KAAKijD,aAAejjD,KAAKioC,UAAU+M,MAAMpZ,QAASA,IAChE57B,KAAK88D,eAAelhC,GACjB57B,IACX,CAIAmjD,cAAc/P,GACV,OAAOpzC,KAAK+7D,YAAY3oB,EAAK7W,SAASv8B,KAAKijD,aAAejjD,KAAKioC,UAAU4b,MAAMjoB,SACnF,CAIAsnB,iBAAiB9P,GACb,OAAOpzC,KAAK+7D,YAAY3oB,EAAK5W,cAAcx8B,KAAKijD,aAAejjD,KAAKioC,UAAU4b,MAAMjoB,SACxF,CAIImhC,qBACA,OA1G+B,EA0GvB/8D,KAAKouC,SAA2B,CAC5C,CAIA4uB,QAAQv0B,EAAMhc,GACVyH,MAAM8oC,QAAQv0B,EAAMhc,GACpBzsB,KAAKouC,SAAyB,EAAfpuC,KAAKouC,QACpBpuC,KAAKijD,YAAc,IACvB,CAIAga,QAAQ52D,GAEJ,OADArG,KAAKqG,KAAOA,EACLrG,IACX,CAIAk9D,iBAAiB53D,GAEb,OADAtF,KAAKioC,UAAU9iC,QAAQnF,KAAMsF,GACtBtF,IACX,CAMAy2C,qBAAqBtoC,EAAMgvD,GAAe,GACtC,IAAIl1B,EAAYjoC,KAAKioC,UAIrB,OAHIk1B,IACAhvD,EAAOA,EAAKilC,KAAKpzC,KAAKijD,cAAgBhb,EAAUlB,MAAQkB,EAAU+M,MAAMpZ,QAAWqM,EAAU+M,MAAMuV,YAAYtiB,EAAUwP,MAAQ,aACrIxP,EAAUqH,YAAYtvC,KAAMmO,GACrBnO,IACX,CAIA4gD,kBAEI,OADA5gD,KAAKioC,UAAU9iC,QAAQnF,MAChBA,IACX,CAKAkwC,WAAW14B,EAAMzI,EAAM+3B,GACnB,IAAIjL,EAAS77B,KAAKysB,IAAI5nB,KAAKg3B,OAC3B,GAAY,MAAR9sB,EACA,OAAKyI,EAEExX,KAAKy2C,qBAAqB5a,EAAOrkB,KAAKA,IAAO,GADzCxX,KAAK4gD,kBAGf,CAID,GAHU,MAAN9Z,IACAA,EAAK/3B,GACT+3B,EAAW,MAANA,EAAa/3B,EAAO+3B,GACpBtvB,EACD,OAAOxX,KAAKg7D,YAAYjsD,EAAM+3B,GAClC,IAAIlL,EAAQ57B,KAAKijD,YACjB,IAAKrnB,EAAO,CACR,IAAIoZ,EAAQh1C,KAAKysB,IAAI1hB,QAAQgE,GAC7B6sB,EAAQkL,GAAM/3B,EAAOimC,EAAMpZ,QAAUoZ,EAAMuV,YAAYvqD,KAAKysB,IAAI1hB,QAAQ+7B,GAC5E,CAIA,OAHA9mC,KAAK62C,iBAAiB9nC,EAAM+3B,EAAIjL,EAAOrkB,KAAKA,EAAMokB,IAC7C57B,KAAKioC,UAAUlB,OAChB/mC,KAAKisC,aAAawuB,EAAUqB,KAAK97D,KAAKioC,UAAUwP,MAC7Cz3C,IACX,CACJ,CAKAksC,QAAQhqC,EAAKU,GAET,OADA5C,KAAKohB,KAAmB,iBAAPlf,EAAkBA,EAAMA,EAAIA,KAAOU,EAC7C5C,IACX,CAIA8sC,QAAQ5qC,GACJ,OAAOlC,KAAKohB,KAAmB,iBAAPlf,EAAkBA,EAAMA,EAAIA,IACxD,CAKIk7D,gBACA,IAAK,IAAIrjD,KAAK/Z,KAAKohB,KACf,OAAO,EACX,OAAO,CACX,CAKAgrB,iBAEI,OADApsC,KAAKouC,SA7M8C,EA8M5CpuC,IACX,CAIIq9D,uBACA,OApNmD,EAoN3Cr9D,KAAKouC,SAA4B,CAC7C,EAGJ,SAASyiB,EAAK7yB,EAAG/5B,GACb,OAAQA,GAAS+5B,EAAQA,EAAE6yB,KAAK5sD,GAAX+5B,CACzB,CACA,MAAMs/B,EACFj7D,YAAYI,EAAM0F,EAAMlE,GACpBjE,KAAKyC,KAAOA,EACZzC,KAAKgJ,KAAO6nD,EAAK1oD,EAAKa,KAAM/E,GAC5BjE,KAAKwG,MAAQqqD,EAAK1oD,EAAK3B,MAAOvC,EAClC,EAEJ,MAAMs5D,EAAa,CACf,IAAID,EAAU,MAAO,CACjBt0D,KAAK0d,GAAiBA,EAAO+F,KAAO/F,EAAOmV,OAAO6e,YAAYpe,gBAC9D91B,MAAM8hC,GAAaA,EAAG7b,MAE1B,IAAI6wC,EAAU,YAAa,CACvBt0D,KAAI,CAAC0d,EAAQnd,IAAmBmd,EAAOuhB,WAAawyB,EAAUziB,QAAQzuC,EAASkjB,KAC/EjmB,MAAM8hC,GAAaA,EAAGL,YAE1B,IAAIq1B,EAAU,cAAe,CACzBt0D,KAAK0d,GAAiBA,EAAOu8B,aAAe,KAC5Cz8C,MAAK,CAAC8hC,EAAIk1B,EAAQC,EAAMjkD,IAAgBA,EAAMyuB,UAAUyW,QAAUpW,EAAG2a,YAAc,OAEvF,IAAIqa,EAAU,oBAAqB,CAC/Bt0D,KAAI,IAAY,EAChBxC,MAAK,CAAC8hC,EAAIiW,IAAejW,EAAG+0B,iBAAmB9e,EAAO,EAAIA,KAKlE,MAAMmf,EACFr7D,YAAYw5B,EAAQzC,GAChBp5B,KAAK67B,OAASA,EACd77B,KAAKo5B,QAAU,GACfp5B,KAAK29D,aAAet8D,OAAO2Z,OAAO,MAClChb,KAAK4Y,OAAS2kD,EAAWj4D,QACrB8zB,GACAA,EAAQ5rB,SAAQ2rB,IACZ,GAAIn5B,KAAK29D,aAAaxkC,EAAOj3B,KACzB,MAAM,IAAIolD,WAAW,iDAAmDnuB,EAAOj3B,IAAM,KACzFlC,KAAKo5B,QAAQj4B,KAAKg4B,GAClBn5B,KAAK29D,aAAaxkC,EAAOj3B,KAAOi3B,EAC5BA,EAAO8C,KAAKziB,OACZxZ,KAAK4Y,OAAOzX,KAAK,IAAIm8D,EAAUnkC,EAAOj3B,IAAKi3B,EAAO8C,KAAKziB,MAAO2f,GAAQ,GAEtF,EAWJ,MAAMykC,EAIFv7D,YAIAqkB,GACI1mB,KAAK0mB,OAASA,CAClB,CAIImV,aACA,OAAO77B,KAAK0mB,OAAOmV,MACvB,CAIIzC,cACA,OAAOp5B,KAAK0mB,OAAO0S,OACvB,CAIA5yB,MAAM8hC,GACF,OAAOtoC,KAAKqtC,iBAAiB/E,GAAI9uB,KACrC,CAIAojC,kBAAkBtU,EAAIupB,GAAS,GAC3B,IAAK,IAAIrxD,EAAI,EAAGA,EAAIR,KAAK0mB,OAAO0S,QAAQ94B,OAAQE,IAC5C,GAAIA,GAAKqxD,EAAQ,CACb,IAAI14B,EAASn5B,KAAK0mB,OAAO0S,QAAQ54B,GACjC,GAAI24B,EAAO8C,KAAK2gB,oBAAsBzjB,EAAO8C,KAAK2gB,kBAAkB76C,KAAKo3B,EAAQmP,EAAItoC,MACjF,OAAO,CACf,CACJ,OAAO,CACX,CAQAqtC,iBAAiBwwB,GACb,IAAK79D,KAAK48C,kBAAkBihB,GACxB,MAAO,CAAErkD,MAAOxZ,KAAM89D,aAAc,IACxC,IAAIC,EAAM,CAACF,GAASG,EAAWh+D,KAAKi+D,WAAWJ,GAASppD,EAAO,KAI/D,OAAS,CACL,IAAIypD,GAAU,EACd,IAAK,IAAI19D,EAAI,EAAGA,EAAIR,KAAK0mB,OAAO0S,QAAQ94B,OAAQE,IAAK,CACjD,IAAI24B,EAASn5B,KAAK0mB,OAAO0S,QAAQ54B,GACjC,GAAI24B,EAAO8C,KAAKwgB,kBAAmB,CAC/B,IAAI7hB,EAAInmB,EAAOA,EAAKjU,GAAGo6B,EAAI,EAAGujC,EAAW1pD,EAAOA,EAAKjU,GAAGgZ,MAAQxZ,KAC5DsoC,EAAK1N,EAAImjC,EAAIz9D,QACb64B,EAAO8C,KAAKwgB,kBAAkB16C,KAAKo3B,EAAQyB,EAAImjC,EAAIz4D,MAAMs1B,GAAKmjC,EAAKI,EAAUH,GACjF,GAAI11B,GAAM01B,EAASphB,kBAAkBtU,EAAI9nC,GAAI,CAEzC,GADA8nC,EAAG4D,QAAQ,sBAAuB2xB,IAC7BppD,EAAM,CACPA,EAAO,GACP,IAAK,IAAIyoB,EAAI,EAAGA,EAAIl9B,KAAK0mB,OAAO0S,QAAQ94B,OAAQ48B,IAC5CzoB,EAAKtT,KAAK+7B,EAAI18B,EAAI,CAAEgZ,MAAOwkD,EAAUpjC,EAAGmjC,EAAIz9D,QAAW,CAAEkZ,MAAOxZ,KAAM46B,EAAG,GACjF,CACAmjC,EAAI58D,KAAKmnC,GACT01B,EAAWA,EAASC,WAAW31B,GAC/B41B,GAAU,CACd,CACIzpD,IACAA,EAAKjU,GAAK,CAAEgZ,MAAOwkD,EAAUpjC,EAAGmjC,EAAIz9D,QAC5C,CACJ,CACA,IAAK49D,EACD,MAAO,CAAE1kD,MAAOwkD,EAAUF,aAAcC,EAChD,CACJ,CAIAE,WAAW31B,GACP,IAAKA,EAAG54B,OAAOk/B,GAAG5uC,KAAKysB,KACnB,MAAM,IAAI66B,WAAW,qCACzB,IAAI8W,EAAc,IAAIR,EAAY59D,KAAK0mB,QAAS9N,EAAS5Y,KAAK0mB,OAAO9N,OACrE,IAAK,IAAIpY,EAAI,EAAGA,EAAIoY,EAAOtY,OAAQE,IAAK,CACpC,IAAI+W,EAAQqB,EAAOpY,GACnB49D,EAAY7mD,EAAM9U,MAAQ8U,EAAM/Q,MAAM8hC,EAAItoC,KAAKuX,EAAM9U,MAAOzC,KAAMo+D,EACtE,CACA,OAAOA,CACX,CAII91B,SAAO,OAAO,IAAIq0B,EAAY38D,KAAO,CAIzCy7B,cAAc/U,GACV,IAAI23C,EAAU,IAAIX,EAAch3C,EAAO+F,IAAM/F,EAAO+F,IAAI5nB,KAAKg3B,OAASnV,EAAOmV,OAAQnV,EAAO0S,SACxF7vB,EAAW,IAAIq0D,EAAYS,GAC/B,IAAK,IAAI79D,EAAI,EAAGA,EAAI69D,EAAQzlD,OAAOtY,OAAQE,IACvC+I,EAAS80D,EAAQzlD,OAAOpY,GAAGiC,MAAQ47D,EAAQzlD,OAAOpY,GAAGwI,KAAK0d,EAAQnd,GACtE,OAAOA,CACX,CASA+0D,YAAY53C,GACR,IAAI23C,EAAU,IAAIX,EAAc19D,KAAK67B,OAAQnV,EAAO0S,SAChDxgB,EAASylD,EAAQzlD,OAAQrP,EAAW,IAAIq0D,EAAYS,GACxD,IAAK,IAAI79D,EAAI,EAAGA,EAAIoY,EAAOtY,OAAQE,IAAK,CACpC,IAAIiC,EAAOmW,EAAOpY,GAAGiC,KACrB8G,EAAS9G,GAAQzC,KAAKuB,eAAekB,GAAQzC,KAAKyC,GAAQmW,EAAOpY,GAAGwI,KAAK0d,EAAQnd,EACrF,CACA,OAAOA,CACX,CAQA88B,OAAOk4B,GACH,IAAI34D,EAAS,CAAE6mB,IAAKzsB,KAAKysB,IAAI4Z,SAAU4B,UAAWjoC,KAAKioC,UAAU5B,UAGjE,GAFIrmC,KAAKijD,cACLr9C,EAAOq9C,YAAcjjD,KAAKijD,YAAYhjD,KAAIg7B,GAAKA,EAAEoL,YACjDk4B,GAAuC,iBAAhBA,EACvB,IAAK,IAAI9nC,KAAQ8nC,EAAc,CAC3B,GAAY,OAAR9nC,GAAyB,aAARA,EACjB,MAAM,IAAI6wB,WAAW,sDACzB,IAAInuB,EAASolC,EAAa9nC,GAAOjd,EAAQ2f,EAAO8C,KAAKziB,MACjDA,GAASA,EAAM6sB,SACfzgC,EAAO6wB,GAAQjd,EAAM6sB,OAAOtkC,KAAKo3B,EAAQn5B,KAAKm5B,EAAOj3B,MAC7D,CACJ,OAAO0D,CACX,CAQA61B,gBAAgB/U,EAAQyhC,EAAMoW,GAC1B,IAAKpW,EACD,MAAM,IAAIb,WAAW,0CACzB,IAAK5gC,EAAOmV,OACR,MAAM,IAAIyrB,WAAW,0CACzB,IAAI+W,EAAU,IAAIX,EAAch3C,EAAOmV,OAAQnV,EAAO0S,SAClD7vB,EAAW,IAAIq0D,EAAYS,GAyB/B,OAxBAA,EAAQzlD,OAAOpL,SAAQ+J,IACnB,GAAkB,OAAdA,EAAM9U,KACN8G,EAASkjB,IAAM,cAAc/F,EAAOmV,OAAQssB,EAAK17B,UAEhD,GAAkB,aAAdlV,EAAM9U,KACX8G,EAAS0+B,UAAYwyB,EAAU7R,SAASr/C,EAASkjB,IAAK07B,EAAKlgB,gBAE1D,GAAkB,eAAd1wB,EAAM9U,KACP0lD,EAAKlF,cACL15C,EAAS05C,YAAckF,EAAKlF,YAAYhjD,IAAIymB,EAAOmV,OAAOqwB,mBAE7D,CACD,GAAIqS,EACA,IAAK,IAAI9nC,KAAQ8nC,EAAc,CAC3B,IAAIplC,EAASolC,EAAa9nC,GAAOjd,EAAQ2f,EAAO8C,KAAKziB,MACrD,GAAI2f,EAAOj3B,KAAOqV,EAAM9U,MAAQ+W,GAASA,EAAMovC,UAC3CvnD,OAAOC,UAAUC,eAAeQ,KAAKomD,EAAM1xB,GAE3C,YADAltB,EAASgO,EAAM9U,MAAQ+W,EAAMovC,SAAS7mD,KAAKo3B,EAAQzS,EAAQyhC,EAAK1xB,GAAOltB,GAG/E,CACJA,EAASgO,EAAM9U,MAAQ8U,EAAMvO,KAAK0d,EAAQnd,EAC9C,KAEGA,CACX,EAGJ,SAASi1D,EAAUv8D,EAAKgC,EAAM1B,GAC1B,IAAK,IAAIk0B,KAAQx0B,EAAK,CAClB,IAAIkoD,EAAMloD,EAAIw0B,GACV0zB,aAAehmD,SACfgmD,EAAMA,EAAI0G,KAAK5sD,GACF,mBAARwyB,IACL0zB,EAAMqU,EAAUrU,EAAKlmD,EAAM,CAAC,IAChC1B,EAAOk0B,GAAQ0zB,CACnB,CACA,OAAO5nD,CACX,CAMA,MAAMk8D,EAIFp8D,YAIA45B,GACIj8B,KAAKi8B,KAAOA,EAIZj8B,KAAKg9B,MAAQ,CAAC,EACVf,EAAKe,OACLwhC,EAAUviC,EAAKe,MAAOh9B,KAAMA,KAAKg9B,OACrCh9B,KAAKkC,IAAM+5B,EAAK/5B,IAAM+5B,EAAK/5B,IAAIA,IAAMw8D,EAAU,SACnD,CAIA/xB,SAASnzB,GAAS,OAAOA,EAAMxZ,KAAKkC,IAAM,EAE9C,MAAM+K,EAAO5L,OAAO2Z,OAAO,MAC3B,SAAS0jD,EAAUj8D,GACf,OAAIA,KAAQwK,EACDxK,EAAO,OAAQwK,EAAKxK,IAC/BwK,EAAKxK,GAAQ,EACNA,EAAO,IAClB,CAOA,MAAMk8D,EAIFt8D,YAAYI,EAAO,OAASzC,KAAKkC,IAAMw8D,EAAUj8D,EAAO,CAKxD+F,IAAIgR,GAAS,OAAOA,EAAMkN,OAAOi3C,aAAa39D,KAAKkC,IAAM,CAIzDyqC,SAASnzB,GAAS,OAAOA,EAAMxZ,KAAKkC,IAAM,0JC59B9C,MACM08D,EAAWt6D,KAAKu6D,IAAI,EAAG,IAE7B,SAASC,EAAal8D,GAAS,OAHf,MAGsBA,CAAiB,CAOvD,MAAMm8D,EAIF18D,YAIAikB,EAIA04C,EAIAC,GACIj/D,KAAKsmB,IAAMA,EACXtmB,KAAKg/D,QAAUA,EACfh/D,KAAKi/D,QAAUA,CACnB,CAMI9C,cAAY,OA/B4C,EA+BpCn8D,KAAKg/D,SAAsB,CAAG,CAIlDE,oBAAkB,OAAuB,EAAfl/D,KAAKg/D,SAAuC,CAAG,CAIzEG,mBAAiB,OAAuB,EAAfn/D,KAAKg/D,SAAsC,CAAG,CAMvEI,oBAAkB,OA7CwB,EA6ChBp/D,KAAKg/D,SAAwB,CAAG,EAQlE,MAAMK,EAMFh9D,YAIAopC,EAIA6zB,GAAW,GAGP,GAFAt/D,KAAKyrC,OAASA,EACdzrC,KAAKs/D,SAAWA,GACX7zB,EAAOnrC,QAAU++D,EAAQt4B,MAC1B,OAAOs4B,EAAQt4B,KACvB,CAIAk4B,QAAQr8D,GACJ,IAAI28D,EAAO,EAAGhxD,EAAQuwD,EAAal8D,GACnC,IAAK5C,KAAKs/D,SACN,IAAK,IAAI9+D,EAAI,EAAGA,EAAI+N,EAAO/N,IACvB++D,GAAQv/D,KAAKyrC,OAAW,EAAJjrC,EAAQ,GAAKR,KAAKyrC,OAAW,EAAJjrC,EAAQ,GAC7D,OAAOR,KAAKyrC,OAAe,EAARl9B,GAAagxD,EAlFxC,SAAuB38D,GAAS,OAAQA,GAJxB,MAIiCA,IAAoBg8D,CAAU,CAkFhCY,CAAc58D,EACzD,CACAw5D,UAAU91C,EAAKm5C,EAAQ,GAAK,OAAOz/D,KAAK0/D,KAAKp5C,EAAKm5C,GAAO,EAAQ,CACjEx/D,IAAIqmB,EAAKm5C,EAAQ,GAAK,OAAOz/D,KAAK0/D,KAAKp5C,EAAKm5C,GAAO,EAAO,CAI1DC,KAAKp5C,EAAKm5C,EAAOE,GACb,IAAIJ,EAAO,EAAGK,EAAW5/D,KAAKs/D,SAAW,EAAI,EAAGO,EAAW7/D,KAAKs/D,SAAW,EAAI,EAC/E,IAAK,IAAI9+D,EAAI,EAAGA,EAAIR,KAAKyrC,OAAOnrC,OAAQE,GAAK,EAAG,CAC5C,IAAIiO,EAAQzO,KAAKyrC,OAAOjrC,IAAMR,KAAKs/D,SAAWC,EAAO,GACrD,GAAI9wD,EAAQ6X,EACR,MACJ,IAAIw5C,EAAU9/D,KAAKyrC,OAAOjrC,EAAIo/D,GAAWG,EAAU//D,KAAKyrC,OAAOjrC,EAAIq/D,GAAWjxD,EAAMH,EAAQqxD,EAC5F,GAAIx5C,GAAO1X,EAAK,CACZ,IACIhJ,EAAS6I,EAAQ8wD,IADTO,EAAkBx5C,GAAO7X,GAAS,EAAI6X,GAAO1X,EAAM,EAAI6wD,EAA7CA,GACc,EAAI,EAAIM,GAC5C,GAAIJ,EACA,OAAO/5D,EACX,IACIk+C,EAAMx9B,GAAO7X,EArGC,EAqGmB6X,GAAO1X,EArGzC,EAA+B,EAwGlC,OAFI6wD,EAAQ,EAAIn5C,GAAO7X,EAAQ6X,GAAO1X,KAClCk1C,GAvG4C,GAwGzC,IAAIib,EAAUn5D,EAAQk+C,EAJfx9B,IAAQm5C,EAAQ,EAAIhxD,EAAQG,GAAO,KAAmBpO,EAAI,GAAG8lB,EAAM7X,GAvGnCmwD,EA4GlD,CACAW,GAAQQ,EAAUD,CACtB,CACA,OAAOH,EAASr5C,EAAMi5C,EAAO,IAAIR,EAAUz4C,EAAMi5C,EAAM,EAAG,KAC9D,CAIAS,QAAQ15C,EAAK24C,GACT,IAAIM,EAAO,EAAGhxD,EAAQuwD,EAAaG,GAC/BW,EAAW5/D,KAAKs/D,SAAW,EAAI,EAAGO,EAAW7/D,KAAKs/D,SAAW,EAAI,EACrE,IAAK,IAAI9+D,EAAI,EAAGA,EAAIR,KAAKyrC,OAAOnrC,OAAQE,GAAK,EAAG,CAC5C,IAAIiO,EAAQzO,KAAKyrC,OAAOjrC,IAAMR,KAAKs/D,SAAWC,EAAO,GACrD,GAAI9wD,EAAQ6X,EACR,MACJ,IAAIw5C,EAAU9/D,KAAKyrC,OAAOjrC,EAAIo/D,GAC9B,GAAIt5C,GAD2C7X,EAAQqxD,GACrCt/D,GAAa,EAAR+N,EACnB,OAAO,EACXgxD,GAAQv/D,KAAKyrC,OAAOjrC,EAAIq/D,GAAYC,CACxC,CACA,OAAO,CACX,CAKAtyD,QAAQwwB,GACJ,IAAI4hC,EAAW5/D,KAAKs/D,SAAW,EAAI,EAAGO,EAAW7/D,KAAKs/D,SAAW,EAAI,EACrE,IAAK,IAAI9+D,EAAI,EAAG++D,EAAO,EAAG/+D,EAAIR,KAAKyrC,OAAOnrC,OAAQE,GAAK,EAAG,CACtD,IAAIiO,EAAQzO,KAAKyrC,OAAOjrC,GAAIy/D,EAAWxxD,GAASzO,KAAKs/D,SAAWC,EAAO,GAAIW,EAAWzxD,GAASzO,KAAKs/D,SAAW,EAAIC,GAC/GO,EAAU9/D,KAAKyrC,OAAOjrC,EAAIo/D,GAAWG,EAAU//D,KAAKyrC,OAAOjrC,EAAIq/D,GACnE7hC,EAAEiiC,EAAUA,EAAWH,EAASI,EAAUA,EAAWH,GACrDR,GAAQQ,EAAUD,CACtB,CACJ,CAKAx2B,SACI,OAAO,IAAI+1B,EAAQr/D,KAAKyrC,QAASzrC,KAAKs/D,SAC1C,CAIAv/D,WACI,OAAQC,KAAKs/D,SAAW,IAAM,IAAMzpC,KAAKC,UAAU91B,KAAKyrC,OAC5D,CAMAhQ,cAAcb,GACV,OAAY,GAALA,EAASykC,EAAQt4B,MAAQ,IAAIs4B,EAAQzkC,EAAI,EAAI,CAAC,GAAIA,EAAG,GAAK,CAAC,EAAG,EAAGA,GAC5E,EAKJykC,EAAQt4B,MAAQ,IAAIs4B,EAAQ,IAS5B,MAAMc,EAIF99D,YAIA8lC,EAAO,GAIPi4B,EAKArxD,EAAO,EAIP+3B,EAAKqB,EAAK7nC,QACNN,KAAKmoC,KAAOA,EACZnoC,KAAKogE,OAASA,EACdpgE,KAAK+O,KAAOA,EACZ/O,KAAK8mC,GAAKA,CACd,CAIAxhC,MAAMyJ,EAAO,EAAG+3B,EAAK9mC,KAAKmoC,KAAK7nC,QAC3B,OAAO,IAAI6/D,EAAQngE,KAAKmoC,KAAMnoC,KAAKogE,OAAQrxD,EAAM+3B,EACrD,CAIA5jC,OACI,OAAO,IAAIi9D,EAAQngE,KAAKmoC,KAAK7iC,QAAStF,KAAKogE,QAAUpgE,KAAKogE,OAAO96D,QAAStF,KAAK+O,KAAM/O,KAAK8mC,GAC9F,CAMA+B,UAAU5oC,EAAKogE,GACXrgE,KAAK8mC,GAAK9mC,KAAKmoC,KAAKhnC,KAAKlB,GACV,MAAXogE,GACArgE,KAAKsgE,UAAUtgE,KAAKmoC,KAAK7nC,OAAS,EAAG+/D,EAC7C,CAKAE,cAAc33B,GACV,IAAK,IAAIpoC,EAAI,EAAGggE,EAAYxgE,KAAKmoC,KAAK7nC,OAAQE,EAAIooC,EAAQT,KAAK7nC,OAAQE,IAAK,CACxE,IAAIigE,EAAO73B,EAAQ2B,UAAU/pC,GAC7BR,KAAK6oC,UAAUD,EAAQT,KAAK3nC,GAAY,MAARigE,GAAgBA,EAAOjgE,EAAIggE,EAAYC,OAAO3/D,EAClF,CACJ,CAMAypC,UAAU3P,GACN,GAAI56B,KAAKogE,OACL,IAAK,IAAI5/D,EAAI,EAAGA,EAAIR,KAAKogE,OAAO9/D,OAAQE,IACpC,GAAIR,KAAKogE,OAAO5/D,IAAMo6B,EAClB,OAAO56B,KAAKogE,OAAO5/D,GAAKA,EAAI,GAAK,EAAI,GACrD,CAIA8/D,UAAU1lC,EAAGK,GACJj7B,KAAKogE,SACNpgE,KAAKogE,OAAS,IAClBpgE,KAAKogE,OAAOj/D,KAAKy5B,EAAGK,EACxB,CAIAylC,sBAAsB93B,GAClB,IAAK,IAAIpoC,EAAIooC,EAAQT,KAAK7nC,OAAS,EAAGqgE,EAAY3gE,KAAKmoC,KAAK7nC,OAASsoC,EAAQT,KAAK7nC,OAAQE,GAAK,EAAGA,IAAK,CACnG,IAAIigE,EAAO73B,EAAQ2B,UAAU/pC,GAC7BR,KAAK6oC,UAAUD,EAAQT,KAAK3nC,GAAG8oC,SAAkB,MAARm3B,GAAgBA,EAAOjgE,EAAImgE,EAAYF,EAAO,OAAI3/D,EAC/F,CACJ,CAIAwoC,SACI,IAAIs3B,EAAU,IAAIT,EAElB,OADAS,EAAQF,sBAAsB1gE,MACvB4gE,CACX,CAIA3gE,IAAIqmB,EAAKm5C,EAAQ,GACb,GAAIz/D,KAAKogE,OACL,OAAOpgE,KAAK0/D,KAAKp5C,EAAKm5C,GAAO,GACjC,IAAK,IAAIj/D,EAAIR,KAAK+O,KAAMvO,EAAIR,KAAK8mC,GAAItmC,IACjC8lB,EAAMtmB,KAAKmoC,KAAK3nC,GAAGP,IAAIqmB,EAAKm5C,GAChC,OAAOn5C,CACX,CAKA81C,UAAU91C,EAAKm5C,EAAQ,GAAK,OAAOz/D,KAAK0/D,KAAKp5C,EAAKm5C,GAAO,EAAQ,CAIjEC,KAAKp5C,EAAKm5C,EAAOE,GACb,IAAIX,EAAU,EACd,IAAK,IAAIx+D,EAAIR,KAAK+O,KAAMvO,EAAIR,KAAK8mC,GAAItmC,IAAK,CACtC,IAAwBoF,EAAd5F,KAAKmoC,KAAK3nC,GAAiB47D,UAAU91C,EAAKm5C,GACpD,GAAsB,MAAlB75D,EAAOq5D,QAAiB,CACxB,IAAI4B,EAAO7gE,KAAKuqC,UAAU/pC,GAC1B,GAAY,MAARqgE,GAAgBA,EAAOrgE,GAAKqgE,EAAO7gE,KAAK8mC,GAAI,CAC5CtmC,EAAIqgE,EACJv6C,EAAMtmB,KAAKmoC,KAAK04B,GAAM5B,QAAQr5D,EAAOq5D,SACrC,QACJ,CACJ,CACAD,GAAWp5D,EAAOo5D,QAClB14C,EAAM1gB,EAAO0gB,GACjB,CACA,OAAOq5C,EAASr5C,EAAM,IAAIy4C,EAAUz4C,EAAK04C,EAAS,KACtD,EAGJ,MAAM8B,EAAYz/D,OAAO2Z,OAAO,MAYhC,MAAM+lD,EAMFl2B,SAAW,OAAOw0B,EAAQt4B,KAAO,CAMjCyC,MAAMvkC,GAAS,OAAO,IAAM,CAK5Bw2B,gBAAgBI,EAAQssB,GACpB,IAAKA,IAASA,EAAK6Y,SACf,MAAM,IAAI1Z,WAAW,mCACzB,IAAIziD,EAAOi8D,EAAU3Y,EAAK6Y,UAC1B,IAAKn8D,EACD,MAAM,IAAIyiD,WAAW,gBAAgBa,EAAK6Y,oBAC9C,OAAOn8D,EAAK+jD,SAAS/sB,EAAQssB,EACjC,CAOA1sB,cAAcx6B,EAAIggE,GACd,GAAIhgE,KAAM6/D,EACN,MAAM,IAAIxZ,WAAW,iCAAmCrmD,GAG5D,OAFA6/D,EAAU7/D,GAAMggE,EAChBA,EAAU3/D,UAAUo6D,OAASz6D,EACtBggE,CACX,EAMJ,MAAMC,EAIF7+D,YAIAoqB,EAIA00C,GACInhE,KAAKysB,IAAMA,EACXzsB,KAAKmhE,OAASA,CAClB,CAIA1lC,UAAUhP,GAAO,OAAO,IAAIy0C,EAAWz0C,EAAK,KAAO,CAInDgP,YAAYtH,GAAW,OAAO,IAAI+sC,EAAW,KAAM/sC,EAAU,CAM7DsH,mBAAmBhP,EAAK1d,EAAM+3B,EAAIxhC,GAC9B,IACI,OAAO47D,EAAWrwD,GAAG4b,EAAItnB,QAAQ4J,EAAM+3B,EAAIxhC,GAC/C,CACA,MAAOkF,GACH,GAAIA,aAAa,KACb,OAAO02D,EAAW1pC,KAAKhtB,EAAE2pB,SAC7B,MAAM3pB,CACV,CACJ,EAGJ,SAAS42D,EAAYl3C,EAAU8T,EAAGvN,GAC9B,IAAI4wC,EAAS,GACb,IAAK,IAAI7gE,EAAI,EAAGA,EAAI0pB,EAAS0oB,WAAYpyC,IAAK,CAC1C,IAAIsyB,EAAQ5I,EAAS4I,MAAMtyB,GACvBsyB,EAAM3yB,QAAQ8Q,OACd6hB,EAAQA,EAAM5vB,KAAKk+D,EAAYtuC,EAAM3yB,QAAS69B,EAAGlL,KACjDA,EAAM4jB,WACN5jB,EAAQkL,EAAElL,EAAOrC,EAAQjwB,IAC7B6gE,EAAOlgE,KAAK2xB,EAChB,CACA,OAAO,eAAmBuuC,EAC9B,CAIA,MAAMC,UAAoBP,EAItB1+D,YAIA0M,EAIA+3B,EAIAsM,GACIlf,QACAl0B,KAAK+O,KAAOA,EACZ/O,KAAK8mC,GAAKA,EACV9mC,KAAKozC,KAAOA,CAChB,CACA5sC,MAAMimB,GACF,IAAI80C,EAAW90C,EAAInnB,MAAMtF,KAAK+O,KAAM/O,KAAK8mC,IAAKkO,EAAQvoB,EAAI1hB,QAAQ/K,KAAK+O,MACnE0hB,EAASukB,EAAM7mC,KAAK6mC,EAAMwV,YAAYxqD,KAAK8mC,KAC3CxhC,EAAQ,IAAI,KAAM87D,EAAYG,EAASphE,SAAS,CAACgO,EAAMsiB,IAClDtiB,EAAKy1C,QAAWnzB,EAAO5rB,KAAKk+C,eAAe/iD,KAAKozC,KAAKvuC,MAEnDsJ,EAAKilC,KAAKpzC,KAAKozC,KAAK7W,SAASpuB,EAAKytB,QAD9BztB,GAEZsiB,GAAS8wC,EAASjZ,UAAWiZ,EAAShZ,SACzC,OAAO2Y,EAAWM,YAAY/0C,EAAKzsB,KAAK+O,KAAM/O,KAAK8mC,GAAIxhC,EAC3D,CACAgkC,SACI,OAAO,IAAIm4B,EAAezhE,KAAK+O,KAAM/O,KAAK8mC,GAAI9mC,KAAKozC,KACvD,CACAnzC,IAAI2oC,GACA,IAAI75B,EAAO65B,EAAQwzB,UAAUp8D,KAAK+O,KAAM,GAAI+3B,EAAK8B,EAAQwzB,UAAUp8D,KAAK8mC,IAAK,GAC7E,OAAI/3B,EAAKotD,SAAWr1B,EAAGq1B,SAAWptD,EAAKuX,KAAOwgB,EAAGxgB,IACtC,KACJ,IAAIg7C,EAAYvyD,EAAKuX,IAAKwgB,EAAGxgB,IAAKtmB,KAAKozC,KAClD,CACA5J,MAAMvkC,GACF,OAAIA,aAAiBq8D,GACjBr8D,EAAMmuC,KAAKxE,GAAG5uC,KAAKozC,OACnBpzC,KAAK+O,MAAQ9J,EAAM6hC,IAAM9mC,KAAK8mC,IAAM7hC,EAAM8J,KACnC,IAAIuyD,EAAYh9D,KAAKG,IAAIzE,KAAK+O,KAAM9J,EAAM8J,MAAOzK,KAAKC,IAAIvE,KAAK8mC,GAAI7hC,EAAM6hC,IAAK9mC,KAAKozC,MACvF,IACX,CACA/M,SACI,MAAO,CAAE26B,SAAU,UAAW5tB,KAAMpzC,KAAKozC,KAAK/M,SAC1Ct3B,KAAM/O,KAAK+O,KAAM+3B,GAAI9mC,KAAK8mC,GAClC,CAIArL,gBAAgBI,EAAQssB,GACpB,GAAwB,iBAAbA,EAAKp5C,MAAsC,iBAAXo5C,EAAKrhB,GAC5C,MAAM,IAAIwgB,WAAW,0CACzB,OAAO,IAAIga,EAAYnZ,EAAKp5C,KAAMo5C,EAAKrhB,GAAIjL,EAAOqwB,aAAa/D,EAAK/U,MACxE,EAEJ2tB,EAAKrF,OAAO,UAAW4F,GAIvB,MAAMG,UAAuBV,EAIzB1+D,YAIA0M,EAIA+3B,EAIAsM,GACIlf,QACAl0B,KAAK+O,KAAOA,EACZ/O,KAAK8mC,GAAKA,EACV9mC,KAAKozC,KAAOA,CAChB,CACA5sC,MAAMimB,GACF,IAAI80C,EAAW90C,EAAInnB,MAAMtF,KAAK+O,KAAM/O,KAAK8mC,IACrCxhC,EAAQ,IAAI,KAAM87D,EAAYG,EAASphE,SAASgO,GACzCA,EAAKilC,KAAKpzC,KAAKozC,KAAK5W,cAAcruB,EAAKytB,SAC/CnP,GAAM80C,EAASjZ,UAAWiZ,EAAShZ,SACtC,OAAO2Y,EAAWM,YAAY/0C,EAAKzsB,KAAK+O,KAAM/O,KAAK8mC,GAAIxhC,EAC3D,CACAgkC,SACI,OAAO,IAAIg4B,EAAYthE,KAAK+O,KAAM/O,KAAK8mC,GAAI9mC,KAAKozC,KACpD,CACAnzC,IAAI2oC,GACA,IAAI75B,EAAO65B,EAAQwzB,UAAUp8D,KAAK+O,KAAM,GAAI+3B,EAAK8B,EAAQwzB,UAAUp8D,KAAK8mC,IAAK,GAC7E,OAAI/3B,EAAKotD,SAAWr1B,EAAGq1B,SAAWptD,EAAKuX,KAAOwgB,EAAGxgB,IACtC,KACJ,IAAIm7C,EAAe1yD,EAAKuX,IAAKwgB,EAAGxgB,IAAKtmB,KAAKozC,KACrD,CACA5J,MAAMvkC,GACF,OAAIA,aAAiBw8D,GACjBx8D,EAAMmuC,KAAKxE,GAAG5uC,KAAKozC,OACnBpzC,KAAK+O,MAAQ9J,EAAM6hC,IAAM9mC,KAAK8mC,IAAM7hC,EAAM8J,KACnC,IAAI0yD,EAAen9D,KAAKG,IAAIzE,KAAK+O,KAAM9J,EAAM8J,MAAOzK,KAAKC,IAAIvE,KAAK8mC,GAAI7hC,EAAM6hC,IAAK9mC,KAAKozC,MAC1F,IACX,CACA/M,SACI,MAAO,CAAE26B,SAAU,aAAc5tB,KAAMpzC,KAAKozC,KAAK/M,SAC7Ct3B,KAAM/O,KAAK+O,KAAM+3B,GAAI9mC,KAAK8mC,GAClC,CAIArL,gBAAgBI,EAAQssB,GACpB,GAAwB,iBAAbA,EAAKp5C,MAAsC,iBAAXo5C,EAAKrhB,GAC5C,MAAM,IAAIwgB,WAAW,6CACzB,OAAO,IAAIma,EAAetZ,EAAKp5C,KAAMo5C,EAAKrhB,GAAIjL,EAAOqwB,aAAa/D,EAAK/U,MAC3E,EAEJ2tB,EAAKrF,OAAO,aAAc+F,GAI1B,MAAMC,UAAwBX,EAI1B1+D,YAIAikB,EAIA8sB,GACIlf,QACAl0B,KAAKsmB,IAAMA,EACXtmB,KAAKozC,KAAOA,CAChB,CACA5sC,MAAMimB,GACF,IAAIte,EAAOse,EAAI8+B,OAAOvrD,KAAKsmB,KAC3B,IAAKnY,EACD,OAAO+yD,EAAW1pC,KAAK,mCAC3B,IAAI4W,EAAUjgC,EAAKtJ,KAAKmW,OAAO7M,EAAKqtB,MAAO,KAAMx7B,KAAKozC,KAAK7W,SAASpuB,EAAKytB,QACzE,OAAOslC,EAAWM,YAAY/0C,EAAKzsB,KAAKsmB,IAAKtmB,KAAKsmB,IAAM,EAAG,IAAI,KAAM,UAAc8nB,GAAU,EAAGjgC,EAAK+4C,OAAS,EAAI,GACtH,CACA5d,OAAO7c,GACH,IAAIte,EAAOse,EAAI8+B,OAAOvrD,KAAKsmB,KAC3B,GAAInY,EAAM,CACN,IAAIwzD,EAAS3hE,KAAKozC,KAAK7W,SAASpuB,EAAKytB,OACrC,GAAI+lC,EAAOrhE,QAAU6N,EAAKytB,MAAMt7B,OAAQ,CACpC,IAAK,IAAIE,EAAI,EAAGA,EAAI2N,EAAKytB,MAAMt7B,OAAQE,IACnC,IAAK2N,EAAKytB,MAAMp7B,GAAG69B,QAAQsjC,GACvB,OAAO,IAAID,EAAgB1hE,KAAKsmB,IAAKnY,EAAKytB,MAAMp7B,IACxD,OAAO,IAAIkhE,EAAgB1hE,KAAKsmB,IAAKtmB,KAAKozC,KAC9C,CACJ,CACA,OAAO,IAAIwuB,EAAmB5hE,KAAKsmB,IAAKtmB,KAAKozC,KACjD,CACAnzC,IAAI2oC,GACA,IAAItiB,EAAMsiB,EAAQwzB,UAAUp8D,KAAKsmB,IAAK,GACtC,OAAOA,EAAI64C,aAAe,KAAO,IAAIuC,EAAgBp7C,EAAIA,IAAKtmB,KAAKozC,KACvE,CACA/M,SACI,MAAO,CAAE26B,SAAU,cAAe16C,IAAKtmB,KAAKsmB,IAAK8sB,KAAMpzC,KAAKozC,KAAK/M,SACrE,CAIA5K,gBAAgBI,EAAQssB,GACpB,GAAuB,iBAAZA,EAAK7hC,IACZ,MAAM,IAAIghC,WAAW,8CACzB,OAAO,IAAIoa,EAAgBvZ,EAAK7hC,IAAKuV,EAAOqwB,aAAa/D,EAAK/U,MAClE,EAEJ2tB,EAAKrF,OAAO,cAAegG,GAI3B,MAAME,UAA2Bb,EAI7B1+D,YAIAikB,EAIA8sB,GACIlf,QACAl0B,KAAKsmB,IAAMA,EACXtmB,KAAKozC,KAAOA,CAChB,CACA5sC,MAAMimB,GACF,IAAIte,EAAOse,EAAI8+B,OAAOvrD,KAAKsmB,KAC3B,IAAKnY,EACD,OAAO+yD,EAAW1pC,KAAK,mCAC3B,IAAI4W,EAAUjgC,EAAKtJ,KAAKmW,OAAO7M,EAAKqtB,MAAO,KAAMx7B,KAAKozC,KAAK5W,cAAcruB,EAAKytB,QAC9E,OAAOslC,EAAWM,YAAY/0C,EAAKzsB,KAAKsmB,IAAKtmB,KAAKsmB,IAAM,EAAG,IAAI,KAAM,UAAc8nB,GAAU,EAAGjgC,EAAK+4C,OAAS,EAAI,GACtH,CACA5d,OAAO7c,GACH,IAAIte,EAAOse,EAAI8+B,OAAOvrD,KAAKsmB,KAC3B,OAAKnY,GAASnO,KAAKozC,KAAK/U,QAAQlwB,EAAKytB,OAE9B,IAAI8lC,EAAgB1hE,KAAKsmB,IAAKtmB,KAAKozC,MAD/BpzC,IAEf,CACAC,IAAI2oC,GACA,IAAItiB,EAAMsiB,EAAQwzB,UAAUp8D,KAAKsmB,IAAK,GACtC,OAAOA,EAAI64C,aAAe,KAAO,IAAIyC,EAAmBt7C,EAAIA,IAAKtmB,KAAKozC,KAC1E,CACA/M,SACI,MAAO,CAAE26B,SAAU,iBAAkB16C,IAAKtmB,KAAKsmB,IAAK8sB,KAAMpzC,KAAKozC,KAAK/M,SACxE,CAIA5K,gBAAgBI,EAAQssB,GACpB,GAAuB,iBAAZA,EAAK7hC,IACZ,MAAM,IAAIghC,WAAW,iDACzB,OAAO,IAAIsa,EAAmBzZ,EAAK7hC,IAAKuV,EAAOqwB,aAAa/D,EAAK/U,MACrE,EAEJ2tB,EAAKrF,OAAO,iBAAkBkG,GAK9B,MAAMC,UAAoBd,EAUtB1+D,YAIA0M,EAIA+3B,EAIAxhC,EAIAu0D,GAAY,GACR3lC,QACAl0B,KAAK+O,KAAOA,EACZ/O,KAAK8mC,GAAKA,EACV9mC,KAAKsF,MAAQA,EACbtF,KAAK65D,UAAYA,CACrB,CACArzD,MAAMimB,GACF,OAAIzsB,KAAK65D,WAAaiI,EAAer1C,EAAKzsB,KAAK+O,KAAM/O,KAAK8mC,IAC/Co6B,EAAW1pC,KAAK,6CACpB0pC,EAAWM,YAAY/0C,EAAKzsB,KAAK+O,KAAM/O,KAAK8mC,GAAI9mC,KAAKsF,MAChE,CACAulC,SACI,OAAO,IAAIw0B,EAAQ,CAACr/D,KAAK+O,KAAM/O,KAAK8mC,GAAK9mC,KAAK+O,KAAM/O,KAAKsF,MAAM2L,MACnE,CACAq4B,OAAO7c,GACH,OAAO,IAAIo1C,EAAY7hE,KAAK+O,KAAM/O,KAAK+O,KAAO/O,KAAKsF,MAAM2L,KAAMwb,EAAInnB,MAAMtF,KAAK+O,KAAM/O,KAAK8mC,IAC7F,CACA7mC,IAAI2oC,GACA,IAAI75B,EAAO65B,EAAQwzB,UAAUp8D,KAAK+O,KAAM,GAAI+3B,EAAK8B,EAAQwzB,UAAUp8D,KAAK8mC,IAAK,GAC7E,OAAI/3B,EAAKqwD,eAAiBt4B,EAAGs4B,cAClB,KACJ,IAAIyC,EAAY9yD,EAAKuX,IAAKhiB,KAAKC,IAAIwK,EAAKuX,IAAKwgB,EAAGxgB,KAAMtmB,KAAKsF,MACtE,CACAkkC,MAAMvkC,GACF,KAAMA,aAAiB48D,IAAgB58D,EAAM40D,WAAa75D,KAAK65D,UAC3D,OAAO,KACX,GAAI75D,KAAK+O,KAAO/O,KAAKsF,MAAM2L,MAAQhM,EAAM8J,MAAS/O,KAAKsF,MAAMijD,SAAYtjD,EAAMK,MAAMgjD,UAKhF,IAAIrjD,EAAM6hC,IAAM9mC,KAAK+O,MAAS/O,KAAKsF,MAAMgjD,WAAcrjD,EAAMK,MAAMijD,QAMpE,OAAO,KANsE,CAC7E,IAAIjjD,EAAQtF,KAAKsF,MAAM2L,KAAOhM,EAAMK,MAAM2L,MAAQ,EAAI,WAChD,IAAI,KAAMhM,EAAMK,MAAMnF,QAAQqmC,OAAOxmC,KAAKsF,MAAMnF,SAAU8E,EAAMK,MAAMgjD,UAAWtoD,KAAKsF,MAAMijD,SAClG,OAAO,IAAIsZ,EAAY58D,EAAM8J,KAAM/O,KAAK8mC,GAAIxhC,EAAOtF,KAAK65D,UAC5D,CAGA,CAZgG,CAC5F,IAAIv0D,EAAQtF,KAAKsF,MAAM2L,KAAOhM,EAAMK,MAAM2L,MAAQ,EAAI,WAChD,IAAI,KAAMjR,KAAKsF,MAAMnF,QAAQqmC,OAAOvhC,EAAMK,MAAMnF,SAAUH,KAAKsF,MAAMgjD,UAAWrjD,EAAMK,MAAMijD,SAClG,OAAO,IAAIsZ,EAAY7hE,KAAK+O,KAAM/O,KAAK8mC,IAAM7hC,EAAM6hC,GAAK7hC,EAAM8J,MAAOzJ,EAAOtF,KAAK65D,UACrF,CASJ,CACAxzB,SACI,IAAI8hB,EAAO,CAAE6Y,SAAU,UAAWjyD,KAAM/O,KAAK+O,KAAM+3B,GAAI9mC,KAAK8mC,IAK5D,OAJI9mC,KAAKsF,MAAM2L,OACXk3C,EAAK7iD,MAAQtF,KAAKsF,MAAM+gC,UACxBrmC,KAAK65D,YACL1R,EAAK0R,WAAY,GACd1R,CACX,CAIA1sB,gBAAgBI,EAAQssB,GACpB,GAAwB,iBAAbA,EAAKp5C,MAAsC,iBAAXo5C,EAAKrhB,GAC5C,MAAM,IAAIwgB,WAAW,0CACzB,OAAO,IAAIua,EAAY1Z,EAAKp5C,KAAMo5C,EAAKrhB,GAAI,cAAejL,EAAQssB,EAAK7iD,SAAU6iD,EAAK0R,UAC1F,EAEJkH,EAAKrF,OAAO,UAAWmG,GAMvB,MAAME,UAA0BhB,EAO5B1+D,YAIA0M,EAIA+3B,EAIAk7B,EAIAC,EAIA38D,EAKA0qC,EAIA6pB,GAAY,GACR3lC,QACAl0B,KAAK+O,KAAOA,EACZ/O,KAAK8mC,GAAKA,EACV9mC,KAAKgiE,QAAUA,EACfhiE,KAAKiiE,MAAQA,EACbjiE,KAAKsF,MAAQA,EACbtF,KAAKgwC,OAASA,EACdhwC,KAAK65D,UAAYA,CACrB,CACArzD,MAAMimB,GACF,GAAIzsB,KAAK65D,YAAciI,EAAer1C,EAAKzsB,KAAK+O,KAAM/O,KAAKgiE,UACvDF,EAAer1C,EAAKzsB,KAAKiiE,MAAOjiE,KAAK8mC,KACrC,OAAOo6B,EAAW1pC,KAAK,iDAC3B,IAAIxS,EAAMyH,EAAInnB,MAAMtF,KAAKgiE,QAAShiE,KAAKiiE,OACvC,GAAIj9C,EAAIsjC,WAAatjC,EAAIujC,QACrB,OAAO2Y,EAAW1pC,KAAK,2BAC3B,IAAI0qC,EAAWliE,KAAKsF,MAAMkjD,SAASxoD,KAAKgwC,OAAQhrB,EAAI7kB,SACpD,OAAK+hE,EAEEhB,EAAWM,YAAY/0C,EAAKzsB,KAAK+O,KAAM/O,KAAK8mC,GAAIo7B,GAD5ChB,EAAW1pC,KAAK,8BAE/B,CACAqT,SACI,OAAO,IAAIw0B,EAAQ,CAACr/D,KAAK+O,KAAM/O,KAAKgiE,QAAUhiE,KAAK+O,KAAM/O,KAAKgwC,OAC1DhwC,KAAKiiE,MAAOjiE,KAAK8mC,GAAK9mC,KAAKiiE,MAAOjiE,KAAKsF,MAAM2L,KAAOjR,KAAKgwC,QACjE,CACA1G,OAAO7c,GACH,IAAIzH,EAAMhlB,KAAKiiE,MAAQjiE,KAAKgiE,QAC5B,OAAO,IAAID,EAAkB/hE,KAAK+O,KAAM/O,KAAK+O,KAAO/O,KAAKsF,MAAM2L,KAAO+T,EAAKhlB,KAAK+O,KAAO/O,KAAKgwC,OAAQhwC,KAAK+O,KAAO/O,KAAKgwC,OAAShrB,EAAKyH,EAAInnB,MAAMtF,KAAK+O,KAAM/O,KAAK8mC,IAAI4hB,cAAc1oD,KAAKgiE,QAAUhiE,KAAK+O,KAAM/O,KAAKiiE,MAAQjiE,KAAK+O,MAAO/O,KAAKgiE,QAAUhiE,KAAK+O,KAAM/O,KAAK65D,UACrQ,CACA55D,IAAI2oC,GACA,IAAI75B,EAAO65B,EAAQwzB,UAAUp8D,KAAK+O,KAAM,GAAI+3B,EAAK8B,EAAQwzB,UAAUp8D,KAAK8mC,IAAK,GACzEk7B,EAAUp5B,EAAQ3oC,IAAID,KAAKgiE,SAAU,GAAIC,EAAQr5B,EAAQ3oC,IAAID,KAAKiiE,MAAO,GAC7E,OAAKlzD,EAAKqwD,eAAiBt4B,EAAGs4B,eAAkB4C,EAAUjzD,EAAKuX,KAAO27C,EAAQn7B,EAAGxgB,IACtE,KACJ,IAAIy7C,EAAkBhzD,EAAKuX,IAAKwgB,EAAGxgB,IAAK07C,EAASC,EAAOjiE,KAAKsF,MAAOtF,KAAKgwC,OAAQhwC,KAAK65D,UACjG,CACAxzB,SACI,IAAI8hB,EAAO,CAAE6Y,SAAU,gBAAiBjyD,KAAM/O,KAAK+O,KAAM+3B,GAAI9mC,KAAK8mC,GAC9Dk7B,QAAShiE,KAAKgiE,QAASC,MAAOjiE,KAAKiiE,MAAOjyB,OAAQhwC,KAAKgwC,QAK3D,OAJIhwC,KAAKsF,MAAM2L,OACXk3C,EAAK7iD,MAAQtF,KAAKsF,MAAM+gC,UACxBrmC,KAAK65D,YACL1R,EAAK0R,WAAY,GACd1R,CACX,CAIA1sB,gBAAgBI,EAAQssB,GACpB,GAAwB,iBAAbA,EAAKp5C,MAAsC,iBAAXo5C,EAAKrhB,IACrB,iBAAhBqhB,EAAK6Z,SAA4C,iBAAd7Z,EAAK8Z,OAA2C,iBAAf9Z,EAAKnY,OAChF,MAAM,IAAIsX,WAAW,gDACzB,OAAO,IAAIya,EAAkB5Z,EAAKp5C,KAAMo5C,EAAKrhB,GAAIqhB,EAAK6Z,QAAS7Z,EAAK8Z,MAAO,cAAepmC,EAAQssB,EAAK7iD,OAAQ6iD,EAAKnY,SAAUmY,EAAK0R,UACvI,EAGJ,SAASiI,EAAer1C,EAAK1d,EAAM+3B,GAC/B,IAAIkO,EAAQvoB,EAAI1hB,QAAQgE,GAAOi6C,EAAOliB,EAAK/3B,EAAMua,EAAQ0rB,EAAM1rB,MAC/D,KAAO0/B,EAAO,GAAK1/B,EAAQ,GAAK0rB,EAAMjE,WAAWznB,IAAU0rB,EAAM7mC,KAAKmb,GAAOspB,YACzEtpB,IACA0/B,IAEJ,GAAIA,EAAO,EAAG,CACV,IAAIj3C,EAAOijC,EAAM7mC,KAAKmb,GAAO2zB,WAAWjI,EAAMjE,WAAWznB,IACzD,KAAO0/B,EAAO,GAAG,CACb,IAAKj3C,GAAQA,EAAKm1C,OACd,OAAO,EACXn1C,EAAOA,EAAKkkC,WACZ+S,GACJ,CACJ,CACA,OAAO,CACX,CAgGA,SAASmZ,EAAOh0D,EAAMM,EAAOG,GACzB,OAAiB,GAATH,GAAcN,EAAKgqC,WAAW1pC,EAAON,EAAKykC,eAC7ChkC,GAAOT,EAAKykC,YAAczkC,EAAKgqC,WAAW,EAAGvpC,GACtD,CAMA,SAASwzD,EAAW5xB,GAChB,IACIrwC,EADSqwC,EAAM/f,OACEtwB,QAAQknD,WAAW7W,EAAM/2B,WAAY+2B,EAAM72B,UAChE,IAAK,IAAI2P,EAAQknB,EAAMlnB,SAAUA,EAAO,CACpC,IAAInb,EAAOqiC,EAAMwE,MAAM7mC,KAAKmb,GACxB/a,EAAQiiC,EAAMwE,MAAMzmC,MAAM+a,GAAQ3P,EAAW62B,EAAMiH,IAAI1G,WAAWznB,GACtE,GAAIA,EAAQknB,EAAMlnB,OAASnb,EAAKgqC,WAAW5pC,EAAOoL,EAAUxZ,GACxD,OAAOmpB,EACX,GAAa,GAATA,GAAcnb,EAAKtJ,KAAKo3B,KAAKua,YAAc2rB,EAAOh0D,EAAMI,EAAOoL,GAC/D,KACR,CACA,OAAO,IACX,CAmCA,SAASooC,EAAavR,EAAOH,EAAU7U,EAAQ,KAAM6mC,EAAa7xB,GAC9D,IAAI8xB,EAQR,SAA6B9xB,EAAO3rC,GAChC,IAAI,OAAE4rB,EAAM,WAAEhX,EAAU,SAAEE,GAAa62B,EACnC8xB,EAAS7xC,EAAOqoB,eAAer/B,GAAYsoC,aAAal9C,GAC5D,IAAKy9D,EACD,OAAO,KACX,IAAIC,EAAQD,EAAOhiE,OAASgiE,EAAO,GAAKz9D,EACxC,OAAO4rB,EAAOqgB,eAAer3B,EAAYE,EAAU4oD,GAASD,EAAS,IACzE,CAfiBE,CAAoBhyB,EAAOH,GACpC3I,EAAQ46B,GAehB,SAA4B9xB,EAAO3rC,GAC/B,IAAI,OAAE4rB,EAAM,WAAEhX,EAAU,SAAEE,GAAa62B,EACnC9I,EAAQjX,EAAOqC,MAAMrZ,GACrB8B,EAAS1W,EAAKgnD,aAAa9J,aAAara,EAAM7iC,MAClD,IAAK0W,EACD,OAAO,KACX,IACIknD,GADWlnD,EAAOjb,OAASib,EAAOA,EAAOjb,OAAS,GAAKuE,GACjCgnD,aAC1B,IAAK,IAAIrrD,EAAIiZ,EAAYgpD,GAAcjiE,EAAImZ,EAAUnZ,IACjDiiE,EAAaA,EAAWzgB,UAAUvxB,EAAOqC,MAAMtyB,GAAGqE,MACtD,OAAK49D,GAAeA,EAAWxgB,SAExB1mC,EADI,IAEf,CA5B0BmnD,CAAmBL,EAAYhyB,GACrD,OAAK3I,EAEE46B,EAAOriE,IAAI0iE,GACbtiE,OAAO,CAAEwE,KAAMwrC,EAAU7U,UAASn7B,OAAOqnC,EAAMznC,IAAI0iE,IAF7C,IAGf,CACA,SAASA,EAAU99D,GAAQ,MAAO,CAAEA,OAAM22B,MAAO,KAAQ,CA2EzD,SAASonC,EAASn2C,EAAKnG,EAAKgD,EAAQ,EAAGu5C,GACnC,IAAI5hB,EAAOx0B,EAAI1hB,QAAQub,GAAMnd,EAAO83C,EAAK33B,MAAQA,EAC7Cw5C,EAAaD,GAAcA,EAAWA,EAAWviE,OAAS,IAAO2gD,EAAKxwB,OAC1E,GAAItnB,EAAO,GAAK83C,EAAKxwB,OAAO5rB,KAAKo3B,KAAKua,YACjCyK,EAAKxwB,OAAO0nB,WAAW8I,EAAK1yC,QAAS0yC,EAAKxwB,OAAOmiB,cACjDkwB,EAAUj+D,KAAKmrD,aAAa/O,EAAKxwB,OAAOtwB,QAAQknD,WAAWpG,EAAK1yC,QAAS0yC,EAAKxwB,OAAOmiB,aACtF,OAAO,EACX,IAAK,IAAIvmB,EAAI40B,EAAK33B,MAAQ,EAAG9oB,EAAI8oB,EAAQ,EAAG+C,EAAIljB,EAAMkjB,IAAK7rB,IAAK,CAC5D,IAAI2N,EAAO8yC,EAAK9yC,KAAKke,GAAI9d,EAAQ0yC,EAAK1yC,MAAM8d,GAC5C,GAAIle,EAAKtJ,KAAKo3B,KAAKua,UACf,OAAO,EACX,IAAIusB,EAAO50D,EAAKhO,QAAQknD,WAAW94C,EAAOJ,EAAKykC,YAC3C12B,EAAS2mD,GAAcA,EAAWriE,IAAO2N,EAG7C,GAFI+N,GAAS/N,IACT40D,EAAOA,EAAKjhC,aAAa,EAAG5lB,EAAMrX,KAAKmW,OAAOkB,EAAMsf,UACnDrtB,EAAKgqC,WAAW5pC,EAAQ,EAAGJ,EAAKykC,cAAgB12B,EAAMrX,KAAKmrD,aAAa+S,GACzE,OAAO,CACf,CACA,IAAIx0D,EAAQ0yC,EAAKlQ,WAAW5nC,GACxB65D,EAAWH,GAAcA,EAAW,GACxC,OAAO5hB,EAAK9yC,KAAKhF,GAAM2nC,eAAeviC,EAAOA,EAAOy0D,EAAWA,EAASn+D,KAAOo8C,EAAK9yC,KAAKhF,EAAO,GAAGtE,KACvG,CAcA,SAASo+D,EAAQx2C,EAAKnG,GAClB,IAAI26B,EAAOx0B,EAAI1hB,QAAQub,GAAM/X,EAAQ0yC,EAAK1yC,QAC1C,OAGc0jB,EAHEgvB,EAAKtQ,WAGJze,EAHgB+uB,EAAKlJ,aAI5B9lB,IAAKC,GAAMD,EAAEi1B,SAAUj1B,EAAEg6B,UAAU/5B,KAHzC+uB,EAAKxwB,OAAO0nB,WAAW5pC,EAAOA,EAAQ,GAE9C,IAAkB0jB,EAAGC,CADrB,CAwEA,SAASgxC,EAAUz2C,EAAKnG,EAAKhhB,GACzB,IAAI27C,EAAOx0B,EAAI1hB,QAAQub,GACvB,IAAKhhB,EAAMnF,QAAQ8Q,KACf,OAAOqV,EACX,IAAInmB,EAAUmF,EAAMnF,QACpB,IAAK,IAAIK,EAAI,EAAGA,EAAI8E,EAAMgjD,UAAW9nD,IACjCL,EAAUA,EAAQ81C,WAAW91C,QACjC,IAAK,IAAIgjE,EAAO,EAAGA,IAA4B,GAAnB79D,EAAMgjD,WAAkBhjD,EAAM2L,KAAO,EAAI,GAAIkyD,IACrE,IAAK,IAAI92C,EAAI40B,EAAK33B,MAAO+C,GAAK,EAAGA,IAAK,CAClC,IAAIgvC,EAAOhvC,GAAK40B,EAAK33B,MAAQ,EAAI23B,EAAK36B,MAAQ26B,EAAKxyC,MAAM4d,EAAI,GAAK40B,EAAKryC,IAAIyd,EAAI,IAAM,GAAK,EAAI,EAC1F+2C,EAAYniB,EAAK1yC,MAAM8d,IAAMgvC,EAAO,EAAI,EAAI,GAC5C5qC,EAASwwB,EAAK9yC,KAAKke,GAAIg3C,GAAO,EAClC,GAAY,GAARF,EACAE,EAAO5yC,EAAO0nB,WAAWirB,EAAWA,EAAWjjE,OAE9C,CACD,IAAIuwC,EAAWjgB,EAAOqoB,eAAesqB,GAAWrhB,aAAa5hD,EAAQ81C,WAAWpxC,MAChFw+D,EAAO3yB,GAAYjgB,EAAOqgB,eAAesyB,EAAWA,EAAW1yB,EAAS,GAC5E,CACA,GAAI2yB,EACA,OAAe,GAARhI,EAAYpa,EAAK36B,IAAM+0C,EAAO,EAAIpa,EAAKvxC,OAAO2c,EAAI,GAAK40B,EAAK/kC,MAAMmQ,EAAI,EACrF,CAEJ,OAAO,IACX,CAQA,SAASi3C,EAAY72C,EAAK1d,EAAM+3B,EAAK/3B,EAAMzJ,EAAQ,YAC/C,GAAIyJ,GAAQ+3B,IAAOxhC,EAAM2L,KACrB,OAAO,KACX,IAAI+jC,EAAQvoB,EAAI1hB,QAAQgE,GAAO0oC,EAAMhrB,EAAI1hB,QAAQ+7B,GAEjD,OAAIy8B,EAAcvuB,EAAOyC,EAAKnyC,GACnB,IAAIu8D,EAAY9yD,EAAM+3B,EAAIxhC,GAC9B,IAAIk+D,EAAOxuB,EAAOyC,EAAKnyC,GAAOm+D,KACzC,CACA,SAASF,EAAcvuB,EAAOyC,EAAKnyC,GAC/B,OAAQA,EAAMgjD,YAAchjD,EAAMijD,SAAWvT,EAAMvmC,SAAWgpC,EAAIhpC,SAC9DumC,EAAMvkB,OAAO0nB,WAAWnD,EAAMzmC,QAASkpC,EAAIlpC,QAASjJ,EAAMnF,QAClE,CAvZA4gE,EAAKrF,OAAO,gBAAiBqG,GA4a7B,MAAMyB,EACFnhE,YAAY2yC,EAAOyC,EAAKisB,GACpB1jE,KAAKg1C,MAAQA,EACbh1C,KAAKy3C,IAAMA,EACXz3C,KAAK0jE,SAAWA,EAChB1jE,KAAK2jE,SAAW,GAChB3jE,KAAKioD,OAAS,WACd,IAAK,IAAIznD,EAAI,EAAGA,GAAKw0C,EAAM1rB,MAAO9oB,IAAK,CACnC,IAAI2N,EAAO6mC,EAAM7mC,KAAK3N,GACtBR,KAAK2jE,SAASxiE,KAAK,CACf0D,KAAMsJ,EAAKtJ,KACXknB,MAAO5d,EAAK2qC,eAAe9D,EAAMjE,WAAWvwC,KAEpD,CACA,IAAK,IAAIA,EAAIw0C,EAAM1rB,MAAO9oB,EAAI,EAAGA,IAC7BR,KAAKioD,OAAS,UAAcjT,EAAM7mC,KAAK3N,GAAG0C,KAAKlD,KAAKioD,QAC5D,CACI3+B,YAAU,OAAOtpB,KAAK2jE,SAASrjE,OAAS,CAAG,CAC/CmjE,MAII,KAAOzjE,KAAK0jE,SAASzyD,MAAM,CACvB,IAAIwyD,EAAMzjE,KAAK4jE,eACXH,EACAzjE,KAAK6jE,WAAWJ,GAEhBzjE,KAAK8jE,YAAc9jE,KAAK+jE,UAChC,CAMA,IAAIC,EAAahkE,KAAKikE,iBAAkBC,EAAalkE,KAAKioD,OAAOh3C,KAAOjR,KAAKspB,MAAQtpB,KAAKg1C,MAAM1rB,MAC5F0rB,EAAQh1C,KAAKg1C,MAAOyC,EAAMz3C,KAAKuiB,MAAMyhD,EAAa,EAAIhkE,KAAKy3C,IAAMzC,EAAMvoB,IAAI1hB,QAAQi5D,IACvF,IAAKvsB,EACD,OAAO,KAEX,IAAIt3C,EAAUH,KAAKioD,OAAQK,EAAYtT,EAAM1rB,MAAOi/B,EAAU9Q,EAAInuB,MAClE,KAAOg/B,GAAaC,GAAiC,GAAtBpoD,EAAQyyC,YACnCzyC,EAAUA,EAAQ81C,WAAW91C,QAC7BmoD,IACAC,IAEJ,IAAIjjD,EAAQ,IAAI,KAAMnF,EAASmoD,EAAWC,GAC1C,OAAIyb,GAAc,EACP,IAAIjC,EAAkB/sB,EAAM1uB,IAAK09C,EAAYhkE,KAAKy3C,IAAInxB,IAAKtmB,KAAKy3C,IAAI7oC,MAAOtJ,EAAO4+D,GACzF5+D,EAAM2L,MAAQ+jC,EAAM1uB,KAAOtmB,KAAKy3C,IAAInxB,IAC7B,IAAIu7C,EAAY7sB,EAAM1uB,IAAKmxB,EAAInxB,IAAKhhB,GACxC,IACX,CAIAs+D,eACI,IAAIO,EAAankE,KAAK0jE,SAASpb,UAC/B,IAAK,IAAIgF,EAAMttD,KAAK0jE,SAASvjE,QAASksB,EAAI,EAAGk8B,EAAUvoD,KAAK0jE,SAASnb,QAASl8B,EAAI83C,EAAY93C,IAAK,CAC/F,IAAIle,EAAOm/C,EAAIrX,WAGf,GAFIqX,EAAI1a,WAAa,IACjB2V,EAAU,GACVp6C,EAAKtJ,KAAKo3B,KAAKua,WAAa+R,GAAWl8B,EAAG,CAC1C83C,EAAa93C,EACb,KACJ,CACAihC,EAAMn/C,EAAKhO,OACf,CAGA,IAAK,IAAIgjE,EAAO,EAAGA,GAAQ,EAAGA,IAC1B,IAAK,IAAIiB,EAAqB,GAARjB,EAAYgB,EAAankE,KAAK0jE,SAASpb,UAAW8b,GAAc,EAAGA,IAAc,CACnG,IAAIl6C,EAAUuG,EAAS,KACnB2zC,GACA3zC,EAAS4zC,EAAUrkE,KAAK0jE,SAASvjE,QAASikE,EAAa,GAAGnuB,WAC1D/rB,EAAWuG,EAAOtwB,SAGlB+pB,EAAWlqB,KAAK0jE,SAASvjE,QAE7B,IAAI+jD,EAAQh6B,EAAS+rB,WACrB,IAAK,IAAIquB,EAAgBtkE,KAAKspB,MAAOg7C,GAAiB,EAAGA,IAAiB,CACtE,IAAoDlsC,GAAhD,KAAEvzB,EAAI,MAAEknB,GAAU/rB,KAAK2jE,SAASW,GAAsBplC,EAAS,KAInE,GAAY,GAARikC,IAAcjf,EAAQn4B,EAAMi2B,UAAUkC,EAAMr/C,QAAUq6B,EAASnT,EAAM8hC,WAAW,UAAc3J,IAAQ,IACpGzzB,GAAU5rB,EAAK88C,kBAAkBlxB,EAAO5rB,OAC1C,MAAO,CAAEu/D,aAAYE,gBAAe7zC,SAAQyO,UAG3C,GAAY,GAARikC,GAAajf,IAAU9rB,EAAOrM,EAAMg2B,aAAamC,EAAMr/C,OAC5D,MAAO,CAAEu/D,aAAYE,gBAAe7zC,SAAQ2H,QAGhD,GAAI3H,GAAU1E,EAAMi2B,UAAUvxB,EAAO5rB,MACjC,KACR,CACJ,CAER,CACAi/D,WACI,IAAI,QAAE3jE,EAAO,UAAEmoD,EAAS,QAAEC,GAAYvoD,KAAK0jE,SACvCh8B,EAAQ28B,EAAUlkE,EAASmoD,GAC/B,SAAK5gB,EAAMkL,YAAclL,EAAMuO,WAAWiR,SAE1ClnD,KAAK0jE,SAAW,IAAI,KAAMvjE,EAASmoD,EAAY,EAAGhkD,KAAKC,IAAIgkD,EAAS7gB,EAAMz2B,KAAOq3C,GAAanoD,EAAQ8Q,KAAOs3C,EAAUD,EAAY,EAAI,IAChI,GACX,CACAyb,WACI,IAAI,QAAE5jE,EAAO,UAAEmoD,EAAS,QAAEC,GAAYvoD,KAAK0jE,SACvCh8B,EAAQ28B,EAAUlkE,EAASmoD,GAC/B,GAAI5gB,EAAMkL,YAAc,GAAK0V,EAAY,EAAG,CACxC,IAAIic,EAAYpkE,EAAQ8Q,KAAOq3C,GAAaA,EAAY5gB,EAAMz2B,KAC9DjR,KAAK0jE,SAAW,IAAI,KAAMc,EAAiBrkE,EAASmoD,EAAY,EAAG,GAAIA,EAAY,EAAGic,EAAYjc,EAAY,EAAIC,EACtH,MAEIvoD,KAAK0jE,SAAW,IAAI,KAAMc,EAAiBrkE,EAASmoD,EAAW,GAAIA,EAAWC,EAEtF,CAIAsb,YAAW,WAAEO,EAAU,cAAEE,EAAa,OAAE7zC,EAAM,OAAEyO,EAAM,KAAE9G,IACpD,KAAOp4B,KAAKspB,MAAQg7C,GAChBtkE,KAAKykE,oBACT,GAAIrsC,EACA,IAAK,IAAI53B,EAAI,EAAGA,EAAI43B,EAAK93B,OAAQE,IAC7BR,KAAK0kE,iBAAiBtsC,EAAK53B,IACnC,IAAI8E,EAAQtF,KAAK0jE,SAAUx5C,EAAWuG,EAASA,EAAOtwB,QAAUmF,EAAMnF,QAClEmoD,EAAYhjD,EAAMgjD,UAAY8b,EAC9BO,EAAQ,EAAGh1D,EAAM,IACjB,MAAEoc,EAAK,KAAElnB,GAAS7E,KAAK2jE,SAASW,GACpC,GAAIplC,EAAQ,CACR,IAAK,IAAI1+B,EAAI,EAAGA,EAAI0+B,EAAO0T,WAAYpyC,IACnCmP,EAAIxO,KAAK+9B,EAAOpM,MAAMtyB,IAC1BurB,EAAQA,EAAM+/B,cAAc5sB,EAChC,CAIA,IAAI0lC,EAAgB16C,EAASjZ,KAAOmzD,GAAe9+D,EAAMnF,QAAQ8Q,KAAO3L,EAAMijD,SAG9E,KAAOoc,EAAQz6C,EAAS0oB,YAAY,CAChC,IAAI7gC,EAAOmY,EAAS4I,MAAM6xC,GAAQlT,EAAU1lC,EAAMi2B,UAAUjwC,EAAKlN,MACjE,IAAK4sD,EACD,MACJkT,KACIA,EAAQ,GAAkB,GAAbrc,GAAkBv2C,EAAK5R,QAAQ8Q,QAC5C8a,EAAQ0lC,EACR9hD,EAAIxO,KAAK0jE,EAAe9yD,EAAKqhC,KAAKvuC,EAAKorD,aAAal+C,EAAK6pB,QAAkB,GAAT+oC,EAAarc,EAAY,EAAGqc,GAASz6C,EAAS0oB,WAAagyB,GAAgB,IAErJ,CACA,IAAI9W,EAAQ6W,GAASz6C,EAAS0oB,WACzBkb,IACD8W,GAAgB,GACpB5kE,KAAKioD,OAAS6c,EAAc9kE,KAAKioD,OAAQqc,EAAe,UAAc30D,IACtE3P,KAAK2jE,SAASW,GAAev4C,MAAQA,EAGjC+hC,GAAS8W,EAAe,GAAKn0C,GAAUA,EAAO5rB,MAAQ7E,KAAK2jE,SAAS3jE,KAAKspB,OAAOzkB,MAAQ7E,KAAK2jE,SAASrjE,OAAS,GAC/GN,KAAKykE,oBAET,IAAK,IAAIjkE,EAAI,EAAG8sD,EAAMpjC,EAAU1pB,EAAIokE,EAAcpkE,IAAK,CACnD,IAAI2N,EAAOm/C,EAAIza,UACf7yC,KAAK2jE,SAASxiE,KAAK,CAAE0D,KAAMsJ,EAAKtJ,KAAMknB,MAAO5d,EAAK2qC,eAAe3qC,EAAKykC,cACtE0a,EAAMn/C,EAAKhO,OACf,CAIAH,KAAK0jE,SAAY5V,EACG,GAAdsW,EAAkB,WACd,IAAI,KAAMI,EAAiBl/D,EAAMnF,QAASikE,EAAa,EAAG,GAAIA,EAAa,EAAGQ,EAAe,EAAIt/D,EAAMijD,QAAU6b,EAAa,GAF/G,IAAI,KAAMI,EAAiBl/D,EAAMnF,QAASikE,EAAYO,GAAQr/D,EAAMgjD,UAAWhjD,EAAMijD,QAGlH,CACA0b,iBACI,IAAKjkE,KAAKy3C,IAAIhnB,OAAOmoB,YACjB,OAAQ,EACZ,IAAqChE,EAAjCtZ,EAAMt7B,KAAK2jE,SAAS3jE,KAAKspB,OAC7B,IAAKgS,EAAIz2B,KAAK+zC,cAAgBmsB,EAAiB/kE,KAAKy3C,IAAKz3C,KAAKy3C,IAAInuB,MAAOgS,EAAIz2B,KAAMy2B,EAAIvP,OAAO,IACzF/rB,KAAKy3C,IAAInuB,OAAStpB,KAAKspB,QAAUsrB,EAAQ50C,KAAKglE,eAAehlE,KAAKy3C,OAAS7C,EAAMtrB,OAAStpB,KAAKspB,MAChG,OAAQ,EACZ,IAAI,MAAEA,GAAUtpB,KAAKy3C,IAAKv7B,EAAQlc,KAAKy3C,IAAIv7B,MAAMoN,GACjD,KAAOA,EAAQ,GAAKpN,GAASlc,KAAKy3C,IAAI7oC,MAAM0a,MACtCpN,EACN,OAAOA,CACX,CACA8oD,eAAevtB,GACXsJ,EAAM,IAAK,IAAIvgD,EAAI8D,KAAKG,IAAIzE,KAAKspB,MAAOmuB,EAAInuB,OAAQ9oB,GAAK,EAAGA,IAAK,CAC7D,IAAI,MAAEurB,EAAK,KAAElnB,GAAS7E,KAAK2jE,SAASnjE,GAChCykE,EAAYzkE,EAAIi3C,EAAInuB,OAASmuB,EAAI7oC,IAAIpO,EAAI,IAAMi3C,EAAInxB,KAAOmxB,EAAInuB,OAAS9oB,EAAI,IAC3EijE,EAAMsB,EAAiBttB,EAAKj3C,EAAGqE,EAAMknB,EAAOk5C,GAChD,GAAKxB,EAAL,CAEA,IAAK,IAAIp3C,EAAI7rB,EAAI,EAAG6rB,GAAK,EAAGA,IAAK,CAC7B,IAAI,MAAEN,EAAK,KAAElnB,GAAS7E,KAAK2jE,SAASt3C,GAChColC,EAAUsT,EAAiBttB,EAAKprB,EAAGxnB,EAAMknB,GAAO,GACpD,IAAK0lC,GAAWA,EAAQ7e,WACpB,SAASmO,CACjB,CACA,MAAO,CAAEz3B,MAAO9oB,EAAGijE,MAAK91C,KAAMs3C,EAAYxtB,EAAIhrB,IAAI1hB,QAAQ0sC,EAAIv7B,MAAM1b,EAAI,IAAMi3C,EAPlE,CAQhB,CACJ,CACAl1B,MAAMk1B,GACF,IAAIl1B,EAAQviB,KAAKglE,eAAevtB,GAChC,IAAKl1B,EACD,OAAO,KACX,KAAOviB,KAAKspB,MAAQ/G,EAAM+G,OACtBtpB,KAAKykE,oBACLliD,EAAMkhD,IAAI7wB,aACV5yC,KAAKioD,OAAS6c,EAAc9kE,KAAKioD,OAAQ1lC,EAAM+G,MAAO/G,EAAMkhD,MAChEhsB,EAAMl1B,EAAMoL,KACZ,IAAK,IAAItB,EAAI9J,EAAM+G,MAAQ,EAAG+C,GAAKorB,EAAInuB,MAAO+C,IAAK,CAC/C,IAAIle,EAAOspC,EAAItpC,KAAKke,GAAI1c,EAAMxB,EAAKtJ,KAAKgnD,aAAagC,WAAW1/C,EAAKhO,SAAS,EAAMs3C,EAAIlpC,MAAM8d,IAC9FrsB,KAAK0kE,iBAAiBv2D,EAAKtJ,KAAMsJ,EAAKqtB,MAAO7rB,EACjD,CACA,OAAO8nC,CACX,CACAitB,iBAAiB7/D,EAAM22B,EAAQ,KAAMr7B,GACjC,IAAIm7B,EAAMt7B,KAAK2jE,SAAS3jE,KAAKspB,OAC7BgS,EAAIvP,MAAQuP,EAAIvP,MAAMi2B,UAAUn9C,GAChC7E,KAAKioD,OAAS6c,EAAc9kE,KAAKioD,OAAQjoD,KAAKspB,MAAO,UAAczkB,EAAKmW,OAAOwgB,EAAOr7B,KACtFH,KAAK2jE,SAASxiE,KAAK,CAAE0D,OAAMknB,MAAOlnB,EAAKgnD,cAC3C,CACA4Y,oBACI,IACI90D,EADO3P,KAAK2jE,SAASntD,MACVuV,MAAM8hC,WAAW,YAAgB,GAC5Cl+C,EAAIijC,aACJ5yC,KAAKioD,OAAS6c,EAAc9kE,KAAKioD,OAAQjoD,KAAK2jE,SAASrjE,OAAQqP,GACvE,EAEJ,SAAS60D,EAAiBt6C,EAAUZ,EAAO6G,GACvC,OAAa,GAAT7G,EACOY,EAASm9B,WAAWl3B,EAAOjG,EAAS0oB,YACxC1oB,EAAS4X,aAAa,EAAG5X,EAAS+rB,WAAW/yC,KAAKshE,EAAiBt6C,EAAS+rB,WAAW91C,QAASmpB,EAAQ,EAAG6G,IACtH,CACA,SAAS20C,EAAc56C,EAAUZ,EAAOnpB,GACpC,OAAa,GAATmpB,EACOY,EAASsc,OAAOrmC,GACpB+pB,EAAS4X,aAAa5X,EAAS0oB,WAAa,EAAG1oB,EAAS2oB,UAAU3vC,KAAK4hE,EAAc56C,EAAS2oB,UAAU1yC,QAASmpB,EAAQ,EAAGnpB,IACvI,CACA,SAASkkE,EAAUn6C,EAAUZ,GACzB,IAAK,IAAI9oB,EAAI,EAAGA,EAAI8oB,EAAO9oB,IACvB0pB,EAAWA,EAAS+rB,WAAW91C,QACnC,OAAO+pB,CACX,CACA,SAAS26C,EAAe12D,EAAMm6C,EAAWC,GACrC,GAAID,GAAa,EACb,OAAOn6C,EACX,IAAIw/C,EAAOx/C,EAAKhO,QAQhB,OAPImoD,EAAY,IACZqF,EAAOA,EAAK7rB,aAAa,EAAG+iC,EAAelX,EAAK1X,WAAYqS,EAAY,EAAsB,GAAnBqF,EAAK/a,WAAkB2V,EAAU,EAAI,KAChHD,EAAY,IACZqF,EAAOx/C,EAAKtJ,KAAKgnD,aAAagC,WAAWF,GAAMnnB,OAAOmnB,GAClDpF,GAAW,IACXoF,EAAOA,EAAKnnB,OAAOr4B,EAAKtJ,KAAKgnD,aAAaC,cAAc6B,GAAME,WAAW,YAAgB,MAE1F1/C,EAAKjL,KAAKyqD,EACrB,CACA,SAASoX,EAAiBttB,EAAKnuB,EAAOzkB,EAAMknB,EAAO9P,GAC/C,IAAI9N,EAAOspC,EAAItpC,KAAKmb,GAAQ/a,EAAQ0N,EAAOw7B,EAAI1G,WAAWznB,GAASmuB,EAAIlpC,MAAM+a,GAC7E,GAAI/a,GAASJ,EAAKykC,aAAe/tC,EAAK88C,kBAAkBxzC,EAAKtJ,MACzD,OAAO,KACX,IAAI4+D,EAAM13C,EAAM8hC,WAAW1/C,EAAKhO,SAAS,EAAMoO,GAC/C,OAAOk1D,IAEX,SAAsB5+D,EAAMqlB,EAAUzb,GAClC,IAAK,IAAIjO,EAAIiO,EAAOjO,EAAI0pB,EAAS0oB,WAAYpyC,IACzC,IAAKqE,EAAKmnD,YAAY9hC,EAAS4I,MAAMtyB,GAAGo7B,OACpC,OAAO,EACf,OAAO,CACX,CAPmBspC,CAAargE,EAAMsJ,EAAKhO,QAASoO,GAASk1D,EAAM,IACnE,CAOA,SAAS0B,EAAetgE,GACpB,OAAOA,EAAKo3B,KAAK0Y,UAAY9vC,EAAKo3B,KAAKmpC,kBAC3C,CA8EA,SAASC,EAAcn7C,EAAUZ,EAAOg8C,EAASC,EAAS90C,GACtD,GAAInH,EAAQg8C,EAAS,CACjB,IAAIphB,EAAQh6B,EAAS+rB,WACrB/rB,EAAWA,EAAS4X,aAAa,EAAGoiB,EAAMhhD,KAAKmiE,EAAcnhB,EAAM/jD,QAASmpB,EAAQ,EAAGg8C,EAASC,EAASrhB,IAC7G,CACA,GAAI56B,EAAQi8C,EAAS,CACjB,IAAIx5C,EAAQ0E,EAAOqoB,eAAe,GAC9BrqC,EAAQsd,EAAM8hC,WAAW3jC,GAAUsc,OAAOtc,GAC9CA,EAAWzb,EAAM+3B,OAAOza,EAAM+/B,cAAcr9C,GAAOo/C,WAAW,YAAgB,GAClF,CACA,OAAO3jC,CACX,CA2BA,SAASs7C,EAAcxwB,EAAOyC,GAC1B,IAAI7xC,EAAS,GACb,IAAK,IAAIymB,EADmB/nB,KAAKG,IAAIuwC,EAAM1rB,MAAOmuB,EAAInuB,OAC/B+C,GAAK,EAAGA,IAAK,CAChC,IAAI5d,EAAQumC,EAAMvmC,MAAM4d,GACxB,GAAI5d,EAAQumC,EAAM1uB,KAAO0uB,EAAM1rB,MAAQ+C,IACnCorB,EAAI7oC,IAAIyd,GAAKorB,EAAInxB,KAAOmxB,EAAInuB,MAAQ+C,IACpC2oB,EAAM7mC,KAAKke,GAAGxnB,KAAKo3B,KAAKua,WACxBiB,EAAItpC,KAAKke,GAAGxnB,KAAKo3B,KAAKua,UACtB,OACA/nC,GAASgpC,EAAIhpC,MAAM4d,IAClBA,GAAK2oB,EAAM1rB,OAAS+C,GAAKorB,EAAInuB,OAAS0rB,EAAMvkB,OAAO2pB,eAAiB3C,EAAIhnB,OAAO2pB,eAC5E/tB,GAAKorB,EAAIhpC,MAAM4d,EAAI,IAAM5d,EAAQ,IACrC7I,EAAOzE,KAAKkrB,EACpB,CACA,OAAOzmB,CACX,CAKA,MAAM6/D,UAAiB1E,EAInB1+D,YAIAikB,EAIA4oC,EAEAtsD,GACIsxB,QACAl0B,KAAKsmB,IAAMA,EACXtmB,KAAKkvD,KAAOA,EACZlvD,KAAK4C,MAAQA,CACjB,CACA4D,MAAMimB,GACF,IAAIte,EAAOse,EAAI8+B,OAAOvrD,KAAKsmB,KAC3B,IAAKnY,EACD,OAAO+yD,EAAW1pC,KAAK,wCAC3B,IAAIgE,EAAQn6B,OAAO2Z,OAAO,MAC1B,IAAK,IAAIvY,KAAQ0L,EAAKqtB,MAClBA,EAAM/4B,GAAQ0L,EAAKqtB,MAAM/4B,GAC7B+4B,EAAMx7B,KAAKkvD,MAAQlvD,KAAK4C,MACxB,IAAIwrC,EAAUjgC,EAAKtJ,KAAKmW,OAAOwgB,EAAO,KAAMrtB,EAAKytB,OACjD,OAAOslC,EAAWM,YAAY/0C,EAAKzsB,KAAKsmB,IAAKtmB,KAAKsmB,IAAM,EAAG,IAAI,KAAM,UAAc8nB,GAAU,EAAGjgC,EAAK+4C,OAAS,EAAI,GACtH,CACArc,SACI,OAAOw0B,EAAQt4B,KACnB,CACAuC,OAAO7c,GACH,OAAO,IAAIg5C,EAASzlE,KAAKsmB,IAAKtmB,KAAKkvD,KAAMziC,EAAI8+B,OAAOvrD,KAAKsmB,KAAKkV,MAAMx7B,KAAKkvD,MAC7E,CACAjvD,IAAI2oC,GACA,IAAItiB,EAAMsiB,EAAQwzB,UAAUp8D,KAAKsmB,IAAK,GACtC,OAAOA,EAAI64C,aAAe,KAAO,IAAIsG,EAASn/C,EAAIA,IAAKtmB,KAAKkvD,KAAMlvD,KAAK4C,MAC3E,CACAyjC,SACI,MAAO,CAAE26B,SAAU,OAAQ16C,IAAKtmB,KAAKsmB,IAAK4oC,KAAMlvD,KAAKkvD,KAAMtsD,MAAO5C,KAAK4C,MAC3E,CACA64B,gBAAgBI,EAAQssB,GACpB,GAAuB,iBAAZA,EAAK7hC,KAAuC,iBAAb6hC,EAAK+G,KAC3C,MAAM,IAAI5H,WAAW,uCACzB,OAAO,IAAIme,EAAStd,EAAK7hC,IAAK6hC,EAAK+G,KAAM/G,EAAKvlD,MAClD,EAEJm+D,EAAKrF,OAAO,OAAQ+J,GAKpB,IAAIC,EAAiB,cAAc39D,QAEnC29D,EAAiB,SAASA,EAAevxC,GACrC,IAAIzoB,EAAM3D,MAAMhG,KAAK/B,KAAMm0B,GAE3B,OADAzoB,EAAI47B,UAAYo+B,EAAepkE,UACxBoK,CACX,GACAg6D,EAAepkE,UAAYD,OAAO2Z,OAAOjT,MAAMzG,YACtBe,YAAcqjE,EACvCA,EAAepkE,UAAUmB,KAAO,iBAQhC,MAAMkjE,EAIFtjE,YAKAoqB,GACIzsB,KAAKysB,IAAMA,EAIXzsB,KAAKopC,MAAQ,GAIbppC,KAAKupC,KAAO,GAIZvpC,KAAK4oC,QAAU,IAAIu3B,CACvB,CAIIzwD,aAAW,OAAO1P,KAAKupC,KAAKjpC,OAASN,KAAKupC,KAAK,GAAKvpC,KAAKysB,GAAK,CAKlEgc,KAAKA,GACD,IAAI7iC,EAAS5F,KAAK2oC,UAAUF,GAC5B,GAAI7iC,EAAOu7D,OACP,MAAM,IAAIuE,EAAe9/D,EAAOu7D,QACpC,OAAOnhE,IACX,CAKA2oC,UAAUF,GACN,IAAI7iC,EAAS6iC,EAAKjiC,MAAMxG,KAAKysB,KAG7B,OAFK7mB,EAAOu7D,QACRnhE,KAAKg9D,QAAQv0B,EAAM7iC,EAAO6mB,KACvB7mB,CACX,CAKIsnC,iBACA,OAAOltC,KAAKopC,MAAM9oC,OAAS,CAC/B,CAIA08D,QAAQv0B,EAAMhc,GACVzsB,KAAKupC,KAAKpoC,KAAKnB,KAAKysB,KACpBzsB,KAAKopC,MAAMjoC,KAAKsnC,GAChBzoC,KAAK4oC,QAAQC,UAAUJ,EAAKoC,UAC5B7qC,KAAKysB,IAAMA,CACf,CAKAtnB,QAAQ4J,EAAM+3B,EAAK/3B,EAAMzJ,EAAQ,YAC7B,IAAImjC,EAAO66B,EAAYtjE,KAAKysB,IAAK1d,EAAM+3B,EAAIxhC,GAG3C,OAFImjC,GACAzoC,KAAKyoC,KAAKA,GACPzoC,IACX,CAKAsvC,YAAYvgC,EAAM+3B,EAAI3mC,GAClB,OAAOH,KAAKmF,QAAQ4J,EAAM+3B,EAAI,IAAI,KAAM,UAAc3mC,GAAU,EAAG,GACvE,CAIA8iC,OAAOl0B,EAAM+3B,GACT,OAAO9mC,KAAKmF,QAAQ4J,EAAM+3B,EAAI,WAClC,CAIAkJ,OAAO1pB,EAAKnmB,GACR,OAAOH,KAAKsvC,YAAYhpB,EAAKA,EAAKnmB,EACtC,CAoBA26D,aAAa/rD,EAAM+3B,EAAIxhC,GAEnB,OAjUR,SAAsBgjC,EAAIv5B,EAAM+3B,EAAIxhC,GAChC,IAAKA,EAAM2L,KACP,OAAOq3B,EAAG0yB,YAAYjsD,EAAM+3B,GAChC,IAAIkO,EAAQ1M,EAAG7b,IAAI1hB,QAAQgE,GAAO0oC,EAAMnP,EAAG7b,IAAI1hB,QAAQ+7B,GACvD,GAAIy8B,EAAcvuB,EAAOyC,EAAKnyC,GAC1B,OAAOgjC,EAAGG,KAAK,IAAIo5B,EAAY9yD,EAAM+3B,EAAIxhC,IAC7C,IAAIsgE,EAAeJ,EAAcxwB,EAAO1M,EAAG7b,IAAI1hB,QAAQ+7B,IAEV,GAAzC8+B,EAAaA,EAAatlE,OAAS,IACnCslE,EAAapvD,MAGjB,IAAIqvD,IAAoB7wB,EAAM1rB,MAAQ,GACtCs8C,EAAa52D,QAAQ62D,GAKrB,IAAK,IAAIx5C,EAAI2oB,EAAM1rB,MAAOhD,EAAM0uB,EAAM1uB,IAAM,EAAG+F,EAAI,EAAGA,IAAK/F,IAAO,CAC9D,IAAI2V,EAAO+Y,EAAM7mC,KAAKke,GAAGxnB,KAAKo3B,KAC9B,GAAIA,EAAK0Y,UAAY1Y,EAAK6pC,mBAAqB7pC,EAAKua,UAChD,MACAovB,EAAa31C,QAAQ5D,IAAM,EAC3Bw5C,EAAkBx5C,EACb2oB,EAAMtlC,OAAO2c,IAAM/F,GACxBs/C,EAAap3D,OAAO,EAAG,GAAI6d,EACnC,CAGA,IAAI05C,EAAuBH,EAAa31C,QAAQ41C,GAC5CG,EAAY,GAAIC,EAAiB3gE,EAAMgjD,UAC3C,IAAK,IAAInoD,EAAUmF,EAAMnF,QAASK,EAAI,GAAIA,IAAK,CAC3C,IAAI2N,EAAOhO,EAAQ81C,WAEnB,GADA+vB,EAAU7kE,KAAKgN,GACX3N,GAAK8E,EAAMgjD,UACX,MACJnoD,EAAUgO,EAAKhO,OACnB,CAGA,IAAK,IAAIksB,EAAI45C,EAAiB,EAAG55C,GAAK,EAAGA,IAAK,CAC1C,IAAIxnB,EAAOmhE,EAAU35C,GAAGxnB,KAAM0V,EAAM4qD,EAAetgE,GACnD,GAAI0V,GAAOy6B,EAAM7mC,KAAK43D,GAAsBlhE,MAAQA,EAChDohE,EAAiB55C,OAChB,GAAI9R,IAAQ1V,EAAK+zC,YAClB,KACR,CACA,IAAK,IAAI1b,EAAI53B,EAAMgjD,UAAWprB,GAAK,EAAGA,IAAK,CACvC,IAAIgpC,GAAahpC,EAAI+oC,EAAiB,IAAM3gE,EAAMgjD,UAAY,GAC1DtY,EAASg2B,EAAUE,GACvB,GAAKl2B,EAEL,IAAK,IAAIxvC,EAAI,EAAGA,EAAIolE,EAAatlE,OAAQE,IAAK,CAG1C,IAAI2lE,EAAcP,GAAcplE,EAAIulE,GAAwBH,EAAatlE,QAAS8lE,GAAS,EACvFD,EAAc,IACdC,GAAS,EACTD,GAAeA,GAEnB,IAAI11C,EAASukB,EAAM7mC,KAAKg4D,EAAc,GAAI53D,EAAQymC,EAAMzmC,MAAM43D,EAAc,GAC5E,GAAI11C,EAAOqgB,eAAeviC,EAAOA,EAAOyhC,EAAOnrC,KAAMmrC,EAAOpU,OACxD,OAAO0M,EAAGnjC,QAAQ6vC,EAAMtlC,OAAOy2D,GAAcC,EAAS3uB,EAAIv7B,MAAMiqD,GAAer/B,EAAI,IAAI,KAAMu+B,EAAc//D,EAAMnF,QAAS,EAAGmF,EAAMgjD,UAAW4d,GAAYA,EAAW5gE,EAAMijD,SACnL,CACJ,CACA,IAAI8d,EAAa/9B,EAAGc,MAAM9oC,OAC1B,IAAK,IAAIE,EAAIolE,EAAatlE,OAAS,EAAGE,GAAK,IACvC8nC,EAAGnjC,QAAQ4J,EAAM+3B,EAAIxhC,KACjBgjC,EAAGc,MAAM9oC,OAAS+lE,IAFoB7lE,IAAK,CAI/C,IAAI8oB,EAAQs8C,EAAaplE,GACrB8oB,EAAQ,IAEZva,EAAOimC,EAAMtlC,OAAO4Z,GACpBwd,EAAK2Q,EAAIv7B,MAAMoN,GACnB,CACJ,CAoPQwxC,CAAa96D,KAAM+O,EAAM+3B,EAAIxhC,GACtBtF,IACX,CAUA62C,iBAAiB9nC,EAAM+3B,EAAI34B,GAEvB,OArPR,SAA0Bm6B,EAAIv5B,EAAM+3B,EAAI34B,GACpC,IAAKA,EAAKuoC,UAAY3nC,GAAQ+3B,GAAMwB,EAAG7b,IAAI1hB,QAAQgE,GAAM0hB,OAAOtwB,QAAQ8Q,KAAM,CAC1E,IAAI6B,EA3cZ,SAAqB2Z,EAAKnG,EAAK+pB,GAC3B,IAAI4Q,EAAOx0B,EAAI1hB,QAAQub,GACvB,GAAI26B,EAAKxwB,OAAOqgB,eAAemQ,EAAK1yC,QAAS0yC,EAAK1yC,QAAS8hC,GACvD,OAAO/pB,EACX,GAAyB,GAArB26B,EAAKhM,aACL,IAAK,IAAI5oB,EAAI40B,EAAK33B,MAAQ,EAAG+C,GAAK,EAAGA,IAAK,CACtC,IAAI9d,EAAQ0yC,EAAK1yC,MAAM8d,GACvB,GAAI40B,EAAK9yC,KAAKke,GAAGykB,eAAeviC,EAAOA,EAAO8hC,GAC1C,OAAO4Q,EAAKvxC,OAAO2c,EAAI,GAC3B,GAAI9d,EAAQ,EACR,OAAO,IACf,CACJ,GAAI0yC,EAAKhM,cAAgBgM,EAAKxwB,OAAOtwB,QAAQ8Q,KACzC,IAAK,IAAIob,EAAI40B,EAAK33B,MAAQ,EAAG+C,GAAK,EAAGA,IAAK,CACtC,IAAI9d,EAAQ0yC,EAAKlQ,WAAW1kB,GAC5B,GAAI40B,EAAK9yC,KAAKke,GAAGykB,eAAeviC,EAAOA,EAAO8hC,GAC1C,OAAO4Q,EAAK/kC,MAAMmQ,EAAI,GAC1B,GAAI9d,EAAQ0yC,EAAK9yC,KAAKke,GAAGumB,WACrB,OAAO,IACf,CACJ,OAAO,IACX,CAsboB0zB,CAAYh+B,EAAG7b,IAAK1d,EAAMZ,EAAKtJ,MAC9B,MAATiO,IACA/D,EAAO+3B,EAAKh0B,EACpB,CACAw1B,EAAGwyB,aAAa/rD,EAAM+3B,EAAI,IAAI,KAAM,UAAc34B,GAAO,EAAG,GAChE,CA6OQ0oC,CAAiB72C,KAAM+O,EAAM+3B,EAAI34B,GAC1BnO,IACX,CAKAg7D,YAAYjsD,EAAM+3B,GAEd,OArPR,SAAqBwB,EAAIv5B,EAAM+3B,GAC3B,IAAIkO,EAAQ1M,EAAG7b,IAAI1hB,QAAQgE,GAAO0oC,EAAMnP,EAAG7b,IAAI1hB,QAAQ+7B,GACnDy/B,EAAUf,EAAcxwB,EAAOyC,GACnC,IAAK,IAAIj3C,EAAI,EAAGA,EAAI+lE,EAAQjmE,OAAQE,IAAK,CACrC,IAAI8oB,EAAQi9C,EAAQ/lE,GAAIuqC,EAAOvqC,GAAK+lE,EAAQjmE,OAAS,EACrD,GAAKyqC,GAAiB,GAATzhB,GAAe0rB,EAAM7mC,KAAKmb,GAAOzkB,KAAKgnD,aAAa5J,SAC5D,OAAO3Z,EAAGrF,OAAO+R,EAAMvmC,MAAM6a,GAAQmuB,EAAI7oC,IAAI0a,IACjD,GAAIA,EAAQ,IAAMyhB,GAAQiK,EAAM7mC,KAAKmb,EAAQ,GAAG6uB,WAAWnD,EAAMzmC,MAAM+a,EAAQ,GAAImuB,EAAI1G,WAAWznB,EAAQ,KACtG,OAAOgf,EAAGrF,OAAO+R,EAAMtlC,OAAO4Z,GAAQmuB,EAAIv7B,MAAMoN,GACxD,CACA,IAAK,IAAI+C,EAAI,EAAGA,GAAK2oB,EAAM1rB,OAAS+C,GAAKorB,EAAInuB,MAAO+C,IAChD,GAAItd,EAAOimC,EAAMvmC,MAAM4d,IAAM2oB,EAAM1rB,MAAQ+C,GAAKya,EAAKkO,EAAMpmC,IAAIyd,IAAMorB,EAAI7oC,IAAIyd,GAAKya,GAAM2Q,EAAInuB,MAAQ+C,EAChG,OAAOic,EAAGrF,OAAO+R,EAAMtlC,OAAO2c,GAAIya,GAE1CwB,EAAGrF,OAAOl0B,EAAM+3B,EACpB,CAqOQk0B,CAAYh7D,KAAM+O,EAAM+3B,GACjB9mC,IACX,CAQA63C,KAAKrH,EAAOjuC,GAER,OAz5BR,SAAc+lC,EAAIkI,EAAOjuC,GACrB,IAAI,MAAEyyC,EAAK,IAAEyC,EAAG,MAAEnuB,GAAUknB,EACxBg2B,EAAWxxB,EAAMtlC,OAAO4Z,EAAQ,GAAIm9C,EAAShvB,EAAIv7B,MAAMoN,EAAQ,GAC/D7a,EAAQ+3D,EAAU53D,EAAM63D,EACxB/2D,EAAS,WAAgB44C,EAAY,EACzC,IAAK,IAAIj8B,EAAI/C,EAAOo9C,GAAY,EAAOr6C,EAAI9pB,EAAQ8pB,IAC3Cq6C,GAAa1xB,EAAMzmC,MAAM8d,GAAK,GAC9Bq6C,GAAY,EACZh3D,EAAS,UAAcslC,EAAM7mC,KAAKke,GAAGnpB,KAAKwM,IAC1C44C,KAGA75C,IAER,IAAIyN,EAAQ,WAAgBqsC,EAAU,EACtC,IAAK,IAAIl8B,EAAI/C,EAAOo9C,GAAY,EAAOr6C,EAAI9pB,EAAQ8pB,IAC3Cq6C,GAAajvB,EAAIv7B,MAAMmQ,EAAI,GAAKorB,EAAI7oC,IAAIyd,IACxCq6C,GAAY,EACZxqD,EAAQ,UAAcu7B,EAAItpC,KAAKke,GAAGnpB,KAAKgZ,IACvCqsC,KAGA35C,IAER05B,EAAGG,KAAK,IAAIs5B,EAAkBtzD,EAAOG,EAAK43D,EAAUC,EAAQ,IAAI,KAAM/2D,EAAO82B,OAAOtqB,GAAQosC,EAAWC,GAAU74C,EAAOuB,KAAOq3C,GAAW,GAC9I,CA+3BQzQ,CAAK73C,KAAMwwC,EAAOjuC,GACXvC,IACX,CAKAO,KAAK+lB,EAAKgD,EAAQ,GAEd,OAnuBR,SAAcgf,EAAIhiB,EAAKgD,GACnB,IAAImf,EAAO,IAAIo5B,EAAYv7C,EAAMgD,EAAOhD,EAAMgD,EAAO,YAAa,GAClEgf,EAAGG,KAAKA,EACZ,CA+tBQloC,CAAKP,KAAMsmB,EAAKgD,GACTtpB,IACX,CAMAo4B,KAAKoY,EAAOm2B,GAER,OAz2BR,SAAcr+B,EAAIkI,EAAOm2B,GACrB,IAAIxmE,EAAU,WACd,IAAK,IAAIK,EAAImmE,EAASrmE,OAAS,EAAGE,GAAK,EAAGA,IAAK,CAC3C,GAAIL,EAAQ8Q,KAAM,CACd,IAAI8a,EAAQ46C,EAASnmE,GAAGqE,KAAKgnD,aAAaC,cAAc3rD,GACxD,IAAK4rB,IAAUA,EAAMk2B,SACjB,MAAM,IAAIqF,WAAW,yFAC7B,CACAnnD,EAAU,UAAcwmE,EAASnmE,GAAGqE,KAAKmW,OAAO2rD,EAASnmE,GAAGg7B,MAAOr7B,GACvE,CACA,IAAIsO,EAAQ+hC,EAAM/hC,MAAOG,EAAM4hC,EAAM5hC,IACrC05B,EAAGG,KAAK,IAAIs5B,EAAkBtzD,EAAOG,EAAKH,EAAOG,EAAK,IAAI,KAAMzO,EAAS,EAAG,GAAIwmE,EAASrmE,QAAQ,GACrG,CA41BQ83B,CAAKp4B,KAAMwwC,EAAOm2B,GACX3mE,IACX,CAKAgxC,aAAajiC,EAAM+3B,EAAK/3B,EAAMlK,EAAM22B,EAAQ,MAExC,OAp2BR,SAAsB8M,EAAIv5B,EAAM+3B,EAAIjiC,EAAM22B,GACtC,IAAK32B,EAAK+zC,YACN,MAAM,IAAI0O,WAAW,oDACzB,IAAItf,EAAUM,EAAGc,MAAM9oC,OACvBgoC,EAAG7b,IAAIwnB,aAAallC,EAAM+3B,GAAI,CAAC34B,EAAMmY,KACjC,GAAInY,EAAKyqC,cAAgBzqC,EAAKw0C,UAAU99C,EAAM22B,IAUtD,SAAuB/O,EAAKnG,EAAKzhB,GAC7B,IAAIo8C,EAAOx0B,EAAI1hB,QAAQub,GAAM/X,EAAQ0yC,EAAK1yC,QAC1C,OAAO0yC,EAAKxwB,OAAOqgB,eAAeviC,EAAOA,EAAQ,EAAG1J,EACxD,CAbgE+hE,CAAct+B,EAAG7b,IAAK6b,EAAGM,QAAQtjC,MAAM0iC,GAAS/nC,IAAIqmB,GAAMzhB,GAAO,CAErHyjC,EAAGsZ,kBAAkBtZ,EAAGM,QAAQtjC,MAAM0iC,GAAS/nC,IAAIqmB,EAAK,GAAIzhB,GAC5D,IAAI+jC,EAAUN,EAAGM,QAAQtjC,MAAM0iC,GAC3B6+B,EAASj+B,EAAQ3oC,IAAIqmB,EAAK,GAAIwgD,EAAOl+B,EAAQ3oC,IAAIqmB,EAAMnY,EAAK+lC,SAAU,GAE1E,OADA5L,EAAGG,KAAK,IAAIs5B,EAAkB8E,EAAQC,EAAMD,EAAS,EAAGC,EAAO,EAAG,IAAI,KAAM,UAAcjiE,EAAKmW,OAAOwgB,EAAO,KAAMrtB,EAAKytB,QAAS,EAAG,GAAI,GAAG,KACpI,CACX,IAER,CAq1BQoV,CAAahxC,KAAM+O,EAAM+3B,EAAIjiC,EAAM22B,GAC5Bx7B,IACX,CAKAk1C,cAAc5uB,EAAKzhB,EAAM22B,EAAQ,KAAMI,GAEnC,OAr1BR,SAAuB0M,EAAIhiB,EAAKzhB,EAAM22B,EAAOI,GACzC,IAAIztB,EAAOm6B,EAAG7b,IAAI8+B,OAAOjlC,GACzB,IAAKnY,EACD,MAAM,IAAIm5C,WAAW,6BACpBziD,IACDA,EAAOsJ,EAAKtJ,MAChB,IAAIkiE,EAAUliE,EAAKmW,OAAOwgB,EAAO,KAAMI,GAASztB,EAAKytB,OACrD,GAAIztB,EAAK+4C,OACL,OAAO5e,EAAGgH,YAAYhpB,EAAKA,EAAMnY,EAAK+lC,SAAU6yB,GACpD,IAAKliE,EAAKmrD,aAAa7hD,EAAKhO,SACxB,MAAM,IAAImnD,WAAW,iCAAmCziD,EAAKpC,MACjE6lC,EAAGG,KAAK,IAAIs5B,EAAkBz7C,EAAKA,EAAMnY,EAAK+lC,SAAU5tB,EAAM,EAAGA,EAAMnY,EAAK+lC,SAAW,EAAG,IAAI,KAAM,UAAc6yB,GAAU,EAAG,GAAI,GAAG,GAC1I,CAw0BQ7xB,CAAcl1C,KAAMsmB,EAAKzhB,EAAM22B,EAAOI,GAC/B57B,IACX,CAIAk2C,iBAAiB5vB,EAAK4oC,EAAMtsD,GAExB,OADA5C,KAAKyoC,KAAK,IAAIg9B,EAASn/C,EAAK4oC,EAAMtsD,IAC3B5C,IACX,CAIAgnE,YAAY1gD,EAAK8sB,GAEb,OADApzC,KAAKyoC,KAAK,IAAIi5B,EAAgBp7C,EAAK8sB,IAC5BpzC,IACX,CAKAinE,eAAe3gD,EAAK8sB,GAChB,KAAMA,aAAgB,MAAO,CACzB,IAAIjlC,EAAOnO,KAAKysB,IAAI8+B,OAAOjlC,GAC3B,IAAKnY,EACD,MAAM,IAAIm5C,WAAW,uBAAyBhhC,GAElD,KADA8sB,EAAOA,EAAK/U,QAAQlwB,EAAKytB,QAErB,OAAO57B,IACf,CAEA,OADAA,KAAKyoC,KAAK,IAAIm5B,EAAmBt7C,EAAK8sB,IAC/BpzC,IACX,CAQAyyB,MAAMnM,EAAKgD,EAAQ,EAAGu5C,GAElB,OAx1BR,SAAev6B,EAAIhiB,EAAKgD,EAAQ,EAAGu5C,GAC/B,IAAI5hB,EAAO3Y,EAAG7b,IAAI1hB,QAAQub,GAAM5W,EAAS,WAAgBwM,EAAQ,WACjE,IAAK,IAAImQ,EAAI40B,EAAK33B,MAAO9e,EAAIy2C,EAAK33B,MAAQA,EAAO9oB,EAAI8oB,EAAQ,EAAG+C,EAAI7hB,EAAG6hB,IAAK7rB,IAAK,CAC7EkP,EAAS,UAAcuxC,EAAK9yC,KAAKke,GAAGnpB,KAAKwM,IACzC,IAAIw3D,EAAYrE,GAAcA,EAAWriE,GACzC0b,EAAQ,UAAcgrD,EAAYA,EAAUriE,KAAKmW,OAAOksD,EAAU1rC,MAAOtf,GAAS+kC,EAAK9yC,KAAKke,GAAGnpB,KAAKgZ,GACxG,CACAosB,EAAGG,KAAK,IAAIo5B,EAAYv7C,EAAKA,EAAK,IAAI,KAAM5W,EAAO82B,OAAOtqB,GAAQoN,EAAOA,IAAQ,GACrF,CA+0BQmJ,CAAMzyB,KAAMsmB,EAAKgD,EAAOu5C,GACjB7iE,IACX,CAIA0zC,QAAQ3kC,EAAM+3B,EAAIsM,GAEd,OA9lCR,SAAiB9K,EAAIv5B,EAAM+3B,EAAIsM,GAC3B,IACI+zB,EAAUC,EADVC,EAAU,GAAIv7B,EAAQ,GAE1BxD,EAAG7b,IAAIwnB,aAAallC,EAAM+3B,GAAI,CAAC34B,EAAMmY,EAAKmK,KACtC,IAAKtiB,EAAKuoC,SACN,OACJ,IAAI9a,EAAQztB,EAAKytB,MACjB,IAAKwX,EAAK/U,QAAQzC,IAAUnL,EAAO5rB,KAAKk+C,eAAe3P,EAAKvuC,MAAO,CAC/D,IAAI4J,EAAQnK,KAAKC,IAAI+hB,EAAKvX,GAAOH,EAAMtK,KAAKG,IAAI6hB,EAAMnY,EAAK+lC,SAAUpN,GACjE66B,EAASvuB,EAAK7W,SAASX,GAC3B,IAAK,IAAIp7B,EAAI,EAAGA,EAAIo7B,EAAMt7B,OAAQE,IACzBo7B,EAAMp7B,GAAG69B,QAAQsjC,KACdwF,GAAYA,EAASrgC,IAAMr4B,GAAS04D,EAAS/zB,KAAKxE,GAAGhT,EAAMp7B,IAC3D2mE,EAASrgC,GAAKl4B,EAEdy4D,EAAQlmE,KAAKgmE,EAAW,IAAI1F,EAAehzD,EAAOG,EAAKgtB,EAAMp7B,MAGrE4mE,GAAUA,EAAOtgC,IAAMr4B,EACvB24D,EAAOtgC,GAAKl4B,EAEZk9B,EAAM3qC,KAAKimE,EAAS,IAAI9F,EAAY7yD,EAAOG,EAAKwkC,GACxD,KAEJi0B,EAAQ75D,SAAQwuB,GAAKsM,EAAGG,KAAKzM,KAC7B8P,EAAMt+B,SAAQwuB,GAAKsM,EAAGG,KAAKzM,IAC/B,CAmkCQ0X,CAAQ1zC,KAAM+O,EAAM+3B,EAAIsM,GACjBpzC,IACX,CAOAyzC,WAAW1kC,EAAM+3B,EAAIsM,GAEjB,OA7kCR,SAAoB9K,EAAIv5B,EAAM+3B,EAAIsM,GAC9B,IAAI2c,EAAU,GAAItnB,EAAO,EACzBH,EAAG7b,IAAIwnB,aAAallC,EAAM+3B,GAAI,CAAC34B,EAAMmY,KACjC,IAAKnY,EAAKuoC,SACN,OACJjO,IACA,IAAI6+B,EAAW,KACf,GAAIl0B,aAAgB,KAAU,CAC1B,IAAsBwS,EAAlBn9C,EAAM0F,EAAKytB,MACf,KAAOgqB,EAAQxS,EAAK/U,QAAQ51B,KACvB6+D,IAAaA,EAAW,KAAKnmE,KAAKykD,GACnCn9C,EAAMm9C,EAAMppB,cAAc/zB,EAElC,MACS2qC,EACDA,EAAK/U,QAAQlwB,EAAKytB,SAClB0rC,EAAW,CAACl0B,IAGhBk0B,EAAWn5D,EAAKytB,MAEpB,GAAI0rC,GAAYA,EAAShnE,OAAQ,CAC7B,IAAIsO,EAAMtK,KAAKG,IAAI6hB,EAAMnY,EAAK+lC,SAAUpN,GACxC,IAAK,IAAItmC,EAAI,EAAGA,EAAI8mE,EAAShnE,OAAQE,IAAK,CACtC,IAAyBolD,EAArBx0B,EAAQk2C,EAAS9mE,GACrB,IAAK,IAAI08B,EAAI,EAAGA,EAAI6yB,EAAQzvD,OAAQ48B,IAAK,CACrC,IAAIjC,EAAI80B,EAAQ7yB,GACZjC,EAAEwN,MAAQA,EAAO,GAAKrX,EAAMwd,GAAGmhB,EAAQ7yB,GAAG9L,SAC1Cw0B,EAAQ3qB,EAChB,CACI2qB,GACAA,EAAM9e,GAAKl4B,EACXg3C,EAAMnd,KAAOA,GAGbsnB,EAAQ5uD,KAAK,CAAEiwB,QAAOriB,KAAMzK,KAAKC,IAAI+hB,EAAKvX,GAAO+3B,GAAIl4B,EAAK65B,QAElE,CACJ,KAEJsnB,EAAQviD,SAAQytB,GAAKqN,EAAGG,KAAK,IAAIg5B,EAAexmC,EAAElsB,KAAMksB,EAAE6L,GAAI7L,EAAE7J,SACpE,CAmiCQqiB,CAAWzzC,KAAM+O,EAAM+3B,EAAIsM,GACpBpzC,IACX,CAOA4hD,kBAAkBt7B,EAAKihD,EAAYx7C,GAE/B,OA7iCR,SAA2Buc,EAAIhiB,EAAKihD,EAAYx7C,EAAQw7C,EAAW1b,cAC/D,IAAI19C,EAAOm6B,EAAG7b,IAAI8+B,OAAOjlC,GACrBkhD,EAAW,GAAIla,EAAMhnC,EAAM,EAC/B,IAAK,IAAI9lB,EAAI,EAAGA,EAAI2N,EAAKykC,WAAYpyC,IAAK,CACtC,IAAIsyB,EAAQ3kB,EAAK2kB,MAAMtyB,GAAIoO,EAAM0+C,EAAMx6B,EAAMohB,SACzCuzB,EAAU17C,EAAMi2B,UAAUlvB,EAAMjuB,MACpC,GAAK4iE,EAGA,CACD17C,EAAQ07C,EACR,IAAK,IAAIvqC,EAAI,EAAGA,EAAIpK,EAAM8I,MAAMt7B,OAAQ48B,IAC/BqqC,EAAWxkB,eAAejwB,EAAM8I,MAAMsB,GAAGr4B,OAC1CyjC,EAAGG,KAAK,IAAIg5B,EAAenU,EAAK1+C,EAAKkkB,EAAM8I,MAAMsB,IAC7D,MAPIsqC,EAASrmE,KAAK,IAAI0gE,EAAYvU,EAAK1+C,EAAK,aAQ5C0+C,EAAM1+C,CACV,CACA,IAAKmd,EAAMk2B,SAAU,CACjB,IAAIxN,EAAO1oB,EAAM8hC,WAAW,YAAgB,GAC5CvlB,EAAGnjC,QAAQmoD,EAAKA,EAAK,IAAI,KAAM7Y,EAAM,EAAG,GAC5C,CACA,IAAK,IAAIj0C,EAAIgnE,EAASlnE,OAAS,EAAGE,GAAK,EAAGA,IACtC8nC,EAAGG,KAAK++B,EAAShnE,GACzB,CAqhCQohD,CAAkB5hD,KAAMsmB,EAAKihD,EAAYx7C,GAClC/rB,IACX,wGCp9DJ,MAAM0nE,EAAW,SAAUv5D,GACvB,IAAK,IAAII,EAAQ,GAAIA,IAEjB,KADAJ,EAAOA,EAAK4nD,iBAER,OAAOxnD,CAEnB,EACMyzB,EAAa,SAAU7zB,GACzB,IAAIsiB,EAAStiB,EAAKw5D,cAAgBx5D,EAAK6zB,WACvC,OAAOvR,GAA6B,IAAnBA,EAAO4f,SAAiB5f,EAAOm3C,KAAOn3C,CAC3D,EACA,IAAIo3C,EAAc,KAIlB,MAAMC,EAAY,SAAU35D,EAAMY,EAAM+3B,GACpC,IAAI0J,EAAQq3B,IAAgBA,EAAcjzD,SAASmzD,eAGnD,OAFAv3B,EAAMw3B,OAAO75D,EAAY,MAAN24B,EAAa34B,EAAK0nD,UAAUv1D,OAASwmC,GACxD0J,EAAMy3B,SAAS95D,EAAMY,GAAQ,GACtByhC,CACX,EAIM03B,EAAuB,SAAU/5D,EAAMw1B,EAAKwkC,EAAYC,GAC1D,OAAOD,IAAeE,EAAQl6D,EAAMw1B,EAAKwkC,EAAYC,GAAY,IAC7DC,EAAQl6D,EAAMw1B,EAAKwkC,EAAYC,EAAW,GAClD,EACME,EAAe,gCACrB,SAASD,EAAQl6D,EAAMw1B,EAAKwkC,EAAYC,EAAWnN,GAC/C,OAAS,CACL,GAAI9sD,GAAQg6D,GAAcxkC,GAAOykC,EAC7B,OAAO,EACX,GAAIzkC,IAAQs3B,EAAM,EAAI,EAAI/mB,EAAS/lC,IAAQ,CACvC,IAAIsiB,EAAStiB,EAAK6zB,WAClB,IAAKvR,GAA6B,GAAnBA,EAAO4f,UAAiBk4B,EAAap6D,IAASm6D,EAAajjE,KAAK8I,EAAK0mD,WACxD,SAAxB1mD,EAAKouC,gBACL,OAAO,EACX5Y,EAAM+jC,EAASv5D,IAAS8sD,EAAM,EAAI,EAAI,GACtC9sD,EAAOsiB,CACX,KACK,IAAqB,GAAjBtiB,EAAKkiC,SAOV,OAAO,EALP,GAA4B,UAD5BliC,EAAOA,EAAKupD,WAAW/zB,GAAOs3B,EAAM,GAAK,EAAI,KACpC1e,gBACL,OAAO,EACX5Y,EAAMs3B,EAAM,EAAI/mB,EAAS/lC,GAAQ,CAIrC,CACJ,CACJ,CACA,SAAS+lC,EAAS/lC,GACd,OAAwB,GAAjBA,EAAKkiC,SAAgBliC,EAAK0nD,UAAUv1D,OAAS6N,EAAKupD,WAAWp3D,MACxE,CAaA,SAASioE,EAAa/nC,GAClB,IAAIr4B,EACJ,IAAK,IAAImlD,EAAM9sB,EAAK8sB,KACZnlD,EAAOmlD,EAAIkb,YADMlb,EAAMA,EAAItrB,YAGnC,OAAO75B,GAAQA,EAAKgG,MAAQhG,EAAKgG,KAAKmqC,UAAYnwC,EAAKq4B,KAAOA,GAAOr4B,EAAKovD,YAAc/2B,EAC5F,CAGA,MAAMioC,EAAqB,SAAUC,GACjC,OAAOA,EAAOC,WAAaT,EAAqBQ,EAAOC,UAAWD,EAAOE,YAAaF,EAAOG,WAAYH,EAAOI,aACpH,EACA,SAASC,EAASzjB,EAASpjD,GACvB,IAAIkT,EAAQR,SAASo0D,YAAY,SAIjC,OAHA5zD,EAAM6zD,UAAU,WAAW,GAAM,GACjC7zD,EAAMkwC,QAAUA,EAChBlwC,EAAMlT,IAAMkT,EAAM7F,KAAOrN,EAClBkT,CACX,CAuBA,MAAMioC,EAA0B,oBAAbC,UAA2BA,UAAY,KACpD7wB,EAAyB,oBAAZ7X,SAA0BA,SAAW,KAClD2oC,EAASF,GAAOA,EAAIG,WAAc,GAClCC,EAAU,cAAcvxB,KAAKqxB,GAC7BG,EAAY,UAAUxxB,KAAKqxB,GAC3BI,EAAU,wCAAwCzxB,KAAKqxB,GACvDnd,KAAQsd,GAAaC,GAAWF,GAChCyrB,EAAaxrB,EAAY9oC,SAASipC,aAAeF,GAAWA,EAAQ,GAAKF,GAAWA,EAAQ,GAAK,EACjG0rB,GAAS/oC,GAAM,gBAAgB/6B,KAAKk4C,GAC1C4rB,IAAW,iBAAiBj9C,KAAKqxB,IAAU,CAAC,EAAG,IAAI,GACnD,MAAMK,GAAWxd,GAAM,gBAAgBlU,KAAKqxB,GACtCiH,IAAW5G,EACXwrB,EAAiBxrB,GAAWA,EAAQ,GAAK,EACzCyrB,GAAUjpC,KAAQid,GAAO,iBAAiBh4C,KAAKg4C,EAAIW,QAEnDsrB,EAAMD,IAAW,cAAchkE,KAAKk4C,MAAYF,GAAOA,EAAIY,eAAiB,GAC5EwG,EAAM6kB,KAAQjsB,GAAM,MAAMh4C,KAAKg4C,EAAIa,UACnCqrB,IAAUlsB,GAAM,MAAMh4C,KAAKg4C,EAAIa,UAC/BsrB,EAAU,aAAankE,KAAKk4C,GAC5BksB,IAAWh9C,GAAO,wBAAyBA,EAAI0xB,gBAAgB/sB,MAC/Ds4C,EAAiBD,IAAW,uBAAuBv9C,KAAKoxB,UAAUE,YAAc,CAAC,EAAG,IAAI,GAAK,EAEnG,SAASmsB,EAAWl9C,GAChB,MAAO,CAAEpd,KAAM,EAAGC,MAAOmd,EAAI0xB,gBAAgByrB,YACzCtuC,IAAK,EAAGuuC,OAAQp9C,EAAI0xB,gBAAgB2rB,aAC5C,CACA,SAASC,EAAQnnE,EAAO05C,GACpB,MAAuB,iBAAT15C,EAAoBA,EAAQA,EAAM05C,EACpD,CACA,SAAS0tB,EAAW77D,GAChB,IAAI87D,EAAO97D,EAAK+7D,wBAEZC,EAAUF,EAAKG,MAAQj8D,EAAKk8D,aAAgB,EAC5CC,EAAUL,EAAKM,OAASp8D,EAAKq8D,cAAiB,EAElD,MAAO,CAAEn7D,KAAM46D,EAAK56D,KAAMC,MAAO26D,EAAK56D,KAAOlB,EAAKy7D,YAAcO,EAC5D7uC,IAAK2uC,EAAK3uC,IAAKuuC,OAAQI,EAAK3uC,IAAMntB,EAAK27D,aAAeQ,EAC9D,CACA,SAASG,EAAmB5wD,EAAMowD,EAAMS,GACpC,IAAIC,EAAkB9wD,EAAK+wD,SAAS,oBAAsB,EAAGC,EAAehxD,EAAK+wD,SAAS,iBAAmB,EACzGn+C,EAAM5S,EAAK2mB,IAAIy2B,cACnB,IAAK,IAAIxmC,EAASi6C,GAAY7wD,EAAK2mB,IAC1B/P,EADgCA,EAASuR,EAAWvR,GAAS,CAGlE,GAAuB,GAAnBA,EAAO4f,SACP,SACJ,IAAIjJ,EAAM3W,EACNq6C,EAAQ1jC,GAAO3a,EAAI6U,KACnBypC,EAAWD,EAAQnB,EAAWl9C,GAAOu9C,EAAW5iC,GAChD4jC,EAAQ,EAAGC,EAAQ,EASvB,GARIhB,EAAK3uC,IAAMyvC,EAASzvC,IAAMyuC,EAAQY,EAAiB,OACnDM,IAAUF,EAASzvC,IAAM2uC,EAAK3uC,IAAMyuC,EAAQc,EAAc,QACrDZ,EAAKJ,OAASkB,EAASlB,OAASE,EAAQY,EAAiB,YAC9DM,EAAQhB,EAAKJ,OAASkB,EAASlB,OAASE,EAAQc,EAAc,WAC9DZ,EAAK56D,KAAO07D,EAAS17D,KAAO06D,EAAQY,EAAiB,QACrDK,IAAUD,EAAS17D,KAAO46D,EAAK56D,KAAO06D,EAAQc,EAAc,SACvDZ,EAAK36D,MAAQy7D,EAASz7D,MAAQy6D,EAAQY,EAAiB,WAC5DK,EAAQf,EAAK36D,MAAQy7D,EAASz7D,MAAQy6D,EAAQc,EAAc,UAC5DG,GAASC,EACT,GAAIH,EACAr+C,EAAIy+C,YAAYC,SAASH,EAAOC,OAE/B,CACD,IAAIG,EAAShkC,EAAIikC,WAAYC,EAASlkC,EAAImkC,UACtCN,IACA7jC,EAAImkC,WAAaN,GACjBD,IACA5jC,EAAIikC,YAAcL,GACtB,IAAIQ,EAAKpkC,EAAIikC,WAAaD,EAAQK,EAAKrkC,EAAImkC,UAAYD,EACvDrB,EAAO,CAAE56D,KAAM46D,EAAK56D,KAAOm8D,EAAIlwC,IAAK2uC,EAAK3uC,IAAMmwC,EAAIn8D,MAAO26D,EAAK36D,MAAQk8D,EAAI3B,OAAQI,EAAKJ,OAAS4B,EACrG,CAEJ,GAAIX,EACA,KACR,CACJ,CAqBA,SAASY,EAAYlrC,GACjB,IAAIvuB,EAAQ,GAAIwa,EAAM+T,EAAIy2B,cAC1B,IAAK,IAAI3J,EAAM9sB,EAAK8sB,IAChBr7C,EAAM9Q,KAAK,CAAEq/B,IAAK8sB,EAAKhyB,IAAKgyB,EAAIie,UAAWl8D,KAAMi+C,EAAI+d,aACjD7qC,GAAO/T,GAFU6gC,EAAMtrB,EAAWsrB,IAK1C,OAAOr7C,CACX,CAOA,SAAS05D,EAAmB15D,EAAO25D,GAC/B,IAAK,IAAIprE,EAAI,EAAGA,EAAIyR,EAAM3R,OAAQE,IAAK,CACnC,IAAI,IAAEggC,EAAG,IAAElF,EAAG,KAAEjsB,GAAS4C,EAAMzR,GAC3BggC,EAAI+qC,WAAajwC,EAAMswC,IACvBprC,EAAI+qC,UAAYjwC,EAAMswC,GACtBprC,EAAI6qC,YAAch8D,IAClBmxB,EAAI6qC,WAAah8D,EACzB,CACJ,CACA,IAAIw8D,EAAyB,KAoB7B,SAASC,EAAiB39D,EAAM49D,GAC5B,IAAIC,EAA0BC,EAE1BC,EAAYC,EAFHC,EAAY,IAAoBt4D,EAAS,EAClDu4D,EAASN,EAAOzwC,IAAKgxC,EAASP,EAAOzwC,IAEzC,IAAK,IAAIxI,EAAQ3kB,EAAK8nC,WAAYs2B,EAAa,EAAGz5C,EAAOA,EAAQA,EAAMwjC,YAAaiW,IAAc,CAC9F,IAAIC,EACJ,GAAsB,GAAlB15C,EAAMud,SACNm8B,EAAQ15C,EAAM25C,qBACb,IAAsB,GAAlB35C,EAAMud,SAGX,SAFAm8B,EAAQ1E,EAAUh1C,GAAO25C,gBAEjB,CACZ,IAAK,IAAIjsE,EAAI,EAAGA,EAAIgsE,EAAMlsE,OAAQE,IAAK,CACnC,IAAIypE,EAAOuC,EAAMhsE,GACjB,GAAIypE,EAAK3uC,KAAO+wC,GAAUpC,EAAKJ,QAAUyC,EAAQ,CAC7CD,EAAS/nE,KAAKC,IAAI0lE,EAAKJ,OAAQwC,GAC/BC,EAAShoE,KAAKG,IAAIwlE,EAAK3uC,IAAKgxC,GAC5B,IAAII,EAAKzC,EAAK56D,KAAO08D,EAAO18D,KAAO46D,EAAK56D,KAAO08D,EAAO18D,KAChD46D,EAAK36D,MAAQy8D,EAAO18D,KAAO08D,EAAO18D,KAAO46D,EAAK36D,MAAQ,EAC5D,GAAIo9D,EAAKN,EAAW,CAChBJ,EAAUl5C,EACVs5C,EAAYM,EACZT,EAAgBS,GAA0B,GAApBV,EAAQ37B,SAAgB,CAC1ChhC,KAAM46D,EAAK36D,MAAQy8D,EAAO18D,KAAO46D,EAAK36D,MAAQ26D,EAAK56D,KACnDisB,IAAKywC,EAAOzwC,KACZywC,EACkB,GAAlBj5C,EAAMud,UAAiBq8B,IACvB54D,EAASy4D,GAAcR,EAAO18D,OAAS46D,EAAK56D,KAAO46D,EAAK36D,OAAS,EAAI,EAAI,IAC7E,QACJ,CACJ,MACS26D,EAAK3uC,IAAMywC,EAAOzwC,MAAQ4wC,GAAcjC,EAAK56D,MAAQ08D,EAAO18D,MAAQ46D,EAAK36D,OAASy8D,EAAO18D,OAC9F68D,EAAap5C,EACbq5C,EAAc,CAAE98D,KAAM/K,KAAKC,IAAI0lE,EAAK56D,KAAM/K,KAAKG,IAAIwlE,EAAK36D,MAAOy8D,EAAO18D,OAAQisB,IAAK2uC,EAAK3uC,OAEvF0wC,IAAYD,EAAO18D,MAAQ46D,EAAK36D,OAASy8D,EAAOzwC,KAAO2uC,EAAK3uC,KAC7DywC,EAAO18D,MAAQ46D,EAAK56D,MAAQ08D,EAAOzwC,KAAO2uC,EAAKJ,UAC/C/1D,EAASy4D,EAAa,EAC9B,CACJ,CAMA,OALKP,GAAWE,IACZF,EAAUE,EACVD,EAAgBE,EAChBC,EAAY,GAEZJ,GAA+B,GAApBA,EAAQ37B,SAM3B,SAA0BliC,EAAM49D,GAC5B,IAAIY,EAAMx+D,EAAK0nD,UAAUv1D,OACrBkwC,EAAQ57B,SAASmzD,cACrB,IAAK,IAAIvnE,EAAI,EAAGA,EAAImsE,EAAKnsE,IAAK,CAC1BgwC,EAAMw3B,OAAO75D,EAAM3N,EAAI,GACvBgwC,EAAMy3B,SAAS95D,EAAM3N,GACrB,IAAIypE,EAAO2C,EAAWp8B,EAAO,GAC7B,GAAIy5B,EAAK3uC,KAAO2uC,EAAKJ,QAEjBgD,EAAOd,EAAQ9B,GACf,MAAO,CAAE97D,OAAM2F,OAAQtT,GAAKurE,EAAO18D,OAAS46D,EAAK56D,KAAO46D,EAAK36D,OAAS,EAAI,EAAI,GACtF,CACA,MAAO,CAAEnB,OAAM2F,OAAQ,EAC3B,CAlBeg5D,CAAiBd,EAASC,IAChCD,GAAYI,GAAiC,GAApBJ,EAAQ37B,SAC3B,CAAEliC,OAAM2F,UACZg4D,EAAiBE,EAASC,EACrC,CAeA,SAASY,EAAOd,EAAQ9B,GACpB,OAAO8B,EAAO18D,MAAQ46D,EAAK56D,KAAO,GAAK08D,EAAO18D,MAAQ46D,EAAK36D,MAAQ,GAC/Dy8D,EAAOzwC,KAAO2uC,EAAK3uC,IAAM,GAAKywC,EAAOzwC,KAAO2uC,EAAKJ,OAAS,CAClE,CAiDA,SAASkD,EAAiBC,EAASjB,EAAQkB,GACvC,IAAIN,EAAMK,EAAQtV,WAAWp3D,OAC7B,GAAIqsE,GAAOM,EAAI3xC,IAAM2xC,EAAIpD,OACrB,IAAK,IAAIqD,EAAS5oE,KAAKC,IAAI,EAAGD,KAAKG,IAAIkoE,EAAM,EAAGroE,KAAK6oE,MAAMR,GAAOZ,EAAOzwC,IAAM2xC,EAAI3xC,MAAQ2xC,EAAIpD,OAASoD,EAAI3xC,MAAQ,IAAK96B,EAAI0sE,IAAU,CACnI,IAAIp6C,EAAQk6C,EAAQtV,WAAWl3D,GAC/B,GAAsB,GAAlBsyB,EAAMud,SAAe,CACrB,IAAIm8B,EAAQ15C,EAAM25C,iBAClB,IAAK,IAAIvvC,EAAI,EAAGA,EAAIsvC,EAAMlsE,OAAQ48B,IAAK,CACnC,IAAI+sC,EAAOuC,EAAMtvC,GACjB,GAAI2vC,EAAOd,EAAQ9B,GACf,OAAO8C,EAAiBj6C,EAAOi5C,EAAQ9B,EAC/C,CACJ,CACA,IAAKzpE,GAAKA,EAAI,GAAKmsE,IAAQO,EACvB,KACR,CAEJ,OAAOF,CACX,CAEA,SAAS79B,EAAYt1B,EAAMkyD,GACvB,IAAkC59D,EAA9Bse,EAAM5S,EAAK2mB,IAAIy2B,cAAqBnjD,EAAS,EAC7Cs5D,EAvSR,SAAwB3gD,EAAK+N,EAAG+C,GAC5B,GAAI9Q,EAAI4gD,uBACJ,IACI,IAAI/mD,EAAMmG,EAAI4gD,uBAAuB7yC,EAAG+C,GACxC,GAAIjX,EACA,MAAO,CAAEnY,KAAMmY,EAAIgnD,WAAYx5D,OAAQwS,EAAIxS,OACnD,CACA,MAAOiG,GAAK,CAEhB,GAAI0S,EAAI8gD,oBAAqB,CACzB,IAAI/8B,EAAQ/jB,EAAI8gD,oBAAoB/yC,EAAG+C,GACvC,GAAIiT,EACA,MAAO,CAAEriC,KAAMqiC,EAAMg9B,eAAgB15D,OAAQ08B,EAAMi9B,YAC3D,CACJ,CAyRgBC,CAAejhD,EAAKs/C,EAAO18D,KAAM08D,EAAOzwC,KAChD8xC,KACGj/D,OAAM2F,UAAWs5D,GACxB,IAEI9mD,EAFA8gB,GAAOvtB,EAAK3V,KAAK6oE,iBAAmBlzD,EAAK3V,KAAOuoB,GAC/CsgD,iBAAiBhB,EAAO18D,KAAM08D,EAAOzwC,KAE1C,IAAK8L,IAAQvtB,EAAK2mB,IAAI63B,SAAyB,GAAhBjxB,EAAIiJ,SAAgBjJ,EAAIpF,WAAaoF,GAAM,CACtE,IAAI6lC,EAAMpzD,EAAK2mB,IAAI0pC,wBACnB,IAAK2C,EAAOd,EAAQkB,GAChB,OAAO,KAEX,GADA7lC,EAAM2lC,EAAiBlzD,EAAK2mB,IAAKurC,EAAQkB,IACpC7lC,EACD,OAAO,IACf,CAEA,GAAIiiC,EACA,IAAK,IAAI5sC,EAAI2K,EAAKj5B,GAAQsuB,EAAGA,EAAIuF,EAAWvF,GACpCA,EAAE6Z,YACFnoC,OAAOrN,GAGnB,GADAsmC,EA1FJ,SAAsB5G,EAAKurC,GACvB,IAAIt7C,EAAS+P,EAAIwB,WACjB,OAAIvR,GAAU,QAAQprB,KAAKorB,EAAOokC,WAAakX,EAAO18D,KAAOmxB,EAAI0pC,wBAAwB76D,KAC9EohB,EACJ+P,CACX,CAqFUmtC,CAAavmC,EAAK2kC,GACpB59D,EAAM,CACN,GAAIg7D,GAA0B,GAAjBh7D,EAAKkiC,WAGdv8B,EAASxP,KAAKG,IAAIqP,EAAQ3F,EAAKupD,WAAWp3D,QAGtCwT,EAAS3F,EAAKupD,WAAWp3D,QAAQ,CACjC,IAAoC2sE,EAAhCl7D,EAAO5D,EAAKupD,WAAW5jD,GACN,OAAjB/B,EAAK8iD,WAAsBoY,EAAMl7D,EAAKm4D,yBAAyB56D,OAASy8D,EAAO18D,MAC/E49D,EAAIpD,OAASkC,EAAOzwC,KACpBxnB,GACR,CAIA3F,GAAQ0L,EAAK2mB,KAAO1sB,GAAU3F,EAAKupD,WAAWp3D,OAAS,GAAgC,GAA3B6N,EAAK0kC,UAAUxC,UAC3E07B,EAAOzwC,IAAMntB,EAAK0kC,UAAUq3B,wBAAwBL,OACpDvjD,EAAMzM,EAAKL,MAAMiT,IAAItsB,QAAQ8Q,KAId,GAAV6C,GAAgC,GAAjB3F,EAAKkiC,UAAyD,MAAxCliC,EAAKupD,WAAW5jD,EAAS,GAAG+gD,WACtEvuC,EApGZ,SAAsBzM,EAAM1L,EAAM2F,EAAQi4D,GAOtC,IAAI6B,GAAgB,EACpB,IAAK,IAAItgB,EAAMn/C,EAAM0/D,GAAW,EACxBvgB,GAAOzzC,EAAK2mB,KADqB,CAGrC,IAAIr4B,EAAO0R,EAAKi0D,QAAQC,YAAYzgB,GAAK,GACzC,IAAKnlD,EACD,OAAO,KACX,GAAyB,GAArBA,EAAKq4B,IAAI6P,WAAkBloC,EAAKgG,KAAKmqC,SAAWnwC,EAAKsoB,SAAWo9C,IAAa1lE,EAAKovD,YAAa,CAC/F,IAAI0S,EAAO9hE,EAAKq4B,IAAI0pC,wBAQpB,GAPI/hE,EAAKgG,KAAKmqC,SAAWnwC,EAAKsoB,SAAWo9C,IACrCA,GAAW,EACP5D,EAAK56D,KAAO08D,EAAO18D,MAAQ46D,EAAK3uC,IAAMywC,EAAOzwC,IAC7CsyC,EAAezlE,EAAK6lE,WACf/D,EAAK36D,MAAQy8D,EAAO18D,MAAQ46D,EAAKJ,OAASkC,EAAOzwC,OACtDsyC,EAAezlE,EAAK8lE,YAEvB9lE,EAAKovD,YAAcqW,EAAe,EAInC,OAFazlE,EAAKgG,KAAKmqC,QAAUyzB,EAAOzwC,KAAO2uC,EAAK3uC,IAAM2uC,EAAKJ,QAAU,EACnEkC,EAAO18D,MAAQ46D,EAAK56D,KAAO46D,EAAK36D,OAAS,GAC/BnH,EAAK6lE,UAAY7lE,EAAK8lE,QAE9C,CACA3gB,EAAMnlD,EAAKq4B,IAAIwB,UACnB,CACA,OAAO4rC,GAAgB,EAAIA,EAAe/zD,EAAKi0D,QAAQI,WAAW//D,EAAM2F,GAAS,EACrF,CAmEkBq6D,CAAat0D,EAAM1L,EAAM2F,EAAQi4D,GAC/C,CACW,MAAPzlD,IACAA,EA/GR,SAAwBzM,EAAMutB,EAAK2kC,GAC/B,IAAI,KAAE59D,EAAI,OAAE2F,GAAWg4D,EAAiB1kC,EAAK2kC,GAAS1Q,GAAQ,EAC9D,GAAqB,GAAjBltD,EAAKkiC,WAAkBliC,EAAK8nC,WAAY,CACxC,IAAIg0B,EAAO97D,EAAK+7D,wBAChB7O,EAAO4O,EAAK56D,MAAQ46D,EAAK36D,OAASy8D,EAAO18D,MAAQ46D,EAAK56D,KAAO46D,EAAK36D,OAAS,EAAI,GAAK,CACxF,CACA,OAAOuK,EAAKi0D,QAAQI,WAAW//D,EAAM2F,EAAQunD,EACjD,CAwGc+S,CAAev0D,EAAMutB,EAAK2kC,IACpC,IAAI5jE,EAAO0R,EAAKi0D,QAAQC,YAAY3mC,GAAK,GACzC,MAAO,CAAE9gB,MAAK/K,OAAQpT,EAAOA,EAAKkmE,WAAalmE,EAAKmmE,QAAU,EAClE,CACA,SAASC,EAAQtE,GACb,OAAOA,EAAK3uC,IAAM2uC,EAAKJ,QAAUI,EAAK56D,KAAO46D,EAAK36D,KACtD,CACA,SAASs9D,EAAWrqE,EAAQ84D,GACxB,IAAImR,EAAQjqE,EAAOkqE,iBACnB,GAAID,EAAMlsE,OAAQ,CACd,IAAI4jD,EAAQsoB,EAAMnR,EAAO,EAAI,EAAImR,EAAMlsE,OAAS,GAChD,GAAIiuE,EAAQrqB,GACR,OAAOA,CACf,CACA,OAAOpiD,MAAMR,UAAUy6B,KAAKh6B,KAAKyqE,EAAO+B,IAAYhsE,EAAO2nE,uBAC/D,CACA,MAAMsE,EAAO,4CAGb,SAASC,EAAY50D,EAAMyM,EAAKg2B,GAC5B,IAAI,KAAEnuC,EAAI,OAAE2F,EAAM,KAAEyiC,GAAS18B,EAAKi0D,QAAQY,WAAWpoD,EAAKg2B,EAAO,GAAK,EAAI,GACtEqyB,EAAoBlF,GAAUN,EAClC,GAAqB,GAAjBh7D,EAAKkiC,SAAe,CAGpB,IAAIs+B,IAAsBH,EAAKnpE,KAAK8I,EAAK0nD,aAAevZ,EAAO,EAAKxoC,EAASA,GAAU3F,EAAK0nD,UAAUv1D,QAejG,CACD,IAAIyO,EAAO+E,EAAQgzB,EAAKhzB,EAAQ86D,EAAWtyB,EAAO,EAAI,GAAK,EAe3D,OAdIA,EAAO,IAAMxoC,GACbgzB,IACA8nC,GAAY,GAEPtyB,GAAQ,GAAKxoC,GAAU3F,EAAK0nD,UAAUv1D,QAC3CyO,IACA6/D,EAAW,GAENtyB,EAAO,EACZvtC,IAGA+3B,IAEG+nC,EAASjC,EAAW9E,EAAU35D,EAAMY,EAAM+3B,GAAK8nC,GAAWA,EAAW,EAChF,CAhCgH,CAC5G,IAAI3E,EAAO2C,EAAW9E,EAAU35D,EAAM2F,EAAQA,GAASwoC,GAIvD,GAAI6sB,GAASr1D,GAAU,KAAKzO,KAAK8I,EAAK0nD,UAAU/hD,EAAS,KAAOA,EAAS3F,EAAK0nD,UAAUv1D,OAAQ,CAC5F,IAAIwuE,EAAalC,EAAW9E,EAAU35D,EAAM2F,EAAS,EAAGA,EAAS,IAAK,GACtE,GAAIg7D,EAAWxzC,KAAO2uC,EAAK3uC,IAAK,CAC5B,IAAIyzC,EAAYnC,EAAW9E,EAAU35D,EAAM2F,EAAQA,EAAS,IAAK,GACjE,GAAIi7D,EAAUzzC,KAAO2uC,EAAK3uC,IACtB,OAAOuzC,EAASE,EAAWA,EAAU1/D,KAAOy/D,EAAWz/D,KAC/D,CACJ,CACA,OAAO46D,CACX,CAmBJ,CAGA,IAFWpwD,EAAKL,MAAMiT,IAAI1hB,QAAQub,GAAOiwB,GAAQ,IAEvC9lB,OAAO2pB,cAAe,CAC5B,GAAY,MAAR7D,GAAgBziC,IAAWwoC,EAAO,GAAKxoC,GAAUogC,EAAS/lC,IAAQ,CAClE,IAAIuB,EAASvB,EAAKupD,WAAW5jD,EAAS,GACtC,GAAuB,GAAnBpE,EAAO2gC,SACP,OAAO2+B,EAASt/D,EAAOw6D,yBAAyB,EACxD,CACA,GAAY,MAAR3zB,GAAgBziC,EAASogC,EAAS/lC,GAAO,CACzC,IAAI+N,EAAQ/N,EAAKupD,WAAW5jD,GAC5B,GAAsB,GAAlBoI,EAAMm0B,SACN,OAAO2+B,EAAS9yD,EAAMguD,yBAAyB,EACvD,CACA,OAAO8E,EAAS7gE,EAAK+7D,wBAAyB5tB,GAAQ,EAC1D,CAEA,GAAY,MAAR/F,GAAgBziC,IAAWwoC,EAAO,GAAKxoC,GAAUogC,EAAS/lC,IAAQ,CAClE,IAAIuB,EAASvB,EAAKupD,WAAW5jD,EAAS,GAClCvR,EAA4B,GAAnBmN,EAAO2gC,SAAgBy3B,EAAUp4D,EAAQwkC,EAASxkC,IAAWi/D,EAAoB,EAAI,IAGzE,GAAnBj/D,EAAO2gC,UAAqC,MAAnB3gC,EAAOmlD,UAAqBnlD,EAAO4mD,YAAwB,KAAT5mD,EACjF,GAAInN,EACA,OAAOssE,EAASjC,EAAWrqE,EAAQ,IAAI,EAC/C,CACA,GAAY,MAARg0C,GAAgBziC,EAASogC,EAAS/lC,GAAO,CACzC,IAAI+N,EAAQ/N,EAAKupD,WAAW5jD,GAC5B,KAAOoI,EAAMssD,YAActsD,EAAMssD,WAAWyG,iBACxC/yD,EAAQA,EAAMo6C,YAClB,IAAI/zD,EAAU2Z,EAAiC,GAAlBA,EAAMm0B,SAAgBy3B,EAAU5rD,EAAO,EAAIyyD,EAAoB,EAAI,GACxE,GAAlBzyD,EAAMm0B,SAAgBn0B,EAAQ,KADd,KAEtB,GAAI3Z,EACA,OAAOssE,EAASjC,EAAWrqE,GAAS,IAAI,EAChD,CAEA,OAAOssE,EAASjC,EAA4B,GAAjBz+D,EAAKkiC,SAAgBy3B,EAAU35D,GAAQA,GAAOmuC,GAAOA,GAAQ,EAC5F,CACA,SAASuyB,EAAS5E,EAAM56D,GACpB,GAAkB,GAAd46D,EAAKG,MACL,OAAOH,EACX,IAAIzvC,EAAInrB,EAAO46D,EAAK56D,KAAO46D,EAAK36D,MAChC,MAAO,CAAEgsB,IAAK2uC,EAAK3uC,IAAKuuC,OAAQI,EAAKJ,OAAQx6D,KAAMmrB,EAAGlrB,MAAOkrB,EACjE,CACA,SAASw0C,EAAS/E,EAAM3uC,GACpB,GAAmB,GAAf2uC,EAAKM,OACL,OAAON,EACX,IAAI1sC,EAAIjC,EAAM2uC,EAAK3uC,IAAM2uC,EAAKJ,OAC9B,MAAO,CAAEvuC,IAAKiC,EAAGssC,OAAQtsC,EAAGluB,KAAM46D,EAAK56D,KAAMC,MAAO26D,EAAK36D,MAC7D,CACA,SAAS4/D,EAAiBr1D,EAAML,EAAOwkB,GACnC,IAAImxC,EAAYt1D,EAAKL,MAAO20C,EAASt0C,EAAK3V,KAAKkrE,cAC3CD,GAAa31D,GACbK,EAAKw1D,YAAY71D,GACjB20C,GAAUt0C,EAAK2mB,KACf3mB,EAAK40B,QACT,IACI,OAAOzQ,GACX,CACA,QACQmxC,GAAa31D,GACbK,EAAKw1D,YAAYF,GACjBhhB,GAAUt0C,EAAK2mB,KAAO2tB,GACtBA,EAAO1f,OACf,CACJ,CAsCA,MAAM6gC,GAAW,kBAqCjB,IAAIC,GAAc,KACdC,GAAY,KACZC,IAAe,EA0BnB,MAAMC,GACFrtE,YAAYouB,EAAQpiB,EAAUmyB,EAG9B+2B,GACIv3D,KAAKywB,OAASA,EACdzwB,KAAKqO,SAAWA,EAChBrO,KAAKwgC,IAAMA,EACXxgC,KAAKu3D,WAAaA,EAClBv3D,KAAK2vE,MAZK,EAeVnvC,EAAIgoC,WAAaxoE,IACrB,CAGA4vE,cAAcC,GAAU,OAAO,CAAO,CACtCC,YAAY18B,GAAQ,OAAO,CAAO,CAClC28B,YAAY5hE,EAAM6hE,EAAWC,GAAa,OAAO,CAAO,CACxDC,YAAYrb,GAAY,OAAO,CAAO,CAItCsb,YAAc,OAAO,IAAM,CAG3BC,UAAUh7D,GAAS,OAAO,CAAO,CAE7BnE,WACA,IAAIA,EAAO,EACX,IAAK,IAAIzQ,EAAI,EAAGA,EAAIR,KAAKqO,SAAS/N,OAAQE,IACtCyQ,GAAQjR,KAAKqO,SAAS7N,GAAGyQ,KAC7B,OAAOA,CACX,CAGIq9D,aAAW,OAAO,CAAG,CACzBvsC,UACI/hC,KAAKywB,YAAS3vB,EACVd,KAAKwgC,IAAIgoC,YAAcxoE,OACvBA,KAAKwgC,IAAIgoC,gBAAa1nE,GAC1B,IAAK,IAAIN,EAAI,EAAGA,EAAIR,KAAKqO,SAAS/N,OAAQE,IACtCR,KAAKqO,SAAS7N,GAAGuhC,SACzB,CACAsuC,eAAev9C,GACX,IAAK,IAAItyB,EAAI,EAAG8lB,EAAMtmB,KAAKquE,YAAa7tE,IAAK,CACzC,IAAI8sD,EAAMttD,KAAKqO,SAAS7N,GACxB,GAAI8sD,GAAOx6B,EACP,OAAOxM,EACXA,GAAOgnC,EAAIr8C,IACf,CACJ,CACI+8D,gBACA,OAAOhuE,KAAKywB,OAAO4/C,eAAerwE,KACtC,CACIquE,iBACA,OAAOruE,KAAKywB,OAASzwB,KAAKywB,OAAO4/C,eAAerwE,MAAQA,KAAKsuE,OAAS,CAC1E,CACIL,eACA,OAAOjuE,KAAKguE,UAAYhuE,KAAKiR,IACjC,CACIq/D,eACA,OAAOtwE,KAAKquE,WAAaruE,KAAKiR,KAAO,EAAIjR,KAAKsuE,MAClD,CACAiC,gBAAgB/vC,EAAK1sB,EAAQunD,GAGzB,GAAIr7D,KAAKu3D,YAAcv3D,KAAKu3D,WAAWc,SAAyB,GAAhB73B,EAAI6P,SAAgB7P,EAAMA,EAAIwB,YAAa,CACvF,GAAIq5B,EAAO,EAAG,CACV,IAAImV,EAAWroE,EACf,GAAIq4B,GAAOxgC,KAAKu3D,WACZiZ,EAAYhwC,EAAIk3B,WAAW5jD,EAAS,OAEnC,CACD,KAAO0sB,EAAIwB,YAAchiC,KAAKu3D,YAC1B/2B,EAAMA,EAAIwB,WACdwuC,EAAYhwC,EAAIu1B,eACpB,CACA,KAAOya,MAAgBroE,EAAOqoE,EAAUhI,aAAergE,EAAKsoB,QAAUzwB,OAClEwwE,EAAYA,EAAUza,gBAC1B,OAAOya,EAAYxwE,KAAKqwE,eAAeloE,GAAQA,EAAK8I,KAAOjR,KAAKquE,UACpE,CACK,CACD,IAAIoC,EAAUtoE,EACd,GAAIq4B,GAAOxgC,KAAKu3D,WACZkZ,EAAWjwC,EAAIk3B,WAAW5jD,OAEzB,CACD,KAAO0sB,EAAIwB,YAAchiC,KAAKu3D,YAC1B/2B,EAAMA,EAAIwB,WACdyuC,EAAWjwC,EAAI81B,WACnB,CACA,KAAOma,MAAetoE,EAAOsoE,EAASjI,aAAergE,EAAKsoB,QAAUzwB,OAChEywE,EAAWA,EAASna,YACxB,OAAOma,EAAWzwE,KAAKqwE,eAAeloE,GAAQnI,KAAKswE,QACvD,CACJ,CAIA,IAAIr4B,EACJ,GAAIzX,GAAOxgC,KAAKwgC,KAAOxgC,KAAKu3D,WACxBtf,EAAQnkC,EAAS4zD,EAAS1nE,KAAKu3D,iBAE9B,GAAIv3D,KAAKu3D,YAAcv3D,KAAKu3D,YAAcv3D,KAAKwgC,KAAOxgC,KAAKwgC,IAAI63B,SAASr4D,KAAKu3D,YAC9Etf,EAAuD,EAA/CzX,EAAI83B,wBAAwBt4D,KAAKu3D,iBAExC,GAAIv3D,KAAKwgC,IAAIyV,WAAY,CAC1B,GAAc,GAAVniC,EACA,IAAK,IAAI4R,EAAS8a,GAAM9a,EAASA,EAAOsc,WAAY,CAChD,GAAItc,GAAU1lB,KAAKwgC,IAAK,CACpByX,GAAQ,EACR,KACJ,CACA,GAAIvyB,EAAOqwC,gBACP,KACR,CACJ,GAAa,MAAT9d,GAAiBnkC,GAAU0sB,EAAIk3B,WAAWp3D,OAC1C,IAAK,IAAIolB,EAAS8a,GAAM9a,EAASA,EAAOsc,WAAY,CAChD,GAAItc,GAAU1lB,KAAKwgC,IAAK,CACpByX,GAAQ,EACR,KACJ,CACA,GAAIvyB,EAAO4wC,YACP,KACR,CACR,CACA,OAAiB,MAATre,EAAgBojB,EAAO,EAAIpjB,GAASj4C,KAAKswE,SAAWtwE,KAAKquE,UACrE,CACAN,YAAYvtC,EAAKkwC,GAAY,GACzB,IAAK,IAAIxsB,GAAQ,EAAMoJ,EAAM9sB,EAAK8sB,EAAKA,EAAMA,EAAItrB,WAAY,CACzD,IAA8B2uC,EAA1BxoE,EAAOnI,KAAK4wE,QAAQtjB,GACxB,GAAInlD,KAAUuoE,GAAavoE,EAAKgG,MAAO,CAEnC,IAAI+1C,KAAUysB,EAAUxoE,EAAKwoE,WACH,GAApBA,EAAQtgC,SAAgBsgC,EAAQtY,SAAyB,GAAhB73B,EAAI6P,SAAgB7P,EAAMA,EAAIwB,YAAc2uC,GAAWnwC,GAGlG,OAAOr4B,EAFP+7C,GAAQ,CAGhB,CACJ,CACJ,CACA0sB,QAAQpwC,GACJ,IAAIr4B,EAAOq4B,EAAIgoC,WACf,IAAK,IAAIlb,EAAMnlD,EAAMmlD,EAAKA,EAAMA,EAAI78B,OAChC,GAAI68B,GAAOttD,KACP,OAAOmI,CACnB,CACA+lE,WAAW1tC,EAAK1sB,EAAQunD,GACpB,IAAK,IAAIta,EAAOvgB,EAAKugB,EAAMA,EAAOA,EAAK/e,WAAY,CAC/C,IAAI75B,EAAOnI,KAAK4wE,QAAQ7vB,GACxB,GAAI54C,EACA,OAAOA,EAAKooE,gBAAgB/vC,EAAK1sB,EAAQunD,EACjD,CACA,OAAQ,CACZ,CAGAwV,OAAOvqD,GACH,IAAK,IAAI9lB,EAAI,EAAGsT,EAAS,EAAGtT,EAAIR,KAAKqO,SAAS/N,OAAQE,IAAK,CACvD,IAAIsyB,EAAQ9yB,KAAKqO,SAAS7N,GAAIoO,EAAMkF,EAASgf,EAAM7hB,KACnD,GAAI6C,GAAUwS,GAAO1X,GAAOkF,EAAQ,CAChC,MAAQgf,EAAMw7C,QAAUx7C,EAAMzkB,SAAS/N,QACnCwyB,EAAQA,EAAMzkB,SAAS,GAC3B,OAAOykB,CACX,CACA,GAAIxM,EAAM1X,EACN,OAAOkkB,EAAM+9C,OAAOvqD,EAAMxS,EAASgf,EAAMw7C,QAC7Cx6D,EAASlF,CACb,CACJ,CACA8/D,WAAWpoD,EAAKg2B,GACZ,IAAKt8C,KAAKu3D,WACN,MAAO,CAAEppD,KAAMnO,KAAKwgC,IAAK1sB,OAAQ,EAAGyiC,KAAMjwB,EAAM,GAEpD,IAAI9lB,EAAI,EAAGsT,EAAS,EACpB,IAAK,IAAI6zC,EAAS,EAAGnnD,EAAIR,KAAKqO,SAAS/N,OAAQE,IAAK,CAChD,IAAIsyB,EAAQ9yB,KAAKqO,SAAS7N,GAAIoO,EAAM+4C,EAAS70B,EAAM7hB,KACnD,GAAIrC,EAAM0X,GAAOwM,aAAiBg+C,GAAsB,CACpDh9D,EAASwS,EAAMqhC,EACf,KACJ,CACAA,EAAS/4C,CACb,CAEA,GAAIkF,EACA,OAAO9T,KAAKqO,SAAS7N,GAAGkuE,WAAW56D,EAAS9T,KAAKqO,SAAS7N,GAAG8tE,OAAQhyB,GAEzE,IAAK,IAAIiC,EAAM/9C,KAAO+9C,EAAOv+C,KAAKqO,SAAS7N,EAAI,IAAIyQ,MAAQstC,aAAgBwyB,IAAkBxyB,EAAKjC,MAAQ,EAAG97C,KAE7G,GAAI87C,GAAQ,EAAG,CACX,IAAIiC,EAAMrtC,GAAQ,EAClB,KACIqtC,EAAO/9C,EAAIR,KAAKqO,SAAS7N,EAAI,GAAK,KAC7B+9C,GAAQA,EAAK/d,IAAIwB,YAAchiC,KAAKu3D,WAFrC/2D,IAAK0Q,GAAQ,GAKrB,OAAIqtC,GAAQjC,GAAQprC,IAAUqtC,EAAK+vB,SAAW/vB,EAAKyyB,QACxCzyB,EAAKmwB,WAAWnwB,EAAKttC,KAAMqrC,GAC/B,CAAEnuC,KAAMnO,KAAKu3D,WAAYzjD,OAAQyqC,EAAOmpB,EAASnpB,EAAK/d,KAAO,EAAI,EAC5E,CACK,CACD,IAAIzuB,EAAMb,GAAQ,EAClB,KACIa,EAAOvR,EAAIR,KAAKqO,SAAS/N,OAASN,KAAKqO,SAAS7N,GAAK,KAChDuR,GAAQA,EAAKyuB,IAAIwB,YAAchiC,KAAKu3D,WAFrC/2D,IAAK0Q,GAAQ,GAKrB,OAAIa,GAAQb,IAAUa,EAAKu8D,SAAWv8D,EAAKi/D,QAChCj/D,EAAK28D,WAAW,EAAGpyB,GACvB,CAAEnuC,KAAMnO,KAAKu3D,WAAYzjD,OAAQ/B,EAAO21D,EAAS31D,EAAKyuB,KAAOxgC,KAAKu3D,WAAWG,WAAWp3D,OACnG,CACJ,CAGA2wE,WAAWliE,EAAM+3B,EAAI39B,EAAO,GACxB,GAA4B,GAAxBnJ,KAAKqO,SAAS/N,OACd,MAAO,CAAE6N,KAAMnO,KAAKu3D,WAAYxoD,OAAM+3B,KAAIoqC,WAAY,EAAGC,SAAUnxE,KAAKu3D,WAAWG,WAAWp3D,QAClG,IAAI4wE,GAAc,EAAGC,GAAY,EACjC,IAAK,IAAIr9D,EAAS3K,EAAM3I,EAAI,GAAIA,IAAK,CACjC,IAAIsyB,EAAQ9yB,KAAKqO,SAAS7N,GAAIoO,EAAMkF,EAASgf,EAAM7hB,KACnD,IAAmB,GAAfigE,GAAoBniE,GAAQH,EAAK,CACjC,IAAIwiE,EAAYt9D,EAASgf,EAAMw7C,OAE/B,GAAIv/D,GAAQqiE,GAAatqC,GAAMl4B,EAAMkkB,EAAMw7C,QAAUx7C,EAAM3kB,MACvD2kB,EAAMykC,YAAcv3D,KAAKu3D,WAAWc,SAASvlC,EAAMykC,YACnD,OAAOzkC,EAAMm+C,WAAWliE,EAAM+3B,EAAIsqC,GACtCriE,EAAO+E,EACP,IAAK,IAAIopB,EAAI18B,EAAG08B,EAAI,EAAGA,IAAK,CACxB,IAAIqhB,EAAOv+C,KAAKqO,SAAS6uB,EAAI,GAC7B,GAAIqhB,EAAKttC,MAAQstC,EAAK/d,IAAIwB,YAAchiC,KAAKu3D,aAAehZ,EAAK8yB,aAAa,GAAI,CAC9EH,EAAaxJ,EAASnpB,EAAK/d,KAAO,EAClC,KACJ,CACAzxB,GAAQwvC,EAAKttC,IACjB,EACmB,GAAfigE,IACAA,EAAa,EACrB,CACA,GAAIA,GAAc,IAAMtiE,EAAMk4B,GAAMtmC,GAAKR,KAAKqO,SAAS/N,OAAS,GAAI,CAChEwmC,EAAKl4B,EACL,IAAK,IAAIsuB,EAAI18B,EAAI,EAAG08B,EAAIl9B,KAAKqO,SAAS/N,OAAQ48B,IAAK,CAC/C,IAAInrB,EAAO/R,KAAKqO,SAAS6uB,GACzB,GAAInrB,EAAKd,MAAQc,EAAKyuB,IAAIwB,YAAchiC,KAAKu3D,aAAexlD,EAAKs/D,cAAc,GAAI,CAC/EF,EAAWzJ,EAAS31D,EAAKyuB,KACzB,KACJ,CACAsG,GAAM/0B,EAAKd,IACf,EACiB,GAAbkgE,IACAA,EAAWnxE,KAAKu3D,WAAWG,WAAWp3D,QAC1C,KACJ,CACAwT,EAASlF,CACb,CACA,MAAO,CAAET,KAAMnO,KAAKu3D,WAAYxoD,OAAM+3B,KAAIoqC,aAAYC,WAC1D,CACAE,aAAa/0B,GACT,GAAIt8C,KAAKsuE,SAAWtuE,KAAKu3D,aAAev3D,KAAKqO,SAAS/N,OAClD,OAAO,EACX,IAAIwyB,EAAQ9yB,KAAKqO,SAASiuC,EAAO,EAAI,EAAIt8C,KAAKqO,SAAS/N,OAAS,GAChE,OAAqB,GAAdwyB,EAAM7hB,MAAa6hB,EAAMu+C,aAAa/0B,EACjD,CACAg1B,YAAYhrD,GACR,IAAI,KAAEnY,EAAI,OAAE2F,GAAW9T,KAAK0uE,WAAWpoD,EAAK,GAC5C,GAAqB,GAAjBnY,EAAKkiC,UAAiBv8B,GAAU3F,EAAKupD,WAAWp3D,OAChD,MAAM,IAAIgnD,WAAW,qBAAuBhhC,GAChD,OAAOnY,EAAKupD,WAAW5jD,EAC3B,CAMAm4B,aAAa0uB,EAAQz0C,EAAMhiB,EAAMqtE,GAAQ,GAErC,IAAIxiE,EAAOzK,KAAKG,IAAIk2D,EAAQz0C,GAAO4gB,EAAKxiC,KAAKC,IAAIo2D,EAAQz0C,GACzD,IAAK,IAAI1lB,EAAI,EAAGsT,EAAS,EAAGtT,EAAIR,KAAKqO,SAAS/N,OAAQE,IAAK,CACvD,IAAIsyB,EAAQ9yB,KAAKqO,SAAS7N,GAAIoO,EAAMkF,EAASgf,EAAM7hB,KACnD,GAAIlC,EAAO+E,GAAUgzB,EAAKl4B,EACtB,OAAOkkB,EAAMmZ,aAAa0uB,EAAS7mD,EAASgf,EAAMw7C,OAAQpoD,EAAOpS,EAASgf,EAAMw7C,OAAQpqE,EAAMqtE,GAClGz9D,EAASlF,CACb,CACA,IAAI4iE,EAAYxxE,KAAK0uE,WAAW/T,EAAQA,GAAU,EAAI,GAClD8W,EAAUvrD,GAAQy0C,EAAS6W,EAAYxxE,KAAK0uE,WAAWxoD,EAAMA,GAAQ,EAAI,GACzEwiD,EAASxkE,EAAKwtE,eACdC,GAAW,EAKf,IAAKxI,GAASE,IAAW1O,GAAUz0C,EAAM,CACrC,IAAI,KAAE/X,EAAI,OAAE2F,GAAW09D,EACvB,GAAqB,GAAjBrjE,EAAKkiC,SACLshC,KAAc79D,GAAwC,MAA9B3F,EAAK0nD,UAAU/hD,EAAS,QAE/C,CACD,IAAIyqC,EAAOpwC,EAAKupD,WAAW5jD,EAAS,GACpC69D,EAAWpzB,IAA0B,MAAjBA,EAAKsW,UAA4C,SAAxBtW,EAAKhC,gBACtD,CACJ,CAGA,GAAI4sB,GAAST,EAAOC,WAAaD,EAAOC,WAAa8I,EAAQtjE,MAAqC,GAA7Bu6D,EAAOC,UAAUt4B,SAAe,CACjG,IAAIn0B,EAAQwsD,EAAOC,UAAUjR,WAAWgR,EAAOE,aAC3C1sD,GAAkC,SAAzBA,EAAMqgC,kBACfg1B,GAAQ,EAChB,CACA,KAAMA,GAASI,GAAYtI,IACvBnB,EAAqBsJ,EAAUrjE,KAAMqjE,EAAU19D,OAAQ40D,EAAOG,WAAYH,EAAOI,eACjFZ,EAAqBuJ,EAAQtjE,KAAMsjE,EAAQ39D,OAAQ40D,EAAOC,UAAWD,EAAOE,aAC5E,OAIJ,IAAIgJ,GAAiB,EACrB,IAAKlJ,EAAO1lE,QAAU23D,GAAUz0C,KAAUyrD,EAAU,CAChDjJ,EAAOmJ,SAASL,EAAUrjE,KAAMqjE,EAAU19D,QAC1C,IACQ6mD,GAAUz0C,GACVwiD,EAAO1lE,OAAOyuE,EAAQtjE,KAAMsjE,EAAQ39D,QACxC89D,GAAiB,CACrB,CACA,MAAO73D,GAOP,CACJ,CACA,IAAK63D,EAAgB,CACjB,GAAIjX,EAASz0C,EAAM,CACf,IAAIokC,EAAMknB,EACVA,EAAYC,EACZA,EAAUnnB,CACd,CACA,IAAI9Z,EAAQ57B,SAASmzD,cACrBv3B,EAAMw3B,OAAOyJ,EAAQtjE,KAAMsjE,EAAQ39D,QACnC08B,EAAMy3B,SAASuJ,EAAUrjE,KAAMqjE,EAAU19D,QACzC40D,EAAOoJ,kBACPpJ,EAAO7e,SAASrZ,EACpB,CACJ,CACAuhC,eAAeC,GACX,OAAQhyE,KAAKu3D,YAA+B,aAAjBya,EAASntE,IACxC,CACIotE,kBACA,OAAOjyE,KAAKu3D,YAAcv3D,KAAKu3D,YAAcv3D,KAAKwgC,MAAQxgC,KAAKwgC,IAAI63B,SAASr4D,KAAKu3D,WACrF,CAGA2a,UAAUnjE,EAAM+3B,GACZ,IAAK,IAAIhzB,EAAS,EAAGtT,EAAI,EAAGA,EAAIR,KAAKqO,SAAS/N,OAAQE,IAAK,CACvD,IAAIsyB,EAAQ9yB,KAAKqO,SAAS7N,GAAIoO,EAAMkF,EAASgf,EAAM7hB,KACnD,GAAI6C,GAAUlF,EAAMG,GAAQH,GAAOk4B,GAAMhzB,EAAS/E,EAAOH,GAAOk4B,EAAKhzB,EAAQ,CACzE,IAAIq+D,EAAcr+D,EAASgf,EAAMw7C,OAAQ8D,EAAYxjE,EAAMkkB,EAAMw7C,OACjE,GAAIv/D,GAAQojE,GAAerrC,GAAMsrC,EAO7B,OANApyE,KAAK2vE,MAAQ5gE,GAAQ+E,GAAUgzB,GAAMl4B,EA1WH,EAAnB,OA2WXG,GAAQojE,GAAerrC,GAAMsrC,IAC5Bt/C,EAAMm/C,aAAen/C,EAAM0N,IAAIwB,YAAchiC,KAAKu3D,WAGnDzkC,EAAMo/C,UAAUnjE,EAAOojE,EAAarrC,EAAKqrC,GAFzCr/C,EAAM68C,MA7WwC,GAmXlD78C,EAAM68C,MAAQ78C,EAAM0N,KAAO1N,EAAMykC,YAAczkC,EAAM0N,IAAIwB,YAAchiC,KAAKu3D,YAAezkC,EAAMzkB,SAAS/N,OAnXxD,EAAhB,CAsX1C,CACAwT,EAASlF,CACb,CACA5O,KAAK2vE,MAzXyC,CA0XlD,CACA0C,mBACI,IAAIz9B,EAAQ,EACZ,IAAK,IAAIzmC,EAAOnO,KAAKywB,OAAQtiB,EAAMA,EAAOA,EAAKsiB,OAAQmkB,IAAS,CAC5D,IAAI+6B,EAAiB,GAAT/6B,EA9X8B,EAAnB,EA+XnBzmC,EAAKwhE,MAAQA,IACbxhE,EAAKwhE,MAAQA,EACrB,CACJ,CACIqB,cAAY,OAAO,CAAO,CAC1B/B,sBAAoB,OAAO,CAAO,EAI1C,MAAM8B,WAAuBrB,GACzBrtE,YAAYouB,EAAQo/C,EAAQh2D,EAAMyM,GAC9B,IAAIriB,EAAMu8B,EAAMqvC,EAAOhrE,KAAKmuC,MAQ5B,GAPkB,mBAAPxS,IACPA,EAAMA,EAAI3mB,GAAM,IACP5V,EAEDA,EAAKwsB,OACExsB,EAAKwsB,OAAO4/C,eAAepsE,QADtC,EADWqiB,MAIdupD,EAAOhrE,KAAKo3B,KAAKrN,IAAK,CACvB,GAAoB,GAAhB4R,EAAI6P,SAAe,CACnB,IAAIjY,EAAOxjB,SAASyM,cAAc,QAClC+W,EAAKsJ,YAAYlB,GACjBA,EAAMpI,CACV,CACAoI,EAAI+b,gBAAkB,QACtB/b,EAAI2B,UAAUxyB,IAAI,qBACtB,CACAukB,MAAMzD,EAAQ,GAAI+P,EAAK,MACvBxgC,KAAK6vE,OAASA,EACd7vE,KAAK6vE,OAASA,EACd5rE,EAAOjE,IACX,CACA4vE,cAAcC,GACV,OAjaU,GAiaH7vE,KAAK2vE,OAAsBE,EAAOhrE,KAAK+pC,GAAG5uC,KAAK6vE,OAAOhrE,KACjE,CACAsrE,YAAc,MAAO,CAAEte,QAAQ,EAAQ,CACvCue,UAAUh7D,GACN,IAAIk9D,EAAOtyE,KAAK6vE,OAAO5zC,KAAKm0C,UAC5B,QAAOkC,GAAOA,EAAKl9D,EACvB,CACA28D,eAAeC,GACX,MAAwB,aAAjBA,EAASntE,MAAuB7E,KAAK6vE,OAAO5zC,KAAKs2C,eAC5D,CACAxwC,UACI/hC,KAAK6vE,OAAOhrE,KAAKk9B,QAAQ/hC,KAAKwgC,KAC9BtM,MAAM6N,SACV,CACIivC,cAAY,OAAO,CAAM,CACzB10B,WAAS,OAAOt8C,KAAK6vE,OAAOhrE,KAAKy3C,IAAM,EAE/C,MAAMk2B,WAA4B9C,GAC9BrtE,YAAYouB,EAAQ+P,EAAKiyC,EAASj7D,GAC9B0c,MAAMzD,EAAQ,GAAI+P,EAAK,MACvBxgC,KAAKyyE,QAAUA,EACfzyE,KAAKwX,KAAOA,CAChB,CACIvG,WAAS,OAAOjR,KAAKwX,KAAKlX,MAAQ,CACtCiwE,gBAAgB/vC,EAAK1sB,GACjB,OAAI0sB,GAAOxgC,KAAKyyE,QACLzyE,KAAKquE,YAAcv6D,EAAS9T,KAAKiR,KAAO,GAC5CjR,KAAKquE,WAAav6D,CAC7B,CACA46D,WAAWpoD,GACP,MAAO,CAAEnY,KAAMnO,KAAKyyE,QAAS3+D,OAAQwS,EACzC,CACAyrD,eAAeW,GACX,MAAoB,kBAAbA,EAAI7tE,MAA4B6tE,EAAInwE,OAAOszD,WAAa6c,EAAIC,QACvE,EAOJ,MAAMC,WAAqBlD,GACvBrtE,YAAYouB,EAAQ2iB,EAAM5S,EAAK+2B,GAC3BrjC,MAAMzD,EAAQ,GAAI+P,EAAK+2B,GACvBv3D,KAAKozC,KAAOA,CAChB,CACA3X,cAAchL,EAAQ2iB,EAAMgD,EAAQv8B,GAChC,IAAIg5D,EAASh5D,EAAKooB,UAAUmR,EAAKvuC,KAAKpC,MAClCw5B,EAAO42C,GAAUA,EAAOz/B,EAAMv5B,EAAMu8B,GAGxC,OAFKna,GAASA,EAAKuE,MACfvE,EAAO,gBAAyBrnB,SAAUw+B,EAAKvuC,KAAKo3B,KAAK+W,MAAMI,EAAMgD,KAClE,IAAIw8B,GAAaniD,EAAQ2iB,EAAMnX,EAAKuE,IAAKvE,EAAKs7B,YAAct7B,EAAKuE,IAC5E,CACA2vC,YACI,OAvd8D,EAudzDnwE,KAAK2vE,OAAuB3vE,KAAKozC,KAAKvuC,KAAKo3B,KAAK62C,cAC1C,KACJ,CAAE1/B,KAAMpzC,KAAKozC,KAAKvuC,KAAKpC,KAAM+4B,MAAOx7B,KAAKozC,KAAK5X,MAAOg8B,eAAgBx3D,KAAKu3D,iBAAcz2D,EACnG,CACAgvE,YAAY18B,GAAQ,OA3d8C,GA2dvCpzC,KAAK2vE,OAAuB3vE,KAAKozC,KAAKxE,GAAGwE,EAAO,CAC3E8+B,UAAUnjE,EAAM+3B,GAGZ,GAFA5S,MAAMg+C,UAAUnjE,EAAM+3B,GA7dZ,GA+dN9mC,KAAK2vE,MAAoB,CACzB,IAAIl/C,EAASzwB,KAAKywB,OAClB,MAAQA,EAAOtiB,MACXsiB,EAASA,EAAOA,OAChBA,EAAOk/C,MAAQ3vE,KAAK2vE,QACpBl/C,EAAOk/C,MAAQ3vE,KAAK2vE,OACxB3vE,KAAK2vE,MAreC,CAseV,CACJ,CACArqE,MAAMyJ,EAAM+3B,EAAIjtB,GACZ,IAAI3W,EAAO0vE,GAAa53D,OAAOhb,KAAKywB,OAAQzwB,KAAKozC,MAAM,EAAMv5B,GACzDiiB,EAAQ97B,KAAKqO,SAAU4C,EAAOjR,KAAKiR,KACnC61B,EAAK71B,IACL6qB,EAAQi3C,GAAaj3C,EAAOgL,EAAI71B,EAAM4I,IACtC9K,EAAO,IACP+sB,EAAQi3C,GAAaj3C,EAAO,EAAG/sB,EAAM8K,IACzC,IAAK,IAAIrZ,EAAI,EAAGA,EAAIs7B,EAAMx7B,OAAQE,IAC9Bs7B,EAAMt7B,GAAGiwB,OAASvtB,EAEtB,OADAA,EAAKmL,SAAWytB,EACT54B,CACX,EAKJ,MAAM8vE,WAAqBtD,GACvBrtE,YAAYouB,EAAQtiB,EAAM6hE,EAAWC,EAAWzvC,EAAK+2B,EAAYoZ,EAAS92D,EAAMyM,GAC5E4N,MAAMzD,EAAQ,GAAI+P,EAAK+2B,GACvBv3D,KAAKmO,KAAOA,EACZnO,KAAKgwE,UAAYA,EACjBhwE,KAAKiwE,UAAYA,EACjBjwE,KAAK2wE,QAAUA,CACnB,CAUAl1C,cAAchL,EAAQtiB,EAAM6hE,EAAWC,EAAWp2D,EAAMyM,GACpD,IAA6C2sD,EAAzCJ,EAASh5D,EAAKooB,UAAU9zB,EAAKtJ,KAAKpC,MAClCw5B,EAAO42C,GAAUA,EAAO1kE,EAAM0L,GAAM,IAG/Bo5D,EAEDA,EAAQxiD,OACDwiD,EAAQxiD,OAAO4/C,eAAe4C,QADzC,EADW3sD,GAGZ0pD,EAAWC,GACVzvC,EAAMvE,GAAQA,EAAKuE,IAAK+2B,EAAat7B,GAAQA,EAAKs7B,WACtD,GAAIppD,EAAKwtB,OACL,GAAK6E,GAEA,GAAoB,GAAhBA,EAAI6P,SACT,MAAM,IAAIiX,WAAW,iDAFrB9mB,EAAM5rB,SAASsiD,eAAe/oD,EAAKqJ,WAIjCgpB,KACHA,MAAK+2B,cAAe,gBAAyB3iD,SAAUzG,EAAKtJ,KAAKo3B,KAAK+W,MAAM7kC,KAE9EopD,GAAeppD,EAAKwtB,QAA0B,MAAhB6E,EAAIq0B,WAC9Br0B,EAAI2W,aAAa,qBAClB3W,EAAI+b,gBAAkB,SACtBpuC,EAAKtJ,KAAKo3B,KAAKqa,YACf9V,EAAI8V,WAAY,IAExB,IAAIq6B,EAAUnwC,EAEd,OADAA,EAAM0yC,GAAe1yC,EAAKwvC,EAAW7hE,GACjC8tB,EACOg3C,EAAU,IAAIE,GAAmB1iD,EAAQtiB,EAAM6hE,EAAWC,EAAWzvC,EAAK+2B,GAAc,KAAMoZ,EAAS10C,EAAMpiB,EAAMyM,EAAM,GAC3HnY,EAAKwtB,OACH,IAAIy3C,GAAa3iD,EAAQtiB,EAAM6hE,EAAWC,EAAWzvC,EAAKmwC,EAAS92D,GAEnE,IAAIm5D,GAAaviD,EAAQtiB,EAAM6hE,EAAWC,EAAWzvC,EAAK+2B,GAAc,KAAMoZ,EAAS92D,EAAMyM,EAAM,EAClH,CACA6pD,YAEI,GAAInwE,KAAKmO,KAAKtJ,KAAKo3B,KAAK62C,cACpB,OAAO,KAKX,IAAI1jD,EAAO,CAAEjhB,KAAMnO,KAAKmO,KAAKtJ,KAAKpC,KAAM+4B,MAAOx7B,KAAKmO,KAAKqtB,OAGzD,GAFiC,OAA7Bx7B,KAAKmO,KAAKtJ,KAAK8qD,aACfvgC,EAAK0mB,mBAAqB,QACzB91C,KAAKu3D,WAGL,GAAKv3D,KAAKiyE,YAGV,CAID,IAAK,IAAIzxE,EAAIR,KAAKqO,SAAS/N,OAAS,EAAGE,GAAK,EAAGA,IAAK,CAChD,IAAIsyB,EAAQ9yB,KAAKqO,SAAS7N,GAC1B,GAAIR,KAAKwgC,IAAI63B,SAASvlC,EAAM0N,IAAIwB,YAAa,CACzC5S,EAAKooC,eAAiB1kC,EAAM0N,IAAIwB,WAChC,KACJ,CACJ,CACK5S,EAAKooC,iBACNpoC,EAAKkoC,WAAa,IAAM,WAChC,MAfIloC,EAAKooC,eAAiBx3D,KAAKu3D,gBAH3BnoC,EAAKkoC,WAAa,IAAMt3D,KAAKmO,KAAKhO,QAmBtC,OAAOivB,CACX,CACA2gD,YAAY5hE,EAAM6hE,EAAWC,GACzB,OA9kBU,GA8kBHjwE,KAAK2vE,OAAsBxhE,EAAKygC,GAAG5uC,KAAKmO,OAC3CklE,GAAcrD,EAAWhwE,KAAKgwE,YAAcC,EAAUrhC,GAAG5uC,KAAKiwE,UACtE,CACIh/D,WAAS,OAAOjR,KAAKmO,KAAK+lC,QAAU,CACpCo6B,aAAW,OAAOtuE,KAAKmO,KAAK+4C,OAAS,EAAI,CAAG,CAKhDosB,eAAez5D,EAAMyM,GACjB,IAAI8vB,EAASp2C,KAAKmO,KAAKisC,cAAezW,EAAMrd,EACxC0mB,EAAcnzB,EAAKijC,UAAY98C,KAAKuzE,qBAAqB15D,EAAMyM,GAAO,KACtEktD,EAAmBxmC,GAAeA,EAAY1mB,KAAO,EAAI0mB,EAAc,KACvEymC,EAAqBzmC,GAAeA,EAAY1mB,IAAM,EACtDotD,EAAU,IAAIC,GAAgB3zE,KAAMwzE,GAAoBA,EAAiBrlE,KAAM0L,IA+pB3F,SAAkB4W,EAAQmjD,EAAMC,EAAUC,GACtC,IAAIC,EAASH,EAAKG,OAAOtjD,GAAS3c,EAAS,EAE3C,GAAqB,GAAjBigE,EAAOzzE,OAAa,CACpB,IAAK,IAAIE,EAAI,EAAGA,EAAIiwB,EAAOmiB,WAAYpyC,IAAK,CACxC,IAAIsyB,EAAQrC,EAAOqC,MAAMtyB,GACzBszE,EAAOhhD,EAAOihD,EAAQH,EAAKI,SAASlgE,EAAQgf,GAAQtyB,GACpDsT,GAAUgf,EAAMohB,QACpB,CACA,MACJ,CACA,IAAI+/B,EAAY,EAAG9lB,EAAS,GAAI+lB,EAAW,KAC3C,IAAK,IAAIC,EAAc,IAAK,CACxB,GAAIF,EAAYF,EAAOzzE,QAAUyzE,EAAOE,GAAWntC,IAAMhzB,EAAQ,CAC7D,IAAkCsgE,EAA9BvE,EAASkE,EAAOE,KACpB,KAAOA,EAAYF,EAAOzzE,QAAUyzE,EAAOE,GAAWntC,IAAMhzB,IACvDsgE,IAAYA,EAAU,CAACvE,KAAU1uE,KAAK4yE,EAAOE,MAClD,GAAIG,EAAS,CACTA,EAAQhhD,KAAKihD,IACb,IAAK,IAAI7zE,EAAI,EAAGA,EAAI4zE,EAAQ9zE,OAAQE,IAChCqzE,EAASO,EAAQ5zE,GAAI2zE,IAAeD,EAC5C,MAEIL,EAAShE,EAAQsE,IAAeD,EAExC,CACA,IAAIphD,EAAOvkB,EACX,GAAI2lE,EACA3lE,GAAS,EACTukB,EAAQohD,EACRA,EAAW,SAEV,MAAIC,EAAc1jD,EAAOmiB,YAK1B,MAJArkC,EAAQ4lE,EACRrhD,EAAQrC,EAAOqC,MAAMqhD,IAIzB,CACA,IAAK,IAAI3zE,EAAI,EAAGA,EAAI2tD,EAAO7tD,OAAQE,IAC3B2tD,EAAO3tD,GAAGsmC,IAAMhzB,GAChBq6C,EAAO3/C,OAAOhO,IAAK,GAC3B,KAAOyzE,EAAYF,EAAOzzE,QAAUyzE,EAAOE,GAAWllE,MAAQ+E,GAAUigE,EAAOE,GAAWntC,GAAKhzB,GAC3Fq6C,EAAOhtD,KAAK4yE,EAAOE,MACvB,IAAIrlE,EAAMkF,EAASgf,EAAMohB,SACzB,GAAIphB,EAAM6I,OAAQ,CACd,IAAI24C,EAAQ1lE,EACRqlE,EAAYF,EAAOzzE,QAAUyzE,EAAOE,GAAWllE,KAAOulE,IACtDA,EAAQP,EAAOE,GAAWllE,MAC9B,IAAK,IAAIvO,EAAI,EAAGA,EAAI2tD,EAAO7tD,OAAQE,IAC3B2tD,EAAO3tD,GAAGsmC,GAAKwtC,IACfA,EAAQnmB,EAAO3tD,GAAGsmC,IACtBwtC,EAAQ1lE,IACRslE,EAAWphD,EAAMs0B,IAAIktB,EAAQxgE,GAC7Bgf,EAAQA,EAAMs0B,IAAI,EAAGktB,EAAQxgE,GAC7BlF,EAAM0lE,EACN/lE,GAAS,EAEjB,CAEAulE,EAAOhhD,EADSA,EAAM4jB,WAAa5jB,EAAMo0B,OAASiH,EAAO/gD,QAAOif,IAAMA,EAAE+pB,SAAU+X,EAAO7oD,QAChEsuE,EAAKI,SAASlgE,EAAQgf,GAAQvkB,GACvDuF,EAASlF,CACb,CACJ,CA7tBQ2lE,CAASv0E,KAAKmO,KAAMnO,KAAKiwE,WAAW,CAACJ,EAAQrvE,EAAGg0E,KACxC3E,EAAO5zC,KAAKL,MACZ83C,EAAQe,YAAY5E,EAAO5zC,KAAKL,MAAOwa,EAAQv8B,GAC1Cg2D,EAAOhrE,KAAKy3C,MAAQ,IAAMk4B,GAC/Bd,EAAQe,YAAYj0E,GAAKR,KAAKmO,KAAKykC,WAAa,UAAY5yC,KAAKmO,KAAK2kB,MAAMtyB,GAAGo7B,MAAOwa,EAAQv8B,GAGlG65D,EAAQgB,YAAY7E,EAAQh2D,EAAM8pB,EAAI,IACvC,CAAC7Q,EAAOk9C,EAAWC,EAAWzvE,KAI7B,IAAIm0E,EAFJjB,EAAQe,YAAY3hD,EAAM8I,MAAOwa,EAAQv8B,GAGrC65D,EAAQkB,cAAc9hD,EAAOk9C,EAAWC,EAAWzvE,IAC9CizE,GAAsB55D,EAAKL,MAAMyuB,UAAUl5B,KAAO40B,GACvD9pB,EAAKL,MAAMyuB,UAAUnB,GAAKnD,EAAM7Q,EAAMohB,WACrCygC,EAAYjB,EAAQmB,mBAAmB7nC,EAAY7+B,QAAU,GAC9DulE,EAAQoB,aAAahiD,EAAOk9C,EAAWC,EAAW0E,EAAW96D,IACxD65D,EAAQqB,eAAejiD,EAAOk9C,EAAWC,EAAWp2D,EAAMrZ,EAAGmjC,IAGlE+vC,EAAQ19B,QAAQljB,EAAOk9C,EAAWC,EAAWp2D,EAAM8pB,GAEvDA,GAAO7Q,EAAMohB,QAAQ,IAGzBw/B,EAAQe,YAAY,GAAIr+B,EAAQv8B,GAC5B7Z,KAAKmO,KAAKyqC,aACV86B,EAAQsB,oBACZtB,EAAQuB,eAEJvB,EAAQwB,SA5nBkC,GA4nBvBl1E,KAAK2vE,SAEpB6D,GACAxzE,KAAKm1E,wBAAwBt7D,EAAM25D,GACvC4B,GAAYp1E,KAAKu3D,WAAYv3D,KAAKqO,SAAUwL,GACxCyvD,GA4rBhB,SAAkB9oC,GACd,GAAoB,MAAhBA,EAAIq0B,UAAoC,MAAhBr0B,EAAIq0B,SAAkB,CAC9C,IAAIwgB,EAAS70C,EAAIpP,MAAMkkD,QACvB90C,EAAIpP,MAAMkkD,QAAUD,EAAS,kCAC7B9a,OAAOgb,iBAAiB/0C,GAAKg1C,UAC7Bh1C,EAAIpP,MAAMkkD,QAAUD,CACxB,CACJ,CAlsBgBI,CAASz1E,KAAKwgC,KAE1B,CACA+yC,qBAAqB15D,EAAMyM,GAGvB,IAAI,KAAEvX,EAAI,GAAE+3B,GAAOjtB,EAAKL,MAAMyuB,UAC9B,KAAMpuB,EAAKL,MAAMyuB,qBAAqB,OAAkBl5B,EAAOuX,GAAOwgB,EAAKxgB,EAAMtmB,KAAKmO,KAAKhO,QAAQ8Q,KAC/F,OAAO,KACX,IAAI0nC,EAAM9+B,EAAK67D,oBACXnd,EAyrBZ,SAAwBpqD,EAAM2F,GAC1B,OAAS,CACL,GAAqB,GAAjB3F,EAAKkiC,SACL,OAAOliC,EACX,GAAqB,GAAjBA,EAAKkiC,UAAiBv8B,EAAS,EAAG,CAClC,GAAI3F,EAAKupD,WAAWp3D,OAASwT,GAA8C,GAApC3F,EAAKupD,WAAW5jD,GAAQu8B,SAC3D,OAAOliC,EAAKupD,WAAW5jD,GAE3BA,EAASogC,EADT/lC,EAAOA,EAAKupD,WAAW5jD,EAAS,GAEpC,KACK,MAAqB,GAAjB3F,EAAKkiC,UAAiBv8B,EAAS3F,EAAKupD,WAAWp3D,QAKpD,OAAO,KAJP6N,EAAOA,EAAKupD,WAAW5jD,GACvBA,EAAS,CAIb,CACJ,CACJ,CA3sBuB6hE,CAAeh9B,EAAIgwB,UAAWhwB,EAAIiwB,aACjD,IAAKrQ,IAAav4D,KAAKwgC,IAAI63B,SAASE,EAASv2B,YACzC,OAAO,KACX,GAAIhiC,KAAKmO,KAAKisC,cAAe,CAIzB,IAAI5iC,EAAO+gD,EAAS1C,UAChB+f,EAqsBhB,SAA4BjoB,EAAMn2C,EAAMzI,EAAM+3B,GAC1C,IAAK,IAAItmC,EAAI,EAAG8lB,EAAM,EAAG9lB,EAAImtD,EAAK/a,YAActsB,GAAOwgB,GAAK,CACxD,IAAIhU,EAAQ66B,EAAK76B,MAAMtyB,KAAMq1E,EAAavvD,EAE1C,GADAA,GAAOwM,EAAMohB,UACRphB,EAAM6I,OACP,SACJ,IAAIgvB,EAAM73B,EAAMtb,KAChB,KAAOhX,EAAImtD,EAAK/a,YAAY,CACxB,IAAI7gC,EAAO47C,EAAK76B,MAAMtyB,KAEtB,GADA8lB,GAAOvU,EAAKmiC,UACPniC,EAAK4pB,OACN,MACJgvB,GAAO54C,EAAKyF,IAChB,CACA,GAAI8O,GAAOvX,EAAM,CACb,IAAI62C,EAAQiwB,EAAa/uC,EAAK6jB,EAAIp6B,YAAY/Y,EAAMsvB,EAAK+uC,EAAa,IAAM,EAC5E,GAAIjwB,GAAS,GAAKA,EAAQpuC,EAAKlX,OAASu1E,GAAc9mE,EAClD,OAAO8mE,EAAajwB,EACxB,GAAI72C,GAAQ+3B,GAAM6jB,EAAIrqD,QAAWwmC,EAAKtvB,EAAKlX,OAAUu1E,GACjDlrB,EAAIrlD,MAAMwhC,EAAK+uC,EAAY/uC,EAAK+uC,EAAar+D,EAAKlX,SAAWkX,EAC7D,OAAOsvB,CACf,CACJ,CACA,OAAQ,CACZ,CA7tB0BgvC,CAAmB91E,KAAKmO,KAAKhO,QAASqX,EAAMzI,EAAOuX,EAAKwgB,EAAKxgB,GAC3E,OAAOsvD,EAAU,EAAI,KAAO,CAAEznE,KAAMoqD,EAAUjyC,IAAKsvD,EAASp+D,OAChE,CAEI,MAAO,CAAErJ,KAAMoqD,EAAUjyC,KAAM,EAAG9O,KAAM,GAEhD,CACA29D,wBAAwBt7D,GAAM,KAAE1L,EAAI,IAAEmY,EAAG,KAAE9O,IAEvC,GAAIxX,KAAK4wE,QAAQziE,GACb,OAEJ,IAAIgiD,EAAUhiD,EACd,KACQgiD,EAAQnuB,YAAchiC,KAAKu3D,WAD3BpH,EAAUA,EAAQnuB,WAAY,CAGlC,KAAOmuB,EAAQ4F,iBACX5F,EAAQnuB,WAAW+zC,YAAY5lB,EAAQ4F,iBAC3C,KAAO5F,EAAQmG,aACXnG,EAAQnuB,WAAW+zC,YAAY5lB,EAAQmG,aACvCnG,EAAQqY,aACRrY,EAAQqY,gBAAa1nE,EAC7B,CACA,IAAIqH,EAAO,IAAIqqE,GAAoBxyE,KAAMmwD,EAAShiD,EAAMqJ,GACxDqC,EAAKrN,MAAMwpE,iBAAiB70E,KAAKgH,GAEjCnI,KAAKqO,SAAW0kE,GAAa/yE,KAAKqO,SAAUiY,EAAKA,EAAM9O,EAAKlX,OAAQuZ,EAAM1R,EAC9E,CAGAq5B,OAAOrzB,EAAM6hE,EAAWC,EAAWp2D,GAC/B,QAnrB8D,GAmrB1D7Z,KAAK2vE,QACJxhE,EAAKm4C,WAAWtmD,KAAKmO,QAE1BnO,KAAKi2E,YAAY9nE,EAAM6hE,EAAWC,EAAWp2D,GACtC,GACX,CACAo8D,YAAY9nE,EAAM6hE,EAAWC,EAAWp2D,GACpC7Z,KAAKk2E,gBAAgBlG,GACrBhwE,KAAKmO,KAAOA,EACZnO,KAAKiwE,UAAYA,EACbjwE,KAAKu3D,YACLv3D,KAAKszE,eAAez5D,EAAM7Z,KAAKquE,YACnCruE,KAAK2vE,MA/rBK,CAgsBd,CACAuG,gBAAgBlG,GACZ,GAAIqD,GAAcrD,EAAWhwE,KAAKgwE,WAC9B,OACJ,IAAImG,EAAqC,GAAzBn2E,KAAK2wE,QAAQtgC,SACzB+lC,EAASp2E,KAAKwgC,IAClBxgC,KAAKwgC,IAAM61C,GAAer2E,KAAKwgC,IAAKxgC,KAAK2wE,QAAS2F,GAAiBt2E,KAAKgwE,UAAWhwE,KAAKmO,KAAMgoE,GAAYG,GAAiBtG,EAAWhwE,KAAKmO,KAAMgoE,IAC7In2E,KAAKwgC,KAAO41C,IACZA,EAAO5N,gBAAa1nE,EACpBd,KAAKwgC,IAAIgoC,WAAaxoE,MAE1BA,KAAKgwE,UAAYA,CACrB,CAEAuG,aACiC,GAAzBv2E,KAAK2wE,QAAQtgC,UACbrwC,KAAK2wE,QAAQxuC,UAAUxyB,IAAI,6BAC3B3P,KAAKu3D,YAAev3D,KAAKmO,KAAKtJ,KAAKo3B,KAAKqa,YACxCt2C,KAAKwgC,IAAI8V,WAAY,EAC7B,CAEAkgC,eACiC,GAAzBx2E,KAAK2wE,QAAQtgC,UACbrwC,KAAK2wE,QAAQxuC,UAAUzzB,OAAO,6BAC9B1O,KAAKu3D,YAAev3D,KAAKmO,KAAKtJ,KAAKo3B,KAAKqa,WACxCt2C,KAAKwgC,IAAIi2C,gBAAgB,YACjC,CACIzF,cAAY,OAAOhxE,KAAKmO,KAAKy1C,MAAQ,EAI7C,SAAS8yB,GAAYjqD,EAAKujD,EAAWC,EAAWzvC,EAAK3mB,GACjDq5D,GAAe1yC,EAAKwvC,EAAWvjD,GAC/B,IAAIqhD,EAAU,IAAIkF,QAAalyE,EAAW2rB,EAAKujD,EAAWC,EAAWzvC,EAAKA,EAAKA,EAAK3mB,EAAM,GAG1F,OAFIi0D,EAAQvW,YACRuW,EAAQwF,eAAez5D,EAAM,GAC1Bi0D,CACX,CACA,MAAMsF,WAAqBJ,GACvB3wE,YAAYouB,EAAQtiB,EAAM6hE,EAAWC,EAAWzvC,EAAKmwC,EAAS92D,GAC1Dqa,MAAMzD,EAAQtiB,EAAM6hE,EAAWC,EAAWzvC,EAAK,KAAMmwC,EAAS92D,EAAM,EACxE,CACAs2D,YACI,IAAIzZ,EAAO12D,KAAK2wE,QAAQ3uC,WACxB,KAAO00B,GAAQA,GAAQ12D,KAAKwgC,MAAQk2B,EAAKigB,UACrCjgB,EAAOA,EAAK10B,WAChB,MAAO,CAAE00B,KAAOA,IAAQ,EAC5B,CACAl1B,OAAOrzB,EAAM6hE,EAAWC,EAAWp2D,GAC/B,QAjvB8D,GAivB1D7Z,KAAK2vE,OAjvBC,GAivBuB3vE,KAAK2vE,QAAuB3vE,KAAK42E,aAC7DzoE,EAAKm4C,WAAWtmD,KAAKmO,QAE1BnO,KAAKk2E,gBAAgBlG,GApvBX,GAqvBLhwE,KAAK2vE,OAAsBxhE,EAAKqJ,MAAQxX,KAAKmO,KAAKqJ,MAASrJ,EAAKqJ,MAAQxX,KAAK2wE,QAAQ9a,YACtF71D,KAAK2wE,QAAQ9a,UAAY1nD,EAAKqJ,KAC1BqC,EAAKg9D,aAAe72E,KAAK2wE,UACzB92D,EAAKg9D,YAAc,OAE3B72E,KAAKmO,KAAOA,EACZnO,KAAK2vE,MA3vBK,EA4vBH,GACX,CACAiH,WACI,IAAIE,EAAY92E,KAAKywB,OAAO8mC,WAC5B,IAAK,IAAI38B,EAAI56B,KAAK2wE,QAAS/1C,EAAGA,EAAIA,EAAEoH,WAChC,GAAIpH,GAAKk8C,EACL,OAAO,EACf,OAAO,CACX,CACApI,WAAWpoD,GACP,MAAO,CAAEnY,KAAMnO,KAAK2wE,QAAS78D,OAAQwS,EACzC,CACAiqD,gBAAgB/vC,EAAK1sB,EAAQunD,GACzB,OAAI76B,GAAOxgC,KAAK2wE,QACL3wE,KAAKquE,WAAa/pE,KAAKG,IAAIqP,EAAQ9T,KAAKmO,KAAKqJ,KAAKlX,QACtD4zB,MAAMq8C,gBAAgB/vC,EAAK1sB,EAAQunD,EAC9C,CACA0W,eAAeC,GACX,MAAwB,iBAAjBA,EAASntE,MAA4C,aAAjBmtE,EAASntE,IACxD,CACAS,MAAMyJ,EAAM+3B,EAAIjtB,GACZ,IAAI1L,EAAOnO,KAAKmO,KAAKi5C,IAAIr4C,EAAM+3B,GAAKtG,EAAM5rB,SAASsiD,eAAe/oD,EAAKqJ,MACvE,OAAO,IAAI47D,GAAapzE,KAAKywB,OAAQtiB,EAAMnO,KAAKgwE,UAAWhwE,KAAKiwE,UAAWzvC,EAAKA,EAAK3mB,EACzF,CACAq4D,UAAUnjE,EAAM+3B,GACZ5S,MAAMg+C,UAAUnjE,EAAM+3B,GAClB9mC,KAAKwgC,KAAOxgC,KAAK2wE,SAAoB,GAAR5hE,GAAa+3B,GAAM9mC,KAAK2wE,QAAQ9a,UAAUv1D,SACvEN,KAAK2vE,MAvxBqD,EAwxBlE,CACIqB,cAAY,OAAO,CAAO,EAIlC,MAAMF,WAA6BpB,GAC/BS,YAAc,MAAO,CAAEte,QAAQ,EAAQ,CACvCqe,YAAYrb,GAAY,OA/xBV,GA+xBiB70D,KAAK2vE,OAAsB3vE,KAAKwgC,IAAIq0B,UAAYA,CAAU,CACrFmc,cAAY,OAAO,CAAM,CACzB/B,sBAAoB,MAA4B,OAArBjvE,KAAKwgC,IAAIq0B,QAAmB,EAK/D,MAAMse,WAA2BH,GAC7B3wE,YAAYouB,EAAQtiB,EAAM6hE,EAAWC,EAAWzvC,EAAK+2B,EAAYoZ,EAAS10C,EAAMpiB,EAAMyM,GAClF4N,MAAMzD,EAAQtiB,EAAM6hE,EAAWC,EAAWzvC,EAAK+2B,EAAYoZ,EAAS92D,EAAMyM,GAC1EtmB,KAAKi8B,KAAOA,CAChB,CAIAuF,OAAOrzB,EAAM6hE,EAAWC,EAAWp2D,GAC/B,GA/yB8D,GA+yB1D7Z,KAAK2vE,MACL,OAAO,EACX,GAAI3vE,KAAKi8B,KAAKuF,OAAQ,CAClB,IAAI57B,EAAS5F,KAAKi8B,KAAKuF,OAAOrzB,EAAM6hE,EAAWC,GAG/C,OAFIrqE,GACA5F,KAAKi2E,YAAY9nE,EAAM6hE,EAAWC,EAAWp2D,GAC1CjU,CACX,CACK,SAAK5F,KAAKu3D,aAAeppD,EAAK+4C,SAIxBhzB,MAAMsN,OAAOrzB,EAAM6hE,EAAWC,EAAWp2D,EAExD,CACA08D,aACIv2E,KAAKi8B,KAAKs6C,WAAav2E,KAAKi8B,KAAKs6C,aAAeriD,MAAMqiD,YAC1D,CACAC,eACIx2E,KAAKi8B,KAAKu6C,aAAex2E,KAAKi8B,KAAKu6C,eAAiBtiD,MAAMsiD,cAC9D,CACAvqC,aAAa0uB,EAAQz0C,EAAMhiB,EAAMqtE,GAC7BvxE,KAAKi8B,KAAKgQ,aAAejsC,KAAKi8B,KAAKgQ,aAAa0uB,EAAQz0C,EAAMhiB,GACxDgwB,MAAM+X,aAAa0uB,EAAQz0C,EAAMhiB,EAAMqtE,EACjD,CACAxvC,UACQ/hC,KAAKi8B,KAAK8F,SACV/hC,KAAKi8B,KAAK8F,UACd7N,MAAM6N,SACV,CACAquC,UAAUh7D,GACN,QAAOpV,KAAKi8B,KAAKm0C,WAAYpwE,KAAKi8B,KAAKm0C,UAAUh7D,EACrD,CACA28D,eAAeC,GACX,OAAOhyE,KAAKi8B,KAAK81C,eAAiB/xE,KAAKi8B,KAAK81C,eAAeC,GAAY99C,MAAM69C,eAAeC,EAChG,EAKJ,SAASoD,GAAY0B,EAAWC,EAAOl9D,GACnC,IAAI2mB,EAAMs2C,EAAU7gC,WAAY+gC,GAAU,EAC1C,IAAK,IAAIx2E,EAAI,EAAGA,EAAIu2E,EAAMz2E,OAAQE,IAAK,CACnC,IAAI2H,EAAO4uE,EAAMv2E,GAAIy2E,EAAW9uE,EAAKq4B,IACrC,GAAIy2C,EAASj1C,YAAc80C,EAAW,CAClC,KAAOG,GAAYz2C,GACfA,EAAM02C,GAAG12C,GACTw2C,GAAU,EAEdx2C,EAAMA,EAAI81B,WACd,MAEI0gB,GAAU,EACVF,EAAUK,aAAaF,EAAUz2C,GAErC,GAAIr4B,aAAgByqE,GAAc,CAC9B,IAAItsD,EAAMka,EAAMA,EAAIu1B,gBAAkB+gB,EAAUjkC,UAChDuiC,GAAYjtE,EAAKovD,WAAYpvD,EAAKkG,SAAUwL,GAC5C2mB,EAAMla,EAAMA,EAAIgwC,YAAcwgB,EAAU7gC,UAC5C,CACJ,CACA,KAAOzV,GACHA,EAAM02C,GAAG12C,GACTw2C,GAAU,EAEVA,GAAWn9D,EAAKg9D,aAAeC,IAC/Bj9D,EAAKg9D,YAAc,KAC3B,CACA,MAAMO,GAAiB,SAAUviB,GACzBA,IACA70D,KAAK60D,SAAWA,EACxB,EACAuiB,GAAe91E,UAAYD,OAAO2Z,OAAO,MACzC,MAAMq8D,GAAS,CAAC,IAAID,IACpB,SAASd,GAAiBtG,EAAW7hE,EAAMgoE,GACvC,GAAwB,GAApBnG,EAAU1vE,OACV,OAAO+2E,GACX,IAAI/7C,EAAM66C,EAAYkB,GAAO,GAAK,IAAID,GAAgBxxE,EAAS,CAAC01B,GAChE,IAAK,IAAI96B,EAAI,EAAGA,EAAIwvE,EAAU1vE,OAAQE,IAAK,CACvC,IAAIg7B,EAAQw0C,EAAUxvE,GAAGqE,KAAK22B,MAC9B,GAAKA,EAAL,CAEIA,EAAMq5B,UACNjvD,EAAOzE,KAAKm6B,EAAM,IAAI87C,GAAe57C,EAAMq5B,WAC/C,IAAK,IAAIpyD,KAAQ+4B,EAAO,CACpB,IAAI2uB,EAAM3uB,EAAM/4B,GACL,MAAP0nD,IAEAgsB,GAA8B,GAAjBvwE,EAAOtF,QACpBsF,EAAOzE,KAAKm6B,EAAM,IAAI87C,GAAejpE,EAAKuoC,SAAW,OAAS,QACtD,SAARj0C,EACA64B,EAAIikB,OAASjkB,EAAIikB,MAAQjkB,EAAIikB,MAAQ,IAAM,IAAM4K,EACpC,SAAR1nD,EACL64B,EAAIlK,OAASkK,EAAIlK,MAAQkK,EAAIlK,MAAQ,IAAM,IAAM+4B,EACpC,YAAR1nD,IACL64B,EAAI74B,GAAQ0nD,GACpB,CAfY,CAgBhB,CACA,OAAOvkD,CACX,CACA,SAASywE,GAAeiB,EAAU3G,EAAS4G,EAAcC,GAErD,GAAID,GAAgBF,IAAUG,GAAeH,GACzC,OAAO1G,EACX,IAAI8G,EAAS9G,EACb,IAAK,IAAInwE,EAAI,EAAGA,EAAIg3E,EAAYl3E,OAAQE,IAAK,CACzC,IAAIozE,EAAO4D,EAAYh3E,GAAI+9C,EAAOg5B,EAAa/2E,GAC/C,GAAIA,EAAG,CACH,IAAIiwB,EACA8tB,GAAQA,EAAKsW,UAAY+e,EAAK/e,UAAY4iB,GAAUH,IACnD7mD,EAASgnD,EAAOz1C,aAAevR,EAAOokC,SAASp3C,eAAiBm2D,EAAK/e,WAItEpkC,EAAS7b,SAASyM,cAAcuyD,EAAK/e,UACrCpkC,EAAOkmD,UAAW,EAClBlmD,EAAOiR,YAAY+1C,GACnBl5B,EAAO84B,GAAO,IANdI,EAAShnD,CASjB,CACAinD,GAAgBD,EAAQl5B,GAAQ84B,GAAO,GAAIzD,EAC/C,CACA,OAAO6D,CACX,CACA,SAASC,GAAgBl3C,EAAK+d,EAAM+O,GAChC,IAAK,IAAI7qD,KAAQ87C,EACD,SAAR97C,GAA2B,SAARA,GAA2B,YAARA,GAAwBA,KAAQ6qD,GACtE9sB,EAAIi2C,gBAAgBh0E,GAC5B,IAAK,IAAIA,KAAQ6qD,EACD,SAAR7qD,GAA2B,SAARA,GAA2B,YAARA,GAAsB6qD,EAAI7qD,IAAS87C,EAAK97C,IAC9E+9B,EAAIoB,aAAan/B,EAAM6qD,EAAI7qD,IACnC,GAAI87C,EAAKgB,OAAS+N,EAAI/N,MAAO,CACzB,IAAIo4B,EAAWp5B,EAAKgB,MAAQhB,EAAKgB,MAAM9sB,MAAM,KAAKrlB,OAAOc,SAAW,GAChE0pE,EAAUtqB,EAAI/N,MAAQ+N,EAAI/N,MAAM9sB,MAAM,KAAKrlB,OAAOc,SAAW,GACjE,IAAK,IAAI1N,EAAI,EAAGA,EAAIm3E,EAASr3E,OAAQE,KACI,GAAjCo3E,EAAQ3nD,QAAQ0nD,EAASn3E,KACzBggC,EAAI2B,UAAUzzB,OAAOipE,EAASn3E,IACtC,IAAK,IAAIA,EAAI,EAAGA,EAAIo3E,EAAQt3E,OAAQE,KACK,GAAjCm3E,EAAS1nD,QAAQ2nD,EAAQp3E,KACzBggC,EAAI2B,UAAUxyB,IAAIioE,EAAQp3E,IACN,GAAxBggC,EAAI2B,UAAU7hC,QACdkgC,EAAIi2C,gBAAgB,QAC5B,CACA,GAAIl4B,EAAKntB,OAASk8B,EAAIl8B,MAAO,CACzB,GAAImtB,EAAKntB,MAAO,CACZ,IAA4F6J,EAAxFxE,EAAO,gFACX,KAAOwE,EAAIxE,EAAKvK,KAAKqyB,EAAKntB,QACtBoP,EAAIpP,MAAMymD,eAAe58C,EAAE,GACnC,CACIqyB,EAAIl8B,QACJoP,EAAIpP,MAAMkkD,SAAWhoB,EAAIl8B,MACjC,CACJ,CACA,SAAS8hD,GAAe1yC,EAAKozC,EAAMzlE,GAC/B,OAAOkoE,GAAe71C,EAAKA,EAAK62C,GAAQf,GAAiB1C,EAAMzlE,EAAsB,GAAhBqyB,EAAI6P,UAC7E,CACA,SAASgjC,GAAcphD,EAAGC,GACtB,GAAID,EAAE3xB,QAAU4xB,EAAE5xB,OACd,OAAO,EACX,IAAK,IAAIE,EAAI,EAAGA,EAAIyxB,EAAE3xB,OAAQE,IAC1B,IAAKyxB,EAAEzxB,GAAGqE,KAAK+pC,GAAG1c,EAAE1xB,GAAGqE,MACnB,OAAO,EACf,OAAO,CACX,CAEA,SAASqyE,GAAG12C,GACR,IAAIzuB,EAAOyuB,EAAI81B,YAEf,OADA91B,EAAIwB,WAAW+zC,YAAYv1C,GACpBzuB,CACX,CAGA,MAAM4hE,GACFtxE,YAAYi5B,EAAKw8C,EAAMj+D,GACnB7Z,KAAK83E,KAAOA,EACZ93E,KAAK6Z,KAAOA,EAGZ7Z,KAAKuO,MAAQ,EAGbvO,KAAKiS,MAAQ,GAEbjS,KAAKk1E,SAAU,EACfl1E,KAAKs7B,IAAMA,EACXt7B,KAAK+3E,SAqOb,SAAkBpqB,EAAMqqB,GACpB,IAAIC,EAAUD,EAAYE,EAAQD,EAAQ5pE,SAAS/N,OAC/C63E,EAAKxqB,EAAK/a,WAAYmd,EAAU,IAAI5lD,IAAKsnD,EAAU,GACvD8Q,EAAO,KAAO4V,EAAK,GAAG,CAClB,IAAIhwE,EACJ,OACI,GAAI+vE,EAAO,CACP,IAAInmE,EAAOkmE,EAAQ5pE,SAAS6pE,EAAQ,GACpC,KAAInmE,aAAgB6gE,IAIf,CACDzqE,EAAO4J,EACPmmE,IACA,KACJ,CAPID,EAAUlmE,EACVmmE,EAAQnmE,EAAK1D,SAAS/N,MAO9B,KACK,IAAI23E,GAAWD,EAChB,MAAMzV,EAIN2V,EAAQD,EAAQxnD,OAAOpiB,SAAS4hB,QAAQgoD,GACxCA,EAAUA,EAAQxnD,MACtB,CAEJ,IAAItiB,EAAOhG,EAAKgG,KAChB,GAAKA,EAAL,CAEA,GAAIA,GAAQw/C,EAAK76B,MAAMqlD,EAAK,GACxB,QACFA,EACFpoB,EAAQtnD,IAAIN,EAAMgwE,GAClB1mB,EAAQtwD,KAAKgH,EALD,CAMhB,CACA,MAAO,CAAEoG,MAAO4pE,EAAIpoB,UAAS0B,QAASA,EAAQ3oB,UAClD,CA1QwBivC,CAASz8C,EAAIntB,KAAKhO,QAASm7B,EAC/C,CAGA88C,eAAe3pE,EAAOG,GAClB,GAAIH,GAASG,EAAb,CAEA,IAAK,IAAIpO,EAAIiO,EAAOjO,EAAIoO,EAAKpO,IACzBR,KAAKs7B,IAAIjtB,SAAS7N,GAAGuhC,UACzB/hC,KAAKs7B,IAAIjtB,SAASG,OAAOC,EAAOG,EAAMH,GACtCzO,KAAKk1E,SAAU,CAJL,CAKd,CAEAD,cACIj1E,KAAKo4E,eAAep4E,KAAKuO,MAAOvO,KAAKs7B,IAAIjtB,SAAS/N,OACtD,CAGAm0E,YAAY74C,EAAOwa,EAAQv8B,GACvB,IAAIw/C,EAAO,EAAG/vC,EAAQtpB,KAAKiS,MAAM3R,QAAU,EACvC+3E,EAAU/zE,KAAKG,IAAI6kB,EAAOsS,EAAMt7B,QACpC,KAAO+4D,EAAOgf,IACThf,GAAQ/vC,EAAQ,EAAItpB,KAAKs7B,IAAMt7B,KAAKiS,MAAOonD,EAAO,GAAM,IACpDyW,YAAYl0C,EAAMy9B,MAA6C,IAAnCz9B,EAAMy9B,GAAMx0D,KAAKo3B,KAAKs9B,UACvDF,IACJ,KAAOA,EAAO/vC,GACVtpB,KAAKi1E,cACLj1E,KAAKs7B,IAAIq0C,MApgCH,EAqgCN3vE,KAAKuO,MAAQvO,KAAKiS,MAAMuE,MACxBxW,KAAKs7B,IAAMt7B,KAAKiS,MAAMuE,MACtB8S,IAEJ,KAAOA,EAAQsS,EAAMt7B,QAAQ,CACzBN,KAAKiS,MAAM9Q,KAAKnB,KAAKs7B,IAAKt7B,KAAKuO,MAAQ,GACvC,IAAIq3C,GAAS,EACb,IAAK,IAAIplD,EAAIR,KAAKuO,MAAO/N,EAAI8D,KAAKG,IAAIzE,KAAKuO,MAAQ,EAAGvO,KAAKs7B,IAAIjtB,SAAS/N,QAASE,IAAK,CAClF,IAAIuR,EAAO/R,KAAKs7B,IAAIjtB,SAAS7N,GAC7B,GAAIuR,EAAK+9D,YAAYl0C,EAAMtS,MAAYtpB,KAAKs4E,SAASvmE,EAAKyuB,KAAM,CAC5DolB,EAAQplD,EACR,KACJ,CACJ,CACA,GAAIolD,GAAS,EACLA,EAAQ5lD,KAAKuO,QACbvO,KAAKk1E,SAAU,EACfl1E,KAAKo4E,eAAep4E,KAAKuO,MAAOq3C,IAEpC5lD,KAAKs7B,IAAMt7B,KAAKs7B,IAAIjtB,SAASrO,KAAKuO,WAEjC,CACD,IAAIgqE,EAAW3F,GAAa53D,OAAOhb,KAAKs7B,IAAKM,EAAMtS,GAAQ8sB,EAAQv8B,GACnE7Z,KAAKs7B,IAAIjtB,SAASG,OAAOxO,KAAKuO,MAAO,EAAGgqE,GACxCv4E,KAAKs7B,IAAMi9C,EACXv4E,KAAKk1E,SAAU,CACnB,CACAl1E,KAAKuO,MAAQ,EACb+a,GACJ,CACJ,CAGAsrD,cAAczmE,EAAM6hE,EAAWC,EAAW1hE,GACtC,IAAgBiqE,EAAZ5yB,GAAS,EACb,GAAIr3C,GAASvO,KAAK+3E,SAASxpE,QACtBiqE,EAAax4E,KAAK+3E,SAAStmB,QAAQljD,EAAQvO,KAAK+3E,SAASxpE,QAAQkiB,QAAUzwB,KAAKs7B,KACjFk9C,EAAWzI,YAAY5hE,EAAM6hE,EAAWC,GACxCrqB,EAAQ5lD,KAAKs7B,IAAIjtB,SAAS4hB,QAAQuoD,EAAYx4E,KAAKuO,YAGnD,IAAK,IAAI/N,EAAIR,KAAKuO,MAAO/D,EAAIlG,KAAKG,IAAIzE,KAAKs7B,IAAIjtB,SAAS/N,OAAQE,EAAI,GAAIA,EAAIgK,EAAGhK,IAAK,CAChF,IAAIsyB,EAAQ9yB,KAAKs7B,IAAIjtB,SAAS7N,GAC9B,GAAIsyB,EAAMi9C,YAAY5hE,EAAM6hE,EAAWC,KAAejwE,KAAK+3E,SAAShoB,QAAQlkD,IAAIinB,GAAQ,CACpF8yB,EAAQplD,EACR,KACJ,CACJ,CAEJ,QAAIolD,EAAQ,IAEZ5lD,KAAKo4E,eAAep4E,KAAKuO,MAAOq3C,GAChC5lD,KAAKuO,QACE,GACX,CACAumE,aAAa3mE,EAAM6hE,EAAWC,EAAW1hE,EAAOsL,GAC5C,IAAIiZ,EAAQ9yB,KAAKs7B,IAAIjtB,SAASE,GAG9B,OAhkC8D,GA8jC1DukB,EAAM68C,OAAuB78C,EAAM0N,KAAO1N,EAAMykC,aAChDzkC,EAAM68C,MA/jCoC,KAgkCzC78C,EAAM0O,OAAOrzB,EAAM6hE,EAAWC,EAAWp2D,KAE9C7Z,KAAKo4E,eAAep4E,KAAKuO,MAAOA,GAChCvO,KAAKuO,SACE,EACX,CACAsmE,mBAAmB4D,GACf,OAAS,CACL,IAAIhoD,EAASgoD,EAAQz2C,WACrB,IAAKvR,EACD,OAAQ,EACZ,GAAIA,GAAUzwB,KAAKs7B,IAAIi8B,WAAY,CAC/B,IAAIpvD,EAAOswE,EAAQjQ,WACnB,GAAIrgE,EACA,IAAK,IAAI3H,EAAIR,KAAKuO,MAAO/N,EAAIR,KAAKs7B,IAAIjtB,SAAS/N,OAAQE,IACnD,GAAIR,KAAKs7B,IAAIjtB,SAAS7N,IAAM2H,EACxB,OAAO3H,EAEnB,OAAQ,CACZ,CACAi4E,EAAUhoD,CACd,CACJ,CAGAskD,eAAe5mE,EAAM6hE,EAAWC,EAAWp2D,EAAMtL,EAAO+X,GACpD,IAAK,IAAI9lB,EAAIR,KAAKuO,MAAO/N,EAAIR,KAAKs7B,IAAIjtB,SAAS/N,OAAQE,IAAK,CACxD,IAAIuR,EAAO/R,KAAKs7B,IAAIjtB,SAAS7N,GAC7B,GAAIuR,aAAgBihE,GAAc,CAC9B,IAAI+E,EAAW/3E,KAAK+3E,SAAShoB,QAAQvnD,IAAIuJ,GACzC,GAAgB,MAAZgmE,GAAoBA,GAAYxpE,EAChC,OAAO,EACX,IAAwB6/B,EAApBsqC,EAAU3mE,EAAKyuB,IAIfm4C,EAAS34E,KAAKs4E,SAASI,MACrBvqE,EAAKwtB,QAAU5pB,EAAK5D,MAAQ4D,EAAK5D,KAAKwtB,QAAU5pB,EAAK4+D,QAAQ9a,WAAa1nD,EAAKqJ,MArmC/B,GAsmC9CzF,EAAK49D,OAAuB0D,GAAcrD,EAAWj+D,EAAKi+D,YAClE,IAAK2I,GAAU5mE,EAAKyvB,OAAOrzB,EAAM6hE,EAAWC,EAAWp2D,GAKnD,OAJA7Z,KAAKo4E,eAAep4E,KAAKuO,MAAO/N,GAC5BuR,EAAKyuB,KAAOk4C,IACZ14E,KAAKk1E,SAAU,GACnBl1E,KAAKuO,SACE,EAEN,IAAKoqE,IAAWvqC,EAAUpuC,KAAK44E,gBAAgB7mE,EAAM5D,EAAM6hE,EAAWC,EAAWp2D,EAAMyM,IAOxF,OANAtmB,KAAKs7B,IAAIjtB,SAASrO,KAAKuO,OAAS6/B,EAChCA,EAAQuhC,MAhnC0B,EAinClCvhC,EAAQklC,eAAez5D,EAAMyM,EAAM,GACnC8nB,EAAQuhC,MAlnCV,EAmnCE3vE,KAAKk1E,SAAU,EACfl1E,KAAKuO,SACE,EAEX,KACJ,CACJ,CACA,OAAO,CACX,CAGAqqE,gBAAgB7mE,EAAM5D,EAAM6hE,EAAWC,EAAWp2D,EAAMyM,GACpD,GAAIvU,EAAK49D,OAASxhE,EAAKy1C,SAAW7xC,EAAK1D,SAAS/N,SAC3CyR,EAAK5D,KAAKhO,QAAQyuC,GAAGzgC,EAAKhO,SAC3B,OAAO,KACX,IAAI04E,EAAU7F,GAAah4D,OAAOhb,KAAKs7B,IAAKntB,EAAM6hE,EAAWC,EAAWp2D,EAAMyM,GAC9E,IAAKuyD,EAAQthB,WACT,OAAO,KACXshB,EAAQxqE,SAAW0D,EAAK1D,SACxB0D,EAAK1D,SAAW,GAChB,IAAK,IAAIyqE,KAAMD,EAAQxqE,SACnByqE,EAAGroD,OAASooD,EAChB,OAAOA,CACX,CAEA7iC,QAAQ7nC,EAAM6hE,EAAWC,EAAWp2D,EAAMyM,GACtC,IAAIne,EAAO6qE,GAAah4D,OAAOhb,KAAKs7B,IAAKntB,EAAM6hE,EAAWC,EAAWp2D,EAAMyM,GACvEne,EAAKovD,YACLpvD,EAAKmrE,eAAez5D,EAAMyM,EAAM,GACpCtmB,KAAKs7B,IAAIjtB,SAASG,OAAOxO,KAAKuO,QAAS,EAAGpG,GAC1CnI,KAAKk1E,SAAU,CACnB,CACAR,YAAY7E,EAAQh2D,EAAMyM,GACtB,IAAIvU,EAAO/R,KAAKuO,MAAQvO,KAAKs7B,IAAIjtB,SAAS/N,OAASN,KAAKs7B,IAAIjtB,SAASrO,KAAKuO,OAAS,KACnF,IAAIwD,IAAQA,EAAK69D,cAAcC,IAC1BA,GAAU99D,EAAK89D,QAAW99D,EAAK89D,OAAOhrE,KAAKmuC,MAAMhR,WAGjD,CACD,IAAI75B,EAAO,IAAI4oE,GAAe/wE,KAAKs7B,IAAKu0C,EAAQh2D,EAAMyM,GACtDtmB,KAAKs7B,IAAIjtB,SAASG,OAAOxO,KAAKuO,QAAS,EAAGpG,GAC1CnI,KAAKk1E,SAAU,CACnB,MANIl1E,KAAKuO,OAOb,CAGAymE,oBACI,IAAIniC,EAAY7yC,KAAKs7B,IAAIjtB,SAASrO,KAAKuO,MAAQ,GAAIkiB,EAASzwB,KAAKs7B,IACjE,KAAOuX,aAAqB+/B,IACxBniD,EAASoiB,EACTA,EAAYpiB,EAAOpiB,SAASoiB,EAAOpiB,SAAS/N,OAAS,KAEpDuyC,KACCA,aAAqBugC,KACvB,MAAM/tE,KAAKwtC,EAAU1kC,KAAKqJ,OACzBxX,KAAK6Z,KAAKk/D,uBAAyB,MAAM1zE,KAAKwtC,EAAU1kC,KAAKqJ,UAEzD6xD,GAAU7kB,IAAW3R,GAA8C,SAAjCA,EAAUrS,IAAI+b,iBACjDv8C,KAAKg5E,YAAY,MAAOvoD,GAC5BzwB,KAAKg5E,YAAY,KAAMh5E,KAAKs7B,KAEpC,CACA09C,YAAYnkB,EAAUpkC,GAClB,GAAIA,GAAUzwB,KAAKs7B,KAAOt7B,KAAKuO,MAAQkiB,EAAOpiB,SAAS/N,QAAUmwB,EAAOpiB,SAASrO,KAAKuO,OAAO2hE,YAAYrb,GACrG70D,KAAKuO,YAEJ,CACD,IAAIiyB,EAAM5rB,SAASyM,cAAcwzC,GACjB,OAAZA,IACAr0B,EAAIiB,UAAY,wBAChBjB,EAAIpyB,IAAM,IAEE,MAAZymD,IACAr0B,EAAIiB,UAAY,6BACpB,IAAIw3C,EAAO,IAAInI,GAAqB9wE,KAAKs7B,IAAK,GAAIkF,EAAK,MACnD/P,GAAUzwB,KAAKs7B,IACf7K,EAAOpiB,SAASlN,KAAK83E,GAErBxoD,EAAOpiB,SAASG,OAAOxO,KAAKuO,QAAS,EAAG0qE,GAC5Cj5E,KAAKk1E,SAAU,CACnB,CACJ,CACAoD,SAASnqE,GACL,OAAOnO,KAAK83E,OAAS3pE,GAAQnO,KAAK83E,MAAyB,GAAjB3pE,EAAKkiC,UAAiBliC,EAAKkqD,SAASr4D,KAAK83E,KAAK91C,YAC5F,EA6CJ,SAASqyC,GAAYpiD,EAAGC,GACpB,OAAOD,EAAEptB,KAAKy3C,KAAOpqB,EAAErtB,KAAKy3C,IAChC,CAiIA,SAASy2B,GAAaj3C,EAAO/sB,EAAM+3B,EAAIjtB,EAAM64B,GACzC,IAAI9sC,EAAS,GACb,IAAK,IAAIpF,EAAI,EAAGmjC,EAAM,EAAGnjC,EAAIs7B,EAAMx7B,OAAQE,IAAK,CAC5C,IAAIsyB,EAAQgJ,EAAMt7B,GAAIiO,EAAQk1B,EAAK/0B,EAAM+0B,GAAO7Q,EAAM7hB,KAClDxC,GAASq4B,GAAMl4B,GAAOG,EACtBnJ,EAAOzE,KAAK2xB,IAGRrkB,EAAQM,GACRnJ,EAAOzE,KAAK2xB,EAAMxtB,MAAM,EAAGyJ,EAAON,EAAOoL,IACzC64B,IACA9sC,EAAOzE,KAAKuxC,GACZA,OAAc5xC,GAEd8N,EAAMk4B,GACNlhC,EAAOzE,KAAK2xB,EAAMxtB,MAAMwhC,EAAKr4B,EAAOqkB,EAAM7hB,KAAM4I,IAE5D,CACA,OAAOjU,CACX,CAEA,SAASszE,GAAiBr/D,EAAMma,EAAS,MACrC,IAAI00C,EAAS7uD,EAAK67D,oBAAqBjpD,EAAM5S,EAAKL,MAAMiT,IACxD,IAAKi8C,EAAOC,UACR,OAAO,KACX,IAAIoF,EAAcl0D,EAAKi0D,QAAQC,YAAYrF,EAAOC,WAAYwQ,EAAWpL,GAAmC,GAApBA,EAAY98D,KAChGiV,EAAOrM,EAAKi0D,QAAQI,WAAWxF,EAAOC,UAAWD,EAAOE,YAAa,GACzE,GAAI1iD,EAAO,EACP,OAAO,KACX,IAA+BiuB,EAASlM,EAApC4b,EAAQp3B,EAAI1hB,QAAQmb,GACxB,GAAIuiD,EAAmBC,GAAS,CAE5B,IADAv0B,EAAU0P,EACHkqB,IAAgBA,EAAY5/D,MAC/B4/D,EAAcA,EAAYt9C,OAC9B,IAAI2oD,EAAkBrL,EAAY5/D,KAClC,GAAI4/D,GAAeqL,EAAgBx1B,QAAU,kBAA2Bw1B,IAAoBrL,EAAYt9C,UAC/F2oD,EAAgB1iC,WAr/DjC,SAAkBvoC,EAAM2F,EAAQ2c,GAC5B,IAAK,IAAIunB,EAAoB,GAAVlkC,EAAamkC,EAAQnkC,GAAUogC,EAAS/lC,GAAO6pC,GAAWC,GAAQ,CACjF,GAAI9pC,GAAQsiB,EACR,OAAO,EACX,IAAIliB,EAAQm5D,EAASv5D,GAErB,KADAA,EAAOA,EAAK6zB,YAER,OAAO,EACXgW,EAAUA,GAAoB,GAATzpC,EACrB0pC,EAAQA,GAAS1pC,GAAS2lC,EAAS/lC,EACvC,CACJ,CA0+D6CkrE,CAAS3Q,EAAOC,UAAWD,EAAOE,YAAamF,EAAYvtC,MAAO,CACnG,IAAIla,EAAMynD,EAAYC,UACtB/lC,EAAY,IAAI,KAAc/hB,GAAQI,EAAMu9B,EAAQp3B,EAAI1hB,QAAQub,GACpE,CACJ,KACK,CACD,IAAIq0C,EAAS9gD,EAAKi0D,QAAQI,WAAWxF,EAAOG,WAAYH,EAAOI,aAAc,GAC7E,GAAInO,EAAS,EACT,OAAO,KACXxmB,EAAU1nB,EAAI1hB,QAAQ4vD,EAC1B,CAKA,OAJK1yB,IAEDA,EAAYqxC,GAAiBz/D,EAAMs6B,EAAS0P,EADvB,WAAV7vB,GAAwBna,EAAKL,MAAMyuB,UAAU/hB,KAAO29B,EAAMv9B,MAAQ6yD,EAAY,GAAK,IAG3FlxC,CACX,CACA,SAASsxC,GAAoB1/D,GACzB,OAAOA,EAAKwhC,SAAWxhC,EAAKuhC,WACxBo+B,GAAa3/D,IAASjF,SAASw6D,eAAiBx6D,SAASw6D,cAAc/W,SAASx+C,EAAK2mB,IAC7F,CACA,SAASi5C,GAAe5/D,EAAM03D,GAAQ,GAClC,IAAI54B,EAAM9+B,EAAKL,MAAMyuB,UAErB,GADAyxC,GAAkB7/D,EAAM8+B,GACnB4gC,GAAoB1/D,GAAzB,CAKA,IAAK03D,GAAS13D,EAAKrN,MAAMmtE,WAAa9/D,EAAKrN,MAAMmtE,UAAUC,cAAgBp1B,EAAQ,CAC/E,IAAIkkB,EAAS7uD,EAAK67D,oBAAqBmE,EAAShgE,EAAKigE,YAAYC,iBACjE,GAAIrR,EAAOG,YAAcgR,EAAOhR,YAC5BX,EAAqBQ,EAAOG,WAAYH,EAAOI,aAAc+Q,EAAOhR,WAAYgR,EAAO/Q,cAGvF,OAFAjvD,EAAKrN,MAAMmtE,UAAUK,sBAAuB,OAC5CngE,EAAKigE,YAAYG,iBAGzB,CAEA,GADApgE,EAAKigE,YAAYI,sBACbrgE,EAAKsgE,eA8Eb,SAA6BtgE,GACzB,IAAI6uD,EAAS7uD,EAAKugE,eAAgB5pC,EAAQ57B,SAASmzD,cAC/C55D,EAAO0L,EAAKsgE,cAAc35C,IAAK65C,EAAuB,OAAjBlsE,EAAK0mD,SAC1CwlB,EACA7pC,EAAMw3B,OAAO75D,EAAK6zB,WAAY0lC,EAASv5D,GAAQ,GAE/CqiC,EAAMw3B,OAAO75D,EAAM,GACvBqiC,EAAMqhC,UAAS,GACfnJ,EAAOoJ,kBACPpJ,EAAO7e,SAASrZ,IAMX6pC,IAAQxgE,EAAKL,MAAMyuB,UAAU0zB,SAAWv7B,GAAM8oC,GAAc,KAC7D/6D,EAAKmsE,UAAW,EAChBnsE,EAAKmsE,UAAW,EAExB,CAhGQC,CAAoB1gE,OAEnB,CACD,IAA4B2gE,EAAmBC,GAA3C,OAAE9f,EAAM,KAAEz0C,GAASyyB,GACnB+hC,IAAmC/hC,aAAe,OAC7CA,EAAI3D,MAAMvkB,OAAO2pB,gBAClBogC,EAAoBG,GAAwB9gE,EAAM8+B,EAAI5pC,OACrD4pC,EAAI5R,OAAU4R,EAAI3D,MAAMvkB,OAAO2pB,gBAChCqgC,EAAkBE,GAAwB9gE,EAAM8+B,EAAI7R,MAE5DjtB,EAAKi0D,QAAQ7hC,aAAa0uB,EAAQz0C,EAAMrM,EAAK3V,KAAMqtE,GAC/CmJ,KACIF,GACAI,GAAcJ,GACdC,GACAG,GAAcH,IAElB9hC,EAAIgjB,QACJ9hD,EAAK2mB,IAAI2B,UAAUzzB,OAAO,8BAG1BmL,EAAK2mB,IAAI2B,UAAUxyB,IAAI,6BACnB,sBAAuBiF,UAwCvC,SAAsCiF,GAClC,IAAI4S,EAAM5S,EAAK2mB,IAAIy2B,cACnBxqC,EAAI0Y,oBAAoB,kBAAmBtrB,EAAKrN,MAAMquE,oBACtD,IAAInS,EAAS7uD,EAAK67D,oBACdvnE,EAAOu6D,EAAOG,WAAY/0D,EAAS40D,EAAOI,aAC9Cr8C,EAAIwY,iBAAiB,kBAAmBprB,EAAKrN,MAAMquE,mBAAqB,KAChEnS,EAAOG,YAAc16D,GAAQu6D,EAAOI,cAAgBh1D,IACpD2Y,EAAI0Y,oBAAoB,kBAAmBtrB,EAAKrN,MAAMquE,oBACtDh0E,YAAW,KACF0yE,GAAoB1/D,KAASA,EAAKL,MAAMyuB,UAAU0zB,SACnD9hD,EAAK2mB,IAAI2B,UAAUzzB,OAAO,4BAA4B,GAC3D,IACP,EAER,CArDgBosE,CAA6BjhE,GAEzC,CACAA,EAAKigE,YAAYG,kBACjBpgE,EAAKigE,YAAYiB,kBA1CP,CA2Cd,CAIA,MAAML,GAAgCrR,GAAU7kB,GAAU4kB,EAAiB,GAC3E,SAASuR,GAAwB9gE,EAAMyM,GACnC,IAAI,KAAEnY,EAAI,OAAE2F,GAAW+F,EAAKi0D,QAAQY,WAAWpoD,EAAK,GAChDpK,EAAQpI,EAAS3F,EAAKupD,WAAWp3D,OAAS6N,EAAKupD,WAAW5jD,GAAU,KACpEpE,EAASoE,EAAS3F,EAAKupD,WAAW5jD,EAAS,GAAK,KACpD,GAAIu1D,GAAUntD,GAAkC,SAAzBA,EAAMqgC,gBACzB,OAAOy+B,GAAY9+D,GACvB,KAAMA,GAAkC,SAAzBA,EAAMqgC,iBACf7sC,GAAoC,SAA1BA,EAAO6sC,iBAA6B,CAChD,GAAIrgC,EACA,OAAO8+D,GAAY9+D,GAClB,GAAIxM,EACL,OAAOsrE,GAAYtrE,EAC3B,CACJ,CACA,SAASsrE,GAAYhO,GAMjB,OALAA,EAAQzwB,gBAAkB,OACtB8sB,GAAU2D,EAAQ12B,YAClB02B,EAAQ12B,WAAY,EACpB02B,EAAQiO,cAAe,GAEpBjO,CACX,CACA,SAAS4N,GAAc5N,GACnBA,EAAQzwB,gBAAkB,QACtBywB,EAAQiO,eACRjO,EAAQ12B,WAAY,EACpB02B,EAAQiO,aAAe,KAE/B,CAoCA,SAASvB,GAAkB7/D,EAAM8+B,GAC7B,GAAIA,aAAe,KAAe,CAC9B,IAAIxwC,EAAO0R,EAAKi0D,QAAQ+C,OAAOl4B,EAAI5pC,MAC/B5G,GAAQ0R,EAAKqhE,uBACbC,GAAmBthE,GACf1R,GACAA,EAAKouE,aACT18D,EAAKqhE,qBAAuB/yE,EAEpC,MAEIgzE,GAAmBthE,EAE3B,CAEA,SAASshE,GAAmBthE,GACpBA,EAAKqhE,uBACDrhE,EAAKqhE,qBAAqBzqD,QAC1B5W,EAAKqhE,qBAAqB1E,eAC9B38D,EAAKqhE,0BAAuBp6E,EAEpC,CACA,SAASw4E,GAAiBz/D,EAAMs6B,EAAS0P,EAAOwX,GAC5C,OAAOxhD,EAAK+wD,SAAS,0BAA0B5sC,GAAKA,EAAEnkB,EAAMs6B,EAAS0P,MAC9D,aAAsB1P,EAAS0P,EAAOwX,EACjD,CACA,SAAS+f,GAAqBvhE,GAC1B,QAAIA,EAAKwhC,WAAaxhC,EAAKuhC,aAEpBo+B,GAAa3/D,EACxB,CACA,SAAS2/D,GAAa3/D,GAClB,IAAI8+B,EAAM9+B,EAAK67D,oBACf,IAAK/8B,EAAIkwB,WACL,OAAO,EACX,IAII,OAAOhvD,EAAK2mB,IAAI63B,SAAoC,GAA3B1f,EAAIkwB,WAAWx4B,SAAgBsI,EAAIkwB,WAAW7mC,WAAa2W,EAAIkwB,cACnFhvD,EAAKwhC,UAAYxhC,EAAK2mB,IAAI63B,SAAmC,GAA1B1f,EAAIgwB,UAAUt4B,SAAgBsI,EAAIgwB,UAAU3mC,WAAa2W,EAAIgwB,WACzG,CACA,MAAO5uD,GACH,OAAO,CACX,CACJ,CAOA,SAASshE,GAAmB7hE,EAAOyhD,GAC/B,IAAI,QAAE9mB,EAAO,MAAE0P,GAAUrqC,EAAMyuB,UAC3BqzC,EAAQrgB,EAAM,EAAI9mB,EAAQ5vC,IAAIs/C,GAAS1P,EAAQ1vC,IAAIo/C,GACnDhT,EAAUyqC,EAAM7qD,OAAO2pB,cAAwBkhC,EAAMhyD,MAAQ9P,EAAMiT,IAAI1hB,QAAQkwD,EAAM,EAAIqgB,EAAMp/D,QAAUo/D,EAAM5rE,UAAY,KAApF4rE,EAC3C,OAAOzqC,GAAU,cAAmBA,EAAQoqB,EAChD,CACA,SAASz0D,GAAMqT,EAAM8+B,GAEjB,OADA9+B,EAAK2oB,SAAS3oB,EAAKL,MAAM8uB,GAAG2D,aAAa0M,GAAKvM,mBACvC,CACX,CACA,SAASmvC,GAAmB1hE,EAAMohD,EAAKugB,GACnC,IAAI7iC,EAAM9+B,EAAKL,MAAMyuB,UACrB,KAAI0Q,aAAe,MA+Bd,IAAIA,aAAe,MAAiBA,EAAIxqC,KAAKuoC,SAC9C,OAAOlwC,GAAMqT,EAAM,IAAI,KAAcohD,EAAM,EAAItiB,EAAIlB,IAAMkB,EAAI3D,QAE5D,CACD,IAAIjjC,EAAOspE,GAAmBxhE,EAAKL,MAAOyhD,GAC1C,QAAIlpD,GACOvL,GAAMqT,EAAM9H,EAE3B,EAtCI,IAAK4mC,EAAI5R,OAASy0C,EAAKvrD,QAAQ,MAAQ,EACnC,OAAO,EAEN,GAAIpW,EAAK4pC,eAAewX,EAAM,EAAI,UAAY,YAAa,CAC5D,IAAIlpD,EAAOspE,GAAmBxhE,EAAKL,MAAOyhD,GAC1C,SAAIlpD,GAASA,aAAgB,OAClBvL,GAAMqT,EAAM9H,EAE3B,CACK,KAAM0yC,GAAO+2B,EAAKvrD,QAAQ,MAAQ,GAAI,CACvC,IAAsG9nB,EAAlG07C,EAAQlL,EAAIkL,MAAO11C,EAAO01C,EAAMkG,WAAa,KAAOkR,EAAM,EAAIpX,EAAMlT,WAAakT,EAAM9L,UAC3F,IAAK5pC,GAAQA,EAAKwtB,OACd,OAAO,EACX,IAAI8/C,EAAUxgB,EAAM,EAAIpX,EAAMv9B,IAAMnY,EAAK+lC,SAAW2P,EAAMv9B,IAC1D,SAAMnY,EAAKy1C,SAAWz7C,EAAO0R,EAAKi0D,QAAQ+C,OAAO4K,MAActzE,EAAKovD,cAEhE,kBAA2BppD,GACpB3H,GAAMqT,EAAM,IAAI,KAAcohD,EAAM,EAAIphD,EAAKL,MAAMiT,IAAI1hB,QAAQ84C,EAAMv9B,IAAMnY,EAAK+lC,UAAY2P,MAE9F4lB,GAIEjjE,GAAMqT,EAAM,IAAI,KAAcA,EAAKL,MAAMiT,IAAI1hB,QAAQkwD,EAAM,EAAIwgB,EAAUA,EAAUttE,EAAK+lC,YAKvG,CAWR,CACA,SAASwnC,GAAQvtE,GACb,OAAwB,GAAjBA,EAAKkiC,SAAgBliC,EAAK0nD,UAAUv1D,OAAS6N,EAAKupD,WAAWp3D,MACxE,CACA,SAASq7E,GAAYn7C,GACjB,IAAIr4B,EAAOq4B,EAAIgoC,WACf,OAAOrgE,GAAqB,GAAbA,EAAK8I,OAAcuvB,EAAI81B,aAA+B,MAAhB91B,EAAIq0B,SAC7D,CACA,SAAS+mB,GAAiB/hE,EAAMohD,GAC5B,OAAOA,EAAM,EAIjB,SAAgCphD,GAC5B,IAAI8+B,EAAM9+B,EAAK67D,oBACXvnE,EAAOwqC,EAAIgwB,UAAW70D,EAAS6kC,EAAIiwB,YACvC,IAAKz6D,EACD,OACJ,IAAI0tE,EAAUC,EAAYvK,GAAQ,EAMlC,IAFIpI,GAA0B,GAAjBh7D,EAAKkiC,UAAiBv8B,EAAS4nE,GAAQvtE,IAASwtE,GAAYxtE,EAAKupD,WAAW5jD,MACrFy9D,GAAQ,KAER,GAAIz9D,EAAS,EAAG,CACZ,GAAqB,GAAjB3F,EAAKkiC,SACL,MAEC,CACD,IAAI3gC,EAASvB,EAAKupD,WAAW5jD,EAAS,GACtC,GAAI6nE,GAAYjsE,GACZmsE,EAAW1tE,EACX2tE,IAAehoE,MAEd,IAAuB,GAAnBpE,EAAO2gC,SAKZ,MAJAliC,EAAOuB,EACPoE,EAAS3F,EAAK0nD,UAAUv1D,MAGnB,CACb,CACJ,KACK,IAAIy7E,GAAY5tE,GACjB,MAEC,CACD,IAAIowC,EAAOpwC,EAAK4nD,gBAChB,KAAOxX,GAAQo9B,GAAYp9B,IACvBs9B,EAAW1tE,EAAK6zB,WAChB85C,EAAapU,EAASnpB,GACtBA,EAAOA,EAAKwX,gBAEhB,GAAKxX,EAODpwC,EAAOowC,EACPzqC,EAAS4nE,GAAQvtE,OARV,CAEP,GADAA,EAAOA,EAAK6zB,WACR7zB,GAAQ0L,EAAK2mB,IACb,MACJ1sB,EAAS,CACb,CAKJ,EAEAy9D,EACAyK,GAAYniE,EAAM1L,EAAM2F,GACnB+nE,GACLG,GAAYniE,EAAMgiE,EAAUC,EACpC,CA5DqBG,CAAuBpiE,GAAQqiE,GAAsBriE,EAC1E,CA8DA,SAASqiE,GAAsBriE,GAC3B,IAAI8+B,EAAM9+B,EAAK67D,oBACXvnE,EAAOwqC,EAAIgwB,UAAW70D,EAAS6kC,EAAIiwB,YACvC,IAAKz6D,EACD,OACJ,IACI0tE,EAAUC,EADVnP,EAAM+O,GAAQvtE,GAElB,OACI,GAAI2F,EAAS64D,EAAK,CACd,GAAqB,GAAjBx+D,EAAKkiC,SACL,MAEJ,IAAIsrC,GADQxtE,EAAKupD,WAAW5jD,IAMxB,MAJA+nE,EAAW1tE,EACX2tE,IAAehoE,CAIvB,KACK,IAAIioE,GAAY5tE,GACjB,MAEC,CACD,IAAI4D,EAAO5D,EAAKmoD,YAChB,KAAOvkD,GAAQ4pE,GAAY5pE,IACvB8pE,EAAW9pE,EAAKiwB,WAChB85C,EAAapU,EAAS31D,GAAQ,EAC9BA,EAAOA,EAAKukD,YAEhB,GAAKvkD,EAOD5D,EAAO4D,EACP+B,EAAS,EACT64D,EAAM+O,GAAQvtE,OATP,CAEP,GADAA,EAAOA,EAAK6zB,WACR7zB,GAAQ0L,EAAK2mB,IACb,MACJ1sB,EAAS64D,EAAM,CACnB,CAMJ,EAEAkP,GACAG,GAAYniE,EAAMgiE,EAAUC,EACpC,CACA,SAASC,GAAYv7C,GACjB,IAAIr4B,EAAOq4B,EAAIgoC,WACf,OAAOrgE,GAAQA,EAAKgG,MAAQhG,EAAKgG,KAAKmqC,OAC1C,CACA,SAAS0jC,GAAYniE,EAAM1L,EAAM2F,GAC7B,IAAI6kC,EAAM9+B,EAAKugE,eACf,GAAI3R,EAAmB9vB,GAAM,CACzB,IAAInI,EAAQ57B,SAASmzD,cACrBv3B,EAAMw3B,OAAO75D,EAAM2F,GACnB08B,EAAMy3B,SAAS95D,EAAM2F,GACrB6kC,EAAIm5B,kBACJn5B,EAAIkR,SAASrZ,EACjB,MACSmI,EAAI31C,QACT21C,EAAI31C,OAAOmL,EAAM2F,GAErB+F,EAAKigE,YAAYG,kBACjB,IAAI,MAAEzgE,GAAUK,EAEhBhT,YAAW,KACHgT,EAAKL,OAASA,GACdigE,GAAe5/D,EAAK,GACzB,GACP,CACA,SAASsiE,GAActiE,EAAMyM,GACzB,IAAI26B,EAAOpnC,EAAKL,MAAMiT,IAAI1hB,QAAQub,GAClC,IAAMk+B,IAAU+kB,GAAYtoB,EAAKxwB,OAAO2pB,cAAe,CACnD,IAAI2xB,EAASlyD,EAAK40D,YAAYnoD,GAC9B,GAAIA,EAAM26B,EAAKxyC,QAAS,CACpB,IAAIiB,EAASmK,EAAK40D,YAAYnoD,EAAM,GAChC81D,GAAO1sE,EAAO4rB,IAAM5rB,EAAOm6D,QAAU,EACzC,GAAIuS,EAAMrQ,EAAOzwC,KAAO8gD,EAAMrQ,EAAOlC,QAAUvlE,KAAK+3E,IAAI3sE,EAAOL,KAAO08D,EAAO18D,MAAQ,EACjF,OAAOK,EAAOL,KAAO08D,EAAO18D,KAAO,MAAQ,KACnD,CACA,GAAIiX,EAAM26B,EAAKryC,MAAO,CAClB,IAAIsN,EAAQrC,EAAK40D,YAAYnoD,EAAM,GAC/B81D,GAAOlgE,EAAMof,IAAMpf,EAAM2tD,QAAU,EACvC,GAAIuS,EAAMrQ,EAAOzwC,KAAO8gD,EAAMrQ,EAAOlC,QAAUvlE,KAAK+3E,IAAIngE,EAAM7M,KAAO08D,EAAO18D,MAAQ,EAChF,OAAO6M,EAAM7M,KAAO08D,EAAO18D,KAAO,MAAQ,KAClD,CACJ,CAEA,MAAmB,OADJkmE,iBAAiB17D,EAAK2mB,KAAK87C,UACf,MAAQ,KACvC,CAIA,SAASC,GAAiB1iE,EAAMohD,EAAKugB,GACjC,IAAI7iC,EAAM9+B,EAAKL,MAAMyuB,UACrB,GAAI0Q,aAAe,OAAkBA,EAAI5R,OAASy0C,EAAKvrD,QAAQ,MAAQ,EACnE,OAAO,EACX,GAAIw0B,GAAO+2B,EAAKvrD,QAAQ,MAAQ,EAC5B,OAAO,EACX,IAAI,MAAE+kB,EAAK,IAAEyC,GAAQkB,EACrB,IAAK3D,EAAMvkB,OAAO2pB,eAAiBvgC,EAAK4pC,eAAewX,EAAM,EAAI,KAAO,QAAS,CAC7E,IAAIlpD,EAAOspE,GAAmBxhE,EAAKL,MAAOyhD,GAC1C,GAAIlpD,GAASA,aAAgB,KACzB,OAAOvL,GAAMqT,EAAM9H,EAC3B,CACA,IAAKijC,EAAMvkB,OAAO2pB,cAAe,CAC7B,IAAIkC,EAAO2e,EAAM,EAAIjmB,EAAQyC,EACzB+kC,EAAS7jC,aAAe,KAAe,UAAe2D,EAAM2e,GAAO,cAAmB3e,EAAM2e,GAChG,QAAOuhB,GAASh2E,GAAMqT,EAAM2iE,EAChC,CACA,OAAO,CACX,CACA,SAASC,GAA2B5iE,EAAMohD,GACtC,KAAMphD,EAAKL,MAAMyuB,qBAAqB,MAClC,OAAO,EACX,IAAI,MAAE4b,EAAK,QAAE1P,EAAO,MAAEpN,GAAUltB,EAAKL,MAAMyuB,UAC3C,IAAK4b,EAAMtL,WAAWpE,GAClB,OAAO,EACX,IAAKpN,EACD,OAAO,EACX,GAAIltB,EAAK4pC,eAAewX,EAAM,EAAI,UAAY,YAC1C,OAAO,EACX,IAAI9gB,GAAY0J,EAAMkG,aAAekR,EAAM,EAAIpX,EAAMlT,WAAakT,EAAM9L,WACxE,GAAIoC,IAAaA,EAASxe,OAAQ,CAC9B,IAAI2M,EAAKzuB,EAAKL,MAAM8uB,GAMpB,OALI2yB,EAAM,EACN3yB,EAAGrF,OAAO4gB,EAAMv9B,IAAM6zB,EAASjG,SAAU2P,EAAMv9B,KAE/CgiB,EAAGrF,OAAO4gB,EAAMv9B,IAAKu9B,EAAMv9B,IAAM6zB,EAASjG,UAC9Cr6B,EAAK2oB,SAAS8F,IACP,CACX,CACA,OAAO,CACX,CACA,SAASo0C,GAAe7iE,EAAM1L,EAAMqL,GAChCK,EAAKigE,YAAYxH,OACjBnkE,EAAKouC,gBAAkB/iC,EACvBK,EAAKigE,YAAYrrE,OACrB,CAoEA,SAASkuE,GAAsB9iE,EAAMvU,GACjCuU,EAAK+wD,SAAS,mBAAmB5sC,IAAO14B,EAAQ04B,EAAE14B,EAAOuU,EAAK,IAC9D,IAAI/D,EAAU,IAAI,QAAE3V,EAAO,UAAEmoD,EAAS,QAAEC,GAAYjjD,EACpD,KAAOgjD,EAAY,GAAKC,EAAU,GAA2B,GAAtBpoD,EAAQyyC,YAAoD,GAAjCzyC,EAAQ81C,WAAWrD,YAAiB,CAClG0V,IACAC,IACA,IAAIp6C,EAAOhO,EAAQ81C,WACnBngC,EAAQ3U,KAAKgN,EAAKtJ,KAAKpC,KAAM0L,EAAKqtB,OAASrtB,EAAKtJ,KAAKumD,aAAej9C,EAAKqtB,MAAQ,MACjFr7B,EAAUgO,EAAKhO,OACnB,CACA,IAAIy8E,EAAa/iE,EAAK+wD,SAAS,wBAA0B,gBAAyB/wD,EAAKL,MAAMqiB,QACzFpP,EAAMowD,KAAezkD,EAAO3L,EAAIpL,cAAc,OAClD+W,EAAKsJ,YAAYk7C,EAAWzjB,kBAAkBh5D,EAAS,CAAEyU,SAAU6X,KACnE,IAAkC0pD,EAA9BlgC,EAAa7d,EAAK6d,WAAuB0wB,EAAW,EACxD,KAAO1wB,GAAqC,GAAvBA,EAAW5F,WAAkB8lC,EAAY2G,GAAQ7mC,EAAW4e,SAASp3C,iBAAiB,CACvG,IAAK,IAAIjd,EAAI21E,EAAU71E,OAAS,EAAGE,GAAK,EAAGA,IAAK,CAC5C,IAAIq4E,EAAUpsD,EAAIpL,cAAc80D,EAAU31E,IAC1C,KAAO43B,EAAK6d,YACR4iC,EAAQn3C,YAAYtJ,EAAK6d,YAC7B7d,EAAKsJ,YAAYm3C,GACjBlS,GACJ,CACA1wB,EAAa7d,EAAK6d,UACtB,CAKA,OAJIA,GAAqC,GAAvBA,EAAW5F,UACzB4F,EAAWrU,aAAa,gBAAiB,GAAG0mB,KAAaC,IAAUoe,EAAW,KAAKA,IAAa,MAAM9wC,KAAKC,UAAUhgB,MAGlH,CAAE0qB,IAAKpI,EAAM5gB,KAFTqC,EAAK+wD,SAAS,2BAA2B5sC,GAAKA,EAAE14B,EAAOuU,MAC9DvU,EAAMnF,QAAQ49C,YAAY,EAAGz4C,EAAMnF,QAAQ8Q,KAAM,QAEzD,CAEA,SAAS8rE,GAAmBljE,EAAMrC,EAAMyQ,EAAM+0D,EAAWrkB,GACrD,IACIn4B,EAAKl7B,EADL23E,EAAStkB,EAASloC,OAAO5rB,KAAKo3B,KAAK1sB,KAEvC,IAAK0Y,IAASzQ,EACV,OAAO,KACX,IAAI0lE,EAAS1lE,IAASwlE,GAAaC,IAAWh1D,GAC9C,GAAIi1D,EAAQ,CAER,GADArjE,EAAK+wD,SAAS,uBAAuB5sC,IAAOxmB,EAAOwmB,EAAExmB,EAAMylE,GAAUD,EAAWnjE,EAAK,IACjFojE,EACA,OAAOzlE,EAAO,IAAI,KAAM,UAAcqC,EAAKL,MAAMqiB,OAAOrkB,KAAKA,EAAKrS,QAAQ,SAAU,QAAS,EAAG,GAAK,WACzG,IAAIg4E,EAAStjE,EAAK+wD,SAAS,uBAAuB5sC,GAAKA,EAAExmB,EAAMmhD,EAAUqkB,EAAWnjE,KACpF,GAAIsjE,EACA73E,EAAQ63E,MAEP,CACD,IAAIvhD,EAAQ+8B,EAAS/8B,SACjB,OAAEC,GAAWhiB,EAAKL,MAAOojE,EAAa,gBAAyB/gD,GACnE2E,EAAM5rB,SAASyM,cAAc,OAC7B7J,EAAKib,MAAM,iBAAiBjlB,SAAQuqD,IAChC,IAAIt7B,EAAI+D,EAAIkB,YAAY9sB,SAASyM,cAAc,MAC3C02C,GACAt7B,EAAEiF,YAAYk7C,EAAWhjB,cAAc/9B,EAAOrkB,KAAKugD,EAAOn8B,IAAQ,GAE9E,CACJ,MAEI/hB,EAAK+wD,SAAS,uBAAuB5sC,IAAO/V,EAAO+V,EAAE/V,EAAMpO,EAAK,IAChE2mB,EA8IR,SAAkBvY,GACd,IAAIm1D,EAAQ,sBAAsBlxD,KAAKjE,GACnCm1D,IACAn1D,EAAOA,EAAK3iB,MAAM83E,EAAM,GAAG98E,SAC/B,IAC8C83B,EAD1CgP,EAAMy1C,KAAcx7D,cAAc,OAClCg8D,EAAW,mBAAmBnxD,KAAKjE,GAIvC,IAHImQ,EAAOilD,GAAYP,GAAQO,EAAS,GAAG5/D,kBACvCwK,EAAOmQ,EAAKn4B,KAAI26B,GAAK,IAAMA,EAAI,MAAKr6B,KAAK,IAAM0nB,EAAOmQ,EAAKn4B,KAAI26B,GAAK,KAAOA,EAAI,MAAKkO,UAAUvoC,KAAK,KACvG6mC,EAAI5lB,UAAYyG,EACZmQ,EACA,IAAK,IAAI53B,EAAI,EAAGA,EAAI43B,EAAK93B,OAAQE,IAC7B4mC,EAAMA,EAAI7F,cAAcnJ,EAAK53B,KAAO4mC,EAC5C,OAAOA,CACX,CA3Jck2C,CAASr1D,GACXwhD,GAgKZ,SAA+BjpC,GAC3B,IAAI1E,EAAQ0E,EAAI+8C,iBAAiB/4B,EAAS,iCAAmC,8BAC7E,IAAK,IAAIhkD,EAAI,EAAGA,EAAIs7B,EAAMx7B,OAAQE,IAAK,CACnC,IAAI2N,EAAO2tB,EAAMt7B,GACa,GAA1B2N,EAAKupD,WAAWp3D,QAAmC,KAApB6N,EAAKuT,aAA2BvT,EAAK6zB,YACpE7zB,EAAK6zB,WAAWF,aAAatB,EAAIy2B,cAAcC,eAAe,KAAM/oD,EAC5E,CACJ,CAtKYqvE,CAAsBh9C,GAE9B,IAAIi9C,EAAcj9C,GAAOA,EAAIe,cAAc,mBACvCm8C,EAAYD,GAAe,gCAAgCvxD,KAAKuxD,EAAY3pC,aAAa,kBAAoB,IACjH,GAAI4pC,GAAaA,EAAU,GACvB,IAAK,IAAIl9E,GAAKk9E,EAAU,GAAIl9E,EAAI,EAAGA,IAAK,CACpC,IAAIsyB,EAAQ0N,EAAIyV,WAChB,KAAOnjB,GAA2B,GAAlBA,EAAMud,UAClBvd,EAAQA,EAAMwjC,YAClB,IAAKxjC,EACD,MACJ0N,EAAM1N,CACV,CACJ,IAAKxtB,EAAO,CACR,IAAImM,EAASoI,EAAK+wD,SAAS,oBAAsB/wD,EAAK+wD,SAAS,cAAgB,gBAAqB/wD,EAAKL,MAAMqiB,QAC/Gv2B,EAAQmM,EAAO6/C,WAAW9wB,EAAK,CAC3BsV,sBAAuBonC,IAAUQ,GACjC5nE,QAAS6iD,EACTnC,aAAah2B,GACW,MAAhBA,EAAIq0B,UAAqBr0B,EAAI81B,cAC7B91B,EAAIwB,YAAe27C,GAAct4E,KAAKm7B,EAAIwB,WAAW6yB,UAElD,KADI,CAAEhD,QAAQ,IAIjC,CACA,GAAI6rB,EACAp4E,EA4IR,SAAoBA,EAAOwQ,GACvB,IAAKxQ,EAAM2L,KACP,OAAO3L,EACX,IAAmD0kC,EAA/CnO,EAASv2B,EAAMnF,QAAQ81C,WAAWpxC,KAAKg3B,OAC3C,IACImO,EAAQnU,KAAKhK,MAAM/V,EACvB,CACA,MAAOtL,GACH,OAAOlF,CACX,CACA,IAAI,QAAEnF,EAAO,UAAEmoD,EAAS,QAAEC,GAAYjjD,EACtC,IAAK,IAAI9E,EAAIwpC,EAAM1pC,OAAS,EAAGE,GAAK,EAAGA,GAAK,EAAG,CAC3C,IAAIqE,EAAOg3B,EAAOC,MAAMkO,EAAMxpC,IAC9B,IAAKqE,GAAQA,EAAKy8C,mBACd,MACJnhD,EAAU,UAAc0E,EAAKmW,OAAOgvB,EAAMxpC,EAAI,GAAIL,IAClDmoD,IACAC,GACJ,CACA,OAAO,IAAI,KAAMpoD,EAASmoD,EAAWC,EACzC,CAhKgBq1B,CAAWC,GAAWv4E,GAAQo4E,EAAU,IAAKA,EAAU,IAAKA,EAAU,SAI9E,GADAp4E,EAAQ,aAoBhB,SAA2B4kB,EAAUyuC,GACjC,GAAIzuC,EAAS0oB,WAAa,EACtB,OAAO1oB,EACX,IAAK,IAAImC,EAAIssC,EAASrvC,MAAO+C,GAAK,EAAGA,IAAK,CACtC,IAEIyxD,EADA/xD,EADS4sC,EAASxqD,KAAKke,GACRysB,eAAe6f,EAASpqD,MAAM8d,IACnCzmB,EAAS,GAmBvB,GAlBAskB,EAAS1c,SAAQW,IACb,IAAKvI,EACD,OACJ,IAA0Cm4E,EAAtC3lD,EAAOrM,EAAMg2B,aAAa5zC,EAAKtJ,MACnC,IAAKuzB,EACD,OAAOxyB,EAAS,KACpB,GAAIm4E,EAASn4E,EAAOtF,QAAUw9E,EAASx9E,QAAU09E,GAAa5lD,EAAM0lD,EAAU3vE,EAAMvI,EAAOA,EAAOtF,OAAS,GAAI,GAC3GsF,EAAOA,EAAOtF,OAAS,GAAKy9E,MAE3B,CACGn4E,EAAOtF,SACPsF,EAAOA,EAAOtF,OAAS,GAAK29E,GAAWr4E,EAAOA,EAAOtF,OAAS,GAAIw9E,EAASx9E,SAC/E,IAAI49E,EAAUC,GAAahwE,EAAMiqB,GACjCxyB,EAAOzE,KAAK+8E,GACZnyD,EAAQA,EAAMi2B,UAAUk8B,EAAQr5E,MAChCi5E,EAAW1lD,CACf,KAEAxyB,EACA,OAAO,UAAcA,EAC7B,CACA,OAAOskB,CACX,CAjD8Bk0D,CAAkB94E,EAAMnF,QAASw4D,IAAW,GAC9DrzD,EAAMgjD,WAAahjD,EAAMijD,QAAS,CAClC,IAAID,EAAY,EAAGC,EAAU,EAC7B,IAAK,IAAIp6C,EAAO7I,EAAMnF,QAAQ81C,WAAYqS,EAAYhjD,EAAMgjD,YAAcn6C,EAAKtJ,KAAKo3B,KAAKua,UAAW8R,IAAan6C,EAAOA,EAAK8nC,YAC7H,IAAK,IAAI9nC,EAAO7I,EAAMnF,QAAQ0yC,UAAW0V,EAAUjjD,EAAMijD,UAAYp6C,EAAKtJ,KAAKo3B,KAAKua,UAAW+R,IAAWp6C,EAAOA,EAAK0kC,WACtHvtC,EAAQu4E,GAAWv4E,EAAOgjD,EAAWC,EACzC,CAGJ,OADA1uC,EAAK+wD,SAAS,mBAAmB5sC,IAAO14B,EAAQ04B,EAAE14B,EAAOuU,EAAK,IACvDvU,CACX,CACA,MAAMq4E,GAAgB,gHAuCtB,SAASQ,GAAahwE,EAAMiqB,EAAMrpB,EAAO,GACrC,IAAK,IAAIvO,EAAI43B,EAAK93B,OAAS,EAAGE,GAAKuO,EAAMvO,IACrC2N,EAAOiqB,EAAK53B,GAAGwa,OAAO,KAAM,UAAc7M,IAC9C,OAAOA,CACX,CAGA,SAAS6vE,GAAa5lD,EAAM0lD,EAAU3vE,EAAMkwE,EAAS/0D,GACjD,GAAIA,EAAQ8O,EAAK93B,QAAUgpB,EAAQw0D,EAASx9E,QAAU83B,EAAK9O,IAAUw0D,EAASx0D,GAAQ,CAClF,IAAIoe,EAAQs2C,GAAa5lD,EAAM0lD,EAAU3vE,EAAMkwE,EAAQxrC,UAAWvpB,EAAQ,GAC1E,GAAIoe,EACA,OAAO22C,EAAQn7E,KAAKm7E,EAAQl+E,QAAQ2hC,aAAau8C,EAAQzrC,WAAa,EAAGlL,IAE7E,GADY22C,EAAQvlC,eAAeulC,EAAQzrC,YACjCoP,UAAU14B,GAAS8O,EAAK93B,OAAS,EAAI6N,EAAKtJ,KAAOuzB,EAAK9O,EAAQ,IACpE,OAAO+0D,EAAQn7E,KAAKm7E,EAAQl+E,QAAQqmC,OAAO,UAAc23C,GAAahwE,EAAMiqB,EAAM9O,EAAQ,KAClG,CACJ,CACA,SAAS20D,GAAW9vE,EAAMmb,GACtB,GAAa,GAATA,EACA,OAAOnb,EACX,IAAI+b,EAAW/b,EAAKhO,QAAQ2hC,aAAa3zB,EAAKykC,WAAa,EAAGqrC,GAAW9vE,EAAK0kC,UAAWvpB,EAAQ,IAC7FmrB,EAAOtmC,EAAK2qC,eAAe3qC,EAAKykC,YAAYib,WAAW,YAAgB,GAC3E,OAAO1/C,EAAKjL,KAAKgnB,EAASsc,OAAOiO,GACrC,CACA,SAAS6pC,GAAWp0D,EAAUoyB,EAAMvtC,EAAM+3B,EAAIxd,EAAOi/B,GACjD,IAAIp6C,EAAOmuC,EAAO,EAAIpyB,EAAS+rB,WAAa/rB,EAAS2oB,UAAWnL,EAAQv5B,EAAKhO,QAQ7E,OAPI+pB,EAAS0oB,WAAa,IACtB2V,EAAU,GACVj/B,EAAQwd,EAAK,IACbY,EAAQ42C,GAAW52C,EAAO4U,EAAMvtC,EAAM+3B,EAAIxd,EAAQ,EAAGi/B,IACrDj/B,GAASva,IACT24B,EAAQ4U,EAAO,EAAInuC,EAAK2qC,eAAe,GAAG+U,WAAWnmB,EAAO6gB,GAAWj/B,GAAOkd,OAAOkB,GAC/EA,EAAMlB,OAAOr4B,EAAK2qC,eAAe3qC,EAAKykC,YAAYib,WAAW,YAAgB,KAChF3jC,EAAS4X,aAAawa,EAAO,EAAI,EAAIpyB,EAAS0oB,WAAa,EAAGzkC,EAAKjL,KAAKwkC,GACnF,CACA,SAASm2C,GAAWv4E,EAAOgjD,EAAWC,GAKlC,OAJID,EAAYhjD,EAAMgjD,YAClBhjD,EAAQ,IAAI,KAAMg5E,GAAWh5E,EAAMnF,SAAU,EAAGmoD,EAAWhjD,EAAMgjD,UAAW,EAAGhjD,EAAMijD,SAAUD,EAAWhjD,EAAMijD,UAChHA,EAAUjjD,EAAMijD,UAChBjjD,EAAQ,IAAI,KAAMg5E,GAAWh5E,EAAMnF,QAAS,EAAGooD,EAASjjD,EAAMijD,QAAS,EAAG,GAAIjjD,EAAMgjD,UAAWC,IAC5FjjD,CACX,CAIA,MAAMw3E,GAAU,CACZyB,MAAO,CAAC,SACRC,MAAO,CAAC,SACR5qB,MAAO,CAAC,SACR6qB,QAAS,CAAC,SACVC,SAAU,CAAC,SACXC,IAAK,CAAC,QAAS,YACfr2C,GAAI,CAAC,QAAS,SACds2C,GAAI,CAAC,QAAS,QAAS,MACvBC,GAAI,CAAC,QAAS,QAAS,OAE3B,IAAIC,GAAe,KACnB,SAASjC,KACL,OAAOiC,KAAiBA,GAAelqE,SAASmqE,eAAeC,mBAAmB,SACtF,CAoDA,MAAMjsD,GAAW,CAAC,EACZksD,GAAe,CAAC,EAChBC,GAAkB,CAAEC,YAAY,EAAMC,WAAW,GACvD,MAAMC,GACFh9E,cACIrC,KAAKklD,UAAW,EAChBllD,KAAK25E,UAAY,KACjB35E,KAAKs/E,YAAc,KACnBt/E,KAAKu/E,gBAAkB,EACvBv/E,KAAKw/E,UAAY,CAAEn5E,KAAM,EAAGm0B,EAAG,EAAG+C,EAAG,EAAG14B,KAAM,IAC9C7E,KAAKy/E,oBAAsB,KAC3Bz/E,KAAK0/E,kBAAoB,EACzB1/E,KAAK2/E,aAAe,EACpB3/E,KAAK4/E,6BAA+B,EACpC5/E,KAAK6/E,UAAY,EACjB7/E,KAAK8/E,UAAY,EACjB9/E,KAAK+/E,kBAAoB,EACzB//E,KAAK88C,WAAY,EACjB98C,KAAKggF,kBAAoB,EACzBhgF,KAAKg2E,iBAAmB,GACxBh2E,KAAKigF,oBAAsB,IAC3BjgF,KAAKkgF,cAAgB,EACrBlgF,KAAKmgF,eAAiB,EACtBngF,KAAKogF,cAAgB/+E,OAAO2Z,OAAO,MACnChb,KAAK66E,mBAAqB,IAC9B,EAkBJ,SAASwF,GAAmBxmE,EAAMma,GAC9Bna,EAAKrN,MAAMizE,oBAAsBzrD,EACjCna,EAAKrN,MAAMkzE,kBAAoB/6E,KAAKD,KACxC,CAQA,SAAS47E,GAAgBzmE,GACrBA,EAAK+wD,SAAS,mBAAmB2V,IAC7B,IAAK,IAAI17E,KAAQ07E,EACR1mE,EAAKrN,MAAM4zE,cAAcv7E,IAC1BgV,EAAK2mB,IAAIyE,iBAAiBpgC,EAAMgV,EAAKrN,MAAM4zE,cAAcv7E,GAAQuQ,GAASorE,GAAiB3mE,EAAMzE,GAAO,GAExH,CACA,SAASorE,GAAiB3mE,EAAMzE,GAC5B,OAAOyE,EAAK+wD,SAAS,mBAAmB73C,IACpC,IAAIjI,EAAUiI,EAAS3d,EAAMvQ,MAC7B,QAAOimB,IAAUA,EAAQjR,EAAMzE,IAAUA,EAAMqrE,iBAAwB,GAE/E,CACA,SAASC,GAAmB7mE,EAAMzE,GAC9B,IAAKA,EAAMurE,QACP,OAAO,EACX,GAAIvrE,EAAMqrE,iBACN,OAAO,EACX,IAAK,IAAItyE,EAAOiH,EAAM7S,OAAQ4L,GAAQ0L,EAAK2mB,IAAKryB,EAAOA,EAAK6zB,WACxD,IAAK7zB,GAAyB,IAAjBA,EAAKkiC,UACbliC,EAAKq6D,YAAcr6D,EAAKq6D,WAAW4H,UAAUh7D,GAC9C,OAAO,EACf,OAAO,CACX,CA8DA,SAASwrE,GAAYxrE,GAAS,MAAO,CAAE/F,KAAM+F,EAAMg6B,QAAS9T,IAAKlmB,EAAMi6B,QAAW,CAKlF,SAASwxC,GAAoBhnE,EAAMinE,EAAUx6D,EAAK/K,EAAQnG,GACtD,IAAe,GAAXmG,EACA,OAAO,EACX,IAAI0lC,EAAOpnC,EAAKL,MAAMiT,IAAI1hB,QAAQwQ,GAClC,IAAK,IAAI/a,EAAIygD,EAAK33B,MAAQ,EAAG9oB,EAAI,EAAGA,IAChC,GAAIqZ,EAAK+wD,SAASkW,GAAU9iD,GAAKx9B,EAAIygD,EAAK33B,MAAQ0U,EAAEnkB,EAAMyM,EAAK26B,EAAKlJ,UAAWkJ,EAAKvxC,OAAOlP,GAAI4U,GAAO,GAChG4oB,EAAEnkB,EAAMyM,EAAK26B,EAAK9yC,KAAK3N,GAAIygD,EAAKvxC,OAAOlP,GAAI4U,GAAO,KACpD,OAAO,EAEf,OAAO,CACX,CACA,SAAS2rE,GAAgBlnE,EAAMouB,EAAWjU,GACjCna,EAAKmnE,SACNnnE,EAAK40B,QACT,IAAInG,EAAKzuB,EAAKL,MAAM8uB,GAAG2D,aAAahE,GACtB,WAAVjU,GACAsU,EAAG4D,QAAQ,WAAW,GAC1BryB,EAAK2oB,SAAS8F,EAClB,CA0CA,SAAS24C,GAAkBpnE,EAAMyM,EAAK/K,EAAQnG,GAC1C,OAAOyrE,GAAoBhnE,EAAM,sBAAuByM,EAAK/K,EAAQnG,IACjEyE,EAAK+wD,SAAS,qBAAqB5sC,GAAKA,EAAEnkB,EAAMyM,EAAKlR,IAC7D,CACA,SAAS8rE,GAAkBrnE,EAAMyM,EAAK/K,EAAQnG,GAC1C,OAAOyrE,GAAoBhnE,EAAM,sBAAuByM,EAAK/K,EAAQnG,IACjEyE,EAAK+wD,SAAS,qBAAqB5sC,GAAKA,EAAEnkB,EAAMyM,EAAKlR,MAG7D,SAA4ByE,EAAM0B,EAAQnG,GACtC,GAAoB,GAAhBA,EAAM+rE,OACN,OAAO,EACX,IAAI10D,EAAM5S,EAAKL,MAAMiT,IACrB,IAAe,GAAXlR,EACA,QAAIkR,EAAI2tB,gBACJ2mC,GAAgBlnE,EAAM,YAAqB4S,EAAK,EAAGA,EAAItsB,QAAQ8Q,MAAO,YAC/D,GAIf,IAAIgwC,EAAOx0B,EAAI1hB,QAAQwQ,GACvB,IAAK,IAAI/a,EAAIygD,EAAK33B,MAAQ,EAAG9oB,EAAI,EAAGA,IAAK,CACrC,IAAI2N,EAAO3N,EAAIygD,EAAK33B,MAAQ23B,EAAKlJ,UAAYkJ,EAAK9yC,KAAK3N,GACnDi7E,EAAUx6B,EAAKvxC,OAAOlP,GAC1B,GAAI2N,EAAKisC,cACL2mC,GAAgBlnE,EAAM,YAAqB4S,EAAKgvD,EAAU,EAAGA,EAAU,EAAIttE,EAAKhO,QAAQ8Q,MAAO,eAC9F,KAAI,kBAA2B9C,GAGhC,SAFA4yE,GAAgBlnE,EAAM,YAAqB4S,EAAKgvD,GAAU,UAElD,CACZ,OAAO,CACX,CACJ,CAzBQ2F,CAAmBvnE,EAAM0B,EAAQnG,EACzC,CAyBA,SAASisE,GAAcxnE,GACnB,OAAOynE,GAAeznE,EAC1B,CA5JAolE,GAAasC,QAAU,CAAC1nE,EAAM2nE,KAC1B,IAAIpsE,EAAQosE,EAEZ,GADA3nE,EAAKrN,MAAM04C,SAA4B,IAAjB9vC,EAAMkwC,SAAiBlwC,EAAM8vC,UAC/Cu8B,GAAoB5nE,EAAMzE,KAE9ByE,EAAKrN,MAAM8yE,YAAclqE,EAAMkwC,QAC/BzrC,EAAKrN,MAAM+yE,gBAAkB56E,KAAKD,OAI9B8kE,IAAWhlB,GAA2B,IAAjBpvC,EAAMkwC,SAQ/B,GANqB,KAAjBlwC,EAAMkwC,SACNzrC,EAAKigE,YAAY4H,cAKjBpY,GAAwB,IAAjBl0D,EAAMkwC,SAAkBlwC,EAAM4vC,SAAY5vC,EAAM2vC,QAAW3vC,EAAM6vC,QAUnEprC,EAAK+wD,SAAS,iBAAiB5sC,GAAKA,EAAEnkB,EAAMzE,MA1YzD,SAAwByE,EAAMzE,GAC1B,IAAI7F,EAAO6F,EAAMkwC,QAASk2B,EAb9B,SAAiBpmE,GACb,IAAIxP,EAAS,GASb,OARIwP,EAAM4vC,UACNp/C,GAAU,KACVwP,EAAM6vC,UACNr/C,GAAU,KACVwP,EAAM2vC,SACNn/C,GAAU,KACVwP,EAAM8vC,WACNt/C,GAAU,KACPA,CACX,CAEqC+7E,CAAQvsE,GACzC,GAAY,GAAR7F,GAAck1C,GAAe,IAARl1C,GAAsB,KAARisE,EACnC,OAAOiB,GAA2B5iE,GAAO,IAAM+hE,GAAiB/hE,GAAO,GAEtE,GAAY,IAARtK,GAAek1C,GAAe,IAARl1C,GAAsB,KAARisE,EACzC,OAAOiB,GAA2B5iE,EAAM,IAAM+hE,GAAiB/hE,EAAM,GAEpE,GAAY,IAARtK,GAAsB,IAARA,EACnB,OAAO,EAEN,GAAY,IAARA,GAAek1C,GAAe,IAARl1C,GAAsB,KAARisE,EAAc,CACvD,IAAIvgB,EAAc,IAAR1rD,EAAgE,OAAlD4sE,GAActiE,EAAMA,EAAKL,MAAMyuB,UAAUl5B,OAAkB,EAAI,GAAM,EAC7F,OAAOwsE,GAAmB1hE,EAAMohD,EAAKugB,IAASI,GAAiB/hE,EAAMohD,EACzE,CACK,GAAY,IAAR1rD,GAAek1C,GAAe,IAARl1C,GAAsB,KAARisE,EAAc,CACvD,IAAIvgB,EAAc,IAAR1rD,EAAgE,OAAlD4sE,GAActiE,EAAMA,EAAKL,MAAMyuB,UAAUl5B,MAAiB,GAAK,EAAK,EAC5F,OAAOwsE,GAAmB1hE,EAAMohD,EAAKugB,IAASI,GAAiB/hE,EAAMohD,EACzE,CACK,OAAY,IAAR1rD,GAAek1C,GAAe,IAARl1C,GAAsB,KAARisE,EAClCe,GAAiB1iE,GAAO,EAAG2hE,IAASI,GAAiB/hE,GAAO,GAEtD,IAARtK,GAAek1C,GAAe,IAARl1C,GAAsB,KAARisE,EApDjD,SAA4B3hE,GACxB,IAAKwvD,GAAUxvD,EAAKL,MAAMyuB,UAAU4b,MAAM5O,aAAe,EACrD,OAAO,EACX,IAAI,UAAE0zB,EAAS,YAAEC,GAAgB/uD,EAAK67D,oBACtC,GAAI/M,GAAmC,GAAtBA,EAAUt4B,UAAgC,GAAfu4B,GACxCD,EAAU1yB,YAAsD,SAAxC0yB,EAAU1yB,WAAWsG,gBAA4B,CACzE,IAAIzpB,EAAQ61C,EAAU1yB,WACtBymC,GAAe7iE,EAAMiZ,EAAO,QAC5BjsB,YAAW,IAAM61E,GAAe7iE,EAAMiZ,EAAO,UAAU,GAC3D,CACA,OAAO,CACX,CA0Ce8uD,CAAmB/nE,IAAS0iE,GAAiB1iE,EAAM,EAAG2hE,IAASU,GAAsBriE,GAEvF2hE,IAAS/2B,EAAM,IAAM,OACjB,IAARl1C,GAAsB,IAARA,GAAsB,IAARA,GAAsB,IAARA,EAInD,CA4WoEsyE,CAAehoE,EAAMzE,GACjFA,EAAMs4B,iBAGN2yC,GAAmBxmE,EAAM,WAdwD,CACjF,IAAInV,EAAMC,KAAKD,MACfmV,EAAKrN,MAAMmzE,aAAej7E,EAC1BmV,EAAKrN,MAAMozE,4BAA8B/4E,YAAW,KAC5CgT,EAAKrN,MAAMmzE,cAAgBj7E,IAC3BmV,EAAK+wD,SAAS,iBAAiB5sC,GAAKA,EAAEnkB,EAAMkvD,EAAS,GAAI,YACzDlvD,EAAKrN,MAAMmzE,aAAe,EAC9B,GACD,IACP,CAMA,EAEJV,GAAa6C,MAAQ,CAACjoE,EAAMzE,KACH,IAAjBA,EAAMkwC,UACNzrC,EAAKrN,MAAM04C,UAAW,EAAK,EAEnC+5B,GAAa8C,SAAW,CAACloE,EAAM2nE,KAC3B,IAAIpsE,EAAQosE,EACZ,GAAIC,GAAoB5nE,EAAMzE,KAAWA,EAAM4sE,UAC3C5sE,EAAM4vC,UAAY5vC,EAAM2vC,QAAUN,GAAOrvC,EAAM6vC,QAC/C,OACJ,GAAIprC,EAAK+wD,SAAS,kBAAkB5sC,GAAKA,EAAEnkB,EAAMzE,KAE7C,YADAA,EAAMs4B,iBAGV,IAAIiL,EAAM9+B,EAAKL,MAAMyuB,UACrB,KAAM0Q,aAAe,MAAmBA,EAAI3D,MAAMuD,WAAWI,EAAIlB,MAAM,CACnE,IAAIjgC,EAAO3K,OAAO6D,aAAa0E,EAAM4sE,UAChC,SAAS38E,KAAKmS,IAAUqC,EAAK+wD,SAAS,mBAAmB5sC,GAAKA,EAAEnkB,EAAM8+B,EAAI3D,MAAM1uB,IAAKqyB,EAAIlB,IAAInxB,IAAK9O,MACnGqC,EAAK2oB,SAAS3oB,EAAKL,MAAM8uB,GAAG4H,WAAW14B,GAAM40B,kBACjDh3B,EAAMs4B,gBACV,GAuGJ,MAAMu0C,GAAqBx9B,EAAM,UAAY,UAC7C1xB,GAASmvD,UAAY,CAACroE,EAAM2nE,KACxB,IAAIpsE,EAAQosE,EACZ3nE,EAAKrN,MAAM04C,SAAW9vC,EAAM8vC,SAC5B,IAAIi9B,EAAUd,GAAcxnE,GACxBnV,EAAMC,KAAKD,MAAOG,EAAO,cACzBH,EAAMmV,EAAKrN,MAAMgzE,UAAUn5E,KAAO,KA1G1C,SAAgB+O,EAAOgtE,GACnB,IAAI1V,EAAK0V,EAAM5nD,EAAIplB,EAAMg6B,QAASizC,EAAKD,EAAM7kD,EAAInoB,EAAMi6B,QACvD,OAAOq9B,EAAKA,EAAK2V,EAAKA,EAAK,GAC/B,CAuGiDC,CAAOltE,EAAOyE,EAAKrN,MAAMgzE,aAAepqE,EAAM6sE,MACtD,eAA7BpoE,EAAKrN,MAAMgzE,UAAU36E,KACrBA,EAAO,cAC2B,eAA7BgV,EAAKrN,MAAMgzE,UAAU36E,OAC1BA,EAAO,gBAEfgV,EAAKrN,MAAMgzE,UAAY,CAAEn5E,KAAM3B,EAAK81B,EAAGplB,EAAMg6B,QAAS7R,EAAGnoB,EAAMi6B,QAASxqC,QACxE,IAAIyhB,EAAMzM,EAAKs1B,YAAYyxC,GAAYxrE,IAClCkR,IAEO,eAARzhB,GACIgV,EAAKrN,MAAMmtE,WACX9/D,EAAKrN,MAAMmtE,UAAUruE,OACzBuO,EAAKrN,MAAMmtE,UAAY,IAAI4I,GAAU1oE,EAAMyM,EAAKlR,IAAS+sE,KAE3C,eAARt9E,EAAwBo8E,GAAoBC,IAAmBrnE,EAAMyM,EAAIA,IAAKA,EAAI/K,OAAQnG,GAChGA,EAAMs4B,iBAGN2yC,GAAmBxmE,EAAM,WAC7B,EAEJ,MAAM0oE,GACFlgF,YAAYwX,EAAMyM,EAAKlR,EAAO+sE,GAU1B,IAAIha,EAAYqa,EAChB,GAVAxiF,KAAK6Z,KAAOA,EACZ7Z,KAAKsmB,IAAMA,EACXtmB,KAAKoV,MAAQA,EACbpV,KAAKmiF,QAAUA,EACfniF,KAAKg6E,sBAAuB,EAC5Bh6E,KAAKyiF,UAAY,KACjBziF,KAAK0iF,SAAW7oE,EAAKL,MAAMiT,IAC3BzsB,KAAKu2E,aAAenhE,EAAM6sE,IAC1BjiF,KAAK45E,aAAexkE,EAAM8vC,SAEtB5+B,EAAI/K,QAAU,EACd4sD,EAAatuD,EAAKL,MAAMiT,IAAI8+B,OAAOjlC,EAAI/K,QACvCinE,EAAYl8D,EAAI/K,WAEf,CACD,IAAI0lC,EAAOpnC,EAAKL,MAAMiT,IAAI1hB,QAAQub,EAAIA,KACtC6hD,EAAalnB,EAAKxwB,OAClB+xD,EAAYvhC,EAAK33B,MAAQ23B,EAAKvxC,SAAW,CAC7C,CACA,MAAMnN,EAAS4/E,EAAU,KAAO/sE,EAAM7S,OAChCi2E,EAAaj2E,EAASsX,EAAKi0D,QAAQC,YAAYxrE,GAAQ,GAAQ,KACrEvC,KAAKuC,OAASi2E,EAAaA,EAAWh4C,IAAM,KAC5C,IAAI,UAAEyH,GAAcpuB,EAAKL,OACL,GAAhBpE,EAAM+rE,QACNhZ,EAAWtjE,KAAKo3B,KAAKqa,YAAiD,IAApC6xB,EAAWtjE,KAAKo3B,KAAKoa,YACvDpO,aAAqB,MAAiBA,EAAUl5B,MAAQyzE,GAAav6C,EAAUnB,GAAK07C,KACpFxiF,KAAKyiF,UAAY,CACbt0E,KAAMg6D,EACN7hD,IAAKk8D,EACLG,WAAY3iF,KAAKuC,QAAWvC,KAAKuC,OAAO+zC,WACxCssC,iBAAkB5iF,KAAKuC,SAAU4mE,GAAUnpE,KAAKuC,OAAO40C,aAAa,sBAExEn3C,KAAKuC,QAAUvC,KAAKyiF,YAAcziF,KAAKyiF,UAAUE,SAAW3iF,KAAKyiF,UAAUG,iBAC3E5iF,KAAK6Z,KAAKigE,YAAYxH,OAClBtyE,KAAKyiF,UAAUE,UACf3iF,KAAKuC,OAAO+zC,WAAY,GACxBt2C,KAAKyiF,UAAUG,eACf/7E,YAAW,KACH7G,KAAK6Z,KAAKrN,MAAMmtE,WAAa35E,MAC7BA,KAAKuC,OAAOq/B,aAAa,kBAAmB,QAAQ,GACzD,IACP5hC,KAAK6Z,KAAKigE,YAAYrrE,SAE1BoL,EAAK3V,KAAK+gC,iBAAiB,UAAWjlC,KAAK6iF,GAAK7iF,KAAK6iF,GAAGhyB,KAAK7wD,OAC7D6Z,EAAK3V,KAAK+gC,iBAAiB,YAAajlC,KAAK2tB,KAAO3tB,KAAK2tB,KAAKkjC,KAAK7wD,OACnEqgF,GAAmBxmE,EAAM,UAC7B,CACAvO,OACItL,KAAK6Z,KAAK3V,KAAKihC,oBAAoB,UAAWnlC,KAAK6iF,IACnD7iF,KAAK6Z,KAAK3V,KAAKihC,oBAAoB,YAAanlC,KAAK2tB,MACjD3tB,KAAKyiF,WAAaziF,KAAKuC,SACvBvC,KAAK6Z,KAAKigE,YAAYxH,OAClBtyE,KAAKyiF,UAAUE,SACf3iF,KAAKuC,OAAOk0E,gBAAgB,aAC5Bz2E,KAAKyiF,UAAUG,eACf5iF,KAAKuC,OAAOk0E,gBAAgB,mBAChCz2E,KAAK6Z,KAAKigE,YAAYrrE,SAEtBzO,KAAKg6E,sBACLnzE,YAAW,IAAM4yE,GAAez5E,KAAK6Z,QACzC7Z,KAAK6Z,KAAKrN,MAAMmtE,UAAY,IAChC,CACAkJ,GAAGztE,GAEC,GADApV,KAAKsL,QACAtL,KAAK6Z,KAAK2mB,IAAI63B,SAASjjD,EAAM7S,QAC9B,OACJ,IAAI+jB,EAAMtmB,KAAKsmB,IACXtmB,KAAK6Z,KAAKL,MAAMiT,KAAOzsB,KAAK0iF,WAC5Bp8D,EAAMtmB,KAAK6Z,KAAKs1B,YAAYyxC,GAAYxrE,KAC5CpV,KAAK8iF,mBAAmB1tE,GACpBpV,KAAK45E,eAAiBtzD,EACtB+5D,GAAmBrgF,KAAK6Z,KAAM,WA9I1C,SAA2BA,EAAMyM,EAAK/K,EAAQnG,EAAOmhE,GACjD,OAAOsK,GAAoBhnE,EAAM,gBAAiByM,EAAK/K,EAAQnG,IAC3DyE,EAAK+wD,SAAS,eAAe5sC,GAAKA,EAAEnkB,EAAMyM,EAAKlR,OAC9CmhE,EA7BT,SAA2B18D,EAAM0B,GAC7B,IAAe,GAAXA,EACA,OAAO,EACX,IAAgCwnE,EAAcC,EAA1CrqC,EAAM9+B,EAAKL,MAAMyuB,UACjB0Q,aAAe,OACfoqC,EAAepqC,EAAIxqC,MACvB,IAAI8yC,EAAOpnC,EAAKL,MAAMiT,IAAI1hB,QAAQwQ,GAClC,IAAK,IAAI/a,EAAIygD,EAAK33B,MAAQ,EAAG9oB,EAAI,EAAGA,IAAK,CACrC,IAAI2N,EAAO3N,EAAIygD,EAAK33B,MAAQ23B,EAAKlJ,UAAYkJ,EAAK9yC,KAAK3N,GACvD,GAAI,kBAA2B2N,GAAO,CAG9B60E,EAFAD,GAAgBpqC,EAAI3D,MAAM1rB,MAAQ,GAClC9oB,GAAKm4C,EAAI3D,MAAM1rB,OAAS23B,EAAKvxC,OAAOipC,EAAI3D,MAAM1rB,MAAQ,IAAMqvB,EAAI3D,MAAM1uB,IAC3D26B,EAAKvxC,OAAOipC,EAAI3D,MAAM1rB,OAEtB23B,EAAKvxC,OAAOlP,GAC3B,KACJ,CACJ,CACA,OAAgB,MAAZwiF,IACAjC,GAAgBlnE,EAAM,YAAqBA,EAAKL,MAAMiT,IAAKu2D,GAAW,YAC/D,EAKf,CAIsBC,CAAkBppE,EAAM0B,GAvC9C,SAA2B1B,EAAM0B,GAC7B,IAAe,GAAXA,EACA,OAAO,EACX,IAAI0lC,EAAOpnC,EAAKL,MAAMiT,IAAI1hB,QAAQwQ,GAASpN,EAAO8yC,EAAKlJ,UACvD,SAAI5pC,GAAQA,EAAKy1C,QAAU,kBAA2Bz1C,MAClD4yE,GAAgBlnE,EAAM,IAAI,KAAconC,GAAO,YACxC,EAGf,CA8BwDiiC,CAAkBrpE,EAAM0B,GAChF,CA4IiB4nE,CAAkBnjF,KAAK6Z,KAAMyM,EAAIA,IAAKA,EAAI/K,OAAQnG,EAAOpV,KAAKu2E,YACnEnhE,EAAMs4B,iBAEe,GAAhBt4B,EAAM+rE,SACVnhF,KAAKmiF,SAED9Y,GAAUrpE,KAAKyiF,YAAcziF,KAAKyiF,UAAUt0E,KAAKy1C,QAQjDY,IAAWxkD,KAAK6Z,KAAKL,MAAMyuB,UAAU0zB,SAClCr3D,KAAKG,IAAIH,KAAK+3E,IAAI/1D,EAAIA,IAAMtmB,KAAK6Z,KAAKL,MAAMyuB,UAAUl5B,MAAOzK,KAAK+3E,IAAI/1D,EAAIA,IAAMtmB,KAAK6Z,KAAKL,MAAMyuB,UAAUnB,MAAQ,IAC1Hi6C,GAAgB/gF,KAAK6Z,KAAM,UAAe7Z,KAAK6Z,KAAKL,MAAMiT,IAAI1hB,QAAQub,EAAIA,MAAO,WACjFlR,EAAMs4B,kBAGN2yC,GAAmBrgF,KAAK6Z,KAAM,UAEtC,CACA8T,KAAKvY,GACDpV,KAAK8iF,mBAAmB1tE,GACxBirE,GAAmBrgF,KAAK6Z,KAAM,WACT,GAAjBzE,EAAMguE,SACNpjF,KAAKsL,MACb,CACAw3E,mBAAmB1tE,IACVpV,KAAK45E,eAAiBt1E,KAAK+3E,IAAIr8E,KAAKoV,MAAMolB,EAAIplB,EAAMg6B,SAAW,GAChE9qC,KAAK+3E,IAAIr8E,KAAKoV,MAAMmoB,EAAInoB,EAAMi6B,SAAW,KACzCrvC,KAAK45E,cAAe,EAC5B,EAYJ,SAAS6H,GAAoB5nE,EAAMzE,GAC/B,QAAIyE,EAAKijC,cAYLusB,GAAU/kE,KAAK+3E,IAAIjnE,EAAMiuE,UAAYxpE,EAAKrN,MAAMyzE,oBAAsB,OACtEpmE,EAAKrN,MAAMyzE,oBAAsB,KAC1B,EAGf,CA5BAltD,GAASosD,WAAatlE,IAClBA,EAAKrN,MAAMszE,UAAYn7E,KAAKD,MAC5B28E,GAAcxnE,GACdwmE,GAAmBxmE,EAAM,UAAU,EAEvCkZ,GAASqsD,UAAYvlE,IACjBA,EAAKrN,MAAMszE,UAAYn7E,KAAKD,MAC5B27E,GAAmBxmE,EAAM,UAAU,EAEvCkZ,GAASuwD,YAAczpE,GAAQwnE,GAAcxnE,GAqB7C,MAAM0pE,GAAqB/Z,EAAU,KAAQ,EA+C7C,SAASga,GAAmB3pE,EAAM4pE,GAC9Bt8E,aAAa0S,EAAKrN,MAAMwzE,kBACpByD,GAAS,IACT5pE,EAAKrN,MAAMwzE,iBAAmBn5E,YAAW,IAAMy6E,GAAeznE,IAAO4pE,GAC7E,CACA,SAASC,GAAiB7pE,GAKtB,IAJIA,EAAKijC,YACLjjC,EAAKrN,MAAMswC,WAAY,EACvBjjC,EAAKrN,MAAMyzE,mBAKnB,WACI,IAAI7qE,EAAQR,SAASo0D,YAAY,SAEjC,OADA5zD,EAAM6zD,UAAU,SAAS,GAAM,GACxB7zD,EAAMiuE,SACjB,CATwCM,IAE7B9pE,EAAKrN,MAAMwpE,iBAAiB11E,OAAS,GACxCuZ,EAAKrN,MAAMwpE,iBAAiBx/D,MAAM67D,kBAC1C,CASA,SAASiP,GAAeznE,EAAM+pE,GAAc,GACxC,KAAIpa,GAAW3vD,EAAKigE,YAAY+J,cAAgB,GAAhD,CAIA,GAFAhqE,EAAKigE,YAAY4H,aACjBgC,GAAiB7pE,GACb+pE,GAAe/pE,EAAKi0D,SAAWj0D,EAAKi0D,QAAQ6B,MAAO,CACnD,IAAIh3B,EAAMugC,GAAiBr/D,GAK3B,OAJI8+B,IAAQA,EAAI/J,GAAG/0B,EAAKL,MAAMyuB,WAC1BpuB,EAAK2oB,SAAS3oB,EAAKL,MAAM8uB,GAAG2D,aAAa0M,IAEzC9+B,EAAKw1D,YAAYx1D,EAAKL,QACnB,CACX,CACA,OAAO,CAXG,CAYd,CAjFAylE,GAAa7iC,iBAAmB6iC,GAAa6E,kBAAoBjqE,IAC7D,IAAKA,EAAKijC,UAAW,CACjBjjC,EAAKigE,YAAY1yE,QACjB,IAAI,MAAEoS,GAAUK,EAAMonC,EAAOznC,EAAMyuB,UAAU+M,MAC7C,GAAIx7B,EAAMyuB,UAAUlB,QACfvtB,EAAMypC,cACDhC,EAAK8I,YAAc9I,EAAKhM,cAAgBgM,EAAKtQ,WAAW/U,MAAMpK,MAAKyJ,IAA+B,IAA1BA,EAAEp2B,KAAKo3B,KAAK6W,aAE1Fj5B,EAAKkqE,WAAalqE,EAAKL,MAAMypC,aAAehC,EAAKrlB,QACjD0lD,GAAeznE,GAAM,GACrBA,EAAKkqE,WAAa,UAOlB,GAJAzC,GAAeznE,GAIXsvD,GAAS3vD,EAAMyuB,UAAUlB,OAASka,EAAKhM,eAAiBgM,EAAK8I,YAAc9I,EAAKtQ,WAAW/U,MAAMt7B,OAAQ,CACzG,IAAIq4C,EAAM9+B,EAAK67D,oBACf,IAAK,IAAIvnE,EAAOwqC,EAAIgwB,UAAW70D,EAAS6kC,EAAIiwB,YAAaz6D,GAAyB,GAAjBA,EAAKkiC,UAA2B,GAAVv8B,GAAc,CACjG,IAAIpE,EAASoE,EAAS,EAAI3F,EAAK0kC,UAAY1kC,EAAKupD,WAAW5jD,EAAS,GACpE,IAAKpE,EACD,MACJ,GAAuB,GAAnBA,EAAO2gC,SAAe,CACtBx2B,EAAKugE,eAAevI,SAASniE,EAAQA,EAAOmmD,UAAUv1D,QACtD,KACJ,CAEI6N,EAAOuB,EACPoE,GAAU,CAElB,CACJ,CAEJ+F,EAAKrN,MAAMswC,WAAY,CAC3B,CACA0mC,GAAmB3pE,EAAM0pE,GAAmB,EAEhDtE,GAAa9iC,eAAiB,CAACtiC,EAAMzE,KAC7ByE,EAAKijC,YACLjjC,EAAKrN,MAAMswC,WAAY,EACvBjjC,EAAKrN,MAAMyzE,mBAAqB7qE,EAAMiuE,UACtCxpE,EAAKrN,MAAM0zE,gBACXsD,GAAmB3pE,EAAM,IAC7B,EA+DJ,MAAMmqE,GAAsB5jD,GAAM8oC,EAAa,IAC1CI,GAAOI,EAAiB,IA2C7B,SAASua,GAAQpqE,EAAMrC,EAAMyQ,EAAMi8D,EAAa9uE,GAC5C,IAAI9P,EAAQy3E,GAAmBljE,EAAMrC,EAAMyQ,EAAMi8D,EAAarqE,EAAKL,MAAMyuB,UAAU+M,OACnF,GAAIn7B,EAAK+wD,SAAS,eAAe5sC,GAAKA,EAAEnkB,EAAMzE,EAAO9P,GAAS,cAC1D,OAAO,EACX,IAAKA,EACD,OAAO,EACX,IAAI6+E,EA5BR,SAAyB7+E,GACrB,OAA0B,GAAnBA,EAAMgjD,WAAmC,GAAjBhjD,EAAMijD,SAA4C,GAA5BjjD,EAAMnF,QAAQyyC,WAAkBttC,EAAMnF,QAAQ81C,WAAa,IACpH,CA0BqBmuC,CAAgB9+E,GAC7BgjC,EAAK67C,EACHtqE,EAAKL,MAAM8uB,GAAGmO,qBAAqB0tC,EAAYtqE,EAAKrN,MAAM04C,UAC1DrrC,EAAKL,MAAM8uB,GAAG40B,iBAAiB53D,GAErC,OADAuU,EAAK2oB,SAAS8F,EAAG8D,iBAAiBF,QAAQ,SAAS,GAAMA,QAAQ,UAAW,WACrE,CACX,CAtDAnZ,GAAS7vB,KAAO+7E,GAAa73B,IAAM,CAACvtC,EAAM2nE,KACtC,IAAIpsE,EAAQosE,EACR7oC,EAAM9+B,EAAKL,MAAMyuB,UAAWmf,EAAoB,OAAdhyC,EAAMvQ,KAC5C,GAAI8zC,EAAI5R,MACJ,OAEJ,IAAI/0B,EAAOgyE,GAAqB,KAAO5uE,EAAMu6B,cACzCrqC,EAAQqzC,EAAIx4C,WAAW,IAAEqgC,EAAG,KAAEhpB,GAASmlE,GAAsB9iE,EAAMvU,GACnE0M,GACAoD,EAAMs4B,iBACN17B,EAAKqyE,YACLryE,EAAK2W,QAAQ,YAAa6X,EAAIhf,WAC9BxP,EAAK2W,QAAQ,aAAcnR,IAvCnC,SAAqBqC,EAAM2mB,GAGvB,IAAK3mB,EAAK2mB,IAAIwB,WACV,OACJ,IAAI5J,EAAOve,EAAK2mB,IAAIwB,WAAWN,YAAY9sB,SAASyM,cAAc,QAClE+W,EAAKsJ,YAAYlB,GACjBpI,EAAKhH,MAAMkkD,QAAU,6CACrB,IAAI38B,EAAM+4B,eAAgBlhC,EAAQ57B,SAASmzD,cAC3Cv3B,EAAM8zC,mBAAmB9jD,GAIzB3mB,EAAK2mB,IAAI+N,OACToK,EAAIm5B,kBACJn5B,EAAIkR,SAASrZ,GACb3pC,YAAW,KACHuxB,EAAK4J,YACL5J,EAAK4J,WAAW+zC,YAAY39C,GAChCve,EAAK40B,OAAO,GACb,GACP,CAqBQ81C,CAAY1qE,EAAM2mB,GAElB4mB,GACAvtC,EAAK2oB,SAAS3oB,EAAKL,MAAM8uB,GAAGsY,kBAAkBxU,iBAAiBF,QAAQ,UAAW,OAAO,EAqCjG+yC,GAAauF,MAAQ,CAAC3qE,EAAM2nE,KACxB,IAAIpsE,EAAQosE,EAKZ,GAAI3nE,EAAKijC,YAAc0sB,EACnB,OACJ,IAAIx3D,EAAOgyE,GAAqB,KAAO5uE,EAAMu6B,cACzC39B,GAAQiyE,GAAQpqE,EAAM7H,EAAK0W,QAAQ,cAAe1W,EAAK0W,QAAQ,aAAc7O,EAAKrN,MAAM04C,SAAU9vC,GAClGA,EAAMs4B,iBA1Cd,SAAsB7zB,EAAMzE,GACxB,IAAKyE,EAAK2mB,IAAIwB,WACV,OACJ,IAAIg7C,EAAYnjE,EAAKrN,MAAM04C,UAAYrrC,EAAKL,MAAMyuB,UAAU+M,MAAMvkB,OAAO5rB,KAAKo3B,KAAK1sB,KAC/EhN,EAASsX,EAAK2mB,IAAIwB,WAAWN,YAAY9sB,SAASyM,cAAc27D,EAAY,WAAa,QACxFA,IACDz6E,EAAOg6C,gBAAkB,QAC7Bh6C,EAAO6uB,MAAMkkD,QAAU,6CACvB/yE,EAAOksC,QACP5nC,YAAW,KACPgT,EAAK40B,QACDlsC,EAAOy/B,YACPz/B,EAAOy/B,WAAW+zC,YAAYxzE,GAC9By6E,EACAiH,GAAQpqE,EAAMtX,EAAOK,MAAO,KAAMiX,EAAKrN,MAAM04C,SAAU9vC,GAEvD6uE,GAAQpqE,EAAMtX,EAAOmf,YAAanf,EAAOif,UAAW3H,EAAKrN,MAAM04C,SAAU9vC,EAAM,GACpF,GACP,CA0BQqvE,CAAa5qE,EAAMzE,EAAM,EAEjC,MAAMsvE,GACFriF,YAAYiD,EAAOqoB,GACf3tB,KAAKsF,MAAQA,EACbtF,KAAK2tB,KAAOA,CAChB,EAEJ,MAAMg3D,GAAmBlgC,EAAM,SAAW,UAC1C1xB,GAAS6xD,UAAY,CAAC/qE,EAAM2nE,KACxB,IAAIpsE,EAAQosE,EACR7H,EAAY9/D,EAAKrN,MAAMmtE,UAG3B,GAFIA,GACAA,EAAUruE,QACT8J,EAAM06B,aACP,OACJ,IAAI6I,EAAM9+B,EAAKL,MAAMyuB,UACjB3hB,EAAMqyB,EAAI5R,MAAQ,KAAOltB,EAAKs1B,YAAYyxC,GAAYxrE,IAC1D,GAAIkR,GAAOA,EAAIA,KAAOqyB,EAAI5pC,MAAQuX,EAAIA,MAAQqyB,aAAe,KAAgBA,EAAI7R,GAAK,EAAI6R,EAAI7R,UACzF,GAAI6yC,GAAaA,EAAU8I,UAC5B5oE,EAAK2oB,SAAS3oB,EAAKL,MAAM8uB,GAAG2D,aAAa,YAAqBpyB,EAAKL,MAAMiT,IAAKktD,EAAU8I,UAAUn8D,YAEjG,GAAIlR,EAAM7S,QAAmC,GAAzB6S,EAAM7S,OAAO8tC,SAAe,CACjD,IAAIloC,EAAO0R,EAAKi0D,QAAQC,YAAY34D,EAAM7S,QAAQ,GAC9C4F,GAAQA,EAAKgG,KAAKtJ,KAAKo3B,KAAKqa,WAAanuC,GAAQ0R,EAAKi0D,SACtDj0D,EAAK2oB,SAAS3oB,EAAKL,MAAM8uB,GAAG2D,aAAa,YAAqBpyB,EAAKL,MAAMiT,IAAKtkB,EAAK6lE,YAC3F,CACA,IAAI1oE,EAAQuU,EAAKL,MAAMyuB,UAAU9nC,WAAW,IAAEqgC,EAAG,KAAEhpB,GAASmlE,GAAsB9iE,EAAMvU,GACxF8P,EAAM06B,aAAau0C,YACnBjvE,EAAM06B,aAAannB,QAAQq7D,GAAqB,OAAS,YAAaxjD,EAAIhf,WAE1EpM,EAAM06B,aAAa+0C,cAAgB,WAC9Bb,IACD5uE,EAAM06B,aAAannB,QAAQ,aAAcnR,GAC7CqC,EAAKirE,SAAW,IAAIJ,GAASp/E,GAAQ8P,EAAMuvE,IAAkB,EAEjE5xD,GAASgyD,QAAUlrE,IACf,IAAIirE,EAAWjrE,EAAKirE,SACpBvqB,OAAO1zD,YAAW,KACVgT,EAAKirE,UAAYA,IACjBjrE,EAAKirE,SAAW,KAAI,GACzB,GAAG,EAEV7F,GAAa+F,SAAW/F,GAAagG,UAAY,CAAClrE,EAAGvP,IAAMA,EAAEkjC,iBAC7DuxC,GAAaiG,KAAO,CAACrrE,EAAM2nE,KACvB,IAAIpsE,EAAQosE,EACRsD,EAAWjrE,EAAKirE,SAEpB,GADAjrE,EAAKirE,SAAW,MACX1vE,EAAM06B,aACP,OACJ,IAAIq1C,EAAWtrE,EAAKs1B,YAAYyxC,GAAYxrE,IAC5C,IAAK+vE,EACD,OACJ,IAAIC,EAASvrE,EAAKL,MAAMiT,IAAI1hB,QAAQo6E,EAAS7+D,KACzChhB,EAAQw/E,GAAYA,EAASx/E,MAC7BA,EACAuU,EAAK+wD,SAAS,mBAAmB5sC,IAAO14B,EAAQ04B,EAAE14B,EAAOuU,EAAK,IAG9DvU,EAAQy3E,GAAmBljE,EAAMzE,EAAM06B,aAAapnB,QAAQs7D,GAAqB,OAAS,cAAeA,GAAqB,KAAO5uE,EAAM06B,aAAapnB,QAAQ,cAAc,EAAO08D,GAEzL,IAAIz3D,KAAUm3D,GAAa1vE,EAAMuvE,KACjC,GAAI9qE,EAAK+wD,SAAS,cAAc5sC,GAAKA,EAAEnkB,EAAMzE,EAAO9P,GAAS,WAAaqoB,KAEtE,YADAvY,EAAMs4B,iBAGV,IAAKpoC,EACD,OACJ8P,EAAMs4B,iBACN,IAAI01B,EAAY99D,GAAQ,QAAUuU,EAAKL,MAAMiT,IAAK24D,EAAO9+D,IAAKhhB,GAAS8/E,EAAO9+D,IAC7D,MAAb88C,IACAA,EAAYgiB,EAAO9+D,KACvB,IAAIgiB,EAAKzuB,EAAKL,MAAM8uB,GAChB3a,GACA2a,EAAGsY,kBACP,IAAIt6B,EAAMgiB,EAAGM,QAAQ3oC,IAAImjE,GACrBiiB,EAA4B,GAAnB//E,EAAMgjD,WAAmC,GAAjBhjD,EAAMijD,SAA4C,GAA5BjjD,EAAMnF,QAAQyyC,WACrE0yC,EAAeh9C,EAAG7b,IAKtB,GAJI44D,EACA/8C,EAAGuO,iBAAiBvwB,EAAKA,EAAKhhB,EAAMnF,QAAQ81C,YAE5C3N,EAAGwyB,aAAax0C,EAAKA,EAAKhhB,GAC1BgjC,EAAG7b,IAAImiB,GAAG02C,GACV,OACJ,IAAIrkC,EAAO3Y,EAAG7b,IAAI1hB,QAAQub,GAC1B,GAAI++D,GAAU,kBAA2B//E,EAAMnF,QAAQ81C,aACnDgL,EAAKlJ,WAAakJ,EAAKlJ,UAAUuO,WAAWhhD,EAAMnF,QAAQ81C,YAC1D3N,EAAG2D,aAAa,IAAI,KAAcgV,QAEjC,CACD,IAAIryC,EAAM05B,EAAGM,QAAQ3oC,IAAImjE,GACzB96B,EAAGM,QAAQT,KAAKG,EAAGM,QAAQT,KAAK7nC,OAAS,GAAGkN,SAAQ,CAAC89B,EAAOC,EAAKkxB,EAAUC,IAAU9tD,EAAM8tD,IAC3Fp0B,EAAG2D,aAAaqtC,GAAiBz/D,EAAMonC,EAAM3Y,EAAG7b,IAAI1hB,QAAQ6D,IAChE,CACAiL,EAAK40B,QACL50B,EAAK2oB,SAAS8F,EAAG4D,QAAQ,UAAW,QAAQ,EAEhDnZ,GAAS0b,MAAQ50B,IACbA,EAAKrN,MAAMqzE,UAAYl7E,KAAKD,MACvBmV,EAAKmnE,UACNnnE,EAAKigE,YAAYxH,OACjBz4D,EAAK2mB,IAAI2B,UAAUxyB,IAAI,uBACvBkK,EAAKigE,YAAYrrE,QACjBoL,EAAKmnE,SAAU,EACfn6E,YAAW,KACHgT,EAAKi0D,SAAWj0D,EAAKuhC,aAAevhC,EAAKigE,YAAYC,iBAAiBnrC,GAAG/0B,EAAK67D,sBAC9E+D,GAAe5/D,EAAK,GACzB,IACP,EAEJkZ,GAASwb,KAAO,CAAC10B,EAAM2nE,KACnB,IAAIpsE,EAAQosE,EACR3nE,EAAKmnE,UACLnnE,EAAKigE,YAAYxH,OACjBz4D,EAAK2mB,IAAI2B,UAAUzzB,OAAO,uBAC1BmL,EAAKigE,YAAYrrE,QACb2G,EAAMmwE,eAAiB1rE,EAAK2mB,IAAI63B,SAASjjD,EAAMmwE,gBAC/C1rE,EAAKigE,YAAYC,iBAAiB72C,QACtCrpB,EAAKmnE,SAAU,EACnB,EAEJjuD,GAASwa,YAAc,CAAC1zB,EAAM2nE,KAM1B,GAAIh9B,GAAUglB,GAA8B,yBALhCgY,EAKmBh0C,UAAsC,CACjE3zB,EAAKigE,YAAY0L,YACjB,IAAI,eAAErF,GAAmBtmE,EAAKrN,MAC9B3F,YAAW,KACP,GAAIgT,EAAKrN,MAAM2zE,gBAAkBA,EAC7B,OAIJ,GAFAtmE,EAAK2mB,IAAI+N,OACT10B,EAAK40B,QACD50B,EAAK+wD,SAAS,iBAAiB5sC,GAAKA,EAAEnkB,EAAMkvD,EAAS,EAAG,gBACxD,OACJ,IAAI,QAAErqB,GAAY7kC,EAAKL,MAAMyuB,UAEzByW,GAAWA,EAAQp4B,IAAM,GACzBzM,EAAK2oB,SAAS3oB,EAAKL,MAAM8uB,GAAGrF,OAAOyb,EAAQp4B,IAAM,EAAGo4B,EAAQp4B,KAAK8lB,iBAAiB,GACvF,GACP,GAGJ,IAAK,IAAI3V,KAAQwoD,GACblsD,GAAS0D,GAAQwoD,GAAaxoD,GAElC,SAASgvD,GAAYxzD,EAAGC,GACpB,GAAID,GAAKC,EACL,OAAO,EACX,IAAK,IAAIuK,KAAKxK,EACV,GAAIA,EAAEwK,KAAOvK,EAAEuK,GACX,OAAO,EACf,IAAK,IAAIA,KAAKvK,EACV,KAAMuK,KAAKxK,GACP,OAAO,EACf,OAAO,CACX,CACA,MAAMyzD,GACFrjF,YAAY2wC,EAAO/W,GACfj8B,KAAKgzC,MAAQA,EACbhzC,KAAKi8B,KAAOA,GAAQ0pD,GACpB3lF,KAAKs8C,KAAOt8C,KAAKi8B,KAAKqgB,MAAQ,CAClC,CACAr8C,IAAI2oC,EAAS8Q,EAAM5lC,EAAQ8xE,GACvB,IAAI,IAAEt/D,EAAG,QAAE61C,GAAYvzB,EAAQwzB,UAAU1iB,EAAK3qC,KAAO62E,EAAW5lF,KAAKs8C,KAAO,GAAK,EAAI,GACrF,OAAO6f,EAAU,KAAO,IAAI0pB,GAAWv/D,EAAMxS,EAAQwS,EAAMxS,EAAQ9T,KACvE,CACA8lF,QAAU,OAAO,CAAM,CACvBl3C,GAAG3pC,GACC,OAAOjF,MAAQiF,GACVA,aAAiBygF,KACb1lF,KAAKi8B,KAAK/5B,KAAOlC,KAAKi8B,KAAK/5B,KAAO+C,EAAMg3B,KAAK/5B,KAC1ClC,KAAKgzC,OAAS/tC,EAAM+tC,OAASyyC,GAAYzlF,KAAKi8B,KAAMh3B,EAAMg3B,MAC1E,CACA8F,QAAQ5zB,GACAnO,KAAKi8B,KAAK8F,SACV/hC,KAAKi8B,KAAK8F,QAAQ5zB,EAC1B,EAEJ,MAAM43E,GACF1jF,YAAYm5B,EAAOS,GACfj8B,KAAKw7B,MAAQA,EACbx7B,KAAKi8B,KAAOA,GAAQ0pD,EACxB,CACA1lF,IAAI2oC,EAAS8Q,EAAM5lC,EAAQ8xE,GACvB,IAAI72E,EAAO65B,EAAQ3oC,IAAIy5C,EAAK3qC,KAAO62E,EAAW5lF,KAAKi8B,KAAK+pD,gBAAkB,EAAI,GAAKlyE,EAC/EgzB,EAAK8B,EAAQ3oC,IAAIy5C,EAAK5S,GAAK8+C,EAAW5lF,KAAKi8B,KAAKgqD,aAAe,GAAK,GAAKnyE,EAC7E,OAAO/E,GAAQ+3B,EAAK,KAAO,IAAI++C,GAAW92E,EAAM+3B,EAAI9mC,KACxD,CACA8lF,MAAM/rE,EAAG2/B,GAAQ,OAAOA,EAAK3qC,KAAO2qC,EAAK5S,EAAI,CAC7C8H,GAAG3pC,GACC,OAAOjF,MAAQiF,GACVA,aAAiB8gF,IAAcN,GAAYzlF,KAAKw7B,MAAOv2B,EAAMu2B,QAC1DiqD,GAAYzlF,KAAKi8B,KAAMh3B,EAAMg3B,KACzC,CACAR,UAAUie,GAAQ,OAAOA,EAAK70C,gBAAgBkhF,EAAY,CAC1DhkD,UAAY,EAEhB,MAAM0tB,GACFptD,YAAYm5B,EAAOS,GACfj8B,KAAKw7B,MAAQA,EACbx7B,KAAKi8B,KAAOA,GAAQ0pD,EACxB,CACA1lF,IAAI2oC,EAAS8Q,EAAM5lC,EAAQ8xE,GACvB,IAAI72E,EAAO65B,EAAQwzB,UAAU1iB,EAAK3qC,KAAO62E,EAAW,GACpD,GAAI72E,EAAKotD,QACL,OAAO,KACX,IAAIr1B,EAAK8B,EAAQwzB,UAAU1iB,EAAK5S,GAAK8+C,GAAY,GACjD,OAAI9+C,EAAGq1B,SAAWr1B,EAAGxgB,KAAOvX,EAAKuX,IACtB,KACJ,IAAIu/D,GAAW92E,EAAKuX,IAAMxS,EAAQgzB,EAAGxgB,IAAMxS,EAAQ9T,KAC9D,CACA8lF,MAAM33E,EAAMurC,GACR,IAA2D5mB,GAAvD,MAAEvkB,EAAK,OAAEuF,GAAW3F,EAAKhO,QAAQqnD,UAAU9N,EAAK3qC,MACpD,OAAO+E,GAAU4lC,EAAK3qC,QAAU+jB,EAAQ3kB,EAAK2kB,MAAMvkB,IAAQotB,QAAU7nB,EAASgf,EAAMohB,UAAYwF,EAAK5S,EACzG,CACA8H,GAAG3pC,GACC,OAAOjF,MAAQiF,GACVA,aAAiBwqD,IAAYg2B,GAAYzlF,KAAKw7B,MAAOv2B,EAAMu2B,QACxDiqD,GAAYzlF,KAAKi8B,KAAMh3B,EAAMg3B,KACzC,CACA8F,UAAY,EAOhB,MAAM8jD,GAIFxjF,YAIA0M,EAKA+3B,EAIAjiC,GACI7E,KAAK+O,KAAOA,EACZ/O,KAAK8mC,GAAKA,EACV9mC,KAAK6E,KAAOA,CAChB,CAIA3B,KAAK6L,EAAM+3B,GACP,OAAO,IAAI++C,GAAW92E,EAAM+3B,EAAI9mC,KAAK6E,KACzC,CAIA+pC,GAAG3pC,EAAO6O,EAAS,GACf,OAAO9T,KAAK6E,KAAK+pC,GAAG3pC,EAAMJ,OAAS7E,KAAK+O,KAAO+E,GAAU7O,EAAM8J,MAAQ/O,KAAK8mC,GAAKhzB,GAAU7O,EAAM6hC,EACrG,CAIA7mC,IAAI2oC,EAAS90B,EAAQ8xE,GACjB,OAAO5lF,KAAK6E,KAAK5E,IAAI2oC,EAAS5oC,KAAM8T,EAAQ8xE,EAChD,CASAnqD,cAAcnV,EAAK0sB,EAAO/W,GACtB,OAAO,IAAI4pD,GAAWv/D,EAAKA,EAAK,IAAIo/D,GAAW1yC,EAAO/W,GAC1D,CAKAR,cAAc1sB,EAAM+3B,EAAItL,EAAOS,GAC3B,OAAO,IAAI4pD,GAAW92E,EAAM+3B,EAAI,IAAIi/C,GAAWvqD,EAAOS,GAC1D,CAMAR,YAAY1sB,EAAM+3B,EAAItL,EAAOS,GACzB,OAAO,IAAI4pD,GAAW92E,EAAM+3B,EAAI,IAAI2oB,GAASj0B,EAAOS,GACxD,CAKIA,WAAS,OAAOj8B,KAAK6E,KAAKo3B,IAAM,CAIhCma,aAAW,OAAOp2C,KAAK6E,gBAAgBkhF,EAAY,EAE3D,MAAM/4D,GAAO,GAAI24D,GAAS,CAAC,EAO3B,MAAMO,GAIF7jF,YAAY8jF,EAAO93E,GACfrO,KAAKmmF,MAAQA,EAAM7lF,OAAS6lF,EAAQn5D,GACpChtB,KAAKqO,SAAWA,EAAS/N,OAAS+N,EAAW2e,EACjD,CAKAyO,cAAchP,EAAK+iB,GACf,OAAOA,EAAYlvC,OAAS8lF,GAAU52C,EAAa/iB,EAAK,EAAGk5D,IAAU5+C,EACzE,CASAhL,KAAKttB,EAAOG,EAAKy3E,GACb,IAAIzgF,EAAS,GAEb,OADA5F,KAAKsmF,UAAmB,MAAT73E,EAAgB,EAAIA,EAAc,MAAPG,EAAc,IAAMA,EAAKhJ,EAAQ,EAAGygF,GACvEzgF,CACX,CACA0gF,UAAU73E,EAAOG,EAAKhJ,EAAQkO,EAAQuyE,GAClC,IAAK,IAAI7lF,EAAI,EAAGA,EAAIR,KAAKmmF,MAAM7lF,OAAQE,IAAK,CACxC,IAAIk5C,EAAO15C,KAAKmmF,MAAM3lF,GAClBk5C,EAAK3qC,MAAQH,GAAO8qC,EAAK5S,IAAMr4B,KAAW43E,GAAaA,EAAU3sC,EAAKzd,QACtEr2B,EAAOzE,KAAKu4C,EAAKx2C,KAAKw2C,EAAK3qC,KAAO+E,EAAQ4lC,EAAK5S,GAAKhzB,GAC5D,CACA,IAAK,IAAItT,EAAI,EAAGA,EAAIR,KAAKqO,SAAS/N,OAAQE,GAAK,EAC3C,GAAIR,KAAKqO,SAAS7N,GAAKoO,GAAO5O,KAAKqO,SAAS7N,EAAI,GAAKiO,EAAO,CACxD,IAAI83E,EAAWvmF,KAAKqO,SAAS7N,GAAK,EAClCR,KAAKqO,SAAS7N,EAAI,GAAG8lF,UAAU73E,EAAQ83E,EAAU33E,EAAM23E,EAAU3gF,EAAQkO,EAASyyE,EAAUF,EAChG,CAER,CAKApmF,IAAI2oC,EAASnc,EAAKjqB,GACd,OAAIxC,MAAQ+mC,IAAgC,GAAvB6B,EAAQT,KAAK7nC,OACvBN,KACJA,KAAKwmF,SAAS59C,EAASnc,EAAK,EAAG,EAAGjqB,GAAWmjF,GACxD,CAIAa,SAAS59C,EAASz6B,EAAM2F,EAAQ8xE,EAAWpjF,GACvC,IAAIikF,EACJ,IAAK,IAAIjmF,EAAI,EAAGA,EAAIR,KAAKmmF,MAAM7lF,OAAQE,IAAK,CACxC,IAAI6gE,EAASrhE,KAAKmmF,MAAM3lF,GAAGP,IAAI2oC,EAAS90B,EAAQ8xE,GAC5CvkB,GAAUA,EAAOx8D,KAAKihF,MAAM33E,EAAMkzD,IACjColB,IAAaA,EAAW,KAAKtlF,KAAKkgE,GAC9B7+D,EAAQ+hC,UACb/hC,EAAQ+hC,SAASvkC,KAAKmmF,MAAM3lF,GAAGy7B,KACvC,CACA,OAAIj8B,KAAKqO,SAAS/N,OA0O1B,SAAqBomF,EAAaD,EAAU79C,EAASz6B,EAAM2F,EAAQ8xE,EAAWpjF,GAC1E,IAAI6L,EAAWq4E,EAAYphF,QAG3B,IAAK,IAAI9E,EAAI,EAAGmmF,EAAaf,EAAWplF,EAAIooC,EAAQT,KAAK7nC,OAAQE,IAAK,CAClE,IAAIomF,EAAQ,EACZh+C,EAAQT,KAAK3nC,GAAGgN,SAAQ,CAACyyD,EAAU4mB,EAAQ3mB,EAAU4mB,KACjD,IAAIC,EAASD,EAAS5mB,GAAa2mB,EAAS5mB,GAC5C,IAAK,IAAIz/D,EAAI,EAAGA,EAAI6N,EAAS/N,OAAQE,GAAK,EAAG,CACzC,IAAIoO,EAAMP,EAAS7N,EAAI,GACvB,GAAIoO,EAAM,GAAKqxD,EAAWrxD,EAAM+3E,EAAaC,EACzC,SACJ,IAAIn4E,EAAQJ,EAAS7N,GAAKmmF,EAAaC,EACnCC,GAAUp4E,EACVJ,EAAS7N,EAAI,GAAKy/D,GAAYxxD,GAAS,GAAK,EAEvCyxD,GAAYpsD,GAAUizE,IAC3B14E,EAAS7N,IAAMumF,EACf14E,EAAS7N,EAAI,IAAMumF,EAE3B,CACAH,GAASG,CAAK,IAElBJ,EAAa/9C,EAAQT,KAAK3nC,GAAGP,IAAI0mF,GAAa,EAClD,CAGA,IAAIK,GAAc,EAClB,IAAK,IAAIxmF,EAAI,EAAGA,EAAI6N,EAAS/N,OAAQE,GAAK,EACtC,GAAI6N,EAAS7N,EAAI,GAAK,EAAG,CACrB,IAAwB,GAApB6N,EAAS7N,EAAI,GAAU,CACvBwmF,GAAc,EACd34E,EAAS7N,EAAI,IAAM,EACnB,QACJ,CACA,IAAIuO,EAAO65B,EAAQ3oC,IAAIymF,EAAYlmF,GAAKolF,GAAYqB,EAAYl4E,EAAO+E,EACvE,GAAImzE,EAAY,GAAKA,GAAa94E,EAAKhO,QAAQ8Q,KAAM,CACjD+1E,GAAc,EACd,QACJ,CAEA,IAA0DE,EAAjDt+C,EAAQ3oC,IAAIymF,EAAYlmF,EAAI,GAAKolF,GAAY,GAAmB9xE,GACrE,MAAEvF,EAAOuF,OAAQqzE,GAAgBh5E,EAAKhO,QAAQqnD,UAAUy/B,GACxDG,EAAYj5E,EAAK8uC,WAAW1uC,GAChC,GAAI64E,GAAaD,GAAeF,GAAaE,EAAcC,EAAUlzC,UAAYgzC,EAAS,CACtF,IAAI7lB,EAAShzD,EAAS7N,EAAI,GACrBgmF,SAAS59C,EAASw+C,EAAWr4E,EAAO,EAAG23E,EAAYlmF,GAAKolF,EAAY,EAAGpjF,GACxE6+D,GAAUt6B,IACV14B,EAAS7N,GAAKymF,EACd54E,EAAS7N,EAAI,GAAK0mF,EAClB74E,EAAS7N,EAAI,GAAK6gE,IAGlBhzD,EAAS7N,EAAI,IAAM,EACnBwmF,GAAc,EAEtB,MAEIA,GAAc,CAEtB,CAEJ,GAAIA,EAAa,CACb,IAAIx3C,EA2BZ,SAA0CnhC,EAAUq4E,EAAal3C,EAAa5G,EAAS90B,EAAQ8xE,EAAWpjF,GAEtG,SAAS6kF,EAAO5+E,EAAKm9E,GACjB,IAAK,IAAIplF,EAAI,EAAGA,EAAIiI,EAAI09E,MAAM7lF,OAAQE,IAAK,CACvC,IAAI6gE,EAAS54D,EAAI09E,MAAM3lF,GAAGP,IAAI2oC,EAAS90B,EAAQ8xE,GAC3CvkB,EACA7xB,EAAYruC,KAAKkgE,GACZ7+D,EAAQ+hC,UACb/hC,EAAQ+hC,SAAS97B,EAAI09E,MAAM3lF,GAAGy7B,KACtC,CACA,IAAK,IAAIz7B,EAAI,EAAGA,EAAIiI,EAAI4F,SAAS/N,OAAQE,GAAK,EAC1C6mF,EAAO5+E,EAAI4F,SAAS7N,EAAI,GAAIiI,EAAI4F,SAAS7N,GAAKolF,EAAY,EAClE,CACA,IAAK,IAAIplF,EAAI,EAAGA,EAAI6N,EAAS/N,OAAQE,GAAK,GACd,GAApB6N,EAAS7N,EAAI,IACb6mF,EAAOh5E,EAAS7N,EAAI,GAAIkmF,EAAYlmF,GAAKolF,EAAY,GAC7D,OAAOp2C,CACX,CA5C0B83C,CAAiCj5E,EAAUq4E,EAAaD,EAAU79C,EAAS90B,EAAQ8xE,EAAWpjF,GAC5G6sD,EAAQ+2B,GAAU52C,EAAarhC,EAAM,EAAG3L,GAC5CikF,EAAWp3B,EAAM82B,MACjB,IAAK,IAAI3lF,EAAI,EAAGA,EAAI6N,EAAS/N,OAAQE,GAAK,EAClC6N,EAAS7N,EAAI,GAAK,IAClB6N,EAASG,OAAOhO,EAAG,GACnBA,GAAK,GAEb,IAAK,IAAIA,EAAI,EAAG08B,EAAI,EAAG18B,EAAI6uD,EAAMhhD,SAAS/N,OAAQE,GAAK,EAAG,CACtD,IAAIuO,EAAOsgD,EAAMhhD,SAAS7N,GAC1B,KAAO08B,EAAI7uB,EAAS/N,QAAU+N,EAAS6uB,GAAKnuB,GACxCmuB,GAAK,EACT7uB,EAASG,OAAO0uB,EAAG,EAAGmyB,EAAMhhD,SAAS7N,GAAI6uD,EAAMhhD,SAAS7N,EAAI,GAAI6uD,EAAMhhD,SAAS7N,EAAI,GACvF,CACJ,CACA,OAAO,IAAI0lF,GAAcO,EAASrzD,KAAKm0D,IAAQl5E,EACnD,CAxTmBm5E,CAAYxnF,KAAKqO,SAAUo4E,GAAY,GAAI79C,EAASz6B,EAAM2F,EAAQ8xE,EAAWpjF,GAE7EikF,EAAW,IAAIP,GAAcO,EAASrzD,KAAKm0D,IAAQv6D,IAAQ+Z,EAC1E,CAMAp3B,IAAI8c,EAAK+iB,GACL,OAAKA,EAAYlvC,OAEbN,MAAQ+mC,GACDm/C,GAAclrE,OAAOyR,EAAK+iB,GAC9BxvC,KAAKynF,SAASh7D,EAAK+iB,EAAa,GAH5BxvC,IAIf,CACAynF,SAASh7D,EAAK+iB,EAAa17B,GACvB,IAAIzF,EAAUk+D,EAAa,EAC3B9/C,EAAIjf,SAAQ,CAAC45E,EAAWD,KACpB,IAAuCvhC,EAAnC+gC,EAAaQ,EAAcrzE,EAC/B,GAAM8xC,EAAQ8hC,GAAiBl4C,EAAa43C,EAAWT,GAAvD,CAIA,IAFKt4E,IACDA,EAAWrO,KAAKqO,SAAS/I,SACtBinE,EAAal+D,EAAS/N,QAAU+N,EAASk+D,GAAc4a,GAC1D5a,GAAc,EACdl+D,EAASk+D,IAAe4a,EACxB94E,EAASk+D,EAAa,GAAKl+D,EAASk+D,EAAa,GAAGkb,SAASL,EAAWxhC,EAAO+gC,EAAa,GAE5Ft4E,EAASG,OAAO+9D,EAAY,EAAG4a,EAAaA,EAAcC,EAAUlzC,SAAUkyC,GAAUxgC,EAAOwhC,EAAWT,EAAa,EAAGhB,KAC9HpZ,GAAc,CATJ,CASK,IAEnB,IAAI4Z,EAAQwB,GAAUpb,EAAaqb,GAAap4C,GAAeA,GAAc17B,GAC7E,IAAK,IAAItT,EAAI,EAAGA,EAAI2lF,EAAM7lF,OAAQE,IACzB2lF,EAAM3lF,GAAGqE,KAAKihF,MAAMr5D,EAAK05D,EAAM3lF,KAChC2lF,EAAM33E,OAAOhO,IAAK,GAC1B,OAAO,IAAI0lF,GAAcC,EAAM7lF,OAASN,KAAKmmF,MAAM9lF,OAAO8lF,GAAO/yD,KAAKm0D,IAASvnF,KAAKmmF,MAAO93E,GAAYrO,KAAKqO,SAChH,CAKAK,OAAO8gC,GACH,OAA0B,GAAtBA,EAAYlvC,QAAeN,MAAQ+mC,GAC5B/mC,KACJA,KAAK6nF,YAAYr4C,EAAa,EACzC,CACAq4C,YAAYr4C,EAAa17B,GACrB,IAAIzF,EAAWrO,KAAKqO,SAAU83E,EAAQnmF,KAAKmmF,MAC3C,IAAK,IAAI3lF,EAAI,EAAGA,EAAI6N,EAAS/N,OAAQE,GAAK,EAAG,CACzC,IAAIolD,EACA72C,EAAOV,EAAS7N,GAAKsT,EAAQgzB,EAAKz4B,EAAS7N,EAAI,GAAKsT,EACxD,IAAK,IAAW4lC,EAAPxc,EAAI,EAASA,EAAIsS,EAAYlvC,OAAQ48B,KACtCwc,EAAOlK,EAAYtS,KACfwc,EAAK3qC,KAAOA,GAAQ2qC,EAAK5S,GAAKA,IAC9B0I,EAAYtS,GAAK,MAChB0oB,IAAUA,EAAQ,KAAKzkD,KAAKu4C,IAGzC,IAAKkM,EACD,SACAv3C,GAAYrO,KAAKqO,WACjBA,EAAWrO,KAAKqO,SAAS/I,SAC7B,IAAI+hE,EAAUh5D,EAAS7N,EAAI,GAAGqnF,YAAYjiC,EAAO72C,EAAO,GACpDs4D,GAAWtgC,GACX14B,EAAS7N,EAAI,GAAK6mE,GAGlBh5D,EAASG,OAAOhO,EAAG,GACnBA,GAAK,EAEb,CACA,GAAI2lF,EAAM7lF,OACN,IAAK,IAAWo5C,EAAPl5C,EAAI,EAASA,EAAIgvC,EAAYlvC,OAAQE,IAC1C,GAAIk5C,EAAOlK,EAAYhvC,GACnB,IAAK,IAAI08B,EAAI,EAAGA,EAAIipD,EAAM7lF,OAAQ48B,IAC1BipD,EAAMjpD,GAAG0R,GAAG8K,EAAM5lC,KACdqyE,GAASnmF,KAAKmmF,QACdA,EAAQnmF,KAAKmmF,MAAM7gF,SACvB6gF,EAAM33E,OAAO0uB,IAAK,IAGtC,OAAI7uB,GAAYrO,KAAKqO,UAAY83E,GAASnmF,KAAKmmF,MACpCnmF,KACJmmF,EAAM7lF,QAAU+N,EAAS/N,OAAS,IAAI4lF,GAAcC,EAAO93E,GAAY04B,EAClF,CAIAitC,SAASlgE,EAAQ3F,GACb,GAAInO,MAAQ+mC,GACR,OAAO/mC,KACX,GAAImO,EAAK+4C,OACL,OAAOg/B,GAAcn/C,MACzB,IAAIjU,EAAOqzD,EACX,IAAK,IAAI3lF,EAAI,EAAGA,EAAIR,KAAKqO,SAAS/N,OAAQE,GAAK,EAC3C,GAAIR,KAAKqO,SAAS7N,IAAMsT,EAAQ,CACxB9T,KAAKqO,SAAS7N,IAAMsT,IACpBgf,EAAQ9yB,KAAKqO,SAAS7N,EAAI,IAC9B,KACJ,CACJ,IAAIiO,EAAQqF,EAAS,EAAGlF,EAAMH,EAAQN,EAAKhO,QAAQ8Q,KACnD,IAAK,IAAIzQ,EAAI,EAAGA,EAAIR,KAAKmmF,MAAM7lF,OAAQE,IAAK,CACxC,IAAI0H,EAAMlI,KAAKmmF,MAAM3lF,GACrB,GAAI0H,EAAI6G,KAAOH,GAAO1G,EAAI4+B,GAAKr4B,GAAUvG,EAAIrD,gBAAgBkhF,GAAa,CACtE,IAAIh3E,EAAOzK,KAAKC,IAAIkK,EAAOvG,EAAI6G,MAAQN,EAAOq4B,EAAKxiC,KAAKG,IAAImK,EAAK1G,EAAI4+B,IAAMr4B,EACvEM,EAAO+3B,IACNq/C,IAAUA,EAAQ,KAAKhlF,KAAK+G,EAAIhF,KAAK6L,EAAM+3B,GACpD,CACJ,CACA,GAAIq/C,EAAO,CACP,IAAI2B,EAAW,IAAI5B,GAAcC,EAAM/yD,KAAKm0D,IAAQv6D,IACpD,OAAO8F,EAAQ,IAAIi1D,GAAgB,CAACD,EAAUh1D,IAAUg1D,CAC5D,CACA,OAAOh1D,GAASiU,EACpB,CAIA6H,GAAG3pC,GACC,GAAIjF,MAAQiF,EACR,OAAO,EACX,KAAMA,aAAiBihF,KACnBlmF,KAAKmmF,MAAM7lF,QAAU2E,EAAMkhF,MAAM7lF,QACjCN,KAAKqO,SAAS/N,QAAU2E,EAAMoJ,SAAS/N,OACvC,OAAO,EACX,IAAK,IAAIE,EAAI,EAAGA,EAAIR,KAAKmmF,MAAM7lF,OAAQE,IACnC,IAAKR,KAAKmmF,MAAM3lF,GAAGouC,GAAG3pC,EAAMkhF,MAAM3lF,IAC9B,OAAO,EACf,IAAK,IAAIA,EAAI,EAAGA,EAAIR,KAAKqO,SAAS/N,OAAQE,GAAK,EAC3C,GAAIR,KAAKqO,SAAS7N,IAAMyE,EAAMoJ,SAAS7N,IACnCR,KAAKqO,SAAS7N,EAAI,IAAMyE,EAAMoJ,SAAS7N,EAAI,KAC1CR,KAAKqO,SAAS7N,EAAI,GAAGouC,GAAG3pC,EAAMoJ,SAAS7N,EAAI,IAC5C,OAAO,EACf,OAAO,CACX,CAIAuzE,OAAO5lE,GACH,OAAO65E,GAAchoF,KAAKioF,YAAY95E,GAC1C,CAIA85E,YAAY95E,GACR,GAAInO,MAAQ+mC,GACR,OAAO/Z,GACX,GAAI7e,EAAKisC,gBAAkBp6C,KAAKmmF,MAAM30D,KAAKu0D,GAAWmC,IAClD,OAAOloF,KAAKmmF,MAChB,IAAIvgF,EAAS,GACb,IAAK,IAAIpF,EAAI,EAAGA,EAAIR,KAAKmmF,MAAM7lF,OAAQE,IAC7BR,KAAKmmF,MAAM3lF,GAAGqE,gBAAgBkhF,IAChCngF,EAAOzE,KAAKnB,KAAKmmF,MAAM3lF,IAE/B,OAAOoF,CACX,EAKJsgF,GAAcn/C,MAAQ,IAAIm/C,GAAc,GAAI,IAI5CA,GAAc8B,cAAgBA,GAC9B,MAAMjhD,GAAQm/C,GAAcn/C,MAI5B,MAAMghD,GACF1lF,YAAY8lF,GACRnoF,KAAKmoF,QAAUA,CACnB,CACAloF,IAAI2oC,EAASnc,GACT,MAAM27D,EAAcpoF,KAAKmoF,QAAQloF,KAAIooF,GAAUA,EAAOpoF,IAAI2oC,EAASnc,EAAKk5D,MACxE,OAAOoC,GAAgBh5E,KAAKq5E,EAChC,CACApU,SAASlgE,EAAQgf,GACb,GAAIA,EAAMo0B,OACN,OAAOg/B,GAAcn/C,MACzB,IAAI6e,EAAQ,GACZ,IAAK,IAAIplD,EAAI,EAAGA,EAAIR,KAAKmoF,QAAQ7nF,OAAQE,IAAK,CAC1C,IAAIoF,EAAS5F,KAAKmoF,QAAQ3nF,GAAGwzE,SAASlgE,EAAQgf,GAC1CltB,GAAUmhC,KAEVnhC,aAAkBmiF,GAClBniC,EAAQA,EAAMvlD,OAAOuF,EAAOuiF,SAE5BviC,EAAMzkD,KAAKyE,GACnB,CACA,OAAOmiF,GAAgBh5E,KAAK62C,EAChC,CACAhX,GAAG3pC,GACC,KAAMA,aAAiB8iF,KACnB9iF,EAAMkjF,QAAQ7nF,QAAUN,KAAKmoF,QAAQ7nF,OACrC,OAAO,EACX,IAAK,IAAIE,EAAI,EAAGA,EAAIR,KAAKmoF,QAAQ7nF,OAAQE,IACrC,IAAKR,KAAKmoF,QAAQ3nF,GAAGouC,GAAG3pC,EAAMkjF,QAAQ3nF,IAClC,OAAO,EACf,OAAO,CACX,CACAuzE,OAAO5lE,GACH,IAAIvI,EAAQ0iF,GAAS,EACrB,IAAK,IAAI9nF,EAAI,EAAGA,EAAIR,KAAKmoF,QAAQ7nF,OAAQE,IAAK,CAC1C,IAAIuzE,EAAS/zE,KAAKmoF,QAAQ3nF,GAAGynF,YAAY95E,GACzC,GAAK4lE,EAAOzzE,OAEZ,GAAKsF,EAGA,CACG0iF,IACA1iF,EAASA,EAAON,QAChBgjF,GAAS,GAEb,IAAK,IAAIprD,EAAI,EAAGA,EAAI62C,EAAOzzE,OAAQ48B,IAC/Bt3B,EAAOzE,KAAK4yE,EAAO72C,GAC3B,MATIt3B,EAASmuE,CAUjB,CACA,OAAOnuE,EAASoiF,GAAcM,EAAS1iF,EAASA,EAAOwtB,KAAKm0D,KAAUv6D,EAC1E,CAGAyO,YAAY0sD,GACR,OAAQA,EAAQ7nF,QACZ,KAAK,EAAG,OAAOymC,GACf,KAAK,EAAG,OAAOohD,EAAQ,GACvB,QAAS,OAAO,IAAIJ,GAAgBI,EAAQpqD,OAAM9C,GAAKA,aAAairD,KAAiBiC,EACjFA,EAAQjqD,QAAO,CAAC7B,EAAGpB,IAAMoB,EAAEh8B,OAAO46B,aAAairD,GAAgBjrD,EAAIA,EAAEktD,UAAU,KAE3F,EAkFJ,SAASR,GAAUY,EAAOz0E,GACtB,IAAKA,IAAWy0E,EAAMjoF,OAClB,OAAOioF,EACX,IAAI3iF,EAAS,GACb,IAAK,IAAIpF,EAAI,EAAGA,EAAI+nF,EAAMjoF,OAAQE,IAAK,CACnC,IAAIk5C,EAAO6uC,EAAM/nF,GACjBoF,EAAOzE,KAAK,IAAI0kF,GAAWnsC,EAAK3qC,KAAO+E,EAAQ4lC,EAAK5S,GAAKhzB,EAAQ4lC,EAAK70C,MAC1E,CACA,OAAOe,CACX,CAmBA,SAAS8hF,GAAiBa,EAAOp6E,EAAM2F,GACnC,GAAI3F,EAAK+4C,OACL,OAAO,KACX,IAAIt4C,EAAMkF,EAAS3F,EAAK+lC,SAAU0R,EAAQ,KAC1C,IAAK,IAAWlM,EAAPl5C,EAAI,EAASA,EAAI+nF,EAAMjoF,OAAQE,KAC/Bk5C,EAAO6uC,EAAM/nF,KAAOk5C,EAAK3qC,KAAO+E,GAAU4lC,EAAK5S,GAAKl4B,KACpDg3C,IAAUA,EAAQ,KAAKzkD,KAAKu4C,GAC7B6uC,EAAM/nF,GAAK,MAGnB,OAAOolD,CACX,CACA,SAASgiC,GAAa59C,GAClB,IAAIpkC,EAAS,GACb,IAAK,IAAIpF,EAAI,EAAGA,EAAIwpC,EAAM1pC,OAAQE,IACd,MAAZwpC,EAAMxpC,IACNoF,EAAOzE,KAAK6oC,EAAMxpC,IAC1B,OAAOoF,CACX,CAKA,SAASwgF,GAAUmC,EAAOp6E,EAAM2F,EAAQtR,GACpC,IAAI6L,EAAW,GAAIm6E,GAAW,EAC9Br6E,EAAKX,SAAQ,CAAC45E,EAAWqB,KACrB,IAAI7iC,EAAQ8hC,GAAiBa,EAAOnB,EAAWqB,EAAa30E,GAC5D,GAAI8xC,EAAO,CACP4iC,GAAW,EACX,IAAIE,EAAUtC,GAAUxgC,EAAOwhC,EAAWtzE,EAAS20E,EAAa,EAAGjmF,GAC/DkmF,GAAW3hD,IACX14B,EAASlN,KAAKsnF,EAAYA,EAAarB,EAAUlzC,SAAUw0C,EACnE,KAEJ,IAAI3U,EAAS4T,GAAUa,EAAWZ,GAAaW,GAASA,GAAQz0E,GAAQsf,KAAKm0D,IAC7E,IAAK,IAAI/mF,EAAI,EAAGA,EAAIuzE,EAAOzzE,OAAQE,IAC1BuzE,EAAOvzE,GAAGqE,KAAKihF,MAAM33E,EAAM4lE,EAAOvzE,MAC/BgC,EAAQ+hC,UACR/hC,EAAQ+hC,SAASwvC,EAAOvzE,GAAGy7B,MAC/B83C,EAAOvlE,OAAOhO,IAAK,IAE3B,OAAOuzE,EAAOzzE,QAAU+N,EAAS/N,OAAS,IAAI4lF,GAAcnS,EAAQ1lE,GAAY04B,EACpF,CAIA,SAASwgD,GAAMt1D,EAAGC,GACd,OAAOD,EAAEljB,KAAOmjB,EAAEnjB,MAAQkjB,EAAE6U,GAAK5U,EAAE4U,EACvC,CAKA,SAASkhD,GAAcO,GACnB,IAAII,EAAUJ,EACd,IAAK,IAAI/nF,EAAI,EAAGA,EAAImoF,EAAQroF,OAAS,EAAGE,IAAK,CACzC,IAAIk5C,EAAOivC,EAAQnoF,GACnB,GAAIk5C,EAAK3qC,MAAQ2qC,EAAK5S,GAClB,IAAK,IAAI5J,EAAI18B,EAAI,EAAG08B,EAAIyrD,EAAQroF,OAAQ48B,IAAK,CACzC,IAAInrB,EAAO42E,EAAQzrD,GACnB,GAAInrB,EAAKhD,MAAQ2qC,EAAK3qC,KAAtB,CAYQgD,EAAKhD,KAAO2qC,EAAK5S,KACb6hD,GAAWJ,IACXI,EAAUJ,EAAMjjF,SAGpBqjF,EAAQnoF,GAAKk5C,EAAKx2C,KAAKw2C,EAAK3qC,KAAMgD,EAAKhD,MACvC65E,GAAYD,EAASzrD,EAAGwc,EAAKx2C,KAAK6O,EAAKhD,KAAM2qC,EAAK5S,MAEtD,KACJ,CApBQ/0B,EAAK+0B,IAAM4S,EAAK5S,KACZ6hD,GAAWJ,IACXI,EAAUJ,EAAMjjF,SAGpBqjF,EAAQzrD,GAAKnrB,EAAK7O,KAAK6O,EAAKhD,KAAM2qC,EAAK5S,IACvC8hD,GAAYD,EAASzrD,EAAI,EAAGnrB,EAAK7O,KAAKw2C,EAAK5S,GAAI/0B,EAAK+0B,KAehE,CACR,CACA,OAAO6hD,CACX,CACA,SAASC,GAAY5+C,EAAOxpC,EAAGozE,GAC3B,KAAOpzE,EAAIwpC,EAAM1pC,QAAUinF,GAAM3T,EAAM5pC,EAAMxpC,IAAM,GAC/CA,IACJwpC,EAAMx7B,OAAOhO,EAAG,EAAGozE,EACvB,CAEA,SAASiV,GAAgBhvE,GACrB,IAAI+rC,EAAQ,GAQZ,OAPA/rC,EAAK+wD,SAAS,eAAe5sC,IACzB,IAAIp4B,EAASo4B,EAAEnkB,EAAKL,OAChB5T,GAAUA,GAAUmhC,IACpB6e,EAAMzkD,KAAKyE,EAAO,IAEtBiU,EAAKsgE,eACLv0B,EAAMzkD,KAAK+kF,GAAclrE,OAAOnB,EAAKL,MAAMiT,IAAK,CAAC5S,EAAKsgE,cAAcvG,QACjEmU,GAAgBh5E,KAAK62C,EAChC,CAEA,MAAMkjC,GAAiB,CACnBC,WAAW,EACXC,eAAe,EACfC,uBAAuB,EACvB3pC,YAAY,EACZ4pC,mBAAmB,EACnBR,SAAS,GAGPS,GAAc/oD,GAAM8oC,GAAc,GACxC,MAAMkgB,GACF/mF,cACIrC,KAAK6oE,WAAa,KAClB7oE,KAAK8oE,aAAe,EACpB9oE,KAAK2oE,UAAY,KACjB3oE,KAAK4oE,YAAc,CACvB,CACAngE,IAAIkwC,GACA34C,KAAK6oE,WAAalwB,EAAIkwB,WACtB7oE,KAAK8oE,aAAenwB,EAAImwB,aACxB9oE,KAAK2oE,UAAYhwB,EAAIgwB,UACrB3oE,KAAK4oE,YAAcjwB,EAAIiwB,WAC3B,CACA1lC,QACIljC,KAAK6oE,WAAa7oE,KAAK2oE,UAAY,IACvC,CACA/5B,GAAG+J,GACC,OAAOA,EAAIkwB,YAAc7oE,KAAK6oE,YAAclwB,EAAImwB,cAAgB9oE,KAAK8oE,cACjEnwB,EAAIgwB,WAAa3oE,KAAK2oE,WAAahwB,EAAIiwB,aAAe5oE,KAAK4oE,WACnE,EAEJ,MAAMygB,GACFhnF,YAAYwX,EAAMyvE,GACdtpF,KAAK6Z,KAAOA,EACZ7Z,KAAKspF,gBAAkBA,EACvBtpF,KAAKupF,MAAQ,GACbvpF,KAAK6jF,cAAgB,EACrB7jF,KAAKwpF,SAAW,KAChBxpF,KAAK+5E,iBAAmB,IAAIqP,GAC5BppF,KAAKypF,WAAa,KAClBzpF,KAAK0pF,6BAA8B,EACnC1pF,KAAKwpF,SAAWjvB,OAAOovB,kBACnB,IAAIpvB,OAAOovB,kBAAiBC,IACxB,IAAK,IAAIppF,EAAI,EAAGA,EAAIopF,EAAUtpF,OAAQE,IAClCR,KAAKupF,MAAMpoF,KAAKyoF,EAAUppF,IAK1B4/B,GAAM8oC,GAAc,IAAM0gB,EAAUp4D,MAAKyJ,GAAe,aAAVA,EAAEp2B,MAAuBo2B,EAAE4uD,aAAavpF,QAC5E,iBAAV26B,EAAEp2B,MAA2Bo2B,EAAE03C,SAASryE,OAAS26B,EAAE14B,OAAOszD,UAAUv1D,SACpEN,KAAKwlF,YAELxlF,KAAKoH,OAAO,IAEpB+hF,KACAnpF,KAAKypF,WAAaj/E,IACdxK,KAAKupF,MAAMpoF,KAAK,CAAEoB,OAAQiI,EAAEjI,OAAQsC,KAAM,gBAAiB8tE,SAAUnoE,EAAEs/E,YACvE9pF,KAAKwlF,WAAW,GAGxBxlF,KAAK+pF,kBAAoB/pF,KAAK+pF,kBAAkBl5B,KAAK7wD,KACzD,CACAwlF,YACQxlF,KAAK6jF,aAAe,IACpB7jF,KAAK6jF,aAAetpB,OAAO1zD,YAAW,KAAQ7G,KAAK6jF,cAAgB,EAAG7jF,KAAKoH,OAAO,GAAK,IAC/F,CACAs6E,aACQ1hF,KAAK6jF,cAAgB,IACrBtpB,OAAOpzD,aAAanH,KAAK6jF,cACzB7jF,KAAK6jF,cAAgB,EACrB7jF,KAAKoH,QAEb,CACAqH,QACQzO,KAAKwpF,WACLxpF,KAAKwpF,SAASQ,cACdhqF,KAAKwpF,SAASS,QAAQjqF,KAAK6Z,KAAK2mB,IAAKsoD,KAErC9oF,KAAKypF,YACLzpF,KAAK6Z,KAAK2mB,IAAIyE,iBAAiB,2BAA4BjlC,KAAKypF,YACpEzpF,KAAK+6E,kBACT,CACAzI,OACI,GAAItyE,KAAKwpF,SAAU,CACf,IAAIU,EAAOlqF,KAAKwpF,SAASQ,cACzB,GAAIE,EAAK5pF,OAAQ,CACb,IAAK,IAAIE,EAAI,EAAGA,EAAI0pF,EAAK5pF,OAAQE,IAC7BR,KAAKupF,MAAMpoF,KAAK+oF,EAAK1pF,IACzB+5D,OAAO1zD,YAAW,IAAM7G,KAAKoH,SAAS,GAC1C,CACApH,KAAKwpF,SAASW,YAClB,CACInqF,KAAKypF,YACLzpF,KAAK6Z,KAAK2mB,IAAI2E,oBAAoB,2BAA4BnlC,KAAKypF,YACvEzpF,KAAKk6E,qBACT,CACAa,mBACI/6E,KAAK6Z,KAAK2mB,IAAIy2B,cAAchyB,iBAAiB,kBAAmBjlC,KAAK+pF,kBACzE,CACA7P,sBACIl6E,KAAK6Z,KAAK2mB,IAAIy2B,cAAc9xB,oBAAoB,kBAAmBnlC,KAAK+pF,kBAC5E,CACAK,2BACIpqF,KAAK0pF,6BAA8B,EACnC7iF,YAAW,IAAM7G,KAAK0pF,6BAA8B,GAAO,GAC/D,CACAK,oBACI,GAAK3O,GAAqBp7E,KAAK6Z,MAA/B,CAEA,GAAI7Z,KAAK0pF,4BACL,OAAOjQ,GAAez5E,KAAK6Z,MAI/B,GAAIumB,GAAM8oC,GAAc,KAAOlpE,KAAK6Z,KAAKL,MAAMyuB,UAAUlB,MAAO,CAC5D,IAAI4R,EAAM34C,KAAK6Z,KAAK67D,oBAEpB,GAAI/8B,EAAIgwB,WAAaT,EAAqBvvB,EAAIgwB,UAAWhwB,EAAIiwB,YAAajwB,EAAIkwB,WAAYlwB,EAAImwB,cAC1F,OAAO9oE,KAAKwlF,WACpB,CACAxlF,KAAKoH,OAZK,CAad,CACA6yE,kBACIj6E,KAAK+5E,iBAAiBtxE,IAAIzI,KAAK6Z,KAAK67D,oBACxC,CACA2U,sBAAsB1xC,GAClB,IAAKA,EAAIgwB,UACL,OAAO,EACX,IAAyB2hB,EAArBC,EAAY,IAAIxmD,IACpB,IAAK,IAAIgd,EAAOpI,EAAIgwB,UAAW5nB,EAAMA,EAAO/e,EAAW+e,GACnDwpC,EAAU56E,IAAIoxC,GAClB,IAAK,IAAIA,EAAOpI,EAAIkwB,WAAY9nB,EAAMA,EAAO/e,EAAW+e,GACpD,GAAIwpC,EAAU1+E,IAAIk1C,GAAO,CACrBupC,EAAYvpC,EACZ,KACJ,CACJ,IAAI54C,EAAOmiF,GAAatqF,KAAK6Z,KAAKi0D,QAAQC,YAAYuc,GACtD,OAAIniF,GAAQA,EAAK4pE,eAAe,CAC5BltE,KAAM,YACNtC,OAA8B,GAAtB+nF,EAAUj6C,SAAgBi6C,EAAUtoD,WAAasoD,KAEzDtqF,KAAKi6E,mBACE,QALX,CAOJ,CACA7yE,QACI,IAAI,KAAEyS,GAAS7Z,KACf,IAAK6Z,EAAKi0D,SAAW9tE,KAAK6jF,cAAgB,EACtC,OACJ,IAAI+F,EAAY5pF,KAAKwpF,SAAWxpF,KAAKwpF,SAASQ,cAAgB,GAC1DhqF,KAAKupF,MAAMjpF,SACXspF,EAAY5pF,KAAKupF,MAAMlpF,OAAOupF,GAC9B5pF,KAAKupF,MAAMjpF,OAAS,GAExB,IAAIq4C,EAAM9+B,EAAK67D,oBACX8U,GAAUxqF,KAAK0pF,8BAAgC1pF,KAAK+5E,iBAAiBnrC,GAAG+J,IAAQyiC,GAAqBvhE,KAAU7Z,KAAKqqF,sBAAsB1xC,GAC1I5pC,GAAQ,EAAG+3B,GAAM,EAAG2jD,GAAW,EAAO3+C,EAAQ,GAClD,GAAIjyB,EAAKwhC,SACL,IAAK,IAAI76C,EAAI,EAAGA,EAAIopF,EAAUtpF,OAAQE,IAAK,CACvC,IAAIoF,EAAS5F,KAAK0qF,iBAAiBd,EAAUppF,GAAIsrC,GAC7ClmC,IACAmJ,EAAOA,EAAO,EAAInJ,EAAOmJ,KAAOzK,KAAKG,IAAImB,EAAOmJ,KAAMA,GACtD+3B,EAAKA,EAAK,EAAIlhC,EAAOkhC,GAAKxiC,KAAKC,IAAIqB,EAAOkhC,GAAIA,GAC1ClhC,EAAO6kF,WACPA,GAAW,GAEvB,CAEJ,GAAIthB,GAASr9B,EAAMxrC,OAAS,EAAG,CAC3B,IAAIqqF,EAAM7+C,EAAM1+B,QAAOwtB,GAAmB,MAAdA,EAAEi6B,WAC9B,GAAkB,GAAd81B,EAAIrqF,OAAa,CACjB,IAAI2xB,EAAI04D,EAAI,GAAIz4D,EAAIy4D,EAAI,GACpB14D,EAAE+P,YAAc/P,EAAE+P,WAAWA,YAAc9P,EAAE8P,WAC7C9P,EAAExjB,SAEFujB,EAAEvjB,QACV,CACJ,CACA,IAAIk8E,EAAU,KAIV77E,EAAO,GAAKy7E,GAAU3wE,EAAKrN,MAAMqzE,UAAYl7E,KAAKD,MAAQ,KAC1DJ,KAAKC,IAAIsV,EAAKrN,MAAMszE,UAAWjmE,EAAKrN,MAAMgzE,UAAUn5E,MAAQ1B,KAAKD,MAAQ,KACzE+jE,EAAmB9vB,KAASiyC,EAAU1R,GAAiBr/D,KACvD+wE,EAAQh8C,GAAG,UAAe/0B,EAAKL,MAAMiT,IAAI1hB,QAAQ,GAAI,KACrD8O,EAAKrN,MAAMqzE,UAAY,EACvBpG,GAAe5/D,GACf7Z,KAAK+5E,iBAAiBtxE,IAAIkwC,GAC1B9+B,EAAKgxE,sBAEA97E,GAAQ,GAAKy7E,KACdz7E,GAAQ,IACR8K,EAAKi0D,QAAQoE,UAAUnjE,EAAM+3B,GAkE7C,SAAkBjtB,GACd,IAAIixE,GAAWj/E,IAAIgO,KAEnBixE,GAAWriF,IAAIoR,EAAM,OACoE,IAArF,CAAC,SAAU,SAAU,YAAYoW,QAAQslD,iBAAiB17D,EAAK2mB,KAAKuqD,aAAoB,CAExF,GADAlxE,EAAKk/D,sBAAwB5P,EACzB6hB,GACA,OACJ7nD,QAAc,KAAE,4KAChB6nD,IAAiB,CACrB,CACJ,CA5EgBC,CAASpxE,IAEb7Z,KAAKspF,gBAAgBv6E,EAAM+3B,EAAI2jD,EAAU3+C,GACrCjyB,EAAKi0D,SAAWj0D,EAAKi0D,QAAQ6B,MAC7B91D,EAAKw1D,YAAYx1D,EAAKL,OAChBxZ,KAAK+5E,iBAAiBnrC,GAAG+J,IAC/B8gC,GAAe5/D,GACnB7Z,KAAK+5E,iBAAiBtxE,IAAIkwC,GAElC,CACA+xC,iBAAiBhY,EAAK5mC,GAElB,GAAIA,EAAM7b,QAAQyiD,EAAInwE,SAAW,EAC7B,OAAO,KACX,IAAI4F,EAAOnI,KAAK6Z,KAAKi0D,QAAQC,YAAY2E,EAAInwE,QAC7C,GAAgB,cAAZmwE,EAAI7tE,OACHsD,GAAQnI,KAAK6Z,KAAKi0D,SAAgC,mBAArB4E,EAAIwY,eAER,SAArBxY,EAAIwY,gBAA6BxY,EAAIC,WAAaD,EAAInwE,OAAOuxC,aAAa,UAC/E,OAAO,KACX,IAAK3rC,GAAQA,EAAK4pE,eAAeW,GAC7B,OAAO,KACX,GAAgB,aAAZA,EAAI7tE,KAAqB,CACzB,IAAK,IAAIrE,EAAI,EAAGA,EAAIkyE,EAAIyY,WAAW7qF,OAAQE,IACvCsrC,EAAM3qC,KAAKuxE,EAAIyY,WAAW3qF,IAC9B,GAAI2H,EAAKovD,YAAcpvD,EAAKovD,YAAcpvD,EAAKq4B,MAAQr4B,EAAKovD,WAAWc,SAASqa,EAAInwE,QAChF,MAAO,CAAEwM,KAAM5G,EAAK6lE,UAAWlnC,GAAI3+B,EAAK8lE,UAC5C,IAAI1vB,EAAOm0B,EAAI3c,gBAAiBhkD,EAAO2gE,EAAIpc,YAC3C,GAAIl2B,GAAM8oC,GAAc,IAAMwJ,EAAIyY,WAAW7qF,OAGzC,IAAK,IAAIE,EAAI,EAAGA,EAAIkyE,EAAIyY,WAAW7qF,OAAQE,IAAK,CAC5C,IAAI,gBAAEu1D,EAAe,YAAEO,GAAgBoc,EAAIyY,WAAW3qF,KACjDu1D,GAAmBj0D,MAAMR,UAAU2uB,QAAQluB,KAAK2wE,EAAIyY,WAAYp1B,GAAmB,KACpFxX,EAAOwX,KACNO,GAAex0D,MAAMR,UAAU2uB,QAAQluB,KAAK2wE,EAAIyY,WAAY70B,GAAe,KAC5EvkD,EAAOukD,EACf,CAEJ,IAAI4a,EAAa3yB,GAAQA,EAAKvc,YAAc0wC,EAAInwE,OAC1CmlE,EAASnpB,GAAQ,EAAI,EACvBxvC,EAAO5G,EAAKooE,gBAAgBmC,EAAInwE,OAAQ2uE,GAAa,GACrDC,EAAWp/D,GAAQA,EAAKiwB,YAAc0wC,EAAInwE,OACxCmlE,EAAS31D,GAAQ2gE,EAAInwE,OAAOm1D,WAAWp3D,OAE7C,MAAO,CAAEyO,OAAM+3B,GADN3+B,EAAKooE,gBAAgBmC,EAAInwE,OAAQ4uE,EAAU,GAExD,CACK,MAAgB,cAAZuB,EAAI7tE,KACF,CAAEkK,KAAM5G,EAAKkmE,WAAalmE,EAAKmmE,OAAQxnC,GAAI3+B,EAAKmoE,SAAWnoE,EAAKmmE,QAGhE,CACHv/D,KAAM5G,EAAKkmE,WACXvnC,GAAI3+B,EAAKmoE,SAKTma,SAAU/X,EAAInwE,OAAOszD,WAAa6c,EAAIC,SAGlD,EAEJ,IAAImY,GAAa,IAAIjuD,QACjBmuD,IAAiB,EA2FrB,SAASx0B,GAAah2B,GAClB,IAAIr4B,EAAOq4B,EAAIgoC,WACf,GAAIrgE,EACA,OAAOA,EAAKgoE,YAEX,GAAoB,MAAhB3vC,EAAIq0B,UAAoBr0B,EAAIwB,WAAY,CAI7C,GAAIqnC,GAAU,aAAahkE,KAAKm7B,EAAIwB,WAAW6yB,UAAW,CACtD,IAAI6B,EAAO9hD,SAASyM,cAAc,OAElC,OADAq1C,EAAKh1B,YAAY9sB,SAASyM,cAAc,OACjC,CAAEq1C,OACb,CACK,GAAIl2B,EAAIwB,WAAW6Q,WAAarS,GAAO6oC,GAAU,gBAAgBhkE,KAAKm7B,EAAIwB,WAAW6yB,UACtF,MAAO,CAAEhD,QAAQ,EAEzB,MACK,GAAoB,OAAhBrxB,EAAIq0B,UAAqBr0B,EAAIsT,aAAa,oBAC/C,MAAO,CAAE+d,QAAQ,GAErB,OAAO,IACX,CACA,MAAMnb,GAAW,yKAmMjB,SAAS00C,GAAiBvxE,EAAM4S,EAAK4+D,GACjC,OAAI/mF,KAAKC,IAAI8mF,EAAU1wB,OAAQ0wB,EAAUnlE,MAAQuG,EAAItsB,QAAQ8Q,KAClD,KACJqoE,GAAiBz/D,EAAM4S,EAAI1hB,QAAQsgF,EAAU1wB,QAASluC,EAAI1hB,QAAQsgF,EAAUnlE,MACvF,CAiDA,SAASolE,GAAsBrqC,EAAMsqC,EAASC,GAC1C,IAAIliE,EAAQ23B,EAAK33B,MAAO1a,EAAM28E,EAAUtqC,EAAKryC,MAAQqyC,EAAK36B,IAC1D,KAAOgD,EAAQ,IAAMiiE,GAAWtqC,EAAKlQ,WAAWznB,IAAU23B,EAAK9yC,KAAKmb,GAAOspB,aACvEtpB,IACA1a,IACA28E,GAAU,EAEd,GAAIC,EAAS,CACT,IAAIz5E,EAAOkvC,EAAK9yC,KAAKmb,GAAO2zB,WAAWgE,EAAKlQ,WAAWznB,IACvD,KAAOvX,IAASA,EAAKm1C,QACjBn1C,EAAOA,EAAKkkC,WACZrnC,GAER,CACA,OAAOA,CACX,CA0CA,MAAM68E,GAQFppF,YAAY0xB,EAAOiJ,GACfh9B,KAAK0rF,MAAQ,KAIb1rF,KAAKghF,SAAU,EAIfhhF,KAAK62E,YAAc,KACnB72E,KAAKmuC,SAAU,EAIfnuC,KAAK+jF,WAAa,KAIlB/jF,KAAKm6E,cAAgB,KAIrBn6E,KAAKk7E,0BAAuBp6E,EAI5Bd,KAAKwM,MAAQ,IAAI6yE,GACjBr/E,KAAK2rF,kBAAoB,GACzB3rF,KAAK4rF,YAAc,GAMnB5rF,KAAK+4E,uBAAwB,EAM7B/4E,KAAK8kF,SAAW,KAChB9kF,KAAK6rF,OAAS7uD,EACdh9B,KAAKwZ,MAAQwjB,EAAMxjB,MACnBxZ,KAAK8rF,cAAgB9uD,EAAM5D,SAAW,GACtCp5B,KAAK8rF,cAAct+E,QAAQu+E,IAC3B/rF,KAAKwiC,SAAWxiC,KAAKwiC,SAASquB,KAAK7wD,MACnCA,KAAKwgC,IAAOzM,GAASA,EAAMi4D,OAAUp3E,SAASyM,cAAc,OACxD0S,IACIA,EAAM2N,YACN3N,EAAM2N,YAAY1hC,KAAKwgC,KACF,mBAATzM,EACZA,EAAM/zB,KAAKwgC,KACNzM,EAAMi4D,QACXhsF,KAAKmuC,SAAU,IAEvBnuC,KAAKq7C,SAAW4wC,GAAYjsF,MAC5BksF,GAAoBlsF,MACpBA,KAAKiiC,UAAYkqD,GAAensF,MAChCA,KAAK8tE,QAAU4I,GAAY12E,KAAKwZ,MAAMiT,IAAK2/D,GAAepsF,MAAO6oF,GAAgB7oF,MAAOA,KAAKwgC,IAAKxgC,MAClGA,KAAK85E,YAAc,IAAIuP,GAAYrpF,MAAM,CAAC+O,EAAM+3B,EAAI2jD,EAAU3+C,IAnXtE,SAAuBjyB,EAAM9K,EAAM+3B,EAAI2jD,EAAUU,GAC7C,GAAIp8E,EAAO,EAAG,CACV,IAAIilB,EAASna,EAAKrN,MAAMkzE,kBAAoB/6E,KAAKD,MAAQ,GAAKmV,EAAKrN,MAAMizE,oBAAsB,KAC3F+K,EAAStR,GAAiBr/D,EAAMma,GACpC,GAAIw2D,IAAW3wE,EAAKL,MAAMyuB,UAAU2G,GAAG47C,GAAS,CAC5C,GAAIhmC,GAAUglB,GACiB,KAA3B3vD,EAAKrN,MAAM8yE,aAAsB36E,KAAKD,MAAQ,IAAMmV,EAAKrN,MAAM+yE,iBAC/D1lE,EAAK+wD,SAAS,iBAAiB5sC,GAAKA,EAAEnkB,EAAMkvD,EAAS,GAAI,YACzD,OACJ,IAAIzgC,EAAKzuB,EAAKL,MAAM8uB,GAAG2D,aAAau+C,GACtB,WAAVx2D,EACAsU,EAAG4D,QAAQ,WAAW,GACP,OAAVlY,GACLsU,EAAG8D,iBACHvyB,EAAKijC,WACLxU,EAAG4D,QAAQ,cAAeryB,EAAKrN,MAAM0zE,eACzCrmE,EAAK2oB,SAAS8F,EAClB,CACA,MACJ,CACA,IAAIqhB,EAAU9vC,EAAKL,MAAMiT,IAAI1hB,QAAQgE,GACjCs9E,EAAS1iC,EAAQa,YAAY1jB,GACjC/3B,EAAO46C,EAAQj6C,OAAO28E,EAAS,GAC/BvlD,EAAKjtB,EAAKL,MAAMiT,IAAI1hB,QAAQ+7B,GAAI5qB,MAAMmwE,EAAS,GAC/C,IAGIC,EAAcC,EAHd5zC,EAAM9+B,EAAKL,MAAMyuB,UACjBpc,EA9FR,SAAsBhS,EAAM2yE,EAAOC,GAC/B,IAEI1wD,GAFE5tB,KAAMsiB,EAAM,WAAEygD,EAAU,SAAEC,EAAQ,KAAEpiE,EAAI,GAAE+3B,GAAOjtB,EAAKi0D,QAAQmD,WAAWub,EAAOC,GAClF/jB,EAAS7uD,EAAK67D,oBAEd/a,EAAS+N,EAAOG,WAQpB,GAPIlO,GAAU9gD,EAAK2mB,IAAI63B,SAA4B,GAAnBsC,EAAOtqB,SAAgBsqB,EAASA,EAAO34B,cACnEjG,EAAO,CAAC,CAAE5tB,KAAMwsD,EAAQ7mD,OAAQ40D,EAAOI,eAClCL,EAAmBC,IACpB3sC,EAAK56B,KAAK,CAAEgN,KAAMu6D,EAAOC,UAAW70D,OAAQ40D,EAAOE,eAIvDpkB,GAAqC,IAA3B3qC,EAAKrN,MAAM8yE,YACrB,IAAK,IAAI37C,EAAMwtC,EAAUxtC,EAAMutC,EAAYvtC,IAAO,CAC9C,IAAIx1B,EAAOsiB,EAAOinC,WAAW/zB,EAAM,GAAIx7B,EAAOgG,EAAKq6D,WACnD,GAAqB,MAAjBr6D,EAAK0mD,WAAqB1sD,EAAM,CAChCgpE,EAAWxtC,EACX,KACJ,CACA,IAAKx7B,GAAQA,EAAK8I,KACd,KACR,CAEJ,IAAIyxE,EAAW7oE,EAAKL,MAAMiT,IACtBhb,EAASoI,EAAK+wD,SAAS,cAAgB,gBAAqB/wD,EAAKL,MAAMqiB,QACvEmZ,EAAQ0tC,EAAS33E,QAAQgE,GACzB4pC,EAAM,KAAMlsB,EAAMhb,EAAOoa,MAAM4E,EAAQ,CACvC0/B,QAASnb,EAAMvkB,OACfwkC,SAAUjgB,EAAMvkB,OAAOqoB,eAAe9D,EAAMzmC,SAC5C4pD,SAAS,EACTppD,KAAMmiE,EACNpqC,GAAIqqC,EACJr7B,mBAAoD,OAAhCd,EAAMvkB,OAAO5rB,KAAK8qD,YAAsB,OAC5DuF,cAAen5B,EACfy6B,gBACA1gD,QAASk/B,IAEb,GAAIjZ,GAAuB,MAAfA,EAAK,GAAGzV,IAAa,CAC7B,IAAIq0C,EAAS5+B,EAAK,GAAGzV,IAAKJ,EAAO6V,EAAK,IAAMA,EAAK,GAAGzV,IACxC,MAARJ,IACAA,EAAOy0C,GACXhiB,EAAM,CAAEgiB,OAAQA,EAAS5rD,EAAMmX,KAAMA,EAAOnX,EAChD,CACA,MAAO,CAAE0d,MAAKksB,MAAK5pC,OAAM+3B,KAC7B,CAkDgB4lD,CAAa7yE,EAAM9K,EAAM+3B,GACjCra,EAAM5S,EAAKL,MAAMiT,IAAKkgE,EAAUlgE,EAAInnB,MAAMumB,EAAM9c,KAAM8c,EAAMib,IAGjC,IAA3BjtB,EAAKrN,MAAM8yE,aAAqB36E,KAAKD,MAAQ,IAAMmV,EAAKrN,MAAM+yE,iBAC9D+M,EAAezyE,EAAKL,MAAMyuB,UAAUnB,GACpCylD,EAAgB,QAGhBD,EAAezyE,EAAKL,MAAMyuB,UAAUl5B,KACpCw9E,EAAgB,SAEpB1yE,EAAKrN,MAAM8yE,YAAc,KACzB,IAAIsN,EAiOR,SAAkB36D,EAAGC,EAAG5L,EAAKgmE,EAAcC,GACvC,IAAI99E,EAAQwjB,EAAEk0B,cAAcj0B,EAAG5L,GAC/B,GAAa,MAAT7X,EACA,OAAO,KACX,IAAMwjB,EAAG46D,EAAM36D,EAAG46D,GAAS76D,EAAEs0B,YAAYr0B,EAAG5L,EAAM2L,EAAEhhB,KAAMqV,EAAM4L,EAAEjhB,MAiBlE,MAhBqB,OAAjBs7E,IAEAD,GAAgBO,EADHvoF,KAAKC,IAAI,EAAGkK,EAAQnK,KAAKG,IAAIooF,EAAMC,IAChBr+E,GAEhCo+E,EAAOp+E,GAASwjB,EAAEhhB,KAAOihB,EAAEjhB,MAE3BxC,GADW69E,GAAgB79E,GAAS69E,GAAgBO,EAAOp+E,EAAQ69E,EAAe,EAElFQ,EAAOr+E,GAASq+E,EAAOD,GACvBA,EAAOp+E,GAEFq+E,EAAOr+E,IAEZA,GADW69E,GAAgB79E,GAAS69E,GAAgBQ,EAAOr+E,EAAQ69E,EAAe,EAElFO,EAAOp+E,GAASo+E,EAAOC,GACvBA,EAAOr+E,GAEJ,CAAEA,QAAOo+E,OAAMC,OAC1B,CAvPiBC,CAASJ,EAAQxsF,QAAS0rB,EAAMY,IAAItsB,QAAS0rB,EAAM9c,KAAMu9E,EAAcC,GACpF,IAAKjjB,GAAOzvD,EAAKrN,MAAMmzE,aAAeh7E,KAAKD,MAAQ,KAAO8kE,IACtD2hB,EAAW35D,MAAKoJ,GAAmB,GAAdA,EAAEyV,WAAkBqG,GAASrxC,KAAKu1B,EAAEi6B,eACvD+3B,GAAUA,EAAOC,MAAQD,EAAOE,OAClCjzE,EAAK+wD,SAAS,iBAAiB5sC,GAAKA,EAAEnkB,EAAMkvD,EAAS,GAAI,YAEzD,YADAlvD,EAAKrN,MAAMmzE,aAAe,GAG9B,IAAKiN,EAAQ,CACT,KAAInC,GAAY9xC,aAAe,OAAkBA,EAAI5R,OAAS4R,EAAIkL,MAAMtL,WAAWI,EAAIxE,WAClFt6B,EAAKijC,WAAejxB,EAAM8sB,KAAO9sB,EAAM8sB,IAAIgiB,QAAU9uC,EAAM8sB,IAAIzyB,KAG/D,CACD,GAAI2F,EAAM8sB,IAAK,CACX,IAAIA,EAAMyyC,GAAiBvxE,EAAMA,EAAKL,MAAMiT,IAAKZ,EAAM8sB,KACvD,GAAIA,IAAQA,EAAI/J,GAAG/0B,EAAKL,MAAMyuB,WAAY,CACtC,IAAIK,EAAKzuB,EAAKL,MAAM8uB,GAAG2D,aAAa0M,GAChC9+B,EAAKijC,WACLxU,EAAG4D,QAAQ,cAAeryB,EAAKrN,MAAM0zE,eACzCrmE,EAAK2oB,SAAS8F,EAClB,CACJ,CACA,MACJ,CAbIskD,EAAS,CAAEn+E,MAAOkqC,EAAI5pC,KAAM89E,KAAMl0C,EAAI7R,GAAIgmD,KAAMn0C,EAAI7R,GAc5D,CAGA,GAAI0d,GAAU3qC,EAAKsgE,eAAiBtuD,EAAM8sB,KAAO9sB,EAAM8sB,IAAIgiB,QAAU9gD,EAAKsgE,cAAcvG,KAAK7kE,MACzF8c,EAAM8sB,IAAIzyB,MAAQ2F,EAAM8sB,IAAIgiB,OAAQ,CACpC,IAAI1pD,EAAO27E,EAAOE,KAAOF,EAAOn+E,MAChCod,EAAM8sB,IAAM,CAAEgiB,OAAQ9uC,EAAM8sB,IAAIgiB,OAAS1pD,EAAMiV,KAAM2F,EAAM8sB,IAAIgiB,OAAS1pD,EAC5E,CACA4I,EAAKrN,MAAM2zE,iBAIPtmE,EAAKL,MAAMyuB,UAAUl5B,KAAO8K,EAAKL,MAAMyuB,UAAUnB,IACjD8lD,EAAOn+E,OAASm+E,EAAOE,MACvBjzE,EAAKL,MAAMyuB,qBAAqB,OAC5B2kD,EAAOn+E,MAAQoL,EAAKL,MAAMyuB,UAAUl5B,MAAQ69E,EAAOn+E,OAASoL,EAAKL,MAAMyuB,UAAUl5B,KAAO,GACxF8K,EAAKL,MAAMyuB,UAAUl5B,MAAQ8c,EAAM9c,KACnC69E,EAAOn+E,MAAQoL,EAAKL,MAAMyuB,UAAUl5B,KAE/B69E,EAAOC,KAAOhzE,EAAKL,MAAMyuB,UAAUnB,IAAM8lD,EAAOC,MAAQhzE,EAAKL,MAAMyuB,UAAUnB,GAAK,GACvFjtB,EAAKL,MAAMyuB,UAAUnB,IAAMjb,EAAMib,KACjC8lD,EAAOE,MAASjzE,EAAKL,MAAMyuB,UAAUnB,GAAK8lD,EAAOC,KACjDD,EAAOC,KAAOhzE,EAAKL,MAAMyuB,UAAUnB,KAMvC1G,GAAM8oC,GAAc,IAAM0jB,EAAOE,MAAQF,EAAOn+E,MAAQ,GACxDm+E,EAAOC,MAAQD,EAAOn+E,OAASm+E,EAAOn+E,MAAQod,EAAM9c,MACmC,MAAvF8c,EAAMY,IAAIsxB,YAAY6uC,EAAOn+E,MAAQod,EAAM9c,KAAO,EAAG69E,EAAOn+E,MAAQod,EAAM9c,KAAO,KACjF69E,EAAOn+E,QACPm+E,EAAOC,OACPD,EAAOE,QAEX,IAIIE,EAJAh4C,EAAQnpB,EAAMY,IAAI28B,eAAewjC,EAAOn+E,MAAQod,EAAM9c,MACtD0oC,EAAM5rB,EAAMY,IAAI28B,eAAewjC,EAAOE,KAAOjhE,EAAM9c,MACnDk+E,EAASxgE,EAAI1hB,QAAQ6hF,EAAOn+E,OAC5By+E,EAAel4C,EAAMuD,WAAWd,IAAQzC,EAAMvkB,OAAO2pB,eAAiB6yC,EAAOr+E,OAASg+E,EAAOC,KAIjG,IAAMvjB,GAAOzvD,EAAKrN,MAAMmzE,aAAeh7E,KAAKD,MAAQ,OAC9CwoF,GAAgB/B,EAAW35D,MAAKoJ,GAAmB,OAAdA,EAAEi6B,UAAmC,KAAdj6B,EAAEi6B,cAC9Dq4B,GAAgBl4C,EAAM1uB,IAAMuF,EAAMY,IAAItsB,QAAQ8Q,OAC3C+7E,EAAU,cAAmBnhE,EAAMY,IAAI1hB,QAAQiqC,EAAM1uB,IAAM,GAAI,GAAG,KACnE0mE,EAAQ9mE,MAAQuxB,EAAInxB,MACxBzM,EAAK+wD,SAAS,iBAAiB5sC,GAAKA,EAAEnkB,EAAMkvD,EAAS,GAAI,YAEzD,YADAlvD,EAAKrN,MAAMmzE,aAAe,GAI9B,GAAI9lE,EAAKL,MAAMyuB,UAAU0yB,OAASiyB,EAAOn+E,OAiH7C,SAAuB0+E,EAAK1+E,EAAOG,EAAKw+E,EAAWC,GAC/C,IAAKD,EAAU38D,OAAOmoB,aAElBhqC,EAAMH,GAAS4+E,EAAQ/mE,IAAM8mE,EAAU9mE,KAEvCglE,GAAsB8B,GAAW,GAAM,GAASC,EAAQ/mE,IACxD,OAAO,EACX,IAAIuqB,EAASs8C,EAAIpiF,QAAQ0D,GAEzB,GAAIoiC,EAAOoE,aAAepE,EAAOpgB,OAAOtwB,QAAQ8Q,OAAS4/B,EAAOpgB,OAAOmoB,YACnE,OAAO,EACX,IAAI00C,EAAQH,EAAIpiF,QAAQugF,GAAsBz6C,GAAQ,GAAM,IAE5D,SAAKy8C,EAAM78D,OAAOmoB,aAAe00C,EAAMhnE,IAAM1X,GACzC08E,GAAsBgC,GAAO,GAAM,GAAS1+E,IAGzCw+E,EAAU38D,OAAOtwB,QAAQinD,IAAIgmC,EAAUn4C,cAAcrG,GAAG0+C,EAAM78D,OAAOtwB,QAChF,CAlIQotF,CAAc9gE,EAAKmgE,EAAOn+E,MAAOm+E,EAAOC,KAAM73C,EAAOyC,IACrD59B,EAAK+wD,SAAS,iBAAiB5sC,GAAKA,EAAEnkB,EAAMkvD,EAAS,EAAG,gBAGxD,YAFIS,GAAWhlB,GACX3qC,EAAKigE,YAAYsQ,4BAMrB5lC,GAAUglB,GAAWojB,EAAOE,MAAQF,EAAOn+E,QAC3CoL,EAAKrN,MAAMuzE,kBAAoBp7E,KAAKD,OASpC8kE,IAAY0jB,GAAgBl4C,EAAMvmC,SAAWgpC,EAAIhpC,SAA+B,GAApBgpC,EAAIxC,cAAqBD,EAAM1rB,OAASmuB,EAAInuB,OACxGuC,EAAM8sB,KAAO9sB,EAAM8sB,IAAIgiB,QAAU9uC,EAAM8sB,IAAIzyB,MAAQ2F,EAAM8sB,IAAIzyB,MAAQ0mE,EAAOC,OAC5ED,EAAOE,MAAQ,EACfr1C,EAAM5rB,EAAMY,IAAI28B,eAAewjC,EAAOE,KAAOjhE,EAAM9c,MACnDlI,YAAW,KACPgT,EAAK+wD,SAAS,iBAAiB,SAAU5sC,GAAK,OAAOA,EAAEnkB,EAAMkvD,EAAS,GAAI,SAAW,GAAE,GACxF,KAEP,IACIzgC,EAAI2a,EAAauqC,EADjBC,EAASb,EAAOn+E,MAAOi/E,EAAOd,EAAOC,KAEzC,GAAIK,EACA,GAAIl4C,EAAM1uB,KAAOmxB,EAAInxB,IAGb8Z,GAAM8oC,GAAc,IAA4B,GAAtBl0B,EAAMC,eAChCp7B,EAAKigE,YAAYsQ,2BACjBvjF,YAAW,IAAM4yE,GAAe5/D,IAAO,KAE3CyuB,EAAKzuB,EAAKL,MAAM8uB,GAAGrF,OAAOwqD,EAAQC,GAClCzqC,EAAcx2B,EAAI1hB,QAAQ6hF,EAAOn+E,OAAO87C,YAAY99B,EAAI1hB,QAAQ6hF,EAAOC,YAEtE,GACLD,EAAOC,MAAQD,EAAOE,OACjBU,EA4Cb,SAAsBlgC,EAAK/O,GACvB,IAC2C15C,EAAMuuC,EAAM5R,EADnDmsD,EAAWrgC,EAAIrX,WAAWra,MAAOgyD,EAAYrvC,EAAKtI,WAAWra,MAC7DkQ,EAAQ6hD,EAAUtmB,EAAUumB,EAChC,IAAK,IAAIptF,EAAI,EAAGA,EAAIotF,EAAUttF,OAAQE,IAClCsrC,EAAQ8hD,EAAUptF,GAAGg8B,cAAcsP,GACvC,IAAK,IAAItrC,EAAI,EAAGA,EAAImtF,EAASrtF,OAAQE,IACjC6mE,EAAUsmB,EAASntF,GAAGg8B,cAAc6qC,GACxC,GAAoB,GAAhBv7B,EAAMxrC,QAAiC,GAAlB+mE,EAAQ/mE,OAC7B8yC,EAAOtH,EAAM,GACbjnC,EAAO,MACP28B,EAAUrzB,GAASA,EAAKilC,KAAKA,EAAK7W,SAASpuB,EAAKytB,YAE/C,IAAoB,GAAhBkQ,EAAMxrC,QAAiC,GAAlB+mE,EAAQ/mE,OAMlC,OAAO,KALP8yC,EAAOi0B,EAAQ,GACfxiE,EAAO,SACP28B,EAAUrzB,GAASA,EAAKilC,KAAKA,EAAK5W,cAAcruB,EAAKytB,OAIzD,CACA,IAAIwS,EAAU,GACd,IAAK,IAAI5tC,EAAI,EAAGA,EAAI+9C,EAAK3L,WAAYpyC,IACjC4tC,EAAQjtC,KAAKqgC,EAAO+c,EAAKzrB,MAAMtyB,KACnC,GAAI,UAAc4tC,GAASQ,GAAG0e,GAC1B,MAAO,CAAEla,OAAMvuC,OACvB,CArE0BgpF,CAAa74C,EAAMvkB,OAAOtwB,QAAQinD,IAAIpS,EAAMC,aAAcwC,EAAIxC,cAAeg4C,EAAOx8D,OAAOtwB,QAAQinD,IAAI6lC,EAAOh4C,aAAc23C,EAAOC,KAAOI,EAAOx+E,WAC/J65B,EAAKzuB,EAAKL,MAAM8uB,GACO,OAAnBklD,EAAW3oF,KACXyjC,EAAGoL,QAAQ+5C,EAAQC,EAAMF,EAAWp6C,MAEpC9K,EAAGmL,WAAWg6C,EAAQC,EAAMF,EAAWp6C,WAE1C,GAAI4B,EAAMvkB,OAAOqC,MAAMkiB,EAAMzmC,SAASotB,QAAUqZ,EAAMzmC,SAAWkpC,EAAIlpC,SAAWkpC,EAAIsS,WAAa,EAAI,GAAI,CAE1G,IAAIvyC,EAAOw9B,EAAMvkB,OAAOstB,YAAY/I,EAAMC,aAAcwC,EAAIxC,cAC5D,GAAIp7B,EAAK+wD,SAAS,mBAAmB5sC,GAAKA,EAAEnkB,EAAM4zE,EAAQC,EAAMl2E,KAC5D,OACJ8wB,EAAKzuB,EAAKL,MAAM8uB,GAAG4H,WAAW14B,EAAMi2E,EAAQC,EAChD,CAIJ,GAFKplD,IACDA,EAAKzuB,EAAKL,MAAM8uB,GAAGnjC,QAAQsoF,EAAQC,EAAM7hE,EAAMY,IAAInnB,MAAMsnF,EAAOn+E,MAAQod,EAAM9c,KAAM69E,EAAOE,KAAOjhE,EAAM9c,QACxG8c,EAAM8sB,IAAK,CACX,IAAIA,EAAMyyC,GAAiBvxE,EAAMyuB,EAAG7b,IAAKZ,EAAM8sB,KAM3CA,KAAS6L,GAAUglB,GAAW3vD,EAAKijC,WAAanE,EAAI5R,QACnD6lD,EAAOn+E,OAASm+E,EAAOE,MAAQjzE,EAAKrN,MAAMuzE,kBAAoBp7E,KAAKD,MAAQ,OAC3Ei0C,EAAIzyB,MAAQunE,GAAU90C,EAAIzyB,MAAQoiB,EAAGM,QAAQ3oC,IAAIytF,GAAQ,IAC1DttD,GAAMuY,EAAI5R,OAAS4R,EAAIzyB,MAAQunE,IAC/BnlD,EAAG2D,aAAa0M,EACxB,CACIsK,GACA3a,EAAGyzB,YAAY9Y,GACfppC,EAAKijC,WACLxU,EAAG4D,QAAQ,cAAeryB,EAAKrN,MAAM0zE,eACzCrmE,EAAK2oB,SAAS8F,EAAG8D,iBACrB,CAkLgF0hD,CAAc9tF,KAAM+O,EAAM+3B,EAAI2jD,EAAU3+C,KAChH9rC,KAAK85E,YAAYrrE,QA9kEzB,SAAmBoL,GACf,IAAK,IAAIzE,KAAS2d,GAAU,CACxB,IAAIjI,EAAUiI,GAAS3d,GACvByE,EAAK2mB,IAAIyE,iBAAiB7vB,EAAOyE,EAAKrN,MAAM4zE,cAAchrE,GAAUA,KAC5DsrE,GAAmB7mE,EAAMzE,IAAWorE,GAAiB3mE,EAAMzE,KAC1DyE,EAAKwhC,UAAcjmC,EAAMvQ,QAAQo6E,IAClCn0D,EAAQjR,EAAMzE,EAAM,EACzB8pE,GAAgB9pE,GAAS,CAAE24E,SAAS,QAASjtF,EACpD,CAIIuoE,GACAxvD,EAAK2mB,IAAIyE,iBAAiB,SAAS,IAAM,OAC7Cq7C,GAAgBzmE,EACpB,CAgkEQm0E,CAAUhuF,MACVA,KAAKiuF,mBACT,CAMInxC,gBAAc,OAAO98C,KAAKwM,MAAMswC,SAAW,CAI3C9f,YACA,GAAIh9B,KAAK6rF,OAAOryE,OAASxZ,KAAKwZ,MAAO,CACjC,IAAI+kC,EAAOv+C,KAAK6rF,OAChB7rF,KAAK6rF,OAAS,CAAC,EACf,IAAK,IAAIppF,KAAQ87C,EACbv+C,KAAK6rF,OAAOppF,GAAQ87C,EAAK97C,GAC7BzC,KAAK6rF,OAAOryE,MAAQxZ,KAAKwZ,KAC7B,CACA,OAAOxZ,KAAK6rF,MAChB,CAKArqD,OAAOxE,GACCA,EAAMsQ,iBAAmBttC,KAAK6rF,OAAOv+C,iBACrCgzC,GAAgBtgF,MACpB,IAAIkuF,EAAYluF,KAAK6rF,OACrB7rF,KAAK6rF,OAAS7uD,EACVA,EAAM5D,UACN4D,EAAM5D,QAAQ5rB,QAAQu+E,IACtB/rF,KAAK8rF,cAAgB9uD,EAAM5D,SAE/Bp5B,KAAKmuF,iBAAiBnxD,EAAMxjB,MAAO00E,EACvC,CAMAE,SAASpxD,GACL,IAAIoR,EAAU,CAAC,EACf,IAAK,IAAI3rC,KAAQzC,KAAK6rF,OAClBz9C,EAAQ3rC,GAAQzC,KAAK6rF,OAAOppF,GAChC2rC,EAAQ50B,MAAQxZ,KAAKwZ,MACrB,IAAK,IAAI/W,KAAQu6B,EACboR,EAAQ3rC,GAAQu6B,EAAMv6B,GAC1BzC,KAAKwhC,OAAO4M,EAChB,CAKAihC,YAAY71D,GACRxZ,KAAKmuF,iBAAiB30E,EAAOxZ,KAAK6rF,OACtC,CACAsC,iBAAiB30E,EAAO00E,GACpB,IAAI3vC,EAAOv+C,KAAKwZ,MAAO60E,GAAS,EAAOC,GAAY,EAG/C90E,EAAMypC,aAAejjD,KAAK88C,YAC1B4mC,GAAiB1jF,MACjBsuF,GAAY,GAEhBtuF,KAAKwZ,MAAQA,EACb,IAAI+0E,EAAiBhwC,EAAKnlB,SAAW5f,EAAM4f,SAAWp5B,KAAK6rF,OAAOzyD,SAAW80D,EAAU90D,QACvF,GAAIm1D,GAAkBvuF,KAAK6rF,OAAOzyD,SAAW80D,EAAU90D,SAAWp5B,KAAK6rF,OAAO5pD,WAAaisD,EAAUjsD,UAAW,CAC5G,IAAIA,EAAYkqD,GAAensF,OAiY3C,SAA0BiyB,EAAGC,GACzB,IAAIs8D,EAAK,EAAGC,EAAK,EACjB,IAAK,IAAIh4D,KAAQxE,EAAG,CAChB,GAAIA,EAAEwE,IAASvE,EAAEuE,GACb,OAAO,EACX+3D,GACJ,CACA,IAAK,IAAIz0E,KAAKmY,EACVu8D,IACJ,OAAOD,GAAMC,CACjB,EA1YgBC,CAAiBzsD,EAAWjiC,KAAKiiC,aACjCjiC,KAAKiiC,UAAYA,EACjBosD,GAAS,EAEjB,EACIE,GAAkBL,EAAU5gD,iBAAmBttC,KAAK6rF,OAAOv+C,kBAC3DgzC,GAAgBtgF,MAEpBA,KAAKq7C,SAAW4wC,GAAYjsF,MAC5BksF,GAAoBlsF,MACpB,IAAIiwE,EAAY4Y,GAAgB7oF,MAAOgwE,EAAYoc,GAAepsF,MAC9D2uF,EAASpwC,EAAKnlB,SAAW5f,EAAM4f,SAAYmlB,EAAK9xB,IAAImiB,GAAGp1B,EAAMiT,KAC3DjT,EAAMqxE,kBAAoBtsC,EAAKssC,kBAAoB,eAAiB,WADF,QAEpE+D,EAAYP,IAAWruF,KAAK8tE,QAAQiC,YAAYv2D,EAAMiT,IAAKujD,EAAWC,IACtE2e,GAAcp1E,EAAMyuB,UAAU2G,GAAG2P,EAAKtW,aACtCqmD,GAAY,GAChB,IAAIO,EAAyB,YAAVF,GAAwBL,GAA8C,MAAjCtuF,KAAKwgC,IAAIpP,MAAM09D,gBAjzJ/E,SAAwBj1E,GACpB,IACIk1E,EAAQC,EADR/kB,EAAOpwD,EAAK2mB,IAAI0pC,wBAAyBoB,EAAShnE,KAAKC,IAAI,EAAG0lE,EAAK3uC,KAEvE,IAAK,IAAId,GAAKyvC,EAAK56D,KAAO46D,EAAK36D,OAAS,EAAGiuB,EAAI+tC,EAAS,EAAG/tC,EAAIj5B,KAAKG,IAAIwqF,YAAahlB,EAAKJ,QAAStsC,GAAK,EAAG,CACvG,IAAIiD,EAAM3mB,EAAK3V,KAAK6oE,iBAAiBvyC,EAAG+C,GACxC,IAAKiD,GAAOA,GAAO3mB,EAAK2mB,MAAQ3mB,EAAK2mB,IAAI63B,SAAS73B,GAC9C,SACJ,IAAI0uD,EAAY1uD,EAAI0pC,wBACpB,GAAIglB,EAAU5zD,KAAOgwC,EAAS,GAAI,CAC9ByjB,EAASvuD,EACTwuD,EAASE,EAAU5zD,IACnB,KACJ,CACJ,CACA,MAAO,CAAEyzD,OAAQA,EAAQC,OAAQA,EAAQ/8E,MAAOy5D,EAAY7xD,EAAK2mB,KACrE,CAkyJyG2uD,CAAenvF,MAChH,GAAIsuF,EAAW,CACXtuF,KAAK85E,YAAYxH,OAMjB,IAAI8c,EAAiBR,IAAcxuD,GAAMokB,KAAYxkD,KAAK88C,YACrDyB,EAAKtW,UAAUlB,QAAUvtB,EAAMyuB,UAAUlB,OAwV1D,SAAiCsoD,EAAMC,GACnC,IAAIhmE,EAAQhlB,KAAKG,IAAI4qF,EAAKl7C,QAAQqW,YAAY6kC,EAAKnpE,MAAOopE,EAAKn7C,QAAQqW,YAAY8kC,EAAKppE,OACxF,OAAOmpE,EAAKl7C,QAAQ1lC,MAAM6a,IAAUgmE,EAAKn7C,QAAQ1lC,MAAM6a,EAC3D,CA3VmEimE,CAAwBhxC,EAAKtW,UAAWzuB,EAAMyuB,WACrG,GAAI2mD,EAAW,CAKX,IAAIY,EAAehrC,EAAUxkD,KAAK62E,YAAc72E,KAAK01E,oBAAoB/M,UAAa,MAClF0lB,GAAWruF,KAAK8tE,QAAQtsC,OAAOhoB,EAAMiT,IAAKujD,EAAWC,EAAWjwE,QAChEA,KAAK8tE,QAAQoI,gBAAgB,IAC7Bl2E,KAAK8tE,QAAQ/rC,UACb/hC,KAAK8tE,QAAU4I,GAAYl9D,EAAMiT,IAAKujD,EAAWC,EAAWjwE,KAAKwgC,IAAKxgC,OAEtEwvF,IAAiBxvF,KAAK62E,cACtBuY,GAAiB,EACzB,CAKIA,KACEpvF,KAAKwM,MAAMmtE,WAAa35E,KAAK85E,YAAYC,iBAAiBnrC,GAAG5uC,KAAK01E,sBAvyFpF,SAA4B77D,GACxB,IAAI23D,EAAY33D,EAAKi0D,QAAQY,WAAW70D,EAAKL,MAAMyuB,UAAU0yB,OAAQ,GACjE+N,EAAS7uD,EAAK67D,oBAClB,OAAOxN,EAAqBsJ,EAAUrjE,KAAMqjE,EAAU19D,OAAQ40D,EAAOG,WAAYH,EAAOI,aAC5F,CAoyFoB2mB,CAAmBzvF,OACvBy5E,GAAez5E,KAAMovF,IAGrB1V,GAAkB15E,KAAMwZ,EAAMyuB,WAC9BjoC,KAAK85E,YAAYG,mBAErBj6E,KAAK85E,YAAYrrE,OACrB,CACAzO,KAAKiuF,kBAAkB1vC,GACT,SAAVowC,EACA3uF,KAAKwgC,IAAI+qC,UAAY,EAEN,gBAAVojB,EACL3uF,KAAK6qF,oBAEAgE,GAp0JjB,UAAwB,OAAEE,EAAM,OAAEC,EAAM,MAAE/8E,IACtC,IAAIy9E,EAAYX,EAASA,EAAO7kB,wBAAwB5uC,IAAM,EAC9DqwC,EAAmB15D,EAAoB,GAAby9E,EAAiB,EAAIA,EAAYV,EAC/D,CAk0JYW,CAAed,EAEvB,CAIAhE,oBACI,IAAIngB,EAAW1qE,KAAK01E,oBAAoB/M,UACxC,GAAI3oE,KAAK4qE,SAAS,2BAA2B5sC,GAAKA,EAAEh+B,cAC/C,GAAIA,KAAKwZ,MAAMyuB,qBAAqB,KAAe,CACpD,IAAI1lC,EAASvC,KAAK8tE,QAAQwD,YAAYtxE,KAAKwZ,MAAMyuB,UAAUl5B,MACpC,GAAnBxM,EAAO8tC,UACPo6B,EAAmBzqE,KAAMuC,EAAO2nE,wBAAyBQ,EACjE,MAEID,EAAmBzqE,KAAMA,KAAKyuE,YAAYzuE,KAAKwZ,MAAMyuB,UAAU/hB,KAAM,GAAIwkD,EAEjF,CACAklB,qBACI,IAAI/1E,EACJ,KAAOA,EAAO7Z,KAAK4rF,YAAYp1E,OACvBqD,EAAKkoB,SACLloB,EAAKkoB,SACjB,CACAksD,kBAAkB4B,GACd,GAAKA,GAAaA,EAAUz2D,SAAWp5B,KAAKwZ,MAAM4f,SAAWp5B,KAAK8rF,eAAiB9rF,KAAK2rF,kBAepF,IAAK,IAAInrF,EAAI,EAAGA,EAAIR,KAAK4rF,YAAYtrF,OAAQE,IAAK,CAC9C,IAAIsvF,EAAa9vF,KAAK4rF,YAAYprF,GAC9BsvF,EAAWtuD,QACXsuD,EAAWtuD,OAAOxhC,KAAM6vF,EAChC,KAnBuG,CACvG7vF,KAAK2rF,kBAAoB3rF,KAAK8rF,cAC9B9rF,KAAK4vF,qBACL,IAAK,IAAIpvF,EAAI,EAAGA,EAAIR,KAAK8rF,cAAcxrF,OAAQE,IAAK,CAChD,IAAI24B,EAASn5B,KAAK8rF,cAActrF,GAC5B24B,EAAO8C,KAAKpiB,MACZ7Z,KAAK4rF,YAAYzqF,KAAKg4B,EAAO8C,KAAKpiB,KAAK7Z,MAC/C,CACA,IAAK,IAAIQ,EAAI,EAAGA,EAAIR,KAAKwZ,MAAM4f,QAAQ94B,OAAQE,IAAK,CAChD,IAAI24B,EAASn5B,KAAKwZ,MAAM4f,QAAQ54B,GAC5B24B,EAAO8C,KAAKpiB,MACZ7Z,KAAK4rF,YAAYzqF,KAAKg4B,EAAO8C,KAAKpiB,KAAK7Z,MAC/C,CACJ,CAQJ,CACA4qE,SAASkW,EAAU9iD,GACf,IAAiDp7B,EAA7C6zB,EAAOz2B,KAAK6rF,QAAU7rF,KAAK6rF,OAAO/K,GACtC,GAAY,MAARrqD,IAAiB7zB,EAAQo7B,EAAIA,EAAEvH,GAAQA,GACvC,OAAO7zB,EACX,IAAK,IAAIpC,EAAI,EAAGA,EAAIR,KAAK8rF,cAAcxrF,OAAQE,IAAK,CAChD,IAAIi2B,EAAOz2B,KAAK8rF,cAActrF,GAAGw8B,MAAM8jD,GACvC,GAAY,MAARrqD,IAAiB7zB,EAAQo7B,EAAIA,EAAEvH,GAAQA,GACvC,OAAO7zB,CACf,CACA,IAAIw2B,EAAUp5B,KAAKwZ,MAAM4f,QACzB,GAAIA,EACA,IAAK,IAAI54B,EAAI,EAAGA,EAAI44B,EAAQ94B,OAAQE,IAAK,CACrC,IAAIi2B,EAAO2C,EAAQ54B,GAAGw8B,MAAM8jD,GAC5B,GAAY,MAARrqD,IAAiB7zB,EAAQo7B,EAAIA,EAAEvH,GAAQA,GACvC,OAAO7zB,CACf,CACR,CAIAw4C,WAII,GAAIhb,EAAI,CAGJ,IAAIjyB,EAAOnO,KAAKkE,KAAKkrE,cACrB,GAAIjhE,GAAQnO,KAAKwgC,IACb,OAAO,EACX,IAAKryB,IAASnO,KAAKwgC,IAAI63B,SAASlqD,GAC5B,OAAO,EACX,KAAOA,GAAQnO,KAAKwgC,KAAOryB,GAAQnO,KAAKwgC,IAAI63B,SAASlqD,IAAO,CACxD,GAA4B,SAAxBA,EAAKouC,gBACL,OAAO,EACXpuC,EAAOA,EAAK4hF,aAChB,CACA,OAAO,CACX,CACA,OAAO/vF,KAAKkE,KAAKkrE,eAAiBpvE,KAAKwgC,GAC3C,CAIAiO,QACIzuC,KAAK85E,YAAYxH,OACbtyE,KAAKq7C,UAl5JjB,SAA4B7a,GACxB,GAAIA,EAAIwvD,UACJ,OAAOxvD,EAAIwvD,YACf,GAAInkB,EACA,OAAOrrC,EAAIiO,MAAMo9B,GACrB,IAAIr1C,EAASk1C,EAAYlrC,GACzBA,EAAIiO,MAAgC,MAA1Bo9B,EAAiC,CACnCokB,oBAEA,OADApkB,EAAyB,CAAEokB,eAAe,IACnC,CACX,QACAnvF,GACC+qE,IACDA,GAAyB,EACzBF,EAAmBn1C,EAAQ,GAEnC,CAm4JY05D,CAAmBlwF,KAAKwgC,KAC5Bi5C,GAAez5E,MACfA,KAAK85E,YAAYrrE,OACrB,CAOIvK,WACA,IAAI4mD,EAAS9qD,KAAK0rF,MAClB,GAAc,MAAV5gC,EACA,IAAK,IAAIplC,EAAS1lB,KAAKwgC,IAAIwB,WAAYtc,EAAQA,EAASA,EAAOsc,WAC3D,GAAuB,GAAnBtc,EAAO2qB,UAAqC,IAAnB3qB,EAAO2qB,UAAkB3qB,EAAOkiD,KAGzD,OAFKliD,EAAOgsD,eACRrwE,OAAOsyB,eAAejO,GAAQgsD,aAAe,IAAMhsD,EAAOuxC,cAAcya,gBACrE1xE,KAAK0rF,MAAQhmE,EAGhC,OAAOolC,GAAUl2C,QACrB,CAUAu6B,YAAY48B,GACR,OAAO58B,EAAYnvC,KAAM+rE,EAC7B,CASA0C,YAAYnoD,EAAKg2B,EAAO,GACpB,OAAOmyB,EAAYzuE,KAAMsmB,EAAKg2B,EAClC,CAWA6zC,SAAS7pE,EAAKg2B,EAAO,GACjB,OAAOt8C,KAAK8tE,QAAQY,WAAWpoD,EAAKg2B,EACxC,CAWAq0B,QAAQrqD,GACJ,IAAIne,EAAOnI,KAAK8tE,QAAQ+C,OAAOvqD,GAC/B,OAAOne,EAAOA,EAAKwoE,QAAU,IACjC,CAWAyf,SAASjiF,EAAM2F,EAAQunD,GAAO,GAC1B,IAAI/0C,EAAMtmB,KAAK8tE,QAAQI,WAAW//D,EAAM2F,EAAQunD,GAChD,GAAW,MAAP/0C,EACA,MAAM,IAAIghC,WAAW,sCACzB,OAAOhhC,CACX,CASAm9B,eAAewX,EAAKzhD,GAChB,OAhmJR,SAAwBK,EAAML,EAAOyhD,GACjC,OAAIsU,IAAe/1D,GAASg2D,IAAavU,EAC9BwU,IACXF,GAAc/1D,EACdg2D,GAAYvU,EACLwU,GAAsB,MAAPxU,GAAsB,QAAPA,EAhFzC,SAAgCphD,EAAML,EAAOyhD,GACzC,IAAItiB,EAAMn/B,EAAMyuB,UACZgZ,EAAc,MAAPga,EAActiB,EAAI3D,MAAQ2D,EAAIlB,IACzC,OAAOy3B,EAAiBr1D,EAAML,GAAO,KACjC,IAAMrL,KAAMqyB,GAAQ3mB,EAAKi0D,QAAQY,WAAWztB,EAAK36B,IAAY,MAAP20C,GAAe,EAAI,GACzE,OAAS,CACL,IAAIo1B,EAAUx2E,EAAKi0D,QAAQC,YAAYvtC,GAAK,GAC5C,IAAK6vD,EACD,MACJ,GAAIA,EAAQliF,KAAKmqC,QAAS,CACtB9X,EAAM6vD,EAAQ94B,YAAc84B,EAAQ7vD,IACpC,KACJ,CACAA,EAAM6vD,EAAQ7vD,IAAIwB,UACtB,CACA,IAAI+pC,EAAS0C,EAAY50D,EAAMonC,EAAK36B,IAAK,GACzC,IAAK,IAAIwM,EAAQ0N,EAAIyV,WAAYnjB,EAAOA,EAAQA,EAAMwjC,YAAa,CAC/D,IAAIg6B,EACJ,GAAsB,GAAlBx9D,EAAMud,SACNigD,EAAQx9D,EAAM25C,qBACb,IAAsB,GAAlB35C,EAAMud,SAGX,SAFAigD,EAAQxoB,EAAUh1C,EAAO,EAAGA,EAAM+iC,UAAUv1D,QAAQmsE,gBAE5C,CACZ,IAAK,IAAIjsE,EAAI,EAAGA,EAAI8vF,EAAMhwF,OAAQE,IAAK,CACnC,IAAIysE,EAAMqjB,EAAM9vF,GAChB,GAAIysE,EAAIpD,OAASoD,EAAI3xC,IAAM,IACf,MAAP2/B,EAAc8Q,EAAOzwC,IAAM2xC,EAAI3xC,IAAkC,GAA3B2xC,EAAIpD,OAASkC,EAAOzwC,KACrD2xC,EAAIpD,OAASkC,EAAOlC,OAAqC,GAA3BkC,EAAOlC,OAASoD,EAAI3xC,MACxD,OAAO,CACf,CACJ,CACA,OAAO,CAAI,GAEnB,CA+CUi1D,CAAuB12E,EAAML,EAAOyhD,GA7C9C,SAAkCphD,EAAML,EAAOyhD,GAC3C,IAAI,MAAEpX,GAAUrqC,EAAMyuB,UACtB,IAAK4b,EAAMpzB,OAAOmoB,YACd,OAAO,EACX,IAAI9kC,EAAS+vC,EAAM5O,aAAc+C,GAAWlkC,EAAQmkC,EAAQnkC,GAAU+vC,EAAMpzB,OAAOtwB,QAAQ8Q,KACvF0nC,EAAM9+B,EAAKugE,eAGf,OAAK9K,GAASjqE,KAAKw+C,EAAMpzB,OAAO/O,cAAiBi3B,EAAI63C,OAE9CthB,EAAiBr1D,EAAML,GAAO,KAMjC,IAAMmvD,UAAW8nB,EAAS7nB,YAAa8nB,EAAM,WAAE7nB,EAAU,aAAEC,GAAiBjvD,EAAK67D,oBAC7Eib,EAAeh4C,EAAIi4C,eAEvBj4C,EAAI63C,OAAO,OAAQv1B,EAAK,aACxB,IAAI6b,EAAYjzB,EAAMv6B,MAAQzP,EAAKi0D,QAAQwD,YAAYztB,EAAMn0C,UAAYmK,EAAK2mB,KACxEmoC,UAAW5B,EAAS6B,YAAaioB,GAAWh3E,EAAK67D,oBACnD9vE,EAASmhE,IAAY+P,EAAUze,SAA6B,GAApB0O,EAAQ12B,SAAgB02B,EAAUA,EAAQ/kC,aACjFyuD,GAAW1pB,GAAW2pB,GAAUG,EAErC,IACIl4C,EAAIk5B,SAAShJ,EAAYC,GACrB2nB,IAAYA,GAAW5nB,GAAc6nB,GAAU5nB,IAAiBnwB,EAAI31C,QACpE21C,EAAI31C,OAAOytF,EAASC,EAC5B,CACA,MAAO32E,GAAK,CAGZ,OAFoB,MAAhB42E,IACAh4C,EAAIi4C,eAAiBD,GAClB/qF,CAAM,IAxBC,QAAPq1D,GAAwB,YAAPA,EAAoBjjB,EAAUC,CA0B9D,CAWU64C,CAAyBj3E,EAAML,EAAOyhD,GAChD,CAwlJexX,CAAezjD,KAAMwZ,GAASxZ,KAAKwZ,MAAOyhD,EACrD,CAMA81B,UAAU9oE,EAAM7S,GACZ,OAAO6uE,GAAQjkF,KAAM,GAAIioB,GAAM,EAAO7S,GAAS,IAAIs6B,eAAe,SACtE,CAIAshD,UAAUx5E,EAAMpC,GACZ,OAAO6uE,GAAQjkF,KAAMwX,EAAM,MAAM,EAAMpC,GAAS,IAAIs6B,eAAe,SACvE,CAKA3N,UACS/hC,KAAK8tE,UAp5ElB,SAAsBj0D,GAClBA,EAAKigE,YAAYxH,OACjB,IAAK,IAAIztE,KAAQgV,EAAKrN,MAAM4zE,cACxBvmE,EAAK2mB,IAAI2E,oBAAoBtgC,EAAMgV,EAAKrN,MAAM4zE,cAAcv7E,IAChEsC,aAAa0S,EAAKrN,MAAMwzE,kBACxB74E,aAAa0S,EAAKrN,MAAMozE,4BAC5B,CAg5EQqR,CAAajxF,MACbA,KAAK4vF,qBACD5vF,KAAKmuC,SACLnuC,KAAK8tE,QAAQtsC,OAAOxhC,KAAKwZ,MAAMiT,IAAK,GAAIo8D,GAAgB7oF,MAAOA,MAC/DA,KAAKwgC,IAAI9e,YAAc,IAElB1hB,KAAKwgC,IAAIwB,YACdhiC,KAAKwgC,IAAIwB,WAAW+zC,YAAY/1E,KAAKwgC,KAEzCxgC,KAAK8tE,QAAQ/rC,UACb/hC,KAAK8tE,QAAU,KACnB,CAMIojB,kBACA,OAAuB,MAAhBlxF,KAAK8tE,OAChB,CAIA5oC,cAAc9vB,GACV,OA/4ER,SAAuByE,EAAMzE,GACpBorE,GAAiB3mE,EAAMzE,KAAU2d,GAAS3d,EAAMvQ,QAChDgV,EAAKwhC,UAAcjmC,EAAMvQ,QAAQo6E,IAClClsD,GAAS3d,EAAMvQ,MAAMgV,EAAMzE,EACnC,CA24Ee8vB,CAAcllC,KAAMoV,EAC/B,CAUAotB,SAAS8F,GACL,IAAI6oD,EAAsBnxF,KAAK6rF,OAAOsF,oBAClCA,EACAA,EAAoBpvF,KAAK/B,KAAMsoC,GAE/BtoC,KAAKqvE,YAAYrvE,KAAKwZ,MAAMhT,MAAM8hC,GAC1C,CAIAotC,oBACI,OAAOrM,GAAiC,KAAvBrpE,KAAKkE,KAAKmsC,UA1sKnC,SAA2B5jB,GACvB,IAAI2a,EAAM3a,EAAI2iD,cACd,KAAOhoC,GAAOA,EAAIgqD,YACdhqD,EAAMA,EAAIgqD,WAAWhiB,cACzB,OAAOhoC,CACX,CAqsKsDiqD,CAAkBrxF,KAAKwgC,IAAIy2B,gBAAkBj3D,KAAKwgC,IAl2BxG,SAAoC3mB,GAChC,IAAI+rC,EACJ,SAAStiB,EAAKluB,GACVA,EAAMs4B,iBACNt4B,EAAM4vB,2BACN4gB,EAAQxwC,EAAMk8E,kBAAkB,EACpC,CAMAz3E,EAAK2mB,IAAIyE,iBAAiB,cAAe3B,GAAM,GAC/C1uB,SAAS28E,YAAY,UACrB13E,EAAK2mB,IAAI2E,oBAAoB,cAAe7B,GAAM,GAClD,IAAIulC,EAAajjB,EAAM4nB,eAAgB1E,EAAeljB,EAAM6nB,YACxD9E,EAAY/iB,EAAM4rC,aAAc5oB,EAAchjB,EAAM6rC,UACpDC,EAAgB73E,EAAKs2E,SAASt2E,EAAKL,MAAMyuB,UAAU0yB,QAMvD,OAFIuN,EAAqBwpB,EAAcvjF,KAAMujF,EAAc59E,OAAQ60D,EAAWC,MACzEC,EAAYC,EAAcH,EAAWC,GAAe,CAACD,EAAWC,EAAaC,EAAYC,IACvF,CAAED,aAAYC,eAAcH,YAAWC,cAClD,CA20Bc+oB,CAA2B3xF,MAAQA,KAAKo6E,cAClD,CAIAA,eACI,OAAOp6E,KAAKkE,KAAKwtE,cACrB,EAEJ,SAAS0a,GAAevyE,GACpB,IAAI2hB,EAAQn6B,OAAO2Z,OAAO,MAkB1B,OAjBAwgB,EAAM+jB,MAAQ,cACd/jB,EAAMo2D,gBAAkB/kF,OAAOgN,EAAKwhC,UACpCxhC,EAAK+wD,SAAS,cAAchoE,IAGxB,GAFoB,mBAATA,IACPA,EAAQA,EAAMiX,EAAKL,QACnB5W,EACA,IAAK,IAAIssD,KAAQtsD,EACD,SAARssD,EACA1zB,EAAM+jB,OAAS,IAAM38C,EAAMssD,GACd,SAARA,EACL1zB,EAAMpK,OAASoK,EAAMpK,MAAQoK,EAAMpK,MAAQ,IAAM,IAAMxuB,EAAMssD,GACvD1zB,EAAM0zB,IAAiB,mBAARA,GAAqC,YAARA,IAClD1zB,EAAM0zB,GAAQriD,OAAOjK,EAAMssD,IACnC,IAEH1zB,EAAMq2D,YACPr2D,EAAMq2D,UAAY,MACf,CAAChM,GAAW13E,KAAK,EAAG0L,EAAKL,MAAMiT,IAAItsB,QAAQ8Q,KAAMuqB,GAC5D,CACA,SAAS0wD,GAAoBryE,GACzB,GAAIA,EAAKkqE,WAAY,CACjB,IAAIvjD,EAAM5rB,SAASyM,cAAc,OACjCmf,EAAIiB,UAAY,wBAChBjB,EAAIoB,aAAa,mBAAoB,QACrCpB,EAAIoB,aAAa,MAAO,IACxB/nB,EAAKsgE,cAAgB,CAAE35C,MAAKozC,KAAMiS,GAAWhW,OAAOh2D,EAAKL,MAAMyuB,UAAU/hB,KAAMsa,EAAK,CAAE5R,KAAK,EAAMgN,MAAO/hB,EAAKkqE,aACjH,MAEIlqE,EAAKsgE,cAAgB,IAE7B,CACA,SAAS8R,GAAYpyE,GACjB,OAAQA,EAAK+wD,SAAS,YAAYhoE,IAA+B,IAAtBA,EAAMiX,EAAKL,QAC1D,CAKA,SAAS2yE,GAAetyE,GACpB,IAAIjU,EAASvE,OAAO2Z,OAAO,MAC3B,SAASrL,EAAI1N,GACT,IAAK,IAAIw0B,KAAQx0B,EACRZ,OAAOC,UAAUC,eAAeQ,KAAK6D,EAAQ6wB,KAC9C7wB,EAAO6wB,GAAQx0B,EAAIw0B,GAC/B,CAGA,OAFA5c,EAAK+wD,SAAS,YAAaj7D,GAC3BkK,EAAK+wD,SAAS,YAAaj7D,GACpB/J,CACX,CAYA,SAASmmF,GAAoB5yD,GACzB,GAAIA,EAAO8C,KAAKziB,OAAS2f,EAAO8C,KAAK2gB,mBAAqBzjB,EAAO8C,KAAKwgB,kBAClE,MAAM,IAAI6K,WAAW,sEAC7B,gDCnxKO,MAyEMwqC,EAOX,SAKYzsF,GACR,GAAIA,QACF,OAAOwL,EAGT,GAAoB,iBAATxL,EACT,OA8EamO,EA9EMnO,EA+ElB0sF,GAKP,SAAc5jF,GACZ,OAAOA,GAAQA,EAAKtJ,OAAS2O,CAC/B,IARF,IAAqBA,EA3Ef,GAAoB,iBAATnO,EACT,OAAOvD,MAAMF,QAAQyD,GAe7B,SAAoB2sF,GAElB,MAAMC,EAAS,GACf,IAAI1jF,GAAS,EAEb,OAASA,EAAQyjF,EAAM1xF,QACrB2xF,EAAO1jF,GAASujF,EAAQE,EAAMzjF,IAGhC,OAAOwjF,GAOP,YAAgBljF,GACd,IAAIN,GAAS,EAEb,OAASA,EAAQ0jF,EAAO3xF,QACtB,GAAI2xF,EAAO1jF,GAAOxM,KAAK/B,QAAS6O,GAAa,OAAO,EAGtD,OAAO,CACT,GACF,CAxCqCqjF,CAAW7sF,GAgDhD,SAAsBmO,GACpB,OAAOu+E,GAMP,SAAa5jF,GAEX,IAAIjM,EAEJ,IAAKA,KAAOsR,EAEV,GAAIrF,EAAKjM,KAASsR,EAAMtR,GAAM,OAAO,EAGvC,OAAO,CACT,GACF,CAlEwDiwF,CAAa9sF,GAG/D,GAAoB,mBAATA,EACT,OAAO0sF,EAAY1sF,GAGrB,MAAM,IAAI0C,MAAM,+CAEpB,EAkFF,SAASgqF,EAAYv+E,GACnB,OAQA,SAAmBrF,KAASU,GAC1B,OAAOX,QACLC,GACkB,iBAATA,GACP,SAAUA,GAEVD,QAAQsF,EAAMzR,KAAK/B,KAAMmO,KAASU,IAExC,CACF,CAEA,SAASgC,IACP,OAAO,CACT,iFC5NO,MAKMuhF,GAAO,EAKPC,EAAO,OA+BPC,EAOX,SAQY5nE,EAAMrlB,EAAMktF,EAASzpD,GACT,mBAATzjC,GAA0C,mBAAZktF,IACvCzpD,EAAUypD,EAEVA,EAAUltF,EACVA,EAAO,MAGT,MAAM6iF,GAAK,OAAQ7iF,GACbojC,EAAOK,GAAW,EAAI,GAS5B,SAAS0pD,EAAQrkF,EAAMI,EAAOkkF,GAG5B,MAAM7vF,EAAQuL,GAAwB,iBAATA,EAAoBA,EAAO,CAAC,EAEzD,GAA0B,iBAAfvL,EAAMiC,KAAmB,CAClC,MAAMpC,EAEqB,iBAAlBG,EAAMwc,QACTxc,EAAMwc,QAEc,iBAAfxc,EAAMH,KACXG,EAAMH,UACN3B,EAENO,OAAOI,eAAeixF,EAAO,OAAQ,CACnC9vF,MACE,SAAiBuL,EAAKtJ,MAAQpC,EAAO,IAAMA,EAAO,IAAM,IAAO,KAErE,CAEA,OAAOiwF,EAEP,SAASA,IAEP,IAEIC,EAEA7+E,EAEA8+E,EANAhtF,EAAS,GAQb,KAAKP,GAAQ6iF,EAAG/5E,EAAMI,EAAOkkF,EAAQA,EAAQnyF,OAAS,IAAM,SAC1DsF,EA0CZ,SAAkBhD,GAChB,OAAId,MAAMF,QAAQgB,GACTA,EAGY,iBAAVA,EACF,EA5Ja,EA4JFA,GAGb,CAACA,EACV,CApDqBiwF,CAASN,EAAQpkF,EAAMskF,IAE5B7sF,EAAO,KAAOwsF,GAChB,OAAOxsF,EAKX,GAAIuI,EAAKE,UAAYzI,EAAO,KAAOysF,EAOjC,IALAv+E,GAAUg1B,EAAU36B,EAAKE,SAAS/N,QAAU,GAAKmoC,EAEjDmqD,EAAeH,EAAQpyF,OAAO8N,GAGvB2F,GAAU,GAAKA,EAAS3F,EAAKE,SAAS/N,QAAQ,CAInD,GAFAqyF,EAAYH,EAAQrkF,EAAKE,SAASyF,GAASA,EAAQ8+E,EAAvCJ,GAERG,EAAU,KAAOP,EACnB,OAAOO,EAGT7+E,EAC0B,iBAAjB6+E,EAAU,GAAkBA,EAAU,GAAK7+E,EAAS20B,CAC/D,CAGF,OAAO7iC,CACT,CACF,CAvEA4sF,CAAQ9nE,OAAM5pB,EAAW,GAAzB0xF,EAyEJ,+DC9EK,MAAME,EAOX,SAQYhoE,EAAMrlB,EAAMktF,EAASzpD,GACT,mBAATzjC,GAA0C,mBAAZktF,IACvCzpD,EAAUypD,EACVA,EAAUltF,EACVA,EAAO,OAGT,QAAaqlB,EAAMrlB,GAMnB,SAAkB8I,EAAMskF,GACtB,MAAMhiE,EAASgiE,EAAQA,EAAQnyF,OAAS,GACxC,OAAOiyF,EACLpkF,EACAsiB,EAASA,EAAOpiB,SAAS4hB,QAAQ9hB,GAAQ,KACzCsiB,EAEJ,GAbmCqY,EAevC","sources":["webpack:///../../node_modules/css-loader/dist/runtime/api.js","webpack:///../../node_modules/css-loader/dist/runtime/noSourceMaps.js","webpack:///../../node_modules/extend/index.js","webpack:///../../node_modules/is-buffer/index.js","webpack:///../../node_modules/lodash.debounce/index.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/applyDecs2203R.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/checkPrivateRedeclaration.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/classExtractFieldDescriptor.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/classPrivateFieldGet.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/classApplyDescriptorGet.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/classPrivateFieldInitSpec.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/classPrivateFieldSet.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/classApplyDescriptorSet.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/defineProperty.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/toPropertyKey.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/toPrimitive.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/objectSpread2.js","webpack:///../../node_modules/@babel/runtime/helpers/esm/typeof.js","webpack:///../../node_modules/mdast-util-to-string/lib/index.js","webpack:///../../node_modules/micromark-util-chunked/index.js","webpack:///../../node_modules/micromark-util-combine-extensions/index.js","webpack:///../../node_modules/micromark-util-character/lib/unicode-punctuation-regex.js","webpack:///../../node_modules/micromark-util-character/index.js","webpack:///../../node_modules/micromark-factory-space/index.js","webpack:///../../node_modules/micromark/lib/initialize/content.js","webpack:///../../node_modules/micromark/lib/initialize/document.js","webpack:///../../node_modules/micromark-core-commonmark/lib/blank-line.js","webpack:///../../node_modules/micromark-util-subtokenize/index.js","webpack:///../../node_modules/micromark-core-commonmark/lib/content.js","webpack:///../../node_modules/micromark/lib/initialize/flow.js","webpack:///../../node_modules/micromark/lib/initialize/text.js","webpack:///../../node_modules/micromark-util-resolve-all/index.js","webpack:///../../node_modules/micromark/lib/create-tokenizer.js","webpack:///../../node_modules/micromark-core-commonmark/lib/thematic-break.js","webpack:///../../node_modules/micromark-core-commonmark/lib/list.js","webpack:///../../node_modules/micromark-core-commonmark/lib/block-quote.js","webpack:///../../node_modules/micromark-factory-destination/index.js","webpack:///../../node_modules/micromark-factory-label/index.js","webpack:///../../node_modules/micromark-factory-title/index.js","webpack:///../../node_modules/micromark-factory-whitespace/index.js","webpack:///../../node_modules/micromark-util-normalize-identifier/index.js","webpack:///../../node_modules/micromark-core-commonmark/lib/definition.js","webpack:///../../node_modules/micromark-core-commonmark/lib/code-indented.js","webpack:///../../node_modules/micromark-core-commonmark/lib/heading-atx.js","webpack:///../../node_modules/micromark-core-commonmark/lib/setext-underline.js","webpack:///../../node_modules/micromark-util-html-tag-name/index.js","webpack:///../../node_modules/micromark-core-commonmark/lib/html-flow.js","webpack:///../../node_modules/micromark-core-commonmark/lib/code-fenced.js","webpack:///../../node_modules/decode-named-character-reference/index.dom.js","webpack:///../../node_modules/micromark-core-commonmark/lib/character-reference.js","webpack:///../../node_modules/micromark-core-commonmark/lib/character-escape.js","webpack:///../../node_modules/micromark-core-commonmark/lib/line-ending.js","webpack:///../../node_modules/micromark-core-commonmark/lib/label-end.js","webpack:///../../node_modules/micromark-util-classify-character/index.js","webpack:///../../node_modules/micromark-core-commonmark/lib/attention.js","webpack:///../../node_modules/micromark-core-commonmark/lib/autolink.js","webpack:///../../node_modules/micromark-core-commonmark/lib/html-text.js","webpack:///../../node_modules/micromark-core-commonmark/lib/code-text.js","webpack:///../../node_modules/micromark/lib/constructs.js","webpack:///../../node_modules/micromark-core-commonmark/lib/label-start-image.js","webpack:///../../node_modules/micromark-core-commonmark/lib/label-start-link.js","webpack:///../../node_modules/micromark-core-commonmark/lib/hard-break-escape.js","webpack:///../../node_modules/micromark/lib/preprocess.js","webpack:///../../node_modules/micromark-util-decode-numeric-character-reference/index.js","webpack:///../../node_modules/micromark-util-decode-string/index.js","webpack:///../../node_modules/unist-util-stringify-position/lib/index.js","webpack:///../../node_modules/mdast-util-from-markdown/lib/index.js","webpack:///../../node_modules/micromark/lib/postprocess.js","webpack:///../../node_modules/micromark/lib/parse.js","webpack:///../../node_modules/remark-parse/lib/index.js","webpack:///../../node_modules/zwitch/index.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/configure.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/blockquote.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/pattern-in-scope.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/break.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/format-code-as-indented.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/code.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-quote.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/emphasis.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-emphasis.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/format-heading-as-setext.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/html.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/image.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/image-reference.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/pattern-compile.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/inline-code.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/format-link-as-autolink.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/link.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/link-reference.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-bullet.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-bullet-ordered.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-rule.js","webpack:///../../node_modules/mdast-util-phrasing/lib/index.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/strong.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-strong.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/index.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-fence.js","webpack:///../../node_modules/longest-streak/index.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/definition.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/heading.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/list.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-bullet-ordered-other.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-bullet-other.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/list-item.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-list-item-indent.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/paragraph.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/root.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/text.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/handle/thematic-break.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/check-rule-repetition.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/join.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/unsafe.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/association.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/container-flow.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/indent-lines.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/safe.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/track.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/index.js","webpack:///../../node_modules/mdast-util-to-markdown/lib/util/container-phrasing.js","webpack:///../../node_modules/remark-stringify/lib/index.js","webpack:///../../node_modules/bail/index.js","webpack:///../../node_modules/unified/node_modules/is-plain-obj/index.js","webpack:///../../node_modules/vfile-message/lib/index.js","webpack:///../../node_modules/vfile/lib/minpath.browser.js","webpack:///../../node_modules/vfile/lib/minproc.browser.js","webpack:///../../node_modules/vfile/lib/minurl.shared.js","webpack:///../../node_modules/vfile/lib/index.js","webpack:///../../node_modules/vfile/lib/minurl.browser.js","webpack:///../../node_modules/unified/lib/index.js","webpack:///../../node_modules/trough/index.js","webpack:///../../node_modules/@milkdown/transformer/lib/index.es.js","webpack:///../../node_modules/@milkdown/core/lib/index.es.js","webpack:///../../node_modules/@milkdown/ctx/lib/index.es.js","webpack:///../../node_modules/@milkdown/exception/lib/index.es.js","webpack:///../../node_modules/rope-sequence/dist/index.js","webpack:///../../node_modules/prosemirror-history/dist/index.js","webpack:///../../node_modules/@milkdown/plugin-history/lib/index.es.js","webpack:///../../node_modules/@milkdown/plugin-listener/lib/index.es.js","webpack:///../../node_modules/@milkdown/plugin-upload/lib/index.es.js","webpack:///../../node_modules/prosemirror-inputrules/dist/index.js","webpack:///../../node_modules/@sindresorhus/slugify/node_modules/escape-string-regexp/index.js","webpack:///../../node_modules/@sindresorhus/transliterate/node_modules/escape-string-regexp/index.js","webpack:///../../node_modules/@sindresorhus/transliterate/replacements.js","webpack:///../../node_modules/@sindresorhus/slugify/overridable-replacements.js","webpack:///../../node_modules/@sindresorhus/slugify/index.js","webpack:///../../node_modules/@sindresorhus/transliterate/index.js","webpack:///../../node_modules/mdast-util-definitions/lib/index.js","webpack:///../../node_modules/remark-inline-links/index.js","webpack:///../../node_modules/@milkdown/preset-commonmark/lib/index.es.js","webpack:///../../node_modules/prosemirror-schema-list/dist/index.js","webpack:///../../node_modules/@milkdown/prose/lib/index.js","webpack:///../../node_modules/@milkdown/react/lib/index.es.js","webpack:///../../node_modules/clsx/dist/clsx.m.js","webpack:///../../node_modules/@milkdown/theme-nord/lib/index.es.js","webpack:///../../node_modules/nanoid/index.browser.js","webpack:///../../node_modules/@milkdown/utils/lib/index.es.js","webpack:///../../node_modules/@next-api-sdk/object-store-sdk/dist/esm/api/object_store/object_store/putObject.js","webpack:///../../node_modules/prosemirror-commands/dist/index.js","webpack:///../../node_modules/w3c-keyname/index.js","webpack:///../../node_modules/prosemirror-keymap/dist/index.js","webpack:///../../node_modules/orderedmap/dist/index.js","webpack:///../../node_modules/prosemirror-model/dist/index.js","webpack:///../../node_modules/prosemirror-state/dist/index.js","webpack:///../../node_modules/prosemirror-transform/dist/index.js","webpack:///../../node_modules/prosemirror-view/dist/index.js","webpack:///../../node_modules/unist-util-is/lib/index.js","webpack:///../../node_modules/unist-util-visit-parents/lib/index.js","webpack:///../../node_modules/unist-util-visit/lib/index.js"],"sourcesContent":["\"use strict\";\n\n/*\n  MIT License http://www.opensource.org/licenses/mit-license.php\n  Author Tobias Koppers @sokra\n*/\nmodule.exports = function (cssWithMappingToString) {\n  var list = [];\n\n  // return the list of modules as css string\n  list.toString = function toString() {\n    return this.map(function (item) {\n      var content = \"\";\n      var needLayer = typeof item[5] !== \"undefined\";\n      if (item[4]) {\n        content += \"@supports (\".concat(item[4], \") {\");\n      }\n      if (item[2]) {\n        content += \"@media \".concat(item[2], \" {\");\n      }\n      if (needLayer) {\n        content += \"@layer\".concat(item[5].length > 0 ? \" \".concat(item[5]) : \"\", \" {\");\n      }\n      content += cssWithMappingToString(item);\n      if (needLayer) {\n        content += \"}\";\n      }\n      if (item[2]) {\n        content += \"}\";\n      }\n      if (item[4]) {\n        content += \"}\";\n      }\n      return content;\n    }).join(\"\");\n  };\n\n  // import a list of modules into the list\n  list.i = function i(modules, media, dedupe, supports, layer) {\n    if (typeof modules === \"string\") {\n      modules = [[null, modules, undefined]];\n    }\n    var alreadyImportedModules = {};\n    if (dedupe) {\n      for (var k = 0; k < this.length; k++) {\n        var id = this[k][0];\n        if (id != null) {\n          alreadyImportedModules[id] = true;\n        }\n      }\n    }\n    for (var _k = 0; _k < modules.length; _k++) {\n      var item = [].concat(modules[_k]);\n      if (dedupe && alreadyImportedModules[item[0]]) {\n        continue;\n      }\n      if (typeof layer !== \"undefined\") {\n        if (typeof item[5] === \"undefined\") {\n          item[5] = layer;\n        } else {\n          item[1] = \"@layer\".concat(item[5].length > 0 ? \" \".concat(item[5]) : \"\", \" {\").concat(item[1], \"}\");\n          item[5] = layer;\n        }\n      }\n      if (media) {\n        if (!item[2]) {\n          item[2] = media;\n        } else {\n          item[1] = \"@media \".concat(item[2], \" {\").concat(item[1], \"}\");\n          item[2] = media;\n        }\n      }\n      if (supports) {\n        if (!item[4]) {\n          item[4] = \"\".concat(supports);\n        } else {\n          item[1] = \"@supports (\".concat(item[4], \") {\").concat(item[1], \"}\");\n          item[4] = supports;\n        }\n      }\n      list.push(item);\n    }\n  };\n  return list;\n};","\"use strict\";\n\nmodule.exports = function (i) {\n  return i[1];\n};","'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 * Determine if an object is a Buffer\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n\nmodule.exports = function isBuffer (obj) {\n  return obj != null && obj.constructor != null &&\n    typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj)\n}\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the `TypeError` message for \"Functions\" methods. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        result = wait - timeSinceLastCall;\n\n    return maxing ? nativeMin(result, maxWait - timeSinceLastInvoke) : result;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = value.replace(reTrim, '');\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = debounce;\n","import _typeof from \"./typeof.js\";\nfunction applyDecs2203RFactory() {\n  function createAddInitializerMethod(initializers, decoratorFinishedRef) {\n    return function (initializer) {\n      !function (decoratorFinishedRef, fnName) {\n        if (decoratorFinishedRef.v) throw new Error(\"attempted to call \" + fnName + \" after decoration was finished\");\n      }(decoratorFinishedRef, \"addInitializer\"), assertCallable(initializer, \"An initializer\"), initializers.push(initializer);\n    };\n  }\n  function memberDec(dec, name, desc, initializers, kind, isStatic, isPrivate, value) {\n    var kindStr;\n    switch (kind) {\n      case 1:\n        kindStr = \"accessor\";\n        break;\n      case 2:\n        kindStr = \"method\";\n        break;\n      case 3:\n        kindStr = \"getter\";\n        break;\n      case 4:\n        kindStr = \"setter\";\n        break;\n      default:\n        kindStr = \"field\";\n    }\n    var get,\n      set,\n      ctx = {\n        kind: kindStr,\n        name: isPrivate ? \"#\" + name : name,\n        \"static\": isStatic,\n        \"private\": isPrivate\n      },\n      decoratorFinishedRef = {\n        v: !1\n      };\n    0 !== kind && (ctx.addInitializer = createAddInitializerMethod(initializers, decoratorFinishedRef)), 0 === kind ? isPrivate ? (get = desc.get, set = desc.set) : (get = function get() {\n      return this[name];\n    }, set = function set(v) {\n      this[name] = v;\n    }) : 2 === kind ? get = function get() {\n      return desc.value;\n    } : (1 !== kind && 3 !== kind || (get = function get() {\n      return desc.get.call(this);\n    }), 1 !== kind && 4 !== kind || (set = function set(v) {\n      desc.set.call(this, v);\n    })), ctx.access = get && set ? {\n      get: get,\n      set: set\n    } : get ? {\n      get: get\n    } : {\n      set: set\n    };\n    try {\n      return dec(value, ctx);\n    } finally {\n      decoratorFinishedRef.v = !0;\n    }\n  }\n  function assertCallable(fn, hint) {\n    if (\"function\" != typeof fn) throw new TypeError(hint + \" must be a function\");\n  }\n  function assertValidReturnValue(kind, value) {\n    var type = _typeof(value);\n    if (1 === kind) {\n      if (\"object\" !== type || null === value) throw new TypeError(\"accessor decorators must return an object with get, set, or init properties or void 0\");\n      void 0 !== value.get && assertCallable(value.get, \"accessor.get\"), void 0 !== value.set && assertCallable(value.set, \"accessor.set\"), void 0 !== value.init && assertCallable(value.init, \"accessor.init\");\n    } else if (\"function\" !== type) {\n      var hint;\n      throw hint = 0 === kind ? \"field\" : 10 === kind ? \"class\" : \"method\", new TypeError(hint + \" decorators must return a function or void 0\");\n    }\n  }\n  function applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, initializers) {\n    var desc,\n      init,\n      value,\n      newValue,\n      get,\n      set,\n      decs = decInfo[0];\n    if (isPrivate ? desc = 0 === kind || 1 === kind ? {\n      get: decInfo[3],\n      set: decInfo[4]\n    } : 3 === kind ? {\n      get: decInfo[3]\n    } : 4 === kind ? {\n      set: decInfo[3]\n    } : {\n      value: decInfo[3]\n    } : 0 !== kind && (desc = Object.getOwnPropertyDescriptor(base, name)), 1 === kind ? value = {\n      get: desc.get,\n      set: desc.set\n    } : 2 === kind ? value = desc.value : 3 === kind ? value = desc.get : 4 === kind && (value = desc.set), \"function\" == typeof decs) void 0 !== (newValue = memberDec(decs, name, desc, initializers, kind, isStatic, isPrivate, value)) && (assertValidReturnValue(kind, newValue), 0 === kind ? init = newValue : 1 === kind ? (init = newValue.init, get = newValue.get || value.get, set = newValue.set || value.set, value = {\n      get: get,\n      set: set\n    }) : value = newValue);else for (var i = decs.length - 1; i >= 0; i--) {\n      var newInit;\n      if (void 0 !== (newValue = memberDec(decs[i], name, desc, initializers, kind, isStatic, isPrivate, value))) assertValidReturnValue(kind, newValue), 0 === kind ? newInit = newValue : 1 === kind ? (newInit = newValue.init, get = newValue.get || value.get, set = newValue.set || value.set, value = {\n        get: get,\n        set: set\n      }) : value = newValue, void 0 !== newInit && (void 0 === init ? init = newInit : \"function\" == typeof init ? init = [init, newInit] : init.push(newInit));\n    }\n    if (0 === kind || 1 === kind) {\n      if (void 0 === init) init = function init(instance, _init) {\n        return _init;\n      };else if (\"function\" != typeof init) {\n        var ownInitializers = init;\n        init = function init(instance, _init2) {\n          for (var value = _init2, i = 0; i < ownInitializers.length; i++) value = ownInitializers[i].call(instance, value);\n          return value;\n        };\n      } else {\n        var originalInitializer = init;\n        init = function init(instance, _init3) {\n          return originalInitializer.call(instance, _init3);\n        };\n      }\n      ret.push(init);\n    }\n    0 !== kind && (1 === kind ? (desc.get = value.get, desc.set = value.set) : 2 === kind ? desc.value = value : 3 === kind ? desc.get = value : 4 === kind && (desc.set = value), isPrivate ? 1 === kind ? (ret.push(function (instance, args) {\n      return value.get.call(instance, args);\n    }), ret.push(function (instance, args) {\n      return value.set.call(instance, args);\n    })) : 2 === kind ? ret.push(value) : ret.push(function (instance, args) {\n      return value.call(instance, args);\n    }) : Object.defineProperty(base, name, desc));\n  }\n  function applyMemberDecs(Class, decInfos) {\n    for (var protoInitializers, staticInitializers, ret = [], existingProtoNonFields = new Map(), existingStaticNonFields = new Map(), i = 0; i < decInfos.length; i++) {\n      var decInfo = decInfos[i];\n      if (Array.isArray(decInfo)) {\n        var base,\n          initializers,\n          kind = decInfo[1],\n          name = decInfo[2],\n          isPrivate = decInfo.length > 3,\n          isStatic = kind >= 5;\n        if (isStatic ? (base = Class, 0 !== (kind -= 5) && (initializers = staticInitializers = staticInitializers || [])) : (base = Class.prototype, 0 !== kind && (initializers = protoInitializers = protoInitializers || [])), 0 !== kind && !isPrivate) {\n          var existingNonFields = isStatic ? existingStaticNonFields : existingProtoNonFields,\n            existingKind = existingNonFields.get(name) || 0;\n          if (!0 === existingKind || 3 === existingKind && 4 !== kind || 4 === existingKind && 3 !== kind) throw new Error(\"Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: \" + name);\n          !existingKind && kind > 2 ? existingNonFields.set(name, kind) : existingNonFields.set(name, !0);\n        }\n        applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, initializers);\n      }\n    }\n    return pushInitializers(ret, protoInitializers), pushInitializers(ret, staticInitializers), ret;\n  }\n  function pushInitializers(ret, initializers) {\n    initializers && ret.push(function (instance) {\n      for (var i = 0; i < initializers.length; i++) initializers[i].call(instance);\n      return instance;\n    });\n  }\n  return function (targetClass, memberDecs, classDecs) {\n    return {\n      e: applyMemberDecs(targetClass, memberDecs),\n      get c() {\n        return function (targetClass, classDecs) {\n          if (classDecs.length > 0) {\n            for (var initializers = [], newClass = targetClass, name = targetClass.name, i = classDecs.length - 1; i >= 0; i--) {\n              var decoratorFinishedRef = {\n                v: !1\n              };\n              try {\n                var nextNewClass = classDecs[i](newClass, {\n                  kind: \"class\",\n                  name: name,\n                  addInitializer: createAddInitializerMethod(initializers, decoratorFinishedRef)\n                });\n              } finally {\n                decoratorFinishedRef.v = !0;\n              }\n              void 0 !== nextNewClass && (assertValidReturnValue(10, nextNewClass), newClass = nextNewClass);\n            }\n            return [newClass, function () {\n              for (var i = 0; i < initializers.length; i++) initializers[i].call(newClass);\n            }];\n          }\n        }(targetClass, classDecs);\n      }\n    };\n  };\n}\nexport default function applyDecs2203R(targetClass, memberDecs, classDecs) {\n  return (applyDecs2203R = applyDecs2203RFactory())(targetClass, memberDecs, classDecs);\n}","function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {\n  try {\n    var info = gen[key](arg);\n    var value = info.value;\n  } catch (error) {\n    reject(error);\n    return;\n  }\n  if (info.done) {\n    resolve(value);\n  } else {\n    Promise.resolve(value).then(_next, _throw);\n  }\n}\nexport default function _asyncToGenerator(fn) {\n  return function () {\n    var self = this,\n      args = arguments;\n    return new Promise(function (resolve, reject) {\n      var gen = fn.apply(self, args);\n      function _next(value) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"next\", value);\n      }\n      function _throw(err) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"throw\", err);\n      }\n      _next(undefined);\n    });\n  };\n}","export default function _checkPrivateRedeclaration(obj, privateCollection) {\n  if (privateCollection.has(obj)) {\n    throw new TypeError(\"Cannot initialize the same private elements twice on an object\");\n  }\n}","export default function _classExtractFieldDescriptor(receiver, privateMap, action) {\n  if (!privateMap.has(receiver)) {\n    throw new TypeError(\"attempted to \" + action + \" private field on non-instance\");\n  }\n  return privateMap.get(receiver);\n}","import classApplyDescriptorGet from \"./classApplyDescriptorGet.js\";\nimport classExtractFieldDescriptor from \"./classExtractFieldDescriptor.js\";\nexport default function _classPrivateFieldGet(receiver, privateMap) {\n  var descriptor = classExtractFieldDescriptor(receiver, privateMap, \"get\");\n  return classApplyDescriptorGet(receiver, descriptor);\n}","export default function _classApplyDescriptorGet(receiver, descriptor) {\n  if (descriptor.get) {\n    return descriptor.get.call(receiver);\n  }\n  return descriptor.value;\n}","import checkPrivateRedeclaration from \"./checkPrivateRedeclaration.js\";\nexport default function _classPrivateFieldInitSpec(obj, privateMap, value) {\n  checkPrivateRedeclaration(obj, privateMap);\n  privateMap.set(obj, value);\n}","import classApplyDescriptorSet from \"./classApplyDescriptorSet.js\";\nimport classExtractFieldDescriptor from \"./classExtractFieldDescriptor.js\";\nexport default function _classPrivateFieldSet(receiver, privateMap, value) {\n  var descriptor = classExtractFieldDescriptor(receiver, privateMap, \"set\");\n  classApplyDescriptorSet(receiver, descriptor, value);\n  return value;\n}","export default function _classApplyDescriptorSet(receiver, descriptor, value) {\n  if (descriptor.set) {\n    descriptor.set.call(receiver, value);\n  } else {\n    if (!descriptor.writable) {\n      throw new TypeError(\"attempted to set read only private field\");\n    }\n    descriptor.value = value;\n  }\n}","import toPropertyKey from \"./toPropertyKey.js\";\nexport default function _defineProperty(obj, key, value) {\n  key = toPropertyKey(key);\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n  return obj;\n}","import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nexport default function _toPropertyKey(arg) {\n  var key = toPrimitive(arg, \"string\");\n  return _typeof(key) === \"symbol\" ? key : String(key);\n}","import _typeof from \"./typeof.js\";\nexport default function _toPrimitive(input, hint) {\n  if (_typeof(input) !== \"object\" || input === null) return input;\n  var prim = input[Symbol.toPrimitive];\n  if (prim !== undefined) {\n    var res = prim.call(input, hint || \"default\");\n    if (_typeof(res) !== \"object\") return res;\n    throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n  }\n  return (hint === \"string\" ? String : Number)(input);\n}","import defineProperty from \"./defineProperty.js\";\nfunction ownKeys(object, enumerableOnly) {\n  var keys = Object.keys(object);\n  if (Object.getOwnPropertySymbols) {\n    var symbols = Object.getOwnPropertySymbols(object);\n    enumerableOnly && (symbols = symbols.filter(function (sym) {\n      return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n    })), keys.push.apply(keys, symbols);\n  }\n  return keys;\n}\nexport default function _objectSpread2(target) {\n  for (var i = 1; i < arguments.length; i++) {\n    var source = null != arguments[i] ? arguments[i] : {};\n    i % 2 ? ownKeys(Object(source), !0).forEach(function (key) {\n      defineProperty(target, key, source[key]);\n    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) {\n      Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n    });\n  }\n  return target;\n}","export default function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n    return typeof obj;\n  } : function (obj) {\n    return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n  }, _typeof(obj);\n}","/**\n * @typedef {import('mdast').Root|import('mdast').Content} Node\n *\n * @typedef Options\n *   Configuration (optional).\n * @property {boolean | null | undefined} [includeImageAlt=true]\n *   Whether to use `alt` for `image`s.\n * @property {boolean | null | undefined} [includeHtml=true]\n *   Whether to use `value` of HTML.\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 Node}\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 * @param {T[]} list\n * @param {number} start\n * @param {number} remove\n * @param {T[]} items\n * @returns {void}\n */\nexport function splice(list, start, remove, items) {\n  const end = list.length\n  let chunkStart = 0\n  /** @type {unknown[]} */\n\n  let parameters // Make start between zero and `end` (included).\n\n  if (start < 0) {\n    start = -start > end ? 0 : end + start\n  } else {\n    start = start > end ? end : start\n  }\n\n  remove = remove > 0 ? remove : 0 // No need to chunk the items if there’s only a couple (10k) items.\n\n  if (items.length < 10000) {\n    parameters = Array.from(items)\n    parameters.unshift(start, remove) // @ts-expect-error Hush, it’s fine.\n    ;[].splice.apply(list, parameters)\n  } else {\n    // Delete `remove` items starting from `start`\n    if (remove) [].splice.apply(list, [start, remove]) // Insert the items in chunks to not cause stack overflows.\n\n    while (chunkStart < items.length) {\n      parameters = items.slice(chunkStart, chunkStart + 10000)\n      parameters.unshift(start, 0) // @ts-expect-error Hush, it’s fine.\n      ;[].splice.apply(list, parameters)\n      chunkStart += 10000\n      start += 10000\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 * @param {T[]} list\n * @param {T[]} items\n * @returns {T[]}\n */\n\nexport function push(list, items) {\n  if (list.length > 0) {\n    splice(list, list.length, 0, items)\n    return list\n  }\n\n  return items\n}\n","/**\n * @typedef {import('micromark-util-types').NormalizedExtension} NormalizedExtension\n * @typedef {import('micromark-util-types').Extension} Extension\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').HtmlExtension} HtmlExtension\n */\n\nimport {splice} from 'micromark-util-chunked'\n\nconst hasOwnProperty = {}.hasOwnProperty\n\n/**\n * Combine several syntax extensions into one.\n *\n * @param {Extension[]} extensions List of syntax extensions.\n * @returns {NormalizedExtension} 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 Extension to merge into.\n * @param {Extension} extension Extension to merge.\n * @returns {void}\n */\nfunction syntaxExtension(all, extension) {\n  /** @type {string} */\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 {string} */\n    let code\n\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 * Merge `list` into `existing` (both lists of constructs).\n * Mutates `existing`.\n *\n * @param {unknown[]} existing\n * @param {unknown[]} list\n * @returns {void}\n */\nfunction constructs(existing, list) {\n  let index = -1\n  /** @type {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 several HTML extensions into one.\n *\n * @param {HtmlExtension[]} htmlExtensions List of HTML extensions.\n * @returns {HtmlExtension} A single combined 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 Extension to merge into.\n * @param {HtmlExtension} extension Extension to merge.\n * @returns {void}\n */\nfunction htmlExtension(all, extension) {\n  /** @type {string} */\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 {string} */\n    let type\n\n    if (right) {\n      for (type in right) {\n        left[type] = right[type]\n      }\n    }\n  }\n}\n","// This module is generated by `script/`.\n//\n// CommonMark handles attention (emphasis, strong) markers based on what comes\n// before or after them.\n// One such difference is if those characters are Unicode punctuation.\n// This script is generated from the Unicode data.\nexport const unicodePunctuationRegex =\n  /[!-/:-@[-`{-~\\u00A1\\u00A7\\u00AB\\u00B6\\u00B7\\u00BB\\u00BF\\u037E\\u0387\\u055A-\\u055F\\u0589\\u058A\\u05BE\\u05C0\\u05C3\\u05C6\\u05F3\\u05F4\\u0609\\u060A\\u060C\\u060D\\u061B\\u061E\\u061F\\u066A-\\u066D\\u06D4\\u0700-\\u070D\\u07F7-\\u07F9\\u0830-\\u083E\\u085E\\u0964\\u0965\\u0970\\u09FD\\u0A76\\u0AF0\\u0C77\\u0C84\\u0DF4\\u0E4F\\u0E5A\\u0E5B\\u0F04-\\u0F12\\u0F14\\u0F3A-\\u0F3D\\u0F85\\u0FD0-\\u0FD4\\u0FD9\\u0FDA\\u104A-\\u104F\\u10FB\\u1360-\\u1368\\u1400\\u166E\\u169B\\u169C\\u16EB-\\u16ED\\u1735\\u1736\\u17D4-\\u17D6\\u17D8-\\u17DA\\u1800-\\u180A\\u1944\\u1945\\u1A1E\\u1A1F\\u1AA0-\\u1AA6\\u1AA8-\\u1AAD\\u1B5A-\\u1B60\\u1BFC-\\u1BFF\\u1C3B-\\u1C3F\\u1C7E\\u1C7F\\u1CC0-\\u1CC7\\u1CD3\\u2010-\\u2027\\u2030-\\u2043\\u2045-\\u2051\\u2053-\\u205E\\u207D\\u207E\\u208D\\u208E\\u2308-\\u230B\\u2329\\u232A\\u2768-\\u2775\\u27C5\\u27C6\\u27E6-\\u27EF\\u2983-\\u2998\\u29D8-\\u29DB\\u29FC\\u29FD\\u2CF9-\\u2CFC\\u2CFE\\u2CFF\\u2D70\\u2E00-\\u2E2E\\u2E30-\\u2E4F\\u2E52\\u3001-\\u3003\\u3008-\\u3011\\u3014-\\u301F\\u3030\\u303D\\u30A0\\u30FB\\uA4FE\\uA4FF\\uA60D-\\uA60F\\uA673\\uA67E\\uA6F2-\\uA6F7\\uA874-\\uA877\\uA8CE\\uA8CF\\uA8F8-\\uA8FA\\uA8FC\\uA92E\\uA92F\\uA95F\\uA9C1-\\uA9CD\\uA9DE\\uA9DF\\uAA5C-\\uAA5F\\uAADE\\uAADF\\uAAF0\\uAAF1\\uABEB\\uFD3E\\uFD3F\\uFE10-\\uFE19\\uFE30-\\uFE52\\uFE54-\\uFE61\\uFE63\\uFE68\\uFE6A\\uFE6B\\uFF01-\\uFF03\\uFF05-\\uFF0A\\uFF0C-\\uFF0F\\uFF1A\\uFF1B\\uFF1F\\uFF20\\uFF3B-\\uFF3D\\uFF3F\\uFF5B\\uFF5D\\uFF5F-\\uFF65]/\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {unicodePunctuationRegex} from './lib/unicode-punctuation-regex.js'\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\nexport const asciiAlpha = regexCheck(/[A-Za-z]/)\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\nexport const asciiDigit = regexCheck(/\\d/)\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\nexport const asciiHexDigit = regexCheck(/[\\dA-Fa-f]/)\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\nexport const asciiAlphanumeric = regexCheck(/[\\dA-Za-z]/)\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\nexport const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/)\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\nexport const asciiAtext = regexCheck(/[#-'*+\\--9=?A-Z^-~]/)\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 * @returns {code is number}\n */\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 * Check whether a character code is a markdown line ending (see\n * `markdownLineEnding`) or markdown space (see `markdownSpace`).\n *\n * @param {Code} code\n * @returns {code is number}\n */\n\nexport function markdownLineEndingOrSpace(code) {\n  return code !== null && (code < 0 || code === 32)\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 * @returns {code is number}\n */\n\nexport function markdownLineEnding(code) {\n  return code !== null && code < -2\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 * @returns {code is number}\n */\n\nexport function markdownSpace(code) {\n  return code === -2 || code === -1 || code === 32\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\nexport const unicodeWhitespace = regexCheck(/\\s/)\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// Size note: removing ASCII from the regex and using `asciiPunctuation` here\n// In fact adds to the bundle size.\n\nexport const unicodePunctuation = regexCheck(unicodePunctuationRegex)\n/**\n * Create a code check from a regex.\n *\n * @param {RegExp} regex\n * @returns {(code: Code) => code is number}\n */\n\nfunction regexCheck(regex) {\n  return check\n  /**\n   * Check whether a code matches the bound regex.\n   *\n   * @param {Code} code Character code\n   * @returns {code is number} Whether the character code matches the bound regex\n   */\n\n  function check(code) {\n    return code !== null && regex.test(String.fromCharCode(code))\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n */\nimport {markdownSpace} from 'micromark-util-character'\n/**\n * @param {Effects} effects\n * @param {State} ok\n * @param {string} type\n * @param {number} [max=Infinity]\n * @returns {State}\n */\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  /** @type {State} */\n\n  function start(code) {\n    if (markdownSpace(code)) {\n      effects.enter(type)\n      return prefix(code)\n    }\n\n    return ok(code)\n  }\n  /** @type {State} */\n\n  function prefix(code) {\n    if (markdownSpace(code) && size++ < limit) {\n      effects.consume(code)\n      return prefix\n    }\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').Token} Token\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {InitialConstruct} */\nexport const content = {\n  tokenize: initializeContent\n}\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\n  let previous\n  return contentStart\n  /** @type {State} */\n\n  function afterContentStartConstruct(code) {\n    if (code === null) {\n      effects.consume(code)\n      return\n    }\n\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    return factorySpace(effects, contentStart, 'linePrefix')\n  }\n  /** @type {State} */\n\n  function paragraphInitial(code) {\n    effects.enter('paragraph')\n    return lineStart(code)\n  }\n  /** @type {State} */\n\n  function lineStart(code) {\n    const token = effects.enter('chunkText', {\n      contentType: 'text',\n      previous\n    })\n\n    if (previous) {\n      previous.next = token\n    }\n\n    previous = token\n    return data(code)\n  }\n  /** @type {State} */\n\n  function data(code) {\n    if (code === null) {\n      effects.exit('chunkText')\n      effects.exit('paragraph')\n      effects.consume(code)\n      return\n    }\n\n    if (markdownLineEnding(code)) {\n      effects.consume(code)\n      effects.exit('chunkText')\n      return lineStart\n    } // Data.\n\n    effects.consume(code)\n    return data\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').Construct} Construct\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Point} Point\n */\n\n/**\n * @typedef {Record<string, unknown>} StackState\n * @typedef {[Construct, StackState]} StackItem\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\nimport {splice} from 'micromark-util-chunked'\n/** @type {InitialConstruct} */\n\nexport const document = {\n  tokenize: initializeDocument\n}\n/** @type {Construct} */\n\nconst containerConstruct = {\n  tokenize: tokenizeContainer\n}\n/** @type {Initializer} */\n\nfunction initializeDocument(effects) {\n  const self = this\n  /** @type {Array<StackItem>} */\n\n  const stack = []\n  let continued = 0\n  /** @type {TokenizeContext|undefined} */\n\n  let childFlow\n  /** @type {Token|undefined} */\n\n  let childToken\n  /** @type {number} */\n\n  let lineStartOffset\n  return start\n  /** @type {State} */\n\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    } // Done.\n\n    return checkNewContainers(code)\n  }\n  /** @type {State} */\n\n  function documentContinue(code) {\n    continued++ // 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\n    if (self.containerState._closeFlow) {\n      self.containerState._closeFlow = undefined\n\n      if (childFlow) {\n        closeFlow()\n      } // Note: this algorithm for moving events around is similar to the\n      // algorithm when dealing with lazy lines in `writeToChild`.\n\n      const indexBeforeExits = self.events.length\n      let indexBeforeFlow = indexBeforeExits\n      /** @type {Point|undefined} */\n\n      let point // Find the flow chunk.\n\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\n      exitContainers(continued) // Fix positions.\n\n      let index = indexBeforeExits\n\n      while (index < self.events.length) {\n        self.events[index][1].end = Object.assign({}, point)\n        index++\n      } // Inject the exits earlier (they’re still also at the end).\n\n      splice(\n        self.events,\n        indexBeforeFlow + 1,\n        0,\n        self.events.slice(indexBeforeExits)\n      ) // Discard the duplicate exits.\n\n      self.events.length = index\n      return checkNewContainers(code)\n    }\n\n    return start(code)\n  }\n  /** @type {State} */\n\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      } // 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\n      if (childFlow.currentConstruct && childFlow.currentConstruct.concrete) {\n        return flowStart(code)\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\n      self.interrupt = Boolean(\n        childFlow.currentConstruct && !childFlow._gfmTableDynamicInterruptHack\n      )\n    } // Check if there is a new container.\n\n    self.containerState = {}\n    return effects.check(\n      containerConstruct,\n      thereIsANewContainer,\n      thereIsNoNewContainer\n    )(code)\n  }\n  /** @type {State} */\n\n  function thereIsANewContainer(code) {\n    if (childFlow) closeFlow()\n    exitContainers(continued)\n    return documentContinued(code)\n  }\n  /** @type {State} */\n\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  /** @type {State} */\n\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  /** @type {State} */\n\n  function containerContinue(code) {\n    continued++\n    stack.push([self.currentConstruct, self.containerState]) // Try another.\n\n    return documentContinued(code)\n  }\n  /** @type {State} */\n\n  function flowStart(code) {\n    if (code === null) {\n      if (childFlow) closeFlow()\n      exitContainers(0)\n      effects.consume(code)\n      return\n    }\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  /** @type {State} */\n\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\n    if (markdownLineEnding(code)) {\n      effects.consume(code)\n      writeToChild(effects.exit('chunkFlow')) // Get ready for the next line.\n\n      continued = 0\n      self.interrupt = undefined\n      return start\n    }\n\n    effects.consume(code)\n    return flowContinue\n  }\n  /**\n   * @param {Token} token\n   * @param {boolean} [eof]\n   * @returns {void}\n   */\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) // 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\n    if (self.parser.lazy[token.start.line]) {\n      let index = childFlow.events.length\n\n      while (index--) {\n        if (\n          // The token starts before the line ending…\n          childFlow.events[index][1].start.offset < lineStartOffset && // …and either is not ended yet…\n          (!childFlow.events[index][1].end || // …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      } // Note: this algorithm for moving events around is similar to the\n      // algorithm when closing flow in `documentContinue`.\n\n      const indexBeforeExits = self.events.length\n      let indexBeforeFlow = indexBeforeExits\n      /** @type {boolean|undefined} */\n\n      let seen\n      /** @type {Point|undefined} */\n\n      let point // Find the previous chunk (the one before the lazy line).\n\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\n          seen = true\n        }\n      }\n\n      exitContainers(continued) // Fix positions.\n\n      index = indexBeforeExits\n\n      while (index < self.events.length) {\n        self.events[index][1].end = Object.assign({}, point)\n        index++\n      } // Inject the exits earlier (they’re still also at the end).\n\n      splice(\n        self.events,\n        indexBeforeFlow + 1,\n        0,\n        self.events.slice(indexBeforeExits)\n      ) // Discard the duplicate exits.\n\n      self.events.length = index\n    }\n  }\n  /**\n   * @param {number} size\n   * @returns {void}\n   */\n\n  function exitContainers(size) {\n    let index = stack.length // Exit open containers.\n\n    while (index-- > size) {\n      const entry = stack[index]\n      self.containerState = entry[1]\n      entry[0].exit.call(self, effects)\n    }\n\n    stack.length = size\n  }\n\n  function closeFlow() {\n    childFlow.write([null])\n    childToken = undefined\n    childFlow = undefined\n    self.containerState._closeFlow = undefined\n  }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeContainer(effects, ok, nok) {\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').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const blankLine = {\n  tokenize: tokenizeBlankLine,\n  partial: true\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeBlankLine(effects, ok, nok) {\n  return factorySpace(effects, afterWhitespace, 'linePrefix')\n  /** @type {State} */\n\n  function afterWhitespace(code) {\n    return code === null || markdownLineEnding(code) ? ok(code) : nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').Chunk} Chunk\n * @typedef {import('micromark-util-types').Event} Event\n */\nimport {splice} from 'micromark-util-chunked'\n\n/**\n * Tokenize subcontent.\n *\n * @param {Event[]} events\n * @returns {boolean}\n */\nexport function subtokenize(events) {\n  /** @type {Record<string, number>} */\n  const jumps = {}\n  let index = -1\n  /** @type {Event} */\n\n  let event\n  /** @type {number|undefined} */\n\n  let lineIndex\n  /** @type {number} */\n\n  let otherIndex\n  /** @type {Event} */\n\n  let otherEvent\n  /** @type {Event[]} */\n\n  let parameters\n  /** @type {Event[]} */\n\n  let subevents\n  /** @type {boolean|undefined} */\n\n  let more\n\n  while (++index < events.length) {\n    while (index in jumps) {\n      index = jumps[index]\n    }\n\n    event = events[index] // 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\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\n      if (\n        otherIndex < subevents.length &&\n        subevents[otherIndex][1].type === 'lineEndingBlank'\n      ) {\n        otherIndex += 2\n      }\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\n          if (subevents[otherIndex][1].type === 'chunkText') {\n            subevents[otherIndex][1]._isInFirstContentOfListItem = true\n            otherIndex++\n          }\n        }\n      }\n    } // Enter.\n\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    } // Exit.\n    else if (event[1]._container) {\n      otherIndex = index\n      lineIndex = undefined\n\n      while (otherIndex--) {\n        otherEvent = events[otherIndex]\n\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\n            otherEvent[1].type = 'lineEnding'\n            lineIndex = otherIndex\n          }\n        } else {\n          break\n        }\n      }\n\n      if (lineIndex) {\n        // Fix position.\n        event[1].end = Object.assign({}, events[lineIndex][1].start) // Switch container exit w/ line endings.\n\n        parameters = events.slice(lineIndex, index)\n        parameters.unshift(event)\n        splice(events, lineIndex, index - lineIndex + 1, parameters)\n      }\n    }\n  }\n\n  return !more\n}\n/**\n * Tokenize embedded tokens.\n *\n * @param {Event[]} events\n * @param {number} eventIndex\n * @returns {Record<string, number>}\n */\n\nfunction subcontent(events, eventIndex) {\n  const token = events[eventIndex][1]\n  const context = events[eventIndex][2]\n  let startPosition = eventIndex - 1\n  /** @type {number[]} */\n\n  const startPositions = []\n  const tokenizer =\n    token._tokenizer || context.parser[token.contentType](token.start)\n  const childEvents = tokenizer.events\n  /** @type {[number, number][]} */\n\n  const jumps = []\n  /** @type {Record<string, number>} */\n\n  const gaps = {}\n  /** @type {Chunk[]} */\n\n  let stream\n  /** @type {Token|undefined} */\n\n  let previous\n  let index = -1\n  /** @type {Token|undefined} */\n\n  let current = token\n  let adjust = 0\n  let start = 0\n  const breaks = [start] // Loop forward through the linked tokens to pass them in order to the\n  // subtokenizer.\n\n  while (current) {\n    // Find the position of the event for this token.\n    while (events[++startPosition][1] !== current) {\n      // Empty.\n    }\n\n    startPositions.push(startPosition)\n\n    if (!current._tokenizer) {\n      stream = context.sliceStream(current)\n\n      if (!current.next) {\n        stream.push(null)\n      }\n\n      if (previous) {\n        tokenizer.defineSkip(current.start)\n      }\n\n      if (current._isInFirstContentOfListItem) {\n        tokenizer._gfmTasklistFirstContentOfListItem = true\n      }\n\n      tokenizer.write(stream)\n\n      if (current._isInFirstContentOfListItem) {\n        tokenizer._gfmTasklistFirstContentOfListItem = undefined\n      }\n    } // Unravel the next token.\n\n    previous = current\n    current = current.next\n  } // Now, loop back through all events (and linked tokens), to figure out which\n  // parts belong where.\n\n  current = token\n\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) // Help GC.\n\n      current._tokenizer = undefined\n      current.previous = undefined\n      current = current.next\n    }\n  } // Help GC.\n\n  tokenizer.events = [] // 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\n  if (current) {\n    // Help GC.\n    current._tokenizer = undefined\n    current.previous = undefined\n  } else {\n    breaks.pop()\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\n  index = breaks.length\n\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\n  index = -1\n\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\n  return gaps\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\nimport {subtokenize} from 'micromark-util-subtokenize'\n\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/** @type {Construct} */\n\nconst continuationConstruct = {\n  tokenize: tokenizeContinuation,\n  partial: true\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 */\n\nfunction resolveContent(events) {\n  subtokenize(events)\n  return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeContent(effects, ok) {\n  /** @type {Token} */\n  let previous\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('content')\n    previous = effects.enter('chunkContent', {\n      contentType: 'content'\n    })\n    return data(code)\n  }\n  /** @type {State} */\n\n  function data(code) {\n    if (code === null) {\n      return contentEnd(code)\n    }\n\n    if (markdownLineEnding(code)) {\n      return effects.check(\n        continuationConstruct,\n        contentContinue,\n        contentEnd\n      )(code)\n    } // Data.\n\n    effects.consume(code)\n    return data\n  }\n  /** @type {State} */\n\n  function contentEnd(code) {\n    effects.exit('chunkContent')\n    effects.exit('content')\n    return ok(code)\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 data\n  }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeContinuation(effects, ok, nok) {\n  const self = this\n  return startLookahead\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  /** @type {State} */\n\n  function prefixed(code) {\n    if (code === null || markdownLineEnding(code)) {\n      return nok(code)\n    }\n\n    const tail = self.events[self.events.length - 1]\n\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\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 */\nimport {blankLine, content} from 'micromark-core-commonmark'\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {InitialConstruct} */\nexport const flow = {\n  tokenize: initializeFlow\n}\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, // 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  /** @type {State} */\n\n  function atBlankEnding(code) {\n    if (code === null) {\n      effects.consume(code)\n      return\n    }\n\n    effects.enter('lineEndingBlank')\n    effects.consume(code)\n    effects.exit('lineEndingBlank')\n    self.currentConstruct = undefined\n    return initial\n  }\n  /** @type {State} */\n\n  function afterConstruct(code) {\n    if (code === null) {\n      effects.consume(code)\n      return\n    }\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').Resolver} Resolver\n * @typedef {import('micromark-util-types').Initializer} Initializer\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nexport const resolver = {\n  resolveAll: createResolver()\n}\nexport const string = initializeFactory('string')\nexport const text = initializeFactory('text')\n/**\n * @param {'string'|'text'} field\n * @returns {InitialConstruct}\n */\n\nfunction initializeFactory(field) {\n  return {\n    tokenize: initializeText,\n    resolveAll: createResolver(\n      field === 'text' ? resolveAllLineSuffixes : undefined\n    )\n  }\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    /** @type {State} */\n\n    function start(code) {\n      return atBreak(code) ? text(code) : notText(code)\n    }\n    /** @type {State} */\n\n    function notText(code) {\n      if (code === null) {\n        effects.consume(code)\n        return\n      }\n\n      effects.enter('data')\n      effects.consume(code)\n      return data\n    }\n    /** @type {State} */\n\n    function data(code) {\n      if (atBreak(code)) {\n        effects.exit('data')\n        return text(code)\n      } // Data.\n\n      effects.consume(code)\n      return data\n    }\n    /**\n     * @param {Code} code\n     * @returns {boolean}\n     */\n\n    function atBreak(code) {\n      if (code === null) {\n        return true\n      }\n\n      const list = constructs[code]\n      let index = -1\n\n      if (list) {\n        while (++index < list.length) {\n          const item = list[index]\n\n          if (!item.previous || item.previous.call(self, self.previous)) {\n            return true\n          }\n        }\n      }\n\n      return false\n    }\n  }\n}\n/**\n * @param {Resolver} [extraResolver]\n * @returns {Resolver}\n */\n\nfunction createResolver(extraResolver) {\n  return resolveAllText\n  /** @type {Resolver} */\n\n  function resolveAllText(events, context) {\n    let index = -1\n    /** @type {number|undefined} */\n\n    let enter // A rather boring computation (to merge adjacent `data` events) which\n    // improves mm performance by 29%.\n\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\n        enter = undefined\n      }\n    }\n\n    return extraResolver ? extraResolver(events, context) : events\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 */\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\n      let tabs\n\n      while (index--) {\n        const chunk = chunks[index]\n\n        if (typeof chunk === 'string') {\n          bufferIndex = chunk.length\n\n          while (chunk.charCodeAt(bufferIndex - 1) === 32) {\n            size++\n            bufferIndex--\n          }\n\n          if (bufferIndex) break\n          bufferIndex = -1\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\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\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\n      eventIndex++\n    }\n  }\n\n  return events\n}\n","/**\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Resolver} Resolver\n */\n\n/**\n * Call all `resolveAll`s.\n *\n * @param {{resolveAll?: Resolver}[]} constructs\n * @param {Event[]} events\n * @param {TokenizeContext} context\n * @returns {Event[]}\n */\nexport function resolveAll(constructs, events, context) {\n  /** @type {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').Code} Code\n * @typedef {import('micromark-util-types').Chunk} Chunk\n * @typedef {import('micromark-util-types').Point} Point\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').ConstructRecord} ConstructRecord\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').ParseContext} ParseContext\n */\n\n/**\n * @typedef Info\n * @property {() => void} restore\n * @property {number} from\n *\n * @callback ReturnHandle\n *   Handle a successful run.\n * @param {Construct} construct\n * @param {Info} info\n * @returns {void}\n */\nimport {markdownLineEnding} from 'micromark-util-character'\nimport {push, splice} from 'micromark-util-chunked'\nimport {resolveAll} from 'micromark-util-resolve-all'\n\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, '_index'|'_bufferIndex'>} [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\n  const columnStart = {}\n  /** @type {Array<Construct>} */\n\n  const resolveAllConstructs = []\n  /** @type {Array<Chunk>} */\n\n  let chunks = []\n  /** @type {Array<Token>} */\n\n  let stack = []\n  /** @type {boolean|undefined} */\n\n  let consumed = true\n  /**\n   * Tools used for tokenizing.\n   *\n   * @type {Effects}\n   */\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   * State and tools for resolving and serializing.\n   *\n   * @type {TokenizeContext}\n   */\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   * The state function.\n   *\n   * @type {State|void}\n   */\n\n  let state = initialize.tokenize.call(context, effects)\n  /**\n   * Track which character we expect to be consumed, to catch bugs.\n   *\n   * @type {Code}\n   */\n\n  let expectedCode\n\n  if (initialize.resolveAll) {\n    resolveAllConstructs.push(initialize)\n  }\n\n  return context\n  /** @type {TokenizeContext['write']} */\n\n  function write(slice) {\n    chunks = push(chunks, slice)\n    main() // Exit if we’re not done, resolve might change stuff.\n\n    if (chunks[chunks.length - 1] !== null) {\n      return []\n    }\n\n    addResult(initialize, 0) // Otherwise, resolve, and exit.\n\n    context.events = resolveAll(resolveAllConstructs, context.events, context)\n    return context.events\n  } //\n  // Tools.\n  //\n\n  /** @type {TokenizeContext['sliceSerialize']} */\n\n  function sliceSerialize(token, expandTabs) {\n    return serializeChunks(sliceStream(token), expandTabs)\n  }\n  /** @type {TokenizeContext['sliceStream']} */\n\n  function sliceStream(token) {\n    return sliceChunks(chunks, token)\n  }\n  /** @type {TokenizeContext['now']} */\n\n  function now() {\n    return Object.assign({}, point)\n  }\n  /** @type {TokenizeContext['defineSkip']} */\n\n  function defineSkip(value) {\n    columnStart[value.line] = value.column\n    accountForPotentialSkip()\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 {void}\n   */\n\n  function main() {\n    /** @type {number} */\n    let chunkIndex\n\n    while (point._index < chunks.length) {\n      const chunk = chunks[point._index] // If we’re in a buffer chunk, loop through it.\n\n      if (typeof chunk === 'string') {\n        chunkIndex = point._index\n\n        if (point._bufferIndex < 0) {\n          point._bufferIndex = 0\n        }\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   * Deal with one code.\n   *\n   * @param {Code} code\n   * @returns {void}\n   */\n\n  function go(code) {\n    consumed = undefined\n    expectedCode = code\n    state = state(code)\n  }\n  /** @type {Effects['consume']} */\n\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    } // Not in a string chunk.\n\n    if (point._bufferIndex < 0) {\n      point._index++\n    } else {\n      point._bufferIndex++ // At end of string chunk.\n      // @ts-expect-error Points w/ non-negative `_bufferIndex` reference\n      // strings.\n\n      if (point._bufferIndex === chunks[point._index].length) {\n        point._bufferIndex = -1\n        point._index++\n      }\n    } // Expose the previous character.\n\n    context.previous = code // Mark as consumed.\n\n    consumed = true\n  }\n  /** @type {Effects['enter']} */\n\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  /** @type {Effects['exit']} */\n\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   * Use results.\n   *\n   * @type {ReturnHandle}\n   */\n\n  function onsuccessfulconstruct(construct, info) {\n    addResult(construct, info.from)\n  }\n  /**\n   * Discard results.\n   *\n   * @type {ReturnHandle}\n   */\n\n  function onsuccessfulcheck(_, info) {\n    info.restore()\n  }\n  /**\n   * Factory to attempt/check/interrupt.\n   *\n   * @param {ReturnHandle} onreturn\n   * @param {Record<string, unknown>} [fields]\n   */\n\n  function constructFactory(onreturn, fields) {\n    return hook\n    /**\n     * Handle either an object mapping codes to constructs, a list of\n     * constructs, or a single construct.\n     *\n     * @param {Construct|Array<Construct>|ConstructRecord} constructs\n     * @param {State} returnState\n     * @param {State} [bogusState]\n     * @returns {State}\n     */\n\n    function hook(constructs, returnState, bogusState) {\n      /** @type {Array<Construct>} */\n      let listOfConstructs\n      /** @type {number} */\n\n      let constructIndex\n      /** @type {Construct} */\n\n      let currentConstruct\n      /** @type {Info} */\n\n      let info\n      return Array.isArray(constructs)\n        ? /* c8 ignore next 1 */\n          handleListOfConstructs(constructs)\n        : 'tokenize' in constructs // @ts-expect-error Looks like a construct.\n        ? handleListOfConstructs([constructs])\n        : handleMapOfConstructs(constructs)\n      /**\n       * Handle a list of construct.\n       *\n       * @param {ConstructRecord} map\n       * @returns {State}\n       */\n\n      function handleMapOfConstructs(map) {\n        return start\n        /** @type {State} */\n\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\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       * Handle a list of construct.\n       *\n       * @param {Array<Construct>} list\n       * @returns {State}\n       */\n\n      function handleListOfConstructs(list) {\n        listOfConstructs = list\n        constructIndex = 0\n\n        if (list.length === 0) {\n          return bogusState\n        }\n\n        return handleConstruct(list[constructIndex])\n      }\n      /**\n       * Handle a single construct.\n       *\n       * @param {Construct} construct\n       * @returns {State}\n       */\n\n      function handleConstruct(construct) {\n        return start\n        /** @type {State} */\n\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\n          if (!construct.partial) {\n            context.currentConstruct = construct\n          }\n\n          if (\n            construct.name &&\n            context.parser.constructs.disable.null.includes(construct.name)\n          ) {\n            return nok(code)\n          }\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      /** @type {State} */\n\n      function ok(code) {\n        consumed = true\n        onreturn(currentConstruct, info)\n        return returnState\n      }\n      /** @type {State} */\n\n      function nok(code) {\n        consumed = true\n        info.restore()\n\n        if (++constructIndex < listOfConstructs.length) {\n          return handleConstruct(listOfConstructs[constructIndex])\n        }\n\n        return bogusState\n      }\n    }\n  }\n  /**\n   * @param {Construct} construct\n   * @param {number} from\n   * @returns {void}\n   */\n\n  function addResult(construct, from) {\n    if (construct.resolveAll && !resolveAllConstructs.includes(construct)) {\n      resolveAllConstructs.push(construct)\n    }\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\n    if (construct.resolveTo) {\n      context.events = construct.resolveTo(context.events, context)\n    }\n  }\n  /**\n   * Store state.\n   *\n   * @returns {Info}\n   */\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     * Restore state.\n     *\n     * @returns {void}\n     */\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   * Move the current point a bit forward in the line when it’s on a column\n   * skip.\n   *\n   * @returns {void}\n   */\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 * Get the chunks from a slice of chunks in the range of a token.\n *\n * @param {Array<Chunk>} chunks\n * @param {Pick<Token, 'start'|'end'>} token\n * @returns {Array<Chunk>}\n */\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\n  let view\n\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\n    if (startBufferIndex > -1) {\n      // @ts-expect-error `_bufferIndex` is used on string chunks.\n      view[0] = view[0].slice(startBufferIndex)\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\n  return view\n}\n/**\n * Get the string value of a slice of chunks.\n *\n * @param {Array<Chunk>} chunks\n * @param {boolean} [expandTabs=false]\n * @returns {string}\n */\n\nfunction serializeChunks(chunks, expandTabs) {\n  let index = -1\n  /** @type {Array<string>} */\n\n  const result = []\n  /** @type {boolean|undefined} */\n\n  let atTab\n\n  while (++index < chunks.length) {\n    const chunk = chunks[index]\n    /** @type {string} */\n\n    let value\n\n    if (typeof chunk === 'string') {\n      value = chunk\n    } else\n      switch (chunk) {\n        case -5: {\n          value = '\\r'\n          break\n        }\n\n        case -4: {\n          value = '\\n'\n          break\n        }\n\n        case -3: {\n          value = '\\r' + '\\n'\n          break\n        }\n\n        case -2: {\n          value = expandTabs ? ' ' : '\\t'\n          break\n        }\n\n        case -1: {\n          if (!expandTabs && atTab) continue\n          value = ' '\n          break\n        }\n\n        default: {\n          // Currently only replacement character.\n          value = String.fromCharCode(chunk)\n        }\n      }\n\n    atTab = chunk === -2\n    result.push(value)\n  }\n\n  return result.join('')\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const thematicBreak = {\n  name: 'thematicBreak',\n  tokenize: tokenizeThematicBreak\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeThematicBreak(effects, ok, nok) {\n  let size = 0\n  /** @type {NonNullable<Code>} */\n\n  let marker\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('thematicBreak')\n    marker = code\n    return atBreak(code)\n  }\n  /** @type {State} */\n\n  function atBreak(code) {\n    if (code === marker) {\n      effects.enter('thematicBreakSequence')\n      return sequence(code)\n    }\n\n    if (markdownSpace(code)) {\n      return factorySpace(effects, atBreak, 'whitespace')(code)\n    }\n\n    if (size < 3 || (code !== null && !markdownLineEnding(code))) {\n      return nok(code)\n    }\n\n    effects.exit('thematicBreak')\n    return ok(code)\n  }\n  /** @type {State} */\n\n  function sequence(code) {\n    if (code === marker) {\n      effects.consume(code)\n      size++\n      return sequence\n    }\n\n    effects.exit('thematicBreakSequence')\n    return atBreak(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').Exiter} Exiter\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\n\n/**\n * @typedef {Record<string, unknown> & {marker: Code, type: string, size: number}} ListContainerState\n * @typedef {TokenizeContext & {containerState: ListContainerState}} TokenizeContextWithState\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/** @type {Construct} */\n\nexport const list = {\n  name: 'list',\n  tokenize: tokenizeListStart,\n  continuation: {\n    tokenize: tokenizeListContinuation\n  },\n  exit: tokenizeListEnd\n}\n/** @type {Construct} */\n\nconst listItemPrefixWhitespaceConstruct = {\n  tokenize: tokenizeListItemPrefixWhitespace,\n  partial: true\n}\n/** @type {Construct} */\n\nconst indentConstruct = {\n  tokenize: tokenizeIndent,\n  partial: true\n}\n/**\n * @type {Tokenizer}\n * @this {TokenizeContextWithState}\n */\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  /** @type {State} */\n\n  function start(code) {\n    const kind =\n      self.containerState.type ||\n      (code === 42 || code === 43 || code === 45\n        ? 'listUnordered'\n        : 'listOrdered')\n\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\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\n      if (!self.interrupt || code === 49) {\n        effects.enter('listItemPrefix')\n        effects.enter('listItemValue')\n        return inside(code)\n      }\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function inside(code) {\n    if (asciiDigit(code) && ++size < 10) {\n      effects.consume(code)\n      return inside\n    }\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\n    return nok(code)\n  }\n  /**\n   * @type {State}\n   **/\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, // Can’t be empty when interrupting.\n      self.interrupt ? nok : onBlank,\n      effects.attempt(\n        listItemPrefixWhitespaceConstruct,\n        endOfPrefix,\n        otherPrefix\n      )\n    )\n  }\n  /** @type {State} */\n\n  function onBlank(code) {\n    self.containerState.initialBlankLine = true\n    initialSize++\n    return endOfPrefix(code)\n  }\n  /** @type {State} */\n\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\n    return nok(code)\n  }\n  /** @type {State} */\n\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 * @type {Tokenizer}\n * @this {TokenizeContextWithState}\n */\n\nfunction tokenizeListContinuation(effects, ok, nok) {\n  const self = this\n  self.containerState._closeFlow = undefined\n  return effects.check(blankLine, onBlank, notBlank)\n  /** @type {State} */\n\n  function onBlank(code) {\n    self.containerState.furtherBlankLines =\n      self.containerState.furtherBlankLines ||\n      self.containerState.initialBlankLine // We have a blank line.\n    // Still, try to consume at most the items size.\n\n    return factorySpace(\n      effects,\n      ok,\n      'listItemIndent',\n      self.containerState.size + 1\n    )(code)\n  }\n  /** @type {State} */\n\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\n    self.containerState.furtherBlankLines = undefined\n    self.containerState.initialBlankLine = undefined\n    return effects.attempt(indentConstruct, ok, notInCurrentItem)(code)\n  }\n  /** @type {State} */\n\n  function notInCurrentItem(code) {\n    // While we do continue, we signal that the flow should be closed.\n    self.containerState._closeFlow = true // As we’re closing flow, we’re no longer interrupting.\n\n    self.interrupt = undefined\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 * @type {Tokenizer}\n * @this {TokenizeContextWithState}\n */\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  /** @type {State} */\n\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 * @type {Exiter}\n * @this {TokenizeContextWithState}\n */\n\nfunction tokenizeListEnd(effects) {\n  effects.exit(this.containerState.type)\n}\n/**\n * @type {Tokenizer}\n * @this {TokenizeContextWithState}\n */\n\nfunction tokenizeListItemPrefixWhitespace(effects, ok, nok) {\n  const self = this\n  return factorySpace(\n    effects,\n    afterPrefix,\n    'listItemPrefixWhitespace',\n    self.parser.constructs.disable.null.includes('codeIndented')\n      ? undefined\n      : 4 + 1\n  )\n  /** @type {State} */\n\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').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Exiter} Exiter\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownSpace} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const blockQuote = {\n  name: 'blockQuote',\n  tokenize: tokenizeBlockQuoteStart,\n  continuation: {\n    tokenize: tokenizeBlockQuoteContinuation\n  },\n  exit\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeBlockQuoteStart(effects, ok, nok) {\n  const self = this\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    if (code === 62) {\n      const state = self.containerState\n\n      if (!state.open) {\n        effects.enter('blockQuote', {\n          _container: true\n        })\n        state.open = true\n      }\n\n      effects.enter('blockQuotePrefix')\n      effects.enter('blockQuoteMarker')\n      effects.consume(code)\n      effects.exit('blockQuoteMarker')\n      return after\n    }\n\n    return nok(code)\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\n    effects.exit('blockQuotePrefix')\n    return ok(code)\n  }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeBlockQuoteContinuation(effects, ok, nok) {\n  return factorySpace(\n    effects,\n    effects.attempt(blockQuote, ok, nok),\n    'linePrefix',\n    this.parser.constructs.disable.null.includes('codeIndented') ? undefined : 4\n  )\n}\n/** @type {Exiter} */\n\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 */\nimport {\n  asciiControl,\n  markdownLineEndingOrSpace,\n  markdownLineEnding\n} from 'micromark-util-character'\n\n/**\n * @param {Effects} effects\n * @param {State} ok\n * @param {State} nok\n * @param {string} type\n * @param {string} literalType\n * @param {string} literalMarkerType\n * @param {string} rawType\n * @param {string} stringType\n * @param {number} [max=Infinity]\n * @returns {State}\n */\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  /** @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 destinationEnclosedBefore\n    }\n\n    if (code === null || code === 41 || asciiControl(code)) {\n      return nok(code)\n    }\n\n    effects.enter(type)\n    effects.enter(rawType)\n    effects.enter(stringType)\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return destinationRaw(code)\n  }\n  /** @type {State} */\n\n  function destinationEnclosedBefore(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\n    effects.enter(stringType)\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return destinationEnclosed(code)\n  }\n  /** @type {State} */\n\n  function destinationEnclosed(code) {\n    if (code === 62) {\n      effects.exit('chunkString')\n      effects.exit(stringType)\n      return destinationEnclosedBefore(code)\n    }\n\n    if (code === null || code === 60 || markdownLineEnding(code)) {\n      return nok(code)\n    }\n\n    effects.consume(code)\n    return code === 92 ? destinationEnclosedEscape : destinationEnclosed\n  }\n  /** @type {State} */\n\n  function destinationEnclosedEscape(code) {\n    if (code === 60 || code === 62 || code === 92) {\n      effects.consume(code)\n      return destinationEnclosed\n    }\n\n    return destinationEnclosed(code)\n  }\n  /** @type {State} */\n\n  function destinationRaw(code) {\n    if (code === 40) {\n      if (++balance > limit) return nok(code)\n      effects.consume(code)\n      return destinationRaw\n    }\n\n    if (code === 41) {\n      if (!balance--) {\n        effects.exit('chunkString')\n        effects.exit(stringType)\n        effects.exit(rawType)\n        effects.exit(type)\n        return ok(code)\n      }\n\n      effects.consume(code)\n      return destinationRaw\n    }\n\n    if (code === null || markdownLineEndingOrSpace(code)) {\n      if (balance) return nok(code)\n      effects.exit('chunkString')\n      effects.exit(stringType)\n      effects.exit(rawType)\n      effects.exit(type)\n      return ok(code)\n    }\n\n    if (asciiControl(code)) return nok(code)\n    effects.consume(code)\n    return code === 92 ? destinationRawEscape : destinationRaw\n  }\n  /** @type {State} */\n\n  function destinationRawEscape(code) {\n    if (code === 40 || code === 41 || code === 92) {\n      effects.consume(code)\n      return destinationRaw\n    }\n\n    return destinationRaw(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').TokenizeContext} TokenizeContext\n * @typedef {import('micromark-util-types').State} State\n */\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n\n/**\n * @this {TokenizeContext}\n * @param {Effects} effects\n * @param {State} ok\n * @param {State} nok\n * @param {string} type\n * @param {string} markerType\n * @param {string} stringType\n * @returns {State}\n */\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\n  let data\n  return start\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  /** @type {State} */\n\n  function atBreak(code) {\n    if (\n      code === null ||\n      code === 91 ||\n      (code === 93 && !data) ||\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\n      /* Hidden footnotes hook */\n\n      /* c8 ignore next 3 */\n      (code === 94 &&\n        !size &&\n        '_hiddenFootnoteSupport' in self.parser.constructs) ||\n      size > 999\n    ) {\n      return nok(code)\n    }\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    if (markdownLineEnding(code)) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return atBreak\n    }\n\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return label(code)\n  }\n  /** @type {State} */\n\n  function label(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\n    effects.consume(code)\n    data = data || !markdownSpace(code)\n    return code === 92 ? labelEscape : label\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 label\n    }\n\n    return label(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').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/**\n * @param {Effects} effects\n * @param {State} ok\n * @param {State} nok\n * @param {string} type\n * @param {string} markerType\n * @param {string} stringType\n * @returns {State}\n */\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  /** @type {State} */\n\n  function start(code) {\n    effects.enter(type)\n    effects.enter(markerType)\n    effects.consume(code)\n    effects.exit(markerType)\n    marker = code === 40 ? 41 : code\n    return atFirstTitleBreak\n  }\n  /** @type {State} */\n\n  function atFirstTitleBreak(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\n    effects.enter(stringType)\n    return atTitleBreak(code)\n  }\n  /** @type {State} */\n\n  function atTitleBreak(code) {\n    if (code === marker) {\n      effects.exit(stringType)\n      return atFirstTitleBreak(marker)\n    }\n\n    if (code === null) {\n      return nok(code)\n    } // Note: blank lines can’t exist in content.\n\n    if (markdownLineEnding(code)) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return factorySpace(effects, atTitleBreak, 'linePrefix')\n    }\n\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return title(code)\n  }\n  /** @type {State} */\n\n  function title(code) {\n    if (code === marker || code === null || markdownLineEnding(code)) {\n      effects.exit('chunkString')\n      return atTitleBreak(code)\n    }\n\n    effects.consume(code)\n    return code === 92 ? titleEscape : title\n  }\n  /** @type {State} */\n\n  function titleEscape(code) {\n    if (code === marker || code === 92) {\n      effects.consume(code)\n      return title\n    }\n\n    return title(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Effects} Effects\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding, markdownSpace} from 'micromark-util-character'\n\n/**\n * @param {Effects} effects\n * @param {State} ok\n */\nexport function factoryWhitespace(effects, ok) {\n  /** @type {boolean} */\n  let seen\n  return start\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      seen = true\n      return start\n    }\n\n    if (markdownSpace(code)) {\n      return factorySpace(\n        effects,\n        start,\n        seen ? 'linePrefix' : 'lineSuffix'\n      )(code)\n    }\n\n    return ok(code)\n  }\n}\n","/**\n * Normalize an identifier (such as used in definitions).\n *\n * @param {string} value\n * @returns {string}\n */\nexport function normalizeIdentifier(value) {\n  return (\n    value // Collapse Markdown whitespace.\n      .replace(/[\\t\\n\\r ]+/g, ' ') // Trim.\n      .replace(/^ | $/g, '') // 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').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\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 {normalizeIdentifier} from 'micromark-util-normalize-identifier'\nimport {\n  markdownLineEnding,\n  markdownLineEndingOrSpace\n} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const definition = {\n  name: 'definition',\n  tokenize: tokenizeDefinition\n}\n/** @type {Construct} */\n\nconst titleConstruct = {\n  tokenize: tokenizeTitle,\n  partial: true\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeDefinition(effects, ok, nok) {\n  const self = this\n  /** @type {string} */\n\n  let identifier\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('definition')\n    return factoryLabel.call(\n      self,\n      effects,\n      labelAfter,\n      nok,\n      'definitionLabel',\n      'definitionLabelMarker',\n      'definitionLabelString'\n    )(code)\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\n    if (code === 58) {\n      effects.enter('definitionMarker')\n      effects.consume(code)\n      effects.exit('definitionMarker') // Note: blank lines can’t exist in content.\n\n      return factoryWhitespace(\n        effects,\n        factoryDestination(\n          effects,\n          effects.attempt(\n            titleConstruct,\n            factorySpace(effects, after, 'whitespace'),\n            factorySpace(effects, after, 'whitespace')\n          ),\n          nok,\n          'definitionDestination',\n          'definitionDestinationLiteral',\n          'definitionDestinationLiteralMarker',\n          'definitionDestinationRaw',\n          'definitionDestinationString'\n        )\n      )\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function after(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('definition')\n\n      if (!self.parser.defined.includes(identifier)) {\n        self.parser.defined.push(identifier)\n      }\n\n      return ok(code)\n    }\n\n    return nok(code)\n  }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeTitle(effects, ok, nok) {\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    return markdownLineEndingOrSpace(code)\n      ? factoryWhitespace(effects, before)(code)\n      : nok(code)\n  }\n  /** @type {State} */\n\n  function before(code) {\n    if (code === 34 || code === 39 || code === 40) {\n      return factoryTitle(\n        effects,\n        factorySpace(effects, after, 'whitespace'),\n        nok,\n        'definitionTitle',\n        'definitionTitleMarker',\n        'definitionTitleString'\n      )(code)\n    }\n\n    return nok(code)\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').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const codeIndented = {\n  name: 'codeIndented',\n  tokenize: tokenizeCodeIndented\n}\n/** @type {Construct} */\n\nconst indentedContent = {\n  tokenize: tokenizeIndentedContent,\n  partial: true\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeCodeIndented(effects, ok, nok) {\n  const self = this\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('codeIndented')\n    return factorySpace(effects, afterStartPrefix, 'linePrefix', 4 + 1)(code)\n  }\n  /** @type {State} */\n\n  function afterStartPrefix(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      ? afterPrefix(code)\n      : nok(code)\n  }\n  /** @type {State} */\n\n  function afterPrefix(code) {\n    if (code === null) {\n      return after(code)\n    }\n\n    if (markdownLineEnding(code)) {\n      return effects.attempt(indentedContent, afterPrefix, after)(code)\n    }\n\n    effects.enter('codeFlowValue')\n    return content(code)\n  }\n  /** @type {State} */\n\n  function content(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('codeFlowValue')\n      return afterPrefix(code)\n    }\n\n    effects.consume(code)\n    return content\n  }\n  /** @type {State} */\n\n  function after(code) {\n    effects.exit('codeIndented')\n    return ok(code)\n  }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeIndentedContent(effects, ok, nok) {\n  const self = this\n  return start\n  /** @type {State} */\n\n  function start(code) {\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\n    if (markdownLineEnding(code)) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return start\n    }\n\n    return factorySpace(effects, afterPrefix, 'linePrefix', 4 + 1)(code)\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      ? start(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').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\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\n/** @type {Construct} */\nexport const headingAtx = {\n  name: 'headingAtx',\n  tokenize: tokenizeHeadingAtx,\n  resolve: resolveHeadingAtx\n}\n/** @type {Resolver} */\n\nfunction resolveHeadingAtx(events, context) {\n  let contentEnd = events.length - 2\n  let contentStart = 3\n  /** @type {Token} */\n\n  let content\n  /** @type {Token} */\n\n  let text // Prefix whitespace, part of the opening.\n\n  if (events[contentStart][1].type === 'whitespace') {\n    contentStart += 2\n  } // Suffix whitespace, part of the closing.\n\n  if (\n    contentEnd - 2 > contentStart &&\n    events[contentEnd][1].type === 'whitespace'\n  ) {\n    contentEnd -= 2\n  }\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\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      // @ts-expect-error Constants are fine to assign.\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\n  return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeHeadingAtx(effects, ok, nok) {\n  const self = this\n  let size = 0\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('atxHeading')\n    effects.enter('atxHeadingSequence')\n    return fenceOpenInside(code)\n  }\n  /** @type {State} */\n\n  function fenceOpenInside(code) {\n    if (code === 35 && size++ < 6) {\n      effects.consume(code)\n      return fenceOpenInside\n    }\n\n    if (code === null || markdownLineEndingOrSpace(code)) {\n      effects.exit('atxHeadingSequence')\n      return self.interrupt ? ok(code) : headingBreak(code)\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function headingBreak(code) {\n    if (code === 35) {\n      effects.enter('atxHeadingSequence')\n      return sequence(code)\n    }\n\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('atxHeading')\n      return ok(code)\n    }\n\n    if (markdownSpace(code)) {\n      return factorySpace(effects, headingBreak, 'whitespace')(code)\n    }\n\n    effects.enter('atxHeadingText')\n    return data(code)\n  }\n  /** @type {State} */\n\n  function sequence(code) {\n    if (code === 35) {\n      effects.consume(code)\n      return sequence\n    }\n\n    effects.exit('atxHeadingSequence')\n    return headingBreak(code)\n  }\n  /** @type {State} */\n\n  function data(code) {\n    if (code === null || code === 35 || markdownLineEndingOrSpace(code)) {\n      effects.exit('atxHeadingText')\n      return headingBreak(code)\n    }\n\n    effects.consume(code)\n    return data\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').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const setextUnderline = {\n  name: 'setextUnderline',\n  tokenize: tokenizeSetextUnderline,\n  resolveTo: resolveToSetextUnderline\n}\n/** @type {Resolver} */\n\nfunction resolveToSetextUnderline(events, context) {\n  let index = events.length\n  /** @type {number|undefined} */\n\n  let content\n  /** @type {number|undefined} */\n\n  let text\n  /** @type {number|undefined} */\n\n  let definition // Find the opening of the content.\n  // It’ll always exist: we don’t tokenize if it isn’t there.\n\n  while (index--) {\n    if (events[index][0] === 'enter') {\n      if (events[index][1].type === 'content') {\n        content = index\n        break\n      }\n\n      if (events[index][1].type === 'paragraph') {\n        text = index\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\n      if (!definition && events[index][1].type === 'definition') {\n        definition = index\n      }\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  } // Change the paragraph to setext heading text.\n\n  events[text][1].type = 'setextHeadingText' // If we have definitions in the content, we’ll keep on having content,\n  // but we need move it.\n\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  } // Add the heading exit at the end.\n\n  events.push(['exit', heading, context])\n  return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeSetextUnderline(effects, ok, nok) {\n  const self = this\n  let index = self.events.length\n  /** @type {NonNullable<Code>} */\n\n  let marker\n  /** @type {boolean} */\n\n  let paragraph // Find an opening.\n\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  return start\n  /** @type {State} */\n\n  function start(code) {\n    if (!self.parser.lazy[self.now().line] && (self.interrupt || paragraph)) {\n      effects.enter('setextHeadingLine')\n      effects.enter('setextHeadingLineSequence')\n      marker = code\n      return closingSequence(code)\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function closingSequence(code) {\n    if (code === marker) {\n      effects.consume(code)\n      return closingSequence\n    }\n\n    effects.exit('setextHeadingLineSequence')\n    return factorySpace(effects, closingSequenceEnd, 'lineSuffix')(code)\n  }\n  /** @type {State} */\n\n  function closingSequenceEnd(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('setextHeadingLine')\n      return ok(code)\n    }\n\n    return nok(code)\n  }\n}\n","/**\n * List of lowercase HTML tag names which when parsing HTML (flow), result\n * in more relaxed rules (condition 6): because they are known blocks, the\n * HTML-like syntax doesn’t have to be 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 */\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  '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 tag names which when parsing HTML (flow), result in\n * HTML that can include lines w/o exiting, until a closing tag also in this\n * list is found (condition 1).\n *\n * This module is copied from:\n * <https://spec.commonmark.org/0.30/#html-blocks>.\n *\n * Note that `textarea` was added in `CommonMark@0.30`.\n */\nexport const htmlRawNames = ['pre', 'script', 'style', 'textarea']\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\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/** @type {Construct} */\n\nexport const htmlFlow = {\n  name: 'htmlFlow',\n  tokenize: tokenizeHtmlFlow,\n  resolveTo: resolveToHtmlFlow,\n  concrete: true\n}\n/** @type {Construct} */\n\nconst nextBlankConstruct = {\n  tokenize: tokenizeNextBlank,\n  partial: true\n}\n/** @type {Resolver} */\n\nfunction resolveToHtmlFlow(events) {\n  let index = events.length\n\n  while (index--) {\n    if (events[index][0] === 'enter' && events[index][1].type === 'htmlFlow') {\n      break\n    }\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 // Add the prefix start to the HTML line token.\n\n    events[index + 1][1].start = events[index - 2][1].start // Remove the line prefix.\n\n    events.splice(index - 2, 2)\n  }\n\n  return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeHtmlFlow(effects, ok, nok) {\n  const self = this\n  /** @type {number} */\n\n  let kind\n  /** @type {boolean} */\n\n  let startTag\n  /** @type {string} */\n\n  let buffer\n  /** @type {number} */\n\n  let index\n  /** @type {Code} */\n\n  let marker\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('htmlFlow')\n    effects.enter('htmlFlowData')\n    effects.consume(code)\n    return open\n  }\n  /** @type {State} */\n\n  function open(code) {\n    if (code === 33) {\n      effects.consume(code)\n      return declarationStart\n    }\n\n    if (code === 47) {\n      effects.consume(code)\n      return tagCloseStart\n    }\n\n    if (code === 63) {\n      effects.consume(code)\n      kind = 3 // 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\n      return self.interrupt ? ok : continuationDeclarationInside\n    }\n\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      buffer = String.fromCharCode(code)\n      startTag = true\n      return tagName\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function declarationStart(code) {\n    if (code === 45) {\n      effects.consume(code)\n      kind = 2\n      return commentOpenInside\n    }\n\n    if (code === 91) {\n      effects.consume(code)\n      kind = 5\n      buffer = 'CDATA['\n      index = 0\n      return cdataOpenInside\n    }\n\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      kind = 4\n      return self.interrupt ? ok : continuationDeclarationInside\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function commentOpenInside(code) {\n    if (code === 45) {\n      effects.consume(code)\n      return self.interrupt ? ok : continuationDeclarationInside\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function cdataOpenInside(code) {\n    if (code === buffer.charCodeAt(index++)) {\n      effects.consume(code)\n      return index === buffer.length\n        ? self.interrupt\n          ? ok\n          : continuation\n        : cdataOpenInside\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function tagCloseStart(code) {\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      buffer = String.fromCharCode(code)\n      return tagName\n    }\n\n    return nok(code)\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      if (\n        code !== 47 &&\n        startTag &&\n        htmlRawNames.includes(buffer.toLowerCase())\n      ) {\n        kind = 1\n        return self.interrupt ? ok(code) : continuation(code)\n      }\n\n      if (htmlBlockNames.includes(buffer.toLowerCase())) {\n        kind = 6\n\n        if (code === 47) {\n          effects.consume(code)\n          return basicSelfClosing\n        }\n\n        return self.interrupt ? ok(code) : continuation(code)\n      }\n\n      kind = 7 // Do not support complete HTML when interrupting\n\n      return self.interrupt && !self.parser.lazy[self.now().line]\n        ? nok(code)\n        : startTag\n        ? completeAttributeNameBefore(code)\n        : completeClosingTagAfter(code)\n    }\n\n    if (code === 45 || asciiAlphanumeric(code)) {\n      effects.consume(code)\n      buffer += String.fromCharCode(code)\n      return tagName\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function basicSelfClosing(code) {\n    if (code === 62) {\n      effects.consume(code)\n      return self.interrupt ? ok : continuation\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function completeClosingTagAfter(code) {\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return completeClosingTagAfter\n    }\n\n    return completeEnd(code)\n  }\n  /** @type {State} */\n\n  function completeAttributeNameBefore(code) {\n    if (code === 47) {\n      effects.consume(code)\n      return completeEnd\n    }\n\n    if (code === 58 || code === 95 || asciiAlpha(code)) {\n      effects.consume(code)\n      return completeAttributeName\n    }\n\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return completeAttributeNameBefore\n    }\n\n    return completeEnd(code)\n  }\n  /** @type {State} */\n\n  function completeAttributeName(code) {\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\n    return completeAttributeNameAfter(code)\n  }\n  /** @type {State} */\n\n  function completeAttributeNameAfter(code) {\n    if (code === 61) {\n      effects.consume(code)\n      return completeAttributeValueBefore\n    }\n\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return completeAttributeNameAfter\n    }\n\n    return completeAttributeNameBefore(code)\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\n    if (code === 34 || code === 39) {\n      effects.consume(code)\n      marker = code\n      return completeAttributeValueQuoted\n    }\n\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return completeAttributeValueBefore\n    }\n\n    marker = null\n    return completeAttributeValueUnquoted(code)\n  }\n  /** @type {State} */\n\n  function completeAttributeValueQuoted(code) {\n    if (code === null || markdownLineEnding(code)) {\n      return nok(code)\n    }\n\n    if (code === marker) {\n      effects.consume(code)\n      return completeAttributeValueQuotedAfter\n    }\n\n    effects.consume(code)\n    return completeAttributeValueQuoted\n  }\n  /** @type {State} */\n\n  function completeAttributeValueUnquoted(code) {\n    if (\n      code === null ||\n      code === 34 ||\n      code === 39 ||\n      code === 60 ||\n      code === 61 ||\n      code === 62 ||\n      code === 96 ||\n      markdownLineEndingOrSpace(code)\n    ) {\n      return completeAttributeNameAfter(code)\n    }\n\n    effects.consume(code)\n    return completeAttributeValueUnquoted\n  }\n  /** @type {State} */\n\n  function completeAttributeValueQuotedAfter(code) {\n    if (code === 47 || code === 62 || markdownSpace(code)) {\n      return completeAttributeNameBefore(code)\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function completeEnd(code) {\n    if (code === 62) {\n      effects.consume(code)\n      return completeAfter\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function completeAfter(code) {\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return completeAfter\n    }\n\n    return code === null || markdownLineEnding(code)\n      ? continuation(code)\n      : nok(code)\n  }\n  /** @type {State} */\n\n  function continuation(code) {\n    if (code === 45 && kind === 2) {\n      effects.consume(code)\n      return continuationCommentInside\n    }\n\n    if (code === 60 && kind === 1) {\n      effects.consume(code)\n      return continuationRawTagOpen\n    }\n\n    if (code === 62 && kind === 4) {\n      effects.consume(code)\n      return continuationClose\n    }\n\n    if (code === 63 && kind === 3) {\n      effects.consume(code)\n      return continuationDeclarationInside\n    }\n\n    if (code === 93 && kind === 5) {\n      effects.consume(code)\n      return continuationCharacterDataInside\n    }\n\n    if (markdownLineEnding(code) && (kind === 6 || kind === 7)) {\n      return effects.check(\n        nextBlankConstruct,\n        continuationClose,\n        continuationAtLineEnding\n      )(code)\n    }\n\n    if (code === null || markdownLineEnding(code)) {\n      return continuationAtLineEnding(code)\n    }\n\n    effects.consume(code)\n    return continuation\n  }\n  /** @type {State} */\n\n  function continuationAtLineEnding(code) {\n    effects.exit('htmlFlowData')\n    return htmlContinueStart(code)\n  }\n  /** @type {State} */\n\n  function htmlContinueStart(code) {\n    if (code === null) {\n      return done(code)\n    }\n\n    if (markdownLineEnding(code)) {\n      return effects.attempt(\n        {\n          tokenize: htmlLineEnd,\n          partial: true\n        },\n        htmlContinueStart,\n        done\n      )(code)\n    }\n\n    effects.enter('htmlFlowData')\n    return continuation(code)\n  }\n  /** @type {Tokenizer} */\n\n  function htmlLineEnd(effects, ok, nok) {\n    return start\n    /** @type {State} */\n\n    function start(code) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return lineStart\n    }\n    /** @type {State} */\n\n    function lineStart(code) {\n      return self.parser.lazy[self.now().line] ? nok(code) : ok(code)\n    }\n  }\n  /** @type {State} */\n\n  function continuationCommentInside(code) {\n    if (code === 45) {\n      effects.consume(code)\n      return continuationDeclarationInside\n    }\n\n    return continuation(code)\n  }\n  /** @type {State} */\n\n  function continuationRawTagOpen(code) {\n    if (code === 47) {\n      effects.consume(code)\n      buffer = ''\n      return continuationRawEndTag\n    }\n\n    return continuation(code)\n  }\n  /** @type {State} */\n\n  function continuationRawEndTag(code) {\n    if (code === 62 && htmlRawNames.includes(buffer.toLowerCase())) {\n      effects.consume(code)\n      return continuationClose\n    }\n\n    if (asciiAlpha(code) && buffer.length < 8) {\n      effects.consume(code)\n      buffer += String.fromCharCode(code)\n      return continuationRawEndTag\n    }\n\n    return continuation(code)\n  }\n  /** @type {State} */\n\n  function continuationCharacterDataInside(code) {\n    if (code === 93) {\n      effects.consume(code)\n      return continuationDeclarationInside\n    }\n\n    return continuation(code)\n  }\n  /** @type {State} */\n\n  function continuationDeclarationInside(code) {\n    if (code === 62) {\n      effects.consume(code)\n      return continuationClose\n    } // More dashes.\n\n    if (code === 45 && kind === 2) {\n      effects.consume(code)\n      return continuationDeclarationInside\n    }\n\n    return continuation(code)\n  }\n  /** @type {State} */\n\n  function continuationClose(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('htmlFlowData')\n      return done(code)\n    }\n\n    effects.consume(code)\n    return continuationClose\n  }\n  /** @type {State} */\n\n  function done(code) {\n    effects.exit('htmlFlow')\n    return ok(code)\n  }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeNextBlank(effects, ok, nok) {\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.exit('htmlFlowData')\n    effects.enter('lineEndingBlank')\n    effects.consume(code)\n    effects.exit('lineEndingBlank')\n    return effects.attempt(blankLine, ok, nok)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {\n  markdownLineEnding,\n  markdownLineEndingOrSpace\n} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const codeFenced = {\n  name: 'codeFenced',\n  tokenize: tokenizeCodeFenced,\n  concrete: true\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeCodeFenced(effects, ok, nok) {\n  const self = this\n  /** @type {Construct} */\n\n  const closingFenceConstruct = {\n    tokenize: tokenizeClosingFence,\n    partial: true\n  }\n  /** @type {Construct} */\n\n  const nonLazyLine = {\n    tokenize: tokenizeNonLazyLine,\n    partial: true\n  }\n  const tail = this.events[this.events.length - 1]\n  const initialPrefix =\n    tail && tail[1].type === 'linePrefix'\n      ? tail[2].sliceSerialize(tail[1], true).length\n      : 0\n  let sizeOpen = 0\n  /** @type {NonNullable<Code>} */\n\n  let marker\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('codeFenced')\n    effects.enter('codeFencedFence')\n    effects.enter('codeFencedFenceSequence')\n    marker = code\n    return sequenceOpen(code)\n  }\n  /** @type {State} */\n\n  function sequenceOpen(code) {\n    if (code === marker) {\n      effects.consume(code)\n      sizeOpen++\n      return sequenceOpen\n    }\n\n    effects.exit('codeFencedFenceSequence')\n    return sizeOpen < 3\n      ? nok(code)\n      : factorySpace(effects, infoOpen, 'whitespace')(code)\n  }\n  /** @type {State} */\n\n  function infoOpen(code) {\n    if (code === null || markdownLineEnding(code)) {\n      return openAfter(code)\n    }\n\n    effects.enter('codeFencedFenceInfo')\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return info(code)\n  }\n  /** @type {State} */\n\n  function info(code) {\n    if (code === null || markdownLineEndingOrSpace(code)) {\n      effects.exit('chunkString')\n      effects.exit('codeFencedFenceInfo')\n      return factorySpace(effects, infoAfter, 'whitespace')(code)\n    }\n\n    if (code === 96 && code === marker) return nok(code)\n    effects.consume(code)\n    return info\n  }\n  /** @type {State} */\n\n  function infoAfter(code) {\n    if (code === null || markdownLineEnding(code)) {\n      return openAfter(code)\n    }\n\n    effects.enter('codeFencedFenceMeta')\n    effects.enter('chunkString', {\n      contentType: 'string'\n    })\n    return meta(code)\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 openAfter(code)\n    }\n\n    if (code === 96 && code === marker) return nok(code)\n    effects.consume(code)\n    return meta\n  }\n  /** @type {State} */\n\n  function openAfter(code) {\n    effects.exit('codeFencedFence')\n    return self.interrupt ? ok(code) : contentStart(code)\n  }\n  /** @type {State} */\n\n  function contentStart(code) {\n    if (code === null) {\n      return after(code)\n    }\n\n    if (markdownLineEnding(code)) {\n      return effects.attempt(\n        nonLazyLine,\n        effects.attempt(\n          closingFenceConstruct,\n          after,\n          initialPrefix\n            ? factorySpace(\n                effects,\n                contentStart,\n                'linePrefix',\n                initialPrefix + 1\n              )\n            : contentStart\n        ),\n        after\n      )(code)\n    }\n\n    effects.enter('codeFlowValue')\n    return contentContinue(code)\n  }\n  /** @type {State} */\n\n  function contentContinue(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('codeFlowValue')\n      return contentStart(code)\n    }\n\n    effects.consume(code)\n    return contentContinue\n  }\n  /** @type {State} */\n\n  function after(code) {\n    effects.exit('codeFenced')\n    return ok(code)\n  }\n  /** @type {Tokenizer} */\n\n  function tokenizeNonLazyLine(effects, ok, nok) {\n    const self = this\n    return start\n    /** @type {State} */\n\n    function start(code) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return lineStart\n    }\n    /** @type {State} */\n\n    function lineStart(code) {\n      return self.parser.lazy[self.now().line] ? nok(code) : ok(code)\n    }\n  }\n  /** @type {Tokenizer} */\n\n  function tokenizeClosingFence(effects, ok, nok) {\n    let size = 0\n    return factorySpace(\n      effects,\n      closingSequenceStart,\n      'linePrefix',\n      this.parser.constructs.disable.null.includes('codeIndented')\n        ? undefined\n        : 4\n    )\n    /** @type {State} */\n\n    function closingSequenceStart(code) {\n      effects.enter('codeFencedFence')\n      effects.enter('codeFencedFenceSequence')\n      return closingSequence(code)\n    }\n    /** @type {State} */\n\n    function closingSequence(code) {\n      if (code === marker) {\n        effects.consume(code)\n        size++\n        return closingSequence\n      }\n\n      if (size < sizeOpen) return nok(code)\n      effects.exit('codeFencedFenceSequence')\n      return factorySpace(effects, closingSequenceEnd, 'whitespace')(code)\n    }\n    /** @type {State} */\n\n    function closingSequenceEnd(code) {\n      if (code === null || markdownLineEnding(code)) {\n        effects.exit('codeFencedFence')\n        return ok(code)\n      }\n\n      return nok(code)\n    }\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').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {decodeNamedCharacterReference} from 'decode-named-character-reference'\nimport {\n  asciiAlphanumeric,\n  asciiDigit,\n  asciiHexDigit\n} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const characterReference = {\n  name: 'characterReference',\n  tokenize: tokenizeCharacterReference\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeCharacterReference(effects, ok, nok) {\n  const self = this\n  let size = 0\n  /** @type {number} */\n\n  let max\n  /** @type {(code: Code) => code is number} */\n\n  let test\n  return start\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  /** @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\n    effects.enter('characterReferenceValue')\n    max = 31\n    test = asciiAlphanumeric\n    return value(code)\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\n    effects.enter('characterReferenceValue')\n    max = 7\n    test = asciiDigit\n    return value(code)\n  }\n  /** @type {State} */\n\n  function value(code) {\n    /** @type {Token} */\n    let token\n\n    if (code === 59 && size) {\n      token = effects.exit('characterReferenceValue')\n\n      if (\n        test === asciiAlphanumeric &&\n        !decodeNamedCharacterReference(self.sliceSerialize(token))\n      ) {\n        return nok(code)\n      }\n\n      effects.enter('characterReferenceMarker')\n      effects.consume(code)\n      effects.exit('characterReferenceMarker')\n      effects.exit('characterReference')\n      return ok\n    }\n\n    if (test(code) && size++ < max) {\n      effects.consume(code)\n      return value\n    }\n\n    return nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {asciiPunctuation} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const characterEscape = {\n  name: 'characterEscape',\n  tokenize: tokenizeCharacterEscape\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeCharacterEscape(effects, ok, nok) {\n  return start\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 open\n  }\n  /** @type {State} */\n\n  function open(code) {\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\n    return nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const lineEnding = {\n  name: 'lineEnding',\n  tokenize: tokenizeLineEnding\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeLineEnding(effects, ok) {\n  return start\n  /** @type {State} */\n\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').Resolver} Resolver\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Event} Event\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\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\n/** @type {Construct} */\nexport const labelEnd = {\n  name: 'labelEnd',\n  tokenize: tokenizeLabelEnd,\n  resolveTo: resolveToLabelEnd,\n  resolveAll: resolveAllLabelEnd\n}\n/** @type {Construct} */\n\nconst resourceConstruct = {\n  tokenize: tokenizeResource\n}\n/** @type {Construct} */\n\nconst fullReferenceConstruct = {\n  tokenize: tokenizeFullReference\n}\n/** @type {Construct} */\n\nconst collapsedReferenceConstruct = {\n  tokenize: tokenizeCollapsedReference\n}\n/** @type {Resolver} */\n\nfunction resolveAllLabelEnd(events) {\n  let index = -1\n  /** @type {Token} */\n\n  let token\n\n  while (++index < events.length) {\n    token = events[index][1]\n\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\n  return events\n}\n/** @type {Resolver} */\n\nfunction resolveToLabelEnd(events, context) {\n  let index = events.length\n  let offset = 0\n  /** @type {Token} */\n\n  let token\n  /** @type {number|undefined} */\n\n  let open\n  /** @type {number|undefined} */\n\n  let close\n  /** @type {Event[]} */\n\n  let media // Find an opening.\n\n  while (index--) {\n    token = events[index][1]\n\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      } // Mark other link openings as inactive, as we can’t have links in\n      // links.\n\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\n        if (token.type !== 'labelLink') {\n          offset = 2\n          break\n        }\n      }\n    } else if (token.type === 'labelEnd') {\n      close = index\n    }\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  ] // Opening marker.\n\n  media = push(media, events.slice(open + 1, open + offset + 3)) // Text open.\n\n  media = push(media, [['enter', text, context]]) // Between.\n\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  ) // Text close, marker close, label close.\n\n  media = push(media, [\n    ['exit', text, context],\n    events[close - 2],\n    events[close - 1],\n    ['exit', label, context]\n  ]) // Reference, resource, or so.\n\n  media = push(media, events.slice(close + 1)) // Media close.\n\n  media = push(media, [['exit', group, context]])\n  splice(events, open, events.length, media)\n  return events\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeLabelEnd(effects, ok, nok) {\n  const self = this\n  let index = self.events.length\n  /** @type {Token} */\n\n  let labelStart\n  /** @type {boolean} */\n\n  let defined // Find an opening.\n\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\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    if (!labelStart) {\n      return nok(code)\n    } // It’s a balanced bracket, but contains a link.\n\n    if (labelStart._inactive) return balanced(code)\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 afterLabelEnd\n  }\n  /** @type {State} */\n\n  function afterLabelEnd(code) {\n    // Resource: `[asd](fgh)`.\n    if (code === 40) {\n      return effects.attempt(\n        resourceConstruct,\n        ok,\n        defined ? ok : balanced\n      )(code)\n    } // Collapsed (`[asd][]`) or full (`[asd][fgh]`) reference?\n\n    if (code === 91) {\n      return effects.attempt(\n        fullReferenceConstruct,\n        ok,\n        defined\n          ? effects.attempt(collapsedReferenceConstruct, ok, balanced)\n          : balanced\n      )(code)\n    } // Shortcut reference: `[asd]`?\n\n    return defined ? ok(code) : balanced(code)\n  }\n  /** @type {State} */\n\n  function balanced(code) {\n    labelStart._balanced = true\n    return nok(code)\n  }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeResource(effects, ok, nok) {\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('resource')\n    effects.enter('resourceMarker')\n    effects.consume(code)\n    effects.exit('resourceMarker')\n    return factoryWhitespace(effects, open)\n  }\n  /** @type {State} */\n\n  function open(code) {\n    if (code === 41) {\n      return end(code)\n    }\n\n    return factoryDestination(\n      effects,\n      destinationAfter,\n      nok,\n      'resourceDestination',\n      'resourceDestinationLiteral',\n      'resourceDestinationLiteralMarker',\n      'resourceDestinationRaw',\n      'resourceDestinationString',\n      32\n    )(code)\n  }\n  /** @type {State} */\n\n  function destinationAfter(code) {\n    return markdownLineEndingOrSpace(code)\n      ? factoryWhitespace(effects, between)(code)\n      : end(code)\n  }\n  /** @type {State} */\n\n  function between(code) {\n    if (code === 34 || code === 39 || code === 40) {\n      return factoryTitle(\n        effects,\n        factoryWhitespace(effects, end),\n        nok,\n        'resourceTitle',\n        'resourceTitleMarker',\n        'resourceTitleString'\n      )(code)\n    }\n\n    return end(code)\n  }\n  /** @type {State} */\n\n  function end(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\n    return nok(code)\n  }\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeFullReference(effects, ok, nok) {\n  const self = this\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    return factoryLabel.call(\n      self,\n      effects,\n      afterLabel,\n      nok,\n      'reference',\n      'referenceMarker',\n      'referenceString'\n    )(code)\n  }\n  /** @type {State} */\n\n  function afterLabel(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/** @type {Tokenizer} */\n\nfunction tokenizeCollapsedReference(effects, ok, nok) {\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('reference')\n    effects.enter('referenceMarker')\n    effects.consume(code)\n    effects.exit('referenceMarker')\n    return open\n  }\n  /** @type {State} */\n\n  function open(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\n    return nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {\n  markdownLineEndingOrSpace,\n  unicodePunctuation,\n  unicodeWhitespace\n} from 'micromark-util-character'\n\n/**\n * Classify whether a character code represents whitespace, punctuation, or\n * something 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 that eof (`null`) is seen as whitespace.\n *\n * @param {Code} code\n * @returns {number|undefined}\n */\nexport function classifyCharacter(code) {\n  if (\n    code === null ||\n    markdownLineEndingOrSpace(code) ||\n    unicodeWhitespace(code)\n  ) {\n    return 1\n  }\n\n  if (unicodePunctuation(code)) {\n    return 2\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\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').Event} Event\n * @typedef {import('micromark-util-types').Code} Code\n * @typedef {import('micromark-util-types').Point} Point\n */\nimport {push, splice} from 'micromark-util-chunked'\nimport {classifyCharacter} from 'micromark-util-classify-character'\nimport {resolveAll} from 'micromark-util-resolve-all'\n\n/** @type {Construct} */\nexport const attention = {\n  name: 'attention',\n  tokenize: tokenizeAttention,\n  resolveAll: resolveAllAttention\n}\n/**\n * Take all events and resolve attention to emphasis or strong.\n *\n * @type {Resolver}\n */\n\nfunction resolveAllAttention(events, context) {\n  let index = -1\n  /** @type {number} */\n\n  let open\n  /** @type {Token} */\n\n  let group\n  /** @type {Token} */\n\n  let text\n  /** @type {Token} */\n\n  let openingSequence\n  /** @type {Token} */\n\n  let closingSequence\n  /** @type {number} */\n\n  let use\n  /** @type {Event[]} */\n\n  let nextEvents\n  /** @type {number} */\n\n  let offset // 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\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 // Now walk back to find an opener.\n\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 && // 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          } // Number of markers to use from the sequence.\n\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 = [] // If there are more markers in the opening, add them before.\n\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          } // Opening.\n\n          nextEvents = push(nextEvents, [\n            ['enter', group, context],\n            ['enter', openingSequence, context],\n            ['exit', openingSequence, context],\n            ['enter', text, context]\n          ]) // Between.\n\n          nextEvents = push(\n            nextEvents,\n            resolveAll(\n              context.parser.constructs.insideSpan.null,\n              events.slice(open + 1, index),\n              context\n            )\n          ) // Closing.\n\n          nextEvents = push(nextEvents, [\n            ['exit', text, context],\n            ['enter', closingSequence, context],\n            ['exit', closingSequence, context],\n            ['exit', group, context]\n          ]) // If there are more markers in the closing, add them after.\n\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\n          splice(events, open - 1, index - open + 3, nextEvents)\n          index = open + nextEvents.length - offset - 2\n          break\n        }\n      }\n    }\n  } // Remove remaining sequences.\n\n  index = -1\n\n  while (++index < events.length) {\n    if (events[index][1].type === 'attentionSequence') {\n      events[index][1].type = 'data'\n    }\n  }\n\n  return events\n}\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  /** @type {NonNullable<Code>} */\n\n  let marker\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('attentionSequence')\n    marker = code\n    return sequence(code)\n  }\n  /** @type {State} */\n\n  function sequence(code) {\n    if (code === marker) {\n      effects.consume(code)\n      return sequence\n    }\n\n    const token = effects.exit('attentionSequence')\n    const after = classifyCharacter(code)\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 * 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 {void}\n */\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').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {\n  asciiAlpha,\n  asciiAlphanumeric,\n  asciiAtext,\n  asciiControl\n} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const autolink = {\n  name: 'autolink',\n  tokenize: tokenizeAutolink\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeAutolink(effects, ok, nok) {\n  let size = 1\n  return start\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  /** @type {State} */\n\n  function open(code) {\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      return schemeOrEmailAtext\n    }\n\n    return asciiAtext(code) ? emailAtext(code) : nok(code)\n  }\n  /** @type {State} */\n\n  function schemeOrEmailAtext(code) {\n    return code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)\n      ? schemeInsideOrEmailAtext(code)\n      : emailAtext(code)\n  }\n  /** @type {State} */\n\n  function schemeInsideOrEmailAtext(code) {\n    if (code === 58) {\n      effects.consume(code)\n      return urlInside\n    }\n\n    if (\n      (code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)) &&\n      size++ < 32\n    ) {\n      effects.consume(code)\n      return schemeInsideOrEmailAtext\n    }\n\n    return emailAtext(code)\n  }\n  /** @type {State} */\n\n  function urlInside(code) {\n    if (code === 62) {\n      effects.exit('autolinkProtocol')\n      return end(code)\n    }\n\n    if (code === null || code === 32 || code === 60 || asciiControl(code)) {\n      return nok(code)\n    }\n\n    effects.consume(code)\n    return urlInside\n  }\n  /** @type {State} */\n\n  function emailAtext(code) {\n    if (code === 64) {\n      effects.consume(code)\n      size = 0\n      return emailAtSignOrDot\n    }\n\n    if (asciiAtext(code)) {\n      effects.consume(code)\n      return emailAtext\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function emailAtSignOrDot(code) {\n    return asciiAlphanumeric(code) ? emailLabel(code) : nok(code)\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\n    if (code === 62) {\n      // Exit, then change the type.\n      effects.exit('autolinkProtocol').type = 'autolinkEmail'\n      return end(code)\n    }\n\n    return emailValue(code)\n  }\n  /** @type {State} */\n\n  function emailValue(code) {\n    if ((code === 45 || asciiAlphanumeric(code)) && size++ < 63) {\n      effects.consume(code)\n      return code === 45 ? emailValue : emailLabel\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function end(code) {\n    effects.enter('autolinkMarker')\n    effects.consume(code)\n    effects.exit('autolinkMarker')\n    effects.exit('autolink')\n    return ok\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n * @typedef {import('micromark-util-types').Code} Code\n */\nimport {factorySpace} from 'micromark-factory-space'\nimport {\n  asciiAlpha,\n  asciiAlphanumeric,\n  markdownLineEnding,\n  markdownLineEndingOrSpace,\n  markdownSpace\n} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const htmlText = {\n  name: 'htmlText',\n  tokenize: tokenizeHtmlText\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeHtmlText(effects, ok, nok) {\n  const self = this\n  /** @type {NonNullable<Code>|undefined} */\n\n  let marker\n  /** @type {string} */\n\n  let buffer\n  /** @type {number} */\n\n  let index\n  /** @type {State} */\n\n  let returnState\n  return start\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  /** @type {State} */\n\n  function open(code) {\n    if (code === 33) {\n      effects.consume(code)\n      return declarationOpen\n    }\n\n    if (code === 47) {\n      effects.consume(code)\n      return tagCloseStart\n    }\n\n    if (code === 63) {\n      effects.consume(code)\n      return instruction\n    }\n\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      return tagOpen\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function declarationOpen(code) {\n    if (code === 45) {\n      effects.consume(code)\n      return commentOpen\n    }\n\n    if (code === 91) {\n      effects.consume(code)\n      buffer = 'CDATA['\n      index = 0\n      return cdataOpen\n    }\n\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      return declaration\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function commentOpen(code) {\n    if (code === 45) {\n      effects.consume(code)\n      return commentStart\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function commentStart(code) {\n    if (code === null || code === 62) {\n      return nok(code)\n    }\n\n    if (code === 45) {\n      effects.consume(code)\n      return commentStartDash\n    }\n\n    return comment(code)\n  }\n  /** @type {State} */\n\n  function commentStartDash(code) {\n    if (code === null || code === 62) {\n      return nok(code)\n    }\n\n    return comment(code)\n  }\n  /** @type {State} */\n\n  function comment(code) {\n    if (code === null) {\n      return nok(code)\n    }\n\n    if (code === 45) {\n      effects.consume(code)\n      return commentClose\n    }\n\n    if (markdownLineEnding(code)) {\n      returnState = comment\n      return atLineEnding(code)\n    }\n\n    effects.consume(code)\n    return comment\n  }\n  /** @type {State} */\n\n  function commentClose(code) {\n    if (code === 45) {\n      effects.consume(code)\n      return end\n    }\n\n    return comment(code)\n  }\n  /** @type {State} */\n\n  function cdataOpen(code) {\n    if (code === buffer.charCodeAt(index++)) {\n      effects.consume(code)\n      return index === buffer.length ? cdata : cdataOpen\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function cdata(code) {\n    if (code === null) {\n      return nok(code)\n    }\n\n    if (code === 93) {\n      effects.consume(code)\n      return cdataClose\n    }\n\n    if (markdownLineEnding(code)) {\n      returnState = cdata\n      return atLineEnding(code)\n    }\n\n    effects.consume(code)\n    return cdata\n  }\n  /** @type {State} */\n\n  function cdataClose(code) {\n    if (code === 93) {\n      effects.consume(code)\n      return cdataEnd\n    }\n\n    return cdata(code)\n  }\n  /** @type {State} */\n\n  function cdataEnd(code) {\n    if (code === 62) {\n      return end(code)\n    }\n\n    if (code === 93) {\n      effects.consume(code)\n      return cdataEnd\n    }\n\n    return cdata(code)\n  }\n  /** @type {State} */\n\n  function declaration(code) {\n    if (code === null || code === 62) {\n      return end(code)\n    }\n\n    if (markdownLineEnding(code)) {\n      returnState = declaration\n      return atLineEnding(code)\n    }\n\n    effects.consume(code)\n    return declaration\n  }\n  /** @type {State} */\n\n  function instruction(code) {\n    if (code === null) {\n      return nok(code)\n    }\n\n    if (code === 63) {\n      effects.consume(code)\n      return instructionClose\n    }\n\n    if (markdownLineEnding(code)) {\n      returnState = instruction\n      return atLineEnding(code)\n    }\n\n    effects.consume(code)\n    return instruction\n  }\n  /** @type {State} */\n\n  function instructionClose(code) {\n    return code === 62 ? end(code) : instruction(code)\n  }\n  /** @type {State} */\n\n  function tagCloseStart(code) {\n    if (asciiAlpha(code)) {\n      effects.consume(code)\n      return tagClose\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function tagClose(code) {\n    if (code === 45 || asciiAlphanumeric(code)) {\n      effects.consume(code)\n      return tagClose\n    }\n\n    return tagCloseBetween(code)\n  }\n  /** @type {State} */\n\n  function tagCloseBetween(code) {\n    if (markdownLineEnding(code)) {\n      returnState = tagCloseBetween\n      return atLineEnding(code)\n    }\n\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return tagCloseBetween\n    }\n\n    return end(code)\n  }\n  /** @type {State} */\n\n  function tagOpen(code) {\n    if (code === 45 || asciiAlphanumeric(code)) {\n      effects.consume(code)\n      return tagOpen\n    }\n\n    if (code === 47 || code === 62 || markdownLineEndingOrSpace(code)) {\n      return tagOpenBetween(code)\n    }\n\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function tagOpenBetween(code) {\n    if (code === 47) {\n      effects.consume(code)\n      return end\n    }\n\n    if (code === 58 || code === 95 || asciiAlpha(code)) {\n      effects.consume(code)\n      return tagOpenAttributeName\n    }\n\n    if (markdownLineEnding(code)) {\n      returnState = tagOpenBetween\n      return atLineEnding(code)\n    }\n\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return tagOpenBetween\n    }\n\n    return end(code)\n  }\n  /** @type {State} */\n\n  function tagOpenAttributeName(code) {\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\n    return tagOpenAttributeNameAfter(code)\n  }\n  /** @type {State} */\n\n  function tagOpenAttributeNameAfter(code) {\n    if (code === 61) {\n      effects.consume(code)\n      return tagOpenAttributeValueBefore\n    }\n\n    if (markdownLineEnding(code)) {\n      returnState = tagOpenAttributeNameAfter\n      return atLineEnding(code)\n    }\n\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return tagOpenAttributeNameAfter\n    }\n\n    return tagOpenBetween(code)\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\n    if (code === 34 || code === 39) {\n      effects.consume(code)\n      marker = code\n      return tagOpenAttributeValueQuoted\n    }\n\n    if (markdownLineEnding(code)) {\n      returnState = tagOpenAttributeValueBefore\n      return atLineEnding(code)\n    }\n\n    if (markdownSpace(code)) {\n      effects.consume(code)\n      return tagOpenAttributeValueBefore\n    }\n\n    effects.consume(code)\n    marker = undefined\n    return tagOpenAttributeValueUnquoted\n  }\n  /** @type {State} */\n\n  function tagOpenAttributeValueQuoted(code) {\n    if (code === marker) {\n      effects.consume(code)\n      return tagOpenAttributeValueQuotedAfter\n    }\n\n    if (code === null) {\n      return nok(code)\n    }\n\n    if (markdownLineEnding(code)) {\n      returnState = tagOpenAttributeValueQuoted\n      return atLineEnding(code)\n    }\n\n    effects.consume(code)\n    return tagOpenAttributeValueQuoted\n  }\n  /** @type {State} */\n\n  function tagOpenAttributeValueQuotedAfter(code) {\n    if (code === 62 || code === 47 || markdownLineEndingOrSpace(code)) {\n      return tagOpenBetween(code)\n    }\n\n    return nok(code)\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\n    if (code === 62 || markdownLineEndingOrSpace(code)) {\n      return tagOpenBetween(code)\n    }\n\n    effects.consume(code)\n    return tagOpenAttributeValueUnquoted\n  } // We can’t have blank lines in content, so no need to worry about empty\n  // tokens.\n\n  /** @type {State} */\n\n  function atLineEnding(code) {\n    effects.exit('htmlTextData')\n    effects.enter('lineEnding')\n    effects.consume(code)\n    effects.exit('lineEnding')\n    return factorySpace(\n      effects,\n      afterPrefix,\n      'linePrefix',\n      self.parser.constructs.disable.null.includes('codeIndented')\n        ? undefined\n        : 4\n    )\n  }\n  /** @type {State} */\n\n  function afterPrefix(code) {\n    effects.enter('htmlTextData')\n    return returnState(code)\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\n    return 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').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').Previous} Previous\n * @typedef {import('micromark-util-types').Token} Token\n * @typedef {import('micromark-util-types').State} State\n */\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const codeText = {\n  name: 'codeText',\n  tokenize: tokenizeCodeText,\n  resolve: resolveCodeText,\n  previous\n}\n/** @type {Resolver} */\n\nfunction resolveCodeText(events) {\n  let tailExitIndex = events.length - 4\n  let headEnterIndex = 3\n  /** @type {number} */\n\n  let index\n  /** @type {number|undefined} */\n\n  let enter // If we start and end with an EOL or a space.\n\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 // And we have data.\n\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  } // Merge adjacent spaces and data.\n\n  index = headEnterIndex - 1\n  tailExitIndex++\n\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\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\n      enter = undefined\n    }\n  }\n\n  return events\n}\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/** @type {Tokenizer} */\n\nfunction tokenizeCodeText(effects, ok, nok) {\n  const self = this\n  let sizeOpen = 0\n  /** @type {number} */\n\n  let size\n  /** @type {Token} */\n\n  let token\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('codeText')\n    effects.enter('codeTextSequence')\n    return openingSequence(code)\n  }\n  /** @type {State} */\n\n  function openingSequence(code) {\n    if (code === 96) {\n      effects.consume(code)\n      sizeOpen++\n      return openingSequence\n    }\n\n    effects.exit('codeTextSequence')\n    return gap(code)\n  }\n  /** @type {State} */\n\n  function gap(code) {\n    // EOF.\n    if (code === null) {\n      return nok(code)\n    } // Closing fence?\n    // Could also be data.\n\n    if (code === 96) {\n      token = effects.enter('codeTextSequence')\n      size = 0\n      return closingSequence(code)\n    } // Tabs don’t work, and virtual spaces don’t make sense.\n\n    if (code === 32) {\n      effects.enter('space')\n      effects.consume(code)\n      effects.exit('space')\n      return gap\n    }\n\n    if (markdownLineEnding(code)) {\n      effects.enter('lineEnding')\n      effects.consume(code)\n      effects.exit('lineEnding')\n      return gap\n    } // Data.\n\n    effects.enter('codeTextData')\n    return data(code)\n  } // In code.\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 gap(code)\n    }\n\n    effects.consume(code)\n    return data\n  } // Closing fence.\n\n  /** @type {State} */\n\n  function closingSequence(code) {\n    // More.\n    if (code === 96) {\n      effects.consume(code)\n      size++\n      return closingSequence\n    } // Done!\n\n    if (size === sizeOpen) {\n      effects.exit('codeTextSequence')\n      effects.exit('codeText')\n      return ok(code)\n    } // More or less accents: mark as data.\n\n    token.type = 'codeTextData'\n    return data(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Extension} Extension\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/** @type {Extension['document']} */\n\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/** @type {Extension['contentInitial']} */\n\nexport const contentInitial = {\n  [91]: definition\n}\n/** @type {Extension['flowInitial']} */\n\nexport const flowInitial = {\n  [-2]: codeIndented,\n  [-1]: codeIndented,\n  [32]: codeIndented\n}\n/** @type {Extension['flow']} */\n\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/** @type {Extension['string']} */\n\nexport const string = {\n  [38]: characterReference,\n  [92]: characterEscape\n}\n/** @type {Extension['text']} */\n\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/** @type {Extension['insideSpan']} */\n\nexport const insideSpan = {\n  null: [attention, resolveText]\n}\n/** @type {Extension['attentionMarkers']} */\n\nexport const attentionMarkers = {\n  null: [42, 95]\n}\n/** @type {Extension['disable']} */\n\nexport const disable = {\n  null: []\n}\n","/**\n * @typedef {import('micromark-util-types').Construct} Construct\n * @typedef {import('micromark-util-types').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {labelEnd} from './label-end.js'\n/** @type {Construct} */\n\nexport const labelStartImage = {\n  name: 'labelStartImage',\n  tokenize: tokenizeLabelStartImage,\n  resolveAll: labelEnd.resolveAll\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeLabelStartImage(effects, ok, nok) {\n  const self = this\n  return start\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  /** @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\n    return nok(code)\n  }\n  /** @type {State} */\n\n  function after(code) {\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\n    /* Hidden footnotes hook */\n\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').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {labelEnd} from './label-end.js'\n/** @type {Construct} */\n\nexport const labelStartLink = {\n  name: 'labelStartLink',\n  tokenize: tokenizeLabelStartLink,\n  resolveAll: labelEnd.resolveAll\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeLabelStartLink(effects, ok, nok) {\n  const self = this\n  return start\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  /** @type {State} */\n\n  function after(code) {\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\n    /* Hidden footnotes hook. */\n\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').Tokenizer} Tokenizer\n * @typedef {import('micromark-util-types').State} State\n */\nimport {markdownLineEnding} from 'micromark-util-character'\n\n/** @type {Construct} */\nexport const hardBreakEscape = {\n  name: 'hardBreakEscape',\n  tokenize: tokenizeHardBreakEscape\n}\n/** @type {Tokenizer} */\n\nfunction tokenizeHardBreakEscape(effects, ok, nok) {\n  return start\n  /** @type {State} */\n\n  function start(code) {\n    effects.enter('hardBreakEscape')\n    effects.enter('escapeMarker')\n    effects.consume(code)\n    return open\n  }\n  /** @type {State} */\n\n  function open(code) {\n    if (markdownLineEnding(code)) {\n      effects.exit('escapeMarker')\n      effects.exit('hardBreakEscape')\n      return ok(code)\n    }\n\n    return nok(code)\n  }\n}\n","/**\n * @typedef {import('micromark-util-types').Encoding} Encoding\n * @typedef {import('micromark-util-types').Value} Value\n * @typedef {import('micromark-util-types').Chunk} Chunk\n * @typedef {import('micromark-util-types').Code} Code\n */\n\n/**\n * @callback Preprocessor\n * @param {Value} value\n * @param {Encoding} [encoding]\n * @param {boolean} [end=false]\n * @returns {Array<Chunk>}\n */\nconst search = /[\\0\\t\\n\\r]/g\n/**\n * @returns {Preprocessor}\n */\n\nexport function preprocess() {\n  let column = 1\n  let buffer = ''\n  /** @type {boolean|undefined} */\n\n  let start = true\n  /** @type {boolean|undefined} */\n\n  let atCarriageReturn\n  return preprocessor\n  /** @type {Preprocessor} */\n\n  function preprocessor(value, encoding, end) {\n    /** @type {Array<Chunk>} */\n    const chunks = []\n    /** @type {RegExpMatchArray|null} */\n\n    let match\n    /** @type {number} */\n\n    let next\n    /** @type {number} */\n\n    let startPosition\n    /** @type {number} */\n\n    let endPosition\n    /** @type {Code} */\n\n    let code // @ts-expect-error `Buffer` does allow an encoding.\n\n    value = buffer + value.toString(encoding)\n    startPosition = 0\n    buffer = ''\n\n    if (start) {\n      if (value.charCodeAt(0) === 65279) {\n        startPosition++\n      }\n\n      start = undefined\n    }\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\n      if (!match) {\n        buffer = value.slice(startPosition)\n        break\n      }\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\n        if (startPosition < endPosition) {\n          chunks.push(value.slice(startPosition, endPosition))\n          column += endPosition - startPosition\n        }\n\n        switch (code) {\n          case 0: {\n            chunks.push(65533)\n            column++\n            break\n          }\n\n          case 9: {\n            next = Math.ceil(column / 4) * 4\n            chunks.push(-2)\n\n            while (column++ < next) chunks.push(-1)\n\n            break\n          }\n\n          case 10: {\n            chunks.push(-4)\n            column = 1\n            break\n          }\n\n          default: {\n            atCarriageReturn = true\n            column = 1\n          }\n        }\n      }\n\n      startPosition = endPosition + 1\n    }\n\n    if (end) {\n      if (atCarriageReturn) chunks.push(-5)\n      if (buffer) chunks.push(buffer)\n      chunks.push(null)\n    }\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 * @param {string} value\n *   Value to decode.\n * @param {number} base\n *   Numeric base.\n * @returns {string}\n */\nexport function decodeNumericCharacterReference(value, base) {\n  const code = Number.parseInt(value, base)\n\n  if (\n    // C0 except for HT, LF, FF, CR, space\n    code < 9 ||\n    code === 11 ||\n    (code > 13 && code < 32) || // Control character (DEL) of the basic block and C1 controls.\n    (code > 126 && code < 160) || // Lone high surrogates and low surrogates.\n    (code > 55295 && code < 57344) || // Noncharacters.\n    (code > 64975 && code < 65008) ||\n    (code & 65535) === 65535 ||\n    (code & 65535) === 65534 || // Out of range\n    code > 1114111\n  ) {\n    return '\\uFFFD'\n  }\n\n  return String.fromCharCode(code)\n}\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 * Utility to decode markdown strings (which occur in places such as fenced\n * code info strings, destinations, labels, and titles).\n * The “string” content type allows character escapes and -references.\n * This decodes those.\n *\n * @param {string} value\n * @returns {string}\n */\n\nexport function decodeString(value) {\n  return value.replace(characterEscapeOrReference, decode)\n}\n/**\n * @param {string} $0\n * @param {string} $1\n * @param {string} $2\n * @returns {string}\n */\n\nfunction decode($0, $1, $2) {\n  if ($1) {\n    // Escape.\n    return $1\n  } // Reference.\n\n  const head = $2.charCodeAt(0)\n\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\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 PositionLike\n * @property {PointLike | null | undefined} [start]\n * @property {PointLike | null | undefined} [end]\n *\n * @typedef PointLike\n * @property {number | null | undefined} [line]\n * @property {number | null | undefined} [column]\n * @property {number | null | undefined} [offset]\n */\n\n/**\n * Serialize the positional info of a point, position (start and end points),\n * or node.\n *\n * @param {Node | NodeLike | Position | PositionLike | Point | PointLike | 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('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').Parent} UnistParent\n * @typedef {import('unist').Point} Point\n *\n * @typedef {import('mdast').PhrasingContent} PhrasingContent\n * @typedef {import('mdast').StaticPhrasingContent} StaticPhrasingContent\n * @typedef {import('mdast').Content} Content\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').ImageReference} ImageReference\n * @typedef {import('mdast').InlineCode} InlineCode\n * @typedef {import('mdast').Link} Link\n * @typedef {import('mdast').LinkReference} LinkReference\n * @typedef {import('mdast').List} List\n * @typedef {import('mdast').ListItem} ListItem\n * @typedef {import('mdast').Paragraph} Paragraph\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 * @typedef {import('mdast').ReferenceType} ReferenceType\n * @typedef {import('../index.js').CompileData} CompileData\n */\n\n/**\n * @typedef {Root | Content} Node\n * @typedef {Extract<Node, UnistParent>} Parent\n *\n * @typedef {Omit<UnistParent, 'type' | 'children'> & {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 | undefined | null | 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 {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 {void}\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 {void}\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<Node | Fragment>} stack\n *   Stack of nodes.\n * @property {Array<TokenTuple>} tokenStack\n *   Stack of tokens.\n * @property {<Key extends keyof CompileData>(key: Key) => CompileData[Key]} getData\n *   Get data from the key/value store.\n * @property {<Key extends keyof CompileData>(key: Key, value?: CompileData[Key]) => void} setData\n *   Set data into the key/value store.\n * @property {(this: CompileContext) => void} buffer\n *   Capture some of the output data.\n * @property {(this: CompileContext) => string} resume\n *   Stop capturing and access the output data.\n * @property {<Kind extends Node>(this: CompileContext, node: Kind, token: Token, onError?: OnEnterError) => Kind} enter\n *   Enter a token.\n * @property {(this: CompileContext, token: Token, onError?: OnExitError) => Node} exit\n *   Exit a token.\n * @property {TokenizeContext['sliceSerialize']} sliceSerialize\n *   Get the string value of a token.\n * @property {Config} config\n *   Configuration.\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\n// To do: micromark: create a registry of tokens?\n// To do: next major: don’t return given `Node` from `enter`.\n// To do: next major: remove setter/getter.\n\nimport {toString} from 'mdast-util-to-string'\nimport {parse} from 'micromark/lib/parse.js'\nimport {preprocess} from 'micromark/lib/preprocess.js'\nimport {postprocess} from 'micromark/lib/postprocess.js'\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 * @param value\n *   Markdown to parse.\n * @param encoding\n *   Character encoding for when `value` is `Buffer`.\n * @param options\n *   Configuration.\n * @returns\n *   mdast tree.\n */\nexport const fromMarkdown =\n  /**\n   * @type {(\n   *   ((value: Value, encoding: Encoding, options?: Options | null | undefined) => Root) &\n   *   ((value: Value, options?: Options | null | undefined) => Root)\n   * )}\n   */\n\n  /**\n   * @param {Value} value\n   * @param {Encoding | Options | null | undefined} [encoding]\n   * @param {Options | null | undefined} [options]\n   * @returns {Root}\n   */\n  function (value, encoding, options) {\n    if (typeof encoding !== 'string') {\n      options = encoding\n      encoding = undefined\n    }\n    return compiler(options)(\n      postprocess(\n        // @ts-expect-error: micromark types need to accept `null`.\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      setData,\n      getData\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      if (\n        event[1].type === 'listUnordered' ||\n        event[1].type === 'listOrdered' ||\n        event[1].type === 'blockQuote'\n      ) {\n        if (event[0] === 'enter') {\n          containerBalance++\n        } else {\n          containerBalance--\n        }\n        atMarker = undefined\n      } else if (event[1].type === '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      } else if (\n        event[1].type === 'linePrefix' ||\n        event[1].type === 'listItemValue' ||\n        event[1].type === 'listItemMarker' ||\n        event[1].type === 'listItemPrefix' ||\n        event[1].type === 'listItemPrefixWhitespace'\n      ) {\n        // Empty.\n      } else {\n        atMarker = undefined\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            // @ts-expect-error Patched.\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          listItem = {\n            type: 'listItem',\n            // @ts-expect-error Patched\n            _spread: false,\n            start: Object.assign({}, event[1].start)\n          }\n          // @ts-expect-error: `listItem` is most definitely defined, TS...\n          events.splice(index, 0, ['enter', listItem, event[2]])\n          index++\n          length++\n          firstBlankLineIndex = undefined\n          atMarker = true\n        }\n      }\n    }\n\n    // @ts-expect-error Patched.\n    events[start][1]._spread = listSpread\n    return length\n  }\n\n  /**\n   * Set data.\n   *\n   * @template {keyof CompileData} Key\n   *   Field type.\n   * @param {Key} key\n   *   Key of field.\n   * @param {CompileData[Key]} [value]\n   *   New value.\n   * @returns {void}\n   *   Nothing.\n   */\n  function setData(key, value) {\n    data[key] = value\n  }\n\n  /**\n   * Get data.\n   *\n   * @template {keyof CompileData} Key\n   *   Field type.\n   * @param {Key} key\n   *   Key of field.\n   * @returns {CompileData[Key]}\n   *   Value.\n   */\n  function getData(key) {\n    return data[key]\n  }\n\n  /**\n   * Create an opener handle.\n   *\n   * @param {(token: Token) => Node} create\n   *   Create a node.\n   * @param {Handle} [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 {void}\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 {void}\n   */\n  function buffer() {\n    this.stack.push({\n      type: 'fragment',\n      children: []\n    })\n  }\n\n  /**\n   * @template {Node} Kind\n   *   Node type.\n   * @this {CompileContext}\n   *   Context.\n   * @param {Kind} 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 {Kind}\n   *   The given node.\n   */\n  function enter(node, token, errorHandler) {\n    const parent = this.stack[this.stack.length - 1]\n    // @ts-expect-error: Assume `Node` can exist as a child of `parent`.\n    parent.children.push(node)\n    this.stack.push(node)\n    this.tokenStack.push([token, errorHandler])\n    // @ts-expect-error: `end` will be patched later.\n    node.position = {\n      start: point(token.start)\n    }\n    return node\n  }\n\n  /**\n   * Create a closer handle.\n   *\n   * @param {Handle} [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 {void}\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 {Node}\n   *   The closed node.\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    return node\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    setData('expectingFirstListItemValue', true)\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onenterlistitemvalue(token) {\n    if (getData('expectingFirstListItemValue')) {\n      const ancestor = this.stack[this.stack.length - 2]\n      ancestor.start = Number.parseInt(this.sliceSerialize(token), 10)\n      setData('expectingFirstListItemValue')\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 (getData('flowCodeInside')) return\n    this.buffer()\n    setData('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    setData('flowCodeInside')\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    setData('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).charCodeAt(0) === 61 ? 1 : 2\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n  function onexitsetextheading() {\n    setData('setextHeadingSlurpLineEnding')\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    let tail = node.children[node.children.length - 1]\n    if (!tail || tail.type !== 'text') {\n      // Add a new text node.\n      tail = text()\n      // @ts-expect-error: we’ll add `end` later.\n      tail.position = {\n        start: point(token.start)\n      }\n      // @ts-expect-error: Assume `parent` accepts `text`.\n      node.children.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 (getData('atHardBreak')) {\n      const tail = context.children[context.children.length - 1]\n      tail.position.end = point(token.end)\n      setData('atHardBreak')\n      return\n    }\n    if (\n      !getData('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    setData('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\n    // To do: clean.\n    if (getData('inReference')) {\n      /** @type {ReferenceType} */\n      const referenceType = getData('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    setData('referenceType')\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\n    // To do: clean.\n    if (getData('inReference')) {\n      /** @type {ReferenceType} */\n      const referenceType = getData('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    setData('referenceType')\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    setData('inReference', true)\n    if (node.type === 'link') {\n      /** @type {Array<StaticPhrasingContent>} */\n      // @ts-expect-error: Assume static phrasing content.\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    setData('inReference')\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onenterreference() {\n    setData('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    setData('referenceType', 'full')\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {Handle}\n   */\n\n  function onexitcharacterreferencemarker(token) {\n    setData('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 = getData('characterReferenceType')\n    /** @type {string} */\n    let value\n    if (type) {\n      value = decodeNumericCharacterReference(\n        data,\n        type === 'characterReferenceMarkerNumeric' ? 10 : 16\n      )\n      setData('characterReferenceType')\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    // @ts-expect-error `depth` will be set later.\n    return {\n      type: 'heading',\n      depth: undefined,\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      // @ts-expect-error Patched.\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      // @ts-expect-error Patched.\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<Extension | Array<Extension>>} extensions\n * @returns {void}\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 {void}\n */\nfunction extension(combined, extension) {\n  /** @type {keyof Extension} */\n  let key\n  for (key in extension) {\n    if (own.call(extension, key)) {\n      if (key === 'canContainEols') {\n        const right = extension[key]\n        if (right) {\n          combined[key].push(...right)\n        }\n      } else if (key === 'transforms') {\n        const right = extension[key]\n        if (right) {\n          combined[key].push(...right)\n        }\n      } else if (key === 'enter' || key === 'exit') {\n        const right = extension[key]\n        if (right) {\n          Object.assign(combined[key], right)\n        }\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 */\nimport {subtokenize} from 'micromark-util-subtokenize'\n/**\n * @param {Array<Event>} events\n * @returns {Array<Event>}\n */\n\nexport function postprocess(events) {\n  while (!subtokenize(events)) {\n    // Empty\n  }\n\n  return events\n}\n","/**\n * @typedef {import('micromark-util-types').InitialConstruct} InitialConstruct\n * @typedef {import('micromark-util-types').FullNormalizedExtension} FullNormalizedExtension\n * @typedef {import('micromark-util-types').ParseOptions} ParseOptions\n * @typedef {import('micromark-util-types').ParseContext} ParseContext\n * @typedef {import('micromark-util-types').Create} Create\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 {text, string} from './initialize/text.js'\nimport {createTokenizer} from './create-tokenizer.js'\nimport * as defaultConstructs from './constructs.js'\n/**\n * @param {ParseOptions} [options]\n * @returns {ParseContext}\n */\n\nexport function parse(options = {}) {\n  /** @type {FullNormalizedExtension} */\n  // @ts-expect-error `defaultConstructs` is full, so the result will be too.\n  const constructs = combineExtensions(\n    // @ts-expect-error Same as above.\n    [defaultConstructs].concat(options.extensions || [])\n  )\n  /** @type {ParseContext} */\n\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   * @param {InitialConstruct} initial\n   */\n\n  function create(initial) {\n    return creator\n    /** @type {Create} */\n\n    function creator(from) {\n      return createTokenizer(parser, initial, from)\n    }\n  }\n}\n","/**\n * @typedef {import('mdast').Root} Root\n * @typedef {import('mdast-util-from-markdown').Options} Options\n */\n\nimport {fromMarkdown} from 'mdast-util-from-markdown'\n\n/**\n * @this {import('unified').Processor}\n * @type {import('unified').Plugin<[Options?] | void[], string, Root>}\n */\nexport default function remarkParse(options) {\n  /** @type {import('unified').ParserFunction<Root>} */\n  const parser = (doc) => {\n    // Assume options.\n    const settings = /** @type {Options} */ (this.data('settings'))\n\n    return fromMarkdown(\n      doc,\n      Object.assign({}, settings, 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: this.data('micromarkExtensions') || [],\n        mdastExtensions: this.data('fromMarkdownExtensions') || []\n      })\n    )\n  }\n\n  Object.assign(this, {Parser: parser})\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\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 (key === 'extensions') {\n      // Empty.\n    } else if (key === 'unsafe' || key === 'join') {\n      /* c8 ignore next 2 */\n      // @ts-expect-error: hush.\n      base[key] = [...(base[key] || []), ...(extension[key] || [])]\n    } else if (key === 'handlers') {\n      base[key] = Object.assign(base[key], extension[key] || {})\n    } else {\n      // @ts-expect-error: hush.\n      base.options[key] = extension[key]\n    }\n  }\n\n  return base\n}\n","/**\n * @typedef {import('mdast').Blockquote} Blockquote\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').Map} Map\n */\n\n/**\n * @param {Blockquote} node\n * @param {Parent | 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').Unsafe} Unsafe\n * @typedef {import('../types.js').ConstructName} ConstructName\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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n */\n\nimport {patternInScope} from '../util/pattern-in-scope.js'\n\n/**\n * @param {Break} _\n * @param {Parent | 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 &&\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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').Map} Map\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 {Parent | 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').State} State\n * @typedef {import('../types.js').Options} Options\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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\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 {Parent | 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 {Parent | 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').State} State\n * @typedef {import('../types.js').Options} Options\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 {visit, EXIT} 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, (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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n */\n\nimport {checkQuote} from '../util/check-quote.js'\n\nimage.peek = imagePeek\n\n/**\n * @param {Image} node\n * @param {Parent | 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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n */\n\nimageReference.peek = imageReferencePeek\n\n/**\n * @param {ImageReference} node\n * @param {Parent | 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('../types.js').Unsafe} Unsafe\n */\n\n/**\n * @param {Unsafe} pattern\n * @returns {RegExp}\n */\nexport function patternCompile(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('mdast').InlineCode} InlineCode\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n */\n\nimport {patternCompile} from '../util/pattern-compile.js'\n\ninlineCode.peek = inlineCodePeek\n\n/**\n * @param {InlineCode} node\n * @param {Parent | 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 = patternCompile(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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n * @typedef {import('../types.js').Exit} Exit\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 {Parent | 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 {Parent | 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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n */\n\nlinkReference.peek = linkReferencePeek\n\n/**\n * @param {LinkReference} node\n * @param {Parent | 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').State} State\n * @typedef {import('../types.js').Options} Options\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').State} State\n * @typedef {import('../types.js').Options} Options\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').State} State\n * @typedef {import('../types.js').Options} Options\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').PhrasingContent} PhrasingContent\n * @typedef {import('unist-util-is').AssertPredicate<PhrasingContent>} AssertPredicatePhrasing\n */\n\nimport {convert} from 'unist-util-is'\n\n/**\n * Check if the given value is *phrasing content*.\n *\n * @param\n *   Thing to check, typically `Node`.\n * @returns\n *   Whether `value` is phrasing content.\n */\nexport const phrasing = /** @type {AssertPredicatePhrasing} */ (\n  convert([\n    'break',\n    'delete',\n    'emphasis',\n    'footnote',\n    'footnoteReference',\n    'image',\n    'imageReference',\n    'inlineCode',\n    'link',\n    'linkReference',\n    'strong',\n    'text'\n  ])\n)\n","/**\n * @typedef {import('mdast').Strong} Strong\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\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 {Parent | 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 {Parent | 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').State} State\n * @typedef {import('../types.js').Options} Options\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').State} State\n * @typedef {import('../types.js').Options} Options\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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n */\n\nimport {checkQuote} from '../util/check-quote.js'\n\n/**\n * @param {Definition} node\n * @param {Parent | 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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n */\n\nimport {formatHeadingAsSetext} from '../util/format-heading-as-setext.js'\n\n/**\n * @param {Heading} node\n * @param {Parent | 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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\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 {checkBulletOrderedOther} from '../util/check-bullet-ordered-other.js'\nimport {checkRule} from '../util/check-rule.js'\n\n/**\n * @param {List} node\n * @param {Parent | 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    ? checkBulletOrderedOther(state)\n    : checkBulletOther(state)\n  const bulletLastUsed = state.bulletLastUsed\n  let useDifferentMarker = false\n\n  if (\n    parent &&\n    // Explicit `other` set.\n    (node.ordered\n      ? state.options.bulletOrderedOther\n      : state.options.bulletOther) &&\n    bulletLastUsed &&\n    bullet === bulletLastUsed\n  ) {\n    useDifferentMarker = true\n  }\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').State} State\n * @typedef {import('../types.js').Options} Options\n */\n\nimport {checkBulletOrdered} from './check-bullet-ordered.js'\n\n/**\n * @param {State} state\n * @returns {Exclude<Options['bulletOrdered'], null | undefined>}\n */\nexport function checkBulletOrderedOther(state) {\n  const bulletOrdered = checkBulletOrdered(state)\n  const bulletOrderedOther = state.options.bulletOrderedOther\n\n  if (!bulletOrderedOther) {\n    return bulletOrdered === '.' ? ')' : '.'\n  }\n\n  if (bulletOrderedOther !== '.' && bulletOrderedOther !== ')') {\n    throw new Error(\n      'Cannot serialize items with `' +\n        bulletOrderedOther +\n        '` for `options.bulletOrderedOther`, expected `*`, `+`, or `-`'\n    )\n  }\n\n  if (bulletOrderedOther === bulletOrdered) {\n    throw new Error(\n      'Expected `bulletOrdered` (`' +\n        bulletOrdered +\n        '`) and `bulletOrderedOther` (`' +\n        bulletOrderedOther +\n        '`) to be different'\n    )\n  }\n\n  return bulletOrderedOther\n}\n","/**\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Options} Options\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('../types.js').Map} Map\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\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 {Parent | 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').State} State\n * @typedef {import('../types.js').Options} Options\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 || 'tab'\n\n  // To do: remove in a major.\n  // @ts-expect-error: deprecated.\n  if (style === 1 || style === '1') {\n    return 'one'\n  }\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('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n */\n\n/**\n * @param {Paragraph} node\n * @param {Parent | 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').Root} Root\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n */\n\nimport {phrasing} from 'mdast-util-phrasing'\n\n/**\n * @param {Root} node\n * @param {Parent | 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((d) => phrasing(d))\n  const fn = hasPhrasing ? state.containerPhrasing : state.containerFlow\n  // @ts-expect-error: `root`s are supposed to have one type of content\n  return fn.call(state, node, info)\n}\n","/**\n * @typedef {import('mdast').Text} Text\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').Info} Info\n */\n\n/**\n * @param {Text} node\n * @param {Parent | 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').ThematicBreak} ThematicBreak\n * @typedef {import('../types.js').Parent} Parent\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 {Parent | 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').State} State\n * @typedef {import('../types.js').Options} Options\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  // Two lists with the same marker.\n  if (\n    left.type === 'list' &&\n    left.type === right.type &&\n    Boolean(left.ordered) === Boolean(right.ordered) &&\n    !(left.ordered\n      ? state.options.bulletOrderedOther\n      : state.options.bulletOther)\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').Unsafe} Unsafe\n * @typedef {import('./types.js').ConstructName} ConstructName\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').FlowContent} FlowContent\n * @typedef {import('../types.js').Node} Node\n * @typedef {import('../types.js').Parent} Parent\n * @typedef {import('../types.js').State} State\n * @typedef {import('../types.js').TrackFields} TrackFields\n */\n\n/**\n * @param {Parent & {children: Array<FlowContent>}} 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 {Node} left\n * @param {Node} right\n * @param {Parent} 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').State} State\n * @typedef {import('../types.js').SafeConfig} SafeConfig\n */\n\nimport {patternCompile} from './pattern-compile.js'\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 = patternCompile(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('./types.js').Enter} Enter\n * @typedef {import('./types.js').Info} Info\n * @typedef {import('./types.js').Join} Join\n * @typedef {import('./types.js').FlowContent} FlowContent\n * @typedef {import('./types.js').Node} Node\n * @typedef {import('./types.js').Options} Options\n * @typedef {import('./types.js').Parent} Parent\n * @typedef {import('./types.js').PhrasingContent} PhrasingContent\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 {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 {Node} 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    safe: safeBound,\n    stack: [],\n    unsafe: [],\n    join: [],\n    // @ts-expect-error: we’ll fill it next.\n    handlers: {},\n    options: {},\n    indexStack: [],\n    // @ts-expect-error: we’ll add `handle` later.\n    handle: undefined\n  }\n\n  configure(state, {unsafe, join, handlers})\n  configure(state, options)\n\n  if (state.options.tightDefinitions) {\n    configure(state, {join: [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    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} node\n * @returns {never}\n */\nfunction unknown(node) {\n  // @ts-expect-error: fine.\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 {Parent & {children: Array<PhrasingContent>}} 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 {Parent & {children: Array<FlowContent>}} 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').Parent} Parent\n * @typedef {import('../types.js').PhrasingContent} PhrasingContent\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 {Parent & {children: Array<PhrasingContent>}} 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|import('mdast').Content} Node\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownOptions\n * @typedef {Omit<ToMarkdownOptions, 'extensions'>} Options\n */\n\nimport {toMarkdown} from 'mdast-util-to-markdown'\n\n/**\n * @this {import('unified').Processor}\n * @type {import('unified').Plugin<[Options?]|void[], Node, string>}\n */\nexport default function remarkStringify(options) {\n  /** @type {import('unified').CompilerFunction<Node, string>} */\n  const compiler = (tree) => {\n    // Assume options.\n    const settings = /** @type {Options} */ (this.data('settings'))\n\n    return toMarkdown(\n      tree,\n      Object.assign({}, settings, 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:\n          /** @type {ToMarkdownOptions['extensions']} */ (\n            this.data('toMarkdownExtensions')\n          ) || []\n      })\n    )\n  }\n\n  Object.assign(this, {Compiler: compiler})\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","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Position} Position\n * @typedef {import('unist').Point} Point\n * @typedef {object & {type: string, position?: Position | undefined}} NodeLike\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` at `place` from `origin`.\n   *\n   * When an error is passed in as `reason`, the `stack` is copied.\n   *\n   * @param {string | Error | VFileMessage} reason\n   *   Reason for message, uses the stack and message of the error if given.\n   *\n   *   > 👉 **Note**: you should use markdown.\n   * @param {Node | NodeLike | Position | Point | null | undefined} [place]\n   *   Place in file where the message occurred.\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  // To do: next major: expose `undefined` everywhere instead of `null`.\n  constructor(reason, place, origin) {\n    /** @type {[string | null, string | null]} */\n    const parts = [null, null]\n    /** @type {Position} */\n    let position = {\n      // @ts-expect-error: we always follows the structure of `position`.\n      start: {line: null, column: null},\n      // @ts-expect-error: \"\n      end: {line: null, column: null}\n    }\n\n    super()\n\n    if (typeof place === 'string') {\n      origin = place\n      place = undefined\n    }\n\n    if (typeof origin === 'string') {\n      const index = origin.indexOf(':')\n\n      if (index === -1) {\n        parts[1] = origin\n      } else {\n        parts[0] = origin.slice(0, index)\n        parts[1] = origin.slice(index + 1)\n      }\n    }\n\n    if (place) {\n      // Node.\n      if ('type' in place || 'position' in place) {\n        if (place.position) {\n          // To do: next major: deep clone.\n          // @ts-expect-error: looks like a position.\n          position = place.position\n        }\n      }\n      // Position.\n      else if ('start' in place || 'end' in place) {\n        // @ts-expect-error: looks like a position.\n        // To do: next major: deep clone.\n        position = place\n      }\n      // Point.\n      else if ('line' in place || 'column' in place) {\n        // To do: next major: deep clone.\n        position.start = place\n      }\n    }\n\n    // Fields from `Error`.\n    /**\n     * Serialized positional info of error.\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(place) || '1:1'\n\n    /**\n     * Reason for message.\n     *\n     * @type {string}\n     */\n    this.message = typeof reason === 'object' ? reason.message : reason\n\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\n    if (typeof reason === 'object' && reason.stack) {\n      this.stack = reason.stack\n    }\n\n    /**\n     * Reason for message.\n     *\n     * > 👉 **Note**: you should use markdown.\n     *\n     * @type {string}\n     */\n    this.reason = this.message\n\n    /* eslint-disable no-unused-expressions */\n    /**\n     * State of problem.\n     *\n     * * `true` — marks associated file as no longer processable (error)\n     * * `false` — necessitates a (potential) change (warning)\n     * * `null | undefined` — for things that might not need changing (info)\n     *\n     * @type {boolean | null | undefined}\n     */\n    this.fatal\n\n    /**\n     * Starting line of error.\n     *\n     * @type {number | null}\n     */\n    this.line = position.start.line\n\n    /**\n     * Starting column of error.\n     *\n     * @type {number | null}\n     */\n    this.column = position.start.column\n\n    /**\n     * Full unist position.\n     *\n     * @type {Position | null}\n     */\n    this.position = position\n\n    /**\n     * Namespace of message (example: `'my-package'`).\n     *\n     * @type {string | null}\n     */\n    this.source = parts[0]\n\n    /**\n     * Category of message (example: `'my-rule'`).\n     *\n     * @type {string | null}\n     */\n    this.ruleId = parts[1]\n\n    /**\n     * Path of a file (used throughout the `VFile` ecosystem).\n     *\n     * @type {string | null}\n     */\n    this.file\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 | null}\n     */\n    this.actual\n\n    /**\n     * Suggest acceptable values that can be used instead of `actual`.\n     *\n     * @type {Array<string> | null}\n     */\n    this.expected\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 | null}\n     */\n    this.url\n\n    /**\n     * Long form description of the message (you should use markdown).\n     *\n     * @type {string | null}\n     */\n    this.note\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.fatal = null\nVFileMessage.prototype.column = null\nVFileMessage.prototype.line = null\nVFileMessage.prototype.source = null\nVFileMessage.prototype.ruleId = null\nVFileMessage.prototype.position = null\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 | 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.charCodeAt(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.charCodeAt(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.charCodeAt(index) === ext.charCodeAt(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.charCodeAt(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.charCodeAt(0) === 47 /* `/` */\n      ? '/'\n      : '.'\n    : end === 1 && path.charCodeAt(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.charCodeAt(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.charCodeAt(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.charCodeAt(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.charCodeAt(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.charCodeAt(result.length - 1) !== 46 /* `.` */ ||\n          result.charCodeAt(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 * @typedef URL\n * @property {string} hash\n * @property {string} host\n * @property {string} hostname\n * @property {string} href\n * @property {string} origin\n * @property {string} password\n * @property {string} pathname\n * @property {string} port\n * @property {string} protocol\n * @property {string} search\n * @property {any} searchParams\n * @property {string} username\n * @property {() => string} toString\n * @property {() => string} toJSON\n */\n\n/**\n * Check if `fileUrlOrPath` looks like a URL.\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/fcf8ba4/lib/internal/url.js#L1501>\nexport function isUrl(fileUrlOrPath) {\n  return (\n    fileUrlOrPath !== null &&\n    typeof fileUrlOrPath === 'object' &&\n    // @ts-expect-error: indexable.\n    fileUrlOrPath.href &&\n    // @ts-expect-error: indexable.\n    fileUrlOrPath.origin\n  )\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Position} Position\n * @typedef {import('unist').Point} Point\n * @typedef {import('./minurl.shared.js').URL} URL\n * @typedef {import('../index.js').Data} Data\n * @typedef {import('../index.js').Value} Value\n */\n\n/**\n * @typedef {Record<string, unknown> & {type: string, position?: Position | undefined}} NodeLike\n *\n * @typedef {'ascii' | 'utf8' | 'utf-8' | 'utf16le' | 'ucs2' | 'ucs-2' | 'base64' | 'base64url' | 'latin1' | 'binary' | 'hex'} BufferEncoding\n *   Encodings supported by the buffer class.\n *\n *   This is a copy of the types from Node, copied to prevent Node globals from\n *   being needed.\n *   Copied from: <https://github.com/DefinitelyTyped/DefinitelyTyped/blob/90a4ec8/types/node/buffer.d.ts#L170>\n *\n * @typedef {Options | URL | Value | VFile} Compatible\n *   Things that can be passed to the constructor.\n *\n * @typedef VFileCoreOptions\n *   Set multiple values.\n * @property {Value | null | undefined} [value]\n *   Set `value`.\n * @property {string | null | undefined} [cwd]\n *   Set `cwd`.\n * @property {Array<string> | null | undefined} [history]\n *   Set `history`.\n * @property {URL | string | null | undefined} [path]\n *   Set `path`.\n * @property {string | null | undefined} [basename]\n *   Set `basename`.\n * @property {string | null | undefined} [stem]\n *   Set `stem`.\n * @property {string | null | undefined} [extname]\n *   Set `extname`.\n * @property {string | null | undefined} [dirname]\n *   Set `dirname`.\n * @property {Data | null | undefined} [data]\n *   Set `data`.\n *\n * @typedef Map\n *   Raw source map.\n *\n *   See:\n *   <https://github.com/mozilla/source-map/blob/58819f0/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 {{[key: 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 {ReporterSettings} Settings\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 bufferLike from 'is-buffer'\nimport {VFileMessage} from 'vfile-message'\nimport {path} from './minpath.js'\nimport {proc} from './minproc.js'\nimport {urlToPath, isUrl} from './minurl.js'\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 *\n * @type {Array<'basename' | 'dirname' | 'extname' | 'history' | 'path' | 'stem'>}\n */\nconst order = ['history', 'path', 'basename', 'stem', 'extname', 'dirname']\n\nexport class VFile {\n  /**\n   * Create a new virtual file.\n   *\n   * `options` is treated as:\n   *\n   * *   `string` or `Buffer` — `{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 (typeof value === 'string' || buffer(value)) {\n      options = {value}\n    } else if (isUrl(value)) {\n      options = {path: value}\n    } else {\n      options = value\n    }\n\n    /**\n     * Place to store custom information (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 messages associated with the file.\n     *\n     * @type {Array<VFileMessage>}\n     */\n    this.messages = []\n\n    /**\n     * List of filepaths 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     * Base of `path` (default: `process.cwd()` or `'/'` in browsers).\n     *\n     * @type {string}\n     */\n    this.cwd = proc.cwd()\n\n    /* eslint-disable no-unused-expressions */\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    /**\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\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     * 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    /* 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 full path (example: `'~/index.min.js'`).\n   *\n   * @returns {string}\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 {string | URL} path\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 parent path (example: `'~'`).\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  set dirname(dirname) {\n    assertPath(this.basename, 'dirname')\n    this.path = path.join(dirname || '', this.basename)\n  }\n\n  /**\n   * Get the basename (including extname) (example: `'index.min.js'`).\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  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 extname (including dot) (example: `'.js'`).\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  set extname(extname) {\n    assertPart(extname, 'extname')\n    assertPath(this.dirname, 'extname')\n\n    if (extname) {\n      if (extname.charCodeAt(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 stem (basename w/o extname) (example: `'index.min'`).\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  set stem(stem) {\n    assertNonEmpty(stem, 'stem')\n    assertPart(stem, 'stem')\n    this.path = path.join(this.dirname || '', stem + (this.extname || ''))\n  }\n\n  /**\n   * Serialize the file.\n   *\n   * @param {BufferEncoding | null | undefined} [encoding='utf8']\n   *   Character encoding to understand `value` as when it’s a `Buffer`\n   *   (default: `'utf8'`).\n   * @returns {string}\n   *   Serialized file.\n   */\n  toString(encoding) {\n    return (this.value || '').toString(encoding || undefined)\n  }\n\n  /**\n   * Create a warning message associated with the file.\n   *\n   * Its `fatal` is set to `false` and `file` is set to the current file path.\n   * Its added to `file.messages`.\n   *\n   * @param {string | Error | VFileMessage} reason\n   *   Reason for message, uses the stack and message of the error if given.\n   * @param {Node | NodeLike | Position | Point | null | undefined} [place]\n   *   Place in file where the message occurred.\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(reason, place, origin) {\n    const message = new VFileMessage(reason, place, origin)\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   * Create an info message associated with the file.\n   *\n   * Its `fatal` is set to `null` and `file` is set to the current file path.\n   * Its added to `file.messages`.\n   *\n   * @param {string | Error | VFileMessage} reason\n   *   Reason for message, uses the stack and message of the error if given.\n   * @param {Node | NodeLike | Position | Point | null | undefined} [place]\n   *   Place in file where the message occurred.\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(reason, place, origin) {\n    const message = this.message(reason, place, origin)\n\n    message.fatal = null\n\n    return message\n  }\n\n  /**\n   * Create a fatal error associated with the file.\n   *\n   * Its `fatal` is set to `true` and `file` is set to the current file path.\n   * Its added to `file.messages`.\n   *\n   * > 👉 **Note**: a fatal error means that a file is no longer processable.\n   *\n   * @param {string | Error | VFileMessage} reason\n   *   Reason for message, uses the stack and message of the error if given.\n   * @param {Node | NodeLike | Position | Point | null | undefined} [place]\n   *   Place in file where the message occurred.\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   *   Message.\n   * @throws {VFileMessage}\n   *   Message.\n   */\n  fail(reason, place, origin) {\n    const message = this.message(reason, place, origin)\n\n    message.fatal = true\n\n    throw message\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 {void}\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 a buffer.\n *\n * @param {unknown} value\n *   thing.\n * @returns {value is Buffer}\n *   Whether `value` is a Node.js buffer.\n */\nfunction buffer(value) {\n  return bufferLike(value)\n}\n","/// <reference lib=\"dom\" />\n\nimport {isUrl} from './minurl.shared.js'\n\n// See: <https://github.com/nodejs/node/blob/fcf8ba4/lib/internal/url.js>\n\n/**\n * @param {string | URL} 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.charCodeAt(index) === 37 /* `%` */ &&\n      pathname.charCodeAt(index + 1) === 50 /* `2` */\n    ) {\n      const third = pathname.charCodeAt(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\nexport {isUrl} from './minurl.shared.js'\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('vfile').VFileCompatible} VFileCompatible\n * @typedef {import('vfile').VFileValue} VFileValue\n * @typedef {import('..').Processor} Processor\n * @typedef {import('..').Plugin} Plugin\n * @typedef {import('..').Preset} Preset\n * @typedef {import('..').Pluggable} Pluggable\n * @typedef {import('..').PluggableList} PluggableList\n * @typedef {import('..').Transformer} Transformer\n * @typedef {import('..').Parser} Parser\n * @typedef {import('..').Compiler} Compiler\n * @typedef {import('..').RunCallback} RunCallback\n * @typedef {import('..').ProcessCallback} ProcessCallback\n *\n * @typedef Context\n * @property {Node} tree\n * @property {VFile} file\n */\n\nimport {bail} from 'bail'\nimport isBuffer from 'is-buffer'\nimport extend from 'extend'\nimport isPlainObj from 'is-plain-obj'\nimport {trough} from 'trough'\nimport {VFile} from 'vfile'\n\n// Expose a frozen processor.\nexport const unified = base().freeze()\n\nconst own = {}.hasOwnProperty\n\n// Function to create the first processor.\n/**\n * @returns {Processor}\n */\nfunction base() {\n  const transformers = trough()\n  /** @type {Processor['attachers']} */\n  const attachers = []\n  /** @type {Record<string, unknown>} */\n  let namespace = {}\n  /** @type {boolean|undefined} */\n  let frozen\n  let freezeIndex = -1\n\n  // Data management.\n  // @ts-expect-error: overloads are handled.\n  processor.data = data\n  processor.Parser = undefined\n  processor.Compiler = undefined\n\n  // Lock.\n  processor.freeze = freeze\n\n  // Plugins.\n  processor.attachers = attachers\n  // @ts-expect-error: overloads are handled.\n  processor.use = use\n\n  // API.\n  processor.parse = parse\n  processor.stringify = stringify\n  // @ts-expect-error: overloads are handled.\n  processor.run = run\n  processor.runSync = runSync\n  // @ts-expect-error: overloads are handled.\n  processor.process = process\n  processor.processSync = processSync\n\n  // Expose.\n  return processor\n\n  // Create a new processor based on the processor in the current scope.\n  /** @type {Processor} */\n  function processor() {\n    const destination = base()\n    let index = -1\n\n    while (++index < attachers.length) {\n      destination.use(...attachers[index])\n    }\n\n    destination.data(extend(true, {}, namespace))\n\n    return destination\n  }\n\n  /**\n   * @param {string|Record<string, unknown>} [key]\n   * @param {unknown} [value]\n   * @returns {unknown}\n   */\n  function data(key, value) {\n    if (typeof key === 'string') {\n      // Set `key`.\n      if (arguments.length === 2) {\n        assertUnfrozen('data', frozen)\n        namespace[key] = value\n        return processor\n      }\n\n      // Get `key`.\n      return (own.call(namespace, key) && namespace[key]) || null\n    }\n\n    // Set space.\n    if (key) {\n      assertUnfrozen('data', frozen)\n      namespace = key\n      return processor\n    }\n\n    // Get space.\n    return namespace\n  }\n\n  /** @type {Processor['freeze']} */\n  function freeze() {\n    if (frozen) {\n      return processor\n    }\n\n    while (++freezeIndex < attachers.length) {\n      const [attacher, ...options] = attachers[freezeIndex]\n\n      if (options[0] === false) {\n        continue\n      }\n\n      if (options[0] === true) {\n        options[0] = undefined\n      }\n\n      /** @type {Transformer|void} */\n      const transformer = attacher.call(processor, ...options)\n\n      if (typeof transformer === 'function') {\n        transformers.use(transformer)\n      }\n    }\n\n    frozen = true\n    freezeIndex = Number.POSITIVE_INFINITY\n\n    return processor\n  }\n\n  /**\n   * @param {Pluggable|null|undefined} [value]\n   * @param {...unknown} options\n   * @returns {Processor}\n   */\n  function use(value, ...options) {\n    /** @type {Record<string, unknown>|undefined} */\n    let settings\n\n    assertUnfrozen('use', frozen)\n\n    if (value === null || value === undefined) {\n      // Empty.\n    } else if (typeof value === 'function') {\n      addPlugin(value, ...options)\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    if (settings) {\n      namespace.settings = Object.assign(namespace.settings || {}, settings)\n    }\n\n    return processor\n\n    /**\n     * @param {import('..').Pluggable<unknown[]>} value\n     * @returns {void}\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, ...options] = value\n          addPlugin(plugin, ...options)\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 {void}\n     */\n    function addPreset(result) {\n      addList(result.plugins)\n\n      if (result.settings) {\n        settings = Object.assign(settings || {}, result.settings)\n      }\n    }\n\n    /**\n     * @param {PluggableList|null|undefined} [plugins]\n     * @returns {void}\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 {...unknown} [value]\n     * @returns {void}\n     */\n    function addPlugin(plugin, value) {\n      let index = -1\n      /** @type {Processor['attachers'][number]|undefined} */\n      let entry\n\n      while (++index < attachers.length) {\n        if (attachers[index][0] === plugin) {\n          entry = attachers[index]\n          break\n        }\n      }\n\n      if (entry) {\n        if (isPlainObj(entry[1]) && isPlainObj(value)) {\n          value = extend(true, entry[1], value)\n        }\n\n        entry[1] = value\n      } else {\n        // @ts-expect-error: fine.\n        attachers.push([...arguments])\n      }\n    }\n  }\n\n  /** @type {Processor['parse']} */\n  function parse(doc) {\n    processor.freeze()\n    const file = vfile(doc)\n    const Parser = processor.Parser\n    assertParser('parse', Parser)\n\n    if (newable(Parser, 'parse')) {\n      // @ts-expect-error: `newable` checks this.\n      return new Parser(String(file), file).parse()\n    }\n\n    // @ts-expect-error: `newable` checks this.\n    return Parser(String(file), file) // eslint-disable-line new-cap\n  }\n\n  /** @type {Processor['stringify']} */\n  function stringify(node, doc) {\n    processor.freeze()\n    const file = vfile(doc)\n    const Compiler = processor.Compiler\n    assertCompiler('stringify', Compiler)\n    assertNode(node)\n\n    if (newable(Compiler, 'compile')) {\n      // @ts-expect-error: `newable` checks this.\n      return new Compiler(node, file).compile()\n    }\n\n    // @ts-expect-error: `newable` checks this.\n    return Compiler(node, file) // eslint-disable-line new-cap\n  }\n\n  /**\n   * @param {Node} node\n   * @param {VFileCompatible|RunCallback} [doc]\n   * @param {RunCallback} [callback]\n   * @returns {Promise<Node>|void}\n   */\n  function run(node, doc, callback) {\n    assertNode(node)\n    processor.freeze()\n\n    if (!callback && typeof doc === 'function') {\n      callback = doc\n      doc = undefined\n    }\n\n    if (!callback) {\n      return new Promise(executor)\n    }\n\n    executor(null, callback)\n\n    /**\n     * @param {null|((node: Node) => void)} resolve\n     * @param {(error: Error) => void} reject\n     * @returns {void}\n     */\n    function executor(resolve, reject) {\n      // @ts-expect-error: `doc` can’t be a callback anymore, we checked.\n      transformers.run(node, vfile(doc), done)\n\n      /**\n       * @param {Error|null} error\n       * @param {Node} tree\n       * @param {VFile} file\n       * @returns {void}\n       */\n      function done(error, tree, file) {\n        tree = tree || node\n        if (error) {\n          reject(error)\n        } else if (resolve) {\n          resolve(tree)\n        } else {\n          // @ts-expect-error: `callback` is defined if `resolve` is not.\n          callback(null, tree, file)\n        }\n      }\n    }\n  }\n\n  /** @type {Processor['runSync']} */\n  function runSync(node, file) {\n    /** @type {Node|undefined} */\n    let result\n    /** @type {boolean|undefined} */\n    let complete\n\n    processor.run(node, file, done)\n\n    assertDone('runSync', 'run', complete)\n\n    // @ts-expect-error: we either bailed on an error or have a tree.\n    return result\n\n    /**\n     * @param {Error|null} [error]\n     * @param {Node} [tree]\n     * @returns {void}\n     */\n    function done(error, tree) {\n      bail(error)\n      result = tree\n      complete = true\n    }\n  }\n\n  /**\n   * @param {VFileCompatible} doc\n   * @param {ProcessCallback} [callback]\n   * @returns {Promise<VFile>|undefined}\n   */\n  function process(doc, callback) {\n    processor.freeze()\n    assertParser('process', processor.Parser)\n    assertCompiler('process', processor.Compiler)\n\n    if (!callback) {\n      return new Promise(executor)\n    }\n\n    executor(null, callback)\n\n    /**\n     * @param {null|((file: VFile) => void)} resolve\n     * @param {(error?: Error|null|undefined) => void} reject\n     * @returns {void}\n     */\n    function executor(resolve, reject) {\n      const file = vfile(doc)\n\n      processor.run(processor.parse(file), file, (error, tree, file) => {\n        if (error || !tree || !file) {\n          done(error)\n        } else {\n          /** @type {unknown} */\n          const result = processor.stringify(tree, file)\n\n          if (result === undefined || result === null) {\n            // Empty.\n          } else if (looksLikeAVFileValue(result)) {\n            file.value = result\n          } else {\n            file.result = result\n          }\n\n          done(error, file)\n        }\n      })\n\n      /**\n       * @param {Error|null|undefined} [error]\n       * @param {VFile|undefined} [file]\n       * @returns {void}\n       */\n      function done(error, file) {\n        if (error || !file) {\n          reject(error)\n        } else if (resolve) {\n          resolve(file)\n        } else {\n          // @ts-expect-error: `callback` is defined if `resolve` is not.\n          callback(null, file)\n        }\n      }\n    }\n  }\n\n  /** @type {Processor['processSync']} */\n  function processSync(doc) {\n    /** @type {boolean|undefined} */\n    let complete\n\n    processor.freeze()\n    assertParser('processSync', processor.Parser)\n    assertCompiler('processSync', processor.Compiler)\n\n    const file = vfile(doc)\n\n    processor.process(file, done)\n\n    assertDone('processSync', 'process', complete)\n\n    return file\n\n    /**\n     * @param {Error|null|undefined} [error]\n     * @returns {void}\n     */\n    function done(error) {\n      complete = true\n      bail(error)\n    }\n  }\n}\n\n/**\n * Check if `value` is a constructor.\n *\n * @param {unknown} value\n * @param {string} name\n * @returns {boolean}\n */\nfunction newable(value, name) {\n  return (\n    typeof value === 'function' &&\n    // Prototypes do exist.\n    // type-coverage:ignore-next-line\n    value.prototype &&\n    // A function with keys in its prototype is probably a constructor.\n    // Classes’ prototype methods are not enumerable, so we check if some value\n    // exists in the prototype.\n    // type-coverage:ignore-next-line\n    (keys(value.prototype) || name in value.prototype)\n  )\n}\n\n/**\n * Check if `value` is an object with keys.\n *\n * @param {Record<string, unknown>} value\n * @returns {boolean}\n */\nfunction keys(value) {\n  /** @type {string} */\n  let key\n\n  for (key in value) {\n    if (own.call(value, key)) {\n      return true\n    }\n  }\n\n  return false\n}\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 {VFileCompatible} [value]\n * @returns {VFile}\n */\nfunction vfile(value) {\n  return looksLikeAVFile(value) ? value : new VFile(value)\n}\n\n/**\n * @param {VFileCompatible} [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 VFileValue}\n */\nfunction looksLikeAVFileValue(value) {\n  return typeof value === 'string' || isBuffer(value)\n}\n","/**\n * @typedef {(error?: Error|null|undefined, ...output: Array<any>) => void} Callback\n * @typedef {(...input: Array<any>) => any} Middleware\n *\n * @typedef {(...input: Array<any>) => void} Run\n *   Call all middleware.\n * @typedef {(fn: Middleware) => Pipeline} Use\n *   Add `fn` (middleware) to the list.\n * @typedef {{run: Run, use: Use}} Pipeline\n *   Middleware.\n */\n\n/**\n * Create new middleware.\n *\n * @returns {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`.\n * Can be sync or async; return a promise, receive a callback, or return new\n * values and errors.\n *\n * @param {Middleware} middleware\n * @param {Callback} callback\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 instanceof Promise) {\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   * @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","var W = Object.defineProperty;\nvar X = (o, n, t) => n in o ? W(o, n, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[n] = t;\nvar h = (o, n, t) => (X(o, typeof n != \"symbol\" ? n + \"\" : n, t), t), K = (o, n, t) => {\n  if (!n.has(o))\n    throw TypeError(\"Cannot \" + t);\n};\nvar i = (o, n, t) => (K(o, n, \"read from private field\"), t ? t.call(o) : n.get(o)), c = (o, n, t) => {\n  if (n.has(o))\n    throw TypeError(\"Cannot add the same private member more than once\");\n  n instanceof WeakSet ? n.add(o) : n.set(o, t);\n}, m = (o, n, t, e) => (K(o, n, \"write to private field\"), e ? e.call(o, t) : n.set(o, t), t);\nimport { stackOverFlow as L, parserMatchError as Y, createNodeInParserFail as Z, serializerMatchError as $ } from \"@milkdown/exception\";\nimport { Mark as T } from \"@milkdown/prose/model\";\nclass Q {\n}\nclass U {\n  constructor() {\n    h(this, \"elements\", []);\n    h(this, \"size\", () => this.elements.length);\n    h(this, \"top\", () => this.elements.at(-1));\n    h(this, \"push\", (n) => {\n      var t;\n      (t = this.top()) == null || t.push(n);\n    });\n    h(this, \"open\", (n) => {\n      this.elements.push(n);\n    });\n    h(this, \"close\", () => {\n      const n = this.elements.pop();\n      if (!n)\n        throw L();\n      return n;\n    });\n  }\n}\nclass z extends Q {\n  constructor(n, t, e) {\n    super(), this.type = n, this.content = t, this.attrs = e;\n  }\n  push(n, ...t) {\n    this.content.push(n, ...t);\n  }\n  pop() {\n    return this.content.pop();\n  }\n  static create(n, t, e) {\n    return new z(n, t, e);\n  }\n}\nvar a, v, F, A, E, w, x;\nconst B = class extends U {\n  constructor(t) {\n    super();\n    h(this, \"schema\");\n    c(this, a, T.none);\n    c(this, v, (t) => t.isText);\n    c(this, F, (t, e) => {\n      if (i(this, v).call(this, t) && i(this, v).call(this, e) && T.sameSet(t.marks, e.marks))\n        return this.schema.text(t.text + e.text, t.marks);\n    });\n    c(this, A, (t) => {\n      const e = Object.values({ ...this.schema.nodes, ...this.schema.marks }).find((s) => s.spec.parseMarkdown.match(t));\n      if (!e)\n        throw Y(t);\n      return e;\n    });\n    c(this, E, (t) => {\n      const e = i(this, A).call(this, t);\n      e.spec.parseMarkdown.runner(this, t, e);\n    });\n    h(this, \"injectRoot\", (t, e, s) => (this.openNode(e, s), this.next(t.children), this));\n    h(this, \"openNode\", (t, e) => (this.open(z.create(t, [], e)), this));\n    c(this, w, () => {\n      m(this, a, T.none);\n      const t = this.close();\n      return i(this, x).call(this, t.type, t.attrs, t.content);\n    });\n    h(this, \"closeNode\", () => (i(this, w).call(this), this));\n    c(this, x, (t, e, s) => {\n      const r = t.createAndFill(e, s, i(this, a));\n      if (!r)\n        throw Z(t, e, s);\n      return this.push(r), r;\n    });\n    h(this, \"addNode\", (t, e, s) => (i(this, x).call(this, t, e, s), this));\n    h(this, \"openMark\", (t, e) => {\n      const s = t.create(e);\n      return m(this, a, s.addToSet(i(this, a))), this;\n    });\n    h(this, \"closeMark\", (t) => (m(this, a, t.removeFromSet(i(this, a))), this));\n    h(this, \"addText\", (t) => {\n      const e = this.top();\n      if (!e)\n        throw L();\n      const s = e.pop(), r = this.schema.text(t, i(this, a));\n      if (!s)\n        return e.push(r), this;\n      const p = i(this, F).call(this, s, r);\n      return p ? (e.push(p), this) : (e.push(s, r), this);\n    });\n    h(this, \"build\", () => {\n      let t;\n      do\n        t = i(this, w).call(this);\n      while (this.size());\n      return t;\n    });\n    h(this, \"next\", (t = []) => ([t].flat().forEach((e) => i(this, E).call(this, e)), this));\n    h(this, \"toDoc\", () => this.build());\n    h(this, \"run\", (t, e) => {\n      const s = t.runSync(t.parse(e), e);\n      return this.next(s), this;\n    });\n    this.schema = t;\n  }\n};\nlet S = B;\na = new WeakMap(), v = new WeakMap(), F = new WeakMap(), A = new WeakMap(), E = new WeakMap(), w = new WeakMap(), x = new WeakMap(), h(S, \"create\", (t, e) => {\n  const s = new B(t);\n  return (r) => (s.run(e, r), s.toDoc());\n});\nconst G = class extends Q {\n  constructor(t, e, s, r = {}) {\n    super();\n    h(this, \"push\", (t, ...e) => {\n      this.children || (this.children = []), this.children.push(t, ...e);\n    });\n    h(this, \"pop\", () => {\n      var t;\n      return (t = this.children) == null ? void 0 : t.pop();\n    });\n    this.type = t, this.children = e, this.value = s, this.props = r;\n  }\n};\nlet M = G;\nh(M, \"create\", (t, e, s, r = {}) => new G(t, e, s, r));\nconst _ = (o) => Object.prototype.hasOwnProperty.call(o, \"size\");\nvar d, g, j, R, P, C, b, D, y, I, J, O;\nconst H = class extends U {\n  constructor(t) {\n    super();\n    c(this, d, T.none);\n    h(this, \"schema\");\n    c(this, g, (t) => {\n      const e = Object.values({ ...this.schema.nodes, ...this.schema.marks }).find((s) => s.spec.toMarkdown.match(t));\n      if (!e)\n        throw $(t.type);\n      return e;\n    });\n    c(this, j, (t) => i(this, g).call(this, t).spec.toMarkdown.runner(this, t));\n    c(this, R, (t, e) => i(this, g).call(this, t).spec.toMarkdown.runner(this, t, e));\n    c(this, P, (t) => {\n      const { marks: e } = t, s = (u) => u.type.spec.priority ?? 50;\n      [...e].sort((u, l) => s(u) - s(l)).every((u) => !i(this, R).call(this, u, t)) && i(this, j).call(this, t), e.forEach((u) => i(this, O).call(this, u));\n    });\n    c(this, C, (t, e) => {\n      var l;\n      if (t.type === e || ((l = t.children) == null ? void 0 : l.length) !== 1)\n        return t;\n      const s = (f) => {\n        var k;\n        if (f.type === e)\n          return f;\n        if (((k = f.children) == null ? void 0 : k.length) !== 1)\n          return null;\n        const [N] = f.children;\n        return N ? s(N) : null;\n      }, r = s(t);\n      if (!r)\n        return t;\n      const p = r.children ? [...r.children] : void 0, u = { ...t, children: p };\n      return u.children = p, r.children = [u], r;\n    });\n    c(this, b, (t) => {\n      const { children: e } = t;\n      return e && (t.children = e.reduce((s, r, p) => {\n        if (p === 0)\n          return [r];\n        const u = s.at(-1);\n        if (u && u.isMark && r.isMark) {\n          r = i(this, C).call(this, r, u.type);\n          const { children: l, ...f } = r, { children: N, ...k } = u;\n          if (r.type === u.type && l && N && JSON.stringify(f) === JSON.stringify(k)) {\n            const V = {\n              ...k,\n              children: [...N, ...l]\n            };\n            return s.slice(0, -1).concat(i(this, b).call(this, V));\n          }\n        }\n        return s.concat(r);\n      }, [])), t;\n    });\n    c(this, D, (t) => {\n      const e = {\n        ...t.props,\n        type: t.type\n      };\n      return t.children && (e.children = t.children), t.value && (e.value = t.value), e;\n    });\n    h(this, \"openNode\", (t, e, s) => (this.open(M.create(t, void 0, e, s)), this));\n    c(this, y, () => {\n      const t = this.close();\n      return i(this, I).call(this, t.type, t.children, t.value, t.props);\n    });\n    h(this, \"closeNode\", () => (i(this, y).call(this), this));\n    c(this, I, (t, e, s, r) => {\n      const p = M.create(t, e, s, r), u = i(this, b).call(this, i(this, D).call(this, p));\n      return this.push(u), u;\n    });\n    h(this, \"addNode\", (t, e, s, r) => (i(this, I).call(this, t, e, s, r), this));\n    c(this, J, (t, e, s, r) => t.isInSet(i(this, d)) ? this : (m(this, d, t.addToSet(i(this, d))), this.openNode(e, s, { ...r, isMark: !0 })));\n    c(this, O, (t) => {\n      !t.isInSet(i(this, d)) || (m(this, d, t.type.removeFromSet(i(this, d))), i(this, y).call(this));\n    });\n    h(this, \"withMark\", (t, e, s, r) => (i(this, J).call(this, t, e, s, r), this));\n    h(this, \"closeMark\", (t) => (i(this, O).call(this, t), this));\n    h(this, \"build\", () => {\n      let t = null;\n      do\n        t = i(this, y).call(this);\n      while (this.size());\n      return t;\n    });\n    h(this, \"next\", (t) => _(t) ? (t.forEach((e) => {\n      i(this, P).call(this, e);\n    }), this) : (i(this, P).call(this, t), this));\n    h(this, \"toString\", (t) => t.stringify(this.build()));\n    h(this, \"run\", (t) => (this.next(t), this));\n    this.schema = t;\n  }\n};\nlet q = H;\nd = new WeakMap(), g = new WeakMap(), j = new WeakMap(), R = new WeakMap(), P = new WeakMap(), C = new WeakMap(), b = new WeakMap(), D = new WeakMap(), y = new WeakMap(), I = new WeakMap(), J = new WeakMap(), O = new WeakMap(), h(q, \"create\", (t, e) => {\n  const s = new H(t);\n  return (r) => (s.run(r), s.toString(e));\n});\nexport {\n  S as ParserState,\n  q as SerializerState,\n  U as Stack,\n  Q as StackElement\n};\n//# sourceMappingURL=index.es.js.map\n","var Ae = Object.defineProperty;\nvar Ke = (e, t, r) => t in e ? Ae(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;\nvar u = (e, t, r) => (Ke(e, typeof t != \"symbol\" ? t + \"\" : t, r), r), je = (e, t, r) => {\n  if (!t.has(e))\n    throw TypeError(\"Cannot \" + r);\n};\nvar s = (e, t, r) => (je(e, t, \"read from private field\"), r ? r.call(e) : t.get(e)), c = (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}, g = (e, t, r, i) => (je(e, t, \"write to private field\"), i ? i.call(e, r) : t.set(e, r), r);\nimport { createTimer as f, createSlice as n, Container as Pe, Clock as Le, Ctx as We } from \"@milkdown/ctx\";\nimport { Schema as Be, DOMParser as Ye, Node as qe } from \"@milkdown/prose/model\";\nimport ue from \"remark-parse\";\nimport he from \"remark-stringify\";\nimport { unified as pe } from \"unified\";\nimport { ctxCallOutOfScope as Je, docTypeError as $e, callCommandBeforeEditorView as Fe } from \"@milkdown/exception\";\nimport { ParserState as Ge, SerializerState as He } from \"@milkdown/transformer\";\nimport { PluginKey as Re, Plugin as De, EditorState as Qe } from \"@milkdown/prose/state\";\nimport { EditorView as Ue } from \"@milkdown/prose/view\";\nimport { customInputRules as Xe } from \"@milkdown/prose\";\nimport { baseKeymap as Ze } from \"@milkdown/prose/commands\";\nimport { keymap as xe } from \"@milkdown/prose/keymap\";\nconst C = (e, t) => (e.meta = {\n  package: \"@milkdown/core\",\n  group: \"System\",\n  ...t\n}, e), A = f(\"ConfigReady\"), et = (e) => {\n  const t = (r) => (r.record(A), async () => (await e(r), r.done(A), () => {\n    r.clearTimer(A);\n  }));\n  return C(t, {\n    displayName: \"Config\"\n  }), t;\n}, E = f(\"InitReady\"), Q = n([], \"initTimer\"), ke = n({}, \"editor\"), ye = n([], \"inputRules\"), V = n([], \"prosePlugins\"), we = n([], \"remarkPlugins\"), fe = n([], \"nodeView\"), Ce = n([], \"markView\"), T = n(pe().use(ue).use(he), \"remark\"), tt = {}, U = n(tt, \"remarkStringifyOptions\"), rt = (e) => {\n  const t = (r) => (r.inject(ke, e).inject(V).inject(we).inject(ye).inject(fe).inject(Ce).inject(U).inject(T, pe().use(ue).use(he)).inject(Q, [A]).record(E), async () => {\n    await r.waitTimers(Q);\n    const i = r.get(U);\n    return r.set(T, pe().use(ue).use(he, i)), r.done(E), () => {\n      r.remove(ke).remove(V).remove(we).remove(ye).remove(fe).remove(Ce).remove(U).remove(T).remove(Q).clearTimer(E);\n    };\n  });\n  return C(t, {\n    displayName: \"Init\"\n  }), t;\n}, j = f(\"SchemaReady\"), X = n([], \"schemaTimer\"), k = n({}, \"schema\"), Z = n([], \"nodes\"), x = n([], \"marks\"), Oe = (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}, be = (e) => (e.inject(k).inject(Z).inject(x).inject(X, [E]).record(j), async () => {\n  await e.waitTimers(X);\n  const t = e.get(T), i = e.get(we).reduce((p, d) => p.use(d), t);\n  e.set(T, i);\n  const a = Object.fromEntries(e.get(Z).map(([p, d]) => [p, Oe(d)])), o = Object.fromEntries(e.get(x).map(([p, d]) => [p, Oe(d)]));\n  return e.set(\n    k,\n    new Be({\n      nodes: a,\n      marks: o\n    })\n  ), e.done(j), () => {\n    e.remove(k).remove(Z).remove(x).remove(X).clearTimer(j);\n  };\n});\nC(be, {\n  displayName: \"Schema\"\n});\nconst K = f(\"ParserReady\"), L = n(() => {\n  throw Je();\n}, \"parser\"), ee = n([], \"parserTimer\"), Ee = (e) => (e.inject(L).inject(ee, [j]).record(K), async () => {\n  await e.waitTimers(ee);\n  const t = e.get(T), r = e.get(k);\n  return e.set(L, Ge.create(r, t)), e.done(K), () => {\n    e.remove(L).remove(ee).clearTimer(K);\n  };\n});\nC(Ee, {\n  displayName: \"Parser\"\n});\nconst W = f(\"SerializerReady\"), te = n([], \"serializerTimer\"), re = n(() => \"\", \"serializer\"), Ve = (e) => (e.inject(re).inject(te, [j]).record(W), async () => {\n  await e.waitTimers(te);\n  const t = e.get(T), r = e.get(k);\n  return e.set(re, He.create(r, t)), e.done(W), () => {\n    e.remove(re).remove(te).clearTimer(W);\n  };\n});\nC(Ve, {\n  displayName: \"Serializer\"\n});\nconst se = n(\"\", \"defaultValue\"), b = n({}, \"editorState\"), ie = n((e) => e, \"stateOptions\"), ne = n([], \"editorStateTimer\"), B = f(\"EditorStateReady\"), st = (e, t, r) => {\n  if (typeof e == \"string\")\n    return t(e);\n  if (e.type === \"html\")\n    return Ye.fromSchema(r).parse(e.dom);\n  if (e.type === \"json\")\n    return qe.fromJSON(r, e.value);\n  throw $e(e);\n}, it = new Re(\"MILKDOWN_STATE_TRACKER\"), Ie = (e) => (e.inject(se).inject(b).inject(ie).inject(ne, [K, W, q]).record(B), async () => {\n  await e.waitTimers(ne);\n  const t = e.get(k), r = e.get(L), i = e.get(ye), a = e.get(ie), o = e.get(V), p = e.get(se), d = st(p, r, t), z = [\n    ...o,\n    new De({\n      key: it,\n      state: {\n        init: () => {\n        },\n        apply: (ze, H, dt, _e) => {\n          e.set(b, _e);\n        }\n      }\n    }),\n    Xe({ rules: i }),\n    xe(Ze)\n  ];\n  e.set(V, z);\n  const _ = a({\n    schema: t,\n    doc: d,\n    plugins: z\n  }), m = Qe.create(_);\n  return e.set(b, m), e.done(B), () => {\n    e.remove(se).remove(b).remove(ie).remove(ne).clearTimer(B);\n  };\n});\nC(Ie, {\n  displayName: \"EditorState\"\n});\nconst oe = f(\"EditorViewReady\"), Y = n({}, \"editorView\"), ae = n([], \"editorViewTimer\"), ce = n({}, \"editorViewOptions\"), me = n(null, \"root\"), ge = n(null, \"rootDOM\"), ve = n({}, \"rootAttrs\"), nt = (e, t) => {\n  const r = document.createElement(\"div\");\n  r.className = \"milkdown\", e.appendChild(r), t.set(ge, r);\n  const i = t.get(ve);\n  return Object.entries(i).forEach(([a, o]) => r.setAttribute(a, o)), r;\n}, ot = (e) => {\n  e.classList.add(\"editor\"), e.setAttribute(\"role\", \"textbox\");\n}, at = new Re(\"MILKDOWN_VIEW_CLEAR\"), Me = (e) => (e.inject(me, document.body).inject(Y).inject(ce).inject(ge).inject(ve).inject(ae, [B]).record(oe), async () => {\n  await e.wait(E);\n  const t = e.get(me) || document.body, r = typeof t == \"string\" ? document.querySelector(t) : t;\n  e.update(V, (z) => [\n    new De({\n      key: at,\n      view: (_) => {\n        const m = r ? nt(r, e) : void 0;\n        return (() => {\n          if (m && r) {\n            const H = _.dom;\n            r.replaceChild(m, H), m.appendChild(H);\n          }\n        })(), {\n          destroy: () => {\n            m != null && m.parentNode && (m == null || m.parentNode.replaceChild(_.dom, m)), m == null || m.remove();\n          }\n        };\n      }\n    }),\n    ...z\n  ]), await e.waitTimers(ae);\n  const i = e.get(b), a = e.get(ce), o = Object.fromEntries(e.get(fe)), p = Object.fromEntries(e.get(Ce)), d = new Ue(r, {\n    state: i,\n    nodeViews: o,\n    markViews: p,\n    ...a\n  });\n  return ot(d.dom), e.set(Y, d), e.done(oe), () => {\n    d == null || d.destroy(), e.remove(me).remove(Y).remove(ce).remove(ge).remove(ve).remove(ae).clearTimer(oe);\n  };\n});\nC(Me, {\n  displayName: \"EditorView\"\n});\nvar O, S;\nclass ct {\n  constructor() {\n    c(this, O, new Pe());\n    c(this, S, null);\n    u(this, \"setCtx\", (t) => {\n      g(this, S, t);\n    });\n  }\n  create(t, r) {\n    const i = t.create(s(this, O).sliceMap);\n    return i.set(r), i;\n  }\n  get(t) {\n    return s(this, O).get(t).get();\n  }\n  remove(t) {\n    return s(this, O).remove(t);\n  }\n  call(t, r) {\n    if (s(this, S) == null)\n      throw Fe();\n    const a = this.get(t)(r), o = s(this, S).get(Y);\n    return a(o.state, o.dispatch, o);\n  }\n}\nO = new WeakMap(), S = new WeakMap();\nconst Ot = (e, t) => [e, t], St = (e = \"cmdKey\") => n(() => () => !1, e), de = n(new ct(), \"commands\"), le = n([j], \"commandsTimer\"), q = f(\"CommandsReady\"), Ne = (e) => (e.inject(de).inject(le).record(q), e.get(de).setCtx(e), async () => (await e.waitTimers(le), e.done(q), () => {\n  e.remove(de).remove(le).clearTimer(q);\n}));\nC(Ne, {\n  displayName: \"Commands\"\n});\nvar mt = /* @__PURE__ */ ((e) => (e.Idle = \"Idle\", e.OnCreate = \"OnCreate\", e.Created = \"Created\", e.OnDestroy = \"OnDestroy\", e.Destroyed = \"Destroyed\", e))(mt || {}), P, h, y, I, J, $, l, w, R, F, D, M, G, v, N;\nconst Te = class {\n  constructor() {\n    c(this, P, !1);\n    c(this, h, \"Idle\");\n    c(this, y, []);\n    c(this, I, () => {\n    });\n    c(this, J, new Pe());\n    c(this, $, new Le());\n    c(this, l, /* @__PURE__ */ new Map());\n    c(this, w, /* @__PURE__ */ new Map());\n    c(this, R, new We(s(this, J), s(this, $)));\n    c(this, F, () => {\n      const t = et(async (i) => {\n        await Promise.all(s(this, y).map((a) => a(i)));\n      }), r = [\n        be,\n        Ee,\n        Ve,\n        Ne,\n        Ie,\n        Me,\n        rt(this),\n        t\n      ];\n      s(this, D).call(this, r, s(this, w));\n    });\n    c(this, D, (t, r) => {\n      t.forEach((i) => {\n        const a = s(this, R).produce(s(this, P) ? i.meta : void 0), o = i(a);\n        r.set(i, { ctx: a, handler: o, cleanup: void 0 });\n      });\n    });\n    c(this, M, (t, r = !1) => Promise.all(\n      [t].flat().map((i) => {\n        const a = s(this, l).get(i), o = a == null ? void 0 : a.cleanup;\n        return r ? s(this, l).delete(i) : s(this, l).set(i, { ctx: void 0, handler: void 0, cleanup: void 0 }), typeof o == \"function\" ? o() : o;\n      })\n    ));\n    c(this, G, async () => {\n      await Promise.all([...s(this, w).entries()].map(([t, { cleanup: r }]) => typeof r == \"function\" ? r() : r)), s(this, w).clear();\n    });\n    c(this, v, (t) => {\n      g(this, h, t), s(this, I).call(this, t);\n    });\n    c(this, N, (t) => [...t.entries()].map(async ([r, i]) => {\n      const { ctx: a, handler: o } = i;\n      if (!o)\n        return;\n      const p = await o();\n      t.set(r, { ctx: a, handler: o, cleanup: p });\n    }));\n    u(this, \"enableInspector\", (t = !0) => (g(this, P, t), this));\n    u(this, \"onStatusChange\", (t) => (g(this, I, t), this));\n    u(this, \"config\", (t) => (s(this, y).push(t), this));\n    u(this, \"removeConfig\", (t) => (g(this, y, s(this, y).filter((r) => r !== t)), this));\n    u(this, \"use\", (t) => {\n      const r = [t].flat();\n      return r.flat().forEach((i) => {\n        s(this, l).set(i, {\n          ctx: void 0,\n          handler: void 0,\n          cleanup: void 0\n        });\n      }), s(this, h) === \"Created\" && s(this, D).call(this, r, s(this, l)), this;\n    });\n    u(this, \"remove\", async (t) => s(this, h) === \"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, M).call(this, [t].flat(), !0), this));\n    u(this, \"create\", async () => s(this, h) === \"OnCreate\" ? this : (s(this, h) === \"Created\" && await this.destroy(), s(this, v).call(this, \"OnCreate\"), s(this, F).call(this), s(this, D).call(this, [...s(this, l).keys()], s(this, l)), await Promise.all(\n      [\n        s(this, N).call(this, s(this, w)),\n        s(this, N).call(this, s(this, l))\n      ].flat()\n    ), s(this, v).call(this, \"Created\"), this));\n    u(this, \"destroy\", async (t = !1) => s(this, h) === \"Destroyed\" || s(this, h) === \"OnDestroy\" ? this : s(this, h) === \"OnCreate\" ? new Promise((r) => {\n      setTimeout(() => {\n        r(this.destroy(t));\n      }, 50);\n    }) : (t && g(this, y, []), s(this, v).call(this, \"OnDestroy\"), await s(this, M).call(this, [...s(this, l).keys()], t), await s(this, G).call(this), s(this, v).call(this, \"Destroyed\"), this));\n    u(this, \"action\", (t) => t(s(this, R)));\n    u(this, \"inspect\", () => s(this, P) ? [...s(this, w).values(), ...s(this, l).values()].map(({ ctx: t }) => {\n      var r;\n      return (r = t == null ? void 0 : t.inspector) == null ? void 0 : r.read();\n    }).filter((t) => Boolean(t)) : (console.warn(\"[Milkdown]: You are trying to collect inspection when inspector is disabled, please enable inspector by `editor.enableInspector()` first.\"), []));\n  }\n  static make() {\n    return new Te();\n  }\n  get ctx() {\n    return s(this, R);\n  }\n  get status() {\n    return s(this, h);\n  }\n};\nlet Se = Te;\nP = new WeakMap(), h = new WeakMap(), y = new WeakMap(), I = new WeakMap(), J = new WeakMap(), $ = new WeakMap(), l = new WeakMap(), w = new WeakMap(), R = new WeakMap(), F = new WeakMap(), D = new WeakMap(), M = new WeakMap(), G = new WeakMap(), v = new WeakMap(), N = new WeakMap();\nexport {\n  ct as CommandManager,\n  q as CommandsReady,\n  A as ConfigReady,\n  Se as Editor,\n  B as EditorStateReady,\n  mt as EditorStatus,\n  oe as EditorViewReady,\n  E as InitReady,\n  K as ParserReady,\n  j as SchemaReady,\n  W as SerializerReady,\n  Ne as commands,\n  de as commandsCtx,\n  le as commandsTimerCtx,\n  et as config,\n  Ot as createCmd,\n  St as createCmdKey,\n  se as defaultValueCtx,\n  ke as editorCtx,\n  Ie as editorState,\n  b as editorStateCtx,\n  ie as editorStateOptionsCtx,\n  ne as editorStateTimerCtx,\n  Me as editorView,\n  Y as editorViewCtx,\n  ce as editorViewOptionsCtx,\n  ae as editorViewTimerCtx,\n  st as getDoc,\n  rt as init,\n  Q as initTimerCtx,\n  ye as inputRulesCtx,\n  Ce as markViewCtx,\n  x as marksCtx,\n  fe as nodeViewCtx,\n  Z as nodesCtx,\n  Ee as parser,\n  L as parserCtx,\n  ee as parserTimerCtx,\n  V as prosePluginsCtx,\n  T as remarkCtx,\n  we as remarkPluginsCtx,\n  tt as remarkStringifyDefaultOptions,\n  U as remarkStringifyOptionsCtx,\n  ve as rootAttrsCtx,\n  me as rootCtx,\n  ge as rootDOMCtx,\n  be as schema,\n  k as schemaCtx,\n  X as schemaTimerCtx,\n  Ve as serializer,\n  re as serializerCtx,\n  te as serializerTimerCtx\n};\n//# sourceMappingURL=index.es.js.map\n","var O = Object.defineProperty;\nvar P = (n, t, e) => t in n ? O(n, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : n[t] = e;\nvar i = (n, t, e) => (P(n, typeof t != \"symbol\" ? t + \"\" : t, e), e), k = (n, t, e) => {\n  if (!t.has(n))\n    throw TypeError(\"Cannot \" + e);\n};\nvar s = (n, t, e) => (k(n, t, \"read from private field\"), e ? e.call(n) : t.get(n)), o = (n, t, e) => {\n  if (t.has(n))\n    throw TypeError(\"Cannot add the same private member more than once\");\n  t instanceof WeakSet ? t.add(n) : t.set(n, e);\n}, h = (n, t, e, r) => (k(n, t, \"write to private field\"), r ? r.call(n, e) : t.set(n, e), e);\nimport { contextNotFound as U, ctxCallOutOfScope as V, timerNotFound as $ } from \"@milkdown/exception\";\nclass G {\n  constructor() {\n    i(this, \"sliceMap\", /* @__PURE__ */ new Map());\n    i(this, \"get\", (t) => {\n      const e = typeof t == \"string\" ? [...this.sliceMap.values()].find((r) => r.type.name === t) : this.sliceMap.get(t.id);\n      if (!e) {\n        const r = typeof t == \"string\" ? t : t.name;\n        throw U(r);\n      }\n      return e;\n    });\n    i(this, \"remove\", (t) => {\n      const e = typeof t == \"string\" ? [...this.sliceMap.values()].find((r) => r.type.name === t) : this.sliceMap.get(t.id);\n      !e || this.sliceMap.delete(e.type.id);\n    });\n    i(this, \"has\", (t) => typeof t == \"string\" ? [...this.sliceMap.values()].some((e) => e.type.name === t) : this.sliceMap.has(t.id));\n  }\n}\nvar u, c, v;\nclass F {\n  constructor(t, e, r) {\n    i(this, \"type\");\n    o(this, u, []);\n    o(this, c, void 0);\n    o(this, v, () => {\n      s(this, u).forEach((t) => t(s(this, c)));\n    });\n    i(this, \"set\", (t) => {\n      h(this, c, t), s(this, v).call(this);\n    });\n    i(this, \"get\", () => s(this, c));\n    i(this, \"update\", (t) => {\n      h(this, c, t(s(this, c))), s(this, v).call(this);\n    });\n    this.type = r, h(this, c, e), t.set(r.id, this);\n  }\n  on(t) {\n    return s(this, u).push(t), () => {\n      h(this, u, s(this, u).filter((e) => e !== t));\n    };\n  }\n  once(t) {\n    const e = this.on((r) => {\n      t(r), e();\n    });\n    return e;\n  }\n  off(t) {\n    h(this, u, s(this, u).filter((e) => e !== t));\n  }\n  offAll() {\n    h(this, u, []);\n  }\n}\nu = new WeakMap(), c = new WeakMap(), v = new WeakMap();\nclass N {\n  constructor(t, e) {\n    i(this, \"id\");\n    i(this, \"name\");\n    i(this, \"_typeInfo\");\n    i(this, \"_defaultValue\");\n    this.id = Symbol(`Context-${e}`), this.name = e, this._defaultValue = t, this._typeInfo = () => {\n      throw V();\n    };\n  }\n  create(t, e = this._defaultValue) {\n    return new F(t, e, this);\n  }\n}\nconst H = (n, t) => new N(n, t);\nvar y, S, M, g, T, p, j, I, C;\nclass W {\n  constructor(t, e, r) {\n    o(this, y, void 0);\n    o(this, S, void 0);\n    o(this, M, void 0);\n    o(this, g, /* @__PURE__ */ new Set());\n    o(this, T, /* @__PURE__ */ new Set());\n    o(this, p, /* @__PURE__ */ new Map());\n    o(this, j, /* @__PURE__ */ new Map());\n    i(this, \"read\", () => ({\n      metadata: s(this, y),\n      injectedSlices: [...s(this, g)].map((t) => ({\n        name: typeof t == \"string\" ? t : t.name,\n        value: s(this, I).call(this, t)\n      })),\n      consumedSlices: [...s(this, T)].map((t) => ({\n        name: typeof t == \"string\" ? t : t.name,\n        value: s(this, I).call(this, t)\n      })),\n      recordedTimers: [...s(this, p)].map(([t, { duration: e }]) => ({\n        name: t.name,\n        duration: e,\n        status: s(this, C).call(this, t)\n      })),\n      waitTimers: [...s(this, j)].map(([t, { duration: e }]) => ({\n        name: t.name,\n        duration: e,\n        status: s(this, C).call(this, t)\n      }))\n    }));\n    i(this, \"onRecord\", (t) => {\n      s(this, p).set(t, { start: Date.now(), duration: 0 });\n    });\n    i(this, \"onClear\", (t) => {\n      s(this, p).delete(t);\n    });\n    i(this, \"onDone\", (t) => {\n      const e = s(this, p).get(t);\n      !e || (e.duration = Date.now() - e.start);\n    });\n    i(this, \"onWait\", (t, e) => {\n      const r = Date.now();\n      e.finally(() => {\n        s(this, j).set(t, { duration: Date.now() - r });\n      });\n    });\n    i(this, \"onInject\", (t) => {\n      s(this, g).add(t);\n    });\n    i(this, \"onRemove\", (t) => {\n      s(this, g).delete(t);\n    });\n    i(this, \"onUse\", (t) => {\n      s(this, T).add(t);\n    });\n    o(this, I, (t) => s(this, S).get(t).get());\n    o(this, C, (t) => s(this, M).get(t).status);\n    h(this, S, t), h(this, M, e), h(this, y, r);\n  }\n}\ny = new WeakMap(), S = new WeakMap(), M = new WeakMap(), g = new WeakMap(), T = new WeakMap(), p = new WeakMap(), j = new WeakMap(), I = new WeakMap(), C = new WeakMap();\nvar m, d, E, a;\nconst b = class {\n  constructor(t, e, r) {\n    o(this, m, void 0);\n    o(this, d, void 0);\n    o(this, E, void 0);\n    o(this, a, void 0);\n    i(this, \"produce\", (t) => t && Object.keys(t).length ? new b(s(this, m), s(this, d), { ...t }) : this);\n    i(this, \"inject\", (t, e) => {\n      var _;\n      const r = t.create(s(this, m).sliceMap);\n      return e != null && r.set(e), (_ = s(this, a)) == null || _.onInject(t), this;\n    });\n    i(this, \"remove\", (t) => {\n      var e;\n      return s(this, m).remove(t), (e = s(this, a)) == null || e.onRemove(t), this;\n    });\n    i(this, \"record\", (t) => {\n      var e;\n      return t.create(s(this, d).store), (e = s(this, a)) == null || e.onRecord(t), this;\n    });\n    i(this, \"clearTimer\", (t) => {\n      var e;\n      return s(this, d).remove(t), (e = s(this, a)) == null || e.onClear(t), this;\n    });\n    i(this, \"isInjected\", (t) => s(this, m).has(t));\n    i(this, \"isRecorded\", (t) => s(this, d).has(t));\n    i(this, \"use\", (t) => {\n      var e;\n      return (e = s(this, a)) == null || e.onUse(t), s(this, m).get(t);\n    });\n    i(this, \"get\", (t) => this.use(t).get());\n    i(this, \"set\", (t, e) => this.use(t).set(e));\n    i(this, \"update\", (t, e) => this.use(t).update(e));\n    i(this, \"timer\", (t) => s(this, d).get(t));\n    i(this, \"done\", (t) => {\n      var e;\n      this.timer(t).done(), (e = s(this, a)) == null || e.onDone(t);\n    });\n    i(this, \"wait\", (t) => {\n      var r;\n      const e = this.timer(t).start();\n      return (r = s(this, a)) == null || r.onWait(t, e), e;\n    });\n    i(this, \"waitTimers\", async (t) => {\n      await Promise.all(this.get(t).map((e) => this.wait(e)));\n    });\n    h(this, m, t), h(this, d, e), h(this, E, r), r && h(this, a, new W(t, e, r));\n  }\n  get meta() {\n    return s(this, E);\n  }\n  get inspector() {\n    return s(this, a);\n  }\n};\nlet L = b;\nm = new WeakMap(), d = new WeakMap(), E = new WeakMap(), a = new WeakMap();\nclass J {\n  constructor() {\n    i(this, \"store\", /* @__PURE__ */ new Map());\n    i(this, \"get\", (t) => {\n      const e = this.store.get(t.id);\n      if (!e)\n        throw $(t.name);\n      return e;\n    });\n    i(this, \"remove\", (t) => {\n      this.store.delete(t.id);\n    });\n    i(this, \"has\", (t) => this.store.has(t.id));\n  }\n}\nvar D, f, w, l, x, R;\nclass q {\n  constructor(t, e) {\n    i(this, \"type\");\n    o(this, D, null);\n    o(this, f, null);\n    o(this, w, void 0);\n    o(this, l, \"pending\");\n    i(this, \"start\", () => (s(this, D) ?? h(this, D, new Promise((t, e) => {\n      h(this, f, (r) => {\n        r instanceof CustomEvent && r.detail.id === s(this, w) && (h(this, l, \"resolved\"), s(this, x).call(this), r.stopImmediatePropagation(), t());\n      }), s(this, R).call(this, () => {\n        s(this, l) === \"pending\" && h(this, l, \"rejected\"), s(this, x).call(this), e(new Error(`Timing ${this.type.name} timeout.`));\n      }), h(this, l, \"pending\"), addEventListener(this.type.name, s(this, f));\n    })), s(this, D)));\n    i(this, \"done\", () => {\n      const t = new CustomEvent(this.type.name, { detail: { id: s(this, w) } });\n      dispatchEvent(t);\n    });\n    o(this, x, () => {\n      s(this, f) && removeEventListener(this.type.name, s(this, f));\n    });\n    o(this, R, (t) => {\n      setTimeout(() => {\n        t();\n      }, this.type.timeout);\n    });\n    h(this, w, Symbol(e.name)), this.type = e, t.set(e.id, this);\n  }\n  get status() {\n    return s(this, l);\n  }\n}\nD = new WeakMap(), f = new WeakMap(), w = new WeakMap(), l = new WeakMap(), x = new WeakMap(), R = new WeakMap();\nclass A {\n  constructor(t, e = 3e3) {\n    i(this, \"id\");\n    i(this, \"name\");\n    i(this, \"timeout\");\n    i(this, \"create\", (t) => new q(t, this));\n    this.id = Symbol(`Timer-${t}`), this.name = t, this.timeout = e;\n  }\n}\nconst K = (n, t = 3e3) => new A(n, t);\nexport {\n  J as Clock,\n  G as Container,\n  L as Ctx,\n  W as Inspector,\n  F as Slice,\n  N 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 d = Object.defineProperty;\nvar p = (e, o, r) => o in e ? d(e, o, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[o] = r;\nvar m = (e, o, r) => (p(e, typeof o != \"symbol\" ? o + \"\" : o, r), r);\nvar t = /* @__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))(t || {});\nclass n extends Error {\n  constructor(r, c) {\n    super(c);\n    m(this, \"code\");\n    this.name = \"MilkdownError\", this.code = r;\n  }\n}\nconst u = (e, o) => typeof o == \"function\" ? \"[Function]\" : o, a = (e) => JSON.stringify(e, u), h = (e) => new n(t.docTypeError, `Doc type error, unsupported type: ${a(e)}`), f = (e) => new n(t.contextNotFound, `Context \"${e}\" not found, do you forget to inject it?`), w = (e) => new n(t.timerNotFound, `Timer \"${e}\" not found, do you forget to record it?`), F = () => new n(t.ctxCallOutOfScope, \"Should not call a context out of the plugin.\"), N = (...e) => {\n  const o = e.reduce((r, c) => {\n    if (!c)\n      return r;\n    const s = (i) => Array.isArray(i) ? i.map((l) => s(l)).join(\", \") : i.toJSON ? a(i.toJSON()) : i.spec ? a(i.spec) : i.toString();\n    return `${r}, ${s(c)}`;\n  }, \"Create prosemirror node from remark failed in parser\");\n  return new n(t.createNodeInParserFail, o);\n}, S = () => new n(t.stackOverFlow, \"Stack over flow, cannot pop on an empty stack.\"), y = (e) => new n(t.parserMatchError, `Cannot match target parser for node: ${a(e)}.`), k = (e) => new n(t.serializerMatchError, `Cannot match target serializer for node: ${a(e)}.`), M = (e, o) => new n(t.getAtomFromSchemaFail, `Cannot get ${e}: ${o} from schema.`), x = (e) => new n(t.expectDomTypeError, `Expect to be a dom, but get: ${a(e)}.`), O = () => new n(\n  t.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), E = () => new n(\n  t.missingRootElement,\n  \"Missing root element, milkdown cannot find root element of the editor.\"\n), I = (e) => new n(\n  t.missingNodeInSchema,\n  `Missing node in schema, milkdown cannot find \"${e}\" in schema.`\n), $ = (e) => new n(\n  t.missingMarkInSchema,\n  `Missing mark in schema, milkdown cannot find \"${e}\" in schema.`\n), z = () => new n(t.ctxNotBind, \"Context not bind, please make sure the plugin has been initialized.\"), D = () => new n(t.missingYjsDoc, \"Missing yjs doc, please make sure you have bind one.\");\nexport {\n  O as callCommandBeforeEditorView,\n  f as contextNotFound,\n  N as createNodeInParserFail,\n  F as ctxCallOutOfScope,\n  z as ctxNotBind,\n  h as docTypeError,\n  x as expectDomTypeError,\n  M as getAtomFromSchemaFail,\n  $ as missingMarkInSchema,\n  I as missingNodeInSchema,\n  E as missingRootElement,\n  D as missingYjsDoc,\n  y as parserMatchError,\n  k as serializerMatchError,\n  S as stackOverFlow,\n  w as timerNotFound\n};\n//# sourceMappingURL=index.es.js.map\n","var GOOD_LEAF_SIZE = 200;\n\n// :: class<T> A rope sequence is a persistent sequence data structure\n// that supports appending, prepending, and slicing without doing a\n// full copy. It is represented as a mostly-balanced tree.\nvar RopeSequence = function RopeSequence () {};\n\nRopeSequence.prototype.append = function append (other) {\n  if (!other.length) { return this }\n  other = RopeSequence.from(other);\n\n  return (!this.length && other) ||\n    (other.length < GOOD_LEAF_SIZE && this.leafAppend(other)) ||\n    (this.length < GOOD_LEAF_SIZE && other.leafPrepend(this)) ||\n    this.appendInner(other)\n};\n\n// :: (union<[T], RopeSequence<T>>) → RopeSequence<T>\n// Prepend an array or other rope to this one, returning a new rope.\nRopeSequence.prototype.prepend = function prepend (other) {\n  if (!other.length) { return this }\n  return RopeSequence.from(other).append(this)\n};\n\nRopeSequence.prototype.appendInner = function appendInner (other) {\n  return new Append(this, other)\n};\n\n// :: (?number, ?number) → RopeSequence<T>\n// Create a rope repesenting a sub-sequence of this rope.\nRopeSequence.prototype.slice = function slice (from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.length;\n\n  if (from >= to) { return RopeSequence.empty }\n  return this.sliceInner(Math.max(0, from), Math.min(this.length, to))\n};\n\n// :: (number) → T\n// Retrieve the element at the given position from this rope.\nRopeSequence.prototype.get = function get (i) {\n  if (i < 0 || i >= this.length) { return undefined }\n  return this.getInner(i)\n};\n\n// :: ((element: T, index: number) → ?bool, ?number, ?number)\n// Call the given function for each element between the given\n// indices. This tends to be more efficient than looping over the\n// indices and calling `get`, because it doesn't have to descend the\n// tree for every element.\nRopeSequence.prototype.forEach = function forEach (f, from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.length;\n\n  if (from <= to)\n    { this.forEachInner(f, from, to, 0); }\n  else\n    { this.forEachInvertedInner(f, from, to, 0); }\n};\n\n// :: ((element: T, index: number) → U, ?number, ?number) → [U]\n// Map the given functions over the elements of the rope, producing\n// a flat array.\nRopeSequence.prototype.map = function map (f, from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.length;\n\n  var result = [];\n  this.forEach(function (elt, i) { return result.push(f(elt, i)); }, from, to);\n  return result\n};\n\n// :: (?union<[T], RopeSequence<T>>) → RopeSequence<T>\n// Create a rope representing the given array, or return the rope\n// itself if a rope was given.\nRopeSequence.from = function from (values) {\n  if (values instanceof RopeSequence) { return values }\n  return values && values.length ? new Leaf(values) : RopeSequence.empty\n};\n\nvar Leaf = /*@__PURE__*/(function (RopeSequence) {\n  function Leaf(values) {\n    RopeSequence.call(this);\n    this.values = values;\n  }\n\n  if ( RopeSequence ) Leaf.__proto__ = RopeSequence;\n  Leaf.prototype = Object.create( RopeSequence && RopeSequence.prototype );\n  Leaf.prototype.constructor = Leaf;\n\n  var prototypeAccessors = { length: { configurable: true },depth: { configurable: true } };\n\n  Leaf.prototype.flatten = function flatten () {\n    return this.values\n  };\n\n  Leaf.prototype.sliceInner = function sliceInner (from, to) {\n    if (from == 0 && to == this.length) { return this }\n    return new Leaf(this.values.slice(from, to))\n  };\n\n  Leaf.prototype.getInner = function getInner (i) {\n    return this.values[i]\n  };\n\n  Leaf.prototype.forEachInner = function forEachInner (f, from, to, start) {\n    for (var i = from; i < to; i++)\n      { if (f(this.values[i], start + i) === false) { return false } }\n  };\n\n  Leaf.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {\n    for (var i = from - 1; i >= to; i--)\n      { if (f(this.values[i], start + i) === false) { return false } }\n  };\n\n  Leaf.prototype.leafAppend = function leafAppend (other) {\n    if (this.length + other.length <= GOOD_LEAF_SIZE)\n      { return new Leaf(this.values.concat(other.flatten())) }\n  };\n\n  Leaf.prototype.leafPrepend = function leafPrepend (other) {\n    if (this.length + other.length <= GOOD_LEAF_SIZE)\n      { return new Leaf(other.flatten().concat(this.values)) }\n  };\n\n  prototypeAccessors.length.get = function () { return this.values.length };\n\n  prototypeAccessors.depth.get = function () { return 0 };\n\n  Object.defineProperties( Leaf.prototype, prototypeAccessors );\n\n  return Leaf;\n}(RopeSequence));\n\n// :: RopeSequence\n// The empty rope sequence.\nRopeSequence.empty = new Leaf([]);\n\nvar Append = /*@__PURE__*/(function (RopeSequence) {\n  function Append(left, right) {\n    RopeSequence.call(this);\n    this.left = left;\n    this.right = right;\n    this.length = left.length + right.length;\n    this.depth = Math.max(left.depth, right.depth) + 1;\n  }\n\n  if ( RopeSequence ) Append.__proto__ = RopeSequence;\n  Append.prototype = Object.create( RopeSequence && RopeSequence.prototype );\n  Append.prototype.constructor = Append;\n\n  Append.prototype.flatten = function flatten () {\n    return this.left.flatten().concat(this.right.flatten())\n  };\n\n  Append.prototype.getInner = function getInner (i) {\n    return i < this.left.length ? this.left.get(i) : this.right.get(i - this.left.length)\n  };\n\n  Append.prototype.forEachInner = function forEachInner (f, from, to, start) {\n    var leftLen = this.left.length;\n    if (from < leftLen &&\n        this.left.forEachInner(f, from, Math.min(to, leftLen), start) === false)\n      { return false }\n    if (to > leftLen &&\n        this.right.forEachInner(f, Math.max(from - leftLen, 0), Math.min(this.length, to) - leftLen, start + leftLen) === false)\n      { return false }\n  };\n\n  Append.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {\n    var leftLen = this.left.length;\n    if (from > leftLen &&\n        this.right.forEachInvertedInner(f, from - leftLen, Math.max(to, leftLen) - leftLen, start + leftLen) === false)\n      { return false }\n    if (to < leftLen &&\n        this.left.forEachInvertedInner(f, Math.min(from, leftLen), to, start) === false)\n      { return false }\n  };\n\n  Append.prototype.sliceInner = function sliceInner (from, to) {\n    if (from == 0 && to == this.length) { return this }\n    var leftLen = this.left.length;\n    if (to <= leftLen) { return this.left.slice(from, to) }\n    if (from >= leftLen) { return this.right.slice(from - leftLen, to - leftLen) }\n    return this.left.slice(from, leftLen).append(this.right.slice(0, to - leftLen))\n  };\n\n  Append.prototype.leafAppend = function leafAppend (other) {\n    var inner = this.right.leafAppend(other);\n    if (inner) { return new Append(this.left, inner) }\n  };\n\n  Append.prototype.leafPrepend = function leafPrepend (other) {\n    var inner = this.left.leafPrepend(other);\n    if (inner) { return new Append(inner, this.right) }\n  };\n\n  Append.prototype.appendInner = function appendInner (other) {\n    if (this.left.depth >= Math.max(this.right.depth, other.depth) + 1)\n      { return new Append(this.left, new Append(this.right, other)) }\n    return new Append(this, other)\n  };\n\n  return Append;\n}(RopeSequence));\n\nexport default RopeSequence;\n","import RopeSequence from 'rope-sequence';\nimport { Mapping } from 'prosemirror-transform';\nimport { PluginKey, Plugin } from 'prosemirror-state';\n\n// ProseMirror's history isn't simply a way to roll back to a previous\n// state, because ProseMirror supports applying changes without adding\n// them to the history (for example during collaboration).\n//\n// To this end, each 'Branch' (one for the undo history and one for\n// the redo history) keeps an array of 'Items', which can optionally\n// hold a step (an actual undoable change), and always hold a position\n// map (which is needed to move changes below them to apply to the\n// current document).\n//\n// An item that has both a step and a selection bookmark is the start\n// of an 'event' — a group of changes that will be undone or redone at\n// once. (It stores only the bookmark, since that way we don't have to\n// provide a document until the selection is actually applied, which\n// is useful when compressing.)\n// Used to schedule history compression\nconst max_empty_items = 500;\nclass Branch {\n    constructor(items, eventCount) {\n        this.items = items;\n        this.eventCount = eventCount;\n    }\n    // Pop the latest event off the branch's history and apply it\n    // to a document transform.\n    popEvent(state, preserveItems) {\n        if (this.eventCount == 0)\n            return null;\n        let end = this.items.length;\n        for (;; end--) {\n            let next = this.items.get(end - 1);\n            if (next.selection) {\n                --end;\n                break;\n            }\n        }\n        let remap, mapFrom;\n        if (preserveItems) {\n            remap = this.remapping(end, this.items.length);\n            mapFrom = remap.maps.length;\n        }\n        let transform = state.tr;\n        let selection, remaining;\n        let addAfter = [], addBefore = [];\n        this.items.forEach((item, i) => {\n            if (!item.step) {\n                if (!remap) {\n                    remap = this.remapping(end, i + 1);\n                    mapFrom = remap.maps.length;\n                }\n                mapFrom--;\n                addBefore.push(item);\n                return;\n            }\n            if (remap) {\n                addBefore.push(new Item(item.map));\n                let step = item.step.map(remap.slice(mapFrom)), map;\n                if (step && transform.maybeStep(step).doc) {\n                    map = transform.mapping.maps[transform.mapping.maps.length - 1];\n                    addAfter.push(new Item(map, undefined, undefined, addAfter.length + addBefore.length));\n                }\n                mapFrom--;\n                if (map)\n                    remap.appendMap(map, mapFrom);\n            }\n            else {\n                transform.maybeStep(item.step);\n            }\n            if (item.selection) {\n                selection = remap ? item.selection.map(remap.slice(mapFrom)) : item.selection;\n                remaining = new Branch(this.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this.eventCount - 1);\n                return false;\n            }\n        }, this.items.length, 0);\n        return { remaining: remaining, transform, selection: selection };\n    }\n    // Create a new branch with the given transform added.\n    addTransform(transform, selection, histOptions, preserveItems) {\n        let newItems = [], eventCount = this.eventCount;\n        let oldItems = this.items, lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null;\n        for (let i = 0; i < transform.steps.length; i++) {\n            let step = transform.steps[i].invert(transform.docs[i]);\n            let item = new Item(transform.mapping.maps[i], step, selection), merged;\n            if (merged = lastItem && lastItem.merge(item)) {\n                item = merged;\n                if (i)\n                    newItems.pop();\n                else\n                    oldItems = oldItems.slice(0, oldItems.length - 1);\n            }\n            newItems.push(item);\n            if (selection) {\n                eventCount++;\n                selection = undefined;\n            }\n            if (!preserveItems)\n                lastItem = item;\n        }\n        let overflow = eventCount - histOptions.depth;\n        if (overflow > DEPTH_OVERFLOW) {\n            oldItems = cutOffEvents(oldItems, overflow);\n            eventCount -= overflow;\n        }\n        return new Branch(oldItems.append(newItems), eventCount);\n    }\n    remapping(from, to) {\n        let maps = new Mapping;\n        this.items.forEach((item, i) => {\n            let mirrorPos = item.mirrorOffset != null && i - item.mirrorOffset >= from\n                ? maps.maps.length - item.mirrorOffset : undefined;\n            maps.appendMap(item.map, mirrorPos);\n        }, from, to);\n        return maps;\n    }\n    addMaps(array) {\n        if (this.eventCount == 0)\n            return this;\n        return new Branch(this.items.append(array.map(map => new Item(map))), this.eventCount);\n    }\n    // When the collab module receives remote changes, the history has\n    // to know about those, so that it can adjust the steps that were\n    // rebased on top of the remote changes, and include the position\n    // maps for the remote changes in its array of items.\n    rebased(rebasedTransform, rebasedCount) {\n        if (!this.eventCount)\n            return this;\n        let rebasedItems = [], start = Math.max(0, this.items.length - rebasedCount);\n        let mapping = rebasedTransform.mapping;\n        let newUntil = rebasedTransform.steps.length;\n        let eventCount = this.eventCount;\n        this.items.forEach(item => { if (item.selection)\n            eventCount--; }, start);\n        let iRebased = rebasedCount;\n        this.items.forEach(item => {\n            let pos = mapping.getMirror(--iRebased);\n            if (pos == null)\n                return;\n            newUntil = Math.min(newUntil, pos);\n            let map = mapping.maps[pos];\n            if (item.step) {\n                let step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos]);\n                let selection = item.selection && item.selection.map(mapping.slice(iRebased + 1, pos));\n                if (selection)\n                    eventCount++;\n                rebasedItems.push(new Item(map, step, selection));\n            }\n            else {\n                rebasedItems.push(new Item(map));\n            }\n        }, start);\n        let newMaps = [];\n        for (let i = rebasedCount; i < newUntil; i++)\n            newMaps.push(new Item(mapping.maps[i]));\n        let items = this.items.slice(0, start).append(newMaps).append(rebasedItems);\n        let branch = new Branch(items, eventCount);\n        if (branch.emptyItemCount() > max_empty_items)\n            branch = branch.compress(this.items.length - rebasedItems.length);\n        return branch;\n    }\n    emptyItemCount() {\n        let count = 0;\n        this.items.forEach(item => { if (!item.step)\n            count++; });\n        return count;\n    }\n    // Compressing a branch means rewriting it to push the air (map-only\n    // items) out. During collaboration, these naturally accumulate\n    // because each remote change adds one. The `upto` argument is used\n    // to ensure that only the items below a given level are compressed,\n    // because `rebased` relies on a clean, untouched set of items in\n    // order to associate old items with rebased steps.\n    compress(upto = this.items.length) {\n        let remap = this.remapping(0, upto), mapFrom = remap.maps.length;\n        let items = [], events = 0;\n        this.items.forEach((item, i) => {\n            if (i >= upto) {\n                items.push(item);\n                if (item.selection)\n                    events++;\n            }\n            else if (item.step) {\n                let step = item.step.map(remap.slice(mapFrom)), map = step && step.getMap();\n                mapFrom--;\n                if (map)\n                    remap.appendMap(map, mapFrom);\n                if (step) {\n                    let selection = item.selection && item.selection.map(remap.slice(mapFrom));\n                    if (selection)\n                        events++;\n                    let newItem = new Item(map.invert(), step, selection), merged, last = items.length - 1;\n                    if (merged = items.length && items[last].merge(newItem))\n                        items[last] = merged;\n                    else\n                        items.push(newItem);\n                }\n            }\n            else if (item.map) {\n                mapFrom--;\n            }\n        }, this.items.length, 0);\n        return new Branch(RopeSequence.from(items.reverse()), events);\n    }\n}\nBranch.empty = new Branch(RopeSequence.empty, 0);\nfunction cutOffEvents(items, n) {\n    let cutPoint;\n    items.forEach((item, i) => {\n        if (item.selection && (n-- == 0)) {\n            cutPoint = i;\n            return false;\n        }\n    });\n    return items.slice(cutPoint);\n}\nclass Item {\n    constructor(\n    // The (forward) step map for this item.\n    map, \n    // The inverted step\n    step, \n    // If this is non-null, this item is the start of a group, and\n    // this selection is the starting selection for the group (the one\n    // that was active before the first step was applied)\n    selection, \n    // If this item is the inverse of a previous mapping on the stack,\n    // this points at the inverse's offset\n    mirrorOffset) {\n        this.map = map;\n        this.step = step;\n        this.selection = selection;\n        this.mirrorOffset = mirrorOffset;\n    }\n    merge(other) {\n        if (this.step && other.step && !other.selection) {\n            let step = other.step.merge(this.step);\n            if (step)\n                return new Item(step.getMap().invert(), step, this.selection);\n        }\n    }\n}\n// The value of the state field that tracks undo/redo history for that\n// state. Will be stored in the plugin state when the history plugin\n// is active.\nclass HistoryState {\n    constructor(done, undone, prevRanges, prevTime, prevComposition) {\n        this.done = done;\n        this.undone = undone;\n        this.prevRanges = prevRanges;\n        this.prevTime = prevTime;\n        this.prevComposition = prevComposition;\n    }\n}\nconst DEPTH_OVERFLOW = 20;\n// Record a transformation in undo history.\nfunction applyTransaction(history, state, tr, options) {\n    let historyTr = tr.getMeta(historyKey), rebased;\n    if (historyTr)\n        return historyTr.historyState;\n    if (tr.getMeta(closeHistoryKey))\n        history = new HistoryState(history.done, history.undone, null, 0, -1);\n    let appended = tr.getMeta(\"appendedTransaction\");\n    if (tr.steps.length == 0) {\n        return history;\n    }\n    else if (appended && appended.getMeta(historyKey)) {\n        if (appended.getMeta(historyKey).redo)\n            return new HistoryState(history.done.addTransform(tr, undefined, options, mustPreserveItems(state)), history.undone, rangesFor(tr.mapping.maps[tr.steps.length - 1]), history.prevTime, history.prevComposition);\n        else\n            return new HistoryState(history.done, history.undone.addTransform(tr, undefined, options, mustPreserveItems(state)), null, history.prevTime, history.prevComposition);\n    }\n    else if (tr.getMeta(\"addToHistory\") !== false && !(appended && appended.getMeta(\"addToHistory\") === false)) {\n        // Group transforms that occur in quick succession into one event.\n        let composition = tr.getMeta(\"composition\");\n        let newGroup = history.prevTime == 0 ||\n            (!appended && history.prevComposition != composition &&\n                (history.prevTime < (tr.time || 0) - options.newGroupDelay || !isAdjacentTo(tr, history.prevRanges)));\n        let prevRanges = appended ? mapRanges(history.prevRanges, tr.mapping) : rangesFor(tr.mapping.maps[tr.steps.length - 1]);\n        return new HistoryState(history.done.addTransform(tr, newGroup ? state.selection.getBookmark() : undefined, options, mustPreserveItems(state)), Branch.empty, prevRanges, tr.time, composition == null ? history.prevComposition : composition);\n    }\n    else if (rebased = tr.getMeta(\"rebased\")) {\n        // Used by the collab module to tell the history that some of its\n        // content has been rebased.\n        return new HistoryState(history.done.rebased(tr, rebased), history.undone.rebased(tr, rebased), mapRanges(history.prevRanges, tr.mapping), history.prevTime, history.prevComposition);\n    }\n    else {\n        return new HistoryState(history.done.addMaps(tr.mapping.maps), history.undone.addMaps(tr.mapping.maps), mapRanges(history.prevRanges, tr.mapping), history.prevTime, history.prevComposition);\n    }\n}\nfunction isAdjacentTo(transform, prevRanges) {\n    if (!prevRanges)\n        return false;\n    if (!transform.docChanged)\n        return true;\n    let adjacent = false;\n    transform.mapping.maps[0].forEach((start, end) => {\n        for (let i = 0; i < prevRanges.length; i += 2)\n            if (start <= prevRanges[i + 1] && end >= prevRanges[i])\n                adjacent = true;\n    });\n    return adjacent;\n}\nfunction rangesFor(map) {\n    let result = [];\n    map.forEach((_from, _to, from, to) => result.push(from, to));\n    return result;\n}\nfunction mapRanges(ranges, mapping) {\n    if (!ranges)\n        return null;\n    let result = [];\n    for (let i = 0; i < ranges.length; i += 2) {\n        let from = mapping.map(ranges[i], 1), to = mapping.map(ranges[i + 1], -1);\n        if (from <= to)\n            result.push(from, to);\n    }\n    return result;\n}\n// Apply the latest event from one branch to the document and shift the event\n// onto the other branch.\nfunction histTransaction(history, state, dispatch, redo) {\n    let preserveItems = mustPreserveItems(state);\n    let histOptions = historyKey.get(state).spec.config;\n    let pop = (redo ? history.undone : history.done).popEvent(state, preserveItems);\n    if (!pop)\n        return;\n    let selection = pop.selection.resolve(pop.transform.doc);\n    let added = (redo ? history.done : history.undone).addTransform(pop.transform, state.selection.getBookmark(), histOptions, preserveItems);\n    let newHist = new HistoryState(redo ? added : pop.remaining, redo ? pop.remaining : added, null, 0, -1);\n    dispatch(pop.transform.setSelection(selection).setMeta(historyKey, { redo, historyState: newHist }).scrollIntoView());\n}\nlet cachedPreserveItems = false, cachedPreserveItemsPlugins = null;\n// Check whether any plugin in the given state has a\n// `historyPreserveItems` property in its spec, in which case we must\n// preserve steps exactly as they came in, so that they can be\n// rebased.\nfunction mustPreserveItems(state) {\n    let plugins = state.plugins;\n    if (cachedPreserveItemsPlugins != plugins) {\n        cachedPreserveItems = false;\n        cachedPreserveItemsPlugins = plugins;\n        for (let i = 0; i < plugins.length; i++)\n            if (plugins[i].spec.historyPreserveItems) {\n                cachedPreserveItems = true;\n                break;\n            }\n    }\n    return cachedPreserveItems;\n}\n/**\nSet a flag on the given transaction that will prevent further steps\nfrom being appended to an existing history event (so that they\nrequire a separate undo command to undo).\n*/\nfunction closeHistory(tr) {\n    return tr.setMeta(closeHistoryKey, true);\n}\nconst historyKey = new PluginKey(\"history\");\nconst closeHistoryKey = new PluginKey(\"closeHistory\");\n/**\nReturns a plugin that enables the undo history for an editor. The\nplugin will track undo and redo stacks, which can be used with the\n[`undo`](https://prosemirror.net/docs/ref/#history.undo) and [`redo`](https://prosemirror.net/docs/ref/#history.redo) commands.\n\nYou can set an `\"addToHistory\"` [metadata\nproperty](https://prosemirror.net/docs/ref/#state.Transaction.setMeta) of `false` on a transaction\nto prevent it from being rolled back by undo.\n*/\nfunction history(config = {}) {\n    config = { depth: config.depth || 100,\n        newGroupDelay: config.newGroupDelay || 500 };\n    return new Plugin({\n        key: historyKey,\n        state: {\n            init() {\n                return new HistoryState(Branch.empty, Branch.empty, null, 0, -1);\n            },\n            apply(tr, hist, state) {\n                return applyTransaction(hist, state, tr, config);\n            }\n        },\n        config,\n        props: {\n            handleDOMEvents: {\n                beforeinput(view, e) {\n                    let inputType = e.inputType;\n                    let command = inputType == \"historyUndo\" ? undo : inputType == \"historyRedo\" ? redo : null;\n                    if (!command)\n                        return false;\n                    e.preventDefault();\n                    return command(view.state, view.dispatch);\n                }\n            }\n        }\n    });\n}\n/**\nA command function that undoes the last change, if any.\n*/\nconst undo = (state, dispatch) => {\n    let hist = historyKey.getState(state);\n    if (!hist || hist.done.eventCount == 0)\n        return false;\n    if (dispatch)\n        histTransaction(hist, state, dispatch, false);\n    return true;\n};\n/**\nA command function that redoes the last undone change, if any.\n*/\nconst redo = (state, dispatch) => {\n    let hist = historyKey.getState(state);\n    if (!hist || hist.undone.eventCount == 0)\n        return false;\n    if (dispatch)\n        histTransaction(hist, state, dispatch, true);\n    return true;\n};\n/**\nThe amount of undoable events available in a given state.\n*/\nfunction undoDepth(state) {\n    let hist = historyKey.getState(state);\n    return hist ? hist.done.eventCount : 0;\n}\n/**\nThe amount of redoable events available in a given editor state.\n*/\nfunction redoDepth(state) {\n    let hist = historyKey.getState(state);\n    return hist ? hist.undone.eventCount : 0;\n}\n\nexport { closeHistory, history, redo, redoDepth, undo, undoDepth };\n","import { commandsCtx as e } from \"@milkdown/core\";\nimport { undo as y, redo as c, history as h } from \"@milkdown/prose/history\";\nimport { $command as i, $ctx as p, $prose as l, $useKeymap as u } from \"@milkdown/utils\";\nconst t = (o, r) => (Object.assign(o, {\n  meta: {\n    package: \"@milkdown/plugin-history\",\n    ...r\n  }\n}), o), s = i(\"Undo\", () => () => y);\nt(s, {\n  displayName: \"Command<undo>\"\n});\nconst d = i(\"Undo\", () => () => c);\nt(s, {\n  displayName: \"Command<redo>\"\n});\nconst m = p({}, \"historyProviderConfig\");\nt(m, {\n  displayName: \"Ctx<historyProviderConfig>\"\n});\nconst n = l((o) => h(o.get(m.key)));\nt(n, {\n  displayName: \"Ctx<historyProviderPlugin>\"\n});\nconst a = u(\"historyKeymap\", {\n  Undo: {\n    shortcuts: \"Mod-z\",\n    command: (o) => {\n      const r = o.get(e);\n      return () => r.call(s.key);\n    }\n  },\n  Redo: {\n    shortcuts: [\"Mod-y\", \"Shift-Mod-z\"],\n    command: (o) => {\n      const r = o.get(e);\n      return () => r.call(d.key);\n    }\n  }\n});\nt(a.ctx, {\n  displayName: \"KeymapCtx<history>\"\n});\nt(a.shortcuts, {\n  displayName: \"Keymap<history>\"\n});\nconst x = [m, n, a, s, d].flat();\nexport {\n  x as history,\n  a as historyKeymap,\n  m as historyProviderConfig,\n  n as historyProviderPlugin,\n  d as redoCommand,\n  s as undoCommand\n};\n//# sourceMappingURL=index.es.js.map\n","var m = Object.defineProperty;\nvar L = (t, e, s) => e in t ? m(t, e, { enumerable: !0, configurable: !0, writable: !0, value: s }) : t[e] = s;\nvar n = (t, e, s) => (L(t, typeof e != \"symbol\" ? e + \"\" : e, s), s);\nimport { createSlice as c } from \"@milkdown/ctx\";\nimport { InitReady as w, SerializerReady as y, serializerCtx as b, prosePluginsCtx as g, EditorViewReady as k } from \"@milkdown/core\";\nimport { PluginKey as E, Plugin as M } from \"@milkdown/prose/state\";\nimport U from \"lodash.debounce\";\nclass l {\n  constructor() {\n    n(this, \"beforeMountedListeners\", []);\n    n(this, \"mountedListeners\", []);\n    n(this, \"updatedListeners\", []);\n    n(this, \"markdownUpdatedListeners\", []);\n    n(this, \"blurListeners\", []);\n    n(this, \"focusListeners\", []);\n    n(this, \"destroyListeners\", []);\n    n(this, \"beforeMount\", (e) => (this.beforeMountedListeners.push(e), this));\n    n(this, \"mounted\", (e) => (this.mountedListeners.push(e), this));\n    n(this, \"updated\", (e) => (this.updatedListeners.push(e), this));\n  }\n  get listeners() {\n    return {\n      beforeMount: this.beforeMountedListeners,\n      mounted: this.mountedListeners,\n      updated: this.updatedListeners,\n      markdownUpdated: this.markdownUpdatedListeners,\n      blur: this.blurListeners,\n      focus: this.focusListeners,\n      destroy: this.destroyListeners\n    };\n  }\n  markdownUpdated(e) {\n    return this.markdownUpdatedListeners.push(e), this;\n  }\n  blur(e) {\n    return this.blurListeners.push(e), this;\n  }\n  focus(e) {\n    return this.focusListeners.push(e), this;\n  }\n  destroy(e) {\n    return this.destroyListeners.push(e), this;\n  }\n}\nconst u = c(new l(), \"listener\"), v = new E(\"MILKDOWN_LISTENER\"), C = (t) => (t.inject(u, new l()), async () => {\n  await t.wait(w);\n  const e = t.get(u), { listeners: s } = e;\n  s.beforeMount.forEach((r) => r(t)), await t.wait(y);\n  const h = t.get(b);\n  let i = null, a = null;\n  const p = new M({\n    key: v,\n    view: () => ({\n      destroy: () => {\n        s.destroy.forEach((r) => r(t));\n      }\n    }),\n    props: {\n      handleDOMEvents: {\n        focus: () => (s.focus.forEach((r) => r(t)), !1),\n        blur: () => (s.blur.forEach((r) => r(t)), !1)\n      }\n    },\n    state: {\n      init: () => {\n      },\n      apply: (r) => !r.docChanged || r.getMeta(\"addToHistory\") === !1 ? void 0 : U(() => {\n        const { doc: o } = r;\n        if (s.updated.length > 0 && (i == null || !i.eq(o)) && s.updated.forEach((d) => {\n          d(t, o, i);\n        }), s.markdownUpdated.length > 0 && (i == null || !i.eq(o))) {\n          const d = h(o);\n          s.markdownUpdated.forEach((f) => {\n            f(t, d, a);\n          }), a = d;\n        }\n        i = o;\n      }, 200)()\n    }\n  });\n  t.update(g, (r) => r.concat(p)), await t.wait(k), s.mounted.forEach((r) => r(t));\n});\nC.meta = {\n  package: \"@milkdown/plugin-listener\",\n  displayName: \"Listener\"\n};\nexport {\n  l as ListenerManager,\n  v as key,\n  C as listener,\n  u as listenerCtx\n};\n//# sourceMappingURL=index.es.js.map\n","import { schemaCtx as y } from \"@milkdown/core\";\nimport { PluginKey as D, Plugin as P } from \"@milkdown/prose/state\";\nimport { Decoration as k, DecorationSet as C } from \"@milkdown/prose/view\";\nimport { $ctx as b, $prose as U } from \"@milkdown/utils\";\nimport { missingNodeInSchema as F } from \"@milkdown/exception\";\nconst w = (n) => new Promise((i) => {\n  const r = new FileReader();\n  r.addEventListener(\n    \"load\",\n    () => {\n      i({\n        alt: n.name,\n        src: r.result\n      });\n    },\n    !1\n  ), r.readAsDataURL(n);\n}), A = async (n, i) => {\n  const r = [];\n  for (let t = 0; t < n.length; t++) {\n    const e = n.item(t);\n    !e || !e.type.includes(\"image\") || r.push(e);\n  }\n  const { image: l } = i.nodes;\n  if (!l)\n    throw F(\"image\");\n  return (await Promise.all(r.map((t) => w(t)))).map(({ alt: t, src: e }) => l.createAndFill({ src: e, alt: t }));\n}, c = b({\n  uploader: A,\n  enableHtmlFileUploader: !1,\n  uploadWidgetFactory: (n, i) => {\n    const r = document.createElement(\"span\");\n    return r.textContent = \"Upload in progress...\", k.widget(n, r, i);\n  }\n}, \"uploadConfig\");\nc.meta = {\n  package: \"@milkdown/plugin-upload\",\n  displayName: \"Ctx<uploadConfig>\"\n};\nconst f = U((n) => {\n  const i = new D(\"MILKDOWN_UPLOAD\"), r = (o, t) => {\n    var s;\n    const e = i.getState(o);\n    if (!e)\n      return -1;\n    const a = e.find(void 0, void 0, (d) => d.id === t);\n    return a.length ? ((s = a[0]) == null ? void 0 : s.from) ?? -1 : -1;\n  }, l = (o, t, e) => {\n    var m;\n    if (!e || e.length <= 0)\n      return !1;\n    const a = Symbol(\"upload symbol\"), s = n.get(y), { tr: d } = o.state, g = t instanceof DragEvent ? ((m = o.posAtCoords({ left: t.clientX, top: t.clientY })) == null ? void 0 : m.pos) ?? d.selection.from : d.selection.from;\n    o.dispatch(d.setMeta(i, { add: { id: a, pos: g } }));\n    const { uploader: h } = n.get(c.key);\n    return h(e, s).then((p) => {\n      const u = r(o.state, a);\n      u < 0 || o.dispatch(\n        o.state.tr.replaceWith(u, u, p).setMeta(i, { remove: { id: a } })\n      );\n    }).catch((p) => {\n      console.error(p);\n    }), !0;\n  };\n  return new P({\n    key: i,\n    state: {\n      init() {\n        return C.empty;\n      },\n      apply(o, t) {\n        const e = t.map(o.mapping, o.doc), a = o.getMeta(this);\n        if (!a)\n          return e;\n        if (a.add) {\n          const { uploadWidgetFactory: s } = n.get(c.key), d = s(a.add.pos, { id: a.add.id });\n          return e.add(o.doc, [d]);\n        }\n        if (a.remove) {\n          const s = e.find(void 0, void 0, (d) => d.id === a.remove.id);\n          return e.remove(s);\n        }\n        return e;\n      }\n    },\n    props: {\n      decorations(o) {\n        return this.getState(o);\n      },\n      handlePaste: (o, t) => {\n        var a, s;\n        const { enableHtmlFileUploader: e } = n.get(c.key);\n        return !(t instanceof ClipboardEvent) || !e && ((a = t.clipboardData) == null ? void 0 : a.getData(\"text/html\")) ? !1 : l(o, t, (s = t.clipboardData) == null ? void 0 : s.files);\n      },\n      handleDrop: (o, t) => {\n        var e;\n        return t instanceof DragEvent ? l(o, t, (e = t.dataTransfer) == null ? void 0 : e.files) : !1;\n      }\n    }\n  });\n});\nf.meta = {\n  package: \"@milkdown/plugin-upload\",\n  displayName: \"Prose<upload>\"\n};\nconst W = [c, f];\nexport {\n  A as defaultUploader,\n  w as readImageAsBase64,\n  W as upload,\n  c as uploadConfig,\n  f as uploadPlugin\n};\n//# sourceMappingURL=index.es.js.map\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) {\n        this.match = match;\n        this.match = match;\n        this.handler = typeof handler == \"string\" ? stringHandler(handler) : handler;\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    if ($from.parent.type.spec.code)\n        return false;\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 match = rules[i].match.exec(textBefore);\n        let tr = match && 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}\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 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","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 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","/**\n * @typedef {import('mdast').Root} Root\n * @typedef {import('mdast').Content} Content\n * @typedef {import('mdast').Definition} Definition\n */\n\n/**\n * @typedef {Root | Content} Node\n *\n * @callback GetDefinition\n *   Get a definition by identifier.\n * @param {string | null | undefined} [identifier]\n *   Identifier of definition.\n * @returns {Definition | null}\n *   Definition corresponding to `identifier` or `null`.\n */\n\nimport {visit} from 'unist-util-visit'\n\nconst own = {}.hasOwnProperty\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 {Node} tree\n *   Tree to check.\n * @returns {GetDefinition}\n *   Getter.\n */\nexport function definitions(tree) {\n  /** @type {Record<string, Definition>} */\n  const cache = Object.create(null)\n\n  if (!tree || !tree.type) {\n    throw new Error('mdast-util-definitions expected node')\n  }\n\n  visit(tree, 'definition', (definition) => {\n    const id = clean(definition.identifier)\n    if (id && !own.call(cache, id)) {\n      cache[id] = definition\n    }\n  })\n\n  return definition\n\n  /** @type {GetDefinition} */\n  function definition(identifier) {\n    const id = clean(identifier)\n    // To do: next major: return `undefined` when not found.\n    return id && own.call(cache, id) ? cache[id] : null\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 * @typedef {import('mdast').Image} Image\n * @typedef {import('mdast').Link} Link\n */\n\nimport {visit, SKIP} from 'unist-util-visit'\nimport {definitions} from 'mdast-util-definitions'\n\n/**\n * Plugin to transform references and definitions into normal links and images.\n *\n * @type {import('unified').Plugin<void[], Root>}\n */\nexport default function remarkInlineLinks() {\n  return (tree) => {\n    const definition = definitions(tree)\n\n    visit(tree, (node, index, parent) => {\n      if (\n        node.type === 'definition' &&\n        parent !== null &&\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 !== null && typeof index === 'number') {\n          /** @type {Image|Link} */\n          const replacement =\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\n          parent.children[index] = replacement\n          return [SKIP, index]\n        }\n      }\n    })\n  }\n}\n","import { $markAttr as W, $markSchema as F, $command as g, $useKeymap as f, $node as Ve, $nodeAttr as N, $nodeSchema as I, $ctx as J, $inputRule as x, pipe as bt, $prose as H, $remark as G } from \"@milkdown/utils\";\nimport { commandsCtx as h, editorViewCtx as Y, serializerCtx as xt, parserCtx as Lt } from \"@milkdown/core\";\nimport { toggleMark as Q, setBlockType as R, wrapIn as X } from \"@milkdown/prose/commands\";\nimport { Fragment as St } from \"@milkdown/prose/model\";\nimport { expectDomTypeError as L } from \"@milkdown/exception\";\nimport { textblockTypeInputRule as je, wrappingInputRule as Z, InputRule as ze } from \"@milkdown/prose/inputrules\";\nimport wt from \"@sindresorhus/slugify\";\nimport { TextSelection as Ue, Selection as Ye, PluginKey as B, Plugin as T } from \"@milkdown/prose/state\";\nimport { findSelectedNodeOfType as At } from \"@milkdown/prose\";\nimport { sinkListItem as vt, liftListItem as Ht, splitListItem as Bt } from \"@milkdown/prose/schema-list\";\nimport { ReplaceStep as Tt, AddMarkStep as Ot } from \"@milkdown/prose/transform\";\nimport { Decoration as Fe, DecorationSet as Ge } from \"@milkdown/prose/view\";\nimport { visit as Je } from \"unist-util-visit\";\nimport Kt from \"remark-inline-links\";\nconst Qe = (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, i, l) => {\n    l !== e.childCount - 1 && a.push(s);\n  }), t.next(St.fromArray(a));\n}, n = (t, e) => (Object.assign(t, {\n  meta: {\n    package: \"@milkdown/preset-commonmark\",\n    ...e\n  }\n}), t), ee = W(\"emphasis\");\nn(ee, {\n  displayName: \"Attr<emphasis>\",\n  group: \"Emphasis\"\n});\nconst V = F(\"emphasis\", (t) => ({\n  inclusive: !1,\n  parseDOM: [\n    { tag: \"i\" },\n    { tag: \"em\" },\n    { style: \"font-style\", getAttrs: (e) => e === \"italic\" }\n  ],\n  toDOM: (e) => [\"em\", t.get(ee.key)(e)],\n  parseMarkdown: {\n    match: (e) => e.type === \"emphasis\",\n    runner: (e, r, a) => {\n      e.openMark(a), 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\");\n    }\n  }\n}));\nn(V.mark, {\n  displayName: \"MarkSchema<emphasis>\",\n  group: \"Emphasis\"\n});\nn(V.ctx, {\n  displayName: \"MarkSchemaCtx<emphasis>\",\n  group: \"Emphasis\"\n});\nconst te = g(\"ToggleEmphasis\", () => () => Q(V.type()));\nn(te, {\n  displayName: \"Command<toggleEmphasisCommand>\",\n  group: \"Emphasis\"\n});\nconst re = f(\"emphasisKeymap\", {\n  ToggleEmphasis: {\n    shortcuts: \"Mod-i\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(te.key);\n    }\n  }\n});\nn(re.ctx, {\n  displayName: \"KeymapCtx<emphasis>\",\n  group: \"Emphasis\"\n});\nn(re.shortcuts, {\n  displayName: \"Keymap<emphasis>\",\n  group: \"Emphasis\"\n});\nconst ae = W(\"strong\");\nn(ae, {\n  displayName: \"Attr<strong>\",\n  group: \"Strong\"\n});\nconst j = F(\"strong\", (t) => ({\n  inclusive: !1,\n  parseDOM: [\n    { tag: \"b\" },\n    { tag: \"strong\" },\n    { style: \"font-style\", getAttrs: (e) => e === \"bold\" }\n  ],\n  toDOM: (e) => [\"strong\", t.get(ae.key)(e)],\n  parseMarkdown: {\n    match: (e) => e.type === \"strong\",\n    runner: (e, r, a) => {\n      e.openMark(a), 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\");\n    }\n  }\n}));\nn(j.mark, {\n  displayName: \"MarkSchema<strong>\",\n  group: \"Strong\"\n});\nn(j.ctx, {\n  displayName: \"MarkSchemaCtx<strong>\",\n  group: \"Strong\"\n});\nconst ne = g(\"ToggleStrong\", () => () => Q(j.type()));\nn(ne, {\n  displayName: \"Command<toggleStrongCommand>\",\n  group: \"Strong\"\n});\nconst oe = f(\"strongKeymap\", {\n  ToggleBold: {\n    shortcuts: [\"Mod-b\"],\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(ne.key);\n    }\n  }\n});\nn(oe.ctx, {\n  displayName: \"KeymapCtx<strong>\",\n  group: \"Strong\"\n});\nn(oe.shortcuts, {\n  displayName: \"Keymap<strong>\",\n  group: \"Strong\"\n});\nconst se = W(\"inlineCode\");\nn(se, {\n  displayName: \"Attr<inlineCode>\",\n  group: \"InlineCode\"\n});\nconst M = F(\"inlineCode\", (t) => ({\n  priority: 100,\n  code: !0,\n  inclusive: !1,\n  parseDOM: [{ tag: \"code\" }],\n  toDOM: (e) => [\"code\", t.get(se.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(M.mark, {\n  displayName: \"MarkSchema<inlineCode>\",\n  group: \"InlineCode\"\n});\nn(M.ctx, {\n  displayName: \"MarkSchemaCtx<inlineCode>\",\n  group: \"InlineCode\"\n});\nconst le = g(\"ToggleInlineCode\", () => () => (t, e) => {\n  const { selection: r, tr: a } = t;\n  if (r.empty)\n    return !1;\n  const { from: o, to: s } = r;\n  return t.doc.rangeHasMark(o, s, M.type()) ? (e == null || e(a.removeMark(o, s, M.type())), !0) : (Object.keys(t.schema.marks).filter((c) => c !== M.type.name).map((c) => t.schema.marks[c]).forEach((c) => {\n    a.removeMark(o, s, c);\n  }), e == null || e(a.addMark(o, s, M.type().create())), !0);\n});\nn(le, {\n  displayName: \"Command<toggleInlineCodeCommand>\",\n  group: \"InlineCode\"\n});\nconst ie = f(\"inlineCodeKeymap\", {\n  ToggleInlineCode: {\n    shortcuts: \"Mod-e\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(le.key);\n    }\n  }\n});\nn(ie.ctx, {\n  displayName: \"KeymapCtx<inlineCode>\",\n  group: \"InlineCode\"\n});\nn(ie.shortcuts, {\n  displayName: \"Keymap<inlineCode>\",\n  group: \"InlineCode\"\n});\nconst ce = W(\"link\");\nn(ce, {\n  displayName: \"Attr<link>\",\n  group: \"Link\"\n});\nconst v = F(\"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 L(e);\n        return { href: e.getAttribute(\"href\"), title: e.getAttribute(\"title\") };\n      }\n    }\n  ],\n  toDOM: (e) => [\"a\", { ...t.get(ce.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(v.mark, {\n  displayName: \"MarkSchema<link>\",\n  group: \"Link\"\n});\nconst Xe = g(\"ToggleLink\", () => (t = {}) => Q(v.type(), t));\nn(Xe, {\n  displayName: \"Command<toggleLinkCommand>\",\n  group: \"Link\"\n});\nconst Ze = g(\"UpdateLink\", () => (t = {}) => (e, r) => {\n  if (!r)\n    return !1;\n  let a, o = -1;\n  const { selection: s } = e, { from: i, to: l } = s;\n  if (e.doc.nodesBetween(i, i === l ? l + 1 : l, (p, k) => {\n    if (v.type().isInSet(p.marks))\n      return a = p, o = k, !1;\n  }), !a)\n    return !1;\n  const c = a.marks.find(({ type: p }) => p === v.type());\n  if (!c)\n    return !1;\n  const d = o, m = o + a.nodeSize, { tr: u } = e, y = v.type().create({ ...c.attrs, ...t });\n  return y ? (r(\n    u.removeMark(d, m, c).addMark(d, m, y).setSelection(new Ue(u.selection.$anchor)).scrollIntoView()\n  ), !0) : !1;\n});\nn(Ze, {\n  displayName: \"Command<updateLinkCommand>\",\n  group: \"Link\"\n});\nconst et = Ve(\"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(et, {\n  displayName: \"NodeSchema<doc>\",\n  group: \"Doc\"\n});\nconst de = N(\"paragraph\");\nn(de, {\n  displayName: \"Attr<paragraph>\",\n  group: \"Paragraph\"\n});\nconst S = 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\"), Qe(e, r), e.closeNode();\n    }\n  }\n}));\nn(S.node, {\n  displayName: \"NodeSchema<paragraph>\",\n  group: \"Paragraph\"\n});\nn(S.ctx, {\n  displayName: \"NodeSchemaCtx<paragraph>\",\n  group: \"Paragraph\"\n});\nconst me = g(\"TurnIntoText\", () => () => R(S.type()));\nn(me, {\n  displayName: \"Command<turnIntoTextCommand>\",\n  group: \"Paragraph\"\n});\nconst ue = f(\"paragraphKeymap\", {\n  TurnIntoText: {\n    shortcuts: \"Mod-Alt-0\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(me.key);\n    }\n  }\n});\nn(ue.ctx, {\n  displayName: \"KeymapCtx<paragraph>\",\n  group: \"Paragraph\"\n});\nn(ue.shortcuts, {\n  displayName: \"Keymap<paragraph>\",\n  group: \"Paragraph\"\n});\nconst Dt = Array(6).fill(0).map((t, e) => e + 1), Pt = (t) => wt(t.textContent), z = J(Pt, \"headingIdGenerator\");\nn(z, {\n  displayName: \"Ctx<HeadingIdGenerator>\",\n  group: \"Heading\"\n});\nconst pe = N(\"heading\");\nn(pe, {\n  displayName: \"Attr<heading>\",\n  group: \"Heading\"\n});\nconst w = I(\"heading\", (t) => {\n  const e = t.get(z.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 L(a);\n        return { level: r, id: a.id };\n      }\n    })),\n    toDOM: (r) => [\n      `h${r.attrs.level}`,\n      {\n        ...t.get(pe.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 }), Qe(r, a), r.closeNode();\n      }\n    }\n  };\n});\nn(w.node, {\n  displayName: \"NodeSchema<heading>\",\n  group: \"Heading\"\n});\nn(w.ctx, {\n  displayName: \"NodeSchemaCtx<heading>\",\n  group: \"Heading\"\n});\nconst tt = x((t) => je(/^(?<hashes>#+)\\s$/, w.type(), (e) => {\n  var i, l;\n  const r = ((l = (i = e.groups) == null ? void 0 : i.hashes) == null ? void 0 : l.length) || 0, a = t.get(Y), { $from: o } = a.state.selection, s = o.node();\n  if (s.type.name === \"heading\") {\n    let c = Number(s.attrs.level) + Number(r);\n    return c > 6 && (c = 6), { level: c };\n  }\n  return { level: r };\n}));\nn(tt, {\n  displayName: \"InputRule<wrapInHeadingInputRule>\",\n  group: \"Heading\"\n});\nconst C = g(\"WrapInHeading\", () => (t) => (t ?? (t = 1), t < 1 ? R(S.type()) : R(w.type(), { level: t })));\nn(C, {\n  displayName: \"Command<wrapInHeadingCommand>\",\n  group: \"Heading\"\n});\nconst ge = g(\"DowngradeHeading\", () => () => (t, e, r) => {\n  const { $from: a } = t.selection, o = a.node();\n  if (o.type !== w.type() || !t.selection.empty || a.parentOffset !== 0)\n    return !1;\n  const s = o.attrs.level - 1;\n  return s ? (e == null || e(\n    t.tr.setNodeMarkup(t.selection.$from.before(), void 0, {\n      ...o.attrs,\n      level: s\n    })\n  ), !0) : R(S.type())(t, e, r);\n});\nn(ge, {\n  displayName: \"Command<downgradeHeadingCommand>\",\n  group: \"Heading\"\n});\nconst he = f(\"headingKeymap\", {\n  TurnIntoH1: {\n    shortcuts: \"Mod-Alt-1\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(C.key, 1);\n    }\n  },\n  TurnIntoH2: {\n    shortcuts: \"Mod-Alt-2\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(C.key, 2);\n    }\n  },\n  TurnIntoH3: {\n    shortcuts: \"Mod-Alt-3\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(C.key, 3);\n    }\n  },\n  TurnIntoH4: {\n    shortcuts: \"Mod-Alt-4\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(C.key, 3);\n    }\n  },\n  TurnIntoH5: {\n    shortcuts: \"Mod-Alt-5\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(C.key, 3);\n    }\n  },\n  TurnIntoH6: {\n    shortcuts: \"Mod-Alt-6\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(C.key, 3);\n    }\n  },\n  DowngradeHeading: {\n    shortcuts: [\"Delete\", \"Backspace\"],\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(ge.key);\n    }\n  }\n});\nn(he.ctx, {\n  displayName: \"KeymapCtx<heading>\",\n  group: \"Heading\"\n});\nn(he.shortcuts, {\n  displayName: \"Keymap<heading>\",\n  group: \"Heading\"\n});\nconst ye = N(\"blockquote\");\nn(ye, {\n  displayName: \"Attr<blockquote>\",\n  group: \"Blockquote\"\n});\nconst E = 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(E.node, {\n  displayName: \"NodeSchema<blockquote>\",\n  group: \"Blockquote\"\n});\nn(E.ctx, {\n  displayName: \"NodeSchemaCtx<blockquote>\",\n  group: \"Blockquote\"\n});\nconst rt = x(() => Z(/^\\s*>\\s$/, E.type()));\nn(rt, {\n  displayName: \"InputRule<wrapInBlockquoteInputRule>\",\n  group: \"Blockquote\"\n});\nconst ke = g(\"WrapInBlockquote\", () => () => X(E.type()));\nn(ke, {\n  displayName: \"Command<wrapInBlockquoteCommand>\",\n  group: \"Blockquote\"\n});\nconst fe = f(\"blockquoteKeymap\", {\n  WrapInBlockquote: {\n    shortcuts: \"Mod-Shift-b\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(ke.key);\n    }\n  }\n});\nn(fe.ctx, {\n  displayName: \"KeymapCtx<blockquote>\",\n  group: \"Blockquote\"\n});\nn(fe.shortcuts, {\n  displayName: \"Keymap<blockquote>\",\n  group: \"Blockquote\"\n});\nconst Ne = N(\"codeBlock\", () => ({\n  pre: {},\n  code: {}\n}));\nn(Ne, {\n  displayName: \"Attr<codeBlock>\",\n  group: \"CodeBlock\"\n});\nconst _ = 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 L(e);\n        return { language: e.dataset.language };\n      }\n    }\n  ],\n  toDOM: (e) => {\n    const r = t.get(Ne.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(_.node, {\n  displayName: \"NodeSchema<codeBlock>\",\n  group: \"CodeBlock\"\n});\nn(_.ctx, {\n  displayName: \"NodeSchemaCtx<codeBlock>\",\n  group: \"CodeBlock\"\n});\nconst at = x(() => je(/^```(?<language>[a-z]*)?[\\s\\n]$/, _.type(), (t) => {\n  var e;\n  return {\n    language: ((e = t.groups) == null ? void 0 : e.language) ?? \"\"\n  };\n}));\nn(at, {\n  displayName: \"InputRule<createCodeBlockInputRule>\",\n  group: \"CodeBlock\"\n});\nconst Ie = g(\"CreateCodeBlock\", () => (t = \"\") => R(_.type(), { language: t }));\nn(Ie, {\n  displayName: \"Command<createCodeBlockCommand>\",\n  group: \"CodeBlock\"\n});\nconst Rt = g(\"UpdateCodeBlockLanguage\", () => ({ pos: t, language: e } = { pos: -1, language: \"\" }) => (r, a) => t >= 0 ? (a == null || a(r.tr.setNodeAttribute(t, \"language\", e)), !0) : !1);\nn(Rt, {\n  displayName: \"Command<updateCodeBlockLanguageCommand>\",\n  group: \"CodeBlock\"\n});\nconst Ce = f(\"codeBlockKeymap\", {\n  CreateCodeBlock: {\n    shortcuts: \"Mod-Alt-c\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(Ie.key);\n    }\n  }\n});\nn(Ce.ctx, {\n  displayName: \"KeymapCtx<codeBlock>\",\n  group: \"CodeBlock\"\n});\nn(Ce.shortcuts, {\n  displayName: \"Keymap<codeBlock>\",\n  group: \"CodeBlock\"\n});\nconst Me = N(\"image\");\nn(Me, {\n  displayName: \"Attr<image>\",\n  group: \"Image\"\n});\nconst O = 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 L(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(Me.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, i = r.title;\n      e.addNode(a, {\n        src: o,\n        alt: s,\n        title: i\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(O.node, {\n  displayName: \"NodeSchema<image>\",\n  group: \"Image\"\n});\nn(O.ctx, {\n  displayName: \"NodeSchemaCtx<image>\",\n  group: \"Image\"\n});\nconst nt = g(\"InsertImage\", () => (t = {}) => (e, r) => {\n  if (!r)\n    return !0;\n  const { src: a = \"\", alt: o = \"\", title: s = \"\" } = t, i = O.type().create({ src: a, alt: o, title: s });\n  return i && r(e.tr.replaceSelectionWith(i).scrollIntoView()), !0;\n});\nn(nt, {\n  displayName: \"Command<insertImageCommand>\",\n  group: \"Image\"\n});\nconst ot = g(\"UpdateImage\", () => (t = {}) => (e, r) => {\n  const a = At(e.selection, O.type());\n  if (!a)\n    return !1;\n  const { node: o, pos: s } = a, i = { ...o.attrs }, { src: l, alt: c, title: d } = t;\n  return l !== void 0 && (i.src = l), c !== void 0 && (i.alt = c), d !== void 0 && (i.title = d), r == null || r(e.tr.setNodeMarkup(s, void 0, i).scrollIntoView()), !0;\n});\nn(ot, {\n  displayName: \"Command<updateImageCommand>\",\n  group: \"Image\"\n});\nconst Et = x(() => new ze(\n  /!\\[(?<alt>.*?)]\\((?<filename>.*?)\\s*(?=\"|\\))\"?(?<title>[^\"]+)?\"?\\)/,\n  (t, e, r, a) => {\n    const [o, s, i = \"\", l] = e;\n    return o ? t.tr.replaceWith(r, a, O.type().create({ src: i, alt: s, title: l })) : null;\n  }\n));\nn(Et, {\n  displayName: \"InputRule<insertImageInputRule>\",\n  group: \"Image\"\n});\nconst be = N(\"hardbreak\", (t) => ({\n  \"data-is-inline\": t.attrs.isInline\n}));\nn(be, {\n  displayName: \"Attr<hardbreak>\",\n  group: \"Hardbreak\"\n});\nconst b = 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(be.key)(e)],\n  parseMarkdown: {\n    match: ({ type: e }) => e === \"break\",\n    runner: (e, r, a) => {\n      var o;\n      e.addNode(a, { isInline: Boolean((o = r.data) == null ? void 0 : 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(b.node, {\n  displayName: \"NodeSchema<hardbreak>\",\n  group: \"Hardbreak\"\n});\nn(b.ctx, {\n  displayName: \"NodeSchemaCtx<hardbreak>\",\n  group: \"Hardbreak\"\n});\nconst xe = g(\"InsertHardbreak\", () => () => (t, e) => {\n  var o;\n  const { selection: r, tr: a } = t;\n  if (r.empty) {\n    const s = r.$from.node();\n    if (s.childCount > 0 && ((o = s.lastChild) == null ? void 0 : o.type.name) === \"hardbreak\")\n      return e == null || e(\n        a.replaceRangeWith(r.to - 1, r.to, t.schema.node(\"paragraph\")).setSelection(Ye.near(a.doc.resolve(r.to))).scrollIntoView()\n      ), !0;\n  }\n  return e == null || e(a.setMeta(\"hardbreak\", !0).replaceSelectionWith(b.type().create()).scrollIntoView()), !0;\n});\nn(xe, {\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(h);\n      return () => e.call(xe.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 Se = N(\"hr\");\nn(Se, {\n  displayName: \"Attr<hr>\",\n  group: \"Hr\"\n});\nconst $ = I(\"hr\", (t) => ({\n  group: \"block\",\n  parseDOM: [{ tag: \"hr\" }],\n  toDOM: (e) => [\"hr\", t.get(Se.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($.node, {\n  displayName: \"NodeSchema<hr>\",\n  group: \"Hr\"\n});\nn($.ctx, {\n  displayName: \"NodeSchemaCtx<hr>\",\n  group: \"Hr\"\n});\nconst st = x(() => new ze(\n  /^(?:---|___\\s|\\*\\*\\*\\s)$/,\n  (t, e, r, a) => {\n    const { tr: o } = t;\n    return e[0] && o.replaceWith(r - 1, a, $.type().create()), o;\n  }\n));\nn(st, {\n  displayName: \"InputRule<insertHrInputRule>\",\n  group: \"Hr\"\n});\nconst lt = g(\"InsertHr\", () => () => (t, e) => {\n  if (!e)\n    return !0;\n  const r = S.node.type().create(), { tr: a, selection: o } = t, { from: s } = o, i = $.type().create();\n  if (!i)\n    return !0;\n  const l = a.replaceSelectionWith(i).insert(s, r), c = Ye.findFrom(l.doc.resolve(s), 1, !0);\n  return c && e(l.setSelection(c).scrollIntoView()), !0;\n});\nn(lt, {\n  displayName: \"Command<insertHrCommand>\",\n  group: \"Hr\"\n});\nconst we = N(\"bulletList\");\nn(we, {\n  displayName: \"Attr<bulletList>\",\n  group: \"BulletList\"\n});\nconst K = 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 L(e);\n        return {\n          spread: e.dataset.spread\n        };\n      }\n    }\n  ],\n  toDOM: (e) => [\n    \"ul\",\n    {\n      ...t.get(we.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(K.node, {\n  displayName: \"NodeSchema<bulletList>\",\n  group: \"BulletList\"\n});\nn(K.ctx, {\n  displayName: \"NodeSchemaCtx<bulletList>\",\n  group: \"BulletList\"\n});\nconst it = x(() => Z(/^\\s*([-+*])\\s$/, K.type()));\nn(it, {\n  displayName: \"InputRule<wrapInBulletListInputRule>\",\n  group: \"BulletList\"\n});\nconst Ae = g(\"WrapInBulletList\", () => () => X(K.type()));\nn(Ae, {\n  displayName: \"Command<wrapInBulletListCommand>\",\n  group: \"BulletList\"\n});\nconst ve = f(\"bulletListKeymap\", {\n  WrapInBulletList: {\n    shortcuts: \"Mod-Alt-8\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(Ae.key);\n    }\n  }\n});\nn(ve.ctx, {\n  displayName: \"KeymapCtx<bulletListKeymap>\",\n  group: \"BulletList\"\n});\nn(ve.shortcuts, {\n  displayName: \"Keymap<bulletListKeymap>\",\n  group: \"BulletList\"\n});\nconst He = N(\"orderedList\");\nn(He, {\n  displayName: \"Attr<orderedList>\",\n  group: \"OrderedList\"\n});\nconst D = 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 L(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(D.node, {\n  displayName: \"NodeSchema<orderedList>\",\n  group: \"OrderedList\"\n});\nn(D.ctx, {\n  displayName: \"NodeSchemaCtx<orderedList>\",\n  group: \"OrderedList\"\n});\nconst ct = x(() => Z(\n  /^\\s*(\\d+)\\.\\s$/,\n  D.type(),\n  (t) => ({ order: Number(t[1]) }),\n  (t, e) => e.childCount + e.attrs.order === Number(t[1])\n));\nn(ct, {\n  displayName: \"InputRule<wrapInOrderedListInputRule>\",\n  group: \"OrderedList\"\n});\nconst Be = g(\"WrapInOrderedList\", () => () => X(D.type()));\nn(Be, {\n  displayName: \"Command<wrapInOrderedListCommand>\",\n  group: \"OrderedList\"\n});\nconst Te = f(\"orderedListKeymap\", {\n  WrapInOrderedList: {\n    shortcuts: \"Mod-Alt-7\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(Be.key);\n    }\n  }\n});\nn(Te.ctx, {\n  displayName: \"KeymapCtx<orderedList>\",\n  group: \"OrderedList\"\n});\nn(Te.shortcuts, {\n  displayName: \"Keymap<orderedList>\",\n  group: \"OrderedList\"\n});\nconst Oe = N(\"listItem\");\nn(Oe, {\n  displayName: \"Attr<listItem>\",\n  group: \"ListItem\"\n});\nconst A = 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 L(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(Oe.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\", i = r.spread != null ? `${r.spread}` : \"true\";\n      e.openNode(a, { label: o, listType: s, spread: i }), 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(A.node, {\n  displayName: \"NodeSchema<listItem>\",\n  group: \"ListItem\"\n});\nn(A.ctx, {\n  displayName: \"NodeSchemaCtx<listItem>\",\n  group: \"ListItem\"\n});\nconst Ke = g(\"SinkListItem\", () => () => vt(A.type()));\nn(Ke, {\n  displayName: \"Command<sinkListItemCommand>\",\n  group: \"ListItem\"\n});\nconst De = g(\"SplitListItem\", () => () => Ht(A.type()));\nn(De, {\n  displayName: \"Command<liftListItemCommand>\",\n  group: \"ListItem\"\n});\nconst Pe = g(\"SplitListItem\", () => () => Bt(A.type()));\nn(Pe, {\n  displayName: \"Command<splitListItemCommand>\",\n  group: \"ListItem\"\n});\nconst Re = f(\"listItemKeymap\", {\n  NextListItem: {\n    shortcuts: \"Enter\",\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(Pe.key);\n    }\n  },\n  SinkListItem: {\n    shortcuts: [\"Tab\", \"Mod-]\"],\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(Ke.key);\n    }\n  },\n  LiftListItem: {\n    shortcuts: [\"Shift-Tab\", \"Mod-[\"],\n    command: (t) => {\n      const e = t.get(h);\n      return () => e.call(De.key);\n    }\n  }\n});\nn(Re.ctx, {\n  displayName: \"KeymapCtx<listItem>\",\n  group: \"ListItem\"\n});\nn(Re.shortcuts, {\n  displayName: \"Keymap<listItem>\",\n  group: \"ListItem\"\n});\nconst dt = Ve(\"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(dt, {\n  displayName: \"NodeSchema<text>\",\n  group: \"Text\"\n});\nconst Ee = N(\"html\");\nn(Ee, {\n  displayName: \"Attr<html>\",\n  group: \"Html\"\n});\nconst _e = 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 }) => Boolean(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(_e.node, {\n  displayName: \"NodeSchema<html>\",\n  group: \"Html\"\n});\nn(_e.ctx, {\n  displayName: \"NodeSchemaCtx<html>\",\n  group: \"Html\"\n});\nconst _t = [\n  et,\n  de,\n  S,\n  z,\n  pe,\n  w,\n  be,\n  b,\n  ye,\n  E,\n  Ne,\n  _,\n  Se,\n  $,\n  Me,\n  O,\n  we,\n  K,\n  He,\n  D,\n  Oe,\n  A,\n  ee,\n  V,\n  ae,\n  j,\n  se,\n  M,\n  ce,\n  v,\n  Ee,\n  _e,\n  dt\n].flat(), $t = [\n  rt,\n  it,\n  ct,\n  at,\n  st,\n  tt\n].flat(), qt = [\n  me,\n  ke,\n  C,\n  ge,\n  Ie,\n  xe,\n  lt,\n  nt,\n  ot,\n  Be,\n  Ae,\n  Ke,\n  Pe,\n  De,\n  te,\n  le,\n  ne,\n  Xe,\n  Ze\n], Wt = [\n  fe,\n  Ce,\n  Le,\n  he,\n  Re,\n  Te,\n  ve,\n  ue,\n  re,\n  ie,\n  oe\n].flat(), U = /\\[(?<span>((www|https:\\/\\/|http:\\/\\/)[^\\s\\]]+))]\\((?<url>[^\\s\\]]+)\\)/, Ft = (t) => new RegExp(`\\\\\\\\(?=[^\\\\w\\\\s${t}\\\\\\\\]|_)`, \"g\"), Gt = (t) => {\n  let e = t, r = e.match(U);\n  for (; r && r.groups; ) {\n    const { span: a } = r.groups;\n    e = e.replace(U, a), r = e.match(U);\n  }\n  return e;\n}, Vt = (t, e, r) => {\n  const a = t.split(\"\"), o = a[e];\n  return a[e] && a[r] && (a[e] = a[r], a[r] = o), a.join(\"\").toString();\n}, jt = (t) => (e) => e.replace(Ft(t), \"\"), zt = (t) => (e) => {\n  const r = e.indexOf(t.hole), a = e.charAt(r - 1), o = e.charAt(r + 1), s = /[^\\w]|_/;\n  return o ? a && s.test(a) && s.test(o) ? t.punctuation : t.char : t.punctuation;\n}, Ut = (t, e, r) => {\n  let a = e, o = !1;\n  return t.descendants((s) => {\n    var i;\n    if (o)\n      return !1;\n    if (s.isText) {\n      const l = (i = s.text) == null ? void 0 : i.indexOf(r);\n      if (l != null && l >= 0)\n        return o = !0, a += l, !1;\n    }\n    a += s.nodeSize;\n  }), a;\n}, Yt = {\n  placeholderConfig: {\n    hole: \"∅\",\n    punctuation: \"⁂\",\n    char: \"∴\"\n  },\n  globalNodes: [\"footnote_definition\"],\n  shouldSyncNode: ({ prevNode: t, nextNode: e }) => t.inlineContent && e && t.type === e.type && !t.eq(e),\n  movePlaceholder: (t, e) => {\n    const r = [\"*\", \"_\"];\n    let a = e.indexOf(t);\n    for (; r.includes(e[a - 1] || \"\") && r.includes(e[a + 1] || \"\"); )\n      e = Vt(e, a, a + 1), a = a + 1;\n    return e;\n  }\n}, P = J(Yt, \"inlineSyncConfig\");\nn(P, {\n  displayName: \"Ctx<inlineSyncConfig>\",\n  group: \"Prose\"\n});\nconst Jt = (t) => t.selection.$from.node(), Qt = (t, e, r, a) => {\n  const o = t.get(xt), s = e.schema.topNodeType.create(void 0, [r, ...a]);\n  return o(s);\n}, Xt = (t, e) => {\n  const r = t.get(P.key), a = r.placeholderConfig.hole, [o = \"\", ...s] = e.split(`\n\n`), i = (m) => r.movePlaceholder(a, m);\n  let c = bt(jt(a), i, Gt)(o);\n  const d = zt(r.placeholderConfig)(c);\n  return c = c.replace(a, d), c = [c, ...s].join(`\n\n`), [c, d];\n}, Zt = (t, e) => {\n  const a = t.get(Lt)(e);\n  return a ? a.firstChild : null;\n}, er = (t, e) => {\n  const { globalNodes: r } = t.get(P.key), a = [];\n  return e.doc.descendants((o) => {\n    if (r.includes(o.type.name) || r.includes(o.type))\n      return a.push(o), !1;\n  }), a;\n}, tr = (t) => t.split(`\n\n`)[0] || \"\", rr = (t) => t.childCount === 1 && t.child(0).type.name === \"html\", mt = (t, e) => {\n  try {\n    const r = er(t, e), a = Jt(e), o = Qt(t, e, a, r), [s, i] = Xt(t, o), l = Zt(t, s);\n    return !l || a.type !== l.type || rr(l) ? null : (l.attrs = { ...a.attrs }, l.descendants((c) => {\n      var u;\n      const m = c.marks.find((y) => y.type.name === \"link\");\n      m && ((u = c.text) == null ? void 0 : u.includes(i)) && m.attrs.href.includes(i) && (m.attrs.href = m.attrs.href.replace(i, \"\"));\n    }), {\n      text: tr(s),\n      prevNode: a,\n      nextNode: l,\n      placeholder: i\n    });\n  } catch {\n    return null;\n  }\n}, ar = (t, e, r, a, o) => {\n  const { placeholderConfig: s } = t.get(P.key), i = s.hole;\n  let l = r.tr.setMeta(e, !0).insertText(i, r.selection.from);\n  const c = r.apply(l), d = mt(t, c);\n  if (!d)\n    return;\n  const { $from: m } = c.selection, u = m.before(), y = m.after(), p = Ut(d.nextNode, u, d.placeholder);\n  l = l.replaceWith(u, y, d.nextNode).setNodeMarkup(u, void 0, o).delete(p + 1, p + 2), l = l.setSelection(Ue.near(l.doc.resolve(p + 1))), a(l);\n}, ut = H((t) => {\n  let e = null;\n  const r = new B(\"MILKDOWN_INLINE_SYNC\");\n  return new T({\n    key: r,\n    state: {\n      init: () => null,\n      apply: (a, o, s, i) => {\n        var k;\n        const l = t.get(Y);\n        if (!((k = l.hasFocus) != null && k.call(l)) || !l.editable || !a.docChanged || a.getMeta(r))\n          return null;\n        const d = mt(t, i);\n        if (!d)\n          return null;\n        e && (cancelAnimationFrame(e), e = null);\n        const { prevNode: m, nextNode: u, text: y } = d, { shouldSyncNode: p } = t.get(P.key);\n        return p({ prevNode: m, nextNode: u, ctx: t, tr: a, text: y }) && (e = requestAnimationFrame(() => {\n          e = null;\n          const { dispatch: q, state: qe } = t.get(Y);\n          ar(t, r, qe, q, m.attrs);\n        }), a.setMeta(\"addToHistory\", !1)), null;\n      }\n    }\n  });\n});\nn(ut, {\n  displayName: \"Prose<inlineSyncPlugin>\",\n  group: \"Prose\"\n});\nconst pt = G(() => () => (t) => {\n  Je(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(pt, {\n  displayName: \"Remark<remarkAddOrderInListPlugin>\",\n  group: \"Remark\"\n});\nconst gt = G(() => () => (t) => {\n  const e = /[\\t ]*(?:\\r?\\n|\\r)/g;\n  Je(t, \"text\", (r, a, o) => {\n    if (!r.value || typeof r.value != \"string\")\n      return;\n    const s = [];\n    let i = 0;\n    e.lastIndex = 0;\n    let l = e.exec(r.value);\n    for (; l; ) {\n      const d = l.index;\n      i !== d && s.push({ type: \"text\", value: r.value.slice(i, d) }), s.push({ type: \"break\", data: { isInline: !0 } }), i = d + l[0].length, l = e.exec(r.value);\n    }\n    if (!!(s.length > 0 && o && typeof a == \"number\"))\n      return i < r.value.length && s.push({ type: \"text\", value: r.value.slice(i) }), o.children.splice(a, 1, ...s), a + s.length;\n  });\n});\nn(gt, {\n  displayName: \"Remark<remarkLineBreak>\",\n  group: \"Remark\"\n});\nconst ht = G(() => Kt);\nn(ht, {\n  displayName: \"Remark<remarkInlineLinkPlugin>\",\n  group: \"Remark\"\n});\nconst nr = (t) => !!t.children, or = (t) => t.type === \"html\";\nfunction sr(t, e) {\n  return r(t, 0, null)[0];\n  function r(a, o, s) {\n    if (nr(a)) {\n      const i = [];\n      for (let l = 0, c = a.children.length; l < c; l++) {\n        const d = a.children[l];\n        if (d) {\n          const m = r(d, l, a);\n          if (m)\n            for (let u = 0, y = m.length; u < y; u++) {\n              const p = m[u];\n              p && i.push(p);\n            }\n        }\n      }\n      a.children = i;\n    }\n    return e(a, o, s);\n  }\n}\nconst yt = G(() => () => (t) => {\n  sr(t, (e, r, a) => or(e) ? ((a == null ? void 0 : a.type) === \"root\" && (e.children = [{ ...e }], delete e.value, e.type = \"paragraph\"), [e]) : [e]);\n});\nn(yt, {\n  displayName: \"Remark<remarkHtmlTransformer>\",\n  group: \"Remark\"\n});\nconst kt = H(() => {\n  let t = !1;\n  const e = new B(\"MILKDOWN_INLINE_NODES_CURSOR\"), r = new T({\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, i = o.nodeAfter;\n        return !!(s && i && s.isInline && !s.isText && i.isInline && !i.isText);\n      }\n    },\n    props: {\n      handleDOMEvents: {\n        compositionend: (a, o) => t ? (t = !1, requestAnimationFrame(() => {\n          if (r.getState(a.state)) {\n            const i = a.state.selection.from;\n            o.preventDefault(), a.dispatch(a.state.tr.insertText(o.data || \"\", i));\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 i = a.state.selection.from;\n            return o.preventDefault(), a.dispatch(a.state.tr.insertText(o.data || \"\", i)), !0;\n          }\n          return !1;\n        }\n      },\n      decorations(a) {\n        if (r.getState(a)) {\n          const i = a.selection.$from.pos, l = document.createElement(\"span\"), c = Fe.widget(i, l, {\n            side: -1\n          }), d = document.createElement(\"span\"), m = Fe.widget(i, d);\n          return setTimeout(() => {\n            l.contentEditable = \"true\", d.contentEditable = \"true\";\n          }), Ge.create(a.doc, [c, m]);\n        }\n        return Ge.empty;\n      }\n    }\n  });\n  return r;\n});\nn(kt, {\n  displayName: \"Prose<inlineNodesCursorPlugin>\",\n  group: \"Prose\"\n});\nconst ft = H(() => new T({\n  key: new B(\"MILKDOWN_HARDBREAK_MARKS\"),\n  appendTransaction: (t, e, r) => {\n    if (!t.length)\n      return;\n    const [a] = t;\n    if (!a)\n      return;\n    const [o] = a.steps;\n    if (a.getMeta(\"hardbreak\")) {\n      if (!(o instanceof Tt))\n        return;\n      const { from: l } = o;\n      return r.tr.setNodeMarkup(l, b.type(), void 0, []);\n    }\n    if (o instanceof Ot) {\n      let l = r.tr;\n      const { from: c, to: d } = o;\n      return r.doc.nodesBetween(c, d, (m, u) => {\n        m.type === b.type() && (l = l.setNodeMarkup(u, b.type(), void 0, []));\n      }), l;\n    }\n  }\n}));\nn(ft, {\n  displayName: \"Prose<hardbreakClearMarkPlugin>\",\n  group: \"Prose\"\n});\nconst $e = J([\"table\", \"code_block\"], \"hardbreakFilterNodes\");\nn($e, {\n  displayName: \"Ctx<hardbreakFilterNodes>\",\n  group: \"Prose\"\n});\nconst Nt = H((t) => {\n  const e = t.get($e.key);\n  return new T({\n    key: new B(\"MILKDOWN_HARDBREAK_FILTER\"),\n    filterTransaction: (r, a) => {\n      const o = r.getMeta(\"hardbreak\"), [s] = r.steps;\n      if (o && s) {\n        const { from: i } = s, l = a.doc.resolve(i);\n        let c = l.depth, d = !0;\n        for (; c > 0; )\n          e.includes(l.node(c).type.name) && (d = !1), c--;\n        return d;\n      }\n      return !0;\n    }\n  });\n});\nn(Nt, {\n  displayName: \"Prose<hardbreakFilterPlugin>\",\n  group: \"Prose\"\n});\nconst It = H((t) => {\n  const e = new B(\"MILKDOWN_HEADING_ID\"), r = (a) => {\n    if (a.composing || !a.editable)\n      return;\n    const o = t.get(z.key), s = a.state.tr.setMeta(\"addToHistory\", !1);\n    let i = !1;\n    a.state.doc.descendants((l, c) => {\n      if (l.type === w.type()) {\n        if (l.textContent.trim().length === 0)\n          return;\n        const d = l.attrs, m = o(l);\n        d.id !== m && (i = !0, s.setMeta(e, !0).setNodeMarkup(c, void 0, {\n          ...d,\n          id: m\n        }));\n      }\n    }), i && a.dispatch(s);\n  };\n  return new T({\n    key: e,\n    view: (a) => (r(a), {\n      update: (o) => {\n        r(o);\n      }\n    })\n  });\n});\nn(It, {\n  displayName: \"Prose<syncHeadingIdPlugin>\",\n  group: \"Prose\"\n});\nconst Ct = H(() => {\n  const t = (e) => {\n    if (e.composing || !e.editable)\n      return;\n    const r = D.type(), a = K.type(), o = A.type(), s = e.state, i = (d, m) => {\n      let u = !1;\n      const y = `${m + 1}.`;\n      return d.label !== y && (d.label = y, u = !0), u;\n    };\n    let l = s.tr, c = !1;\n    s.doc.descendants((d, m, u, y) => {\n      if (d.type === a) {\n        const p = d.maybeChild(0);\n        (p == null ? void 0 : p.type) === o && p.attrs.listType === \"ordered\" && (c = !0, l.setNodeMarkup(m, r, { spread: \"true\" }), d.descendants((k, q, qe, Mt) => {\n          if (k.type === o) {\n            const We = { ...k.attrs };\n            i(We, Mt) && (l = l.setNodeMarkup(q, void 0, We));\n          }\n          return !1;\n        }));\n      } else if (d.type === o && (u == null ? void 0 : u.type) === r) {\n        const p = { ...d.attrs };\n        let k = !1;\n        p.listType !== \"ordered\" && (p.listType = \"ordered\", k = !0), (u == null ? void 0 : u.maybeChild(0)) && (k = i(p, y)), k && (l = l.setNodeMarkup(m, void 0, p), c = !0);\n      }\n    }), c && e.dispatch(l.setMeta(\"addToHistory\", !1));\n  };\n  return new T({\n    key: new B(\"MILKDOWN_KEEP_LIST_ORDER\"),\n    view: (e) => (t(e), {\n      update: (r) => {\n        t(r);\n      }\n    })\n  });\n});\nn(Ct, {\n  displayName: \"Prose<syncListOrderPlugin>\",\n  group: \"Prose\"\n});\nconst lr = [\n  P,\n  ut,\n  ft,\n  $e,\n  Nt,\n  kt,\n  pt,\n  ht,\n  gt,\n  yt,\n  It,\n  Ct\n], br = [_t, $t, qt, Wt, lr].flat();\nexport {\n  ye as blockquoteAttr,\n  fe as blockquoteKeymap,\n  E as blockquoteSchema,\n  we as bulletListAttr,\n  ve as bulletListKeymap,\n  K as bulletListSchema,\n  Ne as codeBlockAttr,\n  Ce as codeBlockKeymap,\n  _ as codeBlockSchema,\n  qt as commands,\n  br as commonmark,\n  Ie as createCodeBlockCommand,\n  at as createCodeBlockInputRule,\n  Yt as defaultConfig,\n  et as docSchema,\n  ge as downgradeHeadingCommand,\n  ee as emphasisAttr,\n  re as emphasisKeymap,\n  V as emphasisSchema,\n  be as hardbreakAttr,\n  ft as hardbreakClearMarkPlugin,\n  $e as hardbreakFilterNodes,\n  Nt as hardbreakFilterPlugin,\n  Le as hardbreakKeymap,\n  b as hardbreakSchema,\n  pe as headingAttr,\n  z as headingIdGenerator,\n  he as headingKeymap,\n  w as headingSchema,\n  Se as hrAttr,\n  $ as hrSchema,\n  Ee as htmlAttr,\n  _e as htmlSchema,\n  Me as imageAttr,\n  O as imageSchema,\n  se as inlineCodeAttr,\n  ie as inlineCodeKeymap,\n  M as inlineCodeSchema,\n  kt as inlineNodesCursorPlugin,\n  P as inlineSyncConfig,\n  ut as inlineSyncPlugin,\n  $t as inputrules,\n  xe as insertHardbreakCommand,\n  lt as insertHrCommand,\n  st as insertHrInputRule,\n  nt as insertImageCommand,\n  Et as insertImageInputRule,\n  Wt as keymap,\n  De as liftListItemCommand,\n  ce as linkAttr,\n  v as linkSchema,\n  Oe as listItemAttr,\n  Re as listItemKeymap,\n  A as listItemSchema,\n  He as orderedListAttr,\n  Te as orderedListKeymap,\n  D as orderedListSchema,\n  de as paragraphAttr,\n  ue as paragraphKeymap,\n  S as paragraphSchema,\n  lr as plugins,\n  pt as remarkAddOrderInListPlugin,\n  yt as remarkHtmlTransformer,\n  ht as remarkInlineLinkPlugin,\n  gt as remarkLineBreak,\n  _t as schema,\n  Ke as sinkListItemCommand,\n  Pe as splitListItemCommand,\n  ae as strongAttr,\n  oe as strongKeymap,\n  j as strongSchema,\n  It as syncHeadingIdPlugin,\n  Ct as syncListOrderPlugin,\n  dt as textSchema,\n  te as toggleEmphasisCommand,\n  le as toggleInlineCodeCommand,\n  Xe as toggleLinkCommand,\n  ne as toggleStrongCommand,\n  me as turnIntoTextCommand,\n  Rt as updateCodeBlockLanguageCommand,\n  ot as updateImageCommand,\n  Ze as updateLinkCommand,\n  ke as wrapInBlockquoteCommand,\n  rt as wrapInBlockquoteInputRule,\n  Ae as wrapInBulletListCommand,\n  it as wrapInBulletListInputRule,\n  C as wrapInHeadingCommand,\n  tt as wrapInHeadingInputRule,\n  Be as wrapInOrderedListCommand,\n  ct as wrapInOrderedListInputRule\n};\n//# sourceMappingURL=index.es.js.map\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) {\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 ? [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","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  ie: ie,\n  ie_version: ie_version,\n  gecko: gecko,\n  gecko_version: gecko_version,\n  chrome: chrome,\n  chrome_version: chrome_version,\n  safari: safari,\n  ios: ios,\n  mac: mac,\n  android: android,\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\");\nconst 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) {\n  return new InputRule(regexp, (state, match, start, end) => {\n    const { tr } = state;\n    const matchLength = match.length;\n    let markStart = start;\n    let markEnd = end;\n    if (match[matchLength - 1]) {\n      const first = match[0];\n      const last = match[matchLength - 1];\n      const last1 = match[matchLength - 2];\n      const matchStart = start + first.indexOf(last1);\n      const matchEnd = matchStart + last1.length - 1;\n      const textStart = matchStart + last1.lastIndexOf(last);\n      const textEnd = textStart + last.length;\n      const excludedMarks = getMarksBetween(start, end, state).filter((item) => item.mark.type.excludes(markType)).filter((item) => item.end > matchStart);\n      if (excludedMarks.length)\n        return null;\n      if (textEnd < matchEnd)\n        tr.delete(textEnd, matchEnd);\n      if (textStart > matchStart)\n        tr.delete(matchStart, textStart);\n      markStart = matchStart;\n      markEnd = markStart + last.length;\n    }\n    tr.addMark(markStart, markEnd, markType.create());\n    tr.removeStoredMark(markType);\n    return tr;\n  });\n}\nfunction getMarksBetween(start, end, state) {\n  let marks = [];\n  state.doc.nodesBetween(start, end, (node, pos) => {\n    marks = [\n      ...marks,\n      ...node.marks.map((mark) => ({\n        start: pos,\n        end: pos + node.nodeSize,\n        mark\n      }))\n    ];\n  });\n  return marks;\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));\nconst 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};\nconst 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\nconst cloneTr = (tr) => {\n  return Object.assign(Object.create(tr), tr).setTime(Date.now());\n};\nconst equalNodeType = (nodeType, node) => {\n  return Array.isArray(nodeType) && nodeType.includes(node.type) || node.type === nodeType;\n};\n\nconst 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};\nconst findChildren = (predicate) => (node, descend) => flatten(node, descend).filter((child) => predicate(child.node));\nconst findChildrenByMark = (node, markType, descend) => findChildren((child) => Boolean(markType.isInSet(child.marks)))(node, descend);\n\nconst getNodeFromSchema = (type, schema) => {\n  const target = schema.nodes[type];\n  if (!target)\n    throw getAtomFromSchemaFail(\"node\", type);\n  return target;\n};\nconst getMarkFromSchema = (type, schema) => {\n  const target = schema.marks[type];\n  if (!target)\n    throw getAtomFromSchemaFail(\"mark\", type);\n  return target;\n};\n\nconst findParentNodeClosestToPos = (predicate) => ($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};\nconst findParentNode = (predicate) => (selection) => {\n  return findParentNodeClosestToPos(predicate)(selection.$from);\n};\nconst 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, 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 i = g({}), I = () => {\n  const { dom: t, editor: o, setLoading: e, editorFactory: r } = a(i), d = u(null);\n  return E(() => {\n    const n = d.current;\n    if (!r || !n)\n      return;\n    t.current = n;\n    const s = r(n);\n    if (!!s)\n      return e(!0), s.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]), d;\n}, 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), d = u(), [n, s] = f(!0), c = y(() => ({\n    loading: n,\n    dom: o,\n    editor: d,\n    setLoading: s,\n    editorFactory: e,\n    setEditorFactory: r\n  }), [n, e]);\n  return /* @__PURE__ */ l.createElement(i.Provider, { value: c }, t);\n}, k = (t, o = []) => {\n  const e = a(i), 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}, F = () => {\n  const t = a(i), 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","function r(e){var t,f,n=\"\";if(\"string\"==typeof e||\"number\"==typeof e)n+=e;else if(\"object\"==typeof e)if(Array.isArray(e))for(t=0;t<e.length;t++)e[t]&&(f=r(e[t]))&&(n&&(n+=\" \"),n+=f);else for(t in e)e[t]&&(n&&(n+=\" \"),n+=t);return n}export function clsx(){for(var e,t,f=0,n=\"\";f<arguments.length;)(e=arguments[f++])&&(t=r(e))&&(n&&(n+=\" \"),n+=t);return n}export default clsx;","import { editorViewOptionsCtx as n } from \"@milkdown/core\";\nimport i from \"clsx\";\nconst l = (s) => {\n  s.update(n, (r) => {\n    const o = r.attributes;\n    return {\n      ...r,\n      attributes: (e) => {\n        const t = typeof o == \"function\" ? o(e) : o;\n        return {\n          ...t,\n          class: i(\"prose dark:prose-invert outline-none\", (t == null ? void 0 : t.class) || \"\", \"milkdown-theme-nord\")\n        };\n      }\n    };\n  });\n};\nexport {\n  l as nord\n};\n//# sourceMappingURL=index.es.js.map\n","export { 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  crypto.getRandomValues(new Uint8Array(size)).reduce((id, byte) => {\n    byte &= 63\n    if (byte < 36) {\n      id += byte.toString(36)\n    } else if (byte < 62) {\n      id += (byte - 26).toString(36).toUpperCase()\n    } else if (byte > 62) {\n      id += '-'\n    } else {\n      id += '_'\n    }\n    return id\n  }, '')\n","import { createCmdKey as E, commandsTimerCtx as I, SchemaReady as p, commandsCtx as w, editorStateTimerCtx as b, inputRulesCtx as $, schemaTimerCtx as O, marksCtx as h, schemaCtx as f, nodesCtx as k, prosePluginsCtx as l, InitReady as M, remarkPluginsCtx as v, editorViewTimerCtx as D, nodeViewCtx as C, markViewCtx as T, editorViewCtx as g, serializerCtx as N, parserCtx as R, editorStateOptionsCtx as H } from \"@milkdown/core\";\nimport { createTimer as L, createSlice as F } from \"@milkdown/ctx\";\nimport { customAlphabet as U } from \"nanoid\";\nimport { missingMarkInSchema as j, missingNodeInSchema as z } from \"@milkdown/exception\";\nimport { keymap as K } from \"@milkdown/prose/keymap\";\nimport { NodeType as A, DOMSerializer as q, Slice as P } from \"@milkdown/prose/model\";\nimport { EditorState as B } from \"@milkdown/prose/state\";\nconst G = U(\"abcedfghicklmn\", 10), y = (t, s, n) => {\n  const r = L(n || G());\n  let e = !1;\n  const a = (o) => (o.record(r), o.update(s, (i) => i.concat(r)), async () => {\n    const m = await t(o, a, () => {\n      o.done(r), e = !0;\n    });\n    return e || o.done(r), () => {\n      o.update(s, (u) => u.filter((c) => c !== r)), o.clearTimer(r), m == null || m();\n    };\n  });\n  return a.timer = r, a;\n}, ne = (t, s) => {\n  const n = E(t), r = (e) => async () => {\n    r.key = n, await e.wait(p);\n    const a = s(e);\n    return e.get(w).create(n, a), r.run = (o) => e.get(w).call(t, o), () => {\n      e.get(w).remove(n);\n    };\n  };\n  return r;\n}, re = (t, s, n) => {\n  const r = E(t);\n  return y(\n    async (e, a) => {\n      await e.wait(p);\n      const o = await s(e);\n      return e.get(w).create(r, o), a.run = (i) => e.get(w).call(t, i), a.key = r, () => {\n        e.get(w).remove(r);\n      };\n    },\n    I,\n    n\n  );\n}, ae = (t) => {\n  const s = (n) => async () => {\n    await n.wait(p);\n    const r = t(n);\n    return n.update($, (e) => [...e, r]), s.inputRule = r, () => {\n      n.update($, (e) => e.filter((a) => a !== r));\n    };\n  };\n  return s;\n}, se = (t, s) => y(\n  async (n, r) => {\n    await n.wait(p);\n    const e = await t(n);\n    return n.update($, (a) => [...a, e]), r.inputRule = e, () => {\n      n.update($, (a) => a.filter((o) => o !== e));\n    };\n  },\n  b,\n  s\n), J = (t, s) => {\n  let n;\n  const r = (e) => async () => {\n    const a = s(e);\n    if (e.update(h, (o) => [...o.filter((i) => i[0] !== t), [t, a]]), r.id = t, r.schema = a, await e.wait(p), n = e.get(f).marks[t], !n)\n      throw j(t);\n    return () => {\n      e.update(h, (o) => o.filter(([i]) => i !== t));\n    };\n  };\n  return r.type = () => n, r;\n}, oe = (t, s, n) => {\n  let r;\n  const e = y(\n    async (a, o, i) => {\n      const m = await s(a);\n      if (a.update(h, (c) => [...c.filter((d) => d[0] !== t), [t, m]]), o.id = t, o.schema = m, i(), await a.wait(p), !a.get(f).marks[t])\n        throw j(t);\n      return () => {\n        a.update(h, (c) => c.filter(([d]) => d !== t));\n      };\n    },\n    O,\n    n\n  );\n  return e.type = () => r, e;\n}, Q = (t, s) => {\n  let n;\n  const r = (e) => async () => {\n    const a = s(e);\n    if (e.update(k, (o) => [...o.filter((i) => i[0] !== t), [t, a]]), r.id = t, r.schema = a, await e.wait(p), n = e.get(f).nodes[t], !n)\n      throw z(t);\n    return () => {\n      e.update(k, (o) => o.filter(([i]) => i !== t));\n    };\n  };\n  return r.type = () => n, r;\n}, ie = (t, s, n) => {\n  let r;\n  const e = y(\n    async (a, o, i) => {\n      const m = await s(a);\n      if (a.update(k, (u) => [...u.filter((c) => c[0] !== t), [t, m]]), o.id = t, o.schema = m, i(), await a.wait(p), r = a.get(f).nodes[t], !r)\n        throw z(t);\n      return () => {\n        a.update(k, (u) => u.filter(([c]) => c !== t));\n      };\n    },\n    O,\n    n\n  );\n  return e.type = () => r, e;\n}, ce = (t) => {\n  let s;\n  const n = (r) => async () => (await r.wait(p), s = t(r), r.update(l, (e) => [...e, s]), () => {\n    r.update(l, (e) => e.filter((a) => a !== s));\n  });\n  return n.plugin = () => s, n.key = () => s.spec.key, n;\n}, ue = (t, s) => {\n  let n;\n  const r = y(\n    async (e) => (await e.wait(p), n = await t(e), e.update(l, (a) => [...a, n]), () => {\n      e.update(l, (a) => a.filter((o) => o !== n));\n    }),\n    b,\n    s\n  );\n  return r.plugin = () => n, r.key = () => n.spec.key, r;\n}, me = (t) => {\n  const s = (n) => async () => {\n    await n.wait(M);\n    const r = t(n);\n    return n.update(v, (e) => [...e, r]), s.plugin = r, () => {\n      n.update(v, (e) => e.filter((a) => a !== r));\n    };\n  };\n  return s;\n}, pe = (t, s) => y(\n  async (n, r) => {\n    await n.wait(M);\n    const e = await t(n);\n    return n.update(v, (a) => [...a, e]), r.plugin = e, () => {\n      n.update(v, (a) => a.filter((o) => o !== e));\n    };\n  },\n  O,\n  s\n), W = (t) => {\n  const s = (n) => async () => {\n    await n.wait(p);\n    const r = t(n), e = K(r);\n    return n.update(l, (a) => [...a, e]), s.keymap = r, () => {\n      n.update(l, (a) => a.filter((o) => o !== e));\n    };\n  };\n  return s;\n}, le = (t, s) => y(\n  async (n, r) => {\n    await n.wait(p);\n    const e = await t(n), a = K(e);\n    return n.update(l, (o) => [...o, a]), r.keymap = e, () => {\n      n.update(l, (o) => o.filter((i) => i !== a));\n    };\n  },\n  b,\n  s\n), de = (t, s) => {\n  const n = (r) => async () => {\n    await r.wait(p);\n    const e = s(r);\n    return t.type() instanceof A ? r.update(C, (a) => [...a, [t.id, e]]) : r.update(T, (a) => [...a, [t.id, e]]), n.view = e, n.type = t, () => {\n      t.type() instanceof A ? r.update(C, (a) => a.filter((o) => o[0] !== t.id)) : r.update(T, (a) => a.filter((o) => o[0] !== t.id));\n    };\n  };\n  return n;\n}, ye = (t, s, n) => y(\n  async (r, e) => {\n    await r.wait(p);\n    const a = await s(r);\n    return t.type() instanceof A ? r.update(C, (o) => [...o, [t.id, a]]) : r.update(T, (o) => [...o, [t.id, a]]), e.view = a, e.type = t, () => {\n      t.type() instanceof A ? r.update(C, (o) => o.filter((i) => i[0] !== t.id)) : r.update(T, (o) => o.filter((i) => i[0] !== t.id));\n    };\n  },\n  D,\n  n\n), S = (t, s) => {\n  const n = F(t, s), r = (e) => (e.inject(n), () => () => {\n    e.remove(n);\n  });\n  return r.key = n, r;\n}, we = (t, s) => {\n  const n = S(s, t), r = Q(t, (a) => a.get(n.key)(a)), e = [n, r];\n  return e.id = r.id, e.node = r, e.type = r.type, e.schema = r.schema, e.ctx = n, e.key = n.key, e.extendSchema = (a) => (o) => () => {\n    const i = o.get(n.key), u = a(i)(o);\n    o.update(k, (c) => [...c.filter((d) => d[0] !== t), [t, u]]), e.schema = u;\n  }, e;\n}, ge = (t, s) => {\n  const n = S(s, t), r = J(t, (a) => a.get(n.key)(a)), e = [n, r];\n  return e.id = r.id, e.mark = r, e.type = r.type, e.schema = r.schema, e.ctx = n, e.key = n.key, e.extendSchema = (a) => (o) => () => {\n    const i = o.get(n.key), u = a(i)(o);\n    o.update(h, (c) => [...c.filter((d) => d[0] !== t), [t, u]]), e.schema = u;\n  }, e;\n}, fe = (t, s) => {\n  const n = Object.fromEntries(Object.entries(s).map(([o, { shortcuts: i }]) => [o, i])), r = S(n, `${t}Keymap`), e = W((o) => {\n    const i = o.get(r.key), m = Object.entries(s).flatMap(([u, { command: c }]) => [i[u]].flat().map((V) => [V, c(o)]));\n    return Object.fromEntries(m);\n  }), a = [r, e];\n  return a.ctx = r, a.shortcuts = e, a.key = r.key, a.keymap = e.keymap, a;\n}, he = (t, s = () => ({})) => S(s, `${t}Attr`), ke = (t, s = () => ({})) => S(s, `${t}Attr`);\nfunction Se(t, s) {\n  return (n) => n.get(w).call(t, s);\n}\nconst $e = () => (t) => {\n  const s = t.get(g), { tr: n } = s.state, r = Object.assign(Object.create(n), n).setTime(Date.now());\n  return s.dispatch(r);\n}, ve = () => (t) => {\n  const s = document.createElement(\"div\"), n = t.get(f), r = t.get(g), e = q.fromSchema(n).serializeFragment(r.state.doc.content);\n  return s.appendChild(e), s.innerHTML;\n}, Ce = () => (t) => {\n  const s = t.get(g);\n  return t.get(N)(s.state.doc);\n}, Te = (t) => (s) => {\n  const n = s.get(g), e = s.get(R)(t);\n  if (!e)\n    return;\n  const a = n.state.selection.content();\n  return n.dispatch(\n    n.state.tr.replaceSelection(new P(e.content, a.openStart, a.openEnd)).scrollIntoView()\n  );\n}, Ae = () => (t) => {\n  const s = t.get(g), n = [];\n  return s.state.doc.descendants((e) => {\n    e.type.name === \"heading\" && e.attrs.level && n.push({ text: e.textContent, level: e.attrs.level, id: e.attrs.id });\n  }), n;\n}, be = (t, s = !1) => (n) => {\n  const r = n.get(g), a = n.get(R)(t);\n  if (!a)\n    return;\n  if (!s) {\n    const { state: c } = r;\n    return r.dispatch(c.tr.replace(0, c.doc.content.size, new P(a.content, 0, 0)));\n  }\n  const o = n.get(f), i = n.get(H), m = n.get(l), u = B.create({\n    schema: o,\n    doc: a,\n    plugins: m,\n    ...i\n  });\n  r.updateState(u);\n}, Oe = (t, s) => (n) => {\n  const r = n.get(g), { tr: e } = r.state, a = e.doc.nodeAt(t);\n  if (!a)\n    return;\n  const o = s(a.attrs);\n  return r.dispatch(e.setNodeMarkup(t, void 0, o));\n}, Ee = (...t) => {\n  const s = t.length;\n  let n = s;\n  for (; n--; )\n    if (typeof t[n] != \"function\")\n      throw new TypeError(\"Expected a function\");\n  return (...r) => {\n    let e = 0, a = s ? t[e](...r) : r[0];\n    for (; ++e < s; )\n      a = t[e](a);\n    return a;\n  };\n};\nexport {\n  ne as $command,\n  re as $commandAsync,\n  S as $ctx,\n  ae as $inputRule,\n  se as $inputRuleAsync,\n  J as $mark,\n  oe as $markAsync,\n  ke as $markAttr,\n  ge as $markSchema,\n  Q as $node,\n  ie as $nodeAsync,\n  he as $nodeAttr,\n  we as $nodeSchema,\n  ce as $prose,\n  ue as $proseAsync,\n  me as $remark,\n  pe as $remarkAsync,\n  W as $shortcut,\n  le as $shortcutAsync,\n  fe as $useKeymap,\n  de as $view,\n  ye as $viewAsync,\n  y as addTimer,\n  Se as callCommand,\n  $e as forceUpdate,\n  ve as getHTML,\n  Ce as getMarkdown,\n  Te as insert,\n  G as nanoid,\n  Ae as outline,\n  Ee as pipe,\n  be as replaceAll,\n  Oe as setAttr\n};\n//# sourceMappingURL=index.es.js.map\n","import _asyncToGenerator from \"@babel/runtime/helpers/asyncToGenerator\";\nimport { http } from \"@next-core/http\";\n/**\n * @description 上传对象\n * @endpoint PUT /api/v1/objectStore/bucket/:bucketName/object\n */\nexport var ObjectStoreApi_putObject = /*#__PURE__*/function () {\n  var _ref = _asyncToGenerator(function* (bucketName, data, options) {\n    /**! @contract easyops.api.object_store.object_store.PutObject@1.0.0 */var _formData = new FormData();\n    var _loop = function* () {\n      if (Array.isArray(value)) {\n        var k = \"\".concat(key, \"[]\");\n        value.forEach(v => {\n          _formData.append(k, v);\n        });\n      } else {\n        _formData.append(key, value);\n      }\n    };\n    for (var [key, value] of Object.entries(data)) {\n      yield* _loop();\n    }\n    return (yield http.put(\"api/gateway/object_store.object_store.PutObject/api/v1/objectStore/bucket/\".concat(bucketName, \"/object\"), _formData, options)).data;\n  });\n  return function ObjectStoreApi_putObject(_x, _x2, _x3) {\n    return _ref.apply(this, arguments);\n  };\n}();\n//# sourceMappingURL=putObject.js.map","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","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 chrome = typeof navigator != \"undefined\" && /Chrome\\/(\\d+)/.exec(navigator.userAgent)\nvar gecko = typeof navigator != \"undefined\" && /Gecko\\/\\d+/.test(navigator.userAgent)\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)\nvar brokenModifierNames = mac || chrome && +chrome[1] < 57\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  var ignoreKey = brokenModifierNames && (event.ctrlKey || event.altKey || event.metaKey) ||\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 = \"\", separated = true;\n        this.nodesBetween(from, to, (node, pos) => {\n            if (node.isText) {\n                text += node.text.slice(Math.max(from, pos) - pos, to - pos);\n                separated = !blockSeparator;\n            }\n            else if (node.isLeaf) {\n                if (leafText) {\n                    text += typeof leafText === \"function\" ? leafText(node) : leafText;\n                }\n                else if (node.type.spec.leafText) {\n                    text += node.type.spec.leafText(node);\n                }\n                separated = !blockSeparator;\n            }\n            else if (!separated && node.isBlock) {\n                text += blockSeparator;\n                separated = true;\n            }\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        }\n        else if (dom.nodeType == 1) {\n            let style = dom.getAttribute(\"style\");\n            if (!style) {\n                this.addElement(dom);\n            }\n            else {\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                this.addElement(dom);\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        }\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            this.addAll(dom);\n            if (sync)\n                this.sync(top);\n            this.needsBlock = oldNeedsBlock;\n        }\n        else {\n            this.addElementByRule(dom, rule, rule.consuming === false ? ruleID : undefined);\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 delSteps = [], 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            delSteps.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        }\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 = delSteps.length - 1; i >= 0; i--)\n        tr.step(delSteps[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 after = (typesAfter && typesAfter[i]) || node;\n        if (after != node)\n            rest = rest.replaceChild(0, after.type.create(after.attrs));\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 type = leftNodes[d].type, def = definesContent(type);\n        if (def && $from.node(preferredTargetIndex).type != type)\n            preferredDepth = d;\n        else if (def || !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\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    */\n    setNodeAttribute(pos, attr, value) {\n        this.step(new AttrStep(pos, 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, MapResult, Mapping, RemoveMarkStep, RemoveNodeMarkStep, ReplaceAroundStep, ReplaceStep, Step, StepMap, StepResult, Transform, TransformError, canJoin, canSplit, dropPoint, findWrapping, insertPoint, joinPoint, liftTarget, replaceStep };\n","import { TextSelection, NodeSelection, Selection, AllSelection } from 'prosemirror-state';\nimport { DOMSerializer, Fragment, Mark, Slice, DOMParser } from 'prosemirror-model';\nimport { dropPoint } from 'prosemirror-transform';\n\nconst domIndex = function (node) {\n    for (var index = 0;; index++) {\n        node = node.previousSibling;\n        if (!node)\n            return index;\n    }\n};\nconst parentNode = function (node) {\n    let parent = node.assignedSlot || node.parentNode;\n    return parent && parent.nodeType == 11 ? parent.host : parent;\n};\nlet reusedRange = null;\n// Note that this will always return the same range, because DOM range\n// objects are every expensive, and keep slowing down subsequent DOM\n// updates, for some reason.\nconst textRange = function (node, from, to) {\n    let range = reusedRange || (reusedRange = document.createRange());\n    range.setEnd(node, to == null ? node.nodeValue.length : to);\n    range.setStart(node, from || 0);\n    return range;\n};\n// Scans forward and backward through DOM positions equivalent to the\n// given one to see if the two are in the same place (i.e. after a\n// text node vs at the end of that text node)\nconst isEquivalentPosition = function (node, off, targetNode, targetOff) {\n    return targetNode && (scanFor(node, off, targetNode, targetOff, -1) ||\n        scanFor(node, off, targetNode, targetOff, 1));\n};\nconst atomElements = /^(img|br|input|textarea|hr)$/i;\nfunction scanFor(node, off, targetNode, targetOff, dir) {\n    for (;;) {\n        if (node == targetNode && off == targetOff)\n            return true;\n        if (off == (dir < 0 ? 0 : nodeSize(node))) {\n            let parent = node.parentNode;\n            if (!parent || parent.nodeType != 1 || hasBlockDesc(node) || atomElements.test(node.nodeName) ||\n                node.contentEditable == \"false\")\n                return false;\n            off = domIndex(node) + (dir < 0 ? 0 : 1);\n            node = parent;\n        }\n        else if (node.nodeType == 1) {\n            node = node.childNodes[off + (dir < 0 ? -1 : 0)];\n            if (node.contentEditable == \"false\")\n                return false;\n            off = dir < 0 ? nodeSize(node) : 0;\n        }\n        else {\n            return false;\n        }\n    }\n}\nfunction nodeSize(node) {\n    return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length;\n}\nfunction isOnEdge(node, offset, parent) {\n    for (let atStart = offset == 0, atEnd = offset == nodeSize(node); atStart || atEnd;) {\n        if (node == parent)\n            return true;\n        let index = domIndex(node);\n        node = node.parentNode;\n        if (!node)\n            return false;\n        atStart = atStart && index == 0;\n        atEnd = atEnd && index == nodeSize(node);\n    }\n}\nfunction hasBlockDesc(dom) {\n    let desc;\n    for (let cur = dom; cur; cur = cur.parentNode)\n        if (desc = cur.pmViewDesc)\n            break;\n    return desc && desc.node && desc.node.isBlock && (desc.dom == dom || desc.contentDOM == dom);\n}\n// Work around Chrome issue https://bugs.chromium.org/p/chromium/issues/detail?id=447523\n// (isCollapsed inappropriately returns true in shadow dom)\nconst selectionCollapsed = function (domSel) {\n    return domSel.focusNode && isEquivalentPosition(domSel.focusNode, domSel.focusOffset, domSel.anchorNode, domSel.anchorOffset);\n};\nfunction keyEvent(keyCode, key) {\n    let event = document.createEvent(\"Event\");\n    event.initEvent(\"keydown\", true, true);\n    event.keyCode = keyCode;\n    event.key = event.code = key;\n    return event;\n}\nfunction deepActiveElement(doc) {\n    let elt = doc.activeElement;\n    while (elt && elt.shadowRoot)\n        elt = elt.shadowRoot.activeElement;\n    return elt;\n}\nfunction caretFromPoint(doc, x, y) {\n    if (doc.caretPositionFromPoint) {\n        try { // Firefox throws for this call in hard-to-predict circumstances (#994)\n            let pos = doc.caretPositionFromPoint(x, y);\n            if (pos)\n                return { node: pos.offsetNode, offset: pos.offset };\n        }\n        catch (_) { }\n    }\n    if (doc.caretRangeFromPoint) {\n        let range = doc.caretRangeFromPoint(x, y);\n        if (range)\n            return { node: range.startContainer, offset: range.startOffset };\n    }\n}\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);\ngecko && +(/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);\n// Is true for both iOS and iPadOS for convenience\nconst ios = safari && (/Mobile\\/\\w+/.test(agent) || !!nav && nav.maxTouchPoints > 2);\nconst mac = ios || (nav ? /Mac/.test(nav.platform) : false);\nconst windows = nav ? /Win/.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\nfunction windowRect(doc) {\n    return { left: 0, right: doc.documentElement.clientWidth,\n        top: 0, bottom: doc.documentElement.clientHeight };\n}\nfunction getSide(value, side) {\n    return typeof value == \"number\" ? value : value[side];\n}\nfunction clientRect(node) {\n    let rect = node.getBoundingClientRect();\n    // Adjust for elements with style \"transform: scale()\"\n    let scaleX = (rect.width / node.offsetWidth) || 1;\n    let scaleY = (rect.height / node.offsetHeight) || 1;\n    // Make sure scrollbar width isn't included in the rectangle\n    return { left: rect.left, right: rect.left + node.clientWidth * scaleX,\n        top: rect.top, bottom: rect.top + node.clientHeight * scaleY };\n}\nfunction scrollRectIntoView(view, rect, startDOM) {\n    let scrollThreshold = view.someProp(\"scrollThreshold\") || 0, scrollMargin = view.someProp(\"scrollMargin\") || 5;\n    let doc = view.dom.ownerDocument;\n    for (let parent = startDOM || view.dom;; parent = parentNode(parent)) {\n        if (!parent)\n            break;\n        if (parent.nodeType != 1)\n            continue;\n        let elt = parent;\n        let atTop = elt == doc.body;\n        let bounding = atTop ? windowRect(doc) : clientRect(elt);\n        let moveX = 0, moveY = 0;\n        if (rect.top < bounding.top + getSide(scrollThreshold, \"top\"))\n            moveY = -(bounding.top - rect.top + getSide(scrollMargin, \"top\"));\n        else if (rect.bottom > bounding.bottom - getSide(scrollThreshold, \"bottom\"))\n            moveY = rect.bottom - bounding.bottom + getSide(scrollMargin, \"bottom\");\n        if (rect.left < bounding.left + getSide(scrollThreshold, \"left\"))\n            moveX = -(bounding.left - rect.left + getSide(scrollMargin, \"left\"));\n        else if (rect.right > bounding.right - getSide(scrollThreshold, \"right\"))\n            moveX = rect.right - bounding.right + getSide(scrollMargin, \"right\");\n        if (moveX || moveY) {\n            if (atTop) {\n                doc.defaultView.scrollBy(moveX, moveY);\n            }\n            else {\n                let startX = elt.scrollLeft, startY = elt.scrollTop;\n                if (moveY)\n                    elt.scrollTop += moveY;\n                if (moveX)\n                    elt.scrollLeft += moveX;\n                let dX = elt.scrollLeft - startX, dY = elt.scrollTop - startY;\n                rect = { left: rect.left - dX, top: rect.top - dY, right: rect.right - dX, bottom: rect.bottom - dY };\n            }\n        }\n        if (atTop)\n            break;\n    }\n}\n// Store the scroll position of the editor's parent nodes, along with\n// the top position of an element near the top of the editor, which\n// will be used to make sure the visible viewport remains stable even\n// when the size of the content above changes.\nfunction storeScrollPos(view) {\n    let rect = view.dom.getBoundingClientRect(), startY = Math.max(0, rect.top);\n    let refDOM, refTop;\n    for (let x = (rect.left + rect.right) / 2, y = startY + 1; y < Math.min(innerHeight, rect.bottom); y += 5) {\n        let dom = view.root.elementFromPoint(x, y);\n        if (!dom || dom == view.dom || !view.dom.contains(dom))\n            continue;\n        let localRect = dom.getBoundingClientRect();\n        if (localRect.top >= startY - 20) {\n            refDOM = dom;\n            refTop = localRect.top;\n            break;\n        }\n    }\n    return { refDOM: refDOM, refTop: refTop, stack: scrollStack(view.dom) };\n}\nfunction scrollStack(dom) {\n    let stack = [], doc = dom.ownerDocument;\n    for (let cur = dom; cur; cur = parentNode(cur)) {\n        stack.push({ dom: cur, top: cur.scrollTop, left: cur.scrollLeft });\n        if (dom == doc)\n            break;\n    }\n    return stack;\n}\n// Reset the scroll position of the editor's parent nodes to that what\n// it was before, when storeScrollPos was called.\nfunction resetScrollPos({ refDOM, refTop, stack }) {\n    let newRefTop = refDOM ? refDOM.getBoundingClientRect().top : 0;\n    restoreScrollStack(stack, newRefTop == 0 ? 0 : newRefTop - refTop);\n}\nfunction restoreScrollStack(stack, dTop) {\n    for (let i = 0; i < stack.length; i++) {\n        let { dom, top, left } = stack[i];\n        if (dom.scrollTop != top + dTop)\n            dom.scrollTop = top + dTop;\n        if (dom.scrollLeft != left)\n            dom.scrollLeft = left;\n    }\n}\nlet preventScrollSupported = null;\n// Feature-detects support for .focus({preventScroll: true}), and uses\n// a fallback kludge when not supported.\nfunction focusPreventScroll(dom) {\n    if (dom.setActive)\n        return dom.setActive(); // in IE\n    if (preventScrollSupported)\n        return dom.focus(preventScrollSupported);\n    let stored = scrollStack(dom);\n    dom.focus(preventScrollSupported == null ? {\n        get preventScroll() {\n            preventScrollSupported = { preventScroll: true };\n            return true;\n        }\n    } : undefined);\n    if (!preventScrollSupported) {\n        preventScrollSupported = false;\n        restoreScrollStack(stored, 0);\n    }\n}\nfunction findOffsetInNode(node, coords) {\n    let closest, dxClosest = 2e8, coordsClosest, offset = 0;\n    let rowBot = coords.top, rowTop = coords.top;\n    let firstBelow, coordsBelow;\n    for (let child = node.firstChild, childIndex = 0; child; child = child.nextSibling, childIndex++) {\n        let rects;\n        if (child.nodeType == 1)\n            rects = child.getClientRects();\n        else if (child.nodeType == 3)\n            rects = textRange(child).getClientRects();\n        else\n            continue;\n        for (let i = 0; i < rects.length; i++) {\n            let rect = rects[i];\n            if (rect.top <= rowBot && rect.bottom >= rowTop) {\n                rowBot = Math.max(rect.bottom, rowBot);\n                rowTop = Math.min(rect.top, rowTop);\n                let dx = rect.left > coords.left ? rect.left - coords.left\n                    : rect.right < coords.left ? coords.left - rect.right : 0;\n                if (dx < dxClosest) {\n                    closest = child;\n                    dxClosest = dx;\n                    coordsClosest = dx && closest.nodeType == 3 ? {\n                        left: rect.right < coords.left ? rect.right : rect.left,\n                        top: coords.top\n                    } : coords;\n                    if (child.nodeType == 1 && dx)\n                        offset = childIndex + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0);\n                    continue;\n                }\n            }\n            else if (rect.top > coords.top && !firstBelow && rect.left <= coords.left && rect.right >= coords.left) {\n                firstBelow = child;\n                coordsBelow = { left: Math.max(rect.left, Math.min(rect.right, coords.left)), top: rect.top };\n            }\n            if (!closest && (coords.left >= rect.right && coords.top >= rect.top ||\n                coords.left >= rect.left && coords.top >= rect.bottom))\n                offset = childIndex + 1;\n        }\n    }\n    if (!closest && firstBelow) {\n        closest = firstBelow;\n        coordsClosest = coordsBelow;\n        dxClosest = 0;\n    }\n    if (closest && closest.nodeType == 3)\n        return findOffsetInText(closest, coordsClosest);\n    if (!closest || (dxClosest && closest.nodeType == 1))\n        return { node, offset };\n    return findOffsetInNode(closest, coordsClosest);\n}\nfunction findOffsetInText(node, coords) {\n    let len = node.nodeValue.length;\n    let range = document.createRange();\n    for (let i = 0; i < len; i++) {\n        range.setEnd(node, i + 1);\n        range.setStart(node, i);\n        let rect = singleRect(range, 1);\n        if (rect.top == rect.bottom)\n            continue;\n        if (inRect(coords, rect))\n            return { node, offset: i + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0) };\n    }\n    return { node, offset: 0 };\n}\nfunction inRect(coords, rect) {\n    return coords.left >= rect.left - 1 && coords.left <= rect.right + 1 &&\n        coords.top >= rect.top - 1 && coords.top <= rect.bottom + 1;\n}\nfunction targetKludge(dom, coords) {\n    let parent = dom.parentNode;\n    if (parent && /^li$/i.test(parent.nodeName) && coords.left < dom.getBoundingClientRect().left)\n        return parent;\n    return dom;\n}\nfunction posFromElement(view, elt, coords) {\n    let { node, offset } = findOffsetInNode(elt, coords), bias = -1;\n    if (node.nodeType == 1 && !node.firstChild) {\n        let rect = node.getBoundingClientRect();\n        bias = rect.left != rect.right && coords.left > (rect.left + rect.right) / 2 ? 1 : -1;\n    }\n    return view.docView.posFromDOM(node, offset, bias);\n}\nfunction posFromCaret(view, node, offset, coords) {\n    // Browser (in caretPosition/RangeFromPoint) will agressively\n    // normalize towards nearby inline nodes. Since we are interested in\n    // positions between block nodes too, we first walk up the hierarchy\n    // of nodes to see if there are block nodes that the coordinates\n    // fall outside of. If so, we take the position before/after that\n    // block. If not, we call `posFromDOM` on the raw node/offset.\n    let outsideBlock = -1;\n    for (let cur = node, sawBlock = false;;) {\n        if (cur == view.dom)\n            break;\n        let desc = view.docView.nearestDesc(cur, true);\n        if (!desc)\n            return null;\n        if (desc.dom.nodeType == 1 && (desc.node.isBlock && desc.parent && !sawBlock || !desc.contentDOM)) {\n            let rect = desc.dom.getBoundingClientRect();\n            if (desc.node.isBlock && desc.parent && !sawBlock) {\n                sawBlock = true;\n                if (rect.left > coords.left || rect.top > coords.top)\n                    outsideBlock = desc.posBefore;\n                else if (rect.right < coords.left || rect.bottom < coords.top)\n                    outsideBlock = desc.posAfter;\n            }\n            if (!desc.contentDOM && outsideBlock < 0) {\n                // If we are inside a leaf, return the side of the leaf closer to the coords\n                let before = desc.node.isBlock ? coords.top < (rect.top + rect.bottom) / 2\n                    : coords.left < (rect.left + rect.right) / 2;\n                return before ? desc.posBefore : desc.posAfter;\n            }\n        }\n        cur = desc.dom.parentNode;\n    }\n    return outsideBlock > -1 ? outsideBlock : view.docView.posFromDOM(node, offset, -1);\n}\nfunction elementFromPoint(element, coords, box) {\n    let len = element.childNodes.length;\n    if (len && box.top < box.bottom) {\n        for (let startI = Math.max(0, Math.min(len - 1, Math.floor(len * (coords.top - box.top) / (box.bottom - box.top)) - 2)), i = startI;;) {\n            let child = element.childNodes[i];\n            if (child.nodeType == 1) {\n                let rects = child.getClientRects();\n                for (let j = 0; j < rects.length; j++) {\n                    let rect = rects[j];\n                    if (inRect(coords, rect))\n                        return elementFromPoint(child, coords, rect);\n                }\n            }\n            if ((i = (i + 1) % len) == startI)\n                break;\n        }\n    }\n    return element;\n}\n// Given an x,y position on the editor, get the position in the document.\nfunction posAtCoords(view, coords) {\n    let doc = view.dom.ownerDocument, node, offset = 0;\n    let caret = caretFromPoint(doc, coords.left, coords.top);\n    if (caret)\n        ({ node, offset } = caret);\n    let elt = (view.root.elementFromPoint ? view.root : doc)\n        .elementFromPoint(coords.left, coords.top);\n    let pos;\n    if (!elt || !view.dom.contains(elt.nodeType != 1 ? elt.parentNode : elt)) {\n        let box = view.dom.getBoundingClientRect();\n        if (!inRect(coords, box))\n            return null;\n        elt = elementFromPoint(view.dom, coords, box);\n        if (!elt)\n            return null;\n    }\n    // Safari's caretRangeFromPoint returns nonsense when on a draggable element\n    if (safari) {\n        for (let p = elt; node && p; p = parentNode(p))\n            if (p.draggable)\n                node = undefined;\n    }\n    elt = targetKludge(elt, coords);\n    if (node) {\n        if (gecko && node.nodeType == 1) {\n            // Firefox will sometimes return offsets into <input> nodes, which\n            // have no actual children, from caretPositionFromPoint (#953)\n            offset = Math.min(offset, node.childNodes.length);\n            // It'll also move the returned position before image nodes,\n            // even if those are behind it.\n            if (offset < node.childNodes.length) {\n                let next = node.childNodes[offset], box;\n                if (next.nodeName == \"IMG\" && (box = next.getBoundingClientRect()).right <= coords.left &&\n                    box.bottom > coords.top)\n                    offset++;\n            }\n        }\n        // Suspiciously specific kludge to work around caret*FromPoint\n        // never returning a position at the end of the document\n        if (node == view.dom && offset == node.childNodes.length - 1 && node.lastChild.nodeType == 1 &&\n            coords.top > node.lastChild.getBoundingClientRect().bottom)\n            pos = view.state.doc.content.size;\n        // Ignore positions directly after a BR, since caret*FromPoint\n        // 'round up' positions that would be more accurately placed\n        // before the BR node.\n        else if (offset == 0 || node.nodeType != 1 || node.childNodes[offset - 1].nodeName != \"BR\")\n            pos = posFromCaret(view, node, offset, coords);\n    }\n    if (pos == null)\n        pos = posFromElement(view, elt, coords);\n    let desc = view.docView.nearestDesc(elt, true);\n    return { pos, inside: desc ? desc.posAtStart - desc.border : -1 };\n}\nfunction nonZero(rect) {\n    return rect.top < rect.bottom || rect.left < rect.right;\n}\nfunction singleRect(target, bias) {\n    let rects = target.getClientRects();\n    if (rects.length) {\n        let first = rects[bias < 0 ? 0 : rects.length - 1];\n        if (nonZero(first))\n            return first;\n    }\n    return Array.prototype.find.call(rects, nonZero) || target.getBoundingClientRect();\n}\nconst BIDI = /[\\u0590-\\u05f4\\u0600-\\u06ff\\u0700-\\u08ac]/;\n// Given a position in the document model, get a bounding box of the\n// character at that position, relative to the window.\nfunction coordsAtPos(view, pos, side) {\n    let { node, offset, atom } = view.docView.domFromPos(pos, side < 0 ? -1 : 1);\n    let supportEmptyRange = webkit || gecko;\n    if (node.nodeType == 3) {\n        // These browsers support querying empty text ranges. Prefer that in\n        // bidi context or when at the end of a node.\n        if (supportEmptyRange && (BIDI.test(node.nodeValue) || (side < 0 ? !offset : offset == node.nodeValue.length))) {\n            let rect = singleRect(textRange(node, offset, offset), side);\n            // Firefox returns bad results (the position before the space)\n            // when querying a position directly after line-broken\n            // whitespace. Detect this situation and and kludge around it\n            if (gecko && offset && /\\s/.test(node.nodeValue[offset - 1]) && offset < node.nodeValue.length) {\n                let rectBefore = singleRect(textRange(node, offset - 1, offset - 1), -1);\n                if (rectBefore.top == rect.top) {\n                    let rectAfter = singleRect(textRange(node, offset, offset + 1), -1);\n                    if (rectAfter.top != rect.top)\n                        return flattenV(rectAfter, rectAfter.left < rectBefore.left);\n                }\n            }\n            return rect;\n        }\n        else {\n            let from = offset, to = offset, takeSide = side < 0 ? 1 : -1;\n            if (side < 0 && !offset) {\n                to++;\n                takeSide = -1;\n            }\n            else if (side >= 0 && offset == node.nodeValue.length) {\n                from--;\n                takeSide = 1;\n            }\n            else if (side < 0) {\n                from--;\n            }\n            else {\n                to++;\n            }\n            return flattenV(singleRect(textRange(node, from, to), takeSide), takeSide < 0);\n        }\n    }\n    let $dom = view.state.doc.resolve(pos - (atom || 0));\n    // Return a horizontal line in block context\n    if (!$dom.parent.inlineContent) {\n        if (atom == null && offset && (side < 0 || offset == nodeSize(node))) {\n            let before = node.childNodes[offset - 1];\n            if (before.nodeType == 1)\n                return flattenH(before.getBoundingClientRect(), false);\n        }\n        if (atom == null && offset < nodeSize(node)) {\n            let after = node.childNodes[offset];\n            if (after.nodeType == 1)\n                return flattenH(after.getBoundingClientRect(), true);\n        }\n        return flattenH(node.getBoundingClientRect(), side >= 0);\n    }\n    // Inline, not in text node (this is not Bidi-safe)\n    if (atom == null && offset && (side < 0 || offset == nodeSize(node))) {\n        let before = node.childNodes[offset - 1];\n        let target = before.nodeType == 3 ? textRange(before, nodeSize(before) - (supportEmptyRange ? 0 : 1))\n            // BR nodes tend to only return the rectangle before them.\n            // Only use them if they are the last element in their parent\n            : before.nodeType == 1 && (before.nodeName != \"BR\" || !before.nextSibling) ? before : null;\n        if (target)\n            return flattenV(singleRect(target, 1), false);\n    }\n    if (atom == null && offset < nodeSize(node)) {\n        let after = node.childNodes[offset];\n        while (after.pmViewDesc && after.pmViewDesc.ignoreForCoords)\n            after = after.nextSibling;\n        let target = !after ? null : after.nodeType == 3 ? textRange(after, 0, (supportEmptyRange ? 0 : 1))\n            : after.nodeType == 1 ? after : null;\n        if (target)\n            return flattenV(singleRect(target, -1), true);\n    }\n    // All else failed, just try to get a rectangle for the target node\n    return flattenV(singleRect(node.nodeType == 3 ? textRange(node) : node, -side), side >= 0);\n}\nfunction flattenV(rect, left) {\n    if (rect.width == 0)\n        return rect;\n    let x = left ? rect.left : rect.right;\n    return { top: rect.top, bottom: rect.bottom, left: x, right: x };\n}\nfunction flattenH(rect, top) {\n    if (rect.height == 0)\n        return rect;\n    let y = top ? rect.top : rect.bottom;\n    return { top: y, bottom: y, left: rect.left, right: rect.right };\n}\nfunction withFlushedState(view, state, f) {\n    let viewState = view.state, active = view.root.activeElement;\n    if (viewState != state)\n        view.updateState(state);\n    if (active != view.dom)\n        view.focus();\n    try {\n        return f();\n    }\n    finally {\n        if (viewState != state)\n            view.updateState(viewState);\n        if (active != view.dom && active)\n            active.focus();\n    }\n}\n// Whether vertical position motion in a given direction\n// from a position would leave a text block.\nfunction endOfTextblockVertical(view, state, dir) {\n    let sel = state.selection;\n    let $pos = dir == \"up\" ? sel.$from : sel.$to;\n    return withFlushedState(view, state, () => {\n        let { node: dom } = view.docView.domFromPos($pos.pos, dir == \"up\" ? -1 : 1);\n        for (;;) {\n            let nearest = view.docView.nearestDesc(dom, true);\n            if (!nearest)\n                break;\n            if (nearest.node.isBlock) {\n                dom = nearest.contentDOM || nearest.dom;\n                break;\n            }\n            dom = nearest.dom.parentNode;\n        }\n        let coords = coordsAtPos(view, $pos.pos, 1);\n        for (let child = dom.firstChild; child; child = child.nextSibling) {\n            let boxes;\n            if (child.nodeType == 1)\n                boxes = child.getClientRects();\n            else if (child.nodeType == 3)\n                boxes = textRange(child, 0, child.nodeValue.length).getClientRects();\n            else\n                continue;\n            for (let i = 0; i < boxes.length; i++) {\n                let box = boxes[i];\n                if (box.bottom > box.top + 1 &&\n                    (dir == \"up\" ? coords.top - box.top > (box.bottom - coords.top) * 2\n                        : box.bottom - coords.bottom > (coords.bottom - box.top) * 2))\n                    return false;\n            }\n        }\n        return true;\n    });\n}\nconst maybeRTL = /[\\u0590-\\u08ac]/;\nfunction endOfTextblockHorizontal(view, state, dir) {\n    let { $head } = state.selection;\n    if (!$head.parent.isTextblock)\n        return false;\n    let offset = $head.parentOffset, atStart = !offset, atEnd = offset == $head.parent.content.size;\n    let sel = view.domSelection();\n    // If the textblock is all LTR, or the browser doesn't support\n    // Selection.modify (Edge), fall back to a primitive approach\n    if (!maybeRTL.test($head.parent.textContent) || !sel.modify)\n        return dir == \"left\" || dir == \"backward\" ? atStart : atEnd;\n    return withFlushedState(view, state, () => {\n        // This is a huge hack, but appears to be the best we can\n        // currently do: use `Selection.modify` to move the selection by\n        // one character, and see if that moves the cursor out of the\n        // textblock (or doesn't move it at all, when at the start/end of\n        // the document).\n        let { focusNode: oldNode, focusOffset: oldOff, anchorNode, anchorOffset } = view.domSelectionRange();\n        let oldBidiLevel = sel.caretBidiLevel // Only for Firefox\n        ;\n        sel.modify(\"move\", dir, \"character\");\n        let parentDOM = $head.depth ? view.docView.domAfterPos($head.before()) : view.dom;\n        let { focusNode: newNode, focusOffset: newOff } = view.domSelectionRange();\n        let result = newNode && !parentDOM.contains(newNode.nodeType == 1 ? newNode : newNode.parentNode) ||\n            (oldNode == newNode && oldOff == newOff);\n        // Restore the previous selection\n        try {\n            sel.collapse(anchorNode, anchorOffset);\n            if (oldNode && (oldNode != anchorNode || oldOff != anchorOffset) && sel.extend)\n                sel.extend(oldNode, oldOff);\n        }\n        catch (_) { }\n        if (oldBidiLevel != null)\n            sel.caretBidiLevel = oldBidiLevel;\n        return result;\n    });\n}\nlet cachedState = null;\nlet cachedDir = null;\nlet cachedResult = false;\nfunction endOfTextblock(view, state, dir) {\n    if (cachedState == state && cachedDir == dir)\n        return cachedResult;\n    cachedState = state;\n    cachedDir = dir;\n    return cachedResult = dir == \"up\" || dir == \"down\"\n        ? endOfTextblockVertical(view, state, dir)\n        : endOfTextblockHorizontal(view, state, dir);\n}\n\n// View descriptions are data structures that describe the DOM that is\n// used to represent the editor's content. They are used for:\n//\n// - Incremental redrawing when the document changes\n//\n// - Figuring out what part of the document a given DOM position\n//   corresponds to\n//\n// - Wiring in custom implementations of the editing interface for a\n//   given node\n//\n// They form a doubly-linked mutable tree, starting at `view.docView`.\nconst NOT_DIRTY = 0, CHILD_DIRTY = 1, CONTENT_DIRTY = 2, NODE_DIRTY = 3;\n// Superclass for the various kinds of descriptions. Defines their\n// basic structure and shared methods.\nclass ViewDesc {\n    constructor(parent, children, dom, \n    // This is the node that holds the child views. It may be null for\n    // descs that don't have children.\n    contentDOM) {\n        this.parent = parent;\n        this.children = children;\n        this.dom = dom;\n        this.contentDOM = contentDOM;\n        this.dirty = NOT_DIRTY;\n        // An expando property on the DOM node provides a link back to its\n        // description.\n        dom.pmViewDesc = this;\n    }\n    // Used to check whether a given description corresponds to a\n    // widget/mark/node.\n    matchesWidget(widget) { return false; }\n    matchesMark(mark) { return false; }\n    matchesNode(node, outerDeco, innerDeco) { return false; }\n    matchesHack(nodeName) { return false; }\n    // When parsing in-editor content (in domchange.js), we allow\n    // descriptions to determine the parse rules that should be used to\n    // parse them.\n    parseRule() { return null; }\n    // Used by the editor's event handler to ignore events that come\n    // from certain descs.\n    stopEvent(event) { return false; }\n    // The size of the content represented by this desc.\n    get size() {\n        let size = 0;\n        for (let i = 0; i < this.children.length; i++)\n            size += this.children[i].size;\n        return size;\n    }\n    // For block nodes, this represents the space taken up by their\n    // start/end tokens.\n    get border() { return 0; }\n    destroy() {\n        this.parent = undefined;\n        if (this.dom.pmViewDesc == this)\n            this.dom.pmViewDesc = undefined;\n        for (let i = 0; i < this.children.length; i++)\n            this.children[i].destroy();\n    }\n    posBeforeChild(child) {\n        for (let i = 0, pos = this.posAtStart;; i++) {\n            let cur = this.children[i];\n            if (cur == child)\n                return pos;\n            pos += cur.size;\n        }\n    }\n    get posBefore() {\n        return this.parent.posBeforeChild(this);\n    }\n    get posAtStart() {\n        return this.parent ? this.parent.posBeforeChild(this) + this.border : 0;\n    }\n    get posAfter() {\n        return this.posBefore + this.size;\n    }\n    get posAtEnd() {\n        return this.posAtStart + this.size - 2 * this.border;\n    }\n    localPosFromDOM(dom, offset, bias) {\n        // If the DOM position is in the content, use the child desc after\n        // it to figure out a position.\n        if (this.contentDOM && this.contentDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode)) {\n            if (bias < 0) {\n                let domBefore, desc;\n                if (dom == this.contentDOM) {\n                    domBefore = dom.childNodes[offset - 1];\n                }\n                else {\n                    while (dom.parentNode != this.contentDOM)\n                        dom = dom.parentNode;\n                    domBefore = dom.previousSibling;\n                }\n                while (domBefore && !((desc = domBefore.pmViewDesc) && desc.parent == this))\n                    domBefore = domBefore.previousSibling;\n                return domBefore ? this.posBeforeChild(desc) + desc.size : this.posAtStart;\n            }\n            else {\n                let domAfter, desc;\n                if (dom == this.contentDOM) {\n                    domAfter = dom.childNodes[offset];\n                }\n                else {\n                    while (dom.parentNode != this.contentDOM)\n                        dom = dom.parentNode;\n                    domAfter = dom.nextSibling;\n                }\n                while (domAfter && !((desc = domAfter.pmViewDesc) && desc.parent == this))\n                    domAfter = domAfter.nextSibling;\n                return domAfter ? this.posBeforeChild(desc) : this.posAtEnd;\n            }\n        }\n        // Otherwise, use various heuristics, falling back on the bias\n        // parameter, to determine whether to return the position at the\n        // start or at the end of this view desc.\n        let atEnd;\n        if (dom == this.dom && this.contentDOM) {\n            atEnd = offset > domIndex(this.contentDOM);\n        }\n        else if (this.contentDOM && this.contentDOM != this.dom && this.dom.contains(this.contentDOM)) {\n            atEnd = dom.compareDocumentPosition(this.contentDOM) & 2;\n        }\n        else if (this.dom.firstChild) {\n            if (offset == 0)\n                for (let search = dom;; search = search.parentNode) {\n                    if (search == this.dom) {\n                        atEnd = false;\n                        break;\n                    }\n                    if (search.previousSibling)\n                        break;\n                }\n            if (atEnd == null && offset == dom.childNodes.length)\n                for (let search = dom;; search = search.parentNode) {\n                    if (search == this.dom) {\n                        atEnd = true;\n                        break;\n                    }\n                    if (search.nextSibling)\n                        break;\n                }\n        }\n        return (atEnd == null ? bias > 0 : atEnd) ? this.posAtEnd : this.posAtStart;\n    }\n    nearestDesc(dom, onlyNodes = false) {\n        for (let first = true, cur = dom; cur; cur = cur.parentNode) {\n            let desc = this.getDesc(cur), nodeDOM;\n            if (desc && (!onlyNodes || desc.node)) {\n                // If dom is outside of this desc's nodeDOM, don't count it.\n                if (first && (nodeDOM = desc.nodeDOM) &&\n                    !(nodeDOM.nodeType == 1 ? nodeDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode) : nodeDOM == dom))\n                    first = false;\n                else\n                    return desc;\n            }\n        }\n    }\n    getDesc(dom) {\n        let desc = dom.pmViewDesc;\n        for (let cur = desc; cur; cur = cur.parent)\n            if (cur == this)\n                return desc;\n    }\n    posFromDOM(dom, offset, bias) {\n        for (let scan = dom; scan; scan = scan.parentNode) {\n            let desc = this.getDesc(scan);\n            if (desc)\n                return desc.localPosFromDOM(dom, offset, bias);\n        }\n        return -1;\n    }\n    // Find the desc for the node after the given pos, if any. (When a\n    // parent node overrode rendering, there might not be one.)\n    descAt(pos) {\n        for (let i = 0, offset = 0; i < this.children.length; i++) {\n            let child = this.children[i], end = offset + child.size;\n            if (offset == pos && end != offset) {\n                while (!child.border && child.children.length)\n                    child = child.children[0];\n                return child;\n            }\n            if (pos < end)\n                return child.descAt(pos - offset - child.border);\n            offset = end;\n        }\n    }\n    domFromPos(pos, side) {\n        if (!this.contentDOM)\n            return { node: this.dom, offset: 0, atom: pos + 1 };\n        // First find the position in the child array\n        let i = 0, offset = 0;\n        for (let curPos = 0; i < this.children.length; i++) {\n            let child = this.children[i], end = curPos + child.size;\n            if (end > pos || child instanceof TrailingHackViewDesc) {\n                offset = pos - curPos;\n                break;\n            }\n            curPos = end;\n        }\n        // If this points into the middle of a child, call through\n        if (offset)\n            return this.children[i].domFromPos(offset - this.children[i].border, side);\n        // Go back if there were any zero-length widgets with side >= 0 before this point\n        for (let prev; i && !(prev = this.children[i - 1]).size && prev instanceof WidgetViewDesc && prev.side >= 0; i--) { }\n        // Scan towards the first useable node\n        if (side <= 0) {\n            let prev, enter = true;\n            for (;; i--, enter = false) {\n                prev = i ? this.children[i - 1] : null;\n                if (!prev || prev.dom.parentNode == this.contentDOM)\n                    break;\n            }\n            if (prev && side && enter && !prev.border && !prev.domAtom)\n                return prev.domFromPos(prev.size, side);\n            return { node: this.contentDOM, offset: prev ? domIndex(prev.dom) + 1 : 0 };\n        }\n        else {\n            let next, enter = true;\n            for (;; i++, enter = false) {\n                next = i < this.children.length ? this.children[i] : null;\n                if (!next || next.dom.parentNode == this.contentDOM)\n                    break;\n            }\n            if (next && enter && !next.border && !next.domAtom)\n                return next.domFromPos(0, side);\n            return { node: this.contentDOM, offset: next ? domIndex(next.dom) : this.contentDOM.childNodes.length };\n        }\n    }\n    // Used to find a DOM range in a single parent for a given changed\n    // range.\n    parseRange(from, to, base = 0) {\n        if (this.children.length == 0)\n            return { node: this.contentDOM, from, to, fromOffset: 0, toOffset: this.contentDOM.childNodes.length };\n        let fromOffset = -1, toOffset = -1;\n        for (let offset = base, i = 0;; i++) {\n            let child = this.children[i], end = offset + child.size;\n            if (fromOffset == -1 && from <= end) {\n                let childBase = offset + child.border;\n                // FIXME maybe descend mark views to parse a narrower range?\n                if (from >= childBase && to <= end - child.border && child.node &&\n                    child.contentDOM && this.contentDOM.contains(child.contentDOM))\n                    return child.parseRange(from, to, childBase);\n                from = offset;\n                for (let j = i; j > 0; j--) {\n                    let prev = this.children[j - 1];\n                    if (prev.size && prev.dom.parentNode == this.contentDOM && !prev.emptyChildAt(1)) {\n                        fromOffset = domIndex(prev.dom) + 1;\n                        break;\n                    }\n                    from -= prev.size;\n                }\n                if (fromOffset == -1)\n                    fromOffset = 0;\n            }\n            if (fromOffset > -1 && (end > to || i == this.children.length - 1)) {\n                to = end;\n                for (let j = i + 1; j < this.children.length; j++) {\n                    let next = this.children[j];\n                    if (next.size && next.dom.parentNode == this.contentDOM && !next.emptyChildAt(-1)) {\n                        toOffset = domIndex(next.dom);\n                        break;\n                    }\n                    to += next.size;\n                }\n                if (toOffset == -1)\n                    toOffset = this.contentDOM.childNodes.length;\n                break;\n            }\n            offset = end;\n        }\n        return { node: this.contentDOM, from, to, fromOffset, toOffset };\n    }\n    emptyChildAt(side) {\n        if (this.border || !this.contentDOM || !this.children.length)\n            return false;\n        let child = this.children[side < 0 ? 0 : this.children.length - 1];\n        return child.size == 0 || child.emptyChildAt(side);\n    }\n    domAfterPos(pos) {\n        let { node, offset } = this.domFromPos(pos, 0);\n        if (node.nodeType != 1 || offset == node.childNodes.length)\n            throw new RangeError(\"No node after pos \" + pos);\n        return node.childNodes[offset];\n    }\n    // View descs are responsible for setting any selection that falls\n    // entirely inside of them, so that custom implementations can do\n    // custom things with the selection. Note that this falls apart when\n    // a selection starts in such a node and ends in another, in which\n    // case we just use whatever domFromPos produces as a best effort.\n    setSelection(anchor, head, root, force = false) {\n        // If the selection falls entirely in a child, give it to that child\n        let from = Math.min(anchor, head), to = Math.max(anchor, head);\n        for (let i = 0, offset = 0; i < this.children.length; i++) {\n            let child = this.children[i], end = offset + child.size;\n            if (from > offset && to < end)\n                return child.setSelection(anchor - offset - child.border, head - offset - child.border, root, force);\n            offset = end;\n        }\n        let anchorDOM = this.domFromPos(anchor, anchor ? -1 : 1);\n        let headDOM = head == anchor ? anchorDOM : this.domFromPos(head, head ? -1 : 1);\n        let domSel = root.getSelection();\n        let brKludge = false;\n        // On Firefox, using Selection.collapse to put the cursor after a\n        // BR node for some reason doesn't always work (#1073). On Safari,\n        // the cursor sometimes inexplicable visually lags behind its\n        // reported position in such situations (#1092).\n        if ((gecko || safari) && anchor == head) {\n            let { node, offset } = anchorDOM;\n            if (node.nodeType == 3) {\n                brKludge = !!(offset && node.nodeValue[offset - 1] == \"\\n\");\n            }\n            else {\n                let prev = node.childNodes[offset - 1];\n                brKludge = prev && (prev.nodeName == \"BR\" || prev.contentEditable == \"false\");\n            }\n        }\n        // Firefox can act strangely when the selection is in front of an\n        // uneditable node. See #1163 and https://bugzilla.mozilla.org/show_bug.cgi?id=1709536\n        if (gecko && domSel.focusNode && domSel.focusNode != headDOM.node && domSel.focusNode.nodeType == 1) {\n            let after = domSel.focusNode.childNodes[domSel.focusOffset];\n            if (after && after.contentEditable == \"false\")\n                force = true;\n        }\n        if (!(force || brKludge && safari) &&\n            isEquivalentPosition(anchorDOM.node, anchorDOM.offset, domSel.anchorNode, domSel.anchorOffset) &&\n            isEquivalentPosition(headDOM.node, headDOM.offset, domSel.focusNode, domSel.focusOffset))\n            return;\n        // Selection.extend can be used to create an 'inverted' selection\n        // (one where the focus is before the anchor), but not all\n        // browsers support it yet.\n        let domSelExtended = false;\n        if ((domSel.extend || anchor == head) && !brKludge) {\n            domSel.collapse(anchorDOM.node, anchorDOM.offset);\n            try {\n                if (anchor != head)\n                    domSel.extend(headDOM.node, headDOM.offset);\n                domSelExtended = true;\n            }\n            catch (_) {\n                // In some cases with Chrome the selection is empty after calling\n                // collapse, even when it should be valid. This appears to be a bug, but\n                // it is difficult to isolate. If this happens fallback to the old path\n                // without using extend.\n                // Similarly, this could crash on Safari if the editor is hidden, and\n                // there was no selection.\n            }\n        }\n        if (!domSelExtended) {\n            if (anchor > head) {\n                let tmp = anchorDOM;\n                anchorDOM = headDOM;\n                headDOM = tmp;\n            }\n            let range = document.createRange();\n            range.setEnd(headDOM.node, headDOM.offset);\n            range.setStart(anchorDOM.node, anchorDOM.offset);\n            domSel.removeAllRanges();\n            domSel.addRange(range);\n        }\n    }\n    ignoreMutation(mutation) {\n        return !this.contentDOM && mutation.type != \"selection\";\n    }\n    get contentLost() {\n        return this.contentDOM && this.contentDOM != this.dom && !this.dom.contains(this.contentDOM);\n    }\n    // Remove a subtree of the element tree that has been touched\n    // by a DOM change, so that the next update will redraw it.\n    markDirty(from, to) {\n        for (let offset = 0, i = 0; i < this.children.length; i++) {\n            let child = this.children[i], end = offset + child.size;\n            if (offset == end ? from <= end && to >= offset : from < end && to > offset) {\n                let startInside = offset + child.border, endInside = end - child.border;\n                if (from >= startInside && to <= endInside) {\n                    this.dirty = from == offset || to == end ? CONTENT_DIRTY : CHILD_DIRTY;\n                    if (from == startInside && to == endInside &&\n                        (child.contentLost || child.dom.parentNode != this.contentDOM))\n                        child.dirty = NODE_DIRTY;\n                    else\n                        child.markDirty(from - startInside, to - startInside);\n                    return;\n                }\n                else {\n                    child.dirty = child.dom == child.contentDOM && child.dom.parentNode == this.contentDOM && !child.children.length\n                        ? CONTENT_DIRTY : NODE_DIRTY;\n                }\n            }\n            offset = end;\n        }\n        this.dirty = CONTENT_DIRTY;\n    }\n    markParentsDirty() {\n        let level = 1;\n        for (let node = this.parent; node; node = node.parent, level++) {\n            let dirty = level == 1 ? CONTENT_DIRTY : CHILD_DIRTY;\n            if (node.dirty < dirty)\n                node.dirty = dirty;\n        }\n    }\n    get domAtom() { return false; }\n    get ignoreForCoords() { return false; }\n}\n// A widget desc represents a widget decoration, which is a DOM node\n// drawn between the document nodes.\nclass WidgetViewDesc extends ViewDesc {\n    constructor(parent, widget, view, pos) {\n        let self, dom = widget.type.toDOM;\n        if (typeof dom == \"function\")\n            dom = dom(view, () => {\n                if (!self)\n                    return pos;\n                if (self.parent)\n                    return self.parent.posBeforeChild(self);\n            });\n        if (!widget.type.spec.raw) {\n            if (dom.nodeType != 1) {\n                let wrap = document.createElement(\"span\");\n                wrap.appendChild(dom);\n                dom = wrap;\n            }\n            dom.contentEditable = \"false\";\n            dom.classList.add(\"ProseMirror-widget\");\n        }\n        super(parent, [], dom, null);\n        this.widget = widget;\n        this.widget = widget;\n        self = this;\n    }\n    matchesWidget(widget) {\n        return this.dirty == NOT_DIRTY && widget.type.eq(this.widget.type);\n    }\n    parseRule() { return { ignore: true }; }\n    stopEvent(event) {\n        let stop = this.widget.spec.stopEvent;\n        return stop ? stop(event) : false;\n    }\n    ignoreMutation(mutation) {\n        return mutation.type != \"selection\" || this.widget.spec.ignoreSelection;\n    }\n    destroy() {\n        this.widget.type.destroy(this.dom);\n        super.destroy();\n    }\n    get domAtom() { return true; }\n    get side() { return this.widget.type.side; }\n}\nclass CompositionViewDesc extends ViewDesc {\n    constructor(parent, dom, textDOM, text) {\n        super(parent, [], dom, null);\n        this.textDOM = textDOM;\n        this.text = text;\n    }\n    get size() { return this.text.length; }\n    localPosFromDOM(dom, offset) {\n        if (dom != this.textDOM)\n            return this.posAtStart + (offset ? this.size : 0);\n        return this.posAtStart + offset;\n    }\n    domFromPos(pos) {\n        return { node: this.textDOM, offset: pos };\n    }\n    ignoreMutation(mut) {\n        return mut.type === 'characterData' && mut.target.nodeValue == mut.oldValue;\n    }\n}\n// A mark desc represents a mark. May have multiple children,\n// depending on how the mark is split. Note that marks are drawn using\n// a fixed nesting order, for simplicity and predictability, so in\n// some cases they will be split more often than would appear\n// necessary.\nclass MarkViewDesc extends ViewDesc {\n    constructor(parent, mark, dom, contentDOM) {\n        super(parent, [], dom, contentDOM);\n        this.mark = mark;\n    }\n    static create(parent, mark, inline, view) {\n        let custom = view.nodeViews[mark.type.name];\n        let spec = custom && custom(mark, view, inline);\n        if (!spec || !spec.dom)\n            spec = DOMSerializer.renderSpec(document, mark.type.spec.toDOM(mark, inline));\n        return new MarkViewDesc(parent, mark, spec.dom, spec.contentDOM || spec.dom);\n    }\n    parseRule() {\n        if ((this.dirty & NODE_DIRTY) || this.mark.type.spec.reparseInView)\n            return null;\n        return { mark: this.mark.type.name, attrs: this.mark.attrs, contentElement: this.contentDOM || undefined };\n    }\n    matchesMark(mark) { return this.dirty != NODE_DIRTY && this.mark.eq(mark); }\n    markDirty(from, to) {\n        super.markDirty(from, to);\n        // Move dirty info to nearest node view\n        if (this.dirty != NOT_DIRTY) {\n            let parent = this.parent;\n            while (!parent.node)\n                parent = parent.parent;\n            if (parent.dirty < this.dirty)\n                parent.dirty = this.dirty;\n            this.dirty = NOT_DIRTY;\n        }\n    }\n    slice(from, to, view) {\n        let copy = MarkViewDesc.create(this.parent, this.mark, true, view);\n        let nodes = this.children, size = this.size;\n        if (to < size)\n            nodes = replaceNodes(nodes, to, size, view);\n        if (from > 0)\n            nodes = replaceNodes(nodes, 0, from, view);\n        for (let i = 0; i < nodes.length; i++)\n            nodes[i].parent = copy;\n        copy.children = nodes;\n        return copy;\n    }\n}\n// Node view descs are the main, most common type of view desc, and\n// correspond to an actual node in the document. Unlike mark descs,\n// they populate their child array themselves.\nclass NodeViewDesc extends ViewDesc {\n    constructor(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos) {\n        super(parent, [], dom, contentDOM);\n        this.node = node;\n        this.outerDeco = outerDeco;\n        this.innerDeco = innerDeco;\n        this.nodeDOM = nodeDOM;\n    }\n    // By default, a node is rendered using the `toDOM` method from the\n    // node type spec. But client code can use the `nodeViews` spec to\n    // supply a custom node view, which can influence various aspects of\n    // the way the node works.\n    //\n    // (Using subclassing for this was intentionally decided against,\n    // since it'd require exposing a whole slew of finicky\n    // implementation details to the user code that they probably will\n    // never need.)\n    static create(parent, node, outerDeco, innerDeco, view, pos) {\n        let custom = view.nodeViews[node.type.name], descObj;\n        let spec = custom && custom(node, view, () => {\n            // (This is a function that allows the custom view to find its\n            // own position)\n            if (!descObj)\n                return pos;\n            if (descObj.parent)\n                return descObj.parent.posBeforeChild(descObj);\n        }, outerDeco, innerDeco);\n        let dom = spec && spec.dom, contentDOM = spec && spec.contentDOM;\n        if (node.isText) {\n            if (!dom)\n                dom = document.createTextNode(node.text);\n            else if (dom.nodeType != 3)\n                throw new RangeError(\"Text must be rendered as a DOM text node\");\n        }\n        else if (!dom) {\n            ({ dom, contentDOM } = DOMSerializer.renderSpec(document, node.type.spec.toDOM(node)));\n        }\n        if (!contentDOM && !node.isText && dom.nodeName != \"BR\") { // Chrome gets confused by <br contenteditable=false>\n            if (!dom.hasAttribute(\"contenteditable\"))\n                dom.contentEditable = \"false\";\n            if (node.type.spec.draggable)\n                dom.draggable = true;\n        }\n        let nodeDOM = dom;\n        dom = applyOuterDeco(dom, outerDeco, node);\n        if (spec)\n            return descObj = new CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM || null, nodeDOM, spec, view, pos + 1);\n        else if (node.isText)\n            return new TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM, view);\n        else\n            return new NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM || null, nodeDOM, view, pos + 1);\n    }\n    parseRule() {\n        // Experimental kludge to allow opt-in re-parsing of nodes\n        if (this.node.type.spec.reparseInView)\n            return null;\n        // FIXME the assumption that this can always return the current\n        // attrs means that if the user somehow manages to change the\n        // attrs in the dom, that won't be picked up. Not entirely sure\n        // whether this is a problem\n        let rule = { node: this.node.type.name, attrs: this.node.attrs };\n        if (this.node.type.whitespace == \"pre\")\n            rule.preserveWhitespace = \"full\";\n        if (!this.contentDOM) {\n            rule.getContent = () => this.node.content;\n        }\n        else if (!this.contentLost) {\n            rule.contentElement = this.contentDOM;\n        }\n        else {\n            // Chrome likes to randomly recreate parent nodes when\n            // backspacing things. When that happens, this tries to find the\n            // new parent.\n            for (let i = this.children.length - 1; i >= 0; i--) {\n                let child = this.children[i];\n                if (this.dom.contains(child.dom.parentNode)) {\n                    rule.contentElement = child.dom.parentNode;\n                    break;\n                }\n            }\n            if (!rule.contentElement)\n                rule.getContent = () => Fragment.empty;\n        }\n        return rule;\n    }\n    matchesNode(node, outerDeco, innerDeco) {\n        return this.dirty == NOT_DIRTY && node.eq(this.node) &&\n            sameOuterDeco(outerDeco, this.outerDeco) && innerDeco.eq(this.innerDeco);\n    }\n    get size() { return this.node.nodeSize; }\n    get border() { return this.node.isLeaf ? 0 : 1; }\n    // Syncs `this.children` to match `this.node.content` and the local\n    // decorations, possibly introducing nesting for marks. Then, in a\n    // separate step, syncs the DOM inside `this.contentDOM` to\n    // `this.children`.\n    updateChildren(view, pos) {\n        let inline = this.node.inlineContent, off = pos;\n        let composition = view.composing ? this.localCompositionInfo(view, pos) : null;\n        let localComposition = composition && composition.pos > -1 ? composition : null;\n        let compositionInChild = composition && composition.pos < 0;\n        let updater = new ViewTreeUpdater(this, localComposition && localComposition.node, view);\n        iterDeco(this.node, this.innerDeco, (widget, i, insideNode) => {\n            if (widget.spec.marks)\n                updater.syncToMarks(widget.spec.marks, inline, view);\n            else if (widget.type.side >= 0 && !insideNode)\n                updater.syncToMarks(i == this.node.childCount ? Mark.none : this.node.child(i).marks, inline, view);\n            // If the next node is a desc matching this widget, reuse it,\n            // otherwise insert the widget as a new view desc.\n            updater.placeWidget(widget, view, off);\n        }, (child, outerDeco, innerDeco, i) => {\n            // Make sure the wrapping mark descs match the node's marks.\n            updater.syncToMarks(child.marks, inline, view);\n            // Try several strategies for drawing this node\n            let compIndex;\n            if (updater.findNodeMatch(child, outerDeco, innerDeco, i)) ;\n            else if (compositionInChild && view.state.selection.from > off &&\n                view.state.selection.to < off + child.nodeSize &&\n                (compIndex = updater.findIndexWithChild(composition.node)) > -1 &&\n                updater.updateNodeAt(child, outerDeco, innerDeco, compIndex, view)) ;\n            else if (updater.updateNextNode(child, outerDeco, innerDeco, view, i, off)) ;\n            else {\n                // Add it as a new view\n                updater.addNode(child, outerDeco, innerDeco, view, off);\n            }\n            off += child.nodeSize;\n        });\n        // Drop all remaining descs after the current position.\n        updater.syncToMarks([], inline, view);\n        if (this.node.isTextblock)\n            updater.addTextblockHacks();\n        updater.destroyRest();\n        // Sync the DOM if anything changed\n        if (updater.changed || this.dirty == CONTENT_DIRTY) {\n            // May have to protect focused DOM from being changed if a composition is active\n            if (localComposition)\n                this.protectLocalComposition(view, localComposition);\n            renderDescs(this.contentDOM, this.children, view);\n            if (ios)\n                iosHacks(this.dom);\n        }\n    }\n    localCompositionInfo(view, pos) {\n        // Only do something if both the selection and a focused text node\n        // are inside of this node\n        let { from, to } = view.state.selection;\n        if (!(view.state.selection instanceof TextSelection) || from < pos || to > pos + this.node.content.size)\n            return null;\n        let sel = view.domSelectionRange();\n        let textNode = nearbyTextNode(sel.focusNode, sel.focusOffset);\n        if (!textNode || !this.dom.contains(textNode.parentNode))\n            return null;\n        if (this.node.inlineContent) {\n            // Find the text in the focused node in the node, stop if it's not\n            // there (may have been modified through other means, in which\n            // case it should overwritten)\n            let text = textNode.nodeValue;\n            let textPos = findTextInFragment(this.node.content, text, from - pos, to - pos);\n            return textPos < 0 ? null : { node: textNode, pos: textPos, text };\n        }\n        else {\n            return { node: textNode, pos: -1, text: \"\" };\n        }\n    }\n    protectLocalComposition(view, { node, pos, text }) {\n        // The node is already part of a local view desc, leave it there\n        if (this.getDesc(node))\n            return;\n        // Create a composition view for the orphaned nodes\n        let topNode = node;\n        for (;; topNode = topNode.parentNode) {\n            if (topNode.parentNode == this.contentDOM)\n                break;\n            while (topNode.previousSibling)\n                topNode.parentNode.removeChild(topNode.previousSibling);\n            while (topNode.nextSibling)\n                topNode.parentNode.removeChild(topNode.nextSibling);\n            if (topNode.pmViewDesc)\n                topNode.pmViewDesc = undefined;\n        }\n        let desc = new CompositionViewDesc(this, topNode, node, text);\n        view.input.compositionNodes.push(desc);\n        // Patch up this.children to contain the composition view\n        this.children = replaceNodes(this.children, pos, pos + text.length, view, desc);\n    }\n    // If this desc must be updated to match the given node decoration,\n    // do so and return true.\n    update(node, outerDeco, innerDeco, view) {\n        if (this.dirty == NODE_DIRTY ||\n            !node.sameMarkup(this.node))\n            return false;\n        this.updateInner(node, outerDeco, innerDeco, view);\n        return true;\n    }\n    updateInner(node, outerDeco, innerDeco, view) {\n        this.updateOuterDeco(outerDeco);\n        this.node = node;\n        this.innerDeco = innerDeco;\n        if (this.contentDOM)\n            this.updateChildren(view, this.posAtStart);\n        this.dirty = NOT_DIRTY;\n    }\n    updateOuterDeco(outerDeco) {\n        if (sameOuterDeco(outerDeco, this.outerDeco))\n            return;\n        let needsWrap = this.nodeDOM.nodeType != 1;\n        let oldDOM = this.dom;\n        this.dom = patchOuterDeco(this.dom, this.nodeDOM, computeOuterDeco(this.outerDeco, this.node, needsWrap), computeOuterDeco(outerDeco, this.node, needsWrap));\n        if (this.dom != oldDOM) {\n            oldDOM.pmViewDesc = undefined;\n            this.dom.pmViewDesc = this;\n        }\n        this.outerDeco = outerDeco;\n    }\n    // Mark this node as being the selected node.\n    selectNode() {\n        if (this.nodeDOM.nodeType == 1)\n            this.nodeDOM.classList.add(\"ProseMirror-selectednode\");\n        if (this.contentDOM || !this.node.type.spec.draggable)\n            this.dom.draggable = true;\n    }\n    // Remove selected node marking from this node.\n    deselectNode() {\n        if (this.nodeDOM.nodeType == 1)\n            this.nodeDOM.classList.remove(\"ProseMirror-selectednode\");\n        if (this.contentDOM || !this.node.type.spec.draggable)\n            this.dom.removeAttribute(\"draggable\");\n    }\n    get domAtom() { return this.node.isAtom; }\n}\n// Create a view desc for the top-level document node, to be exported\n// and used by the view class.\nfunction docViewDesc(doc, outerDeco, innerDeco, dom, view) {\n    applyOuterDeco(dom, outerDeco, doc);\n    let docView = new NodeViewDesc(undefined, doc, outerDeco, innerDeco, dom, dom, dom, view, 0);\n    if (docView.contentDOM)\n        docView.updateChildren(view, 0);\n    return docView;\n}\nclass TextViewDesc extends NodeViewDesc {\n    constructor(parent, node, outerDeco, innerDeco, dom, nodeDOM, view) {\n        super(parent, node, outerDeco, innerDeco, dom, null, nodeDOM, view, 0);\n    }\n    parseRule() {\n        let skip = this.nodeDOM.parentNode;\n        while (skip && skip != this.dom && !skip.pmIsDeco)\n            skip = skip.parentNode;\n        return { skip: (skip || true) };\n    }\n    update(node, outerDeco, innerDeco, view) {\n        if (this.dirty == NODE_DIRTY || (this.dirty != NOT_DIRTY && !this.inParent()) ||\n            !node.sameMarkup(this.node))\n            return false;\n        this.updateOuterDeco(outerDeco);\n        if ((this.dirty != NOT_DIRTY || node.text != this.node.text) && node.text != this.nodeDOM.nodeValue) {\n            this.nodeDOM.nodeValue = node.text;\n            if (view.trackWrites == this.nodeDOM)\n                view.trackWrites = null;\n        }\n        this.node = node;\n        this.dirty = NOT_DIRTY;\n        return true;\n    }\n    inParent() {\n        let parentDOM = this.parent.contentDOM;\n        for (let n = this.nodeDOM; n; n = n.parentNode)\n            if (n == parentDOM)\n                return true;\n        return false;\n    }\n    domFromPos(pos) {\n        return { node: this.nodeDOM, offset: pos };\n    }\n    localPosFromDOM(dom, offset, bias) {\n        if (dom == this.nodeDOM)\n            return this.posAtStart + Math.min(offset, this.node.text.length);\n        return super.localPosFromDOM(dom, offset, bias);\n    }\n    ignoreMutation(mutation) {\n        return mutation.type != \"characterData\" && mutation.type != \"selection\";\n    }\n    slice(from, to, view) {\n        let node = this.node.cut(from, to), dom = document.createTextNode(node.text);\n        return new TextViewDesc(this.parent, node, this.outerDeco, this.innerDeco, dom, dom, view);\n    }\n    markDirty(from, to) {\n        super.markDirty(from, to);\n        if (this.dom != this.nodeDOM && (from == 0 || to == this.nodeDOM.nodeValue.length))\n            this.dirty = NODE_DIRTY;\n    }\n    get domAtom() { return false; }\n}\n// A dummy desc used to tag trailing BR or IMG nodes created to work\n// around contentEditable terribleness.\nclass TrailingHackViewDesc extends ViewDesc {\n    parseRule() { return { ignore: true }; }\n    matchesHack(nodeName) { return this.dirty == NOT_DIRTY && this.dom.nodeName == nodeName; }\n    get domAtom() { return true; }\n    get ignoreForCoords() { return this.dom.nodeName == \"IMG\"; }\n}\n// A separate subclass is used for customized node views, so that the\n// extra checks only have to be made for nodes that are actually\n// customized.\nclass CustomNodeViewDesc extends NodeViewDesc {\n    constructor(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec, view, pos) {\n        super(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos);\n        this.spec = spec;\n    }\n    // A custom `update` method gets to decide whether the update goes\n    // through. If it does, and there's a `contentDOM` node, our logic\n    // updates the children.\n    update(node, outerDeco, innerDeco, view) {\n        if (this.dirty == NODE_DIRTY)\n            return false;\n        if (this.spec.update) {\n            let result = this.spec.update(node, outerDeco, innerDeco);\n            if (result)\n                this.updateInner(node, outerDeco, innerDeco, view);\n            return result;\n        }\n        else if (!this.contentDOM && !node.isLeaf) {\n            return false;\n        }\n        else {\n            return super.update(node, outerDeco, innerDeco, view);\n        }\n    }\n    selectNode() {\n        this.spec.selectNode ? this.spec.selectNode() : super.selectNode();\n    }\n    deselectNode() {\n        this.spec.deselectNode ? this.spec.deselectNode() : super.deselectNode();\n    }\n    setSelection(anchor, head, root, force) {\n        this.spec.setSelection ? this.spec.setSelection(anchor, head, root)\n            : super.setSelection(anchor, head, root, force);\n    }\n    destroy() {\n        if (this.spec.destroy)\n            this.spec.destroy();\n        super.destroy();\n    }\n    stopEvent(event) {\n        return this.spec.stopEvent ? this.spec.stopEvent(event) : false;\n    }\n    ignoreMutation(mutation) {\n        return this.spec.ignoreMutation ? this.spec.ignoreMutation(mutation) : super.ignoreMutation(mutation);\n    }\n}\n// Sync the content of the given DOM node with the nodes associated\n// with the given array of view descs, recursing into mark descs\n// because this should sync the subtree for a whole node at a time.\nfunction renderDescs(parentDOM, descs, view) {\n    let dom = parentDOM.firstChild, written = false;\n    for (let i = 0; i < descs.length; i++) {\n        let desc = descs[i], childDOM = desc.dom;\n        if (childDOM.parentNode == parentDOM) {\n            while (childDOM != dom) {\n                dom = rm(dom);\n                written = true;\n            }\n            dom = dom.nextSibling;\n        }\n        else {\n            written = true;\n            parentDOM.insertBefore(childDOM, dom);\n        }\n        if (desc instanceof MarkViewDesc) {\n            let pos = dom ? dom.previousSibling : parentDOM.lastChild;\n            renderDescs(desc.contentDOM, desc.children, view);\n            dom = pos ? pos.nextSibling : parentDOM.firstChild;\n        }\n    }\n    while (dom) {\n        dom = rm(dom);\n        written = true;\n    }\n    if (written && view.trackWrites == parentDOM)\n        view.trackWrites = null;\n}\nconst OuterDecoLevel = function (nodeName) {\n    if (nodeName)\n        this.nodeName = nodeName;\n};\nOuterDecoLevel.prototype = Object.create(null);\nconst noDeco = [new OuterDecoLevel];\nfunction computeOuterDeco(outerDeco, node, needsWrap) {\n    if (outerDeco.length == 0)\n        return noDeco;\n    let top = needsWrap ? noDeco[0] : new OuterDecoLevel, result = [top];\n    for (let i = 0; i < outerDeco.length; i++) {\n        let attrs = outerDeco[i].type.attrs;\n        if (!attrs)\n            continue;\n        if (attrs.nodeName)\n            result.push(top = new OuterDecoLevel(attrs.nodeName));\n        for (let name in attrs) {\n            let val = attrs[name];\n            if (val == null)\n                continue;\n            if (needsWrap && result.length == 1)\n                result.push(top = new OuterDecoLevel(node.isInline ? \"span\" : \"div\"));\n            if (name == \"class\")\n                top.class = (top.class ? top.class + \" \" : \"\") + val;\n            else if (name == \"style\")\n                top.style = (top.style ? top.style + \";\" : \"\") + val;\n            else if (name != \"nodeName\")\n                top[name] = val;\n        }\n    }\n    return result;\n}\nfunction patchOuterDeco(outerDOM, nodeDOM, prevComputed, curComputed) {\n    // Shortcut for trivial case\n    if (prevComputed == noDeco && curComputed == noDeco)\n        return nodeDOM;\n    let curDOM = nodeDOM;\n    for (let i = 0; i < curComputed.length; i++) {\n        let deco = curComputed[i], prev = prevComputed[i];\n        if (i) {\n            let parent;\n            if (prev && prev.nodeName == deco.nodeName && curDOM != outerDOM &&\n                (parent = curDOM.parentNode) && parent.nodeName.toLowerCase() == deco.nodeName) {\n                curDOM = parent;\n            }\n            else {\n                parent = document.createElement(deco.nodeName);\n                parent.pmIsDeco = true;\n                parent.appendChild(curDOM);\n                prev = noDeco[0];\n                curDOM = parent;\n            }\n        }\n        patchAttributes(curDOM, prev || noDeco[0], deco);\n    }\n    return curDOM;\n}\nfunction patchAttributes(dom, prev, cur) {\n    for (let name in prev)\n        if (name != \"class\" && name != \"style\" && name != \"nodeName\" && !(name in cur))\n            dom.removeAttribute(name);\n    for (let name in cur)\n        if (name != \"class\" && name != \"style\" && name != \"nodeName\" && cur[name] != prev[name])\n            dom.setAttribute(name, cur[name]);\n    if (prev.class != cur.class) {\n        let prevList = prev.class ? prev.class.split(\" \").filter(Boolean) : [];\n        let curList = cur.class ? cur.class.split(\" \").filter(Boolean) : [];\n        for (let i = 0; i < prevList.length; i++)\n            if (curList.indexOf(prevList[i]) == -1)\n                dom.classList.remove(prevList[i]);\n        for (let i = 0; i < curList.length; i++)\n            if (prevList.indexOf(curList[i]) == -1)\n                dom.classList.add(curList[i]);\n        if (dom.classList.length == 0)\n            dom.removeAttribute(\"class\");\n    }\n    if (prev.style != cur.style) {\n        if (prev.style) {\n            let prop = /\\s*([\\w\\-\\xa1-\\uffff]+)\\s*:(?:\"(?:\\\\.|[^\"])*\"|'(?:\\\\.|[^'])*'|\\(.*?\\)|[^;])*/g, m;\n            while (m = prop.exec(prev.style))\n                dom.style.removeProperty(m[1]);\n        }\n        if (cur.style)\n            dom.style.cssText += cur.style;\n    }\n}\nfunction applyOuterDeco(dom, deco, node) {\n    return patchOuterDeco(dom, dom, noDeco, computeOuterDeco(deco, node, dom.nodeType != 1));\n}\nfunction sameOuterDeco(a, b) {\n    if (a.length != b.length)\n        return false;\n    for (let i = 0; i < a.length; i++)\n        if (!a[i].type.eq(b[i].type))\n            return false;\n    return true;\n}\n// Remove a DOM node and return its next sibling.\nfunction rm(dom) {\n    let next = dom.nextSibling;\n    dom.parentNode.removeChild(dom);\n    return next;\n}\n// Helper class for incrementally updating a tree of mark descs and\n// the widget and node descs inside of them.\nclass ViewTreeUpdater {\n    constructor(top, lock, view) {\n        this.lock = lock;\n        this.view = view;\n        // Index into `this.top`'s child array, represents the current\n        // update position.\n        this.index = 0;\n        // When entering a mark, the current top and index are pushed\n        // onto this.\n        this.stack = [];\n        // Tracks whether anything was changed\n        this.changed = false;\n        this.top = top;\n        this.preMatch = preMatch(top.node.content, top);\n    }\n    // Destroy and remove the children between the given indices in\n    // `this.top`.\n    destroyBetween(start, end) {\n        if (start == end)\n            return;\n        for (let i = start; i < end; i++)\n            this.top.children[i].destroy();\n        this.top.children.splice(start, end - start);\n        this.changed = true;\n    }\n    // Destroy all remaining children in `this.top`.\n    destroyRest() {\n        this.destroyBetween(this.index, this.top.children.length);\n    }\n    // Sync the current stack of mark descs with the given array of\n    // marks, reusing existing mark descs when possible.\n    syncToMarks(marks, inline, view) {\n        let keep = 0, depth = this.stack.length >> 1;\n        let maxKeep = Math.min(depth, marks.length);\n        while (keep < maxKeep &&\n            (keep == depth - 1 ? this.top : this.stack[(keep + 1) << 1])\n                .matchesMark(marks[keep]) && marks[keep].type.spec.spanning !== false)\n            keep++;\n        while (keep < depth) {\n            this.destroyRest();\n            this.top.dirty = NOT_DIRTY;\n            this.index = this.stack.pop();\n            this.top = this.stack.pop();\n            depth--;\n        }\n        while (depth < marks.length) {\n            this.stack.push(this.top, this.index + 1);\n            let found = -1;\n            for (let i = this.index; i < Math.min(this.index + 3, this.top.children.length); i++) {\n                let next = this.top.children[i];\n                if (next.matchesMark(marks[depth]) && !this.isLocked(next.dom)) {\n                    found = i;\n                    break;\n                }\n            }\n            if (found > -1) {\n                if (found > this.index) {\n                    this.changed = true;\n                    this.destroyBetween(this.index, found);\n                }\n                this.top = this.top.children[this.index];\n            }\n            else {\n                let markDesc = MarkViewDesc.create(this.top, marks[depth], inline, view);\n                this.top.children.splice(this.index, 0, markDesc);\n                this.top = markDesc;\n                this.changed = true;\n            }\n            this.index = 0;\n            depth++;\n        }\n    }\n    // Try to find a node desc matching the given data. Skip over it and\n    // return true when successful.\n    findNodeMatch(node, outerDeco, innerDeco, index) {\n        let found = -1, targetDesc;\n        if (index >= this.preMatch.index &&\n            (targetDesc = this.preMatch.matches[index - this.preMatch.index]).parent == this.top &&\n            targetDesc.matchesNode(node, outerDeco, innerDeco)) {\n            found = this.top.children.indexOf(targetDesc, this.index);\n        }\n        else {\n            for (let i = this.index, e = Math.min(this.top.children.length, i + 5); i < e; i++) {\n                let child = this.top.children[i];\n                if (child.matchesNode(node, outerDeco, innerDeco) && !this.preMatch.matched.has(child)) {\n                    found = i;\n                    break;\n                }\n            }\n        }\n        if (found < 0)\n            return false;\n        this.destroyBetween(this.index, found);\n        this.index++;\n        return true;\n    }\n    updateNodeAt(node, outerDeco, innerDeco, index, view) {\n        let child = this.top.children[index];\n        if (child.dirty == NODE_DIRTY && child.dom == child.contentDOM)\n            child.dirty = CONTENT_DIRTY;\n        if (!child.update(node, outerDeco, innerDeco, view))\n            return false;\n        this.destroyBetween(this.index, index);\n        this.index++;\n        return true;\n    }\n    findIndexWithChild(domNode) {\n        for (;;) {\n            let parent = domNode.parentNode;\n            if (!parent)\n                return -1;\n            if (parent == this.top.contentDOM) {\n                let desc = domNode.pmViewDesc;\n                if (desc)\n                    for (let i = this.index; i < this.top.children.length; i++) {\n                        if (this.top.children[i] == desc)\n                            return i;\n                    }\n                return -1;\n            }\n            domNode = parent;\n        }\n    }\n    // Try to update the next node, if any, to the given data. Checks\n    // pre-matches to avoid overwriting nodes that could still be used.\n    updateNextNode(node, outerDeco, innerDeco, view, index, pos) {\n        for (let i = this.index; i < this.top.children.length; i++) {\n            let next = this.top.children[i];\n            if (next instanceof NodeViewDesc) {\n                let preMatch = this.preMatch.matched.get(next);\n                if (preMatch != null && preMatch != index)\n                    return false;\n                let nextDOM = next.dom, updated;\n                // Can't update if nextDOM is or contains this.lock, except if\n                // it's a text node whose content already matches the new text\n                // and whose decorations match the new ones.\n                let locked = this.isLocked(nextDOM) &&\n                    !(node.isText && next.node && next.node.isText && next.nodeDOM.nodeValue == node.text &&\n                        next.dirty != NODE_DIRTY && sameOuterDeco(outerDeco, next.outerDeco));\n                if (!locked && next.update(node, outerDeco, innerDeco, view)) {\n                    this.destroyBetween(this.index, i);\n                    if (next.dom != nextDOM)\n                        this.changed = true;\n                    this.index++;\n                    return true;\n                }\n                else if (!locked && (updated = this.recreateWrapper(next, node, outerDeco, innerDeco, view, pos))) {\n                    this.top.children[this.index] = updated;\n                    updated.dirty = CONTENT_DIRTY;\n                    updated.updateChildren(view, pos + 1);\n                    updated.dirty = NOT_DIRTY;\n                    this.changed = true;\n                    this.index++;\n                    return true;\n                }\n                break;\n            }\n        }\n        return false;\n    }\n    // When a node with content is replaced by a different node with\n    // identical content, move over its children.\n    recreateWrapper(next, node, outerDeco, innerDeco, view, pos) {\n        if (next.dirty || node.isAtom || !next.children.length ||\n            !next.node.content.eq(node.content))\n            return null;\n        let wrapper = NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos);\n        if (!wrapper.contentDOM)\n            return null;\n        wrapper.children = next.children;\n        next.children = [];\n        for (let ch of wrapper.children)\n            ch.parent = wrapper;\n        return wrapper;\n    }\n    // Insert the node as a newly created node desc.\n    addNode(node, outerDeco, innerDeco, view, pos) {\n        let desc = NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos);\n        if (desc.contentDOM)\n            desc.updateChildren(view, pos + 1);\n        this.top.children.splice(this.index++, 0, desc);\n        this.changed = true;\n    }\n    placeWidget(widget, view, pos) {\n        let next = this.index < this.top.children.length ? this.top.children[this.index] : null;\n        if (next && next.matchesWidget(widget) &&\n            (widget == next.widget || !next.widget.type.toDOM.parentNode)) {\n            this.index++;\n        }\n        else {\n            let desc = new WidgetViewDesc(this.top, widget, view, pos);\n            this.top.children.splice(this.index++, 0, desc);\n            this.changed = true;\n        }\n    }\n    // Make sure a textblock looks and behaves correctly in\n    // contentEditable.\n    addTextblockHacks() {\n        let lastChild = this.top.children[this.index - 1], parent = this.top;\n        while (lastChild instanceof MarkViewDesc) {\n            parent = lastChild;\n            lastChild = parent.children[parent.children.length - 1];\n        }\n        if (!lastChild || // Empty textblock\n            !(lastChild instanceof TextViewDesc) ||\n            /\\n$/.test(lastChild.node.text) ||\n            (this.view.requiresGeckoHackNode && /\\s$/.test(lastChild.node.text))) {\n            // Avoid bugs in Safari's cursor drawing (#1165) and Chrome's mouse selection (#1152)\n            if ((safari || chrome) && lastChild && lastChild.dom.contentEditable == \"false\")\n                this.addHackNode(\"IMG\", parent);\n            this.addHackNode(\"BR\", this.top);\n        }\n    }\n    addHackNode(nodeName, parent) {\n        if (parent == this.top && this.index < parent.children.length && parent.children[this.index].matchesHack(nodeName)) {\n            this.index++;\n        }\n        else {\n            let dom = document.createElement(nodeName);\n            if (nodeName == \"IMG\") {\n                dom.className = \"ProseMirror-separator\";\n                dom.alt = \"\";\n            }\n            if (nodeName == \"BR\")\n                dom.className = \"ProseMirror-trailingBreak\";\n            let hack = new TrailingHackViewDesc(this.top, [], dom, null);\n            if (parent != this.top)\n                parent.children.push(hack);\n            else\n                parent.children.splice(this.index++, 0, hack);\n            this.changed = true;\n        }\n    }\n    isLocked(node) {\n        return this.lock && (node == this.lock || node.nodeType == 1 && node.contains(this.lock.parentNode));\n    }\n}\n// Iterate from the end of the fragment and array of descs to find\n// directly matching ones, in order to avoid overeagerly reusing those\n// for other nodes. Returns the fragment index of the first node that\n// is part of the sequence of matched nodes at the end of the\n// fragment.\nfunction preMatch(frag, parentDesc) {\n    let curDesc = parentDesc, descI = curDesc.children.length;\n    let fI = frag.childCount, matched = new Map, matches = [];\n    outer: while (fI > 0) {\n        let desc;\n        for (;;) {\n            if (descI) {\n                let next = curDesc.children[descI - 1];\n                if (next instanceof MarkViewDesc) {\n                    curDesc = next;\n                    descI = next.children.length;\n                }\n                else {\n                    desc = next;\n                    descI--;\n                    break;\n                }\n            }\n            else if (curDesc == parentDesc) {\n                break outer;\n            }\n            else {\n                // FIXME\n                descI = curDesc.parent.children.indexOf(curDesc);\n                curDesc = curDesc.parent;\n            }\n        }\n        let node = desc.node;\n        if (!node)\n            continue;\n        if (node != frag.child(fI - 1))\n            break;\n        --fI;\n        matched.set(desc, fI);\n        matches.push(desc);\n    }\n    return { index: fI, matched, matches: matches.reverse() };\n}\nfunction compareSide(a, b) {\n    return a.type.side - b.type.side;\n}\n// This function abstracts iterating over the nodes and decorations in\n// a fragment. Calls `onNode` for each node, with its local and child\n// decorations. Splits text nodes when there is a decoration starting\n// or ending inside of them. Calls `onWidget` for each widget.\nfunction iterDeco(parent, deco, onWidget, onNode) {\n    let locals = deco.locals(parent), offset = 0;\n    // Simple, cheap variant for when there are no local decorations\n    if (locals.length == 0) {\n        for (let i = 0; i < parent.childCount; i++) {\n            let child = parent.child(i);\n            onNode(child, locals, deco.forChild(offset, child), i);\n            offset += child.nodeSize;\n        }\n        return;\n    }\n    let decoIndex = 0, active = [], restNode = null;\n    for (let parentIndex = 0;;) {\n        if (decoIndex < locals.length && locals[decoIndex].to == offset) {\n            let widget = locals[decoIndex++], widgets;\n            while (decoIndex < locals.length && locals[decoIndex].to == offset)\n                (widgets || (widgets = [widget])).push(locals[decoIndex++]);\n            if (widgets) {\n                widgets.sort(compareSide);\n                for (let i = 0; i < widgets.length; i++)\n                    onWidget(widgets[i], parentIndex, !!restNode);\n            }\n            else {\n                onWidget(widget, parentIndex, !!restNode);\n            }\n        }\n        let child, index;\n        if (restNode) {\n            index = -1;\n            child = restNode;\n            restNode = null;\n        }\n        else if (parentIndex < parent.childCount) {\n            index = parentIndex;\n            child = parent.child(parentIndex++);\n        }\n        else {\n            break;\n        }\n        for (let i = 0; i < active.length; i++)\n            if (active[i].to <= offset)\n                active.splice(i--, 1);\n        while (decoIndex < locals.length && locals[decoIndex].from <= offset && locals[decoIndex].to > offset)\n            active.push(locals[decoIndex++]);\n        let end = offset + child.nodeSize;\n        if (child.isText) {\n            let cutAt = end;\n            if (decoIndex < locals.length && locals[decoIndex].from < cutAt)\n                cutAt = locals[decoIndex].from;\n            for (let i = 0; i < active.length; i++)\n                if (active[i].to < cutAt)\n                    cutAt = active[i].to;\n            if (cutAt < end) {\n                restNode = child.cut(cutAt - offset);\n                child = child.cut(0, cutAt - offset);\n                end = cutAt;\n                index = -1;\n            }\n        }\n        let outerDeco = child.isInline && !child.isLeaf ? active.filter(d => !d.inline) : active.slice();\n        onNode(child, outerDeco, deco.forChild(offset, child), index);\n        offset = end;\n    }\n}\n// List markers in Mobile Safari will mysteriously disappear\n// sometimes. This works around that.\nfunction iosHacks(dom) {\n    if (dom.nodeName == \"UL\" || dom.nodeName == \"OL\") {\n        let oldCSS = dom.style.cssText;\n        dom.style.cssText = oldCSS + \"; list-style: square !important\";\n        window.getComputedStyle(dom).listStyle;\n        dom.style.cssText = oldCSS;\n    }\n}\nfunction nearbyTextNode(node, offset) {\n    for (;;) {\n        if (node.nodeType == 3)\n            return node;\n        if (node.nodeType == 1 && offset > 0) {\n            if (node.childNodes.length > offset && node.childNodes[offset].nodeType == 3)\n                return node.childNodes[offset];\n            node = node.childNodes[offset - 1];\n            offset = nodeSize(node);\n        }\n        else if (node.nodeType == 1 && offset < node.childNodes.length) {\n            node = node.childNodes[offset];\n            offset = 0;\n        }\n        else {\n            return null;\n        }\n    }\n}\n// Find a piece of text in an inline fragment, overlapping from-to\nfunction findTextInFragment(frag, text, from, to) {\n    for (let i = 0, pos = 0; i < frag.childCount && pos <= to;) {\n        let child = frag.child(i++), childStart = pos;\n        pos += child.nodeSize;\n        if (!child.isText)\n            continue;\n        let str = child.text;\n        while (i < frag.childCount) {\n            let next = frag.child(i++);\n            pos += next.nodeSize;\n            if (!next.isText)\n                break;\n            str += next.text;\n        }\n        if (pos >= from) {\n            let found = childStart < to ? str.lastIndexOf(text, to - childStart - 1) : -1;\n            if (found >= 0 && found + text.length + childStart >= from)\n                return childStart + found;\n            if (from == to && str.length >= (to + text.length) - childStart &&\n                str.slice(to - childStart, to - childStart + text.length) == text)\n                return to;\n        }\n    }\n    return -1;\n}\n// Replace range from-to in an array of view descs with replacement\n// (may be null to just delete). This goes very much against the grain\n// of the rest of this code, which tends to create nodes with the\n// right shape in one go, rather than messing with them after\n// creation, but is necessary in the composition hack.\nfunction replaceNodes(nodes, from, to, view, replacement) {\n    let result = [];\n    for (let i = 0, off = 0; i < nodes.length; i++) {\n        let child = nodes[i], start = off, end = off += child.size;\n        if (start >= to || end <= from) {\n            result.push(child);\n        }\n        else {\n            if (start < from)\n                result.push(child.slice(0, from - start, view));\n            if (replacement) {\n                result.push(replacement);\n                replacement = undefined;\n            }\n            if (end > to)\n                result.push(child.slice(to - start, child.size, view));\n        }\n    }\n    return result;\n}\n\nfunction selectionFromDOM(view, origin = null) {\n    let domSel = view.domSelectionRange(), doc = view.state.doc;\n    if (!domSel.focusNode)\n        return null;\n    let nearestDesc = view.docView.nearestDesc(domSel.focusNode), inWidget = nearestDesc && nearestDesc.size == 0;\n    let head = view.docView.posFromDOM(domSel.focusNode, domSel.focusOffset, 1);\n    if (head < 0)\n        return null;\n    let $head = doc.resolve(head), $anchor, selection;\n    if (selectionCollapsed(domSel)) {\n        $anchor = $head;\n        while (nearestDesc && !nearestDesc.node)\n            nearestDesc = nearestDesc.parent;\n        let nearestDescNode = nearestDesc.node;\n        if (nearestDesc && nearestDescNode.isAtom && NodeSelection.isSelectable(nearestDescNode) && nearestDesc.parent\n            && !(nearestDescNode.isInline && isOnEdge(domSel.focusNode, domSel.focusOffset, nearestDesc.dom))) {\n            let pos = nearestDesc.posBefore;\n            selection = new NodeSelection(head == pos ? $head : doc.resolve(pos));\n        }\n    }\n    else {\n        let anchor = view.docView.posFromDOM(domSel.anchorNode, domSel.anchorOffset, 1);\n        if (anchor < 0)\n            return null;\n        $anchor = doc.resolve(anchor);\n    }\n    if (!selection) {\n        let bias = origin == \"pointer\" || (view.state.selection.head < $head.pos && !inWidget) ? 1 : -1;\n        selection = selectionBetween(view, $anchor, $head, bias);\n    }\n    return selection;\n}\nfunction editorOwnsSelection(view) {\n    return view.editable ? view.hasFocus() :\n        hasSelection(view) && document.activeElement && document.activeElement.contains(view.dom);\n}\nfunction selectionToDOM(view, force = false) {\n    let sel = view.state.selection;\n    syncNodeSelection(view, sel);\n    if (!editorOwnsSelection(view))\n        return;\n    // The delayed drag selection causes issues with Cell Selections\n    // in Safari. And the drag selection delay is to workarond issues\n    // which only present in Chrome.\n    if (!force && view.input.mouseDown && view.input.mouseDown.allowDefault && chrome) {\n        let domSel = view.domSelectionRange(), curSel = view.domObserver.currentSelection;\n        if (domSel.anchorNode && curSel.anchorNode &&\n            isEquivalentPosition(domSel.anchorNode, domSel.anchorOffset, curSel.anchorNode, curSel.anchorOffset)) {\n            view.input.mouseDown.delayedSelectionSync = true;\n            view.domObserver.setCurSelection();\n            return;\n        }\n    }\n    view.domObserver.disconnectSelection();\n    if (view.cursorWrapper) {\n        selectCursorWrapper(view);\n    }\n    else {\n        let { anchor, head } = sel, resetEditableFrom, resetEditableTo;\n        if (brokenSelectBetweenUneditable && !(sel instanceof TextSelection)) {\n            if (!sel.$from.parent.inlineContent)\n                resetEditableFrom = temporarilyEditableNear(view, sel.from);\n            if (!sel.empty && !sel.$from.parent.inlineContent)\n                resetEditableTo = temporarilyEditableNear(view, sel.to);\n        }\n        view.docView.setSelection(anchor, head, view.root, force);\n        if (brokenSelectBetweenUneditable) {\n            if (resetEditableFrom)\n                resetEditable(resetEditableFrom);\n            if (resetEditableTo)\n                resetEditable(resetEditableTo);\n        }\n        if (sel.visible) {\n            view.dom.classList.remove(\"ProseMirror-hideselection\");\n        }\n        else {\n            view.dom.classList.add(\"ProseMirror-hideselection\");\n            if (\"onselectionchange\" in document)\n                removeClassOnSelectionChange(view);\n        }\n    }\n    view.domObserver.setCurSelection();\n    view.domObserver.connectSelection();\n}\n// Kludge to work around Webkit not allowing a selection to start/end\n// between non-editable block nodes. We briefly make something\n// editable, set the selection, then set it uneditable again.\nconst brokenSelectBetweenUneditable = safari || chrome && chrome_version < 63;\nfunction temporarilyEditableNear(view, pos) {\n    let { node, offset } = view.docView.domFromPos(pos, 0);\n    let after = offset < node.childNodes.length ? node.childNodes[offset] : null;\n    let before = offset ? node.childNodes[offset - 1] : null;\n    if (safari && after && after.contentEditable == \"false\")\n        return setEditable(after);\n    if ((!after || after.contentEditable == \"false\") &&\n        (!before || before.contentEditable == \"false\")) {\n        if (after)\n            return setEditable(after);\n        else if (before)\n            return setEditable(before);\n    }\n}\nfunction setEditable(element) {\n    element.contentEditable = \"true\";\n    if (safari && element.draggable) {\n        element.draggable = false;\n        element.wasDraggable = true;\n    }\n    return element;\n}\nfunction resetEditable(element) {\n    element.contentEditable = \"false\";\n    if (element.wasDraggable) {\n        element.draggable = true;\n        element.wasDraggable = null;\n    }\n}\nfunction removeClassOnSelectionChange(view) {\n    let doc = view.dom.ownerDocument;\n    doc.removeEventListener(\"selectionchange\", view.input.hideSelectionGuard);\n    let domSel = view.domSelectionRange();\n    let node = domSel.anchorNode, offset = domSel.anchorOffset;\n    doc.addEventListener(\"selectionchange\", view.input.hideSelectionGuard = () => {\n        if (domSel.anchorNode != node || domSel.anchorOffset != offset) {\n            doc.removeEventListener(\"selectionchange\", view.input.hideSelectionGuard);\n            setTimeout(() => {\n                if (!editorOwnsSelection(view) || view.state.selection.visible)\n                    view.dom.classList.remove(\"ProseMirror-hideselection\");\n            }, 20);\n        }\n    });\n}\nfunction selectCursorWrapper(view) {\n    let domSel = view.domSelection(), range = document.createRange();\n    let node = view.cursorWrapper.dom, img = node.nodeName == \"IMG\";\n    if (img)\n        range.setEnd(node.parentNode, domIndex(node) + 1);\n    else\n        range.setEnd(node, 0);\n    range.collapse(false);\n    domSel.removeAllRanges();\n    domSel.addRange(range);\n    // Kludge to kill 'control selection' in IE11 when selecting an\n    // invisible cursor wrapper, since that would result in those weird\n    // resize handles and a selection that considers the absolutely\n    // positioned wrapper, rather than the root editable node, the\n    // focused element.\n    if (!img && !view.state.selection.visible && ie && ie_version <= 11) {\n        node.disabled = true;\n        node.disabled = false;\n    }\n}\nfunction syncNodeSelection(view, sel) {\n    if (sel instanceof NodeSelection) {\n        let desc = view.docView.descAt(sel.from);\n        if (desc != view.lastSelectedViewDesc) {\n            clearNodeSelection(view);\n            if (desc)\n                desc.selectNode();\n            view.lastSelectedViewDesc = desc;\n        }\n    }\n    else {\n        clearNodeSelection(view);\n    }\n}\n// Clear all DOM statefulness of the last node selection.\nfunction clearNodeSelection(view) {\n    if (view.lastSelectedViewDesc) {\n        if (view.lastSelectedViewDesc.parent)\n            view.lastSelectedViewDesc.deselectNode();\n        view.lastSelectedViewDesc = undefined;\n    }\n}\nfunction selectionBetween(view, $anchor, $head, bias) {\n    return view.someProp(\"createSelectionBetween\", f => f(view, $anchor, $head))\n        || TextSelection.between($anchor, $head, bias);\n}\nfunction hasFocusAndSelection(view) {\n    if (view.editable && !view.hasFocus())\n        return false;\n    return hasSelection(view);\n}\nfunction hasSelection(view) {\n    let sel = view.domSelectionRange();\n    if (!sel.anchorNode)\n        return false;\n    try {\n        // Firefox will raise 'permission denied' errors when accessing\n        // properties of `sel.anchorNode` when it's in a generated CSS\n        // element.\n        return view.dom.contains(sel.anchorNode.nodeType == 3 ? sel.anchorNode.parentNode : sel.anchorNode) &&\n            (view.editable || view.dom.contains(sel.focusNode.nodeType == 3 ? sel.focusNode.parentNode : sel.focusNode));\n    }\n    catch (_) {\n        return false;\n    }\n}\nfunction anchorInRightPlace(view) {\n    let anchorDOM = view.docView.domFromPos(view.state.selection.anchor, 0);\n    let domSel = view.domSelectionRange();\n    return isEquivalentPosition(anchorDOM.node, anchorDOM.offset, domSel.anchorNode, domSel.anchorOffset);\n}\n\nfunction moveSelectionBlock(state, dir) {\n    let { $anchor, $head } = state.selection;\n    let $side = dir > 0 ? $anchor.max($head) : $anchor.min($head);\n    let $start = !$side.parent.inlineContent ? $side : $side.depth ? state.doc.resolve(dir > 0 ? $side.after() : $side.before()) : null;\n    return $start && Selection.findFrom($start, dir);\n}\nfunction apply(view, sel) {\n    view.dispatch(view.state.tr.setSelection(sel).scrollIntoView());\n    return true;\n}\nfunction selectHorizontally(view, dir, mods) {\n    let sel = view.state.selection;\n    if (sel instanceof TextSelection) {\n        if (!sel.empty || mods.indexOf(\"s\") > -1) {\n            return false;\n        }\n        else if (view.endOfTextblock(dir > 0 ? \"forward\" : \"backward\")) {\n            let next = moveSelectionBlock(view.state, dir);\n            if (next && (next instanceof NodeSelection))\n                return apply(view, next);\n            return false;\n        }\n        else if (!(mac && mods.indexOf(\"m\") > -1)) {\n            let $head = sel.$head, node = $head.textOffset ? null : dir < 0 ? $head.nodeBefore : $head.nodeAfter, desc;\n            if (!node || node.isText)\n                return false;\n            let nodePos = dir < 0 ? $head.pos - node.nodeSize : $head.pos;\n            if (!(node.isAtom || (desc = view.docView.descAt(nodePos)) && !desc.contentDOM))\n                return false;\n            if (NodeSelection.isSelectable(node)) {\n                return apply(view, new NodeSelection(dir < 0 ? view.state.doc.resolve($head.pos - node.nodeSize) : $head));\n            }\n            else if (webkit) {\n                // Chrome and Safari will introduce extra pointless cursor\n                // positions around inline uneditable nodes, so we have to\n                // take over and move the cursor past them (#937)\n                return apply(view, new TextSelection(view.state.doc.resolve(dir < 0 ? nodePos : nodePos + node.nodeSize)));\n            }\n            else {\n                return false;\n            }\n        }\n    }\n    else if (sel instanceof NodeSelection && sel.node.isInline) {\n        return apply(view, new TextSelection(dir > 0 ? sel.$to : sel.$from));\n    }\n    else {\n        let next = moveSelectionBlock(view.state, dir);\n        if (next)\n            return apply(view, next);\n        return false;\n    }\n}\nfunction nodeLen(node) {\n    return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length;\n}\nfunction isIgnorable(dom) {\n    let desc = dom.pmViewDesc;\n    return desc && desc.size == 0 && (dom.nextSibling || dom.nodeName != \"BR\");\n}\nfunction skipIgnoredNodes(view, dir) {\n    return dir < 0 ? skipIgnoredNodesBefore(view) : skipIgnoredNodesAfter(view);\n}\n// Make sure the cursor isn't directly after one or more ignored\n// nodes, which will confuse the browser's cursor motion logic.\nfunction skipIgnoredNodesBefore(view) {\n    let sel = view.domSelectionRange();\n    let node = sel.focusNode, offset = sel.focusOffset;\n    if (!node)\n        return;\n    let moveNode, moveOffset, force = false;\n    // Gecko will do odd things when the selection is directly in front\n    // of a non-editable node, so in that case, move it into the next\n    // node if possible. Issue prosemirror/prosemirror#832.\n    if (gecko && node.nodeType == 1 && offset < nodeLen(node) && isIgnorable(node.childNodes[offset]))\n        force = true;\n    for (;;) {\n        if (offset > 0) {\n            if (node.nodeType != 1) {\n                break;\n            }\n            else {\n                let before = node.childNodes[offset - 1];\n                if (isIgnorable(before)) {\n                    moveNode = node;\n                    moveOffset = --offset;\n                }\n                else if (before.nodeType == 3) {\n                    node = before;\n                    offset = node.nodeValue.length;\n                }\n                else\n                    break;\n            }\n        }\n        else if (isBlockNode(node)) {\n            break;\n        }\n        else {\n            let prev = node.previousSibling;\n            while (prev && isIgnorable(prev)) {\n                moveNode = node.parentNode;\n                moveOffset = domIndex(prev);\n                prev = prev.previousSibling;\n            }\n            if (!prev) {\n                node = node.parentNode;\n                if (node == view.dom)\n                    break;\n                offset = 0;\n            }\n            else {\n                node = prev;\n                offset = nodeLen(node);\n            }\n        }\n    }\n    if (force)\n        setSelFocus(view, node, offset);\n    else if (moveNode)\n        setSelFocus(view, moveNode, moveOffset);\n}\n// Make sure the cursor isn't directly before one or more ignored\n// nodes.\nfunction skipIgnoredNodesAfter(view) {\n    let sel = view.domSelectionRange();\n    let node = sel.focusNode, offset = sel.focusOffset;\n    if (!node)\n        return;\n    let len = nodeLen(node);\n    let moveNode, moveOffset;\n    for (;;) {\n        if (offset < len) {\n            if (node.nodeType != 1)\n                break;\n            let after = node.childNodes[offset];\n            if (isIgnorable(after)) {\n                moveNode = node;\n                moveOffset = ++offset;\n            }\n            else\n                break;\n        }\n        else if (isBlockNode(node)) {\n            break;\n        }\n        else {\n            let next = node.nextSibling;\n            while (next && isIgnorable(next)) {\n                moveNode = next.parentNode;\n                moveOffset = domIndex(next) + 1;\n                next = next.nextSibling;\n            }\n            if (!next) {\n                node = node.parentNode;\n                if (node == view.dom)\n                    break;\n                offset = len = 0;\n            }\n            else {\n                node = next;\n                offset = 0;\n                len = nodeLen(node);\n            }\n        }\n    }\n    if (moveNode)\n        setSelFocus(view, moveNode, moveOffset);\n}\nfunction isBlockNode(dom) {\n    let desc = dom.pmViewDesc;\n    return desc && desc.node && desc.node.isBlock;\n}\nfunction setSelFocus(view, node, offset) {\n    let sel = view.domSelection();\n    if (selectionCollapsed(sel)) {\n        let range = document.createRange();\n        range.setEnd(node, offset);\n        range.setStart(node, offset);\n        sel.removeAllRanges();\n        sel.addRange(range);\n    }\n    else if (sel.extend) {\n        sel.extend(node, offset);\n    }\n    view.domObserver.setCurSelection();\n    let { state } = view;\n    // If no state update ends up happening, reset the selection.\n    setTimeout(() => {\n        if (view.state == state)\n            selectionToDOM(view);\n    }, 50);\n}\nfunction findDirection(view, pos) {\n    let $pos = view.state.doc.resolve(pos);\n    if (!(chrome || windows) && $pos.parent.inlineContent) {\n        let coords = view.coordsAtPos(pos);\n        if (pos > $pos.start()) {\n            let before = view.coordsAtPos(pos - 1);\n            let mid = (before.top + before.bottom) / 2;\n            if (mid > coords.top && mid < coords.bottom && Math.abs(before.left - coords.left) > 1)\n                return before.left < coords.left ? \"ltr\" : \"rtl\";\n        }\n        if (pos < $pos.end()) {\n            let after = view.coordsAtPos(pos + 1);\n            let mid = (after.top + after.bottom) / 2;\n            if (mid > coords.top && mid < coords.bottom && Math.abs(after.left - coords.left) > 1)\n                return after.left > coords.left ? \"ltr\" : \"rtl\";\n        }\n    }\n    let computed = getComputedStyle(view.dom).direction;\n    return computed == \"rtl\" ? \"rtl\" : \"ltr\";\n}\n// Check whether vertical selection motion would involve node\n// selections. If so, apply it (if not, the result is left to the\n// browser)\nfunction selectVertically(view, dir, mods) {\n    let sel = view.state.selection;\n    if (sel instanceof TextSelection && !sel.empty || mods.indexOf(\"s\") > -1)\n        return false;\n    if (mac && mods.indexOf(\"m\") > -1)\n        return false;\n    let { $from, $to } = sel;\n    if (!$from.parent.inlineContent || view.endOfTextblock(dir < 0 ? \"up\" : \"down\")) {\n        let next = moveSelectionBlock(view.state, dir);\n        if (next && (next instanceof NodeSelection))\n            return apply(view, next);\n    }\n    if (!$from.parent.inlineContent) {\n        let side = dir < 0 ? $from : $to;\n        let beyond = sel instanceof AllSelection ? Selection.near(side, dir) : Selection.findFrom(side, dir);\n        return beyond ? apply(view, beyond) : false;\n    }\n    return false;\n}\nfunction stopNativeHorizontalDelete(view, dir) {\n    if (!(view.state.selection instanceof TextSelection))\n        return true;\n    let { $head, $anchor, empty } = view.state.selection;\n    if (!$head.sameParent($anchor))\n        return true;\n    if (!empty)\n        return false;\n    if (view.endOfTextblock(dir > 0 ? \"forward\" : \"backward\"))\n        return true;\n    let nextNode = !$head.textOffset && (dir < 0 ? $head.nodeBefore : $head.nodeAfter);\n    if (nextNode && !nextNode.isText) {\n        let tr = view.state.tr;\n        if (dir < 0)\n            tr.delete($head.pos - nextNode.nodeSize, $head.pos);\n        else\n            tr.delete($head.pos, $head.pos + nextNode.nodeSize);\n        view.dispatch(tr);\n        return true;\n    }\n    return false;\n}\nfunction switchEditable(view, node, state) {\n    view.domObserver.stop();\n    node.contentEditable = state;\n    view.domObserver.start();\n}\n// Issue #867 / #1090 / https://bugs.chromium.org/p/chromium/issues/detail?id=903821\n// In which Safari (and at some point in the past, Chrome) does really\n// wrong things when the down arrow is pressed when the cursor is\n// directly at the start of a textblock and has an uneditable node\n// after it\nfunction safariDownArrowBug(view) {\n    if (!safari || view.state.selection.$head.parentOffset > 0)\n        return false;\n    let { focusNode, focusOffset } = view.domSelectionRange();\n    if (focusNode && focusNode.nodeType == 1 && focusOffset == 0 &&\n        focusNode.firstChild && focusNode.firstChild.contentEditable == \"false\") {\n        let child = focusNode.firstChild;\n        switchEditable(view, child, \"true\");\n        setTimeout(() => switchEditable(view, child, \"false\"), 20);\n    }\n    return false;\n}\n// A backdrop key mapping used to make sure we always suppress keys\n// that have a dangerous default effect, even if the commands they are\n// bound to return false, and to make sure that cursor-motion keys\n// find a cursor (as opposed to a node selection) when pressed. For\n// cursor-motion keys, the code in the handlers also takes care of\n// block selections.\nfunction getMods(event) {\n    let result = \"\";\n    if (event.ctrlKey)\n        result += \"c\";\n    if (event.metaKey)\n        result += \"m\";\n    if (event.altKey)\n        result += \"a\";\n    if (event.shiftKey)\n        result += \"s\";\n    return result;\n}\nfunction captureKeyDown(view, event) {\n    let code = event.keyCode, mods = getMods(event);\n    if (code == 8 || (mac && code == 72 && mods == \"c\")) { // Backspace, Ctrl-h on Mac\n        return stopNativeHorizontalDelete(view, -1) || skipIgnoredNodes(view, -1);\n    }\n    else if (code == 46 || (mac && code == 68 && mods == \"c\")) { // Delete, Ctrl-d on Mac\n        return stopNativeHorizontalDelete(view, 1) || skipIgnoredNodes(view, 1);\n    }\n    else if (code == 13 || code == 27) { // Enter, Esc\n        return true;\n    }\n    else if (code == 37 || (mac && code == 66 && mods == \"c\")) { // Left arrow, Ctrl-b on Mac\n        let dir = code == 37 ? (findDirection(view, view.state.selection.from) == \"ltr\" ? -1 : 1) : -1;\n        return selectHorizontally(view, dir, mods) || skipIgnoredNodes(view, dir);\n    }\n    else if (code == 39 || (mac && code == 70 && mods == \"c\")) { // Right arrow, Ctrl-f on Mac\n        let dir = code == 39 ? (findDirection(view, view.state.selection.from) == \"ltr\" ? 1 : -1) : 1;\n        return selectHorizontally(view, dir, mods) || skipIgnoredNodes(view, dir);\n    }\n    else if (code == 38 || (mac && code == 80 && mods == \"c\")) { // Up arrow, Ctrl-p on Mac\n        return selectVertically(view, -1, mods) || skipIgnoredNodes(view, -1);\n    }\n    else if (code == 40 || (mac && code == 78 && mods == \"c\")) { // Down arrow, Ctrl-n on Mac\n        return safariDownArrowBug(view) || selectVertically(view, 1, mods) || skipIgnoredNodesAfter(view);\n    }\n    else if (mods == (mac ? \"m\" : \"c\") &&\n        (code == 66 || code == 73 || code == 89 || code == 90)) { // Mod-[biyz]\n        return true;\n    }\n    return false;\n}\n\nfunction serializeForClipboard(view, slice) {\n    view.someProp(\"transformCopied\", f => { slice = f(slice, view); });\n    let context = [], { content, openStart, openEnd } = slice;\n    while (openStart > 1 && openEnd > 1 && content.childCount == 1 && content.firstChild.childCount == 1) {\n        openStart--;\n        openEnd--;\n        let node = content.firstChild;\n        context.push(node.type.name, node.attrs != node.type.defaultAttrs ? node.attrs : null);\n        content = node.content;\n    }\n    let serializer = view.someProp(\"clipboardSerializer\") || DOMSerializer.fromSchema(view.state.schema);\n    let doc = detachedDoc(), wrap = doc.createElement(\"div\");\n    wrap.appendChild(serializer.serializeFragment(content, { document: doc }));\n    let firstChild = wrap.firstChild, needsWrap, wrappers = 0;\n    while (firstChild && firstChild.nodeType == 1 && (needsWrap = wrapMap[firstChild.nodeName.toLowerCase()])) {\n        for (let i = needsWrap.length - 1; i >= 0; i--) {\n            let wrapper = doc.createElement(needsWrap[i]);\n            while (wrap.firstChild)\n                wrapper.appendChild(wrap.firstChild);\n            wrap.appendChild(wrapper);\n            wrappers++;\n        }\n        firstChild = wrap.firstChild;\n    }\n    if (firstChild && firstChild.nodeType == 1)\n        firstChild.setAttribute(\"data-pm-slice\", `${openStart} ${openEnd}${wrappers ? ` -${wrappers}` : \"\"} ${JSON.stringify(context)}`);\n    let text = view.someProp(\"clipboardTextSerializer\", f => f(slice, view)) ||\n        slice.content.textBetween(0, slice.content.size, \"\\n\\n\");\n    return { dom: wrap, text };\n}\n// Read a slice of content from the clipboard (or drop data).\nfunction parseFromClipboard(view, text, html, plainText, $context) {\n    let inCode = $context.parent.type.spec.code;\n    let dom, slice;\n    if (!html && !text)\n        return null;\n    let asText = text && (plainText || inCode || !html);\n    if (asText) {\n        view.someProp(\"transformPastedText\", f => { text = f(text, inCode || plainText, view); });\n        if (inCode)\n            return text ? new Slice(Fragment.from(view.state.schema.text(text.replace(/\\r\\n?/g, \"\\n\"))), 0, 0) : Slice.empty;\n        let parsed = view.someProp(\"clipboardTextParser\", f => f(text, $context, plainText, view));\n        if (parsed) {\n            slice = parsed;\n        }\n        else {\n            let marks = $context.marks();\n            let { schema } = view.state, serializer = DOMSerializer.fromSchema(schema);\n            dom = document.createElement(\"div\");\n            text.split(/(?:\\r\\n?|\\n)+/).forEach(block => {\n                let p = dom.appendChild(document.createElement(\"p\"));\n                if (block)\n                    p.appendChild(serializer.serializeNode(schema.text(block, marks)));\n            });\n        }\n    }\n    else {\n        view.someProp(\"transformPastedHTML\", f => { html = f(html, view); });\n        dom = readHTML(html);\n        if (webkit)\n            restoreReplacedSpaces(dom);\n    }\n    let contextNode = dom && dom.querySelector(\"[data-pm-slice]\");\n    let sliceData = contextNode && /^(\\d+) (\\d+)(?: -(\\d+))? (.*)/.exec(contextNode.getAttribute(\"data-pm-slice\") || \"\");\n    if (sliceData && sliceData[3])\n        for (let i = +sliceData[3]; i > 0; i--) {\n            let child = dom.firstChild;\n            while (child && child.nodeType != 1)\n                child = child.nextSibling;\n            if (!child)\n                break;\n            dom = child;\n        }\n    if (!slice) {\n        let parser = view.someProp(\"clipboardParser\") || view.someProp(\"domParser\") || DOMParser.fromSchema(view.state.schema);\n        slice = parser.parseSlice(dom, {\n            preserveWhitespace: !!(asText || sliceData),\n            context: $context,\n            ruleFromNode(dom) {\n                if (dom.nodeName == \"BR\" && !dom.nextSibling &&\n                    dom.parentNode && !inlineParents.test(dom.parentNode.nodeName))\n                    return { ignore: true };\n                return null;\n            }\n        });\n    }\n    if (sliceData) {\n        slice = addContext(closeSlice(slice, +sliceData[1], +sliceData[2]), sliceData[4]);\n    }\n    else { // HTML wasn't created by ProseMirror. Make sure top-level siblings are coherent\n        slice = Slice.maxOpen(normalizeSiblings(slice.content, $context), true);\n        if (slice.openStart || slice.openEnd) {\n            let openStart = 0, openEnd = 0;\n            for (let node = slice.content.firstChild; openStart < slice.openStart && !node.type.spec.isolating; openStart++, node = node.firstChild) { }\n            for (let node = slice.content.lastChild; openEnd < slice.openEnd && !node.type.spec.isolating; openEnd++, node = node.lastChild) { }\n            slice = closeSlice(slice, openStart, openEnd);\n        }\n    }\n    view.someProp(\"transformPasted\", f => { slice = f(slice, view); });\n    return slice;\n}\nconst inlineParents = /^(a|abbr|acronym|b|cite|code|del|em|i|ins|kbd|label|output|q|ruby|s|samp|span|strong|sub|sup|time|u|tt|var)$/i;\n// Takes a slice parsed with parseSlice, which means there hasn't been\n// any content-expression checking done on the top nodes, tries to\n// find a parent node in the current context that might fit the nodes,\n// and if successful, rebuilds the slice so that it fits into that parent.\n//\n// This addresses the problem that Transform.replace expects a\n// coherent slice, and will fail to place a set of siblings that don't\n// fit anywhere in the schema.\nfunction normalizeSiblings(fragment, $context) {\n    if (fragment.childCount < 2)\n        return fragment;\n    for (let d = $context.depth; d >= 0; d--) {\n        let parent = $context.node(d);\n        let match = parent.contentMatchAt($context.index(d));\n        let lastWrap, result = [];\n        fragment.forEach(node => {\n            if (!result)\n                return;\n            let wrap = match.findWrapping(node.type), inLast;\n            if (!wrap)\n                return result = null;\n            if (inLast = result.length && lastWrap.length && addToSibling(wrap, lastWrap, node, result[result.length - 1], 0)) {\n                result[result.length - 1] = inLast;\n            }\n            else {\n                if (result.length)\n                    result[result.length - 1] = closeRight(result[result.length - 1], lastWrap.length);\n                let wrapped = withWrappers(node, wrap);\n                result.push(wrapped);\n                match = match.matchType(wrapped.type);\n                lastWrap = wrap;\n            }\n        });\n        if (result)\n            return Fragment.from(result);\n    }\n    return fragment;\n}\nfunction withWrappers(node, wrap, from = 0) {\n    for (let i = wrap.length - 1; i >= from; i--)\n        node = wrap[i].create(null, Fragment.from(node));\n    return node;\n}\n// Used to group adjacent nodes wrapped in similar parents by\n// normalizeSiblings into the same parent node\nfunction addToSibling(wrap, lastWrap, node, sibling, depth) {\n    if (depth < wrap.length && depth < lastWrap.length && wrap[depth] == lastWrap[depth]) {\n        let inner = addToSibling(wrap, lastWrap, node, sibling.lastChild, depth + 1);\n        if (inner)\n            return sibling.copy(sibling.content.replaceChild(sibling.childCount - 1, inner));\n        let match = sibling.contentMatchAt(sibling.childCount);\n        if (match.matchType(depth == wrap.length - 1 ? node.type : wrap[depth + 1]))\n            return sibling.copy(sibling.content.append(Fragment.from(withWrappers(node, wrap, depth + 1))));\n    }\n}\nfunction closeRight(node, depth) {\n    if (depth == 0)\n        return node;\n    let fragment = node.content.replaceChild(node.childCount - 1, closeRight(node.lastChild, depth - 1));\n    let fill = node.contentMatchAt(node.childCount).fillBefore(Fragment.empty, true);\n    return node.copy(fragment.append(fill));\n}\nfunction closeRange(fragment, side, from, to, depth, openEnd) {\n    let node = side < 0 ? fragment.firstChild : fragment.lastChild, inner = node.content;\n    if (fragment.childCount > 1)\n        openEnd = 0;\n    if (depth < to - 1)\n        inner = closeRange(inner, side, from, to, depth + 1, openEnd);\n    if (depth >= from)\n        inner = side < 0 ? node.contentMatchAt(0).fillBefore(inner, openEnd <= depth).append(inner)\n            : inner.append(node.contentMatchAt(node.childCount).fillBefore(Fragment.empty, true));\n    return fragment.replaceChild(side < 0 ? 0 : fragment.childCount - 1, node.copy(inner));\n}\nfunction closeSlice(slice, openStart, openEnd) {\n    if (openStart < slice.openStart)\n        slice = new Slice(closeRange(slice.content, -1, openStart, slice.openStart, 0, slice.openEnd), openStart, slice.openEnd);\n    if (openEnd < slice.openEnd)\n        slice = new Slice(closeRange(slice.content, 1, openEnd, slice.openEnd, 0, 0), slice.openStart, openEnd);\n    return slice;\n}\n// Trick from jQuery -- some elements must be wrapped in other\n// elements for innerHTML to work. I.e. if you do `div.innerHTML =\n// \"<td>..</td>\"` the table cells are ignored.\nconst wrapMap = {\n    thead: [\"table\"],\n    tbody: [\"table\"],\n    tfoot: [\"table\"],\n    caption: [\"table\"],\n    colgroup: [\"table\"],\n    col: [\"table\", \"colgroup\"],\n    tr: [\"table\", \"tbody\"],\n    td: [\"table\", \"tbody\", \"tr\"],\n    th: [\"table\", \"tbody\", \"tr\"]\n};\nlet _detachedDoc = null;\nfunction detachedDoc() {\n    return _detachedDoc || (_detachedDoc = document.implementation.createHTMLDocument(\"title\"));\n}\nfunction readHTML(html) {\n    let metas = /^(\\s*<meta [^>]*>)*/.exec(html);\n    if (metas)\n        html = html.slice(metas[0].length);\n    let elt = detachedDoc().createElement(\"div\");\n    let firstTag = /<([a-z][^>\\s]+)/i.exec(html), wrap;\n    if (wrap = firstTag && wrapMap[firstTag[1].toLowerCase()])\n        html = wrap.map(n => \"<\" + n + \">\").join(\"\") + html + wrap.map(n => \"</\" + n + \">\").reverse().join(\"\");\n    elt.innerHTML = html;\n    if (wrap)\n        for (let i = 0; i < wrap.length; i++)\n            elt = elt.querySelector(wrap[i]) || elt;\n    return elt;\n}\n// Webkit browsers do some hard-to-predict replacement of regular\n// spaces with non-breaking spaces when putting content on the\n// clipboard. This tries to convert such non-breaking spaces (which\n// will be wrapped in a plain span on Chrome, a span with class\n// Apple-converted-space on Safari) back to regular spaces.\nfunction restoreReplacedSpaces(dom) {\n    let nodes = dom.querySelectorAll(chrome ? \"span:not([class]):not([style])\" : \"span.Apple-converted-space\");\n    for (let i = 0; i < nodes.length; i++) {\n        let node = nodes[i];\n        if (node.childNodes.length == 1 && node.textContent == \"\\u00a0\" && node.parentNode)\n            node.parentNode.replaceChild(dom.ownerDocument.createTextNode(\" \"), node);\n    }\n}\nfunction addContext(slice, context) {\n    if (!slice.size)\n        return slice;\n    let schema = slice.content.firstChild.type.schema, array;\n    try {\n        array = JSON.parse(context);\n    }\n    catch (e) {\n        return slice;\n    }\n    let { content, openStart, openEnd } = slice;\n    for (let i = array.length - 2; i >= 0; i -= 2) {\n        let type = schema.nodes[array[i]];\n        if (!type || type.hasRequiredAttrs())\n            break;\n        content = Fragment.from(type.create(array[i + 1], content));\n        openStart++;\n        openEnd++;\n    }\n    return new Slice(content, openStart, openEnd);\n}\n\n// A collection of DOM events that occur within the editor, and callback functions\n// to invoke when the event fires.\nconst handlers = {};\nconst editHandlers = {};\nconst passiveHandlers = { touchstart: true, touchmove: true };\nclass InputState {\n    constructor() {\n        this.shiftKey = false;\n        this.mouseDown = null;\n        this.lastKeyCode = null;\n        this.lastKeyCodeTime = 0;\n        this.lastClick = { time: 0, x: 0, y: 0, type: \"\" };\n        this.lastSelectionOrigin = null;\n        this.lastSelectionTime = 0;\n        this.lastIOSEnter = 0;\n        this.lastIOSEnterFallbackTimeout = -1;\n        this.lastFocus = 0;\n        this.lastTouch = 0;\n        this.lastAndroidDelete = 0;\n        this.composing = false;\n        this.composingTimeout = -1;\n        this.compositionNodes = [];\n        this.compositionEndedAt = -2e8;\n        this.compositionID = 1;\n        this.domChangeCount = 0;\n        this.eventHandlers = Object.create(null);\n        this.hideSelectionGuard = null;\n    }\n}\nfunction initInput(view) {\n    for (let event in handlers) {\n        let handler = handlers[event];\n        view.dom.addEventListener(event, view.input.eventHandlers[event] = (event) => {\n            if (eventBelongsToView(view, event) && !runCustomHandler(view, event) &&\n                (view.editable || !(event.type in editHandlers)))\n                handler(view, event);\n        }, passiveHandlers[event] ? { passive: true } : undefined);\n    }\n    // On Safari, for reasons beyond my understanding, adding an input\n    // event handler makes an issue where the composition vanishes when\n    // you press enter go away.\n    if (safari)\n        view.dom.addEventListener(\"input\", () => null);\n    ensureListeners(view);\n}\nfunction setSelectionOrigin(view, origin) {\n    view.input.lastSelectionOrigin = origin;\n    view.input.lastSelectionTime = Date.now();\n}\nfunction destroyInput(view) {\n    view.domObserver.stop();\n    for (let type in view.input.eventHandlers)\n        view.dom.removeEventListener(type, view.input.eventHandlers[type]);\n    clearTimeout(view.input.composingTimeout);\n    clearTimeout(view.input.lastIOSEnterFallbackTimeout);\n}\nfunction ensureListeners(view) {\n    view.someProp(\"handleDOMEvents\", currentHandlers => {\n        for (let type in currentHandlers)\n            if (!view.input.eventHandlers[type])\n                view.dom.addEventListener(type, view.input.eventHandlers[type] = event => runCustomHandler(view, event));\n    });\n}\nfunction runCustomHandler(view, event) {\n    return view.someProp(\"handleDOMEvents\", handlers => {\n        let handler = handlers[event.type];\n        return handler ? handler(view, event) || event.defaultPrevented : false;\n    });\n}\nfunction eventBelongsToView(view, event) {\n    if (!event.bubbles)\n        return true;\n    if (event.defaultPrevented)\n        return false;\n    for (let node = event.target; node != view.dom; node = node.parentNode)\n        if (!node || node.nodeType == 11 ||\n            (node.pmViewDesc && node.pmViewDesc.stopEvent(event)))\n            return false;\n    return true;\n}\nfunction dispatchEvent(view, event) {\n    if (!runCustomHandler(view, event) && handlers[event.type] &&\n        (view.editable || !(event.type in editHandlers)))\n        handlers[event.type](view, event);\n}\neditHandlers.keydown = (view, _event) => {\n    let event = _event;\n    view.input.shiftKey = event.keyCode == 16 || event.shiftKey;\n    if (inOrNearComposition(view, event))\n        return;\n    view.input.lastKeyCode = event.keyCode;\n    view.input.lastKeyCodeTime = Date.now();\n    // Suppress enter key events on Chrome Android, because those tend\n    // to be part of a confused sequence of composition events fired,\n    // and handling them eagerly tends to corrupt the input.\n    if (android && chrome && event.keyCode == 13)\n        return;\n    if (event.keyCode != 229)\n        view.domObserver.forceFlush();\n    // On iOS, if we preventDefault enter key presses, the virtual\n    // keyboard gets confused. So the hack here is to set a flag that\n    // makes the DOM change code recognize that what just happens should\n    // be replaced by whatever the Enter key handlers do.\n    if (ios && event.keyCode == 13 && !event.ctrlKey && !event.altKey && !event.metaKey) {\n        let now = Date.now();\n        view.input.lastIOSEnter = now;\n        view.input.lastIOSEnterFallbackTimeout = setTimeout(() => {\n            if (view.input.lastIOSEnter == now) {\n                view.someProp(\"handleKeyDown\", f => f(view, keyEvent(13, \"Enter\")));\n                view.input.lastIOSEnter = 0;\n            }\n        }, 200);\n    }\n    else if (view.someProp(\"handleKeyDown\", f => f(view, event)) || captureKeyDown(view, event)) {\n        event.preventDefault();\n    }\n    else {\n        setSelectionOrigin(view, \"key\");\n    }\n};\neditHandlers.keyup = (view, event) => {\n    if (event.keyCode == 16)\n        view.input.shiftKey = false;\n};\neditHandlers.keypress = (view, _event) => {\n    let event = _event;\n    if (inOrNearComposition(view, event) || !event.charCode ||\n        event.ctrlKey && !event.altKey || mac && event.metaKey)\n        return;\n    if (view.someProp(\"handleKeyPress\", f => f(view, event))) {\n        event.preventDefault();\n        return;\n    }\n    let sel = view.state.selection;\n    if (!(sel instanceof TextSelection) || !sel.$from.sameParent(sel.$to)) {\n        let text = String.fromCharCode(event.charCode);\n        if (!/[\\r\\n]/.test(text) && !view.someProp(\"handleTextInput\", f => f(view, sel.$from.pos, sel.$to.pos, text)))\n            view.dispatch(view.state.tr.insertText(text).scrollIntoView());\n        event.preventDefault();\n    }\n};\nfunction eventCoords(event) { return { left: event.clientX, top: event.clientY }; }\nfunction isNear(event, click) {\n    let dx = click.x - event.clientX, dy = click.y - event.clientY;\n    return dx * dx + dy * dy < 100;\n}\nfunction runHandlerOnContext(view, propName, pos, inside, event) {\n    if (inside == -1)\n        return false;\n    let $pos = view.state.doc.resolve(inside);\n    for (let i = $pos.depth + 1; i > 0; i--) {\n        if (view.someProp(propName, f => i > $pos.depth ? f(view, pos, $pos.nodeAfter, $pos.before(i), event, true)\n            : f(view, pos, $pos.node(i), $pos.before(i), event, false)))\n            return true;\n    }\n    return false;\n}\nfunction updateSelection(view, selection, origin) {\n    if (!view.focused)\n        view.focus();\n    let tr = view.state.tr.setSelection(selection);\n    if (origin == \"pointer\")\n        tr.setMeta(\"pointer\", true);\n    view.dispatch(tr);\n}\nfunction selectClickedLeaf(view, inside) {\n    if (inside == -1)\n        return false;\n    let $pos = view.state.doc.resolve(inside), node = $pos.nodeAfter;\n    if (node && node.isAtom && NodeSelection.isSelectable(node)) {\n        updateSelection(view, new NodeSelection($pos), \"pointer\");\n        return true;\n    }\n    return false;\n}\nfunction selectClickedNode(view, inside) {\n    if (inside == -1)\n        return false;\n    let sel = view.state.selection, selectedNode, selectAt;\n    if (sel instanceof NodeSelection)\n        selectedNode = sel.node;\n    let $pos = view.state.doc.resolve(inside);\n    for (let i = $pos.depth + 1; i > 0; i--) {\n        let node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);\n        if (NodeSelection.isSelectable(node)) {\n            if (selectedNode && sel.$from.depth > 0 &&\n                i >= sel.$from.depth && $pos.before(sel.$from.depth + 1) == sel.$from.pos)\n                selectAt = $pos.before(sel.$from.depth);\n            else\n                selectAt = $pos.before(i);\n            break;\n        }\n    }\n    if (selectAt != null) {\n        updateSelection(view, NodeSelection.create(view.state.doc, selectAt), \"pointer\");\n        return true;\n    }\n    else {\n        return false;\n    }\n}\nfunction handleSingleClick(view, pos, inside, event, selectNode) {\n    return runHandlerOnContext(view, \"handleClickOn\", pos, inside, event) ||\n        view.someProp(\"handleClick\", f => f(view, pos, event)) ||\n        (selectNode ? selectClickedNode(view, inside) : selectClickedLeaf(view, inside));\n}\nfunction handleDoubleClick(view, pos, inside, event) {\n    return runHandlerOnContext(view, \"handleDoubleClickOn\", pos, inside, event) ||\n        view.someProp(\"handleDoubleClick\", f => f(view, pos, event));\n}\nfunction handleTripleClick(view, pos, inside, event) {\n    return runHandlerOnContext(view, \"handleTripleClickOn\", pos, inside, event) ||\n        view.someProp(\"handleTripleClick\", f => f(view, pos, event)) ||\n        defaultTripleClick(view, inside, event);\n}\nfunction defaultTripleClick(view, inside, event) {\n    if (event.button != 0)\n        return false;\n    let doc = view.state.doc;\n    if (inside == -1) {\n        if (doc.inlineContent) {\n            updateSelection(view, TextSelection.create(doc, 0, doc.content.size), \"pointer\");\n            return true;\n        }\n        return false;\n    }\n    let $pos = doc.resolve(inside);\n    for (let i = $pos.depth + 1; i > 0; i--) {\n        let node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);\n        let nodePos = $pos.before(i);\n        if (node.inlineContent)\n            updateSelection(view, TextSelection.create(doc, nodePos + 1, nodePos + 1 + node.content.size), \"pointer\");\n        else if (NodeSelection.isSelectable(node))\n            updateSelection(view, NodeSelection.create(doc, nodePos), \"pointer\");\n        else\n            continue;\n        return true;\n    }\n}\nfunction forceDOMFlush(view) {\n    return endComposition(view);\n}\nconst selectNodeModifier = mac ? \"metaKey\" : \"ctrlKey\";\nhandlers.mousedown = (view, _event) => {\n    let event = _event;\n    view.input.shiftKey = event.shiftKey;\n    let flushed = forceDOMFlush(view);\n    let now = Date.now(), type = \"singleClick\";\n    if (now - view.input.lastClick.time < 500 && isNear(event, view.input.lastClick) && !event[selectNodeModifier]) {\n        if (view.input.lastClick.type == \"singleClick\")\n            type = \"doubleClick\";\n        else if (view.input.lastClick.type == \"doubleClick\")\n            type = \"tripleClick\";\n    }\n    view.input.lastClick = { time: now, x: event.clientX, y: event.clientY, type };\n    let pos = view.posAtCoords(eventCoords(event));\n    if (!pos)\n        return;\n    if (type == \"singleClick\") {\n        if (view.input.mouseDown)\n            view.input.mouseDown.done();\n        view.input.mouseDown = new MouseDown(view, pos, event, !!flushed);\n    }\n    else if ((type == \"doubleClick\" ? handleDoubleClick : handleTripleClick)(view, pos.pos, pos.inside, event)) {\n        event.preventDefault();\n    }\n    else {\n        setSelectionOrigin(view, \"pointer\");\n    }\n};\nclass MouseDown {\n    constructor(view, pos, event, flushed) {\n        this.view = view;\n        this.pos = pos;\n        this.event = event;\n        this.flushed = flushed;\n        this.delayedSelectionSync = false;\n        this.mightDrag = null;\n        this.startDoc = view.state.doc;\n        this.selectNode = !!event[selectNodeModifier];\n        this.allowDefault = event.shiftKey;\n        let targetNode, targetPos;\n        if (pos.inside > -1) {\n            targetNode = view.state.doc.nodeAt(pos.inside);\n            targetPos = pos.inside;\n        }\n        else {\n            let $pos = view.state.doc.resolve(pos.pos);\n            targetNode = $pos.parent;\n            targetPos = $pos.depth ? $pos.before() : 0;\n        }\n        const target = flushed ? null : event.target;\n        const targetDesc = target ? view.docView.nearestDesc(target, true) : null;\n        this.target = targetDesc ? targetDesc.dom : null;\n        let { selection } = view.state;\n        if (event.button == 0 &&\n            targetNode.type.spec.draggable && targetNode.type.spec.selectable !== false ||\n            selection instanceof NodeSelection && selection.from <= targetPos && selection.to > targetPos)\n            this.mightDrag = {\n                node: targetNode,\n                pos: targetPos,\n                addAttr: !!(this.target && !this.target.draggable),\n                setUneditable: !!(this.target && gecko && !this.target.hasAttribute(\"contentEditable\"))\n            };\n        if (this.target && this.mightDrag && (this.mightDrag.addAttr || this.mightDrag.setUneditable)) {\n            this.view.domObserver.stop();\n            if (this.mightDrag.addAttr)\n                this.target.draggable = true;\n            if (this.mightDrag.setUneditable)\n                setTimeout(() => {\n                    if (this.view.input.mouseDown == this)\n                        this.target.setAttribute(\"contentEditable\", \"false\");\n                }, 20);\n            this.view.domObserver.start();\n        }\n        view.root.addEventListener(\"mouseup\", this.up = this.up.bind(this));\n        view.root.addEventListener(\"mousemove\", this.move = this.move.bind(this));\n        setSelectionOrigin(view, \"pointer\");\n    }\n    done() {\n        this.view.root.removeEventListener(\"mouseup\", this.up);\n        this.view.root.removeEventListener(\"mousemove\", this.move);\n        if (this.mightDrag && this.target) {\n            this.view.domObserver.stop();\n            if (this.mightDrag.addAttr)\n                this.target.removeAttribute(\"draggable\");\n            if (this.mightDrag.setUneditable)\n                this.target.removeAttribute(\"contentEditable\");\n            this.view.domObserver.start();\n        }\n        if (this.delayedSelectionSync)\n            setTimeout(() => selectionToDOM(this.view));\n        this.view.input.mouseDown = null;\n    }\n    up(event) {\n        this.done();\n        if (!this.view.dom.contains(event.target))\n            return;\n        let pos = this.pos;\n        if (this.view.state.doc != this.startDoc)\n            pos = this.view.posAtCoords(eventCoords(event));\n        this.updateAllowDefault(event);\n        if (this.allowDefault || !pos) {\n            setSelectionOrigin(this.view, \"pointer\");\n        }\n        else if (handleSingleClick(this.view, pos.pos, pos.inside, event, this.selectNode)) {\n            event.preventDefault();\n        }\n        else if (event.button == 0 &&\n            (this.flushed ||\n                // Safari ignores clicks on draggable elements\n                (safari && this.mightDrag && !this.mightDrag.node.isAtom) ||\n                // Chrome will sometimes treat a node selection as a\n                // cursor, but still report that the node is selected\n                // when asked through getSelection. You'll then get a\n                // situation where clicking at the point where that\n                // (hidden) cursor is doesn't change the selection, and\n                // thus doesn't get a reaction from ProseMirror. This\n                // works around that.\n                (chrome && !this.view.state.selection.visible &&\n                    Math.min(Math.abs(pos.pos - this.view.state.selection.from), Math.abs(pos.pos - this.view.state.selection.to)) <= 2))) {\n            updateSelection(this.view, Selection.near(this.view.state.doc.resolve(pos.pos)), \"pointer\");\n            event.preventDefault();\n        }\n        else {\n            setSelectionOrigin(this.view, \"pointer\");\n        }\n    }\n    move(event) {\n        this.updateAllowDefault(event);\n        setSelectionOrigin(this.view, \"pointer\");\n        if (event.buttons == 0)\n            this.done();\n    }\n    updateAllowDefault(event) {\n        if (!this.allowDefault && (Math.abs(this.event.x - event.clientX) > 4 ||\n            Math.abs(this.event.y - event.clientY) > 4))\n            this.allowDefault = true;\n    }\n}\nhandlers.touchstart = view => {\n    view.input.lastTouch = Date.now();\n    forceDOMFlush(view);\n    setSelectionOrigin(view, \"pointer\");\n};\nhandlers.touchmove = view => {\n    view.input.lastTouch = Date.now();\n    setSelectionOrigin(view, \"pointer\");\n};\nhandlers.contextmenu = view => forceDOMFlush(view);\nfunction inOrNearComposition(view, event) {\n    if (view.composing)\n        return true;\n    // See https://www.stum.de/2016/06/24/handling-ime-events-in-javascript/.\n    // On Japanese input method editors (IMEs), the Enter key is used to confirm character\n    // selection. On Safari, when Enter is pressed, compositionend and keydown events are\n    // emitted. The keydown event triggers newline insertion, which we don't want.\n    // This method returns true if the keydown event should be ignored.\n    // We only ignore it once, as pressing Enter a second time *should* insert a newline.\n    // Furthermore, the keydown event timestamp must be close to the compositionEndedAt timestamp.\n    // This guards against the case where compositionend is triggered without the keyboard\n    // (e.g. character confirmation may be done with the mouse), and keydown is triggered\n    // afterwards- we wouldn't want to ignore the keydown event in this case.\n    if (safari && Math.abs(event.timeStamp - view.input.compositionEndedAt) < 500) {\n        view.input.compositionEndedAt = -2e8;\n        return true;\n    }\n    return false;\n}\n// Drop active composition after 5 seconds of inactivity on Android\nconst timeoutComposition = android ? 5000 : -1;\neditHandlers.compositionstart = editHandlers.compositionupdate = view => {\n    if (!view.composing) {\n        view.domObserver.flush();\n        let { state } = view, $pos = state.selection.$from;\n        if (state.selection.empty &&\n            (state.storedMarks ||\n                (!$pos.textOffset && $pos.parentOffset && $pos.nodeBefore.marks.some(m => m.type.spec.inclusive === false)))) {\n            // Need to wrap the cursor in mark nodes different from the ones in the DOM context\n            view.markCursor = view.state.storedMarks || $pos.marks();\n            endComposition(view, true);\n            view.markCursor = null;\n        }\n        else {\n            endComposition(view);\n            // In firefox, if the cursor is after but outside a marked node,\n            // the inserted text won't inherit the marks. So this moves it\n            // inside if necessary.\n            if (gecko && state.selection.empty && $pos.parentOffset && !$pos.textOffset && $pos.nodeBefore.marks.length) {\n                let sel = view.domSelectionRange();\n                for (let node = sel.focusNode, offset = sel.focusOffset; node && node.nodeType == 1 && offset != 0;) {\n                    let before = offset < 0 ? node.lastChild : node.childNodes[offset - 1];\n                    if (!before)\n                        break;\n                    if (before.nodeType == 3) {\n                        view.domSelection().collapse(before, before.nodeValue.length);\n                        break;\n                    }\n                    else {\n                        node = before;\n                        offset = -1;\n                    }\n                }\n            }\n        }\n        view.input.composing = true;\n    }\n    scheduleComposeEnd(view, timeoutComposition);\n};\neditHandlers.compositionend = (view, event) => {\n    if (view.composing) {\n        view.input.composing = false;\n        view.input.compositionEndedAt = event.timeStamp;\n        view.input.compositionID++;\n        scheduleComposeEnd(view, 20);\n    }\n};\nfunction scheduleComposeEnd(view, delay) {\n    clearTimeout(view.input.composingTimeout);\n    if (delay > -1)\n        view.input.composingTimeout = setTimeout(() => endComposition(view), delay);\n}\nfunction clearComposition(view) {\n    if (view.composing) {\n        view.input.composing = false;\n        view.input.compositionEndedAt = timestampFromCustomEvent();\n    }\n    while (view.input.compositionNodes.length > 0)\n        view.input.compositionNodes.pop().markParentsDirty();\n}\nfunction timestampFromCustomEvent() {\n    let event = document.createEvent(\"Event\");\n    event.initEvent(\"event\", true, true);\n    return event.timeStamp;\n}\n/**\n@internal\n*/\nfunction endComposition(view, forceUpdate = false) {\n    if (android && view.domObserver.flushingSoon >= 0)\n        return;\n    view.domObserver.forceFlush();\n    clearComposition(view);\n    if (forceUpdate || view.docView && view.docView.dirty) {\n        let sel = selectionFromDOM(view);\n        if (sel && !sel.eq(view.state.selection))\n            view.dispatch(view.state.tr.setSelection(sel));\n        else\n            view.updateState(view.state);\n        return true;\n    }\n    return false;\n}\nfunction captureCopy(view, dom) {\n    // The extra wrapper is somehow necessary on IE/Edge to prevent the\n    // content from being mangled when it is put onto the clipboard\n    if (!view.dom.parentNode)\n        return;\n    let wrap = view.dom.parentNode.appendChild(document.createElement(\"div\"));\n    wrap.appendChild(dom);\n    wrap.style.cssText = \"position: fixed; left: -10000px; top: 10px\";\n    let sel = getSelection(), range = document.createRange();\n    range.selectNodeContents(dom);\n    // Done because IE will fire a selectionchange moving the selection\n    // to its start when removeAllRanges is called and the editor still\n    // has focus (which will mess up the editor's selection state).\n    view.dom.blur();\n    sel.removeAllRanges();\n    sel.addRange(range);\n    setTimeout(() => {\n        if (wrap.parentNode)\n            wrap.parentNode.removeChild(wrap);\n        view.focus();\n    }, 50);\n}\n// This is very crude, but unfortunately both these browsers _pretend_\n// that they have a clipboard API—all the objects and methods are\n// there, they just don't work, and they are hard to test.\nconst brokenClipboardAPI = (ie && ie_version < 15) ||\n    (ios && webkit_version < 604);\nhandlers.copy = editHandlers.cut = (view, _event) => {\n    let event = _event;\n    let sel = view.state.selection, cut = event.type == \"cut\";\n    if (sel.empty)\n        return;\n    // IE and Edge's clipboard interface is completely broken\n    let data = brokenClipboardAPI ? null : event.clipboardData;\n    let slice = sel.content(), { dom, text } = serializeForClipboard(view, slice);\n    if (data) {\n        event.preventDefault();\n        data.clearData();\n        data.setData(\"text/html\", dom.innerHTML);\n        data.setData(\"text/plain\", text);\n    }\n    else {\n        captureCopy(view, dom);\n    }\n    if (cut)\n        view.dispatch(view.state.tr.deleteSelection().scrollIntoView().setMeta(\"uiEvent\", \"cut\"));\n};\nfunction sliceSingleNode(slice) {\n    return slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1 ? slice.content.firstChild : null;\n}\nfunction capturePaste(view, event) {\n    if (!view.dom.parentNode)\n        return;\n    let plainText = view.input.shiftKey || view.state.selection.$from.parent.type.spec.code;\n    let target = view.dom.parentNode.appendChild(document.createElement(plainText ? \"textarea\" : \"div\"));\n    if (!plainText)\n        target.contentEditable = \"true\";\n    target.style.cssText = \"position: fixed; left: -10000px; top: 10px\";\n    target.focus();\n    setTimeout(() => {\n        view.focus();\n        if (target.parentNode)\n            target.parentNode.removeChild(target);\n        if (plainText)\n            doPaste(view, target.value, null, view.input.shiftKey, event);\n        else\n            doPaste(view, target.textContent, target.innerHTML, view.input.shiftKey, event);\n    }, 50);\n}\nfunction doPaste(view, text, html, preferPlain, event) {\n    let slice = parseFromClipboard(view, text, html, preferPlain, view.state.selection.$from);\n    if (view.someProp(\"handlePaste\", f => f(view, event, slice || Slice.empty)))\n        return true;\n    if (!slice)\n        return false;\n    let singleNode = sliceSingleNode(slice);\n    let tr = singleNode\n        ? view.state.tr.replaceSelectionWith(singleNode, view.input.shiftKey)\n        : view.state.tr.replaceSelection(slice);\n    view.dispatch(tr.scrollIntoView().setMeta(\"paste\", true).setMeta(\"uiEvent\", \"paste\"));\n    return true;\n}\neditHandlers.paste = (view, _event) => {\n    let event = _event;\n    // Handling paste from JavaScript during composition is very poorly\n    // handled by browsers, so as a dodgy but preferable kludge, we just\n    // let the browser do its native thing there, except on Android,\n    // where the editor is almost always composing.\n    if (view.composing && !android)\n        return;\n    let data = brokenClipboardAPI ? null : event.clipboardData;\n    if (data && doPaste(view, data.getData(\"text/plain\"), data.getData(\"text/html\"), view.input.shiftKey, event))\n        event.preventDefault();\n    else\n        capturePaste(view, event);\n};\nclass Dragging {\n    constructor(slice, move) {\n        this.slice = slice;\n        this.move = move;\n    }\n}\nconst dragCopyModifier = mac ? \"altKey\" : \"ctrlKey\";\nhandlers.dragstart = (view, _event) => {\n    let event = _event;\n    let mouseDown = view.input.mouseDown;\n    if (mouseDown)\n        mouseDown.done();\n    if (!event.dataTransfer)\n        return;\n    let sel = view.state.selection;\n    let pos = sel.empty ? null : view.posAtCoords(eventCoords(event));\n    if (pos && pos.pos >= sel.from && pos.pos <= (sel instanceof NodeSelection ? sel.to - 1 : sel.to)) ;\n    else if (mouseDown && mouseDown.mightDrag) {\n        view.dispatch(view.state.tr.setSelection(NodeSelection.create(view.state.doc, mouseDown.mightDrag.pos)));\n    }\n    else if (event.target && event.target.nodeType == 1) {\n        let desc = view.docView.nearestDesc(event.target, true);\n        if (desc && desc.node.type.spec.draggable && desc != view.docView)\n            view.dispatch(view.state.tr.setSelection(NodeSelection.create(view.state.doc, desc.posBefore)));\n    }\n    let slice = view.state.selection.content(), { dom, text } = serializeForClipboard(view, slice);\n    event.dataTransfer.clearData();\n    event.dataTransfer.setData(brokenClipboardAPI ? \"Text\" : \"text/html\", dom.innerHTML);\n    // See https://github.com/ProseMirror/prosemirror/issues/1156\n    event.dataTransfer.effectAllowed = \"copyMove\";\n    if (!brokenClipboardAPI)\n        event.dataTransfer.setData(\"text/plain\", text);\n    view.dragging = new Dragging(slice, !event[dragCopyModifier]);\n};\nhandlers.dragend = view => {\n    let dragging = view.dragging;\n    window.setTimeout(() => {\n        if (view.dragging == dragging)\n            view.dragging = null;\n    }, 50);\n};\neditHandlers.dragover = editHandlers.dragenter = (_, e) => e.preventDefault();\neditHandlers.drop = (view, _event) => {\n    let event = _event;\n    let dragging = view.dragging;\n    view.dragging = null;\n    if (!event.dataTransfer)\n        return;\n    let eventPos = view.posAtCoords(eventCoords(event));\n    if (!eventPos)\n        return;\n    let $mouse = view.state.doc.resolve(eventPos.pos);\n    let slice = dragging && dragging.slice;\n    if (slice) {\n        view.someProp(\"transformPasted\", f => { slice = f(slice, view); });\n    }\n    else {\n        slice = parseFromClipboard(view, event.dataTransfer.getData(brokenClipboardAPI ? \"Text\" : \"text/plain\"), brokenClipboardAPI ? null : event.dataTransfer.getData(\"text/html\"), false, $mouse);\n    }\n    let move = !!(dragging && !event[dragCopyModifier]);\n    if (view.someProp(\"handleDrop\", f => f(view, event, slice || Slice.empty, move))) {\n        event.preventDefault();\n        return;\n    }\n    if (!slice)\n        return;\n    event.preventDefault();\n    let insertPos = slice ? dropPoint(view.state.doc, $mouse.pos, slice) : $mouse.pos;\n    if (insertPos == null)\n        insertPos = $mouse.pos;\n    let tr = view.state.tr;\n    if (move)\n        tr.deleteSelection();\n    let pos = tr.mapping.map(insertPos);\n    let isNode = slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1;\n    let beforeInsert = tr.doc;\n    if (isNode)\n        tr.replaceRangeWith(pos, pos, slice.content.firstChild);\n    else\n        tr.replaceRange(pos, pos, slice);\n    if (tr.doc.eq(beforeInsert))\n        return;\n    let $pos = tr.doc.resolve(pos);\n    if (isNode && NodeSelection.isSelectable(slice.content.firstChild) &&\n        $pos.nodeAfter && $pos.nodeAfter.sameMarkup(slice.content.firstChild)) {\n        tr.setSelection(new NodeSelection($pos));\n    }\n    else {\n        let end = tr.mapping.map(insertPos);\n        tr.mapping.maps[tr.mapping.maps.length - 1].forEach((_from, _to, _newFrom, newTo) => end = newTo);\n        tr.setSelection(selectionBetween(view, $pos, tr.doc.resolve(end)));\n    }\n    view.focus();\n    view.dispatch(tr.setMeta(\"uiEvent\", \"drop\"));\n};\nhandlers.focus = view => {\n    view.input.lastFocus = Date.now();\n    if (!view.focused) {\n        view.domObserver.stop();\n        view.dom.classList.add(\"ProseMirror-focused\");\n        view.domObserver.start();\n        view.focused = true;\n        setTimeout(() => {\n            if (view.docView && view.hasFocus() && !view.domObserver.currentSelection.eq(view.domSelectionRange()))\n                selectionToDOM(view);\n        }, 20);\n    }\n};\nhandlers.blur = (view, _event) => {\n    let event = _event;\n    if (view.focused) {\n        view.domObserver.stop();\n        view.dom.classList.remove(\"ProseMirror-focused\");\n        view.domObserver.start();\n        if (event.relatedTarget && view.dom.contains(event.relatedTarget))\n            view.domObserver.currentSelection.clear();\n        view.focused = false;\n    }\n};\nhandlers.beforeinput = (view, _event) => {\n    let event = _event;\n    // We should probably do more with beforeinput events, but support\n    // is so spotty that I'm still waiting to see where they are going.\n    // Very specific hack to deal with backspace sometimes failing on\n    // Chrome Android when after an uneditable node.\n    if (chrome && android && event.inputType == \"deleteContentBackward\") {\n        view.domObserver.flushSoon();\n        let { domChangeCount } = view.input;\n        setTimeout(() => {\n            if (view.input.domChangeCount != domChangeCount)\n                return; // Event already had some effect\n            // This bug tends to close the virtual keyboard, so we refocus\n            view.dom.blur();\n            view.focus();\n            if (view.someProp(\"handleKeyDown\", f => f(view, keyEvent(8, \"Backspace\"))))\n                return;\n            let { $cursor } = view.state.selection;\n            // Crude approximation of backspace behavior when no command handled it\n            if ($cursor && $cursor.pos > 0)\n                view.dispatch(view.state.tr.delete($cursor.pos - 1, $cursor.pos).scrollIntoView());\n        }, 50);\n    }\n};\n// Make sure all handlers get registered\nfor (let prop in editHandlers)\n    handlers[prop] = editHandlers[prop];\n\nfunction compareObjs(a, b) {\n    if (a == b)\n        return true;\n    for (let p in a)\n        if (a[p] !== b[p])\n            return false;\n    for (let p in b)\n        if (!(p in a))\n            return false;\n    return true;\n}\nclass WidgetType {\n    constructor(toDOM, spec) {\n        this.toDOM = toDOM;\n        this.spec = spec || noSpec;\n        this.side = this.spec.side || 0;\n    }\n    map(mapping, span, offset, oldOffset) {\n        let { pos, deleted } = mapping.mapResult(span.from + oldOffset, this.side < 0 ? -1 : 1);\n        return deleted ? null : new Decoration(pos - offset, pos - offset, this);\n    }\n    valid() { return true; }\n    eq(other) {\n        return this == other ||\n            (other instanceof WidgetType &&\n                (this.spec.key && this.spec.key == other.spec.key ||\n                    this.toDOM == other.toDOM && compareObjs(this.spec, other.spec)));\n    }\n    destroy(node) {\n        if (this.spec.destroy)\n            this.spec.destroy(node);\n    }\n}\nclass InlineType {\n    constructor(attrs, spec) {\n        this.attrs = attrs;\n        this.spec = spec || noSpec;\n    }\n    map(mapping, span, offset, oldOffset) {\n        let from = mapping.map(span.from + oldOffset, this.spec.inclusiveStart ? -1 : 1) - offset;\n        let to = mapping.map(span.to + oldOffset, this.spec.inclusiveEnd ? 1 : -1) - offset;\n        return from >= to ? null : new Decoration(from, to, this);\n    }\n    valid(_, span) { return span.from < span.to; }\n    eq(other) {\n        return this == other ||\n            (other instanceof InlineType && compareObjs(this.attrs, other.attrs) &&\n                compareObjs(this.spec, other.spec));\n    }\n    static is(span) { return span.type instanceof InlineType; }\n    destroy() { }\n}\nclass NodeType {\n    constructor(attrs, spec) {\n        this.attrs = attrs;\n        this.spec = spec || noSpec;\n    }\n    map(mapping, span, offset, oldOffset) {\n        let from = mapping.mapResult(span.from + oldOffset, 1);\n        if (from.deleted)\n            return null;\n        let to = mapping.mapResult(span.to + oldOffset, -1);\n        if (to.deleted || to.pos <= from.pos)\n            return null;\n        return new Decoration(from.pos - offset, to.pos - offset, this);\n    }\n    valid(node, span) {\n        let { index, offset } = node.content.findIndex(span.from), child;\n        return offset == span.from && !(child = node.child(index)).isText && offset + child.nodeSize == span.to;\n    }\n    eq(other) {\n        return this == other ||\n            (other instanceof NodeType && compareObjs(this.attrs, other.attrs) &&\n                compareObjs(this.spec, other.spec));\n    }\n    destroy() { }\n}\n/**\nDecoration objects can be provided to the view through the\n[`decorations` prop](https://prosemirror.net/docs/ref/#view.EditorProps.decorations). They come in\nseveral variants—see the static members of this class for details.\n*/\nclass Decoration {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The start position of the decoration.\n    */\n    from, \n    /**\n    The end position. Will be the same as `from` for [widget\n    decorations](https://prosemirror.net/docs/ref/#view.Decoration^widget).\n    */\n    to, \n    /**\n    @internal\n    */\n    type) {\n        this.from = from;\n        this.to = to;\n        this.type = type;\n    }\n    /**\n    @internal\n    */\n    copy(from, to) {\n        return new Decoration(from, to, this.type);\n    }\n    /**\n    @internal\n    */\n    eq(other, offset = 0) {\n        return this.type.eq(other.type) && this.from + offset == other.from && this.to + offset == other.to;\n    }\n    /**\n    @internal\n    */\n    map(mapping, offset, oldOffset) {\n        return this.type.map(mapping, this, offset, oldOffset);\n    }\n    /**\n    Creates a widget decoration, which is a DOM node that's shown in\n    the document at the given position. It is recommended that you\n    delay rendering the widget by passing a function that will be\n    called when the widget is actually drawn in a view, but you can\n    also directly pass a DOM node. `getPos` can be used to find the\n    widget's current document position.\n    */\n    static widget(pos, toDOM, spec) {\n        return new Decoration(pos, pos, new WidgetType(toDOM, spec));\n    }\n    /**\n    Creates an inline decoration, which adds the given attributes to\n    each inline node between `from` and `to`.\n    */\n    static inline(from, to, attrs, spec) {\n        return new Decoration(from, to, new InlineType(attrs, spec));\n    }\n    /**\n    Creates a node decoration. `from` and `to` should point precisely\n    before and after a node in the document. That node, and only that\n    node, will receive the given attributes.\n    */\n    static node(from, to, attrs, spec) {\n        return new Decoration(from, to, new NodeType(attrs, spec));\n    }\n    /**\n    The spec provided when creating this decoration. Can be useful\n    if you've stored extra information in that object.\n    */\n    get spec() { return this.type.spec; }\n    /**\n    @internal\n    */\n    get inline() { return this.type instanceof InlineType; }\n}\nconst none = [], noSpec = {};\n/**\nA collection of [decorations](https://prosemirror.net/docs/ref/#view.Decoration), organized in such\na way that the drawing algorithm can efficiently use and compare\nthem. This is a persistent data structure—it is not modified,\nupdates create a new value.\n*/\nclass DecorationSet {\n    /**\n    @internal\n    */\n    constructor(local, children) {\n        this.local = local.length ? local : none;\n        this.children = children.length ? children : none;\n    }\n    /**\n    Create a set of decorations, using the structure of the given\n    document.\n    */\n    static create(doc, decorations) {\n        return decorations.length ? buildTree(decorations, doc, 0, noSpec) : empty;\n    }\n    /**\n    Find all decorations in this set which touch the given range\n    (including decorations that start or end directly at the\n    boundaries) and match the given predicate on their spec. When\n    `start` and `end` are omitted, all decorations in the set are\n    considered. When `predicate` isn't given, all decorations are\n    assumed to match.\n    */\n    find(start, end, predicate) {\n        let result = [];\n        this.findInner(start == null ? 0 : start, end == null ? 1e9 : end, result, 0, predicate);\n        return result;\n    }\n    findInner(start, end, result, offset, predicate) {\n        for (let i = 0; i < this.local.length; i++) {\n            let span = this.local[i];\n            if (span.from <= end && span.to >= start && (!predicate || predicate(span.spec)))\n                result.push(span.copy(span.from + offset, span.to + offset));\n        }\n        for (let i = 0; i < this.children.length; i += 3) {\n            if (this.children[i] < end && this.children[i + 1] > start) {\n                let childOff = this.children[i] + 1;\n                this.children[i + 2].findInner(start - childOff, end - childOff, result, offset + childOff, predicate);\n            }\n        }\n    }\n    /**\n    Map the set of decorations in response to a change in the\n    document.\n    */\n    map(mapping, doc, options) {\n        if (this == empty || mapping.maps.length == 0)\n            return this;\n        return this.mapInner(mapping, doc, 0, 0, options || noSpec);\n    }\n    /**\n    @internal\n    */\n    mapInner(mapping, node, offset, oldOffset, options) {\n        let newLocal;\n        for (let i = 0; i < this.local.length; i++) {\n            let mapped = this.local[i].map(mapping, offset, oldOffset);\n            if (mapped && mapped.type.valid(node, mapped))\n                (newLocal || (newLocal = [])).push(mapped);\n            else if (options.onRemove)\n                options.onRemove(this.local[i].spec);\n        }\n        if (this.children.length)\n            return mapChildren(this.children, newLocal || [], mapping, node, offset, oldOffset, options);\n        else\n            return newLocal ? new DecorationSet(newLocal.sort(byPos), none) : empty;\n    }\n    /**\n    Add the given array of decorations to the ones in the set,\n    producing a new set. Needs access to the current document to\n    create the appropriate tree structure.\n    */\n    add(doc, decorations) {\n        if (!decorations.length)\n            return this;\n        if (this == empty)\n            return DecorationSet.create(doc, decorations);\n        return this.addInner(doc, decorations, 0);\n    }\n    addInner(doc, decorations, offset) {\n        let children, childIndex = 0;\n        doc.forEach((childNode, childOffset) => {\n            let baseOffset = childOffset + offset, found;\n            if (!(found = takeSpansForNode(decorations, childNode, baseOffset)))\n                return;\n            if (!children)\n                children = this.children.slice();\n            while (childIndex < children.length && children[childIndex] < childOffset)\n                childIndex += 3;\n            if (children[childIndex] == childOffset)\n                children[childIndex + 2] = children[childIndex + 2].addInner(childNode, found, baseOffset + 1);\n            else\n                children.splice(childIndex, 0, childOffset, childOffset + childNode.nodeSize, buildTree(found, childNode, baseOffset + 1, noSpec));\n            childIndex += 3;\n        });\n        let local = moveSpans(childIndex ? withoutNulls(decorations) : decorations, -offset);\n        for (let i = 0; i < local.length; i++)\n            if (!local[i].type.valid(doc, local[i]))\n                local.splice(i--, 1);\n        return new DecorationSet(local.length ? this.local.concat(local).sort(byPos) : this.local, children || this.children);\n    }\n    /**\n    Create a new set that contains the decorations in this set, minus\n    the ones in the given array.\n    */\n    remove(decorations) {\n        if (decorations.length == 0 || this == empty)\n            return this;\n        return this.removeInner(decorations, 0);\n    }\n    removeInner(decorations, offset) {\n        let children = this.children, local = this.local;\n        for (let i = 0; i < children.length; i += 3) {\n            let found;\n            let from = children[i] + offset, to = children[i + 1] + offset;\n            for (let j = 0, span; j < decorations.length; j++)\n                if (span = decorations[j]) {\n                    if (span.from > from && span.to < to) {\n                        decorations[j] = null;\n                        (found || (found = [])).push(span);\n                    }\n                }\n            if (!found)\n                continue;\n            if (children == this.children)\n                children = this.children.slice();\n            let removed = children[i + 2].removeInner(found, from + 1);\n            if (removed != empty) {\n                children[i + 2] = removed;\n            }\n            else {\n                children.splice(i, 3);\n                i -= 3;\n            }\n        }\n        if (local.length)\n            for (let i = 0, span; i < decorations.length; i++)\n                if (span = decorations[i]) {\n                    for (let j = 0; j < local.length; j++)\n                        if (local[j].eq(span, offset)) {\n                            if (local == this.local)\n                                local = this.local.slice();\n                            local.splice(j--, 1);\n                        }\n                }\n        if (children == this.children && local == this.local)\n            return this;\n        return local.length || children.length ? new DecorationSet(local, children) : empty;\n    }\n    /**\n    @internal\n    */\n    forChild(offset, node) {\n        if (this == empty)\n            return this;\n        if (node.isLeaf)\n            return DecorationSet.empty;\n        let child, local;\n        for (let i = 0; i < this.children.length; i += 3)\n            if (this.children[i] >= offset) {\n                if (this.children[i] == offset)\n                    child = this.children[i + 2];\n                break;\n            }\n        let start = offset + 1, end = start + node.content.size;\n        for (let i = 0; i < this.local.length; i++) {\n            let dec = this.local[i];\n            if (dec.from < end && dec.to > start && (dec.type instanceof InlineType)) {\n                let from = Math.max(start, dec.from) - start, to = Math.min(end, dec.to) - start;\n                if (from < to)\n                    (local || (local = [])).push(dec.copy(from, to));\n            }\n        }\n        if (local) {\n            let localSet = new DecorationSet(local.sort(byPos), none);\n            return child ? new DecorationGroup([localSet, child]) : localSet;\n        }\n        return child || empty;\n    }\n    /**\n    @internal\n    */\n    eq(other) {\n        if (this == other)\n            return true;\n        if (!(other instanceof DecorationSet) ||\n            this.local.length != other.local.length ||\n            this.children.length != other.children.length)\n            return false;\n        for (let i = 0; i < this.local.length; i++)\n            if (!this.local[i].eq(other.local[i]))\n                return false;\n        for (let i = 0; i < this.children.length; i += 3)\n            if (this.children[i] != other.children[i] ||\n                this.children[i + 1] != other.children[i + 1] ||\n                !this.children[i + 2].eq(other.children[i + 2]))\n                return false;\n        return true;\n    }\n    /**\n    @internal\n    */\n    locals(node) {\n        return removeOverlap(this.localsInner(node));\n    }\n    /**\n    @internal\n    */\n    localsInner(node) {\n        if (this == empty)\n            return none;\n        if (node.inlineContent || !this.local.some(InlineType.is))\n            return this.local;\n        let result = [];\n        for (let i = 0; i < this.local.length; i++) {\n            if (!(this.local[i].type instanceof InlineType))\n                result.push(this.local[i]);\n        }\n        return result;\n    }\n}\n/**\nThe empty set of decorations.\n*/\nDecorationSet.empty = new DecorationSet([], []);\n/**\n@internal\n*/\nDecorationSet.removeOverlap = removeOverlap;\nconst empty = DecorationSet.empty;\n// An abstraction that allows the code dealing with decorations to\n// treat multiple DecorationSet objects as if it were a single object\n// with (a subset of) the same interface.\nclass DecorationGroup {\n    constructor(members) {\n        this.members = members;\n    }\n    map(mapping, doc) {\n        const mappedDecos = this.members.map(member => member.map(mapping, doc, noSpec));\n        return DecorationGroup.from(mappedDecos);\n    }\n    forChild(offset, child) {\n        if (child.isLeaf)\n            return DecorationSet.empty;\n        let found = [];\n        for (let i = 0; i < this.members.length; i++) {\n            let result = this.members[i].forChild(offset, child);\n            if (result == empty)\n                continue;\n            if (result instanceof DecorationGroup)\n                found = found.concat(result.members);\n            else\n                found.push(result);\n        }\n        return DecorationGroup.from(found);\n    }\n    eq(other) {\n        if (!(other instanceof DecorationGroup) ||\n            other.members.length != this.members.length)\n            return false;\n        for (let i = 0; i < this.members.length; i++)\n            if (!this.members[i].eq(other.members[i]))\n                return false;\n        return true;\n    }\n    locals(node) {\n        let result, sorted = true;\n        for (let i = 0; i < this.members.length; i++) {\n            let locals = this.members[i].localsInner(node);\n            if (!locals.length)\n                continue;\n            if (!result) {\n                result = locals;\n            }\n            else {\n                if (sorted) {\n                    result = result.slice();\n                    sorted = false;\n                }\n                for (let j = 0; j < locals.length; j++)\n                    result.push(locals[j]);\n            }\n        }\n        return result ? removeOverlap(sorted ? result : result.sort(byPos)) : none;\n    }\n    // Create a group for the given array of decoration sets, or return\n    // a single set when possible.\n    static from(members) {\n        switch (members.length) {\n            case 0: return empty;\n            case 1: return members[0];\n            default: return new DecorationGroup(members.every(m => m instanceof DecorationSet) ? members :\n                members.reduce((r, m) => r.concat(m instanceof DecorationSet ? m : m.members), []));\n        }\n    }\n}\nfunction mapChildren(oldChildren, newLocal, mapping, node, offset, oldOffset, options) {\n    let children = oldChildren.slice();\n    // Mark the children that are directly touched by changes, and\n    // move those that are after the changes.\n    for (let i = 0, baseOffset = oldOffset; i < mapping.maps.length; i++) {\n        let moved = 0;\n        mapping.maps[i].forEach((oldStart, oldEnd, newStart, newEnd) => {\n            let dSize = (newEnd - newStart) - (oldEnd - oldStart);\n            for (let i = 0; i < children.length; i += 3) {\n                let end = children[i + 1];\n                if (end < 0 || oldStart > end + baseOffset - moved)\n                    continue;\n                let start = children[i] + baseOffset - moved;\n                if (oldEnd >= start) {\n                    children[i + 1] = oldStart <= start ? -2 : -1;\n                }\n                else if (newStart >= offset && dSize) {\n                    children[i] += dSize;\n                    children[i + 1] += dSize;\n                }\n            }\n            moved += dSize;\n        });\n        baseOffset = mapping.maps[i].map(baseOffset, -1);\n    }\n    // Find the child nodes that still correspond to a single node,\n    // recursively call mapInner on them and update their positions.\n    let mustRebuild = false;\n    for (let i = 0; i < children.length; i += 3)\n        if (children[i + 1] < 0) { // Touched nodes\n            if (children[i + 1] == -2) {\n                mustRebuild = true;\n                children[i + 1] = -1;\n                continue;\n            }\n            let from = mapping.map(oldChildren[i] + oldOffset), fromLocal = from - offset;\n            if (fromLocal < 0 || fromLocal >= node.content.size) {\n                mustRebuild = true;\n                continue;\n            }\n            // Must read oldChildren because children was tagged with -1\n            let to = mapping.map(oldChildren[i + 1] + oldOffset, -1), toLocal = to - offset;\n            let { index, offset: childOffset } = node.content.findIndex(fromLocal);\n            let childNode = node.maybeChild(index);\n            if (childNode && childOffset == fromLocal && childOffset + childNode.nodeSize == toLocal) {\n                let mapped = children[i + 2]\n                    .mapInner(mapping, childNode, from + 1, oldChildren[i] + oldOffset + 1, options);\n                if (mapped != empty) {\n                    children[i] = fromLocal;\n                    children[i + 1] = toLocal;\n                    children[i + 2] = mapped;\n                }\n                else {\n                    children[i + 1] = -2;\n                    mustRebuild = true;\n                }\n            }\n            else {\n                mustRebuild = true;\n            }\n        }\n    // Remaining children must be collected and rebuilt into the appropriate structure\n    if (mustRebuild) {\n        let decorations = mapAndGatherRemainingDecorations(children, oldChildren, newLocal, mapping, offset, oldOffset, options);\n        let built = buildTree(decorations, node, 0, options);\n        newLocal = built.local;\n        for (let i = 0; i < children.length; i += 3)\n            if (children[i + 1] < 0) {\n                children.splice(i, 3);\n                i -= 3;\n            }\n        for (let i = 0, j = 0; i < built.children.length; i += 3) {\n            let from = built.children[i];\n            while (j < children.length && children[j] < from)\n                j += 3;\n            children.splice(j, 0, built.children[i], built.children[i + 1], built.children[i + 2]);\n        }\n    }\n    return new DecorationSet(newLocal.sort(byPos), children);\n}\nfunction moveSpans(spans, offset) {\n    if (!offset || !spans.length)\n        return spans;\n    let result = [];\n    for (let i = 0; i < spans.length; i++) {\n        let span = spans[i];\n        result.push(new Decoration(span.from + offset, span.to + offset, span.type));\n    }\n    return result;\n}\nfunction mapAndGatherRemainingDecorations(children, oldChildren, decorations, mapping, offset, oldOffset, options) {\n    // Gather all decorations from the remaining marked children\n    function gather(set, oldOffset) {\n        for (let i = 0; i < set.local.length; i++) {\n            let mapped = set.local[i].map(mapping, offset, oldOffset);\n            if (mapped)\n                decorations.push(mapped);\n            else if (options.onRemove)\n                options.onRemove(set.local[i].spec);\n        }\n        for (let i = 0; i < set.children.length; i += 3)\n            gather(set.children[i + 2], set.children[i] + oldOffset + 1);\n    }\n    for (let i = 0; i < children.length; i += 3)\n        if (children[i + 1] == -1)\n            gather(children[i + 2], oldChildren[i] + oldOffset + 1);\n    return decorations;\n}\nfunction takeSpansForNode(spans, node, offset) {\n    if (node.isLeaf)\n        return null;\n    let end = offset + node.nodeSize, found = null;\n    for (let i = 0, span; i < spans.length; i++) {\n        if ((span = spans[i]) && span.from > offset && span.to < end) {\n            (found || (found = [])).push(span);\n            spans[i] = null;\n        }\n    }\n    return found;\n}\nfunction withoutNulls(array) {\n    let result = [];\n    for (let i = 0; i < array.length; i++)\n        if (array[i] != null)\n            result.push(array[i]);\n    return result;\n}\n// Build up a tree that corresponds to a set of decorations. `offset`\n// is a base offset that should be subtracted from the `from` and `to`\n// positions in the spans (so that we don't have to allocate new spans\n// for recursive calls).\nfunction buildTree(spans, node, offset, options) {\n    let children = [], hasNulls = false;\n    node.forEach((childNode, localStart) => {\n        let found = takeSpansForNode(spans, childNode, localStart + offset);\n        if (found) {\n            hasNulls = true;\n            let subtree = buildTree(found, childNode, offset + localStart + 1, options);\n            if (subtree != empty)\n                children.push(localStart, localStart + childNode.nodeSize, subtree);\n        }\n    });\n    let locals = moveSpans(hasNulls ? withoutNulls(spans) : spans, -offset).sort(byPos);\n    for (let i = 0; i < locals.length; i++)\n        if (!locals[i].type.valid(node, locals[i])) {\n            if (options.onRemove)\n                options.onRemove(locals[i].spec);\n            locals.splice(i--, 1);\n        }\n    return locals.length || children.length ? new DecorationSet(locals, children) : empty;\n}\n// Used to sort decorations so that ones with a low start position\n// come first, and within a set with the same start position, those\n// with an smaller end position come first.\nfunction byPos(a, b) {\n    return a.from - b.from || a.to - b.to;\n}\n// Scan a sorted array of decorations for partially overlapping spans,\n// and split those so that only fully overlapping spans are left (to\n// make subsequent rendering easier). Will return the input array if\n// no partially overlapping spans are found (the common case).\nfunction removeOverlap(spans) {\n    let working = spans;\n    for (let i = 0; i < working.length - 1; i++) {\n        let span = working[i];\n        if (span.from != span.to)\n            for (let j = i + 1; j < working.length; j++) {\n                let next = working[j];\n                if (next.from == span.from) {\n                    if (next.to != span.to) {\n                        if (working == spans)\n                            working = spans.slice();\n                        // Followed by a partially overlapping larger span. Split that\n                        // span.\n                        working[j] = next.copy(next.from, span.to);\n                        insertAhead(working, j + 1, next.copy(span.to, next.to));\n                    }\n                    continue;\n                }\n                else {\n                    if (next.from < span.to) {\n                        if (working == spans)\n                            working = spans.slice();\n                        // The end of this one overlaps with a subsequent span. Split\n                        // this one.\n                        working[i] = span.copy(span.from, next.from);\n                        insertAhead(working, j, span.copy(next.from, span.to));\n                    }\n                    break;\n                }\n            }\n    }\n    return working;\n}\nfunction insertAhead(array, i, deco) {\n    while (i < array.length && byPos(deco, array[i]) > 0)\n        i++;\n    array.splice(i, 0, deco);\n}\n// Get the decorations associated with the current props of a view.\nfunction viewDecorations(view) {\n    let found = [];\n    view.someProp(\"decorations\", f => {\n        let result = f(view.state);\n        if (result && result != empty)\n            found.push(result);\n    });\n    if (view.cursorWrapper)\n        found.push(DecorationSet.create(view.state.doc, [view.cursorWrapper.deco]));\n    return DecorationGroup.from(found);\n}\n\nconst observeOptions = {\n    childList: true,\n    characterData: true,\n    characterDataOldValue: true,\n    attributes: true,\n    attributeOldValue: true,\n    subtree: true\n};\n// IE11 has very broken mutation observers, so we also listen to DOMCharacterDataModified\nconst useCharData = ie && ie_version <= 11;\nclass SelectionState {\n    constructor() {\n        this.anchorNode = null;\n        this.anchorOffset = 0;\n        this.focusNode = null;\n        this.focusOffset = 0;\n    }\n    set(sel) {\n        this.anchorNode = sel.anchorNode;\n        this.anchorOffset = sel.anchorOffset;\n        this.focusNode = sel.focusNode;\n        this.focusOffset = sel.focusOffset;\n    }\n    clear() {\n        this.anchorNode = this.focusNode = null;\n    }\n    eq(sel) {\n        return sel.anchorNode == this.anchorNode && sel.anchorOffset == this.anchorOffset &&\n            sel.focusNode == this.focusNode && sel.focusOffset == this.focusOffset;\n    }\n}\nclass DOMObserver {\n    constructor(view, handleDOMChange) {\n        this.view = view;\n        this.handleDOMChange = handleDOMChange;\n        this.queue = [];\n        this.flushingSoon = -1;\n        this.observer = null;\n        this.currentSelection = new SelectionState;\n        this.onCharData = null;\n        this.suppressingSelectionUpdates = false;\n        this.observer = window.MutationObserver &&\n            new window.MutationObserver(mutations => {\n                for (let i = 0; i < mutations.length; i++)\n                    this.queue.push(mutations[i]);\n                // IE11 will sometimes (on backspacing out a single character\n                // text node after a BR node) call the observer callback\n                // before actually updating the DOM, which will cause\n                // ProseMirror to miss the change (see #930)\n                if (ie && ie_version <= 11 && mutations.some(m => m.type == \"childList\" && m.removedNodes.length ||\n                    m.type == \"characterData\" && m.oldValue.length > m.target.nodeValue.length))\n                    this.flushSoon();\n                else\n                    this.flush();\n            });\n        if (useCharData) {\n            this.onCharData = e => {\n                this.queue.push({ target: e.target, type: \"characterData\", oldValue: e.prevValue });\n                this.flushSoon();\n            };\n        }\n        this.onSelectionChange = this.onSelectionChange.bind(this);\n    }\n    flushSoon() {\n        if (this.flushingSoon < 0)\n            this.flushingSoon = window.setTimeout(() => { this.flushingSoon = -1; this.flush(); }, 20);\n    }\n    forceFlush() {\n        if (this.flushingSoon > -1) {\n            window.clearTimeout(this.flushingSoon);\n            this.flushingSoon = -1;\n            this.flush();\n        }\n    }\n    start() {\n        if (this.observer) {\n            this.observer.takeRecords();\n            this.observer.observe(this.view.dom, observeOptions);\n        }\n        if (this.onCharData)\n            this.view.dom.addEventListener(\"DOMCharacterDataModified\", this.onCharData);\n        this.connectSelection();\n    }\n    stop() {\n        if (this.observer) {\n            let take = this.observer.takeRecords();\n            if (take.length) {\n                for (let i = 0; i < take.length; i++)\n                    this.queue.push(take[i]);\n                window.setTimeout(() => this.flush(), 20);\n            }\n            this.observer.disconnect();\n        }\n        if (this.onCharData)\n            this.view.dom.removeEventListener(\"DOMCharacterDataModified\", this.onCharData);\n        this.disconnectSelection();\n    }\n    connectSelection() {\n        this.view.dom.ownerDocument.addEventListener(\"selectionchange\", this.onSelectionChange);\n    }\n    disconnectSelection() {\n        this.view.dom.ownerDocument.removeEventListener(\"selectionchange\", this.onSelectionChange);\n    }\n    suppressSelectionUpdates() {\n        this.suppressingSelectionUpdates = true;\n        setTimeout(() => this.suppressingSelectionUpdates = false, 50);\n    }\n    onSelectionChange() {\n        if (!hasFocusAndSelection(this.view))\n            return;\n        if (this.suppressingSelectionUpdates)\n            return selectionToDOM(this.view);\n        // Deletions on IE11 fire their events in the wrong order, giving\n        // us a selection change event before the DOM changes are\n        // reported.\n        if (ie && ie_version <= 11 && !this.view.state.selection.empty) {\n            let sel = this.view.domSelectionRange();\n            // Selection.isCollapsed isn't reliable on IE\n            if (sel.focusNode && isEquivalentPosition(sel.focusNode, sel.focusOffset, sel.anchorNode, sel.anchorOffset))\n                return this.flushSoon();\n        }\n        this.flush();\n    }\n    setCurSelection() {\n        this.currentSelection.set(this.view.domSelectionRange());\n    }\n    ignoreSelectionChange(sel) {\n        if (!sel.focusNode)\n            return true;\n        let ancestors = new Set, container;\n        for (let scan = sel.focusNode; scan; scan = parentNode(scan))\n            ancestors.add(scan);\n        for (let scan = sel.anchorNode; scan; scan = parentNode(scan))\n            if (ancestors.has(scan)) {\n                container = scan;\n                break;\n            }\n        let desc = container && this.view.docView.nearestDesc(container);\n        if (desc && desc.ignoreMutation({\n            type: \"selection\",\n            target: container.nodeType == 3 ? container.parentNode : container\n        })) {\n            this.setCurSelection();\n            return true;\n        }\n    }\n    flush() {\n        let { view } = this;\n        if (!view.docView || this.flushingSoon > -1)\n            return;\n        let mutations = this.observer ? this.observer.takeRecords() : [];\n        if (this.queue.length) {\n            mutations = this.queue.concat(mutations);\n            this.queue.length = 0;\n        }\n        let sel = view.domSelectionRange();\n        let newSel = !this.suppressingSelectionUpdates && !this.currentSelection.eq(sel) && hasFocusAndSelection(view) && !this.ignoreSelectionChange(sel);\n        let from = -1, to = -1, typeOver = false, added = [];\n        if (view.editable) {\n            for (let i = 0; i < mutations.length; i++) {\n                let result = this.registerMutation(mutations[i], added);\n                if (result) {\n                    from = from < 0 ? result.from : Math.min(result.from, from);\n                    to = to < 0 ? result.to : Math.max(result.to, to);\n                    if (result.typeOver)\n                        typeOver = true;\n                }\n            }\n        }\n        if (gecko && added.length > 1) {\n            let brs = added.filter(n => n.nodeName == \"BR\");\n            if (brs.length == 2) {\n                let a = brs[0], b = brs[1];\n                if (a.parentNode && a.parentNode.parentNode == b.parentNode)\n                    b.remove();\n                else\n                    a.remove();\n            }\n        }\n        let readSel = null;\n        // If it looks like the browser has reset the selection to the\n        // start of the document after focus, restore the selection from\n        // the state\n        if (from < 0 && newSel && view.input.lastFocus > Date.now() - 200 &&\n            Math.max(view.input.lastTouch, view.input.lastClick.time) < Date.now() - 300 &&\n            selectionCollapsed(sel) && (readSel = selectionFromDOM(view)) &&\n            readSel.eq(Selection.near(view.state.doc.resolve(0), 1))) {\n            view.input.lastFocus = 0;\n            selectionToDOM(view);\n            this.currentSelection.set(sel);\n            view.scrollToSelection();\n        }\n        else if (from > -1 || newSel) {\n            if (from > -1) {\n                view.docView.markDirty(from, to);\n                checkCSS(view);\n            }\n            this.handleDOMChange(from, to, typeOver, added);\n            if (view.docView && view.docView.dirty)\n                view.updateState(view.state);\n            else if (!this.currentSelection.eq(sel))\n                selectionToDOM(view);\n            this.currentSelection.set(sel);\n        }\n    }\n    registerMutation(mut, added) {\n        // Ignore mutations inside nodes that were already noted as inserted\n        if (added.indexOf(mut.target) > -1)\n            return null;\n        let desc = this.view.docView.nearestDesc(mut.target);\n        if (mut.type == \"attributes\" &&\n            (desc == this.view.docView || mut.attributeName == \"contenteditable\" ||\n                // Firefox sometimes fires spurious events for null/empty styles\n                (mut.attributeName == \"style\" && !mut.oldValue && !mut.target.getAttribute(\"style\"))))\n            return null;\n        if (!desc || desc.ignoreMutation(mut))\n            return null;\n        if (mut.type == \"childList\") {\n            for (let i = 0; i < mut.addedNodes.length; i++)\n                added.push(mut.addedNodes[i]);\n            if (desc.contentDOM && desc.contentDOM != desc.dom && !desc.contentDOM.contains(mut.target))\n                return { from: desc.posBefore, to: desc.posAfter };\n            let prev = mut.previousSibling, next = mut.nextSibling;\n            if (ie && ie_version <= 11 && mut.addedNodes.length) {\n                // IE11 gives us incorrect next/prev siblings for some\n                // insertions, so if there are added nodes, recompute those\n                for (let i = 0; i < mut.addedNodes.length; i++) {\n                    let { previousSibling, nextSibling } = mut.addedNodes[i];\n                    if (!previousSibling || Array.prototype.indexOf.call(mut.addedNodes, previousSibling) < 0)\n                        prev = previousSibling;\n                    if (!nextSibling || Array.prototype.indexOf.call(mut.addedNodes, nextSibling) < 0)\n                        next = nextSibling;\n                }\n            }\n            let fromOffset = prev && prev.parentNode == mut.target\n                ? domIndex(prev) + 1 : 0;\n            let from = desc.localPosFromDOM(mut.target, fromOffset, -1);\n            let toOffset = next && next.parentNode == mut.target\n                ? domIndex(next) : mut.target.childNodes.length;\n            let to = desc.localPosFromDOM(mut.target, toOffset, 1);\n            return { from, to };\n        }\n        else if (mut.type == \"attributes\") {\n            return { from: desc.posAtStart - desc.border, to: desc.posAtEnd + desc.border };\n        }\n        else { // \"characterData\"\n            return {\n                from: desc.posAtStart,\n                to: desc.posAtEnd,\n                // An event was generated for a text change that didn't change\n                // any text. Mark the dom change to fall back to assuming the\n                // selection was typed over with an identical value if it can't\n                // find another change.\n                typeOver: mut.target.nodeValue == mut.oldValue\n            };\n        }\n    }\n}\nlet cssChecked = new WeakMap();\nlet cssCheckWarned = false;\nfunction checkCSS(view) {\n    if (cssChecked.has(view))\n        return;\n    cssChecked.set(view, null);\n    if (['normal', 'nowrap', 'pre-line'].indexOf(getComputedStyle(view.dom).whiteSpace) !== -1) {\n        view.requiresGeckoHackNode = gecko;\n        if (cssCheckWarned)\n            return;\n        console[\"warn\"](\"ProseMirror expects the CSS white-space property to be set, preferably to 'pre-wrap'. It is recommended to load style/prosemirror.css from the prosemirror-view package.\");\n        cssCheckWarned = true;\n    }\n}\n// Used to work around a Safari Selection/shadow DOM bug\n// Based on https://github.com/codemirror/dev/issues/414 fix\nfunction safariShadowSelectionRange(view) {\n    let found;\n    function read(event) {\n        event.preventDefault();\n        event.stopImmediatePropagation();\n        found = event.getTargetRanges()[0];\n    }\n    // Because Safari (at least in 2018-2022) doesn't provide regular\n    // access to the selection inside a shadowRoot, we have to perform a\n    // ridiculous hack to get at it—using `execCommand` to trigger a\n    // `beforeInput` event so that we can read the target range from the\n    // event.\n    view.dom.addEventListener(\"beforeinput\", read, true);\n    document.execCommand(\"indent\");\n    view.dom.removeEventListener(\"beforeinput\", read, true);\n    let anchorNode = found.startContainer, anchorOffset = found.startOffset;\n    let focusNode = found.endContainer, focusOffset = found.endOffset;\n    let currentAnchor = view.domAtPos(view.state.selection.anchor);\n    // Since such a range doesn't distinguish between anchor and head,\n    // use a heuristic that flips it around if its end matches the\n    // current anchor.\n    if (isEquivalentPosition(currentAnchor.node, currentAnchor.offset, focusNode, focusOffset))\n        [anchorNode, anchorOffset, focusNode, focusOffset] = [focusNode, focusOffset, anchorNode, anchorOffset];\n    return { anchorNode, anchorOffset, focusNode, focusOffset };\n}\n\n// Note that all referencing and parsing is done with the\n// start-of-operation selection and document, since that's the one\n// that the DOM represents. If any changes came in in the meantime,\n// the modification is mapped over those before it is applied, in\n// readDOMChange.\nfunction parseBetween(view, from_, to_) {\n    let { node: parent, fromOffset, toOffset, from, to } = view.docView.parseRange(from_, to_);\n    let domSel = view.domSelectionRange();\n    let find;\n    let anchor = domSel.anchorNode;\n    if (anchor && view.dom.contains(anchor.nodeType == 1 ? anchor : anchor.parentNode)) {\n        find = [{ node: anchor, offset: domSel.anchorOffset }];\n        if (!selectionCollapsed(domSel))\n            find.push({ node: domSel.focusNode, offset: domSel.focusOffset });\n    }\n    // Work around issue in Chrome where backspacing sometimes replaces\n    // the deleted content with a random BR node (issues #799, #831)\n    if (chrome && view.input.lastKeyCode === 8) {\n        for (let off = toOffset; off > fromOffset; off--) {\n            let node = parent.childNodes[off - 1], desc = node.pmViewDesc;\n            if (node.nodeName == \"BR\" && !desc) {\n                toOffset = off;\n                break;\n            }\n            if (!desc || desc.size)\n                break;\n        }\n    }\n    let startDoc = view.state.doc;\n    let parser = view.someProp(\"domParser\") || DOMParser.fromSchema(view.state.schema);\n    let $from = startDoc.resolve(from);\n    let sel = null, doc = parser.parse(parent, {\n        topNode: $from.parent,\n        topMatch: $from.parent.contentMatchAt($from.index()),\n        topOpen: true,\n        from: fromOffset,\n        to: toOffset,\n        preserveWhitespace: $from.parent.type.whitespace == \"pre\" ? \"full\" : true,\n        findPositions: find,\n        ruleFromNode,\n        context: $from\n    });\n    if (find && find[0].pos != null) {\n        let anchor = find[0].pos, head = find[1] && find[1].pos;\n        if (head == null)\n            head = anchor;\n        sel = { anchor: anchor + from, head: head + from };\n    }\n    return { doc, sel, from, to };\n}\nfunction ruleFromNode(dom) {\n    let desc = dom.pmViewDesc;\n    if (desc) {\n        return desc.parseRule();\n    }\n    else if (dom.nodeName == \"BR\" && dom.parentNode) {\n        // Safari replaces the list item or table cell with a BR\n        // directly in the list node (?!) if you delete the last\n        // character in a list item or table cell (#708, #862)\n        if (safari && /^(ul|ol)$/i.test(dom.parentNode.nodeName)) {\n            let skip = document.createElement(\"div\");\n            skip.appendChild(document.createElement(\"li\"));\n            return { skip };\n        }\n        else if (dom.parentNode.lastChild == dom || safari && /^(tr|table)$/i.test(dom.parentNode.nodeName)) {\n            return { ignore: true };\n        }\n    }\n    else if (dom.nodeName == \"IMG\" && dom.getAttribute(\"mark-placeholder\")) {\n        return { ignore: true };\n    }\n    return null;\n}\nconst isInline = /^(a|abbr|acronym|b|bd[io]|big|br|button|cite|code|data(list)?|del|dfn|em|i|ins|kbd|label|map|mark|meter|output|q|ruby|s|samp|small|span|strong|su[bp]|time|u|tt|var)$/i;\nfunction readDOMChange(view, from, to, typeOver, addedNodes) {\n    if (from < 0) {\n        let origin = view.input.lastSelectionTime > Date.now() - 50 ? view.input.lastSelectionOrigin : null;\n        let newSel = selectionFromDOM(view, origin);\n        if (newSel && !view.state.selection.eq(newSel)) {\n            if (chrome && android &&\n                view.input.lastKeyCode === 13 && Date.now() - 100 < view.input.lastKeyCodeTime &&\n                view.someProp(\"handleKeyDown\", f => f(view, keyEvent(13, \"Enter\"))))\n                return;\n            let tr = view.state.tr.setSelection(newSel);\n            if (origin == \"pointer\")\n                tr.setMeta(\"pointer\", true);\n            else if (origin == \"key\")\n                tr.scrollIntoView();\n            if (view.composing)\n                tr.setMeta(\"composition\", view.input.compositionID);\n            view.dispatch(tr);\n        }\n        return;\n    }\n    let $before = view.state.doc.resolve(from);\n    let shared = $before.sharedDepth(to);\n    from = $before.before(shared + 1);\n    to = view.state.doc.resolve(to).after(shared + 1);\n    let sel = view.state.selection;\n    let parse = parseBetween(view, from, to);\n    let doc = view.state.doc, compare = doc.slice(parse.from, parse.to);\n    let preferredPos, preferredSide;\n    // Prefer anchoring to end when Backspace is pressed\n    if (view.input.lastKeyCode === 8 && Date.now() - 100 < view.input.lastKeyCodeTime) {\n        preferredPos = view.state.selection.to;\n        preferredSide = \"end\";\n    }\n    else {\n        preferredPos = view.state.selection.from;\n        preferredSide = \"start\";\n    }\n    view.input.lastKeyCode = null;\n    let change = findDiff(compare.content, parse.doc.content, parse.from, preferredPos, preferredSide);\n    if ((ios && view.input.lastIOSEnter > Date.now() - 225 || android) &&\n        addedNodes.some(n => n.nodeType == 1 && !isInline.test(n.nodeName)) &&\n        (!change || change.endA >= change.endB) &&\n        view.someProp(\"handleKeyDown\", f => f(view, keyEvent(13, \"Enter\")))) {\n        view.input.lastIOSEnter = 0;\n        return;\n    }\n    if (!change) {\n        if (typeOver && sel instanceof TextSelection && !sel.empty && sel.$head.sameParent(sel.$anchor) &&\n            !view.composing && !(parse.sel && parse.sel.anchor != parse.sel.head)) {\n            change = { start: sel.from, endA: sel.to, endB: sel.to };\n        }\n        else {\n            if (parse.sel) {\n                let sel = resolveSelection(view, view.state.doc, parse.sel);\n                if (sel && !sel.eq(view.state.selection)) {\n                    let tr = view.state.tr.setSelection(sel);\n                    if (view.composing)\n                        tr.setMeta(\"composition\", view.input.compositionID);\n                    view.dispatch(tr);\n                }\n            }\n            return;\n        }\n    }\n    // Chrome sometimes leaves the cursor before the inserted text when\n    // composing after a cursor wrapper. This moves it forward.\n    if (chrome && view.cursorWrapper && parse.sel && parse.sel.anchor == view.cursorWrapper.deco.from &&\n        parse.sel.head == parse.sel.anchor) {\n        let size = change.endB - change.start;\n        parse.sel = { anchor: parse.sel.anchor + size, head: parse.sel.anchor + size };\n    }\n    view.input.domChangeCount++;\n    // Handle the case where overwriting a selection by typing matches\n    // the start or end of the selected content, creating a change\n    // that's smaller than what was actually overwritten.\n    if (view.state.selection.from < view.state.selection.to &&\n        change.start == change.endB &&\n        view.state.selection instanceof TextSelection) {\n        if (change.start > view.state.selection.from && change.start <= view.state.selection.from + 2 &&\n            view.state.selection.from >= parse.from) {\n            change.start = view.state.selection.from;\n        }\n        else if (change.endA < view.state.selection.to && change.endA >= view.state.selection.to - 2 &&\n            view.state.selection.to <= parse.to) {\n            change.endB += (view.state.selection.to - change.endA);\n            change.endA = view.state.selection.to;\n        }\n    }\n    // IE11 will insert a non-breaking space _ahead_ of the space after\n    // the cursor space when adding a space before another space. When\n    // that happened, adjust the change to cover the space instead.\n    if (ie && ie_version <= 11 && change.endB == change.start + 1 &&\n        change.endA == change.start && change.start > parse.from &&\n        parse.doc.textBetween(change.start - parse.from - 1, change.start - parse.from + 1) == \" \\u00a0\") {\n        change.start--;\n        change.endA--;\n        change.endB--;\n    }\n    let $from = parse.doc.resolveNoCache(change.start - parse.from);\n    let $to = parse.doc.resolveNoCache(change.endB - parse.from);\n    let $fromA = doc.resolve(change.start);\n    let inlineChange = $from.sameParent($to) && $from.parent.inlineContent && $fromA.end() >= change.endA;\n    let nextSel;\n    // If this looks like the effect of pressing Enter (or was recorded\n    // as being an iOS enter press), just dispatch an Enter key instead.\n    if (((ios && view.input.lastIOSEnter > Date.now() - 225 &&\n        (!inlineChange || addedNodes.some(n => n.nodeName == \"DIV\" || n.nodeName == \"P\"))) ||\n        (!inlineChange && $from.pos < parse.doc.content.size &&\n            (nextSel = Selection.findFrom(parse.doc.resolve($from.pos + 1), 1, true)) &&\n            nextSel.head == $to.pos)) &&\n        view.someProp(\"handleKeyDown\", f => f(view, keyEvent(13, \"Enter\")))) {\n        view.input.lastIOSEnter = 0;\n        return;\n    }\n    // Same for backspace\n    if (view.state.selection.anchor > change.start &&\n        looksLikeJoin(doc, change.start, change.endA, $from, $to) &&\n        view.someProp(\"handleKeyDown\", f => f(view, keyEvent(8, \"Backspace\")))) {\n        if (android && chrome)\n            view.domObserver.suppressSelectionUpdates(); // #820\n        return;\n    }\n    // Chrome Android will occasionally, during composition, delete the\n    // entire composition and then immediately insert it again. This is\n    // used to detect that situation.\n    if (chrome && android && change.endB == change.start)\n        view.input.lastAndroidDelete = Date.now();\n    // This tries to detect Android virtual keyboard\n    // enter-and-pick-suggestion action. That sometimes (see issue\n    // #1059) first fires a DOM mutation, before moving the selection to\n    // the newly created block. And then, because ProseMirror cleans up\n    // the DOM selection, it gives up moving the selection entirely,\n    // leaving the cursor in the wrong place. When that happens, we drop\n    // the new paragraph from the initial change, and fire a simulated\n    // enter key afterwards.\n    if (android && !inlineChange && $from.start() != $to.start() && $to.parentOffset == 0 && $from.depth == $to.depth &&\n        parse.sel && parse.sel.anchor == parse.sel.head && parse.sel.head == change.endA) {\n        change.endB -= 2;\n        $to = parse.doc.resolveNoCache(change.endB - parse.from);\n        setTimeout(() => {\n            view.someProp(\"handleKeyDown\", function (f) { return f(view, keyEvent(13, \"Enter\")); });\n        }, 20);\n    }\n    let chFrom = change.start, chTo = change.endA;\n    let tr, storedMarks, markChange;\n    if (inlineChange) {\n        if ($from.pos == $to.pos) { // Deletion\n            // IE11 sometimes weirdly moves the DOM selection around after\n            // backspacing out the first element in a textblock\n            if (ie && ie_version <= 11 && $from.parentOffset == 0) {\n                view.domObserver.suppressSelectionUpdates();\n                setTimeout(() => selectionToDOM(view), 20);\n            }\n            tr = view.state.tr.delete(chFrom, chTo);\n            storedMarks = doc.resolve(change.start).marksAcross(doc.resolve(change.endA));\n        }\n        else if ( // Adding or removing a mark\n        change.endA == change.endB &&\n            (markChange = isMarkChange($from.parent.content.cut($from.parentOffset, $to.parentOffset), $fromA.parent.content.cut($fromA.parentOffset, change.endA - $fromA.start())))) {\n            tr = view.state.tr;\n            if (markChange.type == \"add\")\n                tr.addMark(chFrom, chTo, markChange.mark);\n            else\n                tr.removeMark(chFrom, chTo, markChange.mark);\n        }\n        else if ($from.parent.child($from.index()).isText && $from.index() == $to.index() - ($to.textOffset ? 0 : 1)) {\n            // Both positions in the same text node -- simply insert text\n            let text = $from.parent.textBetween($from.parentOffset, $to.parentOffset);\n            if (view.someProp(\"handleTextInput\", f => f(view, chFrom, chTo, text)))\n                return;\n            tr = view.state.tr.insertText(text, chFrom, chTo);\n        }\n    }\n    if (!tr)\n        tr = view.state.tr.replace(chFrom, chTo, parse.doc.slice(change.start - parse.from, change.endB - parse.from));\n    if (parse.sel) {\n        let sel = resolveSelection(view, tr.doc, parse.sel);\n        // Chrome Android will sometimes, during composition, report the\n        // selection in the wrong place. If it looks like that is\n        // happening, don't update the selection.\n        // Edge just doesn't move the cursor forward when you start typing\n        // in an empty block or between br nodes.\n        if (sel && !(chrome && android && view.composing && sel.empty &&\n            (change.start != change.endB || view.input.lastAndroidDelete < Date.now() - 100) &&\n            (sel.head == chFrom || sel.head == tr.mapping.map(chTo) - 1) ||\n            ie && sel.empty && sel.head == chFrom))\n            tr.setSelection(sel);\n    }\n    if (storedMarks)\n        tr.ensureMarks(storedMarks);\n    if (view.composing)\n        tr.setMeta(\"composition\", view.input.compositionID);\n    view.dispatch(tr.scrollIntoView());\n}\nfunction resolveSelection(view, doc, parsedSel) {\n    if (Math.max(parsedSel.anchor, parsedSel.head) > doc.content.size)\n        return null;\n    return selectionBetween(view, doc.resolve(parsedSel.anchor), doc.resolve(parsedSel.head));\n}\n// Given two same-length, non-empty fragments of inline content,\n// determine whether the first could be created from the second by\n// removing or adding a single mark type.\nfunction isMarkChange(cur, prev) {\n    let curMarks = cur.firstChild.marks, prevMarks = prev.firstChild.marks;\n    let added = curMarks, removed = prevMarks, type, mark, update;\n    for (let i = 0; i < prevMarks.length; i++)\n        added = prevMarks[i].removeFromSet(added);\n    for (let i = 0; i < curMarks.length; i++)\n        removed = curMarks[i].removeFromSet(removed);\n    if (added.length == 1 && removed.length == 0) {\n        mark = added[0];\n        type = \"add\";\n        update = (node) => node.mark(mark.addToSet(node.marks));\n    }\n    else if (added.length == 0 && removed.length == 1) {\n        mark = removed[0];\n        type = \"remove\";\n        update = (node) => node.mark(mark.removeFromSet(node.marks));\n    }\n    else {\n        return null;\n    }\n    let updated = [];\n    for (let i = 0; i < prev.childCount; i++)\n        updated.push(update(prev.child(i)));\n    if (Fragment.from(updated).eq(cur))\n        return { mark, type };\n}\nfunction looksLikeJoin(old, start, end, $newStart, $newEnd) {\n    if (!$newStart.parent.isTextblock ||\n        // The content must have shrunk\n        end - start <= $newEnd.pos - $newStart.pos ||\n        // newEnd must point directly at or after the end of the block that newStart points into\n        skipClosingAndOpening($newStart, true, false) < $newEnd.pos)\n        return false;\n    let $start = old.resolve(start);\n    // Start must be at the end of a block\n    if ($start.parentOffset < $start.parent.content.size || !$start.parent.isTextblock)\n        return false;\n    let $next = old.resolve(skipClosingAndOpening($start, true, true));\n    // The next textblock must start before end and end near it\n    if (!$next.parent.isTextblock || $next.pos > end ||\n        skipClosingAndOpening($next, true, false) < end)\n        return false;\n    // The fragments after the join point must match\n    return $newStart.parent.content.cut($newStart.parentOffset).eq($next.parent.content);\n}\nfunction skipClosingAndOpening($pos, fromEnd, mayOpen) {\n    let depth = $pos.depth, end = fromEnd ? $pos.end() : $pos.pos;\n    while (depth > 0 && (fromEnd || $pos.indexAfter(depth) == $pos.node(depth).childCount)) {\n        depth--;\n        end++;\n        fromEnd = false;\n    }\n    if (mayOpen) {\n        let next = $pos.node(depth).maybeChild($pos.indexAfter(depth));\n        while (next && !next.isLeaf) {\n            next = next.firstChild;\n            end++;\n        }\n    }\n    return end;\n}\nfunction findDiff(a, b, pos, preferredPos, preferredSide) {\n    let start = a.findDiffStart(b, pos);\n    if (start == null)\n        return null;\n    let { a: endA, b: endB } = a.findDiffEnd(b, pos + a.size, pos + b.size);\n    if (preferredSide == \"end\") {\n        let adjust = Math.max(0, start - Math.min(endA, endB));\n        preferredPos -= endA + adjust - start;\n    }\n    if (endA < start && a.size < b.size) {\n        let move = preferredPos <= start && preferredPos >= endA ? start - preferredPos : 0;\n        start -= move;\n        endB = start + (endB - endA);\n        endA = start;\n    }\n    else if (endB < start) {\n        let move = preferredPos <= start && preferredPos >= endB ? start - preferredPos : 0;\n        start -= move;\n        endA = start + (endA - endB);\n        endB = start;\n    }\n    return { start, endA, endB };\n}\n\n/**\n@internal\n*/\nconst __serializeForClipboard = serializeForClipboard;\n/**\n@internal\n*/\nconst __parseFromClipboard = parseFromClipboard;\n/**\n@internal\n*/\nconst __endComposition = endComposition;\n/**\nAn editor view manages the DOM structure that represents an\neditable document. Its state and behavior are determined by its\n[props](https://prosemirror.net/docs/ref/#view.DirectEditorProps).\n*/\nclass EditorView {\n    /**\n    Create a view. `place` may be a DOM node that the editor should\n    be appended to, a function that will place it into the document,\n    or an object whose `mount` property holds the node to use as the\n    document container. If it is `null`, the editor will not be\n    added to the document.\n    */\n    constructor(place, props) {\n        this._root = null;\n        /**\n        @internal\n        */\n        this.focused = false;\n        /**\n        Kludge used to work around a Chrome bug @internal\n        */\n        this.trackWrites = null;\n        this.mounted = false;\n        /**\n        @internal\n        */\n        this.markCursor = null;\n        /**\n        @internal\n        */\n        this.cursorWrapper = null;\n        /**\n        @internal\n        */\n        this.lastSelectedViewDesc = undefined;\n        /**\n        @internal\n        */\n        this.input = new InputState;\n        this.prevDirectPlugins = [];\n        this.pluginViews = [];\n        /**\n        Holds `true` when a hack node is needed in Firefox to prevent the\n        [space is eaten issue](https://github.com/ProseMirror/prosemirror/issues/651)\n        @internal\n        */\n        this.requiresGeckoHackNode = false;\n        /**\n        When editor content is being dragged, this object contains\n        information about the dragged slice and whether it is being\n        copied or moved. At any other time, it is null.\n        */\n        this.dragging = null;\n        this._props = props;\n        this.state = props.state;\n        this.directPlugins = props.plugins || [];\n        this.directPlugins.forEach(checkStateComponent);\n        this.dispatch = this.dispatch.bind(this);\n        this.dom = (place && place.mount) || document.createElement(\"div\");\n        if (place) {\n            if (place.appendChild)\n                place.appendChild(this.dom);\n            else if (typeof place == \"function\")\n                place(this.dom);\n            else if (place.mount)\n                this.mounted = true;\n        }\n        this.editable = getEditable(this);\n        updateCursorWrapper(this);\n        this.nodeViews = buildNodeViews(this);\n        this.docView = docViewDesc(this.state.doc, computeDocDeco(this), viewDecorations(this), this.dom, this);\n        this.domObserver = new DOMObserver(this, (from, to, typeOver, added) => readDOMChange(this, from, to, typeOver, added));\n        this.domObserver.start();\n        initInput(this);\n        this.updatePluginViews();\n    }\n    /**\n    Holds `true` when a\n    [composition](https://w3c.github.io/uievents/#events-compositionevents)\n    is active.\n    */\n    get composing() { return this.input.composing; }\n    /**\n    The view's current [props](https://prosemirror.net/docs/ref/#view.EditorProps).\n    */\n    get props() {\n        if (this._props.state != this.state) {\n            let prev = this._props;\n            this._props = {};\n            for (let name in prev)\n                this._props[name] = prev[name];\n            this._props.state = this.state;\n        }\n        return this._props;\n    }\n    /**\n    Update the view's props. Will immediately cause an update to\n    the DOM.\n    */\n    update(props) {\n        if (props.handleDOMEvents != this._props.handleDOMEvents)\n            ensureListeners(this);\n        let prevProps = this._props;\n        this._props = props;\n        if (props.plugins) {\n            props.plugins.forEach(checkStateComponent);\n            this.directPlugins = props.plugins;\n        }\n        this.updateStateInner(props.state, prevProps);\n    }\n    /**\n    Update the view by updating existing props object with the object\n    given as argument. Equivalent to `view.update(Object.assign({},\n    view.props, props))`.\n    */\n    setProps(props) {\n        let updated = {};\n        for (let name in this._props)\n            updated[name] = this._props[name];\n        updated.state = this.state;\n        for (let name in props)\n            updated[name] = props[name];\n        this.update(updated);\n    }\n    /**\n    Update the editor's `state` prop, without touching any of the\n    other props.\n    */\n    updateState(state) {\n        this.updateStateInner(state, this._props);\n    }\n    updateStateInner(state, prevProps) {\n        let prev = this.state, redraw = false, updateSel = false;\n        // When stored marks are added, stop composition, so that they can\n        // be displayed.\n        if (state.storedMarks && this.composing) {\n            clearComposition(this);\n            updateSel = true;\n        }\n        this.state = state;\n        let pluginsChanged = prev.plugins != state.plugins || this._props.plugins != prevProps.plugins;\n        if (pluginsChanged || this._props.plugins != prevProps.plugins || this._props.nodeViews != prevProps.nodeViews) {\n            let nodeViews = buildNodeViews(this);\n            if (changedNodeViews(nodeViews, this.nodeViews)) {\n                this.nodeViews = nodeViews;\n                redraw = true;\n            }\n        }\n        if (pluginsChanged || prevProps.handleDOMEvents != this._props.handleDOMEvents) {\n            ensureListeners(this);\n        }\n        this.editable = getEditable(this);\n        updateCursorWrapper(this);\n        let innerDeco = viewDecorations(this), outerDeco = computeDocDeco(this);\n        let scroll = prev.plugins != state.plugins && !prev.doc.eq(state.doc) ? \"reset\"\n            : state.scrollToSelection > prev.scrollToSelection ? \"to selection\" : \"preserve\";\n        let updateDoc = redraw || !this.docView.matchesNode(state.doc, outerDeco, innerDeco);\n        if (updateDoc || !state.selection.eq(prev.selection))\n            updateSel = true;\n        let oldScrollPos = scroll == \"preserve\" && updateSel && this.dom.style.overflowAnchor == null && storeScrollPos(this);\n        if (updateSel) {\n            this.domObserver.stop();\n            // Work around an issue in Chrome, IE, and Edge where changing\n            // the DOM around an active selection puts it into a broken\n            // state where the thing the user sees differs from the\n            // selection reported by the Selection object (#710, #973,\n            // #1011, #1013, #1035).\n            let forceSelUpdate = updateDoc && (ie || chrome) && !this.composing &&\n                !prev.selection.empty && !state.selection.empty && selectionContextChanged(prev.selection, state.selection);\n            if (updateDoc) {\n                // If the node that the selection points into is written to,\n                // Chrome sometimes starts misreporting the selection, so this\n                // tracks that and forces a selection reset when our update\n                // did write to the node.\n                let chromeKludge = chrome ? (this.trackWrites = this.domSelectionRange().focusNode) : null;\n                if (redraw || !this.docView.update(state.doc, outerDeco, innerDeco, this)) {\n                    this.docView.updateOuterDeco([]);\n                    this.docView.destroy();\n                    this.docView = docViewDesc(state.doc, outerDeco, innerDeco, this.dom, this);\n                }\n                if (chromeKludge && !this.trackWrites)\n                    forceSelUpdate = true;\n            }\n            // Work around for an issue where an update arriving right between\n            // a DOM selection change and the \"selectionchange\" event for it\n            // can cause a spurious DOM selection update, disrupting mouse\n            // drag selection.\n            if (forceSelUpdate ||\n                !(this.input.mouseDown && this.domObserver.currentSelection.eq(this.domSelectionRange()) &&\n                    anchorInRightPlace(this))) {\n                selectionToDOM(this, forceSelUpdate);\n            }\n            else {\n                syncNodeSelection(this, state.selection);\n                this.domObserver.setCurSelection();\n            }\n            this.domObserver.start();\n        }\n        this.updatePluginViews(prev);\n        if (scroll == \"reset\") {\n            this.dom.scrollTop = 0;\n        }\n        else if (scroll == \"to selection\") {\n            this.scrollToSelection();\n        }\n        else if (oldScrollPos) {\n            resetScrollPos(oldScrollPos);\n        }\n    }\n    /**\n    @internal\n    */\n    scrollToSelection() {\n        let startDOM = this.domSelectionRange().focusNode;\n        if (this.someProp(\"handleScrollToSelection\", f => f(this))) ;\n        else if (this.state.selection instanceof NodeSelection) {\n            let target = this.docView.domAfterPos(this.state.selection.from);\n            if (target.nodeType == 1)\n                scrollRectIntoView(this, target.getBoundingClientRect(), startDOM);\n        }\n        else {\n            scrollRectIntoView(this, this.coordsAtPos(this.state.selection.head, 1), startDOM);\n        }\n    }\n    destroyPluginViews() {\n        let view;\n        while (view = this.pluginViews.pop())\n            if (view.destroy)\n                view.destroy();\n    }\n    updatePluginViews(prevState) {\n        if (!prevState || prevState.plugins != this.state.plugins || this.directPlugins != this.prevDirectPlugins) {\n            this.prevDirectPlugins = this.directPlugins;\n            this.destroyPluginViews();\n            for (let i = 0; i < this.directPlugins.length; i++) {\n                let plugin = this.directPlugins[i];\n                if (plugin.spec.view)\n                    this.pluginViews.push(plugin.spec.view(this));\n            }\n            for (let i = 0; i < this.state.plugins.length; i++) {\n                let plugin = this.state.plugins[i];\n                if (plugin.spec.view)\n                    this.pluginViews.push(plugin.spec.view(this));\n            }\n        }\n        else {\n            for (let i = 0; i < this.pluginViews.length; i++) {\n                let pluginView = this.pluginViews[i];\n                if (pluginView.update)\n                    pluginView.update(this, prevState);\n            }\n        }\n    }\n    someProp(propName, f) {\n        let prop = this._props && this._props[propName], value;\n        if (prop != null && (value = f ? f(prop) : prop))\n            return value;\n        for (let i = 0; i < this.directPlugins.length; i++) {\n            let prop = this.directPlugins[i].props[propName];\n            if (prop != null && (value = f ? f(prop) : prop))\n                return value;\n        }\n        let plugins = this.state.plugins;\n        if (plugins)\n            for (let i = 0; i < plugins.length; i++) {\n                let prop = plugins[i].props[propName];\n                if (prop != null && (value = f ? f(prop) : prop))\n                    return value;\n            }\n    }\n    /**\n    Query whether the view has focus.\n    */\n    hasFocus() {\n        // Work around IE not handling focus correctly if resize handles are shown.\n        // If the cursor is inside an element with resize handles, activeElement\n        // will be that element instead of this.dom.\n        if (ie) {\n            // If activeElement is within this.dom, and there are no other elements\n            // setting `contenteditable` to false in between, treat it as focused.\n            let node = this.root.activeElement;\n            if (node == this.dom)\n                return true;\n            if (!node || !this.dom.contains(node))\n                return false;\n            while (node && this.dom != node && this.dom.contains(node)) {\n                if (node.contentEditable == 'false')\n                    return false;\n                node = node.parentElement;\n            }\n            return true;\n        }\n        return this.root.activeElement == this.dom;\n    }\n    /**\n    Focus the editor.\n    */\n    focus() {\n        this.domObserver.stop();\n        if (this.editable)\n            focusPreventScroll(this.dom);\n        selectionToDOM(this);\n        this.domObserver.start();\n    }\n    /**\n    Get the document root in which the editor exists. This will\n    usually be the top-level `document`, but might be a [shadow\n    DOM](https://developer.mozilla.org/en-US/docs/Web/Web_Components/Shadow_DOM)\n    root if the editor is inside one.\n    */\n    get root() {\n        let cached = this._root;\n        if (cached == null)\n            for (let search = this.dom.parentNode; search; search = search.parentNode) {\n                if (search.nodeType == 9 || (search.nodeType == 11 && search.host)) {\n                    if (!search.getSelection)\n                        Object.getPrototypeOf(search).getSelection = () => search.ownerDocument.getSelection();\n                    return this._root = search;\n                }\n            }\n        return cached || document;\n    }\n    /**\n    Given a pair of viewport coordinates, return the document\n    position that corresponds to them. May return null if the given\n    coordinates aren't inside of the editor. When an object is\n    returned, its `pos` property is the position nearest to the\n    coordinates, and its `inside` property holds the position of the\n    inner node that the position falls inside of, or -1 if it is at\n    the top level, not in any node.\n    */\n    posAtCoords(coords) {\n        return posAtCoords(this, coords);\n    }\n    /**\n    Returns the viewport rectangle at a given document position.\n    `left` and `right` will be the same number, as this returns a\n    flat cursor-ish rectangle. If the position is between two things\n    that aren't directly adjacent, `side` determines which element\n    is used. When < 0, the element before the position is used,\n    otherwise the element after.\n    */\n    coordsAtPos(pos, side = 1) {\n        return coordsAtPos(this, pos, side);\n    }\n    /**\n    Find the DOM position that corresponds to the given document\n    position. When `side` is negative, find the position as close as\n    possible to the content before the position. When positive,\n    prefer positions close to the content after the position. When\n    zero, prefer as shallow a position as possible.\n    \n    Note that you should **not** mutate the editor's internal DOM,\n    only inspect it (and even that is usually not necessary).\n    */\n    domAtPos(pos, side = 0) {\n        return this.docView.domFromPos(pos, side);\n    }\n    /**\n    Find the DOM node that represents the document node after the\n    given position. May return `null` when the position doesn't point\n    in front of a node or if the node is inside an opaque node view.\n    \n    This is intended to be able to call things like\n    `getBoundingClientRect` on that DOM node. Do **not** mutate the\n    editor DOM directly, or add styling this way, since that will be\n    immediately overriden by the editor as it redraws the node.\n    */\n    nodeDOM(pos) {\n        let desc = this.docView.descAt(pos);\n        return desc ? desc.nodeDOM : null;\n    }\n    /**\n    Find the document position that corresponds to a given DOM\n    position. (Whenever possible, it is preferable to inspect the\n    document structure directly, rather than poking around in the\n    DOM, but sometimes—for example when interpreting an event\n    target—you don't have a choice.)\n    \n    The `bias` parameter can be used to influence which side of a DOM\n    node to use when the position is inside a leaf node.\n    */\n    posAtDOM(node, offset, bias = -1) {\n        let pos = this.docView.posFromDOM(node, offset, bias);\n        if (pos == null)\n            throw new RangeError(\"DOM position not inside the editor\");\n        return pos;\n    }\n    /**\n    Find out whether the selection is at the end of a textblock when\n    moving in a given direction. When, for example, given `\"left\"`,\n    it will return true if moving left from the current cursor\n    position would leave that position's parent textblock. Will apply\n    to the view's current state by default, but it is possible to\n    pass a different state.\n    */\n    endOfTextblock(dir, state) {\n        return endOfTextblock(this, state || this.state, dir);\n    }\n    /**\n    Run the editor's paste logic with the given HTML string. The\n    `event`, if given, will be passed to the\n    [`handlePaste`](https://prosemirror.net/docs/ref/#view.EditorProps.handlePaste) hook.\n    */\n    pasteHTML(html, event) {\n        return doPaste(this, \"\", html, false, event || new ClipboardEvent(\"paste\"));\n    }\n    /**\n    Run the editor's paste logic with the given plain-text input.\n    */\n    pasteText(text, event) {\n        return doPaste(this, text, null, true, event || new ClipboardEvent(\"paste\"));\n    }\n    /**\n    Removes the editor from the DOM and destroys all [node\n    views](https://prosemirror.net/docs/ref/#view.NodeView).\n    */\n    destroy() {\n        if (!this.docView)\n            return;\n        destroyInput(this);\n        this.destroyPluginViews();\n        if (this.mounted) {\n            this.docView.update(this.state.doc, [], viewDecorations(this), this);\n            this.dom.textContent = \"\";\n        }\n        else if (this.dom.parentNode) {\n            this.dom.parentNode.removeChild(this.dom);\n        }\n        this.docView.destroy();\n        this.docView = null;\n    }\n    /**\n    This is true when the view has been\n    [destroyed](https://prosemirror.net/docs/ref/#view.EditorView.destroy) (and thus should not be\n    used anymore).\n    */\n    get isDestroyed() {\n        return this.docView == null;\n    }\n    /**\n    Used for testing.\n    */\n    dispatchEvent(event) {\n        return dispatchEvent(this, event);\n    }\n    /**\n    Dispatch a transaction. Will call\n    [`dispatchTransaction`](https://prosemirror.net/docs/ref/#view.DirectEditorProps.dispatchTransaction)\n    when given, and otherwise defaults to applying the transaction to\n    the current state and calling\n    [`updateState`](https://prosemirror.net/docs/ref/#view.EditorView.updateState) with the result.\n    This method is bound to the view instance, so that it can be\n    easily passed around.\n    */\n    dispatch(tr) {\n        let dispatchTransaction = this._props.dispatchTransaction;\n        if (dispatchTransaction)\n            dispatchTransaction.call(this, tr);\n        else\n            this.updateState(this.state.apply(tr));\n    }\n    /**\n    @internal\n    */\n    domSelectionRange() {\n        return safari && this.root.nodeType === 11 && deepActiveElement(this.dom.ownerDocument) == this.dom\n            ? safariShadowSelectionRange(this) : this.domSelection();\n    }\n    /**\n    @internal\n    */\n    domSelection() {\n        return this.root.getSelection();\n    }\n}\nfunction computeDocDeco(view) {\n    let attrs = Object.create(null);\n    attrs.class = \"ProseMirror\";\n    attrs.contenteditable = String(view.editable);\n    view.someProp(\"attributes\", value => {\n        if (typeof value == \"function\")\n            value = value(view.state);\n        if (value)\n            for (let attr in value) {\n                if (attr == \"class\")\n                    attrs.class += \" \" + value[attr];\n                else if (attr == \"style\")\n                    attrs.style = (attrs.style ? attrs.style + \";\" : \"\") + value[attr];\n                else if (!attrs[attr] && attr != \"contenteditable\" && attr != \"nodeName\")\n                    attrs[attr] = String(value[attr]);\n            }\n    });\n    if (!attrs.translate)\n        attrs.translate = \"no\";\n    return [Decoration.node(0, view.state.doc.content.size, attrs)];\n}\nfunction updateCursorWrapper(view) {\n    if (view.markCursor) {\n        let dom = document.createElement(\"img\");\n        dom.className = \"ProseMirror-separator\";\n        dom.setAttribute(\"mark-placeholder\", \"true\");\n        dom.setAttribute(\"alt\", \"\");\n        view.cursorWrapper = { dom, deco: Decoration.widget(view.state.selection.head, dom, { raw: true, marks: view.markCursor }) };\n    }\n    else {\n        view.cursorWrapper = null;\n    }\n}\nfunction getEditable(view) {\n    return !view.someProp(\"editable\", value => value(view.state) === false);\n}\nfunction selectionContextChanged(sel1, sel2) {\n    let depth = Math.min(sel1.$anchor.sharedDepth(sel1.head), sel2.$anchor.sharedDepth(sel2.head));\n    return sel1.$anchor.start(depth) != sel2.$anchor.start(depth);\n}\nfunction buildNodeViews(view) {\n    let result = Object.create(null);\n    function add(obj) {\n        for (let prop in obj)\n            if (!Object.prototype.hasOwnProperty.call(result, prop))\n                result[prop] = obj[prop];\n    }\n    view.someProp(\"nodeViews\", add);\n    view.someProp(\"markViews\", add);\n    return result;\n}\nfunction changedNodeViews(a, b) {\n    let nA = 0, nB = 0;\n    for (let prop in a) {\n        if (a[prop] != b[prop])\n            return true;\n        nA++;\n    }\n    for (let _ in b)\n        nB++;\n    return nA != nB;\n}\nfunction checkStateComponent(plugin) {\n    if (plugin.spec.state || plugin.spec.filterTransaction || plugin.spec.appendTransaction)\n        throw new RangeError(\"Plugins passed directly to the view must not have a state component\");\n}\n\nexport { Decoration, DecorationSet, EditorView, __endComposition, __parseFromClipboard, __serializeForClipboard };\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n */\n\n/**\n * @typedef {Record<string, unknown>} Props\n * @typedef {null | undefined | string | Props | TestFunctionAnything | Array<string | Props | TestFunctionAnything>} Test\n *   Check for an arbitrary node, unaware of TypeScript inferral.\n *\n * @callback TestFunctionAnything\n *   Check if a node passes a test, unaware of TypeScript inferral.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   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 | void}\n *   Whether this node passes the test.\n */\n\n/**\n * @template {Node} Kind\n *   Node type.\n * @typedef {Kind['type'] | Partial<Kind> | TestFunctionPredicate<Kind> | Array<Kind['type'] | Partial<Kind> | TestFunctionPredicate<Kind>>} PredicateTest\n *   Check for a node that can be inferred by TypeScript.\n */\n\n/**\n * Check if a node passes a certain test.\n *\n * @template {Node} Kind\n *   Node type.\n * @callback TestFunctionPredicate\n *   Complex test function for a node that can be inferred by TypeScript.\n * @param {Node} node\n *   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 {node is Kind}\n *   Whether this node passes the test.\n */\n\n/**\n * @callback AssertAnything\n *   Check that an arbitrary value is a node, unaware of TypeScript inferral.\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\n/**\n * Check if a node is a node and passes a certain node test.\n *\n * @template {Node} Kind\n *   Node type.\n * @callback AssertPredicate\n *   Check that an arbitrary value is a specific node, aware of TypeScript.\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 {node is Kind}\n *   Whether this is a node and passes a test.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param node\n *   Thing to check, typically `Node`.\n * @param test\n *   A check for a specific node.\n * @param index\n *   The node’s position in its parent.\n * @param parent\n *   The node’s parent.\n * @returns\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  /**\n   * @type {(\n   *   (() => false) &\n   *   (<Kind extends Node = Node>(node: unknown, test: PredicateTest<Kind>, index: number, parent: Parent, context?: unknown) => node is Kind) &\n   *   (<Kind extends Node = Node>(node: unknown, test: PredicateTest<Kind>, index?: null | undefined, parent?: null | undefined, context?: unknown) => node is Kind) &\n   *   ((node: unknown, test: Test, index: number, parent: Parent, context?: unknown) => boolean) &\n   *   ((node: unknown, test?: Test, index?: null | undefined, 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 is(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      // @ts-expect-error Looks like a node.\n      return node && node.type && typeof node.type === 'string'\n        ? Boolean(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\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\n *   An assertion.\n */\nexport const convert =\n  /**\n   * @type {(\n   *   (<Kind extends Node>(test: PredicateTest<Kind>) => AssertPredicate<Kind>) &\n   *   ((test?: Test) => AssertAnything)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {AssertAnything}\n     */\n    function (test) {\n      if (test === undefined || test === null) {\n        return ok\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test) ? anyFactory(test) : propsFactory(test)\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<string | Props | TestFunctionAnything>} tests\n * @returns {AssertAnything}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<AssertAnything>} */\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   * @param {Array<unknown>} parameters\n   * @returns {boolean}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].call(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 {AssertAnything}\n */\nfunction propsFactory(check) {\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      // @ts-expect-error: hush, it sure works as an index.\n      if (node[key] !== check[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 {AssertAnything}\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 {TestFunctionAnything} check\n * @returns {AssertAnything}\n */\nfunction castFactory(check) {\n  return assertion\n\n  /**\n   * @this {unknown}\n   * @param {unknown} node\n   * @param {Array<unknown>} parameters\n   * @returns {boolean}\n   */\n  function assertion(node, ...parameters) {\n    return Boolean(\n      node &&\n        typeof node === 'object' &&\n        'type' in node &&\n        // @ts-expect-error: fine.\n        Boolean(check.call(this, node, ...parameters))\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n */\n\n/**\n * @typedef {boolean | 'skip'} 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 * @template {Node} [Visited=Node]\n *   Visited node type.\n * @template {Parent} [Ancestor=Parent]\n *   Ancestor type.\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<Ancestor>} 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 */\n\n/**\n * @template {Node} [Tree=Node]\n *   Tree type.\n * @template {Test} [Check=string]\n *   Test type.\n * @typedef {Visitor<import('./complex-types.js').Matches<import('./complex-types.js').InclusiveDescendant<Tree>, Check>, Extract<import('./complex-types.js').InclusiveDescendant<Tree>, Parent>>} 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 */\n\nimport {convert} from 'unist-util-is'\nimport {color} from './color.js'\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 * @param tree\n *   Tree to traverse.\n * @param test\n *   `unist-util-is`-compatible test\n * @param visitor\n *   Handle each node.\n * @param reverse\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns\n *   Nothing.\n */\nexport const visitParents =\n  /**\n   * @type {(\n   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &\n   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)\n   * )}\n   */\n  (\n    /**\n     * @param {Node} tree\n     * @param {Test} test\n     * @param {Visitor<Node>} visitor\n     * @param {boolean | null | undefined} [reverse]\n     * @returns {void}\n     */\n    function (tree, test, visitor, reverse) {\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        test = null\n      }\n\n      const is = convert(test)\n      const step = reverse ? -1 : 1\n\n      factory(tree, undefined, [])()\n\n      /**\n       * @param {Node} node\n       * @param {number | undefined} index\n       * @param {Array<Parent>} parents\n       */\n      function factory(node, index, parents) {\n        /** @type {Record<string, unknown>} */\n        // @ts-expect-error: hush\n        const value = node && typeof node === 'object' ? node : {}\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 {ActionTuple} */\n          let result = []\n          /** @type {ActionTuple} */\n          let subresult\n          /** @type {number} */\n          let offset\n          /** @type {Array<Parent>} */\n          let grandparents\n\n          if (!test || is(node, index, parents[parents.length - 1] || null)) {\n            result = toResult(visitor(node, parents))\n\n            if (result[0] === EXIT) {\n              return result\n            }\n          }\n\n          // @ts-expect-error looks like a parent.\n          if (node.children && result[0] !== SKIP) {\n            // @ts-expect-error looks like a parent.\n            offset = (reverse ? node.children.length : -1) + step\n            // @ts-expect-error looks like a parent.\n            grandparents = parents.concat(node)\n\n            // @ts-expect-error looks like a parent.\n            while (offset > -1 && offset < node.children.length) {\n              // @ts-expect-error looks like a parent.\n              subresult = factory(node.children[offset], 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          return result\n        }\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 {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]\n}\n","/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\n */\n\n/**\n * Check if `Child` can be a child of `Ancestor`.\n *\n * Returns the ancestor when `Child` can be a child of `Ancestor`, or returns\n * `never`.\n *\n * @template {Node} Ancestor\n *   Node type.\n * @template {Node} Child\n *   Node type.\n * @typedef {(\n *   Ancestor extends Parent\n *     ? Child extends Ancestor['children'][number]\n *       ? Ancestor\n *       : never\n *     : never\n * )} ParentsOf\n */\n\n/**\n * @template {Node} [Visited=Node]\n *   Visited node type.\n * @template {Parent} [Ancestor=Parent]\n *   Ancestor type.\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 Node ? number | null : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends Node ? Ancestor | null : 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 */\n\n/**\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 *\n * @template {Node} Visited\n *   Node type.\n * @template {Parent} Ancestor\n *   Parent type.\n * @typedef {Visitor<Visited, ParentsOf<Ancestor, Visited>>} BuildVisitorFromMatch\n */\n\n/**\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 *\n * @template {Node} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     import('unist-util-visit-parents/complex-types.js').Matches<Descendant, Check>,\n *     Extract<Descendant, Parent>\n *   >\n * )} BuildVisitorFromDescendants\n */\n\n/**\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 *\n * @template {Node} [Tree=Node]\n *   Node type.\n * @template {Test} [Check=string]\n *   Test type.\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     import('unist-util-visit-parents/complex-types.js').InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n */\n\nimport {visitParents} 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 * @param tree\n *   Tree to traverse.\n * @param test\n *   `unist-util-is`-compatible test\n * @param visitor\n *   Handle each node.\n * @param reverse\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns\n *   Nothing.\n */\nexport const visit =\n  /**\n   * @type {(\n   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &\n   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)\n   * )}\n   */\n  (\n    /**\n     * @param {Node} tree\n     * @param {Test} test\n     * @param {Visitor} visitor\n     * @param {boolean | null | undefined} [reverse]\n     * @returns {void}\n     */\n    function (tree, test, visitor, reverse) {\n      if (typeof test === 'function' && typeof visitor !== 'function') {\n        reverse = visitor\n        visitor = test\n        test = null\n      }\n\n      visitParents(tree, test, overload, reverse)\n\n      /**\n       * @param {Node} node\n       * @param {Array<Parent>} parents\n       */\n      function overload(node, parents) {\n        const parent = parents[parents.length - 1]\n        return visitor(\n          node,\n          parent ? parent.children.indexOf(node) : null,\n          parent\n        )\n      }\n    }\n  )\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n"],"names":["module","exports","cssWithMappingToString","list","toString","this","map","item","content","needLayer","concat","length","join","i","modules","media","dedupe","supports","layer","undefined","alreadyImportedModules","k","id","_k","push","hasOwn","Object","prototype","hasOwnProperty","toStr","defineProperty","gOPD","getOwnPropertyDescriptor","isArray","arr","Array","call","isPlainObject","obj","key","hasOwnConstructor","hasIsPrototypeOf","constructor","setProperty","target","options","name","enumerable","configurable","value","newValue","writable","getProperty","extend","src","copy","copyIsArray","clone","arguments","deep","isBuffer","reTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","parseInt","freeGlobal","g","freeSelf","self","root","Function","objectToString","nativeMax","Math","max","nativeMin","min","now","Date","isObject","type","toNumber","isObjectLike","isSymbol","other","valueOf","replace","isBinary","test","slice","func","wait","lastArgs","lastThis","maxWait","result","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","TypeError","invokeFunc","time","args","thisArg","apply","shouldInvoke","timeSinceLastCall","timerExpired","trailingEdge","setTimeout","remainingWait","debounced","isInvoking","leadingEdge","cancel","clearTimeout","flush","applyDecs2203R","targetClass","memberDecs","classDecs","createAddInitializerMethod","initializers","decoratorFinishedRef","initializer","fnName","v","Error","assertCallable","memberDec","dec","desc","kind","isStatic","isPrivate","kindStr","get","set","ctx","addInitializer","access","fn","hint","assertValidReturnValue","init","applyMemberDec","ret","base","decInfo","decs","newInit","instance","_init","ownInitializers","_init2","originalInitializer","_init3","applyMemberDecs","Class","decInfos","protoInitializers","staticInitializers","existingProtoNonFields","Map","existingStaticNonFields","existingNonFields","existingKind","pushInitializers","e","c","newClass","nextNewClass","applyDecs2203RFactory","asyncGeneratorStep","gen","resolve","reject","_next","_throw","arg","info","error","done","Promise","then","_asyncToGenerator","err","_checkPrivateRedeclaration","privateCollection","has","_classExtractFieldDescriptor","receiver","privateMap","action","_classPrivateFieldGet","descriptor","classExtractFieldDescriptor","_classPrivateFieldInitSpec","_classPrivateFieldSet","_defineProperty","input","prim","Symbol","toPrimitive","res","String","ownKeys","object","enumerableOnly","keys","getOwnPropertySymbols","symbols","filter","sym","_objectSpread2","source","forEach","getOwnPropertyDescriptors","defineProperties","_typeof","iterator","emptyOptions","settings","one","includeImageAlt","includeHtml","Boolean","node","alt","children","values","index","splice","start","remove","items","end","parameters","chunkStart","from","unshift","syntaxExtension","all","extension","hook","left","right","code","constructs","existing","before","add","asciiAlpha","regexCheck","asciiDigit","asciiHexDigit","asciiAlphanumeric","asciiPunctuation","asciiAtext","asciiControl","markdownLineEndingOrSpace","markdownLineEnding","markdownSpace","unicodeWhitespace","unicodePunctuation","regex","fromCharCode","factorySpace","effects","ok","limit","Number","POSITIVE_INFINITY","size","enter","prefix","consume","exit","tokenize","contentStart","attempt","parser","contentInitial","lineStart","previous","token","contentType","next","data","stack","childFlow","childToken","lineStartOffset","continued","containerState","continuation","documentContinue","checkNewContainers","_closeFlow","closeFlow","indexBeforeExits","events","point","indexBeforeFlow","exitContainers","assign","documentContinued","currentConstruct","concrete","flowStart","interrupt","_gfmTableDynamicInterruptHack","check","containerConstruct","thereIsANewContainer","thereIsNoNewContainer","lazy","line","offset","containerContinue","flow","_tokenizer","flowContinue","writeToChild","eof","stream","sliceStream","defineSkip","write","seen","entry","nok","document","disable","null","includes","blankLine","partial","subtokenize","jumps","event","lineIndex","otherIndex","otherEvent","subevents","more","_isInFirstContentOfListItem","subcontent","_container","eventIndex","context","startPosition","startPositions","tokenizer","childEvents","gaps","current","adjust","breaks","_gfmTasklistFirstContentOfListItem","pop","contentEnd","continuationConstruct","contentContinue","prefixed","tail","sliceSerialize","initial","flowInitial","afterConstruct","resolver","resolveAll","createResolver","string","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","addResult","onsuccessfulcheck","expandTabs","atTab","serializeChunks","chunkIndex","go","main","expectedCode","state","startIndex","startBufferIndex","endIndex","endBufferIndex","view","sliceChunks","_","restore","onreturn","returnState","bogusState","listOfConstructs","constructIndex","handleListOfConstructs","def","handleMapOfConstructs","handleConstruct","startPoint","startPrevious","startCurrentConstruct","startEventsIndex","startStack","store","create","resolveTo","thematicBreak","marker","sequence","initialSize","atMarker","inside","onBlank","listItemPrefixWhitespaceConstruct","endOfPrefix","otherPrefix","initialBlankLine","furtherBlankLines","notInCurrentItem","indentConstruct","blockQuote","open","after","factoryDestination","literalType","literalMarkerType","rawType","stringType","balance","destinationEnclosedBefore","destinationRaw","destinationEnclosed","destinationEnclosedEscape","destinationRawEscape","factoryLabel","markerType","label","labelEscape","factoryTitle","atFirstTitleBreak","atTitleBreak","title","titleEscape","factoryWhitespace","normalizeIdentifier","toLowerCase","toUpperCase","definition","identifier","labelAfter","titleConstruct","defined","codeIndented","afterStartPrefix","afterPrefix","indentedContent","headingAtx","fenceOpenInside","headingBreak","setextUnderline","paragraph","closingSequence","closingSequenceEnd","heading","htmlBlockNames","htmlRawNames","htmlFlow","startTag","buffer","declarationStart","tagCloseStart","continuationDeclarationInside","tagName","commentOpenInside","cdataOpenInside","basicSelfClosing","completeAttributeNameBefore","completeClosingTagAfter","completeEnd","completeAttributeName","completeAttributeNameAfter","completeAttributeValueBefore","completeAttributeValueQuoted","completeAttributeValueUnquoted","completeAttributeValueQuotedAfter","completeAfter","continuationCommentInside","continuationRawTagOpen","continuationClose","continuationCharacterDataInside","continuationAtLineEnding","nextBlankConstruct","htmlContinueStart","htmlLineEnd","continuationRawEndTag","codeFenced","closingFenceConstruct","sizeOpen","nonLazyLine","initialPrefix","sequenceOpen","infoOpen","openAfter","infoAfter","meta","createElement","decodeNamedCharacterReference","characterReference","innerHTML","char","textContent","numeric","characterEscape","lineEnding","labelEnd","labelStart","_balanced","_inactive","balanced","afterLabelEnd","resourceConstruct","fullReferenceConstruct","collapsedReferenceConstruct","close","group","insideSpan","destinationAfter","between","afterLabel","classifyCharacter","attention","attentionMarkers","_open","_close","openingSequence","use","nextEvents","movePoint","htmlText","declarationOpen","instruction","tagOpen","commentOpen","cdataOpen","declaration","commentStart","commentStartDash","comment","commentClose","atLineEnding","cdata","cdataClose","cdataEnd","instructionClose","tagClose","tagCloseBetween","tagOpenBetween","tagOpenAttributeName","tagOpenAttributeNameAfter","tagOpenAttributeValueBefore","tagOpenAttributeValueQuoted","tagOpenAttributeValueUnquoted","tagOpenAttributeValueQuotedAfter","codeText","gap","tailExitIndex","headEnterIndex","schemeOrEmailAtext","emailAtext","schemeInsideOrEmailAtext","urlInside","emailAtSignOrDot","emailLabel","emailValue","search","decodeNumericCharacterReference","characterEscapeOrReference","decodeString","decode","$0","$1","$2","head","hex","stringifyPosition","position","pos","own","fromMarkdown","encoding","config","transforms","canContainEols","autolink","opener","link","autolinkProtocol","onenterdata","autolinkEmail","atxHeading","codeFlow","codeFencedFenceInfo","codeFencedFenceMeta","codeTextData","codeFlowValue","url","definitionDestinationString","definitionLabelString","definitionTitleString","emphasis","hardBreakEscape","hardBreak","hardBreakTrailing","html","htmlFlowData","htmlTextData","image","listItem","spread","_spread","checked","listItemValue","getData","setData","listOrdered","listUnordered","reference","referenceString","resourceDestinationString","resourceTitleString","setextHeading","strong","closer","atxHeadingSequence","depth","onexitdata","characterEscapeValue","characterReferenceMarkerHexadecimal","onexitcharacterreferencemarker","characterReferenceMarkerNumeric","characterReferenceValue","resume","codeFencedFence","lang","onexithardbreak","referenceType","fragment","labelText","ancestor","resource","setextHeadingLineSequence","setextHeadingText","configure","mdastExtensions","tree","tokenStack","listStack","prepareList","handler","defaultOnError","firstBlankLineIndex","containerBalance","listSpread","tailIndex","tailEvent","and","errorHandler","onExitError","ordered","compiler","postprocess","extensions","combineExtensions","parse","atCarriageReturn","match","endPosition","lastIndex","exec","ceil","preprocess","d","combined","remarkParse","Parser","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","patternCompile","_compiled","RegExp","inlineCode","expression","formatLinkAsAutolink","raw","resourceLink","linkReference","checkBullet","bullet","checkBulletOrdered","bulletOrdered","checkRule","rule","phrasing","checkStrong","handle","blockquote","shift","indentLines","containerFlow","break","fence","checkFence","repeat","substring","indexOf","expected","count","longestStreak","encode","rank","lastIndexOf","closeAtx","parent","bulletCurrent","bulletOther","bulletOrderedOther","checkBulletOrderedOther","checkBulletOther","bulletLastUsed","useDifferentMarker","firstListItem","indexStack","listItemIndent","style","checkListItemIndent","incrementListMarker","hasPhrasing","some","ruleSpaces","repetition","ruleRepetition","checkRuleRepetition","fullPhrasingSpans","association","eol","numerical","a","b","escapeBackslashes","positions","results","whole","track","lineShift","split","invalid","unknown","joinDefinition","containerPhrasingBound","child","handlers","charAt","containerFlowBound","safeBound","infos","sort","remarkStringify","Compiler","tightDefinitions","zwitch","toMarkdown","bail","getPrototypeOf","toStringTag","VFileMessage","reason","place","origin","parts","super","message","fatal","ruleId","file","actual","note","path","ext","assertPath","seenNonSlash","firstNonSlashEnd","extIndex","unmatchedSlash","startPart","startDot","preDotState","segments","joined","absolute","allowAboveRoot","lastSlashIndex","lastSegmentLength","lastSlash","dots","normalizeString","normalize","JSON","stringify","proc","isUrl","fileUrlOrPath","href","order","VFile","messages","history","cwd","stored","prop","URL","protocol","hostname","pathname","third","decodeURIComponent","getPathFromURLPosix","urlToPath","assertNonEmpty","dirname","basename","assertPart","extname","stem","fail","part","unified","transformers","fns","pipeline","run","middlewareIndex","callback","output","middleware","fnExpectsCallback","wrap","middelware","trough","attachers","frozen","namespace","freezeIndex","processor","assertUnfrozen","freeze","attacher","transformer","addPlugin","addList","addPreset","plugin","plugins","vfile","assertParser","newable","assertCompiler","assertNode","compile","executor","runSync","complete","assertDone","process","processSync","destination","asyncName","looksLikeAVFile","F","A","E","w","x","W","h","o","n","t","X","K","WeakSet","m","Q","U","elements","at","top","z","attrs","static","B","isText","marks","schema","nodes","find","s","spec","parseMarkdown","runner","openNode","r","createAndFill","addToSet","removeFromSet","p","flat","build","S","WeakMap","toDoc","G","props","M","j","R","P","C","D","y","I","J","O","H","u","priority","l","every","f","N","reduce","isMark","V","isInSet","q","Ae","Ke","je","package","ke","ye","we","fe","Ce","T","rt","inject","record","async","waitTimers","clearTimer","displayName","Z","Oe","parseDOM","be","fromEntries","L","ee","Ee","te","re","Ve","se","ie","ne","it","Ie","dom","st","ze","dt","_e","rules","oe","Y","ae","ce","me","ge","ve","Me","body","querySelector","update","className","appendChild","entries","setAttribute","nt","replaceChild","destroy","parentNode","nodeViews","markViews","classList","ot","St","de","sliceMap","dispatch","le","Ne","setCtx","$","Te","et","produce","cleanup","delete","clear","console","warn","inspector","read","status","Se","on","once","off","offAll","_defaultValue","_typeInfo","Set","metadata","injectedSlices","consumedSlices","recordedTimers","duration","finally","onInject","onRemove","onRecord","onClear","onUse","timer","onDone","onWait","CustomEvent","detail","stopImmediatePropagation","addEventListener","dispatchEvent","removeEventListener","timeout","docTypeError","contextNotFound","timerNotFound","ctxCallOutOfScope","createNodeInParserFail","stackOverFlow","parserMatchError","serializerMatchError","getAtomFromSchemaFail","expectDomTypeError","callCommandBeforeEditorView","missingRootElement","missingNodeInSchema","missingMarkInSchema","ctxNotBind","missingYjsDoc","toJSON","GOOD_LEAF_SIZE","RopeSequence","append","leafAppend","leafPrepend","appendInner","prepend","Append","to","empty","sliceInner","getInner","forEachInner","forEachInvertedInner","elt","Leaf","__proto__","prototypeAccessors","flatten","leftLen","inner","Branch","eventCount","popEvent","preserveItems","remap","mapFrom","selection","remapping","maps","remaining","transform","tr","addAfter","addBefore","step","Item","maybeStep","mapping","appendMap","reverse","addTransform","histOptions","newItems","oldItems","lastItem","steps","merged","invert","docs","merge","overflow","DEPTH_OVERFLOW","cutPoint","cutOffEvents","mirrorPos","mirrorOffset","addMaps","array","rebased","rebasedTransform","rebasedCount","rebasedItems","newUntil","iRebased","getMirror","newMaps","branch","emptyItemCount","compress","upto","getMap","newItem","last","HistoryState","undone","prevRanges","prevTime","prevComposition","rangesFor","_from","_to","mapRanges","ranges","histTransaction","redo","mustPreserveItems","historyKey","added","getBookmark","newHist","setSelection","setMeta","historyState","scrollIntoView","cachedPreserveItems","cachedPreserveItemsPlugins","historyPreserveItems","closeHistoryKey","undo","hist","getState","newGroupDelay","historyTr","getMeta","appended","composition","newGroup","docChanged","adjacent","isAdjacentTo","applyTransaction","handleDOMEvents","beforeinput","inputType","command","preventDefault","Undo","shortcuts","Redo","beforeMountedListeners","mountedListeners","updatedListeners","listeners","beforeMount","mounted","updated","markdownUpdated","markdownUpdatedListeners","blur","blurListeners","focus","focusListeners","destroyListeners","eq","uploader","FileReader","readAsDataURL","enableHtmlFileUploader","uploadWidgetFactory","DragEvent","posAtCoords","clientX","clientY","replaceWith","catch","decorations","handlePaste","ClipboardEvent","clipboardData","files","handleDrop","dataTransfer","InputRule","insert","cutOff","insertText","wrappingInputRule","regexp","nodeType","getAttrs","joinPredicate","range","blockRange","wrapping","nodeBefore","textblockTypeInputRule","$start","canReplaceWith","indexAfter","setBlockType","escapeStringRegexp","slugify","shouldPrependUnderscore","separator","lowercase","decamelize","customReplacements","preserveLeadingUnderscore","preserveTrailingDash","preserveCharacters","startsWith","shouldAppendDash","endsWith","replacements","doCustomReplacements","transliterate","patternSlug","negationSetPattern","buildPatternSlug","escapedSeparator","removeMootSeparators","clean","remarkInlineLinks","cache","definitions","replacement","Qe","childCount","lastChild","inclusive","tag","toDOM","openMark","closeMark","withMark","mark","ToggleEmphasis","ToggleBold","addText","rangeHasMark","removeMark","addMark","ToggleInlineCode","default","HTMLElement","getAttribute","Xe","Ze","nodesBetween","nodeSize","$anchor","injectRoot","closeNode","ue","TurnIntoText","Dt","fill","pe","defining","level","tt","groups","hashes","$from","parentOffset","setNodeMarkup","he","TurnIntoH1","TurnIntoH2","TurnIntoH3","TurnIntoH4","TurnIntoH5","TurnIntoH6","DowngradeHeading","WrapInBlockquote","pre","language","preserveWhitespace","dataset","addNode","firstChild","setNodeAttribute","CreateCodeBlock","inline","selectable","draggable","atom","isolating","replaceSelectionWith","isInline","leafText","xe","replaceRangeWith","Le","InsertHardbreak","lt","WrapInBulletList","He","hasAttribute","ct","Be","WrapInOrderedList","listType","itemType","$to","nestedBefore","De","endOfList","lift","liftToOuterList","nodeAfter","atStart","atEnd","indexBefore","canReplace","liftOutOfList","Pe","isBlock","sameParent","grandParent","depthBefore","depthAfter","sel","isTextblock","nextType","contentMatchAt","defaultType","types","Re","NextListItem","SinkListItem","LiftListItem","_t","$t","qt","Wt","Gt","span","Vt","Yt","placeholderConfig","hole","punctuation","globalNodes","shouldSyncNode","prevNode","nextNode","inlineContent","movePlaceholder","mt","descendants","er","Jt","topNodeType","Qt","Ft","jt","zt","Xt","Zt","rr","placeholder","ut","hasFocus","editable","cancelAnimationFrame","requestAnimationFrame","qe","Ut","ar","pt","gt","ht","yt","nr","or","sr","kt","compositionend","compositionstart","InputEvent","side","contentEditable","ft","appendTransaction","$e","Nt","filterTransaction","It","composing","trim","Ct","maybeChild","Mt","We","br","nav","navigator","agent","userAgent","ie_edge","ie_upto10","ie_11up","_chrome","documentMode","textBefore","textBetween","vendor","maxTouchPoints","platform","documentElement","customInputRulesKey","customInputRules","isInputRules","prev","selectionSet","handleTextInput","$cursor","handleKeyDown","propertyIsEnumerable","findSelectedNodeOfType","equalNodeType","editor","setLoading","editorFactory","ref","loading","setEditorFactory","Provider","attributes","class","alphabet","defaultSize","getRandom","log","LN2","customRandom","inputRule","extendSchema","keymap","flatMap","ObjectStoreApi_putObject","_ref","bucketName","_formData","FormData","_loop","http","_x","_x2","_x3","deleteSelection","textblockAt","only","scan","findCutBefore","$pos","findCutAfter","defaultBlockAt","edgeCount","edge","hasRequiredAttrs","splitNode","deleteBarrier","$cut","conn","compatibleContent","clearIncompatible","joinMaybeClear","canDelAfter","findWrapping","matchType","validEnd","joinAt","selAfter","afterText","afterDepth","selectTextblockSide","selectTextblockStart","selectTextblockEnd","wrapIn","applicable","hasMarkup","toggleMark","markType","can","allowsMarkType","markApplies","storedMarks","removeStoredMark","addStoredMark","spaceStart","spaceEnd","chainCommands","commands","backspace","endOfTextblock","atBlockStart","delStep","isAtom","$head","del","atBlockEnd","pcBaseKeymap","deflt","first","$first","above","macBaseKeymap","baseKeymap","os","chrome","mac","brokenModifierNames","normalizeKeyName","ctrl","mod","modifiers","altKey","ctrlKey","metaKey","shiftKey","bindings","keydownHandler","baseName","keyCode","keyName","direct","noShift","fromCode","OrderedMap","found","newKey","addToStart","addToEnd","without","subtract","toObject","findDiffStart","childA","childB","sameMarkup","findDiffEnd","posA","posB","iA","iB","same","minSize","Fragment","nodeStart","blockSeparator","separated","isLeaf","withText","cut","cutByIndex","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","two","allowsMarks","canAppend","markFromJSON","TextNode","ContentMatch","wrapCache","nodeTypes","TokenStream","expr","parseExpr","nfa","labeled","explore","states","out","term","nullFrom","cmp","dfa","connect","exprs","loop","cur","edges","work","dead","checkForDeadEnds","frag","compatible","fillBefore","toEnd","finished","tp","computed","computeWrapping","active","via","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","Schema","instanceSpec","contentExprCache","contentExpr","markExpr","gatherMarks","excl","bind","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","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","readStyles","parseStyles","addMarks","removeMarks","removePendingMark","addPendingMark","addElement","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","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","replaceRange","selectionToInsertionEnd","deleteRange","dir","textOnly","TextSelection","findSelectionIn","bias","findFrom","AllSelection","cls","selectionClass","jsonID","visible","warnedAboutTextSelection","checkTextSelection","near","ensureMarks","TextBookmark","dPos","NodeSelection","deleted","mapResult","NodeBookmark","isSelectable","AllBookmark","startLen","_newFrom","newTo","Transaction","curSelectionFor","curSelection","setStoredMarks","storedMarksSet","addStep","setTime","replaceSelection","inheritMarks","isGeneric","scrolledIntoView","FieldDesc","baseFields","_marks","_old","Configuration","pluginsByKey","EditorState","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","mirrors","setMirror","appendMapping","startSize","mirr","appendMappingInverted","totalSize","inverse","corr","stepsByID","Step","stepType","stepClass","StepResult","failed","mapFragment","mapped","AddMarkStep","oldSlice","fromReplace","RemoveMarkStep","AddNodeMarkStep","newSet","RemoveNodeMarkStep","ReplaceStep","contentBetween","ReplaceAroundStep","gapFrom","gapTo","inserted","canCut","liftTarget","innerRange","around","outer","findWrappingOutside","innerMatch","findWrappingInside","withAttrs","canSplit","typesAfter","innerType","rest","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","definesContent","definingForContent","closeFragment","oldOpen","newOpen","coveredDepths","AttrStep","TransformError","Transform","targetDepths","preferredTarget","definingAsContext","preferredTargetIndex","leftNodes","preferredDepth","openDepth","targetDepth","expand","startSteps","insertPoint","covered","gapStart","gapEnd","splitting","wrappers","canChangeType","startM","endM","newNode","addNodeMark","removeNodeMark","typeAfter","removing","adding","removed","toRemove","parentType","delSteps","allowed","domIndex","assignedSlot","host","reusedRange","textRange","createRange","setEnd","setStart","isEquivalentPosition","targetNode","targetOff","scanFor","atomElements","hasBlockDesc","pmViewDesc","selectionCollapsed","domSel","focusNode","focusOffset","anchorNode","anchorOffset","keyEvent","createEvent","initEvent","ie_version","gecko","chrome_version","safari","ios","windows","android","webkit","webkit_version","windowRect","clientWidth","bottom","clientHeight","getSide","clientRect","rect","getBoundingClientRect","scaleX","width","offsetWidth","scaleY","height","offsetHeight","scrollRectIntoView","startDOM","scrollThreshold","someProp","scrollMargin","atTop","bounding","moveX","moveY","defaultView","scrollBy","startX","scrollLeft","startY","scrollTop","dX","dY","scrollStack","restoreScrollStack","dTop","preventScrollSupported","findOffsetInNode","coords","closest","coordsClosest","firstBelow","coordsBelow","dxClosest","rowBot","rowTop","childIndex","rects","getClientRects","dx","len","singleRect","inRect","findOffsetInText","elementFromPoint","element","box","startI","floor","caret","caretPositionFromPoint","offsetNode","caretRangeFromPoint","startContainer","startOffset","caretFromPoint","targetKludge","outsideBlock","sawBlock","docView","nearestDesc","posBefore","posAfter","posFromDOM","posFromCaret","posFromElement","posAtStart","border","nonZero","BIDI","coordsAtPos","domFromPos","supportEmptyRange","takeSide","flattenV","rectBefore","rectAfter","flattenH","ignoreForCoords","withFlushedState","viewState","activeElement","updateState","maybeRTL","cachedState","cachedDir","cachedResult","ViewDesc","dirty","matchesWidget","widget","matchesMark","matchesNode","outerDeco","innerDeco","matchesHack","parseRule","stopEvent","posBeforeChild","posAtEnd","localPosFromDOM","domBefore","domAfter","onlyNodes","nodeDOM","getDesc","descAt","TrailingHackViewDesc","WidgetViewDesc","domAtom","parseRange","fromOffset","toOffset","childBase","emptyChildAt","domAfterPos","force","anchorDOM","headDOM","getSelection","brKludge","domSelExtended","collapse","removeAllRanges","ignoreMutation","mutation","contentLost","markDirty","startInside","endInside","markParentsDirty","stop","ignoreSelection","CompositionViewDesc","textDOM","mut","oldValue","MarkViewDesc","custom","reparseInView","replaceNodes","NodeViewDesc","descObj","applyOuterDeco","CustomNodeViewDesc","TextViewDesc","sameOuterDeco","updateChildren","localCompositionInfo","localComposition","compositionInChild","updater","ViewTreeUpdater","deco","onWidget","onNode","locals","forChild","decoIndex","restNode","parentIndex","widgets","compareSide","cutAt","iterDeco","insideNode","syncToMarks","placeWidget","compIndex","findNodeMatch","findIndexWithChild","updateNodeAt","updateNextNode","addTextblockHacks","destroyRest","changed","protectLocalComposition","renderDescs","oldCSS","cssText","getComputedStyle","listStyle","iosHacks","domSelectionRange","nearbyTextNode","textPos","childStart","findTextInFragment","removeChild","compositionNodes","updateInner","updateOuterDeco","needsWrap","oldDOM","patchOuterDeco","computeOuterDeco","selectNode","deselectNode","removeAttribute","docViewDesc","pmIsDeco","inParent","trackWrites","parentDOM","descs","written","childDOM","rm","insertBefore","OuterDecoLevel","noDeco","outerDOM","prevComputed","curComputed","curDOM","patchAttributes","prevList","curList","removeProperty","lock","preMatch","parentDesc","curDesc","descI","fI","destroyBetween","maxKeep","isLocked","markDesc","targetDesc","domNode","nextDOM","locked","recreateWrapper","wrapper","ch","requiresGeckoHackNode","addHackNode","hack","selectionFromDOM","inWidget","nearestDescNode","isOnEdge","selectionBetween","editorOwnsSelection","hasSelection","selectionToDOM","syncNodeSelection","mouseDown","allowDefault","curSel","domObserver","currentSelection","delayedSelectionSync","setCurSelection","disconnectSelection","cursorWrapper","domSelection","img","disabled","selectCursorWrapper","resetEditableFrom","resetEditableTo","brokenSelectBetweenUneditable","temporarilyEditableNear","resetEditable","hideSelectionGuard","removeClassOnSelectionChange","connectSelection","setEditable","wasDraggable","lastSelectedViewDesc","clearNodeSelection","hasFocusAndSelection","moveSelectionBlock","$side","selectHorizontally","mods","nodePos","nodeLen","isIgnorable","skipIgnoredNodes","moveNode","moveOffset","isBlockNode","setSelFocus","skipIgnoredNodesBefore","skipIgnoredNodesAfter","findDirection","mid","abs","direction","selectVertically","beyond","stopNativeHorizontalDelete","switchEditable","serializeForClipboard","serializer","detachedDoc","wrapMap","parseFromClipboard","plainText","inCode","asText","parsed","metas","firstTag","readHTML","querySelectorAll","restoreReplacedSpaces","contextNode","sliceData","inlineParents","addContext","closeSlice","lastWrap","inLast","addToSibling","closeRight","wrapped","withWrappers","normalizeSiblings","sibling","closeRange","thead","tbody","caption","colgroup","col","td","th","_detachedDoc","implementation","createHTMLDocument","editHandlers","passiveHandlers","touchstart","touchmove","InputState","lastKeyCode","lastKeyCodeTime","lastClick","lastSelectionOrigin","lastSelectionTime","lastIOSEnter","lastIOSEnterFallbackTimeout","lastFocus","lastTouch","lastAndroidDelete","composingTimeout","compositionEndedAt","compositionID","domChangeCount","eventHandlers","setSelectionOrigin","ensureListeners","currentHandlers","runCustomHandler","defaultPrevented","eventBelongsToView","bubbles","eventCoords","runHandlerOnContext","propName","updateSelection","focused","handleDoubleClick","handleTripleClick","button","defaultTripleClick","forceDOMFlush","endComposition","keydown","_event","inOrNearComposition","forceFlush","getMods","safariDownArrowBug","captureKeyDown","keyup","keypress","charCode","selectNodeModifier","mousedown","flushed","click","dy","isNear","MouseDown","targetPos","mightDrag","startDoc","addAttr","setUneditable","up","updateAllowDefault","selectedNode","selectAt","selectClickedNode","selectClickedLeaf","handleSingleClick","buttons","timeStamp","contextmenu","timeoutComposition","scheduleComposeEnd","delay","clearComposition","timestampFromCustomEvent","forceUpdate","flushingSoon","compositionupdate","markCursor","brokenClipboardAPI","doPaste","preferPlain","singleNode","sliceSingleNode","clearData","selectNodeContents","captureCopy","paste","capturePaste","Dragging","dragCopyModifier","dragstart","effectAllowed","dragging","dragend","dragover","dragenter","drop","eventPos","$mouse","isNode","beforeInsert","relatedTarget","flushSoon","compareObjs","WidgetType","noSpec","oldOffset","Decoration","valid","InlineType","inclusiveStart","inclusiveEnd","DecorationSet","local","buildTree","predicate","findInner","childOff","mapInner","newLocal","oldChildren","baseOffset","moved","oldEnd","newEnd","dSize","mustRebuild","fromLocal","toLocal","childOffset","childNode","gather","mapAndGatherRemainingDecorations","byPos","mapChildren","addInner","takeSpansForNode","moveSpans","withoutNulls","removeInner","localSet","DecorationGroup","removeOverlap","localsInner","is","members","mappedDecos","member","sorted","spans","hasNulls","localStart","subtree","working","insertAhead","viewDecorations","observeOptions","childList","characterData","characterDataOldValue","attributeOldValue","useCharData","SelectionState","DOMObserver","handleDOMChange","queue","observer","onCharData","suppressingSelectionUpdates","MutationObserver","mutations","removedNodes","prevValue","onSelectionChange","takeRecords","observe","take","disconnect","suppressSelectionUpdates","ignoreSelectionChange","container","ancestors","newSel","typeOver","registerMutation","brs","readSel","scrollToSelection","cssChecked","whiteSpace","cssCheckWarned","checkCSS","attributeName","addedNodes","resolveSelection","parsedSel","skipClosingAndOpening","fromEnd","mayOpen","EditorView","_root","prevDirectPlugins","pluginViews","_props","directPlugins","checkStateComponent","mount","getEditable","updateCursorWrapper","buildNodeViews","computeDocDeco","shared","preferredPos","preferredSide","from_","to_","parseBetween","compare","change","endA","endB","findDiff","nextSel","$fromA","inlineChange","old","$newStart","$newEnd","$next","looksLikeJoin","markChange","chFrom","chTo","curMarks","prevMarks","isMarkChange","readDOMChange","passive","initInput","updatePluginViews","prevProps","updateStateInner","setProps","redraw","updateSel","pluginsChanged","nA","nB","changedNodeViews","scroll","updateDoc","oldScrollPos","overflowAnchor","refDOM","refTop","innerHeight","localRect","storeScrollPos","forceSelUpdate","sel1","sel2","selectionContextChanged","chromeKludge","anchorInRightPlace","newRefTop","resetScrollPos","destroyPluginViews","prevState","pluginView","parentElement","setActive","preventScroll","focusPreventScroll","domAtPos","posAtDOM","nearest","boxes","endOfTextblockVertical","modify","oldNode","oldOff","oldBidiLevel","caretBidiLevel","newOff","endOfTextblockHorizontal","pasteHTML","pasteText","destroyInput","isDestroyed","dispatchTransaction","shadowRoot","deepActiveElement","getTargetRanges","execCommand","endContainer","endOffset","currentAnchor","safariShadowSelectionRange","contenteditable","translate","convert","castFactory","tests","checks","anyFactory","propsFactory","EXIT","SKIP","visitParents","visitor","factory","parents","visit","subresult","grandparents","toResult"],"sourceRoot":""}