@neuraiproject/neurai-message 0.7.0 → 0.8.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (12) hide show
  1. package/LICENSE +1 -1
  2. package/README.md +47 -0
  3. package/dist/main.js +17646 -0
  4. package/dist/main.js.map +1 -0
  5. package/dist/module.js +17641 -0
  6. package/dist/module.js.map +1 -0
  7. package/dist/types.d.ts +8 -0
  8. package/dist/types.d.ts.map +1 -0
  9. package/index.ts +243 -10
  10. package/package.json +15 -5
  11. package/test.js +60 -4
  12. package/tsconfig.json +13 -0
package/dist/module.js.map ADDED
@@ -0,0 +1 @@
1
+ {"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,IAAI,OAAO,OAAO,MAAM,KAAK,YAC3B,qDAAqD;AACrD,iBAAiB,SAAS,SAAS,IAAI,EAAE,SAAS;IAChD,IAAI,WAAW;QACb,KAAK,MAAM,GAAG;QACd,KAAK,SAAS,GAAG,OAAO,MAAM,CAAC,UAAU,SAAS,EAAE;YAClD,aAAa;gBACX,OAAO;gBACP,YAAY;gBACZ,UAAU;gBACV,cAAc;YAChB;QACF;IACF;AACF;KAEA,mCAAmC;AACnC,iBAAiB,SAAS,SAAS,IAAI,EAAE,SAAS;IAChD,IAAI,WAAW;QACb,KAAK,MAAM,GAAG;QACd,IAAI,WAAW,YAAa;QAC5B,SAAS,SAAS,GAAG,UAAU,SAAS;QACxC,KAAK,SAAS,GAAG,IAAI;QACrB,KAAK,SAAS,CAAC,WAAW,GAAG;IAC/B;AACF;;;;;ACzBF;AAEA,IAAI,mCAAa,OAAO,WAAW,eAAe;;;AAGlD,wBAAwB,GACxB,iBAAiB,SAAS;IACzB,IAAI,OAAO,qCAAe,YAAc,OAAO;IAC/C,IAAI,OAAO,WAAW,YAAc,OAAO;IAC3C,IAAI,OAAO,iCAAW,WAAW,UAAY,OAAO;IACpD,IAAI,OAAO,OAAO,WAAW,UAAY,OAAO;IAEhD,OAAO;AACR;;;;ACbA;AAEA,8BAA8B,GAC9B,uDAAuD,GACvD,iBAAiB,SAAS;IACzB,IAAI,OAAO,WAAW,cAAc,OAAO,OAAO,qBAAqB,KAAK,YAAc,OAAO;IACjG,IAAI,OAAO,OAAO,QAAQ,KAAK,UAAY,OAAO;IAElD,wCAAwC,GACxC,IAAI,MAAM,CAAC;IACX,IAAI,MAAM,OAAO;IACjB,IAAI,SAAS,OAAO;IACpB,IAAI,OAAO,QAAQ,UAAY,OAAO;IAEtC,IAAI,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,mBAAqB,OAAO;IACxE,IAAI,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,mBAAqB,OAAO;IAE3E,sEAAsE;IACtE,+CAA+C;IAC/C,uFAAuF;IACvF,qDAAqD;IAErD,yEAAyE;IACzE,6EAA6E;IAE7E,IAAI,SAAS;IACb,GAAG,CAAC,IAAI,GAAG;IACX,IAAK,IAAI,KAAK,IAAO,OAAO;KAAS,gEAAgE;IACrG,IAAI,OAAO,OAAO,IAAI,KAAK,cAAc,OAAO,IAAI,CAAC,KAAK,MAAM,KAAK,GAAK,OAAO;IAEjF,IAAI,OAAO,OAAO,mBAAmB,KAAK,cAAc,OAAO,mBAAmB,CAAC,KAAK,MAAM,KAAK,GAAK,OAAO;IAE/G,IAAI,OAAO,OAAO,qBAAqB,CAAC;IACxC,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI,CAAC,EAAE,KAAK,KAAO,OAAO;IAEnD,IAAI,CAAC,OAAO,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,KAAK,MAAQ,OAAO;IAEpE,IAAI,OAAO,OAAO,wBAAwB,KAAK,YAAY;QAC1D,2CAA2C;QAC3C,IAAI,aAAa,+BAA+B,GAAI,OAAO,wBAAwB,CAAC,KAAK;QACzF,IAAI,WAAW,KAAK,KAAK,UAAU,WAAW,UAAU,KAAK,MAAQ,OAAO;IAC7E;IAEA,OAAO;AACR;;;;;;AC5CA;;;AAIA,IAAI,+CAAyB,SAAS;IACrC,OAAO,CAAC,CAAC;AACV;AAEA,6CAAuB,uBAAuB,GAAG,SAAS;IACzD,qEAAqE;IACrE,IAAI,CAAC,QACJ,OAAO;IAER,IAAI;QACH,OAAO,OAAgB,EAAE,EAAE,UAAU;YAAE,OAAO;QAAE,GAAG,MAAM,KAAK;IAC/D,EAAE,OAAO,GAAG;QACX,oEAAoE;QACpE,OAAO;IACR;AACD;AAEA,iBAAiB;;;;ACrBjB;AAEA,wBAAwB,GACxB,IAAI,wCAAkB,OAAO,cAAc,IAAI;AAC/C,IAAI,uCACH,IAAI;IACH,sCAAgB,CAAC,GAAG,KAAK;QAAE,OAAO;IAAE;AACrC,EAAE,OAAO,GAAG;IACX,mCAAmC;IACnC,wCAAkB;AACnB;AAGD,iBAAiB;;;;;;ACbjB;;;AAIA,wBAAwB,GACxB,iBAAiB,SAAS;IACzB,OAAO,YAAgB,CAAC,CAAC,OAAO,WAAW;AAC5C;;;;;;ACPA,UAAU,OAAO,OAAO,GAAG;AAC3B,QAAQ,MAAM,GAAG;AACjB,QAAQ,QAAQ,GAAG;;AACnB,QAAQ,QAAQ,GAAG;;AACnB,QAAQ,MAAM,GAAG;;AACjB,QAAQ,SAAS,GAAG;;AACpB,QAAQ,WAAW,GAAG;;;;ACNtB,sDAAsD;AACtD,EAAE;AACF,0EAA0E;AAC1E,gEAAgE;AAChE,sEAAsE;AACtE,sEAAsE;AACtE,4EAA4E;AAC5E,qEAAqE;AACrE,wBAAwB;AACxB,EAAE;AACF,0EAA0E;AAC1E,yDAAyD;AACzD,EAAE;AACF,0EAA0E;AAC1E,6DAA6D;AAC7D,4EAA4E;AAC5E,2EAA2E;AAC3E,wEAAwE;AACxE,4EAA4E;AAC5E,yCAAyC;AAEzC;;;AAKA,gBAAgB,GAEhB,iBAAiB;;;AAIjB,gBAAgB,GAEhB,eAAe,GACf,IAAI;AACJ,gBAAgB,GAEhB,+BAAS,aAAa,GAAG;;mCAGrB;AAEJ,IAAI,wCAAkB,SAAU,OAAO,EAAE,IAAI;IAC3C,OAAO,QAAQ,SAAS,CAAC,MAAM,MAAM;AACvC;;;;;uCASI;AACJ,IAAI,sCAAgB,AAAC,CAAA,OAAO,mBAAW,cAAc,iBAAS,OAAO,WAAW,cAAc,SAAS,OAAO,SAAS,cAAc,OAAO,CAAC,CAAA,EAAG,UAAU,IAAI,YAAa;AAC3K,SAAS,0CAAoB,KAAK;IAChC,OAAO,iCAAO,IAAI,CAAC;AACrB;AACA,SAAS,oCAAc,GAAG;IACxB,OAAO,iCAAO,QAAQ,CAAC,QAAQ,eAAe;AAChD;;AAEA,gBAAgB,GAEhB,eAAe,GACf,IAAI,6BAAO,OAAO,MAAM,CAAC;;AACzB,2BAAK,QAAQ,GAAG;;;AAKhB,IAAI,8BAAQ,KAAK;AACjB,IAAI,UAAa,OAAU,QAAQ,EACjC,8BAAQ,OAAU,QAAQ,CAAC;KAE3B,8BAAQ,YAAa;;;;;AAMvB,IAAI;AAEJ,2BAAK,QAAQ,CAAC,gCAAU;AAExB,IAAI,qCAAe;IAAC;IAAS;IAAS;IAAW;IAAS;CAAS;AAEnE,SAAS,sCAAgB,OAAO,EAAE,KAAK,EAAE,EAAE;IACzC,iEAAiE;IACjE,0CAA0C;IAC1C,IAAI,OAAO,QAAQ,eAAe,KAAK,YAAY,OAAO,QAAQ,eAAe,CAAC,OAAO;IAEzF,4EAA4E;IAC5E,2EAA2E;IAC3E,yEAAyE;IACzE,4EAA4E;IAC5E,IAAI,CAAC,QAAQ,OAAO,IAAI,CAAC,QAAQ,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,OAAO;SAAS,IAAI,OAAQ,QAAQ,OAAO,CAAC,MAAM,GAAG,QAAQ,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC;SAAS,QAAQ,OAAO,CAAC,MAAM,GAAG;QAAC;QAAI,QAAQ,OAAO,CAAC,MAAM;KAAC;AAChN;;;AAEA,SAAS,oCAAc,OAAO,EAAE,MAAM;IACpC,+BAAS,gCAAU;IAEnB,UAAU,WAAW,CAAC;IAEtB,2DAA2D;IAC3D,2BAA2B;IAC3B,2DAA2D;IAC3D,uEAAuE;IACvE,2EAA2E;IAC3E,IAAI,WAAW,kBAAkB;IAEjC,2DAA2D;IAC3D,wDAAwD;IACxD,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,UAAU;IAEtC,IAAI,UAAU,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,QAAQ,kBAAkB;IAE/E,iEAAiE;IACjE,uEAAuE;IACvE,IAAI,MAAM,QAAQ,aAAa;IAC/B,IAAI,cAAc,QAAQ,qBAAqB;IAC/C,IAAI,aAAa,IAAI,CAAC,UAAU,GAAG,KAAK;IAExC,IAAI,OAAO,QAAQ,GAAG,IAAI,CAAC,aAAa,GAAG;SAAS,IAAI,YAAa,CAAA,eAAe,gBAAgB,CAAA,GAAI,IAAI,CAAC,aAAa,GAAG;SAAiB,IAAI,CAAC,aAAa,GAAG;IAEnK,gBAAgB;IAChB,IAAI,CAAC,aAAa,GAAG,KAAK,KAAK,CAAC,IAAI,CAAC,aAAa;IAElD,6EAA6E;IAC7E,iEAAiE;IACjE,gBAAgB;IAChB,IAAI,CAAC,MAAM,GAAG,IAAI;IAClB,IAAI,CAAC,MAAM,GAAG;IACd,IAAI,CAAC,KAAK,GAAG;IACb,IAAI,CAAC,UAAU,GAAG;IAClB,IAAI,CAAC,OAAO,GAAG;IACf,IAAI,CAAC,KAAK,GAAG;IACb,IAAI,CAAC,UAAU,GAAG;IAClB,IAAI,CAAC,OAAO,GAAG;IAEf,sEAAsE;IACtE,0EAA0E;IAC1E,wEAAwE;IACxE,yCAAyC;IACzC,IAAI,CAAC,IAAI,GAAG;IAEZ,qDAAqD;IACrD,mDAAmD;IACnD,IAAI,CAAC,YAAY,GAAG;IACpB,IAAI,CAAC,eAAe,GAAG;IACvB,IAAI,CAAC,iBAAiB,GAAG;IACzB,IAAI,CAAC,eAAe,GAAG;IAEvB,wBAAwB;IACxB,IAAI,CAAC,SAAS,GAAG;IAEjB,sEAAsE;IACtE,6DAA6D;IAC7D,uDAAuD;IACvD,IAAI,CAAC,eAAe,GAAG,QAAQ,eAAe,IAAI;IAElD,oEAAoE;IACpE,IAAI,CAAC,UAAU,GAAG;IAElB,8CAA8C;IAC9C,IAAI,CAAC,WAAW,GAAG;IAEnB,IAAI,CAAC,OAAO,GAAG;IACf,IAAI,CAAC,QAAQ,GAAG;IAChB,IAAI,QAAQ,QAAQ,EAAE;QACpB,IAAI,CAAC,qCAAe,sCAAgB;QACpC,IAAI,CAAC,OAAO,GAAG,IAAI,oCAAc,QAAQ,QAAQ;QACjD,IAAI,CAAC,QAAQ,GAAG,QAAQ,QAAQ;IAClC;AACF;;AAEA,SAAS,+BAAS,OAAO;IACvB,+BAAS,gCAAU;IAEnB,IAAI,CAAE,CAAA,IAAI,YAAY,8BAAO,GAAI,OAAO,IAAI,+BAAS;IAErD,IAAI,CAAC,cAAc,GAAG,IAAI,oCAAc,SAAS,IAAI;IAErD,SAAS;IACT,IAAI,CAAC,QAAQ,GAAG;IAEhB,IAAI,SAAS;QACX,IAAI,OAAO,QAAQ,IAAI,KAAK,YAAY,IAAI,CAAC,KAAK,GAAG,QAAQ,IAAI;QAEjE,IAAI,OAAO,QAAQ,OAAO,KAAK,YAAY,IAAI,CAAC,QAAQ,GAAG,QAAQ,OAAO;IAC5E;IAEA,OAAO,IAAI,CAAC,IAAI;AAClB;AAEA,OAAO,cAAc,CAAC,+BAAS,SAAS,EAAE,aAAa;IACrD,KAAK;QACH,IAAI,IAAI,CAAC,cAAc,KAAK,WAC1B,OAAO;QAET,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS;IACtC;IACA,KAAK,SAAU,KAAK;QAClB,oCAAoC;QACpC,+BAA+B;QAC/B,IAAI,CAAC,IAAI,CAAC,cAAc,EACtB;QAGF,iDAAiD;QACjD,qBAAqB;QACrB,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG;IAClC;AACF;AAEA,+BAAS,SAAS,CAAC,OAAO,GAAG;AAC7B,+BAAS,SAAS,CAAC,UAAU,GAAG;AAChC,+BAAS,SAAS,CAAC,QAAQ,GAAG,SAAU,GAAG,EAAE,EAAE;IAC7C,IAAI,CAAC,IAAI,CAAC;IACV,GAAG;AACL;AAEA,mDAAmD;AACnD,+DAA+D;AAC/D,6DAA6D;AAC7D,qBAAqB;AACrB,+BAAS,SAAS,CAAC,IAAI,GAAG,SAAU,KAAK,EAAE,QAAQ;IACjD,IAAI,QAAQ,IAAI,CAAC,cAAc;IAC/B,IAAI;IAEJ,IAAI,CAAC,MAAM,UAAU,EACnB;QAAA,IAAI,OAAO,UAAU,UAAU;YAC7B,WAAW,YAAY,MAAM,eAAe;YAC5C,IAAI,aAAa,MAAM,QAAQ,EAAE;gBAC/B,QAAQ,iCAAO,IAAI,CAAC,OAAO;gBAC3B,WAAW;YACb;YACA,iBAAiB;QACnB;IAAA,OAEA,iBAAiB;IAGnB,OAAO,uCAAiB,IAAI,EAAE,OAAO,UAAU,OAAO;AACxD;AAEA,8DAA8D;AAC9D,+BAAS,SAAS,CAAC,OAAO,GAAG,SAAU,KAAK;IAC1C,OAAO,uCAAiB,IAAI,EAAE,OAAO,MAAM,MAAM;AACnD;AAEA,SAAS,uCAAiB,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,cAAc;IAC3E,IAAI,QAAQ,OAAO,cAAc;IACjC,IAAI,UAAU,MAAM;QAClB,MAAM,OAAO,GAAG;QAChB,iCAAW,QAAQ;IACrB,OAAO;QACL,IAAI;QACJ,IAAI,CAAC,gBAAgB,KAAK,mCAAa,OAAO;QAC9C,IAAI,IACF,OAAO,IAAI,CAAC,SAAS;aAChB,IAAI,MAAM,UAAU,IAAI,SAAS,MAAM,MAAM,GAAG,GAAG;YACxD,IAAI,OAAO,UAAU,YAAY,CAAC,MAAM,UAAU,IAAI,OAAO,cAAc,CAAC,WAAW,iCAAO,SAAS,EACrG,QAAQ,0CAAoB;YAG9B,IAAI;gBACF,IAAI,MAAM,UAAU,EAAE,OAAO,IAAI,CAAC,SAAS,IAAI,MAAM;qBAA0C,+BAAS,QAAQ,OAAO,OAAO;mBACzH,IAAI,MAAM,KAAK,EACpB,OAAO,IAAI,CAAC,SAAS,IAAI,MAAM;iBAC1B;gBACL,MAAM,OAAO,GAAG;gBAChB,IAAI,MAAM,OAAO,IAAI,CAAC,UAAU;oBAC9B,QAAQ,MAAM,OAAO,CAAC,KAAK,CAAC;oBAC5B,IAAI,MAAM,UAAU,IAAI,MAAM,MAAM,KAAK,GAAG,+BAAS,QAAQ,OAAO,OAAO;yBAAY,oCAAc,QAAQ;gBAC/G,OACE,+BAAS,QAAQ,OAAO,OAAO;YAEnC;QACF,OAAO,IAAI,CAAC,YACV,MAAM,OAAO,GAAG;IAEpB;IAEA,OAAO,mCAAa;AACtB;AAEA,SAAS,+BAAS,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU;IAChD,IAAI,MAAM,OAAO,IAAI,MAAM,MAAM,KAAK,KAAK,CAAC,MAAM,IAAI,EAAE;QACtD,OAAO,IAAI,CAAC,QAAQ;QACpB,OAAO,IAAI,CAAC;IACd,OAAO;QACL,0BAA0B;QAC1B,MAAM,MAAM,IAAI,MAAM,UAAU,GAAG,IAAI,MAAM,MAAM;QACnD,IAAI,YAAY,MAAM,MAAM,CAAC,OAAO,CAAC;aAAY,MAAM,MAAM,CAAC,IAAI,CAAC;QAEnE,IAAI,MAAM,YAAY,EAAE,mCAAa;IACvC;IACA,oCAAc,QAAQ;AACxB;AAEA,SAAS,mCAAa,KAAK,EAAE,KAAK;IAChC,IAAI;IACJ,IAAI,CAAC,oCAAc,UAAU,OAAO,UAAU,YAAY,UAAU,aAAa,CAAC,MAAM,UAAU,EAChG,KAAK,IAAI,UAAU;IAErB,OAAO;AACT;AAEA,8DAA8D;AAC9D,kDAAkD;AAClD,yDAAyD;AACzD,qDAAqD;AACrD,kEAAkE;AAClE,oEAAoE;AACpE,sCAAsC;AACtC,SAAS,mCAAa,KAAK;IACzB,OAAO,CAAC,MAAM,KAAK,IAAK,CAAA,MAAM,YAAY,IAAI,MAAM,MAAM,GAAG,MAAM,aAAa,IAAI,MAAM,MAAM,KAAK,CAAA;AACvG;AAEA,+BAAS,SAAS,CAAC,QAAQ,GAAG;IAC5B,OAAO,IAAI,CAAC,cAAc,CAAC,OAAO,KAAK;AACzC;;AAEA,2BAA2B;AAC3B,+BAAS,SAAS,CAAC,WAAW,GAAG,SAAU,GAAG;IAC5C,IAAI,CAAC,qCAAe,sCAAgB;IACpC,IAAI,CAAC,cAAc,CAAC,OAAO,GAAG,IAAI,oCAAc;IAChD,IAAI,CAAC,cAAc,CAAC,QAAQ,GAAG;IAC/B,OAAO,IAAI;AACb;AAEA,4BAA4B;AAC5B,IAAI,gCAAU;AACd,SAAS,8CAAwB,CAAC;IAChC,IAAI,KAAK,+BACP,IAAI;SACC;QACL,2EAA2E;QAC3E,eAAe;QACf;QACA,KAAK,MAAM;QACX,KAAK,MAAM;QACX,KAAK,MAAM;QACX,KAAK,MAAM;QACX,KAAK,MAAM;QACX;IACF;IACA,OAAO;AACT;AAEA,6EAA6E;AAC7E,gCAAgC;AAChC,SAAS,oCAAc,CAAC,EAAE,KAAK;IAC7B,IAAI,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,KAAK,EAAE,OAAO;IACxD,IAAI,MAAM,UAAU,EAAE,OAAO;IAC7B,IAAI,MAAM,GAAG;QACX,iCAAiC;QACjC,IAAI,MAAM,OAAO,IAAI,MAAM,MAAM,EAAE,OAAO,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;aAAM,OAAO,MAAM,MAAM;IAClG;IACA,qEAAqE;IACrE,IAAI,IAAI,MAAM,aAAa,EAAE,MAAM,aAAa,GAAG,8CAAwB;IAC3E,IAAI,KAAK,MAAM,MAAM,EAAE,OAAO;IAC9B,oBAAoB;IACpB,IAAI,CAAC,MAAM,KAAK,EAAE;QAChB,MAAM,YAAY,GAAG;QACrB,OAAO;IACT;IACA,OAAO,MAAM,MAAM;AACrB;AAEA,oEAAoE;AACpE,+BAAS,SAAS,CAAC,IAAI,GAAG,SAAU,CAAC;IACnC,4BAAM,QAAQ;IACd,IAAI,SAAS,GAAG;IAChB,IAAI,QAAQ,IAAI,CAAC,cAAc;IAC/B,IAAI,QAAQ;IAEZ,IAAI,MAAM,GAAG,MAAM,eAAe,GAAG;IAErC,6DAA6D;IAC7D,gEAAgE;IAChE,oCAAoC;IACpC,IAAI,MAAM,KAAK,MAAM,YAAY,IAAK,CAAA,MAAM,MAAM,IAAI,MAAM,aAAa,IAAI,MAAM,KAAK,AAAD,GAAI;QACzF,4BAAM,sBAAsB,MAAM,MAAM,EAAE,MAAM,KAAK;QACrD,IAAI,MAAM,MAAM,KAAK,KAAK,MAAM,KAAK,EAAE,kCAAY,IAAI;aAAO,mCAAa,IAAI;QAC/E,OAAO;IACT;IAEA,IAAI,oCAAc,GAAG;IAErB,0DAA0D;IAC1D,IAAI,MAAM,KAAK,MAAM,KAAK,EAAE;QAC1B,IAAI,MAAM,MAAM,KAAK,GAAG,kCAAY,IAAI;QACxC,OAAO;IACT;IAEA,oDAAoD;IACpD,4DAA4D;IAC5D,6DAA6D;IAC7D,6DAA6D;IAC7D,2DAA2D;IAC3D,iCAAiC;IACjC,EAAE;IACF,qBAAqB;IACrB,6DAA6D;IAC7D,0BAA0B;IAC1B,EAAE;IACF,oEAAoE;IACpE,kEAAkE;IAClE,kEAAkE;IAClE,mEAAmE;IACnE,sCAAsC;IACtC,qEAAqE;IACrE,sEAAsE;IACtE,kBAAkB;IAClB,EAAE;IACF,sEAAsE;IAEtE,gEAAgE;IAChE,IAAI,SAAS,MAAM,YAAY;IAC/B,4BAAM,iBAAiB;IAEvB,wEAAwE;IACxE,IAAI,MAAM,MAAM,KAAK,KAAK,MAAM,MAAM,GAAG,IAAI,MAAM,aAAa,EAAE;QAChE,SAAS;QACT,4BAAM,8BAA8B;IACtC;IAEA,uEAAuE;IACvE,kCAAkC;IAClC,IAAI,MAAM,KAAK,IAAI,MAAM,OAAO,EAAE;QAChC,SAAS;QACT,4BAAM,oBAAoB;IAC5B,OAAO,IAAI,QAAQ;QACjB,4BAAM;QACN,MAAM,OAAO,GAAG;QAChB,MAAM,IAAI,GAAG;QACb,oEAAoE;QACpE,IAAI,MAAM,MAAM,KAAK,GAAG,MAAM,YAAY,GAAG;QAC7C,4BAA4B;QAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,aAAa;QAC9B,MAAM,IAAI,GAAG;QACb,oEAAoE;QACpE,sEAAsE;QACtE,IAAI,CAAC,MAAM,OAAO,EAAE,IAAI,oCAAc,OAAO;IAC/C;IAEA,IAAI;IACJ,IAAI,IAAI,GAAG,MAAM,+BAAS,GAAG;SAAY,MAAM;IAE/C,IAAI,QAAQ,MAAM;QAChB,MAAM,YAAY,GAAG;QACrB,IAAI;IACN,OACE,MAAM,MAAM,IAAI;IAGlB,IAAI,MAAM,MAAM,KAAK,GAAG;QACtB,yDAAyD;QACzD,oDAAoD;QACpD,IAAI,CAAC,MAAM,KAAK,EAAE,MAAM,YAAY,GAAG;QAEvC,sEAAsE;QACtE,IAAI,UAAU,KAAK,MAAM,KAAK,EAAE,kCAAY,IAAI;IAClD;IAEA,IAAI,QAAQ,MAAM,IAAI,CAAC,IAAI,CAAC,QAAQ;IAEpC,OAAO;AACT;AAEA,SAAS,iCAAW,MAAM,EAAE,KAAK;IAC/B,IAAI,MAAM,KAAK,EAAE;IACjB,IAAI,MAAM,OAAO,EAAE;QACjB,IAAI,QAAQ,MAAM,OAAO,CAAC,GAAG;QAC7B,IAAI,SAAS,MAAM,MAAM,EAAE;YACzB,MAAM,MAAM,CAAC,IAAI,CAAC;YAClB,MAAM,MAAM,IAAI,MAAM,UAAU,GAAG,IAAI,MAAM,MAAM;QACrD;IACF;IACA,MAAM,KAAK,GAAG;IAEd,sDAAsD;IACtD,mCAAa;AACf;AAEA,wEAAwE;AACxE,qEAAqE;AACrE,uDAAuD;AACvD,SAAS,mCAAa,MAAM;IAC1B,IAAI,QAAQ,OAAO,cAAc;IACjC,MAAM,YAAY,GAAG;IACrB,IAAI,CAAC,MAAM,eAAe,EAAE;QAC1B,4BAAM,gBAAgB,MAAM,OAAO;QACnC,MAAM,eAAe,GAAG;QACxB,IAAI,MAAM,IAAI,EAAE,gBAAa,qCAAe;aAAa,oCAAc;IACzE;AACF;AAEA,SAAS,oCAAc,MAAM;IAC3B,4BAAM;IACN,OAAO,IAAI,CAAC;IACZ,2BAAK;AACP;AAEA,oEAAoE;AACpE,mEAAmE;AACnE,iEAAiE;AACjE,oBAAoB;AACpB,iEAAiE;AACjE,wDAAwD;AACxD,SAAS,oCAAc,MAAM,EAAE,KAAK;IAClC,IAAI,CAAC,MAAM,WAAW,EAAE;QACtB,MAAM,WAAW,GAAG;QACpB,gBAAa,sCAAgB,QAAQ;IACvC;AACF;AAEA,SAAS,qCAAe,MAAM,EAAE,KAAK;IACnC,IAAI,MAAM,MAAM,MAAM;IACtB,MAAO,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,MAAM,MAAM,GAAG,MAAM,aAAa,CAAE;QAC7F,4BAAM;QACN,OAAO,IAAI,CAAC;QACZ,IAAI,QAAQ,MAAM,MAAM,EAEtB;aAAW,MAAM,MAAM,MAAM;IACjC;IACA,MAAM,WAAW,GAAG;AACtB;AAEA,yEAAyE;AACzE,kDAAkD;AAClD,qEAAqE;AACrE,8CAA8C;AAC9C,+BAAS,SAAS,CAAC,KAAK,GAAG,SAAU,CAAC;IACpC,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,MAAM;AAC/B;AAEA,+BAAS,SAAS,CAAC,IAAI,GAAG,SAAU,IAAI,EAAE,QAAQ;IAChD,IAAI,MAAM,IAAI;IACd,IAAI,QAAQ,IAAI,CAAC,cAAc;IAE/B,OAAQ,MAAM,UAAU;QACtB,KAAK;YACH,MAAM,KAAK,GAAG;YACd;QACF,KAAK;YACH,MAAM,KAAK,GAAG;gBAAC,MAAM,KAAK;gBAAE;aAAK;YACjC;QACF;YACE,MAAM,KAAK,CAAC,IAAI,CAAC;YACjB;IACJ;IACA,MAAM,UAAU,IAAI;IACpB,4BAAM,yBAAyB,MAAM,UAAU,EAAE;IAEjD,IAAI,QAAQ,AAAC,CAAA,CAAC,YAAY,SAAS,GAAG,KAAK,KAAI,KAAM,SAAS,QAAQ,MAAM,IAAI,SAAS,QAAQ,MAAM;IAEvG,IAAI,QAAQ,QAAQ,QAAQ;IAC5B,IAAI,MAAM,UAAU,EAAE,gBAAa;SAAY,IAAI,IAAI,CAAC,OAAO;IAE/D,KAAK,EAAE,CAAC,UAAU;IAClB,SAAS,SAAS,QAAQ,EAAE,UAAU;QACpC,4BAAM;QACN,IAAI,aAAa,KACf;YAAA,IAAI,cAAc,WAAW,UAAU,KAAK,OAAO;gBACjD,WAAW,UAAU,GAAG;gBACxB;YACF;QAAA;IAEJ;IAEA,SAAS;QACP,4BAAM;QACN,KAAK,GAAG;IACV;IAEA,0DAA0D;IAC1D,4DAA4D;IAC5D,2DAA2D;IAC3D,YAAY;IACZ,IAAI,UAAU,kCAAY;IAC1B,KAAK,EAAE,CAAC,SAAS;IAEjB,IAAI,YAAY;IAChB,SAAS;QACP,4BAAM;QACN,iDAAiD;QACjD,KAAK,cAAc,CAAC,SAAS;QAC7B,KAAK,cAAc,CAAC,UAAU;QAC9B,KAAK,cAAc,CAAC,SAAS;QAC7B,KAAK,cAAc,CAAC,SAAS;QAC7B,KAAK,cAAc,CAAC,UAAU;QAC9B,IAAI,cAAc,CAAC,OAAO;QAC1B,IAAI,cAAc,CAAC,OAAO;QAC1B,IAAI,cAAc,CAAC,QAAQ;QAE3B,YAAY;QAEZ,uDAAuD;QACvD,yDAAyD;QACzD,iBAAiB;QACjB,6DAA6D;QAC7D,6DAA6D;QAC7D,IAAI,MAAM,UAAU,IAAK,CAAA,CAAC,KAAK,cAAc,IAAI,KAAK,cAAc,CAAC,SAAS,AAAD,GAAI;IACnF;IAEA,6EAA6E;IAC7E,6EAA6E;IAC7E,iEAAiE;IACjE,iDAAiD;IACjD,IAAI,sBAAsB;IAC1B,IAAI,EAAE,CAAC,QAAQ;IACf,SAAS,OAAO,KAAK;QACnB,4BAAM;QACN,sBAAsB;QACtB,IAAI,MAAM,KAAK,KAAK,CAAC;QACrB,IAAI,UAAU,OAAO,CAAC,qBAAqB;YACzC,4DAA4D;YAC5D,2DAA2D;YAC3D,uBAAuB;YACvB,yDAAyD;YACzD,IAAI,AAAC,CAAA,MAAM,UAAU,KAAK,KAAK,MAAM,KAAK,KAAK,QAAQ,MAAM,UAAU,GAAG,KAAK,8BAAQ,MAAM,KAAK,EAAE,UAAU,EAAC,KAAM,CAAC,WAAW;gBAC/H,4BAAM,+BAA+B,MAAM,UAAU;gBACrD,MAAM,UAAU;gBAChB,sBAAsB;YACxB;YACA,IAAI,KAAK;QACX;IACF;IAEA,sDAAsD;IACtD,0DAA0D;IAC1D,SAAS,QAAQ,EAAE;QACjB,4BAAM,WAAW;QACjB;QACA,KAAK,cAAc,CAAC,SAAS;QAC7B,IAAI,sCAAgB,MAAM,aAAa,GAAG,KAAK,IAAI,CAAC,SAAS;IAC/D;IAEA,gEAAgE;IAChE,sCAAgB,MAAM,SAAS;IAE/B,8DAA8D;IAC9D,SAAS;QACP,KAAK,cAAc,CAAC,UAAU;QAC9B;IACF;IACA,KAAK,IAAI,CAAC,SAAS;IACnB,SAAS;QACP,4BAAM;QACN,KAAK,cAAc,CAAC,SAAS;QAC7B;IACF;IACA,KAAK,IAAI,CAAC,UAAU;IAEpB,SAAS;QACP,4BAAM;QACN,IAAI,MAAM,CAAC;IACb;IAEA,yCAAyC;IACzC,KAAK,IAAI,CAAC,QAAQ;IAElB,oDAAoD;IACpD,IAAI,CAAC,MAAM,OAAO,EAAE;QAClB,4BAAM;QACN,IAAI,MAAM;IACZ;IAEA,OAAO;AACT;AAEA,SAAS,kCAAY,GAAG;IACtB,OAAO;QACL,IAAI,QAAQ,IAAI,cAAc;QAC9B,4BAAM,eAAe,MAAM,UAAU;QACrC,IAAI,MAAM,UAAU,EAAE,MAAM,UAAU;QACtC,IAAI,MAAM,UAAU,KAAK,KAAK,sCAAgB,KAAK,SAAS;YAC1D,MAAM,OAAO,GAAG;YAChB,2BAAK;QACP;IACF;AACF;AAEA,+BAAS,SAAS,CAAC,MAAM,GAAG,SAAU,IAAI;IACxC,IAAI,QAAQ,IAAI,CAAC,cAAc;IAC/B,IAAI,aAAa;QAAE,YAAY;IAAM;IAErC,iDAAiD;IACjD,IAAI,MAAM,UAAU,KAAK,GAAG,OAAO,IAAI;IAEvC,2CAA2C;IAC3C,IAAI,MAAM,UAAU,KAAK,GAAG;QAC1B,6CAA6C;QAC7C,IAAI,QAAQ,SAAS,MAAM,KAAK,EAAE,OAAO,IAAI;QAE7C,IAAI,CAAC,MAAM,OAAO,MAAM,KAAK;QAE7B,eAAe;QACf,MAAM,KAAK,GAAG;QACd,MAAM,UAAU,GAAG;QACnB,MAAM,OAAO,GAAG;QAChB,IAAI,MAAM,KAAK,IAAI,CAAC,UAAU,IAAI,EAAE;QACpC,OAAO,IAAI;IACb;IAEA,yCAAyC;IAEzC,IAAI,CAAC,MAAM;QACT,cAAc;QACd,IAAI,QAAQ,MAAM,KAAK;QACvB,IAAI,MAAM,MAAM,UAAU;QAC1B,MAAM,KAAK,GAAG;QACd,MAAM,UAAU,GAAG;QACnB,MAAM,OAAO,GAAG;QAEhB,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACvB,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE;YAAE,YAAY;QAAM;QACnD,OAAO,IAAI;IACd;IAEA,6BAA6B;IAC7B,IAAI,QAAQ,8BAAQ,MAAM,KAAK,EAAE;IACjC,IAAI,UAAU,IAAI,OAAO,IAAI;IAE7B,MAAM,KAAK,CAAC,MAAM,CAAC,OAAO;IAC1B,MAAM,UAAU,IAAI;IACpB,IAAI,MAAM,UAAU,KAAK,GAAG,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,EAAE;IAExD,KAAK,IAAI,CAAC,UAAU,IAAI,EAAE;IAE1B,OAAO,IAAI;AACb;AAEA,2CAA2C;AAC3C,qDAAqD;AACrD,+BAAS,SAAS,CAAC,EAAE,GAAG,SAAU,EAAE,EAAE,EAAE;IACtC,IAAI,MAAM,OAAO,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI;IAE7C,IAAI,OAAO,QACT,+DAA+D;IAC/D;QAAA,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,KAAK,OAAO,IAAI,CAAC,MAAM;IAAE,OACnD,IAAI,OAAO,YAAY;QAC5B,IAAI,QAAQ,IAAI,CAAC,cAAc;QAC/B,IAAI,CAAC,MAAM,UAAU,IAAI,CAAC,MAAM,iBAAiB,EAAE;YACjD,MAAM,iBAAiB,GAAG,MAAM,YAAY,GAAG;YAC/C,MAAM,eAAe,GAAG;YACxB,IAAI,CAAC,MAAM,OAAO,EAChB,gBAAa,wCAAkB,IAAI;iBAC9B,IAAI,MAAM,MAAM,EACrB,mCAAa,IAAI;QAErB;IACF;IAEA,OAAO;AACT;AACA,+BAAS,SAAS,CAAC,WAAW,GAAG,+BAAS,SAAS,CAAC,EAAE;AAEtD,SAAS,uCAAiB,KAAI;IAC5B,4BAAM;IACN,MAAK,IAAI,CAAC;AACZ;AAEA,sEAAsE;AACtE,oDAAoD;AACpD,+BAAS,SAAS,CAAC,MAAM,GAAG;IAC1B,IAAI,QAAQ,IAAI,CAAC,cAAc;IAC/B,IAAI,CAAC,MAAM,OAAO,EAAE;QAClB,4BAAM;QACN,MAAM,OAAO,GAAG;QAChB,6BAAO,IAAI,EAAE;IACf;IACA,OAAO,IAAI;AACb;AAEA,SAAS,6BAAO,MAAM,EAAE,KAAK;IAC3B,IAAI,CAAC,MAAM,eAAe,EAAE;QAC1B,MAAM,eAAe,GAAG;QACxB,gBAAa,+BAAS,QAAQ;IAChC;AACF;AAEA,SAAS,8BAAQ,MAAM,EAAE,KAAK;IAC5B,IAAI,CAAC,MAAM,OAAO,EAAE;QAClB,4BAAM;QACN,OAAO,IAAI,CAAC;IACd;IAEA,MAAM,eAAe,GAAG;IACxB,MAAM,UAAU,GAAG;IACnB,OAAO,IAAI,CAAC;IACZ,2BAAK;IACL,IAAI,MAAM,OAAO,IAAI,CAAC,MAAM,OAAO,EAAE,OAAO,IAAI,CAAC;AACnD;AAEA,+BAAS,SAAS,CAAC,KAAK,GAAG;IACzB,4BAAM,yBAAyB,IAAI,CAAC,cAAc,CAAC,OAAO;IAC1D,IAAI,UAAU,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE;QACzC,4BAAM;QACN,IAAI,CAAC,cAAc,CAAC,OAAO,GAAG;QAC9B,IAAI,CAAC,IAAI,CAAC;IACZ;IACA,OAAO,IAAI;AACb;AAEA,SAAS,2BAAK,MAAM;IAClB,IAAI,QAAQ,OAAO,cAAc;IACjC,4BAAM,QAAQ,MAAM,OAAO;IAC3B,MAAO,MAAM,OAAO,IAAI,OAAO,IAAI,OAAO;AAC5C;AAEA,qDAAqD;AACrD,uDAAuD;AACvD,6CAA6C;AAC7C,+BAAS,SAAS,CAAC,IAAI,GAAG,SAAU,MAAM;IACxC,IAAI,QAAQ,IAAI;IAEhB,IAAI,QAAQ,IAAI,CAAC,cAAc;IAC/B,IAAI,SAAS;IAEb,OAAO,EAAE,CAAC,OAAO;QACf,4BAAM;QACN,IAAI,MAAM,OAAO,IAAI,CAAC,MAAM,KAAK,EAAE;YACjC,IAAI,QAAQ,MAAM,OAAO,CAAC,GAAG;YAC7B,IAAI,SAAS,MAAM,MAAM,EAAE,MAAM,IAAI,CAAC;QACxC;QAEA,MAAM,IAAI,CAAC;IACb;IAEA,OAAO,EAAE,CAAC,QAAQ,SAAU,KAAK;QAC/B,4BAAM;QACN,IAAI,MAAM,OAAO,EAAE,QAAQ,MAAM,OAAO,CAAC,KAAK,CAAC;QAE/C,6CAA6C;QAC7C,IAAI,MAAM,UAAU,IAAK,CAAA,UAAU,QAAQ,UAAU,SAAQ,GAAI;aAAY,IAAI,CAAC,MAAM,UAAU,IAAK,CAAA,CAAC,SAAS,CAAC,MAAM,MAAM,AAAD,GAAI;QAEjI,IAAI,MAAM,MAAM,IAAI,CAAC;QACrB,IAAI,CAAC,KAAK;YACR,SAAS;YACT,OAAO,KAAK;QACd;IACF;IAEA,+BAA+B;IAC/B,gDAAgD;IAChD,IAAK,IAAI,KAAK,OACZ,IAAI,IAAI,CAAC,EAAE,KAAK,aAAa,OAAO,MAAM,CAAC,EAAE,KAAK,YAChD,IAAI,CAAC,EAAE,GAAG,SAAU,MAAM;QACxB,OAAO;YACL,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ;QACtC;IACF,EAAE;IAIN,kCAAkC;IAClC,IAAK,IAAI,IAAI,GAAG,IAAI,mCAAa,MAAM,EAAE,IACvC,OAAO,EAAE,CAAC,kCAAY,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,kCAAY,CAAC,EAAE;IAGjE,6DAA6D;IAC7D,qBAAqB;IACrB,IAAI,CAAC,KAAK,GAAG,SAAU,CAAC;QACtB,4BAAM,iBAAiB;QACvB,IAAI,QAAQ;YACV,SAAS;YACT,OAAO,MAAM;QACf;IACF;IAEA,OAAO,IAAI;AACb;AAEA,OAAO,cAAc,CAAC,+BAAS,SAAS,EAAE,yBAAyB;IACjE,qDAAqD;IACrD,mDAAmD;IACnD,qBAAqB;IACrB,YAAY;IACZ,KAAK;QACH,OAAO,IAAI,CAAC,cAAc,CAAC,aAAa;IAC1C;AACF;AAEA,qCAAqC;AACrC,+BAAS,SAAS,GAAG;AAErB,8CAA8C;AAC9C,iEAAiE;AACjE,6EAA6E;AAC7E,gCAAgC;AAChC,SAAS,+BAAS,CAAC,EAAE,KAAK;IACxB,mBAAmB;IACnB,IAAI,MAAM,MAAM,KAAK,GAAG,OAAO;IAE/B,IAAI;IACJ,IAAI,MAAM,UAAU,EAAE,MAAM,MAAM,MAAM,CAAC,KAAK;SAAQ,IAAI,CAAC,KAAK,KAAK,MAAM,MAAM,EAAE;QACjF,iCAAiC;QACjC,IAAI,MAAM,OAAO,EAAE,MAAM,MAAM,MAAM,CAAC,IAAI,CAAC;aAAS,IAAI,MAAM,MAAM,CAAC,MAAM,KAAK,GAAG,MAAM,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI;aAAM,MAAM,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,MAAM;QAC3J,MAAM,MAAM,CAAC,KAAK;IACpB,OACE,oBAAoB;IACpB,MAAM,sCAAgB,GAAG,MAAM,MAAM,EAAE,MAAM,OAAO;IAGtD,OAAO;AACT;AAEA,sEAAsE;AACtE,6EAA6E;AAC7E,gCAAgC;AAChC,SAAS,sCAAgB,CAAC,EAAE,IAAI,EAAE,UAAU;IAC1C,IAAI;IACJ,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;QAC7B,4CAA4C;QAC5C,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;QAC9B,KAAK,IAAI,CAAC,IAAI,GAAG,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IACxC,OAAO,IAAI,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EACpC,iCAAiC;IACjC,MAAM,KAAK,KAAK;SAEhB,oCAAoC;IACpC,MAAM,aAAa,2CAAqB,GAAG,QAAQ,qCAAe,GAAG;IAEvE,OAAO;AACT;AAEA,yEAAyE;AACzE,UAAU;AACV,6EAA6E;AAC7E,gCAAgC;AAChC,SAAS,2CAAqB,CAAC,EAAE,IAAI;IACnC,IAAI,IAAI,KAAK,IAAI;IACjB,IAAI,IAAI;IACR,IAAI,MAAM,EAAE,IAAI;IAChB,KAAK,IAAI,MAAM;IACf,MAAO,IAAI,EAAE,IAAI,CAAE;QACjB,IAAI,MAAM,EAAE,IAAI;QAChB,IAAI,KAAK,IAAI,IAAI,MAAM,GAAG,IAAI,MAAM,GAAG;QACvC,IAAI,OAAO,IAAI,MAAM,EAAE,OAAO;aAAS,OAAO,IAAI,KAAK,CAAC,GAAG;QAC3D,KAAK;QACL,IAAI,MAAM,GAAG;YACX,IAAI,OAAO,IAAI,MAAM,EAAE;gBACrB,EAAE;gBACF,IAAI,EAAE,IAAI,EAAE,KAAK,IAAI,GAAG,EAAE,IAAI;qBAAM,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG;YAC9D,OAAO;gBACL,KAAK,IAAI,GAAG;gBACZ,EAAE,IAAI,GAAG,IAAI,KAAK,CAAC;YACrB;YACA;QACF;QACA,EAAE;IACJ;IACA,KAAK,MAAM,IAAI;IACf,OAAO;AACT;AAEA,4EAA4E;AAC5E,6EAA6E;AAC7E,gCAAgC;AAChC,SAAS,qCAAe,CAAC,EAAE,IAAI;IAC7B,IAAI,MAAM,iCAAO,WAAW,CAAC;IAC7B,IAAI,IAAI,KAAK,IAAI;IACjB,IAAI,IAAI;IACR,EAAE,IAAI,CAAC,IAAI,CAAC;IACZ,KAAK,EAAE,IAAI,CAAC,MAAM;IAClB,MAAO,IAAI,EAAE,IAAI,CAAE;QACjB,IAAI,MAAM,EAAE,IAAI;QAChB,IAAI,KAAK,IAAI,IAAI,MAAM,GAAG,IAAI,MAAM,GAAG;QACvC,IAAI,IAAI,CAAC,KAAK,IAAI,MAAM,GAAG,GAAG,GAAG;QACjC,KAAK;QACL,IAAI,MAAM,GAAG;YACX,IAAI,OAAO,IAAI,MAAM,EAAE;gBACrB,EAAE;gBACF,IAAI,EAAE,IAAI,EAAE,KAAK,IAAI,GAAG,EAAE,IAAI;qBAAM,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG;YAC9D,OAAO;gBACL,KAAK,IAAI,GAAG;gBACZ,EAAE,IAAI,GAAG,IAAI,KAAK,CAAC;YACrB;YACA;QACF;QACA,EAAE;IACJ;IACA,KAAK,MAAM,IAAI;IACf,OAAO;AACT;AAEA,SAAS,kCAAY,MAAM;IACzB,IAAI,QAAQ,OAAO,cAAc;IAEjC,gEAAgE;IAChE,qCAAqC;IACrC,IAAI,MAAM,MAAM,GAAG,GAAG,MAAM,IAAI,MAAM;IAEtC,IAAI,CAAC,MAAM,UAAU,EAAE;QACrB,MAAM,KAAK,GAAG;QACd,gBAAa,qCAAe,OAAO;IACrC;AACF;AAEA,SAAS,oCAAc,KAAK,EAAE,MAAM;IAClC,6CAA6C;IAC7C,IAAI,CAAC,MAAM,UAAU,IAAI,MAAM,MAAM,KAAK,GAAG;QAC3C,MAAM,UAAU,GAAG;QACnB,OAAO,QAAQ,GAAG;QAClB,OAAO,IAAI,CAAC;IACd;AACF;AAEA,SAAS,8BAAQ,EAAE,EAAE,CAAC;IACpB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,IAAK;QACzC,IAAI,EAAE,CAAC,EAAE,KAAK,GAAG,OAAO;IAC1B;IACA,OAAO;AACT;;;;AC1/BA;AAME,iBAAiB;IAAE,UAAU;AAAS;AAKxC,SAAS,+BAAS,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;IACpC,IAAI,OAAO,OAAO,YAChB,MAAM,IAAI,UAAU;IAEtB,IAAI,MAAM,UAAU,MAAM;IAC1B,IAAI,MAAM;IACV,OAAQ;QACR,KAAK;QACL,KAAK;YACH,OAAO,QAAQ,QAAQ,CAAC;QAC1B,KAAK;YACH,OAAO,QAAQ,QAAQ,CAAC,SAAS;gBAC/B,GAAG,IAAI,CAAC,MAAM;YAChB;QACF,KAAK;YACH,OAAO,QAAQ,QAAQ,CAAC,SAAS;gBAC/B,GAAG,IAAI,CAAC,MAAM,MAAM;YACtB;QACF,KAAK;YACH,OAAO,QAAQ,QAAQ,CAAC,SAAS;gBAC/B,GAAG,IAAI,CAAC,MAAM,MAAM,MAAM;YAC5B;QACF;YACE,OAAO,IAAI,MAAM,MAAM;YACvB,IAAI;YACJ,MAAO,IAAI,KAAK,MAAM,CACpB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,EAAE;YAE1B,OAAO,QAAQ,QAAQ,CAAC,SAAS;gBAC/B,GAAG,KAAK,CAAC,MAAM;YACjB;IACF;AACF;;;;;AC3CA,IAAI,iCAAW,CAAC,EAAE,QAAQ;AAE1B,iBAAiB,MAAM,OAAO,IAAI,SAAU,GAAG;IAC7C,OAAO,+BAAS,IAAI,CAAC,QAAQ;AAC/B;;;;;;ACJA,iBAAiB;;;;;ACAjB,yCAAyC;AAEzC,IAAI,+BAAS,cAAO,MAAM;AAE1B,oDAAoD;AACpD,SAAS,gCAAW,GAAG,EAAE,GAAG;IAC1B,IAAK,IAAI,OAAO,IACd,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI;AAEvB;AACA,IAAI,6BAAO,IAAI,IAAI,6BAAO,KAAK,IAAI,6BAAO,WAAW,IAAI,6BAAO,eAAe,EAC7E,iBAAiB;KACZ;IACL,yCAAyC;IACzC,gCAAU,eAAQ;IAClB,eAAQ,MAAM,GAAG;AACnB;AAEA,SAAS,iCAAY,GAAG,EAAE,gBAAgB,EAAE,MAAM;IAChD,OAAO,6BAAO,KAAK,kBAAkB;AACvC;AAEA,kCAAkC;AAClC,gCAAU,8BAAQ;AAElB,iCAAW,IAAI,GAAG,SAAU,GAAG,EAAE,gBAAgB,EAAE,MAAM;IACvD,IAAI,OAAO,QAAQ,UACjB,MAAM,IAAI,UAAU;IAEtB,OAAO,6BAAO,KAAK,kBAAkB;AACvC;AAEA,iCAAW,KAAK,GAAG,SAAU,IAAI,EAAE,IAAI,EAAE,QAAQ;IAC/C,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU;IAEtB,IAAI,MAAM,6BAAO;IACjB,IAAI,SAAS;QACX,IAAI,OAAO,aAAa,UACtB,IAAI,IAAI,CAAC,MAAM;aAEf,IAAI,IAAI,CAAC;WAGX,IAAI,IAAI,CAAC;IAEX,OAAO;AACT;AAEA,iCAAW,WAAW,GAAG,SAAU,IAAI;IACrC,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU;IAEtB,OAAO,6BAAO;AAChB;AAEA,iCAAW,eAAe,GAAG,SAAU,IAAI;IACzC,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU;IAEtB,OAAO,cAAO,UAAU,CAAC;AAC3B;;;;;;;;;;;;;;;;;;;;;AC7DA,sDAAsD;AACtD,EAAE;AACF,0EAA0E;AAC1E,gEAAgE;AAChE,sEAAsE;AACtE,sEAAsE;AACtE,4EAA4E;AAC5E,qEAAqE;AACrE,wBAAwB;AACxB,EAAE;AACF,0EAA0E;AAC1E,yDAAyD;AACzD,EAAE;AACF,0EAA0E;AAC1E,6DAA6D;AAC7D,4EAA4E;AAC5E,2EAA2E;AAC3E,wEAAwE;AACxE,4EAA4E;AAC5E,yCAAyC;AAEzC,2EAA2E;AAC3E,wEAAwE;AAQxE,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAUA,IAAA;AAEA,IAAA;AA9EA,SAAS,8BAAQ,GAAG;IAClB,IAAI,MAAM,OAAO,EACf,OAAO,MAAM,OAAO,CAAC;IAEvB,OAAO,qCAAe,SAAS;AACjC;AACA,4CAAkB;AAElB,SAAS,gCAAU,GAAG;IACpB,OAAO,OAAO,QAAQ;AACxB;AACA,4CAAoB;AAEpB,SAAS,6BAAO,GAAG;IACjB,OAAO,QAAQ;AACjB;AACA,4CAAiB;AAEjB,SAAS,wCAAkB,GAAG;IAC5B,OAAO,OAAO;AAChB;AACA,4CAA4B;AAE5B,SAAS,+BAAS,GAAG;IACnB,OAAO,OAAO,QAAQ;AACxB;AACA,4CAAmB;AAEnB,SAAS,+BAAS,GAAG;IACnB,OAAO,OAAO,QAAQ;AACxB;AACA,4CAAmB;AAEnB,SAAS,+BAAS,GAAG;IACnB,OAAO,OAAO,QAAQ;AACxB;AACA,4CAAmB;AAEnB,SAAS,kCAAY,GAAG;IACtB,OAAO,QAAQ,KAAK;AACtB;AACA,2CAAsB;AAEtB,SAAS,+BAAS,EAAE;IAClB,OAAO,qCAAe,QAAQ;AAChC;AACA,2CAAmB;AAEnB,SAAS,+BAAS,GAAG;IACnB,OAAO,OAAO,QAAQ,YAAY,QAAQ;AAC5C;AACA,4CAAmB;AAEnB,SAAS,6BAAO,CAAC;IACf,OAAO,qCAAe,OAAO;AAC/B;AACA,4CAAiB;AAEjB,SAAS,8BAAQ,CAAC;IAChB,OAAQ,qCAAe,OAAO,oBAAoB,aAAa;AACjE;AACA,4CAAkB;AAElB,SAAS,iCAAW,GAAG;IACrB,OAAO,OAAO,QAAQ;AACxB;AACA,4CAAqB;AAErB,SAAS,kCAAY,GAAG;IACtB,OAAO,QAAQ,QACR,OAAO,QAAQ,aACf,OAAO,QAAQ,YACf,OAAO,QAAQ,YACf,OAAO,QAAQ,YAAa,aAAa;IACzC,OAAO,QAAQ;AACxB;AACA,4CAAsB;;AAEtB,4CAAmB,cAAyB,QAAQ;AAEpD,SAAS,qCAAe,CAAC;IACvB,OAAO,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC;AACxC;;;;;AC1GA;;;;;ACAA;AAEA,SAAS,sCAAgB,QAAQ,EAAE,WAAW;IAAI,IAAI,CAAE,CAAA,oBAAoB,WAAU,GAAM,MAAM,IAAI,UAAU;AAAwC;;;uCAEpJ;;;AAGJ,SAAS,iCAAW,GAAG,EAAE,MAAM,EAAE,MAAM;IACrC,IAAI,IAAI,CAAC,QAAQ;AACnB;AAEA,iBAAiB;IACf,SAAS;QACP,sCAAgB,IAAI,EAAE;QAEtB,IAAI,CAAC,IAAI,GAAG;QACZ,IAAI,CAAC,IAAI,GAAG;QACZ,IAAI,CAAC,MAAM,GAAG;IAChB;IAEA,WAAW,SAAS,CAAC,IAAI,GAAG,SAAS,KAAK,CAAC;QACzC,IAAI,QAAQ;YAAE,MAAM;YAAG,MAAM;QAAK;QAClC,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG;aAAW,IAAI,CAAC,IAAI,GAAG;QAC7D,IAAI,CAAC,IAAI,GAAG;QACZ,EAAE,IAAI,CAAC,MAAM;IACf;IAEA,WAAW,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,CAAC;QAC/C,IAAI,QAAQ;YAAE,MAAM;YAAG,MAAM,IAAI,CAAC,IAAI;QAAC;QACvC,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG;QACnC,IAAI,CAAC,IAAI,GAAG;QACZ,EAAE,IAAI,CAAC,MAAM;IACf;IAEA,WAAW,SAAS,CAAC,KAAK,GAAG,SAAS;QACpC,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG;QACvB,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI;QACxB,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG;aAAU,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI;QACnF,EAAE,IAAI,CAAC,MAAM;QACb,OAAO;IACT;IAEA,WAAW,SAAS,CAAC,KAAK,GAAG,SAAS;QACpC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG;QACxB,IAAI,CAAC,MAAM,GAAG;IAChB;IAEA,WAAW,SAAS,CAAC,IAAI,GAAG,SAAS,KAAK,CAAC;QACzC,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG,OAAO;QAC9B,IAAI,IAAI,IAAI,CAAC,IAAI;QACjB,IAAI,MAAM,KAAK,EAAE,IAAI;QACrB,MAAO,IAAI,EAAE,IAAI,CACf,OAAO,IAAI,EAAE,IAAI;QAClB,OAAO;IACV;IAEA,WAAW,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,CAAC;QAC7C,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG,OAAO,iCAAO,KAAK,CAAC;QAC3C,IAAI,MAAM,iCAAO,WAAW,CAAC,MAAM;QACnC,IAAI,IAAI,IAAI,CAAC,IAAI;QACjB,IAAI,IAAI;QACR,MAAO,EAAG;YACR,iCAAW,EAAE,IAAI,EAAE,KAAK;YACxB,KAAK,EAAE,IAAI,CAAC,MAAM;YAClB,IAAI,EAAE,IAAI;QACZ;QACA,OAAO;IACT;IAEA,OAAO;AACT;AAEA,IAAI,UAAQ,OAAK,OAAO,IAAI,OAAK,OAAO,CAAC,MAAM,EAC7C,eAAe,SAAS,CAAC,OAAK,OAAO,CAAC,MAAM,CAAC,GAAG;IAC9C,IAAI,MAAM,OAAK,OAAO,CAAC;QAAE,QAAQ,IAAI,CAAC,MAAM;IAAC;IAC7C,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,GAAG,MAAM;AACvC;;;;;AC5EF;;;AAKA,gBAAgB,GAEhB,6DAA6D;AAC7D,SAAS,8BAAQ,GAAG,EAAE,EAAE;IACtB,IAAI,QAAQ,IAAI;IAEhB,IAAI,oBAAoB,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS;IAC5E,IAAI,oBAAoB,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS;IAE5E,IAAI,qBAAqB,mBAAmB;QAC1C,IAAI,IACF,GAAG;aACE,IAAI,KAAK;YACd,IAAI,CAAC,IAAI,CAAC,cAAc,EACtB,gBAAa,mCAAa,IAAI,EAAE;iBAC3B,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,YAAY,EAAE;gBAC5C,IAAI,CAAC,cAAc,CAAC,YAAY,GAAG;gBACnC,gBAAa,mCAAa,IAAI,EAAE;YAClC;QACF;QAEA,OAAO,IAAI;IACb;IAEA,kEAAkE;IAClE,2EAA2E;IAE3E,IAAI,IAAI,CAAC,cAAc,EACrB,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG;IAGlC,yEAAyE;IACzE,IAAI,IAAI,CAAC,cAAc,EACrB,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG;IAGlC,IAAI,CAAC,QAAQ,CAAC,OAAO,MAAM,SAAU,GAAG;QACtC,IAAI,CAAC,MAAM,KAAK;YACd,IAAI,CAAC,MAAM,cAAc,EACvB,gBAAa,mCAAa,OAAO;iBAC5B,IAAI,CAAC,MAAM,cAAc,CAAC,YAAY,EAAE;gBAC7C,MAAM,cAAc,CAAC,YAAY,GAAG;gBACpC,gBAAa,mCAAa,OAAO;YACnC;QACF,OAAO,IAAI,IACT,GAAG;IAEP;IAEA,OAAO,IAAI;AACb;AAEA,SAAS;IACP,IAAI,IAAI,CAAC,cAAc,EAAE;QACvB,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG;QAChC,IAAI,CAAC,cAAc,CAAC,OAAO,GAAG;QAC9B,IAAI,CAAC,cAAc,CAAC,KAAK,GAAG;QAC5B,IAAI,CAAC,cAAc,CAAC,UAAU,GAAG;IACnC;IAEA,IAAI,IAAI,CAAC,cAAc,EAAE;QACvB,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG;QAChC,IAAI,CAAC,cAAc,CAAC,KAAK,GAAG;QAC5B,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG;QAC7B,IAAI,CAAC,cAAc,CAAC,WAAW,GAAG;QAClC,IAAI,CAAC,cAAc,CAAC,WAAW,GAAG;QAClC,IAAI,CAAC,cAAc,CAAC,QAAQ,GAAG;QAC/B,IAAI,CAAC,cAAc,CAAC,YAAY,GAAG;IACrC;AACF;AAEA,SAAS,kCAAY,IAAI,EAAE,GAAG;IAC5B,KAAK,IAAI,CAAC,SAAS;AACrB;AAEA,iBAAiB;IACf,SAAS;IACT,WAAW;AACb;;;;;ACnFA,sDAAsD;AACtD,EAAE;AACF,0EAA0E;AAC1E,gEAAgE;AAChE,sEAAsE;AACtE,sEAAsE;AACtE,4EAA4E;AAC5E,qEAAqE;AACrE,wBAAwB;AACxB,EAAE;AACF,0EAA0E;AAC1E,yDAAyD;AACzD,EAAE;AACF,0EAA0E;AAC1E,6DAA6D;AAC7D,4EAA4E;AAC5E,2EAA2E;AAC3E,wEAAwE;AACxE,4EAA4E;AAC5E,yCAAyC;AAEzC,uEAAuE;AACvE,oEAAoE;AACpE,mEAAmE;AACnE,YAAY;AAEZ;;;AAKA,gBAAgB,GAEhB,eAAe,GACf,IAAI,mCAAa,OAAO,IAAI,IAAI,SAAU,GAAG;IAC3C,IAAI,OAAO,EAAE;IACb,IAAK,IAAI,OAAO,IACd,KAAK,IAAI,CAAC;IACX,OAAO;AACV;AACA,gBAAgB,GAEhB,iBAAiB;;AAEjB,eAAe,GACf,IAAI,6BAAO,OAAO,MAAM,CAAC;;AACzB,2BAAK,QAAQ,GAAG;;;;;AAMhB,2BAAK,QAAQ,CAAC,8BAAQ;AAGpB,0DAA0D;AAC1D,IAAI,6BAAO,iCAAW;AACtB,IAAK,IAAI,0BAAI,GAAG,0BAAI,2BAAK,MAAM,EAAE,0BAAK;IACpC,IAAI,+BAAS,0BAAI,CAAC,wBAAE;IACpB,IAAI,CAAC,6BAAO,SAAS,CAAC,6BAAO,EAAE,6BAAO,SAAS,CAAC,6BAAO,GAAG,gBAAkB,CAAC,6BAAO;AACtF;AAGF,SAAS,6BAAO,OAAO;IACrB,IAAI,CAAE,CAAA,IAAI,YAAY,4BAAK,GAAI,OAAO,IAAI,6BAAO;IAEjD,OAAS,IAAI,CAAC,IAAI,EAAE;IACpB,YAAc,IAAI,EAAE;IAEpB,IAAI,WAAW,QAAQ,QAAQ,KAAK,OAAO,IAAI,CAAC,QAAQ,GAAG;IAE3D,IAAI,WAAW,QAAQ,QAAQ,KAAK,OAAO,IAAI,CAAC,QAAQ,GAAG;IAE3D,IAAI,CAAC,aAAa,GAAG;IACrB,IAAI,WAAW,QAAQ,aAAa,KAAK,OAAO,IAAI,CAAC,aAAa,GAAG;IAErE,IAAI,CAAC,IAAI,CAAC,OAAO;AACnB;AAEA,OAAO,cAAc,CAAC,6BAAO,SAAS,EAAE,yBAAyB;IAC/D,qDAAqD;IACrD,mDAAmD;IACnD,qBAAqB;IACrB,YAAY;IACZ,KAAK;QACH,OAAO,IAAI,CAAC,cAAc,CAAC,aAAa;IAC1C;AACF;AAEA,4BAA4B;AAC5B,SAAS;IACP,8DAA8D;IAC9D,iBAAiB;IACjB,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE;IAErD,+BAA+B;IAC/B,gDAAgD;IAChD,gBAAa,+BAAS,IAAI;AAC5B;AAEA,SAAS,8BAAQ,IAAI;IACnB,KAAK,GAAG;AACV;AAEA,OAAO,cAAc,CAAC,6BAAO,SAAS,EAAE,aAAa;IACnD,KAAK;QACH,IAAI,IAAI,CAAC,cAAc,KAAK,aAAa,IAAI,CAAC,cAAc,KAAK,WAC/D,OAAO;QAET,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS;IACvE;IACA,KAAK,SAAU,KAAK;QAClB,oCAAoC;QACpC,+BAA+B;QAC/B,IAAI,IAAI,CAAC,cAAc,KAAK,aAAa,IAAI,CAAC,cAAc,KAAK,WAC/D;QAGF,iDAAiD;QACjD,qBAAqB;QACrB,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG;QAChC,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG;IAClC;AACF;AAEA,6BAAO,SAAS,CAAC,QAAQ,GAAG,SAAU,GAAG,EAAE,EAAE;IAC3C,IAAI,CAAC,IAAI,CAAC;IACV,IAAI,CAAC,GAAG;IAER,gBAAa,IAAI;AACnB;;;;AClIA,sDAAsD;AACtD,EAAE;AACF,0EAA0E;AAC1E,gEAAgE;AAChE,sEAAsE;AACtE,sEAAsE;AACtE,4EAA4E;AAC5E,qEAAqE;AACrE,wBAAwB;AACxB,EAAE;AACF,0EAA0E;AAC1E,yDAAyD;AACzD,EAAE;AACF,0EAA0E;AAC1E,6DAA6D;AAC7D,4EAA4E;AAC5E,2EAA2E;AAC3E,wEAAwE;AACxE,4EAA4E;AAC5E,yCAAyC;AAEzC,uCAAuC;AACvC,wEAAwE;AACxE,0CAA0C;AAE1C;;;AAKA,gBAAgB,GAEhB,iBAAiB;AAEjB,iBAAiB,GACjB,SAAS,+BAAS,KAAK,EAAE,QAAQ,EAAE,EAAE;IACnC,IAAI,CAAC,KAAK,GAAG;IACb,IAAI,CAAC,QAAQ,GAAG;IAChB,IAAI,CAAC,QAAQ,GAAG;IAChB,IAAI,CAAC,IAAI,GAAG;AACd;AAEA,uCAAuC;AACvC,gDAAgD;AAChD,SAAS,oCAAc,KAAK;IAC1B,IAAI,QAAQ,IAAI;IAEhB,IAAI,CAAC,IAAI,GAAG;IACZ,IAAI,CAAC,KAAK,GAAG;IACb,IAAI,CAAC,MAAM,GAAG;QACZ,qCAAe,OAAO;IACxB;AACF;AACA,kBAAkB,GAElB,eAAe,GACf,IAAI,mCAAa,CAAC,QAAQ,OAAO,IAAI;IAAC;IAAS;CAAQ,CAAC,OAAO,CAAC,QAAQ,OAAO,CAAC,KAAK,CAAC,GAAG,MAAM,KAAK,eAAe;AACnH,gBAAgB,GAEhB,eAAe,GACf,IAAI;AACJ,gBAAgB,GAEhB,+BAAS,aAAa,GAAG;;AAEzB,eAAe,GACf,IAAI,6BAAO,OAAO,MAAM,CAAC;;AACzB,2BAAK,QAAQ,GAAG;;AAChB,gBAAgB,GAEhB,eAAe,GACf,IAAI,qCAAe;IACjB,WAAW;AACb;;;;;uCASI;AACJ,IAAI,sCAAgB,AAAC,CAAA,OAAO,mBAAW,cAAc,iBAAS,OAAO,WAAW,cAAc,SAAS,OAAO,SAAS,cAAc,OAAO,CAAC,CAAA,EAAG,UAAU,IAAI,YAAa;AAC3K,SAAS,0CAAoB,KAAK;IAChC,OAAO,iCAAO,IAAI,CAAC;AACrB;AACA,SAAS,oCAAc,GAAG;IACxB,OAAO,iCAAO,QAAQ,CAAC,QAAQ,eAAe;AAChD;;;AAMA,2BAAK,QAAQ,CAAC,gCAAU;AAExB,SAAS,6BAAO;;AAEhB,SAAS,oCAAc,OAAO,EAAE,MAAM;IACpC,+BAAS,gCAAU;IAEnB,UAAU,WAAW,CAAC;IAEtB,2DAA2D;IAC3D,2BAA2B;IAC3B,2DAA2D;IAC3D,uEAAuE;IACvE,2EAA2E;IAC3E,IAAI,WAAW,kBAAkB;IAEjC,4DAA4D;IAC5D,+BAA+B;IAC/B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,UAAU;IAEtC,IAAI,UAAU,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,QAAQ,kBAAkB;IAE/E,oDAAoD;IACpD,iEAAiE;IACjE,0DAA0D;IAC1D,IAAI,MAAM,QAAQ,aAAa;IAC/B,IAAI,cAAc,QAAQ,qBAAqB;IAC/C,IAAI,aAAa,IAAI,CAAC,UAAU,GAAG,KAAK;IAExC,IAAI,OAAO,QAAQ,GAAG,IAAI,CAAC,aAAa,GAAG;SAAS,IAAI,YAAa,CAAA,eAAe,gBAAgB,CAAA,GAAI,IAAI,CAAC,aAAa,GAAG;SAAiB,IAAI,CAAC,aAAa,GAAG;IAEnK,gBAAgB;IAChB,IAAI,CAAC,aAAa,GAAG,KAAK,KAAK,CAAC,IAAI,CAAC,aAAa;IAElD,4BAA4B;IAC5B,IAAI,CAAC,WAAW,GAAG;IAEnB,oBAAoB;IACpB,IAAI,CAAC,SAAS,GAAG;IACjB,gCAAgC;IAChC,IAAI,CAAC,MAAM,GAAG;IACd,2CAA2C;IAC3C,IAAI,CAAC,KAAK,GAAG;IACb,2BAA2B;IAC3B,IAAI,CAAC,QAAQ,GAAG;IAEhB,wBAAwB;IACxB,IAAI,CAAC,SAAS,GAAG;IAEjB,kEAAkE;IAClE,kEAAkE;IAClE,6BAA6B;IAC7B,IAAI,WAAW,QAAQ,aAAa,KAAK;IACzC,IAAI,CAAC,aAAa,GAAG,CAAC;IAEtB,sEAAsE;IACtE,6DAA6D;IAC7D,uDAAuD;IACvD,IAAI,CAAC,eAAe,GAAG,QAAQ,eAAe,IAAI;IAElD,2DAA2D;IAC3D,6DAA6D;IAC7D,kBAAkB;IAClB,IAAI,CAAC,MAAM,GAAG;IAEd,qDAAqD;IACrD,IAAI,CAAC,OAAO,GAAG;IAEf,6DAA6D;IAC7D,IAAI,CAAC,MAAM,GAAG;IAEd,qEAAqE;IACrE,iEAAiE;IACjE,oEAAoE;IACpE,0CAA0C;IAC1C,IAAI,CAAC,IAAI,GAAG;IAEZ,sEAAsE;IACtE,oEAAoE;IACpE,6CAA6C;IAC7C,IAAI,CAAC,gBAAgB,GAAG;IAExB,iDAAiD;IACjD,IAAI,CAAC,OAAO,GAAG,SAAU,EAAE;QACzB,8BAAQ,QAAQ;IAClB;IAEA,kEAAkE;IAClE,IAAI,CAAC,OAAO,GAAG;IAEf,0DAA0D;IAC1D,IAAI,CAAC,QAAQ,GAAG;IAEhB,IAAI,CAAC,eAAe,GAAG;IACvB,IAAI,CAAC,mBAAmB,GAAG;IAE3B,kDAAkD;IAClD,gDAAgD;IAChD,IAAI,CAAC,SAAS,GAAG;IAEjB,mEAAmE;IACnE,qDAAqD;IACrD,IAAI,CAAC,WAAW,GAAG;IAEnB,uEAAuE;IACvE,IAAI,CAAC,YAAY,GAAG;IAEpB,0BAA0B;IAC1B,IAAI,CAAC,oBAAoB,GAAG;IAE5B,oDAAoD;IACpD,6DAA6D;IAC7D,IAAI,CAAC,kBAAkB,GAAG,IAAI,oCAAc,IAAI;AAClD;AAEA,oCAAc,SAAS,CAAC,SAAS,GAAG,SAAS;IAC3C,IAAI,UAAU,IAAI,CAAC,eAAe;IAClC,IAAI,MAAM,EAAE;IACZ,MAAO,QAAS;QACd,IAAI,IAAI,CAAC;QACT,UAAU,QAAQ,IAAI;IACxB;IACA,OAAO;AACT;AAEC,CAAA;IACC,IAAI;QACF,OAAO,cAAc,CAAC,oCAAc,SAAS,EAAE,UAAU;YACvD,KAAK,mCAAa,SAAS,CAAC;gBAC1B,OAAO,IAAI,CAAC,SAAS;YACvB,GAAG,8EAAmF;QACxF;IACF,EAAE,OAAO,GAAG,CAAC;AACf,CAAA;AAEA,qEAAqE;AACrE,iDAAiD;AACjD,IAAI;AACJ,IAAI,OAAO,WAAW,cAAc,OAAO,WAAW,IAAI,OAAO,SAAS,SAAS,CAAC,OAAO,WAAW,CAAC,KAAK,YAAY;IACtH,wCAAkB,SAAS,SAAS,CAAC,OAAO,WAAW,CAAC;IACxD,OAAO,cAAc,CAAC,gCAAU,OAAO,WAAW,EAAE;QAClD,OAAO,SAAU,MAAM;YACrB,IAAI,sCAAgB,IAAI,CAAC,IAAI,EAAE,SAAS,OAAO;YAC/C,IAAI,IAAI,KAAK,gCAAU,OAAO;YAE9B,OAAO,UAAU,OAAO,cAAc,YAAY;QACpD;IACF;AACF,OACE,wCAAkB,SAAU,MAAM;IAChC,OAAO,kBAAkB,IAAI;AAC/B;;AAGF,SAAS,+BAAS,OAAO;IACvB,+BAAS,gCAAU;IAEnB,6CAA6C;IAC7C,kEAAkE;IAClE,mEAAmE;IAEnE,8EAA8E;IAC9E,2EAA2E;IAC3E,0DAA0D;IAC1D,IAAI,CAAC,sCAAgB,IAAI,CAAC,gCAAU,IAAI,KAAK,CAAE,CAAA,IAAI,YAAY,4BAAK,GAClE,OAAO,IAAI,+BAAS;IAGtB,IAAI,CAAC,cAAc,GAAG,IAAI,oCAAc,SAAS,IAAI;IAErD,UAAU;IACV,IAAI,CAAC,QAAQ,GAAG;IAEhB,IAAI,SAAS;QACX,IAAI,OAAO,QAAQ,KAAK,KAAK,YAAY,IAAI,CAAC,MAAM,GAAG,QAAQ,KAAK;QAEpE,IAAI,OAAO,QAAQ,MAAM,KAAK,YAAY,IAAI,CAAC,OAAO,GAAG,QAAQ,MAAM;QAEvE,IAAI,OAAO,QAAQ,OAAO,KAAK,YAAY,IAAI,CAAC,QAAQ,GAAG,QAAQ,OAAO;QAE1E,IAAI,OAAO,QAAQ,KAAK,KAAK,YAAY,IAAI,CAAC,MAAM,GAAG,QAAQ,KAAK;IACtE;IAEA,OAAO,IAAI,CAAC,IAAI;AAClB;AAEA,mEAAmE;AACnE,+BAAS,SAAS,CAAC,IAAI,GAAG;IACxB,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,MAAM;AAC/B;AAEA,SAAS,oCAAc,MAAM,EAAE,EAAE;IAC/B,IAAI,KAAK,IAAI,MAAM;IACnB,oEAAoE;IACpE,OAAO,IAAI,CAAC,SAAS;IACrB,gBAAa,IAAI;AACnB;AAEA,4EAA4E;AAC5E,4EAA4E;AAC5E,mEAAmE;AACnE,SAAS,iCAAW,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;IAC1C,IAAI,QAAQ;IACZ,IAAI,KAAK;IAET,IAAI,UAAU,MACZ,KAAK,IAAI,UAAU;SACd,IAAI,OAAO,UAAU,YAAY,UAAU,aAAa,CAAC,MAAM,UAAU,EAC9E,KAAK,IAAI,UAAU;IAErB,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS;QACrB,gBAAa,IAAI;QACjB,QAAQ;IACV;IACA,OAAO;AACT;AAEA,+BAAS,SAAS,CAAC,KAAK,GAAG,SAAU,KAAK,EAAE,QAAQ,EAAE,EAAE;IACtD,IAAI,QAAQ,IAAI,CAAC,cAAc;IAC/B,IAAI,MAAM;IACV,IAAI,QAAQ,CAAC,MAAM,UAAU,IAAI,oCAAc;IAE/C,IAAI,SAAS,CAAC,iCAAO,QAAQ,CAAC,QAC5B,QAAQ,0CAAoB;IAG9B,IAAI,OAAO,aAAa,YAAY;QAClC,KAAK;QACL,WAAW;IACb;IAEA,IAAI,OAAO,WAAW;SAAc,IAAI,CAAC,UAAU,WAAW,MAAM,eAAe;IAEnF,IAAI,OAAO,OAAO,YAAY,KAAK;IAEnC,IAAI,MAAM,KAAK,EAAE,oCAAc,IAAI,EAAE;SAAS,IAAI,SAAS,iCAAW,IAAI,EAAE,OAAO,OAAO,KAAK;QAC7F,MAAM,SAAS;QACf,MAAM,oCAAc,IAAI,EAAE,OAAO,OAAO,OAAO,UAAU;IAC3D;IAEA,OAAO;AACT;AAEA,+BAAS,SAAS,CAAC,IAAI,GAAG;IACxB,IAAI,QAAQ,IAAI,CAAC,cAAc;IAE/B,MAAM,MAAM;AACd;AAEA,+BAAS,SAAS,CAAC,MAAM,GAAG;IAC1B,IAAI,QAAQ,IAAI,CAAC,cAAc;IAE/B,IAAI,MAAM,MAAM,EAAE;QAChB,MAAM,MAAM;QAEZ,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,MAAM,IAAI,CAAC,MAAM,gBAAgB,IAAI,MAAM,eAAe,EAAE,kCAAY,IAAI,EAAE;IAC7G;AACF;AAEA,+BAAS,SAAS,CAAC,kBAAkB,GAAG,SAAS,mBAAmB,QAAQ;IAC1E,6CAA6C;IAC7C,IAAI,OAAO,aAAa,UAAU,WAAW,SAAS,WAAW;IACjE,IAAI,CAAE,CAAA;QAAC;QAAO;QAAQ;QAAS;QAAS;QAAU;QAAU;QAAQ;QAAS;QAAW;QAAY;KAAM,CAAC,OAAO,CAAC,AAAC,CAAA,WAAW,EAAC,EAAG,WAAW,MAAM,EAAC,GAAI,MAAM,IAAI,UAAU,uBAAuB;IACpM,IAAI,CAAC,cAAc,CAAC,eAAe,GAAG;IACtC,OAAO,IAAI;AACb;AAEA,SAAS,kCAAY,KAAK,EAAE,KAAK,EAAE,QAAQ;IACzC,IAAI,CAAC,MAAM,UAAU,IAAI,MAAM,aAAa,KAAK,SAAS,OAAO,UAAU,UACzE,QAAQ,iCAAO,IAAI,CAAC,OAAO;IAE7B,OAAO;AACT;AAEA,OAAO,cAAc,CAAC,+BAAS,SAAS,EAAE,yBAAyB;IACjE,qDAAqD;IACrD,mDAAmD;IACnD,qBAAqB;IACrB,YAAY;IACZ,KAAK;QACH,OAAO,IAAI,CAAC,cAAc,CAAC,aAAa;IAC1C;AACF;AAEA,yDAAyD;AACzD,2DAA2D;AAC3D,oEAAoE;AACpE,SAAS,oCAAc,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE;IAC9D,IAAI,CAAC,OAAO;QACV,IAAI,WAAW,kCAAY,OAAO,OAAO;QACzC,IAAI,UAAU,UAAU;YACtB,QAAQ;YACR,WAAW;YACX,QAAQ;QACV;IACF;IACA,IAAI,MAAM,MAAM,UAAU,GAAG,IAAI,MAAM,MAAM;IAE7C,MAAM,MAAM,IAAI;IAEhB,IAAI,MAAM,MAAM,MAAM,GAAG,MAAM,aAAa;IAC5C,qEAAqE;IACrE,IAAI,CAAC,KAAK,MAAM,SAAS,GAAG;IAE5B,IAAI,MAAM,OAAO,IAAI,MAAM,MAAM,EAAE;QACjC,IAAI,OAAO,MAAM,mBAAmB;QACpC,MAAM,mBAAmB,GAAG;YAC1B,OAAO;YACP,UAAU;YACV,OAAO;YACP,UAAU;YACV,MAAM;QACR;QACA,IAAI,MACF,KAAK,IAAI,GAAG,MAAM,mBAAmB;aAErC,MAAM,eAAe,GAAG,MAAM,mBAAmB;QAEnD,MAAM,oBAAoB,IAAI;IAChC,OACE,8BAAQ,QAAQ,OAAO,OAAO,KAAK,OAAO,UAAU;IAGtD,OAAO;AACT;AAEA,SAAS,8BAAQ,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE;IAC9D,MAAM,QAAQ,GAAG;IACjB,MAAM,OAAO,GAAG;IAChB,MAAM,OAAO,GAAG;IAChB,MAAM,IAAI,GAAG;IACb,IAAI,QAAQ,OAAO,OAAO,CAAC,OAAO,MAAM,OAAO;SAAO,OAAO,MAAM,CAAC,OAAO,UAAU,MAAM,OAAO;IAClG,MAAM,IAAI,GAAG;AACf;AAEA,SAAS,mCAAa,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE;IAC/C,EAAE,MAAM,SAAS;IAEjB,IAAI,MAAM;QACR,0DAA0D;QAC1D,yCAAyC;QACzC,gBAAa,IAAI;QACjB,kDAAkD;QAClD,cAAc;QACd,gBAAa,mCAAa,QAAQ;QAClC,OAAO,cAAc,CAAC,YAAY,GAAG;QACrC,OAAO,IAAI,CAAC,SAAS;IACvB,OAAO;QACL,6CAA6C;QAC7C,cAAc;QACd,GAAG;QACH,OAAO,cAAc,CAAC,YAAY,GAAG;QACrC,OAAO,IAAI,CAAC,SAAS;QACrB,wCAAwC;QACxC,sBAAsB;QACtB,kCAAY,QAAQ;IACtB;AACF;AAEA,SAAS,yCAAmB,KAAK;IAC/B,MAAM,OAAO,GAAG;IAChB,MAAM,OAAO,GAAG;IAChB,MAAM,MAAM,IAAI,MAAM,QAAQ;IAC9B,MAAM,QAAQ,GAAG;AACnB;AAEA,SAAS,8BAAQ,MAAM,EAAE,EAAE;IACzB,IAAI,QAAQ,OAAO,cAAc;IACjC,IAAI,OAAO,MAAM,IAAI;IACrB,IAAI,KAAK,MAAM,OAAO;IAEtB,yCAAmB;IAEnB,IAAI,IAAI,mCAAa,QAAQ,OAAO,MAAM,IAAI;SAAS;QACrD,8DAA8D;QAC9D,IAAI,WAAW,iCAAW;QAE1B,IAAI,CAAC,YAAY,CAAC,MAAM,MAAM,IAAI,CAAC,MAAM,gBAAgB,IAAI,MAAM,eAAe,EAChF,kCAAY,QAAQ;QAGtB,IAAI,MACF,eAAe,GACf,iCAAW,kCAAY,QAAQ,OAAO,UAAU;aAGhD,iCAAW,QAAQ,OAAO,UAAU;IAExC;AACF;AAEA,SAAS,iCAAW,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE;IAC7C,IAAI,CAAC,UAAU,mCAAa,QAAQ;IACpC,MAAM,SAAS;IACf;IACA,kCAAY,QAAQ;AACtB;AAEA,iEAAiE;AACjE,mEAAmE;AACnE,wDAAwD;AACxD,SAAS,mCAAa,MAAM,EAAE,KAAK;IACjC,IAAI,MAAM,MAAM,KAAK,KAAK,MAAM,SAAS,EAAE;QACzC,MAAM,SAAS,GAAG;QAClB,OAAO,IAAI,CAAC;IACd;AACF;AAEA,8DAA8D;AAC9D,SAAS,kCAAY,MAAM,EAAE,KAAK;IAChC,MAAM,gBAAgB,GAAG;IACzB,IAAI,QAAQ,MAAM,eAAe;IAEjC,IAAI,OAAO,OAAO,IAAI,SAAS,MAAM,IAAI,EAAE;QACzC,8CAA8C;QAC9C,IAAI,IAAI,MAAM,oBAAoB;QAClC,IAAI,SAAS,IAAI,MAAM;QACvB,IAAI,SAAS,MAAM,kBAAkB;QACrC,OAAO,KAAK,GAAG;QAEf,IAAI,QAAQ;QACZ,IAAI,aAAa;QACjB,MAAO,MAAO;YACZ,MAAM,CAAC,MAAM,GAAG;YAChB,IAAI,CAAC,MAAM,KAAK,EAAE,aAAa;YAC/B,QAAQ,MAAM,IAAI;YAClB,SAAS;QACX;QACA,OAAO,UAAU,GAAG;QAEpB,8BAAQ,QAAQ,OAAO,MAAM,MAAM,MAAM,EAAE,QAAQ,IAAI,OAAO,MAAM;QAEpE,oEAAoE;QACpE,oCAAoC;QACpC,MAAM,SAAS;QACf,MAAM,mBAAmB,GAAG;QAC5B,IAAI,OAAO,IAAI,EAAE;YACf,MAAM,kBAAkB,GAAG,OAAO,IAAI;YACtC,OAAO,IAAI,GAAG;QAChB,OACE,MAAM,kBAAkB,GAAG,IAAI,oCAAc;QAE/C,MAAM,oBAAoB,GAAG;IAC/B,OAAO;QACL,qCAAqC;QACrC,MAAO,MAAO;YACZ,IAAI,QAAQ,MAAM,KAAK;YACvB,IAAI,WAAW,MAAM,QAAQ;YAC7B,IAAI,KAAK,MAAM,QAAQ;YACvB,IAAI,MAAM,MAAM,UAAU,GAAG,IAAI,MAAM,MAAM;YAE7C,8BAAQ,QAAQ,OAAO,OAAO,KAAK,OAAO,UAAU;YACpD,QAAQ,MAAM,IAAI;YAClB,MAAM,oBAAoB;YAC1B,kDAAkD;YAClD,+CAA+C;YAC/C,uDAAuD;YACvD,yDAAyD;YACzD,IAAI,MAAM,OAAO,EACf;QAEJ;QAEA,IAAI,UAAU,MAAM,MAAM,mBAAmB,GAAG;IAClD;IAEA,MAAM,eAAe,GAAG;IACxB,MAAM,gBAAgB,GAAG;AAC3B;AAEA,+BAAS,SAAS,CAAC,MAAM,GAAG,SAAU,KAAK,EAAE,QAAQ,EAAE,EAAE;IACvD,GAAG,IAAI,MAAM;AACf;AAEA,+BAAS,SAAS,CAAC,OAAO,GAAG;AAE7B,+BAAS,SAAS,CAAC,GAAG,GAAG,SAAU,KAAK,EAAE,QAAQ,EAAE,EAAE;IACpD,IAAI,QAAQ,IAAI,CAAC,cAAc;IAE/B,IAAI,OAAO,UAAU,YAAY;QAC/B,KAAK;QACL,QAAQ;QACR,WAAW;IACb,OAAO,IAAI,OAAO,aAAa,YAAY;QACzC,KAAK;QACL,WAAW;IACb;IAEA,IAAI,UAAU,QAAQ,UAAU,WAAW,IAAI,CAAC,KAAK,CAAC,OAAO;IAE7D,uBAAuB;IACvB,IAAI,MAAM,MAAM,EAAE;QAChB,MAAM,MAAM,GAAG;QACf,IAAI,CAAC,MAAM;IACb;IAEA,kCAAkC;IAClC,IAAI,CAAC,MAAM,MAAM,EAAE,kCAAY,IAAI,EAAE,OAAO;AAC9C;AAEA,SAAS,iCAAW,KAAK;IACvB,OAAO,MAAM,MAAM,IAAI,MAAM,MAAM,KAAK,KAAK,MAAM,eAAe,KAAK,QAAQ,CAAC,MAAM,QAAQ,IAAI,CAAC,MAAM,OAAO;AAClH;AACA,SAAS,gCAAU,MAAM,EAAE,KAAK;IAC9B,OAAO,MAAM,CAAC,SAAU,GAAG;QACzB,MAAM,SAAS;QACf,IAAI,KACF,OAAO,IAAI,CAAC,SAAS;QAEvB,MAAM,WAAW,GAAG;QACpB,OAAO,IAAI,CAAC;QACZ,kCAAY,QAAQ;IACtB;AACF;AACA,SAAS,gCAAU,MAAM,EAAE,KAAK;IAC9B,IAAI,CAAC,MAAM,WAAW,IAAI,CAAC,MAAM,WAAW;QAC1C,IAAI,OAAO,OAAO,MAAM,KAAK,YAAY;YACvC,MAAM,SAAS;YACf,MAAM,WAAW,GAAG;YACpB,gBAAa,iCAAW,QAAQ;QAClC,OAAO;YACL,MAAM,WAAW,GAAG;YACpB,OAAO,IAAI,CAAC;QACd;;AAEJ;AAEA,SAAS,kCAAY,MAAM,EAAE,KAAK;IAChC,IAAI,OAAO,iCAAW;IACtB,IAAI,MAAM;QACR,gCAAU,QAAQ;QAClB,IAAI,MAAM,SAAS,KAAK,GAAG;YACzB,MAAM,QAAQ,GAAG;YACjB,OAAO,IAAI,CAAC;QACd;IACF;IACA,OAAO;AACT;AAEA,SAAS,kCAAY,MAAM,EAAE,KAAK,EAAE,EAAE;IACpC,MAAM,MAAM,GAAG;IACf,kCAAY,QAAQ;IACpB,IAAI;QACF,IAAI,MAAM,QAAQ,EAAE,gBAAa;aAAS,OAAO,IAAI,CAAC,UAAU;;IAElE,MAAM,KAAK,GAAG;IACd,OAAO,QAAQ,GAAG;AACpB;AAEA,SAAS,qCAAe,OAAO,EAAE,KAAK,EAAE,GAAG;IACzC,IAAI,QAAQ,QAAQ,KAAK;IACzB,QAAQ,KAAK,GAAG;IAChB,MAAO,MAAO;QACZ,IAAI,KAAK,MAAM,QAAQ;QACvB,MAAM,SAAS;QACf,GAAG;QACH,QAAQ,MAAM,IAAI;IACpB;IAEA,0BAA0B;IAC1B,MAAM,kBAAkB,CAAC,IAAI,GAAG;AAClC;AAEA,OAAO,cAAc,CAAC,+BAAS,SAAS,EAAE,aAAa;IACrD,KAAK;QACH,IAAI,IAAI,CAAC,cAAc,KAAK,WAC1B,OAAO;QAET,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS;IACtC;IACA,KAAK,SAAU,KAAK;QAClB,oCAAoC;QACpC,+BAA+B;QAC/B,IAAI,CAAC,IAAI,CAAC,cAAc,EACtB;QAGF,iDAAiD;QACjD,qBAAqB;QACrB,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG;IAClC;AACF;AAEA,+BAAS,SAAS,CAAC,OAAO,GAAG;AAC7B,+BAAS,SAAS,CAAC,UAAU,GAAG;AAChC,+BAAS,SAAS,CAAC,QAAQ,GAAG,SAAU,GAAG,EAAE,EAAE;IAC7C,IAAI,CAAC,GAAG;IACR,GAAG;AACL;;;;AC3qBA;;CAEC,GAED,iBAAiB;AAEjB;;;;;;;;;;;;;;;;CAgBC,GAED,SAAS,gCAAW,EAAE,EAAE,GAAG;IACzB,IAAI,6BAAO,kBACT,OAAO;IAGT,IAAI,SAAS;IACb,SAAS;QACP,IAAI,CAAC,QAAQ;YACX,IAAI,6BAAO,qBACT,MAAM,IAAI,MAAM;iBACX,IAAI,6BAAO,qBAChB,QAAQ,KAAK,CAAC;iBAEd,QAAQ,IAAI,CAAC;YAEf,SAAS;QACX;QACA,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE;IACxB;IAEA,OAAO;AACT;AAEA;;;;;;CAMC,GAED,SAAS,6BAAQ,IAAI;IACnB,gFAAgF;IAChF,IAAI;QACF,IAAI,CAAC,eAAO,YAAY,EAAE,OAAO;IACnC,EAAE,OAAO,GAAG;QACV,OAAO;IACT;IACA,IAAI,MAAM,eAAO,YAAY,CAAC,KAAK;IACnC,IAAI,QAAQ,KAAK,OAAO;IACxB,OAAO,OAAO,KAAK,WAAW,OAAO;AACvC;;;;;;;;;AClEA,sDAAsD;AACtD,EAAE;AACF,0EAA0E;AAC1E,gEAAgE;AAChE,sEAAsE;AACtE,sEAAsE;AACtE,4EAA4E;AAC5E,qEAAqE;AACrE,wBAAwB;AACxB,EAAE;AACF,0EAA0E;AAC1E,yDAAyD;AACzD,EAAE;AACF,0EAA0E;AAC1E,6DAA6D;AAC7D,4EAA4E;AAC5E,2EAA2E;AAC3E,wEAAwE;AACxE,4EAA4E;AAC5E,yCAAyC;AAuDzC,4EAA4E;AAC5E,wEAAwE;AACxE,cAAc;AACd,IAAA;AAxDA;;;uCAII;AACJ,gBAAgB,GAEhB,IAAI,mCAAa,iCAAO,UAAU,IAAI,SAAU,QAAQ;IACtD,WAAW,KAAK;IAChB,OAAQ,YAAY,SAAS,WAAW;QACtC,KAAK;QAAM,KAAK;QAAO,KAAK;QAAQ,KAAK;QAAQ,KAAK;QAAS,KAAK;QAAS,KAAK;QAAO,KAAK;QAAQ,KAAK;QAAU,KAAK;QAAW,KAAK;YACxI,OAAO;QACT;YACE,OAAO;IACX;AACF;AAEA,SAAS,yCAAmB,GAAG;IAC7B,IAAI,CAAC,KAAK,OAAO;IACjB,IAAI;IACJ,MAAO,KACL,OAAQ;QACN,KAAK;QACL,KAAK;YACH,OAAO;QACT,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;YACH,OAAO;QACT,KAAK;QACL,KAAK;YACH,OAAO;QACT,KAAK;QACL,KAAK;QACL,KAAK;YACH,OAAO;QACT;YACE,IAAI,SAAS,QAAQ,YAAY;YACjC,MAAM,AAAC,CAAA,KAAK,GAAE,EAAG,WAAW;YAC5B,UAAU;IACd;AAEJ;AAEA,wEAAwE;AACxE,0DAA0D;AAC1D,SAAS,wCAAkB,GAAG;IAC5B,IAAI,OAAO,yCAAmB;IAC9B,IAAI,OAAO,SAAS,YAAa,CAAA,iCAAO,UAAU,KAAK,oCAAc,CAAC,iCAAW,IAAG,GAAI,MAAM,IAAI,MAAM,uBAAuB;IAC/H,OAAO,QAAQ;AACjB;AAKA,4CAAwB;AACxB,SAAS,oCAAc,QAAQ;IAC7B,IAAI,CAAC,QAAQ,GAAG,wCAAkB;IAClC,IAAI;IACJ,OAAQ,IAAI,CAAC,QAAQ;QACnB,KAAK;YACH,IAAI,CAAC,IAAI,GAAG;YACZ,IAAI,CAAC,GAAG,GAAG;YACX,KAAK;YACL;QACF,KAAK;YACH,IAAI,CAAC,QAAQ,GAAG;YAChB,KAAK;YACL;QACF,KAAK;YACH,IAAI,CAAC,IAAI,GAAG;YACZ,IAAI,CAAC,GAAG,GAAG;YACX,KAAK;YACL;QACF;YACE,IAAI,CAAC,KAAK,GAAG;YACb,IAAI,CAAC,GAAG,GAAG;YACX;IACJ;IACA,IAAI,CAAC,QAAQ,GAAG;IAChB,IAAI,CAAC,SAAS,GAAG;IACjB,IAAI,CAAC,QAAQ,GAAG,iCAAO,WAAW,CAAC;AACrC;AAEA,oCAAc,SAAS,CAAC,KAAK,GAAG,SAAU,GAAG;IAC3C,IAAI,IAAI,MAAM,KAAK,GAAG,OAAO;IAC7B,IAAI;IACJ,IAAI;IACJ,IAAI,IAAI,CAAC,QAAQ,EAAE;QACjB,IAAI,IAAI,CAAC,QAAQ,CAAC;QAClB,IAAI,MAAM,WAAW,OAAO;QAC5B,IAAI,IAAI,CAAC,QAAQ;QACjB,IAAI,CAAC,QAAQ,GAAG;IAClB,OACE,IAAI;IAEN,IAAI,IAAI,IAAI,MAAM,EAAE,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK;IACtE,OAAO,KAAK;AACd;AAEA,oCAAc,SAAS,CAAC,GAAG,GAAG;AAE9B,+CAA+C;AAC/C,oCAAc,SAAS,CAAC,IAAI,GAAG;AAE/B,+EAA+E;AAC/E,oCAAc,SAAS,CAAC,QAAQ,GAAG,SAAU,GAAG;IAC9C,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,MAAM,EAAE;QAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,IAAI,CAAC,QAAQ;QACxE,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,IAAI,CAAC,SAAS;IAChE;IACA,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,IAAI,MAAM;IACrE,IAAI,CAAC,QAAQ,IAAI,IAAI,MAAM;AAC7B;AAEA,4EAA4E;AAC5E,qEAAqE;AACrE,SAAS,oCAAc,IAAI;IACzB,IAAI,QAAQ,MAAM,OAAO;SAAO,IAAI,QAAQ,MAAM,MAAM,OAAO;SAAO,IAAI,QAAQ,MAAM,MAAM,OAAO;SAAO,IAAI,QAAQ,MAAM,MAAM,OAAO;IAC3I,OAAO,QAAQ,MAAM,OAAO,KAAK;AACnC;AAEA,sEAAsE;AACtE,gFAAgF;AAChF,uEAAuE;AACvE,SAAS,0CAAoB,IAAI,EAAE,GAAG,EAAE,CAAC;IACvC,IAAI,IAAI,IAAI,MAAM,GAAG;IACrB,IAAI,IAAI,GAAG,OAAO;IAClB,IAAI,KAAK,oCAAc,GAAG,CAAC,EAAE;IAC7B,IAAI,MAAM,GAAG;QACX,IAAI,KAAK,GAAG,KAAK,QAAQ,GAAG,KAAK;QACjC,OAAO;IACT;IACA,IAAI,EAAE,IAAI,KAAK,OAAO,IAAI,OAAO;IACjC,KAAK,oCAAc,GAAG,CAAC,EAAE;IACzB,IAAI,MAAM,GAAG;QACX,IAAI,KAAK,GAAG,KAAK,QAAQ,GAAG,KAAK;QACjC,OAAO;IACT;IACA,IAAI,EAAE,IAAI,KAAK,OAAO,IAAI,OAAO;IACjC,KAAK,oCAAc,GAAG,CAAC,EAAE;IACzB,IAAI,MAAM,GAAG;QACX,IAAI,KAAK;YACP,IAAI,OAAO,GAAG,KAAK;iBAAO,KAAK,QAAQ,GAAG,KAAK;;QAEjD,OAAO;IACT;IACA,OAAO;AACT;AAEA,2EAA2E;AAC3E,6EAA6E;AAC7E,4EAA4E;AAC5E,gFAAgF;AAChF,4EAA4E;AAC5E,gFAAgF;AAChF,+EAA+E;AAC/E,QAAQ;AACR,SAAS,0CAAoB,IAAI,EAAE,GAAG,EAAE,CAAC;IACvC,IAAI,AAAC,CAAA,GAAG,CAAC,EAAE,GAAG,IAAG,MAAO,MAAM;QAC5B,KAAK,QAAQ,GAAG;QAChB,OAAO;IACT;IACA,IAAI,KAAK,QAAQ,GAAG,KAAK,IAAI,MAAM,GAAG,GAAG;QACvC,IAAI,AAAC,CAAA,GAAG,CAAC,EAAE,GAAG,IAAG,MAAO,MAAM;YAC5B,KAAK,QAAQ,GAAG;YAChB,OAAO;QACT;QACA,IAAI,KAAK,QAAQ,GAAG,KAAK,IAAI,MAAM,GAAG,GACpC;YAAA,IAAI,AAAC,CAAA,GAAG,CAAC,EAAE,GAAG,IAAG,MAAO,MAAM;gBAC5B,KAAK,QAAQ,GAAG;gBAChB,OAAO;YACT;QAAA;IAEJ;AACF;AAEA,+EAA+E;AAC/E,SAAS,mCAAa,GAAG;IACvB,IAAI,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ;IACtC,IAAI,IAAI,0CAAoB,IAAI,EAAE,KAAK;IACvC,IAAI,MAAM,WAAW,OAAO;IAC5B,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,MAAM,EAAE;QAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ;QAC3C,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,IAAI,CAAC,SAAS;IAChE;IACA,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,GAAG,IAAI,MAAM;IACxC,IAAI,CAAC,QAAQ,IAAI,IAAI,MAAM;AAC7B;AAEA,8EAA8E;AAC9E,2EAA2E;AAC3E,iCAAiC;AACjC,SAAS,+BAAS,GAAG,EAAE,CAAC;IACtB,IAAI,QAAQ,0CAAoB,IAAI,EAAE,KAAK;IAC3C,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,IAAI,QAAQ,CAAC,QAAQ;IAChD,IAAI,CAAC,SAAS,GAAG;IACjB,IAAI,MAAM,IAAI,MAAM,GAAI,CAAA,QAAQ,IAAI,CAAC,QAAQ,AAAD;IAC5C,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG;IAC3B,OAAO,IAAI,QAAQ,CAAC,QAAQ,GAAG;AACjC;AAEA,uEAAuE;AACvE,aAAa;AACb,SAAS,8BAAQ,GAAG;IAClB,IAAI,IAAI,OAAO,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO;IAC9C,IAAI,IAAI,CAAC,QAAQ,EAAE,OAAO,IAAI;IAC9B,OAAO;AACT;AAEA,gFAAgF;AAChF,0EAA0E;AAC1E,8EAA8E;AAC9E,sCAAsC;AACtC,SAAS,gCAAU,GAAG,EAAE,CAAC;IACvB,IAAI,AAAC,CAAA,IAAI,MAAM,GAAG,CAAA,IAAK,MAAM,GAAG;QAC9B,IAAI,IAAI,IAAI,QAAQ,CAAC,WAAW;QAChC,IAAI,GAAG;YACL,IAAI,IAAI,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG;YAChC,IAAI,KAAK,UAAU,KAAK,QAAQ;gBAC9B,IAAI,CAAC,QAAQ,GAAG;gBAChB,IAAI,CAAC,SAAS,GAAG;gBACjB,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,MAAM,GAAG,EAAE;gBACtC,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,MAAM,GAAG,EAAE;gBACtC,OAAO,EAAE,KAAK,CAAC,GAAG;YACpB;QACF;QACA,OAAO;IACT;IACA,IAAI,CAAC,QAAQ,GAAG;IAChB,IAAI,CAAC,SAAS,GAAG;IACjB,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,MAAM,GAAG,EAAE;IACtC,OAAO,IAAI,QAAQ,CAAC,WAAW,GAAG,IAAI,MAAM,GAAG;AACjD;AAEA,gFAAgF;AAChF,4DAA4D;AAC5D,SAAS,+BAAS,GAAG;IACnB,IAAI,IAAI,OAAO,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO;IAC9C,IAAI,IAAI,CAAC,QAAQ,EAAE;QACjB,IAAI,MAAM,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ;QACxC,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,WAAW,GAAG;IAClD;IACA,OAAO;AACT;AAEA,SAAS,iCAAW,GAAG,EAAE,CAAC;IACxB,IAAI,IAAI,AAAC,CAAA,IAAI,MAAM,GAAG,CAAA,IAAK;IAC3B,IAAI,MAAM,GAAG,OAAO,IAAI,QAAQ,CAAC,UAAU;IAC3C,IAAI,CAAC,QAAQ,GAAG,IAAI;IACpB,IAAI,CAAC,SAAS,GAAG;IACjB,IAAI,MAAM,GACR,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,MAAM,GAAG,EAAE;SACjC;QACL,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,MAAM,GAAG,EAAE;QACtC,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,MAAM,GAAG,EAAE;IACxC;IACA,OAAO,IAAI,QAAQ,CAAC,UAAU,GAAG,IAAI,MAAM,GAAG;AAChD;AAEA,SAAS,gCAAU,GAAG;IACpB,IAAI,IAAI,OAAO,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO;IAC9C,IAAI,IAAI,CAAC,QAAQ,EAAE,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,GAAG,IAAI,IAAI,CAAC,QAAQ;IACnF,OAAO;AACT;AAEA,4EAA4E;AAC5E,SAAS,kCAAY,GAAG;IACtB,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,QAAQ;AACnC;AAEA,SAAS,gCAAU,GAAG;IACpB,OAAO,OAAO,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO;AAC/C;;;;ACvSA,yCAAyC;AAEzC,IAAI,+BAAS,cAAO,MAAM;AAE1B,oDAAoD;AACpD,SAAS,gCAAW,GAAG,EAAE,GAAG;IAC1B,IAAK,IAAI,OAAO,IACd,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI;AAEvB;AACA,IAAI,6BAAO,IAAI,IAAI,6BAAO,KAAK,IAAI,6BAAO,WAAW,IAAI,6BAAO,eAAe,EAC7E,iBAAiB;KACZ;IACL,yCAAyC;IACzC,gCAAU,eAAQ;IAClB,eAAQ,MAAM,GAAG;AACnB;AAEA,SAAS,iCAAY,GAAG,EAAE,gBAAgB,EAAE,MAAM;IAChD,OAAO,6BAAO,KAAK,kBAAkB;AACvC;AAEA,kCAAkC;AAClC,gCAAU,8BAAQ;AAElB,iCAAW,IAAI,GAAG,SAAU,GAAG,EAAE,gBAAgB,EAAE,MAAM;IACvD,IAAI,OAAO,QAAQ,UACjB,MAAM,IAAI,UAAU;IAEtB,OAAO,6BAAO,KAAK,kBAAkB;AACvC;AAEA,iCAAW,KAAK,GAAG,SAAU,IAAI,EAAE,IAAI,EAAE,QAAQ;IAC/C,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU;IAEtB,IAAI,MAAM,6BAAO;IACjB,IAAI,SAAS;QACX,IAAI,OAAO,aAAa,UACtB,IAAI,IAAI,CAAC,MAAM;aAEf,IAAI,IAAI,CAAC;WAGX,IAAI,IAAI,CAAC;IAEX,OAAO;AACT;AAEA,iCAAW,WAAW,GAAG,SAAU,IAAI;IACrC,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU;IAEtB,OAAO,6BAAO;AAChB;AAEA,iCAAW,eAAe,GAAG,SAAU,IAAI;IACzC,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU;IAEtB,OAAO,cAAO,UAAU,CAAC;AAC3B;;;;;;;AC7DA,sDAAsD;AACtD,EAAE;AACF,0EAA0E;AAC1E,gEAAgE;AAChE,sEAAsE;AACtE,sEAAsE;AACtE,4EAA4E;AAC5E,qEAAqE;AACrE,wBAAwB;AACxB,EAAE;AACF,0EAA0E;AAC1E,yDAAyD;AACzD,EAAE;AACF,0EAA0E;AAC1E,6DAA6D;AAC7D,4EAA4E;AAC5E,2EAA2E;AAC3E,wEAAwE;AACxE,4EAA4E;AAC5E,yCAAyC;AAEzC,gEAAgE;AAChE,8DAA8D;AAC9D,uEAAuE;AACvE,sEAAsE;AACtE,iDAAiD;AACjD,EAAE;AACF,gEAAgE;AAChE,qEAAqE;AACrE,kEAAkE;AAClE,0DAA0D;AAC1D,EAAE;AACF,yBAAyB;AACzB,EAAE;AACF,wEAAwE;AACxE,sEAAsE;AACtE,mEAAmE;AACnE,gEAAgE;AAChE,oDAAoD;AACpD,EAAE;AACF,uEAAuE;AACvE,oEAAoE;AACpE,qEAAqE;AACrE,uEAAuE;AACvE,qEAAqE;AACrE,sEAAsE;AACtE,EAAE;AACF,sEAAsE;AACtE,0EAA0E;AAC1E,yEAAyE;AACzE,oEAAoE;AACpE,sEAAsE;AACtE,sEAAsE;AACtE,wEAAwE;AACxE,sEAAsE;AACtE,qEAAqE;AACrE,oEAAoE;AACpE,yCAAyC;AACzC,EAAE;AACF,yEAAyE;AACzE,yEAAyE;AACzE,+DAA+D;AAE/D;AAEA,iBAAiB;;;;AAIjB,eAAe,GACf,IAAI,6BAAO,OAAO,MAAM,CAAC;;AACzB,2BAAK,QAAQ,GAAG;AAChB,gBAAgB,GAEhB,2BAAK,QAAQ,CAAC,iCAAW;AAEzB,SAAS,qCAAe,EAAE,EAAE,IAAI;IAC9B,IAAI,KAAK,IAAI,CAAC,eAAe;IAC7B,GAAG,YAAY,GAAG;IAElB,IAAI,KAAK,GAAG,OAAO;IAEnB,IAAI,CAAC,IACH,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,MAAM;IAGtC,GAAG,UAAU,GAAG;IAChB,GAAG,OAAO,GAAG;IAEb,IAAI,QAAQ,MACV,IAAI,CAAC,IAAI,CAAC;IAEZ,GAAG;IAEH,IAAI,KAAK,IAAI,CAAC,cAAc;IAC5B,GAAG,OAAO,GAAG;IACb,IAAI,GAAG,YAAY,IAAI,GAAG,MAAM,GAAG,GAAG,aAAa,EACjD,IAAI,CAAC,KAAK,CAAC,GAAG,aAAa;AAE/B;AAEA,SAAS,gCAAU,OAAO;IACxB,IAAI,CAAE,CAAA,IAAI,YAAY,+BAAQ,GAAI,OAAO,IAAI,gCAAU;IAEvD,OAAO,IAAI,CAAC,IAAI,EAAE;IAElB,IAAI,CAAC,eAAe,GAAG;QACrB,gBAAgB,qCAAe,IAAI,CAAC,IAAI;QACxC,eAAe;QACf,cAAc;QACd,SAAS;QACT,YAAY;QACZ,eAAe;IACjB;IAEA,kEAAkE;IAClE,IAAI,CAAC,cAAc,CAAC,YAAY,GAAG;IAEnC,kEAAkE;IAClE,gEAAgE;IAChE,mBAAmB;IACnB,IAAI,CAAC,cAAc,CAAC,IAAI,GAAG;IAE3B,IAAI,SAAS;QACX,IAAI,OAAO,QAAQ,SAAS,KAAK,YAAY,IAAI,CAAC,UAAU,GAAG,QAAQ,SAAS;QAEhF,IAAI,OAAO,QAAQ,KAAK,KAAK,YAAY,IAAI,CAAC,MAAM,GAAG,QAAQ,KAAK;IACtE;IAEA,sEAAsE;IACtE,IAAI,CAAC,EAAE,CAAC,aAAa;AACvB;AAEA,SAAS;IACP,IAAI,QAAQ,IAAI;IAEhB,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,YACzB,IAAI,CAAC,MAAM,CAAC,SAAU,EAAE,EAAE,IAAI;QAC5B,2BAAK,OAAO,IAAI;IAClB;SAEA,2BAAK,IAAI,EAAE,MAAM;AAErB;AAEA,gCAAU,SAAS,CAAC,IAAI,GAAG,SAAU,KAAK,EAAE,QAAQ;IAClD,IAAI,CAAC,eAAe,CAAC,aAAa,GAAG;IACrC,OAAO,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO;AACjD;AAEA,uCAAuC;AACvC,oDAAoD;AACpD,6BAA6B;AAC7B,EAAE;AACF,yDAAyD;AACzD,iEAAiE;AACjE,EAAE;AACF,iEAAiE;AACjE,sEAAsE;AACtE,wDAAwD;AACxD,gCAAU,SAAS,CAAC,UAAU,GAAG,SAAU,KAAK,EAAE,QAAQ,EAAE,EAAE;IAC5D,MAAM,IAAI,MAAM;AAClB;AAEA,gCAAU,SAAS,CAAC,MAAM,GAAG,SAAU,KAAK,EAAE,QAAQ,EAAE,EAAE;IACxD,IAAI,KAAK,IAAI,CAAC,eAAe;IAC7B,GAAG,OAAO,GAAG;IACb,GAAG,UAAU,GAAG;IAChB,GAAG,aAAa,GAAG;IACnB,IAAI,CAAC,GAAG,YAAY,EAAE;QACpB,IAAI,KAAK,IAAI,CAAC,cAAc;QAC5B,IAAI,GAAG,aAAa,IAAI,GAAG,YAAY,IAAI,GAAG,MAAM,GAAG,GAAG,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,aAAa;IACtG;AACF;AAEA,yCAAyC;AACzC,gCAAgC;AAChC,iEAAiE;AACjE,gCAAU,SAAS,CAAC,KAAK,GAAG,SAAU,CAAC;IACrC,IAAI,KAAK,IAAI,CAAC,eAAe;IAE7B,IAAI,GAAG,UAAU,KAAK,QAAQ,GAAG,OAAO,IAAI,CAAC,GAAG,YAAY,EAAE;QAC5D,GAAG,YAAY,GAAG;QAClB,IAAI,CAAC,UAAU,CAAC,GAAG,UAAU,EAAE,GAAG,aAAa,EAAE,GAAG,cAAc;IACpE,OACE,gEAAgE;IAChE,mDAAmD;IACnD,GAAG,aAAa,GAAG;AAEvB;AAEA,gCAAU,SAAS,CAAC,QAAQ,GAAG,SAAU,GAAG,EAAE,EAAE;IAC9C,IAAI,SAAS,IAAI;IAEjB,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,SAAU,IAAI;QACtD,GAAG;QACH,OAAO,IAAI,CAAC;IACd;AACF;AAEA,SAAS,2BAAK,MAAM,EAAE,EAAE,EAAE,IAAI;IAC5B,IAAI,IAAI,OAAO,OAAO,IAAI,CAAC,SAAS;IAEpC,IAAI,QAAQ,MACV,OAAO,IAAI,CAAC;IAEd,0DAA0D;IAC1D,0CAA0C;IAC1C,IAAI,OAAO,cAAc,CAAC,MAAM,EAAE,MAAM,IAAI,MAAM;IAElD,IAAI,OAAO,eAAe,CAAC,YAAY,EAAE,MAAM,IAAI,MAAM;IAEzD,OAAO,OAAO,IAAI,CAAC;AACrB;;;;;ACrNA,sDAAsD;AACtD,EAAE;AACF,0EAA0E;AAC1E,gEAAgE;AAChE,sEAAsE;AACtE,sEAAsE;AACtE,4EAA4E;AAC5E,qEAAqE;AACrE,wBAAwB;AACxB,EAAE;AACF,0EAA0E;AAC1E,yDAAyD;AACzD,EAAE;AACF,0EAA0E;AAC1E,6DAA6D;AAC7D,4EAA4E;AAC5E,2EAA2E;AAC3E,wEAAwE;AACxE,4EAA4E;AAC5E,yCAAyC;AAEzC,wBAAwB;AACxB,4DAA4D;AAC5D,yCAAyC;AAEzC;AAEA,iBAAiB;;;;AAIjB,eAAe,GACf,IAAI,6BAAO,OAAO,MAAM,CAAC;;AACzB,2BAAK,QAAQ,GAAG;AAChB,gBAAgB,GAEhB,2BAAK,QAAQ,CAAC,mCAAa;AAE3B,SAAS,kCAAY,OAAO;IAC1B,IAAI,CAAE,CAAA,IAAI,YAAY,iCAAU,GAAI,OAAO,IAAI,kCAAY;IAE3D,OAAU,IAAI,CAAC,IAAI,EAAE;AACvB;AAEA,kCAAY,SAAS,CAAC,UAAU,GAAG,SAAU,KAAK,EAAE,QAAQ,EAAE,EAAE;IAC9D,GAAG,MAAM;AACX;;;;;;AC9CA;;;;;;;uCAYI;AAEJ,IAAI,0BAAI;IACP;IAAY;IAAY;IAAgB;CACxC;AAED,IAAI,0BAAI,IAAI,MAAM;AAElB,SAAS;IACR,IAAI,CAAC,IAAI;IACT,IAAI,CAAC,EAAE,GAAG;IAEV,OAAK,IAAI,CAAC,IAAI,EAAE,IAAI;AACrB;AAEA,OAAS,2BAAK;AAEd,0BAAI,SAAS,CAAC,IAAI,GAAG;IACpB,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IAEV,OAAO,IAAI;AACZ;AAEA,SAAS,4BAAM,GAAG;IACjB,OAAO,AAAC,OAAO,IAAM,QAAQ;AAC9B;AAEA,SAAS,6BAAO,GAAG;IAClB,OAAO,AAAC,OAAO,KAAO,QAAQ;AAC/B;AAEA,SAAS,yBAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACrB,IAAI,MAAM,GACT,OAAO,AAAC,IAAI,IAAM,CAAC,IAAI;IAExB,IAAI,MAAM,GACT,OAAO,AAAC,IAAI,IAAM,IAAI,IAAM,IAAI;IAEjC,OAAO,IAAI,IAAI;AAChB;AAEA,0BAAI,SAAS,CAAC,OAAO,GAAG,SAAU,CAAC;IAClC,IAAI,IAAI,IAAI,CAAC,EAAE;IAEf,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAElB,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACzB,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,IAAI;IAE1B,MAAO,IAAI,IAAI,EAAE,EAChB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG;IAGnD,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EAAG;QAC5B,IAAI,IAAI,CAAC,CAAE,CAAA,IAAI,EAAC;QAChB,IAAI,IAAI,AAAC,4BAAM,KAAK,yBAAG,GAAG,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,EAAE,GAAG,uBAAC,CAAC,EAAE,GAAI;QAExD,IAAI;QACJ,IAAI;QACJ,IAAI,6BAAO;QACX,IAAI;QACJ,IAAI;IACL;IAEA,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;AAC3B;AAEA,0BAAI,SAAS,CAAC,KAAK,GAAG;IACrB,IAAI,IAAI,iCAAO,WAAW,CAAC;IAE3B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG;IAC5B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG;IAC5B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG;IAC5B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG;IAC5B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG;IAE5B,OAAO;AACR;AAEA,iBAAiB;;;;ACvGjB;;;uCAEI;;;AAGJ,qCAAqC;AACrC,SAAS,2BAAK,SAAS,EAAE,SAAS;IACjC,IAAI,CAAC,MAAM,GAAG,iCAAO,KAAK,CAAC;IAC3B,IAAI,CAAC,UAAU,GAAG;IAClB,IAAI,CAAC,UAAU,GAAG;IAClB,IAAI,CAAC,IAAI,GAAG;AACb;AAEA,2BAAK,SAAS,CAAC,MAAM,GAAG,SAAU,IAAI,EAAE,GAAG;IAC1C,+BAA+B,GAC/B,OAAO,OAAS,MAAM,OAAO;IAE7B,IAAI,QAAQ,IAAI,CAAC,MAAM;IACvB,IAAI,YAAY,IAAI,CAAC,UAAU;IAC/B,IAAI,SAAS,KAAK,MAAM;IACxB,IAAI,QAAQ,IAAI,CAAC,IAAI;IAErB,IAAK,IAAI,SAAS,GAAG,SAAS,QAAS;QACtC,IAAI,WAAW,QAAQ;QACvB,IAAI,YAAY,KAAK,GAAG,CAAC,SAAS,QAAQ,YAAY;QAEtD,IAAK,IAAI,IAAI,GAAG,IAAI,WAAW,IAC9B,KAAK,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE;QAGvC,SAAS;QACT,UAAU;QAEV,IAAI,AAAC,QAAQ,cAAe,GAC3B,IAAI,CAAC,OAAO,CAAC;IAEf;IAEA,IAAI,CAAC,IAAI,IAAI;IACb,OAAO,IAAI;AACZ;AAEA,2BAAK,SAAS,CAAC,MAAM,GAAG,SAAU,GAAG;IACpC,IAAI,MAAM,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU;IAErC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG;IAEnB;;;EAGC,GACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM;IAE1B,IAAI,OAAO,IAAI,CAAC,UAAU,EAAE;QAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAClB;IAEA,IAAI,OAAO,IAAI,CAAC,IAAI,GAAG;IAEvB,SAAS;IACT,IAAI,QAAQ,YACX,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,UAAU,GAAG;SAG5C;QACN,IAAI,UAAU,AAAC,CAAA,OAAO,UAAS,MAAO;QACtC,IAAI,WAAW,AAAC,CAAA,OAAO,OAAM,IAAK;QAElC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,UAAU,IAAI,CAAC,UAAU,GAAG;QACtD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,IAAI,CAAC,UAAU,GAAG;IACtD;IAEA,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM;IACxB,IAAI,OAAO,IAAI,CAAC,KAAK;IAErB,OAAO,MAAM,KAAK,QAAQ,CAAC,OAAO;AACnC;AAEA,2BAAK,SAAS,CAAC,OAAO,GAAG;IACxB,MAAM,IAAI,MAAM;AACjB;AAEA,iBAAiB;;;;ACnFjB,kFAAkF,GAClF,yCAAyC;AAEzC,IAAI,+BAAS,cAAO,MAAM;AAE1B,oDAAoD;AACpD,SAAS,gCAAW,GAAG,EAAE,GAAG;IAC1B,IAAK,IAAI,OAAO,IACd,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI;AAEvB;AACA,IAAI,6BAAO,IAAI,IAAI,6BAAO,KAAK,IAAI,6BAAO,WAAW,IAAI,6BAAO,eAAe,EAC7E,iBAAiB;KACZ;IACL,yCAAyC;IACzC,gCAAU,eAAQ;IAClB,eAAQ,MAAM,GAAG;AACnB;AAEA,SAAS,iCAAY,GAAG,EAAE,gBAAgB,EAAE,MAAM;IAChD,OAAO,6BAAO,KAAK,kBAAkB;AACvC;AAEA,iCAAW,SAAS,GAAG,OAAO,MAAM,CAAC,6BAAO,SAAS;AAErD,kCAAkC;AAClC,gCAAU,8BAAQ;AAElB,iCAAW,IAAI,GAAG,SAAU,GAAG,EAAE,gBAAgB,EAAE,MAAM;IACvD,IAAI,OAAO,QAAQ,UACjB,MAAM,IAAI,UAAU;IAEtB,OAAO,6BAAO,KAAK,kBAAkB;AACvC;AAEA,iCAAW,KAAK,GAAG,SAAU,IAAI,EAAE,IAAI,EAAE,QAAQ;IAC/C,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU;IAEtB,IAAI,MAAM,6BAAO;IACjB,IAAI,SAAS;QACX,IAAI,OAAO,aAAa,UACtB,IAAI,IAAI,CAAC,MAAM;aAEf,IAAI,IAAI,CAAC;WAGX,IAAI,IAAI,CAAC;IAEX,OAAO;AACT;AAEA,iCAAW,WAAW,GAAG,SAAU,IAAI;IACrC,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU;IAEtB,OAAO,6BAAO;AAChB;AAEA,iCAAW,eAAe,GAAG,SAAU,IAAI;IACzC,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU;IAEtB,OAAO,cAAO,UAAU,CAAC;AAC3B;;;;;AChEA;;;uCAEI;;;;;AAIJ,IAAI,+BAAS,YAAY,MAAM,IAAI,SAAS,OAAO,GAAG;IACrD,IAAI;QACH,OAAiB;QACjB,OAAO;IACR,EAAE,OAAO,GAAG;QACX,OAAO;IACR;AACD;AAEA,IAAI,sCAAgB,OAAO,eAAe;AAC1C,IAAI,uCAAiB,OAAO,gBAAgB,eACxC,OAAO,eAAe;AAC1B,IAAI,2CAAqB,wCAAmB,CAAA,iCAAO,SAAS,YAAY,cAAc,iCAAO,mBAAmB,AAAD;AAE/G,iBAAiB,SAAS,SAAS,IAAI,EAAE,QAAQ;IAChD,IAAI,iCAAO,QAAQ,CAAC,OAAO;QAC1B,IAAI,KAAK,WAAW,IAAI,CAAE,CAAA,cAAc,IAAG,GAC1C,wBAAwB;QACxB,OAAO,iCAAO,IAAI,CAAC;QAEpB,OAAO;IACR;IAEA,IAAI,OAAO,SAAS,UACnB,OAAO,iCAAO,IAAI,CAAC,MAAM;IAG1B;;;EAGC,GACD,IAAI,wCAAkB,6BAAO,OAAO;QACnC,4DAA4D;QAC5D,IAAI,KAAK,UAAU,KAAK,GACvB,OAAO,iCAAO,KAAK,CAAC;QAGrB,gFAAgF;QAChF,IAAI,0CAAoB;YACvB,IAAI,MAAM,iCAAO,IAAI,CAAC,KAAK,MAAM,EAAE,KAAK,UAAU,EAAE,KAAK,UAAU;YACnE;;;IAGC,GACD,IAAI,IAAI,UAAU,KAAK,KAAK,UAAU,EACrC,OAAO;QAET;QAEA,iDAAiD;QACjD,IAAI,QAAQ,gBAAgB,aAAa,OAAO,IAAI,WAAW,KAAK,MAAM,EAAE,KAAK,UAAU,EAAE,KAAK,UAAU;QAC5G,IAAI,SAAS,iCAAO,IAAI,CAAC;QAEzB;;;GAGC,GACD,IAAI,OAAO,MAAM,KAAK,KAAK,UAAU,EACpC,OAAO;IAET;IAEA;;;EAGC,GACD,IAAI,uCAAiB,gBAAgB,YACpC,OAAO,iCAAO,IAAI,CAAC;IAGpB,IAAI,QAAQ,OAAQ;IACpB,IAAI,OACH,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,EAAE,KAAK,EAAG;QACxC,IAAI,IAAI,IAAI,CAAC,EAAE;QACf,IACC,OAAO,MAAM,YACV,IAAI,KACJ,IAAI,OACJ,CAAC,CAAC,MAAM,EAAE,wBAAwB;UAErC,MAAM,IAAI,WAAW;IAEvB;IAGD;;;;EAIC,GACD,IACC,SACC,iCAAO,QAAQ,CAAC,SACb,KAAK,WAAW,IAChB,OAAO,KAAK,WAAW,CAAC,QAAQ,KAAK,cACrC,KAAK,WAAW,CAAC,QAAQ,CAAC,OAG9B,OAAO,iCAAO,IAAI,CAAC;IAGpB,MAAM,IAAI,UAAU;AACrB;;;;AC5GA,IAAI,iCAAW,CAAC,EAAE,QAAQ;AAE1B,iBAAiB,MAAM,OAAO,IAAI,SAAU,GAAG;IAC7C,OAAO,+BAAS,IAAI,CAAC,QAAQ;AAC/B;;;;;ACJA;;;;;AAMA,uFAAuF,GACvF,IAAI,0CAAoB,OAAU,+BAA+B;;;AAIjE,wBAAwB,GACxB,0FAA0F;AAC1F,iBAAiB,2CAAqB,SAAS,iBAAiB,CAAC;IAChE,IAAI,CAAC,OAAa,IACjB,MAAM,IAAI,OAAW;IAEtB,OAAO,EAAE,MAAM;AAChB;;;;AClBA;AAEA,6BAA6B,GAC7B,iBAAiB;;;;;ACHjB;;;;;AAMA,iFAAiF,GACjF,IAAI,iCAAW,OAAc;IAAC,OAAa;CAA8B;AAEzE,wBAAwB,GACxB,iBAAiB,SAAS,mBAAmB,IAAI,EAAE,YAAY;IAC9D,6BAA6B,GAE7B,IAAI,YAAY,2DAA2D,GAAI,OAAa,MAAM,CAAC,CAAC;IACpG,IAAI,OAAO,cAAc,cAAc,+BAAS,MAAM,iBAAiB,IACtE,OAAO,OAAc,kBAAkB,GAAI;QAAC;KAAU;IAEvD,OAAO;AACR;;;;AClBA;AAEA,IAAI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoBJ,IAAI,kCAAY;AAEhB,6CAA6C;AAC7C,IAAI,8CAAwB,SAAU,gBAAgB;IACrD,IAAI;QACH,OAAO,gCAAU,2BAA2B,mBAAmB;IAChE,EAAE,OAAO,GAAG,CAAC;AACd;;;;;AAKA,IAAI,uCAAiB;IACpB,MAAM,IAAI;AACX;AACA,IAAI,uCAAiB,SACjB;IACF,IAAI;QACH,sFAAsF;QACtF,UAAU,MAAM,EAAE,2BAA2B;QAC7C,OAAO;IACR,EAAE,OAAO,cAAc;QACtB,IAAI;YACH,gEAAgE;YAChE,OAAO,OAAM,WAAW,UAAU,GAAG;QACtC,EAAE,OAAO,YAAY;YACpB,OAAO;QACR;IACD;AACD,MACE;;AAEH,IAAI,mCAAa;;;;;;;;;;;AASjB,IAAI,kCAAY,CAAC;AAEjB,IAAI,mCAAa,OAAO,eAAe,eAAe,CAAC,SAAW,YAAY,OAAS;AAEvF,IAAI,mCAAa;IAChB,WAAW;IACX,oBAAoB,OAAO,mBAAmB,cAAc,YAAY;IACxE,WAAW;IACX,iBAAiB,OAAO,gBAAgB,cAAc,YAAY;IAClE,4BAA4B,oCAAc,SAAW,OAAS,EAAE,CAAC,OAAO,QAAQ,CAAC,MAAM;IACvF,oCAAoC;IACpC,mBAAmB;IACnB,oBAAoB;IACpB,4BAA4B;IAC5B,4BAA4B;IAC5B,aAAa,OAAO,YAAY,cAAc,YAAY;IAC1D,YAAY,OAAO,WAAW,cAAc,YAAY;IACxD,mBAAmB,OAAO,kBAAkB,cAAc,YAAY;IACtE,oBAAoB,OAAO,mBAAmB,cAAc,YAAY;IACxE,aAAa;IACb,cAAc,OAAO,aAAa,cAAc,YAAY;IAC5D,UAAU;IACV,eAAe;IACf,wBAAwB;IACxB,eAAe;IACf,wBAAwB;IACxB,WAAW;IACX,UAAU;IACV,eAAe;IACf,kBAAkB,OAAO,iBAAiB,cAAc,YAAY;IACpE,kBAAkB,OAAO,iBAAiB,cAAc,YAAY;IACpE,kBAAkB,OAAO,iBAAiB,cAAc,YAAY;IACpE,0BAA0B,OAAO,yBAAyB,cAAc,YAAY;IACpF,cAAc;IACd,uBAAuB;IACvB,eAAe,OAAO,cAAc,cAAc,YAAY;IAC9D,gBAAgB,OAAO,eAAe,cAAc,YAAY;IAChE,gBAAgB,OAAO,eAAe,cAAc,YAAY;IAChE,cAAc;IACd,WAAW;IACX,uBAAuB,oCAAc,SAAW,OAAS,OAAS,EAAE,CAAC,OAAO,QAAQ,CAAC,OAAO;IAC5F,UAAU,OAAO,SAAS,WAAW,OAAO;IAC5C,SAAS,OAAO,QAAQ,cAAc,YAAY;IAClD,0BAA0B,OAAO,QAAQ,eAAe,CAAC,oCAAc,CAAC,SAAW,YAAY,OAAS,IAAI,KAAK,CAAC,OAAO,QAAQ,CAAC;IAClI,UAAU;IACV,YAAY;IACZ,YAAY;IACZ,qCAAqC;IACrC,gBAAgB;IAChB,cAAc;IACd,aAAa,OAAO,YAAY,cAAc,YAAY;IAC1D,WAAW,OAAO,UAAU,cAAc,YAAY;IACtD,gBAAgB;IAChB,oBAAoB;IACpB,aAAa,OAAO,YAAY,cAAc,YAAY;IAC1D,YAAY;IACZ,SAAS,OAAO,QAAQ,cAAc,YAAY;IAClD,0BAA0B,OAAO,QAAQ,eAAe,CAAC,oCAAc,CAAC,SAAW,YAAY,OAAS,IAAI,KAAK,CAAC,OAAO,QAAQ,CAAC;IAClI,uBAAuB,OAAO,sBAAsB,cAAc,YAAY;IAC9E,YAAY;IACZ,6BAA6B,oCAAc,SAAW,OAAS,EAAE,CAAC,OAAO,QAAQ,CAAC,MAAM;IACxF,YAAY,mCAAa,SAAS;IAClC,iBAAiB;IACjB,oBAAoB;IACpB,gBAAgB;IAChB,eAAe;IACf,gBAAgB,OAAO,eAAe,cAAc,YAAY;IAChE,uBAAuB,OAAO,sBAAsB,cAAc,YAAY;IAC9E,iBAAiB,OAAO,gBAAgB,cAAc,YAAY;IAClE,iBAAiB,OAAO,gBAAgB,cAAc,YAAY;IAClE,cAAc;IACd,aAAa,OAAO,YAAY,cAAc,YAAY;IAC1D,aAAa,OAAO,YAAY,cAAc,YAAY;IAC1D,aAAa,OAAO,YAAY,cAAc,YAAY;IAE1D,6BAA6B;IAC7B,8BAA8B;IAC9B,2BAA2B;IAC3B,2BAA2B;IAC3B,cAAc;IACd,gBAAgB;IAChB,cAAc;IACd,cAAc;IACd,cAAc;IACd,gBAAgB;IAChB,eAAe;IACf,4BAA4B;AAC7B;AAEA,IAAI,QACH,IAAI;IACH,KAAK,KAAK,EAAE,4CAA4C;AACzD,EAAE,OAAO,GAAG;IACX,gFAAgF;IAChF,IAAI,mCAAa,OAAS,OAAS;IACnC,gCAAU,CAAC,oBAAoB,GAAG;AACnC;AAGD,IAAI,+BAAS,SAAS,OAAO,IAAI;IAChC,IAAI;IACJ,IAAI,SAAS,mBACZ,QAAQ,4CAAsB;SACxB,IAAI,SAAS,uBACnB,QAAQ,4CAAsB;SACxB,IAAI,SAAS,4BACnB,QAAQ,4CAAsB;SACxB,IAAI,SAAS,oBAAoB;QACvC,IAAI,KAAK,OAAO;QAChB,IAAI,IACH,QAAQ,GAAG,SAAS;IAEtB,OAAO,IAAI,SAAS,4BAA4B;QAC/C,IAAI,MAAM,OAAO;QACjB,IAAI,OAAO,QACV,QAAQ,OAAS,IAAI,SAAS;IAEhC;IAEA,gCAAU,CAAC,KAAK,GAAG;IAEnB,OAAO;AACR;AAEA,IAAI,uCAAiB;IACpB,WAAW;IACX,0BAA0B;QAAC;QAAe;KAAY;IACtD,oBAAoB;QAAC;QAAS;KAAY;IAC1C,wBAAwB;QAAC;QAAS;QAAa;KAAU;IACzD,wBAAwB;QAAC;QAAS;QAAa;KAAU;IACzD,qBAAqB;QAAC;QAAS;QAAa;KAAO;IACnD,uBAAuB;QAAC;QAAS;QAAa;KAAS;IACvD,4BAA4B;QAAC;QAAiB;KAAY;IAC1D,oBAAoB;QAAC;QAA0B;KAAY;IAC3D,6BAA6B;QAAC;QAA0B;QAAa;KAAY;IACjF,sBAAsB;QAAC;QAAW;KAAY;IAC9C,uBAAuB;QAAC;QAAY;KAAY;IAChD,mBAAmB;QAAC;QAAQ;KAAY;IACxC,oBAAoB;QAAC;QAAS;KAAY;IAC1C,wBAAwB;QAAC;QAAa;KAAY;IAClD,2BAA2B;QAAC;QAAgB;KAAY;IACxD,2BAA2B;QAAC;QAAgB;KAAY;IACxD,uBAAuB;QAAC;QAAY;KAAY;IAChD,eAAe;QAAC;QAAqB;KAAY;IACjD,wBAAwB;QAAC;QAAqB;QAAa;KAAY;IACvE,wBAAwB;QAAC;QAAa;KAAY;IAClD,yBAAyB;QAAC;QAAc;KAAY;IACpD,yBAAyB;QAAC;QAAc;KAAY;IACpD,eAAe;QAAC;QAAQ;KAAQ;IAChC,mBAAmB;QAAC;QAAQ;KAAY;IACxC,kBAAkB;QAAC;QAAO;KAAY;IACtC,qBAAqB;QAAC;QAAU;KAAY;IAC5C,qBAAqB;QAAC;QAAU;KAAY;IAC5C,uBAAuB;QAAC;QAAU;QAAa;KAAW;IAC1D,sBAAsB;QAAC;QAAU;QAAa;KAAU;IACxD,sBAAsB;QAAC;QAAW;KAAY;IAC9C,uBAAuB;QAAC;QAAW;QAAa;KAAO;IACvD,iBAAiB;QAAC;QAAW;KAAM;IACnC,oBAAoB;QAAC;QAAW;KAAS;IACzC,qBAAqB;QAAC;QAAW;KAAU;IAC3C,yBAAyB;QAAC;QAAc;KAAY;IACpD,6BAA6B;QAAC;QAAkB;KAAY;IAC5D,qBAAqB;QAAC;QAAU;KAAY;IAC5C,kBAAkB;QAAC;QAAO;KAAY;IACtC,gCAAgC;QAAC;QAAqB;KAAY;IAClE,qBAAqB;QAAC;QAAU;KAAY;IAC5C,qBAAqB;QAAC;QAAU;KAAY;IAC5C,0BAA0B;QAAC;QAAe;KAAY;IACtD,yBAAyB;QAAC;QAAc;KAAY;IACpD,wBAAwB;QAAC;QAAa;KAAY;IAClD,yBAAyB;QAAC;QAAc;KAAY;IACpD,gCAAgC;QAAC;QAAqB;KAAY;IAClE,0BAA0B;QAAC;QAAe;KAAY;IACtD,0BAA0B;QAAC;QAAe;KAAY;IACtD,uBAAuB;QAAC;QAAY;KAAY;IAChD,sBAAsB;QAAC;QAAW;KAAY;IAC9C,sBAAsB;QAAC;QAAW;KAAY;AAC/C;;;;;AAIA,IAAI,gCAAU,YAAU,QAAO,MAAM,SAAS,CAAC,MAAM;AACrD,IAAI,qCAAe,YAAU,QAAQ,MAAM,SAAS,CAAC,MAAM;AAC3D,IAAI,iCAAW,YAAU,QAAO,OAAO,SAAS,CAAC,OAAO;AACxD,IAAI,kCAAY,YAAU,QAAO,OAAO,SAAS,CAAC,KAAK;AACvD,IAAI,8BAAQ,YAAU,QAAO,OAAO,SAAS,CAAC,IAAI;AAElD,yFAAyF,GACzF,IAAI,mCAAa;AACjB,IAAI,qCAAe,YAAY,iDAAiD;AAChF,IAAI,qCAAe,SAAS,aAAa,MAAM;IAC9C,IAAI,QAAQ,gCAAU,QAAQ,GAAG;IACjC,IAAI,OAAO,gCAAU,QAAQ;IAC7B,IAAI,UAAU,OAAO,SAAS,KAC7B,MAAM,IAAI,OAAa;SACjB,IAAI,SAAS,OAAO,UAAU,KACpC,MAAM,IAAI,OAAa;IAExB,IAAI,SAAS,EAAE;IACf,+BAAS,QAAQ,kCAAY,SAAU,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS;QACrE,MAAM,CAAC,OAAO,MAAM,CAAC,GAAG,QAAQ,+BAAS,WAAW,oCAAc,QAAQ,UAAU;IACrF;IACA,OAAO;AACR;AACA,kBAAkB,GAElB,IAAI,yCAAmB,SAAS,iBAAiB,IAAI,EAAE,YAAY;IAClE,IAAI,gBAAgB;IACpB,IAAI;IACJ,IAAI,OAAO,sCAAgB,gBAAgB;QAC1C,QAAQ,oCAAc,CAAC,cAAc;QACrC,gBAAgB,MAAM,KAAK,CAAC,EAAE,GAAG;IAClC;IAEA,IAAI,OAAO,kCAAY,gBAAgB;QACtC,IAAI,QAAQ,gCAAU,CAAC,cAAc;QACrC,IAAI,UAAU,iCACb,QAAQ,6BAAO;QAEhB,IAAI,OAAO,UAAU,eAAe,CAAC,cACpC,MAAM,IAAI,OAAW,eAAe,OAAO;QAG5C,OAAO;YACN,OAAO;YACP,MAAM;YACN,OAAO;QACR;IACD;IAEA,MAAM,IAAI,OAAa,eAAe,OAAO;AAC9C;AAEA,iBAAiB,SAAS,aAAa,IAAI,EAAE,YAAY;IACxD,IAAI,OAAO,SAAS,YAAY,KAAK,MAAM,KAAK,GAC/C,MAAM,IAAI,OAAW;IAEtB,IAAI,UAAU,MAAM,GAAG,KAAK,OAAO,iBAAiB,WACnD,MAAM,IAAI,OAAW;IAGtB,IAAI,4BAAM,eAAe,UAAU,MAClC,MAAM,IAAI,OAAa;IAExB,IAAI,QAAQ,mCAAa;IACzB,IAAI,oBAAoB,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,EAAE,GAAG;IAEtD,IAAI,YAAY,uCAAiB,MAAM,oBAAoB,KAAK;IAChE,IAAI,oBAAoB,UAAU,IAAI;IACtC,IAAI,QAAQ,UAAU,KAAK;IAC3B,IAAI,qBAAqB;IAEzB,IAAI,QAAQ,UAAU,KAAK;IAC3B,IAAI,OAAO;QACV,oBAAoB,KAAK,CAAC,EAAE;QAC5B,mCAAa,OAAO,8BAAQ;YAAC;YAAG;SAAE,EAAE;IACrC;IAEA,IAAK,IAAI,IAAI,GAAG,QAAQ,MAAM,IAAI,MAAM,MAAM,EAAE,KAAK,EAAG;QACvD,IAAI,OAAO,KAAK,CAAC,EAAE;QACnB,IAAI,QAAQ,gCAAU,MAAM,GAAG;QAC/B,IAAI,OAAO,gCAAU,MAAM;QAC3B,IACC,AACC,CAAA,AAAC,UAAU,OAAO,UAAU,OAAO,UAAU,OACzC,SAAS,OAAO,SAAS,OAAO,SAAS,GAAG,KAE9C,UAAU,MAEb,MAAM,IAAI,OAAa;QAExB,IAAI,SAAS,iBAAiB,CAAC,OAC9B,qBAAqB;QAGtB,qBAAqB,MAAM;QAC3B,oBAAoB,MAAM,oBAAoB;QAE9C,IAAI,OAAO,kCAAY,oBACtB,QAAQ,gCAAU,CAAC,kBAAkB;aAC/B,IAAI,SAAS,MAAM;YACzB,IAAI,CAAE,CAAA,QAAQ,KAAI,GAAI;gBACrB,IAAI,CAAC,cACJ,MAAM,IAAI,OAAW,wBAAwB,OAAO;gBAErD,OAAO,KAAK;YACb;YACA,IAAI,UAAS,AAAC,IAAI,KAAM,MAAM,MAAM,EAAE;gBACrC,IAAI,OAAO,OAAM,OAAO;gBACxB,QAAQ,CAAC,CAAC;gBAEV,kEAAkE;gBAClE,gEAAgE;gBAChE,8DAA8D;gBAC9D,6DAA6D;gBAC7D,8DAA8D;gBAC9D,6DAA6D;gBAC7D,UAAU;gBACV,IAAI,SAAS,SAAS,QAAQ,CAAE,CAAA,mBAAmB,KAAK,GAAG,AAAD,GACzD,QAAQ,KAAK,GAAG;qBAEhB,QAAQ,KAAK,CAAC,KAAK;YAErB,OAAO;gBACN,QAAQ,OAAO,OAAO;gBACtB,QAAQ,KAAK,CAAC,KAAK;YACpB;YAEA,IAAI,SAAS,CAAC,oBACb,gCAAU,CAAC,kBAAkB,GAAG;QAElC;IACD;IACA,OAAO;AACR;;;;ACzXA;AAEA,wBAAwB,GACxB,iBAAiB;;;;;ACHjB;AAEA,wBAAwB,GACxB,iBAAiB;;;;;ACHjB;AAEA,6BAA6B,GAC7B,iBAAiB;;;;;ACHjB;AAEA,8BAA8B,GAC9B,iBAAiB;;;;;ACHjB;AAEA,4BAA4B,GAC5B,iBAAiB;;;;;ACHjB;AAEA,+BAA+B,GAC/B,iBAAiB;;;;;ACHjB;AAEA,4BAA4B,GAC5B,iBAAiB;;;;;ACHjB;AAEA,4BAA4B,GAC5B,iBAAiB,KAAK,GAAG;;;;;ACHzB;AAEA,8BAA8B,GAC9B,iBAAiB,KAAK,KAAK;;;;;ACH3B;AAEA,4BAA4B,GAC5B,iBAAiB,KAAK,GAAG;;;;;ACHzB;AAEA,4BAA4B,GAC5B,iBAAiB,KAAK,GAAG;;;;;ACHzB;AAEA,4BAA4B,GAC5B,iBAAiB,KAAK,GAAG;;;;;ACHzB;AAEA,8BAA8B,GAC9B,iBAAiB,KAAK,KAAK;;;;;ACH3B;;;AAIA,6BAA6B,GAC7B,iBAAiB,SAAS,KAAK,MAAM;IACpC,IAAI,OAAO,WAAW,WAAW,GAChC,OAAO;IAER,OAAO,SAAS,IAAI,KAAK;AAC1B;;;;ACVA;AAEA,8BAA8B,GAC9B,iBAAiB,OAAO,KAAK,IAAI,SAAS,MAAM,CAAC;IAChD,OAAO,MAAM;AACd;;;;;;ACLA;;;sCAGI;AAEJ,qCACC,IAAI;IACH,gCAAM,EAAE,EAAE;AACX,EAAE,OAAO,GAAG;IACX,yBAAyB;sCACjB;AACT;AAGD;;;;ACdA;AAEA,6BAA6B,GAC7B,iBAAiB,OAAO,wBAAwB;;;;;;ACHhD;;;;;;;AAOA,wBAAwB,GACxB,iBAAiB,SACd,SAAS,SAAS,CAAC;IACpB,qEAAqE;IACrE,OAAO,OAAgB;AACxB,IACE,SACC,SAAS,SAAS,CAAC;IACpB,IAAI,CAAC,KAAM,OAAO,MAAM,YAAY,OAAO,MAAM,YAChD,MAAM,IAAI,UAAU;IAErB,qEAAqE;IACrE,OAAO,OAAiB;AACzB,IACE,SACC,SAAS,SAAS,CAAC;IACpB,qEAAqE;IACrE,OAAO,OAAe;AACvB,IACE;;;;AC1BL;AAEA,+CAA+C,GAC/C,iBAAiB,AAAC,OAAO,YAAY,eAAe,QAAQ,cAAc,IAAK;;;;;ACH/E;;;AAIA,8CAA8C,GAC9C,iBAAiB,yBAA0B;;;;;ACL3C;;;;;AAKA,IAAI;AACJ,IAAI;IACH,qDAAqD;IACrD,yCAAyE,AAAtD,mDAAmD,GAAI,EAAE,CAAE,SAAS,KAAK,MAAM,SAAS;AAC5G,EAAE,OAAO,GAAG;IACX,IAAI,CAAC,KAAK,OAAO,MAAM,YAAY,CAAE,CAAA,UAAU,CAAA,KAAM,EAAE,IAAI,KAAK,oBAC/D,MAAM;AAER;AAEA,2CAA2C;AAC3C,IAAI,6BAAO,CAAC,CAAC,0CAAoB,UAAQ,OAAK,OAAO,SAAS,EAAE,0CAA0C,GAAI;AAE9G,IAAI,gCAAU;AACd,IAAI,wCAAkB,8BAAQ,cAAc;AAE5C,4BAA4B,GAC5B,iBAAiB,8BAAQ,OAAO,2BAAK,GAAG,KAAK,aAC1C,OAAS;IAAC,2BAAK,GAAG;CAAC,IACnB,OAAO,0CAAoB,aAC1B,4BAA4B,GAAG,SAAS,UAAU,KAAK;IACxD,kCAAkC;IAClC,OAAO,sCAAgB,SAAS,OAAO,QAAQ,8BAAQ;AACxD,IACE;;;;AC7BJ;;;;;;;;;AAQA,4HAA4H,GAC5H,iBAAiB,SAAS,cAAc,IAAI;IAC3C,IAAI,KAAK,MAAM,GAAG,KAAK,OAAO,IAAI,CAAC,EAAE,KAAK,YACzC,MAAM,IAAI,OAAW;IAEtB,OAAO,OAAa,QAAM,QAAO;AAClC;;;;ACdA;;;AAIA,iBAAiB,SAAS,SAAS,CAAC,IAAI,IAAI;;;;ACJ5C;AAEA,6BAA6B,GAE7B,IAAI,sCAAgB;AACpB,IAAI,8BAAQ,OAAO,SAAS,CAAC,QAAQ;AACrC,IAAI,4BAAM,KAAK,GAAG;AAClB,IAAI,iCAAW;AAEf,IAAI,iCAAW,SAAS,SAAS,CAAC,EAAE,CAAC;IACjC,IAAI,MAAM,EAAE;IAEZ,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,KAAK,EAC/B,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;IAEjB,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,KAAK,EAC/B,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE;IAG5B,OAAO;AACX;AAEA,IAAI,8BAAQ,SAAS,MAAM,OAAO,EAAE,MAAM;IACtC,IAAI,MAAM,EAAE;IACZ,IAAK,IAAI,IAAI,UAAU,GAAG,IAAI,GAAG,IAAI,QAAQ,MAAM,EAAE,KAAK,GAAG,KAAK,EAC9D,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC,EAAE;IAEvB,OAAO;AACX;AAEA,IAAI,8BAAQ,SAAU,GAAG,EAAE,MAAM;IAC7B,IAAI,MAAM;IACV,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,KAAK,EAAG;QACpC,OAAO,GAAG,CAAC,EAAE;QACb,IAAI,IAAI,IAAI,IAAI,MAAM,EAClB,OAAO;IAEf;IACA,OAAO;AACX;AAEA,iBAAiB,SAAS,KAAK,IAAI;IAC/B,IAAI,SAAS,IAAI;IACjB,IAAI,OAAO,WAAW,cAAc,4BAAM,KAAK,CAAC,YAAY,gCACxD,MAAM,IAAI,UAAU,sCAAgB;IAExC,IAAI,OAAO,4BAAM,WAAW;IAE5B,IAAI;IACJ,IAAI,SAAS;QACT,IAAI,IAAI,YAAY,OAAO;YACvB,IAAI,SAAS,OAAO,KAAK,CACrB,IAAI,EACJ,+BAAS,MAAM;YAEnB,IAAI,OAAO,YAAY,QACnB,OAAO;YAEX,OAAO,IAAI;QACf;QACA,OAAO,OAAO,KAAK,CACf,MACA,+BAAS,MAAM;IAGvB;IAEA,IAAI,cAAc,0BAAI,GAAG,OAAO,MAAM,GAAG,KAAK,MAAM;IACpD,IAAI,YAAY,EAAE;IAClB,IAAK,IAAI,IAAI,GAAG,IAAI,aAAa,IAC7B,SAAS,CAAC,EAAE,GAAG,MAAM;IAGzB,QAAQ,SAAS,UAAU,sBAAsB,4BAAM,WAAW,OAAO,6CAA6C;IAEtH,IAAI,OAAO,SAAS,EAAE;QAClB,IAAI,QAAQ,SAAS,SAAS;QAC9B,MAAM,SAAS,GAAG,OAAO,SAAS;QAClC,MAAM,SAAS,GAAG,IAAI;QACtB,MAAM,SAAS,GAAG;IACtB;IAEA,OAAO;AACX;;;;;;ACnFA;AAEA,qCAAqC,GACrC,iBAAiB,SAAS,SAAS,CAAC,IAAI;;;;;ACHxC;;;;;;;;;AAQA,oCAAoC,GACpC,iBAAiB,UAAiB,YAAU,QAAO;;;;ACTnD;AAEA,sCAAsC,GACtC,iBAAiB,SAAS,SAAS,CAAC,KAAK;;;;;ACHzC;AAEA,qCAAqC,GACrC,iBAAiB,OAAO,YAAY,eAAe,WAAW,QAAQ,KAAK;;;;;;;;;ACH3E;AAEA,IAAI,6BAAO,SAAS,SAAS,CAAC,IAAI;AAClC,IAAI,gCAAU,OAAO,SAAS,CAAC,cAAc;;;AAG7C,wBAAwB,GACxB,iBAAiB,YAAU,4BAAM;;;;;;;ACPjC;;;AAIA,wBAAwB,GACxB,iBAAiB,SAAS,aAAa,KAAK;IAC3C,OAAO,CAAC,CAAC,OAAgB;AAC1B;;;;ACPA;;;;;;;;;;;;;AASA,IAAI,kCAAY,OAAU;;AAC1B,IAAI,uCAAiB;AAErB,IAAI,0BAAI,OAAO,eAAe,cAAc,iBAAS;AACrD,IAAI,oCAAc;AAElB,IAAI,+BAAS,OAAU;AAEvB,yEAAyE,GACzE,IAAI,iCAAW,OAAU,2BAA2B,SAAS,SAAS,QAAQ,KAAK,EAAE,KAAK;IACzF,IAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,EAAE,KAAK,EAAG;QACzC,IAAI,KAAK,CAAC,EAAE,KAAK,OAChB,OAAO;IAET;IACA,OAAO;AACR;AAEA,+CAA+C,GAC/C,oCAAoC,GACpC,IAAI,8BAAQ;IAAE,WAAW;AAAK;AAC9B,IAAI,wCAAkB,UAAQ,QAC7B,OAAQ,mCAAa,SAAU,UAAU;IACxC,IAAI,MAAM,IAAI,uBAAC,CAAC,WAAW;IAC3B,IAAI,OAAO,WAAW,IAAI,OAAO,QAAU;QAC1C,IAAI,QAAQ,OAAS;QACrB,oDAAoD;QACpD,IAAI,aAAa,OAAK,OAAO,OAAO,WAAW;QAC/C,IAAI,CAAC,cAAc,OAAO;YACzB,IAAI,aAAa,OAAS;YAC1B,oDAAoD;YACpD,aAAa,OAAK,YAAY,OAAO,WAAW;QACjD;QACA,IAAI,cAAc,WAAW,GAAG,EAAE;YACjC,IAAI,QAAQ,OAAS,WAAW,GAAG;YACnC,2BAAK,CACJ,6CAA6C,GAAI,MAAM,WACvD,GAAG;QACL;IACD;AACD;KAEA,OAAQ,mCAAa,SAAU,UAAU;IACxC,IAAI,MAAM,IAAI,uBAAC,CAAC,WAAW;IAC3B,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG;IAC7B,IAAI,IAAI;QACP,IAAI,QAAQ,sEAAsE,GACjF,8BAA8B;QAC9B,OAAS;QAEV,2BAAK,CACJ,6CAA6C,GAAI,MAAM,WACvD,GAAG;IACL;AACD;AAGD,kEAAkE,GAClE,IAAI,uCAAiB,SAAS,kBAAkB,KAAK;IACpD,iDAAiD,GAAG,IAAI,QAAQ;IAChE,OACC,8DAA8D,GAAI,6BAClE,8EAA8E,GAC9E,SAAU,MAAM,EAAE,UAAU;QAC3B,IAAI,CAAC,OACJ,IAAI;YACH,wCAAwC;YACxC,IAAI,MAAM,OAAO,WAAW,YAC3B,QAAQ,uCAAuC,GAAI,6BAAO,YAAY;QAExE,EAAE,OAAO,GAAG,CAAO;IAErB;IAED,OAAO;AACR;AAEA,kEAAkE,GAClE,IAAI,kCAAY,SAAS,aAAa,KAAK;IAC1C,4CAA4C,GAAG,IAAI,QAAQ;IAC3D,OACC,8DAA8D,GAAG,6BACjE,8EAA8E,GAAG,SAAU,MAAM,EAAE,IAAI;QACtG,IAAI,CAAC,OACJ,IAAI;YACH,wCAAwC;YACxC,OAAO;YACP,QAAQ,uCAAuC,GAAI,6BAAO,MAAM;QACjE,EAAE,OAAO,GAAG,CAAO;IAErB;IAED,OAAO;AACR;AAEA,wBAAwB,GACxB,iBAAiB,SAAS,gBAAgB,KAAK;IAC9C,IAAI,CAAC,SAAS,OAAO,UAAU,UAAY,OAAO;IAClD,IAAI,CAAC,sCAAgB;QACpB,mBAAmB,GACnB,IAAI,MAAM,6BAAO,gCAAU,QAAQ,GAAG;QACtC,IAAI,+BAAS,mCAAa,OAAO,IAChC,OAAO;QAER,IAAI,QAAQ,UACX,OAAO;QAER,4CAA4C;QAC5C,OAAO,gCAAU;IAClB;IACA,IAAI,CAAC,QAAQ,OAAO;KAAQ,iBAAiB;IAC7C,OAAO,qCAAe;AACvB;;;;ACzHA;;;AAIA,IAAI,8BAAQ,OAAO,SAAS,CAAC,QAAQ;AACrC,IAAI,uCAAiB,OAAO,SAAS,CAAC,cAAc;AAEpD,6KAA6K,GAC7K,IAAI,qCAAe,SAAS,aAAa,KAAK,EAAE,QAAQ,EAAE,QAAQ;IAC9D,IAAK,IAAI,IAAI,GAAG,MAAM,MAAM,MAAM,EAAE,IAAI,KAAK,IACzC,IAAI,qCAAe,IAAI,CAAC,OAAO;QAC3B,IAAI,YAAY,MACZ,SAAS,KAAK,CAAC,EAAE,EAAE,GAAG;aAEtB,SAAS,IAAI,CAAC,UAAU,KAAK,CAAC,EAAE,EAAE,GAAG;;AAIrD;AAEA,uKAAuK,GACvK,IAAI,sCAAgB,SAAS,cAAc,MAAM,EAAE,QAAQ,EAAE,QAAQ;IACjE,IAAK,IAAI,IAAI,GAAG,MAAM,OAAO,MAAM,EAAE,IAAI,KAAK,IAC1C,oCAAoC;IACpC,IAAI,YAAY,MACZ,SAAS,OAAO,MAAM,CAAC,IAAI,GAAG;SAE9B,SAAS,IAAI,CAAC,UAAU,OAAO,MAAM,CAAC,IAAI,GAAG;AAGzD;AAEA,oJAAoJ,GACpJ,IAAI,sCAAgB,SAAS,cAAc,MAAM,EAAE,QAAQ,EAAE,QAAQ;IACjE,IAAK,IAAI,KAAK,OACV,IAAI,qCAAe,IAAI,CAAC,QAAQ;QAC5B,IAAI,YAAY,MACZ,SAAS,MAAM,CAAC,EAAE,EAAE,GAAG;aAEvB,SAAS,IAAI,CAAC,UAAU,MAAM,CAAC,EAAE,EAAE,GAAG;;AAItD;AAEA,oDAAoD,GACpD,SAAS,8BAAQ,CAAC;IACd,OAAO,4BAAM,IAAI,CAAC,OAAO;AAC7B;AAEA,kCAAkC,GAClC,iBAAiB,SAAS,QAAQ,IAAI,EAAE,QAAQ,EAAE,OAAO;IACrD,IAAI,CAAC,OAAW,WACZ,MAAM,IAAI,UAAU;IAGxB,IAAI;IACJ,IAAI,UAAU,MAAM,IAAI,GACpB,WAAW;IAGf,IAAI,8BAAQ,OACR,mCAAa,MAAM,UAAU;SAC1B,IAAI,OAAO,SAAS,UACvB,oCAAc,MAAM,UAAU;SAE9B,oCAAc,MAAM,UAAU;AAEtC;;;;ACpEA;AAEA,IAAI,gCAAU,SAAS,SAAS,CAAC,QAAQ;AACzC,IAAI,qCAAe,OAAO,YAAY,YAAY,YAAY,QAAQ,QAAQ,KAAK;AACnF,IAAI;AACJ,IAAI;AACJ,IAAI,OAAO,uCAAiB,cAAc,OAAO,OAAO,cAAc,KAAK,YAC1E,IAAI;IACH,qCAAe,OAAO,cAAc,CAAC,CAAC,GAAG,UAAU;QAClD,KAAK;YACJ,MAAM;QACP;IACD;IACA,yCAAmB,CAAC;IACpB,4CAA4C;IAC5C,mCAAa;QAAc,MAAM;IAAI,GAAG,MAAM;AAC/C,EAAE,OAAO,GAAG;IACX,IAAI,MAAM,wCACT,qCAAe;AAEjB;KAEA,qCAAe;AAGhB,IAAI,yCAAmB;AACvB,IAAI,qCAAe,SAAS,mBAAmB,KAAK;IACnD,IAAI;QACH,IAAI,QAAQ,8BAAQ,IAAI,CAAC;QACzB,OAAO,uCAAiB,IAAI,CAAC;IAC9B,EAAE,OAAO,GAAG;QACX,OAAO,OAAO,iBAAiB;IAChC;AACD;AAEA,IAAI,0CAAoB,SAAS,iBAAiB,KAAK;IACtD,IAAI;QACH,IAAI,mCAAa,QAAU,OAAO;QAClC,8BAAQ,IAAI,CAAC;QACb,OAAO;IACR,EAAE,OAAO,GAAG;QACX,OAAO;IACR;AACD;AACA,IAAI,8BAAQ,OAAO,SAAS,CAAC,QAAQ;AACrC,IAAI,oCAAc;AAClB,IAAI,gCAAU;AACd,IAAI,iCAAW;AACf,IAAI,iCAAW,8BAA8B,QAAQ;AACrD,IAAI,kCAAY;AAChB,IAAI,kCAAY,2BAA2B,UAAU;AACrD,IAAI,uCAAiB,OAAO,WAAW,cAAc,CAAC,CAAC,OAAO,WAAW,EAAE,gCAAgC;AAE3G,IAAI,+BAAS,CAAE,CAAA,KAAK;;CAAG,AAAD,GAAI,sDAAsD;AAEhF,IAAI,8BAAQ,SAAS;IAAqB,OAAO;AAAO;AACxD,IAAI,OAAO,aAAa,UAAU;IACjC,2EAA2E;IAC3E,IAAI,4BAAM,SAAS,GAAG;IACtB,IAAI,4BAAM,IAAI,CAAC,+BAAS,4BAAM,IAAI,CAAC,SAAS,GAAG,GAC9C,8BAAQ,SAAS,iBAAiB,KAAK;QACtC,2BAA2B,GAC3B,6DAA6D;QAC7D,IAAI,AAAC,CAAA,gCAAU,CAAC,KAAI,KAAO,CAAA,OAAO,UAAU,eAAe,OAAO,UAAU,QAAO,GAClF,IAAI;YACH,IAAI,MAAM,4BAAM,IAAI,CAAC;YACrB,OAAO,AACN,CAAA,QAAQ,kCACL,QAAQ,mCACR,QAAQ,gCAAU,cAAc;gBAChC,QAAQ,kCAAY,SAAS;YAAX,KACjB,MAAM,OAAO,MAAM,6BAA6B;QACtD,EAAE,OAAO,GAAG,CAAO;QAEpB,OAAO;IACR;AAEF;AAEA,iBAAiB,qCACd,SAAS,WAAW,KAAK;IAC1B,IAAI,4BAAM,QAAU,OAAO;IAC3B,IAAI,CAAC,OAAS,OAAO;IACrB,IAAI,OAAO,UAAU,cAAc,OAAO,UAAU,UAAY,OAAO;IACvE,IAAI;QACH,mCAAa,OAAO,MAAM;IAC3B,EAAE,OAAO,GAAG;QACX,IAAI,MAAM,wCAAoB,OAAO;IACtC;IACA,OAAO,CAAC,mCAAa,UAAU,wCAAkB;AAClD,IACE,SAAS,WAAW,KAAK;IAC1B,IAAI,4BAAM,QAAU,OAAO;IAC3B,IAAI,CAAC,OAAS,OAAO;IACrB,IAAI,OAAO,UAAU,cAAc,OAAO,UAAU,UAAY,OAAO;IACvE,IAAI,sCAAkB,OAAO,wCAAkB;IAC/C,IAAI,mCAAa,QAAU,OAAO;IAClC,IAAI,WAAW,4BAAM,IAAI,CAAC;IAC1B,IAAI,aAAa,iCAAW,aAAa,kCAAY,CAAC,AAAC,iBAAkB,IAAI,CAAC,WAAa,OAAO;IAClG,OAAO,wCAAkB;AAC1B;;;;;;ACpGD;;;AAIA,IAAI,0BAAI,OAAO,eAAe,cAAc,iBAAS;AAErD,wBAAwB,GACxB,iBAAiB,SAAS;IACzB,IAAI,oDAAoD,GAAG,MAAM,EAAE;IACnE,IAAK,IAAI,IAAI,GAAG,IAAI,OAAc,MAAM,EAAE,IACzC,IAAI,OAAO,uBAAC,CAAC,MAAa,CAAC,EAAE,CAAC,KAAK,YAClC,mBAAmB;IACnB,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,MAAa,CAAC,EAAE;IAGpC,OAAO;AACR;;;;AChBA;AAEA,wBAAwB,GACxB,iBAAiB;IAChB;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;CACA;;;;;;AChBD;;;;;;;;;AASA,iBAAiB,SAAS,SAAS,gBAAgB;IAClD,IAAI,OAAO,OAAc;IACzB,IAAI,iBAAiB,iBAAiB,MAAM,GAAI,CAAA,UAAU,MAAM,GAAG,CAAA;IACnE,OAAO,OACN,MACA,IAAK,CAAA,iBAAiB,IAAI,iBAAiB,CAAA,GAC3C;AAEF;AAEA,IAAI,QACH,OAAgB,gBAAgB,SAAS;IAAE,OAAO;AAAU;KAE5D,eAAe,KAAK,GAAG;;;;ACtBxB;;;;;;AAIA,IAAI,uCAAiB;;;;;AAIrB,IAAI,+BAAS,OAAa;AAE1B,wBAAwB,GACxB,iBAAiB,SAAS,kBAAkB,EAAE,EAAE,MAAM;IACrD,IAAI,OAAO,OAAO,YACjB,MAAM,IAAI,OAAW;IAEtB,IAAI,OAAO,WAAW,YAAY,SAAS,KAAK,SAAS,cAAc,6BAAO,YAAY,QACzF,MAAM,IAAI,OAAW;IAGtB,IAAI,QAAQ,UAAU,MAAM,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,EAAE;IAElD,IAAI,+BAA+B;IACnC,IAAI,2BAA2B;IAC/B,IAAI,YAAY,MAAM,QAAM;QAC3B,IAAI,OAAO,OAAK,IAAI;QACpB,IAAI,QAAQ,CAAC,KAAK,YAAY,EAC7B,+BAA+B;QAEhC,IAAI,QAAQ,CAAC,KAAK,QAAQ,EACzB,2BAA2B;IAE7B;IAEA,IAAI,gCAAgC,4BAA4B,CAAC;QAChE,IAAI,sCACH,OAAO,kCAAkC,GAAI,IAAK,UAAU,QAAQ,MAAM;aAE1E,OAAO,kCAAkC,GAAI,IAAK,UAAU;;IAG9D,OAAO;AACR;;;;ACzCA;;;;;;;;;AASA,wBAAwB,GACxB,iBAAiB,SAAS,mBACzB,GAAG,EACH,QAAQ,EACR,KAAK;IAEL,IAAI,CAAC,OAAQ,OAAO,QAAQ,YAAY,OAAO,QAAQ,YACtD,MAAM,IAAI,OAAW;IAEtB,IAAI,OAAO,aAAa,YAAY,OAAO,aAAa,UACvD,MAAM,IAAI,OAAW;IAEtB,IAAI,UAAU,MAAM,GAAG,KAAK,OAAO,SAAS,CAAC,EAAE,KAAK,aAAa,SAAS,CAAC,EAAE,KAAK,MACjF,MAAM,IAAI,OAAW;IAEtB,IAAI,UAAU,MAAM,GAAG,KAAK,OAAO,SAAS,CAAC,EAAE,KAAK,aAAa,SAAS,CAAC,EAAE,KAAK,MACjF,MAAM,IAAI,OAAW;IAEtB,IAAI,UAAU,MAAM,GAAG,KAAK,OAAO,SAAS,CAAC,EAAE,KAAK,aAAa,SAAS,CAAC,EAAE,KAAK,MACjF,MAAM,IAAI,OAAW;IAEtB,IAAI,UAAU,MAAM,GAAG,KAAK,OAAO,SAAS,CAAC,EAAE,KAAK,WACnD,MAAM,IAAI,OAAW;IAGtB,IAAI,gBAAgB,UAAU,MAAM,GAAG,IAAI,SAAS,CAAC,EAAE,GAAG;IAC1D,IAAI,cAAc,UAAU,MAAM,GAAG,IAAI,SAAS,CAAC,EAAE,GAAG;IACxD,IAAI,kBAAkB,UAAU,MAAM,GAAG,IAAI,SAAS,CAAC,EAAE,GAAG;IAC5D,IAAI,QAAQ,UAAU,MAAM,GAAG,IAAI,SAAS,CAAC,EAAE,GAAG;IAElD,oDAAoD,GACpD,IAAI,OAAO,CAAC,CAAC,UAAQ,OAAK,KAAK;IAE/B,IAAI,QACH,OAAgB,KAAK,UAAU;QAC9B,cAAc,oBAAoB,QAAQ,OAAO,KAAK,YAAY,GAAG,CAAC;QACtE,YAAY,kBAAkB,QAAQ,OAAO,KAAK,UAAU,GAAG,CAAC;QAChE,OAAO;QACP,UAAU,gBAAgB,QAAQ,OAAO,KAAK,QAAQ,GAAG,CAAC;IAC3D;SACM,IAAI,SAAU,CAAC,iBAAiB,CAAC,eAAe,CAAC,iBACvD,oHAAoH;IACpH,GAAG,CAAC,SAAS,GAAG,OAAO,wCAAwC;SAE/D,MAAM,IAAI,OAAa;AAEzB;;;;;;ACvDA;;;;;;;AAMA,kCAAkC,GAClC,iBAAiB,SAAS;IACzB,OAAO,OAAY,QAAM,QAAQ;AAClC;;;;;;;;;;;;ACTA;;;;;;;uCAaI;AAEJ,IAAI,0BAAI;IACP;IAAY;IAAY;IAAgB;CACxC;AAED,IAAI,0BAAI,IAAI,MAAM;AAElB,SAAS;IACR,IAAI,CAAC,IAAI;IACT,IAAI,CAAC,EAAE,GAAG;IAEV,OAAK,IAAI,CAAC,IAAI,EAAE,IAAI;AACrB;AAEA,OAAS,4BAAM;AAEf,2BAAK,SAAS,CAAC,IAAI,GAAG;IACrB,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IAEV,OAAO,IAAI;AACZ;AAEA,SAAS,4BAAM,GAAG;IACjB,OAAO,AAAC,OAAO,IAAM,QAAQ;AAC9B;AAEA,SAAS,4BAAM,GAAG;IACjB,OAAO,AAAC,OAAO,IAAM,QAAQ;AAC9B;AAEA,SAAS,6BAAO,GAAG;IAClB,OAAO,AAAC,OAAO,KAAO,QAAQ;AAC/B;AAEA,SAAS,yBAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACrB,IAAI,MAAM,GACT,OAAO,AAAC,IAAI,IAAM,CAAC,IAAI;IAExB,IAAI,MAAM,GACT,OAAO,AAAC,IAAI,IAAM,IAAI,IAAM,IAAI;IAEjC,OAAO,IAAI,IAAI;AAChB;AAEA,2BAAK,SAAS,CAAC,OAAO,GAAG,SAAU,CAAC;IACnC,IAAI,IAAI,IAAI,CAAC,EAAE;IAEf,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAElB,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACzB,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,IAAI;IAE1B,MAAO,IAAI,IAAI,EAAE,EAChB,CAAC,CAAC,EAAE,GAAG,4BAAM,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG;IAGzD,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EAAG;QAC5B,IAAI,IAAI,CAAC,CAAE,CAAA,IAAI,EAAC;QAChB,IAAI,IAAI,AAAC,4BAAM,KAAK,yBAAG,GAAG,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,EAAE,GAAG,uBAAC,CAAC,EAAE,GAAI;QAExD,IAAI;QACJ,IAAI;QACJ,IAAI,6BAAO;QACX,IAAI;QACJ,IAAI;IACL;IAEA,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;AAC3B;AAEA,2BAAK,SAAS,CAAC,KAAK,GAAG;IACtB,IAAI,IAAI,iCAAO,WAAW,CAAC;IAE3B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG;IAC5B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG;IAC5B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG;IAC5B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG;IAC5B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG;IAE5B,OAAO;AACR;AAEA,iBAAiB;;;;;AC5GjB;;;;;;;;;uCAaI;AAEJ,IAAI,0BAAI,IAAI,MAAM;AAElB,SAAS;IACR,IAAI,CAAC,IAAI;IAET,IAAI,CAAC,EAAE,GAAG,yBAAG,gBAAgB;IAE7B,YAAU,IAAI,EAAE,IAAI;AACrB;AAEA,OAAS,8BAAQ;AAEjB,6BAAO,SAAS,CAAC,IAAI,GAAG;IACvB,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IAEV,OAAO,IAAI;AACZ;AAEA,6BAAO,SAAS,CAAC,KAAK,GAAG;IACxB,IAAI,IAAI,iCAAO,WAAW,CAAC;IAE3B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAExB,OAAO;AACR;AAEA,iBAAiB;;;;ACtDjB;;;;;;;uCAYI;AAEJ,IAAI,0BAAI;IACP;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;CACA;AAED,IAAI,0BAAI,IAAI,MAAM;AAElB,SAAS;IACR,IAAI,CAAC,IAAI;IAET,IAAI,CAAC,EAAE,GAAG,yBAAG,gBAAgB;IAE7B,OAAK,IAAI,CAAC,IAAI,EAAE,IAAI;AACrB;AAEA,OAAS,8BAAQ;AAEjB,6BAAO,SAAS,CAAC,IAAI,GAAG;IACvB,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IAEV,OAAO,IAAI;AACZ;AAEA,SAAS,yBAAG,CAAC,EAAE,CAAC,EAAE,CAAC;IAClB,OAAO,IAAK,IAAK,CAAA,IAAI,CAAA;AACtB;AAEA,SAAS,0BAAI,CAAC,EAAE,CAAC,EAAE,CAAC;IACnB,OAAO,AAAC,IAAI,IAAM,IAAK,CAAA,IAAI,CAAA;AAC5B;AAEA,SAAS,6BAAO,CAAC;IAChB,OAAO,AAAC,CAAA,AAAC,MAAM,IAAM,KAAK,EAAE,IAAM,CAAA,AAAC,MAAM,KAAO,KAAK,EAAE,IAAM,CAAA,AAAC,MAAM,KAAO,KAAK,EAAE;AACnF;AAEA,SAAS,6BAAO,CAAC;IAChB,OAAO,AAAC,CAAA,AAAC,MAAM,IAAM,KAAK,EAAE,IAAM,CAAA,AAAC,MAAM,KAAO,KAAK,EAAE,IAAM,CAAA,AAAC,MAAM,KAAO,KAAK,CAAC;AAClF;AAEA,SAAS,6BAAO,CAAC;IAChB,OAAO,AAAC,CAAA,AAAC,MAAM,IAAM,KAAK,EAAE,IAAM,CAAA,AAAC,MAAM,KAAO,KAAK,EAAE,IAAM,MAAM;AACpE;AAEA,SAAS,6BAAO,CAAC;IAChB,OAAO,AAAC,CAAA,AAAC,MAAM,KAAO,KAAK,EAAE,IAAM,CAAA,AAAC,MAAM,KAAO,KAAK,EAAE,IAAM,MAAM;AACrE;AAEA,6BAAO,SAAS,CAAC,OAAO,GAAG,SAAU,CAAC;IACrC,IAAI,IAAI,IAAI,CAAC,EAAE;IAEf,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAClB,IAAI,IAAI,IAAI,CAAC,EAAE,GAAG;IAElB,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACzB,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,IAAI;IAE1B,MAAO,IAAI,IAAI,EAAE,EAChB,CAAC,CAAC,EAAE,GAAG,AAAC,6BAAO,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,6BAAO,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,IAAI,GAAG,GAAI;IAGxE,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EAAG;QAC5B,IAAI,KAAK,AAAC,IAAI,6BAAO,KAAK,yBAAG,GAAG,GAAG,KAAK,uBAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAI;QACvD,IAAI,KAAK,AAAC,6BAAO,KAAK,0BAAI,GAAG,GAAG,KAAM;QAEtC,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI,AAAC,IAAI,KAAM;QACf,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI,AAAC,KAAK,KAAM;IACjB;IAEA,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,IAAI,CAAC,EAAE,GAAI;AAC3B;AAEA,6BAAO,SAAS,CAAC,KAAK,GAAG;IACxB,IAAI,IAAI,iCAAO,WAAW,CAAC;IAE3B,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IACxB,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAExB,OAAO;AACR;AAEA,iBAAiB;;;;;;AC5LjB;;;;;;;;;uCAKI;AAEJ,IAAI,0BAAI,IAAI,MAAM;AAElB,SAAS;IACR,IAAI,CAAC,IAAI;IACT,IAAI,CAAC,EAAE,GAAG;IAEV,YAAU,IAAI,EAAE,KAAK;AACtB;AAEA,OAAS,8BAAQ;AAEjB,6BAAO,SAAS,CAAC,IAAI,GAAG;IACvB,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IAEX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IAEX,OAAO,IAAI;AACZ;AAEA,6BAAO,SAAS,CAAC,KAAK,GAAG;IACxB,IAAI,IAAI,iCAAO,WAAW,CAAC;IAE3B,SAAS,aAAa,CAAC,EAAE,CAAC,EAAE,MAAM;QACjC,EAAE,YAAY,CAAC,GAAG;QAClB,EAAE,YAAY,CAAC,GAAG,SAAS;IAC5B;IAEA,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IAEjC,OAAO;AACR;AAEA,iBAAiB;;;;AC1DjB;;;;;;;uCAII;AAEJ,IAAI,0BAAI;IACP;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;CACA;AAED,IAAI,0BAAI,IAAI,MAAM;AAElB,SAAS;IACR,IAAI,CAAC,IAAI;IACT,IAAI,CAAC,EAAE,GAAG;IAEV,OAAK,IAAI,CAAC,IAAI,EAAE,KAAK;AACtB;AAEA,OAAS,8BAAQ;AAEjB,6BAAO,SAAS,CAAC,IAAI,GAAG;IACvB,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IAEX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IACX,IAAI,CAAC,GAAG,GAAG;IAEX,OAAO,IAAI;AACZ;AAEA,SAAS,yBAAG,CAAC,EAAE,CAAC,EAAE,CAAC;IAClB,OAAO,IAAK,IAAK,CAAA,IAAI,CAAA;AACtB;AAEA,SAAS,0BAAI,CAAC,EAAE,CAAC,EAAE,CAAC;IACnB,OAAO,AAAC,IAAI,IAAM,IAAK,CAAA,IAAI,CAAA;AAC5B;AAEA,SAAS,6BAAO,CAAC,EAAE,EAAE;IACpB,OAAO,AAAC,CAAA,AAAC,MAAM,KAAO,MAAM,CAAC,IAAM,CAAA,AAAC,OAAO,IAAM,KAAK,EAAE,IAAM,CAAA,AAAC,OAAO,IAAM,KAAK,EAAE;AACpF;AAEA,SAAS,6BAAO,CAAC,EAAE,EAAE;IACpB,OAAO,AAAC,CAAA,AAAC,MAAM,KAAO,MAAM,EAAE,IAAM,CAAA,AAAC,MAAM,KAAO,MAAM,EAAE,IAAM,CAAA,AAAC,OAAO,IAAM,KAAK,EAAE;AACtF;AAEA,SAAS,6BAAO,CAAC,EAAE,EAAE;IACpB,OAAO,AAAC,CAAA,AAAC,MAAM,IAAM,MAAM,EAAE,IAAM,CAAA,AAAC,MAAM,IAAM,MAAM,EAAE,IAAM,MAAM;AACrE;AAEA,SAAS,8BAAQ,CAAC,EAAE,EAAE;IACrB,OAAO,AAAC,CAAA,AAAC,MAAM,IAAM,MAAM,EAAE,IAAM,CAAA,AAAC,MAAM,IAAM,MAAM,EAAE,IAAM,CAAA,AAAC,MAAM,IAAM,MAAM,EAAE;AACpF;AAEA,SAAS,6BAAO,CAAC,EAAE,EAAE;IACpB,OAAO,AAAC,CAAA,AAAC,MAAM,KAAO,MAAM,EAAE,IAAM,CAAA,AAAC,OAAO,KAAO,KAAK,CAAC,IAAM,MAAM;AACtE;AAEA,SAAS,8BAAQ,CAAC,EAAE,EAAE;IACrB,OAAO,AAAC,CAAA,AAAC,MAAM,KAAO,MAAM,EAAE,IAAM,CAAA,AAAC,OAAO,KAAO,KAAK,CAAC,IAAM,CAAA,AAAC,MAAM,IAAM,MAAM,EAAE;AACrF;AAEA,SAAS,+BAAS,CAAC,EAAE,CAAC;IACrB,OAAO,AAAC,MAAM,IAAM,MAAM,IAAK,IAAI;AACpC;AAEA,6BAAO,SAAS,CAAC,OAAO,GAAG,SAAU,CAAC;IACrC,IAAI,IAAI,IAAI,CAAC,EAAE;IAEf,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IAEpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IACpB,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG;IAEpB,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,EAAG;QAC/B,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,IAAI;QACzB,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,AAAC,IAAI,IAAK;IACpC;IACA,MAAO,IAAI,KAAK,KAAK,EAAG;QACvB,IAAI,KAAK,CAAC,CAAC,IAAK,GAAQ;QACxB,IAAI,KAAK,CAAC,CAAC,IAAK,KAAU,EAAE;QAC5B,IAAI,SAAS,6BAAO,IAAI;QACxB,IAAI,UAAU,8BAAQ,IAAI;QAE1B,KAAK,CAAC,CAAC,IAAK,EAAO;QACnB,KAAK,CAAC,CAAC,IAAK,IAAS,EAAE;QACvB,IAAI,SAAS,6BAAO,IAAI;QACxB,IAAI,UAAU,8BAAQ,IAAI;QAE1B,gDAAgD;QAChD,IAAI,OAAO,CAAC,CAAC,IAAK,GAAO;QACzB,IAAI,OAAO,CAAC,CAAC,IAAK,KAAS,EAAE;QAE7B,IAAI,QAAQ,CAAC,CAAC,IAAK,GAAQ;QAC3B,IAAI,QAAQ,CAAC,CAAC,IAAK,KAAU,EAAE;QAE/B,IAAI,MAAM,AAAC,UAAU,OAAQ;QAC7B,IAAI,MAAM,AAAC,SAAS,OAAO,+BAAS,KAAK,WAAY;QACrD,MAAM,AAAC,MAAM,UAAW;QACxB,MAAM,AAAC,MAAM,SAAS,+BAAS,KAAK,WAAY;QAChD,MAAM,AAAC,MAAM,QAAS;QACtB,MAAM,AAAC,MAAM,QAAQ,+BAAS,KAAK,SAAU;QAE7C,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,IAAI,EAAE,GAAG;IACZ;IAEA,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK,EAAG;QAChC,MAAM,CAAC,CAAC,EAAE;QACV,MAAM,CAAC,CAAC,IAAI,EAAE;QAEd,IAAI,OAAO,0BAAI,IAAI,IAAI;QACvB,IAAI,OAAO,0BAAI,IAAI,IAAI;QAEvB,IAAI,UAAU,6BAAO,IAAI;QACzB,IAAI,UAAU,6BAAO,IAAI;QACzB,IAAI,UAAU,6BAAO,IAAI;QACzB,IAAI,UAAU,6BAAO,IAAI;QAEzB,qCAAqC;QACrC,IAAI,MAAM,uBAAC,CAAC,EAAE;QACd,IAAI,MAAM,uBAAC,CAAC,IAAI,EAAE;QAElB,IAAI,MAAM,yBAAG,IAAI,IAAI;QACrB,IAAI,MAAM,yBAAG,IAAI,IAAI;QAErB,IAAI,MAAM,AAAC,KAAK,UAAW;QAC3B,IAAI,MAAM,AAAC,KAAK,UAAU,+BAAS,KAAK,MAAO;QAC/C,MAAM,AAAC,MAAM,MAAO;QACpB,MAAM,AAAC,MAAM,MAAM,+BAAS,KAAK,OAAQ;QACzC,MAAM,AAAC,MAAM,MAAO;QACpB,MAAM,AAAC,MAAM,MAAM,+BAAS,KAAK,OAAQ;QACzC,MAAM,AAAC,MAAM,MAAO;QACpB,MAAM,AAAC,MAAM,MAAM,+BAAS,KAAK,OAAQ;QAEzC,oBAAoB;QACpB,IAAI,MAAM,AAAC,UAAU,OAAQ;QAC7B,IAAI,MAAM,AAAC,UAAU,OAAO,+BAAS,KAAK,WAAY;QAEtD,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK,AAAC,KAAK,MAAO;QAClB,KAAK,AAAC,KAAK,MAAM,+BAAS,IAAI,MAAO;QACrC,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK,AAAC,MAAM,MAAO;QACnB,KAAK,AAAC,MAAM,MAAM,+BAAS,IAAI,OAAQ;IACxC;IAEA,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAM;IAC7B,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAM;IAC7B,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAM;IAC7B,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAM;IAC7B,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAM;IAC7B,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAM;IAC7B,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAM;IAC7B,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAM;IAE7B,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAK,+BAAS,IAAI,CAAC,GAAG,EAAE,MAAO;IACtD,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAK,+BAAS,IAAI,CAAC,GAAG,EAAE,MAAO;IACtD,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAK,+BAAS,IAAI,CAAC,GAAG,EAAE,MAAO;IACtD,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAK,+BAAS,IAAI,CAAC,GAAG,EAAE,MAAO;IACtD,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAK,+BAAS,IAAI,CAAC,GAAG,EAAE,MAAO;IACtD,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAK,+BAAS,IAAI,CAAC,GAAG,EAAE,MAAO;IACtD,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAK,+BAAS,IAAI,CAAC,GAAG,EAAE,MAAO;IACtD,IAAI,CAAC,GAAG,GAAG,AAAC,IAAI,CAAC,GAAG,GAAG,KAAK,+BAAS,IAAI,CAAC,GAAG,EAAE,MAAO;AACvD;AAEA,6BAAO,SAAS,CAAC,KAAK,GAAG;IACxB,IAAI,IAAI,iCAAO,WAAW,CAAC;IAE3B,SAAS,aAAa,CAAC,EAAE,CAAC,EAAE,MAAM;QACjC,EAAE,YAAY,CAAC,GAAG;QAClB,EAAE,YAAY,CAAC,GAAG,SAAS;IAC5B;IAEA,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IACjC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;IAEjC,OAAO;AACR;AAEA,iBAAiB;;;;;;AC7XjB;;;;;;;AAKA,SAAS,0CAAqB,KAAK,EAAE,YAAY;IAC/C,IAAI,UAAU,WAAW,OAAO;IAEhC,iBAAiB,OAAO;IACxB,OAAO;AACT;AAEA,iBAAiB,SAAU,SAAS;IAClC,OAAO;QACL,kBAAkB,SAAU,UAAU;YACpC,gBAAgB,YAAY;YAC5B,OAAO,WAAW,MAAM,KAAK,MAAM,UAAU,gBAAgB,CAAC;QAChE;QAEA,kBAAkB,SAAU,UAAU,EAAE,UAAU;YAChD,gBAAgB,YAAY;YAC5B,sBAAsB,YAAY,IAAI;YAEtC,aAAa,0CAAoB,YAAY;YAC7C,IAAI,YAAY,UAAU,gBAAgB,CAAC,YAAY;YAEvD,OAAO,wBAAqB,YAAY,WAAW;QACrD;QAEA,kBAAkB,SAAU,UAAU;YACpC,gBAAgB,YAAY;YAE5B,aAAa,wBAAqB;YAClC,IAAI,cAAc,WAAW,MAAM,KAAK,MAAM,UAAU,gBAAgB,CAAC,aAAa,OAAO;YAE7F,MAAM,IAAI,MAAM;QAClB;QAEA,kBAAkB,SAAU,UAAU;YACpC,gBAAgB,YAAY;YAC5B,sBAAsB,YAAY,IAAI;YAEtC,OAAO,UAAU,gBAAgB,CAAC;QACpC;QAEA,sBAAsB,SAAU,UAAU;YACxC,gBAAgB,YAAY;YAC5B,sBAAsB,YAAY,IAAI;YAEtC,OAAO,UAAU,oBAAoB,CAAC;QACxC;QAEA,oBAAoB,SAAU,UAAU,EAAE,KAAK;YAC7C,gBAAgB,YAAY;YAC5B,sBAAsB,YAAY,IAAI;YAEtC,gBAAgB,OAAO;YACvB,sBAAsB,OAAO,IAAI;YAEjC,OAAO,UAAU,kBAAkB,CAAC,YAAY;QAClD;QAEA,oBAAoB,SAAU,UAAU,EAAE,KAAK;YAC7C,gBAAgB,YAAY;YAC5B,sBAAsB,YAAY,IAAI;YAEtC,gBAAgB,OAAO;YACvB,sBAAsB,OAAO,IAAI;YAEjC,OAAO,UAAU,kBAAkB,CAAC,YAAY;QAClD;QAEA,iBAAiB,SAAU,UAAU,EAAE,UAAU;YAC/C,gBAAgB,YAAY;YAC5B,sBAAsB,YAAY,IAAI;YAEtC,aAAa,0CAAoB,YAAY;YAE7C,OAAO,UAAU,eAAe,CAAC,YAAY;QAC/C;QAEA,kBAAkB,SAAU,SAAS,EAAE,UAAU;YAC/C,gBAAgB,WAAW;YAC3B,uBAAuB,WAAW,IAAI,IAAI;YAE1C,aAAa,0CAAoB,YAAY;YAE7C,OAAO,UAAU,gBAAgB,CAAC,WAAW;QAC/C;QAEA,iBAAiB,SAAU,SAAS;YAClC,gBAAgB,WAAW;YAC3B,OAAO,UAAU,eAAe,CAAC;QACnC;QAEA,mBAAmB,SAAU,SAAS,EAAE,KAAK,EAAE,UAAU;YACvD,gBAAgB,WAAW;YAC3B,uBAAuB,WAAW,IAAI,IAAI;YAE1C,gBAAgB,OAAO;YACvB,sBAAsB,OAAO,IAAI;YAEjC,aAAa,0CAAoB,YAAY;YAE7C,OAAO,UAAU,iBAAiB,CAAC,WAAW,OAAO;QACvD;QAEA,mBAAmB,SAAU,SAAS,EAAE,KAAK,EAAE,UAAU;YACvD,gBAAgB,WAAW;YAC3B,uBAAuB,WAAW,IAAI,IAAI;YAE1C,gBAAgB,OAAO;YACvB,sBAAsB,OAAO,IAAI;YAEjC,aAAa,0CAAoB,YAAY;YAE7C,OAAO,UAAU,iBAAiB,CAAC,WAAW,OAAO;QACvD;QAEA,kBAAkB,SAAU,UAAU,EAAE,UAAU;YAChD,eAAe,YAAY;YAC3B,sBAAsB,YAAY;YAClC,IAAK,IAAI,IAAI,GAAG,IAAI,WAAW,MAAM,EAAE,EAAE,EAAG;gBAC1C,gBAAgB,UAAU,CAAC,EAAE,EAAE;gBAC/B,uBAAuB,UAAU,CAAC,EAAE,EAAE,IAAI,IAAI;YAChD;YAEA,aAAa,0CAAoB,YAAY;YAE7C,OAAO,UAAU,gBAAgB,CAAC,YAAY;QAChD;QAEA,oBAAoB,SAAU,SAAS;YACrC,gBAAgB,WAAW;YAC3B,sBAAsB,WAAW,IAAI;YAErC,OAAO,UAAU,kBAAkB,CAAC;QACtC;QAEA,iBAAiB,SAAU,SAAS;YAClC,gBAAgB,WAAW;YAC3B,sBAAsB,WAAW,IAAI;YAErC,IAAI,SAAS,UAAU,eAAe,CAAC;YACvC,OAAO,uBAAoB;QAC7B;QAEA,iBAAiB,SAAU,GAAG;YAC5B,gBAAgB,KAAK;YACrB,sBAAsB,KAAK;YAE3B,IAAI,SAAS,uBAAoB;YACjC,IAAI,QAAQ,OAAO,UAAU,eAAe,CAAC;YAE7C,MAAM,IAAI,MAAM;QAClB;QAEA,oBAAoB,SAAU,GAAG;YAC/B,gBAAgB,KAAK;YACrB,sBAAsB,KAAK;YAE3B,IAAI,SAAS,0BAAuB;YACpC,IAAI,QAAQ,OAAO,UAAU,eAAe,CAAC;YAE7C,MAAM,IAAI,MAAM;QAClB;QAEA,MAAM,SAAU,OAAO,EAAE,UAAU,EAAE,OAAO;YAC1C,gBAAgB,SAAS;YACzB,sBAAsB,SAAS,IAAI;YAEnC,gBAAgB,YAAY;YAC5B,sBAAsB,YAAY,IAAI;YAEtC,IAAI,OAAO;YACX,IAAI,UAAU;YACd,IAAI,YAAY,WAAW;gBACzB,gBAAgB,SAAS;gBAEzB,IAAI,QAAQ,IAAI,KAAK,WAAW;oBAC9B,gBAAgB,QAAQ,IAAI,EAAE;oBAC9B,sBAAsB,QAAQ,IAAI,EAAE,IAAI;oBACxC,OAAO,QAAQ,IAAI;gBACrB;gBAEA,IAAI,QAAQ,OAAO,KAAK,WAAW;oBACjC,kBAAkB,QAAQ,OAAO,EAAE;oBACnC,UAAU,QAAQ,OAAO;gBAC3B;YACF;YAEA,OAAO,UAAU,IAAI,CAAC,SAAS,YAAY,SAAS;QACtD;QAEA,QAAQ,SAAU,OAAO,EAAE,SAAS,EAAE,SAAS;YAC7C,gBAAgB,SAAS;YACzB,sBAAsB,SAAS,IAAI;YAEnC,gBAAgB,WAAW;YAC3B,sBAAsB,WAAW,IAAI;YAErC,gBAAgB,WAAW;YAC3B,uBAAuB,WAAW,IAAI,IAAI;YAE1C,OAAO,UAAU,MAAM,CAAC,SAAS,WAAW;QAC9C;QAEA,SAAS,SAAU,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU;YACzD,gBAAgB,SAAS;YACzB,sBAAsB,SAAS,IAAI;YAEnC,gBAAgB,WAAW;YAC3B,sBAAsB,WAAW,IAAI;YAErC,gBAAgB,UAAU;YAC1B,0BAA0B,UAAU,IAAI,GAAG;YAE3C,aAAa,0CAAoB,YAAY;YAE7C,OAAO,UAAU,OAAO,CAAC,SAAS,WAAW,UAAU;QACzD;QAEA,MAAM,SAAU,SAAS,EAAE,UAAU;YACnC,gBAAgB,WAAW;YAC3B,uBAAuB,WAAW,IAAI,IAAI;YAE1C,gBAAgB,YAAY;YAC5B,sBAAsB,YAAY,IAAI;YAEtC,OAAO,UAAU,IAAI,CAAC,WAAW;QACnC;QAEA,YAAY,SAAU,SAAS,EAAE,UAAU,EAAE,UAAU;YACrD,gBAAgB,WAAW;YAC3B,uBAAuB,WAAW,IAAI,IAAI;YAE1C,gBAAgB,YAAY;YAC5B,sBAAsB,YAAY,IAAI;YAEtC,aAAa,0CAAoB,YAAY;YAE7C,OAAO,UAAU,UAAU,CAAC,WAAW,YAAY;QACrD;IACF;AACF;;;;;;;;;;;;;;;ACjPA,YAAY;AACZ,IAAA;AAIA,IAAA;AAIA,IAAA;AAIA,IAAA;AAIA,IAAA;AAIA,IAAA;AAIA,aAAa;AACb,IAAA;AAIA,IAAA;AAIA,IAAA;AAIA,IAAA;AAzCA;AACA,IAAI,iCAAW,OAAO,SAAS,CAAC,QAAQ;AAGxC,4CAAkB,SAAU,KAAK,EAAE,OAAO;IACxC,IAAI,CAAC,MAAM,OAAO,CAAC,QAAQ,MAAM,UAAU;AAC7C;AAEA,4CAAoB,SAAU,KAAK,EAAE,OAAO;IAC1C,IAAI,+BAAS,IAAI,CAAC,WAAW,oBAAoB,MAAM,UAAU;AACnE;AAEA,4CAAmB,SAAU,KAAK,EAAE,OAAO;IACzC,IAAI,CAAC,OAAO,QAAQ,CAAC,QAAQ,MAAM,UAAU;AAC/C;AAEA,4CAAqB,SAAU,KAAK,EAAE,OAAO;IAC3C,IAAI,+BAAS,IAAI,CAAC,WAAW,qBAAqB,MAAM,UAAU;AACpE;AAEA,4CAAmB,SAAU,KAAK,EAAE,OAAO;IACzC,IAAI,+BAAS,IAAI,CAAC,WAAW,mBAAmB,MAAM,UAAU;AAClE;AAEA,4CAAmB,SAAU,KAAK,EAAE,OAAO;IACzC,IAAI,+BAAS,IAAI,CAAC,WAAW,mBAAmB,MAAM,UAAU;AAClE;AAGA,4CAAyB,SAAU,MAAM,EAAE,MAAM,EAAE,OAAO;IACxD,IAAI,OAAO,MAAM,KAAK,QAAQ,MAAM,WAAW;AACjD;AAEA,4CAA0B,SAAU,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO;IACnE,IAAI,OAAO,MAAM,KAAK,WAAW,OAAO,MAAM,KAAK,SAAS,MAAM,WAAW;AAC/E;AAEA,2CAAyB,SAAU,KAAK,EAAE,OAAO;IAC/C,IAAI,MAAM,MAAM,KAAK,GAAG,MAAM,WAAW;AAC3C;AAEA,4CAA6B,SAAU,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO;IAC1D,IAAI,UAAU,KAAK,UAAU,GAAG,MAAM,WAAW;AACnD;;;;;;;;;;;ACSA,IAAA;AAOA,IAAA;AAyCA,IAAA;AAUA,IAAA;AAoBA,IAAA;AAlIA;;;uCACI;;;AAGJ,IAAI,yDAAmC,iCAAO,IAAI,CAAC;IACjD,QAAQ;IACR;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1C,cAAc;IACd;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F,SAAS;IACT;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IACxE,aAAa;IACb;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;CACD;AAED,IAAI,2DAAqC,iCAAO,IAAI,CAAC;IACnD,QAAQ;IACR;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAChD,cAAc;IACd;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F,SAAS;IACT;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IACxE,aAAa;IACb;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAAM;IAC1F;CACD;AAED,4CAA2B,SAAU,UAAU,EAAE,SAAS,EAAE,UAAU;IACpE,IAAI,SAAS,iCAAO,IAAI,CAAC,aAAa,yDAAmC;IACzE,WAAW,IAAI,CAAC,QAAQ,aAAa,IAAI;IACzC,UAAU,IAAI,CAAC,QAAQ,aAAa,MAAM;IAC1C,OAAO;AACT;AAEA,4CAA2B,SAAU,UAAU;IAC7C,IAAI,SAAS,WAAW,MAAM;IAE9B,kBAAkB;IAClB,IAAI,QAAQ;IACZ,IAAI,SAAS,QAAQ,KAAK,UAAU,CAAC,MAAM,KAAK,MAAM;IACtD,SAAS;IAET,8BAA8B;IAC9B,IAAI,SAAS,QAAQ,KAAK,CAAE,CAAA,UAAU,CAAC,MAAM,GAAG,IAAG,GAAI;IAEvD,IAAI,OAAO,UAAU,CAAC,MAAM,GAAG;IAC/B,SAAS;IACT,IAAI,OAAO,KAAK,OAAO,GAAG;IAC1B,IAAI,SAAS,QAAQ,MAAM;IAE3B,kBAAkB;IAClB,IAAI,MAAM,UAAU,CAAC,QAAQ,OAAO,EAAE,GAAI,CAAA,OAAO,IAAI,UAAU,CAAC,QAAQ,OAAO,EAAE,IAAI,IAAI,CAAA;IACzF,SAAS;IACT,IAAI,SAAS,QAAQ,KAAK;IAE1B,0CAA0C;IAC1C,IAAI,SAAS,QAAQ,KACjB,UAAU,CAAC,MAAM,KAAK,QACtB,UAAU,CAAC,QAAQ,EAAE,KAAK,QAC1B,UAAU,CAAC,QAAQ,EAAE,KAAK,MAC5B;IAEF,SAAS;IAET,mDAAmD;IACnD,IAAI,SAAS,QAAQ,KACjB,UAAU,CAAC,MAAM,KAAK,QACtB,UAAU,CAAC,QAAQ,EAAE,GAAG,QACxB,SAAS,QAAQ,IAAI,UAAU,CAAC,QAAQ,EAAE,EAC5C;IAGF,OAAO,WAAW,KAAK,CAAC,QAAQ,GAAG,QAAQ,IAAI,UAAU,CAAC,QAAQ,EAAE;AACtE;AAEA,4CAA0B,SAAU,MAAM;IACxC,IAAI,IAAI,iCAAO,MAAM,CAAC;QAAC,iCAAO,IAAI,CAAC;YAAC;SAAE;QAAG,OAAO,CAAC;KAAC;IAClD,IAAK,IAAI,OAAO,IAAI,OAAO,GAAG,OAAO,KAAK,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAE,CAAA,CAAC,CAAC,OAAO,EAAE,GAAG,IAAG,GAAI,EAAE,MAAM,EAAE;IAE/F,IAAI,IAAI,iCAAO,MAAM,CAAC;QAAC,iCAAO,IAAI,CAAC;YAAC;SAAE;QAAG,OAAO,CAAC;KAAC;IAClD,IAAK,IAAI,OAAO,IAAI,OAAO,GAAG,OAAO,KAAK,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAE,CAAA,CAAC,CAAC,OAAO,EAAE,GAAG,IAAG,GAAI,EAAE,MAAM,EAAE;IAE/F,OAAO,cAAa,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC;AAC7C;AAEA,4CAA0B,SAAU,GAAG;IACrC,IAAI,IAAI,iCAAO,KAAK,CAAC,IAAI;IACzB,IAAI,IAAI,iCAAO,KAAK,CAAC,IAAI;IAEzB,IAAI;QACF,IAAI,SAAS,cAAa;QAC1B,IAAI,OAAO,CAAC,CAAC,MAAM,KAAK,MAAM,OAAO,CAAC,CAAC,EAAE,KAAK,MAAM,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,CAAC;QAC9E,IAAI,OAAO,CAAC,CAAC,MAAM,GAAG,IAAI,MAAM,IAAI,MAAM;QAC1C,IAAI,OAAO,CAAC,CAAC,MAAM,KAAK,MAAM,OAAO,CAAC,CAAC,EAAE,KAAK,MAAM,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,CAAC;QAC9E,IAAI,OAAO,CAAC,CAAC,MAAM,GAAG,IAAI,MAAM,IAAI,MAAM;IAC5C,EAAE,OAAO,KAAK;QACZ;IACF;IAEA,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,MAAM;IACrC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,MAAM;IAErC,OAAO;QAAE,GAAG;QAAG,GAAG;IAAE;AACtB;AAEA,4CAA6B,SAAU,GAAG;IACxC,IAAI,IAAI,iCAAO,KAAK,CAAC,IAAI;IACzB,IAAI,IAAI,iCAAO,KAAK,CAAC,IAAI;IAEzB,IAAI,SAAS,IAAI,MAAM;IACvB,IAAI,QAAQ;IAEZ,oBAAoB;IACpB,IAAI,GAAG,CAAC,QAAQ,KAAK,MAAM;IAE3B,uBAAuB;IACvB,IAAI,UAAU,GAAG,CAAC,QAAQ;IAC1B,IAAI,UAAU,MAAM;QAClB,SAAS,UAAU;QACnB,IAAI,QAAQ,QAAQ;IACtB;IAEA,0BAA0B;IAC1B,IAAI,GAAG,CAAC,QAAQ,KAAK,MAAM;IAE3B,eAAe;IACf,IAAI,OAAO,GAAG,CAAC,QAAQ;IACvB,IAAI,OAAO,MAAM;QACf,UAAU,OAAO;QACjB,IAAI,QAAQ,UAAU,QAAQ;QAC9B,MAAO,UAAU,KAAK,GAAG,CAAC,MAAM,KAAK,MAAM,SAAS,GAAG,WAAW;QAClE,IAAK,OAAO,GAAG,UAAU,GAAG,SAAS,GAAG,WAAW,EAAG,OAAO,AAAC,CAAA,QAAQ,CAAA,IAAK,GAAG,CAAC,MAAM;IACvF;IACA,IAAI,OAAO,SAAS,OAAO;IAC3B,IAAI,SAAS;IACb,SAAS;IAET,0BAA0B;IAC1B,IAAI,GAAG,CAAC,QAAQ,KAAK,MAAM;IAE3B,eAAe;IACf,IAAI,OAAO,GAAG,CAAC,QAAQ;IACvB,IAAI,OAAO,MAAM;QACf,UAAU,OAAO;QACjB,IAAI,QAAQ,UAAU,QAAQ;QAC9B,MAAO,UAAU,KAAK,GAAG,CAAC,MAAM,KAAK,MAAM,SAAS,GAAG,WAAW;QAClE,IAAK,OAAO,GAAG,UAAU,GAAG,SAAS,GAAG,WAAW,EAAG,OAAO,AAAC,CAAA,QAAQ,CAAA,IAAK,GAAG,CAAC,MAAM;IACvF;IACA,IAAI,OAAO,SAAS,OAAO;IAC3B,IAAI,SAAS;IACb,SAAS;IAET,4BAA4B;IAC5B,MAAO,OAAO,KAAK,GAAG,CAAC,OAAO,KAAK,MAAM,QAAQ,GAAG,UAAU;IAC9D,eAAe;IACf,IAAI,OAAO,IAAI;IACf,IAAI,SAAS,IAAI,KAAK,CAAC,QAAQ,SAAS;IACxC,OAAO,IAAI,CAAC,GAAG,KAAK,OAAO,MAAM;IAEjC,4BAA4B;IAC5B,MAAO,OAAO,KAAK,GAAG,CAAC,OAAO,KAAK,MAAM,QAAQ,GAAG,UAAU;IAC9D,eAAe;IACf,IAAI,OAAO,IAAI;IACf,IAAI,SAAS,IAAI,KAAK,CAAC,QAAQ,SAAS;IACxC,OAAO,IAAI,CAAC,GAAG,KAAK,OAAO,MAAM;IAEjC,OAAO;QAAE,GAAG;QAAG,GAAG;IAAE;AACtB;;;;AChMA,2EAA2E;AAC3E,sEAAsE;AACtE,iEAAiE;;;uCAE7D;AAEJ,SAAS,4BAAO,MAAM;IACpB,IAAI,OAAO,MAAM,GAAG,GAAG,OAAO;IAC9B,IAAI,OAAO,MAAM,GAAG,IAAI,OAAO;IAC/B,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM,OAAO;IAC/B,IAAI,MAAM,CAAC,EAAE,KAAK,OAAO,MAAM,GAAG,GAAG,OAAO;IAC5C,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM,OAAO;IAE/B,IAAI,OAAO,MAAM,CAAC,EAAE;IACpB,IAAI,SAAS,GAAG,OAAO;IACvB,IAAI,IAAI,QAAQ,OAAO,MAAM,EAAE,OAAO;IACtC,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,MAAM,OAAO;IAEtC,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK;IAC3B,IAAI,SAAS,GAAG,OAAO;IACvB,IAAI,AAAC,IAAI,OAAO,SAAU,OAAO,MAAM,EAAE,OAAO;IAEhD,IAAI,MAAM,CAAC,EAAE,GAAG,MAAM,OAAO;IAC7B,IAAI,OAAO,KAAM,MAAM,CAAC,EAAE,KAAK,QAAS,CAAE,CAAA,MAAM,CAAC,EAAE,GAAG,IAAG,GAAI,OAAO;IAEpE,IAAI,MAAM,CAAC,OAAO,EAAE,GAAG,MAAM,OAAO;IACpC,IAAI,OAAO,KAAM,MAAM,CAAC,OAAO,EAAE,KAAK,QAAS,CAAE,CAAA,MAAM,CAAC,OAAO,EAAE,GAAG,IAAG,GAAI,OAAO;IAClF,OAAO;AACT;AAEA,SAAS,6BAAQ,MAAM;IACrB,IAAI,OAAO,MAAM,GAAG,GAAG,MAAM,IAAI,MAAM;IACvC,IAAI,OAAO,MAAM,GAAG,IAAI,MAAM,IAAI,MAAM;IACxC,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM,MAAM,IAAI,MAAM;IACxC,IAAI,MAAM,CAAC,EAAE,KAAK,OAAO,MAAM,GAAG,GAAG,MAAM,IAAI,MAAM;IACrD,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM,MAAM,IAAI,MAAM;IAExC,IAAI,OAAO,MAAM,CAAC,EAAE;IACpB,IAAI,SAAS,GAAG,MAAM,IAAI,MAAM;IAChC,IAAI,IAAI,QAAQ,OAAO,MAAM,EAAE,MAAM,IAAI,MAAM;IAC/C,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,MAAM,MAAM,IAAI,MAAM;IAE/C,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK;IAC3B,IAAI,SAAS,GAAG,MAAM,IAAI,MAAM;IAChC,IAAI,AAAC,IAAI,OAAO,SAAU,OAAO,MAAM,EAAE,MAAM,IAAI,MAAM;IAEzD,IAAI,MAAM,CAAC,EAAE,GAAG,MAAM,MAAM,IAAI,MAAM;IACtC,IAAI,OAAO,KAAM,MAAM,CAAC,EAAE,KAAK,QAAS,CAAE,CAAA,MAAM,CAAC,EAAE,GAAG,IAAG,GAAI,MAAM,IAAI,MAAM;IAE7E,IAAI,MAAM,CAAC,OAAO,EAAE,GAAG,MAAM,MAAM,IAAI,MAAM;IAC7C,IAAI,OAAO,KAAM,MAAM,CAAC,OAAO,EAAE,KAAK,QAAS,CAAE,CAAA,MAAM,CAAC,OAAO,EAAE,GAAG,IAAG,GAAI,MAAM,IAAI,MAAM;IAE3F,kCAAkC;IAClC,OAAO;QACL,GAAG,OAAO,KAAK,CAAC,GAAG,IAAI;QACvB,GAAG,OAAO,KAAK,CAAC,IAAI;IACtB;AACF;AAEA;;;;;;;;;;;;;;;;;;;;;AAqBA,GACA,SAAS,6BAAQ,CAAC,EAAE,CAAC;IACnB,IAAI,OAAO,EAAE,MAAM;IACnB,IAAI,OAAO,EAAE,MAAM;IACnB,IAAI,SAAS,GAAG,MAAM,IAAI,MAAM;IAChC,IAAI,SAAS,GAAG,MAAM,IAAI,MAAM;IAChC,IAAI,OAAO,IAAI,MAAM,IAAI,MAAM;IAC/B,IAAI,OAAO,IAAI,MAAM,IAAI,MAAM;IAC/B,IAAI,CAAC,CAAC,EAAE,GAAG,MAAM,MAAM,IAAI,MAAM;IACjC,IAAI,CAAC,CAAC,EAAE,GAAG,MAAM,MAAM,IAAI,MAAM;IACjC,IAAI,OAAO,KAAM,CAAC,CAAC,EAAE,KAAK,QAAS,CAAE,CAAA,CAAC,CAAC,EAAE,GAAG,IAAG,GAAI,MAAM,IAAI,MAAM;IACnE,IAAI,OAAO,KAAM,CAAC,CAAC,EAAE,KAAK,QAAS,CAAE,CAAA,CAAC,CAAC,EAAE,GAAG,IAAG,GAAI,MAAM,IAAI,MAAM;IAEnE,IAAI,YAAY,iCAAO,WAAW,CAAC,IAAI,OAAO;IAE9C,8DAA8D;IAC9D,SAAS,CAAC,EAAE,GAAG;IACf,SAAS,CAAC,EAAE,GAAG,UAAU,MAAM,GAAG;IAClC,SAAS,CAAC,EAAE,GAAG;IACf,SAAS,CAAC,EAAE,GAAG,EAAE,MAAM;IACvB,EAAE,IAAI,CAAC,WAAW;IAClB,SAAS,CAAC,IAAI,KAAK,GAAG;IACtB,SAAS,CAAC,IAAI,KAAK,GAAG,EAAE,MAAM;IAC9B,EAAE,IAAI,CAAC,WAAW,IAAI;IAEtB,OAAO;AACT;AAEA,iBAAiB;IACf,OAAO;IACP,QAAQ;IACR,QAAQ;AACV;;;;;;AChHA,iBAAiB,KAAK,KAAK,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;ACkE5B,IAAA;AAKA,IAAA;AAOA,IAAA;AAKA,IAAA;AAOA,IAAA;AAWA,IAAA;AAUA,IAAA;AAOA,IAAA;AAOA,IAAA;AAIA,IAAA;AAaA,IAAA;AAUA,IAAA;AAcA,IAAA;AAWA,IAAA;AAQA,IAAA;AAaA,IAAA;AAwBA,IAAA;AAcA,IAAA;AAiBA,IAAA;AAKA,IAAA;AAlQA;;;uCACI;;;;;;;mCAGA;;;AAIJ,IAAI,2BAAK,iCAAO;AAChB,IAAI,iCAAW,yBAAG,KAAK;AAEvB,SAAS,8CAAyB,KAAK,EAAE,OAAO;IAC9C,IAAI,IAAI,IAAI,OAAG;IAEf,WAAW;IACX,IAAI,EAAE,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,OAAO;IACnC,IAAI,EAAE,KAAK,CAAC,+BAAS,GAAG;IAExB,0BAA0B;IAC1B,IAAI,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,+BAAS,CAAC,EAAE,OAAO;IACzD,IAAI,AAAC,UAAU,SAAU,EAAE,KAAK,IAAI,IAAI,EAAE,MAAM;IAEhD,kBAAkB;IAClB,MAAM,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;IAC9B,IAAI,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,+BAAS,CAAC,GAAG,MAAM,IAAI,OAAO;IAEjE,OAAO,yBAAG,OAAO,CAAC;QAAE,KAAK;YAAE,GAAG;YAAG,GAAG;QAAE;IAAE;AAC1C;AAEA,SAAS,gDAA2B,KAAK,EAAE,OAAO,EAAE,OAAO;IACzD,IAAI,IAAI,IAAI,OAAG;IACf,IAAI,IAAI,IAAI,OAAG;IAEf,WAAW;IACX,IAAI,EAAE,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,EAAE,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,OAAO;IAE7D,IAAI,EAAE,KAAK,CAAC,+BAAS,GAAG;IACxB,IAAI,EAAE,KAAK,CAAC,+BAAS,GAAG;IAExB,cAAc;IACd,IAAI,AAAC,CAAA,UAAU,QAAQ,UAAU,IAAG,KAAM,EAAE,KAAK,OAAQ,CAAA,UAAU,IAAG,GAAI,OAAO;IAEjF,kBAAkB;IAClB,IAAI,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;IAC5B,IAAI,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,+BAAS,CAAC,GAAG,MAAM,IAAI,OAAO;IAEjE,OAAO,yBAAG,OAAO,CAAC;QAAE,KAAK;YAAE,GAAG;YAAG,GAAG;QAAE;IAAE;AAC1C;AAEA,SAAS,oCAAe,SAAS;IAC/B,IAAI,QAAQ,SAAS,CAAC,EAAE;IACxB,OAAQ;QACN,KAAK;QACL,KAAK;YACH,IAAI,UAAU,MAAM,KAAK,IAAI,OAAO;YACpC,OAAO,8CAAwB,OAAO,UAAU,KAAK,CAAC,GAAG;QAC3D,KAAK;QACL,KAAK;QACL,KAAK;YACH,IAAI,UAAU,MAAM,KAAK,IAAI,OAAO;YACpC,OAAO,gDAA0B,OAAO,UAAU,KAAK,CAAC,GAAG,KAAK,UAAU,KAAK,CAAC,IAAI;QACtF;YACE,OAAO;IACX;AACF;AAEA,4CAA2B,SAAU,UAAU;IAC7C,IAAI,KAAK,IAAI,OAAG;IAChB,OAAO,GAAG,GAAG,CAAC,+BAAS,CAAC,IAAI,KAAK,CAAC,GAAG,MAAM;AAC7C;AAEA,4CAA2B,SAAU,UAAU,EAAE,UAAU;IACzD,IAAI,IAAI,IAAI,OAAG;IACf,IAAI,EAAE,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,EAAE,MAAM,IAAI,MAAM,IAAI,MAAM;IAE1D,OAAO,iCAAO,IAAI,CAAC,yBAAG,cAAc,CAAC,YAAY,SAAS,CAAC,YAAY;AACzE;AAEA,4CAA2B,SAAU,UAAU;IAC7C,IAAI,KAAK,IAAI,OAAG;IAChB,OAAO,GAAG,MAAM,KAAK,iCAAO,KAAK,CAAC,MAAM,+BAAS,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,+BAAS,CAAC,EAAE,WAAW,mCAAS,MAAM;AACxG;AAEA,4CAA+B,SAAU,UAAU;IACjD,IAAI,KAAK,IAAI,OAAG;IAChB,IAAI,GAAG,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,GAAG,MAAM,IAAI,MAAM,IAAI,MAAM;IAE5D,OAAO,GAAG,IAAI,CAAC,+BAAS,CAAC,EAAE,WAAW,mCAAS,MAAM;AACvD;AAEA,4CAA6B,SAAU,UAAU,EAAE,KAAK;IACtD,IAAI,KAAK,IAAI,OAAG;IAChB,IAAI,GAAG,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,MAAM,IAAI,MAAM;IAE7C,GAAG,IAAI,CAAC,IAAI,OAAG;IACf,IAAI,GAAG,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,GAAG,IAAI,CAAC,+BAAS,CAAC;IAC/C,IAAI,GAAG,MAAM,IAAI,MAAM,IAAI,MAAM;IAEjC,OAAO,GAAG,WAAW,mCAAS,MAAM;AACtC;AAEA,4CAA6B,SAAU,UAAU,EAAE,KAAK;IACtD,IAAI,KAAK,IAAI,OAAG;IAChB,IAAI,GAAG,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,GAAG,MAAM,IAAI,MAAM,IAAI,MAAM;IAE5D,GAAG,IAAI,CAAC,IAAI,OAAG;IACf,IAAI,GAAG,GAAG,CAAC,+BAAS,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,+BAAS,CAAC;IAE/C,OAAO,GAAG,WAAW,mCAAS,MAAM;AACtC;AAEA,4CAA0B,SAAU,UAAU,EAAE,UAAU;IACxD,IAAI,IAAI,IAAI,OAAG;IACf,IAAI,EAAE,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,EAAE,MAAM,IAAI,MAAM,IAAI,MAAM;IAE1D,OAAO,iCAAO,IAAI,CAAC,yBAAG,cAAc,CAAC,YAAY,SAAS,CAAC,YAAY;AACzE;AAEA,4CAA2B,SAAU,SAAS,EAAE,UAAU;IACxD,IAAI,OAAO,oCAAc;IACzB,IAAI,SAAS,MAAM,MAAM,IAAI,MAAM;IAEnC,OAAO,iCAAO,IAAI,CAAC,KAAK,SAAS,CAAC,YAAY;AAChD;AAEA,4CAA0B,SAAU,SAAS;IAC3C,OAAO,oCAAc,eAAe;AACtC;AAEA,4CAA4B,SAAU,SAAS,EAAE,KAAK,EAAE,UAAU;IAChE,IAAI,OAAO,oCAAc;IACzB,IAAI,SAAS,MAAM,MAAM,IAAI,MAAM;IAEnC,QAAQ,IAAI,OAAG;IACf,IAAI,MAAM,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,MAAM,IAAI,MAAM;IAEhD,IAAI,QAAQ,+BAAS,CAAC,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,KAAK,GAAG;IAC9C,IAAI,MAAM,UAAU,IAAI,MAAM,IAAI,MAAM;IAExC,OAAO,iCAAO,IAAI,CAAC,MAAM,MAAM,CAAC,MAAM;AACxC;AAEA,4CAA4B,SAAU,SAAS,EAAE,KAAK,EAAE,UAAU;IAChE,IAAI,OAAO,oCAAc;IACzB,IAAI,SAAS,MAAM,MAAM,IAAI,MAAM;IAEnC,QAAQ,IAAI,OAAG;IACf,IAAI,MAAM,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,MAAM,MAAM,IAAI,MAAM,IAAI,MAAM;IAElE,OAAO,iCAAO,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,OAAO,MAAM,CAAC,MAAM;AACtD;AAEA,4CAA2B,SAAU,UAAU,EAAE,UAAU;IACzD,IAAI,QAAQ,IAAI,MAAM,WAAW,MAAM;IACvC,IAAK,IAAI,IAAI,GAAG,IAAI,WAAW,MAAM,EAAE,EAAE,EAAG;QAC1C,KAAK,CAAC,EAAE,GAAG,oCAAc,UAAU,CAAC,EAAE;QACtC,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,MAAM,IAAI,MAAM;IACzC;IAEA,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC,GAAG;IACxB,IAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,EAAE,EAAE,EAAG,QAAQ,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG;IACrE,IAAI,MAAM,UAAU,IAAI,MAAM,IAAI,MAAM;IAExC,OAAO,iCAAO,IAAI,CAAC,MAAM,MAAM,CAAC,MAAM;AACxC;AAEA,4CAA6B,SAAU,SAAS;IAC9C,IAAI,IAAI,IAAI,OAAG,UAAU,KAAK,CAAC,GAAG;IAClC,IAAI,IAAI,IAAI,OAAG,UAAU,KAAK,CAAC,IAAI;IACnC,IAAI,EAAE,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,EAAE,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,MAAM,IAAI,MAAM;IAEtE,IAAI,SAAS,iCAAO,IAAI,CAAC;IACzB,IAAI,EAAE,GAAG,CAAC,yBAAG,EAAE,MAAM,GAAG,+BAAS,CAAC,CAAC,GAAG,CAAC,GAAG,WAAW,mCAAS,MAAM,IAAI,IAAI,CAAC,QAAQ;IAErF,OAAO;AACT;AAEA,4CAA0B,SAAU,SAAS;IAC3C,IAAI,IAAI,UAAU,KAAK,CAAC,GAAG;IAC3B,IAAI,IAAI,UAAU,KAAK,CAAC,IAAI;IAC5B,IAAI,IAAI,OAAG,GAAG,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,IAAI,OAAG,GAAG,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,MAAM,IAAI,MAAM;IAEtF,OAAO;QAAE,GAAG;QAAG,GAAG;IAAE;AACtB;AAEA,4CAA0B,SAAU,MAAM;IACxC,IAAI,IAAI,IAAI,OAAG,OAAO,CAAC;IACvB,IAAI,EAAE,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,IAAI,IAAI,OAAG;IAEvC,IAAI,IAAI,IAAI,OAAG,OAAO,CAAC;IACvB,IAAI,EAAE,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,IAAI,IAAI,OAAG;IAEvC,OAAO,iCAAO,MAAM,CAAC;QACnB,EAAE,WAAW,mCAAS,MAAM;QAC5B,EAAE,WAAW,mCAAS,MAAM;KAC7B;AACH;AAEA,4CAAe,SAAU,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,IAAI;IACzD,IAAI,OAAO,YAAY,YAAY;QACjC,IAAI,WAAW;QACf,UAAU,SAAU,OAAO;YACzB,IAAI,QAAQ,SAAS,SAAS,YAAY,MAAM,MAAM;YACtD,IAAI,CAAC,iCAAO,QAAQ,CAAC,UAAU,MAAM,MAAM,KAAK,IAAI,MAAM,IAAI,MAAM;YAEpE,OAAO,IAAI,OAAG;QAChB;IACF;IAEA,IAAI,IAAI,IAAI,OAAG;IACf,IAAI,EAAE,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,EAAE,MAAM,IAAI,MAAM,IAAI,MAAM;IAE1D,IAAI,SAAS,yBAAG,IAAI,CAAC,SAAS,YAAY;QAAE,WAAW;QAAM,GAAG;QAAS,MAAM;IAAK;IACpF,OAAO;QACL,WAAW,iCAAO,MAAM,CAAC;YACvB,OAAO,CAAC,CAAC,WAAW,mCAAS,MAAM;YACnC,OAAO,CAAC,CAAC,WAAW,mCAAS,MAAM;SACpC;QACD,UAAU,OAAO,aAAa;IAChC;AACF;AAEA,4CAAiB,SAAU,OAAO,EAAE,SAAS,EAAE,SAAS;IACtD,IAAI,SAAS;QAAE,GAAG,UAAU,KAAK,CAAC,GAAG;QAAK,GAAG,UAAU,KAAK,CAAC,IAAI;IAAI;IAErE,IAAI,OAAO,IAAI,OAAG,OAAO,CAAC;IAC1B,IAAI,OAAO,IAAI,OAAG,OAAO,CAAC;IAC1B,IAAI,KAAK,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,MAAM,IAAI,MAAM;IAC5E,IAAI,KAAK,GAAG,CAAC,yBAAG,EAAE,MAAM,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI,OAAO;IAEpE,IAAI,OAAO,oCAAc;IACzB,IAAI,SAAS,MAAM,MAAM,IAAI,MAAM;IAEnC,OAAO,yBAAG,MAAM,CAAC,SAAS,QAAQ;QAAE,GAAG,KAAK,GAAG,CAAC,CAAC;QAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IAAC;AACnE;AAEA,4CAAkB,SAAU,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU;IAClE,IAAI,SAAS;QAAE,GAAG,UAAU,KAAK,CAAC,GAAG;QAAK,GAAG,UAAU,KAAK,CAAC,IAAI;IAAI;IAErE,IAAI,OAAO,IAAI,OAAG,OAAO,CAAC;IAC1B,IAAI,OAAO,IAAI,OAAG,OAAO,CAAC;IAC1B,IAAI,KAAK,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC,+BAAS,CAAC,KAAK,GAAG,MAAM,IAAI,MAAM;IAE5E,IAAI;QACF,IAAI,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI,MAAM,IAAI;QAE9C,IAAI,QAAQ,yBAAG,aAAa,CAAC,SAAS,QAAQ;QAC9C,OAAO,iCAAO,IAAI,CAAC,MAAM,MAAM,CAAC,MAAM;IACxC,EAAE,OAAO,KAAK;QACZ,MAAM,IAAI,MAAM;IAClB;AACF;AAEA,4CAAe,SAAU,SAAS,EAAE,UAAU;IAC5C,IAAI,SAAS,0CAAmB,WAAW,YAAY;IACvD,OAAO,OAAW,UAAU,MAAM,CAAC,QAAQ,MAAM;AACnD;AAEA,4CAAqB,SAAU,SAAS,EAAE,UAAU,EAAE,UAAU;IAC9D,IAAI,OAAO,oCAAc;IACzB,IAAI,SAAS,MAAM,MAAM,IAAI,MAAM;IAEnC,IAAI,SAAS,IAAI,OAAG;IACpB,IAAI,OAAO,GAAG,CAAC,+BAAS,CAAC,KAAK,KAAK,OAAO,MAAM,IAAI,MAAM,IAAI,MAAM;IAEpE,OAAO,iCAAO,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,QAAQ,MAAM,CAAC,MAAM;AACvD;;;;AC1QA;;;;;;;;;;;AAOA,SAAS,2BAAM,IAAI;IACjB,OAAK,IAAI,CAAC,IAAI,EAAE;IAEhB,IAAI,CAAC,KAAK,GAAG;AACf;AAEA,OAAS,4BAAM;AAEf,2BAAK,SAAS,CAAC,OAAO,GAAG,SAAU,IAAI;IACrC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;AACpB;AAEA,2BAAK,SAAS,CAAC,MAAM,GAAG;IACtB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM;AAC1B;AAEA,iBAAiB,SAAS,WAAY,GAAG;IACvC,MAAM,IAAI,WAAW;IACrB,IAAI,QAAQ,OAAO,OAAO,IAAI;IAC9B,IAAI,QAAQ,YAAY,QAAQ,aAAa,OAAO,IAAI;IAExD,OAAO,IAAI,2BAAK,OAAI;AACtB;;;;AC7BA;;;;;;;uCAGI;AAEJ,IAAI,gCAAU,IAAI,MAAM;AAExB,SAAS;IACP,OAAS,IAAI,CAAC,IAAI,EAAE;IAEpB,QAAQ;IACR,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;AACZ;AAEA,OAAS,2BAAK;AAEd,0BAAI,SAAS,CAAC,OAAO,GAAG;IACtB,IAAI,IAAI;IACR,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI;IAEhE,IAAI,IAAI,IAAI,CAAC,EAAE;IACf,IAAI,IAAI,IAAI,CAAC,EAAE;IACf,IAAI,IAAI,IAAI,CAAC,EAAE;IACf,IAAI,IAAI,IAAI,CAAC,EAAE;IAEf,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IAEvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IAEvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IAEtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,YAAY;IACvC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IACtC,IAAI,0BAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,YAAY;IAEtC,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,CAAC,EAAE,GAAG,IAAK;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,CAAC,EAAE,GAAG,IAAK;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,CAAC,EAAE,GAAG,IAAK;IAC1B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,CAAC,EAAE,GAAG,IAAK;AAC5B;AAEA,0BAAI,SAAS,CAAC,OAAO,GAAG;IACtB,mCAAmC;IACnC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,GAAG,GAAG;IACnC,IAAI,IAAI,CAAC,YAAY,GAAG,IAAI;QAC1B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE;QACvC,IAAI,CAAC,OAAO;QACZ,IAAI,CAAC,YAAY,GAAG;IACtB;IAEA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE;IACvC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE;IAC3C,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE;IAC3C,IAAI,CAAC,OAAO;IAEZ,iBAAiB;IACjB,IAAI,SAAS,iCAAO,WAAW,CAAC;IAChC,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAC7B,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAC7B,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAC7B,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAC7B,OAAO;AACT;AAEA,SAAS,2BAAM,CAAC,EAAE,CAAC;IACjB,OAAO,AAAC,KAAK,IAAM,MAAO,KAAK;AACjC;AAEA,SAAS,0BAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,OAAO,AAAC,2BAAK,AAAC,IAAK,CAAA,AAAC,IAAI,IAAM,AAAC,CAAC,IAAK,CAAC,IAAK,IAAI,IAAK,GAAG,KAAK,IAAK;AACnE;AAEA,SAAS,0BAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,OAAO,AAAC,2BAAK,AAAC,IAAK,CAAA,AAAC,IAAI,IAAM,IAAK,CAAC,CAAE,IAAK,IAAI,IAAK,GAAG,KAAK,IAAK;AACnE;AAEA,SAAS,0BAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,OAAO,AAAC,2BAAK,AAAC,IAAK,CAAA,IAAI,IAAI,CAAA,IAAK,IAAI,IAAK,GAAG,KAAK,IAAK;AACxD;AAEA,SAAS,0BAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,OAAO,AAAC,2BAAK,AAAC,IAAM,CAAA,IAAK,CAAA,IAAK,CAAC,CAAC,CAAC,IAAM,IAAI,IAAK,GAAG,KAAK,IAAK;AAC/D;AAEA,iBAAiB;;;;ACjJjB;;;uCAEI;;;;;0CAEA;;;AAGJ,SAAS,+BAAS,SAAS;IAC1B,oCAAU,IAAI,CAAC,IAAI;IAEnB,IAAI,CAAC,MAAM,GAAG,iCAAO,WAAW,CAAC;IACjC,IAAI,CAAC,UAAU,GAAG;IAClB,IAAI,CAAC,YAAY,GAAG;IACpB,IAAI,CAAC,OAAO,GAAG;QAAC;QAAG;QAAG;QAAG;KAAE;IAE3B,IAAI,CAAC,UAAU,GAAG;AACnB;AAEA,OAAS;AAET,+BAAS,SAAS,CAAC,UAAU,GAAG,SAAU,KAAK,EAAE,QAAQ,EAAE,QAAQ;IAClE,IAAI,QAAQ;IACZ,IAAI;QACH,IAAI,CAAC,MAAM,CAAC,OAAO;IACpB,EAAE,OAAO,KAAK;QACb,QAAQ;IACT;IAEA,SAAS;AACV;AAEA,+BAAS,SAAS,CAAC,MAAM,GAAG,SAAU,QAAQ;IAC7C,IAAI,QAAQ;IACZ,IAAI;QACH,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;IACtB,EAAE,OAAO,KAAK;QACb,QAAQ;IACT;IAEA,SAAS;AACV;AAEA,+BAAS,SAAS,CAAC,MAAM,GAAG,SAAU,IAAI,EAAE,QAAQ;IACnD,IAAI,IAAI,CAAC,UAAU,EAClB,MAAM,IAAI,MAAM;IAGjB,IAAI,aAAa,OAAS,MAAM,WAAW,6BAA6B;IAExE,eAAe;IACf,IAAI,QAAQ,IAAI,CAAC,MAAM;IACvB,IAAI,SAAS;IACb,MAAO,IAAI,CAAC,YAAY,GAAG,WAAW,MAAM,GAAG,UAAU,IAAI,CAAC,UAAU,CAAE;QACzE,IAAK,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE,IAAI,IAAI,CAAC,UAAU,EAAG;YACrD,KAAK,CAAC,EAAE,GAAG,UAAU,CAAC,OAAO;YAC7B,KAAK;YACL,UAAU;QACX;QACA,IAAI,CAAC,OAAO;QACZ,IAAI,CAAC,YAAY,GAAG;IACrB;IACA,MAAO,SAAS,WAAW,MAAM,CAAE;QAClC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,UAAU,CAAC,OAAO;QAC7C,IAAI,CAAC,YAAY,IAAI;QACrB,UAAU;IACX;IAEA,gBAAgB;IAChB,IAAK,IAAI,IAAI,GAAG,QAAQ,WAAW,MAAM,GAAG,GAAG,QAAQ,GAAG,EAAE,EAAG;QAC9D,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI;QACnB,QAAQ,AAAC,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,eAAgB;QAC3C,IAAI,QAAQ,GACX,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,eAAe;IAEpC;IAEA,OAAO,IAAI;AACZ;AAEA,+BAAS,SAAS,CAAC,OAAO,GAAG;IAC5B,MAAM,IAAI,MAAM;AACjB;AAEA,+BAAS,SAAS,CAAC,MAAM,GAAG,SAAU,QAAQ;IAC7C,IAAI,IAAI,CAAC,UAAU,EAClB,MAAM,IAAI,MAAM;IAEjB,IAAI,CAAC,UAAU,GAAG;IAElB,IAAI,SAAS,IAAI,CAAC,OAAO;IACzB,IAAI,aAAa,WAChB,SAAS,OAAO,QAAQ,CAAC;IAG1B,cAAc;IACd,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IACjB,IAAI,CAAC,YAAY,GAAG;IACpB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EACxB,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG;IAGnB,OAAO;AACR;AAEA,+BAAS,SAAS,CAAC,OAAO,GAAG;IAC5B,MAAM,IAAI,MAAM;AACjB;AAEA,iBAAiB;;;;AC5GjB;;;uCAEI;;;AAGJ,IAAI,sCAAgB,OAAO,eAAe;AAC1C,IAAI,uCAAiB,uCAAiB,OAAO,gBAAgB;AAC7D,IAAI,+BAAS,wCAAkB,YAAY,MAAM;AAEjD,iBAAiB,SAAU,KAAK,EAAE,QAAQ;IACzC,IACC,OAAO,UAAU,YACZ,iCAAO,QAAQ,CAAC,UACf,uCAAiB,iBAAiB,cAClC,gCAAU,6BAAO,QAEvB,OAAO,OAAS,OAAO;IAExB,MAAM,IAAI,UAAU;AACrB;;;;;;;ACnBA;;uCAEI;;;;;AAIJ,IAAI,gCAAU,IAAI,MAAM;AAExB,IAAI,2BAAK;IACR;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAI;IAAI;IAClD;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IACnD;IAAG;IAAI;IAAI;IAAG;IAAG;IAAI;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAG;IAClD;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IACnD;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAG;IAAI;IAAI;IAAG;IAAG;IAAG;IAAI;IAAG;IAAI;CAClD;AAED,IAAI,2BAAK;IACR;IAAG;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAClD;IAAG;IAAI;IAAG;IAAG;IAAG;IAAI;IAAG;IAAI;IAAI;IAAI;IAAG;IAAI;IAAG;IAAG;IAAG;IACnD;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAClD;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAClD;IAAI;IAAI;IAAI;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IAAG;CAClD;AAED,IAAI,2BAAK;IACR;IAAI;IAAI;IAAI;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAI;IAAG;IAAG;IAAG;IACrD;IAAG;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAI;IAAG;IAAI;IAAG;IAAI;IACpD;IAAI;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAI;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IACrD;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAG;IAAG;IAAG;IAAI;IAAG;IAAG;IAAG;IAAG;IAAG;IACpD;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAI;IAAG;IAAI;IAAI;IAAI;IAAI;IAAG;IAAG;CACrD;AAED,IAAI,2BAAK;IACR;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAI;IACrD;IAAG;IAAI;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAAG;IAAI;IAAI;IACpD;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAG;IAAI;IAAI;IAAI;IAAG;IACrD;IAAI;IAAG;IAAG;IAAI;IAAI;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IACrD;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAAG;IAAI;IAAI;IAAI;CACpD;AAED,IAAI,2BAAK;IAAC;IAAY;IAAY;IAAY;IAAY;CAAW;AACrE,IAAI,2BAAK;IAAC;IAAY;IAAY;IAAY;IAAY;CAAW;AAErE,SAAS,2BAAK,CAAC,EAAE,CAAC;IACjB,OAAO,AAAC,KAAK,IAAM,MAAO,KAAK;AAChC;AAEA,SAAS,0BAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAClC,OAAO,AAAC,2BAAK,AAAC,IAAK,CAAA,IAAI,IAAI,CAAA,IAAK,IAAI,IAAK,GAAG,KAAK,IAAK;AACvD;AAEA,SAAS,0BAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAClC,OAAO,AAAC,2BAAK,AAAC,IAAK,CAAA,AAAC,IAAI,IAAM,CAAC,IAAI,CAAC,IAAK,IAAI,IAAK,GAAG,KAAK,IAAK;AAChE;AAEA,SAAS,0BAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAClC,OAAO,AAAC,2BAAK,AAAC,IAAK,CAAA,AAAC,CAAA,IAAI,CAAC,CAAA,IAAK,CAAA,IAAK,IAAI,IAAK,GAAG,KAAK,IAAK;AAC1D;AAEA,SAAS,0BAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAClC,OAAO,AAAC,2BAAK,AAAC,IAAK,CAAA,AAAC,IAAI,IAAM,IAAI,CAAC,CAAC,IAAK,IAAI,IAAK,GAAG,KAAK,IAAK;AAChE;AAEA,SAAS,0BAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAClC,OAAO,AAAC,2BAAK,AAAC,IAAK,CAAA,IAAK,CAAA,IAAI,CAAC,CAAA,CAAC,IAAK,IAAI,IAAK,GAAG,KAAK,IAAK;AAC1D;AAEA,SAAS;IACR,OAAS,IAAI,CAAC,IAAI,EAAE;IAEpB,QAAQ;IACR,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,EAAE,GAAG;AACX;AAEA,OAAS,iCAAW;AAEpB,gCAAU,SAAS,CAAC,OAAO,GAAG;IAC7B,IAAI,QAAQ;IACZ,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACzB,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI;IAGxC,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG;IAEnB,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG;IAEnB,cAAc;IACd,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,EAAG;QAC/B,IAAI;QACJ,IAAI;QACJ,IAAI,IAAI,IAAI;YACX,KAAK,0BAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,wBAAE,CAAC,EAAE,CAAC,EAAE,wBAAE,CAAC,EAAE,EAAE,wBAAE,CAAC,EAAE;YACvD,KAAK,0BAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,wBAAE,CAAC,EAAE,CAAC,EAAE,wBAAE,CAAC,EAAE,EAAE,wBAAE,CAAC,EAAE;QACxD,OAAO,IAAI,IAAI,IAAI;YAClB,KAAK,0BAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,wBAAE,CAAC,EAAE,CAAC,EAAE,wBAAE,CAAC,EAAE,EAAE,wBAAE,CAAC,EAAE;YACvD,KAAK,0BAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,wBAAE,CAAC,EAAE,CAAC,EAAE,wBAAE,CAAC,EAAE,EAAE,wBAAE,CAAC,EAAE;QACxD,OAAO,IAAI,IAAI,IAAI;YAClB,KAAK,0BAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,wBAAE,CAAC,EAAE,CAAC,EAAE,wBAAE,CAAC,EAAE,EAAE,wBAAE,CAAC,EAAE;YACvD,KAAK,0BAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,wBAAE,CAAC,EAAE,CAAC,EAAE,wBAAE,CAAC,EAAE,EAAE,wBAAE,CAAC,EAAE;QACxD,OAAO,IAAI,IAAI,IAAI;YAClB,KAAK,0BAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,wBAAE,CAAC,EAAE,CAAC,EAAE,wBAAE,CAAC,EAAE,EAAE,wBAAE,CAAC,EAAE;YACvD,KAAK,0BAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,wBAAE,CAAC,EAAE,CAAC,EAAE,wBAAE,CAAC,EAAE,EAAE,wBAAE,CAAC,EAAE;QACxD,OAAO;YACN,KAAK,0BAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,wBAAE,CAAC,EAAE,CAAC,EAAE,wBAAE,CAAC,EAAE,EAAE,wBAAE,CAAC,EAAE;YACvD,KAAK,0BAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,wBAAE,CAAC,EAAE,CAAC,EAAE,wBAAE,CAAC,EAAE,EAAE,wBAAE,CAAC,EAAE;QACxD;QAEA,KAAK;QACL,KAAK;QACL,KAAK,2BAAK,IAAI;QACd,KAAK;QACL,KAAK;QAEL,KAAK;QACL,KAAK;QACL,KAAK,2BAAK,IAAI;QACd,KAAK;QACL,KAAK;IACN;IAEA,eAAe;IACf,IAAI,IAAI,AAAC,IAAI,CAAC,EAAE,GAAG,KAAK,KAAM;IAC9B,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,CAAC,EAAE,GAAG,KAAK,KAAM;IAChC,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,CAAC,EAAE,GAAG,KAAK,KAAM;IAChC,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,CAAC,EAAE,GAAG,KAAK,KAAM;IAChC,IAAI,CAAC,EAAE,GAAG,AAAC,IAAI,CAAC,EAAE,GAAG,KAAK,KAAM;IAChC,IAAI,CAAC,EAAE,GAAG;AACX;AAEA,gCAAU,SAAS,CAAC,OAAO,GAAG;IAC7B,mCAAmC;IACnC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG;IACjC,IAAI,CAAC,YAAY,IAAI;IACrB,IAAI,IAAI,CAAC,YAAY,GAAG,IAAI;QAC3B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE;QACvC,IAAI,CAAC,OAAO;QACZ,IAAI,CAAC,YAAY,GAAG;IACrB;IAEA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE;IACvC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE;IAC3C,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE;IAC3C,IAAI,CAAC,OAAO;IAEZ,iBAAiB;IACjB,IAAI,SAAS,iCAAO,KAAK,GAAG,iCAAO,KAAK,CAAC,MAAM,qCAAW,KAAK,4CAA4C;IAC3G,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAC7B,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAC7B,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAC7B,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAC7B,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE;IAC7B,OAAO;AACR;AAEA,iBAAiB;;;;;ACtKjB;AAEA,iBAAiB,SAAS,IAAI,SAAS;IACtC,IAAI,MAAM,UAAU,WAAW;IAE/B,IAAI,YAAY,cAAc,CAAC,IAAI;IACnC,IAAI,CAAC,WACJ,MAAM,IAAI,MAAM,MAAM;IAGvB,OAAO,IAAI;AACZ;;AAEA,eAAe,GAAG,GAAG;;AACrB,eAAe,IAAI,GAAG;;AACtB,eAAe,MAAM,GAAG;;AACxB,eAAe,MAAM,GAAG;;AACxB,eAAe,MAAM,GAAG;;AACxB,eAAe,MAAM,GAAG;;;;;AClBxB;;;uCAEI;;0CACA;;8CACA;;;;;AAIJ,SAAS,iCAAW,QAAQ;IAC3B,oCAAU,IAAI,CAAC,IAAI;IACnB,IAAI,CAAC,QAAQ,GAAG,OAAO,aAAa;IACpC,IAAI,IAAI,CAAC,QAAQ,EAChB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,cAAc;SAEpC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,cAAc;IAEpC,IAAI,IAAI,CAAC,MAAM,EAAE;QAChB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM;QAC1B,IAAI,CAAC,MAAM,GAAG;IACf;IACA,IAAI,CAAC,QAAQ,GAAG;IAChB,IAAI,CAAC,SAAS,GAAG;AAClB;AACA,OAAS;AAET,iCAAW,SAAS,CAAC,MAAM,GAAG,SAAU,IAAI,EAAE,QAAQ,EAAE,SAAS;IAChE,IAAI,aAAa,OAAS,MAAM,WAAW,6BAA6B;IACxE,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC;IAC3B,IAAI,IAAI,CAAC,QAAQ,EAChB,OAAO,IAAI;IAGZ,IAAI,WACH,UAAU,IAAI,CAAC,SAAS,CAAC,SAAS;IAGnC,OAAO;AACR;AAEA,iCAAW,SAAS,CAAC,cAAc,GAAG,YAAa;AACnD,iCAAW,SAAS,CAAC,UAAU,GAAG;IACjC,MAAM,IAAI,MAAM;AACjB;AAEA,iCAAW,SAAS,CAAC,UAAU,GAAG;IACjC,MAAM,IAAI,MAAM;AACjB;AAEA,iCAAW,SAAS,CAAC,MAAM,GAAG;IAC7B,MAAM,IAAI,MAAM;AACjB;AAEA,iCAAW,SAAS,CAAC,UAAU,GAAG,SAAU,IAAI,EAAE,CAAC,EAAE,IAAI;IACxD,IAAI;IACJ,IAAI;QACH,IAAI,IAAI,CAAC,QAAQ,EAChB,IAAI,CAAC,OAAO,CAAC;aAEb,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;IAEzB,EAAE,OAAO,GAAG;QACX,MAAM;IACP,SAAU;QACT,KAAK;IACN;AACD;AACA,iCAAW,SAAS,CAAC,MAAM,GAAG,SAAU,IAAI;IAC3C,IAAI;IACJ,IAAI;QACH,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO;IACvB,EAAE,OAAO,GAAG;QACX,MAAM;IACP;IAEA,KAAK;AACN;AACA,iCAAW,SAAS,CAAC,cAAc,GAAG,SAAU,SAAS;IACxD,IAAI,UAAU,IAAI,CAAC,OAAO,MAAM,iCAAO,KAAK,CAAC;IAC7C,IAAI,WACH,UAAU,IAAI,CAAC,SAAS,CAAC,SAAS,WAAW;IAE9C,OAAO;AACR;AAEA,iCAAW,SAAS,CAAC,SAAS,GAAG,SAAU,KAAK,EAAE,GAAG,EAAE,GAAG;IACzD,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;QACnB,IAAI,CAAC,QAAQ,GAAG,4CAAkB;QAClC,IAAI,CAAC,SAAS,GAAG;IAClB;IAEA,IAAI,IAAI,CAAC,SAAS,KAAK,KACtB,MAAM,IAAI,MAAM;IAGjB,IAAI,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;IAC9B,IAAI,KACH,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG;IAGzB,OAAO;AACR;AAEA,iBAAiB;;;;;;;ACtGhB,CAAA,SAAU,OAAM,EAAE,OAAO;IACxB;IAEA,QAAQ;IACR,SAAS,OAAQ,GAAG,EAAE,GAAG;QACvB,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,OAAO;IACnC;IAEA,uEAAuE;IACvE,oBAAoB;IACpB,SAAS,SAAU,IAAI,EAAE,SAAS;QAChC,KAAK,MAAM,GAAG;QACd,IAAI,WAAW,YAAa;QAC5B,SAAS,SAAS,GAAG,UAAU,SAAS;QACxC,KAAK,SAAS,GAAG,IAAI;QACrB,KAAK,SAAS,CAAC,WAAW,GAAG;IAC/B;IAEA,KAAK;IAEL,SAAS,GAAI,MAAM,EAAE,IAAI,EAAE,MAAM;QAC/B,IAAI,GAAG,IAAI,CAAC,SACV,OAAO;QAGT,IAAI,CAAC,QAAQ,GAAG;QAChB,IAAI,CAAC,KAAK,GAAG;QACb,IAAI,CAAC,MAAM,GAAG;QAEd,oBAAoB;QACpB,IAAI,CAAC,GAAG,GAAG;QAEX,IAAI,WAAW,MAAM;YACnB,IAAI,SAAS,QAAQ,SAAS,MAAM;gBAClC,SAAS;gBACT,OAAO;YACT;YAEA,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,QAAQ,IAAI,UAAU;QAChD;IACF;IACA,IAAI,OAAO,YAAW,UACpB,QAAO,OAAO,GAAG;SAEjB,QAAQ,EAAE,GAAG;IAGf,GAAG,EAAE,GAAG;IACR,GAAG,QAAQ,GAAG;IAEd,IAAI;IACJ,IAAI;QACF,IAAI,OAAO,WAAW,eAAe,OAAO,OAAO,MAAM,KAAK,aAC5D,SAAS,OAAO,MAAM;aAEtB,SAAS;IAEb,EAAE,OAAO,GAAG,CACZ;IAEA,GAAG,IAAI,GAAG,SAAS,KAAM,GAAG;QAC1B,IAAI,eAAe,IACjB,OAAO;QAGT,OAAO,QAAQ,QAAQ,OAAO,QAAQ,YACpC,IAAI,WAAW,CAAC,QAAQ,KAAK,GAAG,QAAQ,IAAI,MAAM,OAAO,CAAC,IAAI,KAAK;IACvE;IAEA,GAAG,GAAG,GAAG,SAAS,IAAK,IAAI,EAAE,KAAK;QAChC,IAAI,KAAK,GAAG,CAAC,SAAS,GAAG,OAAO;QAChC,OAAO;IACT;IAEA,GAAG,GAAG,GAAG,SAAS,IAAK,IAAI,EAAE,KAAK;QAChC,IAAI,KAAK,GAAG,CAAC,SAAS,GAAG,OAAO;QAChC,OAAO;IACT;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,KAAM,MAAM,EAAE,IAAI,EAAE,MAAM;QACtD,IAAI,OAAO,WAAW,UACpB,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,MAAM;QAGxC,IAAI,OAAO,WAAW,UACpB,OAAO,IAAI,CAAC,UAAU,CAAC,QAAQ,MAAM;QAGvC,IAAI,SAAS,OACX,OAAO;QAET,OAAO,SAAU,CAAA,OAAO,CAAA,KAAM,QAAQ,KAAK,QAAQ;QAEnD,SAAS,OAAO,QAAQ,GAAG,OAAO,CAAC,QAAQ;QAC3C,IAAI,QAAQ;QACZ,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK;YACrB;YACA,IAAI,CAAC,QAAQ,GAAG;QAClB;QAEA,IAAI,QAAQ,OAAO,MAAM;YACvB,IAAI,SAAS,IACX,IAAI,CAAC,SAAS,CAAC,QAAQ,OAAO;iBACzB;gBACL,IAAI,CAAC,UAAU,CAAC,QAAQ,MAAM;gBAC9B,IAAI,WAAW,MACb,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,IAAI,MAAM;YAE1C;;IAEJ;IAEA,GAAG,SAAS,CAAC,WAAW,GAAG,SAAS,YAAa,MAAM,EAAE,IAAI,EAAE,MAAM;QACnE,IAAI,SAAS,GAAG;YACd,IAAI,CAAC,QAAQ,GAAG;YAChB,SAAS,CAAC;QACZ;QACA,IAAI,SAAS,WAAW;YACtB,IAAI,CAAC,KAAK,GAAG;gBAAE,SAAS;aAAW;YACnC,IAAI,CAAC,MAAM,GAAG;QAChB,OAAO,IAAI,SAAS,kBAAkB;YACpC,IAAI,CAAC,KAAK,GAAG;gBACX,SAAS;gBACR,SAAS,YAAa;aACxB;YACD,IAAI,CAAC,MAAM,GAAG;QAChB,OAAO;YACL,OAAO,SAAS,mBAAmB,kBAAkB;YACrD,IAAI,CAAC,KAAK,GAAG;gBACX,SAAS;gBACR,SAAS,YAAa;gBACvB;aACD;YACD,IAAI,CAAC,MAAM,GAAG;QAChB;QAEA,IAAI,WAAW,MAAM;QAErB,oBAAoB;QACpB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,IAAI,MAAM;IACxC;IAEA,GAAG,SAAS,CAAC,UAAU,GAAG,SAAS,WAAY,MAAM,EAAE,IAAI,EAAE,MAAM;QACjE,uBAAuB;QACvB,OAAO,OAAO,OAAO,MAAM,KAAK;QAChC,IAAI,OAAO,MAAM,IAAI,GAAG;YACtB,IAAI,CAAC,KAAK,GAAG;gBAAE;aAAG;YAClB,IAAI,CAAC,MAAM,GAAG;YACd,OAAO,IAAI;QACb;QAEA,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,CAAC,OAAO,MAAM,GAAG;QACxC,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,CAAC,MAAM;QAClC,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,IAC/B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;QAGlB,IAAI,GAAG;QACP,IAAI,MAAM;QACV,IAAI,WAAW,MACb,IAAK,IAAI,OAAO,MAAM,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,EAAG;YACjD,IAAI,MAAM,CAAC,EAAE,GAAI,MAAM,CAAC,IAAI,EAAE,IAAI,IAAM,MAAM,CAAC,IAAI,EAAE,IAAI;YACzD,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,AAAC,KAAK,MAAO;YAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,AAAC,MAAO,KAAK,MAAQ;YACzC,OAAO;YACP,IAAI,OAAO,IAAI;gBACb,OAAO;gBACP;YACF;QACF;aACK,IAAI,WAAW,MACpB,IAAK,IAAI,GAAG,IAAI,GAAG,IAAI,OAAO,MAAM,EAAE,KAAK,EAAG;YAC5C,IAAI,MAAM,CAAC,EAAE,GAAI,MAAM,CAAC,IAAI,EAAE,IAAI,IAAM,MAAM,CAAC,IAAI,EAAE,IAAI;YACzD,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,AAAC,KAAK,MAAO;YAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,AAAC,MAAO,KAAK,MAAQ;YACzC,OAAO;YACP,IAAI,OAAO,IAAI;gBACb,OAAO;gBACP;YACF;QACF;QAEF,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,SAAS,cAAe,MAAM,EAAE,KAAK;QACnC,IAAI,IAAI,OAAO,UAAU,CAAC;QAC1B,YAAY;QACZ,IAAI,KAAK,MAAM,KAAK,IAClB,OAAO,IAAI;aAEN,IAAI,KAAK,MAAM,KAAK,KACzB,OAAO,IAAI;aAGX,OAAO,AAAC,IAAI,KAAM;IAEtB;IAEA,SAAS,aAAc,MAAM,EAAE,UAAU,EAAE,KAAK;QAC9C,IAAI,IAAI,cAAc,QAAQ;QAC9B,IAAI,QAAQ,KAAK,YACf,KAAK,cAAc,QAAQ,QAAQ,MAAM;QAE3C,OAAO;IACT;IAEA,GAAG,SAAS,CAAC,SAAS,GAAG,SAAS,UAAW,MAAM,EAAE,KAAK,EAAE,MAAM;QAChE,iEAAiE;QACjE,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,CAAC,AAAC,CAAA,OAAO,MAAM,GAAG,KAAI,IAAK;QAClD,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,CAAC,MAAM;QAClC,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,IAC/B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;QAGlB,iBAAiB;QACjB,IAAI,MAAM;QACV,IAAI,IAAI;QAER,IAAI;QACJ,IAAI,WAAW,MACb,IAAK,IAAI,OAAO,MAAM,GAAG,GAAG,KAAK,OAAO,KAAK,EAAG;YAC9C,IAAI,aAAa,QAAQ,OAAO,MAAM;YACtC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,IAAI;YACrB,IAAI,OAAO,IAAI;gBACb,OAAO;gBACP,KAAK;gBACL,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,MAAM;YACzB,OACE,OAAO;QAEX;aACK;YACL,IAAI,cAAc,OAAO,MAAM,GAAG;YAClC,IAAK,IAAI,cAAc,MAAM,IAAI,QAAQ,IAAI,OAAO,IAAI,OAAO,MAAM,EAAE,KAAK,EAAG;gBAC7E,IAAI,aAAa,QAAQ,OAAO,MAAM;gBACtC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,IAAI;gBACrB,IAAI,OAAO,IAAI;oBACb,OAAO;oBACP,KAAK;oBACL,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,MAAM;gBACzB,OACE,OAAO;YAEX;QACF;QAEA,IAAI,CAAC,KAAK;IACZ;IAEA,SAAS,UAAW,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG;QACtC,IAAI,IAAI;QACR,IAAI,MAAM,KAAK,GAAG,CAAC,IAAI,MAAM,EAAE;QAC/B,IAAK,IAAI,IAAI,OAAO,IAAI,KAAK,IAAK;YAChC,IAAI,IAAI,IAAI,UAAU,CAAC,KAAK;YAE5B,KAAK;YAEL,MAAM;YACN,IAAI,KAAK,IACP,KAAK,IAAI,KAAK;iBAGT,IAAI,KAAK,IACd,KAAK,IAAI,KAAK;iBAId,KAAK;QAET;QACA,OAAO;IACT;IAEA,GAAG,SAAS,CAAC,UAAU,GAAG,SAAS,WAAY,MAAM,EAAE,IAAI,EAAE,KAAK;QAChE,qBAAqB;QACrB,IAAI,CAAC,KAAK,GAAG;YAAE;SAAG;QAClB,IAAI,CAAC,MAAM,GAAG;QAEd,8BAA8B;QAC9B,IAAK,IAAI,UAAU,GAAG,UAAU,GAAG,WAAW,WAAW,WAAW,KAClE;QAEF;QACA,UAAU,AAAC,UAAU,OAAQ;QAE7B,IAAI,QAAQ,OAAO,MAAM,GAAG;QAC5B,IAAI,MAAM,QAAQ;QAClB,IAAI,MAAM,KAAK,GAAG,CAAC,OAAO,QAAQ,OAAO;QAEzC,IAAI,OAAO;QACX,IAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,QAAS;YACzC,OAAO,UAAU,QAAQ,GAAG,IAAI,SAAS;YAEzC,IAAI,CAAC,KAAK,CAAC;YACX,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,OAAO,WACzB,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI;iBAEjB,IAAI,CAAC,MAAM,CAAC;QAEhB;QAEA,IAAI,QAAQ,GAAG;YACb,IAAI,MAAM;YACV,OAAO,UAAU,QAAQ,GAAG,OAAO,MAAM,EAAE;YAE3C,IAAK,IAAI,GAAG,IAAI,KAAK,IACnB,OAAO;YAGT,IAAI,CAAC,KAAK,CAAC;YACX,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,OAAO,WACzB,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI;iBAEjB,IAAI,CAAC,MAAM,CAAC;QAEhB;QAEA,IAAI,CAAC,KAAK;IACZ;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,IAAI;QACrC,KAAK,KAAK,GAAG,IAAI,MAAM,IAAI,CAAC,MAAM;QAClC,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,IAC/B,KAAK,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE;QAE/B,KAAK,MAAM,GAAG,IAAI,CAAC,MAAM;QACzB,KAAK,QAAQ,GAAG,IAAI,CAAC,QAAQ;QAC7B,KAAK,GAAG,GAAG,IAAI,CAAC,GAAG;IACrB;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS;QAC5B,IAAI,IAAI,IAAI,GAAG;QACf,IAAI,CAAC,IAAI,CAAC;QACV,OAAO;IACT;IAEA,GAAG,SAAS,CAAC,OAAO,GAAG,SAAS,QAAS,IAAI;QAC3C,MAAO,IAAI,CAAC,MAAM,GAAG,KACnB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG;QAE9B,OAAO,IAAI;IACb;IAEA,iCAAiC;IACjC,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS;QAC5B,MAAO,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,KAAK,EACxD,IAAI,CAAC,MAAM;QAEb,OAAO,IAAI,CAAC,SAAS;IACvB;IAEA,GAAG,SAAS,CAAC,SAAS,GAAG,SAAS;QAChC,SAAS;QACT,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,GACzC,IAAI,CAAC,QAAQ,GAAG;QAElB,OAAO,IAAI;IACb;IAEA,GAAG,SAAS,CAAC,OAAO,GAAG,SAAS;QAC9B,OAAO,AAAC,CAAA,IAAI,CAAC,GAAG,GAAG,YAAY,OAAM,IAAK,IAAI,CAAC,QAAQ,CAAC,MAAM;IAChE;IAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;EA4BA,GAEA,IAAI,QAAQ;QACV;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;KACD;IAED,IAAI,aAAa;QACf;QAAG;QACH;QAAI;QAAI;QAAI;QAAI;QAAI;QAAG;QACvB;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAClB;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAClB;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAClB;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;KACnB;IAED,IAAI,aAAa;QACf;QAAG;QACH;QAAU;QAAU;QAAU;QAAU;QAAU;QAAU;QAC5D;QAAU;QAAU;QAAU;QAAU;QAAU;QAAS;QAC3D;QAAU;QAAU;QAAU;QAAU;QAAU;QAAS;QAC3D;QAAS;QAAS;QAAS;QAAU;QAAU;QAAU;QACzD;QAAU;QAAU;QAAU;QAAU;QAAU;QAAU;KAC7D;IAED,GAAG,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAU,IAAI,EAAE,OAAO;QACtD,OAAO,QAAQ;QACf,UAAU,UAAU,KAAK;QAEzB,IAAI;QACJ,IAAI,SAAS,MAAM,SAAS,OAAO;YACjC,MAAM;YACN,IAAI,MAAM;YACV,IAAI,QAAQ;YACZ,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,IAAK;gBACpC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE;gBACrB,IAAI,OAAO,AAAC,CAAA,AAAC,CAAA,AAAC,KAAK,MAAO,KAAI,IAAK,QAAO,EAAG,QAAQ,CAAC;gBACtD,QAAQ,AAAC,MAAO,KAAK,MAAQ;gBAC7B,OAAO;gBACP,IAAI,OAAO,IAAI;oBACb,OAAO;oBACP;gBACF;gBACA,IAAI,UAAU,KAAK,MAAM,IAAI,CAAC,MAAM,GAAG,GACrC,MAAM,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,GAAG,OAAO;qBAEtC,MAAM,OAAO;YAEjB;YACA,IAAI,UAAU,GACZ,MAAM,MAAM,QAAQ,CAAC,MAAM;YAE7B,MAAO,IAAI,MAAM,GAAG,YAAY,EAC9B,MAAM,MAAM;YAEd,IAAI,IAAI,CAAC,QAAQ,KAAK,GACpB,MAAM,MAAM;YAEd,OAAO;QACT;QAEA,IAAI,SAAU,CAAA,OAAO,CAAA,KAAM,QAAQ,KAAK,QAAQ,IAAI;YAClD,uEAAuE;YACvE,IAAI,YAAY,UAAU,CAAC,KAAK;YAChC,6CAA6C;YAC7C,IAAI,YAAY,UAAU,CAAC,KAAK;YAChC,MAAM;YACN,IAAI,IAAI,IAAI,CAAC,KAAK;YAClB,EAAE,QAAQ,GAAG;YACb,MAAO,CAAC,EAAE,MAAM,GAAI;gBAClB,IAAI,IAAI,EAAE,IAAI,CAAC,WAAW,QAAQ,CAAC;gBACnC,IAAI,EAAE,KAAK,CAAC;gBAEZ,IAAI,CAAC,EAAE,MAAM,IACX,MAAM,KAAK,CAAC,YAAY,EAAE,MAAM,CAAC,GAAG,IAAI;qBAExC,MAAM,IAAI;YAEd;YACA,IAAI,IAAI,CAAC,MAAM,IACb,MAAM,MAAM;YAEd,MAAO,IAAI,MAAM,GAAG,YAAY,EAC9B,MAAM,MAAM;YAEd,IAAI,IAAI,CAAC,QAAQ,KAAK,GACpB,MAAM,MAAM;YAEd,OAAO;QACT;QAEA,OAAO,OAAO;IAChB;IAEA,GAAG,SAAS,CAAC,QAAQ,GAAG,SAAS;QAC/B,IAAI,MAAM,IAAI,CAAC,KAAK,CAAC,EAAE;QACvB,IAAI,IAAI,CAAC,MAAM,KAAK,GAClB,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;aAClB,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,MAChD,0DAA0D;QAC1D,OAAO,mBAAoB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;aACtC,IAAI,IAAI,CAAC,MAAM,GAAG,GACvB,OAAO,OAAO;QAEhB,OAAO,AAAC,IAAI,CAAC,QAAQ,KAAK,IAAK,CAAC,MAAM;IACxC;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS;QAC7B,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB;IAEA,GAAG,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAU,MAAM,EAAE,MAAM;QACvD,OAAO,OAAO,WAAW;QACzB,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,QAAQ;IAC1C;IAEA,GAAG,SAAS,CAAC,OAAO,GAAG,SAAS,QAAS,MAAM,EAAE,MAAM;QACrD,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,QAAQ;IACzC;IAEA,GAAG,SAAS,CAAC,WAAW,GAAG,SAAS,YAAa,SAAS,EAAE,MAAM,EAAE,MAAM;QACxE,IAAI,aAAa,IAAI,CAAC,UAAU;QAChC,IAAI,YAAY,UAAU,KAAK,GAAG,CAAC,GAAG;QACtC,OAAO,cAAc,WAAW;QAChC,OAAO,YAAY,GAAG;QAEtB,IAAI,CAAC,KAAK;QACV,IAAI,eAAe,WAAW;QAC9B,IAAI,MAAM,IAAI,UAAU;QAExB,IAAI,GAAG;QACP,IAAI,IAAI,IAAI,CAAC,KAAK;QAClB,IAAI,CAAC,cAAc;YACjB,oBAAoB;YACpB,IAAK,IAAI,GAAG,IAAI,YAAY,YAAY,IACtC,GAAG,CAAC,EAAE,GAAG;YAGX,IAAK,IAAI,GAAG,CAAC,EAAE,MAAM,IAAI,IAAK;gBAC5B,IAAI,EAAE,KAAK,CAAC;gBACZ,EAAE,MAAM,CAAC;gBAET,GAAG,CAAC,YAAY,IAAI,EAAE,GAAG;YAC3B;QACF,OAAO;YACL,IAAK,IAAI,GAAG,CAAC,EAAE,MAAM,IAAI,IAAK;gBAC5B,IAAI,EAAE,KAAK,CAAC;gBACZ,EAAE,MAAM,CAAC;gBAET,GAAG,CAAC,EAAE,GAAG;YACX;YAEA,MAAO,IAAI,WAAW,IACpB,GAAG,CAAC,EAAE,GAAG;QAEb;QAEA,OAAO;IACT;IAEA,IAAI,KAAK,KAAK,EACZ,GAAG,SAAS,CAAC,UAAU,GAAG,SAAS,WAAY,CAAC;QAC9C,OAAO,KAAK,KAAK,KAAK,CAAC;IACzB;SAEA,GAAG,SAAS,CAAC,UAAU,GAAG,SAAS,WAAY,CAAC;QAC9C,IAAI,IAAI;QACR,IAAI,IAAI;QACR,IAAI,KAAK,QAAQ;YACf,KAAK;YACL,OAAO;QACT;QACA,IAAI,KAAK,MAAM;YACb,KAAK;YACL,OAAO;QACT;QACA,IAAI,KAAK,KAAK;YACZ,KAAK;YACL,OAAO;QACT;QACA,IAAI,KAAK,MAAM;YACb,KAAK;YACL,OAAO;QACT;QACA,OAAO,IAAI;IACb;IAGF,GAAG,SAAS,CAAC,SAAS,GAAG,SAAS,UAAW,CAAC;QAC5C,YAAY;QACZ,IAAI,MAAM,GAAG,OAAO;QAEpB,IAAI,IAAI;QACR,IAAI,IAAI;QACR,IAAI,AAAC,CAAA,IAAI,MAAK,MAAO,GAAG;YACtB,KAAK;YACL,OAAO;QACT;QACA,IAAI,AAAC,CAAA,IAAI,IAAG,MAAO,GAAG;YACpB,KAAK;YACL,OAAO;QACT;QACA,IAAI,AAAC,CAAA,IAAI,GAAE,MAAO,GAAG;YACnB,KAAK;YACL,OAAO;QACT;QACA,IAAI,AAAC,CAAA,IAAI,GAAE,MAAO,GAAG;YACnB,KAAK;YACL,OAAO;QACT;QACA,IAAI,AAAC,CAAA,IAAI,GAAE,MAAO,GAChB;QAEF,OAAO;IACT;IAEA,qCAAqC;IACrC,GAAG,SAAS,CAAC,SAAS,GAAG,SAAS;QAChC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE;QACnC,IAAI,KAAK,IAAI,CAAC,UAAU,CAAC;QACzB,OAAO,AAAC,CAAA,IAAI,CAAC,MAAM,GAAG,CAAA,IAAK,KAAK;IAClC;IAEA,SAAS,WAAY,GAAG;QACtB,IAAI,IAAI,IAAI,MAAM,IAAI,SAAS;QAE/B,IAAK,IAAI,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,MAAO;YACvC,IAAI,MAAM,AAAC,MAAM,KAAM;YACvB,IAAI,OAAO,MAAM;YAEjB,CAAC,CAAC,IAAI,GAAG,AAAC,CAAA,IAAI,KAAK,CAAC,IAAI,GAAI,KAAK,IAAI,MAAO;QAC9C;QAEA,OAAO;IACT;IAEA,+BAA+B;IAC/B,GAAG,SAAS,CAAC,QAAQ,GAAG,SAAS;QAC/B,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO;QAE1B,IAAI,IAAI;QACR,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,IAAK;YACpC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YACpC,KAAK;YACL,IAAI,MAAM,IAAI;QAChB;QACA,OAAO;IACT;IAEA,GAAG,SAAS,CAAC,UAAU,GAAG,SAAS;QACjC,OAAO,KAAK,IAAI,CAAC,IAAI,CAAC,SAAS,KAAK;IACtC;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,KAAK;QAC1C,IAAI,IAAI,CAAC,QAAQ,KAAK,GACpB,OAAO,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,OAAO,KAAK,CAAC;QAEvC,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAU,KAAK;QAC9C,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,IACrB,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,GAAG,IAAI;QAEvC,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS;QAC5B,OAAO,IAAI,CAAC,QAAQ,KAAK;IAC3B;IAEA,kCAAkC;IAClC,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS;QAC1B,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI;IAC1B;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;QAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,IACd,IAAI,CAAC,QAAQ,IAAI;QAGnB,OAAO,IAAI;IACb;IAEA,gCAAgC;IAChC,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,MAAO,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,CAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG;QAG9B,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC9B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,KAAK,CAAC,EAAE;QAG9C,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,OAAO,AAAC,CAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,QAAQ,AAAD,MAAO;QAC1C,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB;IAEA,uBAAuB;IACvB,GAAG,SAAS,CAAC,EAAE,GAAG,SAAS,GAAI,GAAG;QAChC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE,OAAO,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;QACtD,OAAO,IAAI,KAAK,GAAG,GAAG,CAAC,IAAI;IAC7B;IAEA,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACvD,OAAO,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI;IAC9B;IAEA,iCAAiC;IACjC,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACtC,4BAA4B;QAC5B,IAAI;QACJ,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAC1B,IAAI;aAEJ,IAAI,IAAI;QAGV,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAC5B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,KAAK,CAAC,EAAE;QAG9C,IAAI,CAAC,MAAM,GAAG,EAAE,MAAM;QAEtB,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,AAAC,CAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,QAAQ,AAAD,MAAO;QAC1C,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB;IAEA,wBAAwB;IACxB,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACvD,OAAO,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI;IAC9B;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE,OAAO,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACxD,OAAO,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI;IAC/B;IAEA,iCAAiC;IACjC,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACtC,sBAAsB;QACtB,IAAI;QACJ,IAAI;QACJ,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE;YAC5B,IAAI,IAAI;YACR,IAAI;QACN,OAAO;YACL,IAAI;YACJ,IAAI,IAAI;QACV;QAEA,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAC5B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,EAAE;QAGzC,IAAI,IAAI,KAAK,GACX,MAAO,IAAI,EAAE,MAAM,EAAE,IACnB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,EAAE;QAI9B,IAAI,CAAC,MAAM,GAAG,EAAE,MAAM;QAEtB,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,AAAC,CAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,QAAQ,AAAD,MAAO;QAC1C,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB;IAEA,wBAAwB;IACxB,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACvD,OAAO,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI;IAC9B;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE,OAAO,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACxD,OAAO,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI;IAC/B;IAEA,uCAAuC;IACvC,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,KAAK;QACxC,OAAO,OAAO,UAAU,YAAY,SAAS;QAE7C,IAAI,cAAc,KAAK,IAAI,CAAC,QAAQ,MAAM;QAC1C,IAAI,WAAW,QAAQ;QAEvB,wCAAwC;QACxC,IAAI,CAAC,OAAO,CAAC;QAEb,IAAI,WAAW,GACb;QAGF,wBAAwB;QACxB,IAAK,IAAI,IAAI,GAAG,IAAI,aAAa,IAC/B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;QAGnC,qBAAqB;QACrB,IAAI,WAAW,GACb,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAI,aAAc,KAAK;QAGvD,4BAA4B;QAC5B,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,KAAK;QACtC,OAAO,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAC5B;IAEA,sBAAsB;IACtB,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG,EAAE,GAAG;QACzC,OAAO,OAAO,QAAQ,YAAY,OAAO;QAEzC,IAAI,MAAM,AAAC,MAAM,KAAM;QACvB,IAAI,OAAO,MAAM;QAEjB,IAAI,CAAC,OAAO,CAAC,MAAM;QAEnB,IAAI,KACF,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAI,KAAK;aAE1C,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAE,CAAA,KAAK,IAAG;QAGhD,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,+BAA+B;IAC/B,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,IAAI;QAEJ,sBAAsB;QACtB,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,GAAG;YAC7C,IAAI,CAAC,QAAQ,GAAG;YAChB,IAAI,IAAI,CAAC,IAAI,CAAC;YACd,IAAI,CAAC,QAAQ,IAAI;YACjB,OAAO,IAAI,CAAC,SAAS;QAEvB,sBAAsB;QACtB,OAAO,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,GAAG;YACpD,IAAI,QAAQ,GAAG;YACf,IAAI,IAAI,CAAC,IAAI,CAAC;YACd,IAAI,QAAQ,GAAG;YACf,OAAO,EAAE,SAAS;QACpB;QAEA,sBAAsB;QACtB,IAAI,GAAG;QACP,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE;YAC5B,IAAI,IAAI;YACR,IAAI;QACN,OAAO;YACL,IAAI;YACJ,IAAI,IAAI;QACV;QAEA,IAAI,QAAQ;QACZ,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK;YACjC,IAAI,AAAC,CAAA,EAAE,KAAK,CAAC,EAAE,GAAG,CAAA,IAAM,CAAA,EAAE,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK;YAC1C,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI;YACpB,QAAQ,MAAM;QAChB;QACA,MAAO,UAAU,KAAK,IAAI,EAAE,MAAM,EAAE,IAAK;YACvC,IAAI,AAAC,CAAA,EAAE,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK;YACvB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI;YACpB,QAAQ,MAAM;QAChB;QAEA,IAAI,CAAC,MAAM,GAAG,EAAE,MAAM;QACtB,IAAI,UAAU,GAAG;YACf,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG;YAC1B,IAAI,CAAC,MAAM;QACb,6BAA6B;QAC7B,OAAO,IAAI,MAAM,IAAI,EACnB,MAAO,IAAI,EAAE,MAAM,EAAE,IACnB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,EAAE;QAI9B,OAAO,IAAI;IACb;IAEA,sBAAsB;IACtB,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,IAAI;QACJ,IAAI,IAAI,QAAQ,KAAK,KAAK,IAAI,CAAC,QAAQ,KAAK,GAAG;YAC7C,IAAI,QAAQ,GAAG;YACf,MAAM,IAAI,CAAC,GAAG,CAAC;YACf,IAAI,QAAQ,IAAI;YAChB,OAAO;QACT,OAAO,IAAI,IAAI,QAAQ,KAAK,KAAK,IAAI,CAAC,QAAQ,KAAK,GAAG;YACpD,IAAI,CAAC,QAAQ,GAAG;YAChB,MAAM,IAAI,GAAG,CAAC,IAAI;YAClB,IAAI,CAAC,QAAQ,GAAG;YAChB,OAAO;QACT;QAEA,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAEvD,OAAO,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI;IAC9B;IAEA,sCAAsC;IACtC,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,6BAA6B;QAC7B,IAAI,IAAI,QAAQ,KAAK,GAAG;YACtB,IAAI,QAAQ,GAAG;YACf,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YAClB,IAAI,QAAQ,GAAG;YACf,OAAO,EAAE,SAAS;QAEpB,8BAA8B;QAC9B,OAAO,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG;YAC9B,IAAI,CAAC,QAAQ,GAAG;YAChB,IAAI,CAAC,IAAI,CAAC;YACV,IAAI,CAAC,QAAQ,GAAG;YAChB,OAAO,IAAI,CAAC,SAAS;QACvB;QAEA,0CAA0C;QAC1C,IAAI,MAAM,IAAI,CAAC,GAAG,CAAC;QAEnB,yBAAyB;QACzB,IAAI,QAAQ,GAAG;YACb,IAAI,CAAC,QAAQ,GAAG;YAChB,IAAI,CAAC,MAAM,GAAG;YACd,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YAChB,OAAO,IAAI;QACb;QAEA,QAAQ;QACR,IAAI,GAAG;QACP,IAAI,MAAM,GAAG;YACX,IAAI,IAAI;YACR,IAAI;QACN,OAAO;YACL,IAAI;YACJ,IAAI,IAAI;QACV;QAEA,IAAI,QAAQ;QACZ,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK;YACjC,IAAI,AAAC,CAAA,EAAE,KAAK,CAAC,EAAE,GAAG,CAAA,IAAM,CAAA,EAAE,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK;YAC1C,QAAQ,KAAK;YACb,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI;QACtB;QACA,MAAO,UAAU,KAAK,IAAI,EAAE,MAAM,EAAE,IAAK;YACvC,IAAI,AAAC,CAAA,EAAE,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK;YACvB,QAAQ,KAAK;YACb,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI;QACtB;QAEA,yBAAyB;QACzB,IAAI,UAAU,KAAK,IAAI,EAAE,MAAM,IAAI,MAAM,IAAI,EAC3C,MAAO,IAAI,EAAE,MAAM,EAAE,IACnB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,EAAE;QAI9B,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE;QAEpC,IAAI,MAAM,IAAI,EACZ,IAAI,CAAC,QAAQ,GAAG;QAGlB,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,6BAA6B;IAC7B,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IAC3B;IAEA,SAAS,WAAY,IAAI,EAAE,GAAG,EAAE,GAAG;QACjC,IAAI,QAAQ,GAAG,IAAI,QAAQ,GAAG,KAAK,QAAQ;QAC3C,IAAI,MAAM,AAAC,KAAK,MAAM,GAAG,IAAI,MAAM,GAAI;QACvC,IAAI,MAAM,GAAG;QACb,MAAM,AAAC,MAAM,IAAK;QAElB,wEAAwE;QACxE,IAAI,IAAI,KAAK,KAAK,CAAC,EAAE,GAAG;QACxB,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,GAAG;QACvB,IAAI,IAAI,IAAI;QAEZ,IAAI,KAAK,IAAI;QACb,IAAI,QAAQ,AAAC,IAAI,YAAa;QAC9B,IAAI,KAAK,CAAC,EAAE,GAAG;QAEf,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAK;YAC5B,mEAAmE;YACnE,yCAAyC;YACzC,IAAI,SAAS,UAAU;YACvB,IAAI,QAAQ,QAAQ;YACpB,IAAI,OAAO,KAAK,GAAG,CAAC,GAAG,IAAI,MAAM,GAAG;YACpC,IAAK,IAAI,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,KAAK,MAAM,GAAG,IAAI,KAAK,MAAM,IAAK;gBAC7D,IAAI,IAAI,AAAC,IAAI,IAAK;gBAClB,IAAI,KAAK,KAAK,CAAC,EAAE,GAAG;gBACpB,IAAI,IAAI,KAAK,CAAC,EAAE,GAAG;gBACnB,IAAI,IAAI,IAAI;gBACZ,UAAU,AAAC,IAAI,YAAa;gBAC5B,QAAQ,IAAI;YACd;YACA,IAAI,KAAK,CAAC,EAAE,GAAG,QAAQ;YACvB,QAAQ,SAAS;QACnB;QACA,IAAI,UAAU,GACZ,IAAI,KAAK,CAAC,EAAE,GAAG,QAAQ;aAEvB,IAAI,MAAM;QAGZ,OAAO,IAAI,KAAK;IAClB;IAEA,0EAA0E;IAC1E,+EAA+E;IAC/E,4CAA4C;IAC5C,IAAI,cAAc,SAAS,YAAa,IAAI,EAAE,GAAG,EAAE,GAAG;QACpD,IAAI,IAAI,KAAK,KAAK;QAClB,IAAI,IAAI,IAAI,KAAK;QACjB,IAAI,IAAI,IAAI,KAAK;QACjB,IAAI,IAAI;QACR,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QACjB,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG;QAChB,IAAI,MAAM,KAAK;QACf,IAAI,MAAM,OAAO;QAEjB,IAAI,QAAQ,GAAG,KAAK,QAAQ,GAAG,IAAI,QAAQ;QAC3C,IAAI,MAAM,GAAG;QACb,SAAS,GACT,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,IAAI,KAAK,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACrD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,OAAO,EAAC,IAAM;QAChD,MAAM;QACN,SAAS,GACT,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,KAAK,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACrD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,OAAO,EAAC,IAAM;QAChD,MAAM;QACN,SAAS,GACT,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,KAAK,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACrD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,OAAO,EAAC,IAAM;QAChD,MAAM;QACN,SAAS,GACT,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,KAAK,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACrD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,OAAO,EAAC,IAAM;QAChD,MAAM;QACN,SAAS,GACT,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,KAAK,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACrD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,OAAO,EAAC,IAAM;QAChD,MAAM;QACN,SAAS,GACT,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,KAAK,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACrD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,OAAO,EAAC,IAAM;QAChD,MAAM;QACN,SAAS,GACT,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,KAAK,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACrD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,OAAO,EAAC,IAAM;QAChD,MAAM;QACN,SAAS,GACT,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,KAAK,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACrD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,OAAO,EAAC,IAAM;QAChD,MAAM;QACN,SAAS,GACT,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,KAAK,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACrD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,OAAO,EAAC,IAAM;QAChD,MAAM;QACN,SAAS,GACT,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,KAAK,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACrD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,OAAO,EAAC,IAAM;QAChD,MAAM;QACN,UAAU,GACV,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,MAAM,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACtD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,QAAQ,EAAC,IAAM;QACjD,OAAO;QACP,UAAU,GACV,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,MAAM,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACtD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,QAAQ,EAAC,IAAM;QACjD,OAAO;QACP,UAAU,GACV,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,MAAM,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACtD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,QAAQ,EAAC,IAAM;QACjD,OAAO;QACP,UAAU,GACV,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,MAAM,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACtD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,QAAQ,EAAC,IAAM;QACjD,OAAO;QACP,UAAU,GACV,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,MAAM,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACtD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,QAAQ,EAAC,IAAM;QACjD,OAAO;QACP,UAAU,GACV,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,MAAM,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACtD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,QAAQ,EAAC,IAAM;QACjD,OAAO;QACP,UAAU,GACV,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,MAAM,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACtD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,QAAQ,EAAC,IAAM;QACjD,OAAO;QACP,UAAU,GACV,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,AAAC,KAAK,KAAK,IAAI,CAAC,KAAK,OAAQ;QAClC,IAAI,MAAM,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACtD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,QAAQ,EAAC,IAAM;QACjD,OAAO;QACP,UAAU,GACV,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,MAAM,KAAK,IAAI,CAAC,KAAK;QACrB,MAAM,AAAC,MAAM,KAAK,IAAI,CAAC,KAAK,OAAQ;QACpC,KAAK,KAAK,IAAI,CAAC,KAAK;QACpB,IAAI,MAAM,AAAE,CAAA,AAAC,IAAI,KAAM,CAAA,IAAM,CAAA,AAAC,CAAA,MAAM,MAAK,KAAM,EAAC,IAAM;QACtD,IAAI,AAAE,CAAA,AAAC,KAAM,CAAA,QAAQ,EAAC,IAAM,CAAA,IAAM,CAAA,QAAQ,EAAC,IAAM;QACjD,OAAO;QACP,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,EAAE,GAAG;QACP,CAAC,CAAC,GAAG,GAAG;QACR,CAAC,CAAC,GAAG,GAAG;QACR,CAAC,CAAC,GAAG,GAAG;QACR,CAAC,CAAC,GAAG,GAAG;QACR,CAAC,CAAC,GAAG,GAAG;QACR,CAAC,CAAC,GAAG,GAAG;QACR,CAAC,CAAC,GAAG,GAAG;QACR,CAAC,CAAC,GAAG,GAAG;QACR,CAAC,CAAC,GAAG,GAAG;QACR,IAAI,MAAM,GAAG;YACX,CAAC,CAAC,GAAG,GAAG;YACR,IAAI,MAAM;QACZ;QACA,OAAO;IACT;IAEA,gBAAgB;IAChB,IAAI,CAAC,KAAK,IAAI,EACZ,cAAc;IAGhB,SAAS,SAAU,IAAI,EAAE,GAAG,EAAE,GAAG;QAC/B,IAAI,QAAQ,GAAG,IAAI,QAAQ,GAAG,KAAK,QAAQ;QAC3C,IAAI,MAAM,GAAG,KAAK,MAAM,GAAG,IAAI,MAAM;QAErC,IAAI,QAAQ;QACZ,IAAI,UAAU;QACd,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,GAAG,GAAG,IAAK;YACvC,mEAAmE;YACnE,yCAAyC;YACzC,IAAI,SAAS;YACb,UAAU;YACV,IAAI,QAAQ,QAAQ;YACpB,IAAI,OAAO,KAAK,GAAG,CAAC,GAAG,IAAI,MAAM,GAAG;YACpC,IAAK,IAAI,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,KAAK,MAAM,GAAG,IAAI,KAAK,MAAM,IAAK;gBAC7D,IAAI,IAAI,IAAI;gBACZ,IAAI,IAAI,KAAK,KAAK,CAAC,EAAE,GAAG;gBACxB,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,GAAG;gBACvB,IAAI,IAAI,IAAI;gBAEZ,IAAI,KAAK,IAAI;gBACb,SAAS,AAAC,SAAU,CAAA,AAAC,IAAI,YAAa,CAAA,IAAM;gBAC5C,KAAK,AAAC,KAAK,QAAS;gBACpB,QAAQ,KAAK;gBACb,SAAS,AAAC,SAAU,CAAA,OAAO,EAAC,IAAM;gBAElC,WAAW,WAAW;gBACtB,UAAU;YACZ;YACA,IAAI,KAAK,CAAC,EAAE,GAAG;YACf,QAAQ;YACR,SAAS;QACX;QACA,IAAI,UAAU,GACZ,IAAI,KAAK,CAAC,EAAE,GAAG;aAEf,IAAI,MAAM;QAGZ,OAAO,IAAI,KAAK;IAClB;IAEA,SAAS,WAAY,IAAI,EAAE,GAAG,EAAE,GAAG;QACjC,IAAI,OAAO,IAAI;QACf,OAAO,KAAK,IAAI,CAAC,MAAM,KAAK;IAC9B;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG,EAAE,GAAG;QAC3C,IAAI;QACJ,IAAI,MAAM,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM;QAClC,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,MAAM,KAAK,IACvC,MAAM,YAAY,IAAI,EAAE,KAAK;aACxB,IAAI,MAAM,IACf,MAAM,WAAW,IAAI,EAAE,KAAK;aACvB,IAAI,MAAM,MACf,MAAM,SAAS,IAAI,EAAE,KAAK;aAE1B,MAAM,WAAW,IAAI,EAAE,KAAK;QAG9B,OAAO;IACT;IAEA,iCAAiC;IACjC,6DAA6D;IAE7D,SAAS,KAAM,CAAC,EAAE,CAAC;QACjB,IAAI,CAAC,CAAC,GAAG;QACT,IAAI,CAAC,CAAC,GAAG;IACX;IAEA,KAAK,SAAS,CAAC,OAAO,GAAG,SAAS,QAAS,CAAC;QAC1C,IAAI,IAAI,IAAI,MAAM;QAClB,IAAI,IAAI,GAAG,SAAS,CAAC,UAAU,CAAC,KAAK;QACrC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACrB,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG;QAG3B,OAAO;IACT;IAEA,gDAAgD;IAChD,KAAK,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;QAC9C,IAAI,MAAM,KAAK,MAAM,IAAI,GAAG,OAAO;QAEnC,IAAI,KAAK;QACT,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;YAC1B,MAAM,AAAC,CAAA,IAAI,CAAA,KAAO,IAAI,IAAI;YAC1B,MAAM;QACR;QAEA,OAAO;IACT;IAEA,oDAAoD;IACpD,uCAAuC;IACvC,KAAK,SAAS,CAAC,OAAO,GAAG,SAAS,QAAS,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACrE,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;YAC1B,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB;IACF;IAEA,KAAK,SAAS,CAAC,SAAS,GAAG,SAAS,UAAW,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG;QACzE,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK,MAAM,MAAM;QAExC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,MAAM,EAAG;YAC9B,IAAI,IAAI,KAAK;YAEb,IAAI,QAAQ,KAAK,GAAG,CAAC,IAAI,KAAK,EAAE,GAAG;YACnC,IAAI,QAAQ,KAAK,GAAG,CAAC,IAAI,KAAK,EAAE,GAAG;YAEnC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,EAAG;gBAC7B,IAAI,SAAS;gBACb,IAAI,SAAS;gBAEb,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;oBAC1B,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;oBACpB,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;oBAEpB,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,EAAE;oBACxB,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,EAAE;oBAExB,IAAI,KAAK,SAAS,KAAK,SAAS;oBAEhC,KAAK,SAAS,KAAK,SAAS;oBAC5B,KAAK;oBAEL,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK;oBACnB,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK;oBAEnB,IAAI,CAAC,IAAI,IAAI,EAAE,GAAG,KAAK;oBACvB,IAAI,CAAC,IAAI,IAAI,EAAE,GAAG,KAAK;oBAEvB,2BAA2B,GAC3B,IAAI,MAAM,GAAG;wBACX,KAAK,QAAQ,SAAS,QAAQ;wBAE9B,SAAS,QAAQ,SAAS,QAAQ;wBAClC,SAAS;oBACX;gBACF;YACF;QACF;IACF;IAEA,KAAK,SAAS,CAAC,WAAW,GAAG,SAAS,YAAa,CAAC,EAAE,CAAC;QACrD,IAAI,IAAI,KAAK,GAAG,CAAC,GAAG,KAAK;QACzB,IAAI,MAAM,IAAI;QACd,IAAI,IAAI;QACR,IAAK,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,MAAM,EAC/B;QAGF,OAAO,KAAK,IAAI,IAAI;IACtB;IAEA,KAAK,SAAS,CAAC,SAAS,GAAG,SAAS,UAAW,GAAG,EAAE,GAAG,EAAE,CAAC;QACxD,IAAI,KAAK,GAAG;QAEZ,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAK;YAC9B,IAAI,IAAI,GAAG,CAAC,EAAE;YAEd,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,IAAI,EAAE;YACvB,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG;YAEjB,IAAI,GAAG,CAAC,EAAE;YAEV,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE;YACxB,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC;QACpB;IACF;IAEA,KAAK,SAAS,CAAC,YAAY,GAAG,SAAS,aAAc,EAAE,EAAE,CAAC;QACxD,IAAI,QAAQ;QACZ,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAK;YAC9B,IAAI,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,GAAG,KAAK,SACtC,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,KACvB;YAEF,EAAE,CAAC,EAAE,GAAG,IAAI;YAEZ,IAAI,IAAI,WACN,QAAQ;iBAER,QAAQ,IAAI,YAAY;QAE5B;QAEA,OAAO;IACT;IAEA,KAAK,SAAS,CAAC,UAAU,GAAG,SAAS,WAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAC9D,IAAI,QAAQ;QACZ,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAK;YAC5B,QAAQ,QAAS,CAAA,EAAE,CAAC,EAAE,GAAG,CAAA;YAEzB,GAAG,CAAC,IAAI,EAAE,GAAG,QAAQ;YAAQ,QAAQ,UAAU;YAC/C,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,QAAQ;YAAQ,QAAQ,UAAU;QACrD;QAEA,kBAAkB;QAClB,IAAK,IAAI,IAAI,KAAK,IAAI,GAAG,EAAE,EACzB,GAAG,CAAC,EAAE,GAAG;QAGX,OAAO,UAAU;QACjB,OAAO,AAAC,CAAA,QAAQ,KAAM,MAAO;IAC/B;IAEA,KAAK,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC;QACpC,IAAI,KAAK,IAAI,MAAM;QACnB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACrB,EAAE,CAAC,EAAE,GAAG;QAGV,OAAO;IACT;IAEA,KAAK,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC,EAAE,CAAC,EAAE,GAAG;QAC5C,IAAI,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,EAAE,MAAM,EAAE,EAAE,MAAM;QAE/C,IAAI,MAAM,IAAI,CAAC,OAAO,CAAC;QAEvB,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;QAElB,IAAI,MAAM,IAAI,MAAM;QACpB,IAAI,OAAO,IAAI,MAAM;QACrB,IAAI,OAAO,IAAI,MAAM;QAErB,IAAI,OAAO,IAAI,MAAM;QACrB,IAAI,QAAQ,IAAI,MAAM;QACtB,IAAI,QAAQ,IAAI,MAAM;QAEtB,IAAI,OAAO,IAAI,KAAK;QACpB,KAAK,MAAM,GAAG;QAEd,IAAI,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,KAAK;QACxC,IAAI,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM;QAEzC,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,MAAM,MAAM,GAAG;QACtC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,OAAO,OAAO,GAAG;QAEzC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;YAC1B,IAAI,KAAK,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE;YAChD,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE;YACjD,IAAI,CAAC,EAAE,GAAG;QACZ;QAEA,IAAI,CAAC,SAAS,CAAC,MAAM,MAAM;QAC3B,IAAI,CAAC,SAAS,CAAC,MAAM,MAAM,MAAM,GAAG,GAAG;QACvC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG;QACxB,IAAI,CAAC,YAAY,CAAC,MAAM;QAExB,IAAI,QAAQ,GAAG,EAAE,QAAQ,GAAG,EAAE,QAAQ;QACtC,IAAI,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM;QAChC,OAAO,IAAI,KAAK;IAClB;IAEA,2BAA2B;IAC3B,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,IAAI,MAAM,IAAI,GAAG;QACjB,IAAI,KAAK,GAAG,IAAI,MAAM,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM;QAC9C,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK;IACzB;IAEA,yBAAyB;IACzB,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,IAAI,MAAM,IAAI,GAAG;QACjB,IAAI,KAAK,GAAG,IAAI,MAAM,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM;QAC9C,OAAO,WAAW,IAAI,EAAE,KAAK;IAC/B;IAEA,0BAA0B;IAC1B,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI;IACrC;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACtC,OAAO,OAAO,QAAQ;QACtB,OAAO,MAAM;QAEb,QAAQ;QACR,IAAI,QAAQ;QACZ,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,IAAK;YACpC,IAAI,IAAI,AAAC,CAAA,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK;YAC9B,IAAI,KAAK,AAAC,CAAA,IAAI,SAAQ,IAAM,CAAA,QAAQ,SAAQ;YAC5C,UAAU;YACV,SAAS,AAAC,IAAI,YAAa;YAC3B,4BAA4B;YAC5B,SAAS,OAAO;YAChB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,KAAK;QACvB;QAEA,IAAI,UAAU,GAAG;YACf,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YAChB,IAAI,CAAC,MAAM;QACb;QACA,IAAI,CAAC,MAAM,GAAG,QAAQ,IAAI,IAAI,IAAI,CAAC,MAAM;QAEzC,OAAO,IAAI;IACb;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAC5B;IAEA,kBAAkB;IAClB,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS;QAC1B,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI;IACtB;IAEA,2BAA2B;IAC3B,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;QAC3B,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;IAC7B;IAEA,0BAA0B;IAC1B,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,IAAI,IAAI,WAAW;QACnB,IAAI,EAAE,MAAM,KAAK,GAAG,OAAO,IAAI,GAAG;QAElC,sBAAsB;QACtB,IAAI,MAAM,IAAI;QACd,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,KAAK,MAAM,IAAI,GAAG,GAAI;YAClD,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG;QAClB;QAEA,IAAI,EAAE,IAAI,EAAE,MAAM,EAChB,IAAK,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,MAAM,EAAE,KAAK,IAAI,EAAE,GAAG,GAAI;YACtD,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG;YAEhB,MAAM,IAAI,GAAG,CAAC;QAChB;QAGF,OAAO;IACT;IAEA,sBAAsB;IACtB,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,IAAI;QACzC,OAAO,OAAO,SAAS,YAAY,QAAQ;QAC3C,IAAI,IAAI,OAAO;QACf,IAAI,IAAI,AAAC,CAAA,OAAO,CAAA,IAAK;QACrB,IAAI,YAAY,AAAC,cAAe,KAAK,KAAQ,KAAK;QAClD,IAAI;QAEJ,IAAI,MAAM,GAAG;YACX,IAAI,QAAQ;YAEZ,IAAK,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,IAAK;gBAChC,IAAI,WAAW,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;gBAC/B,IAAI,IAAI,AAAE,CAAA,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK,YAAa;gBAC5C,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI;gBACpB,QAAQ,aAAc,KAAK;YAC7B;YAEA,IAAI,OAAO;gBACT,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;gBAChB,IAAI,CAAC,MAAM;YACb;QACF;QAEA,IAAI,MAAM,GAAG;YACX,IAAK,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,KAAK,GAAG,IAChC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE;YAGnC,IAAK,IAAI,GAAG,IAAI,GAAG,IACjB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YAGlB,IAAI,CAAC,MAAM,IAAI;QACjB;QAEA,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,IAAI;QACvC,8BAA8B;QAC9B,OAAO,IAAI,CAAC,QAAQ,KAAK;QACzB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB;IAEA,uBAAuB;IACvB,sDAAsD;IACtD,yEAAyE;IACzE,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,IAAI,EAAE,IAAI,EAAE,QAAQ;QACzD,OAAO,OAAO,SAAS,YAAY,QAAQ;QAC3C,IAAI;QACJ,IAAI,MACF,IAAI,AAAC,CAAA,OAAQ,OAAO,EAAE,IAAK;aAE3B,IAAI;QAGN,IAAI,IAAI,OAAO;QACf,IAAI,IAAI,KAAK,GAAG,CAAC,AAAC,CAAA,OAAO,CAAA,IAAK,IAAI,IAAI,CAAC,MAAM;QAC7C,IAAI,OAAO,YAAa,AAAC,cAAc,KAAM;QAC7C,IAAI,cAAc;QAElB,KAAK;QACL,IAAI,KAAK,GAAG,CAAC,GAAG;QAEhB,kCAAkC;QAClC,IAAI,aAAa;YACf,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACrB,YAAY,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE;YAEtC,YAAY,MAAM,GAAG;QACvB;QAEA,IAAI,MAAM;aAEH,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG;YAC1B,IAAI,CAAC,MAAM,IAAI;YACf,IAAK,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,IAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;QAErC,OAAO;YACL,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YAChB,IAAI,CAAC,MAAM,GAAG;QAChB;QAEA,IAAI,QAAQ;QACZ,IAAK,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,KAAK,KAAM,CAAA,UAAU,KAAK,KAAK,CAAA,GAAI,IAAK;YAChE,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,AAAC,SAAU,KAAK,IAAO,SAAS;YAChD,QAAQ,OAAO;QACjB;QAEA,8BAA8B;QAC9B,IAAI,eAAe,UAAU,GAC3B,YAAY,KAAK,CAAC,YAAY,MAAM,GAAG,GAAG;QAG5C,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG;YACrB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YAChB,IAAI,CAAC,MAAM,GAAG;QAChB;QAEA,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,IAAI,EAAE,IAAI,EAAE,QAAQ;QACvD,8BAA8B;QAC9B,OAAO,IAAI,CAAC,QAAQ,KAAK;QACzB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM;IACjC;IAEA,aAAa;IACb,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,IAAI;QACrC,OAAO,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAC5B;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,IAAI;QACvC,OAAO,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC;IAC7B;IAEA,cAAc;IACd,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,IAAI;QACrC,OAAO,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAC5B;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,IAAI;QACvC,OAAO,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC;IAC7B;IAEA,uBAAuB;IACvB,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACtC,OAAO,OAAO,QAAQ,YAAY,OAAO;QACzC,IAAI,IAAI,MAAM;QACd,IAAI,IAAI,AAAC,CAAA,MAAM,CAAA,IAAK;QACpB,IAAI,IAAI,KAAK;QAEb,wDAAwD;QACxD,IAAI,IAAI,CAAC,MAAM,IAAI,GAAG,OAAO;QAE7B,uBAAuB;QACvB,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE;QAErB,OAAO,CAAC,CAAE,CAAA,IAAI,CAAA;IAChB;IAEA,+CAA+C;IAC/C,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,IAAI;QACzC,OAAO,OAAO,SAAS,YAAY,QAAQ;QAC3C,IAAI,IAAI,OAAO;QACf,IAAI,IAAI,AAAC,CAAA,OAAO,CAAA,IAAK;QAErB,OAAO,IAAI,CAAC,QAAQ,KAAK,GAAG;QAE5B,IAAI,IAAI,CAAC,MAAM,IAAI,GACjB,OAAO,IAAI;QAGb,IAAI,MAAM,GACR;QAEF,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM;QAErC,IAAI,MAAM,GAAG;YACX,IAAI,OAAO,YAAa,AAAC,cAAc,KAAM;YAC7C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI;QACjC;QAEA,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG;YACrB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YAChB,IAAI,CAAC,MAAM,GAAG;QAChB;QAEA,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,oCAAoC;IACpC,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,IAAI;QACvC,OAAO,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC;IAC7B;IAEA,mCAAmC;IACnC,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACtC,OAAO,OAAO,QAAQ;QACtB,OAAO,MAAM;QACb,IAAI,MAAM,GAAG,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;QAEhC,uBAAuB;QACvB,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG;YACvB,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,AAAC,CAAA,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK,KAAK;gBAClD,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,MAAO,CAAA,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAA;gBACvC,IAAI,CAAC,QAAQ,GAAG;gBAChB,OAAO,IAAI;YACb;YAEA,IAAI,CAAC,QAAQ,GAAG;YAChB,IAAI,CAAC,KAAK,CAAC;YACX,IAAI,CAAC,QAAQ,GAAG;YAChB,OAAO,IAAI;QACb;QAEA,qBAAqB;QACrB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,GAAG;QACxC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI;QAEjB,QAAQ;QACR,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,WAAW,IAAK;YAClE,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI;YACjB,IAAI,MAAM,IAAI,CAAC,MAAM,GAAG,GACtB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG;iBAEpB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;QAErB;QACA,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI;QAExC,OAAO,IAAI;IACb;IAEA,0CAA0C;IAC1C,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACtC,OAAO,OAAO,QAAQ;QACtB,OAAO,MAAM;QACb,IAAI,MAAM,GAAG,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;QAEhC,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG;YACvB,IAAI,CAAC,QAAQ,GAAG;YAChB,IAAI,CAAC,KAAK,CAAC;YACX,IAAI,CAAC,QAAQ,GAAG;YAChB,OAAO,IAAI;QACb;QAEA,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI;QAEjB,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,GAAG;YAC1C,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YAC9B,IAAI,CAAC,QAAQ,GAAG;QAClB,OACE,QAAQ;QACR,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,GAAG,IAAK;YACzD,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI;YACjB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI;QACvB;QAGF,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAC5B;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAC5B;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS;QAC3B,IAAI,CAAC,QAAQ,GAAG;QAEhB,OAAO,IAAI;IACb;IAEA,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS;QAC1B,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI;IAC1B;IAEA,GAAG,SAAS,CAAC,YAAY,GAAG,SAAS,aAAc,GAAG,EAAE,GAAG,EAAE,KAAK;QAChE,IAAI,MAAM,IAAI,MAAM,GAAG;QACvB,IAAI;QAEJ,IAAI,CAAC,OAAO,CAAC;QAEb,IAAI;QACJ,IAAI,QAAQ;QACZ,IAAK,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAAK;YAC/B,IAAI,AAAC,CAAA,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,GAAG,CAAA,IAAK;YAClC,IAAI,QAAQ,AAAC,CAAA,IAAI,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK;YACjC,KAAK,QAAQ;YACb,QAAQ,AAAC,CAAA,KAAK,EAAC,IAAM,CAAA,AAAC,QAAQ,YAAa,CAAA;YAC3C,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,GAAG,IAAI;QAC9B;QACA,MAAO,IAAI,IAAI,CAAC,MAAM,GAAG,OAAO,IAAK;YACnC,IAAI,AAAC,CAAA,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,GAAG,CAAA,IAAK;YAClC,QAAQ,KAAK;YACb,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,GAAG,IAAI;QAC9B;QAEA,IAAI,UAAU,GAAG,OAAO,IAAI,CAAC,KAAK;QAElC,uBAAuB;QACvB,OAAO,UAAU;QACjB,QAAQ;QACR,IAAK,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,IAAK;YAChC,IAAI,CAAE,CAAA,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK;YAC3B,QAAQ,KAAK;YACb,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI;QACtB;QACA,IAAI,CAAC,QAAQ,GAAG;QAEhB,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAU,GAAG,EAAE,IAAI;QAClD,IAAI,QAAQ,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM;QAEpC,IAAI,IAAI,IAAI,CAAC,KAAK;QAClB,IAAI,IAAI;QAER,YAAY;QACZ,IAAI,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,EAAE,GAAG;QAClC,IAAI,UAAU,IAAI,CAAC,UAAU,CAAC;QAC9B,QAAQ,KAAK;QACb,IAAI,UAAU,GAAG;YACf,IAAI,EAAE,KAAK,CAAC;YACZ,EAAE,MAAM,CAAC;YACT,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,EAAE,GAAG;QAChC;QAEA,sBAAsB;QACtB,IAAI,IAAI,EAAE,MAAM,GAAG,EAAE,MAAM;QAC3B,IAAI;QAEJ,IAAI,SAAS,OAAO;YAClB,IAAI,IAAI,GAAG;YACX,EAAE,MAAM,GAAG,IAAI;YACf,EAAE,KAAK,GAAG,IAAI,MAAM,EAAE,MAAM;YAC5B,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAC5B,EAAE,KAAK,CAAC,EAAE,GAAG;QAEjB;QAEA,IAAI,OAAO,EAAE,KAAK,GAAG,YAAY,CAAC,GAAG,GAAG;QACxC,IAAI,KAAK,QAAQ,KAAK,GAAG;YACvB,IAAI;YACJ,IAAI,GACF,EAAE,KAAK,CAAC,EAAE,GAAG;QAEjB;QAEA,IAAK,IAAI,IAAI,IAAI,GAAG,KAAK,GAAG,IAAK;YAC/B,IAAI,KAAK,AAAC,CAAA,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,EAAE,GAAG,CAAA,IAAK,YACpC,CAAA,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,EAAE,GAAG,CAAA;YAE/B,0EAA0E;YAC1E,cAAc;YACd,KAAK,KAAK,GAAG,CAAC,AAAC,KAAK,MAAO,GAAG;YAE9B,EAAE,YAAY,CAAC,GAAG,IAAI;YACtB,MAAO,EAAE,QAAQ,KAAK,EAAG;gBACvB;gBACA,EAAE,QAAQ,GAAG;gBACb,EAAE,YAAY,CAAC,GAAG,GAAG;gBACrB,IAAI,CAAC,EAAE,MAAM,IACX,EAAE,QAAQ,IAAI;YAElB;YACA,IAAI,GACF,EAAE,KAAK,CAAC,EAAE,GAAG;QAEjB;QACA,IAAI,GACF,EAAE,KAAK;QAET,EAAE,KAAK;QAEP,cAAc;QACd,IAAI,SAAS,SAAS,UAAU,GAC9B,EAAE,MAAM,CAAC;QAGX,OAAO;YACL,KAAK,KAAK;YACV,KAAK;QACP;IACF;IAEA,2DAA2D;IAC3D,sDAAsD;IACtD,+BAA+B;IAC/B,2DAA2D;IAC3D,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,GAAG,EAAE,IAAI,EAAE,QAAQ;QACxD,OAAO,CAAC,IAAI,MAAM;QAElB,IAAI,IAAI,CAAC,MAAM,IACb,OAAO;YACL,KAAK,IAAI,GAAG;YACZ,KAAK,IAAI,GAAG;QACd;QAGF,IAAI,KAAK,KAAK;QACd,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,GAAG;YAC7C,MAAM,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,KAAK;YAE7B,IAAI,SAAS,OACX,MAAM,IAAI,GAAG,CAAC,GAAG;YAGnB,IAAI,SAAS,OAAO;gBAClB,MAAM,IAAI,GAAG,CAAC,GAAG;gBACjB,IAAI,YAAY,IAAI,QAAQ,KAAK,GAC/B,IAAI,IAAI,CAAC;YAEb;YAEA,OAAO;gBACL,KAAK;gBACL,KAAK;YACP;QACF;QAEA,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,GAAG;YAC7C,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,IAAI;YAE7B,IAAI,SAAS,OACX,MAAM,IAAI,GAAG,CAAC,GAAG;YAGnB,OAAO;gBACL,KAAK;gBACL,KAAK,IAAI,GAAG;YACd;QACF;QAEA,IAAI,AAAC,CAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,QAAQ,AAAD,MAAO,GAAG;YACxC,MAAM,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,GAAG,IAAI;YAEnC,IAAI,SAAS,OAAO;gBAClB,MAAM,IAAI,GAAG,CAAC,GAAG;gBACjB,IAAI,YAAY,IAAI,QAAQ,KAAK,GAC/B,IAAI,IAAI,CAAC;YAEb;YAEA,OAAO;gBACL,KAAK,IAAI,GAAG;gBACZ,KAAK;YACP;QACF;QAEA,0CAA0C;QAE1C,gDAAgD;QAChD,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,GAC9C,OAAO;YACL,KAAK,IAAI,GAAG;YACZ,KAAK,IAAI;QACX;QAGF,uBAAuB;QACvB,IAAI,IAAI,MAAM,KAAK,GAAG;YACpB,IAAI,SAAS,OACX,OAAO;gBACL,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE;gBAC3B,KAAK;YACP;YAGF,IAAI,SAAS,OACX,OAAO;gBACL,KAAK;gBACL,KAAK,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE;YACpC;YAGF,OAAO;gBACL,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE;gBAC3B,KAAK,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE;YACpC;QACF;QAEA,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK;IAC5B;IAEA,sBAAsB;IACtB,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,OAAO,OAAO,GAAG;IAC3C;IAEA,sBAAsB;IACtB,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,OAAO,OAAO,GAAG;IAC3C;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,OAAO,MAAM,GAAG;IAC1C;IAEA,6BAA6B;IAC7B,GAAG,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAU,GAAG;QAC5C,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC;QAErB,6BAA6B;QAC7B,IAAI,GAAG,GAAG,CAAC,MAAM,IAAI,OAAO,GAAG,GAAG;QAElC,IAAI,MAAM,GAAG,GAAG,CAAC,QAAQ,KAAK,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,GAAG;QAE3D,IAAI,OAAO,IAAI,KAAK,CAAC;QACrB,IAAI,KAAK,IAAI,KAAK,CAAC;QACnB,IAAI,MAAM,IAAI,GAAG,CAAC;QAElB,aAAa;QACb,IAAI,MAAM,KAAK,OAAO,KAAK,QAAQ,GAAG,OAAO,GAAG,GAAG;QAEnD,WAAW;QACX,OAAO,GAAG,GAAG,CAAC,QAAQ,KAAK,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;IAChE;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,OAAO;QACd,IAAI,IAAI,AAAC,WAAW;QAEpB,IAAI,MAAM;QACV,IAAK,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,KAAK,GAAG,IACpC,MAAM,AAAC,CAAA,IAAI,MAAO,CAAA,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAA,CAAC,IAAK;QAG1C,OAAO;IACT;IAEA,8BAA8B;IAC9B,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACtC,OAAO,OAAO;QAEd,IAAI,QAAQ;QACZ,IAAK,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,KAAK,GAAG,IAAK;YACzC,IAAI,IAAI,AAAC,CAAA,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK,QAAQ;YACtC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,AAAC,IAAI,MAAO;YAC5B,QAAQ,IAAI;QACd;QAEA,OAAO,IAAI,CAAC,KAAK;IACnB;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAC5B;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC;QAClC,OAAO,EAAE,QAAQ,KAAK;QACtB,OAAO,CAAC,EAAE,MAAM;QAEhB,IAAI,IAAI,IAAI;QACZ,IAAI,IAAI,EAAE,KAAK;QAEf,IAAI,EAAE,QAAQ,KAAK,GACjB,IAAI,EAAE,IAAI,CAAC;aAEX,IAAI,EAAE,KAAK;QAGb,oBAAoB;QACpB,IAAI,IAAI,IAAI,GAAG;QACf,IAAI,IAAI,IAAI,GAAG;QAEf,oBAAoB;QACpB,IAAI,IAAI,IAAI,GAAG;QACf,IAAI,IAAI,IAAI,GAAG;QAEf,IAAI,IAAI;QAER,MAAO,EAAE,MAAM,MAAM,EAAE,MAAM,GAAI;YAC/B,EAAE,MAAM,CAAC;YACT,EAAE,MAAM,CAAC;YACT,EAAE;QACJ;QAEA,IAAI,KAAK,EAAE,KAAK;QAChB,IAAI,KAAK,EAAE,KAAK;QAEhB,MAAO,CAAC,EAAE,MAAM,GAAI;YAClB,IAAK,IAAI,IAAI,GAAG,KAAK,GAAG,AAAC,CAAA,EAAE,KAAK,CAAC,EAAE,GAAG,EAAC,MAAO,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO;YACvE,IAAI,IAAI,GAAG;gBACT,EAAE,MAAM,CAAC;gBACT,MAAO,MAAM,EAAG;oBACd,IAAI,EAAE,KAAK,MAAM,EAAE,KAAK,IAAI;wBAC1B,EAAE,IAAI,CAAC;wBACP,EAAE,IAAI,CAAC;oBACT;oBAEA,EAAE,MAAM,CAAC;oBACT,EAAE,MAAM,CAAC;gBACX;YACF;YAEA,IAAK,IAAI,IAAI,GAAG,KAAK,GAAG,AAAC,CAAA,EAAE,KAAK,CAAC,EAAE,GAAG,EAAC,MAAO,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO;YACvE,IAAI,IAAI,GAAG;gBACT,EAAE,MAAM,CAAC;gBACT,MAAO,MAAM,EAAG;oBACd,IAAI,EAAE,KAAK,MAAM,EAAE,KAAK,IAAI;wBAC1B,EAAE,IAAI,CAAC;wBACP,EAAE,IAAI,CAAC;oBACT;oBAEA,EAAE,MAAM,CAAC;oBACT,EAAE,MAAM,CAAC;gBACX;YACF;YAEA,IAAI,EAAE,GAAG,CAAC,MAAM,GAAG;gBACjB,EAAE,IAAI,CAAC;gBACP,EAAE,IAAI,CAAC;gBACP,EAAE,IAAI,CAAC;YACT,OAAO;gBACL,EAAE,IAAI,CAAC;gBACP,EAAE,IAAI,CAAC;gBACP,EAAE,IAAI,CAAC;YACT;QACF;QAEA,OAAO;YACL,GAAG;YACH,GAAG;YACH,KAAK,EAAE,MAAM,CAAC;QAChB;IACF;IAEA,gDAAgD;IAChD,6CAA6C;IAC7C,yCAAyC;IACzC,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,CAAC;QACtC,OAAO,EAAE,QAAQ,KAAK;QACtB,OAAO,CAAC,EAAE,MAAM;QAEhB,IAAI,IAAI,IAAI;QACZ,IAAI,IAAI,EAAE,KAAK;QAEf,IAAI,EAAE,QAAQ,KAAK,GACjB,IAAI,EAAE,IAAI,CAAC;aAEX,IAAI,EAAE,KAAK;QAGb,IAAI,KAAK,IAAI,GAAG;QAChB,IAAI,KAAK,IAAI,GAAG;QAEhB,IAAI,QAAQ,EAAE,KAAK;QAEnB,MAAO,EAAE,IAAI,CAAC,KAAK,KAAK,EAAE,IAAI,CAAC,KAAK,EAAG;YACrC,IAAK,IAAI,IAAI,GAAG,KAAK,GAAG,AAAC,CAAA,EAAE,KAAK,CAAC,EAAE,GAAG,EAAC,MAAO,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO;YACvE,IAAI,IAAI,GAAG;gBACT,EAAE,MAAM,CAAC;gBACT,MAAO,MAAM,EAAG;oBACd,IAAI,GAAG,KAAK,IACV,GAAG,IAAI,CAAC;oBAGV,GAAG,MAAM,CAAC;gBACZ;YACF;YAEA,IAAK,IAAI,IAAI,GAAG,KAAK,GAAG,AAAC,CAAA,EAAE,KAAK,CAAC,EAAE,GAAG,EAAC,MAAO,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO;YACvE,IAAI,IAAI,GAAG;gBACT,EAAE,MAAM,CAAC;gBACT,MAAO,MAAM,EAAG;oBACd,IAAI,GAAG,KAAK,IACV,GAAG,IAAI,CAAC;oBAGV,GAAG,MAAM,CAAC;gBACZ;YACF;YAEA,IAAI,EAAE,GAAG,CAAC,MAAM,GAAG;gBACjB,EAAE,IAAI,CAAC;gBACP,GAAG,IAAI,CAAC;YACV,OAAO;gBACL,EAAE,IAAI,CAAC;gBACP,GAAG,IAAI,CAAC;YACV;QACF;QAEA,IAAI;QACJ,IAAI,EAAE,IAAI,CAAC,OAAO,GAChB,MAAM;aAEN,MAAM;QAGR,IAAI,IAAI,IAAI,CAAC,KAAK,GAChB,IAAI,IAAI,CAAC;QAGX,OAAO;IACT;IAEA,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,GAAG;QACjC,IAAI,IAAI,MAAM,IAAI,OAAO,IAAI,CAAC,GAAG;QAEjC,IAAI,IAAI,IAAI,CAAC,KAAK;QAClB,IAAI,IAAI,IAAI,KAAK;QACjB,EAAE,QAAQ,GAAG;QACb,EAAE,QAAQ,GAAG;QAEb,8BAA8B;QAC9B,IAAK,IAAI,QAAQ,GAAG,EAAE,MAAM,MAAM,EAAE,MAAM,IAAI,QAAS;YACrD,EAAE,MAAM,CAAC;YACT,EAAE,MAAM,CAAC;QACX;QAEA,GAAG;YACD,MAAO,EAAE,MAAM,GACb,EAAE,MAAM,CAAC;YAEX,MAAO,EAAE,MAAM,GACb,EAAE,MAAM,CAAC;YAGX,IAAI,IAAI,EAAE,GAAG,CAAC;YACd,IAAI,IAAI,GAAG;gBACT,sDAAsD;gBACtD,IAAI,IAAI;gBACR,IAAI;gBACJ,IAAI;YACN,OAAO,IAAI,MAAM,KAAK,EAAE,IAAI,CAAC,OAAO,GAClC;YAGF,EAAE,IAAI,CAAC;QACT,QAAS,MAAM;QAEf,OAAO,EAAE,MAAM,CAAC;IAClB;IAEA,oCAAoC;IACpC,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;IAC/B;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS;QAC7B,OAAO,AAAC,CAAA,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAA,MAAO;IACjC;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS;QAC5B,OAAO,AAAC,CAAA,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAA,MAAO;IACjC;IAEA,yBAAyB;IACzB,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;IACzB;IAEA,wCAAwC;IACxC,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACtC,OAAO,OAAO,QAAQ;QACtB,IAAI,IAAI,MAAM;QACd,IAAI,IAAI,AAAC,CAAA,MAAM,CAAA,IAAK;QACpB,IAAI,IAAI,KAAK;QAEb,wDAAwD;QACxD,IAAI,IAAI,CAAC,MAAM,IAAI,GAAG;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI;YACjB,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI;YACjB,OAAO,IAAI;QACb;QAEA,mCAAmC;QACnC,IAAI,QAAQ;QACZ,IAAK,IAAI,IAAI,GAAG,UAAU,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,IAAK;YACnD,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YACxB,KAAK;YACL,QAAQ,MAAM;YACd,KAAK;YACL,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;QAClB;QACA,IAAI,UAAU,GAAG;YACf,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YAChB,IAAI,CAAC,MAAM;QACb;QACA,OAAO,IAAI;IACb;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS;QAC7B,OAAO,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK;IAChD;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,IAAI,WAAW,MAAM;QAErB,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,UAAU,OAAO;QAC7C,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,UAAU,OAAO;QAE5C,IAAI,CAAC,KAAK;QAEV,IAAI;QACJ,IAAI,IAAI,CAAC,MAAM,GAAG,GAChB,MAAM;aACD;YACL,IAAI,UACF,MAAM,CAAC;YAGT,OAAO,OAAO,WAAW;YAEzB,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YACxB,MAAM,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK;QACvC;QACA,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,OAAO,CAAC,MAAM;QACvC,OAAO;IACT;IAEA,kCAAkC;IAClC,wBAAwB;IACxB,yBAAyB;IACzB,yBAAyB;IACzB,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,GAAG,OAAO;QACtD,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,GAAG,OAAO;QAEtD,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC;QACpB,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,OAAO,CAAC,MAAM;QACvC,OAAO;IACT;IAEA,sBAAsB;IACtB,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,gDAAgD;QAChD,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE,OAAO;QACrC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,EAAE,OAAO;QAErC,IAAI,MAAM;QACV,IAAK,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,KAAK,GAAG,IAAK;YACzC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG;YACxB,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,GAAG;YAEvB,IAAI,MAAM,GAAG;YACb,IAAI,IAAI,GACN,MAAM;iBACD,IAAI,IAAI,GACb,MAAM;YAER;QACF;QACA,OAAO;IACT;IAEA,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS;IAC5B;IAEA,GAAG,SAAS,CAAC,EAAE,GAAG,SAAS,GAAI,GAAG;QAChC,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS;IAC3B;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ;IAC3B;IAEA,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ;IAC1B;IAEA,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS;IAC5B;IAEA,GAAG,SAAS,CAAC,EAAE,GAAG,SAAS,GAAI,GAAG;QAChC,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS;IAC3B;IAEA,GAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,GAAG;QACpC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ;IAC3B;IAEA,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ;IAC1B;IAEA,GAAG,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,GAAG;QAClC,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS;IAC5B;IAEA,GAAG,SAAS,CAAC,EAAE,GAAG,SAAS,GAAI,GAAG;QAChC,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS;IAC3B;IAEA,EAAE;IACF,6EAA6E;IAC7E,qBAAqB;IACrB,EAAE;IACF,GAAG,GAAG,GAAG,SAAS,IAAK,GAAG;QACxB,OAAO,IAAI,IAAI;IACjB;IAEA,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACtC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE;QAClB,OAAO,IAAI,CAAC,QAAQ,KAAK,GAAG;QAC5B,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC;IACvC;IAEA,GAAG,SAAS,CAAC,OAAO,GAAG,SAAS;QAC9B,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI;IAClC;IAEA,GAAG,SAAS,CAAC,SAAS,GAAG,SAAS,UAAW,GAAG;QAC9C,IAAI,CAAC,GAAG,GAAG;QACX,OAAO,IAAI;IACb;IAEA,GAAG,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAU,GAAG;QAC5C,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE;QAClB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,GAAG;QACxC,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;IAC5B;IAEA,GAAG,SAAS,CAAC,OAAO,GAAG,SAAS,QAAS,GAAG;QAC1C,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;IAC7B;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,GAAG;QACxC,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;IAC5B;IAEA,GAAG,SAAS,CAAC,OAAO,GAAG,SAAS,QAAS,GAAG;QAC1C,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;IAC7B;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,GAAG;QACxC,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;IAC5B;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,GAAG;QACxC,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE;QACxB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;IAC5B;IAEA,GAAG,SAAS,CAAC,OAAO,GAAG,SAAS,QAAS,GAAG;QAC1C,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE;QACxB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;IAC7B;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS;QAC7B,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI;IAC1B;IAEA,GAAG,SAAS,CAAC,OAAO,GAAG,SAAS;QAC9B,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI;IAC3B;IAEA,qBAAqB;IACrB,GAAG,SAAS,CAAC,OAAO,GAAG,SAAS;QAC9B,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI;IAC3B;IAEA,GAAG,SAAS,CAAC,OAAO,GAAG,SAAS;QAC9B,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI;IAC3B;IAEA,iDAAiD;IACjD,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS;QAC7B,OAAO,IAAI,CAAC,GAAG,EAAE;QACjB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI;IAC1B;IAEA,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAQ,GAAG;QACxC,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,EAAE;QAC7B,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;IAC5B;IAEA,yCAAyC;IACzC,IAAI,SAAS;QACX,MAAM;QACN,MAAM;QACN,MAAM;QACN,QAAQ;IACV;IAEA,wBAAwB;IACxB,SAAS,OAAQ,IAAI,EAAE,CAAC;QACtB,gBAAgB;QAChB,IAAI,CAAC,IAAI,GAAG;QACZ,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,GAAG;QACnB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,SAAS;QACzB,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAE7C,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI;IACtB;IAEA,OAAO,SAAS,CAAC,IAAI,GAAG,SAAS;QAC/B,IAAI,MAAM,IAAI,GAAG;QACjB,IAAI,KAAK,GAAG,IAAI,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG;QACzC,OAAO;IACT;IAEA,OAAO,SAAS,CAAC,OAAO,GAAG,SAAS,QAAS,GAAG;QAC9C,wCAAwC;QACxC,6DAA6D;QAC7D,IAAI,IAAI;QACR,IAAI;QAEJ,GAAG;YACD,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG;YACtB,IAAI,IAAI,CAAC,KAAK,CAAC;YACf,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG;YACnB,OAAO,EAAE,SAAS;QACpB,QAAS,OAAO,IAAI,CAAC,CAAC,EAAE;QAExB,IAAI,MAAM,OAAO,IAAI,CAAC,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,QAAQ,GAAG;YACb,EAAE,KAAK,CAAC,EAAE,GAAG;YACb,EAAE,MAAM,GAAG;QACb,OAAO,IAAI,MAAM,GACf,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;aAEb,IAAI,EAAE,KAAK,KAAK,WACd,sBAAsB;QACtB,EAAE,KAAK;aAEP,sBAAsB;QACtB,EAAE,MAAM;QAIZ,OAAO;IACT;IAEA,OAAO,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,KAAK,EAAE,GAAG;QACjD,MAAM,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG;IAC1B;IAEA,OAAO,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QAC1C,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB;IAEA,SAAS;QACP,OAAO,IAAI,CACT,IAAI,EACJ,QACA;IACJ;IACA,SAAS,MAAM;IAEf,KAAK,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,KAAK,EAAE,MAAM;QAClD,oBAAoB;QACpB,IAAI,OAAO;QAEX,IAAI,SAAS,KAAK,GAAG,CAAC,MAAM,MAAM,EAAE;QACpC,IAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAC1B,OAAO,KAAK,CAAC,EAAE,GAAG,MAAM,KAAK,CAAC,EAAE;QAElC,OAAO,MAAM,GAAG;QAEhB,IAAI,MAAM,MAAM,IAAI,GAAG;YACrB,MAAM,KAAK,CAAC,EAAE,GAAG;YACjB,MAAM,MAAM,GAAG;YACf;QACF;QAEA,mBAAmB;QACnB,IAAI,OAAO,MAAM,KAAK,CAAC,EAAE;QACzB,OAAO,KAAK,CAAC,OAAO,MAAM,GAAG,GAAG,OAAO;QAEvC,IAAK,IAAI,IAAI,IAAI,MAAM,MAAM,EAAE,IAAK;YAClC,IAAI,OAAO,MAAM,KAAK,CAAC,EAAE,GAAG;YAC5B,MAAM,KAAK,CAAC,IAAI,GAAG,GAAG,AAAE,CAAA,OAAO,IAAG,KAAM,IAAM,SAAS;YACvD,OAAO;QACT;QACA,UAAU;QACV,MAAM,KAAK,CAAC,IAAI,GAAG,GAAG;QACtB,IAAI,SAAS,KAAK,MAAM,MAAM,GAAG,IAC/B,MAAM,MAAM,IAAI;aAEhB,MAAM,MAAM,IAAI;IAEpB;IAEA,KAAK,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QACxC,oCAAoC;QACpC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,GAAG;QACxB,IAAI,KAAK,CAAC,IAAI,MAAM,GAAG,EAAE,GAAG;QAC5B,IAAI,MAAM,IAAI;QAEd,qDAAqD;QACrD,IAAI,KAAK;QACT,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAAK;YACnC,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,GAAG;YACvB,MAAM,IAAI;YACV,IAAI,KAAK,CAAC,EAAE,GAAG,KAAK;YACpB,KAAK,IAAI,OAAQ,CAAA,AAAC,KAAK,YAAa,CAAA;QACtC;QAEA,wBAAwB;QACxB,IAAI,IAAI,KAAK,CAAC,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;YACnC,IAAI,MAAM;YACV,IAAI,IAAI,KAAK,CAAC,IAAI,MAAM,GAAG,EAAE,KAAK,GAChC,IAAI,MAAM;QAEd;QACA,OAAO;IACT;IAEA,SAAS;QACP,OAAO,IAAI,CACT,IAAI,EACJ,QACA;IACJ;IACA,SAAS,MAAM;IAEf,SAAS;QACP,OAAO,IAAI,CACT,IAAI,EACJ,QACA;IACJ;IACA,SAAS,MAAM;IAEf,SAAS;QACP,eAAe;QACf,OAAO,IAAI,CACT,IAAI,EACJ,SACA;IACJ;IACA,SAAS,QAAQ;IAEjB,OAAO,SAAS,CAAC,KAAK,GAAG,SAAS,MAAO,GAAG;QAC1C,WAAW;QACX,IAAI,QAAQ;QACZ,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAAK;YACnC,IAAI,KAAK,AAAC,CAAA,IAAI,KAAK,CAAC,EAAE,GAAG,CAAA,IAAK,OAAO;YACrC,IAAI,KAAK,KAAK;YACd,QAAQ;YAER,IAAI,KAAK,CAAC,EAAE,GAAG;YACf,QAAQ;QACV;QACA,IAAI,UAAU,GACZ,IAAI,KAAK,CAAC,IAAI,MAAM,GAAG,GAAG;QAE5B,OAAO;IACT;IAEA,+DAA+D;IAC/D,GAAG,MAAM,GAAG,SAAS,MAAO,IAAI;QAC9B,0BAA0B;QAC1B,IAAI,MAAM,CAAC,KAAK,EAAE,OAAO,MAAM,CAAC,KAAK;QAErC,IAAI;QACJ,IAAI,SAAS,QACX,QAAQ,IAAI;aACP,IAAI,SAAS,QAClB,QAAQ,IAAI;aACP,IAAI,SAAS,QAClB,QAAQ,IAAI;aACP,IAAI,SAAS,UAClB,QAAQ,IAAI;aAEZ,MAAM,IAAI,MAAM,mBAAmB;QAErC,MAAM,CAAC,KAAK,GAAG;QAEf,OAAO;IACT;IAEA,EAAE;IACF,wBAAwB;IACxB,EAAE;IACF,SAAS,IAAK,CAAC;QACb,IAAI,OAAO,MAAM,UAAU;YACzB,IAAI,QAAQ,GAAG,MAAM,CAAC;YACtB,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;YAChB,IAAI,CAAC,KAAK,GAAG;QACf,OAAO;YACL,OAAO,EAAE,GAAG,CAAC,IAAI;YACjB,IAAI,CAAC,CAAC,GAAG;YACT,IAAI,CAAC,KAAK,GAAG;QACf;IACF;IAEA,IAAI,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAU,CAAC;QAC3C,OAAO,EAAE,QAAQ,KAAK,GAAG;QACzB,OAAO,EAAE,GAAG,EAAE;IAChB;IAEA,IAAI,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAU,CAAC,EAAE,CAAC;QAC9C,OAAO,AAAC,CAAA,EAAE,QAAQ,GAAG,EAAE,QAAQ,AAAD,MAAO,GAAG;QACxC,OAAO,EAAE,GAAG,IAAI,EAAE,GAAG,KAAK,EAAE,GAAG,EAC7B;IACJ;IAEA,IAAI,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC;QACnC,IAAI,IAAI,CAAC,KAAK,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC,IAAI;QAC3D,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI;IACtC;IAEA,IAAI,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,CAAC;QACjC,IAAI,EAAE,MAAM,IACV,OAAO,EAAE,KAAK;QAGhB,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,IAAI;IACrC;IAEA,IAAI,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,GAAG;QAEjB,IAAI,MAAM,EAAE,GAAG,CAAC;QAChB,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,GACrB,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjB,OAAO,IAAI,SAAS,CAAC,IAAI;IAC3B;IAEA,IAAI,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC,EAAE,CAAC;QACtC,IAAI,CAAC,QAAQ,CAAC,GAAG;QAEjB,IAAI,MAAM,EAAE,IAAI,CAAC;QACjB,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,GACrB,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjB,OAAO;IACT;IAEA,IAAI,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,GAAG;QAEjB,IAAI,MAAM,EAAE,GAAG,CAAC;QAChB,IAAI,IAAI,IAAI,CAAC,KAAK,GAChB,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjB,OAAO,IAAI,SAAS,CAAC,IAAI;IAC3B;IAEA,IAAI,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC,EAAE,CAAC;QACtC,IAAI,CAAC,QAAQ,CAAC,GAAG;QAEjB,IAAI,MAAM,EAAE,IAAI,CAAC;QACjB,IAAI,IAAI,IAAI,CAAC,KAAK,GAChB,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjB,OAAO;IACT;IAEA,IAAI,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,CAAC,EAAE,GAAG;QACtC,IAAI,CAAC,QAAQ,CAAC;QACd,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC;IAC3B;IAEA,IAAI,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC,EAAE,CAAC;QACtC,IAAI,CAAC,QAAQ,CAAC,GAAG;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC;IAC1B;IAEA,IAAI,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,GAAG;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC;IACzB;IAEA,IAAI,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC;QACnC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK;IAC7B;IAEA,IAAI,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,CAAC;QACjC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG;IACrB;IAEA,IAAI,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC;QACnC,IAAI,EAAE,MAAM,IAAI,OAAO,EAAE,KAAK;QAE9B,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;QACxB,OAAO,OAAO,MAAM;QAEpB,YAAY;QACZ,IAAI,SAAS,GAAG;YACd,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC;YACvC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG;QACrB;QAEA,0DAA0D;QAC1D,EAAE;QACF,yCAAyC;QACzC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACpB,IAAI,IAAI;QACR,MAAO,CAAC,EAAE,MAAM,MAAM,EAAE,KAAK,CAAC,OAAO,EAAG;YACtC;YACA,EAAE,MAAM,CAAC;QACX;QACA,OAAO,CAAC,EAAE,MAAM;QAEhB,IAAI,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI;QAC9B,IAAI,OAAO,IAAI,MAAM;QAErB,6BAA6B;QAC7B,+DAA+D;QAC/D,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;QACjC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS;QACxB,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI;QAEhC,MAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,UAAU,EACrC,EAAE,OAAO,CAAC;QAGZ,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG;QACpB,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC;QACrC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG;QACpB,IAAI,IAAI;QACR,MAAO,EAAE,GAAG,CAAC,SAAS,EAAG;YACvB,IAAI,MAAM;YACV,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,GAAG,IAClC,MAAM,IAAI,MAAM;YAElB,OAAO,IAAI;YACX,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC,IAAI,IAAI;YAE7C,IAAI,EAAE,MAAM,CAAC;YACb,IAAI,EAAE,MAAM;YACZ,IAAI,EAAE,MAAM,CAAC;YACb,IAAI;QACN;QAEA,OAAO;IACT;IAEA,IAAI,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC;QACnC,IAAI,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,IAAI,QAAQ,KAAK,GAAG;YACtB,IAAI,QAAQ,GAAG;YACf,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,MAAM;QAC9B,OACE,OAAO,IAAI,CAAC,IAAI,CAAC;IAErB;IAEA,IAAI,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,CAAC,EAAE,GAAG;QACtC,IAAI,IAAI,MAAM,IAAI,OAAO,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI;QAC7C,IAAI,IAAI,IAAI,CAAC,OAAO,GAAG,OAAO,EAAE,KAAK;QAErC,IAAI,aAAa;QACjB,IAAI,MAAM,IAAI,MAAM,KAAK;QACzB,GAAG,CAAC,EAAE,GAAG,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI;QAC7B,GAAG,CAAC,EAAE,GAAG;QACT,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC9B,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE;QAGhC,IAAI,MAAM,GAAG,CAAC,EAAE;QAChB,IAAI,UAAU;QACd,IAAI,aAAa;QACjB,IAAI,QAAQ,IAAI,SAAS,KAAK;QAC9B,IAAI,UAAU,GACZ,QAAQ;QAGV,IAAK,IAAI,IAAI,MAAM,GAAG,GAAG,KAAK,GAAG,IAAK;YACpC,IAAI,OAAO,IAAI,KAAK,CAAC,EAAE;YACvB,IAAK,IAAI,IAAI,QAAQ,GAAG,KAAK,GAAG,IAAK;gBACnC,IAAI,MAAM,AAAC,QAAQ,IAAK;gBACxB,IAAI,QAAQ,GAAG,CAAC,EAAE,EAChB,MAAM,IAAI,CAAC,GAAG,CAAC;gBAGjB,IAAI,QAAQ,KAAK,YAAY,GAAG;oBAC9B,aAAa;oBACb;gBACF;gBAEA,YAAY;gBACZ,WAAW;gBACX;gBACA,IAAI,eAAe,cAAe,CAAA,MAAM,KAAK,MAAM,CAAA,GAAI;gBAEvD,MAAM,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,QAAQ;gBAChC,aAAa;gBACb,UAAU;YACZ;YACA,QAAQ;QACV;QAEA,OAAO;IACT;IAEA,IAAI,SAAS,CAAC,SAAS,GAAG,SAAS,UAAW,GAAG;QAC/C,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAEvB,OAAO,MAAM,MAAM,EAAE,KAAK,KAAK;IACjC;IAEA,IAAI,SAAS,CAAC,WAAW,GAAG,SAAS,YAAa,GAAG;QACnD,IAAI,MAAM,IAAI,KAAK;QACnB,IAAI,GAAG,GAAG;QACV,OAAO;IACT;IAEA,EAAE;IACF,2BAA2B;IAC3B,EAAE;IAEF,GAAG,IAAI,GAAG,SAAS,KAAM,GAAG;QAC1B,OAAO,IAAI,KAAK;IAClB;IAEA,SAAS,KAAM,CAAC;QACd,IAAI,IAAI,CAAC,IAAI,EAAE;QAEf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,SAAS;QAC7B,IAAI,IAAI,CAAC,KAAK,GAAG,OAAO,GACtB,IAAI,CAAC,KAAK,IAAI,KAAM,IAAI,CAAC,KAAK,GAAG;QAGnC,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK;QACpC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG;QAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAEhC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI;IAClC;IACA,SAAS,MAAM;IAEf,KAAK,SAAS,CAAC,SAAS,GAAG,SAAS,UAAW,GAAG;QAChD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK;IACvC;IAEA,KAAK,SAAS,CAAC,WAAW,GAAG,SAAS,YAAa,GAAG;QACpD,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI;QACnC,EAAE,GAAG,GAAG;QACR,OAAO;IACT;IAEA,KAAK,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC,EAAE,CAAC;QACvC,IAAI,EAAE,MAAM,MAAM,EAAE,MAAM,IAAI;YAC5B,EAAE,KAAK,CAAC,EAAE,GAAG;YACb,EAAE,MAAM,GAAG;YACX,OAAO;QACT;QAEA,IAAI,IAAI,EAAE,IAAI,CAAC;QACf,IAAI,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QACxE,IAAI,IAAI,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK;QACnC,IAAI,MAAM;QAEV,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,GACnB,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;aACd,IAAI,EAAE,IAAI,CAAC,KAAK,GACrB,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAGrB,OAAO,IAAI,SAAS,CAAC,IAAI;IAC3B;IAEA,KAAK,SAAS,CAAC,GAAG,GAAG,SAAS,IAAK,CAAC,EAAE,CAAC;QACrC,IAAI,EAAE,MAAM,MAAM,EAAE,MAAM,IAAI,OAAO,IAAI,GAAG,GAAG,SAAS,CAAC,IAAI;QAE7D,IAAI,IAAI,EAAE,GAAG,CAAC;QACd,IAAI,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QACxE,IAAI,IAAI,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK;QACnC,IAAI,MAAM;QACV,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,GACnB,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;aACd,IAAI,EAAE,IAAI,CAAC,KAAK,GACrB,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAGrB,OAAO,IAAI,SAAS,CAAC,IAAI;IAC3B;IAEA,KAAK,SAAS,CAAC,IAAI,GAAG,SAAS,KAAM,CAAC;QACpC,iDAAiD;QACjD,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE;QAChD,OAAO,IAAI,SAAS,CAAC,IAAI;IAC3B;AACF,CAAA,EAAoC,QAAQ,IAAI;;;;;AC33GhD;AAEA,IAAI,iCAAW;;AAEf,+BAAS,OAAO,GAAG;;AACnB,+BAAS,KAAK,GAAG;;AACjB,+BAAS,IAAI,GAAG;;AAChB,+BAAS,KAAK,GAAG;;AACjB,+BAAS,MAAM,GAAG;;AAElB,YAAY;AACZ,+BAAS,EAAE,GAAG;;AACd,+BAAS,KAAK,GAAG;;;;ACZjB,iBAAiB,KAAK,KAAK,CAAC;;;;;ACA5B;AAEA,IAAI,8BAAQ;;;;;;;AAKZ,4BAAM,MAAM,GAAG;AACf,4BAAM,OAAO,GAAG;AAChB,4BAAM,KAAK,GAAG;AACd,4BAAM,KAAK,GAAG;AACd,4BAAM,MAAM,GAAG;AAEf,gCAAgC;AAChC,SAAS,6BAAO,GAAG,EAAE,CAAC,EAAE,IAAI;IAC1B,IAAI,MAAM,IAAI,MAAM,KAAK,GAAG,CAAC,IAAI,SAAS,IAAI,QAAQ;IACtD,IAAI;IACJ,IAAK,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,KAAK,EAC/B,GAAG,CAAC,EAAE,GAAG;IAGX,IAAI,KAAK,KAAM,IAAI;IACnB,IAAI,IAAI,IAAI,KAAK;IAEjB,IAAK,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAAK;QAC/B,IAAI;QACJ,IAAI,MAAM,EAAE,KAAK,CAAC,KAAK;QACvB,IAAI,EAAE,KAAK,IAAI;YACb,IAAI,MAAM,AAAC,CAAA,MAAM,CAAA,IAAK,GACpB,IAAI,AAAC,CAAA,MAAM,CAAA,IAAK;iBAEhB,IAAI;YACN,EAAE,KAAK,CAAC;QACV,OACE,IAAI;QAGN,GAAG,CAAC,EAAE,GAAG;QACT,EAAE,MAAM,CAAC;IACX;IAEA,OAAO;AACT;AACA,4BAAM,MAAM,GAAG;AAEf,0CAA0C;AAC1C,SAAS,6BAAO,EAAE,EAAE,EAAE;IACpB,IAAI,MAAM;QACR,EAAE;QACF,EAAE;KACH;IAED,KAAK,GAAG,KAAK;IACb,KAAK,GAAG,KAAK;IACb,IAAI,KAAK;IACT,IAAI,KAAK;IACT,IAAI;IACJ,MAAO,GAAG,IAAI,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,MAAM,EAAG;QAC3C,cAAc;QACd,IAAI,MAAM,AAAC,GAAG,KAAK,CAAC,KAAK,KAAM;QAC/B,IAAI,MAAM,AAAC,GAAG,KAAK,CAAC,KAAK,KAAM;QAC/B,IAAI,QAAQ,GACV,MAAM;QACR,IAAI,QAAQ,GACV,MAAM;QACR,IAAI;QACJ,IAAI,AAAC,CAAA,MAAM,CAAA,MAAO,GAChB,KAAK;aACA;YACL,KAAK,AAAC,GAAG,KAAK,CAAC,KAAK,KAAM;YAC1B,IAAI,AAAC,CAAA,OAAO,KAAK,OAAO,CAAA,KAAM,QAAQ,GACpC,KAAK,CAAC;iBAEN,KAAK;QACT;QACA,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;QAEZ,IAAI;QACJ,IAAI,AAAC,CAAA,MAAM,CAAA,MAAO,GAChB,KAAK;aACA;YACL,KAAK,AAAC,GAAG,KAAK,CAAC,KAAK,KAAM;YAC1B,IAAI,AAAC,CAAA,OAAO,KAAK,OAAO,CAAA,KAAM,QAAQ,GACpC,KAAK,CAAC;iBAEN,KAAK;QACT;QACA,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;QAEZ,eAAe;QACf,IAAI,IAAI,OAAO,KAAK,GAClB,KAAK,IAAI;QACX,IAAI,IAAI,OAAO,KAAK,GAClB,KAAK,IAAI;QACX,GAAG,MAAM,CAAC;QACV,GAAG,MAAM,CAAC;IACZ;IAEA,OAAO;AACT;AACA,4BAAM,MAAM,GAAG;AAEf,SAAS,qCAAe,GAAG,EAAE,IAAI,EAAE,QAAQ;IACzC,IAAI,MAAM,MAAM;IAChB,IAAI,SAAS,CAAC,KAAK,GAAG,SAAS;QAC7B,OAAO,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,IAAI,GACxC,IAAI,CAAC,IAAI,GAAG,SAAS,IAAI,CAAC,IAAI;IAClC;AACF;AACA,4BAAM,cAAc,GAAG;AAEvB,SAAS,iCAAW,KAAK;IACvB,OAAO,OAAO,UAAU,WAAW,4BAAM,OAAO,CAAC,OAAO,SACtD;AACJ;AACA,4BAAM,UAAU,GAAG;AAEnB,SAAS,gCAAU,KAAK;IACtB,OAAO,IAAI,OAAG,OAAO,OAAO;AAC9B;AACA,4BAAM,SAAS,GAAG;;;;ACxHlB,iBAAiB;AAEjB,SAAS,6BAAO,GAAG,EAAE,GAAG;IACtB,IAAI,CAAC,KACH,MAAM,IAAI,MAAM,OAAO;AAC3B;AAEA,6BAAO,KAAK,GAAG,SAAS,YAAY,CAAC,EAAE,CAAC,EAAE,GAAG;IAC3C,IAAI,KAAK,GACP,MAAM,IAAI,MAAM,OAAQ,uBAAuB,IAAI,SAAS;AAChE;;;;;ACVA;AAEA,IAAI,8BAAQ;AAEZ,SAAS,8BAAQ,GAAG,EAAE,GAAG;IACvB,IAAI,MAAM,OAAO,CAAC,MAChB,OAAO,IAAI,KAAK;IAClB,IAAI,CAAC,KACH,OAAO,EAAE;IACX,IAAI,MAAM,EAAE;IACZ,IAAI,OAAO,QAAQ,UAAU;QAC3B,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC9B,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG;QACpB,OAAO;IACT;IACA,IAAI,QAAQ,OAAO;QACjB,MAAM,IAAI,OAAO,CAAC,gBAAgB;QAClC,IAAI,IAAI,MAAM,GAAG,MAAM,GACrB,MAAM,MAAM;QACd,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,KAAK,EACnC,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,EAAE;IAC3C,OACE,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAAK;QACnC,IAAI,IAAI,IAAI,UAAU,CAAC;QACvB,IAAI,KAAK,KAAK;QACd,IAAI,KAAK,IAAI;QACb,IAAI,IACF,IAAI,IAAI,CAAC,IAAI;aAEb,IAAI,IAAI,CAAC;IACb;IAEF,OAAO;AACT;AACA,4BAAM,OAAO,GAAG;AAEhB,SAAS,4BAAM,IAAI;IACjB,IAAI,KAAK,MAAM,KAAK,GAClB,OAAO,MAAM;SAEb,OAAO;AACX;AACA,4BAAM,KAAK,GAAG;AAEd,SAAS,4BAAM,GAAG;IAChB,IAAI,MAAM;IACV,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC9B,OAAO,4BAAM,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC;IAC/B,OAAO;AACT;AACA,4BAAM,KAAK,GAAG;AAEd,4BAAM,MAAM,GAAG,SAAS,OAAO,GAAG,EAAE,GAAG;IACrC,IAAI,QAAQ,OACV,OAAO,4BAAM;SAEb,OAAO;AACX;;;;;;ACzDA,IAAI;AAEJ,iBAAiB,SAAS,KAAK,GAAG;IAChC,IAAI,CAAC,yBACH,0BAAI,IAAI,2BAAK;IAEf,OAAO,wBAAE,QAAQ,CAAC;AACpB;AAEA,SAAS,2BAAK,IAAI;IAChB,IAAI,CAAC,IAAI,GAAG;AACd;AACA,eAAe,IAAI,GAAG;AAEtB,2BAAK,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAS,GAAG;IAC7C,OAAO,IAAI,CAAC,KAAK,CAAC;AACpB;AAEA,iCAAiC;AACjC,2BAAK,SAAS,CAAC,KAAK,GAAG,SAAS,MAAM,CAAC;IACrC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EACpB,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;IAE5B,IAAI,MAAM,IAAI,WAAW;IACzB,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC9B,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO;IAC5B,OAAO;AACT;;AAEA,IAAI,OAAO,SAAS,UAAU;IAC5B,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,CAAC,eAAe,EAC5C,kBAAkB;IAClB,2BAAK,SAAS,CAAC,KAAK,GAAG,SAAS,MAAM,CAAC;QACrC,IAAI,MAAM,IAAI,WAAW;QACzB,KAAK,MAAM,CAAC,eAAe,CAAC;QAC5B,OAAO;IACT;SACK,IAAI,KAAK,QAAQ,IAAI,KAAK,QAAQ,CAAC,eAAe,EACvD,KAAK;IACL,2BAAK,SAAS,CAAC,KAAK,GAAG,SAAS,MAAM,CAAC;QACrC,IAAI,MAAM,IAAI,WAAW;QACzB,KAAK,QAAQ,CAAC,eAAe,CAAC;QAC9B,OAAO;IACT;SAGK,IAAI,OAAO,WAAW,UAC3B,WAAW;IACX,2BAAK,SAAS,CAAC,KAAK,GAAG;QACrB,MAAM,IAAI,MAAM;IAClB;AAEJ,OACE,+CAA+C;AAC/C,IAAI;IACF,IAAI,+BAAS;IACb,IAAI,OAAO,6BAAO,WAAW,KAAK,YAChC,MAAM,IAAI,MAAM;IAElB,2BAAK,SAAS,CAAC,KAAK,GAAG,SAAS,MAAM,CAAC;QACrC,OAAO,6BAAO,WAAW,CAAC;IAC5B;AACF,EAAE,OAAO,GAAG,CACZ;;;;;AC/DF;AAEA,IAAI,8BAAQ;;AAEZ,4BAAM,IAAI,GAAG;;AACb,4BAAM,KAAK,GAAG;;AACd,4BAAM,IAAI,GAAG;;AACb,4BAAM,OAAO,GAAG;;;;ACPhB;;;;;AAIA,IAAI,+BAAS;AACb,IAAI,+BAAS;AACb,IAAI,+BAAS;AAEb,SAAS,gCAAU,IAAI,EAAE,IAAI;IAC3B,IAAI,CAAC,IAAI,GAAG;IACZ,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,KAAK,CAAC,EAAE;IAExB,gEAAgE;IAChE,IAAI,CAAC,GAAG,GAAG,KAAK,KAAK,GAAG,OAAG,GAAG,CAAC,KAAK,KAAK,IAAI,OAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAE3D,yBAAyB;IACzB,IAAI,CAAC,IAAI,GAAG,IAAI,OAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG;IACpC,IAAI,CAAC,GAAG,GAAG,IAAI,OAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG;IACnC,IAAI,CAAC,GAAG,GAAG,IAAI,OAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG;IAEnC,gCAAgC;IAChC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,IAAI,OAAG,KAAK,CAAC,EAAE;IAClC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI;IAEvD,mBAAmB;IACnB,IAAI,CAAC,OAAO,GAAG,IAAI,MAAM;IACzB,IAAI,CAAC,OAAO,GAAG,IAAI,MAAM;IACzB,IAAI,CAAC,OAAO,GAAG,IAAI,MAAM;IACzB,IAAI,CAAC,OAAO,GAAG,IAAI,MAAM;IAEzB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,SAAS,KAAK;IAEhD,mCAAmC;IACnC,IAAI,cAAc,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC7C,IAAI,CAAC,eAAe,YAAY,IAAI,CAAC,OAAO,GAC1C,IAAI,CAAC,IAAI,GAAG;SACP;QACL,IAAI,CAAC,aAAa,GAAG;QACrB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG;IACnC;AACF;AACA,iBAAiB;AAEjB,gCAAU,SAAS,CAAC,KAAK,GAAG,SAAS;IACnC,MAAM,IAAI,MAAM;AAClB;AAEA,gCAAU,SAAS,CAAC,QAAQ,GAAG,SAAS;IACtC,MAAM,IAAI,MAAM;AAClB;AAEA,gCAAU,SAAS,CAAC,YAAY,GAAG,SAAS,aAAa,CAAC,EAAE,CAAC;IAC3D,6BAAO,EAAE,WAAW;IACpB,IAAI,UAAU,EAAE,WAAW;IAE3B,IAAI,MAAM,6BAAO,GAAG,GAAG,IAAI,CAAC,UAAU;IACtC,IAAI,IAAI,AAAC,CAAA,KAAM,QAAQ,IAAI,GAAG,CAAC,IAAM,CAAA,QAAQ,IAAI,GAAG,MAAM,IAAI,IAAI,CAAA;IAClE,KAAK;IAEL,oCAAoC;IACpC,IAAI,OAAO,EAAE;IACb,IAAI;IACJ,IAAI;IACJ,IAAK,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,KAAK,QAAQ,IAAI,CAAE;QAC7C,OAAO;QACP,IAAK,IAAI,IAAI,IAAI,QAAQ,IAAI,GAAG,GAAG,KAAK,GAAG,IACzC,OAAO,AAAC,CAAA,QAAQ,CAAA,IAAK,GAAG,CAAC,EAAE;QAC7B,KAAK,IAAI,CAAC;IACZ;IAEA,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM;IAChC,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM;IAChC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;QAC1B,IAAK,IAAI,GAAG,IAAI,KAAK,MAAM,EAAE,IAAK;YAChC,OAAO,IAAI,CAAC,EAAE;YACd,IAAI,SAAS,GACX,IAAI,EAAE,QAAQ,CAAC,QAAQ,MAAM,CAAC,EAAE;iBAC7B,IAAI,SAAS,CAAC,GACjB,IAAI,EAAE,QAAQ,CAAC,QAAQ,MAAM,CAAC,EAAE,CAAC,GAAG;QACxC;QACA,IAAI,EAAE,GAAG,CAAC;IACZ;IACA,OAAO,EAAE,GAAG;AACd;AAEA,gCAAU,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAS,CAAC,EAAE,CAAC;IACnD,IAAI,IAAI;IAER,oBAAoB;IACpB,IAAI,YAAY,EAAE,aAAa,CAAC;IAChC,IAAI,UAAU,GAAG;IACjB,IAAI,MAAM,UAAU,MAAM;IAE1B,eAAe;IACf,IAAI,MAAM,6BAAO,GAAG,GAAG,IAAI,CAAC,UAAU;IAEtC,yCAAyC;IACzC,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM;IAClC,IAAK,IAAI,IAAI,IAAI,MAAM,GAAG,GAAG,KAAK,GAAG,IAAK;QACxC,eAAe;QACf,IAAK,IAAI,IAAI,GAAG,KAAK,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IACtC;QACF,IAAI,KAAK,GACP;QACF,MAAM,IAAI,IAAI,CAAC;QAEf,IAAI,IAAI,GACN;QACF,IAAI,IAAI,GAAG,CAAC,EAAE;QACd,6BAAO,MAAM;QACb,IAAI,EAAE,IAAI,KAAK;YACb,SAAS;YACT,IAAI,IAAI,GACN,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,AAAC,IAAI,KAAM,EAAE;iBAEpC,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,AAAC,CAAC,IAAI,KAAM,EAAE,CAAC,GAAG;eAE3C,SAAS;QACT,IAAI,IAAI,GACN,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,AAAC,IAAI,KAAM,EAAE;aAE/B,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,AAAC,CAAC,IAAI,KAAM,EAAE,CAAC,GAAG;IAE1C;IACA,OAAO,EAAE,IAAI,KAAK,WAAW,IAAI,GAAG,KAAK;AAC3C;AAEA,gCAAU,SAAS,CAAC,WAAW,GAAG,SAAS,YAAY,IAAI,EACzD,MAAM,EACN,MAAM,EACN,GAAG,EACH,cAAc;IACd,IAAI,WAAW,IAAI,CAAC,OAAO;IAC3B,IAAI,MAAM,IAAI,CAAC,OAAO;IACtB,IAAI,MAAM,IAAI,CAAC,OAAO;IAEtB,kBAAkB;IAClB,IAAI,MAAM;IACV,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAK,IAAI,GAAG,IAAI,KAAK,IAAK;QACxB,IAAI,MAAM,CAAC,EAAE;QACb,IAAI,YAAY,EAAE,aAAa,CAAC;QAChC,QAAQ,CAAC,EAAE,GAAG,UAAU,GAAG;QAC3B,GAAG,CAAC,EAAE,GAAG,UAAU,MAAM;IAC3B;IAEA,yBAAyB;IACzB,IAAK,IAAI,MAAM,GAAG,KAAK,GAAG,KAAK,EAAG;QAChC,IAAI,IAAI,IAAI;QACZ,IAAI,IAAI;QACR,IAAI,QAAQ,CAAC,EAAE,KAAK,KAAK,QAAQ,CAAC,EAAE,KAAK,GAAG;YAC1C,GAAG,CAAC,EAAE,GAAG,6BAAO,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,UAAU;YACvD,GAAG,CAAC,EAAE,GAAG,6BAAO,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,UAAU;YACvD,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE;YAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE;YAC9B;QACF;QAEA,IAAI,OAAO;YACT,MAAM,CAAC,EAAE;YAAE,KAAK,GAChB;YAAM,KAAK,GACX;YAAM,KAAK,GACX,MAAM,CAAC,EAAE;SACV;QAED,8CAA8C;QAC9C,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG;YACtC,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACjC,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG;QAClD,OAAO,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,QAAQ,GAAG;YACtD,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE;YAC5C,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG;QACvC,OAAO;YACL,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE;YAC5C,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG;QAClD;QAEA,IAAI,QAAQ;YACV;YAAI,SAAS,GACb;YAAI,QAAQ,GACZ;YAAI,QAAQ,GACZ;YAAI,QAAQ,GACZ;YAAG,OAAO,GACV;YAAG,OAAO,GACV;YAAG,QAAQ,GACX;YAAG,OAAO,GACV;SACD;QAED,IAAI,MAAM,6BAAO,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE;QACrC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE;QAC9B,GAAG,CAAC,EAAE,GAAG,IAAI,MAAM;QACnB,GAAG,CAAC,EAAE,GAAG,IAAI,MAAM;QACnB,IAAK,IAAI,GAAG,IAAI,KAAK,IAAK;YACxB,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG;YACrB,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG;YAErB,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,AAAC,CAAA,KAAK,CAAA,IAAK,IAAK,CAAA,KAAK,CAAA,EAAG;YAC1C,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG;YACZ,GAAG,CAAC,EAAE,GAAG;QACX;IACF;IAEA,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM;IAClC,IAAI,MAAM,IAAI,CAAC,OAAO;IACtB,IAAK,IAAI,KAAK,KAAK,GAAG,IAAK;QACzB,IAAI,IAAI;QAER,MAAO,KAAK,EAAG;YACb,IAAI,OAAO;YACX,IAAK,IAAI,GAAG,IAAI,KAAK,IAAK;gBACxB,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG;gBACrB,IAAI,GAAG,CAAC,EAAE,KAAK,GACb,OAAO;YACX;YACA,IAAI,CAAC,MACH;YACF;YACA;QACF;QACA,IAAI,KAAK,GACP;QACF,MAAM,IAAI,IAAI,CAAC;QACf,IAAI,IAAI,GACN;QAEF,IAAK,IAAI,GAAG,IAAI,KAAK,IAAK;YACxB,IAAI,IAAI,GAAG,CAAC,EAAE;YACd;YACA,IAAI,MAAM,GACR;iBACG,IAAI,IAAI,GACX,IAAI,GAAG,CAAC,EAAE,CAAC,AAAC,IAAI,KAAM,EAAE;iBACrB,IAAI,IAAI,GACX,IAAI,GAAG,CAAC,EAAE,CAAC,AAAC,CAAC,IAAI,KAAM,EAAE,CAAC,GAAG;YAE/B,IAAI,EAAE,IAAI,KAAK,UACb,MAAM,IAAI,QAAQ,CAAC;iBAEnB,MAAM,IAAI,GAAG,CAAC;QAClB;IACF;IACA,qBAAqB;IACrB,IAAK,IAAI,GAAG,IAAI,KAAK,IACnB,GAAG,CAAC,EAAE,GAAG;IAEX,IAAI,gBACF,OAAO;SAEP,OAAO,IAAI,GAAG;AAClB;AAEA,SAAS,gCAAU,KAAK,EAAE,IAAI;IAC5B,IAAI,CAAC,KAAK,GAAG;IACb,IAAI,CAAC,IAAI,GAAG;IACZ,IAAI,CAAC,WAAW,GAAG;AACrB;AACA,gCAAU,SAAS,GAAG;AAEtB,gCAAU,SAAS,CAAC,EAAE,GAAG,SAAS;IAChC,MAAM,IAAI,MAAM;AAClB;AAEA,gCAAU,SAAS,CAAC,QAAQ,GAAG,SAAS;IACtC,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI;AACjC;AAEA,gCAAU,SAAS,CAAC,WAAW,GAAG,SAAS,YAAY,KAAK,EAAE,GAAG;IAC/D,QAAQ,eAAc,OAAO;IAE7B,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,UAAU;IAE3B,wCAAwC;IACxC,IAAI,AAAC,CAAA,KAAK,CAAC,EAAE,KAAK,QAAQ,KAAK,CAAC,EAAE,KAAK,QAAQ,KAAK,CAAC,EAAE,KAAK,IAAG,KAC3D,MAAM,MAAM,GAAG,MAAM,IAAI,KAAK;QAChC,IAAI,KAAK,CAAC,EAAE,KAAK,MACf,6BAAO,KAAK,CAAC,MAAM,MAAM,GAAG,EAAE,GAAG,MAAM;aACpC,IAAI,KAAK,CAAC,EAAE,KAAK,MACpB,6BAAO,KAAK,CAAC,MAAM,MAAM,GAAG,EAAE,GAAG,MAAM;QAEzC,IAAI,MAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,GAAG,IAAI,MACvC,MAAM,KAAK,CAAC,IAAI,KAAK,IAAI,IAAI;QAE/B,OAAO;IACT,OAAO,IAAI,AAAC,CAAA,KAAK,CAAC,EAAE,KAAK,QAAQ,KAAK,CAAC,EAAE,KAAK,IAAG,KACrC,MAAM,MAAM,GAAG,MAAM,KAC/B,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,GAAG,IAAI,MAAM,KAAK,CAAC,EAAE,KAAK;IAE/D,MAAM,IAAI,MAAM;AAClB;AAEA,gCAAU,SAAS,CAAC,gBAAgB,GAAG,SAAS,iBAAiB,GAAG;IAClE,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK;AAC1B;AAEA,gCAAU,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,OAAO;IACpD,IAAI,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU;IACjC,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM;IAElC,IAAI,SACF,OAAO;QAAE,IAAI,CAAC,IAAI,GAAG,MAAM,KAAK,OAAO;KAAM,CAAC,MAAM,CAAC;IAEvD,OAAO;QAAE;KAAM,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM;AACtD;AAEA,gCAAU,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,GAAG,EAAE,OAAO;IACvD,OAAO,cAAa,IAAI,CAAC,OAAO,CAAC,UAAU;AAC7C;AAEA,gCAAU,SAAS,CAAC,UAAU,GAAG,SAAS,WAAW,KAAK;IACxD,IAAI,IAAI,CAAC,WAAW,EAClB,OAAO,IAAI;IAEb,IAAI,cAAc;QAChB,SAAS;QACT,KAAK;QACL,MAAM;IACR;IACA,YAAY,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC;IACrC,YAAY,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG;IAC1C,YAAY,IAAI,GAAG,IAAI,CAAC,QAAQ;IAChC,IAAI,CAAC,WAAW,GAAG;IAEnB,OAAO,IAAI;AACb;AAEA,gCAAU,SAAS,CAAC,WAAW,GAAG,SAAS,YAAY,CAAC;IACtD,IAAI,CAAC,IAAI,CAAC,WAAW,EACnB,OAAO;IAET,IAAI,UAAU,IAAI,CAAC,WAAW,CAAC,OAAO;IACtC,IAAI,CAAC,SACH,OAAO;IAET,OAAO,QAAQ,MAAM,CAAC,MAAM,IAAI,KAAK,IAAI,CAAC,AAAC,CAAA,EAAE,SAAS,KAAK,CAAA,IAAK,QAAQ,IAAI;AAC9E;AAEA,gCAAU,SAAS,CAAC,WAAW,GAAG,SAAS,YAAY,IAAI,EAAE,KAAK;IAChE,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,EAC9C,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO;IAEjC,IAAI,UAAU;QAAE,IAAI;KAAE;IACtB,IAAI,MAAM,IAAI;IACd,IAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,KAAM;QACpC,IAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IACxB,MAAM,IAAI,GAAG;QACf,QAAQ,IAAI,CAAC;IACf;IACA,OAAO;QACL,MAAM;QACN,QAAQ;IACV;AACF;AAEA,gCAAU,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,GAAG;IAC5D,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,EAC1C,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG;IAE7B,IAAI,MAAM;QAAE,IAAI;KAAE;IAClB,IAAI,MAAM,AAAC,CAAA,KAAK,GAAE,IAAK;IACvB,IAAI,MAAM,QAAQ,IAAI,OAAO,IAAI,CAAC,GAAG;IACrC,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACvB,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC;IAC1B,OAAO;QACL,KAAK;QACL,QAAQ;IACV;AACF;AAEA,gCAAU,SAAS,CAAC,QAAQ,GAAG,SAAS;IACtC,OAAO;AACT;AAEA,gCAAU,SAAS,CAAC,IAAI,GAAG,SAAS,KAAK,CAAC;IACxC,IAAI,IAAI,IAAI;IACZ,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACrB,IAAI,EAAE,GAAG;IACX,OAAO;AACT;;;;;AC5XA;;;;;;;;;AAOA,IAAI,+BAAS;AAEb,SAAS,iCAAW,IAAI;IACtB,OAAK,IAAI,CAAC,IAAI,EAAE,SAAS;IAEzB,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG;IAC1C,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG;IAC1C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO;IAE5B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO;IAC1C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ;IAExD,4DAA4D;IAC5D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC;IAClC,IAAI,CAAC,WAAW,GAAG,IAAI,MAAM;IAC7B,IAAI,CAAC,WAAW,GAAG,IAAI,MAAM;AAC/B;AACA,OAAS,kCAAY;AACrB,iBAAiB;AAEjB,iCAAW,SAAS,CAAC,gBAAgB,GAAG,SAAS,iBAAiB,IAAI;IACpE,4BAA4B;IAC5B,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,GAC1D;IAEF,6DAA6D;IAC7D,IAAI;IACJ,IAAI;IACJ,IAAI,KAAK,IAAI,EACX,OAAO,IAAI,OAAG,KAAK,IAAI,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG;SACtC;QACL,IAAI,QAAQ,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACrC,2BAA2B;QAC3B,OAAO,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,IAAI,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE;QACvD,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG;IAC5B;IACA,IAAI,KAAK,MAAM,EACb,SAAS,IAAI,OAAG,KAAK,MAAM,EAAE;SACxB;QACL,mDAAmD;QACnD,IAAI,UAAU,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,GAC1D,SAAS,OAAO,CAAC,EAAE;aACd;YACL,SAAS,OAAO,CAAC,EAAE;YACnB,6BAAO,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW;QAC7D;IACF;IAEA,iEAAiE;IACjE,IAAI;IACJ,IAAI,KAAK,KAAK,EACZ,QAAQ,KAAK,KAAK,CAAC,GAAG,CAAC,SAAS,GAAG;QACjC,OAAO;YACL,GAAG,IAAI,OAAG,IAAI,CAAC,EAAE;YACjB,GAAG,IAAI,OAAG,IAAI,CAAC,EAAE;QACnB;IACF;SAEA,QAAQ,IAAI,CAAC,aAAa,CAAC;IAG7B,OAAO;QACL,MAAM;QACN,QAAQ;QACR,OAAO;IACT;AACF;AAEA,iCAAW,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,GAAG;IAC7D,qCAAqC;IACrC,8BAA8B;IAC9B,EAAE;IACF,IAAI,MAAM,QAAQ,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,OAAG,IAAI,CAAC;IAC9C,IAAI,OAAO,IAAI,OAAG,GAAG,KAAK,CAAC,KAAK,OAAO;IACvC,IAAI,QAAQ,KAAK,MAAM;IAEvB,IAAI,IAAI,IAAI,OAAG,GAAG,KAAK,CAAC,KAAK,MAAM,GAAG,OAAO,GAAG,MAAM,CAAC;IAEvD,IAAI,KAAK,MAAM,MAAM,CAAC,GAAG,OAAO;IAChC,IAAI,KAAK,MAAM,MAAM,CAAC,GAAG,OAAO;IAChC,OAAO;QAAE;QAAI;KAAI;AACnB;AAEA,iCAAW,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,MAAM;IAChE,2BAA2B;IAC3B,IAAI,WAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,KAAK;IAE5D,OAAO;IACP,sCAAsC;IACtC,IAAI,IAAI;IACR,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK;IACpB,IAAI,KAAK,IAAI,OAAG;IAChB,IAAI,KAAK,IAAI,OAAG;IAChB,IAAI,KAAK,IAAI,OAAG;IAChB,IAAI,KAAK,IAAI,OAAG;IAEhB,6DAA6D;IAC7D,IAAI;IACJ,IAAI;IACJ,eAAe;IACf,IAAI;IACJ,IAAI;IACJ,gBAAgB;IAChB,IAAI;IACJ,IAAI;IAEJ,IAAI;IACJ,IAAI,IAAI;IACR,IAAI;IACJ,IAAI;IACJ,MAAO,EAAE,IAAI,CAAC,OAAO,EAAG;QACtB,IAAI,IAAI,EAAE,GAAG,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC;QAChB,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC;QACjB,IAAI,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC;QAErB,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,YAAY,GAAG;YAC9B,KAAK,MAAM,GAAG;YACd,KAAK;YACL,KAAK,EAAE,GAAG;YACV,KAAK;QACP,OAAO,IAAI,MAAM,EAAE,MAAM,GACvB;QAEF,QAAQ;QAER,IAAI;QACJ,IAAI;QACJ,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;IACP;IACA,KAAK,EAAE,GAAG;IACV,KAAK;IAEL,IAAI,OAAO,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG;IAC9B,IAAI,OAAO,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG;IAC9B,IAAI,KAAK,GAAG,CAAC,SAAS,GAAG;QACvB,KAAK;QACL,KAAK;IACP;IAEA,kBAAkB;IAClB,IAAI,GAAG,QAAQ,EAAE;QACf,KAAK,GAAG,GAAG;QACX,KAAK,GAAG,GAAG;IACb;IACA,IAAI,GAAG,QAAQ,EAAE;QACf,KAAK,GAAG,GAAG;QACX,KAAK,GAAG,GAAG;IACb;IAEA,OAAO;QACL;YAAE,GAAG;YAAI,GAAG;QAAG;QACf;YAAE,GAAG;YAAI,GAAG;QAAG;KAChB;AACH;AAEA,iCAAW,SAAS,CAAC,UAAU,GAAG,SAAS,WAAW,CAAC;IACrD,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,KAAK;IAC3B,IAAI,KAAK,KAAK,CAAC,EAAE;IACjB,IAAI,KAAK,KAAK,CAAC,EAAE;IAEjB,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAE1C,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC;IACpB,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC;IACpB,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC;IACpB,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC;IAEpB,mBAAmB;IACnB,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC;IACvB,IAAI,KAAK,GAAG,GAAG,CAAC,IAAI,GAAG;IACvB,OAAO;QAAE,IAAI;QAAI,IAAI;IAAG;AAC1B;AAEA,iCAAW,SAAS,CAAC,UAAU,GAAG,SAAS,WAAW,CAAC,EAAE,GAAG;IAC1D,IAAI,IAAI,OAAG,GAAG;IACd,IAAI,CAAC,EAAE,GAAG,EACR,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG;IAEtB,IAAI,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACtE,IAAI,IAAI,GAAG,OAAO;IAClB,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,GAC3C,MAAM,IAAI,MAAM;IAElB,0EAA0E;IAC1E,mBAAmB;IACnB,IAAI,QAAQ,EAAE,OAAO,GAAG,KAAK;IAC7B,IAAI,OAAO,CAAC,SAAS,CAAC,OAAO,OAC3B,IAAI,EAAE,MAAM;IAEd,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG;AACvB;AAEA,iCAAW,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAS,KAAK;IACrD,IAAI,MAAM,GAAG,EACX,OAAO;IAET,IAAI,IAAI,MAAM,CAAC;IACf,IAAI,IAAI,MAAM,CAAC;IAEf,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACvB,IAAI,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACzD,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO;AAC7C;AAEA,iCAAW,SAAS,CAAC,eAAe,GAChC,SAAS,gBAAgB,MAAM,EAAE,MAAM,EAAE,cAAc;IACrD,IAAI,UAAU,IAAI,CAAC,WAAW;IAC9B,IAAI,UAAU,IAAI,CAAC,WAAW;IAC9B,IAAK,IAAI,IAAI,GAAG,IAAI,OAAO,MAAM,EAAE,IAAK;QACtC,IAAI,QAAQ,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE;QACrC,IAAI,IAAI,MAAM,CAAC,EAAE;QACjB,IAAI,OAAO,EAAE,QAAQ;QAErB,IAAI,MAAM,EAAE,CAAC,QAAQ,EAAE;YACrB,MAAM,EAAE,CAAC,IAAI;YACb,IAAI,EAAE,GAAG,CAAC;QACZ;QACA,IAAI,MAAM,EAAE,CAAC,QAAQ,EAAE;YACrB,MAAM,EAAE,CAAC,IAAI;YACb,OAAO,KAAK,GAAG,CAAC;QAClB;QAEA,OAAO,CAAC,IAAI,EAAE,GAAG;QACjB,OAAO,CAAC,IAAI,IAAI,EAAE,GAAG;QACrB,OAAO,CAAC,IAAI,EAAE,GAAG,MAAM,EAAE;QACzB,OAAO,CAAC,IAAI,IAAI,EAAE,GAAG,MAAM,EAAE;IAC/B;IACA,IAAI,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,SAAS,SAAS,IAAI,GAAG;IAEvD,iDAAiD;IACjD,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAK;QAC9B,OAAO,CAAC,EAAE,GAAG;QACb,OAAO,CAAC,EAAE,GAAG;IACf;IACA,OAAO;AACT;AAEJ,SAAS,4BAAM,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK;IAC/B,OAAK,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO;IACjC,IAAI,MAAM,QAAQ,MAAM,MAAM;QAC5B,IAAI,CAAC,CAAC,GAAG;QACT,IAAI,CAAC,CAAC,GAAG;QACT,IAAI,CAAC,GAAG,GAAG;IACb,OAAO;QACL,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,GAAG;QACnB,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,GAAG;QACnB,wDAAwD;QACxD,IAAI,OAAO;YACT,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;YAC9B,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;QAChC;QACA,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;QACtC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;QACtC,IAAI,CAAC,GAAG,GAAG;IACb;AACF;AACA,OAAS,6BAAO,OAAK,SAAS;AAE9B,iCAAW,SAAS,CAAC,KAAK,GAAG,SAAS,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK;IACrD,OAAO,IAAI,4BAAM,IAAI,EAAE,GAAG,GAAG;AAC/B;AAEA,iCAAW,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,GAAG,EAAE,GAAG;IAClE,OAAO,4BAAM,QAAQ,CAAC,IAAI,EAAE,KAAK;AACnC;AAEA,4BAAM,SAAS,CAAC,QAAQ,GAAG,SAAS;IAClC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAClB;IAEF,IAAI,MAAM,IAAI,CAAC,WAAW;IAC1B,IAAI,OAAO,IAAI,IAAI,EACjB,OAAO,IAAI,IAAI;IAEjB,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;IACvE,IAAI,KAAK;QACP,IAAI,QAAQ,IAAI,CAAC,KAAK;QACtB,IAAI,UAAU,SAAS,CAAC;YACtB,OAAO,MAAM,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACrD;QACA,IAAI,IAAI,GAAG;QACX,KAAK,WAAW,GAAG;YACjB,MAAM;YACN,KAAK,IAAI,GAAG,IAAI;gBACd,KAAK,IAAI,GAAG,CAAC,GAAG;gBAChB,QAAQ,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC;YAC7B;YACA,SAAS,IAAI,OAAO,IAAI;gBACtB,MAAM,IAAI,OAAO,CAAC,IAAI;gBACtB,QAAQ,IAAI,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC;YACjC;QACF;IACF;IACA,OAAO;AACT;AAEA,4BAAM,SAAS,CAAC,MAAM,GAAG,SAAS;IAChC,IAAI,CAAC,IAAI,CAAC,WAAW,EACnB,OAAO;QAAE,IAAI,CAAC,CAAC;QAAE,IAAI,CAAC,CAAC;KAAE;IAE3B,OAAO;QAAE,IAAI,CAAC,CAAC;QAAE,IAAI,CAAC,CAAC;QAAE,IAAI,CAAC,WAAW,IAAI;YAC3C,SAAS,IAAI,CAAC,WAAW,CAAC,OAAO,IAAI;gBACnC,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI;gBACnC,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC;YAChD;YACA,KAAK,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI;gBAC3B,KAAK,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG;gBAC7B,QAAQ,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC;YAC5C;QACF;KAAG;AACL;AAEA,4BAAM,QAAQ,GAAG,SAAS,SAAS,KAAK,EAAE,GAAG,EAAE,GAAG;IAChD,IAAI,OAAO,QAAQ,UACjB,MAAM,KAAK,KAAK,CAAC;IACnB,IAAI,MAAM,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE;IACtC,IAAI,CAAC,GAAG,CAAC,EAAE,EACT,OAAO;IAET,SAAS,UAAU,GAAG;QACpB,OAAO,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE;IACrC;IAEA,IAAI,MAAM,GAAG,CAAC,EAAE;IAChB,IAAI,WAAW,GAAG;QAChB,MAAM;QACN,SAAS,IAAI,OAAO,IAAI;YACtB,MAAM,IAAI,OAAO,CAAC,IAAI;YACtB,QAAQ;gBAAE;aAAK,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC;QAChD;QACA,KAAK,IAAI,GAAG,IAAI;YACd,KAAK,IAAI,GAAG,CAAC,GAAG;YAChB,QAAQ;gBAAE;aAAK,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC;QAC5C;IACF;IACA,OAAO;AACT;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS;IACjC,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO;IACT,OAAO,kBAAkB,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,QAAQ,CAAC,IAAI,KACnD,SAAS,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,QAAQ,CAAC,IAAI,KAAK;AAClD;AAEA,4BAAM,SAAS,CAAC,UAAU,GAAG,SAAS;IACpC,OAAO,IAAI,CAAC,GAAG;AACjB;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS,IAAI,CAAC;IAClC,YAAY;IACZ,IAAI,IAAI,CAAC,GAAG,EACV,OAAO;IAET,YAAY;IACZ,IAAI,EAAE,GAAG,EACP,OAAO,IAAI;IAEb,aAAa;IACb,IAAI,IAAI,CAAC,EAAE,CAAC,IACV,OAAO,IAAI,CAAC,GAAG;IAEjB,eAAe;IACf,IAAI,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAChB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM;IAEhC,YAAY;IACZ,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,GACtB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM;IAEhC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IACzB,IAAI,EAAE,IAAI,CAAC,OAAO,GAChB,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,OAAO;IACzC,IAAI,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;IAC/C,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IACnD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI;AAC9B;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS;IAC7B,IAAI,IAAI,CAAC,GAAG,EACV,OAAO,IAAI;IAEb,SAAS;IACT,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,IAAI,IAAI,CAAC,OAAO,GAClB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM;IAEhC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;IAEpB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;IACtB,IAAI,QAAQ,IAAI,OAAO;IACvB,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC,GAAG,MAAM,CAAC;IAEpD,IAAI,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAChD,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IACnD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI;AAC9B;AAEA,4BAAM,SAAS,CAAC,IAAI,GAAG,SAAS;IAC9B,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO;AACvB;AAEA,4BAAM,SAAS,CAAC,IAAI,GAAG,SAAS;IAC9B,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO;AACvB;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS,IAAI,CAAC;IAClC,IAAI,IAAI,OAAG,GAAG;IACd,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO,IAAI;SACR,IAAI,IAAI,CAAC,WAAW,CAAC,IACxB,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE;SAClC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EACtB,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC;QAAE,IAAI;KAAE,EAAE;QAAE;KAAG;SAEjD,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE;AACrC;AAEA,4BAAM,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE;IACjD,IAAI,SAAS;QAAE,IAAI;QAAE;KAAI;IACzB,IAAI,SAAS;QAAE;QAAI;KAAI;IACvB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EACjB,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ;SAE1C,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,QAAQ,QAAQ;AACrD;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE;IACnD,IAAI,SAAS;QAAE,IAAI;QAAE;KAAI;IACzB,IAAI,SAAS;QAAE;QAAI;KAAI;IACvB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EACjB,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,QAAQ;SAElD,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,QAAQ,QAAQ,GAAG;AACxD;AAEA,4BAAM,SAAS,CAAC,EAAE,GAAG,SAAS,GAAG,CAAC;IAChC,OAAO,IAAI,KAAK,KACT,IAAI,CAAC,GAAG,KAAK,EAAE,GAAG,IACb,CAAA,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAA;AACvE;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS,IAAI,WAAW;IAC5C,IAAI,IAAI,CAAC,GAAG,EACV,OAAO,IAAI;IAEb,IAAI,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM;IAChD,IAAI,eAAe,IAAI,CAAC,WAAW,EAAE;QACnC,IAAI,MAAM,IAAI,CAAC,WAAW;QAC1B,IAAI,SAAS,SAAS,CAAC;YACrB,OAAO,EAAE,GAAG;QACd;QACA,IAAI,WAAW,GAAG;YAChB,KAAK,IAAI,GAAG,IAAI;gBACd,KAAK,IAAI,GAAG,CAAC,GAAG;gBAChB,QAAQ,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC;YAC7B;YACA,SAAS,IAAI,OAAO,IAAI;gBACtB,MAAM,IAAI,OAAO,CAAC,IAAI;gBACtB,QAAQ,IAAI,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC;YACjC;QACF;IACF;IACA,OAAO;AACT;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS;IAC7B,IAAI,IAAI,CAAC,GAAG,EACV,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,MAAM;IAEvC,IAAI,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG;IAC1D,OAAO;AACT;AAEA,SAAS,6BAAO,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC5B,OAAK,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO;IACjC,IAAI,MAAM,QAAQ,MAAM,QAAQ,MAAM,MAAM;QAC1C,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG;QACvB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG;QACvB,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG;IAClB,OAAO;QACL,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,GAAG;QACnB,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,GAAG;QACnB,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,GAAG;IACrB;IACA,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;IACtC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;IACtC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;IAEtC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG;AACvC;AACA,OAAS,8BAAQ,OAAK,SAAS;AAE/B,iCAAW,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;IACnD,OAAO,IAAI,6BAAO,IAAI,EAAE,GAAG,GAAG;AAChC;AAEA,6BAAO,SAAS,CAAC,GAAG,GAAG,SAAS;IAC9B,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM;IAEhC,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO;IACzB,IAAI,QAAQ,KAAK,MAAM;IACvB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACvB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,MAAM,CAAC;IAErC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI;AAC9B;AAEA,6BAAO,SAAS,CAAC,GAAG,GAAG,SAAS;IAC9B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC;AAC1D;AAEA,6BAAO,SAAS,CAAC,GAAG,GAAG,SAAS,IAAI,CAAC;IACnC,YAAY;IACZ,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO;IAET,YAAY;IACZ,IAAI,EAAE,UAAU,IACd,OAAO,IAAI;IAEb,gBAAgB;IAChB,IAAI,MAAM,EAAE,CAAC,CAAC,MAAM;IACpB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;IACtB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACvB,IAAI,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC;IACpB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC;IACrC,IAAI,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAEpC,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,IAAI,EAAE,IAAI,CAAC,OAAO,GAAG;QACnB,IAAI,EAAE,IAAI,CAAC,OAAO,GAChB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,MAAM;aAErC,OAAO,IAAI,CAAC,GAAG;IACnB;IAEA,IAAI,KAAK,EAAE,MAAM;IACjB,IAAI,KAAK,GAAG,MAAM,CAAC;IACnB,IAAI,IAAI,GAAG,MAAM,CAAC;IAElB,IAAI,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,OAAO,CAAC,GAAG,OAAO,CAAC;IACnD,IAAI,KAAK,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,KAAK,OAAO,CAAC,GAAG,MAAM,CAAC;IACnD,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IAEnC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI;AACnC;AAEA,6BAAO,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAS,CAAC;IAC7C,YAAY;IACZ,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO,EAAE,GAAG;IAEd,YAAY;IACZ,IAAI,EAAE,UAAU,IACd,OAAO,IAAI;IAEb,eAAe;IACf,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;IACtB,IAAI,KAAK,IAAI,CAAC,CAAC;IACf,IAAI,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC;IACpB,IAAI,KAAK,IAAI,CAAC,CAAC;IACf,IAAI,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;IAErC,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,IAAI,EAAE,IAAI,CAAC,OAAO,GAAG;QACnB,IAAI,EAAE,IAAI,CAAC,OAAO,GAChB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,MAAM;aAErC,OAAO,IAAI,CAAC,GAAG;IACnB;IAEA,IAAI,KAAK,EAAE,MAAM;IACjB,IAAI,KAAK,GAAG,MAAM,CAAC;IACnB,IAAI,IAAI,GAAG,MAAM,CAAC;IAElB,IAAI,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,OAAO,CAAC,GAAG,OAAO,CAAC;IACnD,IAAI,KAAK,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,KAAK,OAAO,CAAC,GAAG,MAAM,CAAC;IACnD,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IAEvB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI;AACnC;AAEA,6BAAO,SAAS,CAAC,IAAI,GAAG,SAAS,KAAK,GAAG;IACvC,IAAI,QAAQ,GACV,OAAO,IAAI;IACb,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO,IAAI;IACb,IAAI,CAAC,KACH,OAAO,IAAI,CAAC,GAAG;IAEjB,IAAI;IACJ,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;QACzC,IAAI,IAAI,IAAI;QACZ,IAAK,IAAI,GAAG,IAAI,KAAK,IACnB,IAAI,EAAE,GAAG;QACX,OAAO;IACT;IAEA,oCAAoC;IACpC,wBAAwB;IACxB,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;IACpB,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI;IAE1B,IAAI,KAAK,IAAI,CAAC,CAAC;IACf,IAAI,KAAK,IAAI,CAAC,CAAC;IACf,IAAI,KAAK,IAAI,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM;IAE5B,gBAAgB;IAChB,IAAI,MAAM,GAAG,MAAM,CAAC;IACpB,IAAK,IAAI,GAAG,IAAI,KAAK,IAAK;QACxB,IAAI,MAAM,GAAG,MAAM;QACnB,IAAI,OAAO,IAAI,MAAM;QACrB,IAAI,OAAO,KAAK,MAAM;QACtB,IAAI,IAAI,IAAI,MAAM,CAAC,KAAK,OAAO,CAAC,KAAK,OAAO,CAAC,EAAE,MAAM,CAAC;QAEtD,IAAI,KAAK,GAAG,MAAM,CAAC;QACnB,IAAI,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,MAAM,CAAC;QACtC,IAAI,KAAK,GAAG,OAAO,CAAC;QACpB,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,MAAM,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC;QAC/B,IAAI,KAAK,IAAI,MAAM,CAAC;QACpB,IAAI,IAAI,IAAI,KACV,MAAM,IAAI,MAAM,CAAC;QAEnB,KAAK;QACL,KAAK;QACL,MAAM;IACR;IAEA,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,OAAO;AACjD;AAEA,6BAAO,SAAS,CAAC,GAAG,GAAG,SAAS;IAC9B,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO,IAAI;IAEb,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAClB,OAAO,IAAI,CAAC,QAAQ;SACjB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EACxB,OAAO,IAAI,CAAC,SAAS;SAErB,OAAO,IAAI,CAAC,IAAI;AACpB;AAEA,6BAAO,SAAS,CAAC,QAAQ,GAAG,SAAS;IACnC,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,QAAQ;IACR,IAAI,IAAI,CAAC,IAAI,EAAE;QACb,wDAAwD;QACxD,6BAA6B;QAC7B,gBAAgB;QAEhB,YAAY;QACZ,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;QACtB,YAAY;QACZ,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;QACtB,cAAc;QACd,IAAI,OAAO,GAAG,MAAM;QACpB,oCAAoC;QACpC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,OAAO,CAAC,IAAI,OAAO,CAAC;QACvD,IAAI,EAAE,OAAO,CAAC;QACd,wBAAwB;QACxB,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,OAAO,CAAC;QAC9B,kBAAkB;QAClB,IAAI,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC;QAEtC,WAAW;QACX,IAAI,QAAQ,KAAK,OAAO,CAAC;QACzB,QAAQ,MAAM,OAAO,CAAC;QACtB,QAAQ,MAAM,OAAO,CAAC;QAEtB,SAAS;QACT,KAAK;QACL,8BAA8B;QAC9B,KAAK,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,OAAO,CAAC;QACpC,YAAY;QACZ,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,OAAO;QACL,wDAAwD;QACxD,2BAA2B;QAC3B,gBAAgB;QAEhB,WAAW;QACX,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM;QACrB,WAAW;QACX,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM;QACrB,UAAU;QACV,IAAI,IAAI,EAAE,MAAM;QAChB,+BAA+B;QAC/B,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC;QACrD,IAAI,EAAE,OAAO,CAAC;QACd,YAAY;QACZ,IAAI,IAAI,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC;QAC5B,UAAU;QACV,IAAI,IAAI,EAAE,MAAM;QAEhB,QAAQ;QACR,IAAI,KAAK,EAAE,OAAO,CAAC;QACnB,KAAK,GAAG,OAAO,CAAC;QAChB,KAAK,GAAG,OAAO,CAAC;QAEhB,iBAAiB;QACjB,KAAK,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC;QAC1B,4BAA4B;QAC5B,KAAK,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,KAAK,OAAO,CAAC;QACrC,mBAAmB;QACnB,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzB,KAAK,GAAG,OAAO,CAAC;IAClB;IAEA,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI;AACnC;AAEA,6BAAO,SAAS,CAAC,SAAS,GAAG,SAAS;IACpC,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,QAAQ;IACR,IAAI,IAAI,CAAC,IAAI,EAAE;QACb,wDAAwD;QACxD,6BAA6B;QAC7B,gBAAgB;QAEhB,YAAY;QACZ,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;QACtB,YAAY;QACZ,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;QACtB,cAAc;QACd,IAAI,OAAO,GAAG,MAAM;QACpB,oCAAoC;QACpC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,OAAO,CAAC,IAAI,OAAO,CAAC;QACvD,IAAI,EAAE,OAAO,CAAC;QACd,iBAAiB;QACjB,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtD,kBAAkB;QAClB,IAAI,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC;QACtC,SAAS;QACT,KAAK;QACL,8BAA8B;QAC9B,IAAI,QAAQ,KAAK,OAAO,CAAC;QACzB,QAAQ,MAAM,OAAO,CAAC;QACtB,QAAQ,MAAM,OAAO,CAAC;QACtB,KAAK,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,OAAO,CAAC;QACpC,cAAc;QACd,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,OAAO;QACL,4EAA4E;QAC5E,UAAU;QAEV,eAAe;QACf,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,MAAM;QACzB,eAAe;QACf,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,MAAM;QACzB,oBAAoB;QACpB,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;QACzB,0CAA0C;QAC1C,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;QACtD,QAAQ,MAAM,MAAM,CAAC,OAAO,OAAO,CAAC;QACpC,0BAA0B;QAC1B,IAAI,QAAQ,KAAK,OAAO,CAAC;QACzB,QAAQ,MAAM,OAAO,CAAC;QACtB,IAAI,QAAQ,MAAM,MAAM,CAAC;QACzB,KAAK,MAAM,MAAM,GAAG,OAAO,CAAC;QAC5B,mCAAmC;QACnC,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,OAAO,CAAC;QAC3D,6CAA6C;QAC7C,IAAI,UAAU,MAAM,MAAM;QAC1B,UAAU,QAAQ,OAAO,CAAC;QAC1B,UAAU,QAAQ,OAAO,CAAC;QAC1B,UAAU,QAAQ,OAAO,CAAC;QAC1B,KAAK,MAAM,MAAM,CAAC,MAAM,OAAO,CAAC,KAAK,OAAO,CAAC;IAC/C;IAEA,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI;AACnC;AAEA,6BAAO,SAAS,CAAC,IAAI,GAAG,SAAS;IAC/B,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;IAEpB,gBAAgB;IAChB,IAAI,KAAK,IAAI,CAAC,CAAC;IACf,IAAI,KAAK,IAAI,CAAC,CAAC;IACf,IAAI,KAAK,IAAI,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM;IAE5B,IAAI,MAAM,GAAG,MAAM;IACnB,IAAI,MAAM,GAAG,MAAM;IAEnB,IAAI,IAAI,IAAI,MAAM,CAAC,KAAK,OAAO,CAAC,KAAK,OAAO,CAAC,EAAE,MAAM,CAAC;IAEtD,IAAI,OAAO,GAAG,MAAM,CAAC;IACrB,OAAO,KAAK,OAAO,CAAC;IACpB,IAAI,KAAK,KAAK,MAAM,CAAC;IACrB,IAAI,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,MAAM,CAAC;IACtC,IAAI,KAAK,GAAG,OAAO,CAAC;IAEpB,IAAI,OAAO,IAAI,MAAM;IACrB,OAAO,KAAK,OAAO,CAAC;IACpB,OAAO,KAAK,OAAO,CAAC;IACpB,OAAO,KAAK,OAAO,CAAC;IACpB,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,OAAO,CAAC;IAC9B,IAAI,KAAK,GAAG,MAAM,CAAC,IAAI,MAAM,CAAC;IAE9B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI;AACnC;AAEA,6BAAO,SAAS,CAAC,IAAI,GAAG,SAAS;IAC/B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EACnB,OAAO,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI;IAE5B,6EAA6E;IAC7E,iBAAiB;IAEjB,YAAY;IACZ,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;IACtB,YAAY;IACZ,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;IACtB,YAAY;IACZ,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;IACtB,cAAc;IACd,IAAI,OAAO,GAAG,MAAM;IACpB,8BAA8B;IAC9B,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,OAAO,CAAC;IAC9B,WAAW;IACX,IAAI,KAAK,EAAE,MAAM;IACjB,yCAAyC;IACzC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,OAAO,CAAC,IAAI,OAAO,CAAC;IACvD,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC;IACxB,IAAI,EAAE,OAAO,CAAC;IACd,WAAW;IACX,IAAI,KAAK,EAAE,MAAM;IACjB,cAAc;IACd,IAAI,IAAI,KAAK,OAAO,CAAC;IACrB,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,OAAO,CAAC;IACd,8BAA8B;IAC9B,IAAI,IAAI,EAAE,OAAO,CAAC,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC;IAC9D,kCAAkC;IAClC,IAAI,OAAO,GAAG,MAAM,CAAC;IACrB,OAAO,KAAK,OAAO,CAAC;IACpB,OAAO,KAAK,OAAO,CAAC;IACpB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC;IACnC,KAAK,GAAG,OAAO,CAAC;IAChB,KAAK,GAAG,OAAO,CAAC;IAChB,uCAAuC;IACvC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,OAAO,CAAC,EAAE,MAAM,CAAC;IAC/D,KAAK,GAAG,OAAO,CAAC;IAChB,KAAK,GAAG,OAAO,CAAC;IAChB,KAAK,GAAG,OAAO,CAAC;IAChB,4BAA4B;IAC5B,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,OAAO,CAAC;IAEvD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI;AACnC;AAEA,6BAAO,SAAS,CAAC,GAAG,GAAG,SAAS,IAAI,CAAC,EAAE,KAAK;IAC1C,IAAI,IAAI,OAAG,GAAG;IAEd,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE;AACnC;AAEA,6BAAO,SAAS,CAAC,EAAE,GAAG,SAAS,GAAG,CAAC;IACjC,IAAI,EAAE,IAAI,KAAK,UACb,OAAO,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG;IAEtB,IAAI,IAAI,KAAK,GACX,OAAO;IAET,yBAAyB;IACzB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;IACtB,IAAI,MAAM,EAAE,CAAC,CAAC,MAAM;IACpB,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,OAAO,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,OAAO,GACzD,OAAO;IAET,yBAAyB;IACzB,IAAI,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IACzB,IAAI,MAAM,IAAI,MAAM,CAAC,EAAE,CAAC;IACxB,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,OAAO,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,OAAO;AAChE;AAEA,6BAAO,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,CAAC;IACzC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM;IACtB,IAAI,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC;IACxC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,GACrB,OAAO;IAET,IAAI,KAAK,EAAE,KAAK;IAChB,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;IAC/B,OAAS;QACP,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAC1B,OAAO;QAET,GAAG,OAAO,CAAC;QACX,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,GACrB,OAAO;IACX;AACF;AAEA,6BAAO,SAAS,CAAC,OAAO,GAAG,SAAS;IAClC,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO;IACT,OAAO,mBAAmB,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,KAC1C,SAAS,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,KAC7B,SAAS,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK;AACxC;AAEA,6BAAO,SAAS,CAAC,UAAU,GAAG,SAAS;IACrC,wDAAwD;IACxD,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO;AAC5B;;;;;ACz6BA;;;;;;;;;AAQA,SAAS,gCAAU,IAAI;IACrB,OAAK,IAAI,CAAC,IAAI,EAAE,QAAQ;IAExB,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG;IAC1C,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG;IAC1C,IAAI,CAAC,EAAE,GAAG,IAAI,OAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO;IAC3C,IAAI,CAAC,GAAG,GAAG,IAAI,OAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG;IACnC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG;AAClD;AACA,OAAS,iCAAW;AACpB,iBAAiB;AAEjB,gCAAU,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAS,KAAK;IACpD,IAAI,IAAI,MAAM,SAAS,GAAG,CAAC;IAC3B,IAAI,KAAK,EAAE,MAAM;IACjB,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;IACxD,IAAI,IAAI,IAAI,OAAO;IAEnB,OAAO,EAAE,MAAM,GAAG,GAAG,CAAC,SAAS;AACjC;AAEA,SAAS,4BAAM,KAAK,EAAE,CAAC,EAAE,CAAC;IACxB,OAAK,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO;IACjC,IAAI,MAAM,QAAQ,MAAM,MAAM;QAC5B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG;QACvB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI;IAC1B,OAAO;QACL,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,GAAG;QACnB,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,GAAG;QACnB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;QACtC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;IACxC;AACF;AACA,OAAS,6BAAO,OAAK,SAAS;AAE9B,gCAAU,SAAS,CAAC,WAAW,GAAG,SAAS,YAAY,KAAK,EAAE,GAAG;IAC/D,OAAO,IAAI,CAAC,KAAK,CAAC,eAAc,OAAO,MAAM;AAC/C;AAEA,gCAAU,SAAS,CAAC,KAAK,GAAG,SAAS,MAAM,CAAC,EAAE,CAAC;IAC7C,OAAO,IAAI,4BAAM,IAAI,EAAE,GAAG;AAC5B;AAEA,gCAAU,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,GAAG;IAC5D,OAAO,4BAAM,QAAQ,CAAC,IAAI,EAAE;AAC9B;AAEA,4BAAM,SAAS,CAAC,UAAU,GAAG,SAAS;AACpC,QAAQ;AACV;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS;IACjC,OAAO,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU;AAC1D;AAEA,4BAAM,QAAQ,GAAG,SAAS,SAAS,KAAK,EAAE,GAAG;IAC3C,OAAO,IAAI,4BAAM,OAAO,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,MAAM,GAAG;AACrD;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS;IACjC,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO;IACT,OAAO,kBAAkB,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,QAAQ,CAAC,IAAI,KACnD,SAAS,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,QAAQ,CAAC,IAAI,KAAK;AAClD;AAEA,4BAAM,SAAS,CAAC,UAAU,GAAG,SAAS;IACpC,wDAAwD;IACxD,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO;AAC5B;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS;IAC7B,8EAA8E;IAC9E,eAAe;IAEf,cAAc;IACd,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5B,WAAW;IACX,IAAI,KAAK,EAAE,MAAM;IACjB,cAAc;IACd,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5B,WAAW;IACX,IAAI,KAAK,EAAE,MAAM;IACjB,cAAc;IACd,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,eAAe;IACf,IAAI,KAAK,GAAG,MAAM,CAAC;IACnB,0BAA0B;IAC1B,IAAI,KAAK,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;IAClD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI;AAC9B;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS;IAC7B,MAAM,IAAI,MAAM;AAClB;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,CAAC,EAAE,IAAI;IAChD,8EAA8E;IAC9E,eAAe;IAEf,cAAc;IACd,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5B,cAAc;IACd,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5B,cAAc;IACd,IAAI,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IACtB,cAAc;IACd,IAAI,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IACtB,aAAa;IACb,IAAI,KAAK,EAAE,MAAM,CAAC;IAClB,aAAa;IACb,IAAI,KAAK,EAAE,MAAM,CAAC;IAClB,wBAAwB;IACxB,IAAI,KAAK,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,MAAM;IAC3C,wBAAwB;IACxB,IAAI,KAAK,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,MAAM;IAC5C,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI;AAC9B;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS,IAAI,CAAC;IAClC,IAAI,IAAI,EAAE,KAAK;IACf,IAAI,IAAI,IAAI,EAAE,kBAAkB;IAChC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,OAAO,cAAc;IACpD,IAAI,IAAI,IAAI,EAAE,IAAI;IAElB,IAAK,IAAI,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,OAAO,GAAG,EAAE,MAAM,CAAC,GAC5C,KAAK,IAAI,CAAC,EAAE,KAAK,CAAC;IAEpB,IAAK,IAAI,IAAI,KAAK,MAAM,GAAG,GAAG,KAAK,GAAG,IACpC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG;QACjB,+CAA+C;QAC/C,IAAI,EAAE,OAAO,CAAC,GAAG;QACjB,iCAAiC;QACjC,IAAI,EAAE,GAAG;IACX,OAAO;QACL,4CAA4C;QAC5C,IAAI,EAAE,OAAO,CAAC,GAAG;QACjB,oCAAoC;QACpC,IAAI,EAAE,GAAG;IACX;IAEF,OAAO;AACT;AAEA,4BAAM,SAAS,CAAC,MAAM,GAAG,SAAS;IAChC,MAAM,IAAI,MAAM;AAClB;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS;IACjC,MAAM,IAAI,MAAM;AAClB;AAEA,4BAAM,SAAS,CAAC,EAAE,GAAG,SAAS,GAAG,KAAK;IACpC,OAAO,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,IAAI,QAAQ;AAC3C;AAEA,4BAAM,SAAS,CAAC,SAAS,GAAG,SAAS;IACnC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO;IACrC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG;IACvB,OAAO,IAAI;AACb;AAEA,4BAAM,SAAS,CAAC,IAAI,GAAG,SAAS;IAC9B,wBAAwB;IACxB,IAAI,CAAC,SAAS;IAEd,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO;AACvB;;;;;ACjLA;;;;;;;;;AAOA,IAAI,+BAAS;AAEb,SAAS,mCAAa,IAAI;IACxB,0DAA0D;IAC1D,IAAI,CAAC,OAAO,GAAG,AAAC,CAAA,KAAK,CAAC,GAAG,CAAA,MAAO;IAChC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,IAAI,AAAC,CAAA,KAAK,CAAC,GAAG,CAAA,MAAO;IAC9C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK;IAE1B,OAAK,IAAI,CAAC,IAAI,EAAE,WAAW;IAE3B,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3C,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG;IAC9B,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG;IAC1C,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM;IACvB,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG;IAC1C,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAE9B,6BAAO,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO;IACrD,IAAI,CAAC,IAAI,GAAG,AAAC,CAAA,KAAK,CAAC,GAAG,CAAA,MAAO;AAC/B;AACA,OAAS,oCAAc;AACvB,iBAAiB;AAEjB,mCAAa,SAAS,CAAC,KAAK,GAAG,SAAS,MAAM,GAAG;IAC/C,IAAI,IAAI,CAAC,KAAK,EACZ,OAAO,IAAI,MAAM;SAEjB,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AACzB;AAEA,mCAAa,SAAS,CAAC,KAAK,GAAG,SAAS,MAAM,GAAG;IAC/C,IAAI,IAAI,CAAC,IAAI,EACX,OAAO;SAEP,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AACzB;AAEA,0CAA0C;AAC1C,mCAAa,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACxD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG;AAC7B;AAEA,mCAAa,SAAS,CAAC,UAAU,GAAG,SAAS,WAAW,CAAC,EAAE,GAAG;IAC5D,IAAI,IAAI,OAAG,GAAG;IACd,IAAI,CAAC,EAAE,GAAG,EACR,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG;IAEtB,IAAI,KAAK,EAAE,MAAM;IACjB,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACvC,IAAI,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;IAExD,IAAI,KAAK,IAAI,MAAM,CAAC,IAAI,OAAO;IAC/B,IAAI,IAAI,GAAG,OAAO;IAClB,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,GAC3C,MAAM,IAAI,MAAM;IAElB,IAAI,QAAQ,EAAE,OAAO,GAAG,KAAK;IAC7B,IAAI,OAAO,CAAC,SAAS,CAAC,OAAO,OAC3B,IAAI,EAAE,MAAM;IAEd,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG;AACvB;AAEA,mCAAa,SAAS,CAAC,UAAU,GAAG,SAAS,WAAW,CAAC,EAAE,GAAG;IAC5D,IAAI,IAAI,OAAG,GAAG;IACd,IAAI,CAAC,EAAE,GAAG,EACR,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG;IAEtB,sCAAsC;IACtC,IAAI,KAAK,EAAE,MAAM;IACjB,IAAI,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE;IAC3B,IAAI,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACzD,IAAI,KAAK,IAAI,MAAM,CAAC,IAAI,OAAO;IAE/B,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG;QAC3B,IAAI,KACF,MAAM,IAAI,MAAM;aAEhB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE;IACjC;IAEA,IAAI,IAAI,GAAG,OAAO;IAClB,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,GAC3C,MAAM,IAAI,MAAM;IAElB,IAAI,EAAE,OAAO,GAAG,KAAK,OAAO,KAC1B,IAAI,EAAE,MAAM;IAEd,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG;AACvB;AAEA,mCAAa,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAS,KAAK;IACvD,IAAI,MAAM,UAAU,IAClB,OAAO;IAET,mDAAmD;IACnD,MAAM,SAAS;IAEf,IAAI,KAAK,MAAM,CAAC,CAAC,MAAM;IACvB,IAAI,KAAK,MAAM,CAAC,CAAC,MAAM;IACvB,IAAI,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;IACnC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC;IAElE,OAAO,IAAI,GAAG,CAAC,SAAS;AAC1B;AAEA,SAAS,4BAAM,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC9B,OAAK,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO;IACjC,IAAI,MAAM,QAAQ,MAAM,QAAQ,MAAM,MAAM;QAC1C,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI;QACxB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG;QACvB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG;QACvB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI;QACxB,IAAI,CAAC,IAAI,GAAG;IACd,OAAO;QACL,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,GAAG;QACnB,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,GAAG;QACnB,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,OAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG;QAC3C,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI,OAAG,GAAG;QACxB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;QACtC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;QACtC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;QACtC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACvB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;QACtC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG;QAErC,2BAA2B;QAC3B,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;YAClC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,IAAI,EACZ,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO;QACzC;IACF;AACF;AACA,OAAS,6BAAO,OAAK,SAAS;AAE9B,mCAAa,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,GAAG;IAC/D,OAAO,4BAAM,QAAQ,CAAC,IAAI,EAAE;AAC9B;AAEA,mCAAa,SAAS,CAAC,KAAK,GAAG,SAAS,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACtD,OAAO,IAAI,4BAAM,IAAI,EAAE,GAAG,GAAG,GAAG;AAClC;AAEA,4BAAM,QAAQ,GAAG,SAAS,SAAS,KAAK,EAAE,GAAG;IAC3C,OAAO,IAAI,4BAAM,OAAO,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE;AAChD;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS;IACjC,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO;IACT,OAAO,kBAAkB,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,QAAQ,CAAC,IAAI,KACnD,SAAS,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,QAAQ,CAAC,IAAI,KACvC,SAAS,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,QAAQ,CAAC,IAAI,KAAK;AAClD;AAEA,4BAAM,SAAS,CAAC,UAAU,GAAG,SAAS;IACpC,wDAAwD;IACxD,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,KACvB,CAAA,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,KACvB,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;AAChD;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS;IACjC,yDAAyD;IACzD,8BAA8B;IAC9B,UAAU;IAEV,WAAW;IACX,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM;IACrB,WAAW;IACX,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM;IACrB,eAAe;IACf,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM;IACrB,IAAI,EAAE,OAAO,CAAC;IACd,YAAY;IACZ,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;IACzB,0BAA0B;IAC1B,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC;IAC1D,YAAY;IACZ,IAAI,IAAI,EAAE,MAAM,CAAC;IACjB,YAAY;IACZ,IAAI,IAAI,EAAE,MAAM,CAAC;IACjB,YAAY;IACZ,IAAI,IAAI,EAAE,MAAM,CAAC;IACjB,aAAa;IACb,IAAI,KAAK,EAAE,MAAM,CAAC;IAClB,aAAa;IACb,IAAI,KAAK,EAAE,MAAM,CAAC;IAClB,aAAa;IACb,IAAI,KAAK,EAAE,MAAM,CAAC;IAClB,aAAa;IACb,IAAI,KAAK,EAAE,MAAM,CAAC;IAClB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI;AACtC;AAEA,4BAAM,SAAS,CAAC,QAAQ,GAAG,SAAS;IAClC,yDAAyD;IACzD,+BAA+B;IAC/B,4BAA4B;IAC5B,aAAa;IACb,+BAA+B;IAE/B,kBAAkB;IAClB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM;IACpC,WAAW;IACX,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM;IACrB,WAAW;IACX,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM;IAErB,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE;QACtB,YAAY;QACZ,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;QACrB,YAAY;QACZ,IAAI,IAAI,EAAE,MAAM,CAAC;QACjB,IAAI,IAAI,CAAC,IAAI,EAAE;YACb,6BAA6B;YAC7B,KAAK,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;YACzD,mBAAmB;YACnB,KAAK,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC;YACvB,mBAAmB;YACnB,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;QACnC,OAAO;YACL,WAAW;YACX,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM;YACjB,gBAAgB;YAChB,IAAI,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC;YACxB,iBAAiB;YACjB,KAAK,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,MAAM,CAAC;YACnC,mBAAmB;YACnB,KAAK,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC;YACvB,aAAa;YACb,KAAK,EAAE,MAAM,CAAC;QAChB;IACF,OAAO;QACL,YAAY;QACZ,IAAI,EAAE,MAAM,CAAC;QACb,iBAAiB;QACjB,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM;QACnC,gBAAgB;QAChB,IAAI,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC;QACvB,uBAAuB;QACvB,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC;QAC3C,uBAAuB;QACvB,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,EAAE,OAAO,CAAC;QAC1C,aAAa;QACb,KAAK,EAAE,MAAM,CAAC;IAChB;IACA,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,IAAI;AAClC;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS;IAC7B,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO,IAAI;IAEb,iCAAiC;IACjC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EACrB,OAAO,IAAI,CAAC,OAAO;SAEnB,OAAO,IAAI,CAAC,QAAQ;AACxB;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,CAAC;IAC1C,yDAAyD;IACzD,gCAAgC;IAChC,KAAK;IAEL,4BAA4B;IAC5B,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IACnD,4BAA4B;IAC5B,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IACnD,kBAAkB;IAClB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;IAC/C,kBAAkB;IAClB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IACpC,YAAY;IACZ,IAAI,IAAI,EAAE,MAAM,CAAC;IACjB,YAAY;IACZ,IAAI,IAAI,EAAE,MAAM,CAAC;IACjB,YAAY;IACZ,IAAI,IAAI,EAAE,MAAM,CAAC;IACjB,YAAY;IACZ,IAAI,IAAI,EAAE,MAAM,CAAC;IACjB,aAAa;IACb,IAAI,KAAK,EAAE,MAAM,CAAC;IAClB,aAAa;IACb,IAAI,KAAK,EAAE,MAAM,CAAC;IAClB,aAAa;IACb,IAAI,KAAK,EAAE,MAAM,CAAC;IAClB,aAAa;IACb,IAAI,KAAK,EAAE,MAAM,CAAC;IAClB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI;AACtC;AAEA,4BAAM,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAS,CAAC;IAC5C,yDAAyD;IACzD,+BAA+B;IAC/B,4BAA4B;IAC5B,WAAW;IAEX,cAAc;IACd,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IACzB,UAAU;IACV,IAAI,IAAI,EAAE,MAAM;IAChB,cAAc;IACd,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IACzB,cAAc;IACd,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IACzB,gBAAgB;IAChB,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;IACtC,YAAY;IACZ,IAAI,IAAI,EAAE,MAAM,CAAC;IACjB,YAAY;IACZ,IAAI,IAAI,EAAE,MAAM,CAAC;IACjB,+CAA+C;IAC/C,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC;IAC3E,IAAI,KAAK,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC;IAC5B,IAAI;IACJ,IAAI;IACJ,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE;QACtB,2BAA2B;QAC3B,KAAK,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;QAClD,aAAa;QACb,KAAK,EAAE,MAAM,CAAC;IAChB,OAAO;QACL,uBAAuB;QACvB,KAAK,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,MAAM,CAAC;QACjC,iBAAiB;QACjB,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;IAClC;IACA,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,IAAI;AAClC;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS,IAAI,CAAC;IAClC,IAAI,IAAI,CAAC,UAAU,IACjB,OAAO;IACT,IAAI,EAAE,UAAU,IACd,OAAO,IAAI;IAEb,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EACrB,OAAO,IAAI,CAAC,OAAO,CAAC;SAEpB,OAAO,IAAI,CAAC,QAAQ,CAAC;AACzB;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS,IAAI,CAAC;IAClC,IAAI,IAAI,CAAC,WAAW,CAAC,IACnB,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE;SAErC,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE;AACrC;AAEA,4BAAM,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE;IAChD,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG;QAAE,IAAI;QAAE;KAAG,EAAE;QAAE;QAAI;KAAI,EAAE,GAAG;AAC/D;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,EAAE,EAAE,CAAC,EAAE,EAAE;IAClD,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG;QAAE,IAAI;QAAE;KAAG,EAAE;QAAE;QAAI;KAAI,EAAE,GAAG;AAC/D;AAEA,4BAAM,SAAS,CAAC,SAAS,GAAG,SAAS;IACnC,IAAI,IAAI,CAAC,IAAI,EACX,OAAO,IAAI;IAEb,wBAAwB;IACxB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO;IACvB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACvB,IAAI,IAAI,CAAC,CAAC,EACR,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACzB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG;IACvB,IAAI,CAAC,IAAI,GAAG;IACZ,OAAO,IAAI;AACb;AAEA,4BAAM,SAAS,CAAC,GAAG,GAAG,SAAS;IAC7B,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,IACnC,IAAI,CAAC,CAAC,EACN,IAAI,CAAC,CAAC,EACN,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM;AAC3B;AAEA,4BAAM,SAAS,CAAC,IAAI,GAAG,SAAS;IAC9B,IAAI,CAAC,SAAS;IACd,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO;AACvB;AAEA,4BAAM,SAAS,CAAC,IAAI,GAAG,SAAS;IAC9B,IAAI,CAAC,SAAS;IACd,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO;AACvB;AAEA,4BAAM,SAAS,CAAC,EAAE,GAAG,SAAS,GAAG,KAAK;IACpC,OAAO,IAAI,KAAK,SACT,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,IAAI,QAAQ,KAClC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,IAAI,QAAQ;AAC3C;AAEA,4BAAM,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,CAAC;IACxC,IAAI,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9C,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,GACrB,OAAO;IAET,IAAI,KAAK,EAAE,KAAK;IAChB,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrC,OAAS;QACP,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAC1B,OAAO;QAET,GAAG,OAAO,CAAC;QACX,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,GACrB,OAAO;IACX;AACF;AAEA,+BAA+B;AAC/B,4BAAM,SAAS,CAAC,GAAG,GAAG,4BAAM,SAAS,CAAC,SAAS;AAC/C,4BAAM,SAAS,CAAC,QAAQ,GAAG,4BAAM,SAAS,CAAC,GAAG;;;;;;AClb9C;AAEA,IAAI,+BAAS;;;;;;;AAMb,IAAI,+BAAS;AAEb,SAAS,kCAAY,OAAO;IAC1B,IAAI,QAAQ,IAAI,KAAK,SACnB,IAAI,CAAC,KAAK,GAAG,IAAI,aAAY;SAC1B,IAAI,QAAQ,IAAI,KAAK,WACxB,IAAI,CAAC,KAAK,GAAG,IAAI,eAAc;SAE/B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAW;IAC9B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,IAAI,CAAC,IAAI,GAAG,QAAQ,IAAI;IAExB,6BAAO,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI;IAC1B,6BAAO,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,IAAI;AAC1C;AACA,6BAAO,WAAW,GAAG;AAErB,SAAS,kCAAY,IAAI,EAAE,OAAO;IAChC,OAAO,cAAc,CAAC,8BAAQ,MAAM;QAClC,cAAc;QACd,YAAY;QACZ,KAAK;YACH,IAAI,QAAQ,IAAI,kCAAY;YAC5B,OAAO,cAAc,CAAC,8BAAQ,MAAM;gBAClC,cAAc;gBACd,YAAY;gBACZ,OAAO;YACT;YACA,OAAO;QACT;IACF;AACF;AAEA,kCAAY,QAAQ;IAClB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,MAAM;IACN,MAAM;IACN,GAAG;QACD;QACA;KACD;AACH;AAEA,kCAAY,QAAQ;IAClB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,MAAM;IACN,MAAM;IACN,GAAG;QACD;QACA;KACD;AACH;AAEA,kCAAY,QAAQ;IAClB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,MAAM;IACN,MAAM;IACN,GAAG;QACD;QACA;KACD;AACH;AAEA,kCAAY,QAAQ;IAClB,MAAM;IACN,OAAO;IACP,GAAG;IAEH,GAAG;IAEH,GAAG;IAEH,GAAG;IAEH,MAAM;IACN,MAAM;IACN,GAAG;QACD;QAEA;KAED;AACH;AAEA,kCAAY,QAAQ;IAClB,MAAM;IACN,OAAO;IACP,GAAG;IAGH,GAAG;IAGH,GAAG;IAGH,GAAG;IAGH,MAAM;IACN,MAAM;IACN,GAAG;QACD;QAGA;KAGD;AACH;AAEA,kCAAY,cAAc;IACxB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,MAAM;IACN,MAAM;IACN,GAAG;QACD;KACD;AACH;AAEA,kCAAY,WAAW;IACrB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,kCAAkC;IAClC,GAAG;IACH,GAAG;IACH,MAAM;IACN,MAAM;IACN,GAAG;QACD;QAEA,MAAM;QACN;KACD;AACH;AAEA,IAAI;;AACJ,IAAI;IACF,4BAAM;AACR,EAAE,OAAO,GAAG;IACV,4BAAM;AACR;AAEA,kCAAY,aAAa;IACvB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,MAAM;IAEN,2BAA2B;IAC3B,MAAM;IACN,QAAQ;IACR,OAAO;QACL;YACE,GAAG;YACH,GAAG;QACL;QACA;YACE,GAAG;YACH,GAAG;QACL;KACD;IAED,MAAM;IACN,GAAG;QACD;QACA;QACA;KACD;AACH;;;;AC7MA,IAAI,6BAAO;;AAEX,2BAAK,KAAK,GAAG;;AACb,2BAAK,MAAM,GAAG;;AACd,2BAAK,GAAG,GAAG;;AACX,2BAAK,MAAM,GAAG;;AACd,2BAAK,IAAI,GAAG;AAEZ,0CAA0C;AAC1C,2BAAK,IAAI,GAAG,2BAAK,GAAG,CAAC,IAAI;AACzB,2BAAK,MAAM,GAAG,2BAAK,GAAG,CAAC,MAAM;AAC7B,2BAAK,MAAM,GAAG,2BAAK,GAAG,CAAC,MAAM;AAC7B,2BAAK,MAAM,GAAG,2BAAK,GAAG,CAAC,MAAM;AAC7B,2BAAK,MAAM,GAAG,2BAAK,GAAG,CAAC,MAAM;AAC7B,2BAAK,SAAS,GAAG,2BAAK,MAAM,CAAC,SAAS;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACTtC,IAAA;AAyDA,IAAA;AAQA,IAAA;AASA,IAAA;AAYA,IAAA;AAQA,IAAA;AAoBA,IAAA;AAgBA,IAAA;AAoBA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAWA,IAAA;AAOA,IAAA;AAMA,IAAA;AAeA,IAAA;AAMA,IAAA;AAiBA,IAAA;AAOA,IAAA;AAMA,IAAA;AAMA,IAAA;AAKA,IAAA;AAMA,IAAA;AArRA;;;;;AAKA,4CAAmB;AAEnB,SAAS,sCAAgB,GAAG,EAAE,CAAC;IAC7B,IAAI,AAAC,CAAA,IAAI,UAAU,CAAC,KAAK,MAAK,MAAO,QACnC,OAAO;IAET,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,MAAM,EAC9B,OAAO;IAET,OAAO,AAAC,CAAA,IAAI,UAAU,CAAC,IAAI,KAAK,MAAK,MAAO;AAC9C;AAEA,SAAS,8BAAQ,GAAG,EAAE,GAAG;IACvB,IAAI,MAAM,OAAO,CAAC,MAChB,OAAO,IAAI,KAAK;IAClB,IAAI,CAAC,KACH,OAAO,EAAE;IACX,IAAI,MAAM,EAAE;IACZ,IAAI,OAAO,QAAQ,UAAU;QAC3B,IAAI,CAAC,KAAK;YACR,mEAAmE;YACnE,gIAAgI;YAChI,qBAAqB;YACrB,gEAAgE;YAChE,IAAI,IAAI;YACR,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAAK;gBACnC,IAAI,IAAI,IAAI,UAAU,CAAC;gBACvB,IAAI,IAAI,KACN,GAAG,CAAC,IAAI,GAAG;qBACN,IAAI,IAAI,MAAM;oBACnB,GAAG,CAAC,IAAI,GAAG,AAAC,KAAK,IAAK;oBACtB,GAAG,CAAC,IAAI,GAAG,AAAC,IAAI,KAAM;gBACxB,OAAO,IAAI,sCAAgB,KAAK,IAAI;oBAClC,IAAI,UAAW,CAAA,AAAC,CAAA,IAAI,MAAK,KAAM,EAAC,IAAM,CAAA,IAAI,UAAU,CAAC,EAAE,KAAK,MAAK;oBACjE,GAAG,CAAC,IAAI,GAAG,AAAC,KAAK,KAAM;oBACvB,GAAG,CAAC,IAAI,GAAG,AAAE,KAAK,KAAM,KAAM;oBAC9B,GAAG,CAAC,IAAI,GAAG,AAAE,KAAK,IAAK,KAAM;oBAC7B,GAAG,CAAC,IAAI,GAAG,AAAC,IAAI,KAAM;gBACxB,OAAO;oBACL,GAAG,CAAC,IAAI,GAAG,AAAC,KAAK,KAAM;oBACvB,GAAG,CAAC,IAAI,GAAG,AAAE,KAAK,IAAK,KAAM;oBAC7B,GAAG,CAAC,IAAI,GAAG,AAAC,IAAI,KAAM;gBACxB;YACF;QACF,OAAO,IAAI,QAAQ,OAAO;YACxB,MAAM,IAAI,OAAO,CAAC,gBAAgB;YAClC,IAAI,IAAI,MAAM,GAAG,MAAM,GACrB,MAAM,MAAM;YACd,IAAK,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,KAAK,EAC/B,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,EAAE;QAC3C;IACF,OACE,IAAK,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC1B,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG;IAEtB,OAAO;AACT;AACA,4CAAkB;AAElB,SAAS,4BAAM,GAAG;IAChB,IAAI,MAAM;IACV,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC9B,OAAO,4BAAM,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC;IAC/B,OAAO;AACT;AACA,4CAAgB;AAEhB,SAAS,4BAAM,CAAC;IACd,IAAI,MAAM,AAAC,MAAM,KACN,AAAC,MAAM,IAAK,SACZ,AAAC,KAAK,IAAK,WACX,AAAC,CAAA,IAAI,IAAG,KAAM;IACzB,OAAO,QAAQ;AACjB;AACA,4CAAgB;AAEhB,SAAS,8BAAQ,GAAG,EAAE,MAAM;IAC1B,IAAI,MAAM;IACV,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAAK;QACnC,IAAI,IAAI,GAAG,CAAC,EAAE;QACd,IAAI,WAAW,UACb,IAAI,4BAAM;QACZ,OAAO,4BAAM,EAAE,QAAQ,CAAC;IAC1B;IACA,OAAO;AACT;AACA,4CAAkB;AAElB,SAAS,4BAAM,IAAI;IACjB,IAAI,KAAK,MAAM,KAAK,GAClB,OAAO,MAAM;SAEb,OAAO;AACX;AACA,4CAAgB;AAEhB,SAAS,4BAAM,IAAI;IACjB,IAAI,KAAK,MAAM,KAAK,GAClB,OAAO,MAAM;SACV,IAAI,KAAK,MAAM,KAAK,GACvB,OAAO,OAAO;SACX,IAAI,KAAK,MAAM,KAAK,GACvB,OAAO,QAAQ;SACZ,IAAI,KAAK,MAAM,KAAK,GACvB,OAAO,SAAS;SACb,IAAI,KAAK,MAAM,KAAK,GACvB,OAAO,UAAU;SACd,IAAI,KAAK,MAAM,KAAK,GACvB,OAAO,WAAW;SACf,IAAI,KAAK,MAAM,KAAK,GACvB,OAAO,YAAY;SAEnB,OAAO;AACX;AACA,4CAAgB;AAEhB,SAAS,6BAAO,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM;IACrC,IAAI,MAAM,MAAM;IAChB,OAAO,MAAM,MAAM;IACnB,IAAI,MAAM,IAAI,MAAM,MAAM;IAC1B,IAAK,IAAI,IAAI,GAAG,IAAI,OAAO,IAAI,IAAI,MAAM,EAAE,KAAK,KAAK,EAAG;QACtD,IAAI;QACJ,IAAI,WAAW,OACb,IAAI,AAAC,GAAG,CAAC,EAAE,IAAI,KAAO,GAAG,CAAC,IAAI,EAAE,IAAI,KAAO,GAAG,CAAC,IAAI,EAAE,IAAI,IAAK,GAAG,CAAC,IAAI,EAAE;aAExE,IAAI,AAAC,GAAG,CAAC,IAAI,EAAE,IAAI,KAAO,GAAG,CAAC,IAAI,EAAE,IAAI,KAAO,GAAG,CAAC,IAAI,EAAE,IAAI,IAAK,GAAG,CAAC,EAAE;QAC1E,GAAG,CAAC,EAAE,GAAG,MAAM;IACjB;IACA,OAAO;AACT;AACA,4CAAiB;AAEjB,SAAS,8BAAQ,GAAG,EAAE,MAAM;IAC1B,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,GAAG;IACjC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,KAAK,KAAK,EAAG;QAClD,IAAI,IAAI,GAAG,CAAC,EAAE;QACd,IAAI,WAAW,OAAO;YACpB,GAAG,CAAC,EAAE,GAAG,MAAM;YACf,GAAG,CAAC,IAAI,EAAE,GAAG,AAAC,MAAM,KAAM;YAC1B,GAAG,CAAC,IAAI,EAAE,GAAG,AAAC,MAAM,IAAK;YACzB,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI;QACnB,OAAO;YACL,GAAG,CAAC,IAAI,EAAE,GAAG,MAAM;YACnB,GAAG,CAAC,IAAI,EAAE,GAAG,AAAC,MAAM,KAAM;YAC1B,GAAG,CAAC,IAAI,EAAE,GAAG,AAAC,MAAM,IAAK;YACzB,GAAG,CAAC,EAAE,GAAG,IAAI;QACf;IACF;IACA,OAAO;AACT;AACA,4CAAkB;AAElB,SAAS,6BAAO,CAAC,EAAE,CAAC;IAClB,OAAO,AAAC,MAAM,IAAM,KAAM,KAAK;AACjC;AACA,4CAAiB;AAEjB,SAAS,6BAAO,CAAC,EAAE,CAAC;IAClB,OAAO,AAAC,KAAK,IAAM,MAAO,KAAK;AACjC;AACA,4CAAiB;AAEjB,SAAS,4BAAM,CAAC,EAAE,CAAC;IACjB,OAAO,AAAC,IAAI,MAAO;AACrB;AACA,4CAAgB;AAEhB,SAAS,8BAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;IACtB,OAAO,AAAC,IAAI,IAAI,MAAO;AACzB;AACA,4CAAkB;AAElB,SAAS,8BAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACzB,OAAO,AAAC,IAAI,IAAI,IAAI,MAAO;AAC7B;AACA,4CAAkB;AAElB,SAAS,8BAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC5B,OAAO,AAAC,IAAI,IAAI,IAAI,IAAI,MAAO;AACjC;AACA,4CAAkB;AAElB,SAAS,4BAAM,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE;IAC7B,IAAI,KAAK,GAAG,CAAC,IAAI;IACjB,IAAI,KAAK,GAAG,CAAC,MAAM,EAAE;IAErB,IAAI,KAAK,AAAC,KAAK,OAAQ;IACvB,IAAI,KAAK,AAAC,CAAA,KAAK,KAAK,IAAI,CAAA,IAAK,KAAK;IAClC,GAAG,CAAC,IAAI,GAAG,OAAO;IAClB,GAAG,CAAC,MAAM,EAAE,GAAG;AACjB;AACA,4CAAgB;AAEhB,SAAS,+BAAS,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC9B,IAAI,KAAK,AAAC,KAAK,OAAQ;IACvB,IAAI,KAAK,AAAC,CAAA,KAAK,KAAK,IAAI,CAAA,IAAK,KAAK;IAClC,OAAO,OAAO;AAChB;AACA,4CAAmB;AAEnB,SAAS,+BAAS,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC9B,IAAI,KAAK,KAAK;IACd,OAAO,OAAO;AAChB;AACA,4CAAmB;AAEnB,SAAS,iCAAW,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAChD,IAAI,QAAQ;IACZ,IAAI,KAAK;IACT,KAAK,AAAC,KAAK,OAAQ;IACnB,SAAS,KAAK,KAAK,IAAI;IACvB,KAAK,AAAC,KAAK,OAAQ;IACnB,SAAS,KAAK,KAAK,IAAI;IACvB,KAAK,AAAC,KAAK,OAAQ;IACnB,SAAS,KAAK,KAAK,IAAI;IAEvB,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK;IAC7B,OAAO,OAAO;AAChB;AACA,2CAAqB;AAErB,SAAS,iCAAW,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAChD,IAAI,KAAK,KAAK,KAAK,KAAK;IACxB,OAAO,OAAO;AAChB;AACA,4CAAqB;AAErB,SAAS,iCAAW,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IACxD,IAAI,QAAQ;IACZ,IAAI,KAAK;IACT,KAAK,AAAC,KAAK,OAAQ;IACnB,SAAS,KAAK,KAAK,IAAI;IACvB,KAAK,AAAC,KAAK,OAAQ;IACnB,SAAS,KAAK,KAAK,IAAI;IACvB,KAAK,AAAC,KAAK,OAAQ;IACnB,SAAS,KAAK,KAAK,IAAI;IACvB,KAAK,AAAC,KAAK,OAAQ;IACnB,SAAS,KAAK,KAAK,IAAI;IAEvB,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;IAClC,OAAO,OAAO;AAChB;AACA,4CAAqB;AAErB,SAAS,iCAAW,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IACxD,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK;IAE7B,OAAO,OAAO;AAChB;AACA,4CAAqB;AAErB,SAAS,gCAAU,EAAE,EAAE,EAAE,EAAE,GAAG;IAC5B,IAAI,IAAI,AAAC,MAAO,KAAK,MAAS,OAAO;IACrC,OAAO,MAAM;AACf;AACA,2CAAoB;AAEpB,SAAS,gCAAU,EAAE,EAAE,EAAE,EAAE,GAAG;IAC5B,IAAI,IAAI,AAAC,MAAO,KAAK,MAAS,OAAO;IACrC,OAAO,MAAM;AACf;AACA,4CAAoB;AAEpB,SAAS,+BAAS,EAAE,EAAE,EAAE,EAAE,GAAG;IAC3B,OAAO,OAAO;AAChB;AACA,4CAAmB;AAEnB,SAAS,+BAAS,EAAE,EAAE,EAAE,EAAE,GAAG;IAC3B,IAAI,IAAI,AAAC,MAAO,KAAK,MAAS,OAAO;IACrC,OAAO,MAAM;AACf;AACA,4CAAmB;;;;;;;ACpQnB,IAAA;AAjBA;;;;;AAKA,SAAS;IACP,IAAI,CAAC,OAAO,GAAG;IACf,IAAI,CAAC,YAAY,GAAG;IACpB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS;IAC3C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO;IACvC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,YAAY;IACjD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,GAAG;IAC9C,IAAI,CAAC,MAAM,GAAG;IAEd,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,GAAG;IAChC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,GAAG;AACnC;AACA,4CAAoB;AAEpB,gCAAU,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,GAAG,EAAE,GAAG;IACnD,+DAA+D;IAC/D,MAAM,eAAc,KAAK;IACzB,IAAI,CAAC,IAAI,CAAC,OAAO,EACf,IAAI,CAAC,OAAO,GAAG;SAEf,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IACrC,IAAI,CAAC,YAAY,IAAI,IAAI,MAAM;IAE/B,4BAA4B;IAC5B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE;QACvC,MAAM,IAAI,CAAC,OAAO;QAElB,iCAAiC;QACjC,IAAI,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO;QACjC,IAAI,CAAC,OAAO,GAAG,IAAI,KAAK,CAAC,IAAI,MAAM,GAAG,GAAG,IAAI,MAAM;QACnD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,GAC1B,IAAI,CAAC,OAAO,GAAG;QAEjB,MAAM,cAAa,KAAK,GAAG,IAAI,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM;QACtD,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,KAAK,IAAI,CAAC,QAAQ,CAChD,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,QAAQ;IAC1C;IAEA,OAAO,IAAI;AACb;AAEA,gCAAU,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,GAAG;IAC9C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI;IACrB,OAAO,IAAI,CAAC,OAAO,KAAK;IAExB,OAAO,IAAI,CAAC,OAAO,CAAC;AACtB;AAEA,gCAAU,SAAS,CAAC,IAAI,GAAG,SAAS;IAClC,IAAI,MAAM,IAAI,CAAC,YAAY;IAC3B,IAAI,QAAQ,IAAI,CAAC,OAAO;IACxB,IAAI,IAAI,QAAS,AAAC,CAAA,MAAM,IAAI,CAAC,SAAS,AAAD,IAAK;IAC1C,IAAI,MAAM,IAAI,MAAM,IAAI,IAAI,CAAC,SAAS;IACtC,GAAG,CAAC,EAAE,GAAG;IACT,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACrB,GAAG,CAAC,EAAE,GAAG;IAEX,gBAAgB;IAChB,QAAQ;IACR,IAAI,IAAI,CAAC,MAAM,KAAK,OAAO;QACzB,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,IAClC,GAAG,CAAC,IAAI,GAAG;QAEb,GAAG,CAAC,IAAI,GAAG;QACX,GAAG,CAAC,IAAI,GAAG;QACX,GAAG,CAAC,IAAI,GAAG;QACX,GAAG,CAAC,IAAI,GAAG;QACX,GAAG,CAAC,IAAI,GAAG,AAAC,QAAQ,KAAM;QAC1B,GAAG,CAAC,IAAI,GAAG,AAAC,QAAQ,KAAM;QAC1B,GAAG,CAAC,IAAI,GAAG,AAAC,QAAQ,IAAK;QACzB,GAAG,CAAC,IAAI,GAAG,MAAM;IACnB,OAAO;QACL,GAAG,CAAC,IAAI,GAAG,MAAM;QACjB,GAAG,CAAC,IAAI,GAAG,AAAC,QAAQ,IAAK;QACzB,GAAG,CAAC,IAAI,GAAG,AAAC,QAAQ,KAAM;QAC1B,GAAG,CAAC,IAAI,GAAG,AAAC,QAAQ,KAAM;QAC1B,GAAG,CAAC,IAAI,GAAG;QACX,GAAG,CAAC,IAAI,GAAG;QACX,GAAG,CAAC,IAAI,GAAG;QACX,GAAG,CAAC,IAAI,GAAG;QAEX,IAAK,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,IAC9B,GAAG,CAAC,IAAI,GAAG;IACf;IAEA,OAAO;AACT;;;;;;;;;;;ACzFA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AANA;;AAEA,4CAAe;;AACf,4CAAiB;;AACjB,4CAAiB;;AACjB,4CAAiB;;AACjB,4CAAiB;;;;ACNjB;;;;;;;AAMA,IAAI,+BAAS;AACb,IAAI,8BAAQ;AACZ,IAAI,gCAAU;AACd,IAAI,6BAAO;AACX,IAAI,kCAAY;AAEhB,IAAI,+BAAS;IACX;IAAY;IACZ;IAAY;CACb;AAED,SAAS;IACP,IAAI,CAAE,CAAA,IAAI,YAAY,0BAAG,GACvB,OAAO,IAAI;IAEb,gCAAU,IAAI,CAAC,IAAI;IACnB,IAAI,CAAC,CAAC,GAAG;QACP;QAAY;QAAY;QACxB;QAAY;KAAY;IAC1B,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM;AACrB;AAEA,gBAAe,4BAAM;AACrB,iBAAiB;AAEjB,2BAAK,SAAS,GAAG;AACjB,2BAAK,OAAO,GAAG;AACf,2BAAK,YAAY,GAAG;AACpB,2BAAK,SAAS,GAAG;AAEjB,2BAAK,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,GAAG,EAAE,KAAK;IAClD,IAAI,IAAI,IAAI,CAAC,CAAC;IAEd,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IACtB,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,QAAQ,EAAE;IAEvB,MAAM,IAAI,EAAE,MAAM,EAAE,IAClB,CAAC,CAAC,EAAE,GAAG,6BAAO,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,EAAE;IAE7D,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IAEjB,IAAK,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK;QAC7B,IAAI,IAAI,CAAC,CAAE,CAAA,IAAI,EAAC;QAChB,IAAI,IAAI,8BAAQ,6BAAO,GAAG,IAAI,2BAAK,GAAG,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,EAAE,4BAAM,CAAC,EAAE;QAClE,IAAI;QACJ,IAAI;QACJ,IAAI,6BAAO,GAAG;QACd,IAAI;QACJ,IAAI;IACN;IAEA,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;AAC/B;AAEA,2BAAK,SAAS,CAAC,OAAO,GAAG,SAAS,OAAO,GAAG;IAC1C,IAAI,QAAQ,OACV,OAAO,eAAc,IAAI,CAAC,CAAC,EAAE;SAE7B,OAAO,eAAc,IAAI,CAAC,CAAC,EAAE;AACjC;;;;;;;;;;;;AC5DA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAKA,IAAA;AAhDA;;;AAGA,IAAI,+BAAS;AAEb,SAAS,2BAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACtB,IAAI,MAAM,GACR,OAAO,2BAAK,GAAG,GAAG;IACpB,IAAI,MAAM,KAAK,MAAM,GACnB,OAAO,0BAAI,GAAG,GAAG;IACnB,IAAI,MAAM,GACR,OAAO,4BAAM,GAAG,GAAG;AACvB;AACA,4CAAe;AAEf,SAAS,2BAAK,CAAC,EAAE,CAAC,EAAE,CAAC;IACnB,OAAO,AAAC,IAAI,IAAM,AAAC,CAAC,IAAK;AAC3B;AACA,2CAAe;AAEf,SAAS,4BAAM,CAAC,EAAE,CAAC,EAAE,CAAC;IACpB,OAAO,AAAC,IAAI,IAAM,IAAI,IAAM,IAAI;AAClC;AACA,4CAAgB;AAEhB,SAAS,0BAAI,CAAC,EAAE,CAAC,EAAE,CAAC;IAClB,OAAO,IAAI,IAAI;AACjB;AACA,4CAAc;AAEd,SAAS,6BAAO,CAAC;IACf,OAAO,6BAAO,GAAG,KAAK,6BAAO,GAAG,MAAM,6BAAO,GAAG;AAClD;AACA,4CAAiB;AAEjB,SAAS,6BAAO,CAAC;IACf,OAAO,6BAAO,GAAG,KAAK,6BAAO,GAAG,MAAM,6BAAO,GAAG;AAClD;AACA,4CAAiB;AAEjB,SAAS,6BAAO,CAAC;IACf,OAAO,6BAAO,GAAG,KAAK,6BAAO,GAAG,MAAO,MAAM;AAC/C;AACA,2CAAiB;AAEjB,SAAS,6BAAO,CAAC;IACf,OAAO,6BAAO,GAAG,MAAM,6BAAO,GAAG,MAAO,MAAM;AAChD;AACA,4CAAiB;;;;;;AChDjB;;;;;AAKA,SAAS;IACP,IAAI,CAAE,CAAA,IAAI,YAAY,4BAAK,GACzB,OAAO,IAAI;IAEb,OAAO,IAAI,CAAC,IAAI;IAChB,IAAI,CAAC,CAAC,GAAG;QACP;QAAY;QAAY;QAAY;QACpC;QAAY;QAAY;QAAY;KAAY;AACpD;AACA,gBAAe,8BAAQ;AACvB,iBAAiB;AAEjB,6BAAO,SAAS,GAAG;AACnB,6BAAO,OAAO,GAAG;AACjB,6BAAO,YAAY,GAAG;AACtB,6BAAO,SAAS,GAAG;AAEnB,6BAAO,SAAS,CAAC,OAAO,GAAG,SAAS,OAAO,GAAG;IAC5C,uBAAuB;IACvB,IAAI,QAAQ,OACV,OAAO,eAAc,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI;SAEzC,OAAO,eAAc,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI;AAC7C;;;;AC5BA;;;;;;;;;AAOA,IAAI,8BAAQ;AACZ,IAAI,gCAAU;AACd,IAAI,gCAAU;AACd,IAAI,6BAAO;AACX,IAAI,8BAAQ;AACZ,IAAI,+BAAS;AACb,IAAI,+BAAS;AACb,IAAI,+BAAS;AACb,IAAI,+BAAS;AAEb,IAAI,kCAAY;AAEhB,IAAI,iCAAW;IACb;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;CACrC;AAED,SAAS;IACP,IAAI,CAAE,CAAA,IAAI,YAAY,4BAAK,GACzB,OAAO,IAAI;IAEb,gCAAU,IAAI,CAAC,IAAI;IACnB,IAAI,CAAC,CAAC,GAAG;QACP;QAAY;QAAY;QAAY;QACpC;QAAY;QAAY;QAAY;KACrC;IACD,IAAI,CAAC,CAAC,GAAG;IACT,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM;AACrB;AACA,gBAAe,8BAAQ;AACvB,iBAAiB;AAEjB,6BAAO,SAAS,GAAG;AACnB,6BAAO,OAAO,GAAG;AACjB,6BAAO,YAAY,GAAG;AACtB,6BAAO,SAAS,GAAG;AAEnB,6BAAO,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,GAAG,EAAE,KAAK;IACpD,IAAI,IAAI,IAAI,CAAC,CAAC;IAEd,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IACtB,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,QAAQ,EAAE;IACvB,MAAO,IAAI,EAAE,MAAM,EAAE,IACnB,CAAC,CAAC,EAAE,GAAG,8BAAQ,6BAAO,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,6BAAO,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG;IAEzE,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IAEjB,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,KAAK,EAAE,MAAM;IACjC,IAAK,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK;QAC7B,IAAI,KAAK,8BAAQ,GAAG,6BAAO,IAAI,2BAAK,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE;QAC7D,IAAI,KAAK,4BAAM,6BAAO,IAAI,4BAAM,GAAG,GAAG;QACtC,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI,4BAAM,GAAG;QACb,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI,4BAAM,IAAI;IAChB;IAEA,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;IAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,4BAAM,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;AAC/B;AAEA,6BAAO,SAAS,CAAC,OAAO,GAAG,SAAS,OAAO,GAAG;IAC5C,IAAI,QAAQ,OACV,OAAO,eAAc,IAAI,CAAC,CAAC,EAAE;SAE7B,OAAO,eAAc,IAAI,CAAC,CAAC,EAAE;AACjC;;;;;;ACxGA;;;;;AAMA,SAAS;IACP,IAAI,CAAE,CAAA,IAAI,YAAY,4BAAK,GACzB,OAAO,IAAI;IAEb,OAAO,IAAI,CAAC,IAAI;IAChB,IAAI,CAAC,CAAC,GAAG;QACP;QAAY;QACZ;QAAY;QACZ;QAAY;QACZ;QAAY;QACZ;QAAY;QACZ;QAAY;QACZ;QAAY;QACZ;QAAY;KAAY;AAC5B;AACA,gBAAe,8BAAQ;AACvB,iBAAiB;AAEjB,6BAAO,SAAS,GAAG;AACnB,6BAAO,OAAO,GAAG;AACjB,6BAAO,YAAY,GAAG;AACtB,6BAAO,SAAS,GAAG;AAEnB,6BAAO,SAAS,CAAC,OAAO,GAAG,SAAS,OAAO,GAAG;IAC5C,IAAI,QAAQ,OACV,OAAO,eAAc,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,KAAK;SAE1C,OAAO,eAAc,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,KAAK;AAC9C;;;;AClCA;;;;;;;AAMA,IAAI,kCAAY;AAChB,IAAI,kCAAY;AAChB,IAAI,iCAAW;AACf,IAAI,iCAAW;AACf,IAAI,8BAAQ;AACZ,IAAI,iCAAW;AACf,IAAI,iCAAW;AACf,IAAI,mCAAa;AACjB,IAAI,mCAAa;AACjB,IAAI,mCAAa;AACjB,IAAI,mCAAa;AAEjB,IAAI,kCAAY;AAEhB,IAAI,iCAAW;IACb;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;CACrC;AAED,SAAS;IACP,IAAI,CAAE,CAAA,IAAI,YAAY,4BAAK,GACzB,OAAO,IAAI;IAEb,gCAAU,IAAI,CAAC,IAAI;IACnB,IAAI,CAAC,CAAC,GAAG;QACP;QAAY;QACZ;QAAY;QACZ;QAAY;QACZ;QAAY;QACZ;QAAY;QACZ;QAAY;QACZ;QAAY;QACZ;QAAY;KAAY;IAC1B,IAAI,CAAC,CAAC,GAAG;IACT,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM;AACrB;AACA,gBAAe,8BAAQ;AACvB,iBAAiB;AAEjB,6BAAO,SAAS,GAAG;AACnB,6BAAO,OAAO,GAAG;AACjB,6BAAO,YAAY,GAAG;AACtB,6BAAO,SAAS,GAAG;AAEnB,6BAAO,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,GAAG,EAAE,KAAK;IAChE,IAAI,IAAI,IAAI,CAAC,CAAC;IAEd,mBAAmB;IACnB,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IACtB,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,QAAQ,EAAE;IACvB,MAAO,IAAI,EAAE,MAAM,EAAE,KAAK,EAAG;QAC3B,IAAI,QAAQ,gCAAU,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,GAAI,QAAQ;QACpD,IAAI,QAAQ,gCAAU,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE;QACxC,IAAI,QAAQ,CAAC,CAAC,IAAI,GAAG,EAAG,QAAQ;QAChC,IAAI,QAAQ,CAAC,CAAC,IAAI,GAAG;QACrB,IAAI,QAAQ,gCAAU,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,IAAI,GAAG,GAAI,SAAS;QACvD,IAAI,QAAQ,gCAAU,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,IAAI,GAAG;QAC1C,IAAI,QAAQ,CAAC,CAAC,IAAI,GAAG,EAAG,SAAS;QACjC,IAAI,QAAQ,CAAC,CAAC,IAAI,GAAG;QAErB,CAAC,CAAC,EAAE,GAAG,iCACL,OAAO,OACP,OAAO,OACP,OAAO,OACP,OAAO;QACT,CAAC,CAAC,IAAI,EAAE,GAAG,iCACT,OAAO,OACP,OAAO,OACP,OAAO,OACP,OAAO;IACX;AACF;AAEA,6BAAO,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,GAAG,EAAE,KAAK;IACpD,IAAI,CAAC,aAAa,CAAC,KAAK;IAExB,IAAI,IAAI,IAAI,CAAC,CAAC;IAEd,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;IAClB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG;IACnB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG;IAEnB,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,KAAK,EAAE,MAAM;IACjC,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,KAAK,EAAG;QACpC,IAAI,QAAQ;QACZ,IAAI,QAAQ;QACZ,IAAI,QAAQ,gCAAU,IAAI;QAC1B,IAAI,QAAQ,gCAAU,IAAI;QAC1B,IAAI,QAAQ,8BAAQ,IAAI,IAAI,IAAI,IAAI,IAAI;QACxC,IAAI,QAAQ,8BAAQ,IAAI,IAAI,IAAI,IAAI,IAAI;QACxC,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,EAAE;QACrB,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE;QACzB,IAAI,QAAQ,CAAC,CAAC,EAAE;QAChB,IAAI,QAAQ,CAAC,CAAC,IAAI,EAAE;QAEpB,IAAI,QAAQ,iCACV,OAAO,OACP,OAAO,OACP,OAAO,OACP,OAAO,OACP,OAAO;QACT,IAAI,QAAQ,iCACV,OAAO,OACP,OAAO,OACP,OAAO,OACP,OAAO,OACP,OAAO;QAET,QAAQ,gCAAU,IAAI;QACtB,QAAQ,gCAAU,IAAI;QACtB,QAAQ,+BAAS,IAAI,IAAI,IAAI,IAAI,IAAI;QACrC,QAAQ,+BAAS,IAAI,IAAI,IAAI,IAAI,IAAI;QAErC,IAAI,QAAQ,+BAAS,OAAO,OAAO,OAAO;QAC1C,IAAI,QAAQ,+BAAS,OAAO,OAAO,OAAO;QAE1C,KAAK;QACL,KAAK;QAEL,KAAK;QACL,KAAK;QAEL,KAAK;QACL,KAAK;QAEL,KAAK,+BAAS,IAAI,IAAI,OAAO;QAC7B,KAAK,+BAAS,IAAI,IAAI,OAAO;QAE7B,KAAK;QACL,KAAK;QAEL,KAAK;QACL,KAAK;QAEL,KAAK;QACL,KAAK;QAEL,KAAK,+BAAS,OAAO,OAAO,OAAO;QACnC,KAAK,+BAAS,OAAO,OAAO,OAAO;IACrC;IAEA,4BAAM,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI;IACrB,4BAAM,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI;IACrB,4BAAM,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI;IACrB,4BAAM,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI;IACrB,4BAAM,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI;IACrB,4BAAM,IAAI,CAAC,CAAC,EAAE,IAAI,IAAI;IACtB,4BAAM,IAAI,CAAC,CAAC,EAAE,IAAI,IAAI;IACtB,4BAAM,IAAI,CAAC,CAAC,EAAE,IAAI,IAAI;AACxB;AAEA,6BAAO,SAAS,CAAC,OAAO,GAAG,SAAS,OAAO,GAAG;IAC5C,IAAI,QAAQ,OACV,OAAO,eAAc,IAAI,CAAC,CAAC,EAAE;SAE7B,OAAO,eAAc,IAAI,CAAC,CAAC,EAAE;AACjC;AAEA,SAAS,8BAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IACjC,IAAI,IAAI,AAAC,KAAK,KAAO,AAAC,CAAC,KAAM;IAC7B,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,8BAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IACrC,IAAI,IAAI,AAAC,KAAK,KAAO,AAAC,CAAC,KAAM;IAC7B,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,+BAAS,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAClC,IAAI,IAAI,AAAC,KAAK,KAAO,KAAK,KAAO,KAAK;IACtC,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,+BAAS,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IACtC,IAAI,IAAI,AAAC,KAAK,KAAO,KAAK,KAAO,KAAK;IACtC,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,gCAAU,EAAE,EAAE,EAAE;IACvB,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,gCAAU,IAAI,IAAI,IAAK,KAAK;IACxC,IAAI,QAAQ,gCAAU,IAAI,IAAI,IAAK,KAAK;IAExC,IAAI,IAAI,QAAQ,QAAQ;IACxB,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,gCAAU,EAAE,EAAE,EAAE;IACvB,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,gCAAU,IAAI,IAAI,IAAK,KAAK;IACxC,IAAI,QAAQ,gCAAU,IAAI,IAAI,IAAK,KAAK;IAExC,IAAI,IAAI,QAAQ,QAAQ;IACxB,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,gCAAU,EAAE,EAAE,EAAE;IACvB,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,gCAAU,IAAI,IAAI,IAAK,KAAK;IAExC,IAAI,IAAI,QAAQ,QAAQ;IACxB,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,gCAAU,EAAE,EAAE,EAAE;IACvB,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,gCAAU,IAAI,IAAI,IAAK,KAAK;IAExC,IAAI,IAAI,QAAQ,QAAQ;IACxB,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,gCAAU,EAAE,EAAE,EAAE;IACvB,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,+BAAS,IAAI,IAAI;IAE7B,IAAI,IAAI,QAAQ,QAAQ;IACxB,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,gCAAU,EAAE,EAAE,EAAE;IACvB,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,+BAAS,IAAI,IAAI;IAE7B,IAAI,IAAI,QAAQ,QAAQ;IACxB,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,gCAAU,EAAE,EAAE,EAAE;IACvB,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,gCAAU,IAAI,IAAI,KAAM,KAAK;IACzC,IAAI,QAAQ,+BAAS,IAAI,IAAI;IAE7B,IAAI,IAAI,QAAQ,QAAQ;IACxB,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;AAEA,SAAS,gCAAU,EAAE,EAAE,EAAE;IACvB,IAAI,QAAQ,gCAAU,IAAI,IAAI;IAC9B,IAAI,QAAQ,gCAAU,IAAI,IAAI,KAAM,KAAK;IACzC,IAAI,QAAQ,+BAAS,IAAI,IAAI;IAE7B,IAAI,IAAI,QAAQ,QAAQ;IACxB,IAAI,IAAI,GACN,KAAK;IACP,OAAO;AACT;;;;;;;;;ACpTA,IAAA;AArBA;;;;;AAKA,IAAI,+BAAS;AACb,IAAI,8BAAQ;AACZ,IAAI,gCAAU;AACd,IAAI,gCAAU;AACd,IAAI,kCAAY;AAEhB,SAAS;IACP,IAAI,CAAE,CAAA,IAAI,YAAY,+BAAQ,GAC5B,OAAO,IAAI;IAEb,gCAAU,IAAI,CAAC,IAAI;IAEnB,IAAI,CAAC,CAAC,GAAG;QAAE;QAAY;QAAY;QAAY;QAAY;KAAY;IACvE,IAAI,CAAC,MAAM,GAAG;AAChB;AACA,gBAAe,iCAAW;AAC1B,4CAAoB;AAEpB,gCAAU,SAAS,GAAG;AACtB,gCAAU,OAAO,GAAG;AACpB,gCAAU,YAAY,GAAG;AACzB,gCAAU,SAAS,GAAG;AAEtB,gCAAU,SAAS,CAAC,OAAO,GAAG,SAAS,OAAO,GAAG,EAAE,KAAK;IACtD,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IACjB,IAAI,KAAK;IACT,IAAI,KAAK;IACT,IAAI,KAAK;IACT,IAAI,KAAK;IACT,IAAI,KAAK;IACT,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IAAK;QAC3B,IAAI,IAAI,4BACN,6BACE,8BAAQ,GAAG,wBAAE,GAAG,GAAG,GAAG,IAAI,GAAG,CAAC,uBAAC,CAAC,EAAE,GAAG,MAAM,EAAE,wBAAE,KAC/C,uBAAC,CAAC,EAAE,GACN;QACF,IAAI;QACJ,IAAI;QACJ,IAAI,6BAAO,GAAG;QACd,IAAI;QACJ,IAAI;QACJ,IAAI,4BACF,6BACE,8BAAQ,IAAI,wBAAE,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,wBAAE,CAAC,EAAE,GAAG,MAAM,EAAE,yBAAG,KAC1D,wBAAE,CAAC,EAAE,GACP;QACF,KAAK;QACL,KAAK;QACL,KAAK,6BAAO,IAAI;QAChB,KAAK;QACL,KAAK;IACP;IACA,IAAI,8BAAQ,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG;IAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,8BAAQ,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG;IAClC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,8BAAQ,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG;IAClC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,8BAAQ,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG;IAClC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,8BAAQ,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG;IAClC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG;AACd;AAEA,gCAAU,SAAS,CAAC,OAAO,GAAG,SAAS,OAAO,GAAG;IAC/C,IAAI,QAAQ,OACV,OAAO,eAAc,IAAI,CAAC,CAAC,EAAE;SAE7B,OAAO,eAAc,IAAI,CAAC,CAAC,EAAE;AACjC;AAEA,SAAS,wBAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACnB,IAAI,KAAK,IACP,OAAO,IAAI,IAAI;SACZ,IAAI,KAAK,IACZ,OAAO,AAAC,IAAI,IAAM,AAAC,CAAC,IAAK;SACtB,IAAI,KAAK,IACZ,OAAO,AAAC,CAAA,IAAK,CAAC,CAAC,IAAK;SACjB,IAAI,KAAK,IACZ,OAAO,AAAC,IAAI,IAAM,IAAK,CAAC;SAExB,OAAO,IAAK,CAAA,IAAK,CAAC,CAAC;AACvB;AAEA,SAAS,wBAAE,CAAC;IACV,IAAI,KAAK,IACP,OAAO;SACJ,IAAI,KAAK,IACZ,OAAO;SACJ,IAAI,KAAK,IACZ,OAAO;SACJ,IAAI,KAAK,IACZ,OAAO;SAEP,OAAO;AACX;AAEA,SAAS,yBAAG,CAAC;IACX,IAAI,KAAK,IACP,OAAO;SACJ,IAAI,KAAK,IACZ,OAAO;SACJ,IAAI,KAAK,IACZ,OAAO;SACJ,IAAI,KAAK,IACZ,OAAO;SAEP,OAAO;AACX;AAEA,IAAI,0BAAI;IACN;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAI;IAAI;IAClD;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IACnD;IAAG;IAAI;IAAI;IAAG;IAAG;IAAI;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAG;IAClD;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IACnD;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAG;IAAI;IAAI;IAAG;IAAG;IAAG;IAAI;IAAG;IAAI;CACnD;AAED,IAAI,2BAAK;IACP;IAAG;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAClD;IAAG;IAAI;IAAG;IAAG;IAAG;IAAI;IAAG;IAAI;IAAI;IAAI;IAAG;IAAI;IAAG;IAAG;IAAG;IACnD;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAClD;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAClD;IAAI;IAAI;IAAI;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IAAG;CACnD;AAED,IAAI,0BAAI;IACN;IAAI;IAAI;IAAI;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAI;IAAG;IAAG;IAAG;IACrD;IAAG;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAI;IAAG;IAAI;IAAG;IAAI;IACpD;IAAI;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAI;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IACrD;IAAI;IAAI;IAAI;IAAI;IAAI;IAAI;IAAG;IAAG;IAAG;IAAI;IAAG;IAAG;IAAG;IAAG;IAAG;IACpD;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAI;IAAG;IAAI;IAAI;IAAI;IAAI;IAAG;IAAG;CACtD;AAED,IAAI,2BAAK;IACP;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAI;IACrD;IAAG;IAAI;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAAG;IAAI;IAAI;IACpD;IAAG;IAAG;IAAI;IAAI;IAAG;IAAG;IAAG;IAAI;IAAI;IAAI;IAAG;IAAI;IAAI;IAAI;IAAG;IACrD;IAAI;IAAG;IAAG;IAAI;IAAI;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IACrD;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAI;IAAG;IAAG;IAAI;IAAI;IAAI;CACrD;;;;;ACjJD;;;;;AAKA,SAAS,2BAAK,IAAI,EAAE,GAAG,EAAE,GAAG;IAC1B,IAAI,CAAE,CAAA,IAAI,YAAY,0BAAG,GACvB,OAAO,IAAI,2BAAK,MAAM,KAAK;IAC7B,IAAI,CAAC,IAAI,GAAG;IACZ,IAAI,CAAC,SAAS,GAAG,KAAK,SAAS,GAAG;IAClC,IAAI,CAAC,OAAO,GAAG,KAAK,OAAO,GAAG;IAC9B,IAAI,CAAC,KAAK,GAAG;IACb,IAAI,CAAC,KAAK,GAAG;IAEb,IAAI,CAAC,KAAK,CAAC,eAAc,KAAK;AAChC;AACA,iBAAiB;AAEjB,2BAAK,SAAS,CAAC,KAAK,GAAG,SAAS,KAAK,GAAG;IACtC,yBAAyB;IACzB,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,EAC7B,MAAM,IAAI,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,MAAM;IAC1C,OAAO,IAAI,MAAM,IAAI,IAAI,CAAC,SAAS;IAEnC,qBAAqB;IACrB,IAAK,IAAI,IAAI,IAAI,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE,IAC3C,IAAI,IAAI,CAAC;IAEX,IAAK,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC1B,GAAG,CAAC,EAAE,IAAI;IACZ,IAAI,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;IAEpC,qBAAqB;IACrB,IAAK,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC1B,GAAG,CAAC,EAAE,IAAI;IACZ,IAAI,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;AACtC;AAEA,2BAAK,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,GAAG,EAAE,GAAG;IAC9C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK;IACvB,OAAO,IAAI;AACb;AAEA,2BAAK,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,GAAG;IACzC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM;IACnC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;AAC3B;;;;;;AC9CA,iBAAiB;IACf,SAAS;QACP,MAAM;QACN,QAAQ;YACN;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;SACF;IACH;IACA,KAAK;QACH,KAAK;QACL,QAAQ;YACN;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;YACD;gBACE;gBACA;aACD;SACF;IACH;AACF;;;;;;AC3wBA;;;;;;;;;;;AAOA,IAAI,+BAAS;;;;;AAKb,SAAS,yBAAG,OAAO;IACjB,IAAI,CAAE,CAAA,IAAI,YAAY,wBAAC,GACrB,OAAO,IAAI,yBAAG;IAEhB,qCAAqC;IACrC,IAAI,OAAO,YAAY,UAAU;QAC/B,6BAAO,OAAO,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,UAClD,mBAAmB;QAErB,UAAU,MAAM,CAAC,QAAQ;IAC3B;IAEA,wDAAwD;IACxD,IAAI,mBAAmB,OAAO,WAAW,EACvC,UAAU;QAAE,OAAO;IAAQ;IAE7B,IAAI,CAAC,KAAK,GAAG,QAAQ,KAAK,CAAC,KAAK;IAChC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IACvB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAErB,iBAAiB;IACjB,IAAI,CAAC,CAAC,GAAG,QAAQ,KAAK,CAAC,CAAC;IACxB,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,SAAS,KAAK;IAEhD,6BAA6B;IAC7B,IAAI,CAAC,IAAI,GAAG,QAAQ,IAAI,IAAI,QAAQ,KAAK,CAAC,IAAI;AAChD;AACA,iBAAiB;AAEjB,yBAAG,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,OAAO;IAC7C,OAAO,IAAI,OAAQ,IAAI,EAAE;AAC3B;AAEA,yBAAG,SAAS,CAAC,cAAc,GAAG,SAAS,eAAe,IAAI,EAAE,GAAG;IAC7D,OAAO,OAAQ,WAAW,CAAC,IAAI,EAAE,MAAM;AACzC;AAEA,yBAAG,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,GAAG,EAAE,GAAG;IAC1D,OAAO,OAAQ,UAAU,CAAC,IAAI,EAAE,KAAK;AACvC;AAEA,yBAAG,SAAS,CAAC,UAAU,GAAG,SAAS,WAAW,OAAO;IACnD,IAAI,CAAC,SACH,UAAU,CAAC;IAEb,wBAAwB;IACxB,IAAI,OAAO,IAAI,OAAS;QACtB,MAAM,IAAI,CAAC,IAAI;QACf,MAAM,QAAQ,IAAI;QAClB,SAAS,QAAQ,OAAO,IAAI;QAC5B,SAAS,QAAQ,OAAO,IAAI,OAAK,IAAI,CAAC,IAAI,CAAC,YAAY;QACvD,YAAY,QAAQ,OAAO,IAAI,QAAQ,UAAU,IAAI;QACrD,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO;IACvB;IAEA,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,UAAU;IAC7B,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,OAAG;IAC5B,OAAS;QACP,IAAI,OAAO,IAAI,OAAG,KAAK,QAAQ,CAAC;QAChC,IAAI,KAAK,GAAG,CAAC,OAAO,GAClB;QAEF,KAAK,KAAK,CAAC;QACX,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B;AACF;AAEA,yBAAG,SAAS,CAAC,YAAY,GAAG,SAAS,aAAa,GAAG,EAAE,SAAS,EAAE,SAAS;IACzE,IAAI;IACJ,IAAI,OAAG,IAAI,CAAC,QAAQ,OAAO,QAAQ,UAAU;QAC3C,MAAM,IAAI,OAAG,KAAK;QAClB,aAAa,IAAI,UAAU;IAC7B,OAAO,IAAI,OAAO,QAAQ,UAAU;QAClC,oDAAoD;QACpD,aAAa,IAAI,MAAM;QACvB,MAAM,IAAI,OAAG,KAAK;IACpB,OAAO;QACL,kCAAkC;QAClC,IAAI,MAAM,IAAI,QAAQ;QACtB,eAAe;QACf,aAAa,AAAC,IAAI,MAAM,GAAG,MAAO;QAClC,MAAM,IAAI,OAAG,KAAK;IACpB;IACA,mBAAmB;IACnB,IAAI,OAAO,cAAc,UACvB,YAAY,aAAa;IAE3B,IAAI,QAAQ,YAAY,IAAI,CAAC,CAAC,CAAC,SAAS;IACxC,IAAI,QAAQ,GACV,MAAM,IAAI,KAAK,CAAC;IAClB,IAAI,CAAC,aAAa,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,GACnC,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;SAErB,OAAO;AACX;AAEA,yBAAG,SAAS,CAAC,IAAI,GAAG,SAAS,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO;IACtD,IAAI,OAAO,QAAQ,UAAU;QAC3B,UAAU;QACV,MAAM;IACR;IACA,IAAI,CAAC,SACH,UAAU,CAAC;IAEb,IAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,YAAY,CAAC,OAAG,IAAI,CAAC,MAAM;QACvE,6BAAO,OAAO,QAAQ,YAAY,OAAO,OAAO,IAAI,MAAM,KAAK,UAC7D;QACF,6BAAO,AAAC,IAAI,MAAM,KAAK,MAAO,IAAI,MAAM,GAAG,8BAA8B;QACzE,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAAK,6BAAO,AAAC,CAAA,GAAG,CAAC,EAAE,GAAG,GAAE,MAAO,GAAG,CAAC,EAAE;IACvE;IAEA,MAAM,IAAI,CAAC,cAAc,CAAC,KAAK;IAC/B,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,OAAO,QAAQ,YAAY;IAExD,oEAAoE;IACpE,6BAAO,CAAC,IAAI,KAAK,IAAI;IAErB,4CAA4C;IAC5C,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,UAAU;IAC7B,IAAI,OAAO,IAAI,UAAU,GAAG,OAAO,CAAC,MAAM;IAE1C,oDAAoD;IACpD,IAAI,QAAQ,IAAI,OAAO,CAAC,MAAM;IAE9B,uCAAuC;IACvC,6BAAO,AAAC,IAAI,OAAG,OAAQ,EAAE,CAAC,MAAM;IAEhC,wBAAwB;IACxB,IAAI,OAAO,IAAI,OAAS;QACtB,MAAM,IAAI,CAAC,IAAI;QACf,SAAS;QACT,OAAO;QACP,MAAM,QAAQ,IAAI;QAClB,SAAS,QAAQ,OAAO,IAAI;IAC9B;IAEA,8BAA8B;IAC9B,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,OAAG;IAE5B,IAAK,IAAI,OAAO,IAAK,OAAQ;QAC3B,IAAI,IAAI,QAAQ,CAAC,GACf,QAAQ,CAAC,CAAC,QACV,IAAI,OAAG,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU;QACxC,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG;QACzB,IAAI,EAAE,IAAI,CAAC,MAAM,KAAK,EAAE,GAAG,CAAC,QAAQ,GAClC;QAEF,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;QACpB,IAAI,GAAG,UAAU,IACf;QAEF,IAAI,MAAM,GAAG,IAAI;QACjB,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,EAAE,IAAI,CAAC,OAAO,GAChB;QAEF,IAAI,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,UAAU,IAAI,IAAI,CAAC;QACxD,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,IAAI,EAAE,IAAI,CAAC,OAAO,GAChB;QAEF,IAAI,gBAAgB,AAAC,CAAA,GAAG,IAAI,GAAG,KAAK,KAAK,IAAI,CAAA,IACxB,CAAA,IAAI,GAAG,CAAC,OAAO,IAAI,IAAI,CAAA;QAE5C,4CAA4C;QAC5C,IAAI,QAAQ,SAAS,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG;YAC3C,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;YACf,iBAAiB;QACnB;QAEA,OAAO,IAAI,OAAU;YAAE,GAAG;YAAG,GAAG;YAAG,eAAe;QAAc;IAClE;AACF;AAEA,yBAAG,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO;IACrE,IAAI,CAAC,SACH,UAAU,CAAC;IAEb,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,OAAO,QAAQ,YAAY;IACxD,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK;IAC9B,YAAY,IAAI,OAAU,WAAW;IAErC,sCAAsC;IACtC,IAAI,IAAI,UAAU,CAAC;IACnB,IAAI,IAAI,UAAU,CAAC;IACnB,IAAI,EAAE,IAAI,CAAC,KAAK,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,GACpC,OAAO;IACT,IAAI,EAAE,IAAI,CAAC,KAAK,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,GACpC,OAAO;IAET,qBAAqB;IACrB,IAAI,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,KAAK,KAAK,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,KAAK,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,IAAI;IAEJ,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE;QAC7B,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,SAAS,IAAI;QACvC,IAAI,EAAE,UAAU,IACd,OAAO;QAET,OAAO,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,OAAO;IAC1C;IAEA,2CAA2C;IAC3C,uBAAuB;IAEvB,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,SAAS,IAAI;IACxC,IAAI,EAAE,UAAU,IACd,OAAO;IAET,4CAA4C;IAC5C,sEAAsE;IACtE,qBAAqB;IACrB,OAAO,EAAE,MAAM,CAAC;AAClB;AAEA,yBAAG,SAAS,CAAC,aAAa,GAAG,SAAS,GAAG,EAAE,SAAS,EAAE,CAAC,EAAE,GAAG;IAC1D,6BAAO,AAAC,CAAA,IAAI,CAAA,MAAO,GAAG;IACtB,YAAY,IAAI,OAAU,WAAW;IAErC,IAAI,IAAI,IAAI,CAAC,CAAC;IACd,IAAI,IAAI,IAAI,OAAG;IACf,IAAI,IAAI,UAAU,CAAC;IACnB,IAAI,IAAI,UAAU,CAAC;IAEnB,mDAAmD;IACnD,IAAI,SAAS,IAAI;IACjB,IAAI,cAAc,KAAK;IACvB,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,aACjD,MAAM,IAAI,MAAM;IAElB,uBAAuB;IACvB,IAAI,aACF,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG;SAE/C,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;IAE/B,IAAI,OAAO,UAAU,CAAC,CAAC,IAAI,CAAC;IAC5B,IAAI,KAAK,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC;IACjC,IAAI,KAAK,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC;IAE1B,oCAAoC;IACpC,oCAAoC;IACpC,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG;AAC9B;AAEA,yBAAG,SAAS,CAAC,mBAAmB,GAAG,SAAS,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,GAAG;IAC9D,YAAY,IAAI,OAAU,WAAW;IACrC,IAAI,UAAU,aAAa,KAAK,MAC9B,OAAO,UAAU,aAAa;IAEhC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;QAC1B,IAAI;QACJ,IAAI;YACF,SAAS,IAAI,CAAC,aAAa,CAAC,GAAG,WAAW;QAC5C,EAAE,OAAO,GAAG;YACV;QACF;QAEA,IAAI,OAAO,EAAE,CAAC,IACZ,OAAO;IACX;IACA,MAAM,IAAI,MAAM;AAClB;;;;ACrRA;;;;;;;AAMA,SAAS,+BAAS,OAAO;IACvB,IAAI,CAAE,CAAA,IAAI,YAAY,8BAAO,GAC3B,OAAO,IAAI,+BAAS;IACtB,IAAI,CAAC,IAAI,GAAG,QAAQ,IAAI;IACxB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,UAAU;IAEtC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO;IAC/B,IAAI,CAAC,UAAU,GAAG,QAAQ,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,YAAY;IAE9D,IAAI,CAAC,OAAO,GAAG;IACf,IAAI,CAAC,cAAc,GAAG;IACtB,IAAI,CAAC,CAAC,GAAG;IACT,IAAI,CAAC,CAAC,GAAG;IAET,IAAI,UAAU,eAAc,QAAQ,OAAO,EAAE,QAAQ,UAAU,IAAI;IACnE,IAAI,QAAQ,eAAc,QAAQ,KAAK,EAAE,QAAQ,QAAQ,IAAI;IAC7D,IAAI,OAAO,eAAc,QAAQ,IAAI,EAAE,QAAQ,OAAO,IAAI;IAC1D,OAAO,QAAQ,MAAM,IAAK,IAAI,CAAC,UAAU,GAAG,GACrC,qCAAqC,IAAI,CAAC,UAAU,GAAG;IAC9D,IAAI,CAAC,KAAK,CAAC,SAAS,OAAO;AAC7B;AACA,iBAAiB;AAEjB,+BAAS,SAAS,CAAC,KAAK,GAAG,SAAS,KAAK,OAAO,EAAE,KAAK,EAAE,IAAI;IAC3D,IAAI,OAAO,QAAQ,MAAM,CAAC,OAAO,MAAM,CAAC;IAExC,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,IAAI,CAAC,MAAM,GAAG;IACjC,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,IAAI,CAAC,MAAM,GAAG;IACjC,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,IAAK;QACtC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG;QACZ,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG;IACd;IAEA,IAAI,CAAC,OAAO,CAAC;IACb,IAAI,CAAC,OAAO,GAAG;IACf,IAAI,CAAC,cAAc,GAAG,iBAAkB,OAAO;AACjD;AAEA,+BAAS,SAAS,CAAC,KAAK,GAAG,SAAS;IAClC,OAAO,IAAI,YAAU,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACxC;AAEA,+BAAS,SAAS,CAAC,OAAO,GAAG,SAAS,OAAO,IAAI;IAC/C,IAAI,OAAO,IAAI,CAAC,KAAK,GACL,MAAM,CAAC,IAAI,CAAC,CAAC,EACb,MAAM,CAAC;QAAE;KAAM;IAC/B,IAAI,MACF,OAAO,KAAK,MAAM,CAAC;IACrB,IAAI,CAAC,CAAC,GAAG,KAAK,MAAM;IACpB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM;IAC3C,IAAI,CAAC,MACH;IAEF,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GACL,MAAM,CAAC,IAAI,CAAC,CAAC,EACb,MAAM,CAAC;QAAE;KAAM,EACf,MAAM,CAAC,MACP,MAAM;IACpB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM;AAC7C;AAEA,+BAAS,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM;IAC1E,uBAAuB;IACvB,IAAI,OAAO,eAAe,UAAU;QAClC,SAAS;QACT,MAAM;QACN,aAAa;IACf;IAEA,UAAU,eAAc,SAAS;IACjC,MAAM,eAAc,KAAK;IAEzB,OAAO,QAAQ,MAAM,IAAK,IAAI,CAAC,UAAU,GAAG,GACrC,qCAAqC,IAAI,CAAC,UAAU,GAAG;IAE9D,IAAI,CAAC,OAAO,CAAC,QAAQ,MAAM,CAAC,OAAO,EAAE;IACrC,IAAI,CAAC,OAAO,GAAG;AACjB;AAEA,+BAAS,SAAS,CAAC,QAAQ,GAAG,SAAS,SAAS,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM;IACnE,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,cAAc,EACpC,MAAM,IAAI,MAAM;IAElB,oBAAoB;IACpB,IAAI,OAAO,QAAQ,UAAU;QAC3B,SAAS;QACT,MAAM;QACN,MAAM;IACR;IAEA,2BAA2B;IAC3B,IAAI,KAAK;QACP,MAAM,eAAc,KAAK,UAAU;QACnC,IAAI,CAAC,OAAO,CAAC;IACf;IAEA,IAAI,OAAO,EAAE;IACb,MAAO,KAAK,MAAM,GAAG,IAAK;QACxB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM;QAC3C,OAAO,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B;IAEA,IAAI,MAAM,KAAK,KAAK,CAAC,GAAG;IACxB,IAAI,CAAC,OAAO,CAAC;IACb,IAAI,CAAC,OAAO;IACZ,OAAO,cAAa,KAAK;AAC3B;;;;;AChHA;;;;;AAIA,IAAI,+BAAS;AAEb,SAAS,8BAAQ,EAAE,EAAE,OAAO;IAC1B,IAAI,CAAC,EAAE,GAAG;IACV,IAAI,CAAC,IAAI,GAAG;IACZ,IAAI,CAAC,GAAG,GAAG;IAEX,uCAAuC;IACvC,IAAI,QAAQ,IAAI,EACd,IAAI,CAAC,cAAc,CAAC,QAAQ,IAAI,EAAE,QAAQ,OAAO;IACnD,IAAI,QAAQ,GAAG,EACb,IAAI,CAAC,aAAa,CAAC,QAAQ,GAAG,EAAE,QAAQ,MAAM;AAClD;AACA,iBAAiB;AAEjB,8BAAQ,UAAU,GAAG,SAAS,WAAW,EAAE,EAAE,GAAG,EAAE,GAAG;IACnD,IAAI,eAAe,+BACjB,OAAO;IAET,OAAO,IAAI,8BAAQ,IAAI;QACrB,KAAK;QACL,QAAQ;IACV;AACF;AAEA,8BAAQ,WAAW,GAAG,SAAS,YAAY,EAAE,EAAE,IAAI,EAAE,GAAG;IACtD,IAAI,gBAAgB,+BAClB,OAAO;IAET,OAAO,IAAI,8BAAQ,IAAI;QACrB,MAAM;QACN,SAAS;IACX;AACF;AAEA,8BAAQ,SAAS,CAAC,QAAQ,GAAG,SAAS;IACpC,IAAI,MAAM,IAAI,CAAC,SAAS;IAExB,IAAI,IAAI,UAAU,IAChB,OAAO;QAAE,QAAQ;QAAO,QAAQ;IAAqB;IACvD,IAAI,CAAC,IAAI,QAAQ,IACf,OAAO;QAAE,QAAQ;QAAO,QAAQ;IAA4B;IAC9D,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,IACtC,OAAO;QAAE,QAAQ;QAAO,QAAQ;IAAsB;IAExD,OAAO;QAAE,QAAQ;QAAM,QAAQ;IAAK;AACtC;AAEA,8BAAQ,SAAS,CAAC,SAAS,GAAG,SAAS,UAAU,OAAO,EAAE,GAAG;IAC3D,+BAA+B;IAC/B,IAAI,OAAO,YAAY,UAAU;QAC/B,MAAM;QACN,UAAU;IACZ;IAEA,IAAI,CAAC,IAAI,CAAC,GAAG,EACX,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI;IAEpC,IAAI,CAAC,KACH,OAAO,IAAI,CAAC,GAAG;IAEjB,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK;AAC9B;AAEA,8BAAQ,SAAS,CAAC,UAAU,GAAG,SAAS,WAAW,GAAG;IACpD,IAAI,QAAQ,OACV,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI;SAE9B,OAAO,IAAI,CAAC,IAAI;AACpB;AAEA,8BAAQ,SAAS,CAAC,cAAc,GAAG,SAAS,eAAe,GAAG,EAAE,GAAG;IACjE,IAAI,CAAC,IAAI,GAAG,IAAI,OAAG,KAAK,OAAO;IAE/B,qEAAqE;IACrE,iCAAiC;IACjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AAC5C;AAEA,8BAAQ,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,GAAG,EAAE,GAAG;IAC/D,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;QAClB,iDAAiD;QACjD,iEAAiE;QACjE,mBAAmB;QACnB,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,QACzB,6BAAO,IAAI,CAAC,EAAE;aACT,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,WACvB,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,WAChC,6BAAO,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;QAEzB,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC;QAC3C;IACF;IACA,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK;AAC5C;AAEA,OAAO;AACP,8BAAQ,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,GAAG;IAC5C,IAAG,CAAC,IAAI,QAAQ,IACd,6BAAO,IAAI,QAAQ,IAAI;IAEzB,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI;AAChC;AAEA,QAAQ;AACR,8BAAQ,SAAS,CAAC,IAAI,GAAG,SAAS,KAAK,GAAG,EAAE,GAAG,EAAE,OAAO;IACtD,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,KAAK;AACtC;AAEA,8BAAQ,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,GAAG,EAAE,SAAS,EAAE,OAAO;IAChE,OAAO,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,WAAW,IAAI,EAAE,WAAW;AACzD;AAEA,8BAAQ,SAAS,CAAC,OAAO,GAAG,SAAS;IACnC,OAAO,gBAAiB,CAAA,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAC,IACtD,WAAY,CAAA,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAC,IAAK;AACvD;;;;;ACxHA;;;;;AAKA,IAAI,+BAAS;AAEb,SAAS,gCAAU,OAAO,EAAE,GAAG;IAC7B,IAAI,mBAAmB,iCACrB,OAAO;IAET,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,MAC3B;IAEF,6BAAO,QAAQ,CAAC,IAAI,QAAQ,CAAC,EAAE;IAC/B,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,QAAQ,CAAC,EAAE;IAC3B,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG,QAAQ,CAAC,EAAE;IAC3B,IAAI,QAAQ,aAAa,KAAK,WAC5B,IAAI,CAAC,aAAa,GAAG;SAErB,IAAI,CAAC,aAAa,GAAG,QAAQ,aAAa;AAC9C;AACA,iBAAiB;AAEjB,SAAS;IACP,IAAI,CAAC,KAAK,GAAG;AACf;AAEA,SAAS,gCAAU,GAAG,EAAE,CAAC;IACvB,IAAI,UAAU,GAAG,CAAC,EAAE,KAAK,GAAG;IAC5B,IAAI,CAAE,CAAA,UAAU,IAAG,GACjB,OAAO;IAET,IAAI,WAAW,UAAU;IAEzB,gCAAgC;IAChC,IAAI,aAAa,KAAK,WAAW,GAC/B,OAAO;IAGT,IAAG,GAAG,CAAC,EAAE,KAAK,CAAC,KAAK,MAClB,OAAO;IAGT,IAAI,MAAM;IACV,IAAK,IAAI,IAAI,GAAG,MAAM,EAAE,KAAK,EAAE,IAAI,UAAU,KAAK,MAAO;QACvD,QAAQ;QACR,OAAO,GAAG,CAAC,IAAI;QACf,SAAS;IACX;IAEA,iBAAiB;IACjB,IAAI,OAAO,MACT,OAAO;IAGT,EAAE,KAAK,GAAG;IACV,OAAO;AACT;AAEA,SAAS,gCAAU,GAAG;IACpB,IAAI,IAAI;IACR,IAAI,MAAM,IAAI,MAAM,GAAG;IACvB,MAAO,CAAC,GAAG,CAAC,EAAE,IAAI,CAAE,CAAA,GAAG,CAAC,IAAI,EAAE,GAAG,IAAG,KAAM,IAAI,IAC5C;IAEF,IAAI,MAAM,GACR,OAAO;IAET,OAAO,IAAI,KAAK,CAAC;AACnB;AAEA,gCAAU,SAAS,CAAC,UAAU,GAAG,SAAS,WAAW,IAAI,EAAE,GAAG;IAC5D,OAAO,eAAc,MAAM;IAC3B,IAAI,IAAI,IAAI;IACZ,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,KAAK,MACtB,OAAO;IAET,IAAI,MAAM,gCAAU,MAAM;IAC1B,IAAI,QAAQ,OACV,OAAO;IAET,IAAI,AAAC,MAAM,EAAE,KAAK,KAAM,KAAK,MAAM,EACjC,OAAO;IAET,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,KAAK,MACtB,OAAO;IAET,IAAI,OAAO,gCAAU,MAAM;IAC3B,IAAI,SAAS,OACX,OAAO;IAET,IAAI,AAAC,CAAA,IAAI,CAAC,EAAE,KAAK,CAAC,GAAG,GAAE,MAAO,GAC5B,OAAO;IAET,IAAI,IAAI,KAAK,KAAK,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK;IAC1C,EAAE,KAAK,IAAI;IACX,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,KAAK,MACtB,OAAO;IAET,IAAI,OAAO,gCAAU,MAAM;IAC3B,IAAI,SAAS,OACX,OAAO;IAET,IAAI,KAAK,MAAM,KAAK,OAAO,EAAE,KAAK,EAChC,OAAO;IAET,IAAI,AAAC,CAAA,IAAI,CAAC,EAAE,KAAK,CAAC,GAAG,GAAE,MAAO,GAC5B,OAAO;IAET,IAAI,IAAI,KAAK,KAAK,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK;IAC1C,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG;QACd,IAAI,CAAC,CAAC,EAAE,GAAG,MACT,IAAI,EAAE,KAAK,CAAC;aAEZ,iBAAiB;QACjB,OAAO;IAEX;IACA,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG;QACd,IAAI,CAAC,CAAC,EAAE,GAAG,MACT,IAAI,EAAE,KAAK,CAAC;aAEZ,iBAAiB;QACjB,OAAO;IAEX;IAEA,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG;IAChB,IAAI,CAAC,CAAC,GAAG,IAAI,OAAG;IAChB,IAAI,CAAC,aAAa,GAAG;IAErB,OAAO;AACT;AAEA,SAAS,sCAAgB,GAAG,EAAE,GAAG;IAC/B,IAAI,MAAM,MAAM;QACd,IAAI,IAAI,CAAC;QACT;IACF;IACA,IAAI,SAAS,IAAK,CAAA,KAAK,GAAG,CAAC,OAAO,KAAK,GAAG,KAAK,CAAA;IAC/C,IAAI,IAAI,CAAC,SAAS;IAClB,MAAO,EAAE,OACP,IAAI,IAAI,CAAC,AAAC,QAAS,CAAA,UAAU,CAAA,IAAM;IAErC,IAAI,IAAI,CAAC;AACX;AAEA,gCAAU,SAAS,CAAC,KAAK,GAAG,SAAS,MAAM,GAAG;IAC5C,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO;IACtB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO;IAEtB,aAAa;IACb,IAAI,CAAC,CAAC,EAAE,GAAG,MACT,IAAI;QAAE;KAAG,CAAC,MAAM,CAAC;IACnB,aAAa;IACb,IAAI,CAAC,CAAC,EAAE,GAAG,MACT,IAAI;QAAE;KAAG,CAAC,MAAM,CAAC;IAEnB,IAAI,gCAAU;IACd,IAAI,gCAAU;IAEd,MAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAE,CAAA,CAAC,CAAC,EAAE,GAAG,IAAG,EAC1B,IAAI,EAAE,KAAK,CAAC;IAEd,IAAI,MAAM;QAAE;KAAM;IAClB,sCAAgB,KAAK,EAAE,MAAM;IAC7B,MAAM,IAAI,MAAM,CAAC;IACjB,IAAI,IAAI,CAAC;IACT,sCAAgB,KAAK,EAAE,MAAM;IAC7B,IAAI,WAAW,IAAI,MAAM,CAAC;IAC1B,IAAI,MAAM;QAAE;KAAM;IAClB,sCAAgB,KAAK,SAAS,MAAM;IACpC,MAAM,IAAI,MAAM,CAAC;IACjB,OAAO,cAAa,KAAK;AAC3B;;;;;;AC/KA;;;;;;;AAKA,IAAI,+BAAS;AACb,IAAI,mCAAa;;;;;AAIjB,SAAS,4BAAM,KAAK;IAClB,6BAAO,UAAU,WAAW;IAE5B,IAAI,CAAE,CAAA,IAAI,YAAY,2BAAI,GACxB,OAAO,IAAI,4BAAM;IAEnB,QAAQ,MAAM,CAAC,MAAM,CAAC,KAAK;IAC3B,IAAI,CAAC,KAAK,GAAG;IACb,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;IAChB,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,KAAK;IAExC,IAAI,CAAC,UAAU,GAAG,MAAM,KAAK,GAAG,WAAW;IAC3C,IAAI,CAAC,cAAc,GAAG,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,SAAS,KAAK;IACtD,IAAI,CAAC,IAAI,GAAG;AACd;AAEA,iBAAiB;AAEjB;;;;AAIA,GACA,4BAAM,SAAS,CAAC,IAAI,GAAG,SAAS,KAAK,OAAO,EAAE,MAAM;IAClD,UAAU,iCAAW;IACrB,IAAI,MAAM,IAAI,CAAC,aAAa,CAAC;IAC7B,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,aAAa,IAAI;IAC1C,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;IACnB,IAAI,WAAW,IAAI,CAAC,WAAW,CAAC;IAChC,IAAI,KAAK,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,QAAQ,IAAI,SAC7C,GAAG,CAAC,IAAI,IAAI;IACf,IAAI,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,OAAO,IAAI,CAAC,aAAa,CAAC;QAAE,GAAG;QAAG,GAAG;QAAG,UAAU;IAAS;AAC7D;AAEA;;;;;AAKA,GACA,4BAAM,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,OAAO,EAAE,GAAG,EAAE,GAAG;IACxD,UAAU,iCAAW;IACrB,MAAM,IAAI,CAAC,aAAa,CAAC;IACzB,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,KAAK,IACjD,OAAO;IAET,IAAI,MAAM,IAAI,CAAC,aAAa,CAAC;IAC7B,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,QAAQ,IAAI,IAAI,QAAQ,IAAI;IACrD,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;IACzB,IAAI,UAAU,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,GAAG,CAAC;IACxC,OAAO,QAAQ,EAAE,CAAC;AACpB;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS;IACjC,IAAI,OAAO,IAAI,CAAC,IAAI;IACpB,IAAK,IAAI,IAAI,GAAG,IAAI,UAAU,MAAM,EAAE,IACpC,KAAK,MAAM,CAAC,SAAS,CAAC,EAAE;IAC1B,OAAO,iBAAgB,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACzD;AAEA,4BAAM,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,GAAG;IACxD,OAAO,kBAAmB,IAAI,EAAE;AAClC;AAEA,4BAAM,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,MAAM;IAC3D,OAAO,kBAAmB,IAAI,EAAE;AAClC;AAEA,4BAAM,SAAS,CAAC,aAAa,GAAG,SAAS,cAAc,GAAG;IACxD,IAAI,eAAe,QACjB,OAAO;IACT,OAAO,IAAI,OAAU,IAAI,EAAE;AAC7B;AAEA;;;;;;;AAOA,GACA,4BAAM,SAAS,CAAC,WAAW,GAAG,SAAS,YAAY,KAAK;IACtD,IAAI,MAAM,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,cAAc;IACxD,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,EAAE,IAAI,MAAM,IAAI,GAAG,KAAK,KAAK,OAAO;IAC9D,OAAO;AACT;AAEA,4BAAM,SAAS,CAAC,WAAW,GAAG,SAAS,YAAY,KAAK;IACtD,QAAQ,kBAAiB;IAEzB,IAAI,SAAS,MAAM,MAAM,GAAG;IAC5B,IAAI,SAAS,MAAM,KAAK,CAAC,GAAG,QAAQ,MAAM,CAAC,KAAK,CAAC,OAAO,GAAG;IAC3D,IAAI,SAAS,AAAC,CAAA,KAAK,CAAC,OAAO,GAAG,IAAG,MAAO;IAExC,IAAI,IAAI,iBAAgB;IACxB,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC;AAEA,4BAAM,SAAS,CAAC,SAAS,GAAG,SAAS,UAAU,GAAG;IAChD,OAAO,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,cAAc;AAC9C;AAEA,4BAAM,SAAS,CAAC,SAAS,GAAG,SAAS,UAAU,KAAK;IAClD,OAAO,iBAAgB;AACzB;AAEA,4BAAM,SAAS,CAAC,OAAO,GAAG,SAAS,QAAQ,GAAG;IAC5C,OAAO,eAAe,IAAI,CAAC,UAAU;AACvC;;;;ACxHA;;;AAGA,IAAI,+BAAS;AACb,IAAI,mCAAa;AACjB,IAAI,uCAAiB;AAErB;;;;;;;;AAQA,GACA,SAAS,8BAAQ,KAAK,EAAE,MAAM;IAC5B,IAAI,CAAC,KAAK,GAAG;IACb,IAAI,CAAC,OAAO,GAAG,iCAAW,OAAO,MAAM;IACvC,IAAI,MAAM,OAAO,CAAC,OAAO,GAAG,GAC1B,IAAI,CAAC,IAAI,GAAG,OAAO,GAAG;SAEtB,IAAI,CAAC,SAAS,GAAG,iCAAW,OAAO,GAAG;AAC1C;AAEA,8BAAQ,UAAU,GAAG,SAAS,WAAW,KAAK,EAAE,GAAG;IACjD,IAAI,eAAe,+BACjB,OAAO;IACT,OAAO,IAAI,8BAAQ,OAAO;QAAE,KAAK;IAAI;AACvC;AAEA,8BAAQ,UAAU,GAAG,SAAS,WAAW,KAAK,EAAE,MAAM;IACpD,IAAI,kBAAkB,+BACpB,OAAO;IACT,OAAO,IAAI,8BAAQ,OAAO;QAAE,QAAQ;IAAO;AAC7C;AAEA,8BAAQ,SAAS,CAAC,MAAM,GAAG,SAAS;IAClC,OAAO,IAAI,CAAC,OAAO;AACrB;AAEA,qCAAe,+BAAS,YAAY,SAAS;IAC3C,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG;AACxC;AAEA,qCAAe,+BAAS,OAAO,SAAS;IACtC,IAAI,IAAI,CAAC,SAAS,EAChB,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS;IAC9C,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI;AACnC;AAEA,qCAAe,+BAAS,aAAa,SAAS;IAC5C,IAAI,QAAQ,IAAI,CAAC,KAAK;IACtB,IAAI,OAAO,IAAI,CAAC,IAAI;IACpB,IAAI,SAAS,MAAM,cAAc,GAAG;IAEpC,IAAI,IAAI,KAAK,KAAK,CAAC,GAAG,MAAM,cAAc;IAC1C,CAAC,CAAC,EAAE,IAAI;IACR,CAAC,CAAC,OAAO,IAAI;IACb,CAAC,CAAC,OAAO,IAAI;IAEb,OAAO;AACT;AAEA,qCAAe,+BAAS,QAAQ,SAAS;IACvC,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS;AAC5C;AAEA,qCAAe,+BAAS,QAAQ,SAAS;IACvC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM;AACvD;AAEA,qCAAe,+BAAS,iBAAiB,SAAS;IAChD,OAAO,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc;AACpD;AAEA,8BAAQ,SAAS,CAAC,IAAI,GAAG,SAAS,KAAK,OAAO;IAC5C,6BAAO,IAAI,CAAC,OAAO,EAAE;IACrB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI;AACtC;AAEA,8BAAQ,SAAS,CAAC,MAAM,GAAG,SAAS,OAAO,OAAO,EAAE,GAAG;IACrD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,KAAK,IAAI;AAC7C;AAEA,8BAAQ,SAAS,CAAC,SAAS,GAAG,SAAS,UAAU,GAAG;IAClD,6BAAO,IAAI,CAAC,OAAO,EAAE;IACrB,OAAO,cAAa,IAAI,CAAC,MAAM,IAAI;AACrC;AAEA,8BAAQ,SAAS,CAAC,SAAS,GAAG,SAAS,UAAU,GAAG;IAClD,OAAO,cAAa,IAAI,CAAC,QAAQ,IAAI;AACvC;AAEA,iBAAiB;;;;;AC9FjB;;;;;AAIA,IAAI,+BAAS;AACb,IAAI,uCAAiB;AACrB,IAAI,mCAAa;AAEjB;;;;;;;AAOA,GACA,SAAS,gCAAU,KAAK,EAAE,GAAG;IAC3B,IAAI,CAAC,KAAK,GAAG;IAEb,IAAI,OAAO,QAAQ,UACjB,MAAM,iCAAW;IAEnB,IAAI,MAAM,OAAO,CAAC,MAAM;QACtB,6BAAO,IAAI,MAAM,KAAK,MAAM,cAAc,GAAG,GAAG;QAChD,MAAM;YACJ,GAAG,IAAI,KAAK,CAAC,GAAG,MAAM,cAAc;YACpC,GAAG,IAAI,KAAK,CAAC,MAAM,cAAc;QACnC;IACF;IAEA,6BAAO,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;IAEvB,IAAI,MAAM,OAAO,CAAC,IAAI,CAAC,GACrB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;IACjB,IAAI,IAAI,CAAC,YAAY,QACnB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;IAEjB,IAAI,CAAC,SAAS,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,IAAI,QAAQ;IAC5D,IAAI,CAAC,SAAS,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,IAAI,QAAQ;AAC9D;AAEA,qCAAe,iCAAW,KAAK,SAAS;IACtC,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ;AAC3C;AAEA,qCAAe,iCAAW,KAAK,SAAS;IACtC,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ;AAC7C;AAEA,qCAAe,iCAAW,YAAY,SAAS;IAC7C,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;AACtC;AAEA,qCAAe,iCAAW,YAAY,SAAS;IAC7C,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;AACpC;AAEA,gCAAU,SAAS,CAAC,OAAO,GAAG,SAAS;IACrC,OAAO,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ;AAC7C;AAEA,gCAAU,SAAS,CAAC,KAAK,GAAG,SAAS;IACnC,OAAO,cAAa,IAAI,CAAC,OAAO,IAAI,OAAO,WAAW;AACxD;AAEA,iBAAiB;;;;;;;;;AEjEjB;AACA,OAAO,cAAc,CAAC,2BAAS,cAAc;IAAE,OAAO;AAAK;AAC3D,0BAAQ,OAAO,GAAG,0BAAQ,MAAM,GAAG,KAAK;AACxC,MAAM,iCAAW;AACjB,MAAM,qCAAe,CAAC;AACtB,IAAK,IAAI,IAAI,GAAG,IAAI,+BAAS,MAAM,EAAE,IAAK;IACtC,MAAM,IAAI,+BAAS,MAAM,CAAC;IAC1B,kCAAY,CAAC,EAAE,GAAG;AACtB;AACA,SAAS,kCAAY,GAAG;IACpB,MAAM,IAAI,OAAO;IACjB,OAAQ,AAAE,CAAA,MAAM,SAAQ,KAAM,IACzB,CAAE,CAAA,AAAC,KAAK,IAAK,CAAA,IAAK,aAClB,CAAE,CAAA,AAAC,KAAK,IAAK,CAAA,IAAK,aAClB,CAAE,CAAA,AAAC,KAAK,IAAK,CAAA,IAAK,aAClB,CAAE,CAAA,AAAC,KAAK,IAAK,CAAA,IAAK,aAClB,CAAE,CAAA,AAAC,KAAK,IAAK,CAAA,IAAK;AAC3B;AACA,SAAS,gCAAU,MAAM;IACrB,IAAI,MAAM;IACV,IAAK,IAAI,IAAI,GAAG,IAAI,OAAO,MAAM,EAAE,EAAE,EAAG;QACpC,MAAM,IAAI,OAAO,UAAU,CAAC;QAC5B,IAAI,IAAI,MAAM,IAAI,KACd,OAAO,qBAAqB,SAAS;QACzC,MAAM,kCAAY,OAAQ,KAAK;IACnC;IACA,MAAM,kCAAY;IAClB,IAAK,IAAI,IAAI,GAAG,IAAI,OAAO,MAAM,EAAE,EAAE,EAAG;QACpC,MAAM,IAAI,OAAO,UAAU,CAAC;QAC5B,MAAM,kCAAY,OAAQ,IAAI;IAClC;IACA,OAAO;AACX;AACA,SAAS,8BAAQ,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG;IACvC,IAAI,QAAQ;IACZ,IAAI,OAAO;IACX,MAAM,OAAO,AAAC,CAAA,KAAK,OAAM,IAAK;IAC9B,MAAM,SAAS,EAAE;IACjB,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,EAAE,EAAE,EAAG;QAClC,QAAQ,AAAC,SAAS,SAAU,IAAI,CAAC,EAAE;QACnC,QAAQ;QACR,MAAO,QAAQ,QAAS;YACpB,QAAQ;YACR,OAAO,IAAI,CAAC,AAAC,SAAS,OAAQ;QAClC;IACJ;IACA,IAAI,KACA;QAAA,IAAI,OAAO,GACP,OAAO,IAAI,CAAC,AAAC,SAAU,UAAU,OAAS;IAC9C,OAEC;QACD,IAAI,QAAQ,QACR,OAAO;QACX,IAAI,AAAC,SAAU,UAAU,OAAS,MAC9B,OAAO;IACf;IACA,OAAO;AACX;AACA,SAAS,8BAAQ,KAAK;IAClB,OAAO,8BAAQ,OAAO,GAAG,GAAG;AAChC;AACA,SAAS,sCAAgB,KAAK;IAC1B,MAAM,MAAM,8BAAQ,OAAO,GAAG,GAAG;IACjC,IAAI,MAAM,OAAO,CAAC,MACd,OAAO;AACf;AACA,SAAS,gCAAU,KAAK;IACpB,MAAM,MAAM,8BAAQ,OAAO,GAAG,GAAG;IACjC,IAAI,MAAM,OAAO,CAAC,MACd,OAAO;IACX,MAAM,IAAI,MAAM;AACpB;AACA,SAAS,6CAAuB,QAAQ;IACpC,IAAI;IACJ,IAAI,aAAa,UACb,iBAAiB;SAGjB,iBAAiB;IAErB,SAAS,OAAO,MAAM,EAAE,KAAK,EAAE,KAAK;QAChC,QAAQ,SAAS;QACjB,IAAI,OAAO,MAAM,GAAG,IAAI,MAAM,MAAM,GAAG,OACnC,MAAM,IAAI,UAAU;QACxB,SAAS,OAAO,WAAW;QAC3B,oBAAoB;QACpB,IAAI,MAAM,gCAAU;QACpB,IAAI,OAAO,QAAQ,UACf,MAAM,IAAI,MAAM;QACpB,IAAI,SAAS,SAAS;QACtB,IAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,EAAE,EAAE,EAAG;YACnC,MAAM,IAAI,KAAK,CAAC,EAAE;YAClB,IAAI,KAAK,MAAM,GACX,MAAM,IAAI,MAAM;YACpB,MAAM,kCAAY,OAAO;YACzB,UAAU,+BAAS,MAAM,CAAC;QAC9B;QACA,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EACrB,MAAM,kCAAY;QAEtB,OAAO;QACP,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EAAG;YACxB,MAAM,IAAI,AAAC,OAAQ,AAAC,CAAA,IAAI,CAAA,IAAK,IAAM;YACnC,UAAU,+BAAS,MAAM,CAAC;QAC9B;QACA,OAAO;IACX;IACA,SAAS,SAAS,GAAG,EAAE,KAAK;QACxB,QAAQ,SAAS;QACjB,IAAI,IAAI,MAAM,GAAG,GACb,OAAO,MAAM;QACjB,IAAI,IAAI,MAAM,GAAG,OACb,OAAO;QACX,yBAAyB;QACzB,MAAM,UAAU,IAAI,WAAW;QAC/B,MAAM,UAAU,IAAI,WAAW;QAC/B,IAAI,QAAQ,WAAW,QAAQ,SAC3B,OAAO,uBAAuB;QAClC,MAAM;QACN,MAAM,QAAQ,IAAI,WAAW,CAAC;QAC9B,IAAI,UAAU,IACV,OAAO,gCAAgC;QAC3C,IAAI,UAAU,GACV,OAAO,wBAAwB;QACnC,MAAM,SAAS,IAAI,KAAK,CAAC,GAAG;QAC5B,MAAM,YAAY,IAAI,KAAK,CAAC,QAAQ;QACpC,IAAI,UAAU,MAAM,GAAG,GACnB,OAAO;QACX,IAAI,MAAM,gCAAU;QACpB,IAAI,OAAO,QAAQ,UACf,OAAO;QACX,MAAM,QAAQ,EAAE;QAChB,IAAK,IAAI,IAAI,GAAG,IAAI,UAAU,MAAM,EAAE,EAAE,EAAG;YACvC,MAAM,IAAI,UAAU,MAAM,CAAC;YAC3B,MAAM,IAAI,kCAAY,CAAC,EAAE;YACzB,IAAI,MAAM,WACN,OAAO,uBAAuB;YAClC,MAAM,kCAAY,OAAO;YACzB,uBAAuB;YACvB,IAAI,IAAI,KAAK,UAAU,MAAM,EACzB;YACJ,MAAM,IAAI,CAAC;QACf;QACA,IAAI,QAAQ,gBACR,OAAO,0BAA0B;QACrC,OAAO;oBAAE;mBAAQ;QAAM;IAC3B;IACA,SAAS,aAAa,GAAG,EAAE,KAAK;QAC5B,MAAM,MAAM,SAAS,KAAK;QAC1B,IAAI,OAAO,QAAQ,UACf,OAAO;IACf;IACA,SAAS,OAAO,GAAG,EAAE,KAAK;QACtB,MAAM,MAAM,SAAS,KAAK;QAC1B,IAAI,OAAO,QAAQ,UACf,OAAO;QACX,MAAM,IAAI,MAAM;IACpB;IACA,OAAO;sBACH;gBACA;gBACA;iBACA;yBACA;mBACA;IACJ;AACJ;AACA,0BAAQ,MAAM,GAAG,6CAAuB;AACxC,0BAAQ,OAAO,GAAG,6CAAuB;;;;;AEzKzC;;;;ACAA;;;AEAA;;;wCAOI;AACJ,SAAS,2BAAM,QAAQ;IACrB,IAAI,SAAS,MAAM,IAAI,KAAO,MAAM,IAAI,UAAU;IAClD,IAAI,WAAW,IAAI,WAAW;IAC9B,IAAK,IAAI,IAAI,GAAG,IAAI,SAAS,MAAM,EAAE,IACnC,QAAQ,CAAC,EAAE,GAAG;IAEhB,IAAK,IAAI,IAAI,GAAG,IAAI,SAAS,MAAM,EAAE,IAAK;QACxC,IAAI,IAAI,SAAS,MAAM,CAAC;QACxB,IAAI,KAAK,EAAE,UAAU,CAAC;QACtB,IAAI,QAAQ,CAAC,GAAG,KAAK,KAAO,MAAM,IAAI,UAAU,IAAI;QACpD,QAAQ,CAAC,GAAG,GAAG;IACjB;IACA,IAAI,OAAO,SAAS,MAAM;IAC1B,IAAI,SAAS,SAAS,MAAM,CAAC;IAC7B,IAAI,SAAS,KAAK,GAAG,CAAC,QAAQ,KAAK,GAAG,CAAC,KAAK,mCAAmC;;IAC/E,IAAI,UAAU,KAAK,GAAG,CAAC,OAAO,KAAK,GAAG,CAAC,MAAM,mCAAmC;;IAChF,SAAS,OAAQ,MAAM;QACrB,IAAI,MAAM,OAAO,CAAC,WAAW,kBAAkB,YAAc,SAAS,kCAAQ,IAAI,CAAC;QACnF,IAAI,CAAC,kCAAQ,QAAQ,CAAC,SAAW,MAAM,IAAI,UAAU;QACrD,IAAI,OAAO,MAAM,KAAK,GAAK,OAAO;QAC9B,+BAA+B;QACnC,IAAI,SAAS;QACb,IAAI,SAAS;QACb,IAAI,SAAS;QACb,IAAI,OAAO,OAAO,MAAM;QACxB,MAAO,WAAW,QAAQ,MAAM,CAAC,OAAO,KAAK,EAAG;YAC9C;YACA;QACF;QACI,6DAA6D;QACjE,IAAI,OAAO,AAAE,CAAA,OAAO,MAAK,IAAK,UAAU,MAAO;QAC/C,IAAI,MAAM,IAAI,WAAW;QACrB,qBAAqB;QACzB,MAAO,WAAW,KAAM;YACtB,IAAI,QAAQ,MAAM,CAAC,OAAO;YACpB,gCAAgC;YACtC,IAAI,IAAI;YACR,IAAK,IAAI,MAAM,OAAO,GAAG,AAAC,CAAA,UAAU,KAAK,IAAI,MAAK,KAAO,QAAQ,IAAK,OAAO,IAAK;gBAChF,SAAS,AAAC,MAAM,GAAG,CAAC,IAAI,KAAM;gBAC9B,GAAG,CAAC,IAAI,GAAG,AAAC,QAAQ,SAAU;gBAC9B,QAAQ,AAAC,QAAQ,SAAU;YAC7B;YACA,IAAI,UAAU,GAAK,MAAM,IAAI,MAAM;YACnC,SAAS;YACT;QACF;QACI,wCAAwC;QAC5C,IAAI,MAAM,OAAO;QACjB,MAAO,QAAQ,QAAQ,GAAG,CAAC,IAAI,KAAK,EAClC;QAEE,sCAAsC;QAC1C,IAAI,MAAM,OAAO,MAAM,CAAC;QACxB,MAAO,MAAM,MAAM,EAAE,IAAO,OAAO,SAAS,MAAM,CAAC,GAAG,CAAC,IAAI;QAC3D,OAAO;IACT;IACA,SAAS,aAAc,MAAM;QAC3B,IAAI,OAAO,WAAW,UAAY,MAAM,IAAI,UAAU;QACtD,IAAI,OAAO,MAAM,KAAK,GAAK,OAAO,kCAAQ,KAAK,CAAC;QAChD,IAAI,MAAM;QACN,+BAA+B;QACnC,IAAI,SAAS;QACb,IAAI,SAAS;QACb,MAAO,MAAM,CAAC,IAAI,KAAK,OAAQ;YAC7B;YACA;QACF;QACI,8DAA8D;QAClE,IAAI,OAAO,AAAG,CAAA,OAAO,MAAM,GAAG,GAAE,IAAK,SAAU,MAAO,EAAE,kCAAkC;;QAC1F,IAAI,OAAO,IAAI,WAAW;QACtB,0BAA0B;QAC9B,MAAO,MAAM,OAAO,MAAM,CAAE;YACpB,8BAA8B;YACpC,IAAI,WAAW,OAAO,UAAU,CAAC;YAC3B,8CAA8C;YACpD,IAAI,WAAW,KAAO;YAChB,mBAAmB;YACzB,IAAI,QAAQ,QAAQ,CAAC,SAAS;YACxB,oBAAoB;YAC1B,IAAI,UAAU,KAAO;YACrB,IAAI,IAAI;YACR,IAAK,IAAI,MAAM,OAAO,GAAG,AAAC,CAAA,UAAU,KAAK,IAAI,MAAK,KAAO,QAAQ,IAAK,OAAO,IAAK;gBAChF,SAAS,AAAC,OAAO,IAAI,CAAC,IAAI,KAAM;gBAChC,IAAI,CAAC,IAAI,GAAG,AAAC,QAAQ,QAAS;gBAC9B,QAAQ,AAAC,QAAQ,QAAS;YAC5B;YACA,IAAI,UAAU,GAAK,MAAM,IAAI,MAAM;YACnC,SAAS;YACT;QACF;QACI,+BAA+B;QACnC,IAAI,MAAM,OAAO;QACjB,MAAO,QAAQ,QAAQ,IAAI,CAAC,IAAI,KAAK,EACnC;QAEF,IAAI,MAAM,kCAAQ,WAAW,CAAC,SAAU,CAAA,OAAO,GAAE;QACjD,IAAI,IAAI,CAAC,MAAM,GAAG;QAClB,IAAI,IAAI;QACR,MAAO,QAAQ,KACb,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM;QAExB,OAAO;IACT;IACA,SAAS,OAAQ,MAAM;QACrB,IAAI,SAAS,aAAa;QAC1B,IAAI,QAAU,OAAO;QACrB,MAAM,IAAI,MAAM,aAAa,OAAO;IACtC;IACA,OAAO;QACL,QAAQ;QACR,cAAc;QACd,QAAQ;IACV;AACF;AACA,4BAAiB;;;ADzHjB,IAAI,iCAAW;AAEf,4BAAiB,0BAAM;;;;;uCDAnB;AAEJ,4BAAiB,SAAU,UAAU;IACnC,mDAAmD;IACnD,SAAS,OAAQ,OAAO;QACtB,IAAI,WAAW,WAAW;QAE1B,OAAO,iCAAc,iCAAO,MAAM,CAAC;YACjC;YACA;SACD,EAAE,QAAQ,MAAM,GAAG;IACtB;IAEA,SAAS,UAAW,MAAM;QACxB,IAAI,UAAU,OAAO,KAAK,CAAC,GAAG;QAC9B,IAAI,WAAW,OAAO,KAAK,CAAC;QAC5B,IAAI,cAAc,WAAW;QAE7B,IAAI,QAAQ,CAAC,EAAE,GAAG,WAAW,CAAC,EAAE,GAC5B,QAAQ,CAAC,EAAE,GAAG,WAAW,CAAC,EAAE,GAC5B,QAAQ,CAAC,EAAE,GAAG,WAAW,CAAC,EAAE,GAC5B,QAAQ,CAAC,EAAE,GAAG,WAAW,CAAC,EAAE,EAAE;QAElC,OAAO;IACT;IAEA,mFAAmF;IACnF,SAAS,aAAc,MAAM;QAC3B,IAAI,SAAS,uCAAoB;QACjC,IAAI,CAAC,QAAQ;QAEb,OAAO,UAAU;IACnB;IAEA,SAAS,OAAQ,MAAM;QACrB,IAAI,SAAS,iCAAc;QAC3B,IAAI,UAAU,UAAU,QAAQ;QAChC,IAAI,CAAC,SAAS,MAAM,IAAI,MAAM;QAC9B,OAAO;IACT;IAEA,OAAO;QACL,QAAQ;QACR,QAAQ;QACR,cAAc;IAChB;AACF;;;AD5CA,yBAAyB;AACzB,SAAS,+BAAU,MAAM;IACvB,IAAI,MAAM,OAAW,UAAU,MAAM,CAAC,QAAQ,MAAM;IACpD,OAAO,OAAW,UAAU,MAAM,CAAC,KAAK,MAAM;AAChD;AAEA,4BAAiB,0BAAc;;;;AIX/B;AACA,IAAI,iCAAW;AAEf,2BAA2B;AAC3B,IAAI,qCAAe,CAAC;AACpB,IAAK,IAAI,0BAAI,GAAG,0BAAI,+BAAS,MAAM,EAAE,0BAAK;IACxC,IAAI,0BAAI,+BAAS,MAAM,CAAC;IAExB,IAAI,kCAAY,CAAC,wBAAE,KAAK,WAAW,MAAM,IAAI,UAAU,0BAAI;IAC3D,kCAAY,CAAC,wBAAE,GAAG;AACpB;AAEA,SAAS,kCAAa,GAAG;IACvB,IAAI,IAAI,OAAO;IACf,OAAO,AAAE,CAAA,MAAM,SAAQ,KAAM,IAC1B,CAAE,CAAA,AAAC,KAAK,IAAK,CAAA,IAAK,aAClB,CAAE,CAAA,AAAC,KAAK,IAAK,CAAA,IAAK,aAClB,CAAE,CAAA,AAAC,KAAK,IAAK,CAAA,IAAK,aAClB,CAAE,CAAA,AAAC,KAAK,IAAK,CAAA,IAAK,aAClB,CAAE,CAAA,AAAC,KAAK,IAAK,CAAA,IAAK;AACvB;AAEA,SAAS,gCAAW,MAAM;IACxB,IAAI,MAAM;IACV,IAAK,IAAI,IAAI,GAAG,IAAI,OAAO,MAAM,EAAE,EAAE,EAAG;QACtC,IAAI,IAAI,OAAO,UAAU,CAAC;QAC1B,IAAI,IAAI,MAAM,IAAI,KAAK,OAAO,qBAAqB,SAAS;QAE5D,MAAM,kCAAY,OAAQ,KAAK;IACjC;IACA,MAAM,kCAAY;IAElB,IAAK,IAAI,GAAG,IAAI,OAAO,MAAM,EAAE,EAAE,EAAG;QAClC,IAAI,IAAI,OAAO,UAAU,CAAC;QAC1B,MAAM,kCAAY,OAAQ,IAAI;IAChC;IACA,OAAO;AACT;AAEA,SAAS,6BAAQ,MAAM,EAAE,KAAK,EAAE,KAAK;IACnC,QAAQ,SAAS;IACjB,IAAI,AAAC,OAAO,MAAM,GAAG,IAAI,MAAM,MAAM,GAAI,OAAO,MAAM,IAAI,UAAU;IAEpE,SAAS,OAAO,WAAW;IAE3B,oBAAoB;IACpB,IAAI,MAAM,gCAAU;IACpB,IAAI,OAAO,QAAQ,UAAU,MAAM,IAAI,MAAM;IAE7C,IAAI,SAAS,SAAS;IACtB,IAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,EAAE,EAAE,EAAG;QACrC,IAAI,IAAI,KAAK,CAAC,EAAE;QAChB,IAAI,AAAC,KAAK,MAAO,GAAG,MAAM,IAAI,MAAM;QAEpC,MAAM,kCAAY,OAAO;QACzB,UAAU,+BAAS,MAAM,CAAC;IAC5B;IAEA,IAAK,IAAI,GAAG,IAAI,GAAG,EAAE,EACnB,MAAM,kCAAY;IAEpB,OAAO;IAEP,IAAK,IAAI,GAAG,IAAI,GAAG,EAAE,EAAG;QACtB,IAAI,IAAI,AAAC,OAAQ,AAAC,CAAA,IAAI,CAAA,IAAK,IAAM;QACjC,UAAU,+BAAS,MAAM,CAAC;IAC5B;IAEA,OAAO;AACT;AAEA,SAAS,+BAAU,GAAG,EAAE,KAAK;IAC3B,QAAQ,SAAS;IACjB,IAAI,IAAI,MAAM,GAAG,GAAG,OAAO,MAAM;IACjC,IAAI,IAAI,MAAM,GAAG,OAAO,OAAO;IAE/B,yBAAyB;IACzB,IAAI,UAAU,IAAI,WAAW;IAC7B,IAAI,UAAU,IAAI,WAAW;IAC7B,IAAI,QAAQ,WAAW,QAAQ,SAAS,OAAO,uBAAuB;IACtE,MAAM;IAEN,IAAI,QAAQ,IAAI,WAAW,CAAC;IAC5B,IAAI,UAAU,IAAI,OAAO,gCAAgC;IACzD,IAAI,UAAU,GAAG,OAAO,wBAAwB;IAEhD,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG;IAC1B,IAAI,YAAY,IAAI,KAAK,CAAC,QAAQ;IAClC,IAAI,UAAU,MAAM,GAAG,GAAG,OAAO;IAEjC,IAAI,MAAM,gCAAU;IACpB,IAAI,OAAO,QAAQ,UAAU,OAAO;IAEpC,IAAI,QAAQ,EAAE;IACd,IAAK,IAAI,IAAI,GAAG,IAAI,UAAU,MAAM,EAAE,EAAE,EAAG;QACzC,IAAI,IAAI,UAAU,MAAM,CAAC;QACzB,IAAI,IAAI,kCAAY,CAAC,EAAE;QACvB,IAAI,MAAM,WAAW,OAAO,uBAAuB;QACnD,MAAM,kCAAY,OAAO;QAEzB,uBAAuB;QACvB,IAAI,IAAI,KAAK,UAAU,MAAM,EAAE;QAC/B,MAAM,IAAI,CAAC;IACb;IAEA,IAAI,QAAQ,GAAG,OAAO,0BAA0B;IAChD,OAAO;QAAE,QAAQ;QAAQ,OAAO;IAAM;AACxC;AAEA,SAAS;IACP,IAAI,MAAM,+BAAS,KAAK,CAAC,MAAM;IAC/B,IAAI,OAAO,QAAQ,UAAU,OAAO;AACtC;AAEA,SAAS,6BAAQ,GAAG;IAClB,IAAI,MAAM,+BAAS,KAAK,CAAC,MAAM;IAC/B,IAAI,OAAO,QAAQ,UAAU,OAAO;IAEpC,MAAM,IAAI,MAAM;AAClB;AAEA,SAAS,8BAAS,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG;IAC1C,IAAI,QAAQ;IACZ,IAAI,OAAO;IACX,IAAI,OAAO,AAAC,CAAA,KAAK,OAAM,IAAK;IAE5B,IAAI,SAAS,EAAE;IACf,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,EAAE,EAAE,EAAG;QACpC,QAAQ,AAAC,SAAS,SAAU,IAAI,CAAC,EAAE;QACnC,QAAQ;QAER,MAAO,QAAQ,QAAS;YACtB,QAAQ;YACR,OAAO,IAAI,CAAC,AAAC,SAAS,OAAQ;QAChC;IACF;IAEA,IAAI,KACF;QAAA,IAAI,OAAO,GACT,OAAO,IAAI,CAAC,AAAC,SAAU,UAAU,OAAS;IAC5C,OACK;QACL,IAAI,QAAQ,QAAQ,OAAO;QAC3B,IAAI,AAAC,SAAU,UAAU,OAAS,MAAM,OAAO;IACjD;IAEA,OAAO;AACT;AAEA,SAAS,oCAAe,KAAK;IAC3B,IAAI,MAAM,8BAAQ,OAAO,GAAG,GAAG;IAC/B,IAAI,MAAM,OAAO,CAAC,MAAM,OAAO;AACjC;AAEA,SAAS,8BAAS,KAAK;IACrB,IAAI,MAAM,8BAAQ,OAAO,GAAG,GAAG;IAC/B,IAAI,MAAM,OAAO,CAAC,MAAM,OAAO;IAE/B,MAAM,IAAI,MAAM;AAClB;AAEA,SAAS,sCAAiB,KAAK;IAC7B,IAAI,MAAM,8BAAQ,OAAO,GAAG,GAAG;IAC/B,IAAI,MAAM,OAAO,CAAC,MAAM,OAAO;AACjC;AAEA,SAAS,gCAAW,KAAK;IACvB,IAAI,MAAM,8BAAQ,OAAO,GAAG,GAAG;IAC/B,IAAI,MAAM,OAAO,CAAC,MAAM,OAAO;IAE/B,MAAM,IAAI,MAAM;AAClB;AAEA,4BAAiB;IACf,cAAc;IACd,QAAQ;IACR,QAAQ;IACR,eAAe;IACf,SAAS;IACT,iBAAiB;IACjB,WAAW;AACb;;;;ACrLA;AACA,4BAAiB,SAAU,CAAC,EAAE,CAAC;IAC9B,IAAI,CAAC,OAAO,QAAQ,CAAC,MAAM,CAAC,OAAO,QAAQ,CAAC,IAC3C,MAAM,IAAI,UAAU;IAGrB,IAAI,MAAM,GACT,OAAO;IAGR,IAAI,OAAO,EAAE,MAAM,KAAK,YACvB,OAAO,EAAE,MAAM,CAAC;IAGjB,IAAI,EAAE,MAAM,KAAK,EAAE,MAAM,EACxB,OAAO;IAGR,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK;QAClC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAChB,OAAO;IAET;IAEA,OAAO;AACR;;;;;;ACzBA;;;AACA,4BAAiB,yBAAiB;;;;ACDlC;;;uCACI;AAEJ,0BAA0B;AAC1B,IAAI,yCAAmB;AAEvB,SAAS,kCAAa,CAAC;IACrB,IAAI,IAAI,KAAK,IAAI,0CAAoB,IAAI,MAAM,GAAG,MAAM,IAAI,WAAW;AACzE;AAEA,SAAS,6BAAQ,MAAM,EAAE,MAAM,EAAE,MAAM;IACrC,kCAAY;IAEZ,IAAI,CAAC,QAAQ,SAAS,iCAAO,WAAW,CAAC,qCAAe;IACxD,IAAI,CAAC,iCAAO,QAAQ,CAAC,SAAS,MAAM,IAAI,UAAU;IAClD,IAAI,CAAC,QAAQ,SAAS;IAEtB,QAAQ;IACR,IAAI,SAAS,MAAM;QACjB,OAAO,UAAU,CAAC,QAAQ;QAC1B,6BAAO,KAAK,GAAG;IAEjB,SAAS;IACT,OAAO,IAAI,UAAU,QAAQ;QAC3B,OAAO,UAAU,CAAC,MAAM;QACxB,OAAO,aAAa,CAAC,QAAQ,SAAS;QACtC,6BAAO,KAAK,GAAG;IAEjB,SAAS;IACT,OAAO,IAAI,UAAU,YAAY;QAC/B,OAAO,UAAU,CAAC,MAAM;QACxB,OAAO,aAAa,CAAC,QAAQ,SAAS;QACtC,6BAAO,KAAK,GAAG;IAEjB,SAAS;IACT,OAAO;QACL,OAAO,UAAU,CAAC,MAAM;QACxB,OAAO,aAAa,CAAC,WAAW,GAAG,SAAS;QAC5C,OAAO,aAAa,CAAC,AAAC,SAAS,cAAe,GAAG,SAAS;QAC1D,6BAAO,KAAK,GAAG;IACjB;IAEA,OAAO;AACT;AAEA,SAAS,6BAAQ,MAAM,EAAE,MAAM;IAC7B,IAAI,CAAC,iCAAO,QAAQ,CAAC,SAAS,MAAM,IAAI,UAAU;IAClD,IAAI,CAAC,QAAQ,SAAS;IAEtB,IAAI,QAAQ,OAAO,SAAS,CAAC;IAE7B,QAAQ;IACR,IAAI,QAAQ,MAAM;QAChB,6BAAO,KAAK,GAAG;QACf,OAAO;IAET,SAAS;IACT,OAAO,IAAI,UAAU,MAAM;QACzB,6BAAO,KAAK,GAAG;QACf,OAAO,OAAO,YAAY,CAAC,SAAS;IAEtC,SAAS;IACT,OAAO,IAAI,UAAU,MAAM;QACzB,6BAAO,KAAK,GAAG;QACf,OAAO,OAAO,YAAY,CAAC,SAAS;IAEtC,SAAS;IACT,OAAO;QACL,6BAAO,KAAK,GAAG;QACf,IAAI,KAAK,OAAO,YAAY,CAAC,SAAS;QACtC,IAAI,KAAK,OAAO,YAAY,CAAC,SAAS;QACtC,IAAI,SAAS,KAAK,eAAe;QACjC,kCAAY;QAEZ,OAAO;IACT;AACF;AAEA,SAAS,qCAAgB,MAAM;IAC7B,kCAAY;IAEZ,OACE,SAAS,OAAO,IACZ,UAAU,SAAS,IACjB,UAAU,aAAa,IACrB;AAEZ;AAEA,4BAAiB;IAAE,QAAQ;IAAQ,QAAQ;IAAQ,gBAAgB;AAAe;;;ARlFlF,MAAM,qCAAe;IACnB,QAAQ;IACR,aAAa;AACf;AAEA,SAAS,6BAAQ,CAAC;IAChB,OAAO,OAAW,UACf,MAAM,CAAC,GACP,MAAM;AACX;AACA,SAAS,8BAAS,MAAM;IACtB,OAAO,6BAAO,6BAAO;AACvB;AACA,SAAS,8BAAS,MAAM;IACtB,OAAO,OAAW,aACf,MAAM,CAAC,6BAAO,SACd,MAAM;AACX;AAEA,SAAS,sCAAiB,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU;IACnE,IAAI,eAAe,WAAW;QAC5B,YAAY;QACZ,IAAI,eAAe,mCAAa,MAAM,EAAE,YAAY;IACtD,OACE,IAAI,YAAY,YAAY;IAE9B,OAAO,OAAO,MAAM,CAAC;QAAC,OAAO,KAAK,CAAC,GAAG,WAAW;QAAK;KAAU;AAClE;AAEA,SAAS,sCAAiB,MAAM;IAC9B,IAAI,OAAO,MAAM,KAAK,IAAI,MAAM,IAAI,MAAM;IAE1C,MAAM,WAAW,OAAO,SAAS,CAAC,KAAK;IACvC,IAAI,WAAW,MAAM,WAAW,GAC9B,MAAM,IAAI,MAAM;IAGlB,OAAO;QACL,YAAY,CAAC,CAAE,CAAA,WAAW,EAAC;QAC3B,YAAY,CAAE,CAAA,WAAW,CAAA,IACrB,OACA,CAAE,CAAA,WAAW,CAAA,IACX,mCAAa,WAAW,GACxB,mCAAa,MAAM;QACzB,UAAU,WAAW;QACrB,WAAW,OAAO,KAAK,CAAC;IAC1B;AACF;AAEA,SAAS,gCAAW,OAAO,EAAE,aAAa;IACxC,gBAAgB,iBAAiB;IACjC,IAAI,CAAC,OAAO,QAAQ,CAAC,gBACnB,gBAAgB,OAAO,IAAI,CAAC,eAAe;IAE7C,IAAI,CAAC,OAAO,QAAQ,CAAC,UACnB,UAAU,OAAO,IAAI,CAAC,SAAS;IAEjC,MAAM,gBAAgB,yCAAuB,QAAQ,MAAM;IAC3D,MAAM,SAAS,OAAO,WAAW,CAC/B,cAAc,MAAM,GAAG,gBAAgB,QAAQ,MAAM;IAEvD,cAAc,IAAI,CAAC,QAAQ;IAC3B,iCAAe,QAAQ,MAAM,EAAE,QAAQ,cAAc,MAAM;IAC3D,QAAQ,IAAI,CAAC,QAAQ,cAAc,MAAM,GAAG;IAC5C,OAAO,8BAAQ;AACjB;AAEA,SAAS,kCACP,gBAAgB,EAChB,UAAU;IAEV,IAAI,OAAO,qBAAqB,YAAY,eAAe,WAAW;QACpE,aAAa;QACb,mBAAmB;IACrB;IACA,IAAI,cAAE,UAAU,gBAAE,YAAY,EAAE,GAAG,cAAc,CAAC;IAClD,IACE,cACC,CAAA,OAAO,eAAe,YAAY,sBAAsB,MAAK,GAE9D,aAAa,WAAW,WAAW;IAErC,IACE,cACA,eAAe,mCAAa,WAAW,IACvC,eAAe,mCAAa,MAAM,EAElC,MAAM,IAAI,MACR,mCACE,mCAAa,WAAW,GACxB,WACA,mCAAa,MAAM,GACnB;IAIN,OAAO;0BACL;oBACA;sBACA;IACF;AACF;AAEA,SAAS,+BAAU,GAAG;IACpB,OAAO,OAAO,OAAO,IAAI,IAAI,KAAK;AACpC;AAEA,SAAS,2BACP,OAAO,EACP,UAAU,EACV,UAAU,EACV,aAAa,EACb,UAAU;IAEV,MAAM,oBACJ,gBAAgB,cAChB,UAAU,gBACV,YAAY,EACb,GAAG,kCAAY,eAAe;IAC/B,MAAM,OAAO,gCAAU,SAAS;IAChC,MAAM,SAAS,+BAAS,cACpB,WAAW,IAAI,CAAC,MAAM,gBACtB,+BAAe,MAAM,YAAY;QAAE,MAAM;IAAa;IAC1D,OAAO,sCACL,OAAO,SAAS,EAChB,OAAO,QAAQ,EACf,YACA;AAEJ;AAEA,SAAS,gCACP,OAAO,EACP,UAAU,EACV,UAAU,EACV,aAAa,EACb,UAAU;IAEV,IAAI,kBAAkB,YAAY;IAClC,OAAO,QAAQ,OAAO,GAAG,IAAI,CAAC;QAC3B,CAAA,oBACC,gBAAgB,cAChB,UAAU,gBACV,YAAY,EACb,GAAG,kCAAY,eAAe,WAAU;QACzC,MAAM,OAAO,gCAAU,SAAS;QAChC,OAAO,+BAAS,cACZ,WAAW,IAAI,CAAC,MAAM,gBACtB,+BAAe,MAAM,YAAY;YAAE,MAAM;QAAa;IAC5D,GAAG,IAAI,CAAC,CAAC;QACP,OAAO,sCACL,OAAO,SAAS,EAChB,OAAO,QAAQ,EACf,YACA;IAEJ;AACF;AAEA,SAAS,uCAAkB,aAAa;IACtC,MAAM,eAAe,OAAO,MAAM,CAAC;QACjC,OAAO,IAAI,CAAC,QAAQ;QACpB;KACD;IACD,OAAO,8BAAQ;AACjB;AAEA,SAAS,mCAAc,OAAO;IAC5B,MAAM,SAAS,iCAAc;IAC7B,MAAM,OAAO,oCAAiB,OAAO,KAAK,CAAC,KAAK,CAAC;IACjD,OAAO,OAAO,IAAI,CAAC;AACrB;AAEA,SAAS,6BAAQ,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,iBAAiB;IAC5E,IAAI,CAAC,OAAO,QAAQ,CAAC,YAAY,YAAY,OAAO,IAAI,CAAC,WAAW;IAEpE,MAAM,SAAS,sCAAgB;IAE/B,IAAI,qBAAqB,CAAC,OAAO,UAAU,EACzC,MAAM,IAAI,MAAM;IAGlB,MAAM,OAAO,gCAAU,SAAS;IAChC,MAAM,YAAY,kCAChB,MACA,OAAO,SAAS,EAChB,OAAO,QAAQ,EACf,OAAO,UAAU;IAEnB,MAAM,gBAAgB,8BAAQ;IAC9B,IAAI,QAAQ;IAEZ,IAAI,OAAO,UAAU;QACnB,IAAI,OAAO,UAAU,KAAK,mCAAa,WAAW,EAAE;YAClD,SAAS,uCAAiB;YAC1B,WAAW,iCAAiB,SAAS,KAAK,CAAC;QAC7C,OAAO;YACL,4CAA4C;YAC5C,iEAAiE;YACjE,qCAAqC;YACrC,SAAS;YACT,WAAW,mCAAa;QAC1B;WACK;QACL,IAAI,mBACF,IAAI;YACF,WAAW,mCAAa;YACxB,sCAAsC;YACtC,OAAO,0BAAa,eAAe;QACrC,EAAE,OAAO,GAAG;YACV,MAAM,aAAa,uCAAiB;YACpC,WAAW,iCAAiB,SAAS,KAAK,CAAC;YAC3C,qCAAqC;YACrC,OACE,0BAAa,eAAe,aAC5B,0BAAa,YAAY;QAE7B;aACK;YACL,SAAS;YACT,WAAW,iCAAiB,SAAS,KAAK,CAAC;QAC7C;IACF;IAEA,OAAO,0BAAa,QAAQ;AAC9B;AAEA,4BAAiB;IACf,WAAW;IACX,MAAM;IACN,WAAW;IACX,QAAQ;AACV;;;AU/OA;;;;;;;;AEAA;;;AEAA;;;CAGG,GACH,oEAAA,GACA,mFAAA,GACM,SAAU,0CAAQ,CAAU;IAChC,OAAO,aAAa,cAAe,YAAY,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,KAAK;AACrF;AAGM,SAAU,0CAAQ,CAAS,EAAE,QAAgB,EAAE;IACnD,IAAI,CAAC,OAAO,aAAa,CAAC,MAAM,IAAI,GAAG;QACrC,MAAM,SAAS,SAAS,CAAA,CAAA,EAAI,MAAK,EAAA,CAAI;QACrC,MAAM,IAAI,MAAM,GAAG,OAAM,2BAAA,EAA8B,GAAG;IAC5D;AACF;AAGM,SAAU,0CAAO,KAAiB,EAAE,MAAe,EAAE,QAAgB,EAAE;IAC3E,MAAM,QAAQ,0CAAQ;IACtB,MAAM,MAAM,OAAO;IACnB,MAAM,WAAW,WAAW;IAC5B,IAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;QAC1C,MAAM,SAAS,SAAS,CAAA,CAAA,EAAI,MAAK,EAAA,CAAI;QACrC,MAAM,QAAQ,WAAW,CAAA,WAAA,EAAc,QAAQ,GAAG;QAClD,MAAM,MAAM,QAAQ,CAAA,OAAA,EAAU,KAAK,GAAG,CAAA,KAAA,EAAQ,OAAO,OAAO;QAC5D,MAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW;IACtE;IACA,OAAO;AACT;AAGM,SAAU,0CAAM,CAAQ;IAC5B,IAAI,OAAO,MAAM,cAAc,OAAO,EAAE,MAAM,KAAK,YACjD,MAAM,IAAI,MAAM;IAClB,0CAAQ,EAAE,SAAS;IACnB,0CAAQ,EAAE,QAAQ;AACpB;AAGM,SAAU,0CAAQ,QAAa,EAAE,gBAAgB,IAAI;IACzD,IAAI,SAAS,SAAS,EAAE,MAAM,IAAI,MAAM;IACxC,IAAI,iBAAiB,SAAS,QAAQ,EAAE,MAAM,IAAI,MAAM;AAC1D;AAGM,SAAU,0CAAQ,GAAQ,EAAE,QAAa;IAC7C,0CAAO,KAAK,WAAW;IACvB,MAAM,MAAM,SAAS,SAAS;IAC9B,IAAI,IAAI,MAAM,GAAG,KACf,MAAM,IAAI,MAAM,sDAAsD;AAE1E;AAQM,SAAU,0CAAG,GAAe;IAChC,OAAO,IAAI,WAAW,IAAI,MAAM,EAAE,IAAI,UAAU,EAAE,IAAI,UAAU;AAClE;AAGM,SAAU,0CAAI,GAAe;IACjC,OAAO,IAAI,YAAY,IAAI,MAAM,EAAE,IAAI,UAAU,EAAE,KAAK,KAAK,CAAC,IAAI,UAAU,GAAG;AACjF;AAGM,SAAU,0CAAM,GAAG,MAAoB;IAC3C,IAAK,IAAI,IAAI,GAAG,IAAI,OAAO,MAAM,EAAE,IACjC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC;AAEnB;AAGM,SAAU,0CAAW,GAAe;IACxC,OAAO,IAAI,SAAS,IAAI,MAAM,EAAE,IAAI,UAAU,EAAE,IAAI,UAAU;AAChE;AAGM,SAAU,0CAAK,IAAY,EAAE,KAAa;IAC9C,OAAO,AAAC,QAAS,KAAK,QAAW,SAAS;AAC5C;AAGM,SAAU,0CAAK,IAAY,EAAE,KAAa;IAC9C,OAAO,AAAC,QAAQ,QAAU,AAAC,SAAU,KAAK,UAAY;AACxD;AAGO,MAAM,4CAAgC,AAAhB,aAAA,GAAiB,CAAA,IAC5C,IAAI,WAAW,IAAI,YAAY;QAAC;KAAW,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,IAAA;AAGxD,SAAU,0CAAS,IAAY;IACnC,OACE,AAAE,QAAQ,KAAM,aACf,AAAC,QAAQ,IAAK,WACd,AAAC,SAAS,IAAK,SACf,AAAC,SAAS,KAAM;AAErB;AAEO,MAAM,4CAAmC,4CAC5C,CAAC,IAAc,IACf,CAAC,IAAc,0CAAS;AAGtB,SAAU,0CAAW,GAAgB;IACzC,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC9B,GAAG,CAAC,EAAE,GAAG,0CAAS,GAAG,CAAC,EAAE;IAE1B,OAAO;AACT;AAEO,MAAM,4CAA8C,4CACvD,CAAC,IAAmB,IACpB;AAEJ,yFAAyF;AACzF,MAAM,sCAAyC,AAAhB,aAAA,GAAiB,CAAA,IAC9C,aAAa;IACb,OAAO,WAAW,IAAI,CAAC,EAAE,EAAE,KAAK,KAAK,cAAc,OAAO,WAAW,OAAO,KAAK,UAAA;AAEnF,wDAAwD;AACxD,MAAM,8BAAQ,aAAA,GAAgB,MAAM,IAAI,CAAC;IAAE,QAAQ;AAAG,GAAI,CAAC,GAAG,IAC5D,EAAE,QAAQ,CAAC,IAAI,QAAQ,CAAC,GAAG;AAOvB,SAAU,0CAAW,KAAiB;IAC1C,0CAAO;IACP,aAAa;IACb,IAAI,qCAAe,OAAO,MAAM,KAAK;IACrC,oCAAoC;IACpC,IAAI,MAAM;IACV,IAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,EAAE,IAChC,OAAO,2BAAK,CAAC,KAAK,CAAC,EAAE,CAAC;IAExB,OAAO;AACT;AAEA,iEAAiE;AACjE,MAAM,+BAAS;IAAE,IAAI;IAAI,IAAI;IAAI,GAAG;IAAI,GAAG;IAAI,GAAG;IAAI,GAAG;AAAG;AAC5D,SAAS,oCAAc,EAAU;IAC/B,IAAI,MAAM,6BAAO,EAAE,IAAI,MAAM,6BAAO,EAAE,EAAE,OAAO,KAAK,6BAAO,EAAE,EAAE,eAAe;IAC9E,IAAI,MAAM,6BAAO,CAAC,IAAI,MAAM,6BAAO,CAAC,EAAE,OAAO,KAAM,CAAA,6BAAO,CAAC,GAAG,EAAA,GAAK,oBAAoB;IACvF,IAAI,MAAM,6BAAO,CAAC,IAAI,MAAM,6BAAO,CAAC,EAAE,OAAO,KAAM,CAAA,6BAAO,CAAC,GAAG,EAAA,GAAK,oBAAoB;IACvF;AACF;AAMM,SAAU,0CAAW,GAAW;IACpC,IAAI,OAAO,QAAQ,UAAU,MAAM,IAAI,MAAM,8BAA8B,OAAO;IAClF,aAAa;IACb,IAAI,qCAAe,OAAO,WAAW,OAAO,CAAC;IAC7C,MAAM,KAAK,IAAI,MAAM;IACrB,MAAM,KAAK,KAAK;IAChB,IAAI,KAAK,GAAG,MAAM,IAAI,MAAM,qDAAqD;IACjF,MAAM,QAAQ,IAAI,WAAW;IAC7B,IAAK,IAAI,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,EAAG;QAC/C,MAAM,KAAK,oCAAc,IAAI,UAAU,CAAC;QACxC,MAAM,KAAK,oCAAc,IAAI,UAAU,CAAC,KAAK;QAC7C,IAAI,OAAO,aAAa,OAAO,WAAW;YACxC,MAAM,OAAO,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE;YAClC,MAAM,IAAI,MAAM,iDAAiD,OAAO,gBAAgB;QAC1F;QACA,KAAK,CAAC,GAAG,GAAG,KAAK,KAAK,IAAI,+DAA+D;IAC3F;IACA,OAAO;AACT;AAOO,MAAM,4CAAW,WAA4B;AAG7C,eAAe,0CACpB,KAAa,EACb,IAAY,EACZ,EAAuB;IAEvB,IAAI,KAAK,KAAK,GAAG;IACjB,IAAK,IAAI,IAAI,GAAG,IAAI,OAAO,IAAK;QAC9B,GAAG;QACH,+FAA+F;QAC/F,MAAM,OAAO,KAAK,GAAG,KAAK;QAC1B,IAAI,QAAQ,KAAK,OAAO,MAAM;QAC9B,MAAM;QACN,MAAM;IACR;AACF;AAUM,SAAU,0CAAY,GAAW;IACrC,IAAI,OAAO,QAAQ,UAAU,MAAM,IAAI,MAAM;IAC7C,OAAO,IAAI,WAAW,IAAI,cAAc,MAAM,CAAC,OAAO,4BAA4B;AACpF;AASM,SAAU,0CAAgB,IAAc,EAAE,aAAa,EAAE;IAC7D,IAAI,OAAO,SAAS,UAAU,OAAO,0CAAY;IACjD,OAAO,0CAAO,MAAM,WAAW;AACjC;AAGM,SAAU,0CAAY,GAAG,MAAoB;IACjD,IAAI,MAAM;IACV,IAAK,IAAI,IAAI,GAAG,IAAI,OAAO,MAAM,EAAE,IAAK;QACtC,MAAM,IAAI,MAAM,CAAC,EAAE;QACnB,0CAAO;QACP,OAAO,EAAE,MAAM;IACjB;IACA,MAAM,MAAM,IAAI,WAAW;IAC3B,IAAK,IAAI,IAAI,GAAG,MAAM,GAAG,IAAI,OAAO,MAAM,EAAE,IAAK;QAC/C,MAAM,IAAI,MAAM,CAAC,EAAE;QACnB,IAAI,GAAG,CAAC,GAAG;QACX,OAAO,EAAE,MAAM;IACjB;IACA,OAAO;AACT;AAIM,SAAU,0CACd,QAAY,EACZ,IAAS;IAET,IAAI,SAAS,aAAa,CAAA,CAAA,CAAA,EAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,mBACnD,MAAM,IAAI,MAAM;IAClB,MAAM,SAAS,OAAO,MAAM,CAAC,UAAU;IACvC,OAAO;AACT;AAwDM,SAAU,0CACd,QAA6B,EAC7B,OAAiB,CAAA,CAAE;IAEnB,MAAM,QAAa,CAAC,KAAiB,OAAgB,SAAS,MAAM,MAAM,CAAC,KAAK,MAAM;IACtF,MAAM,MAAM,SAAS;IACrB,MAAM,SAAS,GAAG,IAAI,SAAS;IAC/B,MAAM,QAAQ,GAAG,IAAI,QAAQ;IAC7B,MAAM,MAAM,GAAG,CAAC,OAAgB,SAAS;IACzC,OAAO,MAAM,CAAC,OAAO;IACrB,OAAO,OAAO,MAAM,CAAC;AACvB;AAGM,SAAU,0CAAY,cAAc,EAAE;IAC1C,MAAM,KAAK,OAAO,eAAe,WAAY,WAAmB,MAAM,GAAG;IACzE,IAAI,OAAO,IAAI,oBAAoB,YACjC,MAAM,IAAI,MAAM;IAClB,OAAO,GAAG,eAAe,CAAC,IAAI,WAAW;AAC3C;AAGO,MAAM,4CAAU,CAAC,SAAwC,CAAA;QAC9D,KAAK,WAAW,IAAI,CAAC;YAAC;YAAM;YAAM;YAAM;YAAM;YAAM;YAAM;YAAM;YAAM;YAAM;YAAM;SAAO;IAC1F,CAAA;;CF9UE,GACH,oEAAA;AAiBA,MAAM,4BAAM,aAAA,GAAgB,OAAO;AACnC,MAAM,4BAAM,aAAA,GAAgB,OAAO;AAS7B,SAAU,0CAAM,KAAc,EAAE,QAAgB,EAAE;IACtD,IAAI,OAAO,UAAU,WAAW;QAC9B,MAAM,SAAS,SAAS,CAAA,CAAA,EAAI,MAAK,EAAA,CAAI;QACrC,MAAM,IAAI,MAAM,SAAS,gCAAgC,OAAO;IAClE;IACA,OAAO;AACT;AAEA,2BAA2B;AAC3B,SAAS,iCAAW,CAAkB;IACpC,IAAI,OAAO,MAAM,UAAU;QACzB,IAAI,CAAC,+BAAS,IAAI,MAAM,IAAI,MAAM,mCAAmC;IACvE,OAAO,CAAA,GAAA,yCAAA,EAAQ;IACf,OAAO;AACT;AAEM,SAAU,0CAAY,KAAa,EAAE,QAAgB,EAAE;IAC3D,IAAI,CAAC,OAAO,aAAa,CAAC,QAAQ;QAChC,MAAM,SAAS,SAAS,CAAA,CAAA,EAAI,MAAK,EAAA,CAAI;QACrC,MAAM,IAAI,MAAM,SAAS,qCAAqC,OAAO;IACvE;AACF;AAEM,SAAU,0CAAoB,GAAoB;IACtD,MAAM,MAAM,iCAAW,KAAK,QAAQ,CAAC;IACrC,OAAO,IAAI,MAAM,GAAG,IAAI,MAAM,MAAM;AACtC;AAEM,SAAU,0CAAY,GAAW;IACrC,IAAI,OAAO,QAAQ,UAAU,MAAM,IAAI,MAAM,8BAA8B,OAAO;IAClF,OAAO,QAAQ,KAAK,4BAAM,OAAO,OAAO,MAAM,aAAa;AAC7D;AAGM,SAAU,yCAAgB,KAAiB;IAC/C,OAAO,0CAAY,CAAA,GAAA,yCAAA,EAAY;AACjC;AACM,SAAU,0CAAgB,KAAiB;IAC/C,OAAO,0CAAY,CAAA,GAAA,yCAAA,EAAY,0CAAU,CAAA,GAAA,yCAAA,EAAQ,QAAQ,OAAO;AAClE;AAEM,SAAU,0CAAgB,CAAkB,EAAE,GAAW;IAC7D,CAAA,GAAA,yCAAA,EAAQ;IACR,IAAI,iCAAW;IACf,MAAM,MAAM,CAAA,GAAA,yCAAA,EAAY,EAAE,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG;IACzD,IAAI,IAAI,MAAM,KAAK,KAAK,MAAM,IAAI,MAAM;IACxC,OAAO;AACT;AACM,SAAU,0CAAgB,CAAkB,EAAE,GAAW;IAC7D,OAAO,0CAAgB,GAAG,KAAK,OAAO;AACxC;AAEM,SAAU,0CAAmB,CAAkB;IACnD,OAAO,CAAA,GAAA,yCAAA,EAAY,0CAAoB,iCAAW;AACpD;AAGM,SAAU,0CAAW,CAAa,EAAE,CAAa;IACrD,IAAI,EAAE,MAAM,KAAK,EAAE,MAAM,EAAE,OAAO;IAClC,IAAI,OAAO;IACX,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;IACtD,OAAO,SAAS;AAClB;AAMM,SAAU,0CAAU,KAAiB;IACzC,OAAO,WAAW,IAAI,CAAC;AACzB;AAOM,SAAU,0CAAa,KAAa;IACxC,OAAO,WAAW,IAAI,CAAC,OAAO,CAAC,GAAG;QAChC,MAAM,WAAW,EAAE,UAAU,CAAC;QAC9B,IAAI,EAAE,MAAM,KAAK,KAAK,WAAW,KAC/B,MAAM,IAAI,MACR,CAAA,qCAAA,EAAwC,KAAK,CAAC,EAAE,CAAA,YAAA,EAAe,SAAQ,aAAA,EAAgB,GAAG;QAG9F,OAAO;IACT;AACF;AAEA,qBAAqB;AACrB,MAAM,iCAAW,CAAC,IAAc,OAAO,MAAM,YAAY,6BAAO;AAE1D,SAAU,0CAAQ,CAAS,EAAE,GAAW,EAAE,GAAW;IACzD,OAAO,+BAAS,MAAM,+BAAS,QAAQ,+BAAS,QAAQ,OAAO,KAAK,IAAI;AAC1E;AAOM,SAAU,0CAAS,KAAa,EAAE,CAAS,EAAE,GAAW,EAAE,GAAW;IACzE,uEAAuE;IACvE,iCAAiC;IACjC,qEAAqE;IACrE,yEAAyE;IACzE,mEAAmE;IACnE,IAAI,CAAC,0CAAQ,GAAG,KAAK,MACnB,MAAM,IAAI,MAAM,oBAAoB,QAAQ,OAAO,MAAM,aAAa,MAAM,WAAW;AAC3F;AASM,SAAU,0CAAO,CAAS;IAC9B,IAAI;IACJ,IAAK,MAAM,GAAG,IAAI,2BAAK,MAAM,2BAAK,OAAO;IACzC,OAAO;AACT;AAOM,SAAU,0CAAO,CAAS,EAAE,GAAW;IAC3C,OAAO,AAAC,KAAK,OAAO,OAAQ;AAC9B;AAKM,SAAU,0CAAO,CAAS,EAAE,GAAW,EAAE,KAAc;IAC3D,OAAO,IAAK,AAAC,CAAA,QAAQ,4BAAM,yBAAA,KAAQ,OAAO;AAC5C;AAMO,MAAM,2CAAU,CAAC,IAAsB,AAAC,CAAA,6BAAO,OAAO,EAAC,IAAK;AAY7D,SAAU,0CACd,OAAe,EACf,QAAgB,EAChB,MAA4D;IAE5D,CAAA,GAAA,yCAAA,EAAQ,SAAS;IACjB,CAAA,GAAA,yCAAA,EAAQ,UAAU;IAClB,IAAI,OAAO,WAAW,YAAY,MAAM,IAAI,MAAM;IAClD,MAAM,MAAM,CAAC,MAA4B,IAAI,WAAW,MAAM,qBAAqB;IACnF,MAAM,OAAO,WAAW,EAAE;IAC1B,MAAM,QAAQ,WAAW,EAAE,CAAC;IAC5B,MAAM,QAAQ,WAAW,EAAE,CAAC;IAC5B,MAAM,gBAAgB;IAEtB,gDAAgD;IAChD,IAAI,IAAI,IAAI,UAAU,qEAAqE;IAC3F,IAAI,IAAI,IAAI,UAAU,qEAAqE;IAC3F,IAAI,IAAI,GAAG,gDAAgD;IAC3D,MAAM,QAAQ;QACZ,EAAE,IAAI,CAAC;QACP,EAAE,IAAI,CAAC;QACP,IAAI;IACN;IACA,MAAM,IAAI,CAAC,GAAG,OAAuB,OAAO,GAAG,CAAA,GAAA,yCAAA,EAAa,MAAM,QAAQ,wBAAwB;IAClG,MAAM,SAAS,CAAC,OAAmB,IAAI;QACrC,yCAAyC;QACzC,IAAI,EAAE,OAAO,OAAO,mCAAmC;QACvD,IAAI,KAAK,mBAAmB;QAC5B,IAAI,KAAK,MAAM,KAAK,GAAG;QACvB,IAAI,EAAE,OAAO,OAAO,mCAAmC;QACvD,IAAI,KAAK,mBAAmB;IAC9B;IACA,MAAM,MAAM;QACV,gCAAgC;QAChC,IAAI,OAAO,eAAe,MAAM,IAAI,MAAM;QAC1C,IAAI,MAAM;QACV,MAAM,MAAoB,EAAE;QAC5B,MAAO,MAAM,SAAU;YACrB,IAAI;YACJ,MAAM,KAAK,EAAE,KAAK;YAClB,IAAI,IAAI,CAAC;YACT,OAAO,EAAE,MAAM;QACjB;QACA,OAAO,CAAA,GAAA,yCAAA,KAAgB;IACzB;IACA,MAAM,WAAW,CAAC,MAAkB;QAClC;QACA,OAAO,OAAO,YAAY;QAC1B,IAAI,MAAqB,WAAW,uCAAuC;QAC3E,MAAO,CAAE,CAAA,MAAM,KAAK,MAAK,EAAI;QAC7B;QACA,OAAO;IACT;IACA,OAAO;AACT;AAEM,SAAU,0CACd,MAA2B,EAC3B,SAAiC,CAAA,CAAE,EACnC,YAAoC,CAAA,CAAE;IAEtC,IAAI,CAAC,UAAU,OAAO,WAAW,UAAU,MAAM,IAAI,MAAM;IAE3D,SAAS,WAAW,SAAe,EAAE,YAAoB,EAAE,KAAc;QACvE,MAAM,MAAM,MAAM,CAAC,UAAU;QAC7B,IAAI,SAAS,QAAQ,WAAW;QAChC,MAAM,UAAU,OAAO;QACvB,IAAI,YAAY,gBAAgB,QAAQ,MACtC,MAAM,IAAI,MAAM,CAAA,OAAA,EAAU,UAAS,uBAAA,EAA0B,aAAY,MAAA,EAAS,SAAS;IAC/F;IACA,MAAM,OAAO,CAAC,GAAkB,QAC9B,OAAO,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,GAAK,WAAW,GAAG,GAAG;IACzD,KAAK,QAAQ;IACb,KAAK,WAAW;AAClB;AAKO,MAAM,4CAAiB;IAC5B,MAAM,IAAI,MAAM;AAClB;AAMM,SAAU,0CACd,EAA6B;IAE7B,MAAM,MAAM,IAAI;IAChB,OAAO,CAAC,KAAQ,GAAG;QACjB,MAAM,MAAM,IAAI,GAAG,CAAC;QACpB,IAAI,QAAQ,WAAW,OAAO;QAC9B,MAAM,WAAW,GAAG,QAAQ;QAC5B,IAAI,GAAG,CAAC,KAAK;QACb,OAAO;IACT;AACF;;CFrRG,GACH,0EAAA;AMTA;;;;;;;;;;AEAA;;;;CAIG,GACH,MAAM,mCAAa,aAAA,GAAgB,OAAO,KAAK,KAAK;AACpD,MAAM,6BAAO,aAAA,GAAgB,OAAO;AAEpC,SAAS,0CACP,CAAS,EACT,KAAK,KAAK;IAKV,IAAI,IAAI,OAAO;QAAE,GAAG,OAAO,IAAI;QAAa,GAAG,OAAO,AAAC,KAAK,6BAAQ;IAAW;IAC/E,OAAO;QAAE,GAAG,OAAO,AAAC,KAAK,6BAAQ,oCAAc;QAAG,GAAG,OAAO,IAAI,oCAAc;IAAC;AACjF;AAEA,SAAS,0CAAM,GAAa,EAAE,KAAK,KAAK;IACtC,MAAM,MAAM,IAAI,MAAM;IACtB,IAAI,KAAK,IAAI,YAAY;IACzB,IAAI,KAAK,IAAI,YAAY;IACzB,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAK;QAC5B,MAAM,KAAE,CAAC,KAAE,CAAC,EAAE,GAAG,0CAAQ,GAAG,CAAC,EAAE,EAAE;QACjC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG;YAAC;YAAG;SAAE;IACzB;IACA,OAAO;QAAC;QAAI;KAAG;AACjB;AAEA,MAAM,2CAAQ,CAAC,GAAW,IAAsB,AAAC,OAAO,MAAM,MAAM,6BAAQ,OAAO,MAAM;AACzF,uBAAuB;AACvB,MAAM,4CAAQ,CAAC,GAAW,IAAY,IAAsB,MAAM;AAClE,MAAM,4CAAQ,CAAC,GAAW,GAAW,IAAsB,AAAC,KAAM,KAAK,IAAO,MAAM;AACpF,oCAAoC;AACpC,MAAM,4CAAS,CAAC,GAAW,GAAW,IAAsB,AAAC,MAAM,IAAM,KAAM,KAAK;AACpF,MAAM,2CAAS,CAAC,GAAW,GAAW,IAAsB,AAAC,KAAM,KAAK,IAAO,MAAM;AACrF,gEAAgE;AAChE,MAAM,4CAAS,CAAC,GAAW,GAAW,IAAsB,AAAC,KAAM,KAAK,IAAO,MAAO,IAAI;AAC1F,MAAM,4CAAS,CAAC,GAAW,GAAW,IAAsB,AAAC,MAAO,IAAI,KAAQ,KAAM,KAAK;AAC3F,+CAA+C;AAC/C,MAAM,4CAAU,CAAC,IAAY,IAAsB;AACnD,MAAM,4CAAU,CAAC,GAAW,KAAuB;AACnD,mCAAmC;AACnC,MAAM,4CAAS,CAAC,GAAW,GAAW,IAAsB,AAAC,KAAK,IAAM,MAAO,KAAK;AACpF,MAAM,2CAAS,CAAC,GAAW,GAAW,IAAsB,AAAC,KAAK,IAAM,MAAO,KAAK;AACpF,+DAA+D;AAC/D,MAAM,4CAAS,CAAC,GAAW,GAAW,IAAsB,AAAC,KAAM,IAAI,KAAQ,MAAO,KAAK;AAC3F,MAAM,4CAAS,CAAC,GAAW,GAAW,IAAsB,AAAC,KAAM,IAAI,KAAQ,MAAO,KAAK;AAE3F,8EAA8E;AAC9E,0EAA0E;AAC1E,SAAS,0CACP,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU;IAKV,MAAM,IAAI,AAAC,CAAA,OAAO,CAAA,IAAM,CAAA,OAAO,CAAA;IAC/B,OAAO;QAAE,GAAG,AAAC,KAAK,KAAM,CAAA,AAAC,IAAI,KAAK,KAAM,CAAA,IAAM;QAAG,GAAG,IAAI;IAAC;AAC3D;AACA,qCAAqC;AACrC,MAAM,2CAAQ,CAAC,IAAY,IAAY,KAAuB,AAAC,CAAA,OAAO,CAAA,IAAM,CAAA,OAAO,CAAA,IAAM,CAAA,OAAO,CAAA;AAChG,MAAM,4CAAQ,CAAC,KAAa,IAAY,IAAY,KAClD,AAAC,KAAK,KAAK,KAAM,CAAA,AAAC,MAAM,KAAK,KAAM,CAAA,IAAM;AAC3C,MAAM,4CAAQ,CAAC,IAAY,IAAY,IAAY,KACjD,AAAC,CAAA,OAAO,CAAA,IAAM,CAAA,OAAO,CAAA,IAAM,CAAA,OAAO,CAAA,IAAM,CAAA,OAAO,CAAA;AACjD,MAAM,4CAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,KAC9D,AAAC,KAAK,KAAK,KAAK,KAAM,CAAA,AAAC,MAAM,KAAK,KAAM,CAAA,IAAM;AAChD,MAAM,4CAAQ,CAAC,IAAY,IAAY,IAAY,IAAY,KAC7D,AAAC,CAAA,OAAO,CAAA,IAAM,CAAA,OAAO,CAAA,IAAM,CAAA,OAAO,CAAA,IAAM,CAAA,OAAO,CAAA,IAAM,CAAA,OAAO,CAAA;AAC9D,MAAM,4CAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,IAAY,KAC1E,AAAC,KAAK,KAAK,KAAK,KAAK,KAAM,CAAA,AAAC,MAAM,KAAK,KAAM,CAAA,IAAM;AAMrD,kBAAkB;AAClB,MAAM,4BAAqpC;aACzpC;WAAS;WAAO;WAChB;WAAO;YACP;YAAQ;YAAQ;YAAQ;aACxB;aAAS;YACT;YAAQ;YAAQ;YAAQ;SACxB;WAAK;WAAO;WAAO;WAAO;WAAO;WAAO;AACzC;IACD,2CAAe;;CFhFZ;;AAeH,0CAA0C;AAC1C,8CAA8C;AAC9C,2CAA2C;AAC3C,MAAM,4BAAM,OAAO;AACnB,MAAM,4BAAM,OAAO;AACnB,MAAM,4BAAM,OAAO;AACnB,MAAM,4BAAM,OAAO;AACnB,MAAM,8BAAQ,OAAO;AACrB,MAAM,+BAAS,OAAO;AACtB,MAAM,gCAAoB,EAAE;AAC5B,MAAM,kCAAsB,EAAE;AAC9B,MAAM,mCAAuB,EAAE,EAAE,yCAAyC;AAC1E,IAAK,IAAI,QAAQ,GAAG,IAAI,2BAAK,IAAI,GAAG,IAAI,GAAG,QAAQ,IAAI,QAAS;IAC9D,KAAK;IACL,CAAC,GAAG,EAAE,GAAG;QAAC;QAAI,CAAA,IAAI,IAAI,IAAI,CAAA,IAAK;KAAE;IACjC,8BAAQ,IAAI,CAAC,IAAK,CAAA,IAAI,IAAI,CAAA;IAC1B,aAAa;IACb,gCAAU,IAAI,CAAC,AAAG,CAAA,QAAQ,CAAA,IAAM,CAAA,QAAQ,CAAA,IAAM,IAAK;IACnD,OAAO;IACP,IAAI,IAAI;IACR,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;QAC1B,IAAI,AAAC,CAAA,AAAC,KAAK,4BAAQ,AAAC,CAAA,KAAK,yBAAA,IAAO,4BAAM,IAAK;QAC3C,IAAI,IAAI,2BAAK,KAAK,6BAAQ,AAAC,CAAA,6BAAO,OAAO,EAAC,IAAK;IACjD;IACA,iCAAW,IAAI,CAAC;AAClB;AACA,MAAM,8BAAQ,CAAA,GAAA,yCAAA,EAAM,kCAAY;AAChC,MAAM,oCAAc,2BAAK,CAAC,EAAE;AAC5B,MAAM,oCAAc,2BAAK,CAAC,EAAE;AAE5B,oCAAoC;AACpC,MAAM,8BAAQ,CAAC,GAAW,GAAW,IAAe,IAAI,KAAK,CAAA,GAAA,yCAAA,EAAO,GAAG,GAAG,KAAK,CAAA,GAAA,yCAAA,EAAO,GAAG,GAAG;AAC5F,MAAM,8BAAQ,CAAC,GAAW,GAAW,IAAe,IAAI,KAAK,CAAA,GAAA,yCAAA,EAAO,GAAG,GAAG,KAAK,CAAA,GAAA,wCAAA,EAAO,GAAG,GAAG;AAGtF,SAAU,0CAAQ,CAAc,EAAE,SAAiB,EAAE;IACzD,MAAM,IAAI,IAAI,YAAY;IAC1B,8FAA8F;IAC9F,IAAK,IAAI,QAAQ,KAAK,QAAQ,QAAQ,IAAI,QAAS;QACjD,UAAU;QACV,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG;QACxF,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,EAAG;YAC9B,MAAM,OAAO,AAAC,CAAA,IAAI,CAAA,IAAK;YACvB,MAAM,OAAO,AAAC,CAAA,IAAI,CAAA,IAAK;YACvB,MAAM,KAAK,CAAC,CAAC,KAAK;YAClB,MAAM,KAAK,CAAC,CAAC,OAAO,EAAE;YACtB,MAAM,KAAK,4BAAM,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK;YACrC,MAAM,KAAK,4BAAM,IAAI,IAAI,KAAK,CAAC,CAAC,OAAO,EAAE;YACzC,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,GAAI;gBAC/B,CAAC,CAAC,IAAI,EAAE,IAAI;gBACZ,CAAC,CAAC,IAAI,IAAI,EAAE,IAAI;YAClB;QACF;QACA,qBAAqB;QACrB,IAAI,OAAO,CAAC,CAAC,EAAE;QACf,IAAI,OAAO,CAAC,CAAC,EAAE;QACf,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IAAK;YAC3B,MAAM,QAAQ,+BAAS,CAAC,EAAE;YAC1B,MAAM,KAAK,4BAAM,MAAM,MAAM;YAC7B,MAAM,KAAK,4BAAM,MAAM,MAAM;YAC7B,MAAM,KAAK,6BAAO,CAAC,EAAE;YACrB,OAAO,CAAC,CAAC,GAAG;YACZ,OAAO,CAAC,CAAC,KAAK,EAAE;YAChB,CAAC,CAAC,GAAG,GAAG;YACR,CAAC,CAAC,KAAK,EAAE,GAAG;QACd;QACA,UAAU;QACV,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,GAAI;YAC/B,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE;YAC5C,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IAAK,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,AAAC,CAAA,IAAI,CAAA,IAAK,GAAG,GAAG,CAAC,CAAC,AAAC,CAAA,IAAI,CAAA,IAAK,GAAG;QAC7E;QACA,WAAW;QACX,CAAC,CAAC,EAAE,IAAI,iCAAW,CAAC,MAAM;QAC1B,CAAC,CAAC,EAAE,IAAI,iCAAW,CAAC,MAAM;IAC5B;IACA,CAAA,GAAA,yCAAA,EAAM;AACR;AAGM,MAAO;IACD,MAAkB;IAClB,MAAM,EAAE;IACR,SAAS,EAAE;IACX,WAAW,MAAM;IACjB,QAAqB;IACrB,YAAY,MAAM;IAErB,SAAiB;IACjB,OAAe;IACf,UAAkB;IACf,YAAY,MAAM;IAClB,OAAe;IAEzB,2DAA2D;IAC3D,YACE,QAAgB,EAChB,MAAc,EACd,SAAiB,EACjB,YAAY,KAAK,EACjB,SAAiB,EAAE,CALrB;QAOE,IAAI,CAAC,QAAQ,GAAG;QAChB,IAAI,CAAC,MAAM,GAAG;QACd,IAAI,CAAC,SAAS,GAAG;QACjB,IAAI,CAAC,SAAS,GAAG;QACjB,IAAI,CAAC,MAAM,GAAG;QACd,mCAAmC;QACnC,CAAA,GAAA,yCAAA,EAAQ,WAAW;QACnB,uDAAuD;QACvD,qBAAqB;QACrB,IAAI,CAAE,CAAA,IAAI,YAAY,WAAW,GAAA,GAC/B,MAAM,IAAI,MAAM;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,WAAW;QAC5B,IAAI,CAAC,OAAO,GAAG,CAAA,GAAA,yCAAA,EAAI,IAAI,CAAC,KAAK;IAC/B;IACA,QAAA;QACE,OAAO,IAAI,CAAC,UAAU;IACxB;IACU,SAAA;QACR,CAAA,GAAA,yCAAA,EAAW,IAAI,CAAC,OAAO;QACvB,0CAAQ,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM;QACjC,CAAA,GAAA,yCAAA,EAAW,IAAI,CAAC,OAAO;QACvB,IAAI,CAAC,MAAM,GAAG;QACd,IAAI,CAAC,GAAG,GAAG;IACb;IACA,OAAO,IAAgB,EAAvB;QACE,CAAA,GAAA,yCAAA,EAAQ,IAAI;QACZ,CAAA,GAAA,yCAAA,EAAO;QACP,MAAM,YAAE,QAAQ,SAAE,KAAK,EAAE,GAAG,IAAI;QAChC,MAAM,MAAM,KAAK,MAAM;QACvB,IAAK,IAAI,MAAM,GAAG,MAAM,KAAO;YAC7B,MAAM,OAAO,KAAK,GAAG,CAAC,WAAW,IAAI,CAAC,GAAG,EAAE,MAAM;YACjD,IAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAK,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,MAAM;YAC/D,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,IAAI,CAAC,MAAM;QACxC;QACA,OAAO,IAAI;IACb;IACU,SAAA;QACR,IAAI,IAAI,CAAC,QAAQ,EAAE;QACnB,IAAI,CAAC,QAAQ,GAAG;QAChB,MAAM,SAAE,KAAK,UAAE,MAAM,OAAE,GAAG,YAAE,QAAQ,EAAE,GAAG,IAAI;QAC7C,iBAAiB;QACjB,KAAK,CAAC,IAAI,IAAI;QACd,IAAI,AAAC,CAAA,SAAS,IAAA,MAAU,KAAK,QAAQ,WAAW,GAAG,IAAI,CAAC,MAAM;QAC9D,KAAK,CAAC,WAAW,EAAE,IAAI;QACvB,IAAI,CAAC,MAAM;IACb;IACU,UAAU,GAAe,EAAzB;QACR,CAAA,GAAA,yCAAA,EAAQ,IAAI,EAAE;QACd,CAAA,GAAA,yCAAA,EAAO;QACP,IAAI,CAAC,MAAM;QACX,MAAM,YAAY,IAAI,CAAC,KAAK;QAC5B,MAAM,YAAE,QAAQ,EAAE,GAAG,IAAI;QACzB,IAAK,IAAI,MAAM,GAAG,MAAM,IAAI,MAAM,EAAE,MAAM,KAAO;YAC/C,IAAI,IAAI,CAAC,MAAM,IAAI,UAAU,IAAI,CAAC,MAAM;YACxC,MAAM,OAAO,KAAK,GAAG,CAAC,WAAW,IAAI,CAAC,MAAM,EAAE,MAAM;YACpD,IAAI,GAAG,CAAC,UAAU,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,OAAO;YAC7D,IAAI,CAAC,MAAM,IAAI;YACf,OAAO;QACT;QACA,OAAO;IACT;IACA,QAAQ,GAAe,EAAvB;QACE,kFAAkF;QAClF,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,IAAI,MAAM;QACrC,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB;IACA,IAAI,KAAa,EAAjB;QACE,CAAA,GAAA,yCAAA,EAAQ;QACR,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,WAAW;IACrC;IACA,WAAW,GAAe,EAA1B;QACE,CAAA,GAAA,yCAAA,EAAQ,KAAK,IAAI;QACjB,IAAI,IAAI,CAAC,QAAQ,EAAE,MAAM,IAAI,MAAM;QACnC,IAAI,CAAC,SAAS,CAAC;QACf,IAAI,CAAC,OAAO;QACZ,OAAO;IACT;IACA,SAAA;QACE,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,WAAW,IAAI,CAAC,SAAS;IACtD;IACA,UAAA;QACE,IAAI,CAAC,SAAS,GAAG;QACjB,CAAA,GAAA,yCAAA,EAAM,IAAI,CAAC,KAAK;IAClB;IACA,WAAW,EAAW,EAAtB;QACE,MAAM,YAAE,QAAQ,UAAE,MAAM,aAAE,SAAS,UAAE,MAAM,aAAE,SAAS,EAAE,GAAG,IAAI;QAC/D,OAAO,IAAI,0CAAO,UAAU,QAAQ,WAAW,WAAW;QAC1D,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO;QAC3B,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG;QACjB,GAAG,MAAM,GAAG,IAAI,CAAC,MAAM;QACvB,GAAG,QAAQ,GAAG,IAAI,CAAC,QAAQ;QAC3B,GAAG,MAAM,GAAG;QACZ,8BAA8B;QAC9B,GAAG,MAAM,GAAG;QACZ,GAAG,SAAS,GAAG;QACf,GAAG,SAAS,GAAG;QACf,GAAG,SAAS,GAAG,IAAI,CAAC,SAAS;QAC7B,OAAO;IACT;AACD;AAED,MAAM,kCAAY,CAAC,QAAgB,UAAkB,WAAmB,OAAiB,CAAA,CAAE,GACzF,CAAA,GAAA,yCAAA,EAAa,IAAM,IAAI,0CAAO,UAAU,QAAQ,YAAY;AAGvD,MAAM,4CAAkB,aAAA,GAAgB,gCAC7C,MACA,KACA,IACA,aAAA,GAAgB,CAAA,GAAA,yCAAA,EAAQ;AAGnB,MAAM,4CAAkB,aAAA,GAAgB,gCAC7C,MACA,KACA,IACA,aAAA,GAAgB,CAAA,GAAA,yCAAA,EAAQ;AAGnB,MAAM,4CAAkB,aAAA,GAAgB,gCAC7C,MACA,KACA,IACA,aAAA,GAAgB,CAAA,GAAA,yCAAA,EAAQ;AAGnB,MAAM,4CAAkB,aAAA,GAAgB,gCAC7C,MACA,IACA,IACA,aAAA,GAAgB,CAAA,GAAA,yCAAA,EAAQ;AAInB,MAAM,4CAAoB,aAAA,GAAgB,gCAAU,MAAM,KAAK;AAE/D,MAAM,4CAAoB,aAAA,GAAgB,gCAAU,MAAM,KAAK;AAE/D,MAAM,4CAAoB,aAAA,GAAgB,gCAAU,MAAM,KAAK;AAE/D,MAAM,4CAAoB,aAAA,GAAgB,gCAAU,MAAM,IAAI;AAKrE,MAAM,iCAAW,CAAC,QAAgB,UAAkB,WAAmB,OAAiB,CAAA,CAAE,GACxF,CAAA,GAAA,yCAAA,EACE,CAAC,OAAkB,CAAA,CAAE,GACnB,IAAI,0CAAO,UAAU,QAAQ,KAAK,KAAK,KAAK,YAAY,YAAY,KAAK,KAAK,EAAE,OAClF;AAIG,MAAM,4CACX,aAAA,GACA,+BAAS,MAAM,KAAK,IAAI,aAAA,GAAgB,CAAA,GAAA,yCAAA,EAAQ;AAE3C,MAAM,4CACX,aAAA,GACA,+BAAS,MAAM,KAAK,IAAI,aAAA,GAAgB,CAAA,GAAA,yCAAA,EAAQ;AAG3C,MAAM,4CACX,aAAA,GACA,+BAAS,MAAM,KAAK,IAAI,aAAA,GAAgB,CAAA,GAAA,yCAAA,EAAQ;AAE3C,MAAM,4CACX,aAAA,GACA,+BAAS,MAAM,KAAK,IAAI,aAAA,GAAgB,CAAA,GAAA,yCAAA,EAAQ;;;AItSlD;;;AEcA,SAAS,+BAAS,CAAS;IACzB,gBAAgB;IAChB,IAAI,CAAC,OAAO,aAAa,CAAC,MAAM,IAAI,KAAK,IAAI,YAC3C,MAAM,IAAI,MAAM,uBAAuB;IACzC,OAAO;AACT;AAGM,SAAU,0CAAa,CAAS;IACpC,+BAAS;IACT,OAAO,AAAC,CAAA,IAAK,IAAI,CAAC,MAAO,KAAK,MAAM;AACtC;AAEM,SAAU,0CAAe,CAAS;IACtC,+BAAS;IACT,IAAI,KAAK,GAAG,OAAO;IACnB,OAAO,AAAC,KAAM,0CAAK,IAAI,KAAK,MAAQ;AACtC;AAEM,SAAU,0CAAY,CAAS,EAAE,IAAY;IACjD,+BAAS;IACT,IAAI,WAAW;IACf,IAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK,OAAO,EAAG,WAAW,AAAC,YAAY,IAAM,IAAI;IAC3E,OAAO;AACT;AAGM,SAAU,0CAAK,CAAS;IAC5B,+BAAS;IACT,OAAO,KAAK,KAAK,KAAK,CAAC;AACzB;AAOM,SAAU,0CAAoD,MAAS;IAC3E,MAAM,IAAI,OAAO,MAAM;IACvB,IAAI,IAAI,KAAK,CAAC,0CAAa,IACzB,MAAM,IAAI,MAAM,oDAAoD;IACtE,MAAM,OAAO,0CAAK;IAClB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;QAC1B,MAAM,IAAI,0CAAY,GAAG;QACzB,IAAI,IAAI,GAAG;YACT,MAAM,MAAM,MAAM,CAAC,EAAE;YACrB,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE;YACrB,MAAM,CAAC,EAAE,GAAG;QACd;IACF;IACA,OAAO;AACT;AAEM,SAAU,0CAA0B,MAAW;IACnD,OAAO,0CAAmB,OAAO,KAAK;AACxC;AAEA,MAAM,4BAAM,cAAA,GAAiB,OAAO;AACpC,SAAS,oCAAc,KAAqB;IAC1C,IAAI,IAAI,OAAO;IACf,MAAO,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,KAAK,IAAI,4BAAM,MAAM,GAAG,GAAG;IAC/D,OAAO;AACT;AAWM,SAAU,0CAAa,KAAqB,EAAE,SAAkB;IACpE,mDAAmD;IACnD,IAAI,YAAY,MAAM,KAAK,GAAG;IAC9B,IAAI,aAAa;IACjB,MAAO,AAAC,CAAA,YAAY,yBAAA,MAAS,2BAAK,cAAc,cAAc;IAE9D,6BAA6B;IAC7B,IAAI,IAAI,cAAc,YAAY,OAAO,aAAa,oCAAc;IACpE,sBAAsB;IACtB,MAAM,SAAmB,IAAI,MAAM,aAAa;IAChD,MAAM,CAAC,WAAW,GAAG,MAAM,GAAG,CAAC,GAAG;IAClC,IAAK,IAAI,IAAI,YAAY,IAAI,GAAG,IAAK,MAAM,CAAC,IAAI,EAAE,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,EAAE;IACxE,uDAAuD;IACvD,MAAM,aAAyB,EAAE;IACjC,MAAM,YAAY,CAAC;QACjB,+BAAS;QACT,IAAI,OAAO,MAAM,OAAO,YACtB,MAAM,IAAI,MAAM,8BAA8B,OAAO,iBAAiB;QACxE,OAAO;IACT;IACA,MAAM,kBAAkB,CAAC;QACvB,UAAU;QACV,IAAK,IAAI,QAAQ,UAAU,SAAS,GAAG,QAAS;YAC9C,IAAI,UAAU,CAAC,MAAM,EAAE,UAAU,sDAAsD;YACvF,MAAM,eAAyB,EAAE;YACjC,IAAK,IAAI,IAAI,GAAG,MAAM,MAAM,GAAG,EAAE,IAAI,KAAK,OAAO,KAAK,MAAM,MAAM,GAAG,CAAC,KAAK,MAAM,CAAC,MAAM,EACtF,aAAa,IAAI,CAAC;YACpB,UAAU,CAAC,MAAM,GAAG;QACtB;QACA,OAAO,UAAU,CAAC,SAAS;IAC7B;IACA,MAAM,WAAW,IAAI;IACrB,MAAM,eAAe,IAAI;IAEzB,+DAA+D;IAC/D,kDAAkD;IAClD,OAAO;QACL,MAAM;eAAE;wBAAG;uBAAY;QAAS;QAChC,OAAO,CAAC;YACN,MAAM,IAAI,UAAU;YACpB,OAAO,gBAAgB;QACzB;QACA,KAAI,IAAY;YACd,MAAM,IAAI,UAAU;YACpB,IAAI,SAAS,GAAG,CAAC,IAAI,OAAO,SAAS,GAAG,CAAC;iBACpC;gBACH,MAAM,MAAM,0CAAuB,IAAI,CAAC,KAAK,CAAC;gBAC9C,SAAS,GAAG,CAAC,GAAG;gBAChB,OAAO;YACT;QACF;QACA,SAAQ,IAAY;YAClB,MAAM,IAAI,UAAU;YACpB,IAAI,aAAa,GAAG,CAAC,IAAI,OAAO,aAAa,GAAG,CAAC;iBAC5C;gBACH,MAAM,MAAM,MAAM,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;gBACzC,aAAa,GAAG,CAAC,GAAG;gBACpB,OAAO;YACT;QACF;QACA,OAAO,CAAC,OAAyB,MAAM,CAAC,UAAU,MAAM;QACxD,OAAO;YACL,WAAW,MAAM,CAAC,GAAG,WAAW,MAAM;YACtC,SAAS,KAAK;QAChB;IACD;AACH;AA4CO,MAAM,4CAAU,CAAO,GAAkB;IAC9C,MAAM,KAAE,CAAC,SAAE,KAAK,OAAE,GAAG,qBAAE,oBAAoB,mBAAO,aAAa,QAAG,MAAM,MAAM,GAAG;IACjF,MAAM,OAAO,0CAAK;IAClB,IAAI,CAAC,0CAAa,IAAI,MAAM,IAAI,MAAM;IACtC,MAAM,QAAQ,QAAQ;IACtB;IACA,OAAO,CAA0B;QAC/B,IAAI,OAAO,MAAM,KAAK,GAAG,MAAM,IAAI,MAAM;QACzC,IAAI,OAAO,KAAK,0CAAmB;QACnC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,OAAO,YAAY,IAAK;YACjD,4CAA4C;YAC5C,MAAM,IAAI,MAAM,IAAI,IAAI,aAAa,OAAO;YAC5C,MAAM,IAAI,KAAK;YACf,MAAM,KAAK,KAAK;YAChB,MAAM,SAAS,KAAK;YACpB,sCAAsC;YACtC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,EAC1B,+CAA+C;YAC/C,IAAK,IAAI,IAAI,GAAG,MAAM,KAAK,IAAI,IAAI,IAAK;gBACtC,MAAM,UAAU,oBAAqB,MAAM,IAAI,MAAM,MAAO,IAAI;gBAChE,MAAM,KAAK,IAAI;gBACf,MAAM,KAAK,IAAI,IAAI;gBACnB,MAAM,QAAQ,KAAK,CAAC,QAAQ;gBAC5B,MAAM,IAAI,MAAM,CAAC,GAAG;gBACpB,MAAM,IAAI,MAAM,CAAC,GAAG;gBACpB,mDAAmD;gBACnD,IAAI,OAAO;oBACT,MAAM,IAAI,EAAE,GAAG,CAAC,GAAG,QAAQ,yBAAyB;oBACpD,MAAM,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG;oBACtB,MAAM,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG;gBACxB,OAAO,IAAI,mBAAmB;oBAC5B,MAAM,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,iDAAiD;oBAC3E,MAAM,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI;gBAClC,OAAO;oBACL,MAAM,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,yBAAyB;oBACnD,MAAM,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI;gBAClC;YACF;QAEJ;QACA,IAAI,CAAC,OAAO,KAAK,0CAAmB;QACpC,OAAO;IACT;AACF;AAWM,SAAU,yCAAO,KAAmB,EAAE,IAAwB;IAClE,MAAM,UAAU,CACd,GACA,OACA,WAAW,KAAK,EAChB,YAAY,KAAK;QAEjB,IAAI,YAAY,WACd,2DAA2D;QAC3D,OAAO,CAAC,SACN,0CAAQ,MAAM;mBAAE;uBAAG;gBAAO,KAAK;gBAAO,KAAK;YAAK,GAAI,0CAAmB;QAE3E,IAAI,UAAU,OAAO,0CAAQ,MAAM;eAAE;mBAAG;YAAO,KAAK;YAAM,KAAK;QAAK;QACpE,IAAI,WAAW,OAAO,0CAAQ,MAAM;eAAE;mBAAG;YAAO,KAAK;YAAO,KAAK;QAAK;QACtE,OAAO,0CAAQ,MAAM;eAAE;mBAAG;YAAO,KAAK;YAAM,KAAK;QAAI,IAAK,cAAc;IAC1E;IACA,OAAO;QACL,QAAgC,MAAS,EAAE,WAAW,KAAK,EAAE,YAAY,KAAK;YAC5E,MAAM,IAAI,OAAO,MAAM;YACvB,IAAI,CAAC,0CAAa,IAAI,MAAM,IAAI,MAAM;YACtC,MAAM,OAAO,0CAAK;YAClB,OAAO,QAAQ,GAAG,MAAM,KAAK,CAAC,OAAO,UAAU,WAAc,OAAO,KAAK;QAC3E;QACA,SAAiC,MAAS,EAAE,WAAW,KAAK,EAAE,YAAY,KAAK;YAC7E,MAAM,IAAI,OAAO,MAAM;YACvB,MAAM,OAAO,0CAAK;YAClB,MAAM,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,OAAO,UAAU,WAAW,OAAO,KAAK;YAC7E,MAAM,MAAM,KAAK,GAAG,CAAC,OAAO,OAAO,MAAM,IAAI,QAAQ;YACrD,sDAAsD;YACtD,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAAK,GAAG,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;YAC/D,2DAA2D;YAC3D,kDAAkD;YAClD,qFAAqF;YACrF,OAAO;QACT;IACD;AACH;AA0DM,SAAU,0CACd,KAAgB,EAChB,KAAmB,EACnB,MAA2B,EAC3B,GAAmB,EACnB,MAAe;IAEf,MAAM,IAAI;IACV,MAAM,UACJ,UACE,CAAA,CAAC,KAAa,MAA2B,IAAI,MAAM,KAAK,IAAI,CAAC,OAAO,EAAE,IAAI,CAAA;IAK9E,MAAM,SAAS,CAAC,IAAmB,MAAM,OAAO,CAAC,MAAM,YAAY,MAAM,CAAC;IAC1E,MAAM,cAAc,CAAC,GAAG;QACtB,IAAI,CAAC,IAAI,MAAM,EAAE,OAAO;QACxB,KAAK,MAAM,KAAK,IAAK,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,2BAA2B;QAChF,MAAM,IAAI,GAAG,CAAC,EAAE,CAAC,MAAM;QACvB,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAC9B,IAAI,GAAG,CAAC,EAAE,CAAC,MAAM,KAAK,GAAG,MAAM,IAAI,MAAM,CAAA,yBAAA,EAA4B,EAAC,IAAA,EAAO,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE;QAC9F,IAAI,WAAW,aAAa,MAAM,QAChC,MAAM,IAAI,MAAM,CAAA,4BAAA,EAA+B,OAAM,MAAA,EAAS,GAAG;QACnE,OAAO;IACT;IACA,SAAS,eAAe,CAAI,EAAE,CAAS,EAAE,MAAM,KAAK;QAClD,MAAM,OAAO,0CAAK;QAClB,MAAM,QAAQ,MAAM,MAAM,GAAG,CAAC,QAAQ,MAAM,KAAK,CAAC;QAClD,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK,IAAI,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,EAAO,GAAG,OAAO;QAChE,OAAO;IACT;IACA,0CAA0C;IAC1C,OAAO;eACL;QACA,QAAQ;gBACR;QACA,QAAQ,CAAC,GAAM;YACb,YAAY;YACZ,MAAM,MAAM,QAAQ,KAAK,EAAE,IAAI;YAC/B,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;YAChD,OAAO;QACT;QACA,QAAQ,CAAC;YACP,YAAY;YACZ,IAAK,IAAI,IAAI,EAAE,MAAM,GAAG,GAAG,KAAK,GAAG,IAAK,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO;YACjE,OAAO;QACT;QACA,KAAK,CAAC,GAAM;YACV,MAAM,MAAM,YAAY,GAAG;YAC3B,MAAM,MAAM,QAAQ;YACpB,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE;YACvD,OAAO;QACT;QACA,KAAK,CAAC,GAAM;YACV,MAAM,MAAM,YAAY,GAAG;YAC3B,MAAM,MAAM,QAAQ;YACpB,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE;YACvD,OAAO;QACT;QACA,KAAK,CAAC,GAAM;YACV,MAAM,MAAM,YAAY,GAAG;YAC3B,MAAM,MAAM,QAAQ;YACpB,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE;YACvD,OAAO;QACT;QACA,KAAK,CAAC,GAAM;YACV,IAAI,OAAO,IAAI;gBACb,MAAM,MAAM,YAAY,GAAG;gBAC3B,IAAI,KAAK;oBACP,MAAM,IAAI,IAAI,MAAM,CAAC,GAAG,OAAO;oBAC/B,MAAM,IAAI,IAAI,MAAM,CAAC,GAAG,OAAO;oBAC/B,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE;oBAC1D,OAAO,IAAI,OAAO,CAAC,GAAG,MAAM;gBAC9B,OAAO;oBACL,+DAA+D;oBAC/D,MAAM,MAAM,QAAQ;oBACpB,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACvB,IAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAK;wBAC5B,MAAM,IAAI,AAAC,CAAA,IAAI,CAAA,IAAK,KAAK,kBAAkB;wBAC3C,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE;oBACzC;oBAEF,OAAO;gBACT;YACF,OAAO;gBACL,MAAM,MAAM,QAAQ,YAAY;gBAChC,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,EAAE,IAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC1D,OAAO;YACT;QACF;QACA,UAAS,CAAI,EAAE,CAAI;YACjB,MAAM,MAAM,0CAAe,EAAE,MAAM,GAAG,EAAE,MAAM,GAAG;YACjD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG;QACtD;QACA,OAAM,CAAI,EAAE,MAAc;YACxB,MAAM,MAAM,QAAQ,YAAY;YAChC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;YACb,IAAK,IAAI,IAAI,GAAG,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAK;gBAChD,QAAQ,EAAE,GAAG,CAAC,OAAO;gBACrB,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACvB;YACA,OAAO;QACT;QACA,OAAO,CAAC;YACN,YAAY;YACZ,MAAM,MAAM,QAAQ,EAAE,MAAM;YAC5B,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;YAChD,OAAO;QACT;QACA,MAAM,CAAC,GAAM;YACX,YAAY;YACZ,IAAI,MAAM,EAAE,IAAI;YAChB,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,MAAM,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE;YACxE,OAAO;QACT;QACA,UAAU;YACR,OAAO,CAAC,GAAM;gBACZ,MAAM,MAAM,QAAQ;gBACpB,IAAI,MAAM,EAAE,GAAG;gBACf,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;oBAC1B,GAAG,CAAC,EAAE,GAAG;oBACT,MAAM,EAAE,GAAG,CAAC,KAAK;gBACnB;gBACA,OAAO;YACT;YACA,MAAM,CAAC,GAAM;gBACX,YAAY;gBACZ,yEAAyE;gBACzE,IAAI,MAAM,EAAE,IAAI;gBAChB,IAAK,IAAI,IAAI,EAAE,MAAM,GAAG,GAAG,KAAK,GAAG,IAAK,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE;gBACvE,OAAO;YACT;QACD;QACD,UAAU;YACR,OAAO,CAAC,GAAM,GAAW,MAAM,KAAK,EAAE;gBACpC,MAAM,OAAO,0CAAK;gBAClB,MAAM,QAAQ,WAAW,MAAM,MAAM,GAAG,CAAC,QAAQ,MAAM,KAAK,CAAC,OAAO,sBAAsB;gBAC1F,MAAM,MAAM,QAAQ;gBACpB,4BAA4B;gBAC5B,MAAM,MAAM,eAAe,GAAG,GAAG;gBACjC,IAAI,QAAQ,IAAI;oBACd,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG;oBAChB,OAAO;gBACT;gBACA,MAAM,KAAK,EAAE,GAAG,CAAC,GAAG,OAAO;gBAC3B,MAAM,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC,OAAO,MAAW,iBAAiB;gBAC3E,MAAM,QAAQ,QAAQ;gBACtB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK,KAAK,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,EAAO;gBAC7D,MAAM,MAAM,EAAE,WAAW,CAAC;gBAC1B,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,EAAO,EAAE,GAAG,CAAC,EAAE;gBACzE,OAAO;YACT;YACA,MAAK,CAAI,EAAE,CAAI,EAAE,MAAM,KAAK;gBAC1B,YAAY;gBACZ,MAAM,MAAM,eAAe,GAAG,EAAE,MAAM,EAAE;gBACxC,IAAI,QAAQ,IAAI,OAAO,CAAC,CAAC,IAAI,EAAE,YAAY;gBAC3C,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,QAAQ;gBAChD,IAAI,MAAM,EAAE,IAAI;gBAChB,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE;gBACtF,OAAO;YACT;QACD;QACD,WAAU,KAAQ;YAChB,YAAY;YACZ,MAAM,MAAM,QAAQ,MAAM,MAAM,GAAG,GAAG,EAAE,IAAI;YAC5C,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG;YACd,KAAK,MAAM,KAAK,MAAO;gBACrB,MAAM,MAAM,EAAE,GAAG,CAAC;gBAClB,IAAK,IAAI,IAAI,IAAI,MAAM,GAAG,GAAG,IAAI,GAAG,IAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,IAAI,EAAE;gBACtF,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;YACzB;YACA,OAAO;QACT;IACD;AACH;;CFrgBG,GACH,0EAAA;;AIJA;;;CAGG,GACH,0EAAA;AAUA;;;;;;;;;;;CAWG,GACH,MAAM,4CAA2B,CAAA,GAAA,yCAAA;AAEjC;;;;;;;;;CASG,GACH,MAAM,4CAAqC,CAAA,GAAA,yCAAA;AAapC,MAAM,4CAA4B,CAAA,GAAA,yCAAA;AAcnC,SAAU,0CAAW,CAAa,EAAE,CAAa;IACrD,IAAI,EAAE,MAAM,KAAK,EAAE,MAAM,EAAE,OAAO;IAClC,IAAI,OAAO;IACX,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;IACtD,OAAO,SAAS;AAClB;AAcM,SAAU,0CAAU,KAAiB;IACzC,OAAO,WAAW,IAAI,CAAC;AACzB;AASM,SAAU,0CAAsC,GAAM;IAC1D,MAAM,QAAQ,IAAI,WAAW,IAAI,MAAM,EAAE,IAAI,UAAU,EAAE,IAAI,UAAU;IACvE,IAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,EAAE,KAAK,EAAG;QACxC,MAAM,KAAK,KAAK,CAAC,IAAI,EAAE;QACvB,MAAM,KAAK,KAAK,CAAC,IAAI,EAAE;QACvB,MAAM,KAAK,KAAK,CAAC,IAAI,EAAE;QACvB,MAAM,KAAK,KAAK,CAAC,IAAI,EAAE;QACvB,KAAK,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE;QAC3B,KAAK,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE;QAC3B,KAAK,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE;QAC3B,KAAK,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE;QAC3B,KAAK,CAAC,IAAI,EAAE,GAAG;QACf,KAAK,CAAC,IAAI,EAAE,GAAG;QACf,KAAK,CAAC,IAAI,EAAE,GAAG;QACf,KAAK,CAAC,IAAI,EAAE,GAAG;IACjB;IACA,OAAO;AACT;AACO,MAAM,4CAAuD,CAAA,GAAA,yCAAA,IAChE,CAAC,MAAQ,MACT;AA4CE,SAAU,0CAAa,IAAY;IACvC,2FAA2F;IAC3F,IAAI,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,mBAC3C,MAAM,IAAI,UAAU;AACxB;AAcM,SAAU,0CAAgB,IAAa;IAC3C,0CAAa;IACb,IAAI,KAAK,OAAO,KAAK,WAAW,CAAA,GAAA,yCAAA,EAAO,KAAK,OAAO,EAAE,WAAW;AAClE;AAcM,SAAU,0CAAgB,IAAa;IAC3C,0CAAgB;IAChB,IAAI,KAAK,YAAY,KAAK,SAAS,KAAK,YAAY,KAAK,WACvD,CAAA,GAAA,yCAAA,EAAO,KAAK,YAAY,EAAE,WAAW;AACzC;AA6GM,SAAU,0CACd,KAAa,EACb,GAAG,OAAU;IAEb,MAAM,YAAY,CAAC,IAAoC,OAAO,MAAM,WAAW,IAAI,EAAE,QAAQ;IAC7F,MAAM,WAAmB,QAAQ,MAAM,CAAC,CAAC,KAAa,IAAM,MAAM,UAAU,IAAI;IAChF,OAAO;kBACL;QACA,QAAQ,CAAC;YACP,MAAM,MAAM,IAAI,WAAW;YAC3B,IAAK,IAAI,IAAI,GAAG,MAAM,GAAG,IAAI,QAAQ,MAAM,EAAE,IAAK;gBAChD,MAAM,IAAI,OAAO,CAAC,EAAE;gBACpB,MAAM,IAAI,UAAU;gBACpB,MAAM,IAAgB,OAAO,MAAM,WAAY,IAAI,CAAC,EAAU,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE;gBACjF,CAAA,GAAA,yCAAA,EAAQ,GAAG,GAAG;gBACd,IAAI,GAAG,CAAC,GAAG;gBACX,IAAI,OAAO,MAAM,UAAU,EAAE,IAAI,CAAC,IAAI,QAAQ;gBAC9C,OAAO;YACT;YACA,OAAO;QACT;QACA,QAAQ,CAAC;YACP,CAAA,GAAA,yCAAA,EAAQ,KAAK,UAAU;YACvB,MAAM,MAAM,EAAE;YACd,KAAK,MAAM,KAAK,QAAS;gBACvB,MAAM,IAAI,UAAU;gBACpB,MAAM,IAAI,IAAI,QAAQ,CAAC,GAAG;gBAC1B,IAAI,IAAI,CAAC,OAAO,MAAM,WAAW,IAAI,EAAE,MAAM,CAAC;gBAC9C,MAAM,IAAI,QAAQ,CAAC;YACrB;YACA,OAAO;QACT;IACM;AACV;AAqBM,SAAU,0CAAY,CAAmB,EAAE,MAAc;IAC7D,MAAM,WAAW,SAAS,EAAE,QAAQ;IACpC,OAAO;kBACL;QACA,QAAQ,CAAC;YACP,IAAI,EAAE,MAAM,KAAK,QACf,MAAM,IAAI,WAAW,CAAA,8BAAA,EAAiC,EAAE,MAAM,CAAA,YAAA,EAAe,QAAQ;YACvF,MAAM,MAAM,IAAI,WAAW;YAC3B,IAAK,IAAI,IAAI,GAAG,MAAM,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK;gBAC1C,MAAM,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;gBACvB,IAAI,GAAG,CAAC,GAAG;gBACX,EAAE,IAAI,CAAC,IAAI,QAAQ;gBACnB,OAAO,EAAE,MAAM;YACjB;YACA,OAAO;QACT;QACA,QAAQ,CAAC;YACP,CAAA,GAAA,yCAAA,EAAQ,GAAG;YACX,MAAM,IAAS,EAAE;YACjB,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,CAC3C,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,EAAE,QAAQ,CAAC,GAAG,IAAI,EAAE,QAAQ;YAC9C,OAAO;QACT;IACD;AACH;AAaM,SAAU,0CAAW,GAAG,IAAmC;IAC/D,KAAK,MAAM,KAAK,KAAM;QACpB,IAAI,MAAM,OAAO,CAAC,IAAI,KAAK,MAAM,KAAK,EAAG,EAAE,IAAI,CAAC;aAC3C,EAAE,IAAI,CAAC;IACd;AACF;AAYM,SAAU,0CAAQ,IAAY;IAClC,IAAI,CAAC,OAAO,aAAa,CAAC,SAAS,OAAO,KAAK,OAAO,IACpD,MAAM,IAAI,WAAW,CAAA,8BAAA,EAAiC,MAAM;IAC9D,wEAAwE;IACxE,OAAO,SAAS,KAAK,aAAa,CAAE,CAAA,MAAM,IAAA,MAAU;AACtD;AAGO,MAAM,4CAAoB,aAAA,GAAgB,WAAW,EAAE;AAexD,SAAU,yCAAW,GAAe,EAAE,MAAkB,yCAAK;IACjE,CAAA,GAAA,yCAAA,EAAQ;IACR,CAAA,GAAA,yCAAA,EAAQ;IACR,IAAI,IAAI,MAAM,GAAG,KAAK,MAAM,IAAI,WAAW;IAC3C,OAAO,CAAA,GAAA,yCAAA,EAAY,IAAI,WAAW;QAAC;QAAG,IAAI,MAAM;KAAC,GAAG,KAAK;AAC3D;AAEA,sFAAsF;AACtF,4FAA4F;AAC5F,6DAA6D;AAC7D,gCAAgC;AAChC,MAAM,iCAAW,aAAA,GAAgB,WAAW,IAAI,CAAC;IAAC;IAAG;IAAG;IAAM;IAAM;IAAM;IAAG;IAAM;IAAG;IAAG;CAAE;AAmBrF,SAAU,0CAAU,IAAW,EAAE,mBAA2B,CAAC;IACjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,0CAAW,KAAK,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK,iCACrD,MAAM,IAAI,MAAM;IAClB,6FAA6F;IAC7F,+FAA+F;IAC/F,+DAA+D;IAC/D,MAAM,sBAAsB,AAAC,KAAK,SAAS,GAAG,IAAK;IACnD,IAAI,mBAAmB,qBACrB,MAAM,IAAI,MACR,yCACE,sBACA,iBACA;AAGR;AAoBM,SAAU,0CACd,IAAW,EACX,GAAe,EACf,MAAkB,yCAAK;IAEvB,CAAA,GAAA,yCAAA,EAAQ;IACR,CAAA,GAAA,yCAAA,EAAQ;IACR,IAAI,IAAI,MAAM,GAAG,KAAK,MAAM,IAAI,WAAW;IAC3C,MAAM,SAAS,KAAK;IACpB,OAAO,CAAA,GAAA,yCAAA,EAAY,IAAI,WAAW;QAAC;QAAG,IAAI,MAAM;KAAC,GAAG,KAAK,KAAK,GAAI,EAAE;AACtE;;;AJ/aO,MAAM,4CAAc,CACzB;IAaA,mDAAmD;IACnD,MAAM,WAAE,OAAO,KAAE,CAAC,KAAE,CAAC,KAAE,CAAC,iBAAE,aAAa,WAAE,OAAO,WAAE,OAAO,EAAE,GAAG;IAC9D,qFAAqF;IACrF,oEAAoE;IACpE,MAAM,MAAM,CAAC,GAAW,SAAS,CAAC;QAChC,MAAM,SAAS,IAAI,SAAS;QAC5B,OAAO,AAAC,CAAA,UAAU,IAAI,SAAS,IAAI,AAAC,SAAS,SAAU,CAAA,IAAK;IAC9D;IACA,mFAAmF;IACnF,2CAA2C;IAC3C,uDAAuD;IACvD,MAAM,OAAO,CAAC,GAAW,SAAS,CAAC;QACjC,MAAM,IAAI,IAAI,GAAG,UAAU;QAC3B,OAAO,AAAC,CAAA,IAAI,UAAU,IAAI,AAAC,IAAI,SAAU,IAAI,CAAA,IAAK;IACpD;IACA,4FAA4F;IAC5F,6FAA6F;IAC7F,SAAS;QACP,MAAM,MAAM,QAAQ;QACpB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;YAC1B,MAAM,IAAI,CAAA,GAAA,yCAAA,EAAY,GAAG;YACzB,MAAM,IAAI,OAAO,kBAAkB,OAAO,KAAK,OAAO;YACtD,GAAG,CAAC,EAAE,GAAG,OAAO,KAAK;QACvB;QACA,OAAO;IACT;IACA,MAAM,WAAW;IAEjB,6BAA6B;IAC7B,+CAA+C;IAE/C,8FAA8F;IAC9F,8EAA8E;IAE9E,MAAM,QAAQ;QACZ,KAAK,CAAC,GAAW,IAAc,IAAI,AAAC,CAAA,IAAI,CAAA,IAAM,CAAA,IAAI,CAAA,KAAM;QACxD,KAAK,CAAC,GAAW,IAAc,IAAI,AAAC,CAAA,IAAI,CAAA,IAAM,CAAA,IAAI,CAAA,KAAM;QACxD,KAAK,CAAC,GAAW,IAAc,IAAI,AAAC,CAAA,IAAI,CAAA,IAAM,CAAA,IAAI,CAAA,KAAM;QACxD,KAAK,CAAC;YACJ,MAAM,IAAI,MAAM;QAClB;IACD;IACD,MAAM,UAAU;WACd;QACA,OAAO;QACP,mBAAmB;QACnB,YAAY,UAAU,IAAI;QAC1B,KAAK;IACN;IACD,MAAM,MAAM,CAAA,GAAA,yCAAA,EAAQ,OAAO;QAAE,KAAK;QAAO,GAAG,OAAO;IAAA;IACnD,MAAM,MAAM,CAAA,GAAA,yCAAA,EAAQ,OAAO;QAAE,KAAK;QAAM,GAAG,OAAO;IAAA;IAClD,MAAM,MAAM;QACV,QAAQ,CAAC;YACP,OAAO,IAAI;QACb;QACA,QAAQ,CAAC;YACP,IAAI;YACJ,yFAAyF;YACzF,6FAA6F;YAC7F,4CAA4C;YAC5C,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,CAAC,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,EAAE;YACtD,OAAO;QACT;IACD;IACD,sFAAsF;IACtF,4EAA4E;IAC5E,MAAM,YAAY,CAAC,GAAW;QAC5B,MAAM,OAAO,CAAA,GAAA,yCAAA,EAAQ;QACrB,MAAM,WAAW,IAAK,CAAA,IAAI,CAAA;QAC1B,OAAO;sBACL;YACA,QAAQ,CAAC;gBACP,MAAM,IAAI,IAAI,WAAW;gBACzB,IAAK,IAAI,IAAI,GAAG,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,IAAI,KAAK,MAAM,EAAE,IAAK;oBAClE,OAAO,AAAC,CAAA,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,IAAA,KAAS;oBACrC,UAAU;oBACV,MAAO,UAAU,GAAG,UAAU,GAAG,QAAQ,EAAG,CAAC,CAAC,MAAM,GAAG,MAAM,CAAA,GAAA,yCAAA,EAAQ;gBACvE;gBACA,OAAO;YACT;YACA,QAAQ,CAAC;gBACP,MAAM,IAAI,QAAQ;gBAClB,IAAK,IAAI,IAAI,GAAG,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,IAAI,MAAM,MAAM,EAAE,IAAK;oBACnE,OAAO,KAAK,CAAC,EAAE,IAAI;oBACnB,UAAU;oBACV,MAAO,UAAU,GAAG,UAAU,GAAG,QAAQ,EAAG,CAAC,CAAC,MAAM,GAAG,EAAE,MAAM,CAAC,MAAM;gBACxE;gBACA,OAAO;YACT;QACD;IACH;IAEA,OAAO;aAAE;cAAK;kBAAM;aAAU;mBAAK;IAAS;AAC9C;AAEA,MAAM,uCACJ,CAAC,QACD,CAAC,MAAkB;QACjB,IAAI,CAAC,UAAU,WAAW,MAAM,QAAQ;QACxC,kCAAkC;QAClC,gEAAgE;QAChE,iDAAiD;QAEjD,8DAA8D;QAC9D,MAAM,QAAQ,IAAI,WAAW,KAAK,MAAM,GAAG;QAC3C,MAAM,GAAG,CAAC;QACV,MAAM,UAAU,KAAK,MAAM;QAC3B,MAAM,MAAM,IAAI,WAAW,WAAW,uBAAuB;QAC7D,IAAI,IAAI,MAAM,MAAM,CAAC,CAAA;QACrB,IAAI,QAAQ;QACZ,IAAI,OAAO;QACX,OAAO;YACL,OAAO,IAAO,CAAA;2BAAE;0BAAO;gBAAI,CAAA;YAC3B,KAAK,CAAC,GAAW;gBACf,gFAAgF;gBAChF,6EAA6E;gBAC7E,KAAK,CAAC,UAAU,EAAE,GAAG;gBACrB,KAAK,CAAC,UAAU,EAAE,GAAG;gBACrB,EAAE,OAAO;gBACT,IAAI,MAAM,MAAM,CAAC,CAAA,GAAI,MAAM,CAAC;gBAC5B;gBACA,OAAO;oBACL;oBACA,OAAO,EAAE,OAAO,CAAC;gBACnB;YACF;YACA,OAAO;gBACL,EAAE,OAAO;gBACT,CAAA,GAAA,yCAAA,EAAW,KAAK;YAClB;QACD;IACH;AAkBK,MAAM,4CAAc,aAAA,GAAgB,qCAAe,CAAA,GAAA,yCAAA;AAiBnD,MAAM,4CAAc,aAAA,GAAgB,qCAAe,CAAA,GAAA,yCAAA;;;;AV3N1D,SAAS,2CAAqB,IAAqB;IACjD,CAAA,GAAA,yCAAA,EAAa;IACb,IAAI,KAAK,UAAU,KAAK,WAAW,CAAA,GAAA,yCAAA,EAAM,KAAK,UAAU,EAAE;AAC5D;AAgBA,YAAY;AACZ,6FAA6F;AAC7F,MAAM,0BAAI;AACV,mGAAmG;AACnG,MAAM,0BAAI;AACV,6FAA6F;AAC7F,MAAM,sCAAgB;AACtB,yDAAyD;AACzD,MAAM,0BAAI;AACV,8EAA8E;AAC9E,MAAM,0BAAI;AACV,yFAAyF;AACzF,sEAAsE;AACtE,+FAA+F;AAC/F,MAAM,iCAAW,KAAK,KAAK,CAAC,AAAC,CAAA,0BAAI,CAAA,IAAK,MAAM;AAC5C,MAAM,iCAAW,KAAK,KAAK,CAAC,AAAC,CAAA,0BAAI,CAAA,IAAK,MAAM;AA+BrC,MAAM,2CAAmD,AAAhB,aAAA,GAAiB,CAAA,IAAO,CAAA;QACtE,GAAG;YAAE,GAAG;YAAG,GAAG;eAAG;YAAG,QAAQ,KAAK;YAAI,QAAQ;YAAU,KAAK;YAAI,KAAK;YAAG,OAAO;QAAE;QACjF,GAAG;YAAE,GAAG;YAAG,GAAG;eAAG;YAAG,QAAQ,KAAK;YAAI,QAAQ;YAAU,KAAK;YAAI,KAAK;YAAG,OAAO;QAAE;QACjF,GAAG;YAAE,GAAG;YAAG,GAAG;eAAG;YAAG,QAAQ,KAAK;YAAI,QAAQ;YAAU,KAAK;YAAI,KAAK;YAAG,OAAO;QAAE;IACxE,CAAA,CAAA;AAIX,MAAM,gCAAU,CAAC,IAA0B,IAAI,WAAW;AAE1D,mFAAmF;AACnF,sFAAsF;AACtF,MAAM,iCAAW,aAAA,GAAgB,CAAA,GAAA,yCAAA,EAAY;OAC3C;OACA;OACA;mBACA;aACA;IACA,SAAS;IACT,SAAS;AACV;AAED,MAAM,2BAAK,CAAI,IAAY;AAG3B,6DAA6D;AAC7D,2FAA2F;AAC3F,2EAA2E;AAC3E,MAAM,kCAAY,CAAC,GAAW,WAAkB,wBAAE,EAAE,SAAgB,wBAAE,GACpE,+BAAS,SAAS,CAAC,GAAG;QACpB,QAAQ,CAAC,IAAc,SAAS,OAAO;QACvC,QAAQ,CAAC,IAAc,OAAO,SAAS;IACxC;AAEH,mEAAmE;AACnE,MAAM,gCAAU,CAAC,GAAS;IACxB,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,CAAC,CAAC,EAAE,GAAG,+BAAS,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;IAClE,OAAO;AACT;AACA,mEAAmE;AACnE,MAAM,gCAAU,CAAC,GAAS;IACxB,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,CAAC,CAAC,EAAE,GAAG,+BAAS,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;IAClE,OAAO;AACT;AAEA,0EAA0E;AAC1E,MAAM,mCAAa,CAAC;IAClB,IAAK,IAAI,IAAI,GAAG,IAAI,yBAAG,IAAK,CAAC,CAAC,EAAE,KAAK;IACrC,OAAO;AACT;AAEA,MAAM,oCAAc,CAAC,GAAS;IAC5B,+FAA+F;IAC/F,IAAK,IAAI,IAAI,GAAG,IAAI,yBAAG,IAAK,IAAI,KAAK,GAAG,CAAC,+BAAS,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAC3E,OAAO;AACT;AAEA,mDAAmD;AACnD,MAAM,qCAAe,CAAC,GAAS;IAC7B,kFAAkF;IAClF,2EAA2E;IAC3E,sFAAsF;IACtF,0CAA0C;IAC1C,MAAM,IAAI,8BAAQ;IAClB,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK,CAAC,CAAC,EAAE,GAAG,+BAAS,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;IAClE,OAAO;AACT;AAEA,oCAAoC;AACpC,SAAS,iCAAW,GAAW;IAC7B,4EAA4E;IAC5E,MAAM,IAAI,8BAAQ;IAClB,wEAAwE;IACxE,IAAK,IAAI,IAAI,GAAG,IAAI,yBAAK;QACvB,MAAM,IAAI;QACV,IAAI,EAAE,MAAM,GAAG,GAAG,MAAM,IAAI,MAAM;QAClC,IAAK,IAAI,IAAI,GAAG,IAAI,2BAAK,KAAK,EAAE,MAAM,GAAG,GAAG,KAAK,EAAG;YAClD,sFAAsF;YACtF,MAAM,IAAI,AAAC,CAAA,CAAC,CAAC,IAAI,EAAE,GAAI,CAAC,CAAC,IAAI,EAAE,IAAI,IAAM,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAK,UAAU,UAAU;YAChF,IAAI,IAAI,yBAAG,CAAC,CAAC,IAAI,GAAG;QACtB;IACF;IACA,OAAO;AACT;AAkBA,mFAAmF;AACnF,+EAA+E;AAC/E,SAAS,mCAAa,IAAmB;IACvC,MAAM,KAAE,CAAC,KAAE,CAAC,UAAE,MAAM,UAAE,MAAM,OAAE,GAAG,OAAE,GAAG,SAAE,KAAK,EAAE,GAAG;IAClD,MAAM,aAAE,SAAS,YAAE,QAAQ,iBAAE,aAAa,UAAE,MAAM,UAAE,MAAM,iBAAE,aAAa,EAAE,GAAG;IAE9E,IAAI,CAAC;QAAC;QAAG;KAAE,CAAC,QAAQ,CAAC,MAAM,MAAM,IAAI,MAAM;IAC3C,IAAI,CAAC;QAAC;QAAS;KAAQ,CAAC,QAAQ,CAAC,SAAS,MAAM,IAAI,MAAM;IAC1D,IAAI,CAAC;QAAC;QAAU;KAAS,CAAC,QAAQ,CAAC,SAAS,MAAM,IAAI,MAAM;IAC5D,MAAM,OAAO,MAAM;IAEnB,MAAM,YAAY,CAAC;QACjB,+DAA+D;QAC/D,MAAM,QAAQ,+BAAS,GAAG,CAAC;QAC3B,MAAM,KAAK,+BAAS,IAAI,CAAC,OAAO,IAAI,UAAU;QAC9C,mFAAmF;QACnF,IAAI,QAAQ,OAAO,0BAAI,GAAG,OAAO;YAAE,IAAI;YAAO,IAAI,AAAC,KAAK,IAAK;QAAC;QAC9D,MAAM,KAAK,KAAK,KAAK,CAAC,AAAC,CAAA,QAAQ,EAAA,IAAO,CAAA,IAAI,MAAA,KAAW;QACrD,OAAO;gBAAE;gBAAI;QAAE,GAAI,8BAA8B;IACnD;IAEA,MAAM,WAAW,CAAC,IAAc,UAAU,GAAG,EAAE;IAC/C,MAAM,UAAU,CAAC,IAAc,UAAU,GAAG,EAAE;IAC9C,MAAM,WAAW,CAAC,GAAW;QAC3B,+EAA+E;QAC/E,kFAAkF;QAClF,4FAA4F;QAC5F,uFAAuF;QACvF,0EAA0E;QAE1E,sBAAsB;QACtB,MAAM,OAAO,KAAK,UAAU,IAAI,0BAAI,UAAW,MAAM,0BAAI,UAAU,MAAM,IAAK,IAAI;QAClF,gBAAgB;QAChB,6BAA6B;QAC7B,iCAAiC;QACjC,gCAAgC;QAChC,iEAAiE;QACjE,2EAA2E;QAC3E,kEAAkE;QAClE,0FAA0F;QAC1F,eAAe;QACf,+EAA+E;QAC/E,OAAO;IACT;IAEA,MAAM,UAAU,CAAC,GAAW;QAC1B,0DAA0D;QAC1D,MAAM,IAAI,KAAK,KAAK,CAAC,AAAC,CAAA,0BAAI,CAAA,IAAM,CAAA,IAAI,MAAA;QACpC,MAAM,MAAE,EAAE,MAAE,EAAE,EAAE,GAAG,UAAU;QAC7B,+CAA+C;QAC/C,+CAA+C;QAC/C,IAAI,MAAM,GAAG,OAAO,KAAK,IAAI,+BAAS,GAAG,CAAC,KAAK,GAAG,KAAK,IAAI,+BAAS,GAAG,CAAC,KAAK,GAAG,KAAK;QACrF,OAAO,KAAK;IACd;IACA,MAAM,cAAc,CAAC;QACnB,iEAAiE;QACjE,MAAM,QAAQ,+BAAS,GAAG,CAAC;QAC3B,MAAM,KAAK,+BAAS,IAAI,CAAC,OAAO,KAAK,2BAAK;QAC1C,OAAO;YAAE,IAAI,KAAK,KAAK,CAAC,AAAC,CAAA,QAAQ,EAAA,IAAM,KAAK,2BAAK;gBAAG;QAAE;IACxD;IAEA,MAAM,YAA2C;QAC/C,UAAU,QAAQ;QAClB,QAAQ,CAAC;YACP,IAAI,MAAM,OAAO,MAAM,IAAI,MAAM,+BAA+B,sBAAsB;YACtF,MAAM,MAAM,IAAI,WAAW,QAAQ;YACnC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAK;gBACjC,IAAK,IAAI,IAAI,GAAG,IAAI,yBAAG,IAAK,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC,IAAI,GAAG;gBAC1D,GAAG,CAAC,QAAQ,EAAE,GAAG;YACnB;YACA,OAAO;QACT;QACA,QAAQ,CAAC;YACP,MAAM,IAAI,EAAE;YACZ,IAAI,IAAI;YACR,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;gBAC1B,MAAM,KAAK,8BAAQ;gBACnB,IAAI,GAAG,CAAC,QAAQ,EAAE,GAAG,KAAK,GAAG,CAAC,QAAQ,EAAE,GAAG,OAAO,OAAO;gBACzD,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,IAAK;oBACvC,IAAI,IAAI,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO;oBAC1C,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG;gBACf;gBACA,IAAI,GAAG,CAAC,QAAQ,EAAE;gBAClB,EAAE,IAAI,CAAC;YACT;YACA,IAAK,IAAI,IAAI,GAAG,IAAI,OAAO,IAAK,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO;YACzD,OAAO;QACT;IACD;IAED,MAAM,WAAW,gCACf,QAAQ,IAAI,IAAI,GAChB,CAAC,IAAc,MAAM,GACrB,CAAC;QACC,IAAI,CAAE,CAAA,CAAC,OAAO,KAAK,KAAK,GAAA,GACtB,MAAM,IAAI,MAAM,CAAA,oBAAA,EAAuB,EAAC,uBAAA,EAA0B,CAAC,IAAG,EAAA,EAAK,IAAG,CAAA,CAAG;QACnF,OAAO;IACT;IAEF,MAAM,UAAU,gCAAU,IAAI,CAAC,IAAc,AAAC,CAAA,KAAM,0BAAI,CAAC,IAAK;IAC9D,MAAM,UAAU,gCAAU;IAC1B,8BAA8B;IAC9B,MAAM,SAAS,gCAAU,WAAW,SAAU,KAAK,IAAI,CAAC,IAAc,+BAAS,IAAI,CAAC,SAAS;IAC7F,MAAM,UAAU,gCAAU,WAAW,iCAAW,IAAI;IACpD,MAAM,QAAQ,CAAA,GAAA,yCAAA,EAAS,SAAS;IAChC,kBAAkB;IAClB,MAAM,cAAc,CAAA,GAAA,yCAAA,EAAW,aAAa,IAAI,CAAA,GAAA,yCAAA,EAAS,SAAS;IAClE,MAAM,cAAc,CAAA,GAAA,yCAAA,EAClB,aACA,IACA,IACA,UACA,CAAA,GAAA,yCAAA,EAAS,UAAU,IACnB,CAAA,GAAA,yCAAA,EAAS,UAAU,IACnB,CAAA,GAAA,yCAAA,EAAS,SAAS;IAEpB,MAAM,WAAW,CAAA,GAAA,yCAAA,EAAW,aAAa,eAAe,CAAA,GAAA,yCAAA,EAAS,QAAQ,IAAI;IAC7E,MAAM,mBACJ,QAAQ,IACJ,CAAC,IAAe,IAAI,KAAK,IAAK,IAAI,IAAK,QACvC,CAAC,IAAe,IAAI,IAAI,IAAI,IAAI;IAEtC,0CAA0C;IAC1C,0FAA0F;IAC1F,oCAAoC;IACpC,SAAS,eAAe,GAAW;QACjC,gGAAgG;QAChG,MAAM,IAAU,8BAAQ;QACxB,IAAK,IAAI,IAAI,GAAG,IAAI,yBAAK;YACvB,MAAM,IAAI;YACV,IAAK,IAAI,IAAI,GAAG,IAAI,2BAAK,IAAI,EAAE,MAAM,EAAE,KAAK,EAAG;gBAC7C,oFAAoF;gBACpF,MAAM,KAAK,iBAAiB,CAAC,CAAC,EAAE,GAAG;gBACnC,MAAM,KAAK,iBAAiB,AAAC,CAAC,CAAC,EAAE,IAAI,IAAK;gBAC1C,IAAI,OAAO,OAAO,CAAC,CAAC,IAAI,GAAG;gBAC3B,IAAI,IAAI,2BAAK,OAAO,OAAO,CAAC,CAAC,IAAI,GAAG;YACtC;QACF;QACA,OAAO;IACT;IAEA,MAAM,eAAe,CAAC;QACpB,oFAAoF;QACpF,MAAM,MAAM,8BAAQ;QACpB,MAAM,IAAI,CAAA,GAAA,yCAAA,EAAS,MAAM,CAAC,CAAA,GAAI,MAAM,CAAC;QACrC,MAAM,MAAM,IAAI,WAAW,CAAA,GAAA,yCAAA,EAAS,QAAQ;QAC5C,EAAE,OAAO,CAAC;QACV,iFAAiF;QACjF,8EAA8E;QAC9E,MAAM,QAAQ,IAAI,KAAK,CAAC,GAAG;QAC3B,IAAK,IAAI,IAAI,0BAAI,KAAK,MAAM,GAAG,UAAU,GAAG,UAAU,GAAG,IAAI,yBAAG,IAAK;YACnE,IAAI,IAAI,IAAI;YACZ,MAAO,IAAI,GAAK;gBACd,IAAI,GAAG,CAAC,MAAM;gBACd,IAAI,MAAM,CAAA,GAAA,yCAAA,EAAS,QAAQ,EAAE;gBAC7B,EAAE,OAAO,CAAC;gBACV,MAAM;YACR;YACA,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE;YACf,GAAG,CAAC,EAAE,GAAG,IAAK,CAAA,AAAC,CAAA,AAAC,KAAK,CAAC,QAAQ,IAAI,YAAa,CAAA,KAAM,CAAA;YACrD,IAAI,WAAW,GAAG;gBAChB;gBACA,UAAU;YACZ;QACF;QACA,OAAO;IACT;IAEA,MAAM,iBAAiB,CAAC;QACtB,MAAM,OAAO,8BAAQ;QACrB,MAAM,OAAO,8BAAQ;QACrB,IAAK,IAAI,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAK;YACjC,MAAM,MAAE,EAAE,MAAE,EAAE,EAAE,GAAG,YAAY,CAAC,CAAC,EAAE;YACnC,IAAI,CAAC,EAAE,GAAG;YACV,IAAI,CAAC,EAAE,GAAG;QACZ;QACA,OAAO;YAAE,IAAI;YAAM,IAAI;QAAI;IAC7B;IACA,MAAM,cAAc,CAAC,GAAS;QAC5B,iFAAiF;QACjF,uEAAuE;QACvE,IAAK,IAAI,IAAI,GAAG,IAAI,yBAAG,IAAK,CAAC,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE;QACrD,OAAO;IACT;IACA,MAAM,eAAe,CAAC,GAAS;QAC7B,MAAM,IAAI,8BAAQ;QAClB,IAAI,MAAM;QACV,IAAK,IAAI,IAAI,GAAG,IAAI,yBAAG,IAAK;YAC1B,MAAM,IAAI,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE;YAC7B,CAAC,CAAC,EAAE,GAAG;YACP,OAAO;QACT;QACA,OAAO;eAAE;iBAAG;QAAG;IACjB;IAEA,MAAM,gBAAgB;IACtB,MAAM,YAAY,CAAA,GAAA,yCAAA,EAAW,QAAQ,IAAI,IAAI;IAC7C,sDAAsD;IACtD,MAAM,WAAwB;QAC5B,MAAM;YAAE,MAAM;QAAiB;QAC/B,SAAS;YACP,WAAW,YAAY,QAAQ;YAC/B,WAAW,YAAY,QAAQ;YAC/B,MAAM;YACN,WAAW,SAAS,QAAQ;YAC5B,UAAU;QACX;QACD,QAAQ,CAAC;YACP,2EAA2E;YAC3E,MAAM,UAAU,IAAI,WAAW;YAC/B,MAAM,WAAW,SAAS;YAC1B,IAAI,UAAU,OAAO,CAAA,GAAA,yCAAA,EAAY;YACjC,CAAA,GAAA,yCAAA,EAAO,MAAO,IAAI;YAClB,QAAQ,GAAG,CAAC;YACZ,IAAI,UAAU,CAAA,GAAA,yCAAA,EAAW;YACzB,OAAO,CAAC,GAAG,GAAG;YACd,OAAO,CAAC,GAAG,GAAG;YACd,MAAM,CAAC,KAAK,UAAU,GAAG,GAAG,UAAU,MAAM,CAC1C,CAAA,GAAA,yCAAA,EAAS,SAAS;gBAAE,OAAO,UAAU,QAAQ;YAAA;YAE/C,MAAM,WAAW,OAAO;YACxB,MAAM,KAAK,EAAE;YACb,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK,GAAG,IAAI,CAAC,eAAe,SAAS,GAAG,CAAC,IAAI,MAAM,AAAC,KAAK,IAAK;YACrF,MAAM,KAAK,EAAE;YACb,IAAK,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IACzB,GAAG,IAAI,CAAC,eAAe,SAAS,GAAG,CAAC,IAAI,MAAM,AAAC,KAAK,IAAK;YAC3D,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,IAAM,+BAAS,GAAG,CAAC,MAAM,CAAC,EAAE,KAAK;YACvD,MAAM,KAAK,EAAE;YACb,MAAM,KAAK,EAAE;YACb,MAAM,MAAM,OAAO;YACnB,MAAM,IAAI,8BAAQ;YAClB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;gBAC1B,4BAA4B;gBAC5B,CAAA,GAAA,yCAAA,EAAW,IAAI,mBAAmB;gBAClC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;oBAC1B,MAAM,MAAM,iCAAW,IAAI,GAAG,CAAC,GAAG,KAAK,cAAc;oBACrD,8BAAQ,GAAG,mCAAa,KAAK,KAAK,CAAC,EAAE;gBACvC;gBACA,+BAAS,GAAG,CAAC,MAAM,CAAC;gBACpB,MAAM,MAAE,EAAE,MAAE,EAAE,EAAE,GAAG,eAAe,8BAAQ,GAAG,EAAE,CAAC,EAAE,IAAI,+BAA+B;gBACrF,GAAG,IAAI,CAAC;gBACR,GAAG,IAAI,CAAC;YACV;YACA,MAAM,YAAY,YAAY,MAAM,CAAC;gBAAC;gBAAK;aAAG,GAAG,uBAAuB;YACxE,MAAM,KAAK,CAAA,GAAA,yCAAA,EAAS,WAAW;gBAAE,OAAO;YAAQ,IAAK,+BAA+B;YACpF,qCAAqC;YACrC,MAAM,YAAY,YAAY,MAAM,CAAC;gBAAC;gBAAK;gBAAI;gBAAI;gBAAI;gBAAI;aAAG;YAC9D,IAAI,KAAK;YACT,SAAS,KAAK;YACd,QAAQ;YACR,sEAAsE;YACtE,qCAAqC;YACrC,kEAAkE;YAClE,iCAAiC;YACjC,CAAA,GAAA,yCAAA,EAAW,KAAK,UAAU,IAAI,IAAI,IAAI,OAAO,GAAG,IAAI,IAAI,IAAI;YAC5D,OAAO;2BAAE;2BAAW;YAAS;QAC/B;QACA,cAAc,CAAC;YACb,uCAAuC;YACvC,MAAM,CAAC,KAAK,IAAI,KAAK,IAAI,IAAI,IAAI,GAAG,YAAY,MAAM,CAAC;YACvD,MAAM,MAAM,OAAO;YACnB,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,IAAM,+BAAS,GAAG,CAAC,MAAM,CAAC,EAAE,KAAK;YACvD,MAAM,KAAa,EAAE;YACrB,MAAM,MAAM,8BAAQ;YACpB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;gBAC1B,IAAI,IAAI,CAAC;gBACT,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;oBAC1B,MAAM,MAAM,iCAAW,IAAI,GAAG,CAAC,GAAG,KAAK,cAAc;oBACrD,8BAAQ,KAAK,mCAAa,KAAK,KAAK,CAAC,EAAE,IAAI,iBAAiB;gBAC9D;gBACA,+BAAS,GAAG,CAAC,MAAM,CAAC,MAAM,QAAQ;gBAClC,8BAAQ,KAAK,EAAE,CAAC,EAAE,GAAG,kBAAkB;gBACvC,MAAM,MAAE,EAAE,EAAE,GAAG,eAAe,MAAM,mBAAmB;gBACvD,GAAG,IAAI,CAAC;YACV;YACA,IAAI,KAAK;YACT,CAAA,GAAA,yCAAA,EAAW,KAAK,OAAO,KAAK,IAAI;YAChC,OAAO,YAAY,MAAM,CAAC;gBAAC;gBAAK;aAAG;QACrC;QACA,4BAA4B;QAC5B,MAAM,CAAC,KAAiB,WAAuB,OAAkC,CAAA,CAAE;YACjF,CAAA,GAAA,yCAAA,EAAgB;YAChB,2CAAqB;YACrB,IAAI,EAAE,cAAc,MAAM,cAAE,aAAa,OAAO,GAAG;YACnD,8FAA8F;YAC9F,qDAAqD;YACrD,uCAAuC;YACvC,MAAM,CAAC,KAAK,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,YAAY,MAAM,CAAC;YACrD,yCAAyC;YACzC,MAAM,IAAc,EAAE,EAAE,iBAAiB;YACzC,MAAM,MAAM,OAAO;YACnB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;gBAC1B,MAAM,KAAK,EAAE;gBACb,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK,GAAG,IAAI,CAAC,iCAAW,IAAI,GAAG,CAAC,GAAG;gBAC1D,EAAE,IAAI,CAAC;YACT;YACA,IAAI,KAAK;YACT,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK,+BAAS,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,gBAAgB;YACxE,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;gBAC1B,+BAAS,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,gBAAgB;gBAC5C,+BAAS,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,gBAAgB;YAC9C;YACA,uBAAuB;YACvB,MAAM,KAAK,aACP,MAEA,wCAAwC;YACxC,CAAA,GAAA,yCAAA,EAAS,MAAM,CAAC;gBAAE,OAAO;YAAS,GAAI,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,MAAM;YAEvE,8BAA8B;YAC9B,MAAM,MACJ,WAAW,QACP,IAAI,WAAW,MACf,WAAW,YACT,CAAA,GAAA,yCAAA,EAAY,iBACZ;YACR,CAAA,GAAA,yCAAA,EAAO,KAAK,IAAI;YAChB,MAAM,WAAW,CAAA,GAAA,yCAAA,EACd,MAAM,CAAC;gBAAE,OAAO;YAAS,GACzB,MAAM,CAAC,IACP,MAAM,CAAC,KACP,MAAM,CAAC,IACP,MAAM,IAAI,wBAAwB;YAErC,CAAA,GAAA,yCAAA,EAAO,UAAU;YACjB,MAAM,OAAO,OAAO,UAAU,OAAO,QAAQ;YAC7C,2BAA2B;YAC3B,WAAW,IAAK,IAAI,QAAQ,IAAO;gBACjC,MAAM,IAAI,EAAE;gBACZ,wBAAwB;gBACxB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAC1B,EAAE,IAAI,CAAC,OAAO,MAAM,CAAC,KAAK,GAAG,CAAC,QAAQ,MAAM,SAAS;gBACvD,MAAM,IAAI,EAAE,GAAG,CAAC,CAAC,IAAM,+BAAS,GAAG,CAAC,MAAM,CAAC,EAAE,KAAK;gBAClD,MAAM,IAAI,EAAE;gBACZ,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;oBAC1B,wBAAwB;oBACxB,MAAM,KAAK,8BAAQ;oBACnB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK,8BAAQ,IAAI,mCAAa,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE;oBAClE,+BAAS,GAAG,CAAC,MAAM,CAAC;oBACpB,EAAE,IAAI,CAAC;gBACT;gBACA,MAAM,KAAK,EAAE,GAAG,CAAC,CAAC,IAAM,EAAE,GAAG,CAAC,YAAY,mBAAmB;gBAC7D,2DAA2D;gBAC3D,MAAM,SAAS,CAAA,GAAA,yCAAA,EACZ,MAAM,CAAC;oBAAE,OAAO;gBAAa,GAC7B,MAAM,CAAC,IACP,MAAM,CAAC,MAAM,MAAM,CAAC,KACpB,MAAM;gBACT,sBAAsB;gBACtB,qCAAqC;gBACrC,MAAM,OAAO,+BAAS,GAAG,CAAC,MAAM,CAAC,aAAa;gBAC9C,2BAA2B;gBAC3B,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,IAAM,mCAAa,GAAG;gBAC1C,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;oBAC1B,8BAAQ,+BAAS,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,kBAAkB;oBAC9D,IAAI,kCAAY,GAAG,CAAC,EAAE,EAAE,SAAS,OAAO,SAAS,WAAW,kBAAkB;gBAChF;gBACA,qCAAqC;gBACrC,IAAI,MAAM;gBACV,MAAM,IAAI,EAAE;gBACZ,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;oBAC1B,MAAM,MAAM,+BAAS,GAAG,CAAC,MAAM,CAAC,mCAAa,EAAE,CAAC,EAAE,EAAE,QAAQ,2BAA2B;oBACvF,MAAM,KAAK,8BAAQ,CAAC,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,UAAU,4BAA4B;oBACxE,IAAI,kCAAY,IAAI,SAAS,OAAO,SAAS,WAAW,mBAAmB;oBAC3E,MAAM,MAAM,+BAAS,GAAG,CAAC,MAAM,CAAC,mCAAa,EAAE,CAAC,EAAE,EAAE,QAAQ,2BAA2B;oBACvF,IAAI,kCAAY,KAAK,SAAS,SAAS;oBACvC,8BAAQ,IAAI;oBACZ,kBAAkB;oBAClB,MAAM,OAAO,aAAa,IAAI,EAAE,CAAC,EAAE,GAAG,+CAA+C;oBACrF,EAAE,IAAI,CAAC,KAAK,CAAC;oBACb,OAAO,KAAK,GAAG;gBACjB;gBACA,IAAI,MAAM,OAAO,UAAU,2CAA2C;gBACtE,KAAK,KAAK;gBACV,MAAM,MAAM,SAAS,MAAM,CAAC;oBAAC;oBAAQ;oBAAK;iBAAE,GAAG,gCAAgC;gBAC/E,sDAAsD;gBACtD,CAAA,GAAA,yCAAA,EAAW,QAAQ,KAAK,GAAG,MAAM,IAAI,GAAG,GAAG,GAAG,UAAU,IAAI,IAAI,OAAO;gBACvE,sDAAsD;gBACtD,wDAAwD;gBACxD,4EAA4E;gBAC5E,IAAI,CAAC,YAAY,CAAA,GAAA,yCAAA,EAAW;gBAC5B,OAAO;YACT;YACA,aAAa;YACb,MAAM,IAAI,MAAM;QAClB;QACA,QAAQ,CACN,KACA,KACA,WACA,OAAwB,CAAA,CAAE;YAE1B,2CAAqB;YACrB,MAAM,cAAE,aAAa,OAAO,GAAG;YAC/B,kEAAkE;YAClE,MAAM,CAAC,KAAK,GAAG,GAAG,YAAY,MAAM,CAAC,YAAY,yBAAyB;YAC1E,MAAM,KAAK,CAAA,GAAA,yCAAA,EAAS,WAAW;gBAAE,OAAO;YAAQ,IAAK,kCAAkC;YAEvF,IAAI,IAAI,MAAM,KAAK,SAAS,QAAQ,EAAE,OAAO,OAAO,oCAAoC;YACxF,4BAA4B;YAC5B,sDAAsD;YACtD,MAAM,CAAC,QAAQ,GAAG,EAAE,GAAG,SAAS,MAAM,CAAC;YACvC,IAAI,MAAM,OAAO,OAAO,OAAO,6BAA6B;YAC5D,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK,IAAI,kCAAY,CAAC,CAAC,EAAE,EAAE,SAAS,OAAO,OAAO;YACzE,MAAM,KAAK,aACP,MAEA,CAAA,GAAA,yCAAA,EAAS,MAAM,CAAC;gBAAE,OAAO;YAAS,GAAI,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,MAAM;YACvE,sCAAsC;YACtC,MAAM,IAAI,+BAAS,GAAG,CAAC,MAAM,CAAC,aAAa,UAAU,wBAAwB;YAC7E,MAAM,OAAO,EAAE,GAAG,CAAC,CAAC,IAAM,EAAE,KAAK,KAAK,gBAAgB;YACtD,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK,+BAAS,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YACvD,MAAM,SAAS,EAAE;YACjB,MAAM,MAAM,OAAO;YACnB,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;gBAC1B,MAAM,QAAQ,mCAAa,+BAAS,GAAG,CAAC,MAAM,CAAC,iCAAW,EAAE,CAAC,EAAE,IAAI,IAAI,iBAAiB;gBACxF,MAAM,KAAK,8BAAQ,0BAAI,WAAW;gBAClC,IAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAK;oBAC1B,MAAM,MAAM,iCAAW,IAAI,GAAG,CAAC,GAAG,KAAK,kBAAkB;oBACzD,8BAAQ,IAAI,mCAAa,KAAK,IAAI,CAAC,EAAE;gBACvC;gBACA,gCAAgC;gBAChC,MAAM,UAAU,+BAAS,GAAG,CAAC,MAAM,CAAC,8BAAQ,IAAI;gBAChD,wCAAwC;gBACxC,OAAO,IAAI,CAAC,YAAY,SAAS,CAAC,CAAC,EAAE,IAAI,8BAA8B;YACzE;YACA,IAAI,KAAK;YACT,gEAAgE;YAChE,MAAM,KAAK,CAAA,GAAA,yCAAA,EACR,MAAM,CAAC;gBAAE,OAAO;YAAa,GAC7B,MAAM,CAAC,IACP,MAAM,CAAC,MAAM,MAAM,CAAC,SACpB,MAAM;YACT,iCAAiC;YACjC,4EAA4E;YAC5E,KAAK,MAAM,KAAK,EAAG;gBACjB,MAAM,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,IAAM,MAAM,GAAG;gBAC1C,IAAI,CAAE,CAAA,OAAO,KAAA,GAAQ,OAAO;YAC9B;YACA,KAAK,MAAM,KAAK,EAAG,IAAI,kCAAY,GAAG,SAAS,OAAO,OAAO;YAC7D,OAAO,CAAA,GAAA,yCAAA,EAAW,QAAQ;QAC5B;IACD;IACD,OAAO;QACL,MAAM;YAAE,MAAM;QAAQ;kBACtB;QACA,eAAe;QACf,QAAQ,SAAS,MAAM;QACvB,SAAS,SAAS,OAAO;QACzB,cAAc,SAAS,YAAY;QACnC,MAAM,CAAC,KAAiB,WAAuB,OAAgB,CAAA,CAAE;YAC/D,CAAA,GAAA,yCAAA,EAAgB;YAChB,MAAM,IAAI,CAAA,GAAA,wCAAA,EAAW,KAAK,KAAK,OAAO;YACtC,MAAM,MAAM,SAAS,IAAI,CAAC,GAAG,WAAW;YACxC,CAAA,GAAA,yCAAA,EAAW;YACX,OAAO;QACT;QACA,QAAQ,CAAC,KAAiB,KAAiB,WAAuB,OAAgB,CAAA,CAAE;YAClF,CAAA,GAAA,yCAAA,EAAgB;YAChB,OAAO,SAAS,MAAM,CAAC,KAAK,CAAA,GAAA,wCAAA,EAAW,KAAK,KAAK,OAAO,GAAG;QAC7D;QACA,SAAS,CAAC;YACR,CAAA,GAAA,yCAAA,EAAU,MAAM;YAChB,OAAO;gBACL,MAAM;oBAAE,MAAM;gBAAY;gBAC1B,eAAe;gBACf,SAAS,SAAS,OAAO;gBACzB,QAAQ,SAAS,MAAM;gBACvB,cAAc,SAAS,YAAY;gBACnC,MAAM,CAAC,KAAiB,WAAuB,OAAgB,CAAA,CAAE;oBAC/D,CAAA,GAAA,yCAAA,EAAgB;oBAChB,MAAM,IAAI,CAAA,GAAA,yCAAA,EAAkB,MAAM,KAAK,KAAK,OAAO;oBACnD,MAAM,MAAM,SAAS,IAAI,CAAC,GAAG,WAAW;oBACxC,CAAA,GAAA,yCAAA,EAAW;oBACX,OAAO;gBACT;gBACA,QAAQ,CAAC,KAAiB,KAAiB,WAAuB,OAAgB,CAAA,CAAE;oBAClF,CAAA,GAAA,yCAAA,EAAgB;oBAChB,OAAO,SAAS,MAAM,CAAC,KAAK,CAAA,GAAA,yCAAA,EAAkB,MAAM,KAAK,KAAK,OAAO,GAAG;gBAC1E;YACD;QACH;IACD;AACH;AAGO,MAAM,2CAAgC,AAAhB,aAAA,GAAiB,CAAA,IAC5C,mCAAa;QACX,GAAG,wCAAM,CAAC,EAAE;QACZ,WAAW;QACX,UAAU;QACV,eAAe;gBACf;gBACA;QACA,eAAe;IAChB,EAAA;AAGI,MAAM,4CAAgC,AAAhB,aAAA,GAAiB,CAAA,IAC5C,mCAAa;QACX,GAAG,wCAAM,CAAC,EAAE;QACZ,WAAW;QACX,UAAU;QACV,eAAe;gBACf;gBACA;QACA,eAAe;IAChB,EAAA;AAGI,MAAM,4CAAgC,AAAhB,aAAA,GAAiB,CAAA,IAC5C,mCAAa;QACX,GAAG,wCAAM,CAAC,EAAE;QACZ,WAAW;QACX,UAAU;QACV,eAAe;gBACf;gBACA;QACA,eAAe;IAChB,EAAA;;;AZntBH,MAAM,sCAAgB;AACtB,MAAM,oDAA8B;AACpC,MAAM,oDAA8B;AACpC,MAAM,6CAAuB;AAC7B,MAAM,oDAA8B,IAAI;AACxC,MAAM,4CAAsB;AAC5B,MAAM,8CACJ,OAAO,YAAY,CAAC,OAAO,UAAU,CAAC,qCAAe,WACrD;AAEF,SAAS,wCAAkB,KAAa;IACtC,IAAI,CAAC,OAAO,SAAS,CAAC,UAAU,QAAQ,GACtC,MAAM,IAAI,MAAM;IAGlB,IAAI,QAAQ,KACV,OAAO,OAAO,IAAI,CAAC;QAAC;KAAM;IAG5B,IAAI,SAAS,QAAQ;QACnB,MAAM,SAAS,OAAO,KAAK,CAAC;QAC5B,MAAM,CAAC,EAAE,GAAG;QACZ,OAAO,aAAa,CAAC,OAAO;QAC5B,OAAO;IACT;IAEA,IAAI,SAAS,YAAY;QACvB,MAAM,SAAS,OAAO,KAAK,CAAC;QAC5B,MAAM,CAAC,EAAE,GAAG;QACZ,OAAO,aAAa,CAAC,OAAO;QAC5B,OAAO;IACT;IAEA,MAAM,IAAI,MAAM;AAClB;AAEA,SAAS,wCAAkB,MAAc,EAAE,MAAc;IACvD,IAAI,UAAU,OAAO,MAAM,EACzB,MAAM,IAAI,MAAM;IAGlB,MAAM,QAAQ,MAAM,CAAC,OAAO;IAC5B,IAAI,QAAQ,KACV,OAAO;QAAE,OAAO;QAAO,QAAQ,SAAS;IAAE;IAG5C,IAAI,UAAU,MAAM;QAClB,IAAI,SAAS,IAAI,OAAO,MAAM,EAC5B,MAAM,IAAI,MAAM;QAElB,OAAO;YAAE,OAAO,OAAO,YAAY,CAAC,SAAS;YAAI,QAAQ,SAAS;QAAE;IACtE;IAEA,IAAI,UAAU,MAAM;QAClB,IAAI,SAAS,IAAI,OAAO,MAAM,EAC5B,MAAM,IAAI,MAAM;QAElB,OAAO;YAAE,OAAO,OAAO,YAAY,CAAC,SAAS;YAAI,QAAQ,SAAS;QAAE;IACtE;IAEA,IAAI,UAAU,MACZ,MAAM,IAAI,MAAM;IAGlB,MAAM,IAAI,MAAM;AAClB;AAEA,SAAS,6BAAO,KAAiB;IAC/B,OAAO,CAAA,GAAA,iBAAS,EAAE,UAAU,MAAM,CAAC,OAAO,MAAM;AAClD;AAEA,SAAS,8BAAQ,KAAiB;IAChC,OAAO,6BAAO,6BAAO;AACvB;AAEA,SAAS,8BAAQ,KAAiB;IAChC,OAAO,CAAA,GAAA,iBAAS,EAAE,aAAa,MAAM,CAAC,6BAAO,QAAQ,MAAM;AAC7D;AAEA,SAAS,wCAAkB,OAAe;IACxC,MAAM,eAAe,OAAO,IAAI,CAAC,SAAS;IAC1C,MAAM,aAAa,OAAO,IAAI,CAAC,qCAAe;IAC9C,MAAM,UAAU,OAAO,MAAM,CAAC;QAC5B,wCAAkB,WAAW,MAAM;QACnC;QACA,wCAAkB,aAAa,MAAM;QACrC;KACD;IAED,OAAO,8BAAQ;AACjB;AAEA,SAAS,wCAAkB,SAA8B;IACvD,OAAO,OAAO,cAAc,WACxB,OAAO,IAAI,CAAC,WAAW,YACvB,OAAO,IAAI,CAAC;AAClB;AAEA,SAAS,2CAAqB,SAAqB;IACjD,MAAM,SAAS,OAAO,IAAI,CAAC;IAE3B,IACE,OAAO,MAAM,KAAK,qDAClB,MAAM,CAAC,EAAE,KAAK,mDAEd,OAAO;IAGT,IAAI,OAAO,MAAM,KAAK,4CACpB,OAAO,OAAO,MAAM,CAAC;QAAC,OAAO,IAAI,CAAC;YAAC;SAA4B;QAAG;KAAO;IAG3E,MAAM,IAAI,MAAM;AAClB;AAEA,SAAS,2CAAqB,SAA8B;IAC1D,MAAM,SAAS,wCAAkB;IACjC,OAAO,OAAO,MAAM,GAAG,KAAK,MAAM,CAAC,EAAE,KAAK;AAC5C;AAEA,SAAS,sCAAgB,OAAe;IACtC,MAAM,UAAU,CAAA,GAAA,iCAAM,EAAE,MAAM,CAAC;IAC/B,IAAI,QAAQ,KAAK,CAAC,MAAM,KAAK,GAC3B,MAAM,IAAI,MAAM;IAGlB,OAAO;QACL,QAAQ,QAAQ,MAAM;QACtB,SAAS,QAAQ,KAAK,CAAC,EAAE;QACzB,SAAS,OAAO,IAAI,CAAC,CAAA,GAAA,iCAAM,EAAE,SAAS,CAAC,QAAQ,KAAK,CAAC,KAAK,CAAC;IAC7D;AACF;AAGO,SAAS,0CAAK,OAAe,EAAE,UAAsB,EAAE,aAAa,IAAI;IAC7E,MAAM,YAAY,+BAChB,SACA,OAAO,IAAI,CAAC,aACZ,YACA;IAGF,OAAO,UAAU,QAAQ,CAAC;AAC5B;AAEO,SAAS,0CACd,OAAe,EACf,UAAsB,EACtB,SAAqB;IAErB,MAAM,sBAAsB,2CAAqB;IACjD,MAAM,OAAO,wCAAkB;IAC/B,MAAM,cAAc,OAAO,IAAI,CAAC,CAAA,GAAA,wCAAO,EAAE,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC;IAEhE,MAAM,UAAU,OAAO,MAAM,CAAC;QAC5B,OAAO,IAAI,CAAC;YAAC;SAA4B;QACzC,wCAAkB,oBAAoB,MAAM;QAC5C;QACA,wCAAkB,YAAY,MAAM;QACpC;KACD;IAED,OAAO,QAAQ,QAAQ,CAAC;AAC1B;AAEO,SAAS,0CACd,OAAe,EACf,OAAe,EACf,SAA8B;IAE9B,IAAI;QACF,OAAO,iCACL,SACA,SACA,wCAAkB,YAClB;IAEJ,EAAE,OAAM;QACN,OAAO;IACT;AACF;AAEO,SAAS,0CACd,OAAe,EACf,OAAe,EACf,SAA8B;IAE9B,IAAI;QACF,MAAM,UAAU,wCAAkB;QAClC,IAAI,SAAS;QAEb,IAAI,OAAO,CAAC,SAAS,KAAK,mDACxB,OAAO;QAGT,MAAM,kBAAkB,wCAAkB,SAAS;QACnD,SAAS,gBAAgB,MAAM;QAE/B,MAAM,sBAAsB,QAAQ,QAAQ,CAC1C,QACA,SAAS,gBAAgB,KAAK;QAEhC,UAAU,gBAAgB,KAAK;QAE/B,MAAM,kBAAkB,wCAAkB,SAAS;QACnD,SAAS,gBAAgB,MAAM;QAE/B,MAAM,cAAc,QAAQ,QAAQ,CAAC,QAAQ,SAAS,gBAAgB,KAAK;QAC3E,UAAU,gBAAgB,KAAK;QAE/B,IAAI,WAAW,QAAQ,MAAM,EAC3B,OAAO;QAGT,IACE,oBAAoB,MAAM,KAAK,qDAC/B,mBAAmB,CAAC,EAAE,KAAK,qDAC3B,YAAY,MAAM,KAAK,2CAEvB,OAAO;QAGT,MAAM,iBAAiB,sCAAgB;QACvC,IAAI,eAAe,OAAO,KAAK,KAAK,eAAe,OAAO,CAAC,MAAM,KAAK,IACpE,OAAO;QAGT,MAAM,kBAAkB,8BAAQ;QAChC,IAAI,CAAC,gBAAgB,MAAM,CAAC,eAAe,OAAO,GAChD,OAAO;QAGT,OAAO,CAAA,GAAA,wCAAO,EAAE,MAAM,CACpB,aACA,wCAAkB,UAClB,oBAAoB,QAAQ,CAAC;IAEjC,EAAE,OAAM;QACN,OAAO;IACT;AACF;AAEO,SAAS,0CACd,OAAe,EACf,OAAe,EACf,SAA8B;IAE9B,OAAO,2CAAqB,aACxB,0CAAgB,SAAS,SAAS,aAClC,0CAAoB,SAAS,SAAS;AAC5C","sources":["node_modules/inherits/inherits_browser.js","node_modules/has-symbols/index.js","node_modules/has-symbols/shams.js","node_modules/has-property-descriptors/index.js","node_modules/es-define-property/index.js","node_modules/has-tostringtag/shams.js","node_modules/readable-stream/readable-browser.js","node_modules/readable-stream/lib/_stream_readable.js","node_modules/process-nextick-args/index.js","node_modules/isarray/index.js","node_modules/readable-stream/lib/internal/streams/stream-browser.js","node_modules/readable-stream/node_modules/safe-buffer/index.js","node_modules/core-util-is/lib/util.js","node_modules/@parcel/node-resolver-core/lib/_empty.js","node_modules/readable-stream/lib/internal/streams/BufferList.js","node_modules/readable-stream/lib/internal/streams/destroy.js","node_modules/readable-stream/lib/_stream_duplex.js","node_modules/readable-stream/lib/_stream_writable.js","node_modules/util-deprecate/browser.js","node_modules/string_decoder/lib/string_decoder.js","node_modules/string_decoder/node_modules/safe-buffer/index.js","node_modules/readable-stream/lib/_stream_transform.js","node_modules/readable-stream/lib/_stream_passthrough.js","node_modules/sha.js/sha.js","node_modules/sha.js/hash.js","node_modules/safe-buffer/index.js","node_modules/to-buffer/index.js","node_modules/to-buffer/node_modules/isarray/index.js","node_modules/typed-array-buffer/index.js","node_modules/es-errors/type.js","node_modules/call-bound/index.js","node_modules/get-intrinsic/index.js","node_modules/es-object-atoms/index.js","node_modules/es-errors/index.js","node_modules/es-errors/eval.js","node_modules/es-errors/range.js","node_modules/es-errors/ref.js","node_modules/es-errors/syntax.js","node_modules/es-errors/uri.js","node_modules/math-intrinsics/abs.js","node_modules/math-intrinsics/floor.js","node_modules/math-intrinsics/max.js","node_modules/math-intrinsics/min.js","node_modules/math-intrinsics/pow.js","node_modules/math-intrinsics/round.js","node_modules/math-intrinsics/sign.js","node_modules/math-intrinsics/isNaN.js","node_modules/gopd/index.js","node_modules/gopd/gOPD.js","node_modules/get-proto/index.js","node_modules/get-proto/Reflect.getPrototypeOf.js","node_modules/get-proto/Object.getPrototypeOf.js","node_modules/dunder-proto/get.js","node_modules/call-bind-apply-helpers/index.js","node_modules/function-bind/index.js","node_modules/function-bind/implementation.js","node_modules/call-bind-apply-helpers/functionCall.js","node_modules/call-bind-apply-helpers/actualApply.js","node_modules/call-bind-apply-helpers/functionApply.js","node_modules/call-bind-apply-helpers/reflectApply.js","node_modules/hasown/index.js","node_modules/is-typed-array/index.js","node_modules/which-typed-array/index.js","node_modules/for-each/index.js","node_modules/is-callable/index.js","node_modules/available-typed-arrays/index.js","node_modules/possible-typed-array-names/index.js","node_modules/call-bind/index.js","node_modules/set-function-length/index.js","node_modules/define-data-property/index.js","node_modules/call-bind-apply-helpers/applyBind.js","node_modules/sha.js/sha1.js","node_modules/sha.js/sha224.js","node_modules/sha.js/sha256.js","node_modules/sha.js/sha384.js","node_modules/sha.js/sha512.js","node_modules/secp256k1/lib/index.js","node_modules/secp256k1/lib/assert.js","node_modules/secp256k1/lib/der.js","node_modules/bip66/index.js","node_modules/secp256k1/lib/messages.json","node_modules/secp256k1/lib/elliptic/index.js","node_modules/create-hash/browser.js","node_modules/md5.js/index.js","node_modules/hash-base/index.js","node_modules/hash-base/to-buffer.js","node_modules/ripemd160/index.js","node_modules/sha.js/index.js","node_modules/cipher-base/index.js","node_modules/bn.js/lib/bn.js","node_modules/elliptic/lib/elliptic.js","node_modules/elliptic/package.json","node_modules/elliptic/lib/elliptic/utils.js","node_modules/minimalistic-assert/index.js","node_modules/minimalistic-crypto-utils/lib/utils.js","node_modules/brorand/index.js","node_modules/elliptic/lib/elliptic/curve/index.js","node_modules/elliptic/lib/elliptic/curve/base.js","node_modules/elliptic/lib/elliptic/curve/short.js","node_modules/elliptic/lib/elliptic/curve/mont.js","node_modules/elliptic/lib/elliptic/curve/edwards.js","node_modules/elliptic/lib/elliptic/curves.js","node_modules/hash.js/lib/hash.js","node_modules/hash.js/lib/hash/utils.js","node_modules/hash.js/lib/hash/common.js","node_modules/hash.js/lib/hash/sha.js","node_modules/hash.js/lib/hash/sha/1.js","node_modules/hash.js/lib/hash/sha/common.js","node_modules/hash.js/lib/hash/sha/224.js","node_modules/hash.js/lib/hash/sha/256.js","node_modules/hash.js/lib/hash/sha/384.js","node_modules/hash.js/lib/hash/sha/512.js","node_modules/hash.js/lib/hash/ripemd.js","node_modules/hash.js/lib/hash/hmac.js","node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js","node_modules/elliptic/lib/elliptic/ec/index.js","node_modules/hmac-drbg/lib/hmac-drbg.js","node_modules/elliptic/lib/elliptic/ec/key.js","node_modules/elliptic/lib/elliptic/ec/signature.js","node_modules/elliptic/lib/elliptic/eddsa/index.js","node_modules/elliptic/lib/elliptic/eddsa/key.js","node_modules/elliptic/lib/elliptic/eddsa/signature.js","index.ts","node_modules/bech32/dist/index.js","node_modules/bitcoinjs-message/index.js","node_modules/bs58check/index.js","node_modules/bs58check/base.js","node_modules/bs58/index.js","node_modules/base-x/src/index.js","node_modules/bitcoinjs-message/node_modules/bech32/index.js","node_modules/buffer-equals/index.js","node_modules/secp256k1/elliptic.js","node_modules/varuint-bitcoin/index.js","node_modules/@noble/post-quantum/ml-dsa.js","node_modules/@noble/post-quantum/src/ml-dsa.ts","node_modules/@noble/curves/utils.js","node_modules/@noble/curves/src/utils.ts","node_modules/@noble/hashes/utils.js","node_modules/@noble/hashes/src/utils.ts","node_modules/@noble/hashes/sha3.js","node_modules/@noble/hashes/src/sha3.ts","node_modules/@noble/hashes/_u64.js","node_modules/@noble/hashes/src/_u64.ts","node_modules/@noble/post-quantum/_crystals.js","node_modules/@noble/post-quantum/src/_crystals.ts","node_modules/@noble/curves/abstract/fft.js","node_modules/@noble/curves/src/abstract/fft.ts","node_modules/@noble/post-quantum/utils.js","node_modules/@noble/post-quantum/src/utils.ts"],"sourcesContent":["if (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: false,\n writable: true,\n configurable: true\n }\n })\n }\n };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n var TempCtor = function () {}\n TempCtor.prototype = superCtor.prototype\n ctor.prototype = new TempCtor()\n ctor.prototype.constructor = ctor\n }\n }\n}\n","'use strict';\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = require('./shams');\n\n/** @type {import('.')} */\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n","'use strict';\n\n/** @type {import('./shams')} */\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\t/** @type {{ [k in symbol]?: unknown }} */\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (var _ in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\t// eslint-disable-next-line no-extra-parens\n\t\tvar descriptor = /** @type {PropertyDescriptor} */ (Object.getOwnPropertyDescriptor(obj, sym));\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n","'use strict';\n\nvar $defineProperty = require('es-define-property');\n\nvar hasPropertyDescriptors = function hasPropertyDescriptors() {\n\treturn !!$defineProperty;\n};\n\nhasPropertyDescriptors.hasArrayLengthDefineBug = function hasArrayLengthDefineBug() {\n\t// node v0.6 has a bug where array lengths can be Set but not Defined\n\tif (!$defineProperty) {\n\t\treturn null;\n\t}\n\ttry {\n\t\treturn $defineProperty([], 'length', { value: 1 }).length !== 1;\n\t} catch (e) {\n\t\t// In Firefox 4-22, defining length on an array throws an exception.\n\t\treturn true;\n\t}\n};\n\nmodule.exports = hasPropertyDescriptors;\n","'use strict';\n\n/** @type {import('.')} */\nvar $defineProperty = Object.defineProperty || false;\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = false;\n\t}\n}\n\nmodule.exports = $defineProperty;\n","'use strict';\n\nvar hasSymbols = require('has-symbols/shams');\n\n/** @type {import('.')} */\nmodule.exports = function hasToStringTagShams() {\n\treturn hasSymbols() && !!Symbol.toStringTag;\n};\n","exports = module.exports = require('./lib/_stream_readable.js');\nexports.Stream = exports;\nexports.Readable = exports;\nexports.Writable = require('./lib/_stream_writable.js');\nexports.Duplex = require('./lib/_stream_duplex.js');\nexports.Transform = require('./lib/_stream_transform.js');\nexports.PassThrough = require('./lib/_stream_passthrough.js');\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\n/*<replacement>*/\n\nvar pna = require('process-nextick-args');\n/*</replacement>*/\n\nmodule.exports = Readable;\n\n/*<replacement>*/\nvar isArray = require('isarray');\n/*</replacement>*/\n\n/*<replacement>*/\nvar Duplex;\n/*</replacement>*/\n\nReadable.ReadableState = ReadableState;\n\n/*<replacement>*/\nvar EE = require('events').EventEmitter;\n\nvar EElistenerCount = function (emitter, type) {\n return emitter.listeners(type).length;\n};\n/*</replacement>*/\n\n/*<replacement>*/\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\n/*<replacement>*/\n\nvar Buffer = require('safe-buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\n/*</replacement>*/\n\n/*<replacement>*/\nvar util = Object.create(require('core-util-is'));\nutil.inherits = require('inherits');\n/*</replacement>*/\n\n/*<replacement>*/\nvar debugUtil = require('util');\nvar debug = void 0;\nif (debugUtil && debugUtil.debuglog) {\n debug = debugUtil.debuglog('stream');\n} else {\n debug = function () {};\n}\n/*</replacement>*/\n\nvar BufferList = require('./internal/streams/BufferList');\nvar destroyImpl = require('./internal/streams/destroy');\nvar StringDecoder;\n\nutil.inherits(Readable, Stream);\n\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\n\nfunction prependListener(emitter, event, fn) {\n // Sadly this is not cacheable as some libraries bundle their own\n // event emitter implementation with them.\n if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn);\n\n // This is a hack to make sure that our error handler is attached before any\n // userland ones. NEVER DO THIS. This is here only because this code needs\n // to continue to work with older versions of Node.js that do not include\n // the prependListener() method. The goal is to eventually remove this hack.\n if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\n\nfunction ReadableState(options, stream) {\n Duplex = Duplex || require('./_stream_duplex');\n\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n var isDuplex = stream instanceof Duplex;\n\n // object stream flag. Used to make read(n) ignore n and to\n // make all the buffer merging and length checks go away\n this.objectMode = !!options.objectMode;\n\n if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode;\n\n // the point at which it stops calling _read() to fill the buffer\n // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n var hwm = options.highWaterMark;\n var readableHwm = options.readableHighWaterMark;\n var defaultHwm = this.objectMode ? 16 : 16 * 1024;\n\n if (hwm || hwm === 0) this.highWaterMark = hwm;else if (isDuplex && (readableHwm || readableHwm === 0)) this.highWaterMark = readableHwm;else this.highWaterMark = defaultHwm;\n\n // cast to ints.\n this.highWaterMark = Math.floor(this.highWaterMark);\n\n // A linked list is used to store data chunks instead of an array because the\n // linked list can remove elements from the beginning faster than\n // array.shift()\n this.buffer = new BufferList();\n this.length = 0;\n this.pipes = null;\n this.pipesCount = 0;\n this.flowing = null;\n this.ended = false;\n this.endEmitted = false;\n this.reading = false;\n\n // a flag to be able to tell if the event 'readable'/'data' is emitted\n // immediately, or on a later tick. We set this to true at first, because\n // any actions that shouldn't happen until \"later\" should generally also\n // not happen before the first read call.\n this.sync = true;\n\n // whenever we return null, then we set a flag to say\n // that we're awaiting a 'readable' event emission.\n this.needReadable = false;\n this.emittedReadable = false;\n this.readableListening = false;\n this.resumeScheduled = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // the number of writers that are awaiting a drain event in .pipe()s\n this.awaitDrain = 0;\n\n // if true, a maybeReadMore has been scheduled\n this.readingMore = false;\n\n this.decoder = null;\n this.encoding = null;\n if (options.encoding) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this.decoder = new StringDecoder(options.encoding);\n this.encoding = options.encoding;\n }\n}\n\nfunction Readable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n\n if (!(this instanceof Readable)) return new Readable(options);\n\n this._readableState = new ReadableState(options, this);\n\n // legacy\n this.readable = true;\n\n if (options) {\n if (typeof options.read === 'function') this._read = options.read;\n\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n }\n\n Stream.call(this);\n}\n\nObject.defineProperty(Readable.prototype, 'destroyed', {\n get: function () {\n if (this._readableState === undefined) {\n return false;\n }\n return this._readableState.destroyed;\n },\n set: function (value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._readableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n }\n});\n\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\nReadable.prototype._destroy = function (err, cb) {\n this.push(null);\n cb(err);\n};\n\n// Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\nReadable.prototype.push = function (chunk, encoding) {\n var state = this._readableState;\n var skipChunkCheck;\n\n if (!state.objectMode) {\n if (typeof chunk === 'string') {\n encoding = encoding || state.defaultEncoding;\n if (encoding !== state.encoding) {\n chunk = Buffer.from(chunk, encoding);\n encoding = '';\n }\n skipChunkCheck = true;\n }\n } else {\n skipChunkCheck = true;\n }\n\n return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n};\n\n// Unshift should *always* be something directly out of read()\nReadable.prototype.unshift = function (chunk) {\n return readableAddChunk(this, chunk, null, true, false);\n};\n\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n var state = stream._readableState;\n if (chunk === null) {\n state.reading = false;\n onEofChunk(stream, state);\n } else {\n var er;\n if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n if (er) {\n stream.emit('error', er);\n } else if (state.objectMode || chunk && chunk.length > 0) {\n if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n\n if (addToFront) {\n if (state.endEmitted) stream.emit('error', new Error('stream.unshift() after end event'));else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n stream.emit('error', new Error('stream.push() after EOF'));\n } else {\n state.reading = false;\n if (state.decoder && !encoding) {\n chunk = state.decoder.write(chunk);\n if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n } else {\n addChunk(stream, state, chunk, false);\n }\n }\n } else if (!addToFront) {\n state.reading = false;\n }\n }\n\n return needMoreData(state);\n}\n\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n stream.emit('data', chunk);\n stream.read(0);\n } else {\n // update the buffer info.\n state.length += state.objectMode ? 1 : chunk.length;\n if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n\n if (state.needReadable) emitReadable(stream);\n }\n maybeReadMore(stream, state);\n}\n\nfunction chunkInvalid(state, chunk) {\n var er;\n if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new TypeError('Invalid non-string/buffer chunk');\n }\n return er;\n}\n\n// if it's past the high water mark, we can push in some more.\n// Also, if we have no data yet, we can stand some\n// more bytes. This is to work around cases where hwm=0,\n// such as the repl. Also, if the push() triggered a\n// readable event, and the user called read(largeNumber) such that\n// needReadable was set, then we ought to push more, so that another\n// 'readable' event will be triggered.\nfunction needMoreData(state) {\n return !state.ended && (state.needReadable || state.length < state.highWaterMark || state.length === 0);\n}\n\nReadable.prototype.isPaused = function () {\n return this._readableState.flowing === false;\n};\n\n// backwards compatibility.\nReadable.prototype.setEncoding = function (enc) {\n if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n this._readableState.decoder = new StringDecoder(enc);\n this._readableState.encoding = enc;\n return this;\n};\n\n// Don't raise the hwm > 8MB\nvar MAX_HWM = 0x800000;\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n n = MAX_HWM;\n } else {\n // Get the next highest power of 2 to prevent increasing hwm excessively in\n // tiny amounts\n n--;\n n |= n >>> 1;\n n |= n >>> 2;\n n |= n >>> 4;\n n |= n >>> 8;\n n |= n >>> 16;\n n++;\n }\n return n;\n}\n\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction howMuchToRead(n, state) {\n if (n <= 0 || state.length === 0 && state.ended) return 0;\n if (state.objectMode) return 1;\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n }\n // If we're asking for more than the current hwm, then raise the hwm.\n if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n;\n // Don't have enough\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n return state.length;\n}\n\n// you can override either this method, or the async _read(n) below.\nReadable.prototype.read = function (n) {\n debug('read', n);\n n = parseInt(n, 10);\n var state = this._readableState;\n var nOrig = n;\n\n if (n !== 0) state.emittedReadable = false;\n\n // if we're doing read(0) to trigger a readable event, but we\n // already have a bunch of data in the buffer, then just trigger\n // the 'readable' event and move on.\n if (n === 0 && state.needReadable && (state.length >= state.highWaterMark || state.ended)) {\n debug('read: emitReadable', state.length, state.ended);\n if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n return null;\n }\n\n n = howMuchToRead(n, state);\n\n // if we've ended, and we're now clear, then finish it up.\n if (n === 0 && state.ended) {\n if (state.length === 0) endReadable(this);\n return null;\n }\n\n // All the actual chunk generation logic needs to be\n // *below* the call to _read. The reason is that in certain\n // synthetic stream cases, such as passthrough streams, _read\n // may be a completely synchronous operation which may change\n // the state of the read buffer, providing enough data when\n // before there was *not* enough.\n //\n // So, the steps are:\n // 1. Figure out what the state of things will be after we do\n // a read from the buffer.\n //\n // 2. If that resulting state will trigger a _read, then call _read.\n // Note that this may be asynchronous, or synchronous. Yes, it is\n // deeply ugly to write APIs this way, but that still doesn't mean\n // that the Readable class should behave improperly, as streams are\n // designed to be sync/async agnostic.\n // Take note if the _read call is sync or async (ie, if the read call\n // has returned yet), so that we know whether or not it's safe to emit\n // 'readable' etc.\n //\n // 3. Actually pull the requested chunks out of the buffer and return.\n\n // if we need a readable event, then we need to do some reading.\n var doRead = state.needReadable;\n debug('need readable', doRead);\n\n // if we currently have less than the highWaterMark, then also read some\n if (state.length === 0 || state.length - n < state.highWaterMark) {\n doRead = true;\n debug('length less than watermark', doRead);\n }\n\n // however, if we've ended, then there's no point, and if we're already\n // reading, then it's unnecessary.\n if (state.ended || state.reading) {\n doRead = false;\n debug('reading or ended', doRead);\n } else if (doRead) {\n debug('do read');\n state.reading = true;\n state.sync = true;\n // if the length is currently zero, then we *need* a readable event.\n if (state.length === 0) state.needReadable = true;\n // call internal read method\n this._read(state.highWaterMark);\n state.sync = false;\n // If _read pushed data synchronously, then `reading` will be false,\n // and we need to re-evaluate how much data we can return to the user.\n if (!state.reading) n = howMuchToRead(nOrig, state);\n }\n\n var ret;\n if (n > 0) ret = fromList(n, state);else ret = null;\n\n if (ret === null) {\n state.needReadable = true;\n n = 0;\n } else {\n state.length -= n;\n }\n\n if (state.length === 0) {\n // If we have nothing in the buffer, then we want to know\n // as soon as we *do* get something into the buffer.\n if (!state.ended) state.needReadable = true;\n\n // If we tried to read() past the EOF, then emit end on the next tick.\n if (nOrig !== n && state.ended) endReadable(this);\n }\n\n if (ret !== null) this.emit('data', ret);\n\n return ret;\n};\n\nfunction onEofChunk(stream, state) {\n if (state.ended) return;\n if (state.decoder) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) {\n state.buffer.push(chunk);\n state.length += state.objectMode ? 1 : chunk.length;\n }\n }\n state.ended = true;\n\n // emit 'readable' now to make sure it gets picked up.\n emitReadable(stream);\n}\n\n// Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow. This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\nfunction emitReadable(stream) {\n var state = stream._readableState;\n state.needReadable = false;\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n if (state.sync) pna.nextTick(emitReadable_, stream);else emitReadable_(stream);\n }\n}\n\nfunction emitReadable_(stream) {\n debug('emit readable');\n stream.emit('readable');\n flow(stream);\n}\n\n// at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data. that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\nfunction maybeReadMore(stream, state) {\n if (!state.readingMore) {\n state.readingMore = true;\n pna.nextTick(maybeReadMore_, stream, state);\n }\n}\n\nfunction maybeReadMore_(stream, state) {\n var len = state.length;\n while (!state.reading && !state.flowing && !state.ended && state.length < state.highWaterMark) {\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length)\n // didn't get any data, stop spinning.\n break;else len = state.length;\n }\n state.readingMore = false;\n}\n\n// abstract method. to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\nReadable.prototype._read = function (n) {\n this.emit('error', new Error('_read() is not implemented'));\n};\n\nReadable.prototype.pipe = function (dest, pipeOpts) {\n var src = this;\n var state = this._readableState;\n\n switch (state.pipesCount) {\n case 0:\n state.pipes = dest;\n break;\n case 1:\n state.pipes = [state.pipes, dest];\n break;\n default:\n state.pipes.push(dest);\n break;\n }\n state.pipesCount += 1;\n debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n\n var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n\n var endFn = doEnd ? onend : unpipe;\n if (state.endEmitted) pna.nextTick(endFn);else src.once('end', endFn);\n\n dest.on('unpipe', onunpipe);\n function onunpipe(readable, unpipeInfo) {\n debug('onunpipe');\n if (readable === src) {\n if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n unpipeInfo.hasUnpiped = true;\n cleanup();\n }\n }\n }\n\n function onend() {\n debug('onend');\n dest.end();\n }\n\n // when the dest drains, it reduces the awaitDrain counter\n // on the source. This would be more elegant with a .once()\n // handler in flow(), but adding and removing repeatedly is\n // too slow.\n var ondrain = pipeOnDrain(src);\n dest.on('drain', ondrain);\n\n var cleanedUp = false;\n function cleanup() {\n debug('cleanup');\n // cleanup event handlers once the pipe is broken\n dest.removeListener('close', onclose);\n dest.removeListener('finish', onfinish);\n dest.removeListener('drain', ondrain);\n dest.removeListener('error', onerror);\n dest.removeListener('unpipe', onunpipe);\n src.removeListener('end', onend);\n src.removeListener('end', unpipe);\n src.removeListener('data', ondata);\n\n cleanedUp = true;\n\n // if the reader is waiting for a drain event from this\n // specific writer, then it would cause it to never start\n // flowing again.\n // So, if this is awaiting a drain, then we just call it now.\n // If we don't know, then assume that we are waiting for one.\n if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n }\n\n // If the user pushes more data while we're writing to dest then we'll end up\n // in ondata again. However, we only want to increase awaitDrain once because\n // dest will only emit one 'drain' event for the multiple writes.\n // => Introduce a guard on increasing awaitDrain.\n var increasedAwaitDrain = false;\n src.on('data', ondata);\n function ondata(chunk) {\n debug('ondata');\n increasedAwaitDrain = false;\n var ret = dest.write(chunk);\n if (false === ret && !increasedAwaitDrain) {\n // If the user unpiped during `dest.write()`, it is possible\n // to get stuck in a permanently paused state if that write\n // also returned false.\n // => Check whether `dest` is still a piping destination.\n if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n debug('false write response, pause', state.awaitDrain);\n state.awaitDrain++;\n increasedAwaitDrain = true;\n }\n src.pause();\n }\n }\n\n // if the dest has an error, then stop piping into it.\n // however, don't suppress the throwing behavior for this.\n function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) dest.emit('error', er);\n }\n\n // Make sure our error handler is attached before userland ones.\n prependListener(dest, 'error', onerror);\n\n // Both close and finish should trigger unpipe, but only once.\n function onclose() {\n dest.removeListener('finish', onfinish);\n unpipe();\n }\n dest.once('close', onclose);\n function onfinish() {\n debug('onfinish');\n dest.removeListener('close', onclose);\n unpipe();\n }\n dest.once('finish', onfinish);\n\n function unpipe() {\n debug('unpipe');\n src.unpipe(dest);\n }\n\n // tell the dest that it's being piped to\n dest.emit('pipe', src);\n\n // start the flow if it hasn't been started already.\n if (!state.flowing) {\n debug('pipe resume');\n src.resume();\n }\n\n return dest;\n};\n\nfunction pipeOnDrain(src) {\n return function () {\n var state = src._readableState;\n debug('pipeOnDrain', state.awaitDrain);\n if (state.awaitDrain) state.awaitDrain--;\n if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n state.flowing = true;\n flow(src);\n }\n };\n}\n\nReadable.prototype.unpipe = function (dest) {\n var state = this._readableState;\n var unpipeInfo = { hasUnpiped: false };\n\n // if we're not piping anywhere, then do nothing.\n if (state.pipesCount === 0) return this;\n\n // just one destination. most common case.\n if (state.pipesCount === 1) {\n // passed in one, but it's not the right one.\n if (dest && dest !== state.pipes) return this;\n\n if (!dest) dest = state.pipes;\n\n // got a match.\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n if (dest) dest.emit('unpipe', this, unpipeInfo);\n return this;\n }\n\n // slow case. multiple pipe destinations.\n\n if (!dest) {\n // remove all.\n var dests = state.pipes;\n var len = state.pipesCount;\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n\n for (var i = 0; i < len; i++) {\n dests[i].emit('unpipe', this, { hasUnpiped: false });\n }return this;\n }\n\n // try to find the right one.\n var index = indexOf(state.pipes, dest);\n if (index === -1) return this;\n\n state.pipes.splice(index, 1);\n state.pipesCount -= 1;\n if (state.pipesCount === 1) state.pipes = state.pipes[0];\n\n dest.emit('unpipe', this, unpipeInfo);\n\n return this;\n};\n\n// set up data events if they are asked for\n// Ensure readable listeners eventually get something\nReadable.prototype.on = function (ev, fn) {\n var res = Stream.prototype.on.call(this, ev, fn);\n\n if (ev === 'data') {\n // Start flowing on next tick if stream isn't explicitly paused\n if (this._readableState.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n var state = this._readableState;\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.emittedReadable = false;\n if (!state.reading) {\n pna.nextTick(nReadingNextTick, this);\n } else if (state.length) {\n emitReadable(this);\n }\n }\n }\n\n return res;\n};\nReadable.prototype.addListener = Readable.prototype.on;\n\nfunction nReadingNextTick(self) {\n debug('readable nexttick read 0');\n self.read(0);\n}\n\n// pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\nReadable.prototype.resume = function () {\n var state = this._readableState;\n if (!state.flowing) {\n debug('resume');\n state.flowing = true;\n resume(this, state);\n }\n return this;\n};\n\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n pna.nextTick(resume_, stream, state);\n }\n}\n\nfunction resume_(stream, state) {\n if (!state.reading) {\n debug('resume read 0');\n stream.read(0);\n }\n\n state.resumeScheduled = false;\n state.awaitDrain = 0;\n stream.emit('resume');\n flow(stream);\n if (state.flowing && !state.reading) stream.read(0);\n}\n\nReadable.prototype.pause = function () {\n debug('call pause flowing=%j', this._readableState.flowing);\n if (false !== this._readableState.flowing) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n return this;\n};\n\nfunction flow(stream) {\n var state = stream._readableState;\n debug('flow', state.flowing);\n while (state.flowing && stream.read() !== null) {}\n}\n\n// wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\nReadable.prototype.wrap = function (stream) {\n var _this = this;\n\n var state = this._readableState;\n var paused = false;\n\n stream.on('end', function () {\n debug('wrapped end');\n if (state.decoder && !state.ended) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) _this.push(chunk);\n }\n\n _this.push(null);\n });\n\n stream.on('data', function (chunk) {\n debug('wrapped data');\n if (state.decoder) chunk = state.decoder.write(chunk);\n\n // don't skip over falsy values in objectMode\n if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n\n var ret = _this.push(chunk);\n if (!ret) {\n paused = true;\n stream.pause();\n }\n });\n\n // proxy all the other methods.\n // important when wrapping filters and duplexes.\n for (var i in stream) {\n if (this[i] === undefined && typeof stream[i] === 'function') {\n this[i] = function (method) {\n return function () {\n return stream[method].apply(stream, arguments);\n };\n }(i);\n }\n }\n\n // proxy certain important events.\n for (var n = 0; n < kProxyEvents.length; n++) {\n stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n }\n\n // when we try to consume some more bytes, simply unpause the\n // underlying stream.\n this._read = function (n) {\n debug('wrapped _read', n);\n if (paused) {\n paused = false;\n stream.resume();\n }\n };\n\n return this;\n};\n\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function () {\n return this._readableState.highWaterMark;\n }\n});\n\n// exposed for testing purposes only.\nReadable._fromList = fromList;\n\n// Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction fromList(n, state) {\n // nothing buffered\n if (state.length === 0) return null;\n\n var ret;\n if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n // read it all, truncate the list\n if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.head.data;else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = fromListPartial(n, state.buffer, state.decoder);\n }\n\n return ret;\n}\n\n// Extracts only enough buffered data to satisfy the amount requested.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction fromListPartial(n, list, hasStrings) {\n var ret;\n if (n < list.head.data.length) {\n // slice is the same for buffers and strings\n ret = list.head.data.slice(0, n);\n list.head.data = list.head.data.slice(n);\n } else if (n === list.head.data.length) {\n // first chunk is a perfect match\n ret = list.shift();\n } else {\n // result spans more than one buffer\n ret = hasStrings ? copyFromBufferString(n, list) : copyFromBuffer(n, list);\n }\n return ret;\n}\n\n// Copies a specified amount of characters from the list of buffered data\n// chunks.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction copyFromBufferString(n, list) {\n var p = list.head;\n var c = 1;\n var ret = p.data;\n n -= ret.length;\n while (p = p.next) {\n var str = p.data;\n var nb = n > str.length ? str.length : n;\n if (nb === str.length) ret += str;else ret += str.slice(0, n);\n n -= nb;\n if (n === 0) {\n if (nb === str.length) {\n ++c;\n if (p.next) list.head = p.next;else list.head = list.tail = null;\n } else {\n list.head = p;\n p.data = str.slice(nb);\n }\n break;\n }\n ++c;\n }\n list.length -= c;\n return ret;\n}\n\n// Copies a specified amount of bytes from the list of buffered data chunks.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction copyFromBuffer(n, list) {\n var ret = Buffer.allocUnsafe(n);\n var p = list.head;\n var c = 1;\n p.data.copy(ret);\n n -= p.data.length;\n while (p = p.next) {\n var buf = p.data;\n var nb = n > buf.length ? buf.length : n;\n buf.copy(ret, ret.length - n, 0, nb);\n n -= nb;\n if (n === 0) {\n if (nb === buf.length) {\n ++c;\n if (p.next) list.head = p.next;else list.head = list.tail = null;\n } else {\n list.head = p;\n p.data = buf.slice(nb);\n }\n break;\n }\n ++c;\n }\n list.length -= c;\n return ret;\n}\n\nfunction endReadable(stream) {\n var state = stream._readableState;\n\n // If we get here before consuming all the bytes, then that is a\n // bug in node. Should never happen.\n if (state.length > 0) throw new Error('\"endReadable()\" called on non-empty stream');\n\n if (!state.endEmitted) {\n state.ended = true;\n pna.nextTick(endReadableNT, state, stream);\n }\n}\n\nfunction endReadableNT(state, stream) {\n // Check that we didn't get one last unshift.\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n }\n}\n\nfunction indexOf(xs, x) {\n for (var i = 0, l = xs.length; i < l; i++) {\n if (xs[i] === x) return i;\n }\n return -1;\n}","'use strict';\n\nif (typeof process === 'undefined' ||\n !process.version ||\n process.version.indexOf('v0.') === 0 ||\n process.version.indexOf('v1.') === 0 && process.version.indexOf('v1.8.') !== 0) {\n module.exports = { nextTick: nextTick };\n} else {\n module.exports = process\n}\n\nfunction nextTick(fn, arg1, arg2, arg3) {\n if (typeof fn !== 'function') {\n throw new TypeError('\"callback\" argument must be a function');\n }\n var len = arguments.length;\n var args, i;\n switch (len) {\n case 0:\n case 1:\n return process.nextTick(fn);\n case 2:\n return process.nextTick(function afterTickOne() {\n fn.call(null, arg1);\n });\n case 3:\n return process.nextTick(function afterTickTwo() {\n fn.call(null, arg1, arg2);\n });\n case 4:\n return process.nextTick(function afterTickThree() {\n fn.call(null, arg1, arg2, arg3);\n });\n default:\n args = new Array(len - 1);\n i = 0;\n while (i < args.length) {\n args[i++] = arguments[i];\n }\n return process.nextTick(function afterTick() {\n fn.apply(null, args);\n });\n }\n}\n\n","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};\n","module.exports = require('events').EventEmitter;\n","/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\n\nfunction isArray(arg) {\n if (Array.isArray) {\n return Array.isArray(arg);\n }\n return objectToString(arg) === '[object Array]';\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n return objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n return objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\n\nfunction isError(e) {\n return (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\n\nfunction isFunction(arg) {\n return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n return arg === null ||\n typeof arg === 'boolean' ||\n typeof arg === 'number' ||\n typeof arg === 'string' ||\n typeof arg === 'symbol' || // ES6 symbol\n typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = require('buffer').Buffer.isBuffer;\n\nfunction objectToString(o) {\n return Object.prototype.toString.call(o);\n}\n","\"use strict\";","'use strict';\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nvar Buffer = require('safe-buffer').Buffer;\nvar util = require('util');\n\nfunction copyBuffer(src, target, offset) {\n src.copy(target, offset);\n}\n\nmodule.exports = function () {\n function BufferList() {\n _classCallCheck(this, BufferList);\n\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n\n BufferList.prototype.push = function push(v) {\n var entry = { data: v, next: null };\n if (this.length > 0) this.tail.next = entry;else this.head = entry;\n this.tail = entry;\n ++this.length;\n };\n\n BufferList.prototype.unshift = function unshift(v) {\n var entry = { data: v, next: this.head };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n };\n\n BufferList.prototype.shift = function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n --this.length;\n return ret;\n };\n\n BufferList.prototype.clear = function clear() {\n this.head = this.tail = null;\n this.length = 0;\n };\n\n BufferList.prototype.join = function join(s) {\n if (this.length === 0) return '';\n var p = this.head;\n var ret = '' + p.data;\n while (p = p.next) {\n ret += s + p.data;\n }return ret;\n };\n\n BufferList.prototype.concat = function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n return ret;\n };\n\n return BufferList;\n}();\n\nif (util && util.inspect && util.inspect.custom) {\n module.exports.prototype[util.inspect.custom] = function () {\n var obj = util.inspect({ length: this.length });\n return this.constructor.name + ' ' + obj;\n };\n}","'use strict';\n\n/*<replacement>*/\n\nvar pna = require('process-nextick-args');\n/*</replacement>*/\n\n// undocumented cb() API, needed for core, not for public API\nfunction destroy(err, cb) {\n var _this = this;\n\n var readableDestroyed = this._readableState && this._readableState.destroyed;\n var writableDestroyed = this._writableState && this._writableState.destroyed;\n\n if (readableDestroyed || writableDestroyed) {\n if (cb) {\n cb(err);\n } else if (err) {\n if (!this._writableState) {\n pna.nextTick(emitErrorNT, this, err);\n } else if (!this._writableState.errorEmitted) {\n this._writableState.errorEmitted = true;\n pna.nextTick(emitErrorNT, this, err);\n }\n }\n\n return this;\n }\n\n // we set destroyed to true before firing error callbacks in order\n // to make it re-entrance safe in case destroy() is called within callbacks\n\n if (this._readableState) {\n this._readableState.destroyed = true;\n }\n\n // if this is a duplex stream mark the writable part as destroyed as well\n if (this._writableState) {\n this._writableState.destroyed = true;\n }\n\n this._destroy(err || null, function (err) {\n if (!cb && err) {\n if (!_this._writableState) {\n pna.nextTick(emitErrorNT, _this, err);\n } else if (!_this._writableState.errorEmitted) {\n _this._writableState.errorEmitted = true;\n pna.nextTick(emitErrorNT, _this, err);\n }\n } else if (cb) {\n cb(err);\n }\n });\n\n return this;\n}\n\nfunction undestroy() {\n if (this._readableState) {\n this._readableState.destroyed = false;\n this._readableState.reading = false;\n this._readableState.ended = false;\n this._readableState.endEmitted = false;\n }\n\n if (this._writableState) {\n this._writableState.destroyed = false;\n this._writableState.ended = false;\n this._writableState.ending = false;\n this._writableState.finalCalled = false;\n this._writableState.prefinished = false;\n this._writableState.finished = false;\n this._writableState.errorEmitted = false;\n }\n}\n\nfunction emitErrorNT(self, err) {\n self.emit('error', err);\n}\n\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n\n'use strict';\n\n/*<replacement>*/\n\nvar pna = require('process-nextick-args');\n/*</replacement>*/\n\n/*<replacement>*/\nvar objectKeys = Object.keys || function (obj) {\n var keys = [];\n for (var key in obj) {\n keys.push(key);\n }return keys;\n};\n/*</replacement>*/\n\nmodule.exports = Duplex;\n\n/*<replacement>*/\nvar util = Object.create(require('core-util-is'));\nutil.inherits = require('inherits');\n/*</replacement>*/\n\nvar Readable = require('./_stream_readable');\nvar Writable = require('./_stream_writable');\n\nutil.inherits(Duplex, Readable);\n\n{\n // avoid scope creep, the keys array can then be collected\n var keys = objectKeys(Writable.prototype);\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n }\n}\n\nfunction Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n\n Readable.call(this, options);\n Writable.call(this, options);\n\n if (options && options.readable === false) this.readable = false;\n\n if (options && options.writable === false) this.writable = false;\n\n this.allowHalfOpen = true;\n if (options && options.allowHalfOpen === false) this.allowHalfOpen = false;\n\n this.once('end', onend);\n}\n\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function () {\n return this._writableState.highWaterMark;\n }\n});\n\n// the no-half-open enforcer\nfunction onend() {\n // if we allow half-open state, or if the writable side ended,\n // then we're ok.\n if (this.allowHalfOpen || this._writableState.ended) return;\n\n // no more data can be written.\n // But allow more writes to happen in this tick.\n pna.nextTick(onEndNT, this);\n}\n\nfunction onEndNT(self) {\n self.end();\n}\n\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n get: function () {\n if (this._readableState === undefined || this._writableState === undefined) {\n return false;\n }\n return this._readableState.destroyed && this._writableState.destroyed;\n },\n set: function (value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (this._readableState === undefined || this._writableState === undefined) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n});\n\nDuplex.prototype._destroy = function (err, cb) {\n this.push(null);\n this.end();\n\n pna.nextTick(cb, err);\n};","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n\n'use strict';\n\n/*<replacement>*/\n\nvar pna = require('process-nextick-args');\n/*</replacement>*/\n\nmodule.exports = Writable;\n\n/* <replacement> */\nfunction WriteReq(chunk, encoding, cb) {\n this.chunk = chunk;\n this.encoding = encoding;\n this.callback = cb;\n this.next = null;\n}\n\n// It seems a linked list but it is not\n// there will be only 2 of these for each stream\nfunction CorkedRequest(state) {\n var _this = this;\n\n this.next = null;\n this.entry = null;\n this.finish = function () {\n onCorkedFinish(_this, state);\n };\n}\n/* </replacement> */\n\n/*<replacement>*/\nvar asyncWrite = !process.browser && ['v0.10', 'v0.9.'].indexOf(process.version.slice(0, 5)) > -1 ? setImmediate : pna.nextTick;\n/*</replacement>*/\n\n/*<replacement>*/\nvar Duplex;\n/*</replacement>*/\n\nWritable.WritableState = WritableState;\n\n/*<replacement>*/\nvar util = Object.create(require('core-util-is'));\nutil.inherits = require('inherits');\n/*</replacement>*/\n\n/*<replacement>*/\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/*</replacement>*/\n\n/*<replacement>*/\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\n/*<replacement>*/\n\nvar Buffer = require('safe-buffer').Buffer;\nvar OurUint8Array = (typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : typeof self !== 'undefined' ? self : {}).Uint8Array || function () {};\nfunction _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n}\nfunction _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\n/*</replacement>*/\n\nvar destroyImpl = require('./internal/streams/destroy');\n\nutil.inherits(Writable, Stream);\n\nfunction nop() {}\n\nfunction WritableState(options, stream) {\n Duplex = Duplex || require('./_stream_duplex');\n\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n var isDuplex = stream instanceof Duplex;\n\n // object stream flag to indicate whether or not this stream\n // contains buffers or objects.\n this.objectMode = !!options.objectMode;\n\n if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode;\n\n // the point at which write() starts returning false\n // Note: 0 is a valid value, means that we always return false if\n // the entire buffer is not flushed immediately on write()\n var hwm = options.highWaterMark;\n var writableHwm = options.writableHighWaterMark;\n var defaultHwm = this.objectMode ? 16 : 16 * 1024;\n\n if (hwm || hwm === 0) this.highWaterMark = hwm;else if (isDuplex && (writableHwm || writableHwm === 0)) this.highWaterMark = writableHwm;else this.highWaterMark = defaultHwm;\n\n // cast to ints.\n this.highWaterMark = Math.floor(this.highWaterMark);\n\n // if _final has been called\n this.finalCalled = false;\n\n // drain event flag.\n this.needDrain = false;\n // at the start of calling end()\n this.ending = false;\n // when end() has been called, and returned\n this.ended = false;\n // when 'finish' is emitted\n this.finished = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // should we decode strings into buffers before passing to _write?\n // this is here so that some node-core streams can optimize string\n // handling at a lower level.\n var noDecode = options.decodeStrings === false;\n this.decodeStrings = !noDecode;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || 'utf8';\n\n // not an actual buffer we keep track of, but a measurement\n // of how much we're waiting to get pushed to some underlying\n // socket or file.\n this.length = 0;\n\n // a flag to see when we're in the middle of a write.\n this.writing = false;\n\n // when true all writes will be buffered until .uncork() call\n this.corked = 0;\n\n // a flag to be able to tell if the onwrite cb is called immediately,\n // or on a later tick. We set this to true at first, because any\n // actions that shouldn't happen until \"later\" should generally also\n // not happen before the first write call.\n this.sync = true;\n\n // a flag to know if we're processing previously buffered items, which\n // may call the _write() callback in the same tick, so that we don't\n // end up in an overlapped onwrite situation.\n this.bufferProcessing = false;\n\n // the callback that's passed to _write(chunk,cb)\n this.onwrite = function (er) {\n onwrite(stream, er);\n };\n\n // the callback that the user supplies to write(chunk,encoding,cb)\n this.writecb = null;\n\n // the amount that is being written when _write is called.\n this.writelen = 0;\n\n this.bufferedRequest = null;\n this.lastBufferedRequest = null;\n\n // number of pending user-supplied write callbacks\n // this must be 0 before 'finish' can be emitted\n this.pendingcb = 0;\n\n // emit prefinish if the only thing we're waiting for is _write cbs\n // This is relevant for synchronous Transform streams\n this.prefinished = false;\n\n // True if the error was already emitted and should not be thrown again\n this.errorEmitted = false;\n\n // count buffered requests\n this.bufferedRequestCount = 0;\n\n // allocate the first CorkedRequest, there is always\n // one allocated and free to use, and we maintain at most two\n this.corkedRequestsFree = new CorkedRequest(this);\n}\n\nWritableState.prototype.getBuffer = function getBuffer() {\n var current = this.bufferedRequest;\n var out = [];\n while (current) {\n out.push(current);\n current = current.next;\n }\n return out;\n};\n\n(function () {\n try {\n Object.defineProperty(WritableState.prototype, 'buffer', {\n get: internalUtil.deprecate(function () {\n return this.getBuffer();\n }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n });\n } catch (_) {}\n})();\n\n// Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\nvar realHasInstance;\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n realHasInstance = Function.prototype[Symbol.hasInstance];\n Object.defineProperty(Writable, Symbol.hasInstance, {\n value: function (object) {\n if (realHasInstance.call(this, object)) return true;\n if (this !== Writable) return false;\n\n return object && object._writableState instanceof WritableState;\n }\n });\n} else {\n realHasInstance = function (object) {\n return object instanceof this;\n };\n}\n\nfunction Writable(options) {\n Duplex = Duplex || require('./_stream_duplex');\n\n // Writable ctor is applied to Duplexes, too.\n // `realHasInstance` is necessary because using plain `instanceof`\n // would return false, as no `_writableState` property is attached.\n\n // Trying to use the custom `instanceof` for Writable here will also break the\n // Node.js LazyTransform implementation, which has a non-trivial getter for\n // `_writableState` that would lead to infinite recursion.\n if (!realHasInstance.call(Writable, this) && !(this instanceof Duplex)) {\n return new Writable(options);\n }\n\n this._writableState = new WritableState(options, this);\n\n // legacy.\n this.writable = true;\n\n if (options) {\n if (typeof options.write === 'function') this._write = options.write;\n\n if (typeof options.writev === 'function') this._writev = options.writev;\n\n if (typeof options.destroy === 'function') this._destroy = options.destroy;\n\n if (typeof options.final === 'function') this._final = options.final;\n }\n\n Stream.call(this);\n}\n\n// Otherwise people can pipe Writable streams, which is just wrong.\nWritable.prototype.pipe = function () {\n this.emit('error', new Error('Cannot pipe, not readable'));\n};\n\nfunction writeAfterEnd(stream, cb) {\n var er = new Error('write after end');\n // TODO: defer error events consistently everywhere, not just the cb\n stream.emit('error', er);\n pna.nextTick(cb, er);\n}\n\n// Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\nfunction validChunk(stream, state, chunk, cb) {\n var valid = true;\n var er = false;\n\n if (chunk === null) {\n er = new TypeError('May not write null values to stream');\n } else if (typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n er = new TypeError('Invalid non-string/buffer chunk');\n }\n if (er) {\n stream.emit('error', er);\n pna.nextTick(cb, er);\n valid = false;\n }\n return valid;\n}\n\nWritable.prototype.write = function (chunk, encoding, cb) {\n var state = this._writableState;\n var ret = false;\n var isBuf = !state.objectMode && _isUint8Array(chunk);\n\n if (isBuf && !Buffer.isBuffer(chunk)) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n\n if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n\n if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n\n if (typeof cb !== 'function') cb = nop;\n\n if (state.ended) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n state.pendingcb++;\n ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n }\n\n return ret;\n};\n\nWritable.prototype.cork = function () {\n var state = this._writableState;\n\n state.corked++;\n};\n\nWritable.prototype.uncork = function () {\n var state = this._writableState;\n\n if (state.corked) {\n state.corked--;\n\n if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n }\n};\n\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n // node::ParseEncoding() requires lower case.\n if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new TypeError('Unknown encoding: ' + encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\n\nfunction decodeChunk(state, chunk, encoding) {\n if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n chunk = Buffer.from(chunk, encoding);\n }\n return chunk;\n}\n\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function () {\n return this._writableState.highWaterMark;\n }\n});\n\n// if we're already writing something, then just put this\n// in the queue, and wait our turn. Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n if (!isBuf) {\n var newChunk = decodeChunk(state, chunk, encoding);\n if (chunk !== newChunk) {\n isBuf = true;\n encoding = 'buffer';\n chunk = newChunk;\n }\n }\n var len = state.objectMode ? 1 : chunk.length;\n\n state.length += len;\n\n var ret = state.length < state.highWaterMark;\n // we must ensure that previous needDrain will not be reset to false.\n if (!ret) state.needDrain = true;\n\n if (state.writing || state.corked) {\n var last = state.lastBufferedRequest;\n state.lastBufferedRequest = {\n chunk: chunk,\n encoding: encoding,\n isBuf: isBuf,\n callback: cb,\n next: null\n };\n if (last) {\n last.next = state.lastBufferedRequest;\n } else {\n state.bufferedRequest = state.lastBufferedRequest;\n }\n state.bufferedRequestCount += 1;\n } else {\n doWrite(stream, state, false, len, chunk, encoding, cb);\n }\n\n return ret;\n}\n\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n state.writelen = len;\n state.writecb = cb;\n state.writing = true;\n state.sync = true;\n if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n state.sync = false;\n}\n\nfunction onwriteError(stream, state, sync, er, cb) {\n --state.pendingcb;\n\n if (sync) {\n // defer the callback if we are being called synchronously\n // to avoid piling up things on the stack\n pna.nextTick(cb, er);\n // this can emit finish, and it will always happen\n // after error\n pna.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n stream.emit('error', er);\n } else {\n // the caller expect this to happen before if\n // it is async\n cb(er);\n stream._writableState.errorEmitted = true;\n stream.emit('error', er);\n // this can emit finish, but finish must\n // always follow error\n finishMaybe(stream, state);\n }\n}\n\nfunction onwriteStateUpdate(state) {\n state.writing = false;\n state.writecb = null;\n state.length -= state.writelen;\n state.writelen = 0;\n}\n\nfunction onwrite(stream, er) {\n var state = stream._writableState;\n var sync = state.sync;\n var cb = state.writecb;\n\n onwriteStateUpdate(state);\n\n if (er) onwriteError(stream, state, sync, er, cb);else {\n // Check if we're actually ready to finish, but don't emit yet\n var finished = needFinish(state);\n\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n\n if (sync) {\n /*<replacement>*/\n asyncWrite(afterWrite, stream, state, finished, cb);\n /*</replacement>*/\n } else {\n afterWrite(stream, state, finished, cb);\n }\n }\n}\n\nfunction afterWrite(stream, state, finished, cb) {\n if (!finished) onwriteDrain(stream, state);\n state.pendingcb--;\n cb();\n finishMaybe(stream, state);\n}\n\n// Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\nfunction onwriteDrain(stream, state) {\n if (state.length === 0 && state.needDrain) {\n state.needDrain = false;\n stream.emit('drain');\n }\n}\n\n// if there's something in the buffer waiting, then process it\nfunction clearBuffer(stream, state) {\n state.bufferProcessing = true;\n var entry = state.bufferedRequest;\n\n if (stream._writev && entry && entry.next) {\n // Fast case, write everything using _writev()\n var l = state.bufferedRequestCount;\n var buffer = new Array(l);\n var holder = state.corkedRequestsFree;\n holder.entry = entry;\n\n var count = 0;\n var allBuffers = true;\n while (entry) {\n buffer[count] = entry;\n if (!entry.isBuf) allBuffers = false;\n entry = entry.next;\n count += 1;\n }\n buffer.allBuffers = allBuffers;\n\n doWrite(stream, state, true, state.length, buffer, '', holder.finish);\n\n // doWrite is almost always async, defer these to save a bit of time\n // as the hot path ends with doWrite\n state.pendingcb++;\n state.lastBufferedRequest = null;\n if (holder.next) {\n state.corkedRequestsFree = holder.next;\n holder.next = null;\n } else {\n state.corkedRequestsFree = new CorkedRequest(state);\n }\n state.bufferedRequestCount = 0;\n } else {\n // Slow case, write chunks one-by-one\n while (entry) {\n var chunk = entry.chunk;\n var encoding = entry.encoding;\n var cb = entry.callback;\n var len = state.objectMode ? 1 : chunk.length;\n\n doWrite(stream, state, false, len, chunk, encoding, cb);\n entry = entry.next;\n state.bufferedRequestCount--;\n // if we didn't call the onwrite immediately, then\n // it means that we need to wait until it does.\n // also, that means that the chunk and cb are currently\n // being processed, so move the buffer counter past them.\n if (state.writing) {\n break;\n }\n }\n\n if (entry === null) state.lastBufferedRequest = null;\n }\n\n state.bufferedRequest = entry;\n state.bufferProcessing = false;\n}\n\nWritable.prototype._write = function (chunk, encoding, cb) {\n cb(new Error('_write() is not implemented'));\n};\n\nWritable.prototype._writev = null;\n\nWritable.prototype.end = function (chunk, encoding, cb) {\n var state = this._writableState;\n\n if (typeof chunk === 'function') {\n cb = chunk;\n chunk = null;\n encoding = null;\n } else if (typeof encoding === 'function') {\n cb = encoding;\n encoding = null;\n }\n\n if (chunk !== null && chunk !== undefined) this.write(chunk, encoding);\n\n // .end() fully uncorks\n if (state.corked) {\n state.corked = 1;\n this.uncork();\n }\n\n // ignore unnecessary end() calls.\n if (!state.ending) endWritable(this, state, cb);\n};\n\nfunction needFinish(state) {\n return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\nfunction callFinal(stream, state) {\n stream._final(function (err) {\n state.pendingcb--;\n if (err) {\n stream.emit('error', err);\n }\n state.prefinished = true;\n stream.emit('prefinish');\n finishMaybe(stream, state);\n });\n}\nfunction prefinish(stream, state) {\n if (!state.prefinished && !state.finalCalled) {\n if (typeof stream._final === 'function') {\n state.pendingcb++;\n state.finalCalled = true;\n pna.nextTick(callFinal, stream, state);\n } else {\n state.prefinished = true;\n stream.emit('prefinish');\n }\n }\n}\n\nfunction finishMaybe(stream, state) {\n var need = needFinish(state);\n if (need) {\n prefinish(stream, state);\n if (state.pendingcb === 0) {\n state.finished = true;\n stream.emit('finish');\n }\n }\n return need;\n}\n\nfunction endWritable(stream, state, cb) {\n state.ending = true;\n finishMaybe(stream, state);\n if (cb) {\n if (state.finished) pna.nextTick(cb);else stream.once('finish', cb);\n }\n state.ended = true;\n stream.writable = false;\n}\n\nfunction onCorkedFinish(corkReq, state, err) {\n var entry = corkReq.entry;\n corkReq.entry = null;\n while (entry) {\n var cb = entry.callback;\n state.pendingcb--;\n cb(err);\n entry = entry.next;\n }\n\n // reuse the free corkReq.\n state.corkedRequestsFree.next = corkReq;\n}\n\nObject.defineProperty(Writable.prototype, 'destroyed', {\n get: function () {\n if (this._writableState === undefined) {\n return false;\n }\n return this._writableState.destroyed;\n },\n set: function (value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._writableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._writableState.destroyed = value;\n }\n});\n\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\nWritable.prototype._destroy = function (err, cb) {\n this.end();\n cb(err);\n};","\n/**\n * Module exports.\n */\n\nmodule.exports = deprecate;\n\n/**\n * Mark that a method should not be used.\n * Returns a modified function which warns once by default.\n *\n * If `localStorage.noDeprecation = true` is set, then it is a no-op.\n *\n * If `localStorage.throwDeprecation = true` is set, then deprecated functions\n * will throw an Error when invoked.\n *\n * If `localStorage.traceDeprecation = true` is set, then deprecated functions\n * will invoke `console.trace()` instead of `console.error()`.\n *\n * @param {Function} fn - the function to deprecate\n * @param {String} msg - the string to print to the console when `fn` is invoked\n * @returns {Function} a new \"deprecated\" version of `fn`\n * @api public\n */\n\nfunction deprecate (fn, msg) {\n if (config('noDeprecation')) {\n return fn;\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (config('throwDeprecation')) {\n throw new Error(msg);\n } else if (config('traceDeprecation')) {\n console.trace(msg);\n } else {\n console.warn(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n}\n\n/**\n * Checks `localStorage` for boolean values for the given `name`.\n *\n * @param {String} name\n * @returns {Boolean}\n * @api private\n */\n\nfunction config (name) {\n // accessing global.localStorage can trigger a DOMException in sandboxed iframes\n try {\n if (!global.localStorage) return false;\n } catch (_) {\n return false;\n }\n var val = global.localStorage[name];\n if (null == val) return false;\n return String(val).toLowerCase() === 'true';\n}\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\n/*<replacement>*/\n\nvar Buffer = require('safe-buffer').Buffer;\n/*</replacement>*/\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n encoding = '' + encoding;\n switch (encoding && encoding.toLowerCase()) {\n case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw':\n return true;\n default:\n return false;\n }\n};\n\nfunction _normalizeEncoding(enc) {\n if (!enc) return 'utf8';\n var retried;\n while (true) {\n switch (enc) {\n case 'utf8':\n case 'utf-8':\n return 'utf8';\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return 'utf16le';\n case 'latin1':\n case 'binary':\n return 'latin1';\n case 'base64':\n case 'ascii':\n case 'hex':\n return enc;\n default:\n if (retried) return; // undefined\n enc = ('' + enc).toLowerCase();\n retried = true;\n }\n }\n};\n\n// Do not cache `Buffer.isEncoding` when checking encoding names as some\n// modules monkey-patch it to support additional encodings\nfunction normalizeEncoding(enc) {\n var nenc = _normalizeEncoding(enc);\n if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n return nenc || enc;\n}\n\n// StringDecoder provides an interface for efficiently splitting a series of\n// buffers into a series of JS strings without breaking apart multi-byte\n// characters.\nexports.StringDecoder = StringDecoder;\nfunction StringDecoder(encoding) {\n this.encoding = normalizeEncoding(encoding);\n var nb;\n switch (this.encoding) {\n case 'utf16le':\n this.text = utf16Text;\n this.end = utf16End;\n nb = 4;\n break;\n case 'utf8':\n this.fillLast = utf8FillLast;\n nb = 4;\n break;\n case 'base64':\n this.text = base64Text;\n this.end = base64End;\n nb = 3;\n break;\n default:\n this.write = simpleWrite;\n this.end = simpleEnd;\n return;\n }\n this.lastNeed = 0;\n this.lastTotal = 0;\n this.lastChar = Buffer.allocUnsafe(nb);\n}\n\nStringDecoder.prototype.write = function (buf) {\n if (buf.length === 0) return '';\n var r;\n var i;\n if (this.lastNeed) {\n r = this.fillLast(buf);\n if (r === undefined) return '';\n i = this.lastNeed;\n this.lastNeed = 0;\n } else {\n i = 0;\n }\n if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n return r || '';\n};\n\nStringDecoder.prototype.end = utf8End;\n\n// Returns only complete characters in a Buffer\nStringDecoder.prototype.text = utf8Text;\n\n// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\nStringDecoder.prototype.fillLast = function (buf) {\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n this.lastNeed -= buf.length;\n};\n\n// Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a\n// continuation byte. If an invalid byte is detected, -2 is returned.\nfunction utf8CheckByte(byte) {\n if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) return 3;else if (byte >> 3 === 0x1E) return 4;\n return byte >> 6 === 0x02 ? -1 : -2;\n}\n\n// Checks at most 3 bytes at the end of a Buffer in order to detect an\n// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4)\n// needed to complete the UTF-8 character (if applicable) are returned.\nfunction utf8CheckIncomplete(self, buf, i) {\n var j = buf.length - 1;\n if (j < i) return 0;\n var nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 1;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 2;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) {\n if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n }\n return nb;\n }\n return 0;\n}\n\n// Validates as many continuation bytes for a multi-byte UTF-8 character as\n// needed or are available. If we see a non-continuation byte where we expect\n// one, we \"replace\" the validated continuation bytes we've seen so far with\n// a single UTF-8 replacement character ('\\ufffd'), to match v8's UTF-8 decoding\n// behavior. The continuation byte check is included three times in the case\n// where all of the continuation bytes for a character exist in the same buffer.\n// It is also done this way as a slight performance increase instead of using a\n// loop.\nfunction utf8CheckExtraBytes(self, buf, p) {\n if ((buf[0] & 0xC0) !== 0x80) {\n self.lastNeed = 0;\n return '\\ufffd';\n }\n if (self.lastNeed > 1 && buf.length > 1) {\n if ((buf[1] & 0xC0) !== 0x80) {\n self.lastNeed = 1;\n return '\\ufffd';\n }\n if (self.lastNeed > 2 && buf.length > 2) {\n if ((buf[2] & 0xC0) !== 0x80) {\n self.lastNeed = 2;\n return '\\ufffd';\n }\n }\n }\n}\n\n// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\nfunction utf8FillLast(buf) {\n var p = this.lastTotal - this.lastNeed;\n var r = utf8CheckExtraBytes(this, buf, p);\n if (r !== undefined) return r;\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, p, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, p, 0, buf.length);\n this.lastNeed -= buf.length;\n}\n\n// Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a\n// partial character, the character's bytes are buffered until the required\n// number of bytes are available.\nfunction utf8Text(buf, i) {\n var total = utf8CheckIncomplete(this, buf, i);\n if (!this.lastNeed) return buf.toString('utf8', i);\n this.lastTotal = total;\n var end = buf.length - (total - this.lastNeed);\n buf.copy(this.lastChar, 0, end);\n return buf.toString('utf8', i, end);\n}\n\n// For UTF-8, a replacement character is added when ending on a partial\n// character.\nfunction utf8End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + '\\ufffd';\n return r;\n}\n\n// UTF-16LE typically needs two bytes per character, but even if we have an even\n// number of bytes available, we need to check if we end on a leading/high\n// surrogate. In that case, we need to wait for the next two bytes in order to\n// decode the last character properly.\nfunction utf16Text(buf, i) {\n if ((buf.length - i) % 2 === 0) {\n var r = buf.toString('utf16le', i);\n if (r) {\n var c = r.charCodeAt(r.length - 1);\n if (c >= 0xD800 && c <= 0xDBFF) {\n this.lastNeed = 2;\n this.lastTotal = 4;\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n return r.slice(0, -1);\n }\n }\n return r;\n }\n this.lastNeed = 1;\n this.lastTotal = 2;\n this.lastChar[0] = buf[buf.length - 1];\n return buf.toString('utf16le', i, buf.length - 1);\n}\n\n// For UTF-16LE we do not explicitly append special replacement characters if we\n// end on a partial character, we simply let v8 handle that.\nfunction utf16End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) {\n var end = this.lastTotal - this.lastNeed;\n return r + this.lastChar.toString('utf16le', 0, end);\n }\n return r;\n}\n\nfunction base64Text(buf, i) {\n var n = (buf.length - i) % 3;\n if (n === 0) return buf.toString('base64', i);\n this.lastNeed = 3 - n;\n this.lastTotal = 3;\n if (n === 1) {\n this.lastChar[0] = buf[buf.length - 1];\n } else {\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n }\n return buf.toString('base64', i, buf.length - n);\n}\n\nfunction base64End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed);\n return r;\n}\n\n// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\nfunction simpleWrite(buf) {\n return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n return buf && buf.length ? this.write(buf) : '';\n}","/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a transform stream is a readable/writable stream where you do\n// something with the data. Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored. (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation. For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes. When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up. When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer. When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks. If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk. However,\n// a pathological inflate type of transform can cause excessive buffering\n// here. For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output. In this case, you could write a very small\n// amount of input, and end up with a very large amount of output. In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform. A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n\n'use strict';\n\nmodule.exports = Transform;\n\nvar Duplex = require('./_stream_duplex');\n\n/*<replacement>*/\nvar util = Object.create(require('core-util-is'));\nutil.inherits = require('inherits');\n/*</replacement>*/\n\nutil.inherits(Transform, Duplex);\n\nfunction afterTransform(er, data) {\n var ts = this._transformState;\n ts.transforming = false;\n\n var cb = ts.writecb;\n\n if (!cb) {\n return this.emit('error', new Error('write callback called multiple times'));\n }\n\n ts.writechunk = null;\n ts.writecb = null;\n\n if (data != null) // single equals check for both `null` and `undefined`\n this.push(data);\n\n cb(er);\n\n var rs = this._readableState;\n rs.reading = false;\n if (rs.needReadable || rs.length < rs.highWaterMark) {\n this._read(rs.highWaterMark);\n }\n}\n\nfunction Transform(options) {\n if (!(this instanceof Transform)) return new Transform(options);\n\n Duplex.call(this, options);\n\n this._transformState = {\n afterTransform: afterTransform.bind(this),\n needTransform: false,\n transforming: false,\n writecb: null,\n writechunk: null,\n writeencoding: null\n };\n\n // start out asking for a readable event once data is transformed.\n this._readableState.needReadable = true;\n\n // we have implemented the _read method, and done the other things\n // that Readable wants before the first _read call, so unset the\n // sync guard flag.\n this._readableState.sync = false;\n\n if (options) {\n if (typeof options.transform === 'function') this._transform = options.transform;\n\n if (typeof options.flush === 'function') this._flush = options.flush;\n }\n\n // When the writable side finishes, then flush out anything remaining.\n this.on('prefinish', prefinish);\n}\n\nfunction prefinish() {\n var _this = this;\n\n if (typeof this._flush === 'function') {\n this._flush(function (er, data) {\n done(_this, er, data);\n });\n } else {\n done(this, null, null);\n }\n}\n\nTransform.prototype.push = function (chunk, encoding) {\n this._transformState.needTransform = false;\n return Duplex.prototype.push.call(this, chunk, encoding);\n};\n\n// This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side. You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk. If you pass\n// an error, then that'll put the hurt on the whole operation. If you\n// never call cb(), then you'll never get another chunk.\nTransform.prototype._transform = function (chunk, encoding, cb) {\n throw new Error('_transform() is not implemented');\n};\n\nTransform.prototype._write = function (chunk, encoding, cb) {\n var ts = this._transformState;\n ts.writecb = cb;\n ts.writechunk = chunk;\n ts.writeencoding = encoding;\n if (!ts.transforming) {\n var rs = this._readableState;\n if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n }\n};\n\n// Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\nTransform.prototype._read = function (n) {\n var ts = this._transformState;\n\n if (ts.writechunk !== null && ts.writecb && !ts.transforming) {\n ts.transforming = true;\n this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n } else {\n // mark that we need a transform, so that any data that comes in\n // will get processed, now that we've asked for it.\n ts.needTransform = true;\n }\n};\n\nTransform.prototype._destroy = function (err, cb) {\n var _this2 = this;\n\n Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\n _this2.emit('close');\n });\n};\n\nfunction done(stream, er, data) {\n if (er) return stream.emit('error', er);\n\n if (data != null) // single equals check for both `null` and `undefined`\n stream.push(data);\n\n // if there's nothing in the write buffer, then that means\n // that nothing more will ever be provided\n if (stream._writableState.length) throw new Error('Calling transform done when ws.length != 0');\n\n if (stream._transformState.transforming) throw new Error('Calling transform done when still transforming');\n\n return stream.push(null);\n}","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n\n'use strict';\n\nmodule.exports = PassThrough;\n\nvar Transform = require('./_stream_transform');\n\n/*<replacement>*/\nvar util = Object.create(require('core-util-is'));\nutil.inherits = require('inherits');\n/*</replacement>*/\n\nutil.inherits(PassThrough, Transform);\n\nfunction PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n\n Transform.call(this, options);\n}\n\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n cb(null, chunk);\n};","'use strict';\n\n/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-0, as defined\n * in FIPS PUB 180-1\n * This source code is derived from sha1.js of the same repository.\n * The difference between SHA-0 and SHA-1 is just a bitwise rotate left\n * operation was added.\n */\n\nvar inherits = require('inherits');\nvar Hash = require('./hash');\nvar Buffer = require('safe-buffer').Buffer;\n\nvar K = [\n\t0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n];\n\nvar W = new Array(80);\n\nfunction Sha() {\n\tthis.init();\n\tthis._w = W;\n\n\tHash.call(this, 64, 56);\n}\n\ninherits(Sha, Hash);\n\nSha.prototype.init = function () {\n\tthis._a = 0x67452301;\n\tthis._b = 0xefcdab89;\n\tthis._c = 0x98badcfe;\n\tthis._d = 0x10325476;\n\tthis._e = 0xc3d2e1f0;\n\n\treturn this;\n};\n\nfunction rotl5(num) {\n\treturn (num << 5) | (num >>> 27);\n}\n\nfunction rotl30(num) {\n\treturn (num << 30) | (num >>> 2);\n}\n\nfunction ft(s, b, c, d) {\n\tif (s === 0) {\n\t\treturn (b & c) | (~b & d);\n\t}\n\tif (s === 2) {\n\t\treturn (b & c) | (b & d) | (c & d);\n\t}\n\treturn b ^ c ^ d;\n}\n\nSha.prototype._update = function (M) {\n\tvar w = this._w;\n\n\tvar a = this._a | 0;\n\tvar b = this._b | 0;\n\tvar c = this._c | 0;\n\tvar d = this._d | 0;\n\tvar e = this._e | 0;\n\n\tfor (var i = 0; i < 16; ++i) {\n\t\tw[i] = M.readInt32BE(i * 4);\n\t}\n\tfor (; i < 80; ++i) {\n\t\tw[i] = w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16];\n\t}\n\n\tfor (var j = 0; j < 80; ++j) {\n\t\tvar s = ~~(j / 20);\n\t\tvar t = (rotl5(a) + ft(s, b, c, d) + e + w[j] + K[s]) | 0;\n\n\t\te = d;\n\t\td = c;\n\t\tc = rotl30(b);\n\t\tb = a;\n\t\ta = t;\n\t}\n\n\tthis._a = (a + this._a) | 0;\n\tthis._b = (b + this._b) | 0;\n\tthis._c = (c + this._c) | 0;\n\tthis._d = (d + this._d) | 0;\n\tthis._e = (e + this._e) | 0;\n};\n\nSha.prototype._hash = function () {\n\tvar H = Buffer.allocUnsafe(20);\n\n\tH.writeInt32BE(this._a | 0, 0);\n\tH.writeInt32BE(this._b | 0, 4);\n\tH.writeInt32BE(this._c | 0, 8);\n\tH.writeInt32BE(this._d | 0, 12);\n\tH.writeInt32BE(this._e | 0, 16);\n\n\treturn H;\n};\n\nmodule.exports = Sha;\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\nvar toBuffer = require('to-buffer');\n\n// prototype class for hash functions\nfunction Hash(blockSize, finalSize) {\n\tthis._block = Buffer.alloc(blockSize);\n\tthis._finalSize = finalSize;\n\tthis._blockSize = blockSize;\n\tthis._len = 0;\n}\n\nHash.prototype.update = function (data, enc) {\n\t/* eslint no-param-reassign: 0 */\n\tdata = toBuffer(data, enc || 'utf8');\n\n\tvar block = this._block;\n\tvar blockSize = this._blockSize;\n\tvar length = data.length;\n\tvar accum = this._len;\n\n\tfor (var offset = 0; offset < length;) {\n\t\tvar assigned = accum % blockSize;\n\t\tvar remainder = Math.min(length - offset, blockSize - assigned);\n\n\t\tfor (var i = 0; i < remainder; i++) {\n\t\t\tblock[assigned + i] = data[offset + i];\n\t\t}\n\n\t\taccum += remainder;\n\t\toffset += remainder;\n\n\t\tif ((accum % blockSize) === 0) {\n\t\t\tthis._update(block);\n\t\t}\n\t}\n\n\tthis._len += length;\n\treturn this;\n};\n\nHash.prototype.digest = function (enc) {\n\tvar rem = this._len % this._blockSize;\n\n\tthis._block[rem] = 0x80;\n\n\t/*\n\t * zero (rem + 1) trailing bits, where (rem + 1) is the smallest\n\t * non-negative solution to the equation (length + 1 + (rem + 1)) === finalSize mod blockSize\n\t */\n\tthis._block.fill(0, rem + 1);\n\n\tif (rem >= this._finalSize) {\n\t\tthis._update(this._block);\n\t\tthis._block.fill(0);\n\t}\n\n\tvar bits = this._len * 8;\n\n\t// uint32\n\tif (bits <= 0xffffffff) {\n\t\tthis._block.writeUInt32BE(bits, this._blockSize - 4);\n\n\t\t// uint64\n\t} else {\n\t\tvar lowBits = (bits & 0xffffffff) >>> 0;\n\t\tvar highBits = (bits - lowBits) / 0x100000000;\n\n\t\tthis._block.writeUInt32BE(highBits, this._blockSize - 8);\n\t\tthis._block.writeUInt32BE(lowBits, this._blockSize - 4);\n\t}\n\n\tthis._update(this._block);\n\tvar hash = this._hash();\n\n\treturn enc ? hash.toString(enc) : hash;\n};\n\nHash.prototype._update = function () {\n\tthrow new Error('_update must be implemented by subclass');\n};\n\nmodule.exports = Hash;\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\nvar isArray = require('isarray');\nvar typedArrayBuffer = require('typed-array-buffer');\n\nvar isView = ArrayBuffer.isView || function isView(obj) {\n\ttry {\n\t\ttypedArrayBuffer(obj);\n\t\treturn true;\n\t} catch (e) {\n\t\treturn false;\n\t}\n};\n\nvar useUint8Array = typeof Uint8Array !== 'undefined';\nvar useArrayBuffer = typeof ArrayBuffer !== 'undefined'\n\t&& typeof Uint8Array !== 'undefined';\nvar useFromArrayBuffer = useArrayBuffer && (Buffer.prototype instanceof Uint8Array || Buffer.TYPED_ARRAY_SUPPORT);\n\nmodule.exports = function toBuffer(data, encoding) {\n\tif (Buffer.isBuffer(data)) {\n\t\tif (data.constructor && !('isBuffer' in data)) {\n\t\t\t// probably a SlowBuffer\n\t\t\treturn Buffer.from(data);\n\t\t}\n\t\treturn data;\n\t}\n\n\tif (typeof data === 'string') {\n\t\treturn Buffer.from(data, encoding);\n\t}\n\n\t/*\n\t * Wrap any TypedArray instances and DataViews\n\t * Makes sense only on engines with full TypedArray support -- let Buffer detect that\n\t */\n\tif (useArrayBuffer && isView(data)) {\n\t\t// Bug in Node.js <6.3.1, which treats this as out-of-bounds\n\t\tif (data.byteLength === 0) {\n\t\t\treturn Buffer.alloc(0);\n\t\t}\n\n\t\t// When Buffer is based on Uint8Array, we can just construct it from ArrayBuffer\n\t\tif (useFromArrayBuffer) {\n\t\t\tvar res = Buffer.from(data.buffer, data.byteOffset, data.byteLength);\n\t\t\t/*\n\t\t\t * Recheck result size, as offset/length doesn't work on Node.js <5.10\n\t\t\t * We just go to Uint8Array case if this fails\n\t\t\t */\n\t\t\tif (res.byteLength === data.byteLength) {\n\t\t\t\treturn res;\n\t\t\t}\n\t\t}\n\n\t\t// Convert to Uint8Array bytes and then to Buffer\n\t\tvar uint8 = data instanceof Uint8Array ? data : new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n\t\tvar result = Buffer.from(uint8);\n\n\t\t/*\n\t\t * Let's recheck that conversion succeeded\n\t\t * We have .length but not .byteLength when useFromArrayBuffer is false\n\t\t */\n\t\tif (result.length === data.byteLength) {\n\t\t\treturn result;\n\t\t}\n\t}\n\n\t/*\n\t * Uint8Array in engines where Buffer.from might not work with ArrayBuffer, just copy over\n\t * Doesn't make sense with other TypedArray instances\n\t */\n\tif (useUint8Array && data instanceof Uint8Array) {\n\t\treturn Buffer.from(data);\n\t}\n\n\tvar isArr = isArray(data);\n\tif (isArr) {\n\t\tfor (var i = 0; i < data.length; i += 1) {\n\t\t\tvar x = data[i];\n\t\t\tif (\n\t\t\t\ttypeof x !== 'number'\n\t\t\t\t|| x < 0\n\t\t\t\t|| x > 255\n\t\t\t\t|| ~~x !== x // NaN and integer check\n\t\t\t) {\n\t\t\t\tthrow new RangeError('Array items must be numbers in the range 0-255.');\n\t\t\t}\n\t\t}\n\t}\n\n\t/*\n\t * Old Buffer polyfill on an engine that doesn't have TypedArray support\n\t * Also, this is from a different Buffer polyfill implementation then we have, as instanceof check failed\n\t * Convert to our current Buffer implementation\n\t */\n\tif (\n\t\tisArr || (\n\t\t\tBuffer.isBuffer(data)\n\t\t\t&& data.constructor\n\t\t\t&& typeof data.constructor.isBuffer === 'function'\n\t\t\t&& data.constructor.isBuffer(data)\n\t\t)\n\t) {\n\t\treturn Buffer.from(data);\n\t}\n\n\tthrow new TypeError('The \"data\" argument must be a string, an Array, a Buffer, a Uint8Array, or a DataView.');\n};\n","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};\n","'use strict';\n\nvar $TypeError = require('es-errors/type');\n\nvar callBound = require('call-bound');\n\n/** @type {undefined | ((thisArg: import('.').TypedArray) => Buffer<ArrayBufferLike>)} */\nvar $typedArrayBuffer = callBound('TypedArray.prototype.buffer', true);\n\nvar isTypedArray = require('is-typed-array');\n\n/** @type {import('.')} */\n// node <= 0.10, < 0.11.4 has a nonconfigurable own property instead of a prototype getter\nmodule.exports = $typedArrayBuffer || function typedArrayBuffer(x) {\n\tif (!isTypedArray(x)) {\n\t\tthrow new $TypeError('Not a Typed Array');\n\t}\n\treturn x.buffer;\n};\n","'use strict';\n\n/** @type {import('./type')} */\nmodule.exports = TypeError;\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBindBasic = require('call-bind-apply-helpers');\n\n/** @type {(thisArg: string, searchString: string, position?: number) => number} */\nvar $indexOf = callBindBasic([GetIntrinsic('%String.prototype.indexOf%')]);\n\n/** @type {import('.')} */\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\t/* eslint no-extra-parens: 0 */\n\n\tvar intrinsic = /** @type {(this: unknown, ...args: unknown[]) => unknown} */ (GetIntrinsic(name, !!allowMissing));\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBindBasic(/** @type {const} */ ([intrinsic]));\n\t}\n\treturn intrinsic;\n};\n","'use strict';\n\nvar undefined;\n\nvar $Object = require('es-object-atoms');\n\nvar $Error = require('es-errors');\nvar $EvalError = require('es-errors/eval');\nvar $RangeError = require('es-errors/range');\nvar $ReferenceError = require('es-errors/ref');\nvar $SyntaxError = require('es-errors/syntax');\nvar $TypeError = require('es-errors/type');\nvar $URIError = require('es-errors/uri');\n\nvar abs = require('math-intrinsics/abs');\nvar floor = require('math-intrinsics/floor');\nvar max = require('math-intrinsics/max');\nvar min = require('math-intrinsics/min');\nvar pow = require('math-intrinsics/pow');\nvar round = require('math-intrinsics/round');\nvar sign = require('math-intrinsics/sign');\n\nvar $Function = Function;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = require('gopd');\nvar $defineProperty = require('es-define-property');\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = require('has-symbols')();\n\nvar getProto = require('get-proto');\nvar $ObjectGPO = require('get-proto/Object.getPrototypeOf');\nvar $ReflectGPO = require('get-proto/Reflect.getPrototypeOf');\n\nvar $apply = require('call-bind-apply-helpers/functionApply');\nvar $call = require('call-bind-apply-helpers/functionCall');\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' || !getProto ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t__proto__: null,\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols && getProto ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%BigInt64Array%': typeof BigInt64Array === 'undefined' ? undefined : BigInt64Array,\n\t'%BigUint64Array%': typeof BigUint64Array === 'undefined' ? undefined : BigUint64Array,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': $Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': $EvalError,\n\t'%Float16Array%': typeof Float16Array === 'undefined' ? undefined : Float16Array,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols && getProto ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': $Object,\n\t'%Object.getOwnPropertyDescriptor%': $gOPD,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': $RangeError,\n\t'%ReferenceError%': $ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols || !getProto ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols && getProto ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': $URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet,\n\n\t'%Function.prototype.call%': $call,\n\t'%Function.prototype.apply%': $apply,\n\t'%Object.defineProperty%': $defineProperty,\n\t'%Object.getPrototypeOf%': $ObjectGPO,\n\t'%Math.abs%': abs,\n\t'%Math.floor%': floor,\n\t'%Math.max%': max,\n\t'%Math.min%': min,\n\t'%Math.pow%': pow,\n\t'%Math.round%': round,\n\t'%Math.sign%': sign,\n\t'%Reflect.getPrototypeOf%': $ReflectGPO\n};\n\nif (getProto) {\n\ttry {\n\t\tnull.error; // eslint-disable-line no-unused-expressions\n\t} catch (e) {\n\t\t// https://github.com/tc39/proposal-shadowrealm/pull/384#issuecomment-1364264229\n\t\tvar errorProto = getProto(getProto(e));\n\t\tINTRINSICS['%Error.prototype%'] = errorProto;\n\t}\n}\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen && getProto) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t__proto__: null,\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = require('function-bind');\nvar hasOwn = require('hasown');\nvar $concat = bind.call($call, Array.prototype.concat);\nvar $spliceApply = bind.call($apply, Array.prototype.splice);\nvar $replace = bind.call($call, String.prototype.replace);\nvar $strSlice = bind.call($call, String.prototype.slice);\nvar $exec = bind.call($call, RegExp.prototype.exec);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tif ($exec(/^%?[^%]*%?$/, name) === null) {\n\t\tthrow new $SyntaxError('`%` may not be present anywhere but at the beginning and end of the intrinsic name');\n\t}\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = Object;\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = Error;\n","'use strict';\n\n/** @type {import('./eval')} */\nmodule.exports = EvalError;\n","'use strict';\n\n/** @type {import('./range')} */\nmodule.exports = RangeError;\n","'use strict';\n\n/** @type {import('./ref')} */\nmodule.exports = ReferenceError;\n","'use strict';\n\n/** @type {import('./syntax')} */\nmodule.exports = SyntaxError;\n","'use strict';\n\n/** @type {import('./uri')} */\nmodule.exports = URIError;\n","'use strict';\n\n/** @type {import('./abs')} */\nmodule.exports = Math.abs;\n","'use strict';\n\n/** @type {import('./floor')} */\nmodule.exports = Math.floor;\n","'use strict';\n\n/** @type {import('./max')} */\nmodule.exports = Math.max;\n","'use strict';\n\n/** @type {import('./min')} */\nmodule.exports = Math.min;\n","'use strict';\n\n/** @type {import('./pow')} */\nmodule.exports = Math.pow;\n","'use strict';\n\n/** @type {import('./round')} */\nmodule.exports = Math.round;\n","'use strict';\n\nvar $isNaN = require('./isNaN');\n\n/** @type {import('./sign')} */\nmodule.exports = function sign(number) {\n\tif ($isNaN(number) || number === 0) {\n\t\treturn number;\n\t}\n\treturn number < 0 ? -1 : +1;\n};\n","'use strict';\n\n/** @type {import('./isNaN')} */\nmodule.exports = Number.isNaN || function isNaN(a) {\n\treturn a !== a;\n};\n","'use strict';\n\n/** @type {import('.')} */\nvar $gOPD = require('./gOPD');\n\nif ($gOPD) {\n\ttry {\n\t\t$gOPD([], 'length');\n\t} catch (e) {\n\t\t// IE 8 has a broken gOPD\n\t\t$gOPD = null;\n\t}\n}\n\nmodule.exports = $gOPD;\n","'use strict';\n\n/** @type {import('./gOPD')} */\nmodule.exports = Object.getOwnPropertyDescriptor;\n","'use strict';\n\nvar reflectGetProto = require('./Reflect.getPrototypeOf');\nvar originalGetProto = require('./Object.getPrototypeOf');\n\nvar getDunderProto = require('dunder-proto/get');\n\n/** @type {import('.')} */\nmodule.exports = reflectGetProto\n\t? function getProto(O) {\n\t\t// @ts-expect-error TS can't narrow inside a closure, for some reason\n\t\treturn reflectGetProto(O);\n\t}\n\t: originalGetProto\n\t\t? function getProto(O) {\n\t\t\tif (!O || (typeof O !== 'object' && typeof O !== 'function')) {\n\t\t\t\tthrow new TypeError('getProto: not an object');\n\t\t\t}\n\t\t\t// @ts-expect-error TS can't narrow inside a closure, for some reason\n\t\t\treturn originalGetProto(O);\n\t\t}\n\t\t: getDunderProto\n\t\t\t? function getProto(O) {\n\t\t\t\t// @ts-expect-error TS can't narrow inside a closure, for some reason\n\t\t\t\treturn getDunderProto(O);\n\t\t\t}\n\t\t\t: null;\n","'use strict';\n\n/** @type {import('./Reflect.getPrototypeOf')} */\nmodule.exports = (typeof Reflect !== 'undefined' && Reflect.getPrototypeOf) || null;\n","'use strict';\n\nvar $Object = require('es-object-atoms');\n\n/** @type {import('./Object.getPrototypeOf')} */\nmodule.exports = $Object.getPrototypeOf || null;\n","'use strict';\n\nvar callBind = require('call-bind-apply-helpers');\nvar gOPD = require('gopd');\n\nvar hasProtoAccessor;\ntry {\n\t// eslint-disable-next-line no-extra-parens, no-proto\n\thasProtoAccessor = /** @type {{ __proto__?: typeof Array.prototype }} */ ([]).__proto__ === Array.prototype;\n} catch (e) {\n\tif (!e || typeof e !== 'object' || !('code' in e) || e.code !== 'ERR_PROTO_ACCESS') {\n\t\tthrow e;\n\t}\n}\n\n// eslint-disable-next-line no-extra-parens\nvar desc = !!hasProtoAccessor && gOPD && gOPD(Object.prototype, /** @type {keyof typeof Object.prototype} */ ('__proto__'));\n\nvar $Object = Object;\nvar $getPrototypeOf = $Object.getPrototypeOf;\n\n/** @type {import('./get')} */\nmodule.exports = desc && typeof desc.get === 'function'\n\t? callBind([desc.get])\n\t: typeof $getPrototypeOf === 'function'\n\t\t? /** @type {import('./get')} */ function getDunder(value) {\n\t\t\t// eslint-disable-next-line eqeqeq\n\t\t\treturn $getPrototypeOf(value == null ? value : $Object(value));\n\t\t}\n\t\t: false;\n","'use strict';\n\nvar bind = require('function-bind');\nvar $TypeError = require('es-errors/type');\n\nvar $call = require('./functionCall');\nvar $actualApply = require('./actualApply');\n\n/** @type {(args: [Function, thisArg?: unknown, ...args: unknown[]]) => Function} TODO FIXME, find a way to use import('.') */\nmodule.exports = function callBindBasic(args) {\n\tif (args.length < 1 || typeof args[0] !== 'function') {\n\t\tthrow new $TypeError('a function is required');\n\t}\n\treturn $actualApply(bind, $call, args);\n};\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar toStr = Object.prototype.toString;\nvar max = Math.max;\nvar funcType = '[object Function]';\n\nvar concatty = function concatty(a, b) {\n var arr = [];\n\n for (var i = 0; i < a.length; i += 1) {\n arr[i] = a[i];\n }\n for (var j = 0; j < b.length; j += 1) {\n arr[j + a.length] = b[j];\n }\n\n return arr;\n};\n\nvar slicy = function slicy(arrLike, offset) {\n var arr = [];\n for (var i = offset || 0, j = 0; i < arrLike.length; i += 1, j += 1) {\n arr[j] = arrLike[i];\n }\n return arr;\n};\n\nvar joiny = function (arr, joiner) {\n var str = '';\n for (var i = 0; i < arr.length; i += 1) {\n str += arr[i];\n if (i + 1 < arr.length) {\n str += joiner;\n }\n }\n return str;\n};\n\nmodule.exports = function bind(that) {\n var target = this;\n if (typeof target !== 'function' || toStr.apply(target) !== funcType) {\n throw new TypeError(ERROR_MESSAGE + target);\n }\n var args = slicy(arguments, 1);\n\n var bound;\n var binder = function () {\n if (this instanceof bound) {\n var result = target.apply(\n this,\n concatty(args, arguments)\n );\n if (Object(result) === result) {\n return result;\n }\n return this;\n }\n return target.apply(\n that,\n concatty(args, arguments)\n );\n\n };\n\n var boundLength = max(0, target.length - args.length);\n var boundArgs = [];\n for (var i = 0; i < boundLength; i++) {\n boundArgs[i] = '$' + i;\n }\n\n bound = Function('binder', 'return function (' + joiny(boundArgs, ',') + '){ return binder.apply(this,arguments); }')(binder);\n\n if (target.prototype) {\n var Empty = function Empty() {};\n Empty.prototype = target.prototype;\n bound.prototype = new Empty();\n Empty.prototype = null;\n }\n\n return bound;\n};\n","'use strict';\n\n/** @type {import('./functionCall')} */\nmodule.exports = Function.prototype.call;\n","'use strict';\n\nvar bind = require('function-bind');\n\nvar $apply = require('./functionApply');\nvar $call = require('./functionCall');\nvar $reflectApply = require('./reflectApply');\n\n/** @type {import('./actualApply')} */\nmodule.exports = $reflectApply || bind.call($call, $apply);\n","'use strict';\n\n/** @type {import('./functionApply')} */\nmodule.exports = Function.prototype.apply;\n","'use strict';\n\n/** @type {import('./reflectApply')} */\nmodule.exports = typeof Reflect !== 'undefined' && Reflect && Reflect.apply;\n","'use strict';\n\nvar call = Function.prototype.call;\nvar $hasOwn = Object.prototype.hasOwnProperty;\nvar bind = require('function-bind');\n\n/** @type {import('.')} */\nmodule.exports = bind.call(call, $hasOwn);\n","'use strict';\n\nvar whichTypedArray = require('which-typed-array');\n\n/** @type {import('.')} */\nmodule.exports = function isTypedArray(value) {\n\treturn !!whichTypedArray(value);\n};\n","'use strict';\n\nvar forEach = require('for-each');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBind = require('call-bind');\nvar callBound = require('call-bound');\nvar gOPD = require('gopd');\nvar getProto = require('get-proto');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasToStringTag = require('has-tostringtag/shams')();\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\nvar typedArrays = availableTypedArrays();\n\nvar $slice = callBound('String.prototype.slice');\n\n/** @type {<T = unknown>(array: readonly T[], value: unknown) => number} */\nvar $indexOf = callBound('Array.prototype.indexOf', true) || function indexOf(array, value) {\n\tfor (var i = 0; i < array.length; i += 1) {\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n};\n\n/** @typedef {import('./types').Getter} Getter */\n/** @type {import('./types').Cache} */\nvar cache = { __proto__: null };\nif (hasToStringTag && gOPD && getProto) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tif (Symbol.toStringTag in arr && getProto) {\n\t\t\tvar proto = getProto(arr);\n\t\t\t// @ts-expect-error TS won't narrow inside a closure\n\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\tif (!descriptor && proto) {\n\t\t\t\tvar superProto = getProto(proto);\n\t\t\t\t// @ts-expect-error TS won't narrow inside a closure\n\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t}\n\t\t\tif (descriptor && descriptor.get) {\n\t\t\t\tvar bound = callBind(descriptor.get);\n\t\t\t\tcache[\n\t\t\t\t\t/** @type {`$${import('.').TypedArrayName}`} */ ('$' + typedArray)\n\t\t\t\t] = bound;\n\t\t\t}\n\t\t}\n\t});\n} else {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tvar fn = arr.slice || arr.set;\n\t\tif (fn) {\n\t\t\tvar bound = /** @type {import('./types').BoundSlice | import('./types').BoundSet} */ (\n\t\t\t\t// @ts-expect-error TODO FIXME\n\t\t\t\tcallBind(fn)\n\t\t\t);\n\t\t\tcache[\n\t\t\t\t/** @type {`$${import('.').TypedArrayName}`} */ ('$' + typedArray)\n\t\t\t] = bound;\n\t\t}\n\t});\n}\n\n/** @type {(value: object) => false | import('.').TypedArrayName} */\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\t/** @type {ReturnType<typeof tryAllTypedArrays>} */ var found = false;\n\tforEach(\n\t\t/** @type {Record<`\\$${import('.').TypedArrayName}`, Getter>} */ (cache),\n\t\t/** @type {(getter: Getter, name: `\\$${import('.').TypedArrayName}`) => void} */\n\t\tfunction (getter, typedArray) {\n\t\t\tif (!found) {\n\t\t\t\ttry {\n\t\t\t\t\t// @ts-expect-error a throw is fine here\n\t\t\t\t\tif ('$' + getter(value) === typedArray) {\n\t\t\t\t\t\tfound = /** @type {import('.').TypedArrayName} */ ($slice(typedArray, 1));\n\t\t\t\t\t}\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t}\n\t);\n\treturn found;\n};\n\n/** @type {(value: object) => false | import('.').TypedArrayName} */\nvar trySlices = function tryAllSlices(value) {\n\t/** @type {ReturnType<typeof tryAllSlices>} */ var found = false;\n\tforEach(\n\t\t/** @type {Record<`\\$${import('.').TypedArrayName}`, Getter>} */(cache),\n\t\t/** @type {(getter: Getter, name: `\\$${import('.').TypedArrayName}`) => void} */ function (getter, name) {\n\t\t\tif (!found) {\n\t\t\t\ttry {\n\t\t\t\t\t// @ts-expect-error a throw is fine here\n\t\t\t\t\tgetter(value);\n\t\t\t\t\tfound = /** @type {import('.').TypedArrayName} */ ($slice(name, 1));\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t}\n\t);\n\treturn found;\n};\n\n/** @type {import('.')} */\nmodule.exports = function whichTypedArray(value) {\n\tif (!value || typeof value !== 'object') { return false; }\n\tif (!hasToStringTag) {\n\t\t/** @type {string} */\n\t\tvar tag = $slice($toString(value), 8, -1);\n\t\tif ($indexOf(typedArrays, tag) > -1) {\n\t\t\treturn tag;\n\t\t}\n\t\tif (tag !== 'Object') {\n\t\t\treturn false;\n\t\t}\n\t\t// node < 0.6 hits here on real Typed Arrays\n\t\treturn trySlices(value);\n\t}\n\tif (!gOPD) { return null; } // unknown engine\n\treturn tryTypedArrays(value);\n};\n","'use strict';\n\nvar isCallable = require('is-callable');\n\nvar toStr = Object.prototype.toString;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\n/** @type {<This, A extends readonly unknown[]>(arr: A, iterator: (this: This | void, value: A[number], index: number, arr: A) => void, receiver: This | undefined) => void} */\nvar forEachArray = function forEachArray(array, iterator, receiver) {\n for (var i = 0, len = array.length; i < len; i++) {\n if (hasOwnProperty.call(array, i)) {\n if (receiver == null) {\n iterator(array[i], i, array);\n } else {\n iterator.call(receiver, array[i], i, array);\n }\n }\n }\n};\n\n/** @type {<This, S extends string>(string: S, iterator: (this: This | void, value: S[number], index: number, string: S) => void, receiver: This | undefined) => void} */\nvar forEachString = function forEachString(string, iterator, receiver) {\n for (var i = 0, len = string.length; i < len; i++) {\n // no such thing as a sparse string.\n if (receiver == null) {\n iterator(string.charAt(i), i, string);\n } else {\n iterator.call(receiver, string.charAt(i), i, string);\n }\n }\n};\n\n/** @type {<This, O>(obj: O, iterator: (this: This | void, value: O[keyof O], index: keyof O, obj: O) => void, receiver: This | undefined) => void} */\nvar forEachObject = function forEachObject(object, iterator, receiver) {\n for (var k in object) {\n if (hasOwnProperty.call(object, k)) {\n if (receiver == null) {\n iterator(object[k], k, object);\n } else {\n iterator.call(receiver, object[k], k, object);\n }\n }\n }\n};\n\n/** @type {(x: unknown) => x is readonly unknown[]} */\nfunction isArray(x) {\n return toStr.call(x) === '[object Array]';\n}\n\n/** @type {import('.')._internal} */\nmodule.exports = function forEach(list, iterator, thisArg) {\n if (!isCallable(iterator)) {\n throw new TypeError('iterator must be a function');\n }\n\n var receiver;\n if (arguments.length >= 3) {\n receiver = thisArg;\n }\n\n if (isArray(list)) {\n forEachArray(list, iterator, receiver);\n } else if (typeof list === 'string') {\n forEachString(list, iterator, receiver);\n } else {\n forEachObject(list, iterator, receiver);\n }\n};\n","'use strict';\n\nvar fnToStr = Function.prototype.toString;\nvar reflectApply = typeof Reflect === 'object' && Reflect !== null && Reflect.apply;\nvar badArrayLike;\nvar isCallableMarker;\nif (typeof reflectApply === 'function' && typeof Object.defineProperty === 'function') {\n\ttry {\n\t\tbadArrayLike = Object.defineProperty({}, 'length', {\n\t\t\tget: function () {\n\t\t\t\tthrow isCallableMarker;\n\t\t\t}\n\t\t});\n\t\tisCallableMarker = {};\n\t\t// eslint-disable-next-line no-throw-literal\n\t\treflectApply(function () { throw 42; }, null, badArrayLike);\n\t} catch (_) {\n\t\tif (_ !== isCallableMarker) {\n\t\t\treflectApply = null;\n\t\t}\n\t}\n} else {\n\treflectApply = null;\n}\n\nvar constructorRegex = /^\\s*class\\b/;\nvar isES6ClassFn = function isES6ClassFunction(value) {\n\ttry {\n\t\tvar fnStr = fnToStr.call(value);\n\t\treturn constructorRegex.test(fnStr);\n\t} catch (e) {\n\t\treturn false; // not a function\n\t}\n};\n\nvar tryFunctionObject = function tryFunctionToStr(value) {\n\ttry {\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tfnToStr.call(value);\n\t\treturn true;\n\t} catch (e) {\n\t\treturn false;\n\t}\n};\nvar toStr = Object.prototype.toString;\nvar objectClass = '[object Object]';\nvar fnClass = '[object Function]';\nvar genClass = '[object GeneratorFunction]';\nvar ddaClass = '[object HTMLAllCollection]'; // IE 11\nvar ddaClass2 = '[object HTML document.all class]';\nvar ddaClass3 = '[object HTMLCollection]'; // IE 9-10\nvar hasToStringTag = typeof Symbol === 'function' && !!Symbol.toStringTag; // better: use `has-tostringtag`\n\nvar isIE68 = !(0 in [,]); // eslint-disable-line no-sparse-arrays, comma-spacing\n\nvar isDDA = function isDocumentDotAll() { return false; };\nif (typeof document === 'object') {\n\t// Firefox 3 canonicalizes DDA to undefined when it's not accessed directly\n\tvar all = document.all;\n\tif (toStr.call(all) === toStr.call(document.all)) {\n\t\tisDDA = function isDocumentDotAll(value) {\n\t\t\t/* globals document: false */\n\t\t\t// in IE 6-8, typeof document.all is \"object\" and it's truthy\n\t\t\tif ((isIE68 || !value) && (typeof value === 'undefined' || typeof value === 'object')) {\n\t\t\t\ttry {\n\t\t\t\t\tvar str = toStr.call(value);\n\t\t\t\t\treturn (\n\t\t\t\t\t\tstr === ddaClass\n\t\t\t\t\t\t|| str === ddaClass2\n\t\t\t\t\t\t|| str === ddaClass3 // opera 12.16\n\t\t\t\t\t\t|| str === objectClass // IE 6-8\n\t\t\t\t\t) && value('') == null; // eslint-disable-line eqeqeq\n\t\t\t\t} catch (e) { /**/ }\n\t\t\t}\n\t\t\treturn false;\n\t\t};\n\t}\n}\n\nmodule.exports = reflectApply\n\t? function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\ttry {\n\t\t\treflectApply(value, null, badArrayLike);\n\t\t} catch (e) {\n\t\t\tif (e !== isCallableMarker) { return false; }\n\t\t}\n\t\treturn !isES6ClassFn(value) && tryFunctionObject(value);\n\t}\n\t: function isCallable(value) {\n\t\tif (isDDA(value)) { return true; }\n\t\tif (!value) { return false; }\n\t\tif (typeof value !== 'function' && typeof value !== 'object') { return false; }\n\t\tif (hasToStringTag) { return tryFunctionObject(value); }\n\t\tif (isES6ClassFn(value)) { return false; }\n\t\tvar strClass = toStr.call(value);\n\t\tif (strClass !== fnClass && strClass !== genClass && !(/^\\[object HTML/).test(strClass)) { return false; }\n\t\treturn tryFunctionObject(value);\n\t};\n","'use strict';\n\nvar possibleNames = require('possible-typed-array-names');\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\n\n/** @type {import('.')} */\nmodule.exports = function availableTypedArrays() {\n\tvar /** @type {ReturnType<typeof availableTypedArrays>} */ out = [];\n\tfor (var i = 0; i < possibleNames.length; i++) {\n\t\tif (typeof g[possibleNames[i]] === 'function') {\n\t\t\t// @ts-expect-error\n\t\t\tout[out.length] = possibleNames[i];\n\t\t}\n\t}\n\treturn out;\n};\n","'use strict';\n\n/** @type {import('.')} */\nmodule.exports = [\n\t'Float16Array',\n\t'Float32Array',\n\t'Float64Array',\n\t'Int8Array',\n\t'Int16Array',\n\t'Int32Array',\n\t'Uint8Array',\n\t'Uint8ClampedArray',\n\t'Uint16Array',\n\t'Uint32Array',\n\t'BigInt64Array',\n\t'BigUint64Array'\n];\n","'use strict';\n\nvar setFunctionLength = require('set-function-length');\n\nvar $defineProperty = require('es-define-property');\n\nvar callBindBasic = require('call-bind-apply-helpers');\nvar applyBind = require('call-bind-apply-helpers/applyBind');\n\nmodule.exports = function callBind(originalFunction) {\n\tvar func = callBindBasic(arguments);\n\tvar adjustedLength = originalFunction.length - (arguments.length - 1);\n\treturn setFunctionLength(\n\t\tfunc,\n\t\t1 + (adjustedLength > 0 ? adjustedLength : 0),\n\t\ttrue\n\t);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\nvar define = require('define-data-property');\nvar hasDescriptors = require('has-property-descriptors')();\nvar gOPD = require('gopd');\n\nvar $TypeError = require('es-errors/type');\nvar $floor = GetIntrinsic('%Math.floor%');\n\n/** @type {import('.')} */\nmodule.exports = function setFunctionLength(fn, length) {\n\tif (typeof fn !== 'function') {\n\t\tthrow new $TypeError('`fn` is not a function');\n\t}\n\tif (typeof length !== 'number' || length < 0 || length > 0xFFFFFFFF || $floor(length) !== length) {\n\t\tthrow new $TypeError('`length` must be a positive 32-bit integer');\n\t}\n\n\tvar loose = arguments.length > 2 && !!arguments[2];\n\n\tvar functionLengthIsConfigurable = true;\n\tvar functionLengthIsWritable = true;\n\tif ('length' in fn && gOPD) {\n\t\tvar desc = gOPD(fn, 'length');\n\t\tif (desc && !desc.configurable) {\n\t\t\tfunctionLengthIsConfigurable = false;\n\t\t}\n\t\tif (desc && !desc.writable) {\n\t\t\tfunctionLengthIsWritable = false;\n\t\t}\n\t}\n\n\tif (functionLengthIsConfigurable || functionLengthIsWritable || !loose) {\n\t\tif (hasDescriptors) {\n\t\t\tdefine(/** @type {Parameters<define>[0]} */ (fn), 'length', length, true, true);\n\t\t} else {\n\t\t\tdefine(/** @type {Parameters<define>[0]} */ (fn), 'length', length);\n\t\t}\n\t}\n\treturn fn;\n};\n","'use strict';\n\nvar $defineProperty = require('es-define-property');\n\nvar $SyntaxError = require('es-errors/syntax');\nvar $TypeError = require('es-errors/type');\n\nvar gopd = require('gopd');\n\n/** @type {import('.')} */\nmodule.exports = function defineDataProperty(\n\tobj,\n\tproperty,\n\tvalue\n) {\n\tif (!obj || (typeof obj !== 'object' && typeof obj !== 'function')) {\n\t\tthrow new $TypeError('`obj` must be an object or a function`');\n\t}\n\tif (typeof property !== 'string' && typeof property !== 'symbol') {\n\t\tthrow new $TypeError('`property` must be a string or a symbol`');\n\t}\n\tif (arguments.length > 3 && typeof arguments[3] !== 'boolean' && arguments[3] !== null) {\n\t\tthrow new $TypeError('`nonEnumerable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 4 && typeof arguments[4] !== 'boolean' && arguments[4] !== null) {\n\t\tthrow new $TypeError('`nonWritable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 5 && typeof arguments[5] !== 'boolean' && arguments[5] !== null) {\n\t\tthrow new $TypeError('`nonConfigurable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 6 && typeof arguments[6] !== 'boolean') {\n\t\tthrow new $TypeError('`loose`, if provided, must be a boolean');\n\t}\n\n\tvar nonEnumerable = arguments.length > 3 ? arguments[3] : null;\n\tvar nonWritable = arguments.length > 4 ? arguments[4] : null;\n\tvar nonConfigurable = arguments.length > 5 ? arguments[5] : null;\n\tvar loose = arguments.length > 6 ? arguments[6] : false;\n\n\t/* @type {false | TypedPropertyDescriptor<unknown>} */\n\tvar desc = !!gopd && gopd(obj, property);\n\n\tif ($defineProperty) {\n\t\t$defineProperty(obj, property, {\n\t\t\tconfigurable: nonConfigurable === null && desc ? desc.configurable : !nonConfigurable,\n\t\t\tenumerable: nonEnumerable === null && desc ? desc.enumerable : !nonEnumerable,\n\t\t\tvalue: value,\n\t\t\twritable: nonWritable === null && desc ? desc.writable : !nonWritable\n\t\t});\n\t} else if (loose || (!nonEnumerable && !nonWritable && !nonConfigurable)) {\n\t\t// must fall back to [[Set]], and was not explicitly asked to make non-enumerable, non-writable, or non-configurable\n\t\tobj[property] = value; // eslint-disable-line no-param-reassign\n\t} else {\n\t\tthrow new $SyntaxError('This environment does not support defining a property as non-configurable, non-writable, or non-enumerable.');\n\t}\n};\n","'use strict';\n\nvar bind = require('function-bind');\nvar $apply = require('./functionApply');\nvar actualApply = require('./actualApply');\n\n/** @type {import('./applyBind')} */\nmodule.exports = function applyBind() {\n\treturn actualApply(bind, $apply, arguments);\n};\n","'use strict';\n\n/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\n * in FIPS PUB 180-1\n * Version 2.1a Copyright Paul Johnston 2000 - 2002.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n * Distributed under the BSD License\n * See http://pajhome.org.uk/crypt/md5 for details.\n */\n\nvar inherits = require('inherits');\nvar Hash = require('./hash');\nvar Buffer = require('safe-buffer').Buffer;\n\nvar K = [\n\t0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n];\n\nvar W = new Array(80);\n\nfunction Sha1() {\n\tthis.init();\n\tthis._w = W;\n\n\tHash.call(this, 64, 56);\n}\n\ninherits(Sha1, Hash);\n\nSha1.prototype.init = function () {\n\tthis._a = 0x67452301;\n\tthis._b = 0xefcdab89;\n\tthis._c = 0x98badcfe;\n\tthis._d = 0x10325476;\n\tthis._e = 0xc3d2e1f0;\n\n\treturn this;\n};\n\nfunction rotl1(num) {\n\treturn (num << 1) | (num >>> 31);\n}\n\nfunction rotl5(num) {\n\treturn (num << 5) | (num >>> 27);\n}\n\nfunction rotl30(num) {\n\treturn (num << 30) | (num >>> 2);\n}\n\nfunction ft(s, b, c, d) {\n\tif (s === 0) {\n\t\treturn (b & c) | (~b & d);\n\t}\n\tif (s === 2) {\n\t\treturn (b & c) | (b & d) | (c & d);\n\t}\n\treturn b ^ c ^ d;\n}\n\nSha1.prototype._update = function (M) {\n\tvar w = this._w;\n\n\tvar a = this._a | 0;\n\tvar b = this._b | 0;\n\tvar c = this._c | 0;\n\tvar d = this._d | 0;\n\tvar e = this._e | 0;\n\n\tfor (var i = 0; i < 16; ++i) {\n\t\tw[i] = M.readInt32BE(i * 4);\n\t}\n\tfor (; i < 80; ++i) {\n\t\tw[i] = rotl1(w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]);\n\t}\n\n\tfor (var j = 0; j < 80; ++j) {\n\t\tvar s = ~~(j / 20);\n\t\tvar t = (rotl5(a) + ft(s, b, c, d) + e + w[j] + K[s]) | 0;\n\n\t\te = d;\n\t\td = c;\n\t\tc = rotl30(b);\n\t\tb = a;\n\t\ta = t;\n\t}\n\n\tthis._a = (a + this._a) | 0;\n\tthis._b = (b + this._b) | 0;\n\tthis._c = (c + this._c) | 0;\n\tthis._d = (d + this._d) | 0;\n\tthis._e = (e + this._e) | 0;\n};\n\nSha1.prototype._hash = function () {\n\tvar H = Buffer.allocUnsafe(20);\n\n\tH.writeInt32BE(this._a | 0, 0);\n\tH.writeInt32BE(this._b | 0, 4);\n\tH.writeInt32BE(this._c | 0, 8);\n\tH.writeInt32BE(this._d | 0, 12);\n\tH.writeInt32BE(this._e | 0, 16);\n\n\treturn H;\n};\n\nmodule.exports = Sha1;\n","'use strict';\n\n/**\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined\n * in FIPS 180-2\n * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n *\n */\n\nvar inherits = require('inherits');\nvar Sha256 = require('./sha256');\nvar Hash = require('./hash');\nvar Buffer = require('safe-buffer').Buffer;\n\nvar W = new Array(64);\n\nfunction Sha224() {\n\tthis.init();\n\n\tthis._w = W; // new Array(64)\n\n\tHash.call(this, 64, 56);\n}\n\ninherits(Sha224, Sha256);\n\nSha224.prototype.init = function () {\n\tthis._a = 0xc1059ed8;\n\tthis._b = 0x367cd507;\n\tthis._c = 0x3070dd17;\n\tthis._d = 0xf70e5939;\n\tthis._e = 0xffc00b31;\n\tthis._f = 0x68581511;\n\tthis._g = 0x64f98fa7;\n\tthis._h = 0xbefa4fa4;\n\n\treturn this;\n};\n\nSha224.prototype._hash = function () {\n\tvar H = Buffer.allocUnsafe(28);\n\n\tH.writeInt32BE(this._a, 0);\n\tH.writeInt32BE(this._b, 4);\n\tH.writeInt32BE(this._c, 8);\n\tH.writeInt32BE(this._d, 12);\n\tH.writeInt32BE(this._e, 16);\n\tH.writeInt32BE(this._f, 20);\n\tH.writeInt32BE(this._g, 24);\n\n\treturn H;\n};\n\nmodule.exports = Sha224;\n","'use strict';\n\n/**\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined\n * in FIPS 180-2\n * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n *\n */\n\nvar inherits = require('inherits');\nvar Hash = require('./hash');\nvar Buffer = require('safe-buffer').Buffer;\n\nvar K = [\n\t0x428A2F98,\n\t0x71374491,\n\t0xB5C0FBCF,\n\t0xE9B5DBA5,\n\t0x3956C25B,\n\t0x59F111F1,\n\t0x923F82A4,\n\t0xAB1C5ED5,\n\t0xD807AA98,\n\t0x12835B01,\n\t0x243185BE,\n\t0x550C7DC3,\n\t0x72BE5D74,\n\t0x80DEB1FE,\n\t0x9BDC06A7,\n\t0xC19BF174,\n\t0xE49B69C1,\n\t0xEFBE4786,\n\t0x0FC19DC6,\n\t0x240CA1CC,\n\t0x2DE92C6F,\n\t0x4A7484AA,\n\t0x5CB0A9DC,\n\t0x76F988DA,\n\t0x983E5152,\n\t0xA831C66D,\n\t0xB00327C8,\n\t0xBF597FC7,\n\t0xC6E00BF3,\n\t0xD5A79147,\n\t0x06CA6351,\n\t0x14292967,\n\t0x27B70A85,\n\t0x2E1B2138,\n\t0x4D2C6DFC,\n\t0x53380D13,\n\t0x650A7354,\n\t0x766A0ABB,\n\t0x81C2C92E,\n\t0x92722C85,\n\t0xA2BFE8A1,\n\t0xA81A664B,\n\t0xC24B8B70,\n\t0xC76C51A3,\n\t0xD192E819,\n\t0xD6990624,\n\t0xF40E3585,\n\t0x106AA070,\n\t0x19A4C116,\n\t0x1E376C08,\n\t0x2748774C,\n\t0x34B0BCB5,\n\t0x391C0CB3,\n\t0x4ED8AA4A,\n\t0x5B9CCA4F,\n\t0x682E6FF3,\n\t0x748F82EE,\n\t0x78A5636F,\n\t0x84C87814,\n\t0x8CC70208,\n\t0x90BEFFFA,\n\t0xA4506CEB,\n\t0xBEF9A3F7,\n\t0xC67178F2\n];\n\nvar W = new Array(64);\n\nfunction Sha256() {\n\tthis.init();\n\n\tthis._w = W; // new Array(64)\n\n\tHash.call(this, 64, 56);\n}\n\ninherits(Sha256, Hash);\n\nSha256.prototype.init = function () {\n\tthis._a = 0x6a09e667;\n\tthis._b = 0xbb67ae85;\n\tthis._c = 0x3c6ef372;\n\tthis._d = 0xa54ff53a;\n\tthis._e = 0x510e527f;\n\tthis._f = 0x9b05688c;\n\tthis._g = 0x1f83d9ab;\n\tthis._h = 0x5be0cd19;\n\n\treturn this;\n};\n\nfunction ch(x, y, z) {\n\treturn z ^ (x & (y ^ z));\n}\n\nfunction maj(x, y, z) {\n\treturn (x & y) | (z & (x | y));\n}\n\nfunction sigma0(x) {\n\treturn ((x >>> 2) | (x << 30)) ^ ((x >>> 13) | (x << 19)) ^ ((x >>> 22) | (x << 10));\n}\n\nfunction sigma1(x) {\n\treturn ((x >>> 6) | (x << 26)) ^ ((x >>> 11) | (x << 21)) ^ ((x >>> 25) | (x << 7));\n}\n\nfunction gamma0(x) {\n\treturn ((x >>> 7) | (x << 25)) ^ ((x >>> 18) | (x << 14)) ^ (x >>> 3);\n}\n\nfunction gamma1(x) {\n\treturn ((x >>> 17) | (x << 15)) ^ ((x >>> 19) | (x << 13)) ^ (x >>> 10);\n}\n\nSha256.prototype._update = function (M) {\n\tvar w = this._w;\n\n\tvar a = this._a | 0;\n\tvar b = this._b | 0;\n\tvar c = this._c | 0;\n\tvar d = this._d | 0;\n\tvar e = this._e | 0;\n\tvar f = this._f | 0;\n\tvar g = this._g | 0;\n\tvar h = this._h | 0;\n\n\tfor (var i = 0; i < 16; ++i) {\n\t\tw[i] = M.readInt32BE(i * 4);\n\t}\n\tfor (; i < 64; ++i) {\n\t\tw[i] = (gamma1(w[i - 2]) + w[i - 7] + gamma0(w[i - 15]) + w[i - 16]) | 0;\n\t}\n\n\tfor (var j = 0; j < 64; ++j) {\n\t\tvar T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + w[j]) | 0;\n\t\tvar T2 = (sigma0(a) + maj(a, b, c)) | 0;\n\n\t\th = g;\n\t\tg = f;\n\t\tf = e;\n\t\te = (d + T1) | 0;\n\t\td = c;\n\t\tc = b;\n\t\tb = a;\n\t\ta = (T1 + T2) | 0;\n\t}\n\n\tthis._a = (a + this._a) | 0;\n\tthis._b = (b + this._b) | 0;\n\tthis._c = (c + this._c) | 0;\n\tthis._d = (d + this._d) | 0;\n\tthis._e = (e + this._e) | 0;\n\tthis._f = (f + this._f) | 0;\n\tthis._g = (g + this._g) | 0;\n\tthis._h = (h + this._h) | 0;\n};\n\nSha256.prototype._hash = function () {\n\tvar H = Buffer.allocUnsafe(32);\n\n\tH.writeInt32BE(this._a, 0);\n\tH.writeInt32BE(this._b, 4);\n\tH.writeInt32BE(this._c, 8);\n\tH.writeInt32BE(this._d, 12);\n\tH.writeInt32BE(this._e, 16);\n\tH.writeInt32BE(this._f, 20);\n\tH.writeInt32BE(this._g, 24);\n\tH.writeInt32BE(this._h, 28);\n\n\treturn H;\n};\n\nmodule.exports = Sha256;\n","'use strict';\n\nvar inherits = require('inherits');\nvar SHA512 = require('./sha512');\nvar Hash = require('./hash');\nvar Buffer = require('safe-buffer').Buffer;\n\nvar W = new Array(160);\n\nfunction Sha384() {\n\tthis.init();\n\tthis._w = W;\n\n\tHash.call(this, 128, 112);\n}\n\ninherits(Sha384, SHA512);\n\nSha384.prototype.init = function () {\n\tthis._ah = 0xcbbb9d5d;\n\tthis._bh = 0x629a292a;\n\tthis._ch = 0x9159015a;\n\tthis._dh = 0x152fecd8;\n\tthis._eh = 0x67332667;\n\tthis._fh = 0x8eb44a87;\n\tthis._gh = 0xdb0c2e0d;\n\tthis._hh = 0x47b5481d;\n\n\tthis._al = 0xc1059ed8;\n\tthis._bl = 0x367cd507;\n\tthis._cl = 0x3070dd17;\n\tthis._dl = 0xf70e5939;\n\tthis._el = 0xffc00b31;\n\tthis._fl = 0x68581511;\n\tthis._gl = 0x64f98fa7;\n\tthis._hl = 0xbefa4fa4;\n\n\treturn this;\n};\n\nSha384.prototype._hash = function () {\n\tvar H = Buffer.allocUnsafe(48);\n\n\tfunction writeInt64BE(h, l, offset) {\n\t\tH.writeInt32BE(h, offset);\n\t\tH.writeInt32BE(l, offset + 4);\n\t}\n\n\twriteInt64BE(this._ah, this._al, 0);\n\twriteInt64BE(this._bh, this._bl, 8);\n\twriteInt64BE(this._ch, this._cl, 16);\n\twriteInt64BE(this._dh, this._dl, 24);\n\twriteInt64BE(this._eh, this._el, 32);\n\twriteInt64BE(this._fh, this._fl, 40);\n\n\treturn H;\n};\n\nmodule.exports = Sha384;\n","'use strict';\n\nvar inherits = require('inherits');\nvar Hash = require('./hash');\nvar Buffer = require('safe-buffer').Buffer;\n\nvar K = [\n\t0x428a2f98,\n\t0xd728ae22,\n\t0x71374491,\n\t0x23ef65cd,\n\t0xb5c0fbcf,\n\t0xec4d3b2f,\n\t0xe9b5dba5,\n\t0x8189dbbc,\n\t0x3956c25b,\n\t0xf348b538,\n\t0x59f111f1,\n\t0xb605d019,\n\t0x923f82a4,\n\t0xaf194f9b,\n\t0xab1c5ed5,\n\t0xda6d8118,\n\t0xd807aa98,\n\t0xa3030242,\n\t0x12835b01,\n\t0x45706fbe,\n\t0x243185be,\n\t0x4ee4b28c,\n\t0x550c7dc3,\n\t0xd5ffb4e2,\n\t0x72be5d74,\n\t0xf27b896f,\n\t0x80deb1fe,\n\t0x3b1696b1,\n\t0x9bdc06a7,\n\t0x25c71235,\n\t0xc19bf174,\n\t0xcf692694,\n\t0xe49b69c1,\n\t0x9ef14ad2,\n\t0xefbe4786,\n\t0x384f25e3,\n\t0x0fc19dc6,\n\t0x8b8cd5b5,\n\t0x240ca1cc,\n\t0x77ac9c65,\n\t0x2de92c6f,\n\t0x592b0275,\n\t0x4a7484aa,\n\t0x6ea6e483,\n\t0x5cb0a9dc,\n\t0xbd41fbd4,\n\t0x76f988da,\n\t0x831153b5,\n\t0x983e5152,\n\t0xee66dfab,\n\t0xa831c66d,\n\t0x2db43210,\n\t0xb00327c8,\n\t0x98fb213f,\n\t0xbf597fc7,\n\t0xbeef0ee4,\n\t0xc6e00bf3,\n\t0x3da88fc2,\n\t0xd5a79147,\n\t0x930aa725,\n\t0x06ca6351,\n\t0xe003826f,\n\t0x14292967,\n\t0x0a0e6e70,\n\t0x27b70a85,\n\t0x46d22ffc,\n\t0x2e1b2138,\n\t0x5c26c926,\n\t0x4d2c6dfc,\n\t0x5ac42aed,\n\t0x53380d13,\n\t0x9d95b3df,\n\t0x650a7354,\n\t0x8baf63de,\n\t0x766a0abb,\n\t0x3c77b2a8,\n\t0x81c2c92e,\n\t0x47edaee6,\n\t0x92722c85,\n\t0x1482353b,\n\t0xa2bfe8a1,\n\t0x4cf10364,\n\t0xa81a664b,\n\t0xbc423001,\n\t0xc24b8b70,\n\t0xd0f89791,\n\t0xc76c51a3,\n\t0x0654be30,\n\t0xd192e819,\n\t0xd6ef5218,\n\t0xd6990624,\n\t0x5565a910,\n\t0xf40e3585,\n\t0x5771202a,\n\t0x106aa070,\n\t0x32bbd1b8,\n\t0x19a4c116,\n\t0xb8d2d0c8,\n\t0x1e376c08,\n\t0x5141ab53,\n\t0x2748774c,\n\t0xdf8eeb99,\n\t0x34b0bcb5,\n\t0xe19b48a8,\n\t0x391c0cb3,\n\t0xc5c95a63,\n\t0x4ed8aa4a,\n\t0xe3418acb,\n\t0x5b9cca4f,\n\t0x7763e373,\n\t0x682e6ff3,\n\t0xd6b2b8a3,\n\t0x748f82ee,\n\t0x5defb2fc,\n\t0x78a5636f,\n\t0x43172f60,\n\t0x84c87814,\n\t0xa1f0ab72,\n\t0x8cc70208,\n\t0x1a6439ec,\n\t0x90befffa,\n\t0x23631e28,\n\t0xa4506ceb,\n\t0xde82bde9,\n\t0xbef9a3f7,\n\t0xb2c67915,\n\t0xc67178f2,\n\t0xe372532b,\n\t0xca273ece,\n\t0xea26619c,\n\t0xd186b8c7,\n\t0x21c0c207,\n\t0xeada7dd6,\n\t0xcde0eb1e,\n\t0xf57d4f7f,\n\t0xee6ed178,\n\t0x06f067aa,\n\t0x72176fba,\n\t0x0a637dc5,\n\t0xa2c898a6,\n\t0x113f9804,\n\t0xbef90dae,\n\t0x1b710b35,\n\t0x131c471b,\n\t0x28db77f5,\n\t0x23047d84,\n\t0x32caab7b,\n\t0x40c72493,\n\t0x3c9ebe0a,\n\t0x15c9bebc,\n\t0x431d67c4,\n\t0x9c100d4c,\n\t0x4cc5d4be,\n\t0xcb3e42b6,\n\t0x597f299c,\n\t0xfc657e2a,\n\t0x5fcb6fab,\n\t0x3ad6faec,\n\t0x6c44198c,\n\t0x4a475817\n];\n\nvar W = new Array(160);\n\nfunction Sha512() {\n\tthis.init();\n\tthis._w = W;\n\n\tHash.call(this, 128, 112);\n}\n\ninherits(Sha512, Hash);\n\nSha512.prototype.init = function () {\n\tthis._ah = 0x6a09e667;\n\tthis._bh = 0xbb67ae85;\n\tthis._ch = 0x3c6ef372;\n\tthis._dh = 0xa54ff53a;\n\tthis._eh = 0x510e527f;\n\tthis._fh = 0x9b05688c;\n\tthis._gh = 0x1f83d9ab;\n\tthis._hh = 0x5be0cd19;\n\n\tthis._al = 0xf3bcc908;\n\tthis._bl = 0x84caa73b;\n\tthis._cl = 0xfe94f82b;\n\tthis._dl = 0x5f1d36f1;\n\tthis._el = 0xade682d1;\n\tthis._fl = 0x2b3e6c1f;\n\tthis._gl = 0xfb41bd6b;\n\tthis._hl = 0x137e2179;\n\n\treturn this;\n};\n\nfunction Ch(x, y, z) {\n\treturn z ^ (x & (y ^ z));\n}\n\nfunction maj(x, y, z) {\n\treturn (x & y) | (z & (x | y));\n}\n\nfunction sigma0(x, xl) {\n\treturn ((x >>> 28) | (xl << 4)) ^ ((xl >>> 2) | (x << 30)) ^ ((xl >>> 7) | (x << 25));\n}\n\nfunction sigma1(x, xl) {\n\treturn ((x >>> 14) | (xl << 18)) ^ ((x >>> 18) | (xl << 14)) ^ ((xl >>> 9) | (x << 23));\n}\n\nfunction Gamma0(x, xl) {\n\treturn ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ (x >>> 7);\n}\n\nfunction Gamma0l(x, xl) {\n\treturn ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ ((x >>> 7) | (xl << 25));\n}\n\nfunction Gamma1(x, xl) {\n\treturn ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ (x >>> 6);\n}\n\nfunction Gamma1l(x, xl) {\n\treturn ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ ((x >>> 6) | (xl << 26));\n}\n\nfunction getCarry(a, b) {\n\treturn (a >>> 0) < (b >>> 0) ? 1 : 0;\n}\n\nSha512.prototype._update = function (M) {\n\tvar w = this._w;\n\n\tvar ah = this._ah | 0;\n\tvar bh = this._bh | 0;\n\tvar ch = this._ch | 0;\n\tvar dh = this._dh | 0;\n\tvar eh = this._eh | 0;\n\tvar fh = this._fh | 0;\n\tvar gh = this._gh | 0;\n\tvar hh = this._hh | 0;\n\n\tvar al = this._al | 0;\n\tvar bl = this._bl | 0;\n\tvar cl = this._cl | 0;\n\tvar dl = this._dl | 0;\n\tvar el = this._el | 0;\n\tvar fl = this._fl | 0;\n\tvar gl = this._gl | 0;\n\tvar hl = this._hl | 0;\n\n\tfor (var i = 0; i < 32; i += 2) {\n\t\tw[i] = M.readInt32BE(i * 4);\n\t\tw[i + 1] = M.readInt32BE((i * 4) + 4);\n\t}\n\tfor (; i < 160; i += 2) {\n\t\tvar xh = w[i - (15 * 2)];\n\t\tvar xl = w[i - (15 * 2) + 1];\n\t\tvar gamma0 = Gamma0(xh, xl);\n\t\tvar gamma0l = Gamma0l(xl, xh);\n\n\t\txh = w[i - (2 * 2)];\n\t\txl = w[i - (2 * 2) + 1];\n\t\tvar gamma1 = Gamma1(xh, xl);\n\t\tvar gamma1l = Gamma1l(xl, xh);\n\n\t\t// w[i] = gamma0 + w[i - 7] + gamma1 + w[i - 16]\n\t\tvar Wi7h = w[i - (7 * 2)];\n\t\tvar Wi7l = w[i - (7 * 2) + 1];\n\n\t\tvar Wi16h = w[i - (16 * 2)];\n\t\tvar Wi16l = w[i - (16 * 2) + 1];\n\n\t\tvar Wil = (gamma0l + Wi7l) | 0;\n\t\tvar Wih = (gamma0 + Wi7h + getCarry(Wil, gamma0l)) | 0;\n\t\tWil = (Wil + gamma1l) | 0;\n\t\tWih = (Wih + gamma1 + getCarry(Wil, gamma1l)) | 0;\n\t\tWil = (Wil + Wi16l) | 0;\n\t\tWih = (Wih + Wi16h + getCarry(Wil, Wi16l)) | 0;\n\n\t\tw[i] = Wih;\n\t\tw[i + 1] = Wil;\n\t}\n\n\tfor (var j = 0; j < 160; j += 2) {\n\t\tWih = w[j];\n\t\tWil = w[j + 1];\n\n\t\tvar majh = maj(ah, bh, ch);\n\t\tvar majl = maj(al, bl, cl);\n\n\t\tvar sigma0h = sigma0(ah, al);\n\t\tvar sigma0l = sigma0(al, ah);\n\t\tvar sigma1h = sigma1(eh, el);\n\t\tvar sigma1l = sigma1(el, eh);\n\n\t\t// t1 = h + sigma1 + ch + K[j] + w[j]\n\t\tvar Kih = K[j];\n\t\tvar Kil = K[j + 1];\n\n\t\tvar chh = Ch(eh, fh, gh);\n\t\tvar chl = Ch(el, fl, gl);\n\n\t\tvar t1l = (hl + sigma1l) | 0;\n\t\tvar t1h = (hh + sigma1h + getCarry(t1l, hl)) | 0;\n\t\tt1l = (t1l + chl) | 0;\n\t\tt1h = (t1h + chh + getCarry(t1l, chl)) | 0;\n\t\tt1l = (t1l + Kil) | 0;\n\t\tt1h = (t1h + Kih + getCarry(t1l, Kil)) | 0;\n\t\tt1l = (t1l + Wil) | 0;\n\t\tt1h = (t1h + Wih + getCarry(t1l, Wil)) | 0;\n\n\t\t// t2 = sigma0 + maj\n\t\tvar t2l = (sigma0l + majl) | 0;\n\t\tvar t2h = (sigma0h + majh + getCarry(t2l, sigma0l)) | 0;\n\n\t\thh = gh;\n\t\thl = gl;\n\t\tgh = fh;\n\t\tgl = fl;\n\t\tfh = eh;\n\t\tfl = el;\n\t\tel = (dl + t1l) | 0;\n\t\teh = (dh + t1h + getCarry(el, dl)) | 0;\n\t\tdh = ch;\n\t\tdl = cl;\n\t\tch = bh;\n\t\tcl = bl;\n\t\tbh = ah;\n\t\tbl = al;\n\t\tal = (t1l + t2l) | 0;\n\t\tah = (t1h + t2h + getCarry(al, t1l)) | 0;\n\t}\n\n\tthis._al = (this._al + al) | 0;\n\tthis._bl = (this._bl + bl) | 0;\n\tthis._cl = (this._cl + cl) | 0;\n\tthis._dl = (this._dl + dl) | 0;\n\tthis._el = (this._el + el) | 0;\n\tthis._fl = (this._fl + fl) | 0;\n\tthis._gl = (this._gl + gl) | 0;\n\tthis._hl = (this._hl + hl) | 0;\n\n\tthis._ah = (this._ah + ah + getCarry(this._al, al)) | 0;\n\tthis._bh = (this._bh + bh + getCarry(this._bl, bl)) | 0;\n\tthis._ch = (this._ch + ch + getCarry(this._cl, cl)) | 0;\n\tthis._dh = (this._dh + dh + getCarry(this._dl, dl)) | 0;\n\tthis._eh = (this._eh + eh + getCarry(this._el, el)) | 0;\n\tthis._fh = (this._fh + fh + getCarry(this._fl, fl)) | 0;\n\tthis._gh = (this._gh + gh + getCarry(this._gl, gl)) | 0;\n\tthis._hh = (this._hh + hh + getCarry(this._hl, hl)) | 0;\n};\n\nSha512.prototype._hash = function () {\n\tvar H = Buffer.allocUnsafe(64);\n\n\tfunction writeInt64BE(h, l, offset) {\n\t\tH.writeInt32BE(h, offset);\n\t\tH.writeInt32BE(l, offset + 4);\n\t}\n\n\twriteInt64BE(this._ah, this._al, 0);\n\twriteInt64BE(this._bh, this._bl, 8);\n\twriteInt64BE(this._ch, this._cl, 16);\n\twriteInt64BE(this._dh, this._dl, 24);\n\twriteInt64BE(this._eh, this._el, 32);\n\twriteInt64BE(this._fh, this._fl, 40);\n\twriteInt64BE(this._gh, this._gl, 48);\n\twriteInt64BE(this._hh, this._hl, 56);\n\n\treturn H;\n};\n\nmodule.exports = Sha512;\n","'use strict'\nvar assert = require('./assert')\nvar der = require('./der')\nvar messages = require('./messages.json')\n\nfunction initCompressedValue (value, defaultValue) {\n if (value === undefined) return defaultValue\n\n assert.isBoolean(value, messages.COMPRESSED_TYPE_INVALID)\n return value\n}\n\nmodule.exports = function (secp256k1) {\n return {\n privateKeyVerify: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n return privateKey.length === 32 && secp256k1.privateKeyVerify(privateKey)\n },\n\n privateKeyExport: function (privateKey, compressed) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n var publicKey = secp256k1.privateKeyExport(privateKey, compressed)\n\n return der.privateKeyExport(privateKey, publicKey, compressed)\n },\n\n privateKeyImport: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n\n privateKey = der.privateKeyImport(privateKey)\n if (privateKey && privateKey.length === 32 && secp256k1.privateKeyVerify(privateKey)) return privateKey\n\n throw new Error(messages.EC_PRIVATE_KEY_IMPORT_DER_FAIL)\n },\n\n privateKeyNegate: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n return secp256k1.privateKeyNegate(privateKey)\n },\n\n privateKeyModInverse: function (privateKey) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n return secp256k1.privateKeyModInverse(privateKey)\n },\n\n privateKeyTweakAdd: function (privateKey, tweak) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n return secp256k1.privateKeyTweakAdd(privateKey, tweak)\n },\n\n privateKeyTweakMul: function (privateKey, tweak) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n return secp256k1.privateKeyTweakMul(privateKey, tweak)\n },\n\n publicKeyCreate: function (privateKey, compressed) {\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyCreate(privateKey, compressed)\n },\n\n publicKeyConvert: function (publicKey, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyConvert(publicKey, compressed)\n },\n\n publicKeyVerify: function (publicKey) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n return secp256k1.publicKeyVerify(publicKey)\n },\n\n publicKeyTweakAdd: function (publicKey, tweak, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyTweakAdd(publicKey, tweak, compressed)\n },\n\n publicKeyTweakMul: function (publicKey, tweak, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(tweak, messages.TWEAK_TYPE_INVALID)\n assert.isBufferLength(tweak, 32, messages.TWEAK_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyTweakMul(publicKey, tweak, compressed)\n },\n\n publicKeyCombine: function (publicKeys, compressed) {\n assert.isArray(publicKeys, messages.EC_PUBLIC_KEYS_TYPE_INVALID)\n assert.isLengthGTZero(publicKeys, messages.EC_PUBLIC_KEYS_LENGTH_INVALID)\n for (var i = 0; i < publicKeys.length; ++i) {\n assert.isBuffer(publicKeys[i], messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKeys[i], 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n }\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.publicKeyCombine(publicKeys, compressed)\n },\n\n signatureNormalize: function (signature) {\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n return secp256k1.signatureNormalize(signature)\n },\n\n signatureExport: function (signature) {\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n var sigObj = secp256k1.signatureExport(signature)\n return der.signatureExport(sigObj)\n },\n\n signatureImport: function (sig) {\n assert.isBuffer(sig, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isLengthGTZero(sig, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n var sigObj = der.signatureImport(sig)\n if (sigObj) return secp256k1.signatureImport(sigObj)\n\n throw new Error(messages.ECDSA_SIGNATURE_PARSE_DER_FAIL)\n },\n\n signatureImportLax: function (sig) {\n assert.isBuffer(sig, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isLengthGTZero(sig, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n var sigObj = der.signatureImportLax(sig)\n if (sigObj) return secp256k1.signatureImport(sigObj)\n\n throw new Error(messages.ECDSA_SIGNATURE_PARSE_DER_FAIL)\n },\n\n sign: function (message, privateKey, options) {\n assert.isBuffer(message, messages.MSG32_TYPE_INVALID)\n assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID)\n\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n var data = null\n var noncefn = null\n if (options !== undefined) {\n assert.isObject(options, messages.OPTIONS_TYPE_INVALID)\n\n if (options.data !== undefined) {\n assert.isBuffer(options.data, messages.OPTIONS_DATA_TYPE_INVALID)\n assert.isBufferLength(options.data, 32, messages.OPTIONS_DATA_LENGTH_INVALID)\n data = options.data\n }\n\n if (options.noncefn !== undefined) {\n assert.isFunction(options.noncefn, messages.OPTIONS_NONCEFN_TYPE_INVALID)\n noncefn = options.noncefn\n }\n }\n\n return secp256k1.sign(message, privateKey, noncefn, data)\n },\n\n verify: function (message, signature, publicKey) {\n assert.isBuffer(message, messages.MSG32_TYPE_INVALID)\n assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID)\n\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n return secp256k1.verify(message, signature, publicKey)\n },\n\n recover: function (message, signature, recovery, compressed) {\n assert.isBuffer(message, messages.MSG32_TYPE_INVALID)\n assert.isBufferLength(message, 32, messages.MSG32_LENGTH_INVALID)\n\n assert.isBuffer(signature, messages.ECDSA_SIGNATURE_TYPE_INVALID)\n assert.isBufferLength(signature, 64, messages.ECDSA_SIGNATURE_LENGTH_INVALID)\n\n assert.isNumber(recovery, messages.RECOVERY_ID_TYPE_INVALID)\n assert.isNumberInInterval(recovery, -1, 4, messages.RECOVERY_ID_VALUE_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.recover(message, signature, recovery, compressed)\n },\n\n ecdh: function (publicKey, privateKey) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n return secp256k1.ecdh(publicKey, privateKey)\n },\n\n ecdhUnsafe: function (publicKey, privateKey, compressed) {\n assert.isBuffer(publicKey, messages.EC_PUBLIC_KEY_TYPE_INVALID)\n assert.isBufferLength2(publicKey, 33, 65, messages.EC_PUBLIC_KEY_LENGTH_INVALID)\n\n assert.isBuffer(privateKey, messages.EC_PRIVATE_KEY_TYPE_INVALID)\n assert.isBufferLength(privateKey, 32, messages.EC_PRIVATE_KEY_LENGTH_INVALID)\n\n compressed = initCompressedValue(compressed, true)\n\n return secp256k1.ecdhUnsafe(publicKey, privateKey, compressed)\n }\n }\n}\n","'use strict'\nvar toString = Object.prototype.toString\n\n// TypeError\nexports.isArray = function (value, message) {\n if (!Array.isArray(value)) throw TypeError(message)\n}\n\nexports.isBoolean = function (value, message) {\n if (toString.call(value) !== '[object Boolean]') throw TypeError(message)\n}\n\nexports.isBuffer = function (value, message) {\n if (!Buffer.isBuffer(value)) throw TypeError(message)\n}\n\nexports.isFunction = function (value, message) {\n if (toString.call(value) !== '[object Function]') throw TypeError(message)\n}\n\nexports.isNumber = function (value, message) {\n if (toString.call(value) !== '[object Number]') throw TypeError(message)\n}\n\nexports.isObject = function (value, message) {\n if (toString.call(value) !== '[object Object]') throw TypeError(message)\n}\n\n// RangeError\nexports.isBufferLength = function (buffer, length, message) {\n if (buffer.length !== length) throw RangeError(message)\n}\n\nexports.isBufferLength2 = function (buffer, length1, length2, message) {\n if (buffer.length !== length1 && buffer.length !== length2) throw RangeError(message)\n}\n\nexports.isLengthGTZero = function (value, message) {\n if (value.length === 0) throw RangeError(message)\n}\n\nexports.isNumberInInterval = function (number, x, y, message) {\n if (number <= x || number >= y) throw RangeError(message)\n}\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar bip66 = require('bip66')\n\nvar EC_PRIVKEY_EXPORT_DER_COMPRESSED = Buffer.from([\n // begin\n 0x30, 0x81, 0xd3, 0x02, 0x01, 0x01, 0x04, 0x20,\n // private key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n // middle\n 0xa0, 0x81, 0x85, 0x30, 0x81, 0x82, 0x02, 0x01, 0x01, 0x30, 0x2c, 0x06, 0x07, 0x2a, 0x86, 0x48,\n 0xcE, 0x3d, 0x01, 0x01, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xfE, 0xff, 0xff, 0xfc, 0x2f, 0x30, 0x06, 0x04, 0x01, 0x00, 0x04, 0x01, 0x07, 0x04,\n 0x21, 0x02, 0x79, 0xbE, 0x66, 0x7E, 0xf9, 0xdc, 0xbb, 0xac, 0x55, 0xa0, 0x62, 0x95, 0xcE, 0x87,\n 0x0b, 0x07, 0x02, 0x9b, 0xfc, 0xdb, 0x2d, 0xcE, 0x28, 0xd9, 0x59, 0xf2, 0x81, 0x5b, 0x16, 0xf8,\n 0x17, 0x98, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xfE, 0xba, 0xaE, 0xdc, 0xE6, 0xaf, 0x48, 0xa0, 0x3b, 0xbf, 0xd2, 0x5E,\n 0x8c, 0xd0, 0x36, 0x41, 0x41, 0x02, 0x01, 0x01, 0xa1, 0x24, 0x03, 0x22, 0x00,\n // public key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00\n])\n\nvar EC_PRIVKEY_EXPORT_DER_UNCOMPRESSED = Buffer.from([\n // begin\n 0x30, 0x82, 0x01, 0x13, 0x02, 0x01, 0x01, 0x04, 0x20,\n // private key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n // middle\n 0xa0, 0x81, 0xa5, 0x30, 0x81, 0xa2, 0x02, 0x01, 0x01, 0x30, 0x2c, 0x06, 0x07, 0x2a, 0x86, 0x48,\n 0xcE, 0x3d, 0x01, 0x01, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xfE, 0xff, 0xff, 0xfc, 0x2f, 0x30, 0x06, 0x04, 0x01, 0x00, 0x04, 0x01, 0x07, 0x04,\n 0x41, 0x04, 0x79, 0xbE, 0x66, 0x7E, 0xf9, 0xdc, 0xbb, 0xac, 0x55, 0xa0, 0x62, 0x95, 0xcE, 0x87,\n 0x0b, 0x07, 0x02, 0x9b, 0xfc, 0xdb, 0x2d, 0xcE, 0x28, 0xd9, 0x59, 0xf2, 0x81, 0x5b, 0x16, 0xf8,\n 0x17, 0x98, 0x48, 0x3a, 0xda, 0x77, 0x26, 0xa3, 0xc4, 0x65, 0x5d, 0xa4, 0xfb, 0xfc, 0x0E, 0x11,\n 0x08, 0xa8, 0xfd, 0x17, 0xb4, 0x48, 0xa6, 0x85, 0x54, 0x19, 0x9c, 0x47, 0xd0, 0x8f, 0xfb, 0x10,\n 0xd4, 0xb8, 0x02, 0x21, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0xff, 0xff, 0xff, 0xfE, 0xba, 0xaE, 0xdc, 0xE6, 0xaf, 0x48, 0xa0, 0x3b, 0xbf, 0xd2, 0x5E,\n 0x8c, 0xd0, 0x36, 0x41, 0x41, 0x02, 0x01, 0x01, 0xa1, 0x44, 0x03, 0x42, 0x00,\n // public key\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,\n 0x00\n])\n\nexports.privateKeyExport = function (privateKey, publicKey, compressed) {\n var result = Buffer.from(compressed ? EC_PRIVKEY_EXPORT_DER_COMPRESSED : EC_PRIVKEY_EXPORT_DER_UNCOMPRESSED)\n privateKey.copy(result, compressed ? 8 : 9)\n publicKey.copy(result, compressed ? 181 : 214)\n return result\n}\n\nexports.privateKeyImport = function (privateKey) {\n var length = privateKey.length\n\n // sequence header\n var index = 0\n if (length < index + 1 || privateKey[index] !== 0x30) return\n index += 1\n\n // sequence length constructor\n if (length < index + 1 || !(privateKey[index] & 0x80)) return\n\n var lenb = privateKey[index] & 0x7f\n index += 1\n if (lenb < 1 || lenb > 2) return\n if (length < index + lenb) return\n\n // sequence length\n var len = privateKey[index + lenb - 1] | (lenb > 1 ? privateKey[index + lenb - 2] << 8 : 0)\n index += lenb\n if (length < index + len) return\n\n // sequence element 0: version number (=1)\n if (length < index + 3 ||\n privateKey[index] !== 0x02 ||\n privateKey[index + 1] !== 0x01 ||\n privateKey[index + 2] !== 0x01) {\n return\n }\n index += 3\n\n // sequence element 1: octet string, up to 32 bytes\n if (length < index + 2 ||\n privateKey[index] !== 0x04 ||\n privateKey[index + 1] > 0x20 ||\n length < index + 2 + privateKey[index + 1]) {\n return\n }\n\n return privateKey.slice(index + 2, index + 2 + privateKey[index + 1])\n}\n\nexports.signatureExport = function (sigObj) {\n var r = Buffer.concat([Buffer.from([0]), sigObj.r])\n for (var lenR = 33, posR = 0; lenR > 1 && r[posR] === 0x00 && !(r[posR + 1] & 0x80); --lenR, ++posR);\n\n var s = Buffer.concat([Buffer.from([0]), sigObj.s])\n for (var lenS = 33, posS = 0; lenS > 1 && s[posS] === 0x00 && !(s[posS + 1] & 0x80); --lenS, ++posS);\n\n return bip66.encode(r.slice(posR), s.slice(posS))\n}\n\nexports.signatureImport = function (sig) {\n var r = Buffer.alloc(32, 0)\n var s = Buffer.alloc(32, 0)\n\n try {\n var sigObj = bip66.decode(sig)\n if (sigObj.r.length === 33 && sigObj.r[0] === 0x00) sigObj.r = sigObj.r.slice(1)\n if (sigObj.r.length > 32) throw new Error('R length is too long')\n if (sigObj.s.length === 33 && sigObj.s[0] === 0x00) sigObj.s = sigObj.s.slice(1)\n if (sigObj.s.length > 32) throw new Error('S length is too long')\n } catch (err) {\n return\n }\n\n sigObj.r.copy(r, 32 - sigObj.r.length)\n sigObj.s.copy(s, 32 - sigObj.s.length)\n\n return { r: r, s: s }\n}\n\nexports.signatureImportLax = function (sig) {\n var r = Buffer.alloc(32, 0)\n var s = Buffer.alloc(32, 0)\n\n var length = sig.length\n var index = 0\n\n // sequence tag byte\n if (sig[index++] !== 0x30) return\n\n // sequence length byte\n var lenbyte = sig[index++]\n if (lenbyte & 0x80) {\n index += lenbyte - 0x80\n if (index > length) return\n }\n\n // sequence tag byte for r\n if (sig[index++] !== 0x02) return\n\n // length for r\n var rlen = sig[index++]\n if (rlen & 0x80) {\n lenbyte = rlen - 0x80\n if (index + lenbyte > length) return\n for (; lenbyte > 0 && sig[index] === 0x00; index += 1, lenbyte -= 1);\n for (rlen = 0; lenbyte > 0; index += 1, lenbyte -= 1) rlen = (rlen << 8) + sig[index]\n }\n if (rlen > length - index) return\n var rindex = index\n index += rlen\n\n // sequence tag byte for s\n if (sig[index++] !== 0x02) return\n\n // length for s\n var slen = sig[index++]\n if (slen & 0x80) {\n lenbyte = slen - 0x80\n if (index + lenbyte > length) return\n for (; lenbyte > 0 && sig[index] === 0x00; index += 1, lenbyte -= 1);\n for (slen = 0; lenbyte > 0; index += 1, lenbyte -= 1) slen = (slen << 8) + sig[index]\n }\n if (slen > length - index) return\n var sindex = index\n index += slen\n\n // ignore leading zeros in r\n for (; rlen > 0 && sig[rindex] === 0x00; rlen -= 1, rindex += 1);\n // copy r value\n if (rlen > 32) return\n var rvalue = sig.slice(rindex, rindex + rlen)\n rvalue.copy(r, 32 - rvalue.length)\n\n // ignore leading zeros in s\n for (; slen > 0 && sig[sindex] === 0x00; slen -= 1, sindex += 1);\n // copy s value\n if (slen > 32) return\n var svalue = sig.slice(sindex, sindex + slen)\n svalue.copy(s, 32 - svalue.length)\n\n return { r: r, s: s }\n}\n","// Reference https://github.com/bitcoin/bips/blob/master/bip-0066.mediawiki\n// Format: 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S]\n// NOTE: SIGHASH byte ignored AND restricted, truncate before use\n\nvar Buffer = require('safe-buffer').Buffer\n\nfunction check (buffer) {\n if (buffer.length < 8) return false\n if (buffer.length > 72) return false\n if (buffer[0] !== 0x30) return false\n if (buffer[1] !== buffer.length - 2) return false\n if (buffer[2] !== 0x02) return false\n\n var lenR = buffer[3]\n if (lenR === 0) return false\n if (5 + lenR >= buffer.length) return false\n if (buffer[4 + lenR] !== 0x02) return false\n\n var lenS = buffer[5 + lenR]\n if (lenS === 0) return false\n if ((6 + lenR + lenS) !== buffer.length) return false\n\n if (buffer[4] & 0x80) return false\n if (lenR > 1 && (buffer[4] === 0x00) && !(buffer[5] & 0x80)) return false\n\n if (buffer[lenR + 6] & 0x80) return false\n if (lenS > 1 && (buffer[lenR + 6] === 0x00) && !(buffer[lenR + 7] & 0x80)) return false\n return true\n}\n\nfunction decode (buffer) {\n if (buffer.length < 8) throw new Error('DER sequence length is too short')\n if (buffer.length > 72) throw new Error('DER sequence length is too long')\n if (buffer[0] !== 0x30) throw new Error('Expected DER sequence')\n if (buffer[1] !== buffer.length - 2) throw new Error('DER sequence length is invalid')\n if (buffer[2] !== 0x02) throw new Error('Expected DER integer')\n\n var lenR = buffer[3]\n if (lenR === 0) throw new Error('R length is zero')\n if (5 + lenR >= buffer.length) throw new Error('R length is too long')\n if (buffer[4 + lenR] !== 0x02) throw new Error('Expected DER integer (2)')\n\n var lenS = buffer[5 + lenR]\n if (lenS === 0) throw new Error('S length is zero')\n if ((6 + lenR + lenS) !== buffer.length) throw new Error('S length is invalid')\n\n if (buffer[4] & 0x80) throw new Error('R value is negative')\n if (lenR > 1 && (buffer[4] === 0x00) && !(buffer[5] & 0x80)) throw new Error('R value excessively padded')\n\n if (buffer[lenR + 6] & 0x80) throw new Error('S value is negative')\n if (lenS > 1 && (buffer[lenR + 6] === 0x00) && !(buffer[lenR + 7] & 0x80)) throw new Error('S value excessively padded')\n\n // non-BIP66 - extract R, S values\n return {\n r: buffer.slice(4, 4 + lenR),\n s: buffer.slice(6 + lenR)\n }\n}\n\n/*\n * Expects r and s to be positive DER integers.\n *\n * The DER format uses the most significant bit as a sign bit (& 0x80).\n * If the significant bit is set AND the integer is positive, a 0x00 is prepended.\n *\n * Examples:\n *\n * 0 => 0x00\n * 1 => 0x01\n * -1 => 0xff\n * 127 => 0x7f\n * -127 => 0x81\n * 128 => 0x0080\n * -128 => 0x80\n * 255 => 0x00ff\n * -255 => 0xff01\n * 16300 => 0x3fac\n * -16300 => 0xc054\n * 62300 => 0x00f35c\n * -62300 => 0xff0ca4\n*/\nfunction encode (r, s) {\n var lenR = r.length\n var lenS = s.length\n if (lenR === 0) throw new Error('R length is zero')\n if (lenS === 0) throw new Error('S length is zero')\n if (lenR > 33) throw new Error('R length is too long')\n if (lenS > 33) throw new Error('S length is too long')\n if (r[0] & 0x80) throw new Error('R value is negative')\n if (s[0] & 0x80) throw new Error('S value is negative')\n if (lenR > 1 && (r[0] === 0x00) && !(r[1] & 0x80)) throw new Error('R value excessively padded')\n if (lenS > 1 && (s[0] === 0x00) && !(s[1] & 0x80)) throw new Error('S value excessively padded')\n\n var signature = Buffer.allocUnsafe(6 + lenR + lenS)\n\n // 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S]\n signature[0] = 0x30\n signature[1] = signature.length - 2\n signature[2] = 0x02\n signature[3] = r.length\n r.copy(signature, 4)\n signature[4 + lenR] = 0x02\n signature[5 + lenR] = s.length\n s.copy(signature, 6 + lenR)\n\n return signature\n}\n\nmodule.exports = {\n check: check,\n decode: decode,\n encode: encode\n}\n","{\n \"COMPRESSED_TYPE_INVALID\": \"compressed should be a boolean\",\n \"EC_PRIVATE_KEY_TYPE_INVALID\": \"private key should be a Buffer\",\n \"EC_PRIVATE_KEY_LENGTH_INVALID\": \"private key length is invalid\",\n \"EC_PRIVATE_KEY_RANGE_INVALID\": \"private key range is invalid\",\n \"EC_PRIVATE_KEY_TWEAK_ADD_FAIL\": \"tweak out of range or resulting private key is invalid\",\n \"EC_PRIVATE_KEY_TWEAK_MUL_FAIL\": \"tweak out of range\",\n \"EC_PRIVATE_KEY_EXPORT_DER_FAIL\": \"couldn't export to DER format\",\n \"EC_PRIVATE_KEY_IMPORT_DER_FAIL\": \"couldn't import from DER format\",\n \"EC_PUBLIC_KEYS_TYPE_INVALID\": \"public keys should be an Array\",\n \"EC_PUBLIC_KEYS_LENGTH_INVALID\": \"public keys Array should have at least 1 element\",\n \"EC_PUBLIC_KEY_TYPE_INVALID\": \"public key should be a Buffer\",\n \"EC_PUBLIC_KEY_LENGTH_INVALID\": \"public key length is invalid\",\n \"EC_PUBLIC_KEY_PARSE_FAIL\": \"the public key could not be parsed or is invalid\",\n \"EC_PUBLIC_KEY_CREATE_FAIL\": \"private was invalid, try again\",\n \"EC_PUBLIC_KEY_TWEAK_ADD_FAIL\": \"tweak out of range or resulting public key is invalid\",\n \"EC_PUBLIC_KEY_TWEAK_MUL_FAIL\": \"tweak out of range\",\n \"EC_PUBLIC_KEY_COMBINE_FAIL\": \"the sum of the public keys is not valid\",\n \"ECDH_FAIL\": \"scalar was invalid (zero or overflow)\",\n \"ECDSA_SIGNATURE_TYPE_INVALID\": \"signature should be a Buffer\",\n \"ECDSA_SIGNATURE_LENGTH_INVALID\": \"signature length is invalid\",\n \"ECDSA_SIGNATURE_PARSE_FAIL\": \"couldn't parse signature\",\n \"ECDSA_SIGNATURE_PARSE_DER_FAIL\": \"couldn't parse DER signature\",\n \"ECDSA_SIGNATURE_SERIALIZE_DER_FAIL\": \"couldn't serialize signature to DER format\",\n \"ECDSA_SIGN_FAIL\": \"nonce generation function failed or private key is invalid\",\n \"ECDSA_RECOVER_FAIL\": \"couldn't recover public key from signature\",\n \"MSG32_TYPE_INVALID\": \"message should be a Buffer\",\n \"MSG32_LENGTH_INVALID\": \"message length is invalid\",\n \"OPTIONS_TYPE_INVALID\": \"options should be an Object\",\n \"OPTIONS_DATA_TYPE_INVALID\": \"options.data should be a Buffer\",\n \"OPTIONS_DATA_LENGTH_INVALID\": \"options.data length is invalid\",\n \"OPTIONS_NONCEFN_TYPE_INVALID\": \"options.noncefn should be a Function\",\n \"RECOVERY_ID_TYPE_INVALID\": \"recovery should be a Number\",\n \"RECOVERY_ID_VALUE_INVALID\": \"recovery should have value between -1 and 4\",\n \"TWEAK_TYPE_INVALID\": \"tweak should be a Buffer\",\n \"TWEAK_LENGTH_INVALID\": \"tweak length is invalid\"\n}\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar createHash = require('create-hash')\nvar BN = require('bn.js')\nvar EC = require('elliptic').ec\n\nvar messages = require('../messages.json')\n\nvar ec = new EC('secp256k1')\nvar ecparams = ec.curve\n\nfunction loadCompressedPublicKey (first, xBuffer) {\n var x = new BN(xBuffer)\n\n // overflow\n if (x.cmp(ecparams.p) >= 0) return null\n x = x.toRed(ecparams.red)\n\n // compute corresponding Y\n var y = x.redSqr().redIMul(x).redIAdd(ecparams.b).redSqrt()\n if ((first === 0x03) !== y.isOdd()) y = y.redNeg()\n\n // x*x*x + b = y*y\n const x3 = x.redSqr().redIMul(x)\n if (!y.redSqr().redISub(x3.redIAdd(ecparams.b)).isZero()) return null\n\n return ec.keyPair({ pub: { x: x, y: y } })\n}\n\nfunction loadUncompressedPublicKey (first, xBuffer, yBuffer) {\n var x = new BN(xBuffer)\n var y = new BN(yBuffer)\n\n // overflow\n if (x.cmp(ecparams.p) >= 0 || y.cmp(ecparams.p) >= 0) return null\n\n x = x.toRed(ecparams.red)\n y = y.toRed(ecparams.red)\n\n // is odd flag\n if ((first === 0x06 || first === 0x07) && y.isOdd() !== (first === 0x07)) return null\n\n // x*x*x + b = y*y\n var x3 = x.redSqr().redIMul(x)\n if (!y.redSqr().redISub(x3.redIAdd(ecparams.b)).isZero()) return null\n\n return ec.keyPair({ pub: { x: x, y: y } })\n}\n\nfunction loadPublicKey (publicKey) {\n var first = publicKey[0]\n switch (first) {\n case 0x02:\n case 0x03:\n if (publicKey.length !== 33) return null\n return loadCompressedPublicKey(first, publicKey.slice(1, 33))\n case 0x04:\n case 0x06:\n case 0x07:\n if (publicKey.length !== 65) return null\n return loadUncompressedPublicKey(first, publicKey.slice(1, 33), publicKey.slice(33, 65))\n default:\n return null\n }\n}\n\nexports.privateKeyVerify = function (privateKey) {\n var bn = new BN(privateKey)\n return bn.cmp(ecparams.n) < 0 && !bn.isZero()\n}\n\nexports.privateKeyExport = function (privateKey, compressed) {\n var d = new BN(privateKey)\n if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.EC_PRIVATE_KEY_EXPORT_DER_FAIL)\n\n return Buffer.from(ec.keyFromPrivate(privateKey).getPublic(compressed, true))\n}\n\nexports.privateKeyNegate = function (privateKey) {\n var bn = new BN(privateKey)\n return bn.isZero() ? Buffer.alloc(32) : ecparams.n.sub(bn).umod(ecparams.n).toArrayLike(Buffer, 'be', 32)\n}\n\nexports.privateKeyModInverse = function (privateKey) {\n var bn = new BN(privateKey)\n if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_RANGE_INVALID)\n\n return bn.invm(ecparams.n).toArrayLike(Buffer, 'be', 32)\n}\n\nexports.privateKeyTweakAdd = function (privateKey, tweak) {\n var bn = new BN(tweak)\n if (bn.cmp(ecparams.n) >= 0) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_ADD_FAIL)\n\n bn.iadd(new BN(privateKey))\n if (bn.cmp(ecparams.n) >= 0) bn.isub(ecparams.n)\n if (bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_ADD_FAIL)\n\n return bn.toArrayLike(Buffer, 'be', 32)\n}\n\nexports.privateKeyTweakMul = function (privateKey, tweak) {\n var bn = new BN(tweak)\n if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) throw new Error(messages.EC_PRIVATE_KEY_TWEAK_MUL_FAIL)\n\n bn.imul(new BN(privateKey))\n if (bn.cmp(ecparams.n)) bn = bn.umod(ecparams.n)\n\n return bn.toArrayLike(Buffer, 'be', 32)\n}\n\nexports.publicKeyCreate = function (privateKey, compressed) {\n var d = new BN(privateKey)\n if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.EC_PUBLIC_KEY_CREATE_FAIL)\n\n return Buffer.from(ec.keyFromPrivate(privateKey).getPublic(compressed, true))\n}\n\nexports.publicKeyConvert = function (publicKey, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n return Buffer.from(pair.getPublic(compressed, true))\n}\n\nexports.publicKeyVerify = function (publicKey) {\n return loadPublicKey(publicKey) !== null\n}\n\nexports.publicKeyTweakAdd = function (publicKey, tweak, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n tweak = new BN(tweak)\n if (tweak.cmp(ecparams.n) >= 0) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_ADD_FAIL)\n\n var point = ecparams.g.mul(tweak).add(pair.pub)\n if (point.isInfinity()) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_ADD_FAIL)\n\n return Buffer.from(point.encode(true, compressed))\n}\n\nexports.publicKeyTweakMul = function (publicKey, tweak, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n tweak = new BN(tweak)\n if (tweak.cmp(ecparams.n) >= 0 || tweak.isZero()) throw new Error(messages.EC_PUBLIC_KEY_TWEAK_MUL_FAIL)\n\n return Buffer.from(pair.pub.mul(tweak).encode(true, compressed))\n}\n\nexports.publicKeyCombine = function (publicKeys, compressed) {\n var pairs = new Array(publicKeys.length)\n for (var i = 0; i < publicKeys.length; ++i) {\n pairs[i] = loadPublicKey(publicKeys[i])\n if (pairs[i] === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n }\n\n var point = pairs[0].pub\n for (var j = 1; j < pairs.length; ++j) point = point.add(pairs[j].pub)\n if (point.isInfinity()) throw new Error(messages.EC_PUBLIC_KEY_COMBINE_FAIL)\n\n return Buffer.from(point.encode(true, compressed))\n}\n\nexports.signatureNormalize = function (signature) {\n var r = new BN(signature.slice(0, 32))\n var s = new BN(signature.slice(32, 64))\n if (r.cmp(ecparams.n) >= 0 || s.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n\n var result = Buffer.from(signature)\n if (s.cmp(ec.nh) === 1) ecparams.n.sub(s).toArrayLike(Buffer, 'be', 32).copy(result, 32)\n\n return result\n}\n\nexports.signatureExport = function (signature) {\n var r = signature.slice(0, 32)\n var s = signature.slice(32, 64)\n if (new BN(r).cmp(ecparams.n) >= 0 || new BN(s).cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n\n return { r: r, s: s }\n}\n\nexports.signatureImport = function (sigObj) {\n var r = new BN(sigObj.r)\n if (r.cmp(ecparams.n) >= 0) r = new BN(0)\n\n var s = new BN(sigObj.s)\n if (s.cmp(ecparams.n) >= 0) s = new BN(0)\n\n return Buffer.concat([\n r.toArrayLike(Buffer, 'be', 32),\n s.toArrayLike(Buffer, 'be', 32)\n ])\n}\n\nexports.sign = function (message, privateKey, noncefn, data) {\n if (typeof noncefn === 'function') {\n var getNonce = noncefn\n noncefn = function (counter) {\n var nonce = getNonce(message, privateKey, null, data, counter)\n if (!Buffer.isBuffer(nonce) || nonce.length !== 32) throw new Error(messages.ECDSA_SIGN_FAIL)\n\n return new BN(nonce)\n }\n }\n\n var d = new BN(privateKey)\n if (d.cmp(ecparams.n) >= 0 || d.isZero()) throw new Error(messages.ECDSA_SIGN_FAIL)\n\n var result = ec.sign(message, privateKey, { canonical: true, k: noncefn, pers: data })\n return {\n signature: Buffer.concat([\n result.r.toArrayLike(Buffer, 'be', 32),\n result.s.toArrayLike(Buffer, 'be', 32)\n ]),\n recovery: result.recoveryParam\n }\n}\n\nexports.verify = function (message, signature, publicKey) {\n var sigObj = { r: signature.slice(0, 32), s: signature.slice(32, 64) }\n\n var sigr = new BN(sigObj.r)\n var sigs = new BN(sigObj.s)\n if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n if (sigs.cmp(ec.nh) === 1 || sigr.isZero() || sigs.isZero()) return false\n\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n return ec.verify(message, sigObj, { x: pair.pub.x, y: pair.pub.y })\n}\n\nexports.recover = function (message, signature, recovery, compressed) {\n var sigObj = { r: signature.slice(0, 32), s: signature.slice(32, 64) }\n\n var sigr = new BN(sigObj.r)\n var sigs = new BN(sigObj.s)\n if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) throw new Error(messages.ECDSA_SIGNATURE_PARSE_FAIL)\n\n try {\n if (sigr.isZero() || sigs.isZero()) throw new Error()\n\n var point = ec.recoverPubKey(message, sigObj, recovery)\n return Buffer.from(point.encode(true, compressed))\n } catch (err) {\n throw new Error(messages.ECDSA_RECOVER_FAIL)\n }\n}\n\nexports.ecdh = function (publicKey, privateKey) {\n var shared = exports.ecdhUnsafe(publicKey, privateKey, true)\n return createHash('sha256').update(shared).digest()\n}\n\nexports.ecdhUnsafe = function (publicKey, privateKey, compressed) {\n var pair = loadPublicKey(publicKey)\n if (pair === null) throw new Error(messages.EC_PUBLIC_KEY_PARSE_FAIL)\n\n var scalar = new BN(privateKey)\n if (scalar.cmp(ecparams.n) >= 0 || scalar.isZero()) throw new Error(messages.ECDH_FAIL)\n\n return Buffer.from(pair.pub.mul(scalar).encode(true, compressed))\n}\n","'use strict'\nvar inherits = require('inherits')\nvar MD5 = require('md5.js')\nvar RIPEMD160 = require('ripemd160')\nvar sha = require('sha.js')\nvar Base = require('cipher-base')\n\nfunction Hash (hash) {\n Base.call(this, 'digest')\n\n this._hash = hash\n}\n\ninherits(Hash, Base)\n\nHash.prototype._update = function (data) {\n this._hash.update(data)\n}\n\nHash.prototype._final = function () {\n return this._hash.digest()\n}\n\nmodule.exports = function createHash (alg) {\n alg = alg.toLowerCase()\n if (alg === 'md5') return new MD5()\n if (alg === 'rmd160' || alg === 'ripemd160') return new RIPEMD160()\n\n return new Hash(sha(alg))\n}\n","'use strict'\nvar inherits = require('inherits')\nvar HashBase = require('hash-base')\nvar Buffer = require('safe-buffer').Buffer\n\nvar ARRAY16 = new Array(16)\n\nfunction MD5 () {\n HashBase.call(this, 64)\n\n // state\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n}\n\ninherits(MD5, HashBase)\n\nMD5.prototype._update = function () {\n var M = ARRAY16\n for (var i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4)\n\n var a = this._a\n var b = this._b\n var c = this._c\n var d = this._d\n\n a = fnF(a, b, c, d, M[0], 0xd76aa478, 7)\n d = fnF(d, a, b, c, M[1], 0xe8c7b756, 12)\n c = fnF(c, d, a, b, M[2], 0x242070db, 17)\n b = fnF(b, c, d, a, M[3], 0xc1bdceee, 22)\n a = fnF(a, b, c, d, M[4], 0xf57c0faf, 7)\n d = fnF(d, a, b, c, M[5], 0x4787c62a, 12)\n c = fnF(c, d, a, b, M[6], 0xa8304613, 17)\n b = fnF(b, c, d, a, M[7], 0xfd469501, 22)\n a = fnF(a, b, c, d, M[8], 0x698098d8, 7)\n d = fnF(d, a, b, c, M[9], 0x8b44f7af, 12)\n c = fnF(c, d, a, b, M[10], 0xffff5bb1, 17)\n b = fnF(b, c, d, a, M[11], 0x895cd7be, 22)\n a = fnF(a, b, c, d, M[12], 0x6b901122, 7)\n d = fnF(d, a, b, c, M[13], 0xfd987193, 12)\n c = fnF(c, d, a, b, M[14], 0xa679438e, 17)\n b = fnF(b, c, d, a, M[15], 0x49b40821, 22)\n\n a = fnG(a, b, c, d, M[1], 0xf61e2562, 5)\n d = fnG(d, a, b, c, M[6], 0xc040b340, 9)\n c = fnG(c, d, a, b, M[11], 0x265e5a51, 14)\n b = fnG(b, c, d, a, M[0], 0xe9b6c7aa, 20)\n a = fnG(a, b, c, d, M[5], 0xd62f105d, 5)\n d = fnG(d, a, b, c, M[10], 0x02441453, 9)\n c = fnG(c, d, a, b, M[15], 0xd8a1e681, 14)\n b = fnG(b, c, d, a, M[4], 0xe7d3fbc8, 20)\n a = fnG(a, b, c, d, M[9], 0x21e1cde6, 5)\n d = fnG(d, a, b, c, M[14], 0xc33707d6, 9)\n c = fnG(c, d, a, b, M[3], 0xf4d50d87, 14)\n b = fnG(b, c, d, a, M[8], 0x455a14ed, 20)\n a = fnG(a, b, c, d, M[13], 0xa9e3e905, 5)\n d = fnG(d, a, b, c, M[2], 0xfcefa3f8, 9)\n c = fnG(c, d, a, b, M[7], 0x676f02d9, 14)\n b = fnG(b, c, d, a, M[12], 0x8d2a4c8a, 20)\n\n a = fnH(a, b, c, d, M[5], 0xfffa3942, 4)\n d = fnH(d, a, b, c, M[8], 0x8771f681, 11)\n c = fnH(c, d, a, b, M[11], 0x6d9d6122, 16)\n b = fnH(b, c, d, a, M[14], 0xfde5380c, 23)\n a = fnH(a, b, c, d, M[1], 0xa4beea44, 4)\n d = fnH(d, a, b, c, M[4], 0x4bdecfa9, 11)\n c = fnH(c, d, a, b, M[7], 0xf6bb4b60, 16)\n b = fnH(b, c, d, a, M[10], 0xbebfbc70, 23)\n a = fnH(a, b, c, d, M[13], 0x289b7ec6, 4)\n d = fnH(d, a, b, c, M[0], 0xeaa127fa, 11)\n c = fnH(c, d, a, b, M[3], 0xd4ef3085, 16)\n b = fnH(b, c, d, a, M[6], 0x04881d05, 23)\n a = fnH(a, b, c, d, M[9], 0xd9d4d039, 4)\n d = fnH(d, a, b, c, M[12], 0xe6db99e5, 11)\n c = fnH(c, d, a, b, M[15], 0x1fa27cf8, 16)\n b = fnH(b, c, d, a, M[2], 0xc4ac5665, 23)\n\n a = fnI(a, b, c, d, M[0], 0xf4292244, 6)\n d = fnI(d, a, b, c, M[7], 0x432aff97, 10)\n c = fnI(c, d, a, b, M[14], 0xab9423a7, 15)\n b = fnI(b, c, d, a, M[5], 0xfc93a039, 21)\n a = fnI(a, b, c, d, M[12], 0x655b59c3, 6)\n d = fnI(d, a, b, c, M[3], 0x8f0ccc92, 10)\n c = fnI(c, d, a, b, M[10], 0xffeff47d, 15)\n b = fnI(b, c, d, a, M[1], 0x85845dd1, 21)\n a = fnI(a, b, c, d, M[8], 0x6fa87e4f, 6)\n d = fnI(d, a, b, c, M[15], 0xfe2ce6e0, 10)\n c = fnI(c, d, a, b, M[6], 0xa3014314, 15)\n b = fnI(b, c, d, a, M[13], 0x4e0811a1, 21)\n a = fnI(a, b, c, d, M[4], 0xf7537e82, 6)\n d = fnI(d, a, b, c, M[11], 0xbd3af235, 10)\n c = fnI(c, d, a, b, M[2], 0x2ad7d2bb, 15)\n b = fnI(b, c, d, a, M[9], 0xeb86d391, 21)\n\n this._a = (this._a + a) | 0\n this._b = (this._b + b) | 0\n this._c = (this._c + c) | 0\n this._d = (this._d + d) | 0\n}\n\nMD5.prototype._digest = function () {\n // create padding and handle blocks\n this._block[this._blockOffset++] = 0x80\n if (this._blockOffset > 56) {\n this._block.fill(0, this._blockOffset, 64)\n this._update()\n this._blockOffset = 0\n }\n\n this._block.fill(0, this._blockOffset, 56)\n this._block.writeUInt32LE(this._length[0], 56)\n this._block.writeUInt32LE(this._length[1], 60)\n this._update()\n\n // produce result\n var buffer = Buffer.allocUnsafe(16)\n buffer.writeInt32LE(this._a, 0)\n buffer.writeInt32LE(this._b, 4)\n buffer.writeInt32LE(this._c, 8)\n buffer.writeInt32LE(this._d, 12)\n return buffer\n}\n\nfunction rotl (x, n) {\n return (x << n) | (x >>> (32 - n))\n}\n\nfunction fnF (a, b, c, d, m, k, s) {\n return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnG (a, b, c, d, m, k, s) {\n return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnH (a, b, c, d, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnI (a, b, c, d, m, k, s) {\n return (rotl((a + ((c ^ (b | (~d)))) + m + k) | 0, s) + b) | 0\n}\n\nmodule.exports = MD5\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\nvar toBuffer = require('./to-buffer');\nvar Transform = require('readable-stream').Transform;\nvar inherits = require('inherits');\n\nfunction HashBase(blockSize) {\n\tTransform.call(this);\n\n\tthis._block = Buffer.allocUnsafe(blockSize);\n\tthis._blockSize = blockSize;\n\tthis._blockOffset = 0;\n\tthis._length = [0, 0, 0, 0];\n\n\tthis._finalized = false;\n}\n\ninherits(HashBase, Transform);\n\nHashBase.prototype._transform = function (chunk, encoding, callback) {\n\tvar error = null;\n\ttry {\n\t\tthis.update(chunk, encoding);\n\t} catch (err) {\n\t\terror = err;\n\t}\n\n\tcallback(error);\n};\n\nHashBase.prototype._flush = function (callback) {\n\tvar error = null;\n\ttry {\n\t\tthis.push(this.digest());\n\t} catch (err) {\n\t\terror = err;\n\t}\n\n\tcallback(error);\n};\n\nHashBase.prototype.update = function (data, encoding) {\n\tif (this._finalized) {\n\t\tthrow new Error('Digest already called');\n\t}\n\n\tvar dataBuffer = toBuffer(data, encoding); // asserts correct input type\n\n\t// consume data\n\tvar block = this._block;\n\tvar offset = 0;\n\twhile (this._blockOffset + dataBuffer.length - offset >= this._blockSize) {\n\t\tfor (var i = this._blockOffset; i < this._blockSize;) {\n\t\t\tblock[i] = dataBuffer[offset];\n\t\t\ti += 1;\n\t\t\toffset += 1;\n\t\t}\n\t\tthis._update();\n\t\tthis._blockOffset = 0;\n\t}\n\twhile (offset < dataBuffer.length) {\n\t\tblock[this._blockOffset] = dataBuffer[offset];\n\t\tthis._blockOffset += 1;\n\t\toffset += 1;\n\t}\n\n\t// update length\n\tfor (var j = 0, carry = dataBuffer.length * 8; carry > 0; ++j) {\n\t\tthis._length[j] += carry;\n\t\tcarry = (this._length[j] / 0x0100000000) | 0;\n\t\tif (carry > 0) {\n\t\t\tthis._length[j] -= 0x0100000000 * carry;\n\t\t}\n\t}\n\n\treturn this;\n};\n\nHashBase.prototype._update = function () {\n\tthrow new Error('_update is not implemented');\n};\n\nHashBase.prototype.digest = function (encoding) {\n\tif (this._finalized) {\n\t\tthrow new Error('Digest already called');\n\t}\n\tthis._finalized = true;\n\n\tvar digest = this._digest();\n\tif (encoding !== undefined) {\n\t\tdigest = digest.toString(encoding);\n\t}\n\n\t// reset state\n\tthis._block.fill(0);\n\tthis._blockOffset = 0;\n\tfor (var i = 0; i < 4; ++i) {\n\t\tthis._length[i] = 0;\n\t}\n\n\treturn digest;\n};\n\nHashBase.prototype._digest = function () {\n\tthrow new Error('_digest is not implemented');\n};\n\nmodule.exports = HashBase;\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\nvar toBuffer = require('to-buffer');\n\nvar useUint8Array = typeof Uint8Array !== 'undefined';\nvar useArrayBuffer = useUint8Array && typeof ArrayBuffer !== 'undefined';\nvar isView = useArrayBuffer && ArrayBuffer.isView;\n\nmodule.exports = function (thing, encoding) {\n\tif (\n\t\ttypeof thing === 'string'\n || Buffer.isBuffer(thing)\n || (useUint8Array && thing instanceof Uint8Array)\n || (isView && isView(thing))\n\t) {\n\t\treturn toBuffer(thing, encoding);\n\t}\n\tthrow new TypeError('The \"data\" argument must be a string, a Buffer, a Uint8Array, or a DataView');\n};\n","'use strict';\n\nvar Buffer = require('buffer').Buffer;\nvar inherits = require('inherits');\nvar HashBase = require('hash-base');\n\nvar ARRAY16 = new Array(16);\n\nvar zl = [\n\t0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n\t7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n\t3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n\t1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n\t4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n];\n\nvar zr = [\n\t5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n\t6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n\t15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n\t8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n\t12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n];\n\nvar sl = [\n\t11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n\t7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n\t11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n\t11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n\t9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n];\n\nvar sr = [\n\t8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n\t9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n\t9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n\t15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n\t8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n];\n\nvar hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e];\nvar hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000];\n\nfunction rotl(x, n) {\n\treturn (x << n) | (x >>> (32 - n));\n}\n\nfunction fn1(a, b, c, d, e, m, k, s) {\n\treturn (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0;\n}\n\nfunction fn2(a, b, c, d, e, m, k, s) {\n\treturn (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + e) | 0;\n}\n\nfunction fn3(a, b, c, d, e, m, k, s) {\n\treturn (rotl((a + ((b | ~c) ^ d) + m + k) | 0, s) + e) | 0;\n}\n\nfunction fn4(a, b, c, d, e, m, k, s) {\n\treturn (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + e) | 0;\n}\n\nfunction fn5(a, b, c, d, e, m, k, s) {\n\treturn (rotl((a + (b ^ (c | ~d)) + m + k) | 0, s) + e) | 0;\n}\n\nfunction RIPEMD160() {\n\tHashBase.call(this, 64);\n\n\t// state\n\tthis._a = 0x67452301;\n\tthis._b = 0xefcdab89;\n\tthis._c = 0x98badcfe;\n\tthis._d = 0x10325476;\n\tthis._e = 0xc3d2e1f0;\n}\n\ninherits(RIPEMD160, HashBase);\n\nRIPEMD160.prototype._update = function () {\n\tvar words = ARRAY16;\n\tfor (var j = 0; j < 16; ++j) {\n\t\twords[j] = this._block.readInt32LE(j * 4);\n\t}\n\n\tvar al = this._a | 0;\n\tvar bl = this._b | 0;\n\tvar cl = this._c | 0;\n\tvar dl = this._d | 0;\n\tvar el = this._e | 0;\n\n\tvar ar = this._a | 0;\n\tvar br = this._b | 0;\n\tvar cr = this._c | 0;\n\tvar dr = this._d | 0;\n\tvar er = this._e | 0;\n\n\t// computation\n\tfor (var i = 0; i < 80; i += 1) {\n\t\tvar tl;\n\t\tvar tr;\n\t\tif (i < 16) {\n\t\t\ttl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i]);\n\t\t\ttr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i]);\n\t\t} else if (i < 32) {\n\t\t\ttl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i]);\n\t\t\ttr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i]);\n\t\t} else if (i < 48) {\n\t\t\ttl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i]);\n\t\t\ttr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i]);\n\t\t} else if (i < 64) {\n\t\t\ttl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i]);\n\t\t\ttr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i]);\n\t\t} else { // if (i<80) {\n\t\t\ttl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i]);\n\t\t\ttr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]);\n\t\t}\n\n\t\tal = el;\n\t\tel = dl;\n\t\tdl = rotl(cl, 10);\n\t\tcl = bl;\n\t\tbl = tl;\n\n\t\tar = er;\n\t\ter = dr;\n\t\tdr = rotl(cr, 10);\n\t\tcr = br;\n\t\tbr = tr;\n\t}\n\n\t// update state\n\tvar t = (this._b + cl + dr) | 0;\n\tthis._b = (this._c + dl + er) | 0;\n\tthis._c = (this._d + el + ar) | 0;\n\tthis._d = (this._e + al + br) | 0;\n\tthis._e = (this._a + bl + cr) | 0;\n\tthis._a = t;\n};\n\nRIPEMD160.prototype._digest = function () {\n\t// create padding and handle blocks\n\tthis._block[this._blockOffset] = 0x80;\n\tthis._blockOffset += 1;\n\tif (this._blockOffset > 56) {\n\t\tthis._block.fill(0, this._blockOffset, 64);\n\t\tthis._update();\n\t\tthis._blockOffset = 0;\n\t}\n\n\tthis._block.fill(0, this._blockOffset, 56);\n\tthis._block.writeUInt32LE(this._length[0], 56);\n\tthis._block.writeUInt32LE(this._length[1], 60);\n\tthis._update();\n\n\t// produce result\n\tvar buffer = Buffer.alloc ? Buffer.alloc(20) : new Buffer(20); // eslint-disable-line no-buffer-constructor\n\tbuffer.writeInt32LE(this._a, 0);\n\tbuffer.writeInt32LE(this._b, 4);\n\tbuffer.writeInt32LE(this._c, 8);\n\tbuffer.writeInt32LE(this._d, 12);\n\tbuffer.writeInt32LE(this._e, 16);\n\treturn buffer;\n};\n\nmodule.exports = RIPEMD160;\n","'use strict';\n\nmodule.exports = function SHA(algorithm) {\n\tvar alg = algorithm.toLowerCase();\n\n\tvar Algorithm = module.exports[alg];\n\tif (!Algorithm) {\n\t\tthrow new Error(alg + ' is not supported (we accept pull requests)');\n\t}\n\n\treturn new Algorithm();\n};\n\nmodule.exports.sha = require('./sha');\nmodule.exports.sha1 = require('./sha1');\nmodule.exports.sha224 = require('./sha224');\nmodule.exports.sha256 = require('./sha256');\nmodule.exports.sha384 = require('./sha384');\nmodule.exports.sha512 = require('./sha512');\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\nvar Transform = require('stream').Transform;\nvar StringDecoder = require('string_decoder').StringDecoder;\nvar inherits = require('inherits');\nvar toBuffer = require('to-buffer');\n\nfunction CipherBase(hashMode) {\n\tTransform.call(this);\n\tthis.hashMode = typeof hashMode === 'string';\n\tif (this.hashMode) {\n\t\tthis[hashMode] = this._finalOrDigest;\n\t} else {\n\t\tthis['final'] = this._finalOrDigest;\n\t}\n\tif (this._final) {\n\t\tthis.__final = this._final;\n\t\tthis._final = null;\n\t}\n\tthis._decoder = null;\n\tthis._encoding = null;\n}\ninherits(CipherBase, Transform);\n\nCipherBase.prototype.update = function (data, inputEnc, outputEnc) {\n\tvar bufferData = toBuffer(data, inputEnc); // asserts correct input type\n\tvar outData = this._update(bufferData);\n\tif (this.hashMode) {\n\t\treturn this;\n\t}\n\n\tif (outputEnc) {\n\t\toutData = this._toString(outData, outputEnc);\n\t}\n\n\treturn outData;\n};\n\nCipherBase.prototype.setAutoPadding = function () {};\nCipherBase.prototype.getAuthTag = function () {\n\tthrow new Error('trying to get auth tag in unsupported state');\n};\n\nCipherBase.prototype.setAuthTag = function () {\n\tthrow new Error('trying to set auth tag in unsupported state');\n};\n\nCipherBase.prototype.setAAD = function () {\n\tthrow new Error('trying to set aad in unsupported state');\n};\n\nCipherBase.prototype._transform = function (data, _, next) {\n\tvar err;\n\ttry {\n\t\tif (this.hashMode) {\n\t\t\tthis._update(data);\n\t\t} else {\n\t\t\tthis.push(this._update(data));\n\t\t}\n\t} catch (e) {\n\t\terr = e;\n\t} finally {\n\t\tnext(err);\n\t}\n};\nCipherBase.prototype._flush = function (done) {\n\tvar err;\n\ttry {\n\t\tthis.push(this.__final());\n\t} catch (e) {\n\t\terr = e;\n\t}\n\n\tdone(err);\n};\nCipherBase.prototype._finalOrDigest = function (outputEnc) {\n\tvar outData = this.__final() || Buffer.alloc(0);\n\tif (outputEnc) {\n\t\toutData = this._toString(outData, outputEnc, true);\n\t}\n\treturn outData;\n};\n\nCipherBase.prototype._toString = function (value, enc, fin) {\n\tif (!this._decoder) {\n\t\tthis._decoder = new StringDecoder(enc);\n\t\tthis._encoding = enc;\n\t}\n\n\tif (this._encoding !== enc) {\n\t\tthrow new Error('can’t switch encodings');\n\t}\n\n\tvar out = this._decoder.write(value);\n\tif (fin) {\n\t\tout += this._decoder.end();\n\t}\n\n\treturn out;\n};\n\nmodule.exports = CipherBase;\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\n\n function BN (number, base, endian) {\n if (BN.isBN(number)) {\n return number;\n }\n\n this.negative = 0;\n this.words = null;\n this.length = 0;\n\n // Reduction context\n this.red = null;\n\n if (number !== null) {\n if (base === 'le' || base === 'be') {\n endian = base;\n base = 10;\n }\n\n this._init(number || 0, base || 10, endian || 'be');\n }\n }\n if (typeof module === 'object') {\n module.exports = BN;\n } else {\n exports.BN = BN;\n }\n\n BN.BN = BN;\n BN.wordSize = 26;\n\n var Buffer;\n try {\n if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n Buffer = window.Buffer;\n } else {\n Buffer = require('buffer').Buffer;\n }\n } catch (e) {\n }\n\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n };\n\n BN.max = function max (left, right) {\n if (left.cmp(right) > 0) return left;\n return right;\n };\n\n BN.min = function min (left, right) {\n if (left.cmp(right) < 0) return left;\n return right;\n };\n\n BN.prototype._init = function init (number, base, endian) {\n if (typeof number === 'number') {\n return this._initNumber(number, base, endian);\n }\n\n if (typeof number === 'object') {\n return this._initArray(number, base, endian);\n }\n\n if (base === 'hex') {\n base = 16;\n }\n assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\n if (number[0] === '-') {\n start++;\n this.negative = 1;\n }\n\n if (start < number.length) {\n if (base === 16) {\n this._parseHex(number, start, endian);\n } else {\n this._parseBase(number, base, start);\n if (endian === 'le') {\n this._initArray(this.toArray(), base, endian);\n }\n }\n }\n };\n\n BN.prototype._initNumber = function _initNumber (number, base, endian) {\n if (number < 0) {\n this.negative = 1;\n number = -number;\n }\n if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\n this._initArray(this.toArray(), base, endian);\n };\n\n BN.prototype._initArray = function _initArray (number, base, endian) {\n // Perhaps a Uint8Array\n assert(typeof number.length === 'number');\n if (number.length <= 0) {\n this.words = [ 0 ];\n this.length = 1;\n return this;\n }\n\n this.length = Math.ceil(number.length / 3);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\n if (endian === 'be') {\n for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n } else if (endian === 'le') {\n for (i = 0, j = 0; i < number.length; i += 3) {\n w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '0' - '9'\n } else {\n return (c - 48) & 0xf;\n }\n }\n\n function parseHexByte (string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\n }\n return r;\n }\n\n BN.prototype._parseHex = function _parseHex (number, start, endian) {\n // Create possibly bigger array to ensure that it fits the number\n this.length = Math.ceil((number.length - start) / 6);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\n if (endian === 'be') {\n for (i = number.length - 1; i >= start; i -= 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n } else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n }\n\n this.strip();\n };\n\n function parseBase (str, start, end, mul) {\n var r = 0;\n var len = Math.min(str.length, end);\n for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\n }\n }\n return r;\n }\n\n BN.prototype._parseBase = function _parseBase (number, base, start) {\n // Initialize as zero\n this.words = [ 0 ];\n this.length = 1;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n if (mod !== 0) {\n var pow = 1;\n word = parseBase(number, i, number.length, base);\n\n for (i = 0; i < mod; i++) {\n pow *= base;\n }\n\n this.imuln(pow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n this.strip();\n };\n\n BN.prototype.copy = function copy (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\n }\n dest.length = this.length;\n dest.negative = this.negative;\n dest.red = this.red;\n };\n\n BN.prototype.clone = function clone () {\n var r = new BN(null);\n this.copy(r);\n return r;\n };\n\n BN.prototype._expand = function _expand (size) {\n while (this.length < size) {\n this.words[this.length++] = 0;\n }\n return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\n }\n return this._normSign();\n };\n\n BN.prototype._normSign = function _normSign () {\n // -0 = 0\n if (this.length === 1 && this.words[0] === 0) {\n this.negative = 0;\n }\n return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\n var s = '';\n var i = -1;\n while (++i < BN.wordSize) {\n zeros[i] = s;\n s += '0';\n }\n groupSizes[0] = 0;\n groupSizes[1] = 0;\n groupBases[0] = 0;\n groupBases[1] = 0;\n var base = 2 - 1;\n while (++base < 36 + 1) {\n var groupSize = 0;\n var groupBase = 1;\n while (groupBase < (1 << BN.wordSize) / base) {\n groupBase *= base;\n groupSize += 1;\n }\n groupSizes[base] = groupSize;\n groupBases[base] = groupBase;\n }\n\n */\n\n var zeros = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = this.words[i];\n var word = (((w << off) | carry) & 0xffffff).toString(16);\n carry = (w >>> (24 - off)) & 0xffffff;\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n if (base === (base | 0) && base >= 2 && base <= 36) {\n // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n var groupSize = groupSizes[base];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n while (!c.isZero()) {\n var r = c.modn(groupBase).toString(base);\n c = c.idivn(groupBase);\n\n if (!c.isZero()) {\n out = zeros[groupSize - r.length] + r + out;\n } else {\n out = r + out;\n }\n }\n if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n assert(false, 'Base should be between 2 and 36');\n };\n\n BN.prototype.toNumber = function toNumber () {\n var ret = this.words[0];\n if (this.length === 2) {\n ret += this.words[1] * 0x4000000;\n } else if (this.length === 3 && this.words[2] === 0x01) {\n // NOTE: at this stage it is known that the top bit is set\n ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n } else if (this.length > 2) {\n assert(false, 'Number can only safely store up to 53 bits');\n }\n return (this.negative !== 0) ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON () {\n return this.toString(16);\n };\n\n BN.prototype.toBuffer = function toBuffer (endian, length) {\n assert(typeof Buffer !== 'undefined');\n return this.toArrayLike(Buffer, endian, length);\n };\n\n BN.prototype.toArray = function toArray (endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n var byteLength = this.byteLength();\n var reqLength = length || Math.max(1, byteLength);\n assert(byteLength <= reqLength, 'byte array longer than desired length');\n assert(reqLength > 0, 'Requested array length <= 0');\n\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\n if (!littleEndian) {\n // Assume big-endian\n for (i = 0; i < reqLength - byteLength; i++) {\n res[i] = 0;\n }\n\n for (i = 0; !q.isZero(); i++) {\n b = q.andln(0xff);\n q.iushrn(8);\n\n res[reqLength - i - 1] = b;\n }\n } else {\n for (i = 0; !q.isZero(); i++) {\n b = q.andln(0xff);\n q.iushrn(8);\n\n res[i] = b;\n }\n\n for (; i < reqLength; i++) {\n res[i] = 0;\n }\n }\n\n return res;\n };\n\n if (Math.clz32) {\n BN.prototype._countBits = function _countBits (w) {\n return 32 - Math.clz32(w);\n };\n } else {\n BN.prototype._countBits = function _countBits (w) {\n var t = w;\n var r = 0;\n if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\n }\n return r + t;\n };\n }\n\n BN.prototype._zeroBits = function _zeroBits (w) {\n // Short-cut\n if (w === 0) return 26;\n\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n };\n\n function toBitArray (num) {\n var w = new Array(num.bitLength());\n\n for (var bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\n }\n return r;\n };\n\n BN.prototype.byteLength = function byteLength () {\n return Math.ceil(this.bitLength() / 8);\n };\n\n BN.prototype.toTwos = function toTwos (width) {\n if (this.negative !== 0) {\n return this.abs().inotn(width).iaddn(1);\n }\n return this.clone();\n };\n\n BN.prototype.fromTwos = function fromTwos (width) {\n if (this.testn(width - 1)) {\n return this.notn(width).iaddn(1).ineg();\n }\n return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\n BN.prototype.neg = function neg () {\n return this.clone().ineg();\n };\n\n BN.prototype.ineg = function ineg () {\n if (!this.isZero()) {\n this.negative ^= 1;\n }\n\n return this;\n };\n\n // Or `num` with `this` in-place\n BN.prototype.iuor = function iuor (num) {\n while (this.length < num.length) {\n this.words[this.length++] = 0;\n }\n\n for (var i = 0; i < num.length; i++) {\n this.words[i] = this.words[i] | num.words[i];\n }\n\n return this.strip();\n };\n\n BN.prototype.ior = function ior (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuor(num);\n };\n\n // Or `num` with `this`\n BN.prototype.or = function or (num) {\n if (this.length > num.length) return this.clone().ior(num);\n return num.clone().ior(this);\n };\n\n BN.prototype.uor = function uor (num) {\n if (this.length > num.length) return this.clone().iuor(num);\n return num.clone().iuor(this);\n };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\n if (this.length > num.length) {\n b = num;\n } else {\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = this.words[i] & num.words[i];\n }\n\n this.length = b.length;\n\n return this.strip();\n };\n\n BN.prototype.iand = function iand (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuand(num);\n };\n\n // And `num` with `this`\n BN.prototype.and = function and (num) {\n if (this.length > num.length) return this.clone().iand(num);\n return num.clone().iand(this);\n };\n\n BN.prototype.uand = function uand (num) {\n if (this.length > num.length) return this.clone().iuand(num);\n return num.clone().iuand(this);\n };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = a.words[i] ^ b.words[i];\n }\n\n if (this !== a) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = a.length;\n\n return this.strip();\n };\n\n BN.prototype.ixor = function ixor (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuxor(num);\n };\n\n // Xor `num` with `this`\n BN.prototype.xor = function xor (num) {\n if (this.length > num.length) return this.clone().ixor(num);\n return num.clone().ixor(this);\n };\n\n BN.prototype.uxor = function uxor (num) {\n if (this.length > num.length) return this.clone().iuxor(num);\n return num.clone().iuxor(this);\n };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n this._expand(off + 1);\n\n if (val) {\n this.words[off] = this.words[off] | (1 << wbit);\n } else {\n this.words[off] = this.words[off] & ~(1 << wbit);\n }\n\n return this.strip();\n };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\n if (this.negative !== 0 && num.negative === 0) {\n this.negative = 0;\n r = this.isub(num);\n this.negative ^= 1;\n return this._normSign();\n\n // positive + negative\n } else if (this.negative === 0 && num.negative !== 0) {\n num.negative = 0;\n r = this.isub(num);\n num.negative = 1;\n return r._normSign();\n }\n\n // a.length > b.length\n var a, b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n\n this.length = a.length;\n if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // Copy the rest of the words\n } else if (a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n return this;\n };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\n if (num.negative !== 0 && this.negative === 0) {\n num.negative = 0;\n res = this.sub(num);\n num.negative ^= 1;\n return res;\n } else if (num.negative === 0 && this.negative !== 0) {\n this.negative = 0;\n res = num.sub(this);\n this.negative = 1;\n return res;\n }\n\n if (this.length > num.length) return this.clone().iadd(num);\n\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\n BN.prototype.isub = function isub (num) {\n // this - (-num) = this + num\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n num.negative = 1;\n return r._normSign();\n\n // -this - num = -(this + num)\n } else if (this.negative !== 0) {\n this.negative = 0;\n this.iadd(num);\n this.negative = 1;\n return this._normSign();\n }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\n if (cmp > 0) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n\n // Copy rest of the words\n if (carry === 0 && i < a.length && a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = Math.max(this.length, i);\n\n if (a !== this) {\n this.negative = 1;\n }\n\n return this.strip();\n };\n\n // Subtract `num` from `this`\n BN.prototype.sub = function sub (num) {\n return this.clone().isub(num);\n };\n\n function smallMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n var len = (self.length + num.length) | 0;\n out.length = len;\n len = (len - 1) | 0;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n var carry = (r / 0x4000000) | 0;\n out.words[0] = lo;\n\n for (var k = 1; k < len; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = carry >>> 26;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = (k - j) | 0;\n a = self.words[i] | 0;\n b = num.words[j] | 0;\n r = a * b + rword;\n ncarry += (r / 0x4000000) | 0;\n rword = r & 0x3ffffff;\n }\n out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\n // TODO(indutny): it may be reasonable to omit it for users who don't need\n // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n // multiplication (like elliptic secp256k1).\n var comb10MulTo = function comb10MulTo (self, num, out) {\n var a = self.words;\n var b = num.words;\n var o = out.words;\n var c = 0;\n var lo;\n var mid;\n var hi;\n var a0 = a[0] | 0;\n var al0 = a0 & 0x1fff;\n var ah0 = a0 >>> 13;\n var a1 = a[1] | 0;\n var al1 = a1 & 0x1fff;\n var ah1 = a1 >>> 13;\n var a2 = a[2] | 0;\n var al2 = a2 & 0x1fff;\n var ah2 = a2 >>> 13;\n var a3 = a[3] | 0;\n var al3 = a3 & 0x1fff;\n var ah3 = a3 >>> 13;\n var a4 = a[4] | 0;\n var al4 = a4 & 0x1fff;\n var ah4 = a4 >>> 13;\n var a5 = a[5] | 0;\n var al5 = a5 & 0x1fff;\n var ah5 = a5 >>> 13;\n var a6 = a[6] | 0;\n var al6 = a6 & 0x1fff;\n var ah6 = a6 >>> 13;\n var a7 = a[7] | 0;\n var al7 = a7 & 0x1fff;\n var ah7 = a7 >>> 13;\n var a8 = a[8] | 0;\n var al8 = a8 & 0x1fff;\n var ah8 = a8 >>> 13;\n var a9 = a[9] | 0;\n var al9 = a9 & 0x1fff;\n var ah9 = a9 >>> 13;\n var b0 = b[0] | 0;\n var bl0 = b0 & 0x1fff;\n var bh0 = b0 >>> 13;\n var b1 = b[1] | 0;\n var bl1 = b1 & 0x1fff;\n var bh1 = b1 >>> 13;\n var b2 = b[2] | 0;\n var bl2 = b2 & 0x1fff;\n var bh2 = b2 >>> 13;\n var b3 = b[3] | 0;\n var bl3 = b3 & 0x1fff;\n var bh3 = b3 >>> 13;\n var b4 = b[4] | 0;\n var bl4 = b4 & 0x1fff;\n var bh4 = b4 >>> 13;\n var b5 = b[5] | 0;\n var bl5 = b5 & 0x1fff;\n var bh5 = b5 >>> 13;\n var b6 = b[6] | 0;\n var bl6 = b6 & 0x1fff;\n var bh6 = b6 >>> 13;\n var b7 = b[7] | 0;\n var bl7 = b7 & 0x1fff;\n var bh7 = b7 >>> 13;\n var b8 = b[8] | 0;\n var bl8 = b8 & 0x1fff;\n var bh8 = b8 >>> 13;\n var b9 = b[9] | 0;\n var bl9 = b9 & 0x1fff;\n var bh9 = b9 >>> 13;\n\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\n lo = Math.imul(al0, bl0);\n mid = Math.imul(al0, bh0);\n mid = (mid + Math.imul(ah0, bl0)) | 0;\n hi = Math.imul(ah0, bh0);\n var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n w0 &= 0x3ffffff;\n /* k = 1 */\n lo = Math.imul(al1, bl0);\n mid = Math.imul(al1, bh0);\n mid = (mid + Math.imul(ah1, bl0)) | 0;\n hi = Math.imul(ah1, bh0);\n lo = (lo + Math.imul(al0, bl1)) | 0;\n mid = (mid + Math.imul(al0, bh1)) | 0;\n mid = (mid + Math.imul(ah0, bl1)) | 0;\n hi = (hi + Math.imul(ah0, bh1)) | 0;\n var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n w1 &= 0x3ffffff;\n /* k = 2 */\n lo = Math.imul(al2, bl0);\n mid = Math.imul(al2, bh0);\n mid = (mid + Math.imul(ah2, bl0)) | 0;\n hi = Math.imul(ah2, bh0);\n lo = (lo + Math.imul(al1, bl1)) | 0;\n mid = (mid + Math.imul(al1, bh1)) | 0;\n mid = (mid + Math.imul(ah1, bl1)) | 0;\n hi = (hi + Math.imul(ah1, bh1)) | 0;\n lo = (lo + Math.imul(al0, bl2)) | 0;\n mid = (mid + Math.imul(al0, bh2)) | 0;\n mid = (mid + Math.imul(ah0, bl2)) | 0;\n hi = (hi + Math.imul(ah0, bh2)) | 0;\n var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n w2 &= 0x3ffffff;\n /* k = 3 */\n lo = Math.imul(al3, bl0);\n mid = Math.imul(al3, bh0);\n mid = (mid + Math.imul(ah3, bl0)) | 0;\n hi = Math.imul(ah3, bh0);\n lo = (lo + Math.imul(al2, bl1)) | 0;\n mid = (mid + Math.imul(al2, bh1)) | 0;\n mid = (mid + Math.imul(ah2, bl1)) | 0;\n hi = (hi + Math.imul(ah2, bh1)) | 0;\n lo = (lo + Math.imul(al1, bl2)) | 0;\n mid = (mid + Math.imul(al1, bh2)) | 0;\n mid = (mid + Math.imul(ah1, bl2)) | 0;\n hi = (hi + Math.imul(ah1, bh2)) | 0;\n lo = (lo + Math.imul(al0, bl3)) | 0;\n mid = (mid + Math.imul(al0, bh3)) | 0;\n mid = (mid + Math.imul(ah0, bl3)) | 0;\n hi = (hi + Math.imul(ah0, bh3)) | 0;\n var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n w3 &= 0x3ffffff;\n /* k = 4 */\n lo = Math.imul(al4, bl0);\n mid = Math.imul(al4, bh0);\n mid = (mid + Math.imul(ah4, bl0)) | 0;\n hi = Math.imul(ah4, bh0);\n lo = (lo + Math.imul(al3, bl1)) | 0;\n mid = (mid + Math.imul(al3, bh1)) | 0;\n mid = (mid + Math.imul(ah3, bl1)) | 0;\n hi = (hi + Math.imul(ah3, bh1)) | 0;\n lo = (lo + Math.imul(al2, bl2)) | 0;\n mid = (mid + Math.imul(al2, bh2)) | 0;\n mid = (mid + Math.imul(ah2, bl2)) | 0;\n hi = (hi + Math.imul(ah2, bh2)) | 0;\n lo = (lo + Math.imul(al1, bl3)) | 0;\n mid = (mid + Math.imul(al1, bh3)) | 0;\n mid = (mid + Math.imul(ah1, bl3)) | 0;\n hi = (hi + Math.imul(ah1, bh3)) | 0;\n lo = (lo + Math.imul(al0, bl4)) | 0;\n mid = (mid + Math.imul(al0, bh4)) | 0;\n mid = (mid + Math.imul(ah0, bl4)) | 0;\n hi = (hi + Math.imul(ah0, bh4)) | 0;\n var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n w4 &= 0x3ffffff;\n /* k = 5 */\n lo = Math.imul(al5, bl0);\n mid = Math.imul(al5, bh0);\n mid = (mid + Math.imul(ah5, bl0)) | 0;\n hi = Math.imul(ah5, bh0);\n lo = (lo + Math.imul(al4, bl1)) | 0;\n mid = (mid + Math.imul(al4, bh1)) | 0;\n mid = (mid + Math.imul(ah4, bl1)) | 0;\n hi = (hi + Math.imul(ah4, bh1)) | 0;\n lo = (lo + Math.imul(al3, bl2)) | 0;\n mid = (mid + Math.imul(al3, bh2)) | 0;\n mid = (mid + Math.imul(ah3, bl2)) | 0;\n hi = (hi + Math.imul(ah3, bh2)) | 0;\n lo = (lo + Math.imul(al2, bl3)) | 0;\n mid = (mid + Math.imul(al2, bh3)) | 0;\n mid = (mid + Math.imul(ah2, bl3)) | 0;\n hi = (hi + Math.imul(ah2, bh3)) | 0;\n lo = (lo + Math.imul(al1, bl4)) | 0;\n mid = (mid + Math.imul(al1, bh4)) | 0;\n mid = (mid + Math.imul(ah1, bl4)) | 0;\n hi = (hi + Math.imul(ah1, bh4)) | 0;\n lo = (lo + Math.imul(al0, bl5)) | 0;\n mid = (mid + Math.imul(al0, bh5)) | 0;\n mid = (mid + Math.imul(ah0, bl5)) | 0;\n hi = (hi + Math.imul(ah0, bh5)) | 0;\n var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n w5 &= 0x3ffffff;\n /* k = 6 */\n lo = Math.imul(al6, bl0);\n mid = Math.imul(al6, bh0);\n mid = (mid + Math.imul(ah6, bl0)) | 0;\n hi = Math.imul(ah6, bh0);\n lo = (lo + Math.imul(al5, bl1)) | 0;\n mid = (mid + Math.imul(al5, bh1)) | 0;\n mid = (mid + Math.imul(ah5, bl1)) | 0;\n hi = (hi + Math.imul(ah5, bh1)) | 0;\n lo = (lo + Math.imul(al4, bl2)) | 0;\n mid = (mid + Math.imul(al4, bh2)) | 0;\n mid = (mid + Math.imul(ah4, bl2)) | 0;\n hi = (hi + Math.imul(ah4, bh2)) | 0;\n lo = (lo + Math.imul(al3, bl3)) | 0;\n mid = (mid + Math.imul(al3, bh3)) | 0;\n mid = (mid + Math.imul(ah3, bl3)) | 0;\n hi = (hi + Math.imul(ah3, bh3)) | 0;\n lo = (lo + Math.imul(al2, bl4)) | 0;\n mid = (mid + Math.imul(al2, bh4)) | 0;\n mid = (mid + Math.imul(ah2, bl4)) | 0;\n hi = (hi + Math.imul(ah2, bh4)) | 0;\n lo = (lo + Math.imul(al1, bl5)) | 0;\n mid = (mid + Math.imul(al1, bh5)) | 0;\n mid = (mid + Math.imul(ah1, bl5)) | 0;\n hi = (hi + Math.imul(ah1, bh5)) | 0;\n lo = (lo + Math.imul(al0, bl6)) | 0;\n mid = (mid + Math.imul(al0, bh6)) | 0;\n mid = (mid + Math.imul(ah0, bl6)) | 0;\n hi = (hi + Math.imul(ah0, bh6)) | 0;\n var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n w6 &= 0x3ffffff;\n /* k = 7 */\n lo = Math.imul(al7, bl0);\n mid = Math.imul(al7, bh0);\n mid = (mid + Math.imul(ah7, bl0)) | 0;\n hi = Math.imul(ah7, bh0);\n lo = (lo + Math.imul(al6, bl1)) | 0;\n mid = (mid + Math.imul(al6, bh1)) | 0;\n mid = (mid + Math.imul(ah6, bl1)) | 0;\n hi = (hi + Math.imul(ah6, bh1)) | 0;\n lo = (lo + Math.imul(al5, bl2)) | 0;\n mid = (mid + Math.imul(al5, bh2)) | 0;\n mid = (mid + Math.imul(ah5, bl2)) | 0;\n hi = (hi + Math.imul(ah5, bh2)) | 0;\n lo = (lo + Math.imul(al4, bl3)) | 0;\n mid = (mid + Math.imul(al4, bh3)) | 0;\n mid = (mid + Math.imul(ah4, bl3)) | 0;\n hi = (hi + Math.imul(ah4, bh3)) | 0;\n lo = (lo + Math.imul(al3, bl4)) | 0;\n mid = (mid + Math.imul(al3, bh4)) | 0;\n mid = (mid + Math.imul(ah3, bl4)) | 0;\n hi = (hi + Math.imul(ah3, bh4)) | 0;\n lo = (lo + Math.imul(al2, bl5)) | 0;\n mid = (mid + Math.imul(al2, bh5)) | 0;\n mid = (mid + Math.imul(ah2, bl5)) | 0;\n hi = (hi + Math.imul(ah2, bh5)) | 0;\n lo = (lo + Math.imul(al1, bl6)) | 0;\n mid = (mid + Math.imul(al1, bh6)) | 0;\n mid = (mid + Math.imul(ah1, bl6)) | 0;\n hi = (hi + Math.imul(ah1, bh6)) | 0;\n lo = (lo + Math.imul(al0, bl7)) | 0;\n mid = (mid + Math.imul(al0, bh7)) | 0;\n mid = (mid + Math.imul(ah0, bl7)) | 0;\n hi = (hi + Math.imul(ah0, bh7)) | 0;\n var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n w7 &= 0x3ffffff;\n /* k = 8 */\n lo = Math.imul(al8, bl0);\n mid = Math.imul(al8, bh0);\n mid = (mid + Math.imul(ah8, bl0)) | 0;\n hi = Math.imul(ah8, bh0);\n lo = (lo + Math.imul(al7, bl1)) | 0;\n mid = (mid + Math.imul(al7, bh1)) | 0;\n mid = (mid + Math.imul(ah7, bl1)) | 0;\n hi = (hi + Math.imul(ah7, bh1)) | 0;\n lo = (lo + Math.imul(al6, bl2)) | 0;\n mid = (mid + Math.imul(al6, bh2)) | 0;\n mid = (mid + Math.imul(ah6, bl2)) | 0;\n hi = (hi + Math.imul(ah6, bh2)) | 0;\n lo = (lo + Math.imul(al5, bl3)) | 0;\n mid = (mid + Math.imul(al5, bh3)) | 0;\n mid = (mid + Math.imul(ah5, bl3)) | 0;\n hi = (hi + Math.imul(ah5, bh3)) | 0;\n lo = (lo + Math.imul(al4, bl4)) | 0;\n mid = (mid + Math.imul(al4, bh4)) | 0;\n mid = (mid + Math.imul(ah4, bl4)) | 0;\n hi = (hi + Math.imul(ah4, bh4)) | 0;\n lo = (lo + Math.imul(al3, bl5)) | 0;\n mid = (mid + Math.imul(al3, bh5)) | 0;\n mid = (mid + Math.imul(ah3, bl5)) | 0;\n hi = (hi + Math.imul(ah3, bh5)) | 0;\n lo = (lo + Math.imul(al2, bl6)) | 0;\n mid = (mid + Math.imul(al2, bh6)) | 0;\n mid = (mid + Math.imul(ah2, bl6)) | 0;\n hi = (hi + Math.imul(ah2, bh6)) | 0;\n lo = (lo + Math.imul(al1, bl7)) | 0;\n mid = (mid + Math.imul(al1, bh7)) | 0;\n mid = (mid + Math.imul(ah1, bl7)) | 0;\n hi = (hi + Math.imul(ah1, bh7)) | 0;\n lo = (lo + Math.imul(al0, bl8)) | 0;\n mid = (mid + Math.imul(al0, bh8)) | 0;\n mid = (mid + Math.imul(ah0, bl8)) | 0;\n hi = (hi + Math.imul(ah0, bh8)) | 0;\n var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n w8 &= 0x3ffffff;\n /* k = 9 */\n lo = Math.imul(al9, bl0);\n mid = Math.imul(al9, bh0);\n mid = (mid + Math.imul(ah9, bl0)) | 0;\n hi = Math.imul(ah9, bh0);\n lo = (lo + Math.imul(al8, bl1)) | 0;\n mid = (mid + Math.imul(al8, bh1)) | 0;\n mid = (mid + Math.imul(ah8, bl1)) | 0;\n hi = (hi + Math.imul(ah8, bh1)) | 0;\n lo = (lo + Math.imul(al7, bl2)) | 0;\n mid = (mid + Math.imul(al7, bh2)) | 0;\n mid = (mid + Math.imul(ah7, bl2)) | 0;\n hi = (hi + Math.imul(ah7, bh2)) | 0;\n lo = (lo + Math.imul(al6, bl3)) | 0;\n mid = (mid + Math.imul(al6, bh3)) | 0;\n mid = (mid + Math.imul(ah6, bl3)) | 0;\n hi = (hi + Math.imul(ah6, bh3)) | 0;\n lo = (lo + Math.imul(al5, bl4)) | 0;\n mid = (mid + Math.imul(al5, bh4)) | 0;\n mid = (mid + Math.imul(ah5, bl4)) | 0;\n hi = (hi + Math.imul(ah5, bh4)) | 0;\n lo = (lo + Math.imul(al4, bl5)) | 0;\n mid = (mid + Math.imul(al4, bh5)) | 0;\n mid = (mid + Math.imul(ah4, bl5)) | 0;\n hi = (hi + Math.imul(ah4, bh5)) | 0;\n lo = (lo + Math.imul(al3, bl6)) | 0;\n mid = (mid + Math.imul(al3, bh6)) | 0;\n mid = (mid + Math.imul(ah3, bl6)) | 0;\n hi = (hi + Math.imul(ah3, bh6)) | 0;\n lo = (lo + Math.imul(al2, bl7)) | 0;\n mid = (mid + Math.imul(al2, bh7)) | 0;\n mid = (mid + Math.imul(ah2, bl7)) | 0;\n hi = (hi + Math.imul(ah2, bh7)) | 0;\n lo = (lo + Math.imul(al1, bl8)) | 0;\n mid = (mid + Math.imul(al1, bh8)) | 0;\n mid = (mid + Math.imul(ah1, bl8)) | 0;\n hi = (hi + Math.imul(ah1, bh8)) | 0;\n lo = (lo + Math.imul(al0, bl9)) | 0;\n mid = (mid + Math.imul(al0, bh9)) | 0;\n mid = (mid + Math.imul(ah0, bl9)) | 0;\n hi = (hi + Math.imul(ah0, bh9)) | 0;\n var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n w9 &= 0x3ffffff;\n /* k = 10 */\n lo = Math.imul(al9, bl1);\n mid = Math.imul(al9, bh1);\n mid = (mid + Math.imul(ah9, bl1)) | 0;\n hi = Math.imul(ah9, bh1);\n lo = (lo + Math.imul(al8, bl2)) | 0;\n mid = (mid + Math.imul(al8, bh2)) | 0;\n mid = (mid + Math.imul(ah8, bl2)) | 0;\n hi = (hi + Math.imul(ah8, bh2)) | 0;\n lo = (lo + Math.imul(al7, bl3)) | 0;\n mid = (mid + Math.imul(al7, bh3)) | 0;\n mid = (mid + Math.imul(ah7, bl3)) | 0;\n hi = (hi + Math.imul(ah7, bh3)) | 0;\n lo = (lo + Math.imul(al6, bl4)) | 0;\n mid = (mid + Math.imul(al6, bh4)) | 0;\n mid = (mid + Math.imul(ah6, bl4)) | 0;\n hi = (hi + Math.imul(ah6, bh4)) | 0;\n lo = (lo + Math.imul(al5, bl5)) | 0;\n mid = (mid + Math.imul(al5, bh5)) | 0;\n mid = (mid + Math.imul(ah5, bl5)) | 0;\n hi = (hi + Math.imul(ah5, bh5)) | 0;\n lo = (lo + Math.imul(al4, bl6)) | 0;\n mid = (mid + Math.imul(al4, bh6)) | 0;\n mid = (mid + Math.imul(ah4, bl6)) | 0;\n hi = (hi + Math.imul(ah4, bh6)) | 0;\n lo = (lo + Math.imul(al3, bl7)) | 0;\n mid = (mid + Math.imul(al3, bh7)) | 0;\n mid = (mid + Math.imul(ah3, bl7)) | 0;\n hi = (hi + Math.imul(ah3, bh7)) | 0;\n lo = (lo + Math.imul(al2, bl8)) | 0;\n mid = (mid + Math.imul(al2, bh8)) | 0;\n mid = (mid + Math.imul(ah2, bl8)) | 0;\n hi = (hi + Math.imul(ah2, bh8)) | 0;\n lo = (lo + Math.imul(al1, bl9)) | 0;\n mid = (mid + Math.imul(al1, bh9)) | 0;\n mid = (mid + Math.imul(ah1, bl9)) | 0;\n hi = (hi + Math.imul(ah1, bh9)) | 0;\n var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n w10 &= 0x3ffffff;\n /* k = 11 */\n lo = Math.imul(al9, bl2);\n mid = Math.imul(al9, bh2);\n mid = (mid + Math.imul(ah9, bl2)) | 0;\n hi = Math.imul(ah9, bh2);\n lo = (lo + Math.imul(al8, bl3)) | 0;\n mid = (mid + Math.imul(al8, bh3)) | 0;\n mid = (mid + Math.imul(ah8, bl3)) | 0;\n hi = (hi + Math.imul(ah8, bh3)) | 0;\n lo = (lo + Math.imul(al7, bl4)) | 0;\n mid = (mid + Math.imul(al7, bh4)) | 0;\n mid = (mid + Math.imul(ah7, bl4)) | 0;\n hi = (hi + Math.imul(ah7, bh4)) | 0;\n lo = (lo + Math.imul(al6, bl5)) | 0;\n mid = (mid + Math.imul(al6, bh5)) | 0;\n mid = (mid + Math.imul(ah6, bl5)) | 0;\n hi = (hi + Math.imul(ah6, bh5)) | 0;\n lo = (lo + Math.imul(al5, bl6)) | 0;\n mid = (mid + Math.imul(al5, bh6)) | 0;\n mid = (mid + Math.imul(ah5, bl6)) | 0;\n hi = (hi + Math.imul(ah5, bh6)) | 0;\n lo = (lo + Math.imul(al4, bl7)) | 0;\n mid = (mid + Math.imul(al4, bh7)) | 0;\n mid = (mid + Math.imul(ah4, bl7)) | 0;\n hi = (hi + Math.imul(ah4, bh7)) | 0;\n lo = (lo + Math.imul(al3, bl8)) | 0;\n mid = (mid + Math.imul(al3, bh8)) | 0;\n mid = (mid + Math.imul(ah3, bl8)) | 0;\n hi = (hi + Math.imul(ah3, bh8)) | 0;\n lo = (lo + Math.imul(al2, bl9)) | 0;\n mid = (mid + Math.imul(al2, bh9)) | 0;\n mid = (mid + Math.imul(ah2, bl9)) | 0;\n hi = (hi + Math.imul(ah2, bh9)) | 0;\n var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n w11 &= 0x3ffffff;\n /* k = 12 */\n lo = Math.imul(al9, bl3);\n mid = Math.imul(al9, bh3);\n mid = (mid + Math.imul(ah9, bl3)) | 0;\n hi = Math.imul(ah9, bh3);\n lo = (lo + Math.imul(al8, bl4)) | 0;\n mid = (mid + Math.imul(al8, bh4)) | 0;\n mid = (mid + Math.imul(ah8, bl4)) | 0;\n hi = (hi + Math.imul(ah8, bh4)) | 0;\n lo = (lo + Math.imul(al7, bl5)) | 0;\n mid = (mid + Math.imul(al7, bh5)) | 0;\n mid = (mid + Math.imul(ah7, bl5)) | 0;\n hi = (hi + Math.imul(ah7, bh5)) | 0;\n lo = (lo + Math.imul(al6, bl6)) | 0;\n mid = (mid + Math.imul(al6, bh6)) | 0;\n mid = (mid + Math.imul(ah6, bl6)) | 0;\n hi = (hi + Math.imul(ah6, bh6)) | 0;\n lo = (lo + Math.imul(al5, bl7)) | 0;\n mid = (mid + Math.imul(al5, bh7)) | 0;\n mid = (mid + Math.imul(ah5, bl7)) | 0;\n hi = (hi + Math.imul(ah5, bh7)) | 0;\n lo = (lo + Math.imul(al4, bl8)) | 0;\n mid = (mid + Math.imul(al4, bh8)) | 0;\n mid = (mid + Math.imul(ah4, bl8)) | 0;\n hi = (hi + Math.imul(ah4, bh8)) | 0;\n lo = (lo + Math.imul(al3, bl9)) | 0;\n mid = (mid + Math.imul(al3, bh9)) | 0;\n mid = (mid + Math.imul(ah3, bl9)) | 0;\n hi = (hi + Math.imul(ah3, bh9)) | 0;\n var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n w12 &= 0x3ffffff;\n /* k = 13 */\n lo = Math.imul(al9, bl4);\n mid = Math.imul(al9, bh4);\n mid = (mid + Math.imul(ah9, bl4)) | 0;\n hi = Math.imul(ah9, bh4);\n lo = (lo + Math.imul(al8, bl5)) | 0;\n mid = (mid + Math.imul(al8, bh5)) | 0;\n mid = (mid + Math.imul(ah8, bl5)) | 0;\n hi = (hi + Math.imul(ah8, bh5)) | 0;\n lo = (lo + Math.imul(al7, bl6)) | 0;\n mid = (mid + Math.imul(al7, bh6)) | 0;\n mid = (mid + Math.imul(ah7, bl6)) | 0;\n hi = (hi + Math.imul(ah7, bh6)) | 0;\n lo = (lo + Math.imul(al6, bl7)) | 0;\n mid = (mid + Math.imul(al6, bh7)) | 0;\n mid = (mid + Math.imul(ah6, bl7)) | 0;\n hi = (hi + Math.imul(ah6, bh7)) | 0;\n lo = (lo + Math.imul(al5, bl8)) | 0;\n mid = (mid + Math.imul(al5, bh8)) | 0;\n mid = (mid + Math.imul(ah5, bl8)) | 0;\n hi = (hi + Math.imul(ah5, bh8)) | 0;\n lo = (lo + Math.imul(al4, bl9)) | 0;\n mid = (mid + Math.imul(al4, bh9)) | 0;\n mid = (mid + Math.imul(ah4, bl9)) | 0;\n hi = (hi + Math.imul(ah4, bh9)) | 0;\n var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n w13 &= 0x3ffffff;\n /* k = 14 */\n lo = Math.imul(al9, bl5);\n mid = Math.imul(al9, bh5);\n mid = (mid + Math.imul(ah9, bl5)) | 0;\n hi = Math.imul(ah9, bh5);\n lo = (lo + Math.imul(al8, bl6)) | 0;\n mid = (mid + Math.imul(al8, bh6)) | 0;\n mid = (mid + Math.imul(ah8, bl6)) | 0;\n hi = (hi + Math.imul(ah8, bh6)) | 0;\n lo = (lo + Math.imul(al7, bl7)) | 0;\n mid = (mid + Math.imul(al7, bh7)) | 0;\n mid = (mid + Math.imul(ah7, bl7)) | 0;\n hi = (hi + Math.imul(ah7, bh7)) | 0;\n lo = (lo + Math.imul(al6, bl8)) | 0;\n mid = (mid + Math.imul(al6, bh8)) | 0;\n mid = (mid + Math.imul(ah6, bl8)) | 0;\n hi = (hi + Math.imul(ah6, bh8)) | 0;\n lo = (lo + Math.imul(al5, bl9)) | 0;\n mid = (mid + Math.imul(al5, bh9)) | 0;\n mid = (mid + Math.imul(ah5, bl9)) | 0;\n hi = (hi + Math.imul(ah5, bh9)) | 0;\n var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n w14 &= 0x3ffffff;\n /* k = 15 */\n lo = Math.imul(al9, bl6);\n mid = Math.imul(al9, bh6);\n mid = (mid + Math.imul(ah9, bl6)) | 0;\n hi = Math.imul(ah9, bh6);\n lo = (lo + Math.imul(al8, bl7)) | 0;\n mid = (mid + Math.imul(al8, bh7)) | 0;\n mid = (mid + Math.imul(ah8, bl7)) | 0;\n hi = (hi + Math.imul(ah8, bh7)) | 0;\n lo = (lo + Math.imul(al7, bl8)) | 0;\n mid = (mid + Math.imul(al7, bh8)) | 0;\n mid = (mid + Math.imul(ah7, bl8)) | 0;\n hi = (hi + Math.imul(ah7, bh8)) | 0;\n lo = (lo + Math.imul(al6, bl9)) | 0;\n mid = (mid + Math.imul(al6, bh9)) | 0;\n mid = (mid + Math.imul(ah6, bl9)) | 0;\n hi = (hi + Math.imul(ah6, bh9)) | 0;\n var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n w15 &= 0x3ffffff;\n /* k = 16 */\n lo = Math.imul(al9, bl7);\n mid = Math.imul(al9, bh7);\n mid = (mid + Math.imul(ah9, bl7)) | 0;\n hi = Math.imul(ah9, bh7);\n lo = (lo + Math.imul(al8, bl8)) | 0;\n mid = (mid + Math.imul(al8, bh8)) | 0;\n mid = (mid + Math.imul(ah8, bl8)) | 0;\n hi = (hi + Math.imul(ah8, bh8)) | 0;\n lo = (lo + Math.imul(al7, bl9)) | 0;\n mid = (mid + Math.imul(al7, bh9)) | 0;\n mid = (mid + Math.imul(ah7, bl9)) | 0;\n hi = (hi + Math.imul(ah7, bh9)) | 0;\n var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n w16 &= 0x3ffffff;\n /* k = 17 */\n lo = Math.imul(al9, bl8);\n mid = Math.imul(al9, bh8);\n mid = (mid + Math.imul(ah9, bl8)) | 0;\n hi = Math.imul(ah9, bh8);\n lo = (lo + Math.imul(al8, bl9)) | 0;\n mid = (mid + Math.imul(al8, bh9)) | 0;\n mid = (mid + Math.imul(ah8, bl9)) | 0;\n hi = (hi + Math.imul(ah8, bh9)) | 0;\n var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n w17 &= 0x3ffffff;\n /* k = 18 */\n lo = Math.imul(al9, bl9);\n mid = Math.imul(al9, bh9);\n mid = (mid + Math.imul(ah9, bl9)) | 0;\n hi = Math.imul(ah9, bh9);\n var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n w18 &= 0x3ffffff;\n o[0] = w0;\n o[1] = w1;\n o[2] = w2;\n o[3] = w3;\n o[4] = w4;\n o[5] = w5;\n o[6] = w6;\n o[7] = w7;\n o[8] = w8;\n o[9] = w9;\n o[10] = w10;\n o[11] = w11;\n o[12] = w12;\n o[13] = w13;\n o[14] = w14;\n o[15] = w15;\n o[16] = w16;\n o[17] = w17;\n o[18] = w18;\n if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\n if (!Math.imul) {\n comb10MulTo = smallMulTo;\n }\n\n function bigMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n out.length = self.length + num.length;\n\n var carry = 0;\n var hncarry = 0;\n for (var k = 0; k < out.length - 1; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = hncarry;\n hncarry = 0;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = k - j;\n var a = self.words[i] | 0;\n var b = num.words[j] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n lo = (lo + rword) | 0;\n rword = lo & 0x3ffffff;\n ncarry = (ncarry + (lo >>> 26)) | 0;\n\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\n }\n if (carry !== 0) {\n out.words[k] = carry;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\n function jumboMulTo (self, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo (num, out) {\n var res;\n var len = this.length + num.length;\n if (this.length === 10 && num.length === 10) {\n res = comb10MulTo(this, num, out);\n } else if (len < 63) {\n res = smallMulTo(this, num, out);\n } else if (len < 1024) {\n res = bigMulTo(this, num, out);\n } else {\n res = jumboMulTo(this, num, out);\n }\n\n return res;\n };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\n\n function FFTM (x, y) {\n this.x = x;\n this.y = y;\n }\n\n FFTM.prototype.makeRBT = function makeRBT (N) {\n var t = new Array(N);\n var l = BN.prototype._countBits(N) - 1;\n for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\n FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) {\n rtws[i] = rws[rbt[i]];\n itws[i] = iws[rbt[i]];\n }\n };\n\n FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n\n for (var s = 1; s < N; s <<= 1) {\n var l = s << 1;\n\n var rtwdf = Math.cos(2 * Math.PI / l);\n var itwdf = Math.sin(2 * Math.PI / l);\n\n for (var p = 0; p < N; p += l) {\n var rtwdf_ = rtwdf;\n var itwdf_ = itwdf;\n\n for (var j = 0; j < s; j++) {\n var re = rtws[p + j];\n var ie = itws[p + j];\n\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n rtwdf_ = rx;\n }\n }\n }\n }\n };\n\n FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n var N = Math.max(m, n) | 1;\n var odd = N & 1;\n var i = 0;\n for (N = N / 2 | 0; N; N = N >>> 1) {\n i++;\n }\n\n return 1 << i + 1 + odd;\n };\n\n FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n if (N <= 1) return;\n\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\n iws[i] = -iws[N - i - 1];\n iws[N - i - 1] = -t;\n }\n };\n\n FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n var carry = 0;\n for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\n ws[i] = w & 0x3ffffff;\n\n if (w < 0x4000000) {\n carry = 0;\n } else {\n carry = w / 0x4000000 | 0;\n }\n }\n\n return ws;\n };\n\n FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n var carry = 0;\n for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\n for (i = 2 * len; i < N; ++i) {\n rws[i] = 0;\n }\n\n assert(carry === 0);\n assert((carry & ~0x1fff) === 0);\n };\n\n FFTM.prototype.stub = function stub (N) {\n var ph = new Array(N);\n for (var i = 0; i < N; i++) {\n ph[i] = 0;\n }\n\n return ph;\n };\n\n FFTM.prototype.mulp = function mulp (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length);\n\n var rbt = this.makeRBT(N);\n\n var _ = this.stub(N);\n\n var rws = new Array(N);\n var rwst = new Array(N);\n var iwst = new Array(N);\n\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\n\n this.transform(rws, _, rwst, iwst, N, rbt);\n this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n for (var i = 0; i < N; i++) {\n var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n rwst[i] = rx;\n }\n\n this.conjugate(rwst, iwst, N);\n this.transform(rwst, iwst, rmws, _, N, rbt);\n this.conjugate(rmws, _, N);\n this.normalize13b(rmws, N);\n\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\n BN.prototype.mul = function mul (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return this.mulTo(num, out);\n };\n\n // Multiply employing FFT\n BN.prototype.mulf = function mulf (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return jumboMulTo(this, num, out);\n };\n\n // In-place Multiplication\n BN.prototype.imul = function imul (num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n\n // Carry\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num;\n var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n carry >>= 26;\n carry += (w / 0x4000000) | 0;\n // NOTE: lo is 27bit maximum\n carry += lo >>> 26;\n this.words[i] = lo & 0x3ffffff;\n }\n\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n this.length = num === 0 ? 1 : this.length;\n\n return this;\n };\n\n BN.prototype.muln = function muln (num) {\n return this.clone().imuln(num);\n };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\n for (var i = 0; i < w.length; i++, res = res.sqr()) {\n if (w[i] !== 0) break;\n }\n\n if (++i < w.length) {\n for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n if (w[i] === 0) continue;\n\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\n BN.prototype.iushln = function iushln (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n var i;\n\n if (r !== 0) {\n var carry = 0;\n\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask;\n var c = ((this.words[i] | 0) - newCarry) << r;\n this.words[i] = c | carry;\n carry = newCarry >>> (26 - r);\n }\n\n if (carry) {\n this.words[i] = carry;\n this.length++;\n }\n }\n\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) {\n this.words[i + s] = this.words[i];\n }\n\n for (i = 0; i < s; i++) {\n this.words[i] = 0;\n }\n\n this.length += s;\n }\n\n return this.strip();\n };\n\n BN.prototype.ishln = function ishln (bits) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushln(bits);\n };\n\n // Shift-right in-place\n // NOTE: `hint` is a lowest bit before trailing zeroes\n // NOTE: if `extended` is present - it will be filled with destroyed bits\n BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\n if (hint) {\n h = (hint - (hint % 26)) / 26;\n } else {\n h = 0;\n }\n\n var r = bits % 26;\n var s = Math.min((bits - r) / 26, this.length);\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n var maskedWords = extended;\n\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\n for (i = 0; i < this.length; i++) {\n this.words[i] = this.words[i + s];\n }\n } else {\n this.words[0] = 0;\n this.length = 1;\n }\n\n var carry = 0;\n for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n var word = this.words[i] | 0;\n this.words[i] = (carry << (26 - r)) | (word >>> r);\n carry = word & mask;\n }\n\n // Push carried bits as a mask\n if (maskedWords && carry !== 0) {\n maskedWords.words[maskedWords.length++] = carry;\n }\n\n if (this.length === 0) {\n this.words[0] = 0;\n this.length = 1;\n }\n\n return this.strip();\n };\n\n BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushrn(bits, hint, extended);\n };\n\n // Shift-left\n BN.prototype.shln = function shln (bits) {\n return this.clone().ishln(bits);\n };\n\n BN.prototype.ushln = function ushln (bits) {\n return this.clone().iushln(bits);\n };\n\n // Shift-right\n BN.prototype.shrn = function shrn (bits) {\n return this.clone().ishrn(bits);\n };\n\n BN.prototype.ushrn = function ushrn (bits) {\n return this.clone().iushrn(bits);\n };\n\n // Test if n bit is set\n BN.prototype.testn = function testn (bit) {\n assert(typeof bit === 'number' && bit >= 0);\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\n BN.prototype.imaskn = function imaskn (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n\n assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n if (this.length <= s) {\n return this;\n }\n\n if (r !== 0) {\n s++;\n }\n this.length = Math.min(s, this.length);\n\n if (r !== 0) {\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n\n if (this.length === 0) {\n this.words[0] = 0;\n this.length = 1;\n }\n\n return this.strip();\n };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\n if (this.negative !== 0) {\n if (this.length === 1 && (this.words[0] | 0) < num) {\n this.words[0] = num - (this.words[0] | 0);\n this.negative = 0;\n return this;\n }\n\n this.negative = 0;\n this.isubn(num);\n this.negative = 1;\n return this;\n }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\n BN.prototype.isubn = function isubn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.iaddn(-num);\n\n if (this.negative !== 0) {\n this.negative = 0;\n this.iaddn(num);\n this.negative = 1;\n return this;\n }\n\n this.words[0] -= num;\n\n if (this.length === 1 && this.words[0] < 0) {\n this.words[0] = -this.words[0];\n this.negative = 1;\n } else {\n // Carry\n for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n this.words[i] += 0x4000000;\n this.words[i + 1] -= 1;\n }\n }\n\n return this.strip();\n };\n\n BN.prototype.addn = function addn (num) {\n return this.clone().iaddn(num);\n };\n\n BN.prototype.subn = function subn (num) {\n return this.clone().isubn(num);\n };\n\n BN.prototype.iabs = function iabs () {\n this.negative = 0;\n\n return this;\n };\n\n BN.prototype.abs = function abs () {\n return this.clone().iabs();\n };\n\n BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n var len = num.length + shift;\n var i;\n\n this._expand(len);\n\n var w;\n var carry = 0;\n for (i = 0; i < num.length; i++) {\n w = (this.words[i + shift] | 0) + carry;\n var right = (num.words[i] | 0) * mul;\n w -= right & 0x3ffffff;\n carry = (w >> 26) - ((right / 0x4000000) | 0);\n this.words[i + shift] = w & 0x3ffffff;\n }\n for (; i < this.length - shift; i++) {\n w = (this.words[i + shift] | 0) + carry;\n carry = w >> 26;\n this.words[i + shift] = w & 0x3ffffff;\n }\n\n if (carry === 0) return this.strip();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\n for (i = 0; i < this.length; i++) {\n w = -(this.words[i] | 0) + carry;\n carry = w >> 26;\n this.words[i] = w & 0x3ffffff;\n }\n this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\n var m = a.length - b.length;\n var q;\n\n if (mode !== 'mod') {\n q = new BN(null);\n q.length = m + 1;\n q.words = new Array(q.length);\n for (var i = 0; i < q.length; i++) {\n q.words[i] = 0;\n }\n }\n\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n if (diff.negative === 0) {\n a = diff;\n if (q) {\n q.words[m] = 1;\n }\n }\n\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\n\n // NOTE: 1) `mode` can be set to `mod` to request mod only,\n // to `div` to request div only, or be absent to\n // request both div & mod\n // 2) `positive` is true if unsigned mod is requested\n BN.prototype.divmod = function divmod (num, mode, positive) {\n assert(!num.isZero());\n\n if (this.isZero()) {\n return {\n div: new BN(0),\n mod: new BN(0)\n };\n }\n\n var div, mod, res;\n if (this.negative !== 0 && num.negative === 0) {\n res = this.neg().divmod(num, mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.iadd(num);\n }\n }\n\n return {\n div: div,\n mod: mod\n };\n }\n\n if (this.negative === 0 && num.negative !== 0) {\n res = this.divmod(num.neg(), mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n return {\n div: div,\n mod: res.mod\n };\n }\n\n if ((this.negative & num.negative) !== 0) {\n res = this.neg().divmod(num.neg(), mode);\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\n if (num.length === 1) {\n if (mode === 'div') {\n return {\n div: this.divn(num.words[0]),\n mod: null\n };\n }\n\n if (mode === 'mod') {\n return {\n div: null,\n mod: new BN(this.modn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\n BN.prototype.mod = function mod (num) {\n return this.divmod(num, 'mod', false).mod;\n };\n\n BN.prototype.umod = function umod (num) {\n return this.divmod(num, 'mod', true).mod;\n };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modn = function modn (num) {\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n\n var acc = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return acc;\n };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 0x4000000;\n this.words[i] = (w / num) | 0;\n carry = w % num;\n }\n\n return this.strip();\n };\n\n BN.prototype.divn = function divn (num) {\n return this.clone().idivn(num);\n };\n\n BN.prototype.egcd = function egcd (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var x = this;\n var y = p.clone();\n\n if (x.negative !== 0) {\n x = x.umod(p);\n } else {\n x = x.clone();\n }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\n var g = 0;\n\n while (x.isEven() && y.isEven()) {\n x.iushrn(1);\n y.iushrn(1);\n ++g;\n }\n\n var yp = y.clone();\n var xp = x.clone();\n\n while (!x.isZero()) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n x.iushrn(i);\n while (i-- > 0) {\n if (A.isOdd() || B.isOdd()) {\n A.iadd(yp);\n B.isub(xp);\n }\n\n A.iushrn(1);\n B.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n y.iushrn(j);\n while (j-- > 0) {\n if (C.isOdd() || D.isOdd()) {\n C.iadd(yp);\n D.isub(xp);\n }\n\n C.iushrn(1);\n D.iushrn(1);\n }\n }\n\n if (x.cmp(y) >= 0) {\n x.isub(y);\n A.isub(C);\n B.isub(D);\n } else {\n y.isub(x);\n C.isub(A);\n D.isub(B);\n }\n }\n\n return {\n a: C,\n b: D,\n gcd: y.iushln(g)\n };\n };\n\n // This is reduced incarnation of the binary EEA\n // above, designated to invert members of the\n // _prime_ fields F(p) at a maximal speed\n BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var a = this;\n var b = p.clone();\n\n if (a.negative !== 0) {\n a = a.umod(p);\n } else {\n a = a.clone();\n }\n\n var x1 = new BN(1);\n var x2 = new BN(0);\n\n var delta = b.clone();\n\n while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n a.iushrn(i);\n while (i-- > 0) {\n if (x1.isOdd()) {\n x1.iadd(delta);\n }\n\n x1.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n b.iushrn(j);\n while (j-- > 0) {\n if (x2.isOdd()) {\n x2.iadd(delta);\n }\n\n x2.iushrn(1);\n }\n }\n\n if (a.cmp(b) >= 0) {\n a.isub(b);\n x1.isub(x2);\n } else {\n b.isub(a);\n x2.isub(x1);\n }\n }\n\n var res;\n if (a.cmpn(1) === 0) {\n res = x1;\n } else {\n res = x2;\n }\n\n if (res.cmpn(0) < 0) {\n res.iadd(p);\n }\n\n return res;\n };\n\n BN.prototype.gcd = function gcd (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\n for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n a.iushrn(1);\n b.iushrn(1);\n }\n\n do {\n while (a.isEven()) {\n a.iushrn(1);\n }\n while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\n if (r < 0) {\n // Swap `a` and `b` to make `a` always bigger than `b`\n var t = a;\n a = b;\n b = t;\n } else if (r === 0 || b.cmpn(1) === 0) {\n break;\n }\n\n a.isub(b);\n } while (true);\n\n return b.iushln(shift);\n };\n\n // Invert number in the field F(num)\n BN.prototype.invm = function invm (num) {\n return this.egcd(num).a.umod(num);\n };\n\n BN.prototype.isEven = function isEven () {\n return (this.words[0] & 1) === 0;\n };\n\n BN.prototype.isOdd = function isOdd () {\n return (this.words[0] & 1) === 1;\n };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\n BN.prototype.bincn = function bincn (bit) {\n assert(typeof bit === 'number');\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\n for (var i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n w += carry;\n carry = w >>> 26;\n w &= 0x3ffffff;\n this.words[i] = w;\n }\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n return this;\n };\n\n BN.prototype.isZero = function isZero () {\n return this.length === 1 && this.words[0] === 0;\n };\n\n BN.prototype.cmpn = function cmpn (num) {\n var negative = num < 0;\n\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\n if (this.length > 1) {\n res = 1;\n } else {\n if (negative) {\n num = -num;\n }\n\n assert(num <= 0x3ffffff, 'Number is too big');\n\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\n BN.prototype.cmp = function cmp (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\n BN.prototype.ucmp = function ucmp (num) {\n // At this point both numbers have the same sign\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n\n var res = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0;\n var b = num.words[i] | 0;\n\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\n }\n return res;\n };\n\n BN.prototype.gtn = function gtn (num) {\n return this.cmpn(num) === 1;\n };\n\n BN.prototype.gt = function gt (num) {\n return this.cmp(num) === 1;\n };\n\n BN.prototype.gten = function gten (num) {\n return this.cmpn(num) >= 0;\n };\n\n BN.prototype.gte = function gte (num) {\n return this.cmp(num) >= 0;\n };\n\n BN.prototype.ltn = function ltn (num) {\n return this.cmpn(num) === -1;\n };\n\n BN.prototype.lt = function lt (num) {\n return this.cmp(num) === -1;\n };\n\n BN.prototype.lten = function lten (num) {\n return this.cmpn(num) <= 0;\n };\n\n BN.prototype.lte = function lte (num) {\n return this.cmp(num) <= 0;\n };\n\n BN.prototype.eqn = function eqn (num) {\n return this.cmpn(num) === 0;\n };\n\n BN.prototype.eq = function eq (num) {\n return this.cmp(num) === 0;\n };\n\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\n //\n BN.red = function red (num) {\n return new Red(num);\n };\n\n BN.prototype.toRed = function toRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n assert(this.negative === 0, 'red works only with positives');\n return ctx.convertTo(this)._forceRed(ctx);\n };\n\n BN.prototype.fromRed = function fromRed () {\n assert(this.red, 'fromRed works only with numbers in reduction context');\n return this.red.convertFrom(this);\n };\n\n BN.prototype._forceRed = function _forceRed (ctx) {\n this.red = ctx;\n return this;\n };\n\n BN.prototype.forceRed = function forceRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n return this._forceRed(ctx);\n };\n\n BN.prototype.redAdd = function redAdd (num) {\n assert(this.red, 'redAdd works only with red numbers');\n return this.red.add(this, num);\n };\n\n BN.prototype.redIAdd = function redIAdd (num) {\n assert(this.red, 'redIAdd works only with red numbers');\n return this.red.iadd(this, num);\n };\n\n BN.prototype.redSub = function redSub (num) {\n assert(this.red, 'redSub works only with red numbers');\n return this.red.sub(this, num);\n };\n\n BN.prototype.redISub = function redISub (num) {\n assert(this.red, 'redISub works only with red numbers');\n return this.red.isub(this, num);\n };\n\n BN.prototype.redShl = function redShl (num) {\n assert(this.red, 'redShl works only with red numbers');\n return this.red.shl(this, num);\n };\n\n BN.prototype.redMul = function redMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.mul(this, num);\n };\n\n BN.prototype.redIMul = function redIMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.imul(this, num);\n };\n\n BN.prototype.redSqr = function redSqr () {\n assert(this.red, 'redSqr works only with red numbers');\n this.red._verify1(this);\n return this.red.sqr(this);\n };\n\n BN.prototype.redISqr = function redISqr () {\n assert(this.red, 'redISqr works only with red numbers');\n this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\n return this.red.sqrt(this);\n };\n\n BN.prototype.redInvm = function redInvm () {\n assert(this.red, 'redInvm works only with red numbers');\n this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\n function MPrime (name, p) {\n // P = 2 ^ N - K\n this.name = name;\n this.p = new BN(p, 16);\n this.n = this.p.bitLength();\n this.k = new BN(1).iushln(this.n).isub(this.p);\n\n this.tmp = this._tmp();\n }\n\n MPrime.prototype._tmp = function _tmp () {\n var tmp = new BN(null);\n tmp.words = new Array(Math.ceil(this.n / 13));\n return tmp;\n };\n\n MPrime.prototype.ireduce = function ireduce (num) {\n // Assumes that `num` is less than `P^2`\n // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n var r = num;\n var rlen;\n\n do {\n this.split(r, this.tmp);\n r = this.imulK(r);\n r = r.iadd(this.tmp);\n rlen = r.bitLength();\n } while (rlen > this.n);\n\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n if (cmp === 0) {\n r.words[0] = 0;\n r.length = 1;\n } else if (cmp > 0) {\n r.isub(this.p);\n } else {\n if (r.strip !== undefined) {\n // r is BN v4 instance\n r.strip();\n } else {\n // r is BN v5 instance\n r._strip();\n }\n }\n\n return r;\n };\n\n MPrime.prototype.split = function split (input, out) {\n input.iushrn(this.n, 0, out);\n };\n\n MPrime.prototype.imulK = function imulK (num) {\n return num.imul(this.k);\n };\n\n function K256 () {\n MPrime.call(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\n var prev = input.words[9];\n output.words[output.length++] = prev & mask;\n\n for (i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n prev = next;\n }\n prev >>>= 22;\n input.words[i - 10] = prev;\n if (prev === 0 && input.length > 10) {\n input.length -= 10;\n } else {\n input.length -= 9;\n }\n };\n\n K256.prototype.imulK = function imulK (num) {\n // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n num.words[num.length] = 0;\n num.words[num.length + 1] = 0;\n num.length += 2;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\n for (var i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n lo += w * 0x3d1;\n num.words[i] = lo & 0x3ffffff;\n lo = w * 0x40 + ((lo / 0x4000000) | 0);\n }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\n for (var i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 0x13 + carry;\n var lo = hi & 0x3ffffff;\n hi >>>= 26;\n\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\n if (name === 'k256') {\n prime = new K256();\n } else if (name === 'p224') {\n prime = new P224();\n } else if (name === 'p192') {\n prime = new P192();\n } else if (name === 'p25519') {\n prime = new P25519();\n } else {\n throw new Error('Unknown prime ' + name);\n }\n primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\n this.m = prime.p;\n this.prime = prime;\n } else {\n assert(m.gtn(1), 'modulus must be greater than 1');\n this.m = m;\n this.prime = null;\n }\n }\n\n Red.prototype._verify1 = function _verify1 (a) {\n assert(a.negative === 0, 'red works only with positives');\n assert(a.red, 'red works only with red numbers');\n };\n\n Red.prototype._verify2 = function _verify2 (a, b) {\n assert((a.negative | b.negative) === 0, 'red works only with positives');\n assert(a.red && a.red === b.red,\n 'red works only with red numbers');\n };\n\n Red.prototype.imod = function imod (a) {\n if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n return a.umod(this.m)._forceRed(this);\n };\n\n Red.prototype.neg = function neg (a) {\n if (a.isZero()) {\n return a.clone();\n }\n\n return this.m.sub(a)._forceRed(this);\n };\n\n Red.prototype.add = function add (a, b) {\n this._verify2(a, b);\n\n var res = a.add(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.iadd = function iadd (a, b) {\n this._verify2(a, b);\n\n var res = a.iadd(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res;\n };\n\n Red.prototype.sub = function sub (a, b) {\n this._verify2(a, b);\n\n var res = a.sub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.isub = function isub (a, b) {\n this._verify2(a, b);\n\n var res = a.isub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\n return this.imod(a.mul(b));\n };\n\n Red.prototype.isqr = function isqr (a) {\n return this.imul(a, a.clone());\n };\n\n Red.prototype.sqr = function sqr (a) {\n return this.mul(a, a);\n };\n\n Red.prototype.sqrt = function sqrt (a) {\n if (a.isZero()) return a.clone();\n\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\n var lpow = this.m.subn(1).iushrn(1);\n var z = this.m.bitLength();\n z = new BN(2 * z * z).toRed(this);\n\n while (this.pow(z, lpow).cmp(nOne) !== 0) {\n z.redIAdd(nOne);\n }\n\n var c = this.pow(z, q);\n var r = this.pow(a, q.addn(1).iushrn(1));\n var t = this.pow(a, q);\n var m = s;\n while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n r = r.redMul(b);\n c = b.redSqr();\n t = t.redMul(c);\n m = i;\n }\n\n return r;\n };\n\n Red.prototype.invm = function invm (a) {\n var inv = a._invmp(this.m);\n if (inv.negative !== 0) {\n inv.negative = 0;\n return this.imod(inv).redNeg();\n } else {\n return this.imod(inv);\n }\n };\n\n Red.prototype.pow = function pow (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\n for (var i = 2; i < wnd.length; i++) {\n wnd[i] = this.mul(wnd[i - 1], a);\n }\n\n var res = wnd[0];\n var current = 0;\n var currentLen = 0;\n var start = num.bitLength() % 26;\n if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if (res !== wnd[0]) {\n res = this.sqr(res);\n }\n\n if (bit === 0 && current === 0) {\n currentLen = 0;\n continue;\n }\n\n current <<= 1;\n current |= bit;\n currentLen++;\n if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\n }\n start = 26;\n }\n\n return res;\n };\n\n Red.prototype.convertTo = function convertTo (num) {\n var r = num.umod(this.m);\n\n return r === num ? r.clone() : r;\n };\n\n Red.prototype.convertFrom = function convertFrom (num) {\n var res = num.clone();\n res.red = null;\n return res;\n };\n\n //\n // Montgomery method engine\n //\n\n BN.mont = function mont (num) {\n return new Mont(num);\n };\n\n function Mont (m) {\n Red.call(this, m);\n\n this.shift = this.m.bitLength();\n if (this.shift % 26 !== 0) {\n this.shift += 26 - (this.shift % 26);\n }\n\n this.r = new BN(1).iushln(this.shift);\n this.r2 = this.imod(this.r.sqr());\n this.rinv = this.r._invmp(this.m);\n\n this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n this.minv = this.minv.umod(this.r);\n this.minv = this.r.sub(this.minv);\n }\n inherits(Mont, Red);\n\n Mont.prototype.convertTo = function convertTo (num) {\n return this.imod(num.ushln(this.shift));\n };\n\n Mont.prototype.convertFrom = function convertFrom (num) {\n var r = this.imod(num.mul(this.rinv));\n r.red = null;\n return r;\n };\n\n Mont.prototype.imul = function imul (a, b) {\n if (a.isZero() || b.isZero()) {\n a.words[0] = 0;\n a.length = 1;\n return a;\n }\n\n var t = a.imul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.mul = function mul (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n var t = a.mul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.invm = function invm (a) {\n // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n };\n})(typeof module === 'undefined' || module, this);\n","'use strict';\n\nvar elliptic = exports;\n\nelliptic.version = require('../package.json').version;\nelliptic.utils = require('./elliptic/utils');\nelliptic.rand = require('brorand');\nelliptic.curve = require('./elliptic/curve');\nelliptic.curves = require('./elliptic/curves');\n\n// Protocols\nelliptic.ec = require('./elliptic/ec');\nelliptic.eddsa = require('./elliptic/eddsa');\n","{\n \"name\": \"elliptic\",\n \"version\": \"6.6.1\",\n \"description\": \"EC cryptography\",\n \"main\": \"lib/elliptic.js\",\n \"files\": [\n \"lib\"\n ],\n \"scripts\": {\n \"lint\": \"eslint lib test\",\n \"lint:fix\": \"npm run lint -- --fix\",\n \"unit\": \"istanbul test _mocha --reporter=spec test/index.js\",\n \"test\": \"npm run lint && npm run unit\",\n \"version\": \"grunt dist && git add dist/\"\n },\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"git@github.com:indutny/elliptic\"\n },\n \"keywords\": [\n \"EC\",\n \"Elliptic\",\n \"curve\",\n \"Cryptography\"\n ],\n \"author\": \"Fedor Indutny <fedor@indutny.com>\",\n \"license\": \"MIT\",\n \"bugs\": {\n \"url\": \"https://github.com/indutny/elliptic/issues\"\n },\n \"homepage\": \"https://github.com/indutny/elliptic\",\n \"devDependencies\": {\n \"brfs\": \"^2.0.2\",\n \"coveralls\": \"^3.1.0\",\n \"eslint\": \"^7.6.0\",\n \"grunt\": \"^1.2.1\",\n \"grunt-browserify\": \"^5.3.0\",\n \"grunt-cli\": \"^1.3.2\",\n \"grunt-contrib-connect\": \"^3.0.0\",\n \"grunt-contrib-copy\": \"^1.0.0\",\n \"grunt-contrib-uglify\": \"^5.0.0\",\n \"grunt-mocha-istanbul\": \"^5.0.2\",\n \"grunt-saucelabs\": \"^9.0.1\",\n \"istanbul\": \"^0.4.5\",\n \"mocha\": \"^8.0.1\"\n },\n \"dependencies\": {\n \"bn.js\": \"^4.11.9\",\n \"brorand\": \"^1.1.0\",\n \"hash.js\": \"^1.0.0\",\n \"hmac-drbg\": \"^1.0.1\",\n \"inherits\": \"^2.0.4\",\n \"minimalistic-assert\": \"^1.0.1\",\n \"minimalistic-crypto-utils\": \"^1.0.1\"\n }\n}\n","'use strict';\n\nvar utils = exports;\nvar BN = require('bn.js');\nvar minAssert = require('minimalistic-assert');\nvar minUtils = require('minimalistic-crypto-utils');\n\nutils.assert = minAssert;\nutils.toArray = minUtils.toArray;\nutils.zero2 = minUtils.zero2;\nutils.toHex = minUtils.toHex;\nutils.encode = minUtils.encode;\n\n// Represent num in a w-NAF form\nfunction getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n var i;\n for (i = 0; i < naf.length; i += 1) {\n naf[i] = 0;\n }\n\n var ws = 1 << (w + 1);\n var k = num.clone();\n\n for (i = 0; i < naf.length; i++) {\n var z;\n var mod = k.andln(ws - 1);\n if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n z = mod;\n k.isubn(z);\n } else {\n z = 0;\n }\n\n naf[i] = z;\n k.iushrn(1);\n }\n\n return naf;\n}\nutils.getNAF = getNAF;\n\n// Represent k1, k2 in a Joint Sparse Form\nfunction getJSF(k1, k2) {\n var jsf = [\n [],\n [],\n ];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n var m8;\n while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n // First phase\n var m14 = (k1.andln(3) + d1) & 3;\n var m24 = (k2.andln(3) + d2) & 3;\n if (m14 === 3)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\n if ((m14 & 1) === 0) {\n u1 = 0;\n } else {\n m8 = (k1.andln(7) + d1) & 7;\n if ((m8 === 3 || m8 === 5) && m24 === 2)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\n if ((m24 & 1) === 0) {\n u2 = 0;\n } else {\n m8 = (k2.andln(7) + d2) & 7;\n if ((m8 === 3 || m8 === 5) && m14 === 2)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n}\nutils.getJSF = getJSF;\n\nfunction cachedProperty(obj, name, computer) {\n var key = '_' + name;\n obj.prototype[name] = function cachedProperty() {\n return this[key] !== undefined ? this[key] :\n this[key] = computer.call(this);\n };\n}\nutils.cachedProperty = cachedProperty;\n\nfunction parseBytes(bytes) {\n return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') :\n bytes;\n}\nutils.parseBytes = parseBytes;\n\nfunction intFromLE(bytes) {\n return new BN(bytes, 'hex', 'le');\n}\nutils.intFromLE = intFromLE;\n\n","module.exports = assert;\n\nfunction assert(val, msg) {\n if (!val)\n throw new Error(msg || 'Assertion failed');\n}\n\nassert.equal = function assertEqual(l, r, msg) {\n if (l != r)\n throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));\n};\n","'use strict';\n\nvar utils = exports;\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\n if (typeof msg !== 'string') {\n for (var i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n return res;\n }\n if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0)\n msg = '0' + msg;\n for (var i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else {\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n var hi = c >> 8;\n var lo = c & 0xff;\n if (hi)\n res.push(hi, lo);\n else\n res.push(lo);\n }\n }\n return res;\n}\nutils.toArray = toArray;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nutils.zero2 = zero2;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nutils.toHex = toHex;\n\nutils.encode = function encode(arr, enc) {\n if (enc === 'hex')\n return toHex(arr);\n else\n return arr;\n};\n","var r;\n\nmodule.exports = function rand(len) {\n if (!r)\n r = new Rand(null);\n\n return r.generate(len);\n};\n\nfunction Rand(rand) {\n this.rand = rand;\n}\nmodule.exports.Rand = Rand;\n\nRand.prototype.generate = function generate(len) {\n return this._rand(len);\n};\n\n// Emulate crypto API using randy\nRand.prototype._rand = function _rand(n) {\n if (this.rand.getBytes)\n return this.rand.getBytes(n);\n\n var res = new Uint8Array(n);\n for (var i = 0; i < res.length; i++)\n res[i] = this.rand.getByte();\n return res;\n};\n\nif (typeof self === 'object') {\n if (self.crypto && self.crypto.getRandomValues) {\n // Modern browsers\n Rand.prototype._rand = function _rand(n) {\n var arr = new Uint8Array(n);\n self.crypto.getRandomValues(arr);\n return arr;\n };\n } else if (self.msCrypto && self.msCrypto.getRandomValues) {\n // IE\n Rand.prototype._rand = function _rand(n) {\n var arr = new Uint8Array(n);\n self.msCrypto.getRandomValues(arr);\n return arr;\n };\n\n // Safari's WebWorkers do not have `crypto`\n } else if (typeof window === 'object') {\n // Old junk\n Rand.prototype._rand = function() {\n throw new Error('Not implemented yet');\n };\n }\n} else {\n // Node.js or Web worker with no crypto support\n try {\n var crypto = require('crypto');\n if (typeof crypto.randomBytes !== 'function')\n throw new Error('Not supported');\n\n Rand.prototype._rand = function _rand(n) {\n return crypto.randomBytes(n);\n };\n } catch (e) {\n }\n}\n","'use strict';\n\nvar curve = exports;\n\ncurve.base = require('./base');\ncurve.short = require('./short');\ncurve.mont = require('./mont');\ncurve.edwards = require('./edwards');\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar getNAF = utils.getNAF;\nvar getJSF = utils.getJSF;\nvar assert = utils.assert;\n\nfunction BaseCurve(type, conf) {\n this.type = type;\n this.p = new BN(conf.p, 16);\n\n // Use Montgomery, when there is no fast reduction for the prime\n this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p);\n\n // Useful for many curves\n this.zero = new BN(0).toRed(this.red);\n this.one = new BN(1).toRed(this.red);\n this.two = new BN(2).toRed(this.red);\n\n // Curve configuration, optional\n this.n = conf.n && new BN(conf.n, 16);\n this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed);\n\n // Temporary arrays\n this._wnafT1 = new Array(4);\n this._wnafT2 = new Array(4);\n this._wnafT3 = new Array(4);\n this._wnafT4 = new Array(4);\n\n this._bitLength = this.n ? this.n.bitLength() : 0;\n\n // Generalized Greg Maxwell's trick\n var adjustCount = this.n && this.p.div(this.n);\n if (!adjustCount || adjustCount.cmpn(100) > 0) {\n this.redN = null;\n } else {\n this._maxwellTrick = true;\n this.redN = this.n.toRed(this.red);\n }\n}\nmodule.exports = BaseCurve;\n\nBaseCurve.prototype.point = function point() {\n throw new Error('Not implemented');\n};\n\nBaseCurve.prototype.validate = function validate() {\n throw new Error('Not implemented');\n};\n\nBaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles();\n\n var naf = getNAF(k, 1, this._bitLength);\n var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n\n // Translate into more windowed form\n var repr = [];\n var j;\n var nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--)\n nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n\n var a = this.jpoint(null, null, null);\n var b = this.jpoint(null, null, null);\n for (var i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++) {\n nafW = repr[j];\n if (nafW === i)\n b = b.mixedAdd(doubles.points[j]);\n else if (nafW === -i)\n b = b.mixedAdd(doubles.points[j].neg());\n }\n a = a.add(b);\n }\n return a.toP();\n};\n\nBaseCurve.prototype._wnafMul = function _wnafMul(p, k) {\n var w = 4;\n\n // Precompute window\n var nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n var wnd = nafPoints.points;\n\n // Get NAF form\n var naf = getNAF(k, w, this._bitLength);\n\n // Add `this`*(N+1) for every w-NAF index\n var acc = this.jpoint(null, null, null);\n for (var i = naf.length - 1; i >= 0; i--) {\n // Count zeroes\n for (var l = 0; i >= 0 && naf[i] === 0; i--)\n l++;\n if (i >= 0)\n l++;\n acc = acc.dblp(l);\n\n if (i < 0)\n break;\n var z = naf[i];\n assert(z !== 0);\n if (p.type === 'affine') {\n // J +- P\n if (z > 0)\n acc = acc.mixedAdd(wnd[(z - 1) >> 1]);\n else\n acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg());\n } else {\n // J +- J\n if (z > 0)\n acc = acc.add(wnd[(z - 1) >> 1]);\n else\n acc = acc.add(wnd[(-z - 1) >> 1].neg());\n }\n }\n return p.type === 'affine' ? acc.toP() : acc;\n};\n\nBaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW,\n points,\n coeffs,\n len,\n jacobianResult) {\n var wndWidth = this._wnafT1;\n var wnd = this._wnafT2;\n var naf = this._wnafT3;\n\n // Fill all arrays\n var max = 0;\n var i;\n var j;\n var p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n wndWidth[i] = nafPoints.wnd;\n wnd[i] = nafPoints.points;\n }\n\n // Comb small window NAFs\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1;\n var b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength);\n naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength);\n max = Math.max(naf[a].length, max);\n max = Math.max(naf[b].length, max);\n continue;\n }\n\n var comb = [\n points[a], /* 1 */\n null, /* 3 */\n null, /* 5 */\n points[b], /* 7 */\n ];\n\n // Try to avoid Projective points, if possible\n if (points[a].y.cmp(points[b].y) === 0) {\n comb[1] = points[a].add(points[b]);\n comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n } else if (points[a].y.cmp(points[b].y.redNeg()) === 0) {\n comb[1] = points[a].toJ().mixedAdd(points[b]);\n comb[2] = points[a].add(points[b].neg());\n } else {\n comb[1] = points[a].toJ().mixedAdd(points[b]);\n comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n }\n\n var index = [\n -3, /* -1 -1 */\n -1, /* -1 0 */\n -5, /* -1 1 */\n -7, /* 0 -1 */\n 0, /* 0 0 */\n 7, /* 0 1 */\n 5, /* 1 -1 */\n 1, /* 1 0 */\n 3, /* 1 1 */\n ];\n\n var jsf = getJSF(coeffs[a], coeffs[b]);\n max = Math.max(jsf[0].length, max);\n naf[a] = new Array(max);\n naf[b] = new Array(max);\n for (j = 0; j < max; j++) {\n var ja = jsf[0][j] | 0;\n var jb = jsf[1][j] | 0;\n\n naf[a][j] = index[(ja + 1) * 3 + (jb + 1)];\n naf[b][j] = 0;\n wnd[a] = comb;\n }\n }\n\n var acc = this.jpoint(null, null, null);\n var tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n var k = 0;\n\n while (i >= 0) {\n var zero = true;\n for (j = 0; j < len; j++) {\n tmp[j] = naf[j][i] | 0;\n if (tmp[j] !== 0)\n zero = false;\n }\n if (!zero)\n break;\n k++;\n i--;\n }\n if (i >= 0)\n k++;\n acc = acc.dblp(k);\n if (i < 0)\n break;\n\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n p;\n if (z === 0)\n continue;\n else if (z > 0)\n p = wnd[j][(z - 1) >> 1];\n else if (z < 0)\n p = wnd[j][(-z - 1) >> 1].neg();\n\n if (p.type === 'affine')\n acc = acc.mixedAdd(p);\n else\n acc = acc.add(p);\n }\n }\n // Zeroify references\n for (i = 0; i < len; i++)\n wnd[i] = null;\n\n if (jacobianResult)\n return acc;\n else\n return acc.toP();\n};\n\nfunction BasePoint(curve, type) {\n this.curve = curve;\n this.type = type;\n this.precomputed = null;\n}\nBaseCurve.BasePoint = BasePoint;\n\nBasePoint.prototype.eq = function eq(/*other*/) {\n throw new Error('Not implemented');\n};\n\nBasePoint.prototype.validate = function validate() {\n return this.curve.validate(this);\n};\n\nBaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n\n var len = this.p.byteLength();\n\n // uncompressed, hybrid-odd, hybrid-even\n if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) &&\n bytes.length - 1 === 2 * len) {\n if (bytes[0] === 0x06)\n assert(bytes[bytes.length - 1] % 2 === 0);\n else if (bytes[0] === 0x07)\n assert(bytes[bytes.length - 1] % 2 === 1);\n\n var res = this.point(bytes.slice(1, 1 + len),\n bytes.slice(1 + len, 1 + 2 * len));\n\n return res;\n } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) &&\n bytes.length - 1 === len) {\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03);\n }\n throw new Error('Unknown point format');\n};\n\nBasePoint.prototype.encodeCompressed = function encodeCompressed(enc) {\n return this.encode(enc, true);\n};\n\nBasePoint.prototype._encode = function _encode(compact) {\n var len = this.curve.p.byteLength();\n var x = this.getX().toArray('be', len);\n\n if (compact)\n return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x);\n\n return [ 0x04 ].concat(x, this.getY().toArray('be', len));\n};\n\nBasePoint.prototype.encode = function encode(enc, compact) {\n return utils.encode(this._encode(compact), enc);\n};\n\nBasePoint.prototype.precompute = function precompute(power) {\n if (this.precomputed)\n return this;\n\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n precomputed.naf = this._getNAFPoints(8);\n precomputed.doubles = this._getDoubles(4, power);\n precomputed.beta = this._getBeta();\n this.precomputed = precomputed;\n\n return this;\n};\n\nBasePoint.prototype._hasDoubles = function _hasDoubles(k) {\n if (!this.precomputed)\n return false;\n\n var doubles = this.precomputed.doubles;\n if (!doubles)\n return false;\n\n return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step);\n};\n\nBasePoint.prototype._getDoubles = function _getDoubles(step, power) {\n if (this.precomputed && this.precomputed.doubles)\n return this.precomputed.doubles;\n\n var doubles = [ this ];\n var acc = this;\n for (var i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++)\n acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step: step,\n points: doubles,\n };\n};\n\nBasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) {\n if (this.precomputed && this.precomputed.naf)\n return this.precomputed.naf;\n\n var res = [ this ];\n var max = (1 << wnd) - 1;\n var dbl = max === 1 ? null : this.dbl();\n for (var i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd: wnd,\n points: res,\n };\n};\n\nBasePoint.prototype._getBeta = function _getBeta() {\n return null;\n};\n\nBasePoint.prototype.dblp = function dblp(k) {\n var r = this;\n for (var i = 0; i < k; i++)\n r = r.dbl();\n return r;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction ShortCurve(conf) {\n Base.call(this, 'short', conf);\n\n this.a = new BN(conf.a, 16).toRed(this.red);\n this.b = new BN(conf.b, 16).toRed(this.red);\n this.tinv = this.two.redInvm();\n\n this.zeroA = this.a.fromRed().cmpn(0) === 0;\n this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0;\n\n // If the curve is endomorphic, precalculate beta and lambda\n this.endo = this._getEndomorphism(conf);\n this._endoWnafT1 = new Array(4);\n this._endoWnafT2 = new Array(4);\n}\ninherits(ShortCurve, Base);\nmodule.exports = ShortCurve;\n\nShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) {\n // No efficient endomorphism\n if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)\n return;\n\n // Compute beta and lambda, that lambda * P = (beta * Px; Py)\n var beta;\n var lambda;\n if (conf.beta) {\n beta = new BN(conf.beta, 16).toRed(this.red);\n } else {\n var betas = this._getEndoRoots(this.p);\n // Choose the smallest beta\n beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1];\n beta = beta.toRed(this.red);\n }\n if (conf.lambda) {\n lambda = new BN(conf.lambda, 16);\n } else {\n // Choose the lambda that is matching selected beta\n var lambdas = this._getEndoRoots(this.n);\n if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) {\n lambda = lambdas[0];\n } else {\n lambda = lambdas[1];\n assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0);\n }\n }\n\n // Get basis vectors, used for balanced length-two representation\n var basis;\n if (conf.basis) {\n basis = conf.basis.map(function(vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n });\n } else {\n basis = this._getEndoBasis(lambda);\n }\n\n return {\n beta: beta,\n lambda: lambda,\n basis: basis,\n };\n};\n\nShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) {\n // Find roots of for x^2 + x + 1 in F\n // Root = (-1 +- Sqrt(-3)) / 2\n //\n var red = num === this.p ? this.red : BN.mont(num);\n var tinv = new BN(2).toRed(red).redInvm();\n var ntinv = tinv.redNeg();\n\n var s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv);\n\n var l1 = ntinv.redAdd(s).fromRed();\n var l2 = ntinv.redSub(s).fromRed();\n return [ l1, l2 ];\n};\n\nShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) {\n // aprxSqrt >= sqrt(this.n)\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2));\n\n // 3.74\n // Run EGCD, until r(L + 1) < aprxSqrt\n var u = lambda;\n var v = this.n.clone();\n var x1 = new BN(1);\n var y1 = new BN(0);\n var x2 = new BN(0);\n var y2 = new BN(1);\n\n // NOTE: all vectors are roots of: a + b * lambda = 0 (mod n)\n var a0;\n var b0;\n // First vector\n var a1;\n var b1;\n // Second vector\n var a2;\n var b2;\n\n var prevR;\n var i = 0;\n var r;\n var x;\n while (u.cmpn(0) !== 0) {\n var q = v.div(u);\n r = v.sub(q.mul(u));\n x = x2.sub(q.mul(x1));\n var y = y2.sub(q.mul(y1));\n\n if (!a1 && r.cmp(aprxSqrt) < 0) {\n a0 = prevR.neg();\n b0 = x1;\n a1 = r.neg();\n b1 = x;\n } else if (a1 && ++i === 2) {\n break;\n }\n prevR = r;\n\n v = u;\n u = r;\n x2 = x1;\n x1 = x;\n y2 = y1;\n y1 = y;\n }\n a2 = r.neg();\n b2 = x;\n\n var len1 = a1.sqr().add(b1.sqr());\n var len2 = a2.sqr().add(b2.sqr());\n if (len2.cmp(len1) >= 0) {\n a2 = a0;\n b2 = b0;\n }\n\n // Normalize signs\n if (a1.negative) {\n a1 = a1.neg();\n b1 = b1.neg();\n }\n if (a2.negative) {\n a2 = a2.neg();\n b2 = b2.neg();\n }\n\n return [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ];\n};\n\nShortCurve.prototype._endoSplit = function _endoSplit(k) {\n var basis = this.endo.basis;\n var v1 = basis[0];\n var v2 = basis[1];\n\n var c1 = v2.b.mul(k).divRound(this.n);\n var c2 = v1.b.neg().mul(k).divRound(this.n);\n\n var p1 = c1.mul(v1.a);\n var p2 = c2.mul(v2.a);\n var q1 = c1.mul(v1.b);\n var q2 = c2.mul(v2.b);\n\n // Calculate answer\n var k1 = k.sub(p1).sub(p2);\n var k2 = q1.add(q2).neg();\n return { k1: k1, k2: k2 };\n};\n\nShortCurve.prototype.pointFromX = function pointFromX(x, odd) {\n x = new BN(x, 16);\n if (!x.red)\n x = x.toRed(this.red);\n\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b);\n var y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n // XXX Is there any way to tell if the number is odd without converting it\n // to non-red form?\n var isOdd = y.fromRed().isOdd();\n if (odd && !isOdd || !odd && isOdd)\n y = y.redNeg();\n\n return this.point(x, y);\n};\n\nShortCurve.prototype.validate = function validate(point) {\n if (point.inf)\n return true;\n\n var x = point.x;\n var y = point.y;\n\n var ax = this.a.redMul(x);\n var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n};\n\nShortCurve.prototype._endoWnafMulAdd =\n function _endoWnafMulAdd(points, coeffs, jacobianResult) {\n var npoints = this._endoWnafT1;\n var ncoeffs = this._endoWnafT2;\n for (var i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]);\n var p = points[i];\n var beta = p._getBeta();\n\n if (split.k1.negative) {\n split.k1.ineg();\n p = p.neg(true);\n }\n if (split.k2.negative) {\n split.k2.ineg();\n beta = beta.neg(true);\n }\n\n npoints[i * 2] = p;\n npoints[i * 2 + 1] = beta;\n ncoeffs[i * 2] = split.k1;\n ncoeffs[i * 2 + 1] = split.k2;\n }\n var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult);\n\n // Clean-up references to points and coefficients\n for (var j = 0; j < i * 2; j++) {\n npoints[j] = null;\n ncoeffs[j] = null;\n }\n return res;\n };\n\nfunction Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, 'affine');\n if (x === null && y === null) {\n this.x = null;\n this.y = null;\n this.inf = true;\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n // Force redgomery representation when loading from JSON\n if (isRed) {\n this.x.forceRed(this.curve.red);\n this.y.forceRed(this.curve.red);\n }\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n this.inf = false;\n }\n}\ninherits(Point, Base.BasePoint);\n\nShortCurve.prototype.point = function point(x, y, isRed) {\n return new Point(this, x, y, isRed);\n};\n\nShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) {\n return Point.fromJSON(this, obj, red);\n};\n\nPoint.prototype._getBeta = function _getBeta() {\n if (!this.curve.endo)\n return;\n\n var pre = this.precomputed;\n if (pre && pre.beta)\n return pre.beta;\n\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve;\n var endoMul = function(p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n pre.beta = beta;\n beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n };\n }\n return beta;\n};\n\nPoint.prototype.toJSON = function toJSON() {\n if (!this.precomputed)\n return [ this.x, this.y ];\n\n return [ this.x, this.y, this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n } ];\n};\n\nPoint.fromJSON = function fromJSON(curve, obj, red) {\n if (typeof obj === 'string')\n obj = JSON.parse(obj);\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2])\n return res;\n\n function obj2point(obj) {\n return curve.point(obj[0], obj[1], red);\n }\n\n var pre = obj[2];\n res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [ res ].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [ res ].concat(pre.naf.points.map(obj2point)),\n },\n };\n return res;\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '<EC Point Infinity>';\n return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +\n ' y: ' + this.y.fromRed().toString(16, 2) + '>';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n return this.inf;\n};\n\nPoint.prototype.add = function add(p) {\n // O + P = P\n if (this.inf)\n return p;\n\n // P + O = P\n if (p.inf)\n return this;\n\n // P + P = 2P\n if (this.eq(p))\n return this.dbl();\n\n // P + (-P) = O\n if (this.neg().eq(p))\n return this.curve.point(null, null);\n\n // P + Q = O\n if (this.x.cmp(p.x) === 0)\n return this.curve.point(null, null);\n\n var c = this.y.redSub(p.y);\n if (c.cmpn(0) !== 0)\n c = c.redMul(this.x.redSub(p.x).redInvm());\n var nx = c.redSqr().redISub(this.x).redISub(p.x);\n var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n};\n\nPoint.prototype.dbl = function dbl() {\n if (this.inf)\n return this;\n\n // 2P = O\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0)\n return this.curve.point(null, null);\n\n var a = this.curve.a;\n\n var x2 = this.x.redSqr();\n var dyinv = ys1.redInvm();\n var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv);\n\n var nx = c.redSqr().redISub(this.x.redAdd(this.x));\n var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n};\n\nPoint.prototype.getX = function getX() {\n return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n return this.y.fromRed();\n};\n\nPoint.prototype.mul = function mul(k) {\n k = new BN(k, 16);\n if (this.isInfinity())\n return this;\n else if (this._hasDoubles(k))\n return this.curve._fixedNafMul(this, k);\n else if (this.curve.endo)\n return this.curve._endoWnafMulAdd([ this ], [ k ]);\n else\n return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p2, k2) {\n var points = [ this, p2 ];\n var coeffs = [ k1, k2 ];\n if (this.curve.endo)\n return this.curve._endoWnafMulAdd(points, coeffs);\n else\n return this.curve._wnafMulAdd(1, points, coeffs, 2);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p2, k2) {\n var points = [ this, p2 ];\n var coeffs = [ k1, k2 ];\n if (this.curve.endo)\n return this.curve._endoWnafMulAdd(points, coeffs, true);\n else\n return this.curve._wnafMulAdd(1, points, coeffs, 2, true);\n};\n\nPoint.prototype.eq = function eq(p) {\n return this === p ||\n this.inf === p.inf &&\n (this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0);\n};\n\nPoint.prototype.neg = function neg(_precompute) {\n if (this.inf)\n return this;\n\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed;\n var negate = function(p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n};\n\nPoint.prototype.toJ = function toJ() {\n if (this.inf)\n return this.curve.jpoint(null, null, null);\n\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n};\n\nfunction JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, 'jacobian');\n if (x === null && y === null && z === null) {\n this.x = this.curve.one;\n this.y = this.curve.one;\n this.z = new BN(0);\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n this.z = new BN(z, 16);\n }\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n\n this.zOne = this.z === this.curve.one;\n}\ninherits(JPoint, Base.BasePoint);\n\nShortCurve.prototype.jpoint = function jpoint(x, y, z) {\n return new JPoint(this, x, y, z);\n};\n\nJPoint.prototype.toP = function toP() {\n if (this.isInfinity())\n return this.curve.point(null, null);\n\n var zinv = this.z.redInvm();\n var zinv2 = zinv.redSqr();\n var ax = this.x.redMul(zinv2);\n var ay = this.y.redMul(zinv2).redMul(zinv);\n\n return this.curve.point(ax, ay);\n};\n\nJPoint.prototype.neg = function neg() {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n};\n\nJPoint.prototype.add = function add(p) {\n // O + P = P\n if (this.isInfinity())\n return p;\n\n // P + O = P\n if (p.isInfinity())\n return this;\n\n // 12M + 4S + 7A\n var pz2 = p.z.redSqr();\n var z2 = this.z.redSqr();\n var u1 = this.x.redMul(pz2);\n var u2 = p.x.redMul(z2);\n var s1 = this.y.redMul(pz2.redMul(p.z));\n var s2 = p.y.redMul(z2.redMul(this.z));\n\n var h = u1.redSub(u2);\n var r = s1.redSub(s2);\n if (h.cmpn(0) === 0) {\n if (r.cmpn(0) !== 0)\n return this.curve.jpoint(null, null, null);\n else\n return this.dbl();\n }\n\n var h2 = h.redSqr();\n var h3 = h2.redMul(h);\n var v = u1.redMul(h2);\n\n var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n var nz = this.z.redMul(p.z).redMul(h);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mixedAdd = function mixedAdd(p) {\n // O + P = P\n if (this.isInfinity())\n return p.toJ();\n\n // P + O = P\n if (p.isInfinity())\n return this;\n\n // 8M + 3S + 7A\n var z2 = this.z.redSqr();\n var u1 = this.x;\n var u2 = p.x.redMul(z2);\n var s1 = this.y;\n var s2 = p.y.redMul(z2).redMul(this.z);\n\n var h = u1.redSub(u2);\n var r = s1.redSub(s2);\n if (h.cmpn(0) === 0) {\n if (r.cmpn(0) !== 0)\n return this.curve.jpoint(null, null, null);\n else\n return this.dbl();\n }\n\n var h2 = h.redSqr();\n var h3 = h2.redMul(h);\n var v = u1.redMul(h2);\n\n var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n var nz = this.z.redMul(h);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.dblp = function dblp(pow) {\n if (pow === 0)\n return this;\n if (this.isInfinity())\n return this;\n if (!pow)\n return this.dbl();\n\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++)\n r = r.dbl();\n return r;\n }\n\n // 1M + 2S + 1A + N * (4S + 5M + 8A)\n // N = 1 => 6M + 6S + 9A\n var a = this.curve.a;\n var tinv = this.curve.tinv;\n\n var jx = this.x;\n var jy = this.y;\n var jz = this.z;\n var jz4 = jz.redSqr().redSqr();\n\n // Reuse results\n var jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr();\n var jyd2 = jyd.redSqr();\n var jyd4 = jyd2.redSqr();\n var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n var t1 = jx.redMul(jyd2);\n var nx = c.redSqr().redISub(t1.redAdd(t1));\n var t2 = t1.redISub(nx);\n var dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n if (i + 1 < pow)\n jz4 = jz4.redMul(jyd4);\n\n jx = nx;\n jz = nz;\n jyd = dny;\n }\n\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n};\n\nJPoint.prototype.dbl = function dbl() {\n if (this.isInfinity())\n return this;\n\n if (this.curve.zeroA)\n return this._zeroDbl();\n else if (this.curve.threeA)\n return this._threeDbl();\n else\n return this._dbl();\n};\n\nJPoint.prototype._zeroDbl = function _zeroDbl() {\n var nx;\n var ny;\n var nz;\n // Z = 1\n if (this.zOne) {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n // #doubling-mdbl-2007-bl\n // 1M + 5S + 14A\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n // M = 3 * XX + a; a = 0\n var m = xx.redAdd(xx).redIAdd(xx);\n // T = M ^ 2 - 2*S\n var t = m.redSqr().redISub(s).redISub(s);\n\n // 8 * YYYY\n var yyyy8 = yyyy.redIAdd(yyyy);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n\n // X3 = T\n nx = t;\n // Y3 = M * (S - T) - 8 * YYYY\n ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n // Z3 = 2*Y1\n nz = this.y.redAdd(this.y);\n } else {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n // #doubling-dbl-2009-l\n // 2M + 5S + 13A\n\n // A = X1^2\n var a = this.x.redSqr();\n // B = Y1^2\n var b = this.y.redSqr();\n // C = B^2\n var c = b.redSqr();\n // D = 2 * ((X1 + B)^2 - A - C)\n var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n // E = 3 * A\n var e = a.redAdd(a).redIAdd(a);\n // F = E^2\n var f = e.redSqr();\n\n // 8 * C\n var c8 = c.redIAdd(c);\n c8 = c8.redIAdd(c8);\n c8 = c8.redIAdd(c8);\n\n // X3 = F - 2 * D\n nx = f.redISub(d).redISub(d);\n // Y3 = E * (D - X3) - 8 * C\n ny = e.redMul(d.redISub(nx)).redISub(c8);\n // Z3 = 2 * Y1 * Z1\n nz = this.y.redMul(this.z);\n nz = nz.redIAdd(nz);\n }\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._threeDbl = function _threeDbl() {\n var nx;\n var ny;\n var nz;\n // Z = 1\n if (this.zOne) {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html\n // #doubling-mdbl-2007-bl\n // 1M + 5S + 15A\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n // M = 3 * XX + a\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a);\n // T = M^2 - 2 * S\n var t = m.redSqr().redISub(s).redISub(s);\n // X3 = T\n nx = t;\n // Y3 = M * (S - T) - 8 * YYYY\n var yyyy8 = yyyy.redIAdd(yyyy);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n // Z3 = 2 * Y1\n nz = this.y.redAdd(this.y);\n } else {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b\n // 3M + 5S\n\n // delta = Z1^2\n var delta = this.z.redSqr();\n // gamma = Y1^2\n var gamma = this.y.redSqr();\n // beta = X1 * gamma\n var beta = this.x.redMul(gamma);\n // alpha = 3 * (X1 - delta) * (X1 + delta)\n var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n // X3 = alpha^2 - 8 * beta\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n nx = alpha.redSqr().redISub(beta8);\n // Z3 = (Y1 + Z1)^2 - gamma - delta\n nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta);\n // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2\n var ggamma8 = gamma.redSqr();\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8);\n }\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._dbl = function _dbl() {\n var a = this.curve.a;\n\n // 4M + 6S + 10A\n var jx = this.x;\n var jy = this.y;\n var jz = this.z;\n var jz4 = jz.redSqr().redSqr();\n\n var jx2 = jx.redSqr();\n var jy2 = jy.redSqr();\n\n var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n var jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2);\n var nx = c.redSqr().redISub(t1.redAdd(t1));\n var t2 = t1.redISub(nx);\n\n var jyd8 = jy2.redSqr();\n jyd8 = jyd8.redIAdd(jyd8);\n jyd8 = jyd8.redIAdd(jyd8);\n jyd8 = jyd8.redIAdd(jyd8);\n var ny = c.redMul(t2).redISub(jyd8);\n var nz = jy.redAdd(jy).redMul(jz);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.trpl = function trpl() {\n if (!this.curve.zeroA)\n return this.dbl().add(this);\n\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl\n // 5M + 10S + ...\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // ZZ = Z1^2\n var zz = this.z.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // M = 3 * XX + a * ZZ2; a = 0\n var m = xx.redAdd(xx).redIAdd(xx);\n // MM = M^2\n var mm = m.redSqr();\n // E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM\n var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n e = e.redIAdd(e);\n e = e.redAdd(e).redIAdd(e);\n e = e.redISub(mm);\n // EE = E^2\n var ee = e.redSqr();\n // T = 16*YYYY\n var t = yyyy.redIAdd(yyyy);\n t = t.redIAdd(t);\n t = t.redIAdd(t);\n t = t.redIAdd(t);\n // U = (M + E)^2 - MM - EE - T\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t);\n // X3 = 4 * (X1 * EE - 4 * YY * U)\n var yyu4 = yy.redMul(u);\n yyu4 = yyu4.redIAdd(yyu4);\n yyu4 = yyu4.redIAdd(yyu4);\n var nx = this.x.redMul(ee).redISub(yyu4);\n nx = nx.redIAdd(nx);\n nx = nx.redIAdd(nx);\n // Y3 = 8 * Y1 * (U * (T - U) - E * EE)\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n ny = ny.redIAdd(ny);\n ny = ny.redIAdd(ny);\n ny = ny.redIAdd(ny);\n // Z3 = (Z1 + E)^2 - ZZ - EE\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mul = function mul(k, kbase) {\n k = new BN(k, kbase);\n\n return this.curve._wnafMul(this, k);\n};\n\nJPoint.prototype.eq = function eq(p) {\n if (p.type === 'affine')\n return this.eq(p.toJ());\n\n if (this === p)\n return true;\n\n // x1 * z2^2 == x2 * z1^2\n var z2 = this.z.redSqr();\n var pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0)\n return false;\n\n // y1 * z2^3 == y2 * z1^3\n var z3 = z2.redMul(this.z);\n var pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n};\n\nJPoint.prototype.eqXToP = function eqXToP(x) {\n var zs = this.z.redSqr();\n var rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0)\n return true;\n\n var xc = x.clone();\n var t = this.curve.redN.redMul(zs);\n for (;;) {\n xc.iadd(this.curve.n);\n if (xc.cmp(this.curve.p) >= 0)\n return false;\n\n rx.redIAdd(t);\n if (this.x.cmp(rx) === 0)\n return true;\n }\n};\n\nJPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '<EC JPoint Infinity>';\n return '<EC JPoint x: ' + this.x.toString(16, 2) +\n ' y: ' + this.y.toString(16, 2) +\n ' z: ' + this.z.toString(16, 2) + '>';\n};\n\nJPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.z.cmpn(0) === 0;\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar utils = require('../utils');\n\nfunction MontCurve(conf) {\n Base.call(this, 'mont', conf);\n\n this.a = new BN(conf.a, 16).toRed(this.red);\n this.b = new BN(conf.b, 16).toRed(this.red);\n this.i4 = new BN(4).toRed(this.red).redInvm();\n this.two = new BN(2).toRed(this.red);\n this.a24 = this.i4.redMul(this.a.redAdd(this.two));\n}\ninherits(MontCurve, Base);\nmodule.exports = MontCurve;\n\nMontCurve.prototype.validate = function validate(point) {\n var x = point.normalize().x;\n var x2 = x.redSqr();\n var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x);\n var y = rhs.redSqrt();\n\n return y.redSqr().cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, z) {\n Base.BasePoint.call(this, curve, 'projective');\n if (x === null && z === null) {\n this.x = this.curve.one;\n this.z = this.curve.zero;\n } else {\n this.x = new BN(x, 16);\n this.z = new BN(z, 16);\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n }\n}\ninherits(Point, Base.BasePoint);\n\nMontCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n};\n\nMontCurve.prototype.point = function point(x, z) {\n return new Point(this, x, z);\n};\n\nMontCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n return Point.fromJSON(this, obj);\n};\n\nPoint.prototype.precompute = function precompute() {\n // No-op\n};\n\nPoint.prototype._encode = function _encode() {\n return this.getX().toArray('be', this.curve.p.byteLength());\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '<EC Point Infinity>';\n return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +\n ' z: ' + this.z.fromRed().toString(16, 2) + '>';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.z.cmpn(0) === 0;\n};\n\nPoint.prototype.dbl = function dbl() {\n // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3\n // 2M + 2S + 4A\n\n // A = X1 + Z1\n var a = this.x.redAdd(this.z);\n // AA = A^2\n var aa = a.redSqr();\n // B = X1 - Z1\n var b = this.x.redSub(this.z);\n // BB = B^2\n var bb = b.redSqr();\n // C = AA - BB\n var c = aa.redSub(bb);\n // X3 = AA * BB\n var nx = aa.redMul(bb);\n // Z3 = C * (BB + A24 * C)\n var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n};\n\nPoint.prototype.add = function add() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.diffAdd = function diffAdd(p, diff) {\n // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3\n // 4M + 2S + 6A\n\n // A = X2 + Z2\n var a = this.x.redAdd(this.z);\n // B = X2 - Z2\n var b = this.x.redSub(this.z);\n // C = X3 + Z3\n var c = p.x.redAdd(p.z);\n // D = X3 - Z3\n var d = p.x.redSub(p.z);\n // DA = D * A\n var da = d.redMul(a);\n // CB = C * B\n var cb = c.redMul(b);\n // X5 = Z1 * (DA + CB)^2\n var nx = diff.z.redMul(da.redAdd(cb).redSqr());\n // Z5 = X1 * (DA - CB)^2\n var nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n};\n\nPoint.prototype.mul = function mul(k) {\n var t = k.clone();\n var a = this; // (N / 2) * Q + Q\n var b = this.curve.point(null, null); // (N / 2) * Q\n var c = this; // Q\n\n for (var bits = []; t.cmpn(0) !== 0; t.iushrn(1))\n bits.push(t.andln(1));\n\n for (var i = bits.length - 1; i >= 0; i--) {\n if (bits[i] === 0) {\n // N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q\n a = a.diffAdd(b, c);\n // N * Q = 2 * ((N / 2) * Q + Q))\n b = b.dbl();\n } else {\n // N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q)\n b = a.diffAdd(b, c);\n // N * Q + Q = 2 * ((N / 2) * Q + Q)\n a = a.dbl();\n }\n }\n return b;\n};\n\nPoint.prototype.mulAdd = function mulAdd() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.jumlAdd = function jumlAdd() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.eq = function eq(other) {\n return this.getX().cmp(other.getX()) === 0;\n};\n\nPoint.prototype.normalize = function normalize() {\n this.x = this.x.redMul(this.z.redInvm());\n this.z = this.curve.one;\n return this;\n};\n\nPoint.prototype.getX = function getX() {\n // Normalize coordinates\n this.normalize();\n\n return this.x.fromRed();\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction EdwardsCurve(conf) {\n // NOTE: Important as we are creating point in Base.call()\n this.twisted = (conf.a | 0) !== 1;\n this.mOneA = this.twisted && (conf.a | 0) === -1;\n this.extended = this.mOneA;\n\n Base.call(this, 'edwards', conf);\n\n this.a = new BN(conf.a, 16).umod(this.red.m);\n this.a = this.a.toRed(this.red);\n this.c = new BN(conf.c, 16).toRed(this.red);\n this.c2 = this.c.redSqr();\n this.d = new BN(conf.d, 16).toRed(this.red);\n this.dd = this.d.redAdd(this.d);\n\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0);\n this.oneC = (conf.c | 0) === 1;\n}\ninherits(EdwardsCurve, Base);\nmodule.exports = EdwardsCurve;\n\nEdwardsCurve.prototype._mulA = function _mulA(num) {\n if (this.mOneA)\n return num.redNeg();\n else\n return this.a.redMul(num);\n};\n\nEdwardsCurve.prototype._mulC = function _mulC(num) {\n if (this.oneC)\n return num;\n else\n return this.c.redMul(num);\n};\n\n// Just for compatibility with Short curve\nEdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) {\n return this.point(x, y, z, t);\n};\n\nEdwardsCurve.prototype.pointFromX = function pointFromX(x, odd) {\n x = new BN(x, 16);\n if (!x.red)\n x = x.toRed(this.red);\n\n var x2 = x.redSqr();\n var rhs = this.c2.redSub(this.a.redMul(x2));\n var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2));\n\n var y2 = rhs.redMul(lhs.redInvm());\n var y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n var isOdd = y.fromRed().isOdd();\n if (odd && !isOdd || !odd && isOdd)\n y = y.redNeg();\n\n return this.point(x, y);\n};\n\nEdwardsCurve.prototype.pointFromY = function pointFromY(y, odd) {\n y = new BN(y, 16);\n if (!y.red)\n y = y.toRed(this.red);\n\n // x^2 = (y^2 - c^2) / (c^2 d y^2 - a)\n var y2 = y.redSqr();\n var lhs = y2.redSub(this.c2);\n var rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a);\n var x2 = lhs.redMul(rhs.redInvm());\n\n if (x2.cmp(this.zero) === 0) {\n if (odd)\n throw new Error('invalid point');\n else\n return this.point(this.zero, y);\n }\n\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n if (x.fromRed().isOdd() !== odd)\n x = x.redNeg();\n\n return this.point(x, y);\n};\n\nEdwardsCurve.prototype.validate = function validate(point) {\n if (point.isInfinity())\n return true;\n\n // Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2)\n point.normalize();\n\n var x2 = point.x.redSqr();\n var y2 = point.y.redSqr();\n var lhs = x2.redMul(this.a).redAdd(y2);\n var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n\n return lhs.cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, 'projective');\n if (x === null && y === null && z === null) {\n this.x = this.curve.zero;\n this.y = this.curve.one;\n this.z = this.curve.one;\n this.t = this.curve.zero;\n this.zOne = true;\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n this.z = z ? new BN(z, 16) : this.curve.one;\n this.t = t && new BN(t, 16);\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n if (this.t && !this.t.red)\n this.t = this.t.toRed(this.curve.red);\n this.zOne = this.z === this.curve.one;\n\n // Use extended coordinates\n if (this.curve.extended && !this.t) {\n this.t = this.x.redMul(this.y);\n if (!this.zOne)\n this.t = this.t.redMul(this.z.redInvm());\n }\n }\n}\ninherits(Point, Base.BasePoint);\n\nEdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n return Point.fromJSON(this, obj);\n};\n\nEdwardsCurve.prototype.point = function point(x, y, z, t) {\n return new Point(this, x, y, z, t);\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '<EC Point Infinity>';\n return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +\n ' y: ' + this.y.fromRed().toString(16, 2) +\n ' z: ' + this.z.fromRed().toString(16, 2) + '>';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.x.cmpn(0) === 0 &&\n (this.y.cmp(this.z) === 0 ||\n (this.zOne && this.y.cmp(this.curve.c) === 0));\n};\n\nPoint.prototype._extDbl = function _extDbl() {\n // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n // #doubling-dbl-2008-hwcd\n // 4M + 4S\n\n // A = X1^2\n var a = this.x.redSqr();\n // B = Y1^2\n var b = this.y.redSqr();\n // C = 2 * Z1^2\n var c = this.z.redSqr();\n c = c.redIAdd(c);\n // D = a * A\n var d = this.curve._mulA(a);\n // E = (X1 + Y1)^2 - A - B\n var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b);\n // G = D + B\n var g = d.redAdd(b);\n // F = G - C\n var f = g.redSub(c);\n // H = D - B\n var h = d.redSub(b);\n // X3 = E * F\n var nx = e.redMul(f);\n // Y3 = G * H\n var ny = g.redMul(h);\n // T3 = E * H\n var nt = e.redMul(h);\n // Z3 = F * G\n var nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projDbl = function _projDbl() {\n // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n // #doubling-dbl-2008-bbjlp\n // #doubling-dbl-2007-bl\n // and others\n // Generally 3M + 4S or 2M + 4S\n\n // B = (X1 + Y1)^2\n var b = this.x.redAdd(this.y).redSqr();\n // C = X1^2\n var c = this.x.redSqr();\n // D = Y1^2\n var d = this.y.redSqr();\n\n var nx;\n var ny;\n var nz;\n var e;\n var h;\n var j;\n if (this.curve.twisted) {\n // E = a * C\n e = this.curve._mulA(c);\n // F = E + D\n var f = e.redAdd(d);\n if (this.zOne) {\n // X3 = (B - C - D) * (F - 2)\n nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two));\n // Y3 = F * (E - D)\n ny = f.redMul(e.redSub(d));\n // Z3 = F^2 - 2 * F\n nz = f.redSqr().redSub(f).redSub(f);\n } else {\n // H = Z1^2\n h = this.z.redSqr();\n // J = F - 2 * H\n j = f.redSub(h).redISub(h);\n // X3 = (B-C-D)*J\n nx = b.redSub(c).redISub(d).redMul(j);\n // Y3 = F * (E - D)\n ny = f.redMul(e.redSub(d));\n // Z3 = F * J\n nz = f.redMul(j);\n }\n } else {\n // E = C + D\n e = c.redAdd(d);\n // H = (c * Z1)^2\n h = this.curve._mulC(this.z).redSqr();\n // J = E - 2 * H\n j = e.redSub(h).redSub(h);\n // X3 = c * (B - E) * J\n nx = this.curve._mulC(b.redISub(e)).redMul(j);\n // Y3 = c * E * (C - D)\n ny = this.curve._mulC(e).redMul(c.redISub(d));\n // Z3 = E * J\n nz = e.redMul(j);\n }\n return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.dbl = function dbl() {\n if (this.isInfinity())\n return this;\n\n // Double in extended coordinates\n if (this.curve.extended)\n return this._extDbl();\n else\n return this._projDbl();\n};\n\nPoint.prototype._extAdd = function _extAdd(p) {\n // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n // #addition-add-2008-hwcd-3\n // 8M\n\n // A = (Y1 - X1) * (Y2 - X2)\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x));\n // B = (Y1 + X1) * (Y2 + X2)\n var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x));\n // C = T1 * k * T2\n var c = this.t.redMul(this.curve.dd).redMul(p.t);\n // D = Z1 * 2 * Z2\n var d = this.z.redMul(p.z.redAdd(p.z));\n // E = B - A\n var e = b.redSub(a);\n // F = D - C\n var f = d.redSub(c);\n // G = D + C\n var g = d.redAdd(c);\n // H = B + A\n var h = b.redAdd(a);\n // X3 = E * F\n var nx = e.redMul(f);\n // Y3 = G * H\n var ny = g.redMul(h);\n // T3 = E * H\n var nt = e.redMul(h);\n // Z3 = F * G\n var nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projAdd = function _projAdd(p) {\n // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n // #addition-add-2008-bbjlp\n // #addition-add-2007-bl\n // 10M + 1S\n\n // A = Z1 * Z2\n var a = this.z.redMul(p.z);\n // B = A^2\n var b = a.redSqr();\n // C = X1 * X2\n var c = this.x.redMul(p.x);\n // D = Y1 * Y2\n var d = this.y.redMul(p.y);\n // E = d * C * D\n var e = this.curve.d.redMul(c).redMul(d);\n // F = B - E\n var f = b.redSub(e);\n // G = B + E\n var g = b.redAdd(e);\n // X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D)\n var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d);\n var nx = a.redMul(f).redMul(tmp);\n var ny;\n var nz;\n if (this.curve.twisted) {\n // Y3 = A * G * (D - a * C)\n ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)));\n // Z3 = F * G\n nz = f.redMul(g);\n } else {\n // Y3 = A * G * (D - C)\n ny = a.redMul(g).redMul(d.redSub(c));\n // Z3 = c * F * G\n nz = this.curve._mulC(f).redMul(g);\n }\n return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.add = function add(p) {\n if (this.isInfinity())\n return p;\n if (p.isInfinity())\n return this;\n\n if (this.curve.extended)\n return this._extAdd(p);\n else\n return this._projAdd(p);\n};\n\nPoint.prototype.mul = function mul(k) {\n if (this._hasDoubles(k))\n return this.curve._fixedNafMul(this, k);\n else\n return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p, k2) {\n return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, false);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p, k2) {\n return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, true);\n};\n\nPoint.prototype.normalize = function normalize() {\n if (this.zOne)\n return this;\n\n // Normalize coordinates\n var zi = this.z.redInvm();\n this.x = this.x.redMul(zi);\n this.y = this.y.redMul(zi);\n if (this.t)\n this.t = this.t.redMul(zi);\n this.z = this.curve.one;\n this.zOne = true;\n return this;\n};\n\nPoint.prototype.neg = function neg() {\n return this.curve.point(this.x.redNeg(),\n this.y,\n this.z,\n this.t && this.t.redNeg());\n};\n\nPoint.prototype.getX = function getX() {\n this.normalize();\n return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n this.normalize();\n return this.y.fromRed();\n};\n\nPoint.prototype.eq = function eq(other) {\n return this === other ||\n this.getX().cmp(other.getX()) === 0 &&\n this.getY().cmp(other.getY()) === 0;\n};\n\nPoint.prototype.eqXToP = function eqXToP(x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0)\n return true;\n\n var xc = x.clone();\n var t = this.curve.redN.redMul(this.z);\n for (;;) {\n xc.iadd(this.curve.n);\n if (xc.cmp(this.curve.p) >= 0)\n return false;\n\n rx.redIAdd(t);\n if (this.x.cmp(rx) === 0)\n return true;\n }\n};\n\n// Compatibility with BaseCurve\nPoint.prototype.toP = Point.prototype.normalize;\nPoint.prototype.mixedAdd = Point.prototype.add;\n","'use strict';\n\nvar curves = exports;\n\nvar hash = require('hash.js');\nvar curve = require('./curve');\nvar utils = require('./utils');\n\nvar assert = utils.assert;\n\nfunction PresetCurve(options) {\n if (options.type === 'short')\n this.curve = new curve.short(options);\n else if (options.type === 'edwards')\n this.curve = new curve.edwards(options);\n else\n this.curve = new curve.mont(options);\n this.g = this.curve.g;\n this.n = this.curve.n;\n this.hash = options.hash;\n\n assert(this.g.validate(), 'Invalid curve');\n assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');\n}\ncurves.PresetCurve = PresetCurve;\n\nfunction defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: true,\n enumerable: true,\n get: function() {\n var curve = new PresetCurve(options);\n Object.defineProperty(curves, name, {\n configurable: true,\n enumerable: true,\n value: curve,\n });\n return curve;\n },\n });\n}\n\ndefineCurve('p192', {\n type: 'short',\n prime: 'p192',\n p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff',\n a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc',\n b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1',\n n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831',\n hash: hash.sha256,\n gRed: false,\n g: [\n '188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012',\n '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811',\n ],\n});\n\ndefineCurve('p224', {\n type: 'short',\n prime: 'p224',\n p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001',\n a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe',\n b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4',\n n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d',\n hash: hash.sha256,\n gRed: false,\n g: [\n 'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21',\n 'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34',\n ],\n});\n\ndefineCurve('p256', {\n type: 'short',\n prime: null,\n p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff',\n a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc',\n b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b',\n n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551',\n hash: hash.sha256,\n gRed: false,\n g: [\n '6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296',\n '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5',\n ],\n});\n\ndefineCurve('p384', {\n type: 'short',\n prime: null,\n p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'fffffffe ffffffff 00000000 00000000 ffffffff',\n a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'fffffffe ffffffff 00000000 00000000 fffffffc',\n b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' +\n '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef',\n n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' +\n 'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973',\n hash: hash.sha384,\n gRed: false,\n g: [\n 'aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' +\n '5502f25d bf55296c 3a545e38 72760ab7',\n '3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' +\n '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f',\n ],\n});\n\ndefineCurve('p521', {\n type: 'short',\n prime: null,\n p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff',\n a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff fffffffc',\n b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' +\n '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' +\n '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00',\n n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' +\n 'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409',\n hash: hash.sha512,\n gRed: false,\n g: [\n '000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' +\n '053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' +\n 'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66',\n '00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' +\n '579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' +\n '3fad0761 353c7086 a272c240 88be9476 9fd16650',\n ],\n});\n\ndefineCurve('curve25519', {\n type: 'mont',\n prime: 'p25519',\n p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',\n a: '76d06',\n b: '1',\n n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',\n hash: hash.sha256,\n gRed: false,\n g: [\n '9',\n ],\n});\n\ndefineCurve('ed25519', {\n type: 'edwards',\n prime: 'p25519',\n p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',\n a: '-1',\n c: '1',\n // -121665 * (121666^(-1)) (mod P)\n d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3',\n n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',\n hash: hash.sha256,\n gRed: false,\n g: [\n '216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a',\n\n // 4/5\n '6666666666666666666666666666666666666666666666666666666666666658',\n ],\n});\n\nvar pre;\ntry {\n pre = require('./precomputed/secp256k1');\n} catch (e) {\n pre = undefined;\n}\n\ndefineCurve('secp256k1', {\n type: 'short',\n prime: 'k256',\n p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f',\n a: '0',\n b: '7',\n n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141',\n h: '1',\n hash: hash.sha256,\n\n // Precomputed endomorphism\n beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee',\n lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72',\n basis: [\n {\n a: '3086d221a7d46bcde86c90e49284eb15',\n b: '-e4437ed6010e88286f547fa90abfe4c3',\n },\n {\n a: '114ca50f7a8e2f3f657c1108d9d44cfd8',\n b: '3086d221a7d46bcde86c90e49284eb15',\n },\n ],\n\n gRed: false,\n g: [\n '79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798',\n '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8',\n pre,\n ],\n});\n","var hash = exports;\n\nhash.utils = require('./hash/utils');\nhash.common = require('./hash/common');\nhash.sha = require('./hash/sha');\nhash.ripemd = require('./hash/ripemd');\nhash.hmac = require('./hash/hmac');\n\n// Proxy hash functions to the main object\nhash.sha1 = hash.sha.sha1;\nhash.sha256 = hash.sha.sha256;\nhash.sha224 = hash.sha.sha224;\nhash.sha384 = hash.sha.sha384;\nhash.sha512 = hash.sha.sha512;\nhash.ripemd160 = hash.ripemd.ripemd160;\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nexports.inherits = inherits;\n\nfunction isSurrogatePair(msg, i) {\n if ((msg.charCodeAt(i) & 0xFC00) !== 0xD800) {\n return false;\n }\n if (i < 0 || i + 1 >= msg.length) {\n return false;\n }\n return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00;\n}\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\n if (typeof msg === 'string') {\n if (!enc) {\n // Inspired by stringToUtf8ByteArray() in closure-library by Google\n // https://github.com/google/closure-library/blob/8598d87242af59aac233270742c8984e2b2bdbe0/closure/goog/crypt/crypt.js#L117-L143\n // Apache License 2.0\n // https://github.com/google/closure-library/blob/master/LICENSE\n var p = 0;\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n if (c < 128) {\n res[p++] = c;\n } else if (c < 2048) {\n res[p++] = (c >> 6) | 192;\n res[p++] = (c & 63) | 128;\n } else if (isSurrogatePair(msg, i)) {\n c = 0x10000 + ((c & 0x03FF) << 10) + (msg.charCodeAt(++i) & 0x03FF);\n res[p++] = (c >> 18) | 240;\n res[p++] = ((c >> 12) & 63) | 128;\n res[p++] = ((c >> 6) & 63) | 128;\n res[p++] = (c & 63) | 128;\n } else {\n res[p++] = (c >> 12) | 224;\n res[p++] = ((c >> 6) & 63) | 128;\n res[p++] = (c & 63) | 128;\n }\n }\n } else if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0)\n msg = '0' + msg;\n for (i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n }\n } else {\n for (i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n }\n return res;\n}\nexports.toArray = toArray;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nexports.toHex = toHex;\n\nfunction htonl(w) {\n var res = (w >>> 24) |\n ((w >>> 8) & 0xff00) |\n ((w << 8) & 0xff0000) |\n ((w & 0xff) << 24);\n return res >>> 0;\n}\nexports.htonl = htonl;\n\nfunction toHex32(msg, endian) {\n var res = '';\n for (var i = 0; i < msg.length; i++) {\n var w = msg[i];\n if (endian === 'little')\n w = htonl(w);\n res += zero8(w.toString(16));\n }\n return res;\n}\nexports.toHex32 = toHex32;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nexports.zero2 = zero2;\n\nfunction zero8(word) {\n if (word.length === 7)\n return '0' + word;\n else if (word.length === 6)\n return '00' + word;\n else if (word.length === 5)\n return '000' + word;\n else if (word.length === 4)\n return '0000' + word;\n else if (word.length === 3)\n return '00000' + word;\n else if (word.length === 2)\n return '000000' + word;\n else if (word.length === 1)\n return '0000000' + word;\n else\n return word;\n}\nexports.zero8 = zero8;\n\nfunction join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n var res = new Array(len / 4);\n for (var i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n if (endian === 'big')\n w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3];\n else\n w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k];\n res[i] = w >>> 0;\n }\n return res;\n}\nexports.join32 = join32;\n\nfunction split32(msg, endian) {\n var res = new Array(msg.length * 4);\n for (var i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n if (endian === 'big') {\n res[k] = m >>> 24;\n res[k + 1] = (m >>> 16) & 0xff;\n res[k + 2] = (m >>> 8) & 0xff;\n res[k + 3] = m & 0xff;\n } else {\n res[k + 3] = m >>> 24;\n res[k + 2] = (m >>> 16) & 0xff;\n res[k + 1] = (m >>> 8) & 0xff;\n res[k] = m & 0xff;\n }\n }\n return res;\n}\nexports.split32 = split32;\n\nfunction rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n}\nexports.rotr32 = rotr32;\n\nfunction rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n}\nexports.rotl32 = rotl32;\n\nfunction sum32(a, b) {\n return (a + b) >>> 0;\n}\nexports.sum32 = sum32;\n\nfunction sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n}\nexports.sum32_3 = sum32_3;\n\nfunction sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n}\nexports.sum32_4 = sum32_4;\n\nfunction sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\n}\nexports.sum32_5 = sum32_5;\n\nfunction sum64(buf, pos, ah, al) {\n var bh = buf[pos];\n var bl = buf[pos + 1];\n\n var lo = (al + bl) >>> 0;\n var hi = (lo < al ? 1 : 0) + ah + bh;\n buf[pos] = hi >>> 0;\n buf[pos + 1] = lo;\n}\nexports.sum64 = sum64;\n\nfunction sum64_hi(ah, al, bh, bl) {\n var lo = (al + bl) >>> 0;\n var hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n}\nexports.sum64_hi = sum64_hi;\n\nfunction sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n}\nexports.sum64_lo = sum64_lo;\n\nfunction sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0;\n var lo = al;\n lo = (lo + bl) >>> 0;\n carry += lo < al ? 1 : 0;\n lo = (lo + cl) >>> 0;\n carry += lo < cl ? 1 : 0;\n lo = (lo + dl) >>> 0;\n carry += lo < dl ? 1 : 0;\n\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n}\nexports.sum64_4_hi = sum64_4_hi;\n\nfunction sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n}\nexports.sum64_4_lo = sum64_4_lo;\n\nfunction sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0;\n var lo = al;\n lo = (lo + bl) >>> 0;\n carry += lo < al ? 1 : 0;\n lo = (lo + cl) >>> 0;\n carry += lo < cl ? 1 : 0;\n lo = (lo + dl) >>> 0;\n carry += lo < dl ? 1 : 0;\n lo = (lo + el) >>> 0;\n carry += lo < el ? 1 : 0;\n\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n}\nexports.sum64_5_hi = sum64_5_hi;\n\nfunction sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n\n return lo >>> 0;\n}\nexports.sum64_5_lo = sum64_5_lo;\n\nfunction rotr64_hi(ah, al, num) {\n var r = (al << (32 - num)) | (ah >>> num);\n return r >>> 0;\n}\nexports.rotr64_hi = rotr64_hi;\n\nfunction rotr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n}\nexports.rotr64_lo = rotr64_lo;\n\nfunction shr64_hi(ah, al, num) {\n return ah >>> num;\n}\nexports.shr64_hi = shr64_hi;\n\nfunction shr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n}\nexports.shr64_lo = shr64_lo;\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction BlockHash() {\n this.pending = null;\n this.pendingTotal = 0;\n this.blockSize = this.constructor.blockSize;\n this.outSize = this.constructor.outSize;\n this.hmacStrength = this.constructor.hmacStrength;\n this.padLength = this.constructor.padLength / 8;\n this.endian = 'big';\n\n this._delta8 = this.blockSize / 8;\n this._delta32 = this.blockSize / 32;\n}\nexports.BlockHash = BlockHash;\n\nBlockHash.prototype.update = function update(msg, enc) {\n // Convert message to array, pad it, and join into 32bit blocks\n msg = utils.toArray(msg, enc);\n if (!this.pending)\n this.pending = msg;\n else\n this.pending = this.pending.concat(msg);\n this.pendingTotal += msg.length;\n\n // Enough data, try updating\n if (this.pending.length >= this._delta8) {\n msg = this.pending;\n\n // Process pending data in blocks\n var r = msg.length % this._delta8;\n this.pending = msg.slice(msg.length - r, msg.length);\n if (this.pending.length === 0)\n this.pending = null;\n\n msg = utils.join32(msg, 0, msg.length - r, this.endian);\n for (var i = 0; i < msg.length; i += this._delta32)\n this._update(msg, i, i + this._delta32);\n }\n\n return this;\n};\n\nBlockHash.prototype.digest = function digest(enc) {\n this.update(this._pad());\n assert(this.pending === null);\n\n return this._digest(enc);\n};\n\nBlockHash.prototype._pad = function pad() {\n var len = this.pendingTotal;\n var bytes = this._delta8;\n var k = bytes - ((len + this.padLength) % bytes);\n var res = new Array(k + this.padLength);\n res[0] = 0x80;\n for (var i = 1; i < k; i++)\n res[i] = 0;\n\n // Append length\n len <<= 3;\n if (this.endian === 'big') {\n for (var t = 8; t < this.padLength; t++)\n res[i++] = 0;\n\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = len & 0xff;\n } else {\n res[i++] = len & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n\n for (t = 8; t < this.padLength; t++)\n res[i++] = 0;\n }\n\n return res;\n};\n","'use strict';\n\nexports.sha1 = require('./sha/1');\nexports.sha224 = require('./sha/224');\nexports.sha256 = require('./sha/256');\nexports.sha384 = require('./sha/384');\nexports.sha512 = require('./sha/512');\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_5 = utils.sum32_5;\nvar ft_1 = shaCommon.ft_1;\nvar BlockHash = common.BlockHash;\n\nvar sha1_K = [\n 0x5A827999, 0x6ED9EBA1,\n 0x8F1BBCDC, 0xCA62C1D6\n];\n\nfunction SHA1() {\n if (!(this instanceof SHA1))\n return new SHA1();\n\n BlockHash.call(this);\n this.h = [\n 0x67452301, 0xefcdab89, 0x98badcfe,\n 0x10325476, 0xc3d2e1f0 ];\n this.W = new Array(80);\n}\n\nutils.inherits(SHA1, BlockHash);\nmodule.exports = SHA1;\n\nSHA1.blockSize = 512;\nSHA1.outSize = 160;\nSHA1.hmacStrength = 80;\nSHA1.padLength = 64;\n\nSHA1.prototype._update = function _update(msg, start) {\n var W = this.W;\n\n for (var i = 0; i < 16; i++)\n W[i] = msg[start + i];\n\n for(; i < W.length; i++)\n W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n\n var a = this.h[0];\n var b = this.h[1];\n var c = this.h[2];\n var d = this.h[3];\n var e = this.h[4];\n\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20);\n var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n e = d;\n d = c;\n c = rotl32(b, 30);\n b = a;\n a = t;\n }\n\n this.h[0] = sum32(this.h[0], a);\n this.h[1] = sum32(this.h[1], b);\n this.h[2] = sum32(this.h[2], c);\n this.h[3] = sum32(this.h[3], d);\n this.h[4] = sum32(this.h[4], e);\n};\n\nSHA1.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar rotr32 = utils.rotr32;\n\nfunction ft_1(s, x, y, z) {\n if (s === 0)\n return ch32(x, y, z);\n if (s === 1 || s === 3)\n return p32(x, y, z);\n if (s === 2)\n return maj32(x, y, z);\n}\nexports.ft_1 = ft_1;\n\nfunction ch32(x, y, z) {\n return (x & y) ^ ((~x) & z);\n}\nexports.ch32 = ch32;\n\nfunction maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n}\nexports.maj32 = maj32;\n\nfunction p32(x, y, z) {\n return x ^ y ^ z;\n}\nexports.p32 = p32;\n\nfunction s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n}\nexports.s0_256 = s0_256;\n\nfunction s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n}\nexports.s1_256 = s1_256;\n\nfunction g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n}\nexports.g0_256 = g0_256;\n\nfunction g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n}\nexports.g1_256 = g1_256;\n","'use strict';\n\nvar utils = require('../utils');\nvar SHA256 = require('./256');\n\nfunction SHA224() {\n if (!(this instanceof SHA224))\n return new SHA224();\n\n SHA256.call(this);\n this.h = [\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,\n 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ];\n}\nutils.inherits(SHA224, SHA256);\nmodule.exports = SHA224;\n\nSHA224.blockSize = 512;\nSHA224.outSize = 224;\nSHA224.hmacStrength = 192;\nSHA224.padLength = 64;\n\nSHA224.prototype._digest = function digest(enc) {\n // Just truncate output\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 7), 'big');\n else\n return utils.split32(this.h.slice(0, 7), 'big');\n};\n\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\nvar assert = require('minimalistic-assert');\n\nvar sum32 = utils.sum32;\nvar sum32_4 = utils.sum32_4;\nvar sum32_5 = utils.sum32_5;\nvar ch32 = shaCommon.ch32;\nvar maj32 = shaCommon.maj32;\nvar s0_256 = shaCommon.s0_256;\nvar s1_256 = shaCommon.s1_256;\nvar g0_256 = shaCommon.g0_256;\nvar g1_256 = shaCommon.g1_256;\n\nvar BlockHash = common.BlockHash;\n\nvar sha256_K = [\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n];\n\nfunction SHA256() {\n if (!(this instanceof SHA256))\n return new SHA256();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,\n 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n ];\n this.k = sha256_K;\n this.W = new Array(64);\n}\nutils.inherits(SHA256, BlockHash);\nmodule.exports = SHA256;\n\nSHA256.blockSize = 512;\nSHA256.outSize = 256;\nSHA256.hmacStrength = 192;\nSHA256.padLength = 64;\n\nSHA256.prototype._update = function _update(msg, start) {\n var W = this.W;\n\n for (var i = 0; i < 16; i++)\n W[i] = msg[start + i];\n for (; i < W.length; i++)\n W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n\n var a = this.h[0];\n var b = this.h[1];\n var c = this.h[2];\n var d = this.h[3];\n var e = this.h[4];\n var f = this.h[5];\n var g = this.h[6];\n var h = this.h[7];\n\n assert(this.k.length === W.length);\n for (i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]);\n var T2 = sum32(s0_256(a), maj32(a, b, c));\n h = g;\n g = f;\n f = e;\n e = sum32(d, T1);\n d = c;\n c = b;\n b = a;\n a = sum32(T1, T2);\n }\n\n this.h[0] = sum32(this.h[0], a);\n this.h[1] = sum32(this.h[1], b);\n this.h[2] = sum32(this.h[2], c);\n this.h[3] = sum32(this.h[3], d);\n this.h[4] = sum32(this.h[4], e);\n this.h[5] = sum32(this.h[5], f);\n this.h[6] = sum32(this.h[6], g);\n this.h[7] = sum32(this.h[7], h);\n};\n\nSHA256.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\n\nvar SHA512 = require('./512');\n\nfunction SHA384() {\n if (!(this instanceof SHA384))\n return new SHA384();\n\n SHA512.call(this);\n this.h = [\n 0xcbbb9d5d, 0xc1059ed8,\n 0x629a292a, 0x367cd507,\n 0x9159015a, 0x3070dd17,\n 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31,\n 0x8eb44a87, 0x68581511,\n 0xdb0c2e0d, 0x64f98fa7,\n 0x47b5481d, 0xbefa4fa4 ];\n}\nutils.inherits(SHA384, SHA512);\nmodule.exports = SHA384;\n\nSHA384.blockSize = 1024;\nSHA384.outSize = 384;\nSHA384.hmacStrength = 192;\nSHA384.padLength = 128;\n\nSHA384.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 12), 'big');\n else\n return utils.split32(this.h.slice(0, 12), 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar assert = require('minimalistic-assert');\n\nvar rotr64_hi = utils.rotr64_hi;\nvar rotr64_lo = utils.rotr64_lo;\nvar shr64_hi = utils.shr64_hi;\nvar shr64_lo = utils.shr64_lo;\nvar sum64 = utils.sum64;\nvar sum64_hi = utils.sum64_hi;\nvar sum64_lo = utils.sum64_lo;\nvar sum64_4_hi = utils.sum64_4_hi;\nvar sum64_4_lo = utils.sum64_4_lo;\nvar sum64_5_hi = utils.sum64_5_hi;\nvar sum64_5_lo = utils.sum64_5_lo;\n\nvar BlockHash = common.BlockHash;\n\nvar sha512_K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n];\n\nfunction SHA512() {\n if (!(this instanceof SHA512))\n return new SHA512();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xf3bcc908,\n 0xbb67ae85, 0x84caa73b,\n 0x3c6ef372, 0xfe94f82b,\n 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1,\n 0x9b05688c, 0x2b3e6c1f,\n 0x1f83d9ab, 0xfb41bd6b,\n 0x5be0cd19, 0x137e2179 ];\n this.k = sha512_K;\n this.W = new Array(160);\n}\nutils.inherits(SHA512, BlockHash);\nmodule.exports = SHA512;\n\nSHA512.blockSize = 1024;\nSHA512.outSize = 512;\nSHA512.hmacStrength = 192;\nSHA512.padLength = 128;\n\nSHA512.prototype._prepareBlock = function _prepareBlock(msg, start) {\n var W = this.W;\n\n // 32 x 32bit words\n for (var i = 0; i < 32; i++)\n W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2\n var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);\n var c1_hi = W[i - 14]; // i - 7\n var c1_lo = W[i - 13];\n var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15\n var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);\n var c3_hi = W[i - 32]; // i - 16\n var c3_lo = W[i - 31];\n\n W[i] = sum64_4_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo);\n W[i + 1] = sum64_4_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo);\n }\n};\n\nSHA512.prototype._update = function _update(msg, start) {\n this._prepareBlock(msg, start);\n\n var W = this.W;\n\n var ah = this.h[0];\n var al = this.h[1];\n var bh = this.h[2];\n var bl = this.h[3];\n var ch = this.h[4];\n var cl = this.h[5];\n var dh = this.h[6];\n var dl = this.h[7];\n var eh = this.h[8];\n var el = this.h[9];\n var fh = this.h[10];\n var fl = this.h[11];\n var gh = this.h[12];\n var gl = this.h[13];\n var hh = this.h[14];\n var hl = this.h[15];\n\n assert(this.k.length === W.length);\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh;\n var c0_lo = hl;\n var c1_hi = s1_512_hi(eh, el);\n var c1_lo = s1_512_lo(eh, el);\n var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl);\n var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl);\n var c3_hi = this.k[i];\n var c3_lo = this.k[i + 1];\n var c4_hi = W[i];\n var c4_lo = W[i + 1];\n\n var T1_hi = sum64_5_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n var T1_lo = sum64_5_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n\n c0_hi = s0_512_hi(ah, al);\n c0_lo = s0_512_lo(ah, al);\n c1_hi = maj64_hi(ah, al, bh, bl, ch, cl);\n c1_lo = maj64_lo(ah, al, bh, bl, ch, cl);\n\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo);\n var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n\n hh = gh;\n hl = gl;\n\n gh = fh;\n gl = fl;\n\n fh = eh;\n fl = el;\n\n eh = sum64_hi(dh, dl, T1_hi, T1_lo);\n el = sum64_lo(dl, dl, T1_hi, T1_lo);\n\n dh = ch;\n dl = cl;\n\n ch = bh;\n cl = bl;\n\n bh = ah;\n bl = al;\n\n ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo);\n al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo);\n }\n\n sum64(this.h, 0, ah, al);\n sum64(this.h, 2, bh, bl);\n sum64(this.h, 4, ch, cl);\n sum64(this.h, 6, dh, dl);\n sum64(this.h, 8, eh, el);\n sum64(this.h, 10, fh, fl);\n sum64(this.h, 12, gh, gl);\n sum64(this.h, 14, hh, hl);\n};\n\nSHA512.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n\nfunction ch64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ ((~xh) & zh);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ ((~xl) & zl);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction maj64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28);\n var c1_hi = rotr64_hi(xl, xh, 2); // 34\n var c2_hi = rotr64_hi(xl, xh, 7); // 39\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28);\n var c1_lo = rotr64_lo(xl, xh, 2); // 34\n var c2_lo = rotr64_lo(xl, xh, 7); // 39\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14);\n var c1_hi = rotr64_hi(xh, xl, 18);\n var c2_hi = rotr64_hi(xl, xh, 9); // 41\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14);\n var c1_lo = rotr64_lo(xh, xl, 18);\n var c2_lo = rotr64_lo(xl, xh, 9); // 41\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1);\n var c1_hi = rotr64_hi(xh, xl, 8);\n var c2_hi = shr64_hi(xh, xl, 7);\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1);\n var c1_lo = rotr64_lo(xh, xl, 8);\n var c2_lo = shr64_lo(xh, xl, 7);\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19);\n var c1_hi = rotr64_hi(xl, xh, 29); // 61\n var c2_hi = shr64_hi(xh, xl, 6);\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19);\n var c1_lo = rotr64_lo(xl, xh, 29); // 61\n var c2_lo = shr64_lo(xh, xl, 6);\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n","'use strict';\n\nvar utils = require('./utils');\nvar common = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_3 = utils.sum32_3;\nvar sum32_4 = utils.sum32_4;\nvar BlockHash = common.BlockHash;\n\nfunction RIPEMD160() {\n if (!(this instanceof RIPEMD160))\n return new RIPEMD160();\n\n BlockHash.call(this);\n\n this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ];\n this.endian = 'little';\n}\nutils.inherits(RIPEMD160, BlockHash);\nexports.ripemd160 = RIPEMD160;\n\nRIPEMD160.blockSize = 512;\nRIPEMD160.outSize = 160;\nRIPEMD160.hmacStrength = 192;\nRIPEMD160.padLength = 64;\n\nRIPEMD160.prototype._update = function update(msg, start) {\n var A = this.h[0];\n var B = this.h[1];\n var C = this.h[2];\n var D = this.h[3];\n var E = this.h[4];\n var Ah = A;\n var Bh = B;\n var Ch = C;\n var Dh = D;\n var Eh = E;\n for (var j = 0; j < 80; j++) {\n var T = sum32(\n rotl32(\n sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)),\n s[j]),\n E);\n A = E;\n E = D;\n D = rotl32(C, 10);\n C = B;\n B = T;\n T = sum32(\n rotl32(\n sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)),\n sh[j]),\n Eh);\n Ah = Eh;\n Eh = Dh;\n Dh = rotl32(Ch, 10);\n Ch = Bh;\n Bh = T;\n }\n T = sum32_3(this.h[1], C, Dh);\n this.h[1] = sum32_3(this.h[2], D, Eh);\n this.h[2] = sum32_3(this.h[3], E, Ah);\n this.h[3] = sum32_3(this.h[4], A, Bh);\n this.h[4] = sum32_3(this.h[0], B, Ch);\n this.h[0] = T;\n};\n\nRIPEMD160.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'little');\n else\n return utils.split32(this.h, 'little');\n};\n\nfunction f(j, x, y, z) {\n if (j <= 15)\n return x ^ y ^ z;\n else if (j <= 31)\n return (x & y) | ((~x) & z);\n else if (j <= 47)\n return (x | (~y)) ^ z;\n else if (j <= 63)\n return (x & z) | (y & (~z));\n else\n return x ^ (y | (~z));\n}\n\nfunction K(j) {\n if (j <= 15)\n return 0x00000000;\n else if (j <= 31)\n return 0x5a827999;\n else if (j <= 47)\n return 0x6ed9eba1;\n else if (j <= 63)\n return 0x8f1bbcdc;\n else\n return 0xa953fd4e;\n}\n\nfunction Kh(j) {\n if (j <= 15)\n return 0x50a28be6;\n else if (j <= 31)\n return 0x5c4dd124;\n else if (j <= 47)\n return 0x6d703ef3;\n else if (j <= 63)\n return 0x7a6d76e9;\n else\n return 0x00000000;\n}\n\nvar r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n];\n\nvar rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n];\n\nvar s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n];\n\nvar sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n];\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction Hmac(hash, key, enc) {\n if (!(this instanceof Hmac))\n return new Hmac(hash, key, enc);\n this.Hash = hash;\n this.blockSize = hash.blockSize / 8;\n this.outSize = hash.outSize / 8;\n this.inner = null;\n this.outer = null;\n\n this._init(utils.toArray(key, enc));\n}\nmodule.exports = Hmac;\n\nHmac.prototype._init = function init(key) {\n // Shorten key, if needed\n if (key.length > this.blockSize)\n key = new this.Hash().update(key).digest();\n assert(key.length <= this.blockSize);\n\n // Add padding to key\n for (var i = key.length; i < this.blockSize; i++)\n key.push(0);\n\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x36;\n this.inner = new this.Hash().update(key);\n\n // 0x36 ^ 0x5c = 0x6a\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x6a;\n this.outer = new this.Hash().update(key);\n};\n\nHmac.prototype.update = function update(msg, enc) {\n this.inner.update(msg, enc);\n return this;\n};\n\nHmac.prototype.digest = function digest(enc) {\n this.outer.update(this.inner.digest());\n return this.outer.digest(enc);\n};\n","module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n 'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a',\n 'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821',\n ],\n [\n '8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508',\n '11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf',\n ],\n [\n '175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739',\n 'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695',\n ],\n [\n '363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640',\n '4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9',\n ],\n [\n '8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c',\n '4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36',\n ],\n [\n '723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda',\n '96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f',\n ],\n [\n 'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa',\n '5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999',\n ],\n [\n '100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0',\n 'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09',\n ],\n [\n 'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d',\n '9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d',\n ],\n [\n 'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d',\n 'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088',\n ],\n [\n 'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1',\n '9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d',\n ],\n [\n '53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0',\n '5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8',\n ],\n [\n '8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047',\n '10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a',\n ],\n [\n '385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862',\n '283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453',\n ],\n [\n '6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7',\n '7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160',\n ],\n [\n '3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd',\n '56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0',\n ],\n [\n '85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83',\n '7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6',\n ],\n [\n '948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a',\n '53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589',\n ],\n [\n '6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8',\n 'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17',\n ],\n [\n 'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d',\n '4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda',\n ],\n [\n 'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725',\n '7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd',\n ],\n [\n '213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754',\n '4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2',\n ],\n [\n '4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c',\n '17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6',\n ],\n [\n 'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6',\n '6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f',\n ],\n [\n '76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39',\n 'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01',\n ],\n [\n 'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891',\n '893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3',\n ],\n [\n 'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b',\n 'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f',\n ],\n [\n 'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03',\n '2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7',\n ],\n [\n 'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d',\n 'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78',\n ],\n [\n 'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070',\n '7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1',\n ],\n [\n '90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4',\n 'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150',\n ],\n [\n '8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da',\n '662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82',\n ],\n [\n 'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11',\n '1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc',\n ],\n [\n '8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e',\n 'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b',\n ],\n [\n 'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41',\n '2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51',\n ],\n [\n 'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef',\n '67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45',\n ],\n [\n 'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8',\n 'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120',\n ],\n [\n '324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d',\n '648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84',\n ],\n [\n '4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96',\n '35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d',\n ],\n [\n '9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd',\n 'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d',\n ],\n [\n '6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5',\n '9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8',\n ],\n [\n 'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266',\n '40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8',\n ],\n [\n '7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71',\n '34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac',\n ],\n [\n '928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac',\n 'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f',\n ],\n [\n '85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751',\n '1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962',\n ],\n [\n 'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e',\n '493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907',\n ],\n [\n '827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241',\n 'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec',\n ],\n [\n 'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3',\n 'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d',\n ],\n [\n 'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f',\n '4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414',\n ],\n [\n '1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19',\n 'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd',\n ],\n [\n '146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be',\n 'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0',\n ],\n [\n 'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9',\n '6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811',\n ],\n [\n 'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2',\n '8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1',\n ],\n [\n 'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13',\n '7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c',\n ],\n [\n '174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c',\n 'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73',\n ],\n [\n '959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba',\n '2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd',\n ],\n [\n 'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151',\n 'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405',\n ],\n [\n '64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073',\n 'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589',\n ],\n [\n '8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458',\n '38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e',\n ],\n [\n '13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b',\n '69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27',\n ],\n [\n 'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366',\n 'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1',\n ],\n [\n '8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa',\n '40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482',\n ],\n [\n '8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0',\n '620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945',\n ],\n [\n 'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787',\n '7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573',\n ],\n [\n 'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e',\n 'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82',\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n 'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9',\n '388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672',\n ],\n [\n '2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4',\n 'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6',\n ],\n [\n '5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc',\n '6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da',\n ],\n [\n 'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe',\n 'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37',\n ],\n [\n '774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb',\n 'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b',\n ],\n [\n 'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8',\n 'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81',\n ],\n [\n 'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e',\n '581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58',\n ],\n [\n 'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34',\n '4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77',\n ],\n [\n '2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c',\n '85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a',\n ],\n [\n '352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5',\n '321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c',\n ],\n [\n '2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f',\n '2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67',\n ],\n [\n '9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714',\n '73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402',\n ],\n [\n 'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729',\n 'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55',\n ],\n [\n 'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db',\n '2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482',\n ],\n [\n '6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4',\n 'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82',\n ],\n [\n '1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5',\n 'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396',\n ],\n [\n '605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479',\n '2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49',\n ],\n [\n '62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d',\n '80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf',\n ],\n [\n '80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f',\n '1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a',\n ],\n [\n '7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb',\n 'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7',\n ],\n [\n 'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9',\n 'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933',\n ],\n [\n '49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963',\n '758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a',\n ],\n [\n '77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74',\n '958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6',\n ],\n [\n 'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530',\n 'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37',\n ],\n [\n '463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b',\n '5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e',\n ],\n [\n 'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247',\n 'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6',\n ],\n [\n 'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1',\n 'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476',\n ],\n [\n '2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120',\n '4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40',\n ],\n [\n '7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435',\n '91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61',\n ],\n [\n '754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18',\n '673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683',\n ],\n [\n 'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8',\n '59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5',\n ],\n [\n '186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb',\n '3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b',\n ],\n [\n 'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f',\n '55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417',\n ],\n [\n '5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143',\n 'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868',\n ],\n [\n '290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba',\n 'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a',\n ],\n [\n 'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45',\n 'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6',\n ],\n [\n '766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a',\n '744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996',\n ],\n [\n '59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e',\n 'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e',\n ],\n [\n 'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8',\n 'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d',\n ],\n [\n '7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c',\n '30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2',\n ],\n [\n '948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519',\n 'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e',\n ],\n [\n '7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab',\n '100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437',\n ],\n [\n '3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca',\n 'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311',\n ],\n [\n 'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf',\n '8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4',\n ],\n [\n '1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610',\n '68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575',\n ],\n [\n '733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4',\n 'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d',\n ],\n [\n '15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c',\n 'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d',\n ],\n [\n 'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940',\n 'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629',\n ],\n [\n 'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980',\n 'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06',\n ],\n [\n '311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3',\n '66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374',\n ],\n [\n '34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf',\n '9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee',\n ],\n [\n 'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63',\n '4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1',\n ],\n [\n 'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448',\n 'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b',\n ],\n [\n '32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf',\n '5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661',\n ],\n [\n '7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5',\n '8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6',\n ],\n [\n 'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6',\n '8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e',\n ],\n [\n '16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5',\n '5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d',\n ],\n [\n 'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99',\n 'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc',\n ],\n [\n '78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51',\n 'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4',\n ],\n [\n '494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5',\n '42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c',\n ],\n [\n 'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5',\n '204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b',\n ],\n [\n 'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997',\n '4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913',\n ],\n [\n '841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881',\n '73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154',\n ],\n [\n '5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5',\n '39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865',\n ],\n [\n '36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66',\n 'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc',\n ],\n [\n '336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726',\n 'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224',\n ],\n [\n '8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede',\n '6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e',\n ],\n [\n '1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94',\n '60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6',\n ],\n [\n '85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31',\n '3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511',\n ],\n [\n '29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51',\n 'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b',\n ],\n [\n 'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252',\n 'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2',\n ],\n [\n '4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5',\n 'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c',\n ],\n [\n 'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b',\n '6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3',\n ],\n [\n 'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4',\n '322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d',\n ],\n [\n 'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f',\n '6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700',\n ],\n [\n 'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889',\n '2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4',\n ],\n [\n '591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246',\n 'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196',\n ],\n [\n '11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984',\n '998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4',\n ],\n [\n '3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a',\n 'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257',\n ],\n [\n 'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030',\n 'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13',\n ],\n [\n 'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197',\n '6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096',\n ],\n [\n 'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593',\n 'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38',\n ],\n [\n 'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef',\n '21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f',\n ],\n [\n '347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38',\n '60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448',\n ],\n [\n 'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a',\n '49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a',\n ],\n [\n 'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111',\n '5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4',\n ],\n [\n '4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502',\n '7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437',\n ],\n [\n '3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea',\n 'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7',\n ],\n [\n 'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26',\n '8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d',\n ],\n [\n 'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986',\n '39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a',\n ],\n [\n 'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e',\n '62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54',\n ],\n [\n '48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4',\n '25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77',\n ],\n [\n 'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda',\n 'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517',\n ],\n [\n '6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859',\n 'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10',\n ],\n [\n 'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f',\n 'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125',\n ],\n [\n 'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c',\n '6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e',\n ],\n [\n '13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942',\n 'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1',\n ],\n [\n 'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a',\n '1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2',\n ],\n [\n 'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80',\n '5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423',\n ],\n [\n 'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d',\n '438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8',\n ],\n [\n '8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1',\n 'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758',\n ],\n [\n '52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63',\n 'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375',\n ],\n [\n 'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352',\n '6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d',\n ],\n [\n '7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193',\n 'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec',\n ],\n [\n '5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00',\n '9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0',\n ],\n [\n '32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58',\n 'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c',\n ],\n [\n 'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7',\n 'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4',\n ],\n [\n '8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8',\n 'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f',\n ],\n [\n '4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e',\n '67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649',\n ],\n [\n '3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d',\n 'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826',\n ],\n [\n '674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b',\n '299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5',\n ],\n [\n 'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f',\n 'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87',\n ],\n [\n '30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6',\n '462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b',\n ],\n [\n 'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297',\n '62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc',\n ],\n [\n '93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a',\n '7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c',\n ],\n [\n 'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c',\n 'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f',\n ],\n [\n 'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52',\n '4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a',\n ],\n [\n 'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb',\n 'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46',\n ],\n [\n '463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065',\n 'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f',\n ],\n [\n '7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917',\n '603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03',\n ],\n [\n '74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9',\n 'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08',\n ],\n [\n '30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3',\n '553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8',\n ],\n [\n '9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57',\n '712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373',\n ],\n [\n '176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66',\n 'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3',\n ],\n [\n '75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8',\n '9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8',\n ],\n [\n '809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721',\n '9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1',\n ],\n [\n '1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180',\n '4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9',\n ],\n ],\n },\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar HmacDRBG = require('hmac-drbg');\nvar utils = require('../utils');\nvar curves = require('../curves');\nvar rand = require('brorand');\nvar assert = utils.assert;\n\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EC(options) {\n if (!(this instanceof EC))\n return new EC(options);\n\n // Shortcut `elliptic.ec(curve-name)`\n if (typeof options === 'string') {\n assert(Object.prototype.hasOwnProperty.call(curves, options),\n 'Unknown curve ' + options);\n\n options = curves[options];\n }\n\n // Shortcut for `elliptic.ec(elliptic.curves.curveName)`\n if (options instanceof curves.PresetCurve)\n options = { curve: options };\n\n this.curve = options.curve.curve;\n this.n = this.curve.n;\n this.nh = this.n.ushrn(1);\n this.g = this.curve.g;\n\n // Point on curve\n this.g = options.curve.g;\n this.g.precompute(options.curve.n.bitLength() + 1);\n\n // Hash for function for DRBG\n this.hash = options.hash || options.curve.hash;\n}\nmodule.exports = EC;\n\nEC.prototype.keyPair = function keyPair(options) {\n return new KeyPair(this, options);\n};\n\nEC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n};\n\nEC.prototype.keyFromPublic = function keyFromPublic(pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n};\n\nEC.prototype.genKeyPair = function genKeyPair(options) {\n if (!options)\n options = {};\n\n // Instantiate Hmac_DRBG\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || 'utf8',\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: options.entropy && options.entropyEnc || 'utf8',\n nonce: this.n.toArray(),\n });\n\n var bytes = this.n.byteLength();\n var ns2 = this.n.sub(new BN(2));\n for (;;) {\n var priv = new BN(drbg.generate(bytes));\n if (priv.cmp(ns2) > 0)\n continue;\n\n priv.iaddn(1);\n return this.keyFromPrivate(priv);\n }\n};\n\nEC.prototype._truncateToN = function _truncateToN(msg, truncOnly, bitLength) {\n var byteLength;\n if (BN.isBN(msg) || typeof msg === 'number') {\n msg = new BN(msg, 16);\n byteLength = msg.byteLength();\n } else if (typeof msg === 'object') {\n // BN assumes an array-like input and asserts length\n byteLength = msg.length;\n msg = new BN(msg, 16);\n } else {\n // BN converts the value to string\n var str = msg.toString();\n // HEX encoding\n byteLength = (str.length + 1) >>> 1;\n msg = new BN(str, 16);\n }\n // Allow overriding\n if (typeof bitLength !== 'number') {\n bitLength = byteLength * 8;\n }\n var delta = bitLength - this.n.bitLength();\n if (delta > 0)\n msg = msg.ushrn(delta);\n if (!truncOnly && msg.cmp(this.n) >= 0)\n return msg.sub(this.n);\n else\n return msg;\n};\n\nEC.prototype.sign = function sign(msg, key, enc, options) {\n if (typeof enc === 'object') {\n options = enc;\n enc = null;\n }\n if (!options)\n options = {};\n\n if (typeof msg !== 'string' && typeof msg !== 'number' && !BN.isBN(msg)) {\n assert(typeof msg === 'object' && msg && typeof msg.length === 'number',\n 'Expected message to be an array-like, a hex string, or a BN instance');\n assert((msg.length >>> 0) === msg.length); // non-negative 32-bit integer\n for (var i = 0; i < msg.length; i++) assert((msg[i] & 255) === msg[i]);\n }\n\n key = this.keyFromPrivate(key, enc);\n msg = this._truncateToN(msg, false, options.msgBitLength);\n\n // Would fail further checks, but let's make the error message clear\n assert(!msg.isNeg(), 'Can not sign a negative message');\n\n // Zero-extend key to provide enough entropy\n var bytes = this.n.byteLength();\n var bkey = key.getPrivate().toArray('be', bytes);\n\n // Zero-extend nonce to have the same byte size as N\n var nonce = msg.toArray('be', bytes);\n\n // Recheck nonce to be bijective to msg\n assert((new BN(nonce)).eq(msg), 'Can not sign message');\n\n // Instantiate Hmac_DRBG\n var drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce: nonce,\n pers: options.pers,\n persEnc: options.persEnc || 'utf8',\n });\n\n // Number of bytes to generate\n var ns1 = this.n.sub(new BN(1));\n\n for (var iter = 0; ; iter++) {\n var k = options.k ?\n options.k(iter) :\n new BN(drbg.generate(this.n.byteLength()));\n k = this._truncateToN(k, true);\n if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0)\n continue;\n\n var kp = this.g.mul(k);\n if (kp.isInfinity())\n continue;\n\n var kpX = kp.getX();\n var r = kpX.umod(this.n);\n if (r.cmpn(0) === 0)\n continue;\n\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n s = s.umod(this.n);\n if (s.cmpn(0) === 0)\n continue;\n\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) |\n (kpX.cmp(r) !== 0 ? 2 : 0);\n\n // Use complement of `s`, if it is > `n / 2`\n if (options.canonical && s.cmp(this.nh) > 0) {\n s = this.n.sub(s);\n recoveryParam ^= 1;\n }\n\n return new Signature({ r: r, s: s, recoveryParam: recoveryParam });\n }\n};\n\nEC.prototype.verify = function verify(msg, signature, key, enc, options) {\n if (!options)\n options = {};\n\n msg = this._truncateToN(msg, false, options.msgBitLength);\n key = this.keyFromPublic(key, enc);\n signature = new Signature(signature, 'hex');\n\n // Perform primitive values validation\n var r = signature.r;\n var s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0)\n return false;\n if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0)\n return false;\n\n // Validate signature\n var sinv = s.invm(this.n);\n var u1 = sinv.mul(msg).umod(this.n);\n var u2 = sinv.mul(r).umod(this.n);\n var p;\n\n if (!this.curve._maxwellTrick) {\n p = this.g.mulAdd(u1, key.getPublic(), u2);\n if (p.isInfinity())\n return false;\n\n return p.getX().umod(this.n).cmp(r) === 0;\n }\n\n // NOTE: Greg Maxwell's trick, inspired by:\n // https://git.io/vad3K\n\n p = this.g.jmulAdd(u1, key.getPublic(), u2);\n if (p.isInfinity())\n return false;\n\n // Compare `p.x` of Jacobian point with `r`,\n // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the\n // inverse of `p.z^2`\n return p.eqXToP(r);\n};\n\nEC.prototype.recoverPubKey = function(msg, signature, j, enc) {\n assert((3 & j) === j, 'The recovery param is more than two bits');\n signature = new Signature(signature, enc);\n\n var n = this.n;\n var e = new BN(msg);\n var r = signature.r;\n var s = signature.s;\n\n // A set LSB signifies that the y-coordinate is odd\n var isYOdd = j & 1;\n var isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error('Unable to find sencond key candinate');\n\n // 1.1. Let x = r + jn.\n if (isSecondKey)\n r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);\n else\n r = this.curve.pointFromX(r, isYOdd);\n\n var rInv = signature.r.invm(n);\n var s1 = n.sub(e).mul(rInv).umod(n);\n var s2 = s.mul(rInv).umod(n);\n\n // 1.6.1 Compute Q = r^-1 (sR - eG)\n // Q = r^-1 (sR + -eG)\n return this.g.mulAdd(s1, r, s2);\n};\n\nEC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) {\n signature = new Signature(signature, enc);\n if (signature.recoveryParam !== null)\n return signature.recoveryParam;\n\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch (e) {\n continue;\n }\n\n if (Qprime.eq(Q))\n return i;\n }\n throw new Error('Unable to find valid recovery factor');\n};\n","'use strict';\n\nvar hash = require('hash.js');\nvar utils = require('minimalistic-crypto-utils');\nvar assert = require('minimalistic-assert');\n\nfunction HmacDRBG(options) {\n if (!(this instanceof HmacDRBG))\n return new HmacDRBG(options);\n this.hash = options.hash;\n this.predResist = !!options.predResist;\n\n this.outLen = this.hash.outSize;\n this.minEntropy = options.minEntropy || this.hash.hmacStrength;\n\n this._reseed = null;\n this.reseedInterval = null;\n this.K = null;\n this.V = null;\n\n var entropy = utils.toArray(options.entropy, options.entropyEnc || 'hex');\n var nonce = utils.toArray(options.nonce, options.nonceEnc || 'hex');\n var pers = utils.toArray(options.pers, options.persEnc || 'hex');\n assert(entropy.length >= (this.minEntropy / 8),\n 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n this._init(entropy, nonce, pers);\n}\nmodule.exports = HmacDRBG;\n\nHmacDRBG.prototype._init = function init(entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n\n this.K = new Array(this.outLen / 8);\n this.V = new Array(this.outLen / 8);\n for (var i = 0; i < this.V.length; i++) {\n this.K[i] = 0x00;\n this.V[i] = 0x01;\n }\n\n this._update(seed);\n this._reseed = 1;\n this.reseedInterval = 0x1000000000000; // 2^48\n};\n\nHmacDRBG.prototype._hmac = function hmac() {\n return new hash.hmac(this.hash, this.K);\n};\n\nHmacDRBG.prototype._update = function update(seed) {\n var kmac = this._hmac()\n .update(this.V)\n .update([ 0x00 ]);\n if (seed)\n kmac = kmac.update(seed);\n this.K = kmac.digest();\n this.V = this._hmac().update(this.V).digest();\n if (!seed)\n return;\n\n this.K = this._hmac()\n .update(this.V)\n .update([ 0x01 ])\n .update(seed)\n .digest();\n this.V = this._hmac().update(this.V).digest();\n};\n\nHmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) {\n // Optional entropy enc\n if (typeof entropyEnc !== 'string') {\n addEnc = add;\n add = entropyEnc;\n entropyEnc = null;\n }\n\n entropy = utils.toArray(entropy, entropyEnc);\n add = utils.toArray(add, addEnc);\n\n assert(entropy.length >= (this.minEntropy / 8),\n 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n\n this._update(entropy.concat(add || []));\n this._reseed = 1;\n};\n\nHmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval)\n throw new Error('Reseed is required');\n\n // Optional encoding\n if (typeof enc !== 'string') {\n addEnc = add;\n add = enc;\n enc = null;\n }\n\n // Optional additional data\n if (add) {\n add = utils.toArray(add, addEnc || 'hex');\n this._update(add);\n }\n\n var temp = [];\n while (temp.length < len) {\n this.V = this._hmac().update(this.V).digest();\n temp = temp.concat(this.V);\n }\n\n var res = temp.slice(0, len);\n this._update(add);\n this._reseed++;\n return utils.encode(res, enc);\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction KeyPair(ec, options) {\n this.ec = ec;\n this.priv = null;\n this.pub = null;\n\n // KeyPair(ec, { priv: ..., pub: ... })\n if (options.priv)\n this._importPrivate(options.priv, options.privEnc);\n if (options.pub)\n this._importPublic(options.pub, options.pubEnc);\n}\nmodule.exports = KeyPair;\n\nKeyPair.fromPublic = function fromPublic(ec, pub, enc) {\n if (pub instanceof KeyPair)\n return pub;\n\n return new KeyPair(ec, {\n pub: pub,\n pubEnc: enc,\n });\n};\n\nKeyPair.fromPrivate = function fromPrivate(ec, priv, enc) {\n if (priv instanceof KeyPair)\n return priv;\n\n return new KeyPair(ec, {\n priv: priv,\n privEnc: enc,\n });\n};\n\nKeyPair.prototype.validate = function validate() {\n var pub = this.getPublic();\n\n if (pub.isInfinity())\n return { result: false, reason: 'Invalid public key' };\n if (!pub.validate())\n return { result: false, reason: 'Public key is not a point' };\n if (!pub.mul(this.ec.curve.n).isInfinity())\n return { result: false, reason: 'Public key * N != O' };\n\n return { result: true, reason: null };\n};\n\nKeyPair.prototype.getPublic = function getPublic(compact, enc) {\n // compact is optional argument\n if (typeof compact === 'string') {\n enc = compact;\n compact = null;\n }\n\n if (!this.pub)\n this.pub = this.ec.g.mul(this.priv);\n\n if (!enc)\n return this.pub;\n\n return this.pub.encode(enc, compact);\n};\n\nKeyPair.prototype.getPrivate = function getPrivate(enc) {\n if (enc === 'hex')\n return this.priv.toString(16, 2);\n else\n return this.priv;\n};\n\nKeyPair.prototype._importPrivate = function _importPrivate(key, enc) {\n this.priv = new BN(key, enc || 16);\n\n // Ensure that the priv won't be bigger than n, otherwise we may fail\n // in fixed multiplication method\n this.priv = this.priv.umod(this.ec.curve.n);\n};\n\nKeyPair.prototype._importPublic = function _importPublic(key, enc) {\n if (key.x || key.y) {\n // Montgomery points only have an `x` coordinate.\n // Weierstrass/Edwards points on the other hand have both `x` and\n // `y` coordinates.\n if (this.ec.curve.type === 'mont') {\n assert(key.x, 'Need x coordinate');\n } else if (this.ec.curve.type === 'short' ||\n this.ec.curve.type === 'edwards') {\n assert(key.x && key.y, 'Need both x and y coordinate');\n }\n this.pub = this.ec.curve.point(key.x, key.y);\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n};\n\n// ECDH\nKeyPair.prototype.derive = function derive(pub) {\n if(!pub.validate()) {\n assert(pub.validate(), 'public point not validated');\n }\n return pub.mul(this.priv).getX();\n};\n\n// ECDSA\nKeyPair.prototype.sign = function sign(msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n};\n\nKeyPair.prototype.verify = function verify(msg, signature, options) {\n return this.ec.verify(msg, signature, this, undefined, options);\n};\n\nKeyPair.prototype.inspect = function inspect() {\n return '<Key priv: ' + (this.priv && this.priv.toString(16, 2)) +\n ' pub: ' + (this.pub && this.pub.inspect()) + ' >';\n};\n","'use strict';\n\nvar BN = require('bn.js');\n\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction Signature(options, enc) {\n if (options instanceof Signature)\n return options;\n\n if (this._importDER(options, enc))\n return;\n\n assert(options.r && options.s, 'Signature without r or s');\n this.r = new BN(options.r, 16);\n this.s = new BN(options.s, 16);\n if (options.recoveryParam === undefined)\n this.recoveryParam = null;\n else\n this.recoveryParam = options.recoveryParam;\n}\nmodule.exports = Signature;\n\nfunction Position() {\n this.place = 0;\n}\n\nfunction getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 0x80)) {\n return initial;\n }\n var octetLen = initial & 0xf;\n\n // Indefinite length or overflow\n if (octetLen === 0 || octetLen > 4) {\n return false;\n }\n\n if(buf[p.place] === 0x00) {\n return false;\n }\n\n var val = 0;\n for (var i = 0, off = p.place; i < octetLen; i++, off++) {\n val <<= 8;\n val |= buf[off];\n val >>>= 0;\n }\n\n // Leading zeroes\n if (val <= 0x7f) {\n return false;\n }\n\n p.place = off;\n return val;\n}\n\nfunction rmPadding(buf) {\n var i = 0;\n var len = buf.length - 1;\n while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {\n i++;\n }\n if (i === 0) {\n return buf;\n }\n return buf.slice(i);\n}\n\nSignature.prototype._importDER = function _importDER(data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 0x30) {\n return false;\n }\n var len = getLength(data, p);\n if (len === false) {\n return false;\n }\n if ((len + p.place) !== data.length) {\n return false;\n }\n if (data[p.place++] !== 0x02) {\n return false;\n }\n var rlen = getLength(data, p);\n if (rlen === false) {\n return false;\n }\n if ((data[p.place] & 128) !== 0) {\n return false;\n }\n var r = data.slice(p.place, rlen + p.place);\n p.place += rlen;\n if (data[p.place++] !== 0x02) {\n return false;\n }\n var slen = getLength(data, p);\n if (slen === false) {\n return false;\n }\n if (data.length !== slen + p.place) {\n return false;\n }\n if ((data[p.place] & 128) !== 0) {\n return false;\n }\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0) {\n if (r[1] & 0x80) {\n r = r.slice(1);\n } else {\n // Leading zeroes\n return false;\n }\n }\n if (s[0] === 0) {\n if (s[1] & 0x80) {\n s = s.slice(1);\n } else {\n // Leading zeroes\n return false;\n }\n }\n\n this.r = new BN(r);\n this.s = new BN(s);\n this.recoveryParam = null;\n\n return true;\n};\n\nfunction constructLength(arr, len) {\n if (len < 0x80) {\n arr.push(len);\n return;\n }\n var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);\n arr.push(octets | 0x80);\n while (--octets) {\n arr.push((len >>> (octets << 3)) & 0xff);\n }\n arr.push(len);\n}\n\nSignature.prototype.toDER = function toDER(enc) {\n var r = this.r.toArray();\n var s = this.s.toArray();\n\n // Pad values\n if (r[0] & 0x80)\n r = [ 0 ].concat(r);\n // Pad values\n if (s[0] & 0x80)\n s = [ 0 ].concat(s);\n\n r = rmPadding(r);\n s = rmPadding(s);\n\n while (!s[0] && !(s[1] & 0x80)) {\n s = s.slice(1);\n }\n var arr = [ 0x02 ];\n constructLength(arr, r.length);\n arr = arr.concat(r);\n arr.push(0x02);\n constructLength(arr, s.length);\n var backHalf = arr.concat(s);\n var res = [ 0x30 ];\n constructLength(res, backHalf.length);\n res = res.concat(backHalf);\n return utils.encode(res, enc);\n};\n","'use strict';\n\nvar hash = require('hash.js');\nvar curves = require('../curves');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EDDSA(curve) {\n assert(curve === 'ed25519', 'only tested with ed25519 so far');\n\n if (!(this instanceof EDDSA))\n return new EDDSA(curve);\n\n curve = curves[curve].curve;\n this.curve = curve;\n this.g = curve.g;\n this.g.precompute(curve.n.bitLength() + 1);\n\n this.pointClass = curve.point().constructor;\n this.encodingLength = Math.ceil(curve.n.bitLength() / 8);\n this.hash = hash.sha512;\n}\n\nmodule.exports = EDDSA;\n\n/**\n* @param {Array|String} message - message bytes\n* @param {Array|String|KeyPair} secret - secret bytes or a keypair\n* @returns {Signature} - signature\n*/\nEDDSA.prototype.sign = function sign(message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret);\n var r = this.hashInt(key.messagePrefix(), message);\n var R = this.g.mul(r);\n var Rencoded = this.encodePoint(R);\n var s_ = this.hashInt(Rencoded, key.pubBytes(), message)\n .mul(key.priv());\n var S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R: R, S: S, Rencoded: Rencoded });\n};\n\n/**\n* @param {Array} message - message bytes\n* @param {Array|String|Signature} sig - sig bytes\n* @param {Array|String|Point|KeyPair} pub - public key\n* @returns {Boolean} - true if public key matches sig of message\n*/\nEDDSA.prototype.verify = function verify(message, sig, pub) {\n message = parseBytes(message);\n sig = this.makeSignature(sig);\n if (sig.S().gte(sig.eddsa.curve.n) || sig.S().isNeg()) {\n return false;\n }\n var key = this.keyFromPublic(pub);\n var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message);\n var SG = this.g.mul(sig.S());\n var RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n};\n\nEDDSA.prototype.hashInt = function hashInt() {\n var hash = this.hash();\n for (var i = 0; i < arguments.length; i++)\n hash.update(arguments[i]);\n return utils.intFromLE(hash.digest()).umod(this.curve.n);\n};\n\nEDDSA.prototype.keyFromPublic = function keyFromPublic(pub) {\n return KeyPair.fromPublic(this, pub);\n};\n\nEDDSA.prototype.keyFromSecret = function keyFromSecret(secret) {\n return KeyPair.fromSecret(this, secret);\n};\n\nEDDSA.prototype.makeSignature = function makeSignature(sig) {\n if (sig instanceof Signature)\n return sig;\n return new Signature(this, sig);\n};\n\n/**\n* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2\n*\n* EDDSA defines methods for encoding and decoding points and integers. These are\n* helper convenience methods, that pass along to utility functions implied\n* parameters.\n*\n*/\nEDDSA.prototype.encodePoint = function encodePoint(point) {\n var enc = point.getY().toArray('le', this.encodingLength);\n enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0;\n return enc;\n};\n\nEDDSA.prototype.decodePoint = function decodePoint(bytes) {\n bytes = utils.parseBytes(bytes);\n\n var lastIx = bytes.length - 1;\n var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80);\n var xIsOdd = (bytes[lastIx] & 0x80) !== 0;\n\n var y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n};\n\nEDDSA.prototype.encodeInt = function encodeInt(num) {\n return num.toArray('le', this.encodingLength);\n};\n\nEDDSA.prototype.decodeInt = function decodeInt(bytes) {\n return utils.intFromLE(bytes);\n};\n\nEDDSA.prototype.isPoint = function isPoint(val) {\n return val instanceof this.pointClass;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar cachedProperty = utils.cachedProperty;\n\n/**\n* @param {EDDSA} eddsa - instance\n* @param {Object} params - public/private key parameters\n*\n* @param {Array<Byte>} [params.secret] - secret seed bytes\n* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms)\n* @param {Array<Byte>} [params.pub] - public key point encoded as bytes\n*\n*/\nfunction KeyPair(eddsa, params) {\n this.eddsa = eddsa;\n this._secret = parseBytes(params.secret);\n if (eddsa.isPoint(params.pub))\n this._pub = params.pub;\n else\n this._pubBytes = parseBytes(params.pub);\n}\n\nKeyPair.fromPublic = function fromPublic(eddsa, pub) {\n if (pub instanceof KeyPair)\n return pub;\n return new KeyPair(eddsa, { pub: pub });\n};\n\nKeyPair.fromSecret = function fromSecret(eddsa, secret) {\n if (secret instanceof KeyPair)\n return secret;\n return new KeyPair(eddsa, { secret: secret });\n};\n\nKeyPair.prototype.secret = function secret() {\n return this._secret;\n};\n\ncachedProperty(KeyPair, 'pubBytes', function pubBytes() {\n return this.eddsa.encodePoint(this.pub());\n});\n\ncachedProperty(KeyPair, 'pub', function pub() {\n if (this._pubBytes)\n return this.eddsa.decodePoint(this._pubBytes);\n return this.eddsa.g.mul(this.priv());\n});\n\ncachedProperty(KeyPair, 'privBytes', function privBytes() {\n var eddsa = this.eddsa;\n var hash = this.hash();\n var lastIx = eddsa.encodingLength - 1;\n\n var a = hash.slice(0, eddsa.encodingLength);\n a[0] &= 248;\n a[lastIx] &= 127;\n a[lastIx] |= 64;\n\n return a;\n});\n\ncachedProperty(KeyPair, 'priv', function priv() {\n return this.eddsa.decodeInt(this.privBytes());\n});\n\ncachedProperty(KeyPair, 'hash', function hash() {\n return this.eddsa.hash().update(this.secret()).digest();\n});\n\ncachedProperty(KeyPair, 'messagePrefix', function messagePrefix() {\n return this.hash().slice(this.eddsa.encodingLength);\n});\n\nKeyPair.prototype.sign = function sign(message) {\n assert(this._secret, 'KeyPair can only verify');\n return this.eddsa.sign(message, this);\n};\n\nKeyPair.prototype.verify = function verify(message, sig) {\n return this.eddsa.verify(message, sig, this);\n};\n\nKeyPair.prototype.getSecret = function getSecret(enc) {\n assert(this._secret, 'KeyPair is public only');\n return utils.encode(this.secret(), enc);\n};\n\nKeyPair.prototype.getPublic = function getPublic(enc) {\n return utils.encode(this.pubBytes(), enc);\n};\n\nmodule.exports = KeyPair;\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar cachedProperty = utils.cachedProperty;\nvar parseBytes = utils.parseBytes;\n\n/**\n* @param {EDDSA} eddsa - eddsa instance\n* @param {Array<Bytes>|Object} sig -\n* @param {Array<Bytes>|Point} [sig.R] - R point as Point or bytes\n* @param {Array<Bytes>|bn} [sig.S] - S scalar as bn or bytes\n* @param {Array<Bytes>} [sig.Rencoded] - R point encoded\n* @param {Array<Bytes>} [sig.Sencoded] - S scalar encoded\n*/\nfunction Signature(eddsa, sig) {\n this.eddsa = eddsa;\n\n if (typeof sig !== 'object')\n sig = parseBytes(sig);\n\n if (Array.isArray(sig)) {\n assert(sig.length === eddsa.encodingLength * 2, 'Signature has invalid size');\n sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n };\n }\n\n assert(sig.R && sig.S, 'Signature without R or S');\n\n if (eddsa.isPoint(sig.R))\n this._R = sig.R;\n if (sig.S instanceof BN)\n this._S = sig.S;\n\n this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded;\n this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded;\n}\n\ncachedProperty(Signature, 'S', function S() {\n return this.eddsa.decodeInt(this.Sencoded());\n});\n\ncachedProperty(Signature, 'R', function R() {\n return this.eddsa.decodePoint(this.Rencoded());\n});\n\ncachedProperty(Signature, 'Rencoded', function Rencoded() {\n return this.eddsa.encodePoint(this.R());\n});\n\ncachedProperty(Signature, 'Sencoded', function Sencoded() {\n return this.eddsa.encodeInt(this.S());\n});\n\nSignature.prototype.toBytes = function toBytes() {\n return this.Rencoded().concat(this.Sencoded());\n};\n\nSignature.prototype.toHex = function toHex() {\n return utils.encode(this.toBytes(), 'hex').toUpperCase();\n};\n\nmodule.exports = Signature;\n","import { createHash } from \"crypto\";\nimport { bech32m } from \"bech32\";\nimport * as bitcoinMessage from \"bitcoinjs-message\";\nimport { ml_dsa44 } from \"@noble/post-quantum/ml-dsa.js\";\n\nconst MESSAGE_MAGIC = \"Neurai Signed Message:\\n\";\nconst PQ_MESSAGE_SIGNATURE_PREFIX = 0x35;\nconst PQ_SERIALIZED_PUBKEY_PREFIX = 0x05;\nconst PQ_PUBLIC_KEY_LENGTH = 1312;\nconst PQ_SERIALIZED_PUBKEY_LENGTH = 1 + PQ_PUBLIC_KEY_LENGTH;\nconst PQ_SIGNATURE_LENGTH = 2420;\nconst LEGACY_MESSAGE_PREFIX =\n String.fromCharCode(Buffer.byteLength(MESSAGE_MAGIC, \"utf8\")) +\n MESSAGE_MAGIC;\n\nfunction encodeCompactSize(value: number): Buffer {\n if (!Number.isInteger(value) || value < 0) {\n throw new Error(\"CompactSize value must be a non-negative integer\");\n }\n\n if (value < 253) {\n return Buffer.from([value]);\n }\n\n if (value <= 0xffff) {\n const buffer = Buffer.alloc(3);\n buffer[0] = 0xfd;\n buffer.writeUInt16LE(value, 1);\n return buffer;\n }\n\n if (value <= 0xffffffff) {\n const buffer = Buffer.alloc(5);\n buffer[0] = 0xfe;\n buffer.writeUInt32LE(value, 1);\n return buffer;\n }\n\n throw new Error(\"CompactSize values above uint32 are not supported\");\n}\n\nfunction decodeCompactSize(buffer: Buffer, offset: number) {\n if (offset >= buffer.length) {\n throw new Error(\"Unexpected end of CompactSize data\");\n }\n\n const first = buffer[offset];\n if (first < 253) {\n return { value: first, offset: offset + 1 };\n }\n\n if (first === 0xfd) {\n if (offset + 3 > buffer.length) {\n throw new Error(\"Unexpected end of CompactSize uint16 data\");\n }\n return { value: buffer.readUInt16LE(offset + 1), offset: offset + 3 };\n }\n\n if (first === 0xfe) {\n if (offset + 5 > buffer.length) {\n throw new Error(\"Unexpected end of CompactSize uint32 data\");\n }\n return { value: buffer.readUInt32LE(offset + 1), offset: offset + 5 };\n }\n\n if (first === 0xff) {\n throw new Error(\"CompactSize uint64 is not supported\");\n }\n\n throw new Error(\"Invalid CompactSize prefix\");\n}\n\nfunction sha256(bytes: Uint8Array) {\n return createHash(\"sha256\").update(bytes).digest();\n}\n\nfunction hash256(bytes: Uint8Array) {\n return sha256(sha256(bytes));\n}\n\nfunction hash160(bytes: Uint8Array) {\n return createHash(\"ripemd160\").update(sha256(bytes)).digest();\n}\n\nfunction encodeMessageHash(message: string) {\n const messageBytes = Buffer.from(message, \"utf8\");\n const magicBytes = Buffer.from(MESSAGE_MAGIC, \"utf8\");\n const payload = Buffer.concat([\n encodeCompactSize(magicBytes.length),\n magicBytes,\n encodeCompactSize(messageBytes.length),\n messageBytes,\n ]);\n\n return hash256(payload);\n}\n\nfunction toSignatureBuffer(signature: string | Uint8Array) {\n return typeof signature === \"string\"\n ? Buffer.from(signature, \"base64\")\n : Buffer.from(signature);\n}\n\nfunction normalizePQPublicKey(publicKey: Uint8Array) {\n const buffer = Buffer.from(publicKey);\n\n if (\n buffer.length === PQ_SERIALIZED_PUBKEY_LENGTH &&\n buffer[0] === PQ_SERIALIZED_PUBKEY_PREFIX\n ) {\n return buffer;\n }\n\n if (buffer.length === PQ_PUBLIC_KEY_LENGTH) {\n return Buffer.concat([Buffer.from([PQ_SERIALIZED_PUBKEY_PREFIX]), buffer]);\n }\n\n throw new Error(\"Invalid PQ public key length\");\n}\n\nfunction isPQMessageSignature(signature: string | Uint8Array) {\n const buffer = toSignatureBuffer(signature);\n return buffer.length > 0 && buffer[0] === PQ_MESSAGE_SIGNATURE_PREFIX;\n}\n\nfunction decodePQAddress(address: string) {\n const decoded = bech32m.decode(address);\n if (decoded.words.length === 0) {\n throw new Error(\"Invalid bech32m address\");\n }\n\n return {\n prefix: decoded.prefix,\n version: decoded.words[0],\n program: Buffer.from(bech32m.fromWords(decoded.words.slice(1))),\n };\n}\n\n/** returns a base64 encoded string representation of the legacy signature */\nexport function sign(message: string, privateKey: Uint8Array, compressed = true) {\n const signature = bitcoinMessage.sign(\n message,\n Buffer.from(privateKey),\n compressed,\n LEGACY_MESSAGE_PREFIX\n );\n\n return signature.toString(\"base64\");\n}\n\nexport function signPQMessage(\n message: string,\n privateKey: Uint8Array,\n publicKey: Uint8Array\n) {\n const serializedPublicKey = normalizePQPublicKey(publicKey);\n const hash = encodeMessageHash(message);\n const pqSignature = Buffer.from(ml_dsa44.sign(hash, Buffer.from(privateKey)));\n\n const payload = Buffer.concat([\n Buffer.from([PQ_MESSAGE_SIGNATURE_PREFIX]),\n encodeCompactSize(serializedPublicKey.length),\n serializedPublicKey,\n encodeCompactSize(pqSignature.length),\n pqSignature,\n ]);\n\n return payload.toString(\"base64\");\n}\n\nexport function verifyLegacyMessage(\n message: string,\n address: string,\n signature: string | Uint8Array\n) {\n try {\n return bitcoinMessage.verify(\n message,\n address,\n toSignatureBuffer(signature),\n LEGACY_MESSAGE_PREFIX\n );\n } catch {\n return false;\n }\n}\n\nexport function verifyPQMessage(\n message: string,\n address: string,\n signature: string | Uint8Array\n) {\n try {\n const payload = toSignatureBuffer(signature);\n let offset = 0;\n\n if (payload[offset++] !== PQ_MESSAGE_SIGNATURE_PREFIX) {\n return false;\n }\n\n const publicKeyLength = decodeCompactSize(payload, offset);\n offset = publicKeyLength.offset;\n\n const serializedPublicKey = payload.subarray(\n offset,\n offset + publicKeyLength.value\n );\n offset += publicKeyLength.value;\n\n const signatureLength = decodeCompactSize(payload, offset);\n offset = signatureLength.offset;\n\n const pqSignature = payload.subarray(offset, offset + signatureLength.value);\n offset += signatureLength.value;\n\n if (offset !== payload.length) {\n return false;\n }\n\n if (\n serializedPublicKey.length !== PQ_SERIALIZED_PUBKEY_LENGTH ||\n serializedPublicKey[0] !== PQ_SERIALIZED_PUBKEY_PREFIX ||\n pqSignature.length !== PQ_SIGNATURE_LENGTH\n ) {\n return false;\n }\n\n const decodedAddress = decodePQAddress(address);\n if (decodedAddress.version !== 1 || decodedAddress.program.length !== 20) {\n return false;\n }\n\n const expectedProgram = hash160(serializedPublicKey);\n if (!expectedProgram.equals(decodedAddress.program)) {\n return false;\n }\n\n return ml_dsa44.verify(\n pqSignature,\n encodeMessageHash(message),\n serializedPublicKey.subarray(1)\n );\n } catch {\n return false;\n }\n}\n\nexport function verifyMessage(\n message: string,\n address: string,\n signature: string | Uint8Array\n) {\n return isPQMessageSignature(signature)\n ? verifyPQMessage(message, address, signature)\n : verifyLegacyMessage(message, address, signature);\n}\n","'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.bech32m = exports.bech32 = void 0;\nconst ALPHABET = 'qpzry9x8gf2tvdw0s3jn54khce6mua7l';\nconst ALPHABET_MAP = {};\nfor (let z = 0; z < ALPHABET.length; z++) {\n const x = ALPHABET.charAt(z);\n ALPHABET_MAP[x] = z;\n}\nfunction polymodStep(pre) {\n const b = pre >> 25;\n return (((pre & 0x1ffffff) << 5) ^\n (-((b >> 0) & 1) & 0x3b6a57b2) ^\n (-((b >> 1) & 1) & 0x26508e6d) ^\n (-((b >> 2) & 1) & 0x1ea119fa) ^\n (-((b >> 3) & 1) & 0x3d4233dd) ^\n (-((b >> 4) & 1) & 0x2a1462b3));\n}\nfunction prefixChk(prefix) {\n let chk = 1;\n for (let i = 0; i < prefix.length; ++i) {\n const c = prefix.charCodeAt(i);\n if (c < 33 || c > 126)\n return 'Invalid prefix (' + prefix + ')';\n chk = polymodStep(chk) ^ (c >> 5);\n }\n chk = polymodStep(chk);\n for (let i = 0; i < prefix.length; ++i) {\n const v = prefix.charCodeAt(i);\n chk = polymodStep(chk) ^ (v & 0x1f);\n }\n return chk;\n}\nfunction convert(data, inBits, outBits, pad) {\n let value = 0;\n let bits = 0;\n const maxV = (1 << outBits) - 1;\n const result = [];\n for (let i = 0; i < data.length; ++i) {\n value = (value << inBits) | data[i];\n bits += inBits;\n while (bits >= outBits) {\n bits -= outBits;\n result.push((value >> bits) & maxV);\n }\n }\n if (pad) {\n if (bits > 0) {\n result.push((value << (outBits - bits)) & maxV);\n }\n }\n else {\n if (bits >= inBits)\n return 'Excess padding';\n if ((value << (outBits - bits)) & maxV)\n return 'Non-zero padding';\n }\n return result;\n}\nfunction toWords(bytes) {\n return convert(bytes, 8, 5, true);\n}\nfunction fromWordsUnsafe(words) {\n const res = convert(words, 5, 8, false);\n if (Array.isArray(res))\n return res;\n}\nfunction fromWords(words) {\n const res = convert(words, 5, 8, false);\n if (Array.isArray(res))\n return res;\n throw new Error(res);\n}\nfunction getLibraryFromEncoding(encoding) {\n let ENCODING_CONST;\n if (encoding === 'bech32') {\n ENCODING_CONST = 1;\n }\n else {\n ENCODING_CONST = 0x2bc830a3;\n }\n function encode(prefix, words, LIMIT) {\n LIMIT = LIMIT || 90;\n if (prefix.length + 7 + words.length > LIMIT)\n throw new TypeError('Exceeds length limit');\n prefix = prefix.toLowerCase();\n // determine chk mod\n let chk = prefixChk(prefix);\n if (typeof chk === 'string')\n throw new Error(chk);\n let result = prefix + '1';\n for (let i = 0; i < words.length; ++i) {\n const x = words[i];\n if (x >> 5 !== 0)\n throw new Error('Non 5-bit word');\n chk = polymodStep(chk) ^ x;\n result += ALPHABET.charAt(x);\n }\n for (let i = 0; i < 6; ++i) {\n chk = polymodStep(chk);\n }\n chk ^= ENCODING_CONST;\n for (let i = 0; i < 6; ++i) {\n const v = (chk >> ((5 - i) * 5)) & 0x1f;\n result += ALPHABET.charAt(v);\n }\n return result;\n }\n function __decode(str, LIMIT) {\n LIMIT = LIMIT || 90;\n if (str.length < 8)\n return str + ' too short';\n if (str.length > LIMIT)\n return 'Exceeds length limit';\n // don't allow mixed case\n const lowered = str.toLowerCase();\n const uppered = str.toUpperCase();\n if (str !== lowered && str !== uppered)\n return 'Mixed-case string ' + str;\n str = lowered;\n const split = str.lastIndexOf('1');\n if (split === -1)\n return 'No separator character for ' + str;\n if (split === 0)\n return 'Missing prefix for ' + str;\n const prefix = str.slice(0, split);\n const wordChars = str.slice(split + 1);\n if (wordChars.length < 6)\n return 'Data too short';\n let chk = prefixChk(prefix);\n if (typeof chk === 'string')\n return chk;\n const words = [];\n for (let i = 0; i < wordChars.length; ++i) {\n const c = wordChars.charAt(i);\n const v = ALPHABET_MAP[c];\n if (v === undefined)\n return 'Unknown character ' + c;\n chk = polymodStep(chk) ^ v;\n // not in the checksum?\n if (i + 6 >= wordChars.length)\n continue;\n words.push(v);\n }\n if (chk !== ENCODING_CONST)\n return 'Invalid checksum for ' + str;\n return { prefix, words };\n }\n function decodeUnsafe(str, LIMIT) {\n const res = __decode(str, LIMIT);\n if (typeof res === 'object')\n return res;\n }\n function decode(str, LIMIT) {\n const res = __decode(str, LIMIT);\n if (typeof res === 'object')\n return res;\n throw new Error(res);\n }\n return {\n decodeUnsafe,\n decode,\n encode,\n toWords,\n fromWordsUnsafe,\n fromWords,\n };\n}\nexports.bech32 = getLibraryFromEncoding('bech32');\nexports.bech32m = getLibraryFromEncoding('bech32m');\n","const bs58check = require('bs58check')\nconst bech32 = require('bech32')\nconst bufferEquals = require('buffer-equals')\nconst createHash = require('create-hash')\nconst secp256k1 = require('secp256k1')\nconst varuint = require('varuint-bitcoin')\n\nconst SEGWIT_TYPES = {\n P2WPKH: 'p2wpkh',\n P2SH_P2WPKH: 'p2sh(p2wpkh)'\n}\n\nfunction sha256 (b) {\n return createHash('sha256')\n .update(b)\n .digest()\n}\nfunction hash256 (buffer) {\n return sha256(sha256(buffer))\n}\nfunction hash160 (buffer) {\n return createHash('ripemd160')\n .update(sha256(buffer))\n .digest()\n}\n\nfunction encodeSignature (signature, recovery, compressed, segwitType) {\n if (segwitType !== undefined) {\n recovery += 8\n if (segwitType === SEGWIT_TYPES.P2WPKH) recovery += 4\n } else {\n if (compressed) recovery += 4\n }\n return Buffer.concat([Buffer.alloc(1, recovery + 27), signature])\n}\n\nfunction decodeSignature (buffer) {\n if (buffer.length !== 65) throw new Error('Invalid signature length')\n\n const flagByte = buffer.readUInt8(0) - 27\n if (flagByte > 15 || flagByte < 0) {\n throw new Error('Invalid signature parameter')\n }\n\n return {\n compressed: !!(flagByte & 12),\n segwitType: !(flagByte & 8)\n ? null\n : !(flagByte & 4)\n ? SEGWIT_TYPES.P2SH_P2WPKH\n : SEGWIT_TYPES.P2WPKH,\n recovery: flagByte & 3,\n signature: buffer.slice(1)\n }\n}\n\nfunction magicHash (message, messagePrefix) {\n messagePrefix = messagePrefix || '\\u0018Bitcoin Signed Message:\\n'\n if (!Buffer.isBuffer(messagePrefix)) {\n messagePrefix = Buffer.from(messagePrefix, 'utf8')\n }\n if (!Buffer.isBuffer(message)) {\n message = Buffer.from(message, 'utf8')\n }\n const messageVISize = varuint.encodingLength(message.length)\n const buffer = Buffer.allocUnsafe(\n messagePrefix.length + messageVISize + message.length\n )\n messagePrefix.copy(buffer, 0)\n varuint.encode(message.length, buffer, messagePrefix.length)\n message.copy(buffer, messagePrefix.length + messageVISize)\n return hash256(buffer)\n}\n\nfunction prepareSign (\n messagePrefixArg,\n sigOptions\n) {\n if (typeof messagePrefixArg === 'object' && sigOptions === undefined) {\n sigOptions = messagePrefixArg\n messagePrefixArg = undefined\n }\n let { segwitType, extraEntropy } = sigOptions || {}\n if (\n segwitType &&\n (typeof segwitType === 'string' || segwitType instanceof String)\n ) {\n segwitType = segwitType.toLowerCase()\n }\n if (\n segwitType &&\n segwitType !== SEGWIT_TYPES.P2SH_P2WPKH &&\n segwitType !== SEGWIT_TYPES.P2WPKH\n ) {\n throw new Error(\n 'Unrecognized segwitType: use \"' +\n SEGWIT_TYPES.P2SH_P2WPKH +\n '\" or \"' +\n SEGWIT_TYPES.P2WPKH +\n '\"'\n )\n }\n\n return {\n messagePrefixArg,\n segwitType,\n extraEntropy\n }\n}\n\nfunction isSigner (obj) {\n return obj && typeof obj.sign === 'function'\n}\n\nfunction sign (\n message,\n privateKey,\n compressed,\n messagePrefix,\n sigOptions\n) {\n const {\n messagePrefixArg,\n segwitType,\n extraEntropy\n } = prepareSign(messagePrefix, sigOptions)\n const hash = magicHash(message, messagePrefixArg)\n const sigObj = isSigner(privateKey)\n ? privateKey.sign(hash, extraEntropy)\n : secp256k1.sign(hash, privateKey, { data: extraEntropy })\n return encodeSignature(\n sigObj.signature,\n sigObj.recovery,\n compressed,\n segwitType\n )\n}\n\nfunction signAsync (\n message,\n privateKey,\n compressed,\n messagePrefix,\n sigOptions\n) {\n let messagePrefixArg, segwitType, extraEntropy\n return Promise.resolve().then(() => {\n ({\n messagePrefixArg,\n segwitType,\n extraEntropy\n } = prepareSign(messagePrefix, sigOptions))\n const hash = magicHash(message, messagePrefixArg)\n return isSigner(privateKey)\n ? privateKey.sign(hash, extraEntropy)\n : secp256k1.sign(hash, privateKey, { data: extraEntropy })\n }).then((sigObj) => {\n return encodeSignature(\n sigObj.signature,\n sigObj.recovery,\n compressed,\n segwitType\n )\n })\n}\n\nfunction segwitRedeemHash (publicKeyHash) {\n const redeemScript = Buffer.concat([\n Buffer.from('0014', 'hex'),\n publicKeyHash\n ])\n return hash160(redeemScript)\n}\n\nfunction decodeBech32 (address) {\n const result = bech32.decode(address)\n const data = bech32.fromWords(result.words.slice(1))\n return Buffer.from(data)\n}\n\nfunction verify (message, address, signature, messagePrefix, checkSegwitAlways) {\n if (!Buffer.isBuffer(signature)) signature = Buffer.from(signature, 'base64')\n\n const parsed = decodeSignature(signature)\n\n if (checkSegwitAlways && !parsed.compressed) {\n throw new Error('checkSegwitAlways can only be used with a compressed pubkey signature flagbyte')\n }\n\n const hash = magicHash(message, messagePrefix)\n const publicKey = secp256k1.recover(\n hash,\n parsed.signature,\n parsed.recovery,\n parsed.compressed\n )\n const publicKeyHash = hash160(publicKey)\n let actual, expected\n\n if (parsed.segwitType) {\n if (parsed.segwitType === SEGWIT_TYPES.P2SH_P2WPKH) {\n actual = segwitRedeemHash(publicKeyHash)\n expected = bs58check.decode(address).slice(1)\n } else {\n // parsed.segwitType === SEGWIT_TYPES.P2WPKH\n // must be true since we only return null, P2SH_P2WPKH, or P2WPKH\n // from the decodeSignature function.\n actual = publicKeyHash\n expected = decodeBech32(address)\n }\n } else {\n if (checkSegwitAlways) {\n try {\n expected = decodeBech32(address)\n // if address is bech32 it is not p2sh\n return bufferEquals(publicKeyHash, expected)\n } catch (e) {\n const redeemHash = segwitRedeemHash(publicKeyHash)\n expected = bs58check.decode(address).slice(1)\n // base58 can be p2pkh or p2sh-p2wpkh\n return (\n bufferEquals(publicKeyHash, expected) ||\n bufferEquals(redeemHash, expected)\n )\n }\n } else {\n actual = publicKeyHash\n expected = bs58check.decode(address).slice(1)\n }\n }\n\n return bufferEquals(actual, expected)\n}\n\nmodule.exports = {\n magicHash: magicHash,\n sign: sign,\n signAsync: signAsync,\n verify: verify\n}\n","'use strict'\n\nvar createHash = require('create-hash')\nvar bs58checkBase = require('./base')\n\n// SHA256(SHA256(buffer))\nfunction sha256x2 (buffer) {\n var tmp = createHash('sha256').update(buffer).digest()\n return createHash('sha256').update(tmp).digest()\n}\n\nmodule.exports = bs58checkBase(sha256x2)\n","'use strict'\n\nvar base58 = require('bs58')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (checksumFn) {\n // Encode a buffer as a base58-check encoded string\n function encode (payload) {\n var checksum = checksumFn(payload)\n\n return base58.encode(Buffer.concat([\n payload,\n checksum\n ], payload.length + 4))\n }\n\n function decodeRaw (buffer) {\n var payload = buffer.slice(0, -4)\n var checksum = buffer.slice(-4)\n var newChecksum = checksumFn(payload)\n\n if (checksum[0] ^ newChecksum[0] |\n checksum[1] ^ newChecksum[1] |\n checksum[2] ^ newChecksum[2] |\n checksum[3] ^ newChecksum[3]) return\n\n return payload\n }\n\n // Decode a base58-check encoded string to a buffer, no result if checksum is wrong\n function decodeUnsafe (string) {\n var buffer = base58.decodeUnsafe(string)\n if (!buffer) return\n\n return decodeRaw(buffer)\n }\n\n function decode (string) {\n var buffer = base58.decode(string)\n var payload = decodeRaw(buffer, checksumFn)\n if (!payload) throw new Error('Invalid checksum')\n return payload\n }\n\n return {\n encode: encode,\n decode: decode,\n decodeUnsafe: decodeUnsafe\n }\n}\n","var basex = require('base-x')\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n// @ts-ignore\nvar _Buffer = require('safe-buffer').Buffer\nfunction base (ALPHABET) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256)\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i)\n var xc = x.charCodeAt(0)\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i\n }\n var BASE = ALPHABET.length\n var LEADER = ALPHABET.charAt(0)\n var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n function encode (source) {\n if (Array.isArray(source) || source instanceof Uint8Array) { source = _Buffer.from(source) }\n if (!_Buffer.isBuffer(source)) { throw new TypeError('Expected Buffer') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0\n var length = 0\n var pbegin = 0\n var pend = source.length\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++\n zeroes++\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n var b58 = new Uint8Array(size)\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin]\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0\n b58[it1] = (carry % BASE) >>> 0\n carry = (carry / BASE) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n pbegin++\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length\n while (it2 !== size && b58[it2] === 0) {\n it2++\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes)\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n return str\n }\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return _Buffer.alloc(0) }\n var psz = 0\n // Skip and count leading '1's.\n var zeroes = 0\n var length = 0\n while (source[psz] === LEADER) {\n zeroes++\n psz++\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size)\n // Process the characters.\n while (psz < source.length) {\n // Find code of next character\n var charCode = source.charCodeAt(psz)\n // Base map can not be indexed using char code\n if (charCode > 255) { return }\n // Decode character\n var carry = BASE_MAP[charCode]\n // Invalid character\n if (carry === 255) { return }\n var i = 0\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0\n b256[it3] = (carry % 256) >>> 0\n carry = (carry / 256) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n psz++\n }\n // Skip leading zeroes in b256.\n var it4 = size - length\n while (it4 !== size && b256[it4] === 0) {\n it4++\n }\n var vch = _Buffer.allocUnsafe(zeroes + (size - it4))\n vch.fill(0x00, 0, zeroes)\n var j = zeroes\n while (it4 !== size) {\n vch[j++] = b256[it4++]\n }\n return vch\n }\n function decode (string) {\n var buffer = decodeUnsafe(string)\n if (buffer) { return buffer }\n throw new Error('Non-base' + BASE + ' character')\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nmodule.exports = base\n","'use strict'\nvar ALPHABET = 'qpzry9x8gf2tvdw0s3jn54khce6mua7l'\n\n// pre-compute lookup table\nvar ALPHABET_MAP = {}\nfor (var z = 0; z < ALPHABET.length; z++) {\n var x = ALPHABET.charAt(z)\n\n if (ALPHABET_MAP[x] !== undefined) throw new TypeError(x + ' is ambiguous')\n ALPHABET_MAP[x] = z\n}\n\nfunction polymodStep (pre) {\n var b = pre >> 25\n return ((pre & 0x1FFFFFF) << 5) ^\n (-((b >> 0) & 1) & 0x3b6a57b2) ^\n (-((b >> 1) & 1) & 0x26508e6d) ^\n (-((b >> 2) & 1) & 0x1ea119fa) ^\n (-((b >> 3) & 1) & 0x3d4233dd) ^\n (-((b >> 4) & 1) & 0x2a1462b3)\n}\n\nfunction prefixChk (prefix) {\n var chk = 1\n for (var i = 0; i < prefix.length; ++i) {\n var c = prefix.charCodeAt(i)\n if (c < 33 || c > 126) return 'Invalid prefix (' + prefix + ')'\n\n chk = polymodStep(chk) ^ (c >> 5)\n }\n chk = polymodStep(chk)\n\n for (i = 0; i < prefix.length; ++i) {\n var v = prefix.charCodeAt(i)\n chk = polymodStep(chk) ^ (v & 0x1f)\n }\n return chk\n}\n\nfunction encode (prefix, words, LIMIT) {\n LIMIT = LIMIT || 90\n if ((prefix.length + 7 + words.length) > LIMIT) throw new TypeError('Exceeds length limit')\n\n prefix = prefix.toLowerCase()\n\n // determine chk mod\n var chk = prefixChk(prefix)\n if (typeof chk === 'string') throw new Error(chk)\n\n var result = prefix + '1'\n for (var i = 0; i < words.length; ++i) {\n var x = words[i]\n if ((x >> 5) !== 0) throw new Error('Non 5-bit word')\n\n chk = polymodStep(chk) ^ x\n result += ALPHABET.charAt(x)\n }\n\n for (i = 0; i < 6; ++i) {\n chk = polymodStep(chk)\n }\n chk ^= 1\n\n for (i = 0; i < 6; ++i) {\n var v = (chk >> ((5 - i) * 5)) & 0x1f\n result += ALPHABET.charAt(v)\n }\n\n return result\n}\n\nfunction __decode (str, LIMIT) {\n LIMIT = LIMIT || 90\n if (str.length < 8) return str + ' too short'\n if (str.length > LIMIT) return 'Exceeds length limit'\n\n // don't allow mixed case\n var lowered = str.toLowerCase()\n var uppered = str.toUpperCase()\n if (str !== lowered && str !== uppered) return 'Mixed-case string ' + str\n str = lowered\n\n var split = str.lastIndexOf('1')\n if (split === -1) return 'No separator character for ' + str\n if (split === 0) return 'Missing prefix for ' + str\n\n var prefix = str.slice(0, split)\n var wordChars = str.slice(split + 1)\n if (wordChars.length < 6) return 'Data too short'\n\n var chk = prefixChk(prefix)\n if (typeof chk === 'string') return chk\n\n var words = []\n for (var i = 0; i < wordChars.length; ++i) {\n var c = wordChars.charAt(i)\n var v = ALPHABET_MAP[c]\n if (v === undefined) return 'Unknown character ' + c\n chk = polymodStep(chk) ^ v\n\n // not in the checksum?\n if (i + 6 >= wordChars.length) continue\n words.push(v)\n }\n\n if (chk !== 1) return 'Invalid checksum for ' + str\n return { prefix: prefix, words: words }\n}\n\nfunction decodeUnsafe () {\n var res = __decode.apply(null, arguments)\n if (typeof res === 'object') return res\n}\n\nfunction decode (str) {\n var res = __decode.apply(null, arguments)\n if (typeof res === 'object') return res\n\n throw new Error(res)\n}\n\nfunction convert (data, inBits, outBits, pad) {\n var value = 0\n var bits = 0\n var maxV = (1 << outBits) - 1\n\n var result = []\n for (var i = 0; i < data.length; ++i) {\n value = (value << inBits) | data[i]\n bits += inBits\n\n while (bits >= outBits) {\n bits -= outBits\n result.push((value >> bits) & maxV)\n }\n }\n\n if (pad) {\n if (bits > 0) {\n result.push((value << (outBits - bits)) & maxV)\n }\n } else {\n if (bits >= inBits) return 'Excess padding'\n if ((value << (outBits - bits)) & maxV) return 'Non-zero padding'\n }\n\n return result\n}\n\nfunction toWordsUnsafe (bytes) {\n var res = convert(bytes, 8, 5, true)\n if (Array.isArray(res)) return res\n}\n\nfunction toWords (bytes) {\n var res = convert(bytes, 8, 5, true)\n if (Array.isArray(res)) return res\n\n throw new Error(res)\n}\n\nfunction fromWordsUnsafe (words) {\n var res = convert(words, 5, 8, false)\n if (Array.isArray(res)) return res\n}\n\nfunction fromWords (words) {\n var res = convert(words, 5, 8, false)\n if (Array.isArray(res)) return res\n\n throw new Error(res)\n}\n\nmodule.exports = {\n decodeUnsafe: decodeUnsafe,\n decode: decode,\n encode: encode,\n toWordsUnsafe: toWordsUnsafe,\n toWords: toWords,\n fromWordsUnsafe: fromWordsUnsafe,\n fromWords: fromWords\n}\n","'use strict';\nmodule.exports = function (a, b) {\n\tif (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n\t\tthrow new TypeError('Arguments must be Buffers');\n\t}\n\n\tif (a === b) {\n\t\treturn true;\n\t}\n\n\tif (typeof a.equals === 'function') {\n\t\treturn a.equals(b);\n\t}\n\n\tif (a.length !== b.length) {\n\t\treturn false;\n\t}\n\n\tfor (var i = 0; i < a.length; i++) {\n\t\tif (a[i] !== b[i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n};\n","'use strict'\nmodule.exports = require('./lib')(require('./lib/elliptic'))\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\n\n// Number.MAX_SAFE_INTEGER\nvar MAX_SAFE_INTEGER = 9007199254740991\n\nfunction checkUInt53 (n) {\n if (n < 0 || n > MAX_SAFE_INTEGER || n % 1 !== 0) throw new RangeError('value out of range')\n}\n\nfunction encode (number, buffer, offset) {\n checkUInt53(number)\n\n if (!buffer) buffer = Buffer.allocUnsafe(encodingLength(number))\n if (!Buffer.isBuffer(buffer)) throw new TypeError('buffer must be a Buffer instance')\n if (!offset) offset = 0\n\n // 8 bit\n if (number < 0xfd) {\n buffer.writeUInt8(number, offset)\n encode.bytes = 1\n\n // 16 bit\n } else if (number <= 0xffff) {\n buffer.writeUInt8(0xfd, offset)\n buffer.writeUInt16LE(number, offset + 1)\n encode.bytes = 3\n\n // 32 bit\n } else if (number <= 0xffffffff) {\n buffer.writeUInt8(0xfe, offset)\n buffer.writeUInt32LE(number, offset + 1)\n encode.bytes = 5\n\n // 64 bit\n } else {\n buffer.writeUInt8(0xff, offset)\n buffer.writeUInt32LE(number >>> 0, offset + 1)\n buffer.writeUInt32LE((number / 0x100000000) | 0, offset + 5)\n encode.bytes = 9\n }\n\n return buffer\n}\n\nfunction decode (buffer, offset) {\n if (!Buffer.isBuffer(buffer)) throw new TypeError('buffer must be a Buffer instance')\n if (!offset) offset = 0\n\n var first = buffer.readUInt8(offset)\n\n // 8 bit\n if (first < 0xfd) {\n decode.bytes = 1\n return first\n\n // 16 bit\n } else if (first === 0xfd) {\n decode.bytes = 3\n return buffer.readUInt16LE(offset + 1)\n\n // 32 bit\n } else if (first === 0xfe) {\n decode.bytes = 5\n return buffer.readUInt32LE(offset + 1)\n\n // 64 bit\n } else {\n decode.bytes = 9\n var lo = buffer.readUInt32LE(offset + 1)\n var hi = buffer.readUInt32LE(offset + 5)\n var number = hi * 0x0100000000 + lo\n checkUInt53(number)\n\n return number\n }\n}\n\nfunction encodingLength (number) {\n checkUInt53(number)\n\n return (\n number < 0xfd ? 1\n : number <= 0xffff ? 3\n : number <= 0xffffffff ? 5\n : 9\n )\n}\n\nmodule.exports = { encode: encode, decode: decode, encodingLength: encodingLength }\n","/**\n * ML-DSA: Module Lattice-based Digital Signature Algorithm from\n * [FIPS-204](https://csrc.nist.gov/pubs/fips/204/ipd). A.k.a. CRYSTALS-Dilithium.\n *\n * Has similar internals to ML-KEM, but their keys and params are different.\n * Check out [official site](https://www.pq-crystals.org/dilithium/index.shtml),\n * [repo](https://github.com/pq-crystals/dilithium).\n * @module\n */\n/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */\nimport { abool } from '@noble/curves/utils.js';\nimport { shake256 } from '@noble/hashes/sha3.js';\nimport { genCrystals, XOF128, XOF256 } from \"./_crystals.js\";\nimport { abytes, checkHash, cleanBytes, equalBytes, getMessage, getMessagePrehash, randomBytes, splitCoder, validateOpts, validateSigOpts, validateVerOpts, vecCoder, } from \"./utils.js\";\nfunction validateInternalOpts(opts) {\n validateOpts(opts);\n if (opts.externalMu !== undefined)\n abool(opts.externalMu, 'opts.externalMu');\n}\n// Constants\n// FIPS 204 fixes ML-DSA over R = Z[X]/(X^256 + 1), so every polynomial has 256 coefficients.\nconst N = 256;\n// 2**23 − 2**13 + 1, 23 bits: multiply will be 46. We have enough precision in JS to avoid bigints\nconst Q = 8380417;\n// FIPS 204 §2.5 / Table 1 fixes zeta = 1753 as the 512th root of unity used by ML-DSA's NTT.\nconst ROOT_OF_UNITY = 1753;\n// f = 256**−1 mod q, pow(256, -1, q) = 8347681 (python3)\nconst F = 8347681;\n// FIPS 204 Table 1 / §7.4 fixes d = 13 dropped low bits for Power2Round on t.\nconst D = 13;\n// FIPS 204 Table 1 fixes gamma2 to (q-1)/88 for ML-DSA-44 and (q-1)/32 for ML-DSA-65/87;\n// §7.4 then uses alpha = 2*gamma2 for Decompose / MakeHint / UseHint.\n// Dilithium is kinda parametrized over GAMMA2, but everything will break with any other value.\nconst GAMMA2_1 = Math.floor((Q - 1) / 88) | 0;\nconst GAMMA2_2 = Math.floor((Q - 1) / 32) | 0;\n/** Internal params for different versions of ML-DSA */\n// prettier-ignore\n/** Built-in ML-DSA parameter presets keyed by security categories `2/3/5`\n * for `ml_dsa44` / `ml_dsa65` / `ml_dsa87`.\n * This is only the Table 1 subset used directly here: `BETA = TAU * ETA` is derived later,\n * while `C_TILDE_BYTES`, `TR_BYTES`, `CRH_BYTES`, and `securityLevel` live in the preset wrappers.\n */\nexport const PARAMS = /* @__PURE__ */ (() => ({\n 2: { K: 4, L: 4, D, GAMMA1: 2 ** 17, GAMMA2: GAMMA2_1, TAU: 39, ETA: 2, OMEGA: 80 },\n 3: { K: 6, L: 5, D, GAMMA1: 2 ** 19, GAMMA2: GAMMA2_2, TAU: 49, ETA: 4, OMEGA: 55 },\n 5: { K: 8, L: 7, D, GAMMA1: 2 ** 19, GAMMA2: GAMMA2_2, TAU: 60, ETA: 2, OMEGA: 75 },\n}))();\nconst newPoly = (n) => new Int32Array(n);\n// Shared CRYSTALS helper in the ML-DSA branch: non-Kyber mode, 8-bit bit-reversal,\n// and Int32Array polys because ordinary-form coefficients can be negative / centered.\nconst crystals = /* @__PURE__ */ genCrystals({\n N,\n Q,\n F,\n ROOT_OF_UNITY,\n newPoly,\n isKyber: false,\n brvBits: 8,\n});\nconst id = (n) => n;\n// compress()/verify() must be compatible in both directions:\n// wrap the shared d-bit packer with the FIPS 204 SimpleBitPack / BitPack coefficient maps.\n// malformed-input rejection only happens through the optional verify hook.\nconst polyCoder = (d, compress = id, verify = id) => crystals.bitsCoder(d, {\n encode: (i) => compress(verify(i)),\n decode: (i) => verify(compress(i)),\n});\n// Mutates `a` in place; callers must pass same-length polynomials.\nconst polyAdd = (a, b) => {\n for (let i = 0; i < a.length; i++)\n a[i] = crystals.mod(a[i] + b[i]);\n return a;\n};\n// Mutates `a` in place; callers must pass same-length polynomials.\nconst polySub = (a, b) => {\n for (let i = 0; i < a.length; i++)\n a[i] = crystals.mod(a[i] - b[i]);\n return a;\n};\n// Mutates `p` in place and assumes it is a decoded `t1`-range polynomial.\nconst polyShiftl = (p) => {\n for (let i = 0; i < N; i++)\n p[i] <<= D;\n return p;\n};\nconst polyChknorm = (p, B) => {\n // FIPS 204 Algorithms 7 and 8 express the same centered-norm check with explicit inequalities.\n for (let i = 0; i < N; i++)\n if (Math.abs(crystals.smod(p[i])) >= B)\n return true;\n return false;\n};\n// Both inputs must already be in NTT / `T_q` form.\nconst MultiplyNTTs = (a, b) => {\n // NOTE: we don't use montgomery reduction in code, since it requires 64 bit ints,\n // which is not available in JS. mod(a[i] * b[i]) is ok, since Q is 23 bit,\n // which means a[i] * b[i] is 46 bit, which is safe to use in JS. (number is 53 bits).\n // Barrett reduction is slower than mod :(\n const c = newPoly(N);\n for (let i = 0; i < a.length; i++)\n c[i] = crystals.mod(a[i] * b[i]);\n return c;\n};\n// Return poly in NTT representation\nfunction RejNTTPoly(xof) {\n // Samples a polynomial ∈ Tq. xof() must return byte lengths divisible by 3.\n const r = newPoly(N);\n // NOTE: we can represent 3xu24 as 4xu32, but it doesn't improve perf :(\n for (let j = 0; j < N;) {\n const b = xof();\n if (b.length % 3)\n throw new Error('RejNTTPoly: unaligned block');\n for (let i = 0; j < N && i <= b.length - 3; i += 3) {\n // FIPS 204 Algorithm 14 clears the top bit of b2 before forming the 23-bit candidate.\n const t = (b[i + 0] | (b[i + 1] << 8) | (b[i + 2] << 16)) & 0x7fffff; // 3 bytes\n if (t < Q)\n r[j++] = t;\n }\n }\n return r;\n}\n// Instantiate one ML-DSA parameter set from the Table 1 lattice constants plus the\n// Table 2 byte lengths / hash-width choices used by the public wrappers below.\nfunction getDilithium(opts) {\n const { K, L, GAMMA1, GAMMA2, TAU, ETA, OMEGA } = opts;\n const { CRH_BYTES, TR_BYTES, C_TILDE_BYTES, XOF128, XOF256, securityLevel } = opts;\n if (![2, 4].includes(ETA))\n throw new Error('Wrong ETA');\n if (![1 << 17, 1 << 19].includes(GAMMA1))\n throw new Error('Wrong GAMMA1');\n if (![GAMMA2_1, GAMMA2_2].includes(GAMMA2))\n throw new Error('Wrong GAMMA2');\n const BETA = TAU * ETA;\n const decompose = (r) => {\n // Decomposes r into (r1, r0) such that r ≡ r1(2γ2) + r0 mod q.\n const rPlus = crystals.mod(r);\n const r0 = crystals.smod(rPlus, 2 * GAMMA2) | 0;\n // FIPS 204 Algorithm 36 folds the top bucket `q-1` back to `(r1, r0) = (0, r0-1)`.\n if (rPlus - r0 === Q - 1)\n return { r1: 0 | 0, r0: (r0 - 1) | 0 };\n const r1 = Math.floor((rPlus - r0) / (2 * GAMMA2)) | 0;\n return { r1, r0 }; // r1 = HighBits, r0 = LowBits\n };\n const HighBits = (r) => decompose(r).r1;\n const LowBits = (r) => decompose(r).r0;\n const MakeHint = (z, r) => {\n // Compute hint bit indicating whether adding z to r alters the high bits of r.\n // FIPS 204 §6.2 also permits the Section 5.1 alternative from [6], which uses the\n // transformed low-bits/high-bits state at this call site instead of Algorithm 39 literally.\n // This optimized predicate only applies to those transformed Section 5.1 inputs; it is\n // not a drop-in replacement for Algorithm 39 on arbitrary `(z, r)` pairs.\n // From dilithium code\n const res0 = z <= GAMMA2 || z > Q - GAMMA2 || (z === Q - GAMMA2 && r === 0) ? 0 : 1;\n // from FIPS204:\n // // const r1 = HighBits(r);\n // // const v1 = HighBits(r + z);\n // // const res1 = +(r1 !== v1);\n // But they return different results! However, decompose is same.\n // So, either there is a bug in Dilithium ref implementation or in FIPS204.\n // For now, lets use dilithium one, so test vectors can be passed.\n // The round-3 Dilithium / ML-DSA code uses the same low-bits / high-bits convention after\n // `r0 += ct0`.\n // See dilithium-py README section \"Optimising decomposition and making hints\".\n return res0;\n };\n const UseHint = (h, r) => {\n // Returns the high bits of r adjusted according to hint h\n const m = Math.floor((Q - 1) / (2 * GAMMA2));\n const { r1, r0 } = decompose(r);\n // 3: if h = 1 and r0 > 0 return (r1 + 1) mod m\n // 4: if h = 1 and r0 ≤ 0 return (r1 − 1) mod m\n if (h === 1)\n return r0 > 0 ? crystals.mod(r1 + 1, m) | 0 : crystals.mod(r1 - 1, m) | 0;\n return r1 | 0;\n };\n const Power2Round = (r) => {\n // Decomposes r into (r1, r0) such that r ≡ r1*(2**d) + r0 mod q.\n const rPlus = crystals.mod(r);\n const r0 = crystals.smod(rPlus, 2 ** D) | 0;\n return { r1: Math.floor((rPlus - r0) / 2 ** D) | 0, r0 };\n };\n const hintCoder = {\n bytesLen: OMEGA + K,\n encode: (h) => {\n if (h === false)\n throw new Error('hint.encode: hint is false'); // should never happen\n const res = new Uint8Array(OMEGA + K);\n for (let i = 0, k = 0; i < K; i++) {\n for (let j = 0; j < N; j++)\n if (h[i][j] !== 0)\n res[k++] = j;\n res[OMEGA + i] = k;\n }\n return res;\n },\n decode: (buf) => {\n const h = [];\n let k = 0;\n for (let i = 0; i < K; i++) {\n const hi = newPoly(N);\n if (buf[OMEGA + i] < k || buf[OMEGA + i] > OMEGA)\n return false;\n for (let j = k; j < buf[OMEGA + i]; j++) {\n if (j > k && buf[j] <= buf[j - 1])\n return false;\n hi[buf[j]] = 1;\n }\n k = buf[OMEGA + i];\n h.push(hi);\n }\n for (let j = k; j < OMEGA; j++)\n if (buf[j] !== 0)\n return false;\n return h;\n },\n };\n const ETACoder = polyCoder(ETA === 2 ? 3 : 4, (i) => ETA - i, (i) => {\n if (!(-ETA <= i && i <= ETA))\n throw new Error(`malformed key s1/s3 ${i} outside of ETA range [${-ETA}, ${ETA}]`);\n return i;\n });\n const T0Coder = polyCoder(13, (i) => (1 << (D - 1)) - i);\n const T1Coder = polyCoder(10);\n // Requires smod. Need to fix!\n const ZCoder = polyCoder(GAMMA1 === 1 << 17 ? 18 : 20, (i) => crystals.smod(GAMMA1 - i));\n const W1Coder = polyCoder(GAMMA2 === GAMMA2_1 ? 6 : 4);\n const W1Vec = vecCoder(W1Coder, K);\n // Main structures\n const publicCoder = splitCoder('publicKey', 32, vecCoder(T1Coder, K));\n const secretCoder = splitCoder('secretKey', 32, 32, TR_BYTES, vecCoder(ETACoder, L), vecCoder(ETACoder, K), vecCoder(T0Coder, K));\n const sigCoder = splitCoder('signature', C_TILDE_BYTES, vecCoder(ZCoder, L), hintCoder);\n const CoefFromHalfByte = ETA === 2\n ? (n) => (n < 15 ? 2 - (n % 5) : false)\n : (n) => (n < 9 ? 4 - n : false);\n // Return poly in ordinary representation.\n // This helper returns ordinary-form `[-ETA, ETA]` coefficients for ExpandS; callers apply\n // `NTT.encode()` later when needed.\n function RejBoundedPoly(xof) {\n // Samples an element a ∈ Rq with coeffcients in [−η, η] computed via rejection sampling from ρ.\n const r = newPoly(N);\n for (let j = 0; j < N;) {\n const b = xof();\n for (let i = 0; j < N && i < b.length; i += 1) {\n // half byte. Should be superfast with vector instructions. But very slow with js :(\n const d1 = CoefFromHalfByte(b[i] & 0x0f);\n const d2 = CoefFromHalfByte((b[i] >> 4) & 0x0f);\n if (d1 !== false)\n r[j++] = d1;\n if (j < N && d2 !== false)\n r[j++] = d2;\n }\n }\n return r;\n }\n const SampleInBall = (seed) => {\n // Samples a polynomial c ∈ Rq with coeffcients from {−1, 0, 1} and Hamming weight τ\n const pre = newPoly(N);\n const s = shake256.create({}).update(seed);\n const buf = new Uint8Array(shake256.blockLen);\n s.xofInto(buf);\n // FIPS 204 Algorithm 29 uses the first 8 squeezed bytes as the 64 sign bits `h`,\n // then rejection-samples coefficient positions from the remaining XOF stream.\n const masks = buf.slice(0, 8);\n for (let i = N - TAU, pos = 8, maskPos = 0, maskBit = 0; i < N; i++) {\n let b = i + 1;\n for (; b > i;) {\n b = buf[pos++];\n if (pos < shake256.blockLen)\n continue;\n s.xofInto(buf);\n pos = 0;\n }\n pre[i] = pre[b];\n pre[b] = 1 - (((masks[maskPos] >> maskBit++) & 1) << 1);\n if (maskBit >= 8) {\n maskPos++;\n maskBit = 0;\n }\n }\n return pre;\n };\n const polyPowerRound = (p) => {\n const res0 = newPoly(N);\n const res1 = newPoly(N);\n for (let i = 0; i < p.length; i++) {\n const { r0, r1 } = Power2Round(p[i]);\n res0[i] = r0;\n res1[i] = r1;\n }\n return { r0: res0, r1: res1 };\n };\n const polyUseHint = (u, h) => {\n // In-place on `u`: verification only needs the recovered high bits, so reuse the\n // temporary `wApprox` buffer instead of allocating another polynomial.\n for (let i = 0; i < N; i++)\n u[i] = UseHint(h[i], u[i]);\n return u;\n };\n const polyMakeHint = (a, b) => {\n const v = newPoly(N);\n let cnt = 0;\n for (let i = 0; i < N; i++) {\n const h = MakeHint(a[i], b[i]);\n v[i] = h;\n cnt += h;\n }\n return { v, cnt };\n };\n const signRandBytes = 32;\n const seedCoder = splitCoder('seed', 32, 64, 32);\n // API & argument positions are exactly as in FIPS204.\n const internal = {\n info: { type: 'internal-ml-dsa' },\n lengths: {\n secretKey: secretCoder.bytesLen,\n publicKey: publicCoder.bytesLen,\n seed: 32,\n signature: sigCoder.bytesLen,\n signRand: signRandBytes,\n },\n keygen: (seed) => {\n // H(𝜉||IntegerToBytes(𝑘, 1)||IntegerToBytes(ℓ, 1), 128) 2: ▷ expand seed\n const seedDst = new Uint8Array(32 + 2);\n const randSeed = seed === undefined;\n if (randSeed)\n seed = randomBytes(32);\n abytes(seed, 32, 'seed');\n seedDst.set(seed);\n if (randSeed)\n cleanBytes(seed);\n seedDst[32] = K;\n seedDst[33] = L;\n const [rho, rhoPrime, K_] = seedCoder.decode(shake256(seedDst, { dkLen: seedCoder.bytesLen }));\n const xofPrime = XOF256(rhoPrime);\n const s1 = [];\n for (let i = 0; i < L; i++)\n s1.push(RejBoundedPoly(xofPrime.get(i & 0xff, (i >> 8) & 0xff)));\n const s2 = [];\n for (let i = L; i < L + K; i++)\n s2.push(RejBoundedPoly(xofPrime.get(i & 0xff, (i >> 8) & 0xff)));\n const s1Hat = s1.map((i) => crystals.NTT.encode(i.slice()));\n const t0 = [];\n const t1 = [];\n const xof = XOF128(rho);\n const t = newPoly(N);\n for (let i = 0; i < K; i++) {\n // t ← NTT−1(A*NTT(s1)) + s2\n cleanBytes(t); // don't-reallocate\n for (let j = 0; j < L; j++) {\n const aij = RejNTTPoly(xof.get(j, i)); // super slow!\n polyAdd(t, MultiplyNTTs(aij, s1Hat[j]));\n }\n crystals.NTT.decode(t);\n const { r0, r1 } = polyPowerRound(polyAdd(t, s2[i])); // (t1, t0) ← Power2Round(t, d)\n t0.push(r0);\n t1.push(r1);\n }\n const publicKey = publicCoder.encode([rho, t1]); // pk ← pkEncode(ρ, t1)\n const tr = shake256(publicKey, { dkLen: TR_BYTES }); // tr ← H(BytesToBits(pk), 512)\n // sk ← skEncode(ρ, K,tr, s1, s2, t0)\n const secretKey = secretCoder.encode([rho, K_, tr, s1, s2, t0]);\n xof.clean();\n xofPrime.clean();\n // STATS\n // Kyber512: { calls: 4, xofs: 12 }, Kyber768: { calls: 9, xofs: 27 },\n // Kyber1024: { calls: 16, xofs: 48 }\n // DSA44: { calls: 24, xofs: 24 }, DSA65: { calls: 41, xofs: 41 },\n // DSA87: { calls: 71, xofs: 71 }\n cleanBytes(rho, rhoPrime, K_, s1, s2, s1Hat, t, t0, t1, tr, seedDst);\n return { publicKey, secretKey };\n },\n getPublicKey: (secretKey) => {\n // (ρ, K,tr, s1, s2, t0) ← skDecode(sk)\n const [rho, _K, _tr, s1, s2, _t0] = secretCoder.decode(secretKey);\n const xof = XOF128(rho);\n const s1Hat = s1.map((p) => crystals.NTT.encode(p.slice()));\n const t1 = [];\n const tmp = newPoly(N);\n for (let i = 0; i < K; i++) {\n tmp.fill(0);\n for (let j = 0; j < L; j++) {\n const aij = RejNTTPoly(xof.get(j, i)); // A_ij in NTT\n polyAdd(tmp, MultiplyNTTs(aij, s1Hat[j])); // += A_ij * s1_j\n }\n crystals.NTT.decode(tmp); // NTT⁻¹\n polyAdd(tmp, s2[i]); // t_i = A·s1 + s2\n const { r1 } = polyPowerRound(tmp); // r1 = t1, r0 ≈ t0\n t1.push(r1);\n }\n xof.clean();\n cleanBytes(tmp, s1Hat, _t0, s1, s2);\n return publicCoder.encode([rho, t1]);\n },\n // NOTE: random is optional.\n sign: (msg, secretKey, opts = {}) => {\n validateSigOpts(opts);\n validateInternalOpts(opts);\n let { extraEntropy: random, externalMu = false } = opts;\n // This part can be pre-cached per secretKey, but there is only minor performance improvement,\n // since we re-use a lot of variables to computation.\n // (ρ, K,tr, s1, s2, t0) ← skDecode(sk)\n const [rho, _K, tr, s1, s2, t0] = secretCoder.decode(secretKey);\n // Cache matrix to avoid re-compute later\n const A = []; // A ← ExpandA(ρ)\n const xof = XOF128(rho);\n for (let i = 0; i < K; i++) {\n const pv = [];\n for (let j = 0; j < L; j++)\n pv.push(RejNTTPoly(xof.get(j, i)));\n A.push(pv);\n }\n xof.clean();\n for (let i = 0; i < L; i++)\n crystals.NTT.encode(s1[i]); // sˆ1 ← NTT(s1)\n for (let i = 0; i < K; i++) {\n crystals.NTT.encode(s2[i]); // sˆ2 ← NTT(s2)\n crystals.NTT.encode(t0[i]); // tˆ0 ← NTT(t0)\n }\n // This part is per msg\n const mu = externalMu\n ? msg\n : // 6: µ ← H(tr||M, 512)\n // ▷ Compute message representative µ\n shake256.create({ dkLen: CRH_BYTES }).update(tr).update(msg).digest();\n // Compute private random seed\n const rnd = random === false\n ? new Uint8Array(32)\n : random === undefined\n ? randomBytes(signRandBytes)\n : random;\n abytes(rnd, 32, 'extraEntropy');\n const rhoprime = shake256\n .create({ dkLen: CRH_BYTES })\n .update(_K)\n .update(rnd)\n .update(mu)\n .digest(); // ρ′← H(K||rnd||µ, 512)\n abytes(rhoprime, CRH_BYTES);\n const x256 = XOF256(rhoprime, ZCoder.bytesLen);\n // Rejection sampling loop\n main_loop: for (let kappa = 0;;) {\n const y = [];\n // y ← ExpandMask(ρ , κ)\n for (let i = 0; i < L; i++, kappa++)\n y.push(ZCoder.decode(x256.get(kappa & 0xff, kappa >> 8)()));\n const z = y.map((i) => crystals.NTT.encode(i.slice()));\n const w = [];\n for (let i = 0; i < K; i++) {\n // w ← NTT−1(A ◦ NTT(y))\n const wi = newPoly(N);\n for (let j = 0; j < L; j++)\n polyAdd(wi, MultiplyNTTs(A[i][j], z[j]));\n crystals.NTT.decode(wi);\n w.push(wi);\n }\n const w1 = w.map((j) => j.map(HighBits)); // w1 ← HighBits(w)\n // Commitment hash: c˜ ∈{0, 1 2λ } ← H(µ||w1Encode(w1), 2λ)\n const cTilde = shake256\n .create({ dkLen: C_TILDE_BYTES })\n .update(mu)\n .update(W1Vec.encode(w1))\n .digest();\n // Verifer’s challenge\n // c ← SampleInBall(c˜1); cˆ ← NTT(c)\n const cHat = crystals.NTT.encode(SampleInBall(cTilde));\n // ⟨⟨cs1⟩⟩ ← NTT−1(cˆ◦ sˆ1)\n const cs1 = s1.map((i) => MultiplyNTTs(i, cHat));\n for (let i = 0; i < L; i++) {\n polyAdd(crystals.NTT.decode(cs1[i]), y[i]); // z ← y + ⟨⟨cs1⟩⟩\n if (polyChknorm(cs1[i], GAMMA1 - BETA))\n continue main_loop; // ||z||∞ ≥ γ1 − β\n }\n // cs1 is now z (▷ Signer’s response)\n let cnt = 0;\n const h = [];\n for (let i = 0; i < K; i++) {\n const cs2 = crystals.NTT.decode(MultiplyNTTs(s2[i], cHat)); // ⟨⟨cs2⟩⟩ ← NTT−1(cˆ◦ sˆ2)\n const r0 = polySub(w[i], cs2).map(LowBits); // r0 ← LowBits(w − ⟨⟨cs2⟩⟩)\n if (polyChknorm(r0, GAMMA2 - BETA))\n continue main_loop; // ||r0||∞ ≥ γ2 − β\n const ct0 = crystals.NTT.decode(MultiplyNTTs(t0[i], cHat)); // ⟨⟨ct0⟩⟩ ← NTT−1(cˆ◦ tˆ0)\n if (polyChknorm(ct0, GAMMA2))\n continue main_loop;\n polyAdd(r0, ct0);\n // ▷ Signer’s hint\n const hint = polyMakeHint(r0, w1[i]); // h ← MakeHint(−⟨⟨ct0⟩⟩, w− ⟨⟨cs2⟩⟩ + ⟨⟨ct0⟩⟩)\n h.push(hint.v);\n cnt += hint.cnt;\n }\n if (cnt > OMEGA)\n continue; // the number of 1’s in h is greater than ω\n x256.clean();\n const res = sigCoder.encode([cTilde, cs1, h]); // σ ← sigEncode(c˜, z mod±q, h)\n // rho, _K, tr is subarray of secretKey, cannot clean.\n cleanBytes(cTilde, cs1, h, cHat, w1, w, z, y, rhoprime, s1, s2, t0, ...A);\n // `externalMu` hands ownership of `mu` to the caller,\n // so only wipe the internally derived digest form here;\n // zeroizing caller memory would break the caller's own reuse / verify path.\n if (!externalMu)\n cleanBytes(mu);\n return res;\n }\n // @ts-ignore\n throw new Error('Unreachable code path reached, report this error');\n },\n verify: (sig, msg, publicKey, opts = {}) => {\n validateInternalOpts(opts);\n const { externalMu = false } = opts;\n // ML-DSA.Verify(pk, M, σ): Verifes a signature σ for a message M.\n const [rho, t1] = publicCoder.decode(publicKey); // (ρ, t1) ← pkDecode(pk)\n const tr = shake256(publicKey, { dkLen: TR_BYTES }); // 6: tr ← H(BytesToBits(pk), 512)\n if (sig.length !== sigCoder.bytesLen)\n return false; // return false instead of exception\n // (c˜, z, h) ← sigDecode(σ)\n // ▷ Signer’s commitment hash c ˜, response z and hint\n const [cTilde, z, h] = sigCoder.decode(sig);\n if (h === false)\n return false; // if h = ⊥ then return false\n for (let i = 0; i < L; i++)\n if (polyChknorm(z[i], GAMMA1 - BETA))\n return false;\n const mu = externalMu\n ? msg\n : // 7: µ ← H(tr||M, 512)\n shake256.create({ dkLen: CRH_BYTES }).update(tr).update(msg).digest();\n // Compute verifer’s challenge from c˜\n const c = crystals.NTT.encode(SampleInBall(cTilde)); // c ← SampleInBall(c˜1)\n const zNtt = z.map((i) => i.slice()); // zNtt = NTT(z)\n for (let i = 0; i < L; i++)\n crystals.NTT.encode(zNtt[i]);\n const wTick1 = [];\n const xof = XOF128(rho);\n for (let i = 0; i < K; i++) {\n const ct12d = MultiplyNTTs(crystals.NTT.encode(polyShiftl(t1[i])), c); //c * t1 * (2**d)\n const Az = newPoly(N); // // A * z\n for (let j = 0; j < L; j++) {\n const aij = RejNTTPoly(xof.get(j, i)); // A[i][j] inplace\n polyAdd(Az, MultiplyNTTs(aij, zNtt[j]));\n }\n // wApprox = A*z - c*t1 * (2**d)\n const wApprox = crystals.NTT.decode(polySub(Az, ct12d));\n // Reconstruction of signer’s commitment\n wTick1.push(polyUseHint(wApprox, h[i])); // w ′ ← UseHint(h, w'approx )\n }\n xof.clean();\n // c˜′← H (µ||w1Encode(w′1), 2λ), Hash it; this should match c˜\n const c2 = shake256\n .create({ dkLen: C_TILDE_BYTES })\n .update(mu)\n .update(W1Vec.encode(wTick1))\n .digest();\n // Additional checks in FIPS-204:\n // [[ ||z||∞ < γ1 − β ]] and [[c ˜ = c˜′]] and [[number of 1’s in h is ≤ ω]]\n for (const t of h) {\n const sum = t.reduce((acc, i) => acc + i, 0);\n if (!(sum <= OMEGA))\n return false;\n }\n for (const t of z)\n if (polyChknorm(t, GAMMA1 - BETA))\n return false;\n return equalBytes(cTilde, c2);\n },\n };\n return {\n info: { type: 'ml-dsa' },\n internal,\n securityLevel: securityLevel,\n keygen: internal.keygen,\n lengths: internal.lengths,\n getPublicKey: internal.getPublicKey,\n sign: (msg, secretKey, opts = {}) => {\n validateSigOpts(opts);\n const M = getMessage(msg, opts.context);\n const res = internal.sign(M, secretKey, opts);\n cleanBytes(M);\n return res;\n },\n verify: (sig, msg, publicKey, opts = {}) => {\n validateVerOpts(opts);\n return internal.verify(sig, getMessage(msg, opts.context), publicKey);\n },\n prehash: (hash) => {\n checkHash(hash, securityLevel);\n return {\n info: { type: 'hashml-dsa' },\n securityLevel: securityLevel,\n lengths: internal.lengths,\n keygen: internal.keygen,\n getPublicKey: internal.getPublicKey,\n sign: (msg, secretKey, opts = {}) => {\n validateSigOpts(opts);\n const M = getMessagePrehash(hash, msg, opts.context);\n const res = internal.sign(M, secretKey, opts);\n cleanBytes(M);\n return res;\n },\n verify: (sig, msg, publicKey, opts = {}) => {\n validateVerOpts(opts);\n return internal.verify(sig, getMessagePrehash(hash, msg, opts.context), publicKey);\n },\n };\n },\n };\n}\n/** ML-DSA-44 for 128-bit security level. Not recommended after 2030, as per ASD. */\nexport const ml_dsa44 = /* @__PURE__ */ (() => getDilithium({\n ...PARAMS[2],\n CRH_BYTES: 64,\n TR_BYTES: 64,\n C_TILDE_BYTES: 32,\n XOF128,\n XOF256,\n securityLevel: 128,\n}))();\n/** ML-DSA-65 for 192-bit security level. Not recommended after 2030, as per ASD. */\nexport const ml_dsa65 = /* @__PURE__ */ (() => getDilithium({\n ...PARAMS[3],\n CRH_BYTES: 64,\n TR_BYTES: 64,\n C_TILDE_BYTES: 48,\n XOF128,\n XOF256,\n securityLevel: 192,\n}))();\n/** ML-DSA-87 for 256-bit security level. OK after 2030, as per ASD. */\nexport const ml_dsa87 = /* @__PURE__ */ (() => getDilithium({\n ...PARAMS[5],\n CRH_BYTES: 64,\n TR_BYTES: 64,\n C_TILDE_BYTES: 64,\n XOF128,\n XOF256,\n securityLevel: 256,\n}))();\n//# sourceMappingURL=ml-dsa.js.map","/**\n * ML-DSA: Module Lattice-based Digital Signature Algorithm from\n * [FIPS-204](https://csrc.nist.gov/pubs/fips/204/ipd). A.k.a. CRYSTALS-Dilithium.\n *\n * Has similar internals to ML-KEM, but their keys and params are different.\n * Check out [official site](https://www.pq-crystals.org/dilithium/index.shtml),\n * [repo](https://github.com/pq-crystals/dilithium).\n * @module\n */\n/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */\nimport { abool } from '@noble/curves/utils.js';\nimport { shake256 } from '@noble/hashes/sha3.js';\nimport type { CHash } from '@noble/hashes/utils.js';\nimport { genCrystals, type XOF, XOF128, XOF256 } from './_crystals.ts';\nimport {\n abytes,\n type BytesCoderLen,\n checkHash,\n cleanBytes,\n type CryptoKeys,\n equalBytes,\n getMessage,\n getMessagePrehash,\n randomBytes,\n type Signer,\n type SigOpts,\n splitCoder,\n validateOpts,\n validateSigOpts,\n validateVerOpts,\n vecCoder,\n type VerOpts,\n} from './utils.ts';\n\n/** Internal ML-DSA options. */\nexport type DSAInternalOpts = {\n /**\n * Whether `internal.sign` / `internal.verify` receive a caller-supplied 64-byte `mu`\n * instead of the usual FIPS 204 formatted message `M'` / prehash-formatted message.\n * validateInternalOpts() only checks this flag; callers still must supply the right input length.\n */\n externalMu?: boolean;\n};\nfunction validateInternalOpts(opts: DSAInternalOpts) {\n validateOpts(opts);\n if (opts.externalMu !== undefined) abool(opts.externalMu, 'opts.externalMu');\n}\n\n/** ML-DSA signer surface with access to the internal message formatting mode. */\nexport type DSAInternal = CryptoKeys & {\n lengths: Signer['lengths'];\n sign: (msg: Uint8Array, secretKey: Uint8Array, opts?: SigOpts & DSAInternalOpts) => Uint8Array;\n verify: (\n sig: Uint8Array,\n msg: Uint8Array,\n pubKey: Uint8Array,\n opts?: VerOpts & DSAInternalOpts\n ) => boolean;\n};\n/** Public ML-DSA signer surface. */\nexport type DSA = Signer & { internal: DSAInternal };\n\n// Constants\n// FIPS 204 fixes ML-DSA over R = Z[X]/(X^256 + 1), so every polynomial has 256 coefficients.\nconst N = 256;\n// 2**23 − 2**13 + 1, 23 bits: multiply will be 46. We have enough precision in JS to avoid bigints\nconst Q = 8380417;\n// FIPS 204 §2.5 / Table 1 fixes zeta = 1753 as the 512th root of unity used by ML-DSA's NTT.\nconst ROOT_OF_UNITY = 1753;\n// f = 256**−1 mod q, pow(256, -1, q) = 8347681 (python3)\nconst F = 8347681;\n// FIPS 204 Table 1 / §7.4 fixes d = 13 dropped low bits for Power2Round on t.\nconst D = 13;\n// FIPS 204 Table 1 fixes gamma2 to (q-1)/88 for ML-DSA-44 and (q-1)/32 for ML-DSA-65/87;\n// §7.4 then uses alpha = 2*gamma2 for Decompose / MakeHint / UseHint.\n// Dilithium is kinda parametrized over GAMMA2, but everything will break with any other value.\nconst GAMMA2_1 = Math.floor((Q - 1) / 88) | 0;\nconst GAMMA2_2 = Math.floor((Q - 1) / 32) | 0;\n\ntype XofGet = ReturnType<ReturnType<XOF>['get']>;\n\n/** Various lattice params. */\n/** Public ML-DSA parameter-set description. */\nexport type DSAParam = {\n /** Matrix row count. */\n K: number;\n /** Matrix column count. */\n L: number;\n /** Bit width used when rounding `t`. */\n D: number;\n /** Bound used for the `y` sampling range. */\n GAMMA1: number;\n /** Bound used during decomposition and hints. */\n GAMMA2: number;\n /** Number of non-zero challenge coefficients. */\n TAU: number;\n /** Centered-binomial noise parameter. */\n ETA: number;\n /** Maximum number of hint bits in a signature. */\n OMEGA: number;\n};\n/** Internal params for different versions of ML-DSA */\n// prettier-ignore\n/** Built-in ML-DSA parameter presets keyed by security categories `2/3/5`\n * for `ml_dsa44` / `ml_dsa65` / `ml_dsa87`.\n * This is only the Table 1 subset used directly here: `BETA = TAU * ETA` is derived later,\n * while `C_TILDE_BYTES`, `TR_BYTES`, `CRH_BYTES`, and `securityLevel` live in the preset wrappers.\n */\nexport const PARAMS: Record<string, DSAParam> = /* @__PURE__ */ (() => ({\n 2: { K: 4, L: 4, D, GAMMA1: 2 ** 17, GAMMA2: GAMMA2_1, TAU: 39, ETA: 2, OMEGA: 80 },\n 3: { K: 6, L: 5, D, GAMMA1: 2 ** 19, GAMMA2: GAMMA2_2, TAU: 49, ETA: 4, OMEGA: 55 },\n 5: { K: 8, L: 7, D, GAMMA1: 2 ** 19, GAMMA2: GAMMA2_2, TAU: 60, ETA: 2, OMEGA: 75 },\n} as const))();\n\n// NOTE: there is a lot cases where negative numbers used (with smod instead of mod).\ntype Poly = Int32Array;\nconst newPoly = (n: number): Int32Array => new Int32Array(n);\n\n// Shared CRYSTALS helper in the ML-DSA branch: non-Kyber mode, 8-bit bit-reversal,\n// and Int32Array polys because ordinary-form coefficients can be negative / centered.\nconst crystals = /* @__PURE__ */ genCrystals({\n N,\n Q,\n F,\n ROOT_OF_UNITY,\n newPoly,\n isKyber: false,\n brvBits: 8,\n});\n\nconst id = <T>(n: T): T => n;\ntype IdNum = (n: number) => number;\n\n// compress()/verify() must be compatible in both directions:\n// wrap the shared d-bit packer with the FIPS 204 SimpleBitPack / BitPack coefficient maps.\n// malformed-input rejection only happens through the optional verify hook.\nconst polyCoder = (d: number, compress: IdNum = id, verify: IdNum = id) =>\n crystals.bitsCoder(d, {\n encode: (i: number) => compress(verify(i)),\n decode: (i: number) => verify(compress(i)),\n });\n\n// Mutates `a` in place; callers must pass same-length polynomials.\nconst polyAdd = (a: Poly, b: Poly) => {\n for (let i = 0; i < a.length; i++) a[i] = crystals.mod(a[i] + b[i]);\n return a;\n};\n// Mutates `a` in place; callers must pass same-length polynomials.\nconst polySub = (a: Poly, b: Poly): Poly => {\n for (let i = 0; i < a.length; i++) a[i] = crystals.mod(a[i] - b[i]);\n return a;\n};\n\n// Mutates `p` in place and assumes it is a decoded `t1`-range polynomial.\nconst polyShiftl = (p: Poly): Poly => {\n for (let i = 0; i < N; i++) p[i] <<= D;\n return p;\n};\n\nconst polyChknorm = (p: Poly, B: number): boolean => {\n // FIPS 204 Algorithms 7 and 8 express the same centered-norm check with explicit inequalities.\n for (let i = 0; i < N; i++) if (Math.abs(crystals.smod(p[i])) >= B) return true;\n return false;\n};\n\n// Both inputs must already be in NTT / `T_q` form.\nconst MultiplyNTTs = (a: Poly, b: Poly): Poly => {\n // NOTE: we don't use montgomery reduction in code, since it requires 64 bit ints,\n // which is not available in JS. mod(a[i] * b[i]) is ok, since Q is 23 bit,\n // which means a[i] * b[i] is 46 bit, which is safe to use in JS. (number is 53 bits).\n // Barrett reduction is slower than mod :(\n const c = newPoly(N);\n for (let i = 0; i < a.length; i++) c[i] = crystals.mod(a[i] * b[i]);\n return c;\n};\n\n// Return poly in NTT representation\nfunction RejNTTPoly(xof: XofGet) {\n // Samples a polynomial ∈ Tq. xof() must return byte lengths divisible by 3.\n const r = newPoly(N);\n // NOTE: we can represent 3xu24 as 4xu32, but it doesn't improve perf :(\n for (let j = 0; j < N; ) {\n const b = xof();\n if (b.length % 3) throw new Error('RejNTTPoly: unaligned block');\n for (let i = 0; j < N && i <= b.length - 3; i += 3) {\n // FIPS 204 Algorithm 14 clears the top bit of b2 before forming the 23-bit candidate.\n const t = (b[i + 0] | (b[i + 1] << 8) | (b[i + 2] << 16)) & 0x7fffff; // 3 bytes\n if (t < Q) r[j++] = t;\n }\n }\n return r;\n}\n\ntype DilithiumOpts = {\n K: number;\n L: number;\n GAMMA1: number;\n GAMMA2: number;\n TAU: number;\n ETA: number;\n OMEGA: number;\n C_TILDE_BYTES: number;\n CRH_BYTES: number;\n TR_BYTES: number;\n XOF128: XOF;\n XOF256: XOF;\n securityLevel: number;\n};\n\n// Instantiate one ML-DSA parameter set from the Table 1 lattice constants plus the\n// Table 2 byte lengths / hash-width choices used by the public wrappers below.\nfunction getDilithium(opts: DilithiumOpts) {\n const { K, L, GAMMA1, GAMMA2, TAU, ETA, OMEGA } = opts;\n const { CRH_BYTES, TR_BYTES, C_TILDE_BYTES, XOF128, XOF256, securityLevel } = opts;\n\n if (![2, 4].includes(ETA)) throw new Error('Wrong ETA');\n if (![1 << 17, 1 << 19].includes(GAMMA1)) throw new Error('Wrong GAMMA1');\n if (![GAMMA2_1, GAMMA2_2].includes(GAMMA2)) throw new Error('Wrong GAMMA2');\n const BETA = TAU * ETA;\n\n const decompose = (r: number) => {\n // Decomposes r into (r1, r0) such that r ≡ r1(2γ2) + r0 mod q.\n const rPlus = crystals.mod(r);\n const r0 = crystals.smod(rPlus, 2 * GAMMA2) | 0;\n // FIPS 204 Algorithm 36 folds the top bucket `q-1` back to `(r1, r0) = (0, r0-1)`.\n if (rPlus - r0 === Q - 1) return { r1: 0 | 0, r0: (r0 - 1) | 0 };\n const r1 = Math.floor((rPlus - r0) / (2 * GAMMA2)) | 0;\n return { r1, r0 }; // r1 = HighBits, r0 = LowBits\n };\n\n const HighBits = (r: number) => decompose(r).r1;\n const LowBits = (r: number) => decompose(r).r0;\n const MakeHint = (z: number, r: number) => {\n // Compute hint bit indicating whether adding z to r alters the high bits of r.\n // FIPS 204 §6.2 also permits the Section 5.1 alternative from [6], which uses the\n // transformed low-bits/high-bits state at this call site instead of Algorithm 39 literally.\n // This optimized predicate only applies to those transformed Section 5.1 inputs; it is\n // not a drop-in replacement for Algorithm 39 on arbitrary `(z, r)` pairs.\n\n // From dilithium code\n const res0 = z <= GAMMA2 || z > Q - GAMMA2 || (z === Q - GAMMA2 && r === 0) ? 0 : 1;\n // from FIPS204:\n // // const r1 = HighBits(r);\n // // const v1 = HighBits(r + z);\n // // const res1 = +(r1 !== v1);\n // But they return different results! However, decompose is same.\n // So, either there is a bug in Dilithium ref implementation or in FIPS204.\n // For now, lets use dilithium one, so test vectors can be passed.\n // The round-3 Dilithium / ML-DSA code uses the same low-bits / high-bits convention after\n // `r0 += ct0`.\n // See dilithium-py README section \"Optimising decomposition and making hints\".\n return res0;\n };\n\n const UseHint = (h: number, r: number) => {\n // Returns the high bits of r adjusted according to hint h\n const m = Math.floor((Q - 1) / (2 * GAMMA2));\n const { r1, r0 } = decompose(r);\n // 3: if h = 1 and r0 > 0 return (r1 + 1) mod m\n // 4: if h = 1 and r0 ≤ 0 return (r1 − 1) mod m\n if (h === 1) return r0 > 0 ? crystals.mod(r1 + 1, m) | 0 : crystals.mod(r1 - 1, m) | 0;\n return r1 | 0;\n };\n const Power2Round = (r: number) => {\n // Decomposes r into (r1, r0) such that r ≡ r1*(2**d) + r0 mod q.\n const rPlus = crystals.mod(r);\n const r0 = crystals.smod(rPlus, 2 ** D) | 0;\n return { r1: Math.floor((rPlus - r0) / 2 ** D) | 0, r0 };\n };\n\n const hintCoder: BytesCoderLen<Poly[] | false> = {\n bytesLen: OMEGA + K,\n encode: (h: Poly[] | false) => {\n if (h === false) throw new Error('hint.encode: hint is false'); // should never happen\n const res = new Uint8Array(OMEGA + K);\n for (let i = 0, k = 0; i < K; i++) {\n for (let j = 0; j < N; j++) if (h[i][j] !== 0) res[k++] = j;\n res[OMEGA + i] = k;\n }\n return res;\n },\n decode: (buf: Uint8Array) => {\n const h = [];\n let k = 0;\n for (let i = 0; i < K; i++) {\n const hi = newPoly(N);\n if (buf[OMEGA + i] < k || buf[OMEGA + i] > OMEGA) return false;\n for (let j = k; j < buf[OMEGA + i]; j++) {\n if (j > k && buf[j] <= buf[j - 1]) return false;\n hi[buf[j]] = 1;\n }\n k = buf[OMEGA + i];\n h.push(hi);\n }\n for (let j = k; j < OMEGA; j++) if (buf[j] !== 0) return false;\n return h;\n },\n };\n\n const ETACoder = polyCoder(\n ETA === 2 ? 3 : 4,\n (i: number) => ETA - i,\n (i: number) => {\n if (!(-ETA <= i && i <= ETA))\n throw new Error(`malformed key s1/s3 ${i} outside of ETA range [${-ETA}, ${ETA}]`);\n return i;\n }\n );\n const T0Coder = polyCoder(13, (i: number) => (1 << (D - 1)) - i);\n const T1Coder = polyCoder(10);\n // Requires smod. Need to fix!\n const ZCoder = polyCoder(GAMMA1 === 1 << 17 ? 18 : 20, (i: number) => crystals.smod(GAMMA1 - i));\n const W1Coder = polyCoder(GAMMA2 === GAMMA2_1 ? 6 : 4);\n const W1Vec = vecCoder(W1Coder, K);\n // Main structures\n const publicCoder = splitCoder('publicKey', 32, vecCoder(T1Coder, K));\n const secretCoder = splitCoder(\n 'secretKey',\n 32,\n 32,\n TR_BYTES,\n vecCoder(ETACoder, L),\n vecCoder(ETACoder, K),\n vecCoder(T0Coder, K)\n );\n const sigCoder = splitCoder('signature', C_TILDE_BYTES, vecCoder(ZCoder, L), hintCoder);\n const CoefFromHalfByte =\n ETA === 2\n ? (n: number) => (n < 15 ? 2 - (n % 5) : false)\n : (n: number) => (n < 9 ? 4 - n : false);\n\n // Return poly in ordinary representation.\n // This helper returns ordinary-form `[-ETA, ETA]` coefficients for ExpandS; callers apply\n // `NTT.encode()` later when needed.\n function RejBoundedPoly(xof: XofGet) {\n // Samples an element a ∈ Rq with coeffcients in [−η, η] computed via rejection sampling from ρ.\n const r: Poly = newPoly(N);\n for (let j = 0; j < N; ) {\n const b = xof();\n for (let i = 0; j < N && i < b.length; i += 1) {\n // half byte. Should be superfast with vector instructions. But very slow with js :(\n const d1 = CoefFromHalfByte(b[i] & 0x0f);\n const d2 = CoefFromHalfByte((b[i] >> 4) & 0x0f);\n if (d1 !== false) r[j++] = d1;\n if (j < N && d2 !== false) r[j++] = d2;\n }\n }\n return r;\n }\n\n const SampleInBall = (seed: Uint8Array) => {\n // Samples a polynomial c ∈ Rq with coeffcients from {−1, 0, 1} and Hamming weight τ\n const pre = newPoly(N);\n const s = shake256.create({}).update(seed);\n const buf = new Uint8Array(shake256.blockLen);\n s.xofInto(buf);\n // FIPS 204 Algorithm 29 uses the first 8 squeezed bytes as the 64 sign bits `h`,\n // then rejection-samples coefficient positions from the remaining XOF stream.\n const masks = buf.slice(0, 8);\n for (let i = N - TAU, pos = 8, maskPos = 0, maskBit = 0; i < N; i++) {\n let b = i + 1;\n for (; b > i; ) {\n b = buf[pos++];\n if (pos < shake256.blockLen) continue;\n s.xofInto(buf);\n pos = 0;\n }\n pre[i] = pre[b];\n pre[b] = 1 - (((masks[maskPos] >> maskBit++) & 1) << 1);\n if (maskBit >= 8) {\n maskPos++;\n maskBit = 0;\n }\n }\n return pre;\n };\n\n const polyPowerRound = (p: Poly) => {\n const res0 = newPoly(N);\n const res1 = newPoly(N);\n for (let i = 0; i < p.length; i++) {\n const { r0, r1 } = Power2Round(p[i]);\n res0[i] = r0;\n res1[i] = r1;\n }\n return { r0: res0, r1: res1 };\n };\n const polyUseHint = (u: Poly, h: Poly): Poly => {\n // In-place on `u`: verification only needs the recovered high bits, so reuse the\n // temporary `wApprox` buffer instead of allocating another polynomial.\n for (let i = 0; i < N; i++) u[i] = UseHint(h[i], u[i]);\n return u;\n };\n const polyMakeHint = (a: Poly, b: Poly) => {\n const v = newPoly(N);\n let cnt = 0;\n for (let i = 0; i < N; i++) {\n const h = MakeHint(a[i], b[i]);\n v[i] = h;\n cnt += h;\n }\n return { v, cnt };\n };\n\n const signRandBytes = 32;\n const seedCoder = splitCoder('seed', 32, 64, 32);\n // API & argument positions are exactly as in FIPS204.\n const internal: DSAInternal = {\n info: { type: 'internal-ml-dsa' },\n lengths: {\n secretKey: secretCoder.bytesLen,\n publicKey: publicCoder.bytesLen,\n seed: 32,\n signature: sigCoder.bytesLen,\n signRand: signRandBytes,\n },\n keygen: (seed?: Uint8Array) => {\n // H(𝜉||IntegerToBytes(𝑘, 1)||IntegerToBytes(ℓ, 1), 128) 2: ▷ expand seed\n const seedDst = new Uint8Array(32 + 2);\n const randSeed = seed === undefined;\n if (randSeed) seed = randomBytes(32);\n abytes(seed!, 32, 'seed');\n seedDst.set(seed!);\n if (randSeed) cleanBytes(seed!);\n seedDst[32] = K;\n seedDst[33] = L;\n const [rho, rhoPrime, K_] = seedCoder.decode(\n shake256(seedDst, { dkLen: seedCoder.bytesLen })\n );\n const xofPrime = XOF256(rhoPrime);\n const s1 = [];\n for (let i = 0; i < L; i++) s1.push(RejBoundedPoly(xofPrime.get(i & 0xff, (i >> 8) & 0xff)));\n const s2 = [];\n for (let i = L; i < L + K; i++)\n s2.push(RejBoundedPoly(xofPrime.get(i & 0xff, (i >> 8) & 0xff)));\n const s1Hat = s1.map((i) => crystals.NTT.encode(i.slice()));\n const t0 = [];\n const t1 = [];\n const xof = XOF128(rho);\n const t = newPoly(N);\n for (let i = 0; i < K; i++) {\n // t ← NTT−1(A*NTT(s1)) + s2\n cleanBytes(t); // don't-reallocate\n for (let j = 0; j < L; j++) {\n const aij = RejNTTPoly(xof.get(j, i)); // super slow!\n polyAdd(t, MultiplyNTTs(aij, s1Hat[j]));\n }\n crystals.NTT.decode(t);\n const { r0, r1 } = polyPowerRound(polyAdd(t, s2[i])); // (t1, t0) ← Power2Round(t, d)\n t0.push(r0);\n t1.push(r1);\n }\n const publicKey = publicCoder.encode([rho, t1]); // pk ← pkEncode(ρ, t1)\n const tr = shake256(publicKey, { dkLen: TR_BYTES }); // tr ← H(BytesToBits(pk), 512)\n // sk ← skEncode(ρ, K,tr, s1, s2, t0)\n const secretKey = secretCoder.encode([rho, K_, tr, s1, s2, t0]);\n xof.clean();\n xofPrime.clean();\n // STATS\n // Kyber512: { calls: 4, xofs: 12 }, Kyber768: { calls: 9, xofs: 27 },\n // Kyber1024: { calls: 16, xofs: 48 }\n // DSA44: { calls: 24, xofs: 24 }, DSA65: { calls: 41, xofs: 41 },\n // DSA87: { calls: 71, xofs: 71 }\n cleanBytes(rho, rhoPrime, K_, s1, s2, s1Hat, t, t0, t1, tr, seedDst);\n return { publicKey, secretKey };\n },\n getPublicKey: (secretKey: Uint8Array) => {\n // (ρ, K,tr, s1, s2, t0) ← skDecode(sk)\n const [rho, _K, _tr, s1, s2, _t0] = secretCoder.decode(secretKey);\n const xof = XOF128(rho);\n const s1Hat = s1.map((p) => crystals.NTT.encode(p.slice()));\n const t1: Poly[] = [];\n const tmp = newPoly(N);\n for (let i = 0; i < K; i++) {\n tmp.fill(0);\n for (let j = 0; j < L; j++) {\n const aij = RejNTTPoly(xof.get(j, i)); // A_ij in NTT\n polyAdd(tmp, MultiplyNTTs(aij, s1Hat[j])); // += A_ij * s1_j\n }\n crystals.NTT.decode(tmp); // NTT⁻¹\n polyAdd(tmp, s2[i]); // t_i = A·s1 + s2\n const { r1 } = polyPowerRound(tmp); // r1 = t1, r0 ≈ t0\n t1.push(r1);\n }\n xof.clean();\n cleanBytes(tmp, s1Hat, _t0, s1, s2);\n return publicCoder.encode([rho, t1]);\n },\n // NOTE: random is optional.\n sign: (msg: Uint8Array, secretKey: Uint8Array, opts: SigOpts & DSAInternalOpts = {}) => {\n validateSigOpts(opts);\n validateInternalOpts(opts);\n let { extraEntropy: random, externalMu = false } = opts;\n // This part can be pre-cached per secretKey, but there is only minor performance improvement,\n // since we re-use a lot of variables to computation.\n // (ρ, K,tr, s1, s2, t0) ← skDecode(sk)\n const [rho, _K, tr, s1, s2, t0] = secretCoder.decode(secretKey);\n // Cache matrix to avoid re-compute later\n const A: Poly[][] = []; // A ← ExpandA(ρ)\n const xof = XOF128(rho);\n for (let i = 0; i < K; i++) {\n const pv = [];\n for (let j = 0; j < L; j++) pv.push(RejNTTPoly(xof.get(j, i)));\n A.push(pv);\n }\n xof.clean();\n for (let i = 0; i < L; i++) crystals.NTT.encode(s1[i]); // sˆ1 ← NTT(s1)\n for (let i = 0; i < K; i++) {\n crystals.NTT.encode(s2[i]); // sˆ2 ← NTT(s2)\n crystals.NTT.encode(t0[i]); // tˆ0 ← NTT(t0)\n }\n // This part is per msg\n const mu = externalMu\n ? msg\n : // 6: µ ← H(tr||M, 512)\n // ▷ Compute message representative µ\n shake256.create({ dkLen: CRH_BYTES }).update(tr).update(msg).digest();\n\n // Compute private random seed\n const rnd =\n random === false\n ? new Uint8Array(32)\n : random === undefined\n ? randomBytes(signRandBytes)\n : random;\n abytes(rnd, 32, 'extraEntropy');\n const rhoprime = shake256\n .create({ dkLen: CRH_BYTES })\n .update(_K)\n .update(rnd)\n .update(mu)\n .digest(); // ρ′← H(K||rnd||µ, 512)\n\n abytes(rhoprime, CRH_BYTES);\n const x256 = XOF256(rhoprime, ZCoder.bytesLen);\n // Rejection sampling loop\n main_loop: for (let kappa = 0; ; ) {\n const y = [];\n // y ← ExpandMask(ρ , κ)\n for (let i = 0; i < L; i++, kappa++)\n y.push(ZCoder.decode(x256.get(kappa & 0xff, kappa >> 8)()));\n const z = y.map((i) => crystals.NTT.encode(i.slice()));\n const w = [];\n for (let i = 0; i < K; i++) {\n // w ← NTT−1(A ◦ NTT(y))\n const wi = newPoly(N);\n for (let j = 0; j < L; j++) polyAdd(wi, MultiplyNTTs(A[i][j], z[j]));\n crystals.NTT.decode(wi);\n w.push(wi);\n }\n const w1 = w.map((j) => j.map(HighBits)); // w1 ← HighBits(w)\n // Commitment hash: c˜ ∈{0, 1 2λ } ← H(µ||w1Encode(w1), 2λ)\n const cTilde = shake256\n .create({ dkLen: C_TILDE_BYTES })\n .update(mu)\n .update(W1Vec.encode(w1))\n .digest();\n // Verifer’s challenge\n // c ← SampleInBall(c˜1); cˆ ← NTT(c)\n const cHat = crystals.NTT.encode(SampleInBall(cTilde));\n // ⟨⟨cs1⟩⟩ ← NTT−1(cˆ◦ sˆ1)\n const cs1 = s1.map((i) => MultiplyNTTs(i, cHat));\n for (let i = 0; i < L; i++) {\n polyAdd(crystals.NTT.decode(cs1[i]), y[i]); // z ← y + ⟨⟨cs1⟩⟩\n if (polyChknorm(cs1[i], GAMMA1 - BETA)) continue main_loop; // ||z||∞ ≥ γ1 − β\n }\n // cs1 is now z (▷ Signer’s response)\n let cnt = 0;\n const h = [];\n for (let i = 0; i < K; i++) {\n const cs2 = crystals.NTT.decode(MultiplyNTTs(s2[i], cHat)); // ⟨⟨cs2⟩⟩ ← NTT−1(cˆ◦ sˆ2)\n const r0 = polySub(w[i], cs2).map(LowBits); // r0 ← LowBits(w − ⟨⟨cs2⟩⟩)\n if (polyChknorm(r0, GAMMA2 - BETA)) continue main_loop; // ||r0||∞ ≥ γ2 − β\n const ct0 = crystals.NTT.decode(MultiplyNTTs(t0[i], cHat)); // ⟨⟨ct0⟩⟩ ← NTT−1(cˆ◦ tˆ0)\n if (polyChknorm(ct0, GAMMA2)) continue main_loop;\n polyAdd(r0, ct0);\n // ▷ Signer’s hint\n const hint = polyMakeHint(r0, w1[i]); // h ← MakeHint(−⟨⟨ct0⟩⟩, w− ⟨⟨cs2⟩⟩ + ⟨⟨ct0⟩⟩)\n h.push(hint.v);\n cnt += hint.cnt;\n }\n if (cnt > OMEGA) continue; // the number of 1’s in h is greater than ω\n x256.clean();\n const res = sigCoder.encode([cTilde, cs1, h]); // σ ← sigEncode(c˜, z mod±q, h)\n // rho, _K, tr is subarray of secretKey, cannot clean.\n cleanBytes(cTilde, cs1, h, cHat, w1, w, z, y, rhoprime, s1, s2, t0, ...A);\n // `externalMu` hands ownership of `mu` to the caller,\n // so only wipe the internally derived digest form here;\n // zeroizing caller memory would break the caller's own reuse / verify path.\n if (!externalMu) cleanBytes(mu);\n return res;\n }\n // @ts-ignore\n throw new Error('Unreachable code path reached, report this error');\n },\n verify: (\n sig: Uint8Array,\n msg: Uint8Array,\n publicKey: Uint8Array,\n opts: DSAInternalOpts = {}\n ) => {\n validateInternalOpts(opts);\n const { externalMu = false } = opts;\n // ML-DSA.Verify(pk, M, σ): Verifes a signature σ for a message M.\n const [rho, t1] = publicCoder.decode(publicKey); // (ρ, t1) ← pkDecode(pk)\n const tr = shake256(publicKey, { dkLen: TR_BYTES }); // 6: tr ← H(BytesToBits(pk), 512)\n\n if (sig.length !== sigCoder.bytesLen) return false; // return false instead of exception\n // (c˜, z, h) ← sigDecode(σ)\n // ▷ Signer’s commitment hash c ˜, response z and hint\n const [cTilde, z, h] = sigCoder.decode(sig);\n if (h === false) return false; // if h = ⊥ then return false\n for (let i = 0; i < L; i++) if (polyChknorm(z[i], GAMMA1 - BETA)) return false;\n const mu = externalMu\n ? msg\n : // 7: µ ← H(tr||M, 512)\n shake256.create({ dkLen: CRH_BYTES }).update(tr).update(msg).digest();\n // Compute verifer’s challenge from c˜\n const c = crystals.NTT.encode(SampleInBall(cTilde)); // c ← SampleInBall(c˜1)\n const zNtt = z.map((i) => i.slice()); // zNtt = NTT(z)\n for (let i = 0; i < L; i++) crystals.NTT.encode(zNtt[i]);\n const wTick1 = [];\n const xof = XOF128(rho);\n for (let i = 0; i < K; i++) {\n const ct12d = MultiplyNTTs(crystals.NTT.encode(polyShiftl(t1[i])), c); //c * t1 * (2**d)\n const Az = newPoly(N); // // A * z\n for (let j = 0; j < L; j++) {\n const aij = RejNTTPoly(xof.get(j, i)); // A[i][j] inplace\n polyAdd(Az, MultiplyNTTs(aij, zNtt[j]));\n }\n // wApprox = A*z - c*t1 * (2**d)\n const wApprox = crystals.NTT.decode(polySub(Az, ct12d));\n // Reconstruction of signer’s commitment\n wTick1.push(polyUseHint(wApprox, h[i])); // w ′ ← UseHint(h, w'approx )\n }\n xof.clean();\n // c˜′← H (µ||w1Encode(w′1), 2λ), Hash it; this should match c˜\n const c2 = shake256\n .create({ dkLen: C_TILDE_BYTES })\n .update(mu)\n .update(W1Vec.encode(wTick1))\n .digest();\n // Additional checks in FIPS-204:\n // [[ ||z||∞ < γ1 − β ]] and [[c ˜ = c˜′]] and [[number of 1’s in h is ≤ ω]]\n for (const t of h) {\n const sum = t.reduce((acc, i) => acc + i, 0);\n if (!(sum <= OMEGA)) return false;\n }\n for (const t of z) if (polyChknorm(t, GAMMA1 - BETA)) return false;\n return equalBytes(cTilde, c2);\n },\n };\n return {\n info: { type: 'ml-dsa' },\n internal,\n securityLevel: securityLevel,\n keygen: internal.keygen,\n lengths: internal.lengths,\n getPublicKey: internal.getPublicKey,\n sign: (msg: Uint8Array, secretKey: Uint8Array, opts: SigOpts = {}) => {\n validateSigOpts(opts);\n const M = getMessage(msg, opts.context);\n const res = internal.sign(M, secretKey, opts);\n cleanBytes(M);\n return res;\n },\n verify: (sig: Uint8Array, msg: Uint8Array, publicKey: Uint8Array, opts: VerOpts = {}) => {\n validateVerOpts(opts);\n return internal.verify(sig, getMessage(msg, opts.context), publicKey);\n },\n prehash: (hash: CHash) => {\n checkHash(hash, securityLevel);\n return {\n info: { type: 'hashml-dsa' },\n securityLevel: securityLevel,\n lengths: internal.lengths,\n keygen: internal.keygen,\n getPublicKey: internal.getPublicKey,\n sign: (msg: Uint8Array, secretKey: Uint8Array, opts: SigOpts = {}) => {\n validateSigOpts(opts);\n const M = getMessagePrehash(hash, msg, opts.context);\n const res = internal.sign(M, secretKey, opts);\n cleanBytes(M);\n return res;\n },\n verify: (sig: Uint8Array, msg: Uint8Array, publicKey: Uint8Array, opts: VerOpts = {}) => {\n validateVerOpts(opts);\n return internal.verify(sig, getMessagePrehash(hash, msg, opts.context), publicKey);\n },\n };\n },\n };\n}\n\n/** ML-DSA-44 for 128-bit security level. Not recommended after 2030, as per ASD. */\nexport const ml_dsa44: DSA = /* @__PURE__ */ (() =>\n getDilithium({\n ...PARAMS[2],\n CRH_BYTES: 64,\n TR_BYTES: 64,\n C_TILDE_BYTES: 32,\n XOF128,\n XOF256,\n securityLevel: 128,\n }))();\n\n/** ML-DSA-65 for 192-bit security level. Not recommended after 2030, as per ASD. */\nexport const ml_dsa65: DSA = /* @__PURE__ */ (() =>\n getDilithium({\n ...PARAMS[3],\n CRH_BYTES: 64,\n TR_BYTES: 64,\n C_TILDE_BYTES: 48,\n XOF128,\n XOF256,\n securityLevel: 192,\n }))();\n\n/** ML-DSA-87 for 256-bit security level. OK after 2030, as per ASD. */\nexport const ml_dsa87: DSA = /* @__PURE__ */ (() =>\n getDilithium({\n ...PARAMS[5],\n CRH_BYTES: 64,\n TR_BYTES: 64,\n C_TILDE_BYTES: 64,\n XOF128,\n XOF256,\n securityLevel: 256,\n }))();\n","/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { abytes as abytes_, anumber, bytesToHex as bytesToHex_, concatBytes as concatBytes_, hexToBytes as hexToBytes_, } from '@noble/hashes/utils.js';\nexport { abytes, anumber, bytesToHex, concatBytes, hexToBytes, isBytes, randomBytes, } from '@noble/hashes/utils.js';\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nexport function abool(value, title = '') {\n if (typeof value !== 'boolean') {\n const prefix = title && `\"${title}\" `;\n throw new Error(prefix + 'expected boolean, got type=' + typeof value);\n }\n return value;\n}\n// Used in weierstrass, der\nfunction abignumber(n) {\n if (typeof n === 'bigint') {\n if (!isPosBig(n))\n throw new Error('positive bigint expected, got ' + n);\n }\n else\n anumber(n);\n return n;\n}\nexport function asafenumber(value, title = '') {\n if (!Number.isSafeInteger(value)) {\n const prefix = title && `\"${title}\" `;\n throw new Error(prefix + 'expected safe integer, got type=' + typeof value);\n }\n}\nexport function numberToHexUnpadded(num) {\n const hex = abignumber(num).toString(16);\n return hex.length & 1 ? '0' + hex : hex;\n}\nexport function hexToNumber(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n return hexToNumber(bytesToHex_(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n return hexToNumber(bytesToHex_(copyBytes(abytes_(bytes)).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n anumber(len);\n n = abignumber(n);\n const res = hexToBytes_(n.toString(16).padStart(len * 2, '0'));\n if (res.length !== len)\n throw new Error('number too large');\n return res;\n}\nexport function numberToBytesLE(n, len) {\n return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n return hexToBytes_(numberToHexUnpadded(abignumber(n)));\n}\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n if (a.length !== b.length)\n return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++)\n diff |= a[i] ^ b[i];\n return diff === 0;\n}\n/**\n * Copies Uint8Array. We can't use u8a.slice(), because u8a can be Buffer,\n * and Buffer#slice creates mutable copy. Never use Buffers!\n */\nexport function copyBytes(bytes) {\n return Uint8Array.from(bytes);\n}\n/**\n * Decodes 7-bit ASCII string to Uint8Array, throws on non-ascii symbols\n * Should be safe to use for things expected to be ASCII.\n * Returns exact same result as `TextEncoder` for ASCII or throws.\n */\nexport function asciiToBytes(ascii) {\n return Uint8Array.from(ascii, (c, i) => {\n const charCode = c.charCodeAt(0);\n if (c.length !== 1 || charCode > 127) {\n throw new Error(`string contains non-ASCII character \"${ascii[i]}\" with code ${charCode} at position ${i}`);\n }\n return charCode;\n });\n}\n// Is positive bigint\nconst isPosBig = (n) => typeof n === 'bigint' && _0n <= n;\nexport function inRange(n, min, max) {\n return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\n/**\n * Asserts min <= n < max. NOTE: It's < max and not <= max.\n * @example\n * aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)\n */\nexport function aInRange(title, n, min, max) {\n // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?\n // consider P=256n, min=0n, max=P\n // - a for min=0 would require -1: `inRange('x', x, -1n, P)`\n // - b would commonly require subtraction: `inRange('x', x, 0n, P - 1n)`\n // - our way is the cleanest: `inRange('x', x, 0n, P)\n if (!inRange(n, min, max))\n throw new Error('expected valid ' + title + ': ' + min + ' <= n < ' + max + ', got ' + n);\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n * TODO: merge with nLength in modular\n */\nexport function bitLen(n) {\n let len;\n for (len = 0; n > _0n; n >>= _1n, len += 1)\n ;\n return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n, pos) {\n return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n, pos, value) {\n return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n) => (_1n << BigInt(n)) - _1n;\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n * const drbg = createHmacDRBG<Key>(32, 32, hmac);\n * drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n anumber(hashLen, 'hashLen');\n anumber(qByteLen, 'qByteLen');\n if (typeof hmacFn !== 'function')\n throw new Error('hmacFn must be a function');\n const u8n = (len) => new Uint8Array(len); // creates Uint8Array\n const NULL = Uint8Array.of();\n const byte0 = Uint8Array.of(0x00);\n const byte1 = Uint8Array.of(0x01);\n const _maxDrbgIters = 1000;\n // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n let i = 0; // Iterations counter, will throw when over 1000\n const reset = () => {\n v.fill(1);\n k.fill(0);\n i = 0;\n };\n const h = (...msgs) => hmacFn(k, concatBytes_(v, ...msgs)); // hmac(k)(v, ...values)\n const reseed = (seed = NULL) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = h(byte0, seed); // k = hmac(k || v || 0x00 || seed)\n v = h(); // v = hmac(k || v)\n if (seed.length === 0)\n return;\n k = h(byte1, seed); // k = hmac(k || v || 0x01 || seed)\n v = h(); // v = hmac(k || v)\n };\n const gen = () => {\n // HMAC-DRBG generate() function\n if (i++ >= _maxDrbgIters)\n throw new Error('drbg: tried max amount of iterations');\n let len = 0;\n const out = [];\n while (len < qByteLen) {\n v = h();\n const sl = v.slice();\n out.push(sl);\n len += v.length;\n }\n return concatBytes_(...out);\n };\n const genUntil = (seed, pred) => {\n reset();\n reseed(seed); // Steps D-G\n let res = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(gen())))\n reseed();\n reset();\n return res;\n };\n return genUntil;\n}\nexport function validateObject(object, fields = {}, optFields = {}) {\n if (!object || typeof object !== 'object')\n throw new Error('expected valid options object');\n function checkField(fieldName, expectedType, isOpt) {\n const val = object[fieldName];\n if (isOpt && val === undefined)\n return;\n const current = typeof val;\n if (current !== expectedType || val === null)\n throw new Error(`param \"${fieldName}\" is invalid: expected ${expectedType}, got ${current}`);\n }\n const iter = (f, isOpt) => Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));\n iter(fields, false);\n iter(optFields, true);\n}\n/**\n * throws not implemented error\n */\nexport const notImplemented = () => {\n throw new Error('not implemented');\n};\n/**\n * Memoizes (caches) computation result.\n * Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.\n */\nexport function memoized(fn) {\n const map = new WeakMap();\n return (arg, ...args) => {\n const val = map.get(arg);\n if (val !== undefined)\n return val;\n const computed = fn(arg, ...args);\n map.set(arg, computed);\n return computed;\n };\n}\n//# sourceMappingURL=utils.js.map","/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport {\n abytes as abytes_,\n anumber,\n bytesToHex as bytesToHex_,\n concatBytes as concatBytes_,\n hexToBytes as hexToBytes_,\n} from '@noble/hashes/utils.js';\nexport {\n abytes,\n anumber,\n bytesToHex,\n concatBytes,\n hexToBytes,\n isBytes,\n randomBytes,\n} from '@noble/hashes/utils.js';\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\n\nexport type CHash = {\n (message: Uint8Array): Uint8Array;\n blockLen: number;\n outputLen: number;\n create(opts?: { dkLen?: number }): any; // For shake\n};\nexport type FHash = (message: Uint8Array) => Uint8Array;\nexport function abool(value: boolean, title: string = ''): boolean {\n if (typeof value !== 'boolean') {\n const prefix = title && `\"${title}\" `;\n throw new Error(prefix + 'expected boolean, got type=' + typeof value);\n }\n return value;\n}\n\n// Used in weierstrass, der\nfunction abignumber(n: number | bigint) {\n if (typeof n === 'bigint') {\n if (!isPosBig(n)) throw new Error('positive bigint expected, got ' + n);\n } else anumber(n);\n return n;\n}\n\nexport function asafenumber(value: number, title: string = ''): void {\n if (!Number.isSafeInteger(value)) {\n const prefix = title && `\"${title}\" `;\n throw new Error(prefix + 'expected safe integer, got type=' + typeof value);\n }\n}\n\nexport function numberToHexUnpadded(num: number | bigint): string {\n const hex = abignumber(num).toString(16);\n return hex.length & 1 ? '0' + hex : hex;\n}\n\nexport function hexToNumber(hex: string): bigint {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes: Uint8Array): bigint {\n return hexToNumber(bytesToHex_(bytes));\n}\nexport function bytesToNumberLE(bytes: Uint8Array): bigint {\n return hexToNumber(bytesToHex_(copyBytes(abytes_(bytes)).reverse()));\n}\n\nexport function numberToBytesBE(n: number | bigint, len: number): Uint8Array {\n anumber(len);\n n = abignumber(n);\n const res = hexToBytes_(n.toString(16).padStart(len * 2, '0'));\n if (res.length !== len) throw new Error('number too large');\n return res;\n}\nexport function numberToBytesLE(n: number | bigint, len: number): Uint8Array {\n return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n: number | bigint): Uint8Array {\n return hexToBytes_(numberToHexUnpadded(abignumber(n)));\n}\n\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a: Uint8Array, b: Uint8Array): boolean {\n if (a.length !== b.length) return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];\n return diff === 0;\n}\n\n/**\n * Copies Uint8Array. We can't use u8a.slice(), because u8a can be Buffer,\n * and Buffer#slice creates mutable copy. Never use Buffers!\n */\nexport function copyBytes(bytes: Uint8Array): Uint8Array {\n return Uint8Array.from(bytes);\n}\n\n/**\n * Decodes 7-bit ASCII string to Uint8Array, throws on non-ascii symbols\n * Should be safe to use for things expected to be ASCII.\n * Returns exact same result as `TextEncoder` for ASCII or throws.\n */\nexport function asciiToBytes(ascii: string): Uint8Array {\n return Uint8Array.from(ascii, (c, i) => {\n const charCode = c.charCodeAt(0);\n if (c.length !== 1 || charCode > 127) {\n throw new Error(\n `string contains non-ASCII character \"${ascii[i]}\" with code ${charCode} at position ${i}`\n );\n }\n return charCode;\n });\n}\n\n// Is positive bigint\nconst isPosBig = (n: bigint) => typeof n === 'bigint' && _0n <= n;\n\nexport function inRange(n: bigint, min: bigint, max: bigint): boolean {\n return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\n\n/**\n * Asserts min <= n < max. NOTE: It's < max and not <= max.\n * @example\n * aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)\n */\nexport function aInRange(title: string, n: bigint, min: bigint, max: bigint): void {\n // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?\n // consider P=256n, min=0n, max=P\n // - a for min=0 would require -1: `inRange('x', x, -1n, P)`\n // - b would commonly require subtraction: `inRange('x', x, 0n, P - 1n)`\n // - our way is the cleanest: `inRange('x', x, 0n, P)\n if (!inRange(n, min, max))\n throw new Error('expected valid ' + title + ': ' + min + ' <= n < ' + max + ', got ' + n);\n}\n\n// Bit operations\n\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n * TODO: merge with nLength in modular\n */\nexport function bitLen(n: bigint): number {\n let len;\n for (len = 0; n > _0n; n >>= _1n, len += 1);\n return len;\n}\n\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n: bigint, pos: number): bigint {\n return (n >> BigInt(pos)) & _1n;\n}\n\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n: bigint, pos: number, value: boolean): bigint {\n return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n: number): bigint => (_1n << BigInt(n)) - _1n;\n\n// DRBG\n\ntype Pred<T> = (v: Uint8Array) => T | undefined;\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n * const drbg = createHmacDRBG<Key>(32, 32, hmac);\n * drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg<T>(\n hashLen: number,\n qByteLen: number,\n hmacFn: (key: Uint8Array, message: Uint8Array) => Uint8Array\n): (seed: Uint8Array, predicate: Pred<T>) => T {\n anumber(hashLen, 'hashLen');\n anumber(qByteLen, 'qByteLen');\n if (typeof hmacFn !== 'function') throw new Error('hmacFn must be a function');\n const u8n = (len: number): Uint8Array => new Uint8Array(len); // creates Uint8Array\n const NULL = Uint8Array.of();\n const byte0 = Uint8Array.of(0x00);\n const byte1 = Uint8Array.of(0x01);\n const _maxDrbgIters = 1000;\n\n // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n let i = 0; // Iterations counter, will throw when over 1000\n const reset = () => {\n v.fill(1);\n k.fill(0);\n i = 0;\n };\n const h = (...msgs: Uint8Array[]) => hmacFn(k, concatBytes_(v, ...msgs)); // hmac(k)(v, ...values)\n const reseed = (seed: Uint8Array = NULL) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = h(byte0, seed); // k = hmac(k || v || 0x00 || seed)\n v = h(); // v = hmac(k || v)\n if (seed.length === 0) return;\n k = h(byte1, seed); // k = hmac(k || v || 0x01 || seed)\n v = h(); // v = hmac(k || v)\n };\n const gen = () => {\n // HMAC-DRBG generate() function\n if (i++ >= _maxDrbgIters) throw new Error('drbg: tried max amount of iterations');\n let len = 0;\n const out: Uint8Array[] = [];\n while (len < qByteLen) {\n v = h();\n const sl = v.slice();\n out.push(sl);\n len += v.length;\n }\n return concatBytes_(...out);\n };\n const genUntil = (seed: Uint8Array, pred: Pred<T>): T => {\n reset();\n reseed(seed); // Steps D-G\n let res: T | undefined = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(gen()))) reseed();\n reset();\n return res;\n };\n return genUntil;\n}\n\nexport function validateObject(\n object: Record<string, any>,\n fields: Record<string, string> = {},\n optFields: Record<string, string> = {}\n): void {\n if (!object || typeof object !== 'object') throw new Error('expected valid options object');\n type Item = keyof typeof object;\n function checkField(fieldName: Item, expectedType: string, isOpt: boolean) {\n const val = object[fieldName];\n if (isOpt && val === undefined) return;\n const current = typeof val;\n if (current !== expectedType || val === null)\n throw new Error(`param \"${fieldName}\" is invalid: expected ${expectedType}, got ${current}`);\n }\n const iter = (f: typeof fields, isOpt: boolean) =>\n Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));\n iter(fields, false);\n iter(optFields, true);\n}\n\n/**\n * throws not implemented error\n */\nexport const notImplemented = (): never => {\n throw new Error('not implemented');\n};\n\n/**\n * Memoizes (caches) computation result.\n * Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.\n */\nexport function memoized<T extends object, R, O extends any[]>(\n fn: (arg: T, ...args: O) => R\n): (arg: T, ...args: O) => R {\n const map = new WeakMap<T, R>();\n return (arg: T, ...args: O): R => {\n const val = map.get(arg);\n if (val !== undefined) return val;\n const computed = fn(arg, ...args);\n map.set(arg, computed);\n return computed;\n };\n}\n\nexport interface CryptoKeys {\n lengths: { seed?: number; public?: number; secret?: number };\n keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n getPublicKey: (secretKey: Uint8Array) => Uint8Array;\n}\n\n/** Generic interface for signatures. Has keygen, sign and verify. */\nexport interface Signer extends CryptoKeys {\n // Interfaces are fun. We cannot just add new fields without copying old ones.\n lengths: {\n seed?: number;\n public?: number;\n secret?: number;\n signRand?: number;\n signature?: number;\n };\n sign: (msg: Uint8Array, secretKey: Uint8Array) => Uint8Array;\n verify: (sig: Uint8Array, msg: Uint8Array, publicKey: Uint8Array) => boolean;\n}\n","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is positive integer. */\nexport function anumber(n, title = '') {\n if (!Number.isSafeInteger(n) || n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n/** Asserts something is Uint8Array. */\nexport function abytes(value, length, title = '') {\n const bytes = isBytes(value);\n const len = value?.length;\n const needsLen = length !== undefined;\n if (!bytes || (needsLen && len !== length)) {\n const prefix = title && `\"${title}\" `;\n const ofLen = needsLen ? ` of length ${length}` : '';\n const got = bytes ? `length=${len}` : `type=${typeof value}`;\n throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n }\n return value;\n}\n/** Asserts something is hash */\nexport function ahash(h) {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance, checkFinished = true) {\n if (instance.destroyed)\n throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished)\n throw new Error('Hash#digest() has already been called');\n}\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out, instance) {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr) {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr) {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays) {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr) {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word, shift) {\n return (word << (32 - shift)) | (word >>> shift);\n}\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word, shift) {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/** The byte swap operation for uint32 */\nexport function byteSwap(word) {\n return (((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff));\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE = isLE\n ? (n) => n\n : (n) => byteSwap(n);\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\nexport const swap32IfBE = isLE\n ? (u) => u\n : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = /* @__PURE__ */ (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n if (typeof hex !== 'string')\n throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n }\n return array;\n}\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n */\nexport const nextTick = async () => { };\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(iters, tick, cb) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick)\n continue;\n await nextTick();\n ts += diff;\n }\n}\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n */\nexport function kdfInputToBytes(data, errorTitle = '') {\n if (typeof data === 'string')\n return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n/** Merges default options and passed options. */\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged;\n}\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher(hashCons, info = {}) {\n const hashC = (msg, opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32) {\n const cr = typeof globalThis === 'object' ? globalThis.crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix) => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n//# sourceMappingURL=utils.js.map","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) || n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\n const bytes = isBytes(value);\n const len = value?.length;\n const needsLen = length !== undefined;\n if (!bytes || (needsLen && len !== length)) {\n const prefix = title && `\"${title}\" `;\n const ofLen = needsLen ? ` of length ${length}` : '';\n const got = bytes ? `length=${len}` : `type=${typeof value}`;\n throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n }\n return value;\n}\n\n/** Asserts something is hash */\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\n/**\n * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n }\n return array;\n}\n\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n */\nexport const nextTick = async (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\n\n/**\n * Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n */\nexport function kdfInputToBytes(data: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n\ntype EmptyObj = {};\n/** Merges default options and passed options. */\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/** Common interface for all hashes. */\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/** PseudoRandom (number) Generator */\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash constructor */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash params. */\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/** Hash function */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/** XOF with output */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n","/**\n * SHA3 (keccak) hash function, based on a new \"Sponge function\" design.\n * Different from older hashes, the internal state is bigger than output size.\n *\n * Check out [FIPS-202](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf),\n * [Website](https://keccak.team/keccak.html),\n * [the differences between SHA-3 and Keccak](https://crypto.stackexchange.com/questions/15727/what-are-the-key-differences-between-the-draft-sha-3-standard-and-the-keccak-sub).\n *\n * Check out `sha3-addons` module for cSHAKE, k12, and others.\n * @module\n */\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from \"./_u64.js\";\n// prettier-ignore\nimport { abytes, aexists, anumber, aoutput, clean, createHasher, oidNist, swap32IfBE, u32 } from \"./utils.js\";\n// No __PURE__ annotations in sha3 header:\n// EVERYTHING is in fact used on every export.\n// Various per round constants calculations\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _7n = BigInt(7);\nconst _256n = BigInt(256);\nconst _0x71n = BigInt(0x71);\nconst SHA3_PI = [];\nconst SHA3_ROTL = [];\nconst _SHA3_IOTA = []; // no pure annotation: var is always used\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n // Pi\n [x, y] = [y, (2 * x + 3 * y) % 5];\n SHA3_PI.push(2 * (5 * y + x));\n // Rotational\n SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n // Iota\n let t = _0n;\n for (let j = 0; j < 7; j++) {\n R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n if (R & _2n)\n t ^= _1n << ((_1n << BigInt(j)) - _1n);\n }\n _SHA3_IOTA.push(t);\n}\nconst IOTAS = split(_SHA3_IOTA, true);\nconst SHA3_IOTA_H = IOTAS[0];\nconst SHA3_IOTA_L = IOTAS[1];\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n/** `keccakf1600` internal function, additionally allows to adjust round count. */\nexport function keccakP(s, rounds = 24) {\n const B = new Uint32Array(5 * 2);\n // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n for (let round = 24 - rounds; round < 24; round++) {\n // Theta θ\n for (let x = 0; x < 10; x++)\n B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n for (let x = 0; x < 10; x += 2) {\n const idx1 = (x + 8) % 10;\n const idx0 = (x + 2) % 10;\n const B0 = B[idx0];\n const B1 = B[idx0 + 1];\n const Th = rotlH(B0, B1, 1) ^ B[idx1];\n const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n for (let y = 0; y < 50; y += 10) {\n s[x + y] ^= Th;\n s[x + y + 1] ^= Tl;\n }\n }\n // Rho (ρ) and Pi (π)\n let curH = s[2];\n let curL = s[3];\n for (let t = 0; t < 24; t++) {\n const shift = SHA3_ROTL[t];\n const Th = rotlH(curH, curL, shift);\n const Tl = rotlL(curH, curL, shift);\n const PI = SHA3_PI[t];\n curH = s[PI];\n curL = s[PI + 1];\n s[PI] = Th;\n s[PI + 1] = Tl;\n }\n // Chi (χ)\n for (let y = 0; y < 50; y += 10) {\n for (let x = 0; x < 10; x++)\n B[x] = s[y + x];\n for (let x = 0; x < 10; x++)\n s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n }\n // Iota (ι)\n s[0] ^= SHA3_IOTA_H[round];\n s[1] ^= SHA3_IOTA_L[round];\n }\n clean(B);\n}\n/** Keccak sponge function. */\nexport class Keccak {\n state;\n pos = 0;\n posOut = 0;\n finished = false;\n state32;\n destroyed = false;\n blockLen;\n suffix;\n outputLen;\n enableXOF = false;\n rounds;\n // NOTE: we accept arguments in bytes instead of bits here.\n constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {\n this.blockLen = blockLen;\n this.suffix = suffix;\n this.outputLen = outputLen;\n this.enableXOF = enableXOF;\n this.rounds = rounds;\n // Can be passed from user as dkLen\n anumber(outputLen, 'outputLen');\n // 1600 = 5x5 matrix of 64bit. 1600 bits === 200 bytes\n // 0 < blockLen < 200\n if (!(0 < blockLen && blockLen < 200))\n throw new Error('only keccak-f1600 function is supported');\n this.state = new Uint8Array(200);\n this.state32 = u32(this.state);\n }\n clone() {\n return this._cloneInto();\n }\n keccak() {\n swap32IfBE(this.state32);\n keccakP(this.state32, this.rounds);\n swap32IfBE(this.state32);\n this.posOut = 0;\n this.pos = 0;\n }\n update(data) {\n aexists(this);\n abytes(data);\n const { blockLen, state } = this;\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n for (let i = 0; i < take; i++)\n state[this.pos++] ^= data[pos++];\n if (this.pos === blockLen)\n this.keccak();\n }\n return this;\n }\n finish() {\n if (this.finished)\n return;\n this.finished = true;\n const { state, suffix, pos, blockLen } = this;\n // Do the padding\n state[pos] ^= suffix;\n if ((suffix & 0x80) !== 0 && pos === blockLen - 1)\n this.keccak();\n state[blockLen - 1] ^= 0x80;\n this.keccak();\n }\n writeInto(out) {\n aexists(this, false);\n abytes(out);\n this.finish();\n const bufferOut = this.state;\n const { blockLen } = this;\n for (let pos = 0, len = out.length; pos < len;) {\n if (this.posOut >= blockLen)\n this.keccak();\n const take = Math.min(blockLen - this.posOut, len - pos);\n out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n this.posOut += take;\n pos += take;\n }\n return out;\n }\n xofInto(out) {\n // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n if (!this.enableXOF)\n throw new Error('XOF is not possible for this instance');\n return this.writeInto(out);\n }\n xof(bytes) {\n anumber(bytes);\n return this.xofInto(new Uint8Array(bytes));\n }\n digestInto(out) {\n aoutput(out, this);\n if (this.finished)\n throw new Error('digest() was already called');\n this.writeInto(out);\n this.destroy();\n return out;\n }\n digest() {\n return this.digestInto(new Uint8Array(this.outputLen));\n }\n destroy() {\n this.destroyed = true;\n clean(this.state);\n }\n _cloneInto(to) {\n const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n to ||= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);\n to.state32.set(this.state32);\n to.pos = this.pos;\n to.posOut = this.posOut;\n to.finished = this.finished;\n to.rounds = rounds;\n // Suffix can change in cSHAKE\n to.suffix = suffix;\n to.outputLen = outputLen;\n to.enableXOF = enableXOF;\n to.destroyed = this.destroyed;\n return to;\n }\n}\nconst genKeccak = (suffix, blockLen, outputLen, info = {}) => createHasher(() => new Keccak(blockLen, suffix, outputLen), info);\n/** SHA3-224 hash function. */\nexport const sha3_224 = /* @__PURE__ */ genKeccak(0x06, 144, 28, \n/* @__PURE__ */ oidNist(0x07));\n/** SHA3-256 hash function. Different from keccak-256. */\nexport const sha3_256 = /* @__PURE__ */ genKeccak(0x06, 136, 32, \n/* @__PURE__ */ oidNist(0x08));\n/** SHA3-384 hash function. */\nexport const sha3_384 = /* @__PURE__ */ genKeccak(0x06, 104, 48, \n/* @__PURE__ */ oidNist(0x09));\n/** SHA3-512 hash function. */\nexport const sha3_512 = /* @__PURE__ */ genKeccak(0x06, 72, 64, \n/* @__PURE__ */ oidNist(0x0a));\n/** keccak-224 hash function. */\nexport const keccak_224 = /* @__PURE__ */ genKeccak(0x01, 144, 28);\n/** keccak-256 hash function. Different from SHA3-256. */\nexport const keccak_256 = /* @__PURE__ */ genKeccak(0x01, 136, 32);\n/** keccak-384 hash function. */\nexport const keccak_384 = /* @__PURE__ */ genKeccak(0x01, 104, 48);\n/** keccak-512 hash function. */\nexport const keccak_512 = /* @__PURE__ */ genKeccak(0x01, 72, 64);\nconst genShake = (suffix, blockLen, outputLen, info = {}) => createHasher((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true), info);\n/** SHAKE128 XOF with 128-bit security. */\nexport const shake128 = \n/* @__PURE__ */\ngenShake(0x1f, 168, 16, /* @__PURE__ */ oidNist(0x0b));\n/** SHAKE256 XOF with 256-bit security. */\nexport const shake256 = \n/* @__PURE__ */\ngenShake(0x1f, 136, 32, /* @__PURE__ */ oidNist(0x0c));\n/** SHAKE128 XOF with 256-bit output (NIST version). */\nexport const shake128_32 = \n/* @__PURE__ */\ngenShake(0x1f, 168, 32, /* @__PURE__ */ oidNist(0x0b));\n/** SHAKE256 XOF with 512-bit output (NIST version). */\nexport const shake256_64 = \n/* @__PURE__ */\ngenShake(0x1f, 136, 64, /* @__PURE__ */ oidNist(0x0c));\n//# sourceMappingURL=sha3.js.map","/**\n * SHA3 (keccak) hash function, based on a new \"Sponge function\" design.\n * Different from older hashes, the internal state is bigger than output size.\n *\n * Check out [FIPS-202](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf),\n * [Website](https://keccak.team/keccak.html),\n * [the differences between SHA-3 and Keccak](https://crypto.stackexchange.com/questions/15727/what-are-the-key-differences-between-the-draft-sha-3-standard-and-the-keccak-sub).\n *\n * Check out `sha3-addons` module for cSHAKE, k12, and others.\n * @module\n */\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.ts';\n// prettier-ignore\nimport {\n abytes, aexists, anumber, aoutput,\n clean, createHasher,\n oidNist,\n swap32IfBE,\n u32,\n type CHash, type CHashXOF,\n type Hash,\n type HashInfo,\n type HashXOF\n} from './utils.ts';\n\n// No __PURE__ annotations in sha3 header:\n// EVERYTHING is in fact used on every export.\n// Various per round constants calculations\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _7n = BigInt(7);\nconst _256n = BigInt(256);\nconst _0x71n = BigInt(0x71);\nconst SHA3_PI: number[] = [];\nconst SHA3_ROTL: number[] = [];\nconst _SHA3_IOTA: bigint[] = []; // no pure annotation: var is always used\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n // Pi\n [x, y] = [y, (2 * x + 3 * y) % 5];\n SHA3_PI.push(2 * (5 * y + x));\n // Rotational\n SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n // Iota\n let t = _0n;\n for (let j = 0; j < 7; j++) {\n R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n if (R & _2n) t ^= _1n << ((_1n << BigInt(j)) - _1n);\n }\n _SHA3_IOTA.push(t);\n}\nconst IOTAS = split(_SHA3_IOTA, true);\nconst SHA3_IOTA_H = IOTAS[0];\nconst SHA3_IOTA_L = IOTAS[1];\n\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h: number, l: number, s: number) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h: number, l: number, s: number) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n\n/** `keccakf1600` internal function, additionally allows to adjust round count. */\nexport function keccakP(s: Uint32Array, rounds: number = 24): void {\n const B = new Uint32Array(5 * 2);\n // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n for (let round = 24 - rounds; round < 24; round++) {\n // Theta θ\n for (let x = 0; x < 10; x++) B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n for (let x = 0; x < 10; x += 2) {\n const idx1 = (x + 8) % 10;\n const idx0 = (x + 2) % 10;\n const B0 = B[idx0];\n const B1 = B[idx0 + 1];\n const Th = rotlH(B0, B1, 1) ^ B[idx1];\n const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n for (let y = 0; y < 50; y += 10) {\n s[x + y] ^= Th;\n s[x + y + 1] ^= Tl;\n }\n }\n // Rho (ρ) and Pi (π)\n let curH = s[2];\n let curL = s[3];\n for (let t = 0; t < 24; t++) {\n const shift = SHA3_ROTL[t];\n const Th = rotlH(curH, curL, shift);\n const Tl = rotlL(curH, curL, shift);\n const PI = SHA3_PI[t];\n curH = s[PI];\n curL = s[PI + 1];\n s[PI] = Th;\n s[PI + 1] = Tl;\n }\n // Chi (χ)\n for (let y = 0; y < 50; y += 10) {\n for (let x = 0; x < 10; x++) B[x] = s[y + x];\n for (let x = 0; x < 10; x++) s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n }\n // Iota (ι)\n s[0] ^= SHA3_IOTA_H[round];\n s[1] ^= SHA3_IOTA_L[round];\n }\n clean(B);\n}\n\n/** Keccak sponge function. */\nexport class Keccak implements Hash<Keccak>, HashXOF<Keccak> {\n protected state: Uint8Array;\n protected pos = 0;\n protected posOut = 0;\n protected finished = false;\n protected state32: Uint32Array;\n protected destroyed = false;\n\n public blockLen: number;\n public suffix: number;\n public outputLen: number;\n protected enableXOF = false;\n protected rounds: number;\n\n // NOTE: we accept arguments in bytes instead of bits here.\n constructor(\n blockLen: number,\n suffix: number,\n outputLen: number,\n enableXOF = false,\n rounds: number = 24\n ) {\n this.blockLen = blockLen;\n this.suffix = suffix;\n this.outputLen = outputLen;\n this.enableXOF = enableXOF;\n this.rounds = rounds;\n // Can be passed from user as dkLen\n anumber(outputLen, 'outputLen');\n // 1600 = 5x5 matrix of 64bit. 1600 bits === 200 bytes\n // 0 < blockLen < 200\n if (!(0 < blockLen && blockLen < 200))\n throw new Error('only keccak-f1600 function is supported');\n this.state = new Uint8Array(200);\n this.state32 = u32(this.state);\n }\n clone(): Keccak {\n return this._cloneInto();\n }\n protected keccak(): void {\n swap32IfBE(this.state32);\n keccakP(this.state32, this.rounds);\n swap32IfBE(this.state32);\n this.posOut = 0;\n this.pos = 0;\n }\n update(data: Uint8Array): this {\n aexists(this);\n abytes(data);\n const { blockLen, state } = this;\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n for (let i = 0; i < take; i++) state[this.pos++] ^= data[pos++];\n if (this.pos === blockLen) this.keccak();\n }\n return this;\n }\n protected finish(): void {\n if (this.finished) return;\n this.finished = true;\n const { state, suffix, pos, blockLen } = this;\n // Do the padding\n state[pos] ^= suffix;\n if ((suffix & 0x80) !== 0 && pos === blockLen - 1) this.keccak();\n state[blockLen - 1] ^= 0x80;\n this.keccak();\n }\n protected writeInto(out: Uint8Array): Uint8Array {\n aexists(this, false);\n abytes(out);\n this.finish();\n const bufferOut = this.state;\n const { blockLen } = this;\n for (let pos = 0, len = out.length; pos < len; ) {\n if (this.posOut >= blockLen) this.keccak();\n const take = Math.min(blockLen - this.posOut, len - pos);\n out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n this.posOut += take;\n pos += take;\n }\n return out;\n }\n xofInto(out: Uint8Array): Uint8Array {\n // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n if (!this.enableXOF) throw new Error('XOF is not possible for this instance');\n return this.writeInto(out);\n }\n xof(bytes: number): Uint8Array {\n anumber(bytes);\n return this.xofInto(new Uint8Array(bytes));\n }\n digestInto(out: Uint8Array): Uint8Array {\n aoutput(out, this);\n if (this.finished) throw new Error('digest() was already called');\n this.writeInto(out);\n this.destroy();\n return out;\n }\n digest(): Uint8Array {\n return this.digestInto(new Uint8Array(this.outputLen));\n }\n destroy(): void {\n this.destroyed = true;\n clean(this.state);\n }\n _cloneInto(to?: Keccak): Keccak {\n const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n to ||= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);\n to.state32.set(this.state32);\n to.pos = this.pos;\n to.posOut = this.posOut;\n to.finished = this.finished;\n to.rounds = rounds;\n // Suffix can change in cSHAKE\n to.suffix = suffix;\n to.outputLen = outputLen;\n to.enableXOF = enableXOF;\n to.destroyed = this.destroyed;\n return to;\n }\n}\n\nconst genKeccak = (suffix: number, blockLen: number, outputLen: number, info: HashInfo = {}) =>\n createHasher(() => new Keccak(blockLen, suffix, outputLen), info);\n\n/** SHA3-224 hash function. */\nexport const sha3_224: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 144,\n 28,\n /* @__PURE__ */ oidNist(0x07)\n);\n/** SHA3-256 hash function. Different from keccak-256. */\nexport const sha3_256: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 136,\n 32,\n /* @__PURE__ */ oidNist(0x08)\n);\n/** SHA3-384 hash function. */\nexport const sha3_384: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 104,\n 48,\n /* @__PURE__ */ oidNist(0x09)\n);\n/** SHA3-512 hash function. */\nexport const sha3_512: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 72,\n 64,\n /* @__PURE__ */ oidNist(0x0a)\n);\n\n/** keccak-224 hash function. */\nexport const keccak_224: CHash = /* @__PURE__ */ genKeccak(0x01, 144, 28);\n/** keccak-256 hash function. Different from SHA3-256. */\nexport const keccak_256: CHash = /* @__PURE__ */ genKeccak(0x01, 136, 32);\n/** keccak-384 hash function. */\nexport const keccak_384: CHash = /* @__PURE__ */ genKeccak(0x01, 104, 48);\n/** keccak-512 hash function. */\nexport const keccak_512: CHash = /* @__PURE__ */ genKeccak(0x01, 72, 64);\n\n/** Options for SHAKE XOF. */\nexport type ShakeOpts = { dkLen?: number };\n\nconst genShake = (suffix: number, blockLen: number, outputLen: number, info: HashInfo = {}) =>\n createHasher<Keccak, ShakeOpts>(\n (opts: ShakeOpts = {}) =>\n new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true),\n info\n );\n\n/** SHAKE128 XOF with 128-bit security. */\nexport const shake128: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 168, 16, /* @__PURE__ */ oidNist(0x0b));\n/** SHAKE256 XOF with 256-bit security. */\nexport const shake256: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 136, 32, /* @__PURE__ */ oidNist(0x0c));\n\n/** SHAKE128 XOF with 256-bit output (NIST version). */\nexport const shake128_32: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 168, 32, /* @__PURE__ */ oidNist(0x0b));\n/** SHAKE256 XOF with 512-bit output (NIST version). */\nexport const shake256_64: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 136, 64, /* @__PURE__ */ oidNist(0x0c));\n","/**\n * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n */\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\nfunction fromBig(n, le = false) {\n if (le)\n return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n const len = lst.length;\n let Ah = new Uint32Array(len);\n let Al = new Uint32Array(len);\n for (let i = 0; i < len; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig };\n// prettier-ignore\nconst u64 = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","/**\n * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n */\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n\nfunction fromBig(\n n: bigint,\n le = false\n): {\n h: number;\n l: number;\n} {\n if (le) return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\n const len = lst.length;\n let Ah = new Uint32Array(len);\n let Al = new Uint32Array(len);\n for (let i = 0; i < len; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) | (l >>> (64 - s));\n\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(\n Ah: number,\n Al: number,\n Bh: number,\n Bl: number\n): {\n h: number;\n l: number;\n} {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n","/**\n * Internal methods for lattice-based ML-KEM and ML-DSA.\n * @module\n */\n/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */\nimport { FFTCore, reverseBits } from '@noble/curves/abstract/fft.js';\nimport { shake128, shake256 } from '@noble/hashes/sha3.js';\nimport { cleanBytes, getMask } from \"./utils.js\";\n/**\n * Creates shared modular arithmetic, NTT, and packing helpers for CRYSTALS schemes.\n * @param opts - Polynomial and transform parameters. See {@link CrystalOpts}.\n * @returns CRYSTALS arithmetic and encoding helpers.\n * @example\n * Create shared modular arithmetic and NTT helpers for a CRYSTALS parameter set.\n * ```ts\n * const crystals = genCrystals({\n * newPoly: (n) => new Uint16Array(n),\n * N: 256,\n * Q: 3329,\n * F: 3303,\n * ROOT_OF_UNITY: 17,\n * brvBits: 7,\n * isKyber: true,\n * });\n * const reduced = crystals.mod(-1);\n * ```\n */\nexport const genCrystals = (opts) => {\n // isKyber: true means Kyber, false means Dilithium\n const { newPoly, N, Q, F, ROOT_OF_UNITY, brvBits, isKyber } = opts;\n // Normalize JS `%` into the canonical Z_m representative `[0, modulo-1]` expected by\n // FIPS 203 §2.3 / FIPS 204 §2.3 before downstream mod-q arithmetic.\n const mod = (a, modulo = Q) => {\n const result = a % modulo | 0;\n return (result >= 0 ? result | 0 : (modulo + result) | 0) | 0;\n };\n // FIPS 204 §7.4 uses the centered `mod ±` representative for low bits, keeping the\n // positive midpoint when `modulo` is even.\n // Center to `[-floor((modulo-1)/2), floor(modulo/2)]`.\n const smod = (a, modulo = Q) => {\n const r = mod(a, modulo) | 0;\n return (r > modulo >> 1 ? (r - modulo) | 0 : r) | 0;\n };\n // Kyber uses the FIPS 203 Appendix A `BitRev_7` table here via the first 128 entries, while\n // Dilithium uses the FIPS 204 §7.5 / Appendix B `BitRev_8` zetas table over all 256 entries.\n function getZettas() {\n const out = newPoly(N);\n for (let i = 0; i < N; i++) {\n const b = reverseBits(i, brvBits);\n const p = BigInt(ROOT_OF_UNITY) ** BigInt(b) % BigInt(Q);\n out[i] = Number(p) | 0;\n }\n return out;\n }\n const nttZetas = getZettas();\n // Number-Theoretic Transform\n // Explained: https://electricdusk.com/ntt.html\n // Kyber has slightly different params, since there is no 512th primitive root of unity mod q,\n // only 256th primitive root of unity mod. Which also complicates MultiplyNTT.\n const field = {\n add: (a, b) => mod((a | 0) + (b | 0)) | 0,\n sub: (a, b) => mod((a | 0) - (b | 0)) | 0,\n mul: (a, b) => mod((a | 0) * (b | 0)) | 0,\n inv: (_a) => {\n throw new Error('not implemented');\n },\n };\n const nttOpts = {\n N,\n roots: nttZetas,\n invertButterflies: true,\n skipStages: isKyber ? 1 : 0,\n brp: false,\n };\n const dif = FFTCore(field, { dit: false, ...nttOpts });\n const dit = FFTCore(field, { dit: true, ...nttOpts });\n const NTT = {\n encode: (r) => {\n return dif(r);\n },\n decode: (r) => {\n dit(r);\n // The inverse-NTT normalization factor is family-specific: FIPS 203 Algorithm 10 line 14\n // uses `128^-1 mod q` for Kyber, while FIPS 204 Algorithm 42 lines 21-23 use `256^-1 mod q`.\n // kyber uses 128 here, because brv && stuff\n for (let i = 0; i < r.length; i++)\n r[i] = mod(F * r[i]);\n return r;\n },\n };\n // Pack one little-endian `d`-bit word per coefficient, matching FIPS 203 ByteEncode /\n // ByteDecode and the FIPS 204 BitsToBytes-based polynomial packing helpers.\n const bitsCoder = (d, c) => {\n const mask = getMask(d);\n const bytesLen = d * (N / 8);\n return {\n bytesLen,\n encode: (poly) => {\n const r = new Uint8Array(bytesLen);\n for (let i = 0, buf = 0, bufLen = 0, pos = 0; i < poly.length; i++) {\n buf |= (c.encode(poly[i]) & mask) << bufLen;\n bufLen += d;\n for (; bufLen >= 8; bufLen -= 8, buf >>= 8)\n r[pos++] = buf & getMask(bufLen);\n }\n return r;\n },\n decode: (bytes) => {\n const r = newPoly(N);\n for (let i = 0, buf = 0, bufLen = 0, pos = 0; i < bytes.length; i++) {\n buf |= bytes[i] << bufLen;\n bufLen += 8;\n for (; bufLen >= d; bufLen -= d, buf >>= d)\n r[pos++] = c.decode(buf & mask);\n }\n return r;\n },\n };\n };\n return { mod, smod, nttZetas, NTT, bitsCoder };\n};\nconst createXofShake = (shake) => (seed, blockLen) => {\n if (!blockLen)\n blockLen = shake.blockLen;\n // Optimizations that won't mater:\n // - cached seed update (two .update(), on start and on the end)\n // - another cache which cloned into working copy\n // Faster than multiple updates, since seed less than blockLen\n const _seed = new Uint8Array(seed.length + 2);\n _seed.set(seed);\n const seedLen = seed.length;\n const buf = new Uint8Array(blockLen); // == shake128.blockLen\n let h = shake.create({});\n let calls = 0;\n let xofs = 0;\n return {\n stats: () => ({ calls, xofs }),\n get: (x, y) => {\n // Rebind to `seed || x || y` so callers can implement the spec's per-coordinate\n // SHAKE inputs like `rho || j || i` and `rho || IntegerToBytes(counter, 2)`.\n _seed[seedLen + 0] = x;\n _seed[seedLen + 1] = y;\n h.destroy();\n h = shake.create({}).update(_seed);\n calls++;\n return () => {\n xofs++;\n return h.xofInto(buf);\n };\n },\n clean: () => {\n h.destroy();\n cleanBytes(buf, _seed);\n },\n };\n};\n/**\n * SHAKE128-based extendable-output reader factory used by ML-KEM.\n * `get(x, y)` selects one coordinate pair at a time; calling it again invalidates previously\n * returned readers, and each squeeze reuses one mutable internal output buffer.\n * @param seed - Seed bytes for the reader.\n * @param blockLen - Optional output block length.\n * @returns Stateful XOF reader.\n * @example\n * Build the ML-KEM SHAKE128 matrix expander and read one block.\n * ```ts\n * import { randomBytes } from '@noble/post-quantum/utils.js';\n * import { XOF128 } from '@noble/post-quantum/_crystals.js';\n * const reader = XOF128(randomBytes(32));\n * const block = reader.get(0, 0)();\n * ```\n */\nexport const XOF128 = /* @__PURE__ */ createXofShake(shake128);\n/**\n * SHAKE256-based extendable-output reader factory used by ML-DSA.\n * `get(x, y)` appends raw one-byte coordinates to the seed, invalidates previously returned\n * readers, and reuses one mutable internal output buffer for each squeeze.\n * @param seed - Seed bytes for the reader.\n * @param blockLen - Optional output block length.\n * @returns Stateful XOF reader.\n * @example\n * Build the ML-DSA SHAKE256 coefficient expander and read one block.\n * ```ts\n * import { randomBytes } from '@noble/post-quantum/utils.js';\n * import { XOF256 } from '@noble/post-quantum/_crystals.js';\n * const reader = XOF256(randomBytes(32));\n * const block = reader.get(0, 0)();\n * ```\n */\nexport const XOF256 = /* @__PURE__ */ createXofShake(shake256);\n//# sourceMappingURL=_crystals.js.map","/**\n * Internal methods for lattice-based ML-KEM and ML-DSA.\n * @module\n */\n/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */\nimport { FFTCore, reverseBits } from '@noble/curves/abstract/fft.js';\nimport { shake128, shake256 } from '@noble/hashes/sha3.js';\nimport type { TypedArray } from '@noble/hashes/utils.js';\nimport { type BytesCoderLen, cleanBytes, type Coder, getMask } from './utils.ts';\n\n/** Extendable-output reader used by the CRYSTALS implementations. */\nexport type XOF = (\n seed: Uint8Array,\n blockLen?: number\n) => {\n /**\n * Read diagnostic counters for the current XOF session.\n * @returns Current call and XOF block counters.\n */\n stats: () => { calls: number; xofs: number };\n /**\n * Select one `(x, y)` coordinate pair and get a block reader for it.\n * Only one coordinate stream is live at a time: a later `get(...)` call rebinds the shared\n * SHAKE state and invalidates older readers.\n * Each squeeze aliases one mutable internal output buffer, so callers must copy blocks they\n * want to retain before the next read.\n * @param x - First matrix coordinate.\n * @param y - Second matrix coordinate.\n * @returns Lazy block reader for that coordinate pair.\n */\n get: (x: number, y: number) => () => Uint8Array; // return block aligned to blockLen and 3\n /** Wipe any buffered state once the reader is no longer needed. */\n clean: () => void;\n};\n\n/** CRYSTALS (ml-kem, ml-dsa) options */\n/** Shared polynomial and NTT parameters for CRYSTALS algorithms. */\nexport type CrystalOpts<T extends TypedArray> = {\n /**\n * Allocate one zeroed polynomial/vector container.\n * @param n - Number of coefficients to allocate.\n * @returns Fresh typed container.\n */\n newPoly: TypedCons<T>;\n /** Polynomial size, typically `256`. */\n N: number;\n /** Prime modulus used for all coefficient arithmetic. */\n Q: number;\n /** Inverse transform normalization factor:\n * `256**-1 mod q` for Dilithium, `128**-1 mod q` for Kyber.\n */\n F: number;\n /** Principal root of unity for the transform domain. */\n ROOT_OF_UNITY: number;\n /** Number of bits used for bit-reversal ordering. */\n brvBits: number;\n /** `true` for Kyber/ML-KEM mode, `false` for Dilithium/ML-DSA mode. */\n isKyber: boolean;\n};\n\n/** Constructor function for typed polynomial containers. */\nexport type TypedCons<T extends TypedArray> = (n: number) => T;\n\n/**\n * Creates shared modular arithmetic, NTT, and packing helpers for CRYSTALS schemes.\n * @param opts - Polynomial and transform parameters. See {@link CrystalOpts}.\n * @returns CRYSTALS arithmetic and encoding helpers.\n * @example\n * Create shared modular arithmetic and NTT helpers for a CRYSTALS parameter set.\n * ```ts\n * const crystals = genCrystals({\n * newPoly: (n) => new Uint16Array(n),\n * N: 256,\n * Q: 3329,\n * F: 3303,\n * ROOT_OF_UNITY: 17,\n * brvBits: 7,\n * isKyber: true,\n * });\n * const reduced = crystals.mod(-1);\n * ```\n */\nexport const genCrystals = <T extends TypedArray>(\n opts: CrystalOpts<T>\n): {\n mod: (a: number, modulo?: number) => number;\n smod: (a: number, modulo?: number) => number;\n nttZetas: T;\n NTT: {\n /** Forward transform in place. Mutates and returns `r`. */\n encode: (r: T) => T;\n /** Inverse transform in place. Mutates and returns `r`. */\n decode: (r: T) => T;\n };\n bitsCoder: (d: number, c: Coder<number, number>) => BytesCoderLen<T>;\n} => {\n // isKyber: true means Kyber, false means Dilithium\n const { newPoly, N, Q, F, ROOT_OF_UNITY, brvBits, isKyber } = opts;\n // Normalize JS `%` into the canonical Z_m representative `[0, modulo-1]` expected by\n // FIPS 203 §2.3 / FIPS 204 §2.3 before downstream mod-q arithmetic.\n const mod = (a: number, modulo = Q): number => {\n const result = a % modulo | 0;\n return (result >= 0 ? result | 0 : (modulo + result) | 0) | 0;\n };\n // FIPS 204 §7.4 uses the centered `mod ±` representative for low bits, keeping the\n // positive midpoint when `modulo` is even.\n // Center to `[-floor((modulo-1)/2), floor(modulo/2)]`.\n const smod = (a: number, modulo = Q): number => {\n const r = mod(a, modulo) | 0;\n return (r > modulo >> 1 ? (r - modulo) | 0 : r) | 0;\n };\n // Kyber uses the FIPS 203 Appendix A `BitRev_7` table here via the first 128 entries, while\n // Dilithium uses the FIPS 204 §7.5 / Appendix B `BitRev_8` zetas table over all 256 entries.\n function getZettas() {\n const out = newPoly(N);\n for (let i = 0; i < N; i++) {\n const b = reverseBits(i, brvBits);\n const p = BigInt(ROOT_OF_UNITY) ** BigInt(b) % BigInt(Q);\n out[i] = Number(p) | 0;\n }\n return out;\n }\n const nttZetas = getZettas();\n\n // Number-Theoretic Transform\n // Explained: https://electricdusk.com/ntt.html\n\n // Kyber has slightly different params, since there is no 512th primitive root of unity mod q,\n // only 256th primitive root of unity mod. Which also complicates MultiplyNTT.\n\n const field = {\n add: (a: number, b: number) => mod((a | 0) + (b | 0)) | 0,\n sub: (a: number, b: number) => mod((a | 0) - (b | 0)) | 0,\n mul: (a: number, b: number) => mod((a | 0) * (b | 0)) | 0,\n inv: (_a: number) => {\n throw new Error('not implemented');\n },\n };\n const nttOpts = {\n N,\n roots: nttZetas as any,\n invertButterflies: true,\n skipStages: isKyber ? 1 : 0,\n brp: false,\n };\n const dif = FFTCore(field, { dit: false, ...nttOpts });\n const dit = FFTCore(field, { dit: true, ...nttOpts });\n const NTT = {\n encode: (r: T): T => {\n return dif(r) as any;\n },\n decode: (r: T): T => {\n dit(r as any);\n // The inverse-NTT normalization factor is family-specific: FIPS 203 Algorithm 10 line 14\n // uses `128^-1 mod q` for Kyber, while FIPS 204 Algorithm 42 lines 21-23 use `256^-1 mod q`.\n // kyber uses 128 here, because brv && stuff\n for (let i = 0; i < r.length; i++) r[i] = mod(F * r[i]);\n return r;\n },\n };\n // Pack one little-endian `d`-bit word per coefficient, matching FIPS 203 ByteEncode /\n // ByteDecode and the FIPS 204 BitsToBytes-based polynomial packing helpers.\n const bitsCoder = (d: number, c: Coder<number, number>): BytesCoderLen<T> => {\n const mask = getMask(d);\n const bytesLen = d * (N / 8);\n return {\n bytesLen,\n encode: (poly: T): Uint8Array => {\n const r = new Uint8Array(bytesLen);\n for (let i = 0, buf = 0, bufLen = 0, pos = 0; i < poly.length; i++) {\n buf |= (c.encode(poly[i]) & mask) << bufLen;\n bufLen += d;\n for (; bufLen >= 8; bufLen -= 8, buf >>= 8) r[pos++] = buf & getMask(bufLen);\n }\n return r;\n },\n decode: (bytes: Uint8Array): T => {\n const r = newPoly(N);\n for (let i = 0, buf = 0, bufLen = 0, pos = 0; i < bytes.length; i++) {\n buf |= bytes[i] << bufLen;\n bufLen += 8;\n for (; bufLen >= d; bufLen -= d, buf >>= d) r[pos++] = c.decode(buf & mask);\n }\n return r;\n },\n };\n };\n\n return { mod, smod, nttZetas, NTT, bitsCoder };\n};\n\nconst createXofShake =\n (shake: typeof shake128): XOF =>\n (seed: Uint8Array, blockLen?: number) => {\n if (!blockLen) blockLen = shake.blockLen;\n // Optimizations that won't mater:\n // - cached seed update (two .update(), on start and on the end)\n // - another cache which cloned into working copy\n\n // Faster than multiple updates, since seed less than blockLen\n const _seed = new Uint8Array(seed.length + 2);\n _seed.set(seed);\n const seedLen = seed.length;\n const buf = new Uint8Array(blockLen); // == shake128.blockLen\n let h = shake.create({});\n let calls = 0;\n let xofs = 0;\n return {\n stats: () => ({ calls, xofs }),\n get: (x: number, y: number) => {\n // Rebind to `seed || x || y` so callers can implement the spec's per-coordinate\n // SHAKE inputs like `rho || j || i` and `rho || IntegerToBytes(counter, 2)`.\n _seed[seedLen + 0] = x;\n _seed[seedLen + 1] = y;\n h.destroy();\n h = shake.create({}).update(_seed);\n calls++;\n return () => {\n xofs++;\n return h.xofInto(buf);\n };\n },\n clean: () => {\n h.destroy();\n cleanBytes(buf, _seed);\n },\n };\n };\n\n/**\n * SHAKE128-based extendable-output reader factory used by ML-KEM.\n * `get(x, y)` selects one coordinate pair at a time; calling it again invalidates previously\n * returned readers, and each squeeze reuses one mutable internal output buffer.\n * @param seed - Seed bytes for the reader.\n * @param blockLen - Optional output block length.\n * @returns Stateful XOF reader.\n * @example\n * Build the ML-KEM SHAKE128 matrix expander and read one block.\n * ```ts\n * import { randomBytes } from '@noble/post-quantum/utils.js';\n * import { XOF128 } from '@noble/post-quantum/_crystals.js';\n * const reader = XOF128(randomBytes(32));\n * const block = reader.get(0, 0)();\n * ```\n */\nexport const XOF128: XOF = /* @__PURE__ */ createXofShake(shake128);\n/**\n * SHAKE256-based extendable-output reader factory used by ML-DSA.\n * `get(x, y)` appends raw one-byte coordinates to the seed, invalidates previously returned\n * readers, and reuses one mutable internal output buffer for each squeeze.\n * @param seed - Seed bytes for the reader.\n * @param blockLen - Optional output block length.\n * @returns Stateful XOF reader.\n * @example\n * Build the ML-DSA SHAKE256 coefficient expander and read one block.\n * ```ts\n * import { randomBytes } from '@noble/post-quantum/utils.js';\n * import { XOF256 } from '@noble/post-quantum/_crystals.js';\n * const reader = XOF256(randomBytes(32));\n * const block = reader.get(0, 0)();\n * ```\n */\nexport const XOF256: XOF = /* @__PURE__ */ createXofShake(shake256);\n","function checkU32(n) {\n // 0xff_ff_ff_ff\n if (!Number.isSafeInteger(n) || n < 0 || n > 0xffffffff)\n throw new Error('wrong u32 integer:' + n);\n return n;\n}\n/** Checks if integer is in form of `1 << X` */\nexport function isPowerOfTwo(x) {\n checkU32(x);\n return (x & (x - 1)) === 0 && x !== 0;\n}\nexport function nextPowerOfTwo(n) {\n checkU32(n);\n if (n <= 1)\n return 1;\n return (1 << (log2(n - 1) + 1)) >>> 0;\n}\nexport function reverseBits(n, bits) {\n checkU32(n);\n let reversed = 0;\n for (let i = 0; i < bits; i++, n >>>= 1)\n reversed = (reversed << 1) | (n & 1);\n return reversed;\n}\n/** Similar to `bitLen(x)-1` but much faster for small integers, like indices */\nexport function log2(n) {\n checkU32(n);\n return 31 - Math.clz32(n);\n}\n/**\n * Moves lowest bit to highest position, which at first step splits\n * array on even and odd indices, then it applied again to each part,\n * which is core of fft\n */\nexport function bitReversalInplace(values) {\n const n = values.length;\n if (n < 2 || !isPowerOfTwo(n))\n throw new Error('n must be a power of 2 and greater than 1. Got ' + n);\n const bits = log2(n);\n for (let i = 0; i < n; i++) {\n const j = reverseBits(i, bits);\n if (i < j) {\n const tmp = values[i];\n values[i] = values[j];\n values[j] = tmp;\n }\n }\n return values;\n}\nexport function bitReversalPermutation(values) {\n return bitReversalInplace(values.slice());\n}\nconst _1n = /** @__PURE__ */ BigInt(1);\nfunction findGenerator(field) {\n let G = BigInt(2);\n for (; field.eql(field.pow(G, field.ORDER >> _1n), field.ONE); G++)\n ;\n return G;\n}\n/** We limit roots up to 2**31, which is a lot: 2-billion polynomimal should be rare. */\nexport function rootsOfUnity(field, generator) {\n // Factor field.ORDER-1 as oddFactor * 2^powerOfTwo\n let oddFactor = field.ORDER - _1n;\n let powerOfTwo = 0;\n for (; (oddFactor & _1n) !== _1n; powerOfTwo++, oddFactor >>= _1n)\n ;\n // Find non quadratic residue\n let G = generator !== undefined ? BigInt(generator) : findGenerator(field);\n // Powers of generator\n const omegas = new Array(powerOfTwo + 1);\n omegas[powerOfTwo] = field.pow(G, oddFactor);\n for (let i = powerOfTwo; i > 0; i--)\n omegas[i - 1] = field.sqr(omegas[i]);\n // Compute all roots of unity for powers up to maxPower\n const rootsCache = [];\n const checkBits = (bits) => {\n checkU32(bits);\n if (bits > 31 || bits > powerOfTwo)\n throw new Error('rootsOfUnity: wrong bits ' + bits + ' powerOfTwo=' + powerOfTwo);\n return bits;\n };\n const precomputeRoots = (maxPower) => {\n checkBits(maxPower);\n for (let power = maxPower; power >= 0; power--) {\n if (rootsCache[power])\n continue; // Skip if we've already computed roots for this power\n const rootsAtPower = [];\n for (let j = 0, cur = field.ONE; j < 2 ** power; j++, cur = field.mul(cur, omegas[power]))\n rootsAtPower.push(cur);\n rootsCache[power] = rootsAtPower;\n }\n return rootsCache[maxPower];\n };\n const brpCache = new Map();\n const inverseCache = new Map();\n // NOTE: we use bits instead of power, because power = 2**bits,\n // but power is not neccesary isPowerOfTwo(power)!\n return {\n info: { G, powerOfTwo, oddFactor },\n roots: (bits) => {\n const b = checkBits(bits);\n return precomputeRoots(b);\n },\n brp(bits) {\n const b = checkBits(bits);\n if (brpCache.has(b))\n return brpCache.get(b);\n else {\n const res = bitReversalPermutation(this.roots(b));\n brpCache.set(b, res);\n return res;\n }\n },\n inverse(bits) {\n const b = checkBits(bits);\n if (inverseCache.has(b))\n return inverseCache.get(b);\n else {\n const res = field.invertBatch(this.roots(b));\n inverseCache.set(b, res);\n return res;\n }\n },\n omega: (bits) => omegas[checkBits(bits)],\n clear: () => {\n rootsCache.splice(0, rootsCache.length);\n brpCache.clear();\n },\n };\n}\n/**\n * Constructs different flavors of FFT. radix2 implementation of low level mutating API. Flavors:\n *\n * - DIT (Decimation-in-Time): Bottom-Up (leaves -> root), Cool-Turkey\n * - DIF (Decimation-in-Frequency): Top-Down (root -> leaves), Gentleman–Sande\n *\n * DIT takes brp input, returns natural output.\n * DIF takes natural input, returns brp output.\n *\n * The output is actually identical. Time / frequence distinction is not meaningful\n * for Polynomial multiplication in fields.\n * Which means if protocol supports/needs brp output/inputs, then we can skip this step.\n *\n * Cyclic NTT: Rq = Zq[x]/(x^n-1). butterfly_DIT+loop_DIT OR butterfly_DIF+loop_DIT, roots are omega\n * Negacyclic NTT: Rq = Zq[x]/(x^n+1). butterfly_DIT+loop_DIF, at least for mlkem / mldsa\n */\nexport const FFTCore = (F, coreOpts) => {\n const { N, roots, dit, invertButterflies = false, skipStages = 0, brp = true } = coreOpts;\n const bits = log2(N);\n if (!isPowerOfTwo(N))\n throw new Error('FFT: Polynomial size should be power of two');\n const isDit = dit !== invertButterflies;\n isDit;\n return (values) => {\n if (values.length !== N)\n throw new Error('FFT: wrong Polynomial length');\n if (dit && brp)\n bitReversalInplace(values);\n for (let i = 0, g = 1; i < bits - skipStages; i++) {\n // For each stage s (sub-FFT length m = 2^s)\n const s = dit ? i + 1 + skipStages : bits - i;\n const m = 1 << s;\n const m2 = m >> 1;\n const stride = N >> s;\n // Loop over each subarray of length m\n for (let k = 0; k < N; k += m) {\n // Loop over each butterfly within the subarray\n for (let j = 0, grp = g++; j < m2; j++) {\n const rootPos = invertButterflies ? (dit ? N - grp : grp) : j * stride;\n const i0 = k + j;\n const i1 = k + j + m2;\n const omega = roots[rootPos];\n const b = values[i1];\n const a = values[i0];\n // Inlining gives us 10% perf in kyber vs functions\n if (isDit) {\n const t = F.mul(b, omega); // Standard DIT butterfly\n values[i0] = F.add(a, t);\n values[i1] = F.sub(a, t);\n }\n else if (invertButterflies) {\n values[i0] = F.add(b, a); // DIT loop + inverted butterflies (Kyber decode)\n values[i1] = F.mul(F.sub(b, a), omega);\n }\n else {\n values[i0] = F.add(a, b); // Standard DIF butterfly\n values[i1] = F.mul(F.sub(a, b), omega);\n }\n }\n }\n }\n if (!dit && brp)\n bitReversalInplace(values);\n return values;\n };\n};\n/**\n * NTT aka FFT over finite field (NOT over complex numbers).\n * Naming mirrors other libraries.\n */\nexport function FFT(roots, opts) {\n const getLoop = (N, roots, brpInput = false, brpOutput = false) => {\n if (brpInput && brpOutput) {\n // we cannot optimize this case, but lets support it anyway\n return (values) => FFTCore(opts, { N, roots, dit: false, brp: false })(bitReversalInplace(values));\n }\n if (brpInput)\n return FFTCore(opts, { N, roots, dit: true, brp: false });\n if (brpOutput)\n return FFTCore(opts, { N, roots, dit: false, brp: false });\n return FFTCore(opts, { N, roots, dit: true, brp: true }); // all natural\n };\n return {\n direct(values, brpInput = false, brpOutput = false) {\n const N = values.length;\n if (!isPowerOfTwo(N))\n throw new Error('FFT: Polynomial size should be power of two');\n const bits = log2(N);\n return getLoop(N, roots.roots(bits), brpInput, brpOutput)(values.slice());\n },\n inverse(values, brpInput = false, brpOutput = false) {\n const N = values.length;\n const bits = log2(N);\n const res = getLoop(N, roots.inverse(bits), brpInput, brpOutput)(values.slice());\n const ivm = opts.inv(BigInt(values.length)); // scale\n // we can get brp output if we use dif instead of dit!\n for (let i = 0; i < res.length; i++)\n res[i] = opts.mul(res[i], ivm);\n // Allows to re-use non-inverted roots, but is VERY fragile\n // return [res[0]].concat(res.slice(1).reverse());\n // inverse calculated as pow(-1), which transforms into ω^{-kn} (-> reverses indices)\n return res;\n },\n };\n}\nexport function poly(field, roots, create, fft, length) {\n const F = field;\n const _create = create ||\n ((len, elm) => new Array(len).fill(elm ?? F.ZERO));\n const isPoly = (x) => Array.isArray(x) || ArrayBuffer.isView(x);\n const checkLength = (...lst) => {\n if (!lst.length)\n return 0;\n for (const i of lst)\n if (!isPoly(i))\n throw new Error('poly: not polynomial: ' + i);\n const L = lst[0].length;\n for (let i = 1; i < lst.length; i++)\n if (lst[i].length !== L)\n throw new Error(`poly: mismatched lengths ${L} vs ${lst[i].length}`);\n if (length !== undefined && L !== length)\n throw new Error(`poly: expected fixed length ${length}, got ${L}`);\n return L;\n };\n function findOmegaIndex(x, n, brp = false) {\n const bits = log2(n);\n const omega = brp ? roots.brp(bits) : roots.roots(bits);\n for (let i = 0; i < n; i++)\n if (F.eql(x, omega[i]))\n return i;\n return -1;\n }\n // TODO: mutating versions for mlkem/mldsa\n return {\n roots,\n create: _create,\n length,\n extend: (a, len) => {\n checkLength(a);\n const out = _create(len, F.ZERO);\n for (let i = 0; i < a.length; i++)\n out[i] = a[i];\n return out;\n },\n degree: (a) => {\n checkLength(a);\n for (let i = a.length - 1; i >= 0; i--)\n if (!F.is0(a[i]))\n return i;\n return -1;\n },\n add: (a, b) => {\n const len = checkLength(a, b);\n const out = _create(len);\n for (let i = 0; i < len; i++)\n out[i] = F.add(a[i], b[i]);\n return out;\n },\n sub: (a, b) => {\n const len = checkLength(a, b);\n const out = _create(len);\n for (let i = 0; i < len; i++)\n out[i] = F.sub(a[i], b[i]);\n return out;\n },\n dot: (a, b) => {\n const len = checkLength(a, b);\n const out = _create(len);\n for (let i = 0; i < len; i++)\n out[i] = F.mul(a[i], b[i]);\n return out;\n },\n mul: (a, b) => {\n if (isPoly(b)) {\n const len = checkLength(a, b);\n if (fft) {\n const A = fft.direct(a, false, true);\n const B = fft.direct(b, false, true);\n for (let i = 0; i < A.length; i++)\n A[i] = F.mul(A[i], B[i]);\n return fft.inverse(A, true, false);\n }\n else {\n // NOTE: this is quadratic and mostly for compat tests with FFT\n const res = _create(len);\n for (let i = 0; i < len; i++) {\n for (let j = 0; j < len; j++) {\n const k = (i + j) % len; // wrap mod length\n res[k] = F.add(res[k], F.mul(a[i], b[j]));\n }\n }\n return res;\n }\n }\n else {\n const out = _create(checkLength(a));\n for (let i = 0; i < out.length; i++)\n out[i] = F.mul(a[i], b);\n return out;\n }\n },\n convolve(a, b) {\n const len = nextPowerOfTwo(a.length + b.length - 1);\n return this.mul(this.extend(a, len), this.extend(b, len));\n },\n shift(p, factor) {\n const out = _create(checkLength(p));\n out[0] = p[0];\n for (let i = 1, power = F.ONE; i < p.length; i++) {\n power = F.mul(power, factor);\n out[i] = F.mul(p[i], power);\n }\n return out;\n },\n clone: (a) => {\n checkLength(a);\n const out = _create(a.length);\n for (let i = 0; i < a.length; i++)\n out[i] = a[i];\n return out;\n },\n eval: (a, basis) => {\n checkLength(a);\n let acc = F.ZERO;\n for (let i = 0; i < a.length; i++)\n acc = F.add(acc, F.mul(a[i], basis[i]));\n return acc;\n },\n monomial: {\n basis: (x, n) => {\n const out = _create(n);\n let pow = F.ONE;\n for (let i = 0; i < n; i++) {\n out[i] = pow;\n pow = F.mul(pow, x);\n }\n return out;\n },\n eval: (a, x) => {\n checkLength(a);\n // Same as eval(a, monomialBasis(x, a.length)), but it is faster this way\n let acc = F.ZERO;\n for (let i = a.length - 1; i >= 0; i--)\n acc = F.add(F.mul(acc, x), a[i]);\n return acc;\n },\n },\n lagrange: {\n basis: (x, n, brp = false, weights) => {\n const bits = log2(n);\n const cache = weights || brp ? roots.brp(bits) : roots.roots(bits); // [ω⁰, ω¹, ..., ωⁿ⁻¹]\n const out = _create(n);\n // Fast Kronecker-δ shortcut\n const idx = findOmegaIndex(x, n, brp);\n if (idx !== -1) {\n out[idx] = F.ONE;\n return out;\n }\n const tm = F.pow(x, BigInt(n));\n const c = F.mul(F.sub(tm, F.ONE), F.inv(BigInt(n))); // c = (xⁿ - 1)/n\n const denom = _create(n);\n for (let i = 0; i < n; i++)\n denom[i] = F.sub(x, cache[i]);\n const inv = F.invertBatch(denom);\n for (let i = 0; i < n; i++)\n out[i] = F.mul(c, F.mul(cache[i], inv[i]));\n return out;\n },\n eval(a, x, brp = false) {\n checkLength(a);\n const idx = findOmegaIndex(x, a.length, brp);\n if (idx !== -1)\n return a[idx]; // fast path\n const L = this.basis(x, a.length, brp); // Lᵢ(x)\n let acc = F.ZERO;\n for (let i = 0; i < a.length; i++)\n if (!F.is0(a[i]))\n acc = F.add(acc, F.mul(a[i], L[i]));\n return acc;\n },\n },\n vanishing(roots) {\n checkLength(roots);\n const out = _create(roots.length + 1, F.ZERO);\n out[0] = F.ONE;\n for (const r of roots) {\n const neg = F.neg(r);\n for (let j = out.length - 1; j > 0; j--)\n out[j] = F.add(F.mul(out[j], neg), out[j - 1]);\n out[0] = F.mul(out[0], neg);\n }\n return out;\n },\n };\n}\n//# sourceMappingURL=fft.js.map","/**\n * Experimental implementation of NTT / FFT (Fast Fourier Transform) over finite fields.\n * API may change at any time. The code has not been audited. Feature requests are welcome.\n * @module\n */\nimport type { IField } from './modular.ts';\n\nexport interface MutableArrayLike<T> {\n [index: number]: T;\n length: number;\n slice(start?: number, end?: number): this;\n [Symbol.iterator](): Iterator<T>;\n}\n\nfunction checkU32(n: number) {\n // 0xff_ff_ff_ff\n if (!Number.isSafeInteger(n) || n < 0 || n > 0xffffffff)\n throw new Error('wrong u32 integer:' + n);\n return n;\n}\n\n/** Checks if integer is in form of `1 << X` */\nexport function isPowerOfTwo(x: number): boolean {\n checkU32(x);\n return (x & (x - 1)) === 0 && x !== 0;\n}\n\nexport function nextPowerOfTwo(n: number): number {\n checkU32(n);\n if (n <= 1) return 1;\n return (1 << (log2(n - 1) + 1)) >>> 0;\n}\n\nexport function reverseBits(n: number, bits: number): number {\n checkU32(n);\n let reversed = 0;\n for (let i = 0; i < bits; i++, n >>>= 1) reversed = (reversed << 1) | (n & 1);\n return reversed;\n}\n\n/** Similar to `bitLen(x)-1` but much faster for small integers, like indices */\nexport function log2(n: number): number {\n checkU32(n);\n return 31 - Math.clz32(n);\n}\n\n/**\n * Moves lowest bit to highest position, which at first step splits\n * array on even and odd indices, then it applied again to each part,\n * which is core of fft\n */\nexport function bitReversalInplace<T extends MutableArrayLike<any>>(values: T): T {\n const n = values.length;\n if (n < 2 || !isPowerOfTwo(n))\n throw new Error('n must be a power of 2 and greater than 1. Got ' + n);\n const bits = log2(n);\n for (let i = 0; i < n; i++) {\n const j = reverseBits(i, bits);\n if (i < j) {\n const tmp = values[i];\n values[i] = values[j];\n values[j] = tmp;\n }\n }\n return values;\n}\n\nexport function bitReversalPermutation<T>(values: T[]): T[] {\n return bitReversalInplace(values.slice()) as T[];\n}\n\nconst _1n = /** @__PURE__ */ BigInt(1);\nfunction findGenerator(field: IField<bigint>) {\n let G = BigInt(2);\n for (; field.eql(field.pow(G, field.ORDER >> _1n), field.ONE); G++);\n return G;\n}\n\nexport type RootsOfUnity = {\n info: { G: bigint; oddFactor: bigint; powerOfTwo: number };\n roots: (bits: number) => bigint[];\n brp(bits: number): bigint[];\n inverse(bits: number): bigint[];\n omega: (bits: number) => bigint;\n clear: () => void;\n};\n/** We limit roots up to 2**31, which is a lot: 2-billion polynomimal should be rare. */\nexport function rootsOfUnity(field: IField<bigint>, generator?: bigint): RootsOfUnity {\n // Factor field.ORDER-1 as oddFactor * 2^powerOfTwo\n let oddFactor = field.ORDER - _1n;\n let powerOfTwo = 0;\n for (; (oddFactor & _1n) !== _1n; powerOfTwo++, oddFactor >>= _1n);\n\n // Find non quadratic residue\n let G = generator !== undefined ? BigInt(generator) : findGenerator(field);\n // Powers of generator\n const omegas: bigint[] = new Array(powerOfTwo + 1);\n omegas[powerOfTwo] = field.pow(G, oddFactor);\n for (let i = powerOfTwo; i > 0; i--) omegas[i - 1] = field.sqr(omegas[i]);\n // Compute all roots of unity for powers up to maxPower\n const rootsCache: bigint[][] = [];\n const checkBits = (bits: number) => {\n checkU32(bits);\n if (bits > 31 || bits > powerOfTwo)\n throw new Error('rootsOfUnity: wrong bits ' + bits + ' powerOfTwo=' + powerOfTwo);\n return bits;\n };\n const precomputeRoots = (maxPower: number) => {\n checkBits(maxPower);\n for (let power = maxPower; power >= 0; power--) {\n if (rootsCache[power]) continue; // Skip if we've already computed roots for this power\n const rootsAtPower: bigint[] = [];\n for (let j = 0, cur = field.ONE; j < 2 ** power; j++, cur = field.mul(cur, omegas[power]))\n rootsAtPower.push(cur);\n rootsCache[power] = rootsAtPower;\n }\n return rootsCache[maxPower];\n };\n const brpCache = new Map<number, bigint[]>();\n const inverseCache = new Map<number, bigint[]>();\n\n // NOTE: we use bits instead of power, because power = 2**bits,\n // but power is not neccesary isPowerOfTwo(power)!\n return {\n info: { G, powerOfTwo, oddFactor },\n roots: (bits: number): bigint[] => {\n const b = checkBits(bits);\n return precomputeRoots(b);\n },\n brp(bits: number): bigint[] {\n const b = checkBits(bits);\n if (brpCache.has(b)) return brpCache.get(b)!;\n else {\n const res = bitReversalPermutation(this.roots(b));\n brpCache.set(b, res);\n return res;\n }\n },\n inverse(bits: number): bigint[] {\n const b = checkBits(bits);\n if (inverseCache.has(b)) return inverseCache.get(b)!;\n else {\n const res = field.invertBatch(this.roots(b));\n inverseCache.set(b, res);\n return res;\n }\n },\n omega: (bits: number): bigint => omegas[checkBits(bits)],\n clear: (): void => {\n rootsCache.splice(0, rootsCache.length);\n brpCache.clear();\n },\n };\n}\n\nexport type Polynomial<T> = MutableArrayLike<T>;\n\n/**\n * Maps great to Field<bigint>, but not to Group (EC points):\n * - inv from scalar field\n * - we need multiplyUnsafe here, instead of multiply for speed\n * - multiplyUnsafe is safe in the context: we do mul(rootsOfUnity), which are public and sparse\n */\nexport type FFTOpts<T, R> = {\n add: (a: T, b: T) => T;\n sub: (a: T, b: T) => T;\n mul: (a: T, scalar: R) => T;\n inv: (a: R) => R;\n};\n\nexport type FFTCoreOpts<R> = {\n N: number;\n roots: Polynomial<R>;\n dit: boolean;\n invertButterflies?: boolean;\n skipStages?: number;\n brp?: boolean;\n};\n\nexport type FFTCoreLoop<T> = <P extends Polynomial<T>>(values: P) => P;\n\n/**\n * Constructs different flavors of FFT. radix2 implementation of low level mutating API. Flavors:\n *\n * - DIT (Decimation-in-Time): Bottom-Up (leaves -> root), Cool-Turkey\n * - DIF (Decimation-in-Frequency): Top-Down (root -> leaves), Gentleman–Sande\n *\n * DIT takes brp input, returns natural output.\n * DIF takes natural input, returns brp output.\n *\n * The output is actually identical. Time / frequence distinction is not meaningful\n * for Polynomial multiplication in fields.\n * Which means if protocol supports/needs brp output/inputs, then we can skip this step.\n *\n * Cyclic NTT: Rq = Zq[x]/(x^n-1). butterfly_DIT+loop_DIT OR butterfly_DIF+loop_DIT, roots are omega\n * Negacyclic NTT: Rq = Zq[x]/(x^n+1). butterfly_DIT+loop_DIF, at least for mlkem / mldsa\n */\nexport const FFTCore = <T, R>(F: FFTOpts<T, R>, coreOpts: FFTCoreOpts<R>): FFTCoreLoop<T> => {\n const { N, roots, dit, invertButterflies = false, skipStages = 0, brp = true } = coreOpts;\n const bits = log2(N);\n if (!isPowerOfTwo(N)) throw new Error('FFT: Polynomial size should be power of two');\n const isDit = dit !== invertButterflies;\n isDit;\n return <P extends Polynomial<T>>(values: P): P => {\n if (values.length !== N) throw new Error('FFT: wrong Polynomial length');\n if (dit && brp) bitReversalInplace(values);\n for (let i = 0, g = 1; i < bits - skipStages; i++) {\n // For each stage s (sub-FFT length m = 2^s)\n const s = dit ? i + 1 + skipStages : bits - i;\n const m = 1 << s;\n const m2 = m >> 1;\n const stride = N >> s;\n // Loop over each subarray of length m\n for (let k = 0; k < N; k += m) {\n // Loop over each butterfly within the subarray\n for (let j = 0, grp = g++; j < m2; j++) {\n const rootPos = invertButterflies ? (dit ? N - grp : grp) : j * stride;\n const i0 = k + j;\n const i1 = k + j + m2;\n const omega = roots[rootPos];\n const b = values[i1];\n const a = values[i0];\n // Inlining gives us 10% perf in kyber vs functions\n if (isDit) {\n const t = F.mul(b, omega); // Standard DIT butterfly\n values[i0] = F.add(a, t);\n values[i1] = F.sub(a, t);\n } else if (invertButterflies) {\n values[i0] = F.add(b, a); // DIT loop + inverted butterflies (Kyber decode)\n values[i1] = F.mul(F.sub(b, a), omega);\n } else {\n values[i0] = F.add(a, b); // Standard DIF butterfly\n values[i1] = F.mul(F.sub(a, b), omega);\n }\n }\n }\n }\n if (!dit && brp) bitReversalInplace(values);\n return values;\n };\n};\n\nexport type FFTMethods<T> = {\n direct<P extends Polynomial<T>>(values: P, brpInput?: boolean, brpOutput?: boolean): P;\n inverse<P extends Polynomial<T>>(values: P, brpInput?: boolean, brpOutput?: boolean): P;\n};\n\n/**\n * NTT aka FFT over finite field (NOT over complex numbers).\n * Naming mirrors other libraries.\n */\nexport function FFT<T>(roots: RootsOfUnity, opts: FFTOpts<T, bigint>): FFTMethods<T> {\n const getLoop = (\n N: number,\n roots: Polynomial<bigint>,\n brpInput = false,\n brpOutput = false\n ): (<P extends Polynomial<T>>(values: P) => P) => {\n if (brpInput && brpOutput) {\n // we cannot optimize this case, but lets support it anyway\n return (values) =>\n FFTCore(opts, { N, roots, dit: false, brp: false })(bitReversalInplace(values));\n }\n if (brpInput) return FFTCore(opts, { N, roots, dit: true, brp: false });\n if (brpOutput) return FFTCore(opts, { N, roots, dit: false, brp: false });\n return FFTCore(opts, { N, roots, dit: true, brp: true }); // all natural\n };\n return {\n direct<P extends Polynomial<T>>(values: P, brpInput = false, brpOutput = false): P {\n const N = values.length;\n if (!isPowerOfTwo(N)) throw new Error('FFT: Polynomial size should be power of two');\n const bits = log2(N);\n return getLoop(N, roots.roots(bits), brpInput, brpOutput)<P>(values.slice());\n },\n inverse<P extends Polynomial<T>>(values: P, brpInput = false, brpOutput = false): P {\n const N = values.length;\n const bits = log2(N);\n const res = getLoop(N, roots.inverse(bits), brpInput, brpOutput)(values.slice());\n const ivm = opts.inv(BigInt(values.length)); // scale\n // we can get brp output if we use dif instead of dit!\n for (let i = 0; i < res.length; i++) res[i] = opts.mul(res[i], ivm);\n // Allows to re-use non-inverted roots, but is VERY fragile\n // return [res[0]].concat(res.slice(1).reverse());\n // inverse calculated as pow(-1), which transforms into ω^{-kn} (-> reverses indices)\n return res;\n },\n };\n}\n\nexport type CreatePolyFn<P extends Polynomial<T>, T> = (len: number, elm?: T) => P;\n\nexport type PolyFn<P extends Polynomial<T>, T> = {\n roots: RootsOfUnity;\n create: CreatePolyFn<P, T>;\n length?: number; // optional enforced size\n\n degree: (a: P) => number;\n extend: (a: P, len: number) => P;\n add: (a: P, b: P) => P; // fc(x) = fa(x) + fb(x)\n sub: (a: P, b: P) => P; // fc(x) = fa(x) - fb(x)\n mul: (a: P, b: P | T) => P; // fc(x) = fa(x) * fb(x) OR fc(x) = fa(x) * scalar (same as field)\n dot: (a: P, b: P) => P; // point-wise coeff multiplication\n convolve: (a: P, b: P) => P;\n shift: (p: P, factor: bigint) => P; // point-wise coeffcient shift\n clone: (a: P) => P;\n // Eval\n eval: (a: P, basis: P) => T; // y = fc(x)\n monomial: {\n basis: (x: T, n: number) => P;\n eval: (a: P, x: T) => T;\n };\n lagrange: {\n basis: (x: T, n: number, brp?: boolean) => P;\n eval: (a: P, x: T, brp?: boolean) => T;\n };\n // Complex\n vanishing: (roots: P) => P; // f(x) = 0 for every x in roots\n};\n\n/**\n * Poly wants a cracker.\n *\n * Polynomials are functions like `y=f(x)`, which means when we multiply two polynomials, result is\n * function `f3(x) = f1(x) * f2(x)`, we don't multiply values. Key takeaways:\n *\n * - **Polynomial** is an array of coefficients: `f(x) = sum(coeff[i] * basis[i](x))`\n * - **Basis** is array of functions\n * - **Monominal** is Polynomial where `basis[i](x) == x**i` (powers)\n * - **Array size** is domain size\n * - **Lattice** is matrix (Polynomial of Polynomials)\n */\nexport function poly<T>(\n field: IField<T>,\n roots: RootsOfUnity,\n create?: undefined,\n fft?: FFTMethods<T>,\n length?: number\n): PolyFn<T[], T>;\nexport function poly<T, P extends Polynomial<T>>(\n field: IField<T>,\n roots: RootsOfUnity,\n create: CreatePolyFn<P, T>,\n fft?: FFTMethods<T>,\n length?: number\n): PolyFn<P, T>;\nexport function poly<T, P extends Polynomial<T>>(\n field: IField<T>,\n roots: RootsOfUnity,\n create?: CreatePolyFn<P, T>,\n fft?: FFTMethods<T>,\n length?: number\n): PolyFn<any, T> {\n const F = field;\n const _create =\n create ||\n (((len: number, elm?: T): Polynomial<T> => new Array(len).fill(elm ?? F.ZERO)) as CreatePolyFn<\n P,\n T\n >);\n\n const isPoly = (x: any): x is P => Array.isArray(x) || ArrayBuffer.isView(x);\n const checkLength = (...lst: P[]): number => {\n if (!lst.length) return 0;\n for (const i of lst) if (!isPoly(i)) throw new Error('poly: not polynomial: ' + i);\n const L = lst[0].length;\n for (let i = 1; i < lst.length; i++)\n if (lst[i].length !== L) throw new Error(`poly: mismatched lengths ${L} vs ${lst[i].length}`);\n if (length !== undefined && L !== length)\n throw new Error(`poly: expected fixed length ${length}, got ${L}`);\n return L;\n };\n function findOmegaIndex(x: T, n: number, brp = false): number {\n const bits = log2(n);\n const omega = brp ? roots.brp(bits) : roots.roots(bits);\n for (let i = 0; i < n; i++) if (F.eql(x, omega[i] as T)) return i;\n return -1;\n }\n // TODO: mutating versions for mlkem/mldsa\n return {\n roots,\n create: _create,\n length,\n extend: (a: P, len: number): P => {\n checkLength(a);\n const out = _create(len, F.ZERO);\n for (let i = 0; i < a.length; i++) out[i] = a[i];\n return out;\n },\n degree: (a: P): number => {\n checkLength(a);\n for (let i = a.length - 1; i >= 0; i--) if (!F.is0(a[i])) return i;\n return -1;\n },\n add: (a: P, b: P): P => {\n const len = checkLength(a, b);\n const out = _create(len);\n for (let i = 0; i < len; i++) out[i] = F.add(a[i], b[i]);\n return out;\n },\n sub: (a: P, b: P): P => {\n const len = checkLength(a, b);\n const out = _create(len);\n for (let i = 0; i < len; i++) out[i] = F.sub(a[i], b[i]);\n return out;\n },\n dot: (a: P, b: P): P => {\n const len = checkLength(a, b);\n const out = _create(len);\n for (let i = 0; i < len; i++) out[i] = F.mul(a[i], b[i]);\n return out;\n },\n mul: (a: P, b: P | T): P => {\n if (isPoly(b)) {\n const len = checkLength(a, b);\n if (fft) {\n const A = fft.direct(a, false, true);\n const B = fft.direct(b, false, true);\n for (let i = 0; i < A.length; i++) A[i] = F.mul(A[i], B[i]);\n return fft.inverse(A, true, false) as P;\n } else {\n // NOTE: this is quadratic and mostly for compat tests with FFT\n const res = _create(len);\n for (let i = 0; i < len; i++) {\n for (let j = 0; j < len; j++) {\n const k = (i + j) % len; // wrap mod length\n res[k] = F.add(res[k], F.mul(a[i], b[j]));\n }\n }\n return res;\n }\n } else {\n const out = _create(checkLength(a));\n for (let i = 0; i < out.length; i++) out[i] = F.mul(a[i], b);\n return out;\n }\n },\n convolve(a: P, b: P): P {\n const len = nextPowerOfTwo(a.length + b.length - 1);\n return this.mul(this.extend(a, len), this.extend(b, len));\n },\n shift(p: P, factor: bigint): P {\n const out = _create(checkLength(p));\n out[0] = p[0];\n for (let i = 1, power = F.ONE; i < p.length; i++) {\n power = F.mul(power, factor);\n out[i] = F.mul(p[i], power);\n }\n return out;\n },\n clone: (a: P): P => {\n checkLength(a);\n const out = _create(a.length);\n for (let i = 0; i < a.length; i++) out[i] = a[i];\n return out;\n },\n eval: (a: P, basis: P): T => {\n checkLength(a);\n let acc = F.ZERO;\n for (let i = 0; i < a.length; i++) acc = F.add(acc, F.mul(a[i], basis[i]));\n return acc;\n },\n monomial: {\n basis: (x: T, n: number): P => {\n const out = _create(n);\n let pow = F.ONE;\n for (let i = 0; i < n; i++) {\n out[i] = pow;\n pow = F.mul(pow, x);\n }\n return out;\n },\n eval: (a: P, x: T): T => {\n checkLength(a);\n // Same as eval(a, monomialBasis(x, a.length)), but it is faster this way\n let acc = F.ZERO;\n for (let i = a.length - 1; i >= 0; i--) acc = F.add(F.mul(acc, x), a[i]);\n return acc;\n },\n },\n lagrange: {\n basis: (x: T, n: number, brp = false, weights?: P): P => {\n const bits = log2(n);\n const cache = weights || brp ? roots.brp(bits) : roots.roots(bits); // [ω⁰, ω¹, ..., ωⁿ⁻¹]\n const out = _create(n);\n // Fast Kronecker-δ shortcut\n const idx = findOmegaIndex(x, n, brp);\n if (idx !== -1) {\n out[idx] = F.ONE;\n return out;\n }\n const tm = F.pow(x, BigInt(n));\n const c = F.mul(F.sub(tm, F.ONE), F.inv(BigInt(n) as T)); // c = (xⁿ - 1)/n\n const denom = _create(n);\n for (let i = 0; i < n; i++) denom[i] = F.sub(x, cache[i] as T);\n const inv = F.invertBatch(denom as any as T[]);\n for (let i = 0; i < n; i++) out[i] = F.mul(c, F.mul(cache[i] as T, inv[i]));\n return out;\n },\n eval(a: P, x: T, brp = false): T {\n checkLength(a);\n const idx = findOmegaIndex(x, a.length, brp);\n if (idx !== -1) return a[idx]; // fast path\n const L = this.basis(x, a.length, brp); // Lᵢ(x)\n let acc = F.ZERO;\n for (let i = 0; i < a.length; i++) if (!F.is0(a[i])) acc = F.add(acc, F.mul(a[i], L[i]));\n return acc;\n },\n },\n vanishing(roots: P): P {\n checkLength(roots);\n const out = _create(roots.length + 1, F.ZERO);\n out[0] = F.ONE;\n for (const r of roots) {\n const neg = F.neg(r);\n for (let j = out.length - 1; j > 0; j--) out[j] = F.add(F.mul(out[j], neg), out[j - 1]);\n out[0] = F.mul(out[0], neg);\n }\n return out;\n },\n };\n}\n","/**\n * Utilities for hex, bytearray and number handling.\n * @module\n */\n/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */\nimport { abytes, abytes as abytes_, concatBytes, isLE, randomBytes as randb, } from '@noble/hashes/utils.js';\n/**\n * Asserts that a value is a byte array and optionally checks its length.\n * Returns the original reference unchanged on success, and currently also accepts Node `Buffer`\n * values through the upstream validator.\n * This helper throws on malformed input, so APIs that must return `false` need to guard lengths\n * before decoding or before calling it.\n * @example\n * Validate that a value is a byte array with the expected length.\n * ```ts\n * abytes(new Uint8Array([1]), 1);\n * ```\n */\nconst abytesDoc = abytes;\nexport { abytesDoc as abytes };\n/**\n * Concatenates byte arrays into a new `Uint8Array`.\n * Zero arguments return an empty `Uint8Array`.\n * Invalid segments throw before allocation because each argument is validated first.\n * @example\n * Concatenate two byte arrays into one result.\n * ```ts\n * concatBytes(new Uint8Array([1]), new Uint8Array([2]));\n * ```\n */\nconst concatBytesDoc = concatBytes;\nexport { concatBytesDoc as concatBytes };\n/**\n * Returns cryptographically secure random bytes.\n * Requires `globalThis.crypto.getRandomValues` and throws if that API is unavailable.\n * `bytesLength` is validated by the upstream helper as a non-negative integer before allocation,\n * so negative and fractional values both throw instead of truncating through JS `ToIndex`.\n * @example\n * Generate a fresh random seed.\n * ```ts\n * const seed = randomBytes(4);\n * ```\n */\nexport const randomBytes = randb;\n/**\n * Compares two byte arrays in a length-constant way for equal lengths.\n * Unequal lengths return `false` immediately, and there is no runtime type validation.\n * @param a - First byte array.\n * @param b - Second byte array.\n * @returns Whether both arrays contain the same bytes.\n * @example\n * Compare two byte arrays for equality.\n * ```ts\n * equalBytes(new Uint8Array([1]), new Uint8Array([1]));\n * ```\n */\nexport function equalBytes(a, b) {\n if (a.length !== b.length)\n return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++)\n diff |= a[i] ^ b[i];\n return diff === 0;\n}\n/**\n * Copies bytes into a fresh `Uint8Array`.\n * Returns a detached plain `Uint8Array`, and currently accepts broader array-like / iterable\n * inputs because it delegates directly to `Uint8Array.from(...)`.\n * @param bytes - Source bytes.\n * @returns Copy of the input bytes.\n * @example\n * Copy bytes into a fresh array.\n * ```ts\n * copyBytes(new Uint8Array([1, 2]));\n * ```\n */\nexport function copyBytes(bytes) {\n return Uint8Array.from(bytes);\n}\n/**\n * Byte-swaps each 64-bit lane in place.\n * Falcon's exact binary64 tables are stored as little-endian byte payloads, so BE runtimes need\n * this boundary helper before aliasing them as host `Float64Array` lanes.\n * @param arr - Byte buffer whose length is a multiple of 8.\n * @returns The same buffer after in-place 64-bit lane byte swaps.\n */\nexport function byteSwap64(arr) {\n const bytes = new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n for (let i = 0; i < bytes.length; i += 8) {\n const a0 = bytes[i + 0];\n const a1 = bytes[i + 1];\n const a2 = bytes[i + 2];\n const a3 = bytes[i + 3];\n bytes[i + 0] = bytes[i + 7];\n bytes[i + 1] = bytes[i + 6];\n bytes[i + 2] = bytes[i + 5];\n bytes[i + 3] = bytes[i + 4];\n bytes[i + 4] = a3;\n bytes[i + 5] = a2;\n bytes[i + 6] = a1;\n bytes[i + 7] = a0;\n }\n return arr;\n}\nexport const baswap64If = isLE\n ? (arr) => arr\n : byteSwap64;\n/**\n * Validates that an options bag is a plain object.\n * @param opts - Options object to validate.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate that an options bag is a plain object.\n * ```ts\n * validateOpts({});\n * ```\n */\nexport function validateOpts(opts) {\n // Arrays silently passed here before, but these call sites expect named option-bag fields.\n if (Object.prototype.toString.call(opts) !== '[object Object]')\n throw new TypeError('expected valid options object');\n}\n/**\n * Validates common verification options.\n * `context` itself is validated with `abytes(...)`, and individual algorithms may narrow support\n * further after this shared plain-object gate.\n * @param opts - Verification options. See {@link VerOpts}.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate common verification options.\n * ```ts\n * validateVerOpts({ context: new Uint8Array([1]) });\n * ```\n */\nexport function validateVerOpts(opts) {\n validateOpts(opts);\n if (opts.context !== undefined)\n abytes(opts.context, undefined, 'opts.context');\n}\n/**\n * Validates common signing options.\n * `extraEntropy` is validated with `abytes(...)`; exact lengths and extra algorithm-specific\n * restrictions are enforced later by callers.\n * @param opts - Signing options. See {@link SigOpts}.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate common signing options.\n * ```ts\n * validateSigOpts({ extraEntropy: new Uint8Array([1]) });\n * ```\n */\nexport function validateSigOpts(opts) {\n validateVerOpts(opts);\n if (opts.extraEntropy !== false && opts.extraEntropy !== undefined)\n abytes(opts.extraEntropy, undefined, 'opts.extraEntropy');\n}\n/**\n * Builds a fixed-layout coder from byte lengths and nested coders.\n * Raw-length fields decode as zero-copy `subarray(...)` views, and nested coders may preserve that\n * aliasing too. Nested coder `encode(...)` results are treated as owned scratch: `splitCoder`\n * copies them into the output and then zeroizes them with `fill(0)`. If a nested encoder forwards\n * caller-owned bytes, it must do so only after detaching them into a disposable copy.\n * @param label - Label used in validation errors.\n * @param lengths - Field lengths or nested coders.\n * @returns Composite fixed-length coder.\n * @example\n * Build a fixed-layout coder from byte lengths and nested coders.\n * ```ts\n * splitCoder('demo', 1, 2).encode([new Uint8Array([1]), new Uint8Array([2, 3])]);\n * ```\n */\nexport function splitCoder(label, ...lengths) {\n const getLength = (c) => (typeof c === 'number' ? c : c.bytesLen);\n const bytesLen = lengths.reduce((sum, a) => sum + getLength(a), 0);\n return {\n bytesLen,\n encode: (bufs) => {\n const res = new Uint8Array(bytesLen);\n for (let i = 0, pos = 0; i < lengths.length; i++) {\n const c = lengths[i];\n const l = getLength(c);\n const b = typeof c === 'number' ? bufs[i] : c.encode(bufs[i]);\n abytes_(b, l, label);\n res.set(b, pos);\n if (typeof c !== 'number')\n b.fill(0); // clean\n pos += l;\n }\n return res;\n },\n decode: (buf) => {\n abytes_(buf, bytesLen, label);\n const res = [];\n for (const c of lengths) {\n const l = getLength(c);\n const b = buf.subarray(0, l);\n res.push(typeof c === 'number' ? b : c.decode(b));\n buf = buf.subarray(l);\n }\n return res;\n },\n };\n}\n// nano-packed.array (fixed size)\n/**\n * Builds a fixed-length vector coder from another fixed-length coder.\n * Element decoding receives `subarray(...)` views, so aliasing depends on the element coder.\n * Element coder `encode(...)` results are treated as owned scratch: `vecCoder` copies them into\n * the output and then zeroizes them with `fill(0)`. If an element encoder forwards caller-owned\n * bytes, it must do so only after detaching them into a disposable copy. `vecCoder` also trusts\n * the `BytesCoderLen` contract: each encoded element must already be exactly `c.bytesLen` bytes.\n * @param c - Element coder.\n * @param vecLen - Number of elements in the vector.\n * @returns Fixed-length vector coder.\n * @example\n * Build a fixed-length vector coder from another fixed-length coder.\n * ```ts\n * vecCoder(\n * { bytesLen: 1, encode: (n: number) => Uint8Array.of(n), decode: (b: Uint8Array) => b[0] || 0 },\n * 2\n * ).encode([1, 2]);\n * ```\n */\nexport function vecCoder(c, vecLen) {\n const bytesLen = vecLen * c.bytesLen;\n return {\n bytesLen,\n encode: (u) => {\n if (u.length !== vecLen)\n throw new RangeError(`vecCoder.encode: wrong length=${u.length}. Expected: ${vecLen}`);\n const res = new Uint8Array(bytesLen);\n for (let i = 0, pos = 0; i < u.length; i++) {\n const b = c.encode(u[i]);\n res.set(b, pos);\n b.fill(0); // clean\n pos += b.length;\n }\n return res;\n },\n decode: (a) => {\n abytes_(a, bytesLen);\n const r = [];\n for (let i = 0; i < a.length; i += c.bytesLen)\n r.push(c.decode(a.subarray(i, i + c.bytesLen)));\n return r;\n },\n };\n}\n/**\n * Overwrites supported typed-array inputs with zeroes in place.\n * Accepts direct typed arrays and one-level arrays of them.\n * @param list - Typed arrays or one-level lists of typed arrays to clear.\n * @example\n * Overwrite typed arrays with zeroes.\n * ```ts\n * const buf = Uint8Array.of(1, 2, 3);\n * cleanBytes(buf);\n * ```\n */\nexport function cleanBytes(...list) {\n for (const t of list) {\n if (Array.isArray(t))\n for (const b of t)\n b.fill(0);\n else\n t.fill(0);\n }\n}\n/**\n * Creates a 32-bit mask with the lowest `bits` bits set.\n * @param bits - Number of low bits to keep.\n * @returns Bit mask with `bits` ones.\n * @example\n * Create a low-bit mask for packed-field operations.\n * ```ts\n * const mask = getMask(4);\n * ```\n */\nexport function getMask(bits) {\n if (!Number.isSafeInteger(bits) || bits < 0 || bits > 32)\n throw new RangeError(`expected bits in [0..32], got ${bits}`);\n // JS shifts are modulo 32, so bit 32 needs an explicit full-width mask.\n return bits === 32 ? 0xffffffff : ~(-1 << bits) >>> 0;\n}\n/** Shared empty byte array used as the default context. */\nexport const EMPTY = /* @__PURE__ */ Uint8Array.of();\n/**\n * Builds the domain-separated message payload for the pure sign/verify paths.\n * Context length `255` is valid; only `ctx.length > 255` is rejected.\n * @param msg - Message bytes.\n * @param ctx - Optional context bytes.\n * @returns Domain-separated message payload.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Build the domain-separated payload before direct signing.\n * ```ts\n * const payload = getMessage(new Uint8Array([1, 2]));\n * ```\n */\nexport function getMessage(msg, ctx = EMPTY) {\n abytes_(msg);\n abytes_(ctx);\n if (ctx.length > 255)\n throw new RangeError('context should be 255 bytes or less');\n return concatBytes(new Uint8Array([0, ctx.length]), ctx, msg);\n}\n// DER tag+length plus the shared NIST hash OID arc 2.16.840.1.101.3.4.2.* used by the\n// FIPS 204 / FIPS 205 pre-hash wrappers; the final byte selects SHA-256, SHA-512, SHAKE128,\n// SHAKE256, or another approved hash/XOF under that subtree.\n// 06 09 60 86 48 01 65 03 04 02\nconst oidNistP = /* @__PURE__ */ Uint8Array.from([6, 9, 0x60, 0x86, 0x48, 1, 0x65, 3, 4, 2]);\n/**\n * Validates that a hash exposes a NIST hash OID and enough collision resistance.\n * Current accepted surface is broader than the FIPS algorithm tables: any hash/XOF under the NIST\n * `2.16.840.1.101.3.4.2.*` subtree is accepted if its effective `outputLen` is strong enough.\n * XOF callers must pass a callable whose `outputLen` matches the digest length they actually intend\n * to sign; bare `shake128` / `shake256` defaults are too short for the stronger prehash modes.\n * @param hash - Hash function to validate.\n * @param requiredStrength - Minimum required collision-resistance strength in bits.\n * @throws If the hash metadata or collision resistance is insufficient. {@link Error}\n * @example\n * Validate that a hash exposes a NIST hash OID and enough collision resistance.\n * ```ts\n * import { sha256 } from '@noble/hashes/sha2.js';\n * import { checkHash } from '@noble/post-quantum/utils.js';\n * checkHash(sha256, 128);\n * ```\n */\nexport function checkHash(hash, requiredStrength = 0) {\n if (!hash.oid || !equalBytes(hash.oid.subarray(0, 10), oidNistP))\n throw new Error('hash.oid is invalid: expected NIST hash');\n // FIPS 204 / FIPS 205 require both collision and second-preimage strength; for approved NIST\n // hashes/XOFs under this OID subtree, the collision bound from the configured digest length is\n // the tighter runtime check, so enforce that lower bound here.\n const collisionResistance = (hash.outputLen * 8) / 2;\n if (requiredStrength > collisionResistance) {\n throw new Error('Pre-hash security strength too low: ' +\n collisionResistance +\n ', required: ' +\n requiredStrength);\n }\n}\n/**\n * Builds the domain-separated prehash payload for the prehash sign/verify paths.\n * Callers are expected to vet `hash.oid` first, e.g. via `checkHash(...)`; calling this helper\n * directly with a hash object that lacks `oid` currently throws later inside `concatBytes(...)`.\n * Context length `255` is valid; only `ctx.length > 255` is rejected.\n * @param hash - Prehash function.\n * @param msg - Message bytes.\n * @param ctx - Optional context bytes.\n * @returns Domain-separated prehash payload.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Build the domain-separated prehash payload for external hashing.\n * ```ts\n * import { sha256 } from '@noble/hashes/sha2.js';\n * import { getMessagePrehash } from '@noble/post-quantum/utils.js';\n * getMessagePrehash(sha256, new Uint8Array([1, 2]));\n * ```\n */\nexport function getMessagePrehash(hash, msg, ctx = EMPTY) {\n abytes_(msg);\n abytes_(ctx);\n if (ctx.length > 255)\n throw new RangeError('context should be 255 bytes or less');\n const hashed = hash(msg);\n return concatBytes(new Uint8Array([1, ctx.length]), ctx, hash.oid, hashed);\n}\n//# sourceMappingURL=utils.js.map","/**\n * Utilities for hex, bytearray and number handling.\n * @module\n */\n/*! noble-post-quantum - MIT License (c) 2024 Paul Miller (paulmillr.com) */\nimport {\n type CHash,\n type TypedArray,\n abytes,\n abytes as abytes_,\n concatBytes,\n isLE,\n randomBytes as randb,\n} from '@noble/hashes/utils.js';\n/**\n * Asserts that a value is a byte array and optionally checks its length.\n * Returns the original reference unchanged on success, and currently also accepts Node `Buffer`\n * values through the upstream validator.\n * This helper throws on malformed input, so APIs that must return `false` need to guard lengths\n * before decoding or before calling it.\n * @example\n * Validate that a value is a byte array with the expected length.\n * ```ts\n * abytes(new Uint8Array([1]), 1);\n * ```\n */\nconst abytesDoc: typeof abytes = abytes;\nexport { abytesDoc as abytes };\n/**\n * Concatenates byte arrays into a new `Uint8Array`.\n * Zero arguments return an empty `Uint8Array`.\n * Invalid segments throw before allocation because each argument is validated first.\n * @example\n * Concatenate two byte arrays into one result.\n * ```ts\n * concatBytes(new Uint8Array([1]), new Uint8Array([2]));\n * ```\n */\nconst concatBytesDoc: typeof concatBytes = concatBytes;\nexport { concatBytesDoc as concatBytes };\n/**\n * Returns cryptographically secure random bytes.\n * Requires `globalThis.crypto.getRandomValues` and throws if that API is unavailable.\n * `bytesLength` is validated by the upstream helper as a non-negative integer before allocation,\n * so negative and fractional values both throw instead of truncating through JS `ToIndex`.\n * @example\n * Generate a fresh random seed.\n * ```ts\n * const seed = randomBytes(4);\n * ```\n */\nexport const randomBytes: typeof randb = randb;\n\n/**\n * Compares two byte arrays in a length-constant way for equal lengths.\n * Unequal lengths return `false` immediately, and there is no runtime type validation.\n * @param a - First byte array.\n * @param b - Second byte array.\n * @returns Whether both arrays contain the same bytes.\n * @example\n * Compare two byte arrays for equality.\n * ```ts\n * equalBytes(new Uint8Array([1]), new Uint8Array([1]));\n * ```\n */\nexport function equalBytes(a: Uint8Array, b: Uint8Array): boolean {\n if (a.length !== b.length) return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];\n return diff === 0;\n}\n\n/**\n * Copies bytes into a fresh `Uint8Array`.\n * Returns a detached plain `Uint8Array`, and currently accepts broader array-like / iterable\n * inputs because it delegates directly to `Uint8Array.from(...)`.\n * @param bytes - Source bytes.\n * @returns Copy of the input bytes.\n * @example\n * Copy bytes into a fresh array.\n * ```ts\n * copyBytes(new Uint8Array([1, 2]));\n * ```\n */\nexport function copyBytes(bytes: Uint8Array): Uint8Array {\n return Uint8Array.from(bytes);\n}\n\n/**\n * Byte-swaps each 64-bit lane in place.\n * Falcon's exact binary64 tables are stored as little-endian byte payloads, so BE runtimes need\n * this boundary helper before aliasing them as host `Float64Array` lanes.\n * @param arr - Byte buffer whose length is a multiple of 8.\n * @returns The same buffer after in-place 64-bit lane byte swaps.\n */\nexport function byteSwap64<T extends ArrayBufferView>(arr: T): T {\n const bytes = new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n for (let i = 0; i < bytes.length; i += 8) {\n const a0 = bytes[i + 0];\n const a1 = bytes[i + 1];\n const a2 = bytes[i + 2];\n const a3 = bytes[i + 3];\n bytes[i + 0] = bytes[i + 7];\n bytes[i + 1] = bytes[i + 6];\n bytes[i + 2] = bytes[i + 5];\n bytes[i + 3] = bytes[i + 4];\n bytes[i + 4] = a3;\n bytes[i + 5] = a2;\n bytes[i + 6] = a1;\n bytes[i + 7] = a0;\n }\n return arr;\n}\nexport const baswap64If: <T extends ArrayBufferView>(arr: T) => T = isLE\n ? (arr) => arr\n : byteSwap64;\n\n/** Shared key-generation surface for signers and KEMs. */\nexport type CryptoKeys = {\n /** Optional metadata about the algorithm family or variant. */\n info?: { type?: string };\n /** Public byte lengths for the exported key material. */\n lengths: { seed?: number; publicKey?: number; secretKey?: number };\n /**\n * Generate one secret/public keypair.\n * @param seed - Optional seed bytes for deterministic key generation.\n * @returns Fresh secret/public keypair.\n */\n keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n /**\n * Derive one public key from a secret key.\n * @param secretKey - Secret key bytes.\n * @returns Public key bytes.\n */\n getPublicKey: (secretKey: Uint8Array) => Uint8Array;\n};\n\n/** Verification options shared by the signature APIs. */\nexport type VerOpts = {\n /** Optional application-defined context string. */\n context?: Uint8Array;\n};\n/** Signing options shared by the signature APIs. */\nexport type SigOpts = VerOpts & {\n // Compatibility with @noble/curves: false to disable, enabled by default, user can pass U8A\n /** Optional extra entropy or `false` to disable randomized signing. */\n extraEntropy?: Uint8Array | false;\n};\n\n/**\n * Validates that an options bag is a plain object.\n * @param opts - Options object to validate.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate that an options bag is a plain object.\n * ```ts\n * validateOpts({});\n * ```\n */\nexport function validateOpts(opts: object): void {\n // Arrays silently passed here before, but these call sites expect named option-bag fields.\n if (Object.prototype.toString.call(opts) !== '[object Object]')\n throw new TypeError('expected valid options object');\n}\n\n/**\n * Validates common verification options.\n * `context` itself is validated with `abytes(...)`, and individual algorithms may narrow support\n * further after this shared plain-object gate.\n * @param opts - Verification options. See {@link VerOpts}.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate common verification options.\n * ```ts\n * validateVerOpts({ context: new Uint8Array([1]) });\n * ```\n */\nexport function validateVerOpts(opts: VerOpts): void {\n validateOpts(opts);\n if (opts.context !== undefined) abytes(opts.context, undefined, 'opts.context');\n}\n\n/**\n * Validates common signing options.\n * `extraEntropy` is validated with `abytes(...)`; exact lengths and extra algorithm-specific\n * restrictions are enforced later by callers.\n * @param opts - Signing options. See {@link SigOpts}.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate common signing options.\n * ```ts\n * validateSigOpts({ extraEntropy: new Uint8Array([1]) });\n * ```\n */\nexport function validateSigOpts(opts: SigOpts): void {\n validateVerOpts(opts);\n if (opts.extraEntropy !== false && opts.extraEntropy !== undefined)\n abytes(opts.extraEntropy, undefined, 'opts.extraEntropy');\n}\n\n/** Generic signature interface with key generation, signing, and verification. */\nexport type Signer = CryptoKeys & {\n /** Public byte lengths for signatures and signing randomness. */\n lengths: { signRand?: number; signature?: number };\n /**\n * Sign one message.\n * @param msg - Message bytes to sign.\n * @param secretKey - Secret key bytes.\n * @param opts - Optional signing options.\n * @returns Signature bytes.\n */\n sign: (msg: Uint8Array, secretKey: Uint8Array, opts?: SigOpts) => Uint8Array;\n /**\n * Verify one signature.\n * @param sig - Signature bytes.\n * @param msg - Signed message bytes.\n * @param publicKey - Public key bytes.\n * @param opts - Optional verification options.\n * @returns `true` when the signature is valid, `false` when all inputs are well-formed but the\n * signature check does not pass. Some implementations also treat malformed signature encodings as\n * a verification failure and return `false`.\n * @throws On malformed API arguments or unsupported verification options.\n */\n verify: (sig: Uint8Array, msg: Uint8Array, publicKey: Uint8Array, opts?: VerOpts) => boolean;\n};\n\n/** Generic key encapsulation mechanism interface. */\nexport type KEM = CryptoKeys & {\n /** Public byte lengths for ciphertexts and optional message randomness. */\n lengths: { cipherText?: number; msg?: number; msgRand?: number };\n /**\n * Encapsulate one shared secret to a recipient public key.\n * @param publicKey - Recipient public key bytes.\n * @param msg - Optional caller-provided randomness/message seed.\n * @returns Ciphertext plus shared secret.\n */\n encapsulate: (\n publicKey: Uint8Array,\n msg?: Uint8Array\n ) => {\n cipherText: Uint8Array;\n sharedSecret: Uint8Array;\n };\n /**\n * Recover the shared secret from a ciphertext and recipient secret key.\n * @param cipherText - Ciphertext bytes.\n * @param secretKey - Recipient secret key bytes.\n * @returns Decapsulated shared secret.\n */\n decapsulate: (cipherText: Uint8Array, secretKey: Uint8Array) => Uint8Array;\n};\n\n/** Bidirectional encoder/decoder interface. */\nexport interface Coder<F, T> {\n /**\n * Serialize one value.\n * @param from - Value to encode.\n * @returns Encoded representation.\n */\n encode(from: F): T;\n /**\n * Parse one serialized value.\n * @param to - Encoded representation.\n * @returns Decoded value.\n */\n decode(to: T): F;\n}\n\n/** Encoder/decoder interface specialized for byte arrays. */\nexport interface BytesCoder<T> extends Coder<T, Uint8Array> {\n /**\n * Serialize one value into bytes.\n * @param data - Value to encode.\n * @returns Encoded bytes.\n */\n encode: (data: T) => Uint8Array;\n /**\n * Parse one byte array into a value.\n * @param bytes - Encoded bytes.\n * @returns Decoded value.\n */\n decode: (bytes: Uint8Array) => T;\n}\n\n/** Fixed-length byte encoder/decoder. */\nexport type BytesCoderLen<T> = BytesCoder<T> & { bytesLen: number };\n\n// nano-packed, because struct encoding is hard.\ntype UnCoder<T> = T extends BytesCoder<infer U> ? U : never;\ntype SplitOut<T extends (number | BytesCoderLen<any>)[]> = {\n [K in keyof T]: T[K] extends number ? Uint8Array : UnCoder<T[K]>;\n};\n/**\n * Builds a fixed-layout coder from byte lengths and nested coders.\n * Raw-length fields decode as zero-copy `subarray(...)` views, and nested coders may preserve that\n * aliasing too. Nested coder `encode(...)` results are treated as owned scratch: `splitCoder`\n * copies them into the output and then zeroizes them with `fill(0)`. If a nested encoder forwards\n * caller-owned bytes, it must do so only after detaching them into a disposable copy.\n * @param label - Label used in validation errors.\n * @param lengths - Field lengths or nested coders.\n * @returns Composite fixed-length coder.\n * @example\n * Build a fixed-layout coder from byte lengths and nested coders.\n * ```ts\n * splitCoder('demo', 1, 2).encode([new Uint8Array([1]), new Uint8Array([2, 3])]);\n * ```\n */\nexport function splitCoder<T extends (number | BytesCoderLen<any>)[]>(\n label: string,\n ...lengths: T\n): BytesCoder<SplitOut<T>> & { bytesLen: number } {\n const getLength = (c: number | BytesCoderLen<any>) => (typeof c === 'number' ? c : c.bytesLen);\n const bytesLen: number = lengths.reduce((sum: number, a) => sum + getLength(a), 0);\n return {\n bytesLen,\n encode: (bufs: T) => {\n const res = new Uint8Array(bytesLen);\n for (let i = 0, pos = 0; i < lengths.length; i++) {\n const c = lengths[i];\n const l = getLength(c);\n const b: Uint8Array = typeof c === 'number' ? (bufs[i] as any) : c.encode(bufs[i]);\n abytes_(b, l, label);\n res.set(b, pos);\n if (typeof c !== 'number') b.fill(0); // clean\n pos += l;\n }\n return res;\n },\n decode: (buf: Uint8Array) => {\n abytes_(buf, bytesLen, label);\n const res = [];\n for (const c of lengths) {\n const l = getLength(c);\n const b = buf.subarray(0, l);\n res.push(typeof c === 'number' ? b : c.decode(b));\n buf = buf.subarray(l);\n }\n return res as SplitOut<T>;\n },\n } as any;\n}\n// nano-packed.array (fixed size)\n/**\n * Builds a fixed-length vector coder from another fixed-length coder.\n * Element decoding receives `subarray(...)` views, so aliasing depends on the element coder.\n * Element coder `encode(...)` results are treated as owned scratch: `vecCoder` copies them into\n * the output and then zeroizes them with `fill(0)`. If an element encoder forwards caller-owned\n * bytes, it must do so only after detaching them into a disposable copy. `vecCoder` also trusts\n * the `BytesCoderLen` contract: each encoded element must already be exactly `c.bytesLen` bytes.\n * @param c - Element coder.\n * @param vecLen - Number of elements in the vector.\n * @returns Fixed-length vector coder.\n * @example\n * Build a fixed-length vector coder from another fixed-length coder.\n * ```ts\n * vecCoder(\n * { bytesLen: 1, encode: (n: number) => Uint8Array.of(n), decode: (b: Uint8Array) => b[0] || 0 },\n * 2\n * ).encode([1, 2]);\n * ```\n */\nexport function vecCoder<T>(c: BytesCoderLen<T>, vecLen: number): BytesCoderLen<T[]> {\n const bytesLen = vecLen * c.bytesLen;\n return {\n bytesLen,\n encode: (u: T[]): Uint8Array => {\n if (u.length !== vecLen)\n throw new RangeError(`vecCoder.encode: wrong length=${u.length}. Expected: ${vecLen}`);\n const res = new Uint8Array(bytesLen);\n for (let i = 0, pos = 0; i < u.length; i++) {\n const b = c.encode(u[i]);\n res.set(b, pos);\n b.fill(0); // clean\n pos += b.length;\n }\n return res;\n },\n decode: (a: Uint8Array): T[] => {\n abytes_(a, bytesLen);\n const r: T[] = [];\n for (let i = 0; i < a.length; i += c.bytesLen)\n r.push(c.decode(a.subarray(i, i + c.bytesLen)));\n return r;\n },\n };\n}\n\n/**\n * Overwrites supported typed-array inputs with zeroes in place.\n * Accepts direct typed arrays and one-level arrays of them.\n * @param list - Typed arrays or one-level lists of typed arrays to clear.\n * @example\n * Overwrite typed arrays with zeroes.\n * ```ts\n * const buf = Uint8Array.of(1, 2, 3);\n * cleanBytes(buf);\n * ```\n */\nexport function cleanBytes(...list: (TypedArray | TypedArray[])[]): void {\n for (const t of list) {\n if (Array.isArray(t)) for (const b of t) b.fill(0);\n else t.fill(0);\n }\n}\n\n/**\n * Creates a 32-bit mask with the lowest `bits` bits set.\n * @param bits - Number of low bits to keep.\n * @returns Bit mask with `bits` ones.\n * @example\n * Create a low-bit mask for packed-field operations.\n * ```ts\n * const mask = getMask(4);\n * ```\n */\nexport function getMask(bits: number): number {\n if (!Number.isSafeInteger(bits) || bits < 0 || bits > 32)\n throw new RangeError(`expected bits in [0..32], got ${bits}`);\n // JS shifts are modulo 32, so bit 32 needs an explicit full-width mask.\n return bits === 32 ? 0xffffffff : ~(-1 << bits) >>> 0;\n}\n\n/** Shared empty byte array used as the default context. */\nexport const EMPTY: Uint8Array = /* @__PURE__ */ Uint8Array.of();\n\n/**\n * Builds the domain-separated message payload for the pure sign/verify paths.\n * Context length `255` is valid; only `ctx.length > 255` is rejected.\n * @param msg - Message bytes.\n * @param ctx - Optional context bytes.\n * @returns Domain-separated message payload.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Build the domain-separated payload before direct signing.\n * ```ts\n * const payload = getMessage(new Uint8Array([1, 2]));\n * ```\n */\nexport function getMessage(msg: Uint8Array, ctx: Uint8Array = EMPTY): Uint8Array {\n abytes_(msg);\n abytes_(ctx);\n if (ctx.length > 255) throw new RangeError('context should be 255 bytes or less');\n return concatBytes(new Uint8Array([0, ctx.length]), ctx, msg);\n}\n\n// DER tag+length plus the shared NIST hash OID arc 2.16.840.1.101.3.4.2.* used by the\n// FIPS 204 / FIPS 205 pre-hash wrappers; the final byte selects SHA-256, SHA-512, SHAKE128,\n// SHAKE256, or another approved hash/XOF under that subtree.\n// 06 09 60 86 48 01 65 03 04 02\nconst oidNistP = /* @__PURE__ */ Uint8Array.from([6, 9, 0x60, 0x86, 0x48, 1, 0x65, 3, 4, 2]);\n\n/**\n * Validates that a hash exposes a NIST hash OID and enough collision resistance.\n * Current accepted surface is broader than the FIPS algorithm tables: any hash/XOF under the NIST\n * `2.16.840.1.101.3.4.2.*` subtree is accepted if its effective `outputLen` is strong enough.\n * XOF callers must pass a callable whose `outputLen` matches the digest length they actually intend\n * to sign; bare `shake128` / `shake256` defaults are too short for the stronger prehash modes.\n * @param hash - Hash function to validate.\n * @param requiredStrength - Minimum required collision-resistance strength in bits.\n * @throws If the hash metadata or collision resistance is insufficient. {@link Error}\n * @example\n * Validate that a hash exposes a NIST hash OID and enough collision resistance.\n * ```ts\n * import { sha256 } from '@noble/hashes/sha2.js';\n * import { checkHash } from '@noble/post-quantum/utils.js';\n * checkHash(sha256, 128);\n * ```\n */\nexport function checkHash(hash: CHash, requiredStrength: number = 0): void {\n if (!hash.oid || !equalBytes(hash.oid.subarray(0, 10), oidNistP))\n throw new Error('hash.oid is invalid: expected NIST hash');\n // FIPS 204 / FIPS 205 require both collision and second-preimage strength; for approved NIST\n // hashes/XOFs under this OID subtree, the collision bound from the configured digest length is\n // the tighter runtime check, so enforce that lower bound here.\n const collisionResistance = (hash.outputLen * 8) / 2;\n if (requiredStrength > collisionResistance) {\n throw new Error(\n 'Pre-hash security strength too low: ' +\n collisionResistance +\n ', required: ' +\n requiredStrength\n );\n }\n}\n\n/**\n * Builds the domain-separated prehash payload for the prehash sign/verify paths.\n * Callers are expected to vet `hash.oid` first, e.g. via `checkHash(...)`; calling this helper\n * directly with a hash object that lacks `oid` currently throws later inside `concatBytes(...)`.\n * Context length `255` is valid; only `ctx.length > 255` is rejected.\n * @param hash - Prehash function.\n * @param msg - Message bytes.\n * @param ctx - Optional context bytes.\n * @returns Domain-separated prehash payload.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Build the domain-separated prehash payload for external hashing.\n * ```ts\n * import { sha256 } from '@noble/hashes/sha2.js';\n * import { getMessagePrehash } from '@noble/post-quantum/utils.js';\n * getMessagePrehash(sha256, new Uint8Array([1, 2]));\n * ```\n */\nexport function getMessagePrehash(\n hash: CHash,\n msg: Uint8Array,\n ctx: Uint8Array = EMPTY\n): Uint8Array {\n abytes_(msg);\n abytes_(ctx);\n if (ctx.length > 255) throw new RangeError('context should be 255 bytes or less');\n const hashed = hash(msg);\n return concatBytes(new Uint8Array([1, ctx.length]), ctx, hash.oid!, hashed);\n}\n"],"names":[],"version":3,"file":"module.js.map"}