{"version":3,"sources":["../node_modules/bn.js/lib/bn.js","../node_modules/@noble/hashes/src/utils.ts","../node_modules/@noble/hashes/src/_md.ts","../node_modules/@noble/hashes/src/sha2.ts","../node_modules/@noble/curves/src/utils.ts","../node_modules/@noble/curves/src/abstract/modular.ts","../node_modules/@noble/curves/src/abstract/curve.ts","../node_modules/@noble/hashes/src/hmac.ts","../node_modules/@noble/curves/src/abstract/weierstrass.ts","../node_modules/@noble/curves/src/secp256k1.ts","../node_modules/postchain-client/node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.js","../node_modules/postchain-client/node_modules/.pnpm/ieee754@1.2.1/node_modules/ieee754/index.js","../node_modules/postchain-client/node_modules/.pnpm/buffer@6.0.3/node_modules/buffer/index.js","../node_modules/postchain-client/node_modules/.pnpm/merklehashts@1.0.5_buffer@6.0.3/node_modules/merklehashts/dist/tree/types.js","../node_modules/postchain-client/node_modules/.pnpm/merklehashts@1.0.5_buffer@6.0.3/node_modules/merklehashts/dist/tree/factory.js","../node_modules/postchain-client/node_modules/.pnpm/bn.js@4.12.2/node_modules/bn.js/lib/bn.js","../node_modules/postchain-client/node_modules/.pnpm/inherits@2.0.4/node_modules/inherits/inherits_browser.js","../node_modules/postchain-client/node_modules/.pnpm/safer-buffer@2.1.2/node_modules/safer-buffer/safer.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/base/reporter.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/base/buffer.js","../node_modules/postchain-client/node_modules/.pnpm/minimalistic-assert@1.0.1/node_modules/minimalistic-assert/index.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/base/node.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/constants/der.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/encoders/der.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/encoders/pem.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/encoders/index.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/decoders/der.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/decoders/pem.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/decoders/index.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/api.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/base/index.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1/constants/index.js","../node_modules/postchain-client/node_modules/.pnpm/@chromia+asn1@1.0.1/node_modules/@chromia/asn1/lib/asn1.js","../node_modules/postchain-client/node_modules/.pnpm/merklehashts@1.0.5_buffer@6.0.3/node_modules/merklehashts/dist/gtv/utils.js","../node_modules/postchain-client/node_modules/.pnpm/safe-buffer@5.2.1/node_modules/safe-buffer/index.js","../node_modules/postchain-client/node_modules/.pnpm/randombytes@2.1.0/node_modules/randombytes/browser.js","../node_modules/postchain-client/node_modules/.pnpm/events@3.3.0/node_modules/events/events.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/stream-browser.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/buffer_list.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/destroy.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/errors-browser.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/state.js","../node_modules/postchain-client/node_modules/.pnpm/util-deprecate@1.0.2/node_modules/util-deprecate/browser.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/_stream_writable.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/_stream_duplex.js","../node_modules/postchain-client/node_modules/.pnpm/string_decoder@1.3.0/node_modules/string_decoder/lib/string_decoder.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/end-of-stream.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/async_iterator.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/from-browser.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/_stream_readable.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/_stream_transform.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/_stream_passthrough.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/pipeline.js","../node_modules/postchain-client/node_modules/.pnpm/stream-browserify@3.0.0/node_modules/stream-browserify/index.js","../node_modules/postchain-client/node_modules/.pnpm/hash-base@3.0.5/node_modules/hash-base/index.js","../node_modules/postchain-client/node_modules/.pnpm/md5.js@1.3.5/node_modules/md5.js/index.js","../node_modules/postchain-client/node_modules/.pnpm/isarray@2.0.5/node_modules/isarray/index.js","../node_modules/postchain-client/node_modules/.pnpm/es-errors@1.3.0/node_modules/es-errors/type.js","../node_modules/postchain-client/node_modules/.pnpm/es-object-atoms@1.1.1/node_modules/es-object-atoms/index.js","../node_modules/postchain-client/node_modules/.pnpm/es-errors@1.3.0/node_modules/es-errors/index.js","../node_modules/postchain-client/node_modules/.pnpm/es-errors@1.3.0/node_modules/es-errors/eval.js","../node_modules/postchain-client/node_modules/.pnpm/es-errors@1.3.0/node_modules/es-errors/range.js","../node_modules/postchain-client/node_modules/.pnpm/es-errors@1.3.0/node_modules/es-errors/ref.js","../node_modules/postchain-client/node_modules/.pnpm/es-errors@1.3.0/node_modules/es-errors/syntax.js","../node_modules/postchain-client/node_modules/.pnpm/es-errors@1.3.0/node_modules/es-errors/uri.js","../node_modules/postchain-client/node_modules/.pnpm/math-intrinsics@1.1.0/node_modules/math-intrinsics/abs.js","../node_modules/postchain-client/node_modules/.pnpm/math-intrinsics@1.1.0/node_modules/math-intrinsics/floor.js","../node_modules/postchain-client/node_modules/.pnpm/math-intrinsics@1.1.0/node_modules/math-intrinsics/max.js","../node_modules/postchain-client/node_modules/.pnpm/math-intrinsics@1.1.0/node_modules/math-intrinsics/min.js","../node_modules/postchain-client/node_modules/.pnpm/math-intrinsics@1.1.0/node_modules/math-intrinsics/pow.js","../node_modules/postchain-client/node_modules/.pnpm/math-intrinsics@1.1.0/node_modules/math-intrinsics/round.js","../node_modules/postchain-client/node_modules/.pnpm/math-intrinsics@1.1.0/node_modules/math-intrinsics/isNaN.js","../node_modules/postchain-client/node_modules/.pnpm/math-intrinsics@1.1.0/node_modules/math-intrinsics/sign.js","../node_modules/postchain-client/node_modules/.pnpm/gopd@1.2.0/node_modules/gopd/gOPD.js","../node_modules/postchain-client/node_modules/.pnpm/gopd@1.2.0/node_modules/gopd/index.js","../node_modules/postchain-client/node_modules/.pnpm/es-define-property@1.0.1/node_modules/es-define-property/index.js","../node_modules/postchain-client/node_modules/.pnpm/has-symbols@1.1.0/node_modules/has-symbols/shams.js","../node_modules/postchain-client/node_modules/.pnpm/has-symbols@1.1.0/node_modules/has-symbols/index.js","../node_modules/postchain-client/node_modules/.pnpm/get-proto@1.0.1/node_modules/get-proto/Reflect.getPrototypeOf.js","../node_modules/postchain-client/node_modules/.pnpm/get-proto@1.0.1/node_modules/get-proto/Object.getPrototypeOf.js","../node_modules/postchain-client/node_modules/.pnpm/function-bind@1.1.2/node_modules/function-bind/implementation.js","../node_modules/postchain-client/node_modules/.pnpm/function-bind@1.1.2/node_modules/function-bind/index.js","../node_modules/postchain-client/node_modules/.pnpm/call-bind-apply-helpers@1.0.2/node_modules/call-bind-apply-helpers/functionCall.js","../node_modules/postchain-client/node_modules/.pnpm/call-bind-apply-helpers@1.0.2/node_modules/call-bind-apply-helpers/functionApply.js","../node_modules/postchain-client/node_modules/.pnpm/call-bind-apply-helpers@1.0.2/node_modules/call-bind-apply-helpers/reflectApply.js","../node_modules/postchain-client/node_modules/.pnpm/call-bind-apply-helpers@1.0.2/node_modules/call-bind-apply-helpers/actualApply.js","../node_modules/postchain-client/node_modules/.pnpm/call-bind-apply-helpers@1.0.2/node_modules/call-bind-apply-helpers/index.js","../node_modules/postchain-client/node_modules/.pnpm/dunder-proto@1.0.1/node_modules/dunder-proto/get.js","../node_modules/postchain-client/node_modules/.pnpm/get-proto@1.0.1/node_modules/get-proto/index.js","../node_modules/postchain-client/node_modules/.pnpm/hasown@2.0.2/node_modules/hasown/index.js","../node_modules/postchain-client/node_modules/.pnpm/get-intrinsic@1.3.0/node_modules/get-intrinsic/index.js","../node_modules/postchain-client/node_modules/.pnpm/call-bound@1.0.4/node_modules/call-bound/index.js","../node_modules/postchain-client/node_modules/.pnpm/is-callable@1.2.7/node_modules/is-callable/index.js","../node_modules/postchain-client/node_modules/.pnpm/for-each@0.3.5/node_modules/for-each/index.js","../node_modules/postchain-client/node_modules/.pnpm/possible-typed-array-names@1.1.0/node_modules/possible-typed-array-names/index.js","../node_modules/postchain-client/node_modules/.pnpm/available-typed-arrays@1.0.7/node_modules/available-typed-arrays/index.js","../node_modules/postchain-client/node_modules/.pnpm/define-data-property@1.1.4/node_modules/define-data-property/index.js","../node_modules/postchain-client/node_modules/.pnpm/has-property-descriptors@1.0.2/node_modules/has-property-descriptors/index.js","../node_modules/postchain-client/node_modules/.pnpm/set-function-length@1.2.2/node_modules/set-function-length/index.js","../node_modules/postchain-client/node_modules/.pnpm/call-bind-apply-helpers@1.0.2/node_modules/call-bind-apply-helpers/applyBind.js","../node_modules/postchain-client/node_modules/.pnpm/call-bind@1.0.8/node_modules/call-bind/index.js","../node_modules/postchain-client/node_modules/.pnpm/has-tostringtag@1.0.2/node_modules/has-tostringtag/shams.js","../node_modules/postchain-client/node_modules/.pnpm/which-typed-array@1.1.19/node_modules/which-typed-array/index.js","../node_modules/postchain-client/node_modules/.pnpm/is-typed-array@1.1.15/node_modules/is-typed-array/index.js","../node_modules/postchain-client/node_modules/.pnpm/typed-array-buffer@1.0.3/node_modules/typed-array-buffer/index.js","../node_modules/postchain-client/node_modules/.pnpm/to-buffer@1.2.2/node_modules/to-buffer/index.js","../node_modules/postchain-client/node_modules/.pnpm/hash-base@3.1.2/node_modules/hash-base/to-buffer.js","../node_modules/postchain-client/node_modules/.pnpm/process-nextick-args@2.0.1/node_modules/process-nextick-args/index.js","../node_modules/postchain-client/node_modules/.pnpm/isarray@1.0.0/node_modules/isarray/index.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@2.3.8/node_modules/readable-stream/lib/internal/streams/stream-browser.js","../node_modules/postchain-client/node_modules/.pnpm/safe-buffer@5.1.2/node_modules/safe-buffer/index.js","../node_modules/postchain-client/node_modules/.pnpm/core-util-is@1.0.3/node_modules/core-util-is/lib/util.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@2.3.8/node_modules/readable-stream/lib/internal/streams/BufferList.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@2.3.8/node_modules/readable-stream/lib/internal/streams/destroy.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@2.3.8/node_modules/readable-stream/lib/_stream_writable.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@2.3.8/node_modules/readable-stream/lib/_stream_duplex.js","../node_modules/postchain-client/node_modules/.pnpm/string_decoder@1.1.1/node_modules/string_decoder/lib/string_decoder.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@2.3.8/node_modules/readable-stream/lib/_stream_readable.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@2.3.8/node_modules/readable-stream/lib/_stream_transform.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@2.3.8/node_modules/readable-stream/lib/_stream_passthrough.js","../node_modules/postchain-client/node_modules/.pnpm/readable-stream@2.3.8/node_modules/readable-stream/readable-browser.js","../node_modules/postchain-client/node_modules/.pnpm/hash-base@3.1.2/node_modules/hash-base/index.js","../node_modules/postchain-client/node_modules/.pnpm/ripemd160@2.0.3/node_modules/ripemd160/index.js","../node_modules/postchain-client/node_modules/.pnpm/sha.js@2.4.12/node_modules/sha.js/hash.js","../node_modules/postchain-client/node_modules/.pnpm/sha.js@2.4.12/node_modules/sha.js/sha.js","../node_modules/postchain-client/node_modules/.pnpm/sha.js@2.4.12/node_modules/sha.js/sha1.js","../node_modules/postchain-client/node_modules/.pnpm/sha.js@2.4.12/node_modules/sha.js/sha256.js","../node_modules/postchain-client/node_modules/.pnpm/sha.js@2.4.12/node_modules/sha.js/sha224.js","../node_modules/postchain-client/node_modules/.pnpm/sha.js@2.4.12/node_modules/sha.js/sha512.js","../node_modules/postchain-client/node_modules/.pnpm/sha.js@2.4.12/node_modules/sha.js/sha384.js","../node_modules/postchain-client/node_modules/.pnpm/sha.js@2.4.12/node_modules/sha.js/index.js","../node_modules/postchain-client/node_modules/.pnpm/cipher-base@1.0.7/node_modules/cipher-base/index.js","../node_modules/postchain-client/node_modules/.pnpm/create-hash@1.2.0/node_modules/create-hash/browser.js","../node_modules/postchain-client/node_modules/.pnpm/create-hmac@1.1.7/node_modules/create-hmac/legacy.js","../node_modules/postchain-client/node_modules/.pnpm/create-hash@1.2.0/node_modules/create-hash/md5.js","../node_modules/postchain-client/node_modules/.pnpm/create-hmac@1.1.7/node_modules/create-hmac/browser.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-sign@4.2.5/node_modules/browserify-sign/algos.js","../node_modules/postchain-client/node_modules/.pnpm/pbkdf2@3.1.5/node_modules/pbkdf2/lib/precondition.js","../node_modules/postchain-client/node_modules/.pnpm/pbkdf2@3.1.5/node_modules/pbkdf2/lib/default-encoding.js","../node_modules/postchain-client/node_modules/.pnpm/pbkdf2@3.1.5/node_modules/pbkdf2/lib/to-buffer.js","../node_modules/postchain-client/node_modules/.pnpm/pbkdf2@3.1.5/node_modules/pbkdf2/lib/sync-browser.js","../node_modules/postchain-client/node_modules/.pnpm/pbkdf2@3.1.5/node_modules/pbkdf2/lib/async.js","../node_modules/postchain-client/node_modules/.pnpm/pbkdf2@3.1.5/node_modules/pbkdf2/browser.js","../node_modules/postchain-client/node_modules/.pnpm/des.js@1.1.0/node_modules/des.js/lib/des/utils.js","../node_modules/postchain-client/node_modules/.pnpm/des.js@1.1.0/node_modules/des.js/lib/des/cipher.js","../node_modules/postchain-client/node_modules/.pnpm/des.js@1.1.0/node_modules/des.js/lib/des/des.js","../node_modules/postchain-client/node_modules/.pnpm/des.js@1.1.0/node_modules/des.js/lib/des/cbc.js","../node_modules/postchain-client/node_modules/.pnpm/des.js@1.1.0/node_modules/des.js/lib/des/ede.js","../node_modules/postchain-client/node_modules/.pnpm/des.js@1.1.0/node_modules/des.js/lib/des.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-des@1.0.2/node_modules/browserify-des/index.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/modes/ecb.js","../node_modules/postchain-client/node_modules/.pnpm/buffer-xor@1.0.3/node_modules/buffer-xor/index.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/modes/cbc.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/modes/cfb.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/modes/cfb8.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/modes/cfb1.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/modes/ofb.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/incr32.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/modes/ctr.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/modes/index.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/aes.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/ghash.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/authCipher.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/streamCipher.js","../node_modules/postchain-client/node_modules/.pnpm/evp_bytestokey@1.0.3/node_modules/evp_bytestokey/index.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/encrypter.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/decrypter.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-aes@1.2.0/node_modules/browserify-aes/browser.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-des@1.0.2/node_modules/browserify-des/modes.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-cipher@1.0.1/node_modules/browserify-cipher/browser.js","../node_modules/postchain-client/node_modules/.pnpm/brorand@1.1.0/node_modules/brorand/index.js","../node_modules/postchain-client/node_modules/.pnpm/miller-rabin@4.0.1/node_modules/miller-rabin/lib/mr.js","../node_modules/postchain-client/node_modules/.pnpm/diffie-hellman@5.0.3/node_modules/diffie-hellman/lib/generatePrime.js","../node_modules/postchain-client/node_modules/.pnpm/diffie-hellman@5.0.3/node_modules/diffie-hellman/lib/dh.js","../node_modules/postchain-client/node_modules/.pnpm/diffie-hellman@5.0.3/node_modules/diffie-hellman/browser.js","../node_modules/postchain-client/node_modules/.pnpm/bn.js@5.2.2/node_modules/bn.js/lib/bn.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-rsa@4.1.1/node_modules/browserify-rsa/index.js","../node_modules/postchain-client/node_modules/.pnpm/minimalistic-crypto-utils@1.0.1/node_modules/minimalistic-crypto-utils/lib/utils.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/utils.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/curve/base.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/curve/short.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/curve/mont.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/curve/edwards.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/curve/index.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/utils.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/common.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/sha/common.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/sha/1.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/sha/256.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/sha/224.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/sha/512.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/sha/384.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/sha.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/ripemd.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash/hmac.js","../node_modules/postchain-client/node_modules/.pnpm/hash.js@1.1.7/node_modules/hash.js/lib/hash.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/curves.js","../node_modules/postchain-client/node_modules/.pnpm/hmac-drbg@1.0.1/node_modules/hmac-drbg/lib/hmac-drbg.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/ec/key.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/ec/signature.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/ec/index.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/eddsa/key.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/eddsa/signature.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic/eddsa/index.js","../node_modules/postchain-client/node_modules/.pnpm/elliptic@6.6.1/node_modules/elliptic/lib/elliptic.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/api.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/base/reporter.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/base/buffer.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/base/node.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/base/index.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/constants/der.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/constants/index.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/decoders/der.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/decoders/pem.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/decoders/index.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/encoders/der.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/encoders/pem.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1/encoders/index.js","../node_modules/postchain-client/node_modules/.pnpm/asn1.js@4.10.1/node_modules/asn1.js/lib/asn1.js","../node_modules/postchain-client/node_modules/.pnpm/parse-asn1@5.1.9/node_modules/parse-asn1/certificate.js","../node_modules/postchain-client/node_modules/.pnpm/parse-asn1@5.1.9/node_modules/parse-asn1/asn1.js","../node_modules/postchain-client/node_modules/.pnpm/parse-asn1@5.1.9/node_modules/parse-asn1/fixProc.js","../node_modules/postchain-client/node_modules/.pnpm/parse-asn1@5.1.9/node_modules/parse-asn1/index.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-sign@4.2.5/node_modules/browserify-sign/browser/sign.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-sign@4.2.5/node_modules/browserify-sign/browser/verify.js","../node_modules/postchain-client/node_modules/.pnpm/browserify-sign@4.2.5/node_modules/browserify-sign/browser/index.js","../node_modules/postchain-client/node_modules/.pnpm/create-ecdh@4.0.4/node_modules/create-ecdh/browser.js","../node_modules/postchain-client/node_modules/.pnpm/public-encrypt@4.0.3/node_modules/public-encrypt/mgf.js","../node_modules/postchain-client/node_modules/.pnpm/public-encrypt@4.0.3/node_modules/public-encrypt/xor.js","../node_modules/postchain-client/node_modules/.pnpm/public-encrypt@4.0.3/node_modules/public-encrypt/withPublic.js","../node_modules/postchain-client/node_modules/.pnpm/public-encrypt@4.0.3/node_modules/public-encrypt/publicEncrypt.js","../node_modules/postchain-client/node_modules/.pnpm/public-encrypt@4.0.3/node_modules/public-encrypt/privateDecrypt.js","../node_modules/postchain-client/node_modules/.pnpm/public-encrypt@4.0.3/node_modules/public-encrypt/browser.js","../node_modules/postchain-client/node_modules/.pnpm/randomfill@1.0.4/node_modules/randomfill/browser.js","../node_modules/postchain-client/node_modules/.pnpm/crypto-browserify@3.12.1/node_modules/crypto-browserify/index.js","../node_modules/postchain-client/node_modules/.pnpm/merklehashts@1.0.5_buffer@6.0.3/node_modules/merklehashts/dist/crypto.js","../node_modules/postchain-client/node_modules/.pnpm/merklehashts@1.0.5_buffer@6.0.3/node_modules/merklehashts/dist/constants.js","../node_modules/postchain-client/node_modules/.pnpm/merklehashts@1.0.5_buffer@6.0.3/node_modules/merklehashts/dist/tree/hash.js","../node_modules/postchain-client/node_modules/.pnpm/merklehashts@1.0.5_buffer@6.0.3/node_modules/merklehashts/dist/index.js","../node_modules/postchain-client/built/src/gtv/definition.js","../node_modules/postchain-client/built/src/customError/index.js","../node_modules/postchain-client/built/src/gtx/errors.js","../node_modules/postchain-client/node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/helpers/util.cjs","../node_modules/postchain-client/node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/ZodError.cjs","../node_modules/postchain-client/node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/locales/en.cjs","../node_modules/postchain-client/node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/errors.cjs","../node_modules/postchain-client/node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/helpers/parseUtil.cjs","../node_modules/postchain-client/node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/helpers/typeAliases.cjs","../node_modules/postchain-client/node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/helpers/errorUtil.cjs","../node_modules/postchain-client/node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/types.cjs","../node_modules/postchain-client/node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/external.cjs","../node_modules/postchain-client/node_modules/.pnpm/zod@3.25.76/node_modules/zod/index.cjs","../node_modules/postchain-client/built/src/blockchainClient/validation/rawGtx.js","../node_modules/postchain-client/built/src/utils/bufferUtils.js","../node_modules/postchain-client/built/src/formatter.js","../node_modules/postchain-client/built/src/gtx/serialization.js","../node_modules/postchain-client/built/src/utils/constants.js","../node_modules/postchain-client/built/src/gtv/index.js","../node_modules/postchain-client/node_modules/.pnpm/secp256k1@4.0.4/node_modules/secp256k1/lib/index.js","../node_modules/postchain-client/node_modules/.pnpm/secp256k1@4.0.4/node_modules/secp256k1/lib/elliptic.js","../node_modules/postchain-client/node_modules/.pnpm/secp256k1@4.0.4/node_modules/secp256k1/elliptic.js","../node_modules/postchain-client/built/src/encryption/errors.js","../node_modules/postchain-client/built/src/encryption/encryption.js","../node_modules/postchain-client/built/src/gtx/index.js","../node_modules/postchain-client/built/src/gtx/gtx.js","../node_modules/postchain-client/built/src/logger.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheClear.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/eq.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assocIndexOf.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheDelete.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheGet.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheHas.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheSet.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_ListCache.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackClear.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackDelete.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackGet.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackHas.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_freeGlobal.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_root.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Symbol.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getRawTag.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_objectToString.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGetTag.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isObject.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isFunction.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_coreJsData.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isMasked.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_toSource.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsNative.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getValue.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getNative.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Map.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeCreate.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashClear.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashDelete.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashGet.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashHas.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashSet.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Hash.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheClear.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isKeyable.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getMapData.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheDelete.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheGet.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheHas.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheSet.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_MapCache.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackSet.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Stack.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayEach.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_defineProperty.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssignValue.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assignValue.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copyObject.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseTimes.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isObjectLike.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsArguments.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArguments.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArray.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/stubFalse.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isBuffer.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isIndex.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isLength.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsTypedArray.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseUnary.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nodeUtil.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isTypedArray.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayLikeKeys.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isPrototype.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_overArg.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeKeys.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseKeys.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArrayLike.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/keys.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssign.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeKeysIn.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseKeysIn.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/keysIn.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssignIn.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneBuffer.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copyArray.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayFilter.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/stubArray.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getSymbols.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copySymbols.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayPush.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getPrototype.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getSymbolsIn.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copySymbolsIn.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGetAllKeys.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getAllKeys.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getAllKeysIn.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_DataView.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Promise.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Set.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_WeakMap.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getTag.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneArray.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Uint8Array.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneArrayBuffer.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneDataView.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneRegExp.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneSymbol.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneTypedArray.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneByTag.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseCreate.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneObject.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsMap.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isMap.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsSet.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isSet.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseClone.js","../node_modules/postchain-client/node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/cloneDeep.js","../node_modules/postchain-client/built/src/blockchainClient/errors.js","../node_modules/postchain-client/built/src/blockchainClient/enums.js","../node_modules/postchain-client/built/src/blockchainClient/nodeManager.js","../node_modules/postchain-client/built/src/blockchainClient/validation/bufferSchema.js","../node_modules/postchain-client/built/src/blockchainClient/validation/txRid.js","../node_modules/postchain-client/built/src/blockchainClient/validation/anchoringTransaction.js","../node_modules/postchain-client/built/src/ICCF/error.js","../node_modules/postchain-client/built/src/blockchainClient/validation/requests.js","../node_modules/postchain-client/built/src/utils/encodeTransaction.js","../node_modules/postchain-client/built/src/blockchainClient/validation/merkleHash.js","../node_modules/postchain-client/built/src/blockchainClient/httpUtil.js","../node_modules/postchain-client/built/src/utils/http-utils.js","../node_modules/postchain-client/built/src/blockchainClient/failoverStrategies.js","../node_modules/postchain-client/built/src/blockchainClient/requestWithFailoverStrategy.js","../node_modules/postchain-client/built/src/blockchainClient/utils.js","../node_modules/postchain-client/built/src/ICCF/utils.js","../node_modules/postchain-client/built/src/ICCF/IccfProofTxMaterialBuilder.js","../node_modules/postchain-client/built/src/promiEvent/promiEventEmitter.js","../node_modules/postchain-client/built/src/promiEvent/promiEvents.js","../node_modules/postchain-client/built/src/blockchainClient/validation/blockIdentifier.js","../node_modules/postchain-client/built/src/blockchainClient/validation/networkSettings.js","../node_modules/postchain-client/built/src/blockchainClient/validation/signMethod.js","../node_modules/postchain-client/built/src/blockchainClient/validation/transactionStatusReponse.js","../node_modules/postchain-client/built/src/blockchainClient/blockchainClient.js","../node_modules/postchain-client/built/src/blockchainClient/clientStub.js","../node_modules/postchain-client/built/src/utils/calculateTransactionRid.js","../node_modules/postchain-client/built/src/utils/dump.js","../node_modules/postchain-client/built/src/utils/decodeTransactionToGtx.js","../node_modules/postchain-client/built/index.js","../node_modules/postchain-client/built/index.js","../src-ts/browser/native.ts","../src-ts/random.ts","../src-ts/constants.ts","../src-ts/chain-config.ts","../node_modules/@noble/hashes/src/hkdf.ts","../node_modules/@noble/ciphers/utils.js","../node_modules/@noble/ciphers/_polyval.js","../node_modules/@noble/ciphers/aes.js","../src-ts/browser/crypto-ecies.ts","../src-ts/crypto/envelope.ts","../src-ts/browser/encrypted-toolcall.ts","../src-ts/endpoint.ts","../src-ts/errors.ts","../src-ts/http/client.ts","../src-ts/browser/keyLoader.ts","../src-ts/normalize.ts","../src-ts/browser/opentel/telemetry.ts","../src-ts/browser/userConfig.ts","../src-ts/client.ts","../src-ts/redact.ts","../src-ts/signature.ts","../src-ts/browser/memory-crypto.ts","../src-ts/browser/memory-scan.ts","../src-ts/browser/memory-chain.ts","../src-ts/browser/memory-classifier.ts","../src-ts/memory/guard.ts","../src-ts/memory/sync.ts","../src-ts/browser/memory-pointer-store.ts","../src-ts/browser/memory-file-logger.ts","../src-ts/browser/memory-read-classifier.ts","../src-ts/browser/memory-guard-manager.ts","../src-ts/index.ts"],"sourcesContent":["(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      i++;\n    }\n\n    // Clear words above the requested width so the result stays below 2 ** width\n    for (; i < this.length; i++) {\n      this.words[i] = 0;\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    if (num === 0) {\n      this.length = 1;\n      this._normSign();\n    }\n\n    return this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    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.mod.abs();\n\n    var half = num.abs().iushrn(1);\n    var r2 = num.words[0] & 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, away from zero\n    var up = new BN(1);\n    up.negative = this.negative ^ num.negative;\n    return dm.div.iadd(up);\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","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/**\n * Bytes API type helpers for old + new TypeScript.\n *\n * TS 5.6 has `Uint8Array`, while TS 5.9+ made it generic `Uint8Array<ArrayBuffer>`.\n * We can't use specific return type, because TS 5.6 will error.\n * We can't use generic return type, because most TS 5.9 software will expect specific type.\n *\n * Maps typed-array input leaves to broad forms.\n * These are compatibility adapters, not ownership guarantees.\n *\n * - `TArg` keeps byte inputs broad.\n * - `TRet` marks byte outputs for TS 5.6 and TS 5.9+ compatibility.\n */\nexport type TypedArg<T> = T extends BigInt64Array\n  ? BigInt64Array\n  : T extends BigUint64Array\n    ? BigUint64Array\n    : T extends Float32Array\n      ? Float32Array\n      : T extends Float64Array\n        ? Float64Array\n        : T extends Int16Array\n          ? Int16Array\n          : T extends Int32Array\n            ? Int32Array\n            : T extends Int8Array\n              ? Int8Array\n              : T extends Uint16Array\n                ? Uint16Array\n                : T extends Uint32Array\n                  ? Uint32Array\n                  : T extends Uint8ClampedArray\n                    ? Uint8ClampedArray\n                    : T extends Uint8Array\n                      ? Uint8Array\n                      : never;\n/** Maps typed-array output leaves to narrow TS-compatible forms. */\nexport type TypedRet<T> = T extends BigInt64Array\n  ? ReturnType<typeof BigInt64Array.of>\n  : T extends BigUint64Array\n    ? ReturnType<typeof BigUint64Array.of>\n    : T extends Float32Array\n      ? ReturnType<typeof Float32Array.of>\n      : T extends Float64Array\n        ? ReturnType<typeof Float64Array.of>\n        : T extends Int16Array\n          ? ReturnType<typeof Int16Array.of>\n          : T extends Int32Array\n            ? ReturnType<typeof Int32Array.of>\n            : T extends Int8Array\n              ? ReturnType<typeof Int8Array.of>\n              : T extends Uint16Array\n                ? ReturnType<typeof Uint16Array.of>\n                : T extends Uint32Array\n                  ? ReturnType<typeof Uint32Array.of>\n                  : T extends Uint8ClampedArray\n                    ? ReturnType<typeof Uint8ClampedArray.of>\n                    : T extends Uint8Array\n                      ? ReturnType<typeof Uint8Array.of>\n                      : never;\n/** Recursively adapts byte-carrying API input types. See {@link TypedArg}. */\nexport type TArg<T> =\n  | T\n  | ([TypedArg<T>] extends [never]\n      ? T extends (...args: infer A) => infer R\n        ? ((...args: { [K in keyof A]: TRet<A[K]> }) => TArg<R>) & {\n            [K in keyof T]: T[K] extends (...args: any) => any ? T[K] : TArg<T[K]>;\n          }\n        : T extends [infer A, ...infer R]\n          ? [TArg<A>, ...{ [K in keyof R]: TArg<R[K]> }]\n          : T extends readonly [infer A, ...infer R]\n            ? readonly [TArg<A>, ...{ [K in keyof R]: TArg<R[K]> }]\n            : T extends (infer A)[]\n              ? TArg<A>[]\n              : T extends readonly (infer A)[]\n                ? readonly TArg<A>[]\n                : T extends Promise<infer A>\n                  ? Promise<TArg<A>>\n                  : T extends object\n                    ? { [K in keyof T]: TArg<T[K]> }\n                    : T\n      : TypedArg<T>);\n/** Recursively adapts byte-carrying API output types. See {@link TypedArg}. */\nexport type TRet<T> = T extends unknown\n  ? T &\n      ([TypedRet<T>] extends [never]\n        ? T extends (...args: infer A) => infer R\n          ? ((...args: { [K in keyof A]: TArg<A[K]> }) => TRet<R>) & {\n              [K in keyof T]: T[K] extends (...args: any) => any ? T[K] : TRet<T[K]>;\n            }\n          : T extends [infer A, ...infer R]\n            ? [TRet<A>, ...{ [K in keyof R]: TRet<R[K]> }]\n            : T extends readonly [infer A, ...infer R]\n              ? readonly [TRet<A>, ...{ [K in keyof R]: TRet<R[K]> }]\n              : T extends (infer A)[]\n                ? TRet<A>[]\n                : T extends readonly (infer A)[]\n                  ? readonly TRet<A>[]\n                  : T extends Promise<infer A>\n                    ? Promise<TRet<A>>\n                    : T extends object\n                      ? { [K in keyof T]: TRet<T[K]> }\n                      : T\n        : TypedRet<T>)\n  : never;\n/**\n * Checks if something is Uint8Array. Be careful: nodejs Buffer will return true.\n * @param a - value to test\n * @returns `true` when the value is a Uint8Array-compatible view.\n * @example\n * Check whether a value is a Uint8Array-compatible view.\n * ```ts\n * isBytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function isBytes(a: unknown): a is Uint8Array {\n  // Plain `instanceof Uint8Array` is too strict for some Buffer / proxy / cross-realm cases.\n  // The fallback still requires a real ArrayBuffer view, so plain\n  // JSON-deserialized `{ constructor: ... }` spoofing is rejected, and\n  // `BYTES_PER_ELEMENT === 1` keeps the fallback on byte-oriented views.\n  return (\n    a instanceof Uint8Array ||\n    (ArrayBuffer.isView(a) &&\n      a.constructor.name === 'Uint8Array' &&\n      'BYTES_PER_ELEMENT' in a &&\n      a.BYTES_PER_ELEMENT === 1)\n  );\n}\n\n/**\n * Asserts something is a non-negative integer.\n * @param n - number to validate\n * @param title - label included in thrown errors\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate a non-negative integer option.\n * ```ts\n * anumber(32, 'length');\n * ```\n */\nexport function anumber(n: number, title: string = ''): void {\n  if (typeof n !== 'number') {\n    const prefix = title && `\"${title}\" `;\n    throw new TypeError(`${prefix}expected number, got ${typeof n}`);\n  }\n  if (!Number.isSafeInteger(n) || n < 0) {\n    const prefix = title && `\"${title}\" `;\n    throw new RangeError(`${prefix}expected integer >= 0, got ${n}`);\n  }\n}\n\n/**\n * Asserts something is Uint8Array.\n * @param value - value to validate\n * @param length - optional exact length constraint\n * @param title - label included in thrown errors\n * @returns The validated byte array.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate that a value is a byte array.\n * ```ts\n * abytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function abytes(\n  value: TArg<Uint8Array>,\n  length?: number,\n  title: string = ''\n): TRet<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    const message = prefix + 'expected Uint8Array' + ofLen + ', got ' + got;\n    if (!bytes) throw new TypeError(message);\n    throw new RangeError(message);\n  }\n  return value as TRet<Uint8Array>;\n}\n\n/**\n * Copies bytes into a fresh Uint8Array.\n * Buffer-style slices can alias the same backing store, so callers that need ownership should copy.\n * @param bytes - source bytes to clone\n * @returns Freshly allocated copy of `bytes`.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Clone a byte array before mutating it.\n * ```ts\n * const copy = copyBytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function copyBytes(bytes: TArg<Uint8Array>): TRet<Uint8Array> {\n  // `Uint8Array.from(...)` would also accept arrays / other typed arrays. Keep this helper strict\n  // because callers use it at byte-validation boundaries before mutating the detached copy.\n  return Uint8Array.from(abytes(bytes)) as TRet<Uint8Array>;\n}\n\n/**\n * Asserts something is a wrapped hash constructor.\n * @param h - hash constructor to validate\n * @throws On wrong argument types or invalid hash wrapper shape. {@link TypeError}\n * @throws On invalid hash metadata ranges or values. {@link RangeError}\n * @throws If the hash metadata allows empty outputs or block sizes. {@link Error}\n * @example\n * Validate a callable hash wrapper.\n * ```ts\n * import { ahash } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * ahash(sha256);\n * ```\n */\nexport function ahash(h: TArg<CHash>): void {\n  if (typeof h !== 'function' || typeof h.create !== 'function')\n    throw new TypeError('Hash must wrapped by utils.createHasher');\n  anumber(h.outputLen);\n  anumber(h.blockLen);\n  // HMAC and KDF callers treat these as real byte lengths; allowing zero lets fake wrappers pass\n  // validation and can produce empty outputs instead of failing fast.\n  if (h.outputLen < 1) throw new Error('\"outputLen\" must be >= 1');\n  if (h.blockLen < 1) throw new Error('\"blockLen\" must be >= 1');\n}\n\n/**\n * Asserts a hash instance has not been destroyed or finished.\n * @param instance - hash instance to validate\n * @param checkFinished - whether to reject finalized instances\n * @throws If the hash instance has already been destroyed or finalized. {@link Error}\n * @example\n * Validate that a hash instance is still usable.\n * ```ts\n * import { aexists } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const hash = sha256.create();\n * aexists(hash);\n * ```\n */\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/**\n * Asserts output is a sufficiently-sized byte array.\n * @param out - destination buffer\n * @param instance - hash instance providing output length\n * Oversized buffers are allowed; downstream code only promises to fill the first `outputLen` bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate a caller-provided digest buffer.\n * ```ts\n * import { aoutput } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const hash = sha256.create();\n * aoutput(new Uint8Array(hash.outputLen), hash);\n * ```\n */\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 RangeError('\"digestInto() output\" expected to be of length >=' + min);\n  }\n}\n\n/** Generic type encompassing 8/16/32-byte array views, but not 64-bit variants. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n  Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/**\n * Casts a typed array view to Uint8Array.\n * @param arr - source typed array\n * @returns Uint8Array view over the same buffer.\n * @example\n * Reinterpret a typed array as bytes.\n * ```ts\n * u8(new Uint32Array([1, 2]));\n * ```\n */\nexport function u8(arr: TArg<TypedArray>): TRet<Uint8Array> {\n  return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength) as TRet<Uint8Array>;\n}\n\n/**\n * Casts a typed array view to Uint32Array.\n * `arr.byteOffset` must already be 4-byte aligned or the platform\n * Uint32Array constructor will throw.\n * @param arr - source typed array\n * @returns Uint32Array view over the same buffer.\n * @example\n * Reinterpret a byte array as 32-bit words.\n * ```ts\n * u32(new Uint8Array(8));\n * ```\n */\nexport function u32(arr: TArg<TypedArray>): TRet<Uint32Array> {\n  return new Uint32Array(\n    arr.buffer,\n    arr.byteOffset,\n    Math.floor(arr.byteLength / 4)\n  ) as TRet<Uint32Array>;\n}\n\n/**\n * Zeroizes typed arrays in place. Warning: JS provides no guarantees.\n * @param arrays - arrays to overwrite with zeros\n * @example\n * Zeroize sensitive buffers in place.\n * ```ts\n * clean(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function clean(...arrays: TArg<TypedArray[]>): void {\n  for (let i = 0; i < arrays.length; i++) {\n    arrays[i].fill(0);\n  }\n}\n\n/**\n * Creates a DataView for byte-level manipulation.\n * @param arr - source typed array\n * @returns DataView over the same buffer region.\n * @example\n * Create a DataView over an existing buffer.\n * ```ts\n * createView(new Uint8Array(4));\n * ```\n */\nexport function createView(arr: TArg<TypedArray>): DataView {\n  return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/**\n * Rotate-right operation for uint32 values.\n * @param word - source word\n * @param shift - shift amount in bits\n * @returns Rotated word.\n * @example\n * Rotate a 32-bit word to the right.\n * ```ts\n * rotr(0x12345678, 8);\n * ```\n */\nexport function rotr(word: number, shift: number): number {\n  return (word << (32 - shift)) | (word >>> shift);\n}\n\n/**\n * Rotate-left operation for uint32 values.\n * @param word - source word\n * @param shift - shift amount in bits\n * @returns Rotated word.\n * @example\n * Rotate a 32-bit word to the left.\n * ```ts\n * rotl(0x12345678, 8);\n * ```\n */\nexport function rotl(word: number, shift: number): number {\n  return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Whether the current platform is little-endian. */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n  new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/**\n * Byte-swap operation for uint32 values.\n * @param word - source word\n * @returns Word with reversed byte order.\n * @example\n * Reverse the byte order of a 32-bit word.\n * ```ts\n * byteSwap(0x11223344);\n * ```\n */\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/**\n * Conditionally byte-swaps one 32-bit word on big-endian platforms.\n * @param n - source word\n * @returns Original or byte-swapped word depending on platform endianness.\n * @example\n * Normalize a 32-bit word for host endianness.\n * ```ts\n * swap8IfBE(0x11223344);\n * ```\n */\nexport const swap8IfBE: (n: number) => number = isLE\n  ? (n: number) => n\n  : (n: number) => byteSwap(n) >>> 0;\n\n/**\n * Byte-swaps every word of a Uint32Array in place.\n * @param arr - array to mutate\n * @returns The same array after mutation; callers pass live state arrays here.\n * @example\n * Reverse the byte order of every word in place.\n * ```ts\n * byteSwap32(new Uint32Array([0x11223344]));\n * ```\n */\nexport function byteSwap32(arr: TArg<Uint32Array>): TRet<Uint32Array> {\n  for (let i = 0; i < arr.length; i++) {\n    arr[i] = byteSwap(arr[i]);\n  }\n  return arr as TRet<Uint32Array>;\n}\n\n/**\n * Conditionally byte-swaps a Uint32Array on big-endian platforms.\n * @param u - array to normalize for host endianness\n * @returns Original or byte-swapped array depending on platform endianness.\n *   On big-endian runtimes this mutates `u` in place via `byteSwap32(...)`.\n * @example\n * Normalize a word array for host endianness.\n * ```ts\n * swap32IfBE(new Uint32Array([0x11223344]));\n * ```\n */\nexport const swap32IfBE: (u: TArg<Uint32Array>) => TRet<Uint32Array> = isLE\n  ? (u: TArg<Uint32Array>) => u as TRet<Uint32Array>\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.\n * Uses the built-in function when available and assumes it matches the tested\n * fallback semantics.\n * @param bytes - bytes to encode\n * @returns Lowercase hexadecimal string.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Convert bytes to lowercase hexadecimal.\n * ```ts\n * bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])); // 'cafe0123'\n * ```\n */\nexport function bytesToHex(bytes: TArg<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 * @param hex - hexadecimal string to decode\n * @returns Decoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Decode lowercase hexadecimal into bytes.\n * ```ts\n * hexToBytes('cafe0123'); // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n * ```\n */\nexport function hexToBytes(hex: string): TRet<Uint8Array> {\n  if (typeof hex !== 'string') throw new TypeError('hex string expected, got ' + typeof hex);\n  if (hasHexBuiltin) {\n    try {\n      return (Uint8Array as any).fromHex(hex);\n    } catch (error) {\n      if (error instanceof SyntaxError) throw new RangeError(error.message);\n      throw error;\n    }\n  }\n  const hl = hex.length;\n  const al = hl / 2;\n  if (hl % 2) throw new RangeError('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 RangeError(\n        'hex string expected, got non-hex character \"' + char + '\" at index ' + hi\n      );\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 * This yields to the Promise/microtask scheduler queue, not to timers or the\n * full macrotask event loop.\n * @example\n * Yield to the next scheduler tick.\n * ```ts\n * await nextTick();\n * ```\n */\nexport const nextTick = async (): Promise<void> => {};\n\n/**\n * Returns control to the Promise/microtask scheduler every `tick`\n * milliseconds to avoid blocking long loops.\n * @param iters - number of loop iterations to run\n * @param tick - maximum time slice in milliseconds\n * @param cb - callback executed on each iteration\n * @example\n * Run a loop that periodically yields back to the event loop.\n * ```ts\n * await asyncLoop(2, 0, () => {});\n * ```\n */\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 * Non-ASCII details are delegated to the platform `TextEncoder`.\n * @param str - string to encode\n * @returns UTF-8 encoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Encode a string as UTF-8 bytes.\n * ```ts\n * utf8ToBytes('abc'); // Uint8Array.from([97, 98, 99])\n * ```\n */\nexport function utf8ToBytes(str: string): TRet<Uint8Array> {\n  if (typeof str !== 'string') throw new TypeError('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 * String inputs are UTF-8 encoded; byte-array inputs stay aliased to the caller buffer.\n * @param data - user-provided KDF input\n * @param errorTitle - label included in thrown errors\n * @returns Byte representation of the input.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Normalize KDF input to bytes.\n * ```ts\n * kdfInputToBytes('password');\n * ```\n */\nexport function kdfInputToBytes(data: TArg<KDFInput>, errorTitle = ''): TRet<Uint8Array> {\n  if (typeof data === 'string') return utf8ToBytes(data);\n  return abytes(data, undefined, errorTitle);\n}\n\n/**\n * Copies several Uint8Arrays into one.\n * @param arrays - arrays to concatenate\n * @returns Concatenated byte array.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Concatenate multiple byte arrays.\n * ```ts\n * concatBytes(new Uint8Array([1]), new Uint8Array([2]));\n * ```\n */\nexport function concatBytes(...arrays: TArg<Uint8Array[]>): TRet<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/**\n * Merges default options and passed options.\n * @param defaults - base option object\n * @param opts - user overrides\n * @returns Merged option object. The merge mutates `defaults` in place.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Merge user overrides onto default options.\n * ```ts\n * checkOpts({ dkLen: 32 }, { asyncTick: 10 });\n * ```\n */\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 TypeError('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 hash instances. */\nexport interface Hash<T> {\n  /** Bytes processed per compression block. */\n  blockLen: number;\n  /** Bytes produced by `digest()`. */\n  outputLen: number;\n  /** Whether the instance supports XOF-style variable-length output via `xof()` / `xofInto()`. */\n  canXOF: boolean;\n  /**\n   * Absorbs more message bytes into the running hash state.\n   * @param buf - message chunk to absorb\n   * @returns The same hash instance for chaining.\n   */\n  update(buf: TArg<Uint8Array>): this;\n  /**\n   * Finalizes the hash into a caller-provided buffer.\n   * @param buf - destination buffer\n   * @returns Nothing. Implementations write into `buf` in place.\n   */\n  digestInto(buf: TArg<Uint8Array>): void;\n  /**\n   * Finalizes the hash and returns a freshly allocated digest.\n   * @returns Digest bytes.\n   */\n  digest(): TRet<Uint8Array>;\n  /** Wipes internal state and makes the instance unusable. */\n  destroy(): void;\n  /**\n   * Copies the current hash state into an existing or new instance.\n   * @param to - Optional destination instance to reuse.\n   * @returns Cloned hash state.\n   */\n  _cloneInto(to?: T): T;\n  /**\n   * Creates an independent copy of the current hash state.\n   * @returns Cloned hash instance.\n   */\n  clone(): T;\n}\n\n/** Pseudorandom generator interface. */\nexport interface PRG {\n  /**\n   * Mixes more entropy into the generator state.\n   * @param seed - fresh entropy bytes\n   * @returns Nothing. Implementations update internal state in place.\n   */\n  addEntropy(seed: TArg<Uint8Array>): void;\n  /**\n   * Generates pseudorandom output bytes.\n   * @param length - number of bytes to generate\n   * @returns Generated pseudorandom bytes.\n   */\n  randomBytes(length: number): TRet<Uint8Array>;\n  /** Wipes generator state and makes the instance unusable. */\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  /**\n   * Reads more bytes from the XOF stream.\n   * @param bytes - number of bytes to read\n   * @returns Requested digest bytes.\n   */\n  xof(bytes: number): TRet<Uint8Array>;\n  /**\n   * Reads more bytes from the XOF stream into a caller-provided buffer.\n   * @param buf - destination buffer\n   * @returns Filled output buffer.\n   */\n  xofInto(buf: TArg<Uint8Array>): TRet<Uint8Array>;\n};\n\n/** Hash constructor or factory type. */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash metadata. */\nexport type HashInfo = {\n  /** DER-encoded object identifier bytes for the hash algorithm. */\n  oid?: TRet<Uint8Array>;\n};\n/** Callable hash function type. */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n  /** Digest size in bytes. */\n  outputLen: number;\n  /** Input block size in bytes. */\n  blockLen: number;\n  /** Whether `.create()` returns a hash instance that can be used as an XOF stream. */\n  canXOF: boolean;\n} & HashInfo &\n  (Opts extends undefined\n    ? {\n        (msg: TArg<Uint8Array>): TRet<Uint8Array>;\n        create(): T;\n      }\n    : {\n        (msg: TArg<Uint8Array>, opts?: TArg<Opts>): TRet<Uint8Array>;\n        create(opts?: Opts): T;\n      });\n/** Callable extendable-output hash function type. */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/**\n * Creates a callable hash function from a stateful class constructor.\n * @param hashCons - hash constructor or factory\n * @param info - optional metadata such as DER OID\n * @returns Frozen callable hash wrapper with `.create()`.\n *   Wrapper construction eagerly calls `hashCons(undefined)` once to read\n *   `outputLen` / `blockLen`, so constructor side effects happen at module\n *   init time.\n * @example\n * Wrap a stateful hash constructor into a callable helper.\n * ```ts\n * import { createHasher } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const wrapped = createHasher(sha256.create, { oid: sha256.oid });\n * wrapped(new Uint8Array([1]));\n * ```\n */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n  hashCons: HasherCons<T, Opts>,\n  info: TArg<HashInfo> = {}\n): TRet<CHash<T, Opts>> {\n  const hashC: any = (msg: TArg<Uint8Array>, opts?: TArg<Opts>) =>\n    hashCons(opts as Opts)\n      .update(msg)\n      .digest();\n  const tmp = hashCons(undefined);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.canXOF = tmp.canXOF;\n  hashC.create = (opts?: Opts) => hashCons(opts);\n  Object.assign(hashC, info);\n  return Object.freeze(hashC) as TRet<CHash<T, Opts>>;\n}\n\n/**\n * Cryptographically secure PRNG backed by `crypto.getRandomValues`.\n * @param bytesLength - number of random bytes to generate\n * @returns Random bytes.\n * The platform `getRandomValues()` implementation still defines any\n * single-call length cap, and this helper rejects oversize requests\n * with a stable library `RangeError` instead of host-specific errors.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If the current runtime does not provide `crypto.getRandomValues`. {@link Error}\n * @example\n * Generate a fresh random key or nonce.\n * ```ts\n * const key = randomBytes(16);\n * ```\n */\nexport function randomBytes(bytesLength = 32): TRet<Uint8Array> {\n  // Match the repo's other length-taking helpers instead of relying on Uint8Array coercion.\n  anumber(bytesLength, 'bytesLength');\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  // Web Cryptography API Level 2 §10.1.1:\n  // if `byteLength > 65536`, throw `QuotaExceededError`.\n  // Keep the guard explicit so callers can see the quota in code\n  // instead of discovering it by reading the spec or host errors.\n  // This wrapper surfaces the same quota as a stable library RangeError.\n  if (bytesLength > 65536)\n    throw new RangeError(`\"bytesLength\" expected <= 65536, got ${bytesLength}`);\n  return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/**\n * Creates OID metadata for NIST hashes with prefix `06 09 60 86 48 01 65 03 04 02`.\n * @param suffix - final OID byte for the selected hash.\n *   The helper accepts any byte even though only the documented NIST hash\n *   suffixes are meaningful downstream.\n * @returns Object containing the DER-encoded OID.\n * @example\n * Build OID metadata for a NIST hash.\n * ```ts\n * oidNist(0x01);\n * ```\n */\nexport const oidNist = (suffix: number): TRet<Required<HashInfo>> => ({\n  // Current NIST hashAlgs suffixes used here fit in one DER subidentifier octet.\n  // Larger suffix values would need base-128 OID encoding and a different length byte.\n  oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n","/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport {\n  abytes,\n  aexists,\n  aoutput,\n  clean,\n  createView,\n  type Hash,\n  type TArg,\n  type TRet,\n} from './utils.ts';\n\n/**\n * Shared 32-bit conditional boolean primitive reused by SHA-256, SHA-1, and MD5 `F`.\n * Returns bits from `b` when `a` is set, otherwise from `c`.\n * The XOR form is equivalent to MD5's `F(X,Y,Z) = XY v not(X)Z` because the masked terms never\n * set the same bit.\n * @param a - selector word\n * @param b - word chosen when selector bit is set\n * @param c - word chosen when selector bit is clear\n * @returns Mixed 32-bit word.\n * @example\n * Combine three words with the shared 32-bit choice primitive.\n * ```ts\n * Chi(0xffffffff, 0x12345678, 0x87654321);\n * ```\n */\nexport function Chi(a: number, b: number, c: number): number {\n  return (a & b) ^ (~a & c);\n}\n\n/**\n * Shared 32-bit majority primitive reused by SHA-256 and SHA-1.\n * Returns bits shared by at least two inputs.\n * @param a - first input word\n * @param b - second input word\n * @param c - third input word\n * @returns Mixed 32-bit word.\n * @example\n * Combine three words with the shared 32-bit majority primitive.\n * ```ts\n * Maj(0xffffffff, 0x12345678, 0x87654321);\n * ```\n */\nexport function Maj(a: number, b: number, c: number): number {\n  return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n * Accepts only byte-aligned `Uint8Array` input, even when the underlying spec describes bit\n * strings with partial-byte tails.\n * @param blockLen - internal block size in bytes\n * @param outputLen - digest size in bytes\n * @param padOffset - trailing length field size in bytes\n * @param isLE - whether length and state words are encoded in little-endian\n * @example\n * Use a concrete subclass to get the shared Merkle-Damgard update/digest flow.\n * ```ts\n * import { _SHA1 } from '@noble/hashes/legacy.js';\n * const hash = new _SHA1();\n * hash.update(new Uint8Array([97, 98, 99]));\n * hash.digest();\n * ```\n */\nexport abstract class HashMD<T extends HashMD<T>> implements Hash<T> {\n  // Subclasses must treat `buf` as read-only: `update()` may pass a direct view over caller input\n  // when it can process whole blocks without buffering first.\n  protected abstract process(buf: DataView, offset: number): void;\n  protected abstract get(): number[];\n  protected abstract set(...args: number[]): void;\n  abstract destroy(): void;\n  protected abstract roundClean(): void;\n\n  readonly blockLen: number;\n  readonly outputLen: number;\n  readonly canXOF = false;\n  readonly padOffset: number;\n  readonly isLE: boolean;\n\n  // For partial updates less than block size\n  protected buffer: Uint8Array;\n  protected view: DataView;\n  protected finished = false;\n  protected length = 0;\n  protected pos = 0;\n  protected destroyed = false;\n\n  constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\n    this.blockLen = blockLen;\n    this.outputLen = outputLen;\n    this.padOffset = padOffset;\n    this.isLE = isLE;\n    this.buffer = new Uint8Array(blockLen);\n    this.view = createView(this.buffer);\n  }\n  update(data: TArg<Uint8Array>): this {\n    aexists(this);\n    abytes(data);\n    const { view, buffer, blockLen } = this;\n    const len = data.length;\n    for (let pos = 0; pos < len; ) {\n      const take = Math.min(blockLen - this.pos, len - pos);\n      // Fast path only when there is no buffered partial block: `take === blockLen` implies\n      // `this.pos === 0`, so we can process full blocks directly from the input view.\n      if (take === blockLen) {\n        const dataView = createView(data);\n        for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);\n        continue;\n      }\n      buffer.set(data.subarray(pos, pos + take), this.pos);\n      this.pos += take;\n      pos += take;\n      if (this.pos === blockLen) {\n        this.process(view, 0);\n        this.pos = 0;\n      }\n    }\n    this.length += data.length;\n    this.roundClean();\n    return this;\n  }\n  digestInto(out: TArg<Uint8Array>): void {\n    aexists(this);\n    aoutput(out, this);\n    this.finished = true;\n    // Padding\n    // We can avoid allocation of buffer for padding completely if it\n    // was previously not allocated here. But it won't change performance.\n    const { buffer, view, blockLen, isLE } = this;\n    let { pos } = this;\n    // append the bit '1' to the message\n    buffer[pos++] = 0b10000000;\n    clean(this.buffer.subarray(pos));\n    // we have less than padOffset left in buffer, so we cannot put length in\n    // current block, need process it and pad again\n    if (this.padOffset > blockLen - pos) {\n      this.process(view, 0);\n      pos = 0;\n    }\n    // Pad until full block byte with zeros\n    for (let i = pos; i < blockLen; i++) buffer[i] = 0;\n    // `padOffset` reserves the whole length field. For SHA-384/512 the high 64 bits stay zero from\n    // the padding fill above, and JS will overflow before user input can make that half non-zero.\n    // So we only need to write the low 64 bits here.\n    view.setBigUint64(blockLen - 8, BigInt(this.length * 8), isLE);\n    this.process(view, 0);\n    const oview = createView(out);\n    const len = this.outputLen;\n    // NOTE: we do division by 4 later, which must be fused in single op with modulo by JIT\n    if (len % 4) throw new Error('_sha2: outputLen must be aligned to 32bit');\n    const outLen = len / 4;\n    const state = this.get();\n    if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n    for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n  }\n  digest(): TRet<Uint8Array> {\n    const { buffer, outputLen } = this;\n    this.digestInto(buffer);\n    // Copy before destroy(): subclasses wipe `buffer` during cleanup, but `digest()` must return\n    // fresh bytes to the caller.\n    const res = buffer.slice(0, outputLen);\n    this.destroy();\n    return res as TRet<Uint8Array>;\n  }\n  _cloneInto(to?: T): T {\n    to ||= new (this.constructor as any)() as T;\n    to.set(...this.get());\n    const { blockLen, buffer, length, finished, destroyed, pos } = this;\n    to.destroyed = destroyed;\n    to.finished = finished;\n    to.length = length;\n    to.pos = pos;\n    // Only partial-block bytes need copying: when `length % blockLen === 0`, `pos === 0` and\n    // later `update()` / `digestInto()` overwrite `to.buffer` from the start before reading it.\n    if (length % blockLen) to.buffer.set(buffer);\n    return to as unknown as any;\n  }\n  clone(): T {\n    return this._cloneInto();\n  }\n}\n\n/**\n * Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n */\n\n/** Initial SHA256 state from RFC 6234 §6.1: the first 32 bits of the fractional parts of the\n * square roots of the first eight prime numbers. Exported as a shared table; callers must treat\n * it as read-only because constructors copy words from it by index. */\nexport const SHA256_IV: TRet<Uint32Array> = /* @__PURE__ */ Uint32Array.from([\n  0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state `H(0)` from RFC 6234 §6.1. Exported as a shared table; callers must\n * treat it as read-only because constructors copy words from it by index. */\nexport const SHA224_IV: TRet<Uint32Array> = /* @__PURE__ */ Uint32Array.from([\n  0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state from RFC 6234 §6.3: eight RFC 64-bit `H(0)` words stored as sixteen\n * big-endian 32-bit halves. Derived from the fractional parts of the square roots of the ninth\n * through sixteenth prime numbers. Exported as a shared table; callers must treat it as read-only\n * because constructors copy halves from it by index. */\nexport const SHA384_IV: TRet<Uint32Array> = /* @__PURE__ */ Uint32Array.from([\n  0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n  0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state from RFC 6234 §6.3: eight RFC 64-bit `H(0)` words stored as sixteen\n * big-endian 32-bit halves. Derived from the fractional parts of the square roots of the first\n * eight prime numbers. Exported as a shared table; callers must treat it as read-only because\n * constructors copy halves from it by index. */\nexport const SHA512_IV: TRet<Uint32Array> = /* @__PURE__ */ Uint32Array.from([\n  0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n  0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n","/**\n * SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.\n * SHA256 is the fastest hash implementable in JS, even faster than Blake3.\n * Check out {@link https://www.rfc-editor.org/rfc/rfc4634 | RFC 4634} and\n * {@link https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf | FIPS 180-4}.\n * @module\n */\nimport { Chi, HashMD, Maj, SHA224_IV, SHA256_IV, SHA384_IV, SHA512_IV } from './_md.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, oidNist, rotr, type TRet } from './utils.ts';\n\n/**\n * SHA-224 / SHA-256 round constants from RFC 6234 §5.1: the first 32 bits\n * of the cube roots of the first 64 primes (2..311).\n */\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ Uint32Array.from([\n  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n\n/** Reusable SHA-224 / SHA-256 message schedule buffer `W_t` from RFC 6234 §6.2 step 1. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n\n/** Internal SHA-224 / SHA-256 compression engine from RFC 6234 §6.2. */\nabstract class SHA2_32B<T extends SHA2_32B<T>> extends HashMD<T> {\n  // We cannot use array here since array allows indexing by variable\n  // which means optimizer/compiler cannot use registers.\n  protected abstract A: number;\n  protected abstract B: number;\n  protected abstract C: number;\n  protected abstract D: number;\n  protected abstract E: number;\n  protected abstract F: number;\n  protected abstract G: number;\n  protected abstract H: number;\n\n  constructor(outputLen: number) {\n    super(64, outputLen, 8, false);\n  }\n  protected get(): [number, number, number, number, number, number, number, number] {\n    const { A, B, C, D, E, F, G, H } = this;\n    return [A, B, C, D, E, F, G, H];\n  }\n  // prettier-ignore\n  protected set(\n    A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n  ): void {\n    this.A = A | 0;\n    this.B = B | 0;\n    this.C = C | 0;\n    this.D = D | 0;\n    this.E = E | 0;\n    this.F = F | 0;\n    this.G = G | 0;\n    this.H = H | 0;\n  }\n  protected process(view: DataView, offset: number): void {\n    // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n    for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);\n    for (let i = 16; i < 64; i++) {\n      const W15 = SHA256_W[i - 15];\n      const W2 = SHA256_W[i - 2];\n      const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n      const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n      SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n    }\n    // Compression function main loop, 64 rounds\n    let { A, B, C, D, E, F, G, H } = this;\n    for (let i = 0; i < 64; i++) {\n      const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n      const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n      const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n      const T2 = (sigma0 + Maj(A, B, C)) | 0;\n      H = G;\n      G = F;\n      F = E;\n      E = (D + T1) | 0;\n      D = C;\n      C = B;\n      B = A;\n      A = (T1 + T2) | 0;\n    }\n    // Add the compressed chunk to the current hash value\n    A = (A + this.A) | 0;\n    B = (B + this.B) | 0;\n    C = (C + this.C) | 0;\n    D = (D + this.D) | 0;\n    E = (E + this.E) | 0;\n    F = (F + this.F) | 0;\n    G = (G + this.G) | 0;\n    H = (H + this.H) | 0;\n    this.set(A, B, C, D, E, F, G, H);\n  }\n  protected roundClean(): void {\n    clean(SHA256_W);\n  }\n  destroy(): void {\n    // HashMD callers route post-destroy usability through `destroyed`; zeroizing alone still leaves\n    // update()/digest() callable on reused instances.\n    this.destroyed = true;\n    this.set(0, 0, 0, 0, 0, 0, 0, 0);\n    clean(this.buffer);\n  }\n}\n\n/** Internal SHA-256 hash class grounded in RFC 6234 §6.2. */\nexport class _SHA256 extends SHA2_32B<_SHA256> {\n  // We cannot use array here since array allows indexing by variable\n  // which means optimizer/compiler cannot use registers.\n  protected A: number = SHA256_IV[0] | 0;\n  protected B: number = SHA256_IV[1] | 0;\n  protected C: number = SHA256_IV[2] | 0;\n  protected D: number = SHA256_IV[3] | 0;\n  protected E: number = SHA256_IV[4] | 0;\n  protected F: number = SHA256_IV[5] | 0;\n  protected G: number = SHA256_IV[6] | 0;\n  protected H: number = SHA256_IV[7] | 0;\n  constructor() {\n    super(32);\n  }\n}\n\n/** Internal SHA-224 hash class grounded in RFC 6234 §6.2 and §8.5. */\nexport class _SHA224 extends SHA2_32B<_SHA224> {\n  protected A: number = SHA224_IV[0] | 0;\n  protected B: number = SHA224_IV[1] | 0;\n  protected C: number = SHA224_IV[2] | 0;\n  protected D: number = SHA224_IV[3] | 0;\n  protected E: number = SHA224_IV[4] | 0;\n  protected F: number = SHA224_IV[5] | 0;\n  protected G: number = SHA224_IV[6] | 0;\n  protected H: number = SHA224_IV[7] | 0;\n  constructor() {\n    super(28);\n  }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\n// SHA-384 / SHA-512 round constants from RFC 6234 §5.2:\n// 80 full 64-bit words split into high/low halves.\n// prettier-ignore\nconst K512 = /* @__PURE__ */ (() => u64.split([\n  '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n  '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n  '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n  '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n  '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n  '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n  '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n  '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n  '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n  '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n  '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n  '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n  '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n  '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n  '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n  '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n  '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n  '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n  '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n  '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\nconst SHA512_Kh = /* @__PURE__ */ (() => K512[0])();\nconst SHA512_Kl = /* @__PURE__ */ (() => K512[1])();\n\n// Reusable high-half schedule buffer for the RFC 6234 §6.4 64-bit `W_t` words.\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\n// Reusable low-half schedule buffer for the RFC 6234 §6.4 64-bit `W_t` words.\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal SHA-384 / SHA-512 compression engine from RFC 6234 §6.4. */\nabstract class SHA2_64B<T extends SHA2_64B<T>> extends HashMD<T> {\n  // We cannot use array here since array allows indexing by variable\n  // which means optimizer/compiler cannot use registers.\n  // h -- high 32 bits, l -- low 32 bits\n  protected abstract Ah: number;\n  protected abstract Al: number;\n  protected abstract Bh: number;\n  protected abstract Bl: number;\n  protected abstract Ch: number;\n  protected abstract Cl: number;\n  protected abstract Dh: number;\n  protected abstract Dl: number;\n  protected abstract Eh: number;\n  protected abstract El: number;\n  protected abstract Fh: number;\n  protected abstract Fl: number;\n  protected abstract Gh: number;\n  protected abstract Gl: number;\n  protected abstract Hh: number;\n  protected abstract Hl: number;\n\n  constructor(outputLen: number) {\n    super(128, outputLen, 16, false);\n  }\n  // prettier-ignore\n  protected get(): [\n    number, number, number, number, number, number, number, number,\n    number, number, number, number, number, number, number, number\n  ] {\n    const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n    return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n  }\n  // prettier-ignore\n  protected set(\n    Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n    Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n  ): void {\n    this.Ah = Ah | 0;\n    this.Al = Al | 0;\n    this.Bh = Bh | 0;\n    this.Bl = Bl | 0;\n    this.Ch = Ch | 0;\n    this.Cl = Cl | 0;\n    this.Dh = Dh | 0;\n    this.Dl = Dl | 0;\n    this.Eh = Eh | 0;\n    this.El = El | 0;\n    this.Fh = Fh | 0;\n    this.Fl = Fl | 0;\n    this.Gh = Gh | 0;\n    this.Gl = Gl | 0;\n    this.Hh = Hh | 0;\n    this.Hl = Hl | 0;\n  }\n  protected process(view: DataView, offset: number): void {\n    // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n    for (let i = 0; i < 16; i++, offset += 4) {\n      SHA512_W_H[i] = view.getUint32(offset);\n      SHA512_W_L[i] = view.getUint32((offset += 4));\n    }\n    for (let i = 16; i < 80; i++) {\n      // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n      const W15h = SHA512_W_H[i - 15] | 0;\n      const W15l = SHA512_W_L[i - 15] | 0;\n      const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n      const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n      // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n      const W2h = SHA512_W_H[i - 2] | 0;\n      const W2l = SHA512_W_L[i - 2] | 0;\n      const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n      const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n      // SHA512_W[i] = s0 + s1 + SHA512_W[i - 7] + SHA512_W[i - 16];\n      const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n      const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n      SHA512_W_H[i] = SUMh | 0;\n      SHA512_W_L[i] = SUMl | 0;\n    }\n    let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n    // Compression function main loop, 80 rounds\n    for (let i = 0; i < 80; i++) {\n      // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n      const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n      const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n      //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n      const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n      const CHIl = (El & Fl) ^ (~El & Gl);\n      // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n      // prettier-ignore\n      const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n      const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n      const T1l = T1ll | 0;\n      // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n      const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n      const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n      const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n      const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n      Hh = Gh | 0;\n      Hl = Gl | 0;\n      Gh = Fh | 0;\n      Gl = Fl | 0;\n      Fh = Eh | 0;\n      Fl = El | 0;\n      ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n      Dh = Ch | 0;\n      Dl = Cl | 0;\n      Ch = Bh | 0;\n      Cl = Bl | 0;\n      Bh = Ah | 0;\n      Bl = Al | 0;\n      const All = u64.add3L(T1l, sigma0l, MAJl);\n      Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n      Al = All | 0;\n    }\n    // Add the compressed chunk to the current hash value\n    ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n    ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n    ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n    ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n    ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n    ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n    ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n    ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n    this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n  }\n  protected roundClean(): void {\n    clean(SHA512_W_H, SHA512_W_L);\n  }\n  destroy(): void {\n    // HashMD callers route post-destroy usability through `destroyed`; zeroizing alone still leaves\n    // update()/digest() callable on reused instances.\n    this.destroyed = true;\n    clean(this.buffer);\n    this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n  }\n}\n\n/** Internal SHA-512 hash class grounded in RFC 6234 §6.3 and §6.4. */\nexport class _SHA512 extends SHA2_64B<_SHA512> {\n  protected Ah: number = SHA512_IV[0] | 0;\n  protected Al: number = SHA512_IV[1] | 0;\n  protected Bh: number = SHA512_IV[2] | 0;\n  protected Bl: number = SHA512_IV[3] | 0;\n  protected Ch: number = SHA512_IV[4] | 0;\n  protected Cl: number = SHA512_IV[5] | 0;\n  protected Dh: number = SHA512_IV[6] | 0;\n  protected Dl: number = SHA512_IV[7] | 0;\n  protected Eh: number = SHA512_IV[8] | 0;\n  protected El: number = SHA512_IV[9] | 0;\n  protected Fh: number = SHA512_IV[10] | 0;\n  protected Fl: number = SHA512_IV[11] | 0;\n  protected Gh: number = SHA512_IV[12] | 0;\n  protected Gl: number = SHA512_IV[13] | 0;\n  protected Hh: number = SHA512_IV[14] | 0;\n  protected Hl: number = SHA512_IV[15] | 0;\n\n  constructor() {\n    super(64);\n  }\n}\n\n/** Internal SHA-384 hash class grounded in RFC 6234 §6.3 and §6.4. */\nexport class _SHA384 extends SHA2_64B<_SHA384> {\n  protected Ah: number = SHA384_IV[0] | 0;\n  protected Al: number = SHA384_IV[1] | 0;\n  protected Bh: number = SHA384_IV[2] | 0;\n  protected Bl: number = SHA384_IV[3] | 0;\n  protected Ch: number = SHA384_IV[4] | 0;\n  protected Cl: number = SHA384_IV[5] | 0;\n  protected Dh: number = SHA384_IV[6] | 0;\n  protected Dl: number = SHA384_IV[7] | 0;\n  protected Eh: number = SHA384_IV[8] | 0;\n  protected El: number = SHA384_IV[9] | 0;\n  protected Fh: number = SHA384_IV[10] | 0;\n  protected Fl: number = SHA384_IV[11] | 0;\n  protected Gh: number = SHA384_IV[12] | 0;\n  protected Gl: number = SHA384_IV[13] | 0;\n  protected Hh: number = SHA384_IV[14] | 0;\n  protected Hl: number = SHA384_IV[15] | 0;\n\n  constructor() {\n    super(48);\n  }\n}\n\n/**\n * Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See the repo-side derivation recipe in `test/misc/sha2-gen-iv.js`.\n * These IV literals are checked against that script rather than a dedicated\n * local RFC section.\n */\n\n/** SHA-512/224 IV derived by the SHA-512/t recipe in `test/misc/sha2-gen-iv.js` and\n * stored as sixteen big-endian 32-bit halves. */\nconst T224_IV = /* @__PURE__ */ Uint32Array.from([\n  0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n  0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n\n/** SHA-512/256 IV derived by the SHA-512/t recipe in `test/misc/sha2-gen-iv.js` and\n * stored as sixteen big-endian 32-bit halves. */\nconst T256_IV = /* @__PURE__ */ Uint32Array.from([\n  0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n  0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\n\n/** Internal SHA-512/224 hash class using the derived `T224_IV` and the shared\n * RFC 6234 §6.4 compression engine. */\nexport class _SHA512_224 extends SHA2_64B<_SHA512_224> {\n  protected Ah: number = T224_IV[0] | 0;\n  protected Al: number = T224_IV[1] | 0;\n  protected Bh: number = T224_IV[2] | 0;\n  protected Bl: number = T224_IV[3] | 0;\n  protected Ch: number = T224_IV[4] | 0;\n  protected Cl: number = T224_IV[5] | 0;\n  protected Dh: number = T224_IV[6] | 0;\n  protected Dl: number = T224_IV[7] | 0;\n  protected Eh: number = T224_IV[8] | 0;\n  protected El: number = T224_IV[9] | 0;\n  protected Fh: number = T224_IV[10] | 0;\n  protected Fl: number = T224_IV[11] | 0;\n  protected Gh: number = T224_IV[12] | 0;\n  protected Gl: number = T224_IV[13] | 0;\n  protected Hh: number = T224_IV[14] | 0;\n  protected Hl: number = T224_IV[15] | 0;\n\n  constructor() {\n    super(28);\n  }\n}\n\n/** Internal SHA-512/256 hash class using the derived `T256_IV` and the shared\n * RFC 6234 §6.4 compression engine. */\nexport class _SHA512_256 extends SHA2_64B<_SHA512_256> {\n  protected Ah: number = T256_IV[0] | 0;\n  protected Al: number = T256_IV[1] | 0;\n  protected Bh: number = T256_IV[2] | 0;\n  protected Bl: number = T256_IV[3] | 0;\n  protected Ch: number = T256_IV[4] | 0;\n  protected Cl: number = T256_IV[5] | 0;\n  protected Dh: number = T256_IV[6] | 0;\n  protected Dl: number = T256_IV[7] | 0;\n  protected Eh: number = T256_IV[8] | 0;\n  protected El: number = T256_IV[9] | 0;\n  protected Fh: number = T256_IV[10] | 0;\n  protected Fl: number = T256_IV[11] | 0;\n  protected Gh: number = T256_IV[12] | 0;\n  protected Gl: number = T256_IV[13] | 0;\n  protected Hh: number = T256_IV[14] | 0;\n  protected Hl: number = T256_IV[15] | 0;\n\n  constructor() {\n    super(32);\n  }\n}\n\n/**\n * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n *\n * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-256.\n * ```ts\n * sha256(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha256: TRet<CHash<_SHA256>> = /* @__PURE__ */ createHasher(\n  () => new _SHA256(),\n  /* @__PURE__ */ oidNist(0x01)\n);\n/**\n * SHA2-224 hash function from RFC 4634.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-224.\n * ```ts\n * sha224(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha224: TRet<CHash<_SHA224>> = /* @__PURE__ */ createHasher(\n  () => new _SHA224(),\n  /* @__PURE__ */ oidNist(0x04)\n);\n\n/**\n * SHA2-512 hash function from RFC 4634.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-512.\n * ```ts\n * sha512(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha512: TRet<CHash<_SHA512>> = /* @__PURE__ */ createHasher(\n  () => new _SHA512(),\n  /* @__PURE__ */ oidNist(0x03)\n);\n/**\n * SHA2-384 hash function from RFC 4634.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-384.\n * ```ts\n * sha384(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha384: TRet<CHash<_SHA384>> = /* @__PURE__ */ createHasher(\n  () => new _SHA384(),\n  /* @__PURE__ */ oidNist(0x02)\n);\n\n/**\n * SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on {@link https://eprint.iacr.org/2010/548.pdf | truncated SHA512}.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-512/256.\n * ```ts\n * sha512_256(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha512_256: TRet<CHash<_SHA512_256>> = /* @__PURE__ */ createHasher(\n  () => new _SHA512_256(),\n  /* @__PURE__ */ oidNist(0x06)\n);\n/**\n * SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on {@link https://eprint.iacr.org/2010/548.pdf | truncated SHA512}.\n * @param msg - message bytes to hash\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-512/224.\n * ```ts\n * sha512_224(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha512_224: TRet<CHash<_SHA512_224>> = /* @__PURE__ */ createHasher(\n  () => new _SHA512_224(),\n  /* @__PURE__ */ oidNist(0x05)\n);\n","/**\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 as anumber_,\n  bytesToHex as bytesToHex_,\n  concatBytes as concatBytes_,\n  hexToBytes as hexToBytes_,\n  isBytes as isBytes_,\n  randomBytes as randomBytes_,\n} from '@noble/hashes/utils.js';\n/**\n * Bytes API type helpers for old + new TypeScript.\n *\n * TS 5.6 has `Uint8Array`, while TS 5.9+ made it generic `Uint8Array<ArrayBuffer>`.\n * We can't use specific return type, because TS 5.6 will error.\n * We can't use generic return type, because most TS 5.9 software will expect specific type.\n *\n * Maps typed-array input leaves to broad forms.\n * These are compatibility adapters, not ownership guarantees.\n *\n * - `TArg` keeps byte inputs broad.\n * - `TRet` marks byte outputs for TS 5.6 and TS 5.9+ compatibility.\n */\nexport type TypedArg<T> = T extends BigInt64Array\n  ? BigInt64Array\n  : T extends BigUint64Array\n    ? BigUint64Array\n    : T extends Float32Array\n      ? Float32Array\n      : T extends Float64Array\n        ? Float64Array\n        : T extends Int16Array\n          ? Int16Array\n          : T extends Int32Array\n            ? Int32Array\n            : T extends Int8Array\n              ? Int8Array\n              : T extends Uint16Array\n                ? Uint16Array\n                : T extends Uint32Array\n                  ? Uint32Array\n                  : T extends Uint8ClampedArray\n                    ? Uint8ClampedArray\n                    : T extends Uint8Array\n                      ? Uint8Array\n                      : never;\n/** Maps typed-array output leaves to narrow TS-compatible forms. */\nexport type TypedRet<T> = T extends BigInt64Array\n  ? ReturnType<typeof BigInt64Array.of>\n  : T extends BigUint64Array\n    ? ReturnType<typeof BigUint64Array.of>\n    : T extends Float32Array\n      ? ReturnType<typeof Float32Array.of>\n      : T extends Float64Array\n        ? ReturnType<typeof Float64Array.of>\n        : T extends Int16Array\n          ? ReturnType<typeof Int16Array.of>\n          : T extends Int32Array\n            ? ReturnType<typeof Int32Array.of>\n            : T extends Int8Array\n              ? ReturnType<typeof Int8Array.of>\n              : T extends Uint16Array\n                ? ReturnType<typeof Uint16Array.of>\n                : T extends Uint32Array\n                  ? ReturnType<typeof Uint32Array.of>\n                  : T extends Uint8ClampedArray\n                    ? ReturnType<typeof Uint8ClampedArray.of>\n                    : T extends Uint8Array\n                      ? ReturnType<typeof Uint8Array.of>\n                      : never;\n/** Recursively adapts byte-carrying API input types. See {@link TypedArg}. */\nexport type TArg<T> =\n  | T\n  | ([TypedArg<T>] extends [never]\n      ? T extends (...args: infer A) => infer R\n        ? ((...args: { [K in keyof A]: TRet<A[K]> }) => TArg<R>) & {\n            [K in keyof T]: T[K] extends (...args: any) => any ? T[K] : TArg<T[K]>;\n          }\n        : T extends [infer A, ...infer R]\n          ? [TArg<A>, ...{ [K in keyof R]: TArg<R[K]> }]\n          : T extends readonly [infer A, ...infer R]\n            ? readonly [TArg<A>, ...{ [K in keyof R]: TArg<R[K]> }]\n            : T extends (infer A)[]\n              ? TArg<A>[]\n              : T extends readonly (infer A)[]\n                ? readonly TArg<A>[]\n                : T extends Promise<infer A>\n                  ? Promise<TArg<A>>\n                  : T extends object\n                    ? { [K in keyof T]: TArg<T[K]> }\n                    : T\n      : TypedArg<T>);\n/** Recursively adapts byte-carrying API output types. See {@link TypedArg}. */\nexport type TRet<T> = T extends unknown\n  ? T &\n      ([TypedRet<T>] extends [never]\n        ? T extends (...args: infer A) => infer R\n          ? ((...args: { [K in keyof A]: TArg<A[K]> }) => TRet<R>) & {\n              [K in keyof T]: T[K] extends (...args: any) => any ? T[K] : TRet<T[K]>;\n            }\n          : T extends [infer A, ...infer R]\n            ? [TRet<A>, ...{ [K in keyof R]: TRet<R[K]> }]\n            : T extends readonly [infer A, ...infer R]\n              ? readonly [TRet<A>, ...{ [K in keyof R]: TRet<R[K]> }]\n              : T extends (infer A)[]\n                ? TRet<A>[]\n                : T extends readonly (infer A)[]\n                  ? readonly TRet<A>[]\n                  : T extends Promise<infer A>\n                    ? Promise<TRet<A>>\n                    : T extends object\n                      ? { [K in keyof T]: TRet<T[K]> }\n                      : T\n        : TypedRet<T>)\n  : never;\n/**\n * Validates that a value is a byte array.\n * @param value - Value to validate.\n * @param length - Optional exact byte length.\n * @param title - Optional field name.\n * @returns Original byte array.\n * @example\n * Reject non-byte input before passing data into curve code.\n *\n * ```ts\n * abytes(new Uint8Array(1));\n * ```\n */\nexport const abytes = <T extends TArg<Uint8Array>>(value: T, length?: number, title?: string): T =>\n  abytes_(value, length, title) as T;\n/**\n * Validates that a value is a non-negative safe integer.\n * @param n - Value to validate.\n * @param title - Optional field name.\n * @example\n * Validate a numeric length before allocating buffers.\n *\n * ```ts\n * anumber(1);\n * ```\n */\nexport const anumber: typeof anumber_ = anumber_;\n/**\n * Encodes bytes as lowercase hex.\n * @param bytes - Bytes to encode.\n * @returns Lowercase hex string.\n * @example\n * Serialize bytes as hex for logging or fixtures.\n *\n * ```ts\n * bytesToHex(Uint8Array.of(1, 2, 3));\n * ```\n */\nexport const bytesToHex: typeof bytesToHex_ = bytesToHex_;\n/**\n * Concatenates byte arrays.\n * @param arrays - Byte arrays to join.\n * @returns Concatenated bytes.\n * @example\n * Join domain-separated chunks into one buffer.\n *\n * ```ts\n * concatBytes(Uint8Array.of(1), Uint8Array.of(2));\n * ```\n */\nexport const concatBytes = (...arrays: TArg<Uint8Array[]>): TRet<Uint8Array> =>\n  concatBytes_(...arrays) as TRet<Uint8Array>;\n/**\n * Decodes lowercase or uppercase hex into bytes.\n * @param hex - Hex string to decode.\n * @returns Decoded bytes.\n * @example\n * Parse fixture hex into bytes before hashing.\n *\n * ```ts\n * hexToBytes('0102');\n * ```\n */\nexport const hexToBytes = (hex: string): TRet<Uint8Array> => hexToBytes_(hex) as TRet<Uint8Array>;\n/**\n * Checks whether a value is a Uint8Array.\n * @param a - Value to inspect.\n * @returns `true` when `a` is a Uint8Array.\n * @example\n * Branch on byte input before decoding it.\n *\n * ```ts\n * isBytes(new Uint8Array(1));\n * ```\n */\nexport const isBytes: typeof isBytes_ = isBytes_;\n/**\n * Reads random bytes from the platform CSPRNG.\n * @param bytesLength - Number of random bytes to read.\n * @returns Fresh random bytes.\n * @example\n * Generate a random seed for a keypair.\n *\n * ```ts\n * randomBytes(2);\n * ```\n */\nexport const randomBytes = (bytesLength?: number): TRet<Uint8Array> =>\n  randomBytes_(bytesLength) as TRet<Uint8Array>;\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\n\n/** Callable hash interface with metadata and optional extendable output support. */\nexport type CHash = {\n  /**\n   * Hash one message.\n   * @param message - Message bytes to hash.\n   * @returns Digest bytes.\n   */\n  (message: TArg<Uint8Array>): TRet<Uint8Array>;\n  /** Hash block length in bytes. */\n  blockLen: number;\n  /** Default output length in bytes. */\n  outputLen: number;\n  /** Whether `.create()` can be used as an XOF stream. */\n  canXOF: boolean;\n  /**\n   * Create one stateful hash or XOF instance, for example SHAKE with a custom output length.\n   * @param opts - Optional extendable-output configuration:\n   *   - `dkLen` (optional): Optional output length for XOF-style hashes.\n   * @returns Hash instance.\n   */\n  create(opts?: { dkLen?: number }): any;\n};\n/** Plain callable hash interface. */\nexport type FHash = (message: TArg<Uint8Array>) => TRet<Uint8Array>;\n/** HMAC callback signature. */\nexport type HmacFn = (key: TArg<Uint8Array>, message: TArg<Uint8Array>) => TRet<Uint8Array>;\n/**\n * Validates that a flag is boolean.\n * @param value - Value to validate.\n * @param title - Optional field name.\n * @returns Original value.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Reject non-boolean option flags early.\n *\n * ```ts\n * abool(true);\n * ```\n */\nexport function abool(value: boolean, title: string = ''): boolean {\n  if (typeof value !== 'boolean') {\n    const prefix = title && `\"${title}\" `;\n    throw new TypeError(prefix + 'expected boolean, got type=' + typeof value);\n  }\n  return value;\n}\n\n/**\n * Validates that a value is a non-negative bigint or safe integer.\n * @param n - Value to validate.\n * @returns The same validated value.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate one integer-like value before serializing it.\n *\n * ```ts\n * abignumber(1n);\n * ```\n */\nexport function abignumber<T extends number | bigint>(n: T): T {\n  if (typeof n === 'bigint') {\n    if (!isPosBig(n)) throw new RangeError('positive bigint expected, got ' + n);\n  } else anumber(n);\n  return n;\n}\n\n/**\n * Validates that a value is a safe integer.\n * @param value - Integer to validate.\n * @param title - Optional field name.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate a window size before scalar arithmetic uses it.\n *\n * ```ts\n * asafenumber(1);\n * ```\n */\nexport function asafenumber(value: number, title: string = ''): void {\n  if (typeof value !== 'number') {\n    const prefix = title && `\"${title}\" `;\n    throw new TypeError(prefix + 'expected number, got type=' + typeof value);\n  }\n  if (!Number.isSafeInteger(value)) {\n    const prefix = title && `\"${title}\" `;\n    throw new RangeError(prefix + 'expected safe integer, got ' + value);\n  }\n}\n\n/**\n * Encodes a bigint into even-length big-endian hex.\n * The historical \"unpadded\" name only means \"no fixed-width field padding\"; odd-length hex still\n * gets one leading zero nibble so the result always represents whole bytes.\n * @param num - Number to encode.\n * @returns Big-endian hex string.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Encode a scalar into hex without a `0x` prefix.\n *\n * ```ts\n * numberToHexUnpadded(255n);\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\n/**\n * Parses a big-endian hex string into bigint.\n * Accepts odd-length hex through the native `BigInt('0x' + hex)` parser and currently surfaces the\n * same native `SyntaxError` for malformed hex instead of wrapping it in a library-specific error.\n * @param hex - Hex string without `0x`.\n * @returns Parsed bigint value.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Parse a scalar from fixture hex.\n *\n * ```ts\n * hexToNumber('ff');\n * ```\n */\nexport function hexToNumber(hex: string): bigint {\n  if (typeof hex !== 'string') throw new TypeError('hex string expected, got ' + typeof hex);\n  return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n\n// BE: Big Endian, LE: Little Endian\n/**\n * Parses big-endian bytes into bigint.\n * @param bytes - Bytes in big-endian order.\n * @returns Parsed bigint value.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Read a scalar encoded in network byte order.\n *\n * ```ts\n * bytesToNumberBE(Uint8Array.of(1, 0));\n * ```\n */\nexport function bytesToNumberBE(bytes: TArg<Uint8Array>): bigint {\n  return hexToNumber(bytesToHex_(bytes));\n}\n/**\n * Parses little-endian bytes into bigint.\n * @param bytes - Bytes in little-endian order.\n * @returns Parsed bigint value.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Read a scalar encoded in little-endian form.\n *\n * ```ts\n * bytesToNumberLE(Uint8Array.of(1, 0));\n * ```\n */\nexport function bytesToNumberLE(bytes: TArg<Uint8Array>): bigint {\n  return hexToNumber(bytesToHex_(copyBytes(abytes_(bytes)).reverse()));\n}\n\n/**\n * Encodes a bigint into fixed-length big-endian bytes.\n * @param n - Number to encode.\n * @param len - Output length in bytes. Must be greater than zero.\n * @returns Big-endian byte array.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Serialize a scalar into a 32-byte field element.\n *\n * ```ts\n * numberToBytesBE(255n, 2);\n * ```\n */\nexport function numberToBytesBE(n: number | bigint, len: number): TRet<Uint8Array> {\n  anumber_(len);\n  if (len === 0) throw new RangeError('zero length');\n  n = abignumber(n);\n  const hex = n.toString(16);\n  // Detect overflow before hex parsing so oversized values don't leak the shared odd-hex error.\n  if (hex.length > len * 2) throw new RangeError('number too large');\n  return hexToBytes_(hex.padStart(len * 2, '0')) as TRet<Uint8Array>;\n}\n/**\n * Encodes a bigint into fixed-length little-endian bytes.\n * @param n - Number to encode.\n * @param len - Output length in bytes.\n * @returns Little-endian byte array.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Serialize a scalar for little-endian protocols.\n *\n * ```ts\n * numberToBytesLE(255n, 2);\n * ```\n */\nexport function numberToBytesLE(n: number | bigint, len: number): TRet<Uint8Array> {\n  return numberToBytesBE(n, len).reverse() as TRet<Uint8Array>;\n}\n// Unpadded, rarely used\n/**\n * Encodes a bigint into variable-length big-endian bytes.\n * @param n - Number to encode.\n * @returns Variable-length big-endian bytes.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Serialize a bigint without fixed-width padding.\n *\n * ```ts\n * numberToVarBytesBE(255n);\n * ```\n */\nexport function numberToVarBytesBE(n: number | bigint): TRet<Uint8Array> {\n  return hexToBytes_(numberToHexUnpadded(abignumber(n))) as TRet<Uint8Array>;\n}\n\n// Compares 2 u8a-s in kinda constant time\n/**\n * Compares two byte arrays in constant-ish time.\n * @param a - Left byte array.\n * @param b - Right byte array.\n * @returns `true` when bytes match.\n * @example\n * Compare two encoded points without early exit.\n *\n * ```ts\n * equalBytes(Uint8Array.of(1), Uint8Array.of(1));\n * ```\n */\nexport function equalBytes(a: TArg<Uint8Array>, b: TArg<Uint8Array>): boolean {\n  a = abytes(a);\n  b = abytes(b);\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 * @param bytes - Bytes to copy.\n * @returns Detached copy.\n * @example\n * Make an isolated copy before mutating serialized bytes.\n *\n * ```ts\n * copyBytes(Uint8Array.of(1, 2, 3));\n * ```\n */\nexport function copyBytes(bytes: TArg<Uint8Array>): TRet<Uint8Array> {\n  // `Uint8Array.from(...)` would also accept arrays / other typed arrays. Keep this helper strict\n  // because callers use it at byte-validation boundaries before mutating the detached copy.\n  return Uint8Array.from(abytes(bytes)) as TRet<Uint8Array>;\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 * @param ascii - ASCII input text.\n * @returns Encoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Encode an ASCII domain-separation tag.\n *\n * ```ts\n * asciiToBytes('ABC');\n * ```\n */\nexport function asciiToBytes(ascii: string): TRet<Uint8Array> {\n  if (typeof ascii !== 'string') throw new TypeError('ascii string expected, got ' + typeof ascii);\n  return Uint8Array.from(ascii, (c, i) => {\n    const charCode = c.charCodeAt(0);\n    if (c.length !== 1 || charCode > 127) {\n      throw new RangeError(\n        `string contains non-ASCII character \"${ascii[i]}\" with code ${charCode} at position ${i}`\n      );\n    }\n    return charCode;\n  }) as TRet<Uint8Array>;\n}\n\n// Historical name: this accepts non-negative bigints, including zero.\nconst isPosBig = (n: bigint) => typeof n === 'bigint' && _0n <= n;\n\n/**\n * Checks whether a bigint lies inside a half-open range.\n * @param n - Candidate value.\n * @param min - Inclusive lower bound.\n * @param max - Exclusive upper bound.\n * @returns `true` when the value is inside the range.\n * @example\n * Check whether a candidate scalar fits the field order.\n *\n * ```ts\n * inRange(2n, 1n, 3n);\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: upper bound is exclusive.\n * @param title - Value label for error messages.\n * @param n - Candidate value.\n * @param min - Inclusive lower bound.\n * @param max - Exclusive upper bound.\n * Wrong-type inputs are not separated from out-of-range values here: they still flow through the\n * shared `RangeError` path because this is only a throwing wrapper around `inRange(...)`.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Assert that a bigint stays within one half-open range.\n *\n * ```ts\n * aInRange('x', 2n, 1n, 256n);\n * ```\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 RangeError('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 * @param n - Value to inspect.\n * @returns Bit length.\n * @throws If the value is negative. {@link Error}\n * @example\n * Measure the bit length of a scalar before serialization.\n *\n * ```ts\n * bitLen(8n);\n * ```\n */\nexport function bitLen(n: bigint): number {\n  // Size callers in this repo only use non-negative orders / scalars, so negative inputs are a\n  // contract bug and must not silently collapse to zero bits.\n  if (n < _0n) throw new Error('expected non-negative bigint, got ' + n);\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 * @param n - Source value.\n * @param pos - Bit position. Negative positions are passed through to raw\n *   bigint shift semantics; because the mask is built as `1n << pos`,\n *   they currently collapse to `0n` and make the helper a no-op.\n * @returns Bit as bigint.\n * @example\n * Gets single bit at position.\n *\n * ```ts\n * bitGet(5n, 0);\n * ```\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 * @param n - Source value.\n * @param pos - Bit position. Negative positions are passed through to raw bigint shift semantics,\n *   so they currently behave like left shifts.\n * @param value - Whether the bit should be set.\n * @returns Updated bigint.\n * @example\n * Sets single bit at position.\n *\n * ```ts\n * bitSet(0n, 1, true);\n * ```\n */\nexport function bitSet(n: bigint, pos: number, value: boolean): bigint {\n  const mask = _1n << BigInt(pos);\n  // Clearing needs AND-not here; OR with zero leaves an already-set bit untouched.\n  return value ? n | mask : n & ~mask;\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 * @param n - Number of bits. Negative widths are currently passed through to raw bigint shift\n *   semantics and therefore produce `-1n`.\n * @returns Bitmask value.\n * @example\n * Calculate mask for N bits.\n *\n * ```ts\n * bitMask(4);\n * ```\n */\nexport const bitMask = (n: number): bigint => (_1n << BigInt(n)) - _1n;\n\n// DRBG\n\ntype Pred<T> = (v: TArg<Uint8Array>) => T | undefined;\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @param hashLen - Hash output size in bytes. Callers are expected to pass a positive length; `0`\n *   is not rejected here and would make the internal generate loop non-progressing.\n * @param qByteLen - Requested output size in bytes. Callers are expected to pass a positive length.\n * @param hmacFn - HMAC implementation.\n * @returns Function that will call DRBG until the predicate returns anything\n *   other than `undefined`.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Build a deterministic nonce generator for RFC6979-style signing.\n *\n * ```ts\n * import { createHmacDrbg } from '@noble/curves/utils.js';\n * import { hmac } from '@noble/hashes/hmac.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const drbg = createHmacDrbg(32, 32, (key, msg) => hmac(sha256, key, msg));\n * const seed = new Uint8Array(32);\n * drbg(seed, (bytes) => bytes);\n * ```\n */\nexport function createHmacDrbg<T>(\n  hashLen: number,\n  qByteLen: number,\n  hmacFn: TArg<HmacFn>\n): TRet<(seed: Uint8Array, predicate: Pred<T>) => T> {\n  anumber_(hashLen, 'hashLen');\n  anumber_(qByteLen, 'qByteLen');\n  if (typeof hmacFn !== 'function') throw new TypeError('hmacFn must be a function');\n  // creates Uint8Array\n  const u8n = (len: number): TRet<Uint8Array> => new Uint8Array(len) as TRet<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  // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 signatures.\n  let v: Uint8Array = u8n(hashLen);\n  // Steps B and C of RFC6979 3.2.\n  let k: Uint8Array = u8n(hashLen);\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  // hmac(k)(v, ...values)\n  const h = (...msgs: TArg<Uint8Array[]>) => (hmacFn as HmacFn)(k, concatBytes(v, ...msgs));\n  const reseed = (seed: TArg<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: TArg<Uint8Array>, pred: TArg<Pred<T>>): T => {\n    reset();\n    reseed(seed); // Steps D-G\n    let res: T | undefined = undefined; // Step H: grind until the predicate accepts a candidate.\n    // Falsy values like 0 are valid outputs.\n    while ((res = (pred as Pred<T>)(gen())) === undefined) reseed();\n    reset();\n    return res;\n  };\n  return genUntil as TRet<(seed: Uint8Array, predicate: Pred<T>) => T>;\n}\n\n/**\n * Validates declared required and optional field types on a plain object.\n * Extra keys are intentionally ignored because many callers validate only the subset they use from\n * richer option bags or runtime objects.\n * @param object - Object to validate.\n * @param fields - Required field types.\n * @param optFields - Optional field types.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Check user options before building a curve helper.\n *\n * ```ts\n * validateObject({ flag: true }, { flag: 'boolean' });\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.prototype.toString.call(object) !== '[object Object]')\n    throw new TypeError('expected valid options object');\n  type Item = keyof typeof object;\n  function checkField(fieldName: Item, expectedType: string, isOpt: boolean) {\n    // Config/data fields must be explicit own properties, but runtime objects such as Field\n    // instances intentionally satisfy required method slots via their shared prototype.\n    if (!isOpt && expectedType !== 'function' && !Object.hasOwn(object, fieldName))\n      throw new TypeError(`param \"${fieldName}\" is invalid: expected own property`);\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 TypeError(\n        `param \"${fieldName}\" is invalid: expected ${expectedType}, got ${current}`\n      );\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 * @returns Never returns.\n * @throws If the unfinished code path is reached. {@link Error}\n * @example\n * Surface the placeholder error from an unfinished code path.\n *\n * ```ts\n * try {\n *   notImplemented();\n * } catch {}\n * ```\n */\nexport const notImplemented = (): never => {\n  throw new Error('not implemented');\n};\n\n/** Generic keygen/getPublicKey interface shared by curve helpers. */\nexport interface CryptoKeys {\n  /** Public byte lengths for keys and optional seeds. */\n  lengths: { seed?: number; public?: number; secret?: 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/** 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  /** Public byte lengths for keys, signatures, and optional signing randomness. */\n  lengths: {\n    seed?: number;\n    public?: number;\n    secret?: number;\n    signRand?: number;\n    signature?: number;\n  };\n  /**\n   * Sign one message.\n   * @param msg - Message bytes to sign.\n   * @param secretKey - Secret key bytes.\n   * @returns Signature bytes.\n   */\n  sign: (msg: Uint8Array, secretKey: Uint8Array) => Uint8Array;\n  /**\n   * Verify one signature.\n   * @param sig - Signature bytes.\n   * @param msg - Signed message bytes.\n   * @param publicKey - Public key bytes.\n   * @returns `true` when the signature is valid.\n   */\n  verify: (sig: Uint8Array, msg: Uint8Array, publicKey: Uint8Array) => boolean;\n}\n","/**\n * Utils for modular division and fields.\n * Field over 11 is a finite (Galois) field is integer number operations `mod 11`.\n * There is no division: it is replaced by modular multiplicative inverse.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport {\n  abool,\n  abytes,\n  anumber,\n  asafenumber,\n  bitLen,\n  bytesToNumberBE,\n  bytesToNumberLE,\n  numberToBytesBE,\n  numberToBytesLE,\n  validateObject,\n  type TArg,\n  type TRet,\n} from '../utils.ts';\n\n// Numbers aren't used in x25519 / x448 builds\n// prettier-ignore\nconst _0n = /* @__PURE__ */ BigInt(0), _1n = /* @__PURE__ */ BigInt(1), _2n = /* @__PURE__ */ BigInt(2);\n// prettier-ignore\nconst _3n = /* @__PURE__ */ BigInt(3), _4n = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5);\n// prettier-ignore\nconst _7n = /* @__PURE__ */ BigInt(7), _8n = /* @__PURE__ */ BigInt(8), _9n = /* @__PURE__ */ BigInt(9);\nconst _16n = /* @__PURE__ */ BigInt(16);\n\n/**\n * @param a - Dividend value.\n * @param b - Positive modulus.\n * @returns Reduced value in `[0, b)` only when `b` is positive.\n * @throws If the modulus is not positive. {@link Error}\n * @example\n * Normalize a bigint into one field residue.\n *\n * ```ts\n * mod(-1n, 5n);\n * ```\n */\nexport function mod(a: bigint, b: bigint): bigint {\n  if (b <= _0n) throw new Error('mod: expected positive modulus, got ' + b);\n  const result = a % b;\n  return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to a power with modular reduction.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * Low-level helper: callers that need canonical residues must pass a valid `num` for the chosen\n * modulus instead of relying on the `power===0/1` fast paths to normalize it.\n * @param num - Base value.\n * @param power - Exponent value.\n * @param modulo - Reduction modulus.\n * @returns Modular exponentiation result.\n * @throws If the modulus or exponent is invalid. {@link Error}\n * @example\n * Raise one bigint to a modular power.\n *\n * ```ts\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n * ```\n */\nexport function pow(num: bigint, power: bigint, modulo: bigint): bigint {\n  return FpPow(Field(modulo), num, power);\n}\n\n/**\n * Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)`.\n * Low-level helper: callers that need canonical residues must pass a valid `x` for the chosen\n * modulus; the `power===0` fast path intentionally returns the input unchanged.\n * @param x - Base value.\n * @param power - Number of squarings.\n * @param modulo - Reduction modulus.\n * @returns Repeated-squaring result.\n * @throws If the exponent is negative. {@link Error}\n * @example\n * Apply repeated squaring inside one field.\n *\n * ```ts\n * pow2(3n, 2n, 11n);\n * ```\n */\nexport function pow2(x: bigint, power: bigint, modulo: bigint): bigint {\n  if (power < _0n) throw new Error('pow2: expected non-negative exponent, got ' + power);\n  let res = x;\n  while (power-- > _0n) {\n    res *= res;\n    res %= modulo;\n  }\n  return res;\n}\n\n/**\n * Inverses number over modulo.\n * Implemented using the {@link https://brilliant.org/wiki/extended-euclidean-algorithm/ | extended Euclidean algorithm}.\n * @param number - Value to invert.\n * @param modulo - Positive modulus.\n * @returns Multiplicative inverse.\n * @throws If the modulus is invalid or the inverse does not exist. {@link Error}\n * @example\n * Compute one modular inverse with the extended Euclidean algorithm.\n *\n * ```ts\n * invert(3n, 11n);\n * ```\n */\nexport function invert(number: bigint, modulo: bigint): bigint {\n  if (number === _0n) throw new Error('invert: expected non-zero number');\n  if (modulo <= _0n) throw new Error('invert: expected positive modulus, got ' + modulo);\n  // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n  let a = mod(number, modulo);\n  let b = modulo;\n  // prettier-ignore\n  let x = _0n, y = _1n, u = _1n, v = _0n;\n  while (a !== _0n) {\n    const q = b / a;\n    const r = b - a * q;\n    const m = x - u * q;\n    const n = y - v * q;\n    // prettier-ignore\n    b = a, a = r, x = u, y = v, u = m, v = n;\n  }\n  const gcd = b;\n  if (gcd !== _1n) throw new Error('invert: does not exist');\n  return mod(x, modulo);\n}\n\nfunction assertIsSquare<T>(Fp: TArg<IField<T>>, root: T, n: T): void {\n  const F = Fp as IField<T>;\n  if (!F.eql(F.sqr(root), n)) throw new Error('Cannot find square root');\n}\n\n// Not all roots are possible! Example which will throw:\n// const NUM =\n// n = 72057594037927816n;\n// Fp = Field(BigInt('0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab'));\nfunction sqrt3mod4<T>(Fp: TArg<IField<T>>, n: T) {\n  const F = Fp as IField<T>;\n  const p1div4 = (F.ORDER + _1n) / _4n;\n  const root = F.pow(n, p1div4);\n  assertIsSquare(F, root, n);\n  return root;\n}\n\n// Equivalent `q = 5 (mod 8)` square-root formula (Atkin-style), not the RFC Appendix I.2 CMOV\n// pseudocode verbatim.\nfunction sqrt5mod8<T>(Fp: TArg<IField<T>>, n: T) {\n  const F = Fp as IField<T>;\n  const p5div8 = (F.ORDER - _5n) / _8n;\n  const n2 = F.mul(n, _2n);\n  const v = F.pow(n2, p5div8);\n  const nv = F.mul(n, v);\n  const i = F.mul(F.mul(nv, _2n), v);\n  const root = F.mul(nv, F.sub(i, F.ONE));\n  assertIsSquare(F, root, n);\n  return root;\n}\n\n// Based on RFC9380, Kong algorithm\n// prettier-ignore\nfunction sqrt9mod16(P: bigint): TRet<<T>(Fp: IField<T>, n: T) => T> {\n  const Fp_ = Field(P);\n  const tn = tonelliShanks(P);\n  const c1 = tn(Fp_, Fp_.neg(Fp_.ONE));//  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n  const c2 = tn(Fp_, c1);              //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n  const c3 = tn(Fp_, Fp_.neg(c1));     //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n  const c4 = (P + _7n) / _16n;         //  4. c4 = (q + 7) / 16        # Integer arithmetic\n  return (<T>(Fp: TArg<IField<T>>, n: T): T => {\n    const F = Fp as IField<T>;\n    let tv1 = F.pow(n, c4);            //  1. tv1 = x^c4\n    let tv2 = F.mul(tv1, c1);          //  2. tv2 = c1 * tv1\n    const tv3 = F.mul(tv1, c2);        //  3. tv3 = c2 * tv1\n    const tv4 = F.mul(tv1, c3);        //  4. tv4 = c3 * tv1\n    const e1 = F.eql(F.sqr(tv2), n);   //  5.  e1 = (tv2^2) == x\n    const e2 = F.eql(F.sqr(tv3), n);   //  6.  e2 = (tv3^2) == x\n    tv1 = F.cmov(tv1, tv2, e1);        //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n    tv2 = F.cmov(tv4, tv3, e2);        //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n    const e3 = F.eql(F.sqr(tv2), n);   //  9.  e3 = (tv2^2) == x\n    const root = F.cmov(tv1, tv2, e3); // 10.  z = CMOV(tv1, tv2, e3)   # Select sqrt from tv1 & tv2\n    assertIsSquare(F, root, n);\n    return root;\n  }) as TRet<<T>(Fp: IField<T>, n: T) => T>;\n}\n\n/**\n * Tonelli-Shanks square root search algorithm.\n * This implementation is variable-time: it searches data-dependently for the first non-residue `Z`\n * and for the smallest `i` in the main loop, unlike RFC 9380 Appendix I.4's constant-time shape.\n * 1. {@link https://eprint.iacr.org/2012/685.pdf | eprint 2012/685}, page 12\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * @param P - field order\n * @returns function that takes field Fp (created from P) and number n\n * @throws If the field is too small, non-prime, or the square root does not exist. {@link Error}\n * @example\n * Construct a square-root helper for primes that need Tonelli-Shanks.\n *\n * ```ts\n * import { Field, tonelliShanks } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const sqrt = tonelliShanks(17n)(Fp, 4n);\n * ```\n */\nexport function tonelliShanks(P: bigint): TRet<<T>(Fp: IField<T>, n: T) => T> {\n  // Initialization (precomputation).\n  // Caching initialization could boost perf by 7%.\n  if (P < _3n) throw new Error('sqrt is not defined for small field');\n  // Factor P - 1 = Q * 2^S, where Q is odd\n  let Q = P - _1n;\n  let S = 0;\n  while (Q % _2n === _0n) {\n    Q /= _2n;\n    S++;\n  }\n\n  // Find the first quadratic non-residue Z >= 2\n  let Z = _2n;\n  const _Fp = Field(P);\n  while (FpLegendre(_Fp, Z) === 1) {\n    // Basic primality test for P. After x iterations, chance of\n    // not finding quadratic non-residue is 2^x, so 2^1000.\n    if (Z++ > 1000) throw new Error('Cannot find square root: probably non-prime P');\n  }\n  // Fast-path; usually done before Z, but we do \"primality test\".\n  if (S === 1) return sqrt3mod4 as TRet<<T>(Fp: IField<T>, n: T) => T>;\n\n  // Slow-path\n  // TODO: test on Fp2 and others\n  let cc = _Fp.pow(Z, Q); // c = z^Q\n  const Q1div2 = (Q + _1n) / _2n;\n  return function tonelliSlow<T>(Fp: TArg<IField<T>>, n: T): T {\n    const F = Fp as IField<T>;\n    if (F.is0(n)) return n;\n    // Check if n is a quadratic residue using Legendre symbol\n    if (FpLegendre(F, n) !== 1) throw new Error('Cannot find square root');\n\n    // Initialize variables for the main loop\n    let M = S;\n    let c = F.mul(F.ONE, cc); // c = z^Q, move cc from field _Fp into field Fp\n    let t = F.pow(n, Q); // t = n^Q, first guess at the fudge factor\n    let R = F.pow(n, Q1div2); // R = n^((Q+1)/2), first guess at the square root\n\n    // Main loop\n    // while t != 1\n    while (!F.eql(t, F.ONE)) {\n      if (F.is0(t)) return F.ZERO; // if t=0 return R=0\n      let i = 1;\n\n      // Find the smallest i >= 1 such that t^(2^i) ≡ 1 (mod P)\n      let t_tmp = F.sqr(t); // t^(2^1)\n      while (!F.eql(t_tmp, F.ONE)) {\n        i++;\n        t_tmp = F.sqr(t_tmp); // t^(2^2)...\n        if (i === M) throw new Error('Cannot find square root');\n      }\n\n      // Calculate the exponent for b: 2^(M - i - 1)\n      const exponent = _1n << BigInt(M - i - 1); // bigint is important\n      const b = F.pow(c, exponent); // b = 2^(M - i - 1)\n\n      // Update variables\n      M = i;\n      c = F.sqr(b); // c = b^2\n      t = F.mul(t, c); // t = (t * b^2)\n      R = F.mul(R, b); // R = R*b\n    }\n    return R;\n  } as TRet<<T>(Fp: IField<T>, n: T) => T>;\n}\n\n/**\n * Square root for a finite field. Will try optimized versions first:\n *\n * 1. P ≡ 3 (mod 4)\n * 2. P ≡ 5 (mod 8)\n * 3. P ≡ 9 (mod 16)\n * 4. Tonelli-Shanks algorithm\n *\n * Different algorithms can give different roots, it is up to user to decide which one they want.\n * For example there is FpSqrtOdd/FpSqrtEven to choose a root by oddness\n * (used for hash-to-curve).\n * @param P - Field order.\n * @returns Square-root helper. The generic fallback inherits Tonelli-Shanks' variable-time\n *   behavior and this selector assumes prime-field-style integer moduli.\n * @throws If the field is unsupported or the square root does not exist. {@link Error}\n * @example\n * Choose the square-root helper appropriate for one field modulus.\n *\n * ```ts\n * import { Field, FpSqrt } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const sqrt = FpSqrt(17n)(Fp, 4n);\n * ```\n */\nexport function FpSqrt(P: bigint): TRet<<T>(Fp: IField<T>, n: T) => T> {\n  // P ≡ 3 (mod 4) => √n = n^((P+1)/4)\n  if (P % _4n === _3n) return sqrt3mod4 as TRet<<T>(Fp: IField<T>, n: T) => T>;\n  // P ≡ 5 (mod 8) => Atkin algorithm, page 10 of https://eprint.iacr.org/2012/685.pdf\n  if (P % _8n === _5n) return sqrt5mod8 as TRet<<T>(Fp: IField<T>, n: T) => T>;\n  // P ≡ 9 (mod 16) => Kong algorithm, page 11 of https://eprint.iacr.org/2012/685.pdf (algorithm 4)\n  if (P % _16n === _9n) return sqrt9mod16(P);\n  // Tonelli-Shanks algorithm\n  return tonelliShanks(P);\n}\n\n/**\n * @param num - Value to inspect.\n * @param modulo - Field modulus.\n * @returns `true` when the least-significant little-endian bit is set.\n * @throws If the modulus is invalid for `mod(...)`. {@link Error}\n * @example\n * Inspect the low bit used by little-endian sign conventions.\n *\n * ```ts\n * isNegativeLE(3n, 11n);\n * ```\n */\nexport const isNegativeLE = (num: bigint, modulo: bigint): boolean =>\n  (mod(num, modulo) & _1n) === _1n;\n\n/** Generic field interface used by prime and extension fields alike.\n * Generic helpers treat field operations as pure functions: implementations MUST treat provided\n * values/byte buffers as read-only and return detached results instead of mutating arguments.\n */\nexport interface IField<T> {\n  /** Field order `q`, which may be prime or a prime power. */\n  ORDER: bigint;\n  /** Canonical encoded byte length. */\n  BYTES: number;\n  /** Canonical encoded bit length. */\n  BITS: number;\n  /** Whether encoded field elements use little-endian bytes. */\n  isLE: boolean;\n  /** Additive identity. */\n  ZERO: T;\n  /** Multiplicative identity. */\n  ONE: T;\n  // 1-arg\n  /**\n   * Normalize one value into the field.\n   * @param num - Input value.\n   * @returns Normalized field value.\n   */\n  create: (num: T) => T;\n  /**\n   * Check whether one value already belongs to the field.\n   * @param num - Input value.\n   * Implementations may throw `TypeError` on malformed input types instead of returning `false`.\n   * @returns Whether the value already belongs to the field.\n   */\n  isValid: (num: T) => boolean;\n  /**\n   * Check whether one value is zero.\n   * @param num - Input value.\n   * @returns Whether the value is zero.\n   */\n  is0: (num: T) => boolean;\n  /**\n   * Check whether one value is non-zero and belongs to the field.\n   * @param num - Input value.\n   * Implementations may throw `TypeError` on malformed input types instead of returning `false`.\n   * @returns Whether the value is non-zero and valid.\n   */\n  isValidNot0: (num: T) => boolean;\n  /**\n   * Negate one value.\n   * @param num - Input value.\n   * @returns Negated value.\n   */\n  neg(num: T): T;\n  /**\n   * Invert one value multiplicatively.\n   * @param num - Input value.\n   * @returns Multiplicative inverse.\n   */\n  inv(num: T): T;\n  /**\n   * Compute one square root when it exists.\n   * @param num - Input value.\n   * @returns Square root.\n   */\n  sqrt(num: T): T;\n  /**\n   * Square one value.\n   * @param num - Input value.\n   * @returns Squared value.\n   */\n  sqr(num: T): T;\n  // 2-args\n  /**\n   * Compare two field values.\n   * @param lhs - Left value.\n   * @param rhs - Right value.\n   * @returns Whether both values are equal.\n   */\n  eql(lhs: T, rhs: T): boolean;\n  /**\n   * Add two normalized field values.\n   * @param lhs - Left value.\n   * @param rhs - Right value.\n   * @returns Sum value.\n   */\n  add(lhs: T, rhs: T): T;\n  /**\n   * Subtract two normalized field values.\n   * @param lhs - Left value.\n   * @param rhs - Right value.\n   * @returns Difference value.\n   */\n  sub(lhs: T, rhs: T): T;\n  /**\n   * Multiply two field values.\n   * @param lhs - Left value.\n   * @param rhs - Right value or scalar.\n   * @returns Product value.\n   */\n  mul(lhs: T, rhs: T | bigint): T;\n  /**\n   * Raise one field value to a power.\n   * @param lhs - Base value.\n   * @param power - Exponent.\n   * @returns Power value.\n   */\n  pow(lhs: T, power: bigint): T;\n  /**\n   * Divide one field value by another.\n   * @param lhs - Dividend.\n   * @param rhs - Divisor or scalar.\n   * @returns Quotient value.\n   */\n  div(lhs: T, rhs: T | bigint): T;\n  // N for NonNormalized (for now)\n  /**\n   * Add two values without re-normalizing the result.\n   * @param lhs - Left value.\n   * @param rhs - Right value.\n   * @returns Non-normalized sum.\n   */\n  addN(lhs: T, rhs: T): T;\n  /**\n   * Subtract two values without re-normalizing the result.\n   * @param lhs - Left value.\n   * @param rhs - Right value.\n   * @returns Non-normalized difference.\n   */\n  subN(lhs: T, rhs: T): T;\n  /**\n   * Multiply two values without re-normalizing the result.\n   * @param lhs - Left value.\n   * @param rhs - Right value or scalar.\n   * @returns Non-normalized product.\n   */\n  mulN(lhs: T, rhs: T | bigint): T;\n  /**\n   * Square one value without re-normalizing the result.\n   * @param num - Input value.\n   * @returns Non-normalized square.\n   */\n  sqrN(num: T): T;\n\n  // Optional\n  // Should be same as sgn0 function in\n  // [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#section-4.1).\n  // NOTE: sgn0 is \"negative in LE\", which is the same as odd.\n  // Negative in LE is a somewhat strange definition anyway.\n  /**\n   * Return the RFC 9380 `sgn0`-style oddness bit when supported.\n   * This uses oddness instead of evenness so extension fields like Fp2 can expose the same hook.\n   * Returns whether the value is odd under the field encoding.\n   */\n  isOdd?(num: T): boolean;\n  // legendre?(num: T): T;\n  /**\n   * Invert many field elements in one batch.\n   * @param lst - Values to invert.\n   * @returns Batch of inverses.\n   */\n  invertBatch: (lst: T[]) => T[];\n  /**\n   * Encode one field value into fixed-width bytes.\n   * Callers that need canonical encodings MUST supply a valid field element.\n   * Low-level protocols may also use this to serialize raw / non-canonical residues.\n   * @param num - Input value.\n   * @returns Fixed-width byte encoding.\n   */\n  toBytes(num: T): Uint8Array;\n  /**\n   * Decode one field value from fixed-width bytes.\n   * @param bytes - Fixed-width byte encoding.\n   * @param skipValidation - Whether to skip range validation.\n   * Implementations MUST treat `bytes` as read-only.\n   * @returns Decoded field value.\n   */\n  fromBytes(bytes: Uint8Array, skipValidation?: boolean): T;\n  // If c is False, CMOV returns a, otherwise it returns b.\n  /**\n   * Constant-time conditional move.\n   * @param a - Value used when the condition is false.\n   * @param b - Value used when the condition is true.\n   * @param c - Selection bit.\n   * @returns Selected value.\n   */\n  cmov(a: T, b: T, c: boolean): T;\n}\n// prettier-ignore\n// Arithmetic-only subset checked by validateField(). This is intentionally not the full runtime\n// IField contract: helpers like `isValidNot0`, `invertBatch`, `toBytes`, `fromBytes`, `cmov`, and\n// field-specific extras like `isOdd` are left to the callers that actually need them.\nconst FIELD_FIELDS = [\n  'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n  'eql', 'add', 'sub', 'mul', 'pow', 'div',\n  'addN', 'subN', 'mulN', 'sqrN'\n] as const;\n/**\n * @param field - Field implementation.\n * @returns Validated field. This only checks the arithmetic subset needed by generic helpers; it\n *   does not guarantee full runtime-method coverage for serialization, batching, `cmov`, or\n *   field-specific extras beyond positive `BYTES` / `BITS`.\n * @throws If the field shape or numeric metadata are invalid. {@link Error}\n * @example\n * Check that a field implementation exposes the operations curve code expects.\n *\n * ```ts\n * import { Field, validateField } from '@noble/curves/abstract/modular.js';\n * const Fp = validateField(Field(17n));\n * ```\n */\nexport function validateField<T>(field: TArg<IField<T>>): TRet<IField<T>> {\n  const initial = {\n    ORDER: 'bigint',\n    BYTES: 'number',\n    BITS: 'number',\n  } as Record<string, string>;\n  const opts = FIELD_FIELDS.reduce((map, val: string) => {\n    map[val] = 'function';\n    return map;\n  }, initial);\n  validateObject(field, opts);\n  // Runtime field implementations must expose real integer byte/bit sizes; fractional / NaN /\n  // infinite metadata leaks through validateObject(type='number') but breaks encoders and caches.\n  asafenumber(field.BYTES, 'BYTES');\n  asafenumber(field.BITS, 'BITS');\n  // Runtime field implementations must expose positive byte/bit sizes; zero leaks through the\n  // numeric shape checks above but still breaks encoding helpers and cached-length assumptions.\n  if (field.BYTES < 1 || field.BITS < 1) throw new Error('invalid field: expected BYTES/BITS > 0');\n  if (field.ORDER <= _1n) throw new Error('invalid field: expected ORDER > 1, got ' + field.ORDER);\n  return field as TRet<IField<T>>;\n}\n\n// Generic field functions\n\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @param Fp - Field implementation.\n * @param num - Base value.\n * @param power - Exponent value.\n * @returns Powered field element.\n * @throws If the exponent is negative. {@link Error}\n * @example\n * Raise one field element to a public exponent.\n *\n * ```ts\n * import { Field, FpPow } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const x = FpPow(Fp, 3n, 5n);\n * ```\n */\nexport function FpPow<T>(Fp: TArg<IField<T>>, num: T, power: bigint): T {\n  const F = Fp as IField<T>;\n  if (power < _0n) throw new Error('invalid exponent, negatives unsupported');\n  if (power === _0n) return F.ONE;\n  if (power === _1n) return num;\n  let p = F.ONE;\n  let d = num;\n  while (power > _0n) {\n    if (power & _1n) p = F.mul(p, d);\n    d = F.sqr(d);\n    power >>= _1n;\n  }\n  return p;\n}\n\n/**\n * Efficiently invert an array of Field elements.\n * Exception-free. Zero-valued field elements stay `undefined` unless `passZero` is enabled.\n * @param Fp - Field implementation.\n * @param nums - Values to invert.\n * @param passZero - map 0 to 0 (instead of undefined)\n * @returns Inverted values.\n * @example\n * Invert several field elements with one shared inversion.\n *\n * ```ts\n * import { Field, FpInvertBatch } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const inv = FpInvertBatch(Fp, [1n, 2n, 4n]);\n * ```\n */\nexport function FpInvertBatch<T>(Fp: TArg<IField<T>>, nums: T[], passZero = false): T[] {\n  const F = Fp as IField<T>;\n  const inverted = new Array(nums.length).fill(passZero ? F.ZERO : undefined) as T[];\n  // Walk from first to last, multiply them by each other MOD p\n  const multipliedAcc = nums.reduce((acc, num, i) => {\n    if (F.is0(num)) return acc;\n    inverted[i] = acc;\n    return F.mul(acc, num);\n  }, F.ONE);\n  // Invert last element\n  const invertedAcc = F.inv(multipliedAcc);\n  // Walk from last to first, multiply them by inverted each other MOD p\n  nums.reduceRight((acc, num, i) => {\n    if (F.is0(num)) return acc;\n    inverted[i] = F.mul(acc, inverted[i]);\n    return F.mul(acc, num);\n  }, invertedAcc);\n  return inverted;\n}\n\n/**\n * @param Fp - Field implementation.\n * @param lhs - Dividend value.\n * @param rhs - Divisor value.\n * @returns Division result.\n * @throws If the divisor is non-invertible. {@link Error}\n * @example\n * Divide one field element by another.\n *\n * ```ts\n * import { Field, FpDiv } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const x = FpDiv(Fp, 6n, 3n);\n * ```\n */\nexport function FpDiv<T>(Fp: TArg<IField<T>>, lhs: T, rhs: T | bigint): T {\n  const F = Fp as IField<T>;\n  return F.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, F.ORDER) : F.inv(rhs));\n}\n\n/**\n * Legendre symbol.\n * Legendre constant is used to calculate Legendre symbol (a | p)\n * which denotes the value of a^((p-1)/2) (mod p).\n *\n * * (a | p) ≡ 1    if a is a square (mod p), quadratic residue\n * * (a | p) ≡ -1   if a is not a square (mod p), quadratic non residue\n * * (a | p) ≡ 0    if a ≡ 0 (mod p)\n * @param Fp - Field implementation.\n * @param n - Value to inspect.\n * @returns Legendre symbol.\n * @throws If the field returns an invalid Legendre symbol value. {@link Error}\n * @example\n * Compute the Legendre symbol of one field element.\n *\n * ```ts\n * import { Field, FpLegendre } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const symbol = FpLegendre(Fp, 4n);\n * ```\n */\nexport function FpLegendre<T>(Fp: TArg<IField<T>>, n: T): -1 | 0 | 1 {\n  const F = Fp as IField<T>;\n  // We can use 3rd argument as optional cache of this value\n  // but seems unneeded for now. The operation is very fast.\n  const p1mod2 = (F.ORDER - _1n) / _2n;\n  const powered = F.pow(n, p1mod2);\n  const yes = F.eql(powered, F.ONE);\n  const zero = F.eql(powered, F.ZERO);\n  const no = F.eql(powered, F.neg(F.ONE));\n  if (!yes && !zero && !no) throw new Error('invalid Legendre symbol result');\n  return yes ? 1 : zero ? 0 : -1;\n}\n\n/**\n * @param Fp - Field implementation.\n * @param n - Value to inspect.\n * @returns `true` when `Fp.sqrt(n)` exists. This includes `0`, even though strict \"quadratic\n *   residue\" terminology often reserves that name for the non-zero square class.\n * @throws If the field returns an invalid Legendre symbol value. {@link Error}\n * @example\n * Check whether one field element has a square root in the field.\n *\n * ```ts\n * import { Field, FpIsSquare } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const isSquare = FpIsSquare(Fp, 4n);\n * ```\n */\nexport function FpIsSquare<T>(Fp: TArg<IField<T>>, n: T): boolean {\n  const l = FpLegendre(Fp as IField<T>, n);\n  // Zero is a square too: 0 = 0^2, and Fp.sqrt(0) already returns 0.\n  return l !== -1;\n}\n\n/** Byte and bit lengths derived from one scalar order. */\nexport type NLength = {\n  /** Canonical byte length. */\n  nByteLength: number;\n  /** Canonical bit length. */\n  nBitLength: number;\n};\n/**\n * @param n - Curve order. Callers are expected to pass a positive order.\n * @param nBitLength - Optional cached bit length. Callers are expected to pass a positive cached\n *   value when overriding the derived bit length.\n * @returns Byte and bit lengths.\n * @throws If the order or cached bit length is invalid. {@link Error}\n * @example\n * Measure the encoding sizes needed for one modulus.\n *\n * ```ts\n * nLength(255n);\n * ```\n */\nexport function nLength(n: bigint, nBitLength?: number): NLength {\n  // Bit size, byte size of CURVE.n\n  if (nBitLength !== undefined) anumber(nBitLength);\n  if (n <= _0n) throw new Error('invalid n length: expected positive n, got ' + n);\n  if (nBitLength !== undefined && nBitLength < 1)\n    throw new Error('invalid n length: expected positive bit length, got ' + nBitLength);\n  const bits = bitLen(n);\n  // Cached bit lengths smaller than ORDER would truncate serialized scalars/elements and poison\n  // any math that relies on the derived field metadata.\n  if (nBitLength !== undefined && nBitLength < bits)\n    throw new Error(`invalid n length: expected bit length (${bits}) >= n.length (${nBitLength})`);\n  const _nBitLength = nBitLength !== undefined ? nBitLength : bits;\n  const nByteLength = Math.ceil(_nBitLength / 8);\n  return { nBitLength: _nBitLength, nByteLength };\n}\n\ntype FpField = IField<bigint> & Required<Pick<IField<bigint>, 'isOdd'>>;\ntype SqrtFn = (n: bigint) => bigint;\ntype FieldOpts = Partial<{\n  isLE: boolean;\n  BITS: number;\n  sqrt: SqrtFn;\n  allowedLengths?: readonly number[]; // for P521 (adds padding for smaller sizes); must stay > 0\n  modFromBytes: boolean; // bls12-381 requires mod(n) instead of rejecting keys >= n\n}>;\n// Keep the lazy sqrt cache off-instance so Field(...) can return a frozen object. Otherwise the\n// cached helper write would keep the field surface externally mutable.\nconst FIELD_SQRT = new WeakMap<object, ReturnType<typeof FpSqrt>>();\nclass _Field implements IField<bigint> {\n  readonly ORDER: bigint;\n  readonly BITS: number;\n  readonly BYTES: number;\n  readonly isLE: boolean;\n  readonly ZERO = _0n;\n  readonly ONE = _1n;\n  readonly _lengths?: readonly number[];\n  private readonly _mod?: boolean;\n  constructor(ORDER: bigint, opts: FieldOpts = {}) {\n    // ORDER <= 1 is degenerate: ONE would not be a valid field element and helpers like pow/inv\n    // would stop modeling field arithmetic.\n    if (ORDER <= _1n) throw new Error('invalid field: expected ORDER > 1, got ' + ORDER);\n    let _nbitLength: number | undefined = undefined;\n    this.isLE = false;\n    if (opts != null && typeof opts === 'object') {\n      // Cached bit lengths are trusted here and should already be positive / consistent with ORDER.\n      if (typeof opts.BITS === 'number') _nbitLength = opts.BITS;\n      if (typeof opts.sqrt === 'function')\n        // `_Field.prototype` is frozen below, so custom sqrt hooks must become own properties\n        // explicitly instead of relying on writable prototype shadowing via assignment.\n        Object.defineProperty(this, 'sqrt', { value: opts.sqrt, enumerable: true });\n      if (typeof opts.isLE === 'boolean') this.isLE = opts.isLE;\n      if (opts.allowedLengths) this._lengths = Object.freeze(opts.allowedLengths.slice());\n      if (typeof opts.modFromBytes === 'boolean') this._mod = opts.modFromBytes;\n    }\n    const { nBitLength, nByteLength } = nLength(ORDER, _nbitLength);\n    if (nByteLength > 2048) throw new Error('invalid field: expected ORDER of <= 2048 bytes');\n    this.ORDER = ORDER;\n    this.BITS = nBitLength;\n    this.BYTES = nByteLength;\n    Object.freeze(this);\n  }\n\n  create(num: bigint) {\n    return mod(num, this.ORDER);\n  }\n  isValid(num: bigint) {\n    if (typeof num !== 'bigint')\n      throw new TypeError('invalid field element: expected bigint, got ' + typeof num);\n    return _0n <= num && num < this.ORDER; // 0 is valid element, but it's not invertible\n  }\n  is0(num: bigint) {\n    return num === _0n;\n  }\n  // is valid and invertible\n  isValidNot0(num: bigint) {\n    return !this.is0(num) && this.isValid(num);\n  }\n  isOdd(num: bigint) {\n    return (num & _1n) === _1n;\n  }\n  neg(num: bigint) {\n    return mod(-num, this.ORDER);\n  }\n  eql(lhs: bigint, rhs: bigint) {\n    return lhs === rhs;\n  }\n\n  sqr(num: bigint) {\n    return mod(num * num, this.ORDER);\n  }\n  add(lhs: bigint, rhs: bigint) {\n    return mod(lhs + rhs, this.ORDER);\n  }\n  sub(lhs: bigint, rhs: bigint) {\n    return mod(lhs - rhs, this.ORDER);\n  }\n  mul(lhs: bigint, rhs: bigint) {\n    return mod(lhs * rhs, this.ORDER);\n  }\n  pow(num: bigint, power: bigint): bigint {\n    return FpPow(this, num, power);\n  }\n  div(lhs: bigint, rhs: bigint) {\n    return mod(lhs * invert(rhs, this.ORDER), this.ORDER);\n  }\n\n  // Same as above, but doesn't normalize\n  sqrN(num: bigint) {\n    return num * num;\n  }\n  addN(lhs: bigint, rhs: bigint) {\n    return lhs + rhs;\n  }\n  subN(lhs: bigint, rhs: bigint) {\n    return lhs - rhs;\n  }\n  mulN(lhs: bigint, rhs: bigint) {\n    return lhs * rhs;\n  }\n\n  inv(num: bigint) {\n    return invert(num, this.ORDER);\n  }\n  sqrt(num: bigint): bigint {\n    // Caching sqrt helpers speeds up sqrt9mod16 by 5x and Tonelli-Shanks by about 10% without keeping\n    // the field instance itself mutable.\n    let sqrt = FIELD_SQRT.get(this);\n    if (!sqrt) FIELD_SQRT.set(this, (sqrt = FpSqrt(this.ORDER)));\n    return sqrt(this, num);\n  }\n  toBytes(num: bigint) {\n    // Serialize fixed-width limbs without re-validating the field range. Callers that need a\n    // canonical encoding must pass a valid element; some protocols intentionally serialize raw\n    // residues here and reduce or validate them elsewhere.\n    return this.isLE ? numberToBytesLE(num, this.BYTES) : numberToBytesBE(num, this.BYTES);\n  }\n  fromBytes(bytes: Uint8Array, skipValidation = false) {\n    abytes(bytes);\n    const { _lengths: allowedLengths, BYTES, isLE, ORDER, _mod: modFromBytes } = this;\n    if (allowedLengths) {\n      // `allowedLengths` must list real positive byte lengths; otherwise empty input would get\n      // padded into zero and silently decode as a field element.\n      if (bytes.length < 1 || !allowedLengths.includes(bytes.length) || bytes.length > BYTES) {\n        throw new Error(\n          'Field.fromBytes: expected ' + allowedLengths + ' bytes, got ' + bytes.length\n        );\n      }\n      const padded = new Uint8Array(BYTES);\n      // isLE add 0 to right, !isLE to the left.\n      padded.set(bytes, isLE ? 0 : padded.length - bytes.length);\n      bytes = padded;\n    }\n    if (bytes.length !== BYTES)\n      throw new Error('Field.fromBytes: expected ' + BYTES + ' bytes, got ' + bytes.length);\n    let scalar = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n    if (modFromBytes) scalar = mod(scalar, ORDER);\n    if (!skipValidation)\n      if (!this.isValid(scalar))\n        throw new Error('invalid field element: outside of range 0..ORDER');\n    // Range validation is optional here because some protocols intentionally decode raw residues\n    // and reduce or validate them elsewhere.\n    return scalar;\n  }\n  // TODO: we don't need it here, move out to separate fn\n  invertBatch(lst: bigint[]): bigint[] {\n    return FpInvertBatch(this, lst);\n  }\n  // We can't move this out because Fp6, Fp12 implement it\n  // and it's unclear what to return in there.\n  cmov(a: bigint, b: bigint, condition: boolean) {\n    // Field elements have `isValid(...)`; the CMOV branch bit is a direct runtime input, so reject\n    // non-boolean selectors here instead of letting JS truthiness silently change arithmetic.\n    abool(condition, 'condition');\n    return condition ? b : a;\n  }\n}\n// Freeze the shared method surface too; otherwise callers can still poison every Field instance by\n// monkey-patching `_Field.prototype` even if each instance is frozen.\nObject.freeze(_Field.prototype);\n\n/**\n * Creates a finite field. Major performance optimizations:\n * * 1. Denormalized operations like mulN instead of mul.\n * * 2. Identical object shape: never add or remove keys.\n * * 3. Frozen stable object shape; the lazy sqrt cache lives in a module-level `WeakMap`.\n * Fragile: always run a benchmark on a change.\n * Security note: operations and low-level serializers like `toBytes` don't check `isValid` for\n * all elements for performance and protocol-flexibility reasons; callers are responsible for\n * supplying valid elements when they need canonical field behavior.\n * This is low-level code, please make sure you know what you're doing.\n *\n * Note about field properties:\n * * CHARACTERISTIC p = prime number, number of elements in main subgroup.\n * * ORDER q = similar to cofactor in curves, may be composite `q = p^m`.\n *\n * @param ORDER - field order, probably prime, or could be composite\n * @param opts - Field options such as bit length or endianness. See {@link FieldOpts}.\n * @returns Frozen field instance with a stable object shape. This wrapper forwards `opts` straight\n *   into `_Field`, so it inherits `_Field`'s assumptions about cached sizes and `allowedLengths`.\n * @example\n * Construct one prime field with optional overrides.\n *\n * ```ts\n * Field(11n);\n * ```\n */\nexport function Field(ORDER: bigint, opts: FieldOpts = {}): TRet<Readonly<FpField>> {\n  return new _Field(ORDER, opts);\n}\n\n// Generic random scalar, we can do same for other fields if via Fp2.mul(Fp2.ONE, Fp2.random)?\n// This allows unsafe methods like ignore bias or zero. These unsafe, but often used in different protocols (if deterministic RNG).\n// which mean we cannot force this via opts.\n// Not sure what to do with randomBytes, we can accept it inside opts if wanted.\n// Probably need to export getMinHashLength somewhere?\n// random(bytes?: Uint8Array, unsafeAllowZero = false, unsafeAllowBias = false) {\n//   const LEN = !unsafeAllowBias ? getMinHashLength(ORDER) : BYTES;\n//   if (bytes === undefined) bytes = randomBytes(LEN); // _opts.randomBytes?\n//   const num = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n//   // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n//   const reduced = unsafeAllowZero ? mod(num, ORDER) : mod(num, ORDER - _1n) + _1n;\n//   return reduced;\n// },\n\n/**\n * @param Fp - Field implementation.\n * @param elm - Value to square-root.\n * @returns Odd square root when two roots exist. The special case `elm = 0` still returns `0`,\n *   which is the only square root but is not odd.\n * @throws If the field lacks oddness checks or the square root does not exist. {@link Error}\n * @example\n * Select the odd square root when two roots exist.\n *\n * ```ts\n * import { Field, FpSqrtOdd } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const root = FpSqrtOdd(Fp, 4n);\n * ```\n */\nexport function FpSqrtOdd<T>(Fp: TArg<IField<T>>, elm: T): T {\n  const F = Fp as IField<T>;\n  if (!F.isOdd) throw new Error(\"Field doesn't have isOdd\");\n  const root = F.sqrt(elm);\n  return F.isOdd(root) ? root : F.neg(root);\n}\n\n/**\n * @param Fp - Field implementation.\n * @param elm - Value to square-root.\n * @returns Even square root.\n * @throws If the field lacks oddness checks or the square root does not exist. {@link Error}\n * @example\n * Select the even square root when two roots exist.\n *\n * ```ts\n * import { Field, FpSqrtEven } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const root = FpSqrtEven(Fp, 4n);\n * ```\n */\nexport function FpSqrtEven<T>(Fp: TArg<IField<T>>, elm: T): T {\n  const F = Fp as IField<T>;\n  if (!F.isOdd) throw new Error(\"Field doesn't have isOdd\");\n  const root = F.sqrt(elm);\n  return F.isOdd(root) ? F.neg(root) : root;\n}\n\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder - number of field elements, usually CURVE.n. Callers are expected to pass an\n *   order greater than 1.\n * @returns byte length of field\n * @throws If the field order is not a bigint. {@link Error}\n * @example\n * Read the fixed-width byte length of one field.\n *\n * ```ts\n * getFieldBytesLength(255n);\n * ```\n */\nexport function getFieldBytesLength(fieldOrder: bigint): number {\n  if (typeof fieldOrder !== 'bigint') throw new Error('field order must be bigint');\n  // Valid field elements are in 0..ORDER-1, so ORDER <= 1 would make the encoded range degenerate.\n  if (fieldOrder <= _1n) throw new Error('field order must be greater than 1');\n  // Valid field elements are < ORDER, so the maximal encoded element is ORDER - 1.\n  const bitLength = bitLen(fieldOrder - _1n);\n  return Math.ceil(bitLength / 8);\n}\n\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * This is the reduction / modulo-bias lower bound; higher-level helpers may still impose a larger\n * absolute floor for policy reasons.\n * @param fieldOrder - number of field elements greater than 1, usually CURVE.n.\n * @returns byte length of target hash\n * @throws If the field order is invalid. {@link Error}\n * @example\n * Compute the minimum hash length needed for field reduction.\n *\n * ```ts\n * getMinHashLength(255n);\n * ```\n */\nexport function getMinHashLength(fieldOrder: bigint): number {\n  const length = getFieldBytesLength(fieldOrder);\n  return length + Math.ceil(length / 2);\n}\n\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key. The implementation also keeps a hard\n * 16-byte minimum even when `getMinHashLength(...)` is smaller, so toy-small inputs do not look\n * accidentally acceptable for real scalar derivation.\n * See {@link https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/ | Kudelski's modulo-bias guide},\n * {@link https://csrc.nist.gov/publications/detail/fips/186/5/final | FIPS 186-5 appendix A.2}, and\n * {@link https://www.rfc-editor.org/rfc/rfc9380#section-5 | RFC 9380 section 5}. Unlike RFC 9380\n * `hash_to_field`, this helper intentionally maps into the non-zero private-scalar range `1..n-1`.\n * @param key - Uniform input bytes.\n * @param fieldOrder - Size of subgroup.\n * @param isLE - interpret hash bytes as LE num\n * @returns valid private scalar\n * @throws If the hash length or field order is invalid for scalar reduction. {@link Error}\n * @example\n * Map hash output into a private scalar range.\n *\n * ```ts\n * mapHashToField(new Uint8Array(48).fill(1), 255n);\n * ```\n */\nexport function mapHashToField(\n  key: TArg<Uint8Array>,\n  fieldOrder: bigint,\n  isLE = false\n): TRet<Uint8Array> {\n  abytes(key);\n  const len = key.length;\n  const fieldLen = getFieldBytesLength(fieldOrder);\n  const minLen = Math.max(getMinHashLength(fieldOrder), 16);\n  // No toy-small inputs: the helper is for real scalar derivation, not tiny test curves. No huge\n  // inputs: easier to reason about JS timing / allocation behavior.\n  if (len < minLen || len > 1024)\n    throw new Error('expected ' + minLen + '-1024 bytes of input, got ' + len);\n  const num = isLE ? bytesToNumberLE(key) : bytesToNumberBE(key);\n  // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n  const reduced = mod(num, fieldOrder - _1n) + _1n;\n  return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n","/**\n * Methods for elliptic curve multiplication by scalars.\n * Contains wNAF, pippenger.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { bitLen, bitMask, validateObject, type Signer, type TArg, type TRet } from '../utils.ts';\nimport { Field, FpInvertBatch, validateField, type IField } from './modular.ts';\n\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\n\n/** Affine point coordinates without projective fields. */\nexport type AffinePoint<T> = {\n  /** Affine x coordinate. */\n  x: T;\n  /** Affine y coordinate. */\n  y: T;\n} & { Z?: never };\n\n// We can't \"abstract out\" coordinates (X, Y, Z; and T in Edwards): argument names of constructor\n// are not accessible. See Typescript gh-56093, gh-41594.\n//\n// We have to use recursive types, so it will return actual point, not constained `CurvePoint`.\n// If, at any point, P is `any`, it will erase all types and replace it\n// with `any`, because of recursion, `any implements CurvePoint`,\n// but we lose all constrains on methods.\n\n/** Base interface for all elliptic-curve point instances. */\nexport interface CurvePoint<F, P extends CurvePoint<F, P>> {\n  /** Affine x coordinate. Different from projective / extended X coordinate. */\n  x: F;\n  /** Affine y coordinate. Different from projective / extended Y coordinate. */\n  y: F;\n  /** Projective Z coordinate when the point keeps projective state. */\n  Z?: F;\n  /**\n   * Double the point.\n   * @returns Doubled point.\n   */\n  double(): P;\n  /**\n   * Negate the point.\n   * @returns Negated point.\n   */\n  negate(): P;\n  /**\n   * Add another point from the same curve.\n   * @param other - Point to add.\n   * @returns Sum point.\n   */\n  add(other: P): P;\n  /**\n   * Subtract another point from the same curve.\n   * @param other - Point to subtract.\n   * @returns Difference point.\n   */\n  subtract(other: P): P;\n  /**\n   * Compare two points for equality.\n   * @param other - Point to compare.\n   * @returns Whether the points are equal.\n   */\n  equals(other: P): boolean;\n  /**\n   * Multiply the point by a scalar in constant time.\n   * Implementations keep the subgroup-scalar contract strict and may reject\n   * `0` instead of returning the identity point.\n   * @param scalar - Scalar multiplier.\n   * @returns Product point.\n   */\n  multiply(scalar: bigint): P;\n  /** Assert that the point satisfies the curve equation and subgroup checks. */\n  assertValidity(): void;\n  /**\n   * Map the point into the prime-order subgroup when the curve requires it.\n   * @returns Prime-order point.\n   */\n  clearCofactor(): P;\n  /**\n   * Check whether the point is the point at infinity.\n   * @returns Whether the point is zero.\n   */\n  is0(): boolean;\n  /**\n   * Check whether the point belongs to the prime-order subgroup.\n   * @returns Whether the point is torsion-free.\n   */\n  isTorsionFree(): boolean;\n  /**\n   * Check whether the point lies in a small torsion subgroup.\n   * @returns Whether the point has small order.\n   */\n  isSmallOrder(): boolean;\n  /**\n   * Multiply the point by a scalar without constant-time guarantees.\n   * Public-scalar callers that need `0` should use this method instead of\n   * relying on `multiply(...)` to return the identity point.\n   * @param scalar - Scalar multiplier.\n   * @returns Product point.\n   */\n  multiplyUnsafe(scalar: bigint): P;\n  /**\n   * Massively speeds up `p.multiply(n)` by using precompute tables (caching). See {@link wNAF}.\n   * Cache state lives in internal WeakMaps keyed by point identity, not on the point object.\n   * Repeating `precompute(...)` for the same point identity replaces the remembered window size\n   * and forces table regeneration for that point.\n   * @param windowSize - Precompute window size.\n   * @param isLazy - calculate cache now. Default (true) ensures it's deferred to first `multiply()`\n   * @returns Same point instance with precompute tables attached.\n   */\n  precompute(windowSize?: number, isLazy?: boolean): P;\n  /**\n   * Converts point to 2D xy affine coordinates.\n   * @param invertedZ - Optional inverted Z coordinate for batch normalization.\n   * @returns Affine x/y coordinates.\n   */\n  toAffine(invertedZ?: F): AffinePoint<F>;\n  /**\n   * Encode the point into the curve's canonical byte form.\n   * @returns Encoded point bytes.\n   */\n  toBytes(): Uint8Array;\n  /**\n   * Encode the point into the curve's canonical hex form.\n   * @returns Encoded point hex.\n   */\n  toHex(): string;\n}\n\n/** Base interface for elliptic-curve point constructors. */\nexport interface CurvePointCons<P extends CurvePoint<any, P>> {\n  /**\n   * Runtime brand check for points created by this constructor.\n   * @param item - Value to test.\n   * @returns Whether the value is a point from this constructor.\n   */\n  [Symbol.hasInstance]: (item: unknown) => boolean;\n  /** Canonical subgroup generator. */\n  BASE: P;\n  /** Point at infinity. */\n  ZERO: P;\n  /** Field for basic curve math */\n  Fp: IField<P_F<P>>;\n  /** Scalar field, for scalars in multiply and others */\n  Fn: IField<bigint>;\n  /**\n   * Create one point from affine coordinates.\n   * Does NOT validate curve, subgroup, or wrapper invariants.\n   * Use `.assertValidity()` on adversarial inputs.\n   * @param p - Affine point coordinates.\n   * @returns Point instance.\n   */\n  fromAffine(p: AffinePoint<P_F<P>>): P;\n  /**\n   * Decode a point from the canonical byte encoding.\n   * @param bytes - Encoded point bytes.\n   * Implementations MUST treat `bytes` as read-only.\n   * @returns Point instance.\n   */\n  fromBytes(bytes: Uint8Array): P;\n  /**\n   * Decode a point from the canonical hex encoding.\n   * @param hex - Encoded point hex.\n   * @returns Point instance.\n   */\n  fromHex(hex: string): P;\n}\n\n// Type inference helpers: PC - PointConstructor, P - Point, Fp - Field element\n// Short names, because we use them a lot in result types:\n// * we can't do 'P = GetCurvePoint<PC>': this is default value and doesn't constrain anything\n// * we can't do 'type X = GetCurvePoint<PC>': it won't be accesible for arguments/return types\n// * `CurvePointCons<P extends CurvePoint<any, P>>` constraints from interface definition\n//   won't propagate, if `PC extends CurvePointCons<any>`: the P would be 'any', which is incorrect\n// * PC could be super specific with super specific P, which implements CurvePoint<any, P>.\n//   this means we need to do stuff like\n//   `function test<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(`\n//   if we want type safety around P, otherwise PC_P<PC> will be any\n\n/** Returns the affine field type for a point instance (`P_F<P> == P.F`). */\nexport type P_F<P extends CurvePoint<any, P>> = P extends CurvePoint<infer F, P> ? F : never;\n/** Returns the affine field type for a point constructor (`PC_F<PC> == PC.P.F`). */\nexport type PC_F<PC extends CurvePointCons<CurvePoint<any, any>>> = PC['Fp']['ZERO'];\n/** Returns the point instance type for a point constructor (`PC_P<PC> == PC.P`). */\nexport type PC_P<PC extends CurvePointCons<CurvePoint<any, any>>> = PC['ZERO'];\n\n// Ugly hack to get proper type inference, because in typescript fails to infer resursively.\n// The hack allows to do up to 10 chained operations without applying type erasure.\n//\n// Types which won't work:\n// * `CurvePointCons<CurvePoint<any, any>>`, will return `any` after 1 operation\n// * `CurvePointCons<any>: WeierstrassPointCons<bigint> extends CurvePointCons<any> = false`\n// * `P extends CurvePoint, PC extends CurvePointCons<P>`\n//     * It can't infer P from PC alone\n//     * Too many relations between F, P & PC\n//     * It will infer P/F if `arg: CurvePointCons<F, P>`, but will fail if PC is generic\n//     * It will work correctly if there is an additional argument of type P\n//     * But generally, we don't want to parametrize `CurvePointCons` over `F`: it will complicate\n//       types, making them un-inferable\n// prettier-ignore\n/** Wide point-constructor type used when the concrete curve is not important. */\nexport type PC_ANY = CurvePointCons<\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any, any>\n  >>>>>>>>>\n>;\n\n/**\n * Validates the static surface of a point constructor.\n * This is only a cheap sanity check for the constructor hooks and fields consumed by generic\n * factories; it does not certify `BASE`/`ZERO` semantics or prove the curve implementation itself.\n * @param Point - Runtime point constructor.\n * @throws On missing constructor hooks or malformed field metadata. {@link TypeError}\n * @example\n * Check that one point constructor exposes the static hooks generic helpers need.\n *\n * ```ts\n * import { ed25519 } from '@noble/curves/ed25519.js';\n * import { validatePointCons } from '@noble/curves/abstract/curve.js';\n * validatePointCons(ed25519.Point);\n * ```\n */\nexport function validatePointCons<P extends CurvePoint<any, P>>(Point: CurvePointCons<P>): void {\n  const pc = Point as unknown as CurvePointCons<any>;\n  if (typeof (pc as unknown) !== 'function') throw new TypeError('Point must be a constructor');\n  // validateObject only accepts plain objects, so copy the constructor statics into one bag first.\n  validateObject(\n    {\n      Fp: pc.Fp,\n      Fn: pc.Fn,\n      fromAffine: pc.fromAffine,\n      fromBytes: pc.fromBytes,\n      fromHex: pc.fromHex,\n    },\n    {\n      Fp: 'object',\n      Fn: 'object',\n      fromAffine: 'function',\n      fromBytes: 'function',\n      fromHex: 'function',\n    }\n  );\n  validateField(pc.Fp);\n  validateField(pc.Fn);\n}\n\n/** Byte lengths used by one curve implementation. */\nexport interface CurveLengths {\n  /** Secret-key length in bytes. */\n  secretKey?: number;\n  /** Compressed public-key length in bytes. */\n  publicKey?: number;\n  /** Uncompressed public-key length in bytes. */\n  publicKeyUncompressed?: number;\n  /** Whether public-key encodings include a format prefix byte. */\n  publicKeyHasPrefix?: boolean;\n  /** Signature length in bytes. */\n  signature?: number;\n  /** Seed length in bytes when the curve exposes deterministic keygen from seed. */\n  seed?: number;\n}\n\n/** Reorders or otherwise remaps a batch while preserving its element type. */\nexport type Mapper<T> = (i: T[]) => T[];\n\n/**\n * Computes both candidates first, but the final selection still branches on `condition`, so this\n * is not a strict constant-time CMOV primitive.\n * @param condition - Whether to negate the point.\n * @param item - Point-like value.\n * @returns Original or negated value.\n * @example\n * Keep the point or return its negation based on one boolean branch.\n *\n * ```ts\n * import { negateCt } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const maybeNegated = negateCt(true, p256.Point.BASE);\n * ```\n */\nexport function negateCt<T extends { negate: () => T }>(condition: boolean, item: T): T {\n  const neg = item.negate();\n  return condition ? neg : item;\n}\n\n/**\n * Takes a bunch of Projective Points but executes only one\n * inversion on all of them. Inversion is very slow operation,\n * so this improves performance massively.\n * Optimization: converts a list of projective points to a list of identical points with Z=1.\n * Input points are left unchanged; the normalized points are returned as fresh instances.\n * @param c - Point constructor.\n * @param points - Projective points.\n * @returns Fresh projective points reconstructed from normalized affine coordinates.\n * @example\n * Batch-normalize projective points with a single shared inversion.\n *\n * ```ts\n * import { normalizeZ } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const points = normalizeZ(p256.Point, [p256.Point.BASE, p256.Point.BASE.double()]);\n * ```\n */\nexport function normalizeZ<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n  c: PC,\n  points: P[]\n): P[] {\n  const invertedZs = FpInvertBatch(\n    c.Fp,\n    points.map((p) => p.Z!)\n  );\n  return points.map((p, i) => c.fromAffine(p.toAffine(invertedZs[i])));\n}\n\nfunction validateW(W: number, bits: number) {\n  if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n    throw new Error('invalid window size, expected [1..' + bits + '], got W=' + W);\n}\n\n/** Internal wNAF opts for specific W and scalarBits.\n * Zero digits are skipped, so tables store only the positive half-window and callers reserve one\n * extra carry window.\n */\ntype WOpts = {\n  windows: number;\n  windowSize: number;\n  mask: bigint;\n  maxNumber: number;\n  shiftBy: bigint;\n};\n\nfunction calcWOpts(W: number, scalarBits: number): WOpts {\n  validateW(W, scalarBits);\n  const windows = Math.ceil(scalarBits / W) + 1; // W=8 33. Not 32, because we skip zero\n  const windowSize = 2 ** (W - 1); // W=8 128. Not 256, because we skip zero\n  const maxNumber = 2 ** W; // W=8 256\n  const mask = bitMask(W); // W=8 255 == mask 0b11111111\n  const shiftBy = BigInt(W); // W=8 8\n  return { windows, windowSize, mask, maxNumber, shiftBy };\n}\n\nfunction calcOffsets(n: bigint, window: number, wOpts: WOpts) {\n  const { windowSize, mask, maxNumber, shiftBy } = wOpts;\n  let wbits = Number(n & mask); // extract W bits.\n  let nextN = n >> shiftBy; // shift number by W bits.\n\n  // What actually happens here:\n  // const highestBit = Number(mask ^ (mask >> 1n));\n  // let wbits2 = wbits - 1; // skip zero\n  // if (wbits2 & highestBit) { wbits2 ^= Number(mask); // (~);\n\n  // split if bits > max: +224 => 256-32\n  if (wbits > windowSize) {\n    // we skip zero, which means instead of `>= size-1`, we do `> size`\n    wbits -= maxNumber; // -32, can be maxNumber - wbits, but then we need to set isNeg here.\n    nextN += _1n; // +256 (carry)\n  }\n  const offsetStart = window * windowSize;\n  const offset = offsetStart + Math.abs(wbits) - 1; // -1 because we skip zero; ignore when isZero\n  const isZero = wbits === 0; // is current window slice a 0?\n  const isNeg = wbits < 0; // is current window slice negative?\n  const isNegF = window % 2 !== 0; // fake branch noise only\n  const offsetF = offsetStart; // fake branch noise only\n  return { nextN, offset, isZero, isNeg, isNegF, offsetF };\n}\n\nfunction validateMSMPoints(points: any[], c: any) {\n  if (!Array.isArray(points)) throw new Error('array expected');\n  points.forEach((p, i) => {\n    if (!(p instanceof c)) throw new Error('invalid point at index ' + i);\n  });\n}\nfunction validateMSMScalars(scalars: any[], field: any) {\n  if (!Array.isArray(scalars)) throw new Error('array of scalars expected');\n  scalars.forEach((s, i) => {\n    if (!field.isValid(s)) throw new Error('invalid scalar at index ' + i);\n  });\n}\n\n// Since points in different groups cannot be equal (different object constructor),\n// we can have single place to store precomputes.\n// Allows to make points frozen / immutable.\nconst pointPrecomputes = new WeakMap<any, any[]>();\nconst pointWindowSizes = new WeakMap<any, number>();\n\nfunction getW(P: any): number {\n  // To disable precomputes:\n  // return 1;\n  // `1` is also the uncached sentinel: use the ladder / non-precomputed path.\n  return pointWindowSizes.get(P) || 1;\n}\n\nfunction assert0(n: bigint): void {\n  // Internal invariant: a non-zero remainder here means the wNAF window decomposition or loop\n  // count is inconsistent, not that the original caller provided a bad scalar.\n  if (n !== _0n) throw new Error('invalid wNAF');\n}\n\n/**\n * Elliptic curve multiplication of Point by scalar. Fragile.\n * Table generation takes **30MB of ram and 10ms on high-end CPU**,\n * but may take much longer on slow devices. Actual generation will happen on\n * first call of `multiply()`. By default, `BASE` point is precomputed.\n *\n * Scalars should always be less than curve order: this should be checked inside of a curve itself.\n * Creates precomputation tables for fast multiplication:\n * - private scalar is split by fixed size windows of W bits\n * - every window point is collected from window's table & added to accumulator\n * - since windows are different, same point inside tables won't be accessed more than once per calc\n * - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n * - +1 window is neccessary for wNAF\n * - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n *\n * TODO: research returning a 2d JS array of windows instead of a single window.\n * This would allow windows to be in different memory locations.\n * @param Point - Point constructor.\n * @param bits - Scalar bit length.\n * @example\n * Elliptic curve multiplication of Point by scalar.\n *\n * ```ts\n * import { wNAF } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const ladder = new wNAF(p256.Point, p256.Point.Fn.BITS);\n * ```\n */\nexport class wNAF<PC extends PC_ANY> {\n  private readonly BASE: PC_P<PC>;\n  private readonly ZERO: PC_P<PC>;\n  private readonly Fn: PC['Fn'];\n  readonly bits: number;\n\n  // Parametrized with a given Point class (not individual point)\n  constructor(Point: PC, bits: number) {\n    this.BASE = Point.BASE;\n    this.ZERO = Point.ZERO;\n    this.Fn = Point.Fn;\n    this.bits = bits;\n  }\n\n  // non-const time multiplication ladder\n  _unsafeLadder(elm: PC_P<PC>, n: bigint, p: PC_P<PC> = this.ZERO): PC_P<PC> {\n    let d: PC_P<PC> = elm;\n    while (n > _0n) {\n      if (n & _1n) p = p.add(d);\n      d = d.double();\n      n >>= _1n;\n    }\n    return p;\n  }\n\n  /**\n   * Creates a wNAF precomputation window. Used for caching.\n   * Default window size is set by `utils.precompute()` and is equal to 8.\n   * Number of precomputed points depends on the curve size:\n   * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n   * - 𝑊 is the window size\n   * - 𝑛 is the bitlength of the curve order.\n   * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n   * @param point - Point instance\n   * @param W - window size\n   * @returns precomputed point tables flattened to a single array\n   */\n  private precomputeWindow(point: PC_P<PC>, W: number): PC_P<PC>[] {\n    const { windows, windowSize } = calcWOpts(W, this.bits);\n    const points: PC_P<PC>[] = [];\n    let p: PC_P<PC> = point;\n    let base = p;\n    for (let window = 0; window < windows; window++) {\n      base = p;\n      points.push(base);\n      // i=1, bc we skip 0\n      for (let i = 1; i < windowSize; i++) {\n        base = base.add(p);\n        points.push(base);\n      }\n      p = base.double();\n    }\n    return points;\n  }\n\n  /**\n   * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n   * More compact implementation:\n   * https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541\n   * @returns real and fake (for const-time) points\n   */\n  private wNAF(W: number, precomputes: PC_P<PC>[], n: bigint): { p: PC_P<PC>; f: PC_P<PC> } {\n    // Scalar should be smaller than field order\n    if (!this.Fn.isValid(n)) throw new Error('invalid scalar');\n    // Accumulators\n    let p = this.ZERO;\n    let f = this.BASE;\n    // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n    // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n    // there is negate now: it is possible that negated element from low value\n    // would be the same as high element, which will create carry into next window.\n    // It's not obvious how this can fail, but still worth investigating later.\n    const wo = calcWOpts(W, this.bits);\n    for (let window = 0; window < wo.windows; window++) {\n      // (n === _0n) is handled and not early-exited. isEven and offsetF are used for noise\n      const { nextN, offset, isZero, isNeg, isNegF, offsetF } = calcOffsets(n, window, wo);\n      n = nextN;\n      if (isZero) {\n        // bits are 0: add garbage to fake point\n        // Important part for const-time getPublicKey: add random \"noise\" point to f.\n        f = f.add(negateCt(isNegF, precomputes[offsetF]));\n      } else {\n        // bits are 1: add to result point\n        p = p.add(negateCt(isNeg, precomputes[offset]));\n      }\n    }\n    assert0(n);\n    // Return both real and fake points so JIT keeps the noise path alive.\n    // Known caveat: negate/carry interactions can still drive `f` to infinity even when `p` is not,\n    // which weakens the noise path and leaves this only \"less const-time\" by about one bigint mul.\n    return { p, f };\n  }\n\n  /**\n   * Implements unsafe EC multiplication using precomputed tables\n   * and w-ary non-adjacent form.\n   * @param acc - accumulator point to add result of multiplication\n   * @returns point\n   */\n  private wNAFUnsafe(\n    W: number,\n    precomputes: PC_P<PC>[],\n    n: bigint,\n    acc: PC_P<PC> = this.ZERO\n  ): PC_P<PC> {\n    const wo = calcWOpts(W, this.bits);\n    for (let window = 0; window < wo.windows; window++) {\n      if (n === _0n) break; // Early-exit, skip 0 value\n      const { nextN, offset, isZero, isNeg } = calcOffsets(n, window, wo);\n      n = nextN;\n      if (isZero) {\n        // Window bits are 0: skip processing.\n        // Move to next window.\n        continue;\n      } else {\n        const item = precomputes[offset];\n        acc = acc.add(isNeg ? item.negate() : item); // Re-using acc allows to save adds in MSM\n      }\n    }\n    assert0(n);\n    return acc;\n  }\n\n  private getPrecomputes(W: number, point: PC_P<PC>, transform?: Mapper<PC_P<PC>>): PC_P<PC>[] {\n    // Cache key is only point identity plus the remembered window size; callers must not reuse the\n    // same point with incompatible `transform(...)` layouts and expect a separate cache entry.\n    let comp = pointPrecomputes.get(point);\n    if (!comp) {\n      comp = this.precomputeWindow(point, W) as PC_P<PC>[];\n      if (W !== 1) {\n        // Doing transform outside of if brings 15% perf hit\n        if (typeof transform === 'function') comp = transform(comp);\n        pointPrecomputes.set(point, comp);\n      }\n    }\n    return comp;\n  }\n\n  cached(\n    point: PC_P<PC>,\n    scalar: bigint,\n    transform?: Mapper<PC_P<PC>>\n  ): { p: PC_P<PC>; f: PC_P<PC> } {\n    const W = getW(point);\n    return this.wNAF(W, this.getPrecomputes(W, point, transform), scalar);\n  }\n\n  unsafe(point: PC_P<PC>, scalar: bigint, transform?: Mapper<PC_P<PC>>, prev?: PC_P<PC>): PC_P<PC> {\n    const W = getW(point);\n    if (W === 1) return this._unsafeLadder(point, scalar, prev); // For W=1 ladder is ~x2 faster\n    return this.wNAFUnsafe(W, this.getPrecomputes(W, point, transform), scalar, prev);\n  }\n\n  // We calculate precomputes for elliptic curve point multiplication\n  // using windowed method. This specifies window size and\n  // stores precomputed values. Usually only base point would be precomputed.\n  createCache(P: PC_P<PC>, W: number): void {\n    validateW(W, this.bits);\n    pointWindowSizes.set(P, W);\n    pointPrecomputes.delete(P);\n  }\n\n  hasCache(elm: PC_P<PC>): boolean {\n    return getW(elm) !== 1;\n  }\n}\n\n/**\n * Endomorphism-specific multiplication for Koblitz curves.\n * Cost: 128 dbl, 0-256 adds.\n * @param Point - Point constructor.\n * @param point - Input point.\n * @param k1 - First non-negative absolute scalar chunk.\n * @param k2 - Second non-negative absolute scalar chunk.\n * @returns Partial multiplication results.\n * @example\n * Endomorphism-specific multiplication for Koblitz curves.\n *\n * ```ts\n * import { mulEndoUnsafe } from '@noble/curves/abstract/curve.js';\n * import { secp256k1 } from '@noble/curves/secp256k1.js';\n * const parts = mulEndoUnsafe(secp256k1.Point, secp256k1.Point.BASE, 3n, 5n);\n * ```\n */\nexport function mulEndoUnsafe<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n  Point: PC,\n  point: P,\n  k1: bigint,\n  k2: bigint\n): { p1: P; p2: P } {\n  let acc = point;\n  let p1 = Point.ZERO;\n  let p2 = Point.ZERO;\n  while (k1 > _0n || k2 > _0n) {\n    if (k1 & _1n) p1 = p1.add(acc);\n    if (k2 & _1n) p2 = p2.add(acc);\n    acc = acc.double();\n    k1 >>= _1n;\n    k2 >>= _1n;\n  }\n  return { p1, p2 };\n}\n\n/**\n * Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * 30x faster vs naive addition on L=4096, 10x faster than precomputes.\n * For N=254bit, L=1, it does: 1024 ADD + 254 DBL. For L=5: 1536 ADD + 254 DBL.\n * Algorithmically constant-time (for same L), even when 1 point + scalar, or when scalar = 0.\n * @param c - Curve Point constructor\n * @param points - array of L curve points\n * @param scalars - array of L scalars (aka secret keys / bigints)\n * @returns MSM result point. Empty input is accepted and returns the identity.\n * @throws If the point set, scalar set, or MSM sizing is invalid. {@link Error}\n * @example\n * Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n *\n * ```ts\n * import { pippenger } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const point = pippenger(p256.Point, [p256.Point.BASE, p256.Point.BASE.double()], [2n, 3n]);\n * ```\n */\nexport function pippenger<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n  c: PC,\n  points: P[],\n  scalars: bigint[]\n): P {\n  // If we split scalars by some window (let's say 8 bits), every chunk will only\n  // take 256 buckets even if there are 4096 scalars, also re-uses double.\n  // TODO:\n  // - https://eprint.iacr.org/2024/750.pdf\n  // - https://tches.iacr.org/index.php/TCHES/article/view/10287\n  // 0 is accepted in scalars\n  const fieldN = c.Fn;\n  validateMSMPoints(points, c);\n  validateMSMScalars(scalars, fieldN);\n  const plength = points.length;\n  const slength = scalars.length;\n  if (plength !== slength) throw new Error('arrays of points and scalars must have equal length');\n  // if (plength === 0) throw new Error('array must be of length >= 2');\n  const zero = c.ZERO;\n  const wbits = bitLen(BigInt(plength));\n  let windowSize = 1; // bits\n  if (wbits > 12) windowSize = wbits - 3;\n  else if (wbits > 4) windowSize = wbits - 2;\n  else if (wbits > 0) windowSize = 2;\n  const MASK = bitMask(windowSize);\n  const buckets = new Array(Number(MASK) + 1).fill(zero); // +1 for zero array\n  const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;\n  let sum = zero;\n  for (let i = lastBits; i >= 0; i -= windowSize) {\n    buckets.fill(zero);\n    for (let j = 0; j < slength; j++) {\n      const scalar = scalars[j];\n      const wbits = Number((scalar >> BigInt(i)) & MASK);\n      buckets[wbits] = buckets[wbits].add(points[j]);\n    }\n    let resI = zero; // not using this will do small speed-up, but will lose ct\n    // Skip first bucket, because it is zero\n    for (let j = buckets.length - 1, sumI = zero; j > 0; j--) {\n      sumI = sumI.add(buckets[j]);\n      resI = resI.add(sumI);\n    }\n    sum = sum.add(resI);\n    if (i !== 0) for (let j = 0; j < windowSize; j++) sum = sum.double();\n  }\n  return sum as P;\n}\n/**\n * Precomputed multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * @param c - Curve Point constructor\n * @param points - array of L curve points\n * @param windowSize - Precompute window size.\n * @returns Function which multiplies points with scalars. The closure accepts\n *   `scalars.length <= points.length`, and omitted trailing scalars are treated as zero.\n * @throws If the point set or precompute window is invalid. {@link Error}\n * @example\n * Precomputed multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n *\n * ```ts\n * import { precomputeMSMUnsafe } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const msm = precomputeMSMUnsafe(p256.Point, [p256.Point.BASE], 4);\n * const point = msm([3n]);\n * ```\n */\nexport function precomputeMSMUnsafe<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n  c: PC,\n  points: P[],\n  windowSize: number\n): (scalars: bigint[]) => P {\n  /**\n   * Performance Analysis of Window-based Precomputation\n   *\n   * Base Case (256-bit scalar, 8-bit window):\n   * - Standard precomputation requires:\n   *   - 31 additions per scalar × 256 scalars = 7,936 ops\n   *   - Plus 255 summary additions = 8,191 total ops\n   *   Note: Summary additions can be optimized via accumulator\n   *\n   * Chunked Precomputation Analysis:\n   * - Using 32 chunks requires:\n   *   - 255 additions per chunk\n   *   - 256 doublings\n   *   - Total: (255 × 32) + 256 = 8,416 ops\n   *\n   * Memory Usage Comparison:\n   * Window Size | Standard Points | Chunked Points\n   * ------------|-----------------|---------------\n   *     4-bit   |     520         |      15\n   *     8-bit   |    4,224        |     255\n   *    10-bit   |   13,824        |   1,023\n   *    16-bit   |  557,056        |  65,535\n   *\n   * Key Advantages:\n   * 1. Enables larger window sizes due to reduced memory overhead\n   * 2. More efficient for smaller scalar counts:\n   *    - 16 chunks: (16 × 255) + 256 = 4,336 ops\n   *    - ~2x faster than standard 8,191 ops\n   *\n   * Limitations:\n   * - Not suitable for plain precomputes (requires 256 constant doublings)\n   * - Performance degrades with larger scalar counts:\n   *   - Optimal for ~256 scalars\n   *   - Less efficient for 4096+ scalars (Pippenger preferred)\n   */\n  const fieldN = c.Fn;\n  validateW(windowSize, fieldN.BITS);\n  validateMSMPoints(points, c);\n  const zero = c.ZERO;\n  const tableSize = 2 ** windowSize - 1; // table size (without zero)\n  const chunks = Math.ceil(fieldN.BITS / windowSize); // chunks of item\n  const MASK = bitMask(windowSize);\n  const tables = points.map((p: P) => {\n    const res = [];\n    for (let i = 0, acc = p; i < tableSize; i++) {\n      res.push(acc);\n      acc = acc.add(p);\n    }\n    return res;\n  });\n  return (scalars: bigint[]): P => {\n    validateMSMScalars(scalars, fieldN);\n    if (scalars.length > points.length)\n      throw new Error('array of scalars must be smaller than array of points');\n    let res = zero;\n    for (let i = 0; i < chunks; i++) {\n      // No need to double if accumulator is still zero.\n      if (res !== zero) for (let j = 0; j < windowSize; j++) res = res.double();\n      const shiftBy = BigInt(chunks * windowSize - (i + 1) * windowSize);\n      for (let j = 0; j < scalars.length; j++) {\n        const n = scalars[j];\n        const curr = Number((n >> shiftBy) & MASK);\n        if (!curr) continue; // skip zero scalars chunks\n        res = res.add(tables[j][curr - 1]);\n      }\n    }\n    return res;\n  };\n}\n\n/** Minimal curve parameters needed to construct a Weierstrass or Edwards curve. */\nexport type ValidCurveParams<T> = {\n  /** Base-field modulus. */\n  p: bigint;\n  /** Prime subgroup order. */\n  n: bigint;\n  /** Cofactor. */\n  h: bigint;\n  /** Curve parameter `a`. */\n  a: T;\n  /** Weierstrass curve parameter `b`. */\n  b?: T;\n  /** Edwards curve parameter `d`. */\n  d?: T;\n  /** Generator x coordinate. */\n  Gx: T;\n  /** Generator y coordinate. */\n  Gy: T;\n};\n\nfunction createField<T>(order: bigint, field?: TArg<IField<T>>, isLE?: boolean): TRet<IField<T>> {\n  if (field) {\n    // Reuse supplied field overrides as-is; `isLE` only affects freshly constructed fallback\n    // fields, and validateField() below only checks the arithmetic subset, not full byte/cmov\n    // behavior.\n    if (field.ORDER !== order) throw new Error('Field.ORDER must match order: Fp == p, Fn == n');\n    validateField(field);\n    return field as TRet<IField<T>>;\n  } else {\n    return Field(order, { isLE }) as unknown as TRet<IField<T>>;\n  }\n}\n/** Pair of fields used by curve constructors. */\nexport type FpFn<T> = {\n  /** Base field used for curve coordinates. */\n  Fp: IField<T>;\n  /** Scalar field used for secret scalars and subgroup arithmetic. */\n  Fn: IField<bigint>;\n};\n\n/**\n * Validates basic CURVE shape and field membership, then creates fields.\n * This does not prove that the generator is on-curve, that subgroup/order data are consistent, or\n * that the curve equation itself is otherwise sane.\n * @param type - Curve family.\n * @param CURVE - Curve parameters.\n * @param curveOpts - Optional field overrides:\n *   - `Fp` (optional): Optional base-field override.\n *   - `Fn` (optional): Optional scalar-field override.\n * @param FpFnLE - Whether field encoding is little-endian.\n * @returns Frozen curve parameters and fields.\n * @throws If the curve parameters or field overrides are invalid. {@link Error}\n * @example\n * Build curve fields from raw constants before constructing a curve instance.\n *\n * ```ts\n * const curve = createCurveFields('weierstrass', {\n *   p: 17n,\n *   n: 19n,\n *   h: 1n,\n *   a: 2n,\n *   b: 2n,\n *   Gx: 5n,\n *   Gy: 1n,\n * });\n * ```\n */\nexport function createCurveFields<T>(\n  type: 'weierstrass' | 'edwards',\n  CURVE: ValidCurveParams<T>,\n  curveOpts: TArg<Partial<FpFn<T>>> = {},\n  FpFnLE?: boolean\n): TRet<FpFn<T> & { CURVE: ValidCurveParams<T> }> {\n  if (FpFnLE === undefined) FpFnLE = type === 'edwards';\n  if (!CURVE || typeof CURVE !== 'object') throw new Error(`expected valid ${type} CURVE object`);\n  for (const p of ['p', 'n', 'h'] as const) {\n    const val = CURVE[p];\n    if (!(typeof val === 'bigint' && val > _0n))\n      throw new Error(`CURVE.${p} must be positive bigint`);\n  }\n  const Fp = createField(CURVE.p, curveOpts.Fp, FpFnLE);\n  const Fn = createField(CURVE.n, curveOpts.Fn, FpFnLE);\n  const _b: 'b' | 'd' = type === 'weierstrass' ? 'b' : 'd';\n  const params = ['Gx', 'Gy', 'a', _b] as const;\n  for (const p of params) {\n    // @ts-ignore\n    if (!Fp.isValid(CURVE[p]))\n      throw new Error(`CURVE.${p} must be valid field element of CURVE.Fp`);\n  }\n  CURVE = Object.freeze(Object.assign({}, CURVE));\n  return { CURVE, Fp, Fn } as TRet<FpFn<T> & { CURVE: ValidCurveParams<T> }>;\n}\n\ntype KeygenFn = (\n  seed?: Uint8Array,\n  isCompressed?: boolean\n) => { secretKey: Uint8Array; publicKey: Uint8Array };\n/**\n * @param randomSecretKey - Secret-key generator.\n * @param getPublicKey - Public-key derivation helper.\n * @returns Keypair generator.\n * @example\n * Build a `keygen()` helper from existing secret-key and public-key primitives.\n *\n * ```ts\n * import { createKeygen } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const keygen = createKeygen(p256.utils.randomSecretKey, p256.getPublicKey);\n * const pair = keygen();\n * ```\n */\nexport function createKeygen(\n  randomSecretKey: Function,\n  getPublicKey: TArg<Signer['getPublicKey']>\n): TRet<KeygenFn> {\n  return function keygen(seed?: TArg<Uint8Array>) {\n    const secretKey = randomSecretKey(seed) as TRet<Uint8Array>;\n    return { secretKey, publicKey: getPublicKey(secretKey) as TRet<Uint8Array> };\n  };\n}\n","/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport {\n  abytes,\n  aexists,\n  ahash,\n  aoutput,\n  clean,\n  type CHash,\n  type Hash,\n  type TArg,\n  type TRet,\n} from './utils.ts';\n\n/**\n * Internal class for HMAC.\n * Accepts any byte key, although RFC 2104 §3 recommends keys at least\n * `HashLen` bytes long.\n */\nexport class _HMAC<T extends Hash<T>> implements Hash<_HMAC<T>> {\n  oHash: T;\n  iHash: T;\n  blockLen: number;\n  outputLen: number;\n  canXOF = false;\n  private finished = false;\n  private destroyed = false;\n\n  constructor(hash: TArg<CHash>, key: TArg<Uint8Array>) {\n    ahash(hash);\n    abytes(key, undefined, 'key');\n    this.iHash = hash.create() as T;\n    if (typeof this.iHash.update !== 'function')\n      throw new Error('Expected instance of class which extends utils.Hash');\n    this.blockLen = this.iHash.blockLen;\n    this.outputLen = this.iHash.outputLen;\n    const blockLen = this.blockLen;\n    const pad = new Uint8Array(blockLen);\n    // blockLen can be bigger than outputLen\n    pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n    for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36;\n    this.iHash.update(pad);\n    // By doing update (processing of the first block) of the outer hash here,\n    // we can re-use it between multiple calls via clone.\n    this.oHash = hash.create() as T;\n    // Undo internal XOR && apply outer XOR\n    for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n    this.oHash.update(pad);\n    clean(pad);\n  }\n  update(buf: TArg<Uint8Array>): this {\n    aexists(this);\n    this.iHash.update(buf);\n    return this;\n  }\n  digestInto(out: TArg<Uint8Array>): void {\n    aexists(this);\n    aoutput(out, this);\n    this.finished = true;\n    const buf = out.subarray(0, this.outputLen);\n    // Reuse the first outputLen bytes for the inner digest; the outer hash consumes them before\n    // overwriting that same prefix with the final tag, leaving any oversized tail untouched.\n    this.iHash.digestInto(buf);\n    this.oHash.update(buf);\n    this.oHash.digestInto(buf);\n    this.destroy();\n  }\n  digest(): TRet<Uint8Array> {\n    const out = new Uint8Array(this.oHash.outputLen);\n    this.digestInto(out);\n    return out as TRet<Uint8Array>;\n  }\n  _cloneInto(to?: _HMAC<T>): _HMAC<T> {\n    // Create new instance without calling constructor since the key\n    // is already in state and we don't know it.\n    to ||= Object.create(Object.getPrototypeOf(this), {});\n    const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n    to = to as this;\n    to.finished = finished;\n    to.destroyed = destroyed;\n    to.blockLen = blockLen;\n    to.outputLen = outputLen;\n    to.oHash = oHash._cloneInto(to.oHash);\n    to.iHash = iHash._cloneInto(to.iHash);\n    return to;\n  }\n  clone(): _HMAC<T> {\n    return this._cloneInto();\n  }\n  destroy(): void {\n    this.destroyed = true;\n    this.oHash.destroy();\n    this.iHash.destroy();\n  }\n}\n\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - authentication key bytes\n * @param message - message bytes to authenticate\n * @returns Authentication tag bytes.\n * @example\n * Compute an RFC 2104 HMAC.\n * ```ts\n * import { hmac } from '@noble/hashes/hmac.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const mac = hmac(sha256, new Uint8Array([1, 2, 3]), new Uint8Array([4, 5, 6]));\n * ```\n */\ntype HmacFn = {\n  (hash: TArg<CHash>, key: TArg<Uint8Array>, message: TArg<Uint8Array>): TRet<Uint8Array>;\n  create(hash: TArg<CHash>, key: TArg<Uint8Array>): TRet<_HMAC<any>>;\n};\nexport const hmac: TRet<HmacFn> = /* @__PURE__ */ (() => {\n  const hmac_ = ((\n    hash: TArg<CHash>,\n    key: TArg<Uint8Array>,\n    message: TArg<Uint8Array>\n  ): TRet<Uint8Array> => new _HMAC<any>(hash, key).update(message).digest()) as TRet<HmacFn>;\n  hmac_.create = (hash: TArg<CHash>, key: TArg<Uint8Array>): TRet<_HMAC<any>> =>\n    new _HMAC<any>(hash, key) as TRet<_HMAC<any>>;\n  return hmac_;\n})();\n","/**\n * Short Weierstrass curve methods. The formula is: y² = x³ + ax + b.\n *\n * ### Design rationale for types\n *\n * * Interaction between classes from different curves should fail:\n *   `k256.Point.BASE.add(p256.Point.BASE)`\n * * For this purpose we want to use `instanceof` operator, which is fast and works during runtime\n * * Different calls of `curve()` would return different classes -\n *   `curve(params) !== curve(params)`: if somebody decided to monkey-patch their curve,\n *   it won't affect others\n *\n * TypeScript can't infer types for classes created inside a function. Classes is one instance\n * of nominative types in TypeScript and interfaces only check for shape, so it's hard to create\n * unique type for every function call.\n *\n * We can use generic types via some param, like curve opts, but that would:\n *     1. Enable interaction between `curve(params)` and `curve(params)` (curves of same params)\n *     which is hard to debug.\n *     2. Params can be generic and we can't enforce them to be constant value:\n *     if somebody creates curve from non-constant params,\n *     it would be allowed to interact with other curves with non-constant params\n *\n * @todo https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-7.html#unique-symbol\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac as nobleHmac } from '@noble/hashes/hmac.js';\nimport { ahash } from '@noble/hashes/utils.js';\nimport {\n  abignumber,\n  abool,\n  abytes,\n  aInRange,\n  asafenumber,\n  bitLen,\n  bitMask,\n  bytesToHex,\n  bytesToNumberBE,\n  concatBytes,\n  createHmacDrbg,\n  hexToBytes,\n  isBytes,\n  numberToHexUnpadded,\n  validateObject,\n  randomBytes as wcRandomBytes,\n  type CHash,\n  type HmacFn,\n  type Signer,\n  type TArg,\n  type TRet,\n} from '../utils.ts';\nimport {\n  createCurveFields,\n  createKeygen,\n  mulEndoUnsafe,\n  negateCt,\n  normalizeZ,\n  wNAF,\n  type AffinePoint,\n  type CurveLengths,\n  type CurvePoint,\n  type CurvePointCons,\n} from './curve.ts';\nimport {\n  FpInvertBatch,\n  FpIsSquare,\n  getMinHashLength,\n  mapHashToField,\n  validateField,\n  type IField,\n} from './modular.ts';\n\n/** Shared affine point shape used by Weierstrass helpers. */\nexport type { AffinePoint };\n\ntype EndoBasis = [[bigint, bigint], [bigint, bigint]];\n/**\n * When Weierstrass curve has `a=0`, it becomes Koblitz curve.\n * Koblitz curves allow using **efficiently-computable GLV endomorphism ψ**.\n * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n *\n * Endomorphism consists of beta, lambda and splitScalar:\n *\n * 1. GLV endomorphism ψ transforms a point: `P = (x, y) ↦ ψ(P) = (β·x mod p, y)`\n * 2. GLV scalar decomposition transforms a scalar: `k ≡ k₁ + k₂·λ (mod n)`\n * 3. Then these are combined: `k·P = k₁·P + k₂·ψ(P)`\n * 4. Two 128-bit point-by-scalar multiplications + one point addition is faster than\n *    one 256-bit multiplication.\n *\n * where\n * * beta: β ∈ Fₚ with β³ = 1, β ≠ 1\n * * lambda: λ ∈ Fₙ with λ³ = 1, λ ≠ 1\n * * splitScalar decomposes k ↦ k₁, k₂, by using reduced basis vectors.\n *   Gauss lattice reduction calculates them from initial basis vectors `(n, 0), (-λ, 0)`\n *\n * Check out `test/misc/endomorphism.js` and\n * {@link https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066 | this endomorphism gist}.\n */\nexport type EndomorphismOpts = {\n  /** Cube root of unity used by the GLV endomorphism. */\n  beta: bigint;\n  /** Reduced lattice basis used for scalar splitting. */\n  basises?: EndoBasis;\n  /**\n   * Optional custom scalar-splitting helper.\n   * Receives one scalar and returns two half-sized scalar components.\n   */\n  splitScalar?: (k: bigint) => { k1neg: boolean; k1: bigint; k2neg: boolean; k2: bigint };\n};\n// We construct the basis so `den` is always positive and equals `n`,\n// but the `num` sign depends on the basis, not on the secret value.\n// Exact half-way cases round away from zero, which keeps the split symmetric\n// around the reduced-basis boundaries used by endomorphism decomposition.\nconst divNearest = (num: bigint, den: bigint) => (num + (num >= 0 ? den : -den) / _2n) / den;\n\n/** Two half-sized scalar components returned by endomorphism splitting. */\nexport type ScalarEndoParts = {\n  /** Whether the first split scalar should be negated. */\n  k1neg: boolean;\n  /** Absolute value of the first split scalar. */\n  k1: bigint;\n  /** Whether the second split scalar should be negated. */\n  k2neg: boolean;\n  /** Absolute value of the second split scalar. */\n  k2: bigint;\n};\n\n/** Splits scalar for GLV endomorphism. */\nexport function _splitEndoScalar(k: bigint, basis: EndoBasis, n: bigint): ScalarEndoParts {\n  // Split scalar into two such that part is ~half bits: `abs(part) < sqrt(N)`\n  // Since part can be negative, we need to do this on point.\n  // Callers must provide a reduced GLV basis whose vectors satisfy\n  // `a + b * lambda ≡ 0 (mod n)`; this helper only sees the basis and `n`.\n  // Reject unreduced scalars instead of silently treating them mod n.\n  aInRange('scalar', k, _0n, n);\n  // TODO: verifyScalar function which consumes lambda\n  const [[a1, b1], [a2, b2]] = basis;\n  const c1 = divNearest(b2 * k, n);\n  const c2 = divNearest(-b1 * k, n);\n  // |k1|/|k2| is < sqrt(N), but can be negative.\n  // If we do `k1 mod N`, we'll get big scalar (`> sqrt(N)`): so, we do cheaper negation instead.\n  let k1 = k - c1 * a1 - c2 * a2;\n  let k2 = -c1 * b1 - c2 * b2;\n  const k1neg = k1 < _0n;\n  const k2neg = k2 < _0n;\n  if (k1neg) k1 = -k1;\n  if (k2neg) k2 = -k2;\n  // Double check that resulting scalar less than half bits of N: otherwise wNAF will fail.\n  // This should only happen on wrong bases.\n  // Also, the math inside is complex enough that this guard is worth keeping.\n  const MAX_NUM = bitMask(Math.ceil(bitLen(n) / 2)) + _1n; // Half bits of N\n  if (k1 < _0n || k1 >= MAX_NUM || k2 < _0n || k2 >= MAX_NUM) {\n    throw new Error('splitScalar (endomorphism): failed for k');\n  }\n  return { k1neg, k1, k2neg, k2 };\n}\n\n/**\n * Option to enable hedged signatures with improved security.\n *\n * * Randomly generated k is bad, because broken CSPRNG would leak private keys.\n * * Deterministic k (RFC6979) is better; but is suspectible to fault attacks.\n *\n * We allow using technique described in RFC6979 3.6: additional k', a.k.a. adding randomness\n * to deterministic sig. If CSPRNG is broken & randomness is weak, it would STILL be as secure\n * as ordinary sig without ExtraEntropy.\n *\n * * `true` means \"fetch data, from CSPRNG, incorporate it into k generation\"\n * * `false` means \"disable extra entropy, use purely deterministic k\"\n * * `Uint8Array` passed means \"incorporate following data into k generation\"\n *\n * See {@link https://paulmillr.com/posts/deterministic-signatures/ | deterministic signatures}.\n */\nexport type ECDSAExtraEntropy = boolean | Uint8Array;\n/**\n * - `compact` is the default format\n * - `recovered` is the same as compact, but with an extra byte indicating recovery byte\n * - `der` is ASN.1 DER encoding\n */\nexport type ECDSASignatureFormat = 'compact' | 'recovered' | 'der';\n/**\n * - `prehash`: (default: true) indicates whether to do sha256(message).\n *   When a custom hash is used, it must be set to `false`.\n */\nexport type ECDSARecoverOpts = {\n  /** Whether to hash the message before signature recovery. */\n  prehash?: boolean;\n};\n/**\n * - `prehash`: (default: true) indicates whether to do sha256(message).\n *   When a custom hash is used, it must be set to `false`.\n * - `lowS`: (default: true) prohibits signatures with `sig.s >= CURVE.n/2n`.\n *   Compatible with BTC/ETH. Setting `lowS: false` allows to create malleable signatures,\n *   which is default openssl behavior.\n *   Non-malleable signatures can still be successfully verified in openssl.\n * - `format`: (default: 'compact') 'compact' or 'recovered' with recovery byte\n */\nexport type ECDSAVerifyOpts = {\n  /** Whether to hash the message before verification. */\n  prehash?: boolean;\n  /** Whether to reject high-S signatures. */\n  lowS?: boolean;\n  /** Signature encoding to accept. */\n  format?: ECDSASignatureFormat;\n};\n/**\n * - `prehash`: (default: true) indicates whether to do sha256(message).\n *   When a custom hash is used, it must be set to `false`.\n * - `lowS`: (default: true) prohibits signatures with `sig.s >= CURVE.n/2n`.\n *   Compatible with BTC/ETH. Setting `lowS: false` allows to create malleable signatures,\n *   which is default openssl behavior.\n *   Non-malleable signatures can still be successfully verified in openssl.\n * - `format`: (default: 'compact') 'compact' or 'recovered' with recovery byte\n * - `extraEntropy`: (default: false) creates signatures with increased\n *   security, see {@link ECDSAExtraEntropy}\n */\nexport type ECDSASignOpts = {\n  /** Whether to hash the message before signing. */\n  prehash?: boolean;\n  /** Whether to normalize signatures into the low-S half-order. */\n  lowS?: boolean;\n  /** Signature encoding to produce. */\n  format?: ECDSASignatureFormat;\n  /** Optional hedging input for deterministic k generation. */\n  extraEntropy?: ECDSAExtraEntropy;\n};\n\nfunction validateSigFormat(format: string): ECDSASignatureFormat {\n  if (!['compact', 'recovered', 'der'].includes(format))\n    throw new Error('Signature format must be \"compact\", \"recovered\", or \"der\"');\n  return format as ECDSASignatureFormat;\n}\n\nfunction validateSigOpts<T extends ECDSASignOpts, D extends Required<ECDSASignOpts>>(\n  opts: T,\n  def: D\n): D {\n  validateObject(opts);\n  const optsn = {} as D;\n  // Normalize only the declared option subset from `def`; unknown keys are\n  // intentionally ignored so shared / superset option bags stay valid here too.\n  // `extraEntropy` stays an opaque payload until the signing path consumes it.\n  for (let optName of Object.keys(def) as (keyof D)[]) {\n    // @ts-ignore\n    optsn[optName] = opts[optName] === undefined ? def[optName] : opts[optName];\n  }\n  abool(optsn.lowS!, 'lowS');\n  abool(optsn.prehash!, 'prehash');\n  if (optsn.format !== undefined) validateSigFormat(optsn.format);\n  return optsn;\n}\n\n/** Projective XYZ point used by short Weierstrass curves. */\nexport interface WeierstrassPoint<T> extends CurvePoint<T, WeierstrassPoint<T>> {\n  /** projective X coordinate. Different from affine x. */\n  readonly X: T;\n  /** projective Y coordinate. Different from affine y. */\n  readonly Y: T;\n  /** projective z coordinate */\n  readonly Z: T;\n  /** affine x coordinate. Different from projective X. */\n  get x(): T;\n  /** affine y coordinate. Different from projective Y. */\n  get y(): T;\n  /**\n   * Encode the point into compressed or uncompressed SEC1 bytes.\n   * @param isCompressed - Whether to use the compressed form.\n   * @returns Encoded point bytes.\n   */\n  toBytes(isCompressed?: boolean): TRet<Uint8Array>;\n  /**\n   * Encode the point into compressed or uncompressed SEC1 hex.\n   * @param isCompressed - Whether to use the compressed form.\n   * @returns Encoded point hex.\n   */\n  toHex(isCompressed?: boolean): string;\n}\n\n/** Constructor and metadata helpers for Weierstrass points. */\nexport interface WeierstrassPointCons<T> extends CurvePointCons<WeierstrassPoint<T>> {\n  /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n  new (X: T, Y: T, Z: T): WeierstrassPoint<T>;\n  /**\n   * Return the curve parameters captured by this point constructor.\n   * @returns Curve parameters.\n   */\n  CURVE(): WeierstrassOpts<T>;\n}\n\n/**\n * Weierstrass curve options.\n *\n * * p: prime characteristic (order) of finite field, in which arithmetics is done\n * * n: order of prime subgroup a.k.a total amount of valid curve points\n * * h: cofactor, usually 1. h*n is group order; n is subgroup order\n * * a: formula param, must be in field of p\n * * b: formula param, must be in field of p\n * * Gx: x coordinate of generator point a.k.a. base point\n * * Gy: y coordinate of generator point\n */\nexport type WeierstrassOpts<T> = Readonly<{\n  /** Base-field modulus. */\n  p: bigint;\n  /** Prime subgroup order. */\n  n: bigint;\n  /** Curve cofactor. */\n  h: bigint;\n  /** Weierstrass curve parameter `a`. */\n  a: T;\n  /** Weierstrass curve parameter `b`. */\n  b: T;\n  /** Generator x coordinate. */\n  Gx: T;\n  /** Generator y coordinate. */\n  Gy: T;\n}>;\n\n/**\n * Optional helpers and overrides for a Weierstrass point constructor.\n *\n * When a cofactor != 1, there can be effective methods to:\n * 1. Determine whether a point is torsion-free\n * 2. Clear torsion component\n */\nexport type WeierstrassExtraOpts<T> = Partial<{\n  /** Optional base-field override. */\n  Fp: IField<T>;\n  /** Optional scalar-field override. */\n  Fn: IField<bigint>;\n  /** Whether the point constructor accepts infinity points. */\n  allowInfinityPoint: boolean;\n  /** Optional GLV endomorphism data. */\n  endo: EndomorphismOpts;\n  /** Optional torsion-check override. */\n  isTorsionFree: (c: WeierstrassPointCons<T>, point: WeierstrassPoint<T>) => boolean;\n  /** Optional cofactor-clearing override. */\n  clearCofactor: (c: WeierstrassPointCons<T>, point: WeierstrassPoint<T>) => WeierstrassPoint<T>;\n  /** Optional custom point decoder. */\n  fromBytes: (bytes: TArg<Uint8Array>) => AffinePoint<T>;\n  /** Optional custom point encoder. */\n  toBytes: (\n    c: WeierstrassPointCons<T>,\n    point: WeierstrassPoint<T>,\n    isCompressed: boolean\n  ) => TRet<Uint8Array>;\n}>;\n\n/**\n * Options for ECDSA signatures over a Weierstrass curve.\n *\n * * lowS: (default: true) whether produced or verified signatures occupy the\n *   low half of `ecdsaOpts.n`. Prevents malleability.\n * * hmac: (default: noble-hashes hmac) function, would be used to init hmac-drbg for k generation.\n * * randomBytes: (default: webcrypto os-level CSPRNG) custom method for fetching secure randomness.\n * * bits2int, bits2int_modN: used in sigs, sometimes overridden by curves. Custom hooks are\n *   treated as pure functions over validated bytes and MUST NOT mutate caller-owned buffers or\n *   closure-captured option bags. `bits2int_modN` must also return a canonical scalar in\n *   `[0..Point.Fn.ORDER-1]`.\n */\nexport type ECDSAOpts = Partial<{\n  /** Default low-S policy for this ECDSA instance. */\n  lowS: boolean;\n  /** HMAC implementation used by RFC6979 DRBG. */\n  hmac: HmacFn;\n  /** RNG override used by helper constructors. */\n  randomBytes: (bytesLength?: number) => TRet<Uint8Array>;\n  /** Hash-to-integer conversion override. */\n  bits2int: (bytes: TArg<Uint8Array>) => bigint;\n  /** Hash-to-integer-mod-n conversion override. Returns a canonical scalar in `[0..Fn.ORDER-1]`. */\n  bits2int_modN: (bytes: TArg<Uint8Array>) => bigint;\n}>;\n\n/** Elliptic Curve Diffie-Hellman helper namespace. */\nexport interface ECDH {\n  /**\n   * Generate a secret/public key pair.\n   * @param seed - Optional seed material.\n   * @returns Secret/public key pair.\n   */\n  keygen: (seed?: TArg<Uint8Array>) => { secretKey: TRet<Uint8Array>; publicKey: TRet<Uint8Array> };\n  /**\n   * Derive the public key from a secret key.\n   * @param secretKey - Secret key bytes.\n   * @param isCompressed - Whether to emit compressed SEC1 bytes.\n   * @returns Encoded public key.\n   */\n  getPublicKey: (secretKey: TArg<Uint8Array>, isCompressed?: boolean) => TRet<Uint8Array>;\n  /**\n   * Compute the shared secret point from a secret key and peer public key.\n   * @param secretKeyA - Local secret key bytes.\n   * @param publicKeyB - Peer public key bytes.\n   * @param isCompressed - Whether to emit compressed SEC1 bytes.\n   * @returns Encoded shared point.\n   */\n  getSharedSecret: (\n    secretKeyA: TArg<Uint8Array>,\n    publicKeyB: TArg<Uint8Array>,\n    isCompressed?: boolean\n  ) => TRet<Uint8Array>;\n  /** Point constructor used by this ECDH instance. */\n  Point: WeierstrassPointCons<bigint>;\n  /** Validation and random-key helpers. */\n  utils: {\n    /** Check whether a secret key has the expected encoding. */\n    isValidSecretKey: (secretKey: TArg<Uint8Array>) => boolean;\n    /** Check whether a public key decodes to a valid point. */\n    isValidPublicKey: (publicKey: TArg<Uint8Array>, isCompressed?: boolean) => boolean;\n    /** Generate a valid random secret key. */\n    randomSecretKey: (seed?: TArg<Uint8Array>) => TRet<Uint8Array>;\n  };\n  /** Byte lengths for keys and signatures exposed by this curve. */\n  lengths: CurveLengths;\n}\n\n/**\n * ECDSA interface.\n * Only supported for prime fields, not Fp2 (extension fields).\n */\nexport interface ECDSA extends ECDH {\n  /**\n   * Sign a message with the given secret key.\n   * @param message - Message bytes.\n   * @param secretKey - Secret key bytes.\n   * @param opts - Optional signing tweaks. See {@link ECDSASignOpts}.\n   * @returns Encoded signature bytes.\n   */\n  sign: (\n    message: TArg<Uint8Array>,\n    secretKey: TArg<Uint8Array>,\n    opts?: TArg<ECDSASignOpts>\n  ) => TRet<Uint8Array>;\n  /**\n   * Verify a signature against a message and public key.\n   * @param signature - Encoded signature bytes.\n   * @param message - Message bytes.\n   * @param publicKey - Encoded public key.\n   * @param opts - Optional verification tweaks. See {@link ECDSAVerifyOpts}.\n   * @returns Whether the signature is valid.\n   */\n  verify: (\n    signature: TArg<Uint8Array>,\n    message: TArg<Uint8Array>,\n    publicKey: TArg<Uint8Array>,\n    opts?: TArg<ECDSAVerifyOpts>\n  ) => boolean;\n  /**\n   * Recover the public key encoded into a recoverable signature.\n   * @param signature - Recoverable signature bytes.\n   * @param message - Message bytes.\n   * @param opts - Optional recovery tweaks. See {@link ECDSARecoverOpts}.\n   * @returns Encoded recovered public key.\n   */\n  recoverPublicKey(\n    signature: TArg<Uint8Array>,\n    message: TArg<Uint8Array>,\n    opts?: TArg<ECDSARecoverOpts>\n  ): TRet<Uint8Array>;\n  /** Signature constructor and parser helpers. */\n  Signature: ECDSASignatureCons;\n}\n/**\n * @param m - Error message.\n * @example\n * Throw a DER-specific error when signature parsing encounters invalid bytes.\n *\n * ```ts\n * new DERErr('bad der');\n * ```\n */\nexport class DERErr extends Error {\n  constructor(m = '') {\n    super(m);\n  }\n}\n/** DER helper namespace used by ECDSA signature parsing and encoding. */\nexport type IDER = {\n  // asn.1 DER encoding utils\n  /**\n   * DER-specific error constructor.\n   * @param m - Error message.\n   * @returns DER-specific error instance.\n   */\n  Err: typeof DERErr;\n  // Basic building block is TLV (Tag-Length-Value)\n  /** Low-level tag-length-value helpers used by DER encoders. */\n  _tlv: {\n    /**\n     * Encode one TLV record.\n     * @param tag - ASN.1 tag byte.\n     * @param data - Hex-encoded value payload.\n     * @returns Encoded TLV string.\n     */\n    encode: (tag: number, data: string) => string;\n    // v - value, l - left bytes (unparsed)\n    /**\n     * Decode one TLV record and return the value plus leftover bytes.\n     * @param tag - Expected ASN.1 tag byte.\n     * @param data - Remaining DER bytes.\n     * @returns Parsed value plus leftover bytes.\n     */\n    decode(tag: number, data: TArg<Uint8Array>): TRet<{ v: Uint8Array; l: Uint8Array }>;\n  };\n  // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n  // since we always use positive integers here. It must always be empty:\n  // - add zero byte if exists\n  // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n  /** Positive-integer DER helpers used by ECDSA signature encoding. */\n  _int: {\n    /**\n     * Encode one positive bigint as a DER INTEGER.\n     * @param num - Positive integer to encode.\n     * @returns Encoded DER INTEGER.\n     */\n    encode(num: bigint): string;\n    /**\n     * Decode one DER INTEGER into a bigint.\n     * @param data - DER INTEGER bytes.\n     * @returns Decoded bigint.\n     */\n    decode(data: TArg<Uint8Array>): bigint;\n  };\n  /**\n   * Parse a DER signature into `{ r, s }`.\n   * @param bytes - DER signature bytes.\n   * @returns Parsed signature components.\n   */\n  toSig(bytes: TArg<Uint8Array>): { r: bigint; s: bigint };\n  /**\n   * Encode `{ r, s }` as a DER signature.\n   * @param sig - Signature components.\n   * @returns DER-encoded signature hex.\n   */\n  hexFromSig(sig: { r: bigint; s: bigint }): string;\n};\n/**\n * ASN.1 DER encoding utilities. ASN is very complex & fragile. Format:\n *\n *     [0x30 (SEQUENCE), bytelength, 0x02 (INTEGER), intLength, R, 0x02 (INTEGER), intLength, S]\n *\n * Docs: {@link https://letsencrypt.org/docs/a-warm-welcome-to-asn1-and-der/ | Let's Encrypt ASN.1 guide} and\n * {@link https://luca.ntop.org/Teaching/Appunti/asn1.html | Luca Deri's ASN.1 notes}.\n * @example\n * ASN.1 DER encoding utilities.\n *\n * ```ts\n * const der = DER.hexFromSig({ r: 1n, s: 2n });\n * ```\n */\nexport const DER: IDER = {\n  // asn.1 DER encoding utils\n  Err: DERErr,\n  // Basic building block is TLV (Tag-Length-Value)\n  _tlv: {\n    encode: (tag: number, data: string): string => {\n      const { Err: E } = DER;\n      asafenumber(tag, 'tag');\n      if (tag < 0 || tag > 255) throw new E('tlv.encode: wrong tag');\n      if (typeof data !== 'string')\n        throw new TypeError('\"data\" expected string, got type=' + typeof data);\n      // Internal helper: callers hand this already-validated hex payload, so we only enforce\n      // byte alignment here instead of re-validating every nibble.\n      if (data.length & 1) throw new E('tlv.encode: unpadded data');\n      const dataLen = data.length / 2;\n      const len = numberToHexUnpadded(dataLen);\n      if ((len.length / 2) & 0b1000_0000) throw new E('tlv.encode: long form length too big');\n      // length of length with long form flag\n      const lenLen = dataLen > 127 ? numberToHexUnpadded((len.length / 2) | 0b1000_0000) : '';\n      const t = numberToHexUnpadded(tag);\n      return t + lenLen + len + data;\n    },\n    // v - value, l - left bytes (unparsed)\n    decode(tag: number, data: TArg<Uint8Array>): TRet<{ v: Uint8Array; l: Uint8Array }> {\n      const { Err: E } = DER;\n      data = abytes(data, undefined, 'DER data');\n      let pos = 0;\n      if (tag < 0 || tag > 255) throw new E('tlv.encode: wrong tag');\n      if (data.length < 2 || data[pos++] !== tag) throw new E('tlv.decode: wrong tlv');\n      const first = data[pos++];\n      // First bit of first length byte is the short/long form flag.\n      const isLong = !!(first & 0b1000_0000);\n      let length = 0;\n      if (!isLong) length = first;\n      else {\n        // Long form: [longFlag(1bit), lengthLength(7bit), length (BE)]\n        const lenLen = first & 0b0111_1111;\n        if (!lenLen) throw new E('tlv.decode(long): indefinite length not supported');\n        // This would overflow u32 in JS.\n        if (lenLen > 4) throw new E('tlv.decode(long): byte length is too big');\n        const lengthBytes = data.subarray(pos, pos + lenLen);\n        if (lengthBytes.length !== lenLen) throw new E('tlv.decode: length bytes not complete');\n        if (lengthBytes[0] === 0) throw new E('tlv.decode(long): zero leftmost byte');\n        for (const b of lengthBytes) length = (length << 8) | b;\n        pos += lenLen;\n        if (length < 128) throw new E('tlv.decode(long): not minimal encoding');\n      }\n      const v = data.subarray(pos, pos + length);\n      if (v.length !== length) throw new E('tlv.decode: wrong value length');\n      return { v, l: data.subarray(pos + length) } as TRet<{ v: Uint8Array; l: Uint8Array }>;\n    },\n  },\n  // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n  // since we always use positive integers here. It must always be empty:\n  // - add zero byte if exists\n  // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n  _int: {\n    encode(num: bigint): string {\n      const { Err: E } = DER;\n      abignumber(num);\n      if (num < _0n) throw new E('integer: negative integers are not allowed');\n      let hex = numberToHexUnpadded(num);\n      // Pad with zero byte if negative flag is present\n      if (Number.parseInt(hex[0], 16) & 0b1000) hex = '00' + hex;\n      if (hex.length & 1) throw new E('unexpected DER parsing assertion: unpadded hex');\n      return hex;\n    },\n    decode(data: TArg<Uint8Array>): bigint {\n      const { Err: E } = DER;\n      if (data.length < 1) throw new E('invalid signature integer: empty');\n      if (data[0] & 0b1000_0000) throw new E('invalid signature integer: negative');\n      // Single-byte zero `00` is the canonical DER INTEGER encoding for zero.\n      if (data.length > 1 && data[0] === 0x00 && !(data[1] & 0b1000_0000))\n        throw new E('invalid signature integer: unnecessary leading zero');\n      return bytesToNumberBE(data);\n    },\n  },\n  toSig(bytes: TArg<Uint8Array>): { r: bigint; s: bigint } {\n    // parse DER signature\n    const { Err: E, _int: int, _tlv: tlv } = DER;\n    const data = abytes(bytes, undefined, 'signature');\n    const { v: seqBytes, l: seqLeftBytes } = tlv.decode(0x30, data);\n    if (seqLeftBytes.length) throw new E('invalid signature: left bytes after parsing');\n    const { v: rBytes, l: rLeftBytes } = tlv.decode(0x02, seqBytes);\n    const { v: sBytes, l: sLeftBytes } = tlv.decode(0x02, rLeftBytes);\n    if (sLeftBytes.length) throw new E('invalid signature: left bytes after parsing');\n    return { r: int.decode(rBytes), s: int.decode(sBytes) };\n  },\n  hexFromSig(sig: { r: bigint; s: bigint }): string {\n    const { _tlv: tlv, _int: int } = DER;\n    const rs = tlv.encode(0x02, int.encode(sig.r));\n    const ss = tlv.encode(0x02, int.encode(sig.s));\n    const seq = rs + ss;\n    return tlv.encode(0x30, seq);\n  },\n};\nObject.freeze(DER._tlv);\nObject.freeze(DER._int);\nObject.freeze(DER);\n\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = /* @__PURE__ */ BigInt(0), _1n = /* @__PURE__ */ BigInt(1), _2n = /* @__PURE__ */ BigInt(2), _3n = /* @__PURE__ */ BigInt(3), _4n = /* @__PURE__ */ BigInt(4);\n\n/**\n * Creates weierstrass Point constructor, based on specified curve options.\n *\n * See {@link WeierstrassOpts}.\n * @param params - Curve parameters. See {@link WeierstrassOpts}.\n * @param extraOpts - Optional helpers and overrides. See {@link WeierstrassExtraOpts}.\n * @returns Weierstrass point constructor.\n * @throws If the curve parameters, overrides, or point codecs are invalid. {@link Error}\n *\n * @example\n * Construct a point type from explicit Weierstrass curve parameters.\n *\n * ```js\n * const opts = {\n *   p: 0xfffffffffffffffffffffffffffffffeffffac73n,\n *   n: 0x100000000000000000001b8fa16dfab9aca16b6b3n,\n *   h: 1n,\n *   a: 0n,\n *   b: 7n,\n *   Gx: 0x3b4c382ce37aa192a4019e763036f4f5dd4d7ebbn,\n *   Gy: 0x938cf935318fdced6bc28286531733c3f03c4feen,\n * };\n * const secp160k1_Point = weierstrass(opts);\n * ```\n */\nexport function weierstrass<T>(\n  params: WeierstrassOpts<T>,\n  extraOpts: WeierstrassExtraOpts<T> = {}\n): WeierstrassPointCons<T> {\n  const validated = createCurveFields('weierstrass', params, extraOpts);\n  const Fp = validated.Fp as IField<T>;\n  const Fn = validated.Fn as IField<bigint>;\n  let CURVE = validated.CURVE as WeierstrassOpts<T>;\n  const { h: cofactor, n: CURVE_ORDER } = CURVE;\n  validateObject(\n    extraOpts,\n    {},\n    {\n      allowInfinityPoint: 'boolean',\n      clearCofactor: 'function',\n      isTorsionFree: 'function',\n      fromBytes: 'function',\n      toBytes: 'function',\n      endo: 'object',\n    }\n  );\n\n  // Snapshot constructor-time flags whose later mutation would otherwise change\n  // validity semantics of an already-built point type.\n  const { endo, allowInfinityPoint } = extraOpts;\n  if (endo) {\n    // validateObject(endo, { beta: 'bigint', splitScalar: 'function' });\n    if (!Fp.is0(CURVE.a) || typeof endo.beta !== 'bigint' || !Array.isArray(endo.basises)) {\n      throw new Error('invalid endo: expected \"beta\": bigint and \"basises\": array');\n    }\n  }\n\n  const lengths = getWLengths(Fp as TArg<IField<T>>, Fn);\n\n  function assertCompressionIsSupported() {\n    if (!Fp.isOdd) throw new Error('compression is not supported: Field does not have .isOdd()');\n  }\n\n  // Implements IEEE P1363 point encoding\n  function pointToBytes(\n    _c: WeierstrassPointCons<T>,\n    point: WeierstrassPoint<T>,\n    isCompressed: boolean\n  ): TRet<Uint8Array> {\n    // SEC 1 v2.0 §2.3.3 encodes infinity as the single octet 0x00. Only curves\n    // that opt into infinity as a public point value should expose that byte form.\n    if (allowInfinityPoint && point.is0()) return Uint8Array.of(0) as TRet<Uint8Array>;\n    const { x, y } = point.toAffine();\n    const bx = Fp.toBytes(x);\n    abool(isCompressed, 'isCompressed');\n    if (isCompressed) {\n      assertCompressionIsSupported();\n      const hasEvenY = !Fp.isOdd!(y);\n      return concatBytes(pprefix(hasEvenY), bx) as TRet<Uint8Array>;\n    } else {\n      return concatBytes(Uint8Array.of(0x04), bx, Fp.toBytes(y)) as TRet<Uint8Array>;\n    }\n  }\n  function pointFromBytes(bytes: TArg<Uint8Array>) {\n    abytes(bytes, undefined, 'Point');\n    const { publicKey: comp, publicKeyUncompressed: uncomp } = lengths; // e.g. for 32-byte: 33, 65\n    const length = bytes.length;\n    const head = bytes[0];\n    const tail = bytes.subarray(1);\n    if (allowInfinityPoint && length === 1 && head === 0x00) return { x: Fp.ZERO, y: Fp.ZERO };\n    // SEC 1 v2.0 §2.3.4 decodes 0x00 as infinity, but §3.2.2 public-key validation\n    // rejects infinity. We therefore keep 0x00 rejected by default because callers\n    // reuse this parser as the strict public-key boundary, and only admit it when\n    // the curve explicitly opts into infinity as a public point value. secp256k1\n    // crosstests show OpenSSL raw point codecs accept 0x00 too.\n    // No actual validation is done here: use .assertValidity()\n    if (length === comp && (head === 0x02 || head === 0x03)) {\n      const x = Fp.fromBytes(tail);\n      if (!Fp.isValid(x)) throw new Error('bad point: is not on curve, wrong x');\n      const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n      let y: T;\n      try {\n        y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n      } catch (sqrtError) {\n        const err = sqrtError instanceof Error ? ': ' + sqrtError.message : '';\n        throw new Error('bad point: is not on curve, sqrt error' + err);\n      }\n      assertCompressionIsSupported();\n      const evenY = Fp.isOdd!(y);\n      const evenH = (head & 1) === 1; // ECDSA-specific\n      if (evenH !== evenY) y = Fp.neg(y);\n      return { x, y };\n    } else if (length === uncomp && head === 0x04) {\n      // TODO: more checks\n      const L = Fp.BYTES;\n      const x = Fp.fromBytes(tail.subarray(0, L));\n      const y = Fp.fromBytes(tail.subarray(L, L * 2));\n      if (!isValidXY(x, y)) throw new Error('bad point: is not on curve');\n      return { x, y };\n    } else {\n      throw new Error(\n        `bad point: got length ${length}, expected compressed=${comp} or uncompressed=${uncomp}`\n      );\n    }\n  }\n\n  const encodePoint = extraOpts.toBytes === undefined ? pointToBytes : extraOpts.toBytes;\n  const decodePoint = extraOpts.fromBytes === undefined ? pointFromBytes : extraOpts.fromBytes;\n  function weierstrassEquation(x: T): T {\n    const x2 = Fp.sqr(x); // x * x\n    const x3 = Fp.mul(x2, x); // x² * x\n    return Fp.add(Fp.add(x3, Fp.mul(x, CURVE.a)), CURVE.b); // x³ + a * x + b\n  }\n\n  // TODO: move top-level\n  /** Checks whether equation holds for given x, y: y² == x³ + ax + b */\n  function isValidXY(x: T, y: T): boolean {\n    const left = Fp.sqr(y); // y²\n    const right = weierstrassEquation(x); // x³ + ax + b\n    return Fp.eql(left, right);\n  }\n\n  // Keep constructor-time generator validation cheap: callers are responsible for supplying the\n  // correct prime-order base point, while eager subgroup checks here would slow heavy module imports.\n  // Test 1: equation y² = x³ + ax + b should work for generator point.\n  if (!isValidXY(CURVE.Gx, CURVE.Gy)) throw new Error('bad curve params: generator point');\n\n  // Test 2: discriminant Δ part should be non-zero: 4a³ + 27b² != 0.\n  // Guarantees curve is genus-1, smooth (non-singular).\n  const _4a3 = Fp.mul(Fp.pow(CURVE.a, _3n), _4n);\n  const _27b2 = Fp.mul(Fp.sqr(CURVE.b), BigInt(27));\n  if (Fp.is0(Fp.add(_4a3, _27b2))) throw new Error('bad curve params: a or b');\n\n  /** Asserts coordinate is valid: 0 <= n < Fp.ORDER. */\n  function acoord(title: string, n: T, banZero = false) {\n    if (!Fp.isValid(n) || (banZero && Fp.is0(n))) throw new Error(`bad point coordinate ${title}`);\n    return n;\n  }\n\n  function aprjpoint(other: unknown): asserts other is Point {\n    if (!(other instanceof Point)) throw new Error('Weierstrass Point expected');\n  }\n\n  function splitEndoScalarN(k: bigint) {\n    if (!endo || !endo.basises) throw new Error('no endo');\n    return _splitEndoScalar(k, endo.basises, Fn.ORDER);\n  }\n\n  function finishEndo(\n    endoBeta: EndomorphismOpts['beta'],\n    k1p: Point,\n    k2p: Point,\n    k1neg: boolean,\n    k2neg: boolean\n  ) {\n    k2p = new Point(Fp.mul(k2p.X, endoBeta), k2p.Y, k2p.Z);\n    k1p = negateCt(k1neg, k1p);\n    k2p = negateCt(k2neg, k2p);\n    return k1p.add(k2p);\n  }\n\n  /**\n   * Projective Point works in 3d / projective (homogeneous) coordinates:(X, Y, Z) ∋ (x=X/Z, y=Y/Z).\n   * Default Point works in 2d / affine coordinates: (x, y).\n   * We're doing calculations in projective, because its operations don't require costly inversion.\n   */\n  class Point implements WeierstrassPoint<T> {\n    // base / generator point\n    static readonly BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    // zero / infinity / identity point\n    static readonly ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO); // 0, 1, 0\n    // math field\n    static readonly Fp = Fp;\n    // scalar field\n    static readonly Fn = Fn;\n\n    readonly X: T;\n    readonly Y: T;\n    readonly Z: T;\n\n    /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n    constructor(X: T, Y: T, Z: T) {\n      this.X = acoord('x', X);\n      // This is not just about ZERO / infinity: ambient curves can have real\n      // finite points with y=0. Those points are 2-torsion, so they cannot lie\n      // in the odd prime-order subgroups this point type is meant to represent.\n      this.Y = acoord('y', Y, true);\n      this.Z = acoord('z', Z);\n      Object.freeze(this);\n    }\n\n    static CURVE(): WeierstrassOpts<T> {\n      return CURVE;\n    }\n\n    /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n    static fromAffine(p: AffinePoint<T>): Point {\n      const { x, y } = p || {};\n      if (!p || !Fp.isValid(x) || !Fp.isValid(y)) throw new Error('invalid affine point');\n      if (p instanceof Point) throw new Error('projective point not allowed');\n      // (0, 0) would've produced (0, 0, 1) - instead, we need (0, 1, 0)\n      if (Fp.is0(x) && Fp.is0(y)) return Point.ZERO;\n      return new Point(x, y, Fp.ONE);\n    }\n\n    static fromBytes(bytes: TArg<Uint8Array>): Point {\n      const P = Point.fromAffine(decodePoint(abytes(bytes, undefined, 'point')));\n      P.assertValidity();\n      return P;\n    }\n\n    static fromHex(hex: string): Point {\n      return Point.fromBytes(hexToBytes(hex));\n    }\n\n    get x(): T {\n      return this.toAffine().x;\n    }\n    get y(): T {\n      return this.toAffine().y;\n    }\n\n    /**\n     *\n     * @param windowSize\n     * @param isLazy - true will defer table computation until the first multiplication\n     * @returns\n     */\n    precompute(windowSize: number = 8, isLazy = true): Point {\n      wnaf.createCache(this, windowSize);\n      if (!isLazy) this.multiply(_3n); // random number\n      return this;\n    }\n\n    // TODO: return `this`\n    /** A point on curve is valid if it conforms to equation. */\n    assertValidity(): void {\n      const p = this;\n      if (p.is0()) {\n        // (0, 1, 0) aka ZERO is invalid in most contexts.\n        // In BLS, ZERO can be serialized, so we allow it.\n        // Keep the accepted infinity encoding canonical: projective-equivalent (X, Y, 0) points\n        // like (1, 1, 0) compare equal to ZERO, but only (0, 1, 0) should pass this guard.\n        if (extraOpts.allowInfinityPoint && Fp.is0(p.X) && Fp.eql(p.Y, Fp.ONE) && Fp.is0(p.Z))\n          return;\n        throw new Error('bad point: ZERO');\n      }\n      // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n      const { x, y } = p.toAffine();\n      if (!Fp.isValid(x) || !Fp.isValid(y)) throw new Error('bad point: x or y not field elements');\n      if (!isValidXY(x, y)) throw new Error('bad point: equation left != right');\n      if (!p.isTorsionFree()) throw new Error('bad point: not in prime-order subgroup');\n    }\n\n    hasEvenY(): boolean {\n      const { y } = this.toAffine();\n      if (!Fp.isOdd) throw new Error(\"Field doesn't support isOdd\");\n      return !Fp.isOdd(y);\n    }\n\n    /** Compare one point to another. */\n    equals(other: WeierstrassPoint<T>): boolean {\n      aprjpoint(other);\n      const { X: X1, Y: Y1, Z: Z1 } = this;\n      const { X: X2, Y: Y2, Z: Z2 } = other;\n      const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n      const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n      return U1 && U2;\n    }\n\n    /** Flips point to one corresponding to (x, -y) in Affine coordinates. */\n    negate(): Point {\n      return new Point(this.X, Fp.neg(this.Y), this.Z);\n    }\n\n    // Renes-Costello-Batina exception-free doubling formula.\n    // There is 30% faster Jacobian formula, but it is not complete.\n    // https://eprint.iacr.org/2015/1060, algorithm 3\n    // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n    double() {\n      const { a, b } = CURVE;\n      const b3 = Fp.mul(b, _3n);\n      const { X: X1, Y: Y1, Z: Z1 } = this;\n      let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n      let t0 = Fp.mul(X1, X1); // step 1\n      let t1 = Fp.mul(Y1, Y1);\n      let t2 = Fp.mul(Z1, Z1);\n      let t3 = Fp.mul(X1, Y1);\n      t3 = Fp.add(t3, t3); // step 5\n      Z3 = Fp.mul(X1, Z1);\n      Z3 = Fp.add(Z3, Z3);\n      X3 = Fp.mul(a, Z3);\n      Y3 = Fp.mul(b3, t2);\n      Y3 = Fp.add(X3, Y3); // step 10\n      X3 = Fp.sub(t1, Y3);\n      Y3 = Fp.add(t1, Y3);\n      Y3 = Fp.mul(X3, Y3);\n      X3 = Fp.mul(t3, X3);\n      Z3 = Fp.mul(b3, Z3); // step 15\n      t2 = Fp.mul(a, t2);\n      t3 = Fp.sub(t0, t2);\n      t3 = Fp.mul(a, t3);\n      t3 = Fp.add(t3, Z3);\n      Z3 = Fp.add(t0, t0); // step 20\n      t0 = Fp.add(Z3, t0);\n      t0 = Fp.add(t0, t2);\n      t0 = Fp.mul(t0, t3);\n      Y3 = Fp.add(Y3, t0);\n      t2 = Fp.mul(Y1, Z1); // step 25\n      t2 = Fp.add(t2, t2);\n      t0 = Fp.mul(t2, t3);\n      X3 = Fp.sub(X3, t0);\n      Z3 = Fp.mul(t2, t1);\n      Z3 = Fp.add(Z3, Z3); // step 30\n      Z3 = Fp.add(Z3, Z3);\n      return new Point(X3, Y3, Z3);\n    }\n\n    // Renes-Costello-Batina exception-free addition formula.\n    // There is 30% faster Jacobian formula, but it is not complete.\n    // https://eprint.iacr.org/2015/1060, algorithm 1\n    // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n    add(other: WeierstrassPoint<T>): Point {\n      aprjpoint(other);\n      const { X: X1, Y: Y1, Z: Z1 } = this;\n      const { X: X2, Y: Y2, Z: Z2 } = other;\n      let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n      const a = CURVE.a;\n      const b3 = Fp.mul(CURVE.b, _3n);\n      let t0 = Fp.mul(X1, X2); // step 1\n      let t1 = Fp.mul(Y1, Y2);\n      let t2 = Fp.mul(Z1, Z2);\n      let t3 = Fp.add(X1, Y1);\n      let t4 = Fp.add(X2, Y2); // step 5\n      t3 = Fp.mul(t3, t4);\n      t4 = Fp.add(t0, t1);\n      t3 = Fp.sub(t3, t4);\n      t4 = Fp.add(X1, Z1);\n      let t5 = Fp.add(X2, Z2); // step 10\n      t4 = Fp.mul(t4, t5);\n      t5 = Fp.add(t0, t2);\n      t4 = Fp.sub(t4, t5);\n      t5 = Fp.add(Y1, Z1);\n      X3 = Fp.add(Y2, Z2); // step 15\n      t5 = Fp.mul(t5, X3);\n      X3 = Fp.add(t1, t2);\n      t5 = Fp.sub(t5, X3);\n      Z3 = Fp.mul(a, t4);\n      X3 = Fp.mul(b3, t2); // step 20\n      Z3 = Fp.add(X3, Z3);\n      X3 = Fp.sub(t1, Z3);\n      Z3 = Fp.add(t1, Z3);\n      Y3 = Fp.mul(X3, Z3);\n      t1 = Fp.add(t0, t0); // step 25\n      t1 = Fp.add(t1, t0);\n      t2 = Fp.mul(a, t2);\n      t4 = Fp.mul(b3, t4);\n      t1 = Fp.add(t1, t2);\n      t2 = Fp.sub(t0, t2); // step 30\n      t2 = Fp.mul(a, t2);\n      t4 = Fp.add(t4, t2);\n      t0 = Fp.mul(t1, t4);\n      Y3 = Fp.add(Y3, t0);\n      t0 = Fp.mul(t5, t4); // step 35\n      X3 = Fp.mul(t3, X3);\n      X3 = Fp.sub(X3, t0);\n      t0 = Fp.mul(t3, t1);\n      Z3 = Fp.mul(t5, Z3);\n      Z3 = Fp.add(Z3, t0); // step 40\n      return new Point(X3, Y3, Z3);\n    }\n\n    subtract(other: WeierstrassPoint<T>) {\n      // Validate before calling `negate()` so wrong inputs fail with the point guard\n      // instead of leaking a foreign `negate()` error.\n      aprjpoint(other);\n      return this.add(other.negate());\n    }\n\n    is0(): boolean {\n      return this.equals(Point.ZERO);\n    }\n\n    /**\n     * Constant time multiplication.\n     * Uses wNAF method. Windowed method may be 10% faster,\n     * but takes 2x longer to generate and consumes 2x memory.\n     * Uses precomputes when available.\n     * Uses endomorphism for Koblitz curves.\n     * @param scalar - by which the point would be multiplied\n     * @returns New point\n     */\n    multiply(scalar: bigint): Point {\n      const { endo } = extraOpts;\n      // Keep the subgroup-scalar contract strict instead of reducing 0 / n to ZERO.\n      // In key/signature-style callers, those values usually mean broken hash/scalar plumbing,\n      // and failing closed is safer than silently producing the identity point.\n      if (!Fn.isValidNot0(scalar)) throw new RangeError('invalid scalar: out of range'); // 0 is invalid\n      let point: Point, fake: Point; // Fake point is used to const-time mult\n      const mul = (n: bigint) => wnaf.cached(this, n, (p) => normalizeZ(Point, p));\n      /** See docs for {@link EndomorphismOpts} */\n      if (endo) {\n        const { k1neg, k1, k2neg, k2 } = splitEndoScalarN(scalar);\n        const { p: k1p, f: k1f } = mul(k1);\n        const { p: k2p, f: k2f } = mul(k2);\n        fake = k1f.add(k2f);\n        point = finishEndo(endo.beta, k1p, k2p, k1neg, k2neg);\n      } else {\n        const { p, f } = mul(scalar);\n        point = p;\n        fake = f;\n      }\n      // Normalize `z` for both points, but return only real one\n      return normalizeZ(Point, [point, fake])[0];\n    }\n\n    /**\n     * Non-constant-time multiplication. Uses double-and-add algorithm.\n     * It's faster, but should only be used when you don't care about\n     * an exposed secret key e.g. sig verification, which works over *public* keys.\n     */\n    multiplyUnsafe(scalar: bigint): Point {\n      const { endo } = extraOpts;\n      const p = this as Point;\n      const sc = scalar;\n      // Public-scalar callers may need 0, but n and larger values stay rejected here too.\n      // Reducing them mod n would turn bad caller input into an accidental identity point.\n      if (!Fn.isValid(sc)) throw new RangeError('invalid scalar: out of range'); // 0 is valid\n      if (sc === _0n || p.is0()) return Point.ZERO; // 0\n      if (sc === _1n) return p; // 1\n      if (wnaf.hasCache(this)) return this.multiply(sc); // precomputes\n      // We don't have method for double scalar multiplication (aP + bQ):\n      // Even with using Strauss-Shamir trick, it's 35% slower than naïve mul+add.\n      if (endo) {\n        const { k1neg, k1, k2neg, k2 } = splitEndoScalarN(sc);\n        const { p1, p2 } = mulEndoUnsafe(Point, p, k1, k2); // 30% faster vs wnaf.unsafe\n        return finishEndo(endo.beta, p1, p2, k1neg, k2neg);\n      } else {\n        return wnaf.unsafe(p, sc);\n      }\n    }\n\n    /**\n     * Converts Projective point to affine (x, y) coordinates.\n     * (X, Y, Z) ∋ (x=X/Z, y=Y/Z).\n     * @param invertedZ - Z^-1 (inverted zero) - optional, precomputation is useful for invertBatch\n     */\n    toAffine(invertedZ?: T): AffinePoint<T> {\n      const p = this;\n      let iz = invertedZ;\n      const { X, Y, Z } = p;\n      // Fast-path for normalized points\n      if (Fp.eql(Z, Fp.ONE)) return { x: X, y: Y };\n      const is0 = p.is0();\n      // If invZ was 0, we return zero point. However we still want to execute\n      // all operations, so we replace invZ with a random number, 1.\n      if (iz == null) iz = is0 ? Fp.ONE : Fp.inv(Z);\n      const x = Fp.mul(X, iz);\n      const y = Fp.mul(Y, iz);\n      const zz = Fp.mul(Z, iz);\n      if (is0) return { x: Fp.ZERO, y: Fp.ZERO };\n      if (!Fp.eql(zz, Fp.ONE)) throw new Error('invZ was invalid');\n      return { x, y };\n    }\n\n    /**\n     * Checks whether Point is free of torsion elements (is in prime subgroup).\n     * Always torsion-free for cofactor=1 curves.\n     */\n    isTorsionFree(): boolean {\n      const { isTorsionFree } = extraOpts;\n      if (cofactor === _1n) return true;\n      if (isTorsionFree) return isTorsionFree(Point, this);\n      return wnaf.unsafe(this, CURVE_ORDER).is0();\n    }\n\n    clearCofactor(): Point {\n      const { clearCofactor } = extraOpts;\n      if (cofactor === _1n) return this; // Fast-path\n      if (clearCofactor) return clearCofactor(Point, this) as Point;\n      // Default fallback assumes the cofactor fits the usual subgroup-scalar\n      // multiplyUnsafe() contract. Curves with larger / structured cofactors\n      // should define a clearCofactor override anyway (e.g. psi/Frobenius maps).\n      return this.multiplyUnsafe(cofactor);\n    }\n\n    isSmallOrder(): boolean {\n      if (cofactor === _1n) return this.is0(); // Fast-path\n      return this.clearCofactor().is0();\n    }\n\n    toBytes(isCompressed = true): TRet<Uint8Array> {\n      abool(isCompressed, 'isCompressed');\n      // Same policy as pointFromBytes(): keep ZERO out of the default byte surface because\n      // callers use these encodings as public keys, where SEC 1 validation rejects infinity.\n      this.assertValidity();\n      return encodePoint(Point, this, isCompressed);\n    }\n\n    toHex(isCompressed = true): string {\n      return bytesToHex(this.toBytes(isCompressed));\n    }\n\n    toString() {\n      return `<Point ${this.is0() ? 'ZERO' : this.toHex()}>`;\n    }\n  }\n  const bits = Fn.BITS;\n  const wnaf = new wNAF(Point, extraOpts.endo ? Math.ceil(bits / 2) : bits);\n  // Tiny toy curves can have scalar fields narrower than 8 bits. Skip the\n  // eager W=8 cache there instead of rejecting an otherwise valid constructor.\n  if (bits >= 8) Point.BASE.precompute(8); // Enable precomputes. Slows down first publicKey computation by 20ms.\n  Object.freeze(Point.prototype);\n  Object.freeze(Point);\n  return Point;\n}\n\n/** Parsed ECDSA signature with helpers for recovery and re-encoding. */\nexport interface ECDSASignature {\n  /** Signature component `r`. */\n  readonly r: bigint;\n  /** Signature component `s`. */\n  readonly s: bigint;\n  /** Optional recovery bit for recoverable signatures. */\n  readonly recovery?: number;\n  /**\n   * Return a copy of the signature with a recovery bit attached.\n   * @param recovery - Recovery bit to attach.\n   * @returns Signature with an attached recovery bit.\n   */\n  addRecoveryBit(recovery: number): ECDSASignature & { readonly recovery: number };\n  /**\n   * Check whether the signature uses the high-S half-order.\n   * @returns Whether the signature uses the high-S half-order.\n   */\n  hasHighS(): boolean;\n  /**\n   * Recover the public key from the hashed message and recovery bit.\n   * @param messageHash - Hashed message bytes.\n   * @returns Recovered public-key point.\n   */\n  recoverPublicKey(messageHash: TArg<Uint8Array>): WeierstrassPoint<bigint>;\n  /**\n   * Encode the signature into bytes.\n   * @param format - Signature encoding to produce.\n   * @returns Encoded signature bytes.\n   */\n  toBytes(format?: string): TRet<Uint8Array>;\n  /**\n   * Encode the signature into hex.\n   * @param format - Signature encoding to produce.\n   * @returns Encoded signature hex.\n   */\n  toHex(format?: string): string;\n}\n/** Constructor and decoding helpers for ECDSA signatures. */\nexport type ECDSASignatureCons = {\n  /** Create a signature from `r`, `s`, and an optional recovery bit. */\n  new (r: bigint, s: bigint, recovery?: number): ECDSASignature;\n  /**\n   * Decode a signature from bytes.\n   * @param bytes - Encoded signature bytes.\n   * @param format - Signature encoding to parse.\n   * @returns Parsed signature.\n   */\n  fromBytes(bytes: TArg<Uint8Array>, format?: ECDSASignatureFormat): ECDSASignature;\n  /**\n   * Decode a signature from hex.\n   * @param hex - Encoded signature hex.\n   * @param format - Signature encoding to parse.\n   * @returns Parsed signature.\n   */\n  fromHex(hex: string, format?: ECDSASignatureFormat): ECDSASignature;\n};\n\n// Points start with byte 0x02 when y is even; otherwise 0x03\nfunction pprefix(hasEvenY: boolean): TRet<Uint8Array> {\n  return Uint8Array.of(hasEvenY ? 0x02 : 0x03) as TRet<Uint8Array>;\n}\n\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * RFC 9380 expects callers to provide `v != 0`; this helper does not enforce it.\n * @param Fp - Field implementation.\n * @param Z - Simplified SWU map parameter.\n * @returns Square-root ratio helper.\n * @example\n * Build the square-root ratio helper used by SWU map implementations.\n *\n * ```ts\n * import { SWUFpSqrtRatio } from '@noble/curves/abstract/weierstrass.js';\n * import { Field } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const sqrtRatio = SWUFpSqrtRatio(Fp, 3n);\n * const out = sqrtRatio(4n, 1n);\n * ```\n */\nexport function SWUFpSqrtRatio<T>(\n  Fp: TArg<IField<T>>,\n  Z: T\n): (u: T, v: T) => { isValid: boolean; value: T } {\n  // Fail with the usual field-shape error before touching pow/cmov on malformed field shims.\n  const F = validateField(Fp as IField<T>) as IField<T>;\n  // Generic implementation\n  const q = F.ORDER;\n  let l = _0n;\n  for (let o = q - _1n; o % _2n === _0n; o /= _2n) l += _1n;\n  const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n  // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n  // 2n ** c1 == 2n << (c1-1)\n  const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n  const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n  const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1)  # Integer arithmetic\n  const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2            # Integer arithmetic\n  const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1                # Integer arithmetic\n  const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1)                  # Integer arithmetic\n  const c6 = F.pow(Z, c2); // 6. c6 = Z^c2\n  const c7 = F.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n  // RFC 9380 Appendix F.2.1.1 defines sqrt_ratio(u, v) only for v != 0.\n  // We keep v=0 on the regular result path with isValid=false instead of\n  // throwing so the helper stays closer to the RFC's fixed control flow.\n  let sqrtRatio = (u: T, v: T): { isValid: boolean; value: T } => {\n    let tv1 = c6; // 1. tv1 = c6\n    let tv2 = F.pow(v, c4); // 2. tv2 = v^c4\n    let tv3 = F.sqr(tv2); // 3. tv3 = tv2^2\n    tv3 = F.mul(tv3, v); // 4. tv3 = tv3 * v\n    let tv5 = F.mul(u, tv3); // 5. tv5 = u * tv3\n    tv5 = F.pow(tv5, c3); // 6. tv5 = tv5^c3\n    tv5 = F.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n    tv2 = F.mul(tv5, v); // 8. tv2 = tv5 * v\n    tv3 = F.mul(tv5, u); // 9. tv3 = tv5 * u\n    let tv4 = F.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n    tv5 = F.pow(tv4, c5); // 11. tv5 = tv4^c5\n    let isQR = F.eql(tv5, F.ONE); // 12. isQR = tv5 == 1\n    tv2 = F.mul(tv3, c7); // 13. tv2 = tv3 * c7\n    tv5 = F.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n    tv3 = F.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n    tv4 = F.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n    // 17. for i in (c1, c1 - 1, ..., 2):\n    for (let i = c1; i > _1n; i--) {\n      let tv5 = i - _2n; // 18.    tv5 = i - 2\n      tv5 = _2n << (tv5 - _1n); // 19.    tv5 = 2^tv5\n      let tvv5 = F.pow(tv4, tv5); // 20.    tv5 = tv4^tv5\n      const e1 = F.eql(tvv5, F.ONE); // 21.    e1 = tv5 == 1\n      tv2 = F.mul(tv3, tv1); // 22.    tv2 = tv3 * tv1\n      tv1 = F.mul(tv1, tv1); // 23.    tv1 = tv1 * tv1\n      tvv5 = F.mul(tv4, tv1); // 24.    tv5 = tv4 * tv1\n      tv3 = F.cmov(tv2, tv3, e1); // 25.    tv3 = CMOV(tv2, tv3, e1)\n      tv4 = F.cmov(tvv5, tv4, e1); // 26.    tv4 = CMOV(tv5, tv4, e1)\n    }\n    // RFC 9380 Appendix F.2.1.1 defines sqrt_ratio(u, v) for v != 0.\n    // When u = 0 and v != 0, u / v = 0 is square and the computed root is\n    // still 0, so widen only the final flag and keep the full control flow.\n    return { isValid: !F.is0(v) && (isQR || F.is0(u)), value: tv3 };\n  };\n  if (F.ORDER % _4n === _3n) {\n    // sqrt_ratio_3mod4(u, v)\n    const c1 = (F.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4     # Integer arithmetic\n    const c2 = F.sqrt(F.neg(Z)); // 2. c2 = sqrt(-Z)\n    sqrtRatio = (u: T, v: T) => {\n      let tv1 = F.sqr(v); // 1. tv1 = v^2\n      const tv2 = F.mul(u, v); // 2. tv2 = u * v\n      tv1 = F.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n      let y1 = F.pow(tv1, c1); // 4. y1 = tv1^c1\n      y1 = F.mul(y1, tv2); // 5. y1 = y1 * tv2\n      const y2 = F.mul(y1, c2); // 6. y2 = y1 * c2\n      const tv3 = F.mul(F.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n      const isQR = F.eql(tv3, u); // 9. isQR = tv3 == u\n      let y = F.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n      return { isValid: !F.is0(v) && isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n    };\n  }\n  // No curves uses that\n  // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n  return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * See {@link https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2 | RFC 9380 section 6.6.2}.\n * @param Fp - Field implementation.\n * @param opts - SWU parameters:\n *   - `A`: Curve parameter `A`.\n *   - `B`: Curve parameter `B`.\n *   - `Z`: Simplified SWU map parameter.\n * @returns Deterministic map-to-curve function.\n * @throws If the SWU parameters are invalid or the field lacks the required helpers. {@link Error}\n * @example\n * Map one field element to a Weierstrass curve point with the SWU recipe.\n *\n * ```ts\n * import { mapToCurveSimpleSWU } from '@noble/curves/abstract/weierstrass.js';\n * import { Field } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const map = mapToCurveSimpleSWU(Fp, { A: 1n, B: 2n, Z: 3n });\n * const point = map(5n);\n * ```\n */\nexport function mapToCurveSimpleSWU<T>(\n  Fp: TArg<IField<T>>,\n  opts: {\n    A: T;\n    B: T;\n    Z: T;\n  }\n): (u: T) => { x: T; y: T } {\n  const F = validateField(Fp as IField<T>) as IField<T>;\n  const { A, B, Z } = opts;\n  if (!F.isValidNot0(A) || !F.isValidNot0(B) || !F.isValid(Z))\n    throw new Error('mapToCurveSimpleSWU: invalid opts');\n  // RFC 9380 §6.6.2 and Appendix H.2 require:\n  // 1. Z is non-square in F\n  // 2. Z != -1 in F\n  // 3. g(x) - Z is irreducible over F\n  // 4. g(B / (Z * A)) is square in F\n  // We can enforce 1, 2, and 4 with the current field API.\n  // Criterion 3 is not checked here because generic `IField<T>` does not expose\n  // polynomial-ring / irreducibility operations, and this helper is used for\n  // both prime and extension fields.\n  if (F.eql(Z, F.neg(F.ONE)) || FpIsSquare(F, Z))\n    throw new Error('mapToCurveSimpleSWU: invalid opts');\n  // RFC 9380 Appendix H.2 criterion 4: g(B / (Z * A)) is square in F.\n  // x = B / (Z * A)\n  const x = F.mul(B, F.inv(F.mul(Z, A)));\n  // g(x) = x^3 + A*x + B\n  const gx = F.add(F.add(F.mul(F.sqr(x), x), F.mul(A, x)), B);\n  if (!FpIsSquare(F, gx)) throw new Error('mapToCurveSimpleSWU: invalid opts');\n  const sqrtRatio = SWUFpSqrtRatio(F, Z);\n  if (!F.isOdd) throw new Error('Field does not have .isOdd()');\n  // Input: u, an element of F.\n  // Output: (x, y), a point on E.\n  return (u: T): { x: T; y: T } => {\n    // prettier-ignore\n    let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n    tv1 = F.sqr(u); // 1.  tv1 = u^2\n    tv1 = F.mul(tv1, Z); // 2.  tv1 = Z * tv1\n    tv2 = F.sqr(tv1); // 3.  tv2 = tv1^2\n    tv2 = F.add(tv2, tv1); // 4.  tv2 = tv2 + tv1\n    tv3 = F.add(tv2, F.ONE); // 5.  tv3 = tv2 + 1\n    tv3 = F.mul(tv3, B); // 6.  tv3 = B * tv3\n    tv4 = F.cmov(Z, F.neg(tv2), !F.eql(tv2, F.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n    tv4 = F.mul(tv4, A); // 8.  tv4 = A * tv4\n    tv2 = F.sqr(tv3); // 9.  tv2 = tv3^2\n    tv6 = F.sqr(tv4); // 10. tv6 = tv4^2\n    tv5 = F.mul(tv6, A); // 11. tv5 = A * tv6\n    tv2 = F.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n    tv2 = F.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n    tv6 = F.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n    tv5 = F.mul(tv6, B); // 15. tv5 = B * tv6\n    tv2 = F.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n    x = F.mul(tv1, tv3); // 17.   x = tv1 * tv3\n    const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n    y = F.mul(tv1, u); // 19.   y = tv1 * u  -> Z * u^3 * y1\n    y = F.mul(y, value); // 20.   y = y * y1\n    x = F.cmov(x, tv3, isValid); // 21.   x = CMOV(x, tv3, is_gx1_square)\n    y = F.cmov(y, value, isValid); // 22.   y = CMOV(y, y1, is_gx1_square)\n    const e1 = F.isOdd!(u) === F.isOdd!(y); // 23.  e1 = sgn0(u) == sgn0(y)\n    y = F.cmov(F.neg(y), y, e1); // 24.   y = CMOV(-y, y, e1)\n    const tv4_inv = FpInvertBatch(F, [tv4], true)[0];\n    x = F.mul(x, tv4_inv); // 25.   x = x / tv4\n    return { x, y };\n  };\n}\n\nfunction getWLengths<T>(Fp: TArg<IField<T>>, Fn: TArg<IField<bigint>>) {\n  return {\n    secretKey: Fn.BYTES,\n    publicKey: 1 + Fp.BYTES,\n    publicKeyUncompressed: 1 + 2 * Fp.BYTES,\n    publicKeyHasPrefix: true,\n    // Raw compact `(r || s)` signature width; DER and recovered signatures use\n    // different lengths outside this helper.\n    signature: 2 * Fn.BYTES,\n  };\n}\n\n/**\n * Sometimes users only need getPublicKey, getSharedSecret, and secret key handling.\n * This helper ensures no signature functionality is present. Less code, smaller bundle size.\n * @param Point - Weierstrass point constructor.\n * @param ecdhOpts - Optional randomness helpers:\n *   - `randomBytes` (optional): Optional RNG override.\n * @returns ECDH helper namespace.\n * @example\n * Sometimes users only need getPublicKey, getSharedSecret, and secret key handling.\n *\n * ```ts\n * import { ecdh } from '@noble/curves/abstract/weierstrass.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const dh = ecdh(p256.Point);\n * const alice = dh.keygen();\n * const shared = dh.getSharedSecret(alice.secretKey, alice.publicKey);\n * ```\n */\nexport function ecdh(\n  Point: WeierstrassPointCons<bigint>,\n  ecdhOpts: TArg<{ randomBytes?: (bytesLength?: number) => TRet<Uint8Array> }> = {}\n): ECDH {\n  const { Fn } = Point;\n  const randomBytes_ = ecdhOpts.randomBytes === undefined ? wcRandomBytes : ecdhOpts.randomBytes;\n  // Keep the advertised seed length aligned with mapHashToField(), which keeps a hard 16-byte\n  // minimum even on toy curves.\n  const lengths = Object.assign(getWLengths(Point.Fp, Fn), {\n    seed: Math.max(getMinHashLength(Fn.ORDER), 16),\n  });\n\n  function isValidSecretKey(secretKey: TArg<Uint8Array>) {\n    try {\n      const num = Fn.fromBytes(secretKey);\n      return Fn.isValidNot0(num);\n    } catch (error) {\n      return false;\n    }\n  }\n\n  function isValidPublicKey(publicKey: TArg<Uint8Array>, isCompressed?: boolean): boolean {\n    const { publicKey: comp, publicKeyUncompressed } = lengths;\n    try {\n      const l = publicKey.length;\n      if (isCompressed === true && l !== comp) return false;\n      if (isCompressed === false && l !== publicKeyUncompressed) return false;\n      return !!Point.fromBytes(publicKey);\n    } catch (error) {\n      return false;\n    }\n  }\n\n  /**\n   * Produces cryptographically secure secret key from random of size\n   * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n   */\n  function randomSecretKey(seed?: TArg<Uint8Array>): TRet<Uint8Array> {\n    seed = seed === undefined ? randomBytes_(lengths.seed) : seed;\n    return mapHashToField(abytes(seed, lengths.seed, 'seed'), Fn.ORDER) as TRet<Uint8Array>;\n  }\n\n  /**\n   * Computes public key for a secret key. Checks for validity of the secret key.\n   * @param isCompressed - whether to return compact (default), or full key\n   * @returns Public key, full when isCompressed=false; short when isCompressed=true\n   */\n  function getPublicKey(secretKey: TArg<Uint8Array>, isCompressed = true): TRet<Uint8Array> {\n    return Point.BASE.multiply(Fn.fromBytes(secretKey)).toBytes(isCompressed);\n  }\n\n  /**\n   * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n   */\n  function isProbPub(item: TArg<Uint8Array>): boolean | undefined {\n    const { secretKey, publicKey, publicKeyUncompressed } = lengths;\n    const allowedLengths = (Fn as { _lengths?: readonly number[] })._lengths;\n    if (!isBytes(item)) return undefined;\n    const l = abytes(item, undefined, 'key').length;\n    const isPub = l === publicKey || l === publicKeyUncompressed;\n    const isSec = l === secretKey || !!allowedLengths?.includes(l);\n    // P-521 accepts both 65- and 66-byte secret keys, so overlapping lengths stay ambiguous.\n    if (isPub && isSec) return undefined;\n    return isPub;\n  }\n\n  /**\n   * ECDH (Elliptic Curve Diffie Hellman).\n   * Computes encoded shared point from secret key A and public key B.\n   * Checks: 1) secret key validity 2) shared key is on-curve.\n   * Does NOT hash the result or expose the SEC 1 x-coordinate-only `z`.\n   * Returns the encoded shared point on purpose: callers that need `x_P`\n   * can derive it from the encoded point, but `x_P` alone cannot recover the\n   * point/parity back.\n   * This helper only exposes the fully validated public-key path, not cofactor DH.\n   * @param isCompressed - whether to return compact (default), or full key\n   * @returns shared point encoding\n   */\n  function getSharedSecret(\n    secretKeyA: TArg<Uint8Array>,\n    publicKeyB: TArg<Uint8Array>,\n    isCompressed = true\n  ): TRet<Uint8Array> {\n    if (isProbPub(secretKeyA) === true) throw new Error('first arg must be private key');\n    if (isProbPub(publicKeyB) === false) throw new Error('second arg must be public key');\n    const s = Fn.fromBytes(secretKeyA);\n    const b = Point.fromBytes(publicKeyB); // checks for being on-curve\n    return b.multiply(s).toBytes(isCompressed);\n  }\n\n  const utils = {\n    isValidSecretKey,\n    isValidPublicKey,\n    randomSecretKey,\n  };\n  const keygen = createKeygen(randomSecretKey, getPublicKey);\n  Object.freeze(utils);\n  Object.freeze(lengths);\n\n  return Object.freeze({ getPublicKey, getSharedSecret, keygen, Point, utils, lengths });\n}\n\n/**\n * Creates ECDSA signing interface for given elliptic curve `Point` and `hash` function.\n *\n * @param Point - created using {@link weierstrass} function\n * @param hash - used for 1) message prehash-ing 2) k generation in `sign`, using hmac_drbg(hash)\n * @param ecdsaOpts - rarely needed, see {@link ECDSAOpts}:\n *   - `lowS`: Default low-S policy.\n *   - `hmac`: HMAC implementation used by RFC6979 DRBG.\n *   - `randomBytes`: Optional RNG override.\n *   - `bits2int`: Optional hash-to-int conversion override.\n *   - `bits2int_modN`: Optional hash-to-int-mod-n conversion override.\n *\n * @returns ECDSA helper namespace.\n * @example\n * Create an ECDSA signer/verifier bundle for one curve implementation.\n *\n * ```ts\n * import { ecdsa } from '@noble/curves/abstract/weierstrass.js';\n * import { p256 } from '@noble/curves/nist.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const p256ecdsa = ecdsa(p256.Point, sha256);\n * const { secretKey, publicKey } = p256ecdsa.keygen();\n * const msg = new TextEncoder().encode('hello noble');\n * const sig = p256ecdsa.sign(msg, secretKey);\n * const isValid = p256ecdsa.verify(sig, msg, publicKey);\n * ```\n */\nexport function ecdsa(\n  Point: WeierstrassPointCons<bigint>,\n  hash: TArg<CHash>,\n  ecdsaOpts: TArg<ECDSAOpts> = {}\n): ECDSA {\n  // Custom hash / bits2int hooks are treated as pure functions over validated caller-owned bytes.\n  const hash_ = hash as CHash;\n  ahash(hash_);\n  validateObject(\n    ecdsaOpts,\n    {},\n    {\n      hmac: 'function',\n      lowS: 'boolean',\n      randomBytes: 'function',\n      bits2int: 'function',\n      bits2int_modN: 'function',\n    }\n  );\n  ecdsaOpts = Object.assign({}, ecdsaOpts);\n  const randomBytes = ecdsaOpts.randomBytes === undefined ? wcRandomBytes : ecdsaOpts.randomBytes;\n  const hmac =\n    ecdsaOpts.hmac === undefined\n      ? (key: TArg<Uint8Array>, msg: TArg<Uint8Array>) => nobleHmac(hash_, key, msg)\n      : (ecdsaOpts.hmac as HmacFn);\n\n  const { Fp, Fn } = Point;\n  const { ORDER: CURVE_ORDER, BITS: fnBits } = Fn;\n  const { keygen, getPublicKey, getSharedSecret, utils, lengths } = ecdh(Point, ecdsaOpts);\n  const defaultSigOpts: Required<ECDSASignOpts> = {\n    prehash: true,\n    lowS: typeof ecdsaOpts.lowS === 'boolean' ? ecdsaOpts.lowS : true,\n    format: 'compact' as ECDSASignatureFormat,\n    extraEntropy: false,\n  };\n  // SEC 1 4.1.6 public-key recovery tries x = r + jn for j = 0..h. Our recovered-signature\n  // format only stores one overflow bit, so it can only distinguish q.x = r from q.x = r + n.\n  // A third lift would have the form q.x = r + 2n. Since valid ECDSA r is in 1..n-1, the\n  // smallest such lift is 1 + 2n, not 2n.\n  const hasLargeRecoveryLifts = CURVE_ORDER * _2n + _1n < Fp.ORDER;\n\n  function isBiggerThanHalfOrder(number: bigint) {\n    const HALF = CURVE_ORDER >> _1n;\n    return number > HALF;\n  }\n  function validateRS(title: string, num: bigint): bigint {\n    if (!Fn.isValidNot0(num))\n      throw new Error(`invalid signature ${title}: out of range 1..Point.Fn.ORDER`);\n    return num;\n  }\n  function assertRecoverableCurve(): void {\n    // ECDSA recovery only supports curves where the current recovery id can distinguish\n    // q.x = r and q.x = r + n; larger lifts may need additional `r + n*i` branches.\n    // SEC 1 4.1.6 recovers candidates via x = r + jn, but this format only encodes j = 0 or 1.\n    // The next possible candidate is q.x = r + 2n, and its smallest valid value is 1 + 2n.\n    // To easily get i, we either need to:\n    // a. increase amount of valid recid values (4, 5...); OR\n    // b. prohibit recovered signatures for those curves.\n    if (hasLargeRecoveryLifts)\n      throw new Error('\"recovered\" sig type is not supported for cofactor >2 curves');\n  }\n  function validateSigLength(bytes: TArg<Uint8Array>, format: ECDSASignatureFormat) {\n    validateSigFormat(format);\n    const size = lengths.signature!;\n    const sizer = format === 'compact' ? size : format === 'recovered' ? size + 1 : undefined;\n    return abytes(bytes, sizer);\n  }\n\n  /**\n   * ECDSA signature with its (r, s) properties. Supports compact, recovered & DER representations.\n   */\n  class Signature implements ECDSASignature {\n    readonly r: bigint;\n    readonly s: bigint;\n    readonly recovery?: number;\n\n    constructor(r: bigint, s: bigint, recovery?: number) {\n      this.r = validateRS('r', r); // r in [1..N-1];\n      this.s = validateRS('s', s); // s in [1..N-1];\n      if (recovery != null) {\n        assertRecoverableCurve();\n        if (![0, 1, 2, 3].includes(recovery)) throw new Error('invalid recovery id');\n        this.recovery = recovery;\n      }\n      Object.freeze(this);\n    }\n\n    static fromBytes(\n      bytes: TArg<Uint8Array>,\n      format: ECDSASignatureFormat = defaultSigOpts.format\n    ): Signature {\n      validateSigLength(bytes, format);\n      let recid: number | undefined;\n      if (format === 'der') {\n        const { r, s } = DER.toSig(abytes(bytes));\n        return new Signature(r, s);\n      }\n      if (format === 'recovered') {\n        recid = bytes[0];\n        format = 'compact';\n        bytes = bytes.subarray(1);\n      }\n      const L = lengths.signature! / 2;\n      const r = bytes.subarray(0, L);\n      const s = bytes.subarray(L, L * 2);\n      return new Signature(Fn.fromBytes(r), Fn.fromBytes(s), recid);\n    }\n\n    static fromHex(hex: string, format?: ECDSASignatureFormat) {\n      return this.fromBytes(hexToBytes(hex), format);\n    }\n\n    private assertRecovery(): number {\n      const { recovery } = this;\n      if (recovery == null) throw new Error('invalid recovery id: must be present');\n      return recovery;\n    }\n\n    addRecoveryBit(recovery: number): RecoveredSignature {\n      return new Signature(this.r, this.s, recovery) as RecoveredSignature;\n    }\n\n    // Unlike the top-level helper below, this method expects a digest that has\n    // already been hashed to the curve's message representative.\n    recoverPublicKey(messageHash: TArg<Uint8Array>): WeierstrassPoint<bigint> {\n      const { r, s } = this;\n      const recovery = this.assertRecovery();\n      const radj = recovery === 2 || recovery === 3 ? r + CURVE_ORDER : r;\n      if (!Fp.isValid(radj)) throw new Error('invalid recovery id: sig.r+curve.n != R.x');\n      const x = Fp.toBytes(radj);\n      const R = Point.fromBytes(concatBytes(pprefix((recovery & 1) === 0), x));\n      const ir = Fn.inv(radj); // r^-1\n      const h = bits2int_modN(abytes(messageHash, undefined, 'msgHash')); // Truncate hash\n      const u1 = Fn.create(-h * ir); // -hr^-1\n      const u2 = Fn.create(s * ir); // sr^-1\n      // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1). unsafe is fine: there is no private data.\n      const Q = Point.BASE.multiplyUnsafe(u1).add(R.multiplyUnsafe(u2));\n      if (Q.is0()) throw new Error('invalid recovery: point at infinify');\n      Q.assertValidity();\n      return Q;\n    }\n\n    // Signatures should be low-s, to prevent malleability.\n    hasHighS(): boolean {\n      return isBiggerThanHalfOrder(this.s);\n    }\n\n    toBytes(format: ECDSASignatureFormat = defaultSigOpts.format): TRet<Uint8Array> {\n      validateSigFormat(format);\n      if (format === 'der') return hexToBytes(DER.hexFromSig(this)) as TRet<Uint8Array>;\n      const { r, s } = this;\n      const rb = Fn.toBytes(r);\n      const sb = Fn.toBytes(s);\n      if (format === 'recovered') {\n        assertRecoverableCurve();\n        return concatBytes(Uint8Array.of(this.assertRecovery()), rb, sb) as TRet<Uint8Array>;\n      }\n      return concatBytes(rb, sb) as TRet<Uint8Array>;\n    }\n\n    toHex(format?: ECDSASignatureFormat) {\n      return bytesToHex(this.toBytes(format));\n    }\n  }\n  type RecoveredSignature = Signature & { recovery: number };\n  Object.freeze(Signature.prototype);\n  Object.freeze(Signature);\n\n  // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n  // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n  // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n  // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n  const bits2int: (bytes: TArg<Uint8Array>) => bigint =\n    ecdsaOpts.bits2int === undefined\n      ? function bits2int_def(bytes: TArg<Uint8Array>): bigint {\n          // Our custom check \"just in case\", for protection against DoS\n          if (bytes.length > 8192) throw new Error('input is too large');\n          // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n          // for some cases, since bytes.length * 8 is not actual bitLength.\n          const num = bytesToNumberBE(bytes); // check for == u8 done here\n          const delta = bytes.length * 8 - fnBits; // truncate to nBitLength leftmost bits\n          return delta > 0 ? num >> BigInt(delta) : num;\n        }\n      : (ecdsaOpts.bits2int as (bytes: TArg<Uint8Array>) => bigint);\n  const bits2int_modN: (bytes: TArg<Uint8Array>) => bigint =\n    ecdsaOpts.bits2int_modN === undefined\n      ? function bits2int_modN_def(bytes: TArg<Uint8Array>): bigint {\n          return Fn.create(bits2int(bytes)); // can't use bytesToNumberBE here\n        }\n      : (ecdsaOpts.bits2int_modN as (bytes: TArg<Uint8Array>) => bigint);\n  const ORDER_MASK = bitMask(fnBits);\n  // Pads output with zero as per spec.\n  /** Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`. */\n  function int2octets(num: bigint): TRet<Uint8Array> {\n    aInRange('num < 2^' + fnBits, num, _0n, ORDER_MASK);\n    return Fn.toBytes(num) as TRet<Uint8Array>;\n  }\n\n  function validateMsgAndHash(message: TArg<Uint8Array>, prehash: boolean): TRet<Uint8Array> {\n    abytes(message, undefined, 'message');\n    return (\n      prehash ? abytes(hash_(message), undefined, 'prehashed message') : message\n    ) as TRet<Uint8Array>;\n  }\n\n  /**\n   * Steps A, D of RFC6979 3.2.\n   * Creates RFC6979 seed; converts msg/privKey to numbers.\n   * Used only in sign, not in verify.\n   *\n   * Warning: we cannot assume here that message has same amount of bytes as curve order,\n   * this will be invalid at least for P521. Also it can be bigger for P224 + SHA256.\n   */\n  function prepSig(\n    message: TArg<Uint8Array>,\n    secretKey: TArg<Uint8Array>,\n    opts: TArg<ECDSASignOpts>\n  ) {\n    const { lowS, prehash, extraEntropy } = validateSigOpts(opts, defaultSigOpts);\n    message = validateMsgAndHash(message, prehash); // RFC6979 3.2 A: h1 = H(m)\n    // We can't later call bits2octets, since nested bits2int is broken for curves\n    // with fnBits % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n    // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n    const h1int = bits2int_modN(message);\n    const d = Fn.fromBytes(secretKey); // validate secret key, convert to bigint\n    if (!Fn.isValidNot0(d)) throw new Error('invalid private key');\n    const seedArgs: TArg<Uint8Array>[] = [int2octets(d), int2octets(h1int)];\n    // extraEntropy. RFC6979 3.6: additional k' (optional).\n    if (extraEntropy != null && extraEntropy !== false) {\n      // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n      // gen random bytes OR pass as-is\n      const e = extraEntropy === true ? randomBytes(lengths.secretKey) : extraEntropy;\n      seedArgs.push(abytes(e, undefined, 'extraEntropy')); // check for being bytes\n    }\n    const seed = concatBytes(...seedArgs) as TRet<Uint8Array>; // Step D of RFC6979 3.2\n    const m = h1int; // no need to call bits2int second time here, it is inside truncateHash!\n    // Converts signature params into point w r/s, checks result for validity.\n    // To transform k => Signature:\n    // q = k⋅G\n    // r = q.x mod n\n    // s = k^-1(m + rd) mod n\n    // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n    // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n    // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n    function k2sig(kBytes: TArg<Uint8Array>): Signature | undefined {\n      // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n      // Important: all mod() calls here must be done over N\n      const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n      if (!Fn.isValidNot0(k)) return; // Valid scalars (including k) must be in 1..N-1\n      const ik = Fn.inv(k); // k^-1 mod n\n      const q = Point.BASE.multiply(k).toAffine(); // q = k⋅G\n      const r = Fn.create(q.x); // r = q.x mod n\n      if (r === _0n) return;\n      const s = Fn.create(ik * Fn.create(m + r * d)); // s = k^-1(m + rd) mod n\n      if (s === _0n) return;\n      let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3 when q.x>n)\n      let normS = s;\n      if (lowS && isBiggerThanHalfOrder(s)) {\n        normS = Fn.neg(s); // if lowS was passed, ensure s is always in the bottom half of N\n        recovery ^= 1;\n      }\n      return new Signature(r, normS, hasLargeRecoveryLifts ? undefined : recovery);\n    }\n    return { seed, k2sig };\n  }\n\n  /**\n   * Signs a message or message hash with a secret key.\n   * With the default `prehash: true`, raw message bytes are hashed internally;\n   * only `{ prehash: false }` expects a caller-supplied digest.\n   *\n   * ```\n   * sign(m, d) where\n   *   k = rfc6979_hmac_drbg(m, d)\n   *   (x, y) = G × k\n   *   r = x mod n\n   *   s = (m + dr) / k mod n\n   * ```\n   */\n  function sign(\n    message: TArg<Uint8Array>,\n    secretKey: TArg<Uint8Array>,\n    opts: TArg<ECDSASignOpts> = {}\n  ): TRet<Uint8Array> {\n    const { seed, k2sig } = prepSig(message, secretKey, opts); // Steps A, D of RFC6979 3.2.\n    const drbg = createHmacDrbg<Signature>(hash_.outputLen, Fn.BYTES, hmac);\n    const sig = drbg(seed, k2sig); // Steps B, C, D, E, F, G\n    return sig.toBytes(opts.format);\n  }\n\n  /**\n   * Verifies a signature against message and public key.\n   * Rejects lowS signatures by default: see {@link ECDSAVerifyOpts}.\n   * Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n   *\n   * ```\n   * verify(r, s, h, P) where\n   *   u1 = hs^-1 mod n\n   *   u2 = rs^-1 mod n\n   *   R = u1⋅G + u2⋅P\n   *   mod(R.x, n) == r\n   * ```\n   */\n  function verify(\n    signature: TArg<Uint8Array>,\n    message: TArg<Uint8Array>,\n    publicKey: TArg<Uint8Array>,\n    opts: TArg<ECDSAVerifyOpts> = {}\n  ): boolean {\n    const { lowS, prehash, format } = validateSigOpts(opts, defaultSigOpts);\n    publicKey = abytes(publicKey, undefined, 'publicKey');\n    message = validateMsgAndHash(message, prehash);\n    if (!isBytes(signature as any)) {\n      const end = signature instanceof Signature ? ', use sig.toBytes()' : '';\n      throw new Error('verify expects Uint8Array signature' + end);\n    }\n    validateSigLength(signature, format); // execute this twice because we want loud error\n    try {\n      const sig = Signature.fromBytes(signature, format);\n      const P = Point.fromBytes(publicKey);\n      if (lowS && sig.hasHighS()) return false;\n      const { r, s } = sig;\n      const h = bits2int_modN(message); // mod n, not mod p\n      const is = Fn.inv(s); // s^-1 mod n\n      const u1 = Fn.create(h * is); // u1 = hs^-1 mod n\n      const u2 = Fn.create(r * is); // u2 = rs^-1 mod n\n      const R = Point.BASE.multiplyUnsafe(u1).add(P.multiplyUnsafe(u2)); // u1⋅G + u2⋅P\n      if (R.is0()) return false;\n      const v = Fn.create(R.x); // v = r.x mod n\n      return v === r;\n    } catch (e) {\n      return false;\n    }\n  }\n\n  function recoverPublicKey(\n    signature: TArg<Uint8Array>,\n    message: TArg<Uint8Array>,\n    opts: TArg<ECDSARecoverOpts> = {}\n  ): TRet<Uint8Array> {\n    // Top-level recovery mirrors `sign()` / `verify()`: it hashes raw message\n    // bytes first unless the caller passes `{ prehash: false }`.\n    const { prehash } = validateSigOpts(opts, defaultSigOpts);\n    message = validateMsgAndHash(message, prehash);\n    return Signature.fromBytes(signature, 'recovered').recoverPublicKey(message).toBytes();\n  }\n\n  return Object.freeze({\n    keygen,\n    getPublicKey,\n    getSharedSecret,\n    utils,\n    lengths,\n    Point,\n    sign,\n    verify,\n    recoverPublicKey,\n    Signature,\n    hash: hash_,\n  }) satisfies Signer;\n}\n","/**\n * SECG secp256k1. See [pdf](https://www.secg.org/sec2-v2.pdf).\n *\n * Belongs to Koblitz curves: it has efficiently-computable GLV endomorphism ψ,\n * check out {@link EndomorphismOpts}. Seems to be rigid (not backdoored).\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha2.js';\nimport { randomBytes } from '@noble/hashes/utils.js';\nimport { createKeygen, type CurveLengths } from './abstract/curve.ts';\nimport {\n  createFROST,\n  type FROST,\n  type FrostPublic,\n  type FrostSecret,\n  type Nonces,\n} from './abstract/frost.ts';\nimport { createHasher, type H2CHasher, isogenyMap } from './abstract/hash-to-curve.ts';\nimport { Field, mapHashToField, pow2 } from './abstract/modular.ts';\nimport {\n  type ECDSA,\n  ecdsa,\n  type EndomorphismOpts,\n  mapToCurveSimpleSWU,\n  type WeierstrassPoint as PointType,\n  weierstrass,\n  type WeierstrassOpts,\n  type WeierstrassPointCons,\n} from './abstract/weierstrass.ts';\nimport {\n  abytes,\n  asciiToBytes,\n  bytesToNumberBE,\n  concatBytes,\n  type TArg,\n  type TRet,\n} from './utils.ts';\n\n// Seems like generator was produced from some seed:\n// `Pointk1.BASE.multiply(Pointk1.Fn.inv(2n, N)).toAffine().x`\n// // gives short x 0x3b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63n\nconst secp256k1_CURVE: WeierstrassOpts<bigint> = {\n  p: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'),\n  n: BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'),\n  h: BigInt(1),\n  a: BigInt(0),\n  b: BigInt(7),\n  Gx: BigInt('0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798'),\n  Gy: BigInt('0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8'),\n};\n\nconst secp256k1_ENDO: EndomorphismOpts = {\n  beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n  basises: [\n    [BigInt('0x3086d221a7d46bcde86c90e49284eb15'), -BigInt('0xe4437ed6010e88286f547fa90abfe4c3')],\n    [BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8'), BigInt('0x3086d221a7d46bcde86c90e49284eb15')],\n  ],\n};\n\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _2n = /* @__PURE__ */ BigInt(2);\n\n/**\n * √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y: bigint): bigint {\n  const P = secp256k1_CURVE.p;\n  // prettier-ignore\n  const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);\n  // prettier-ignore\n  const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);\n  const b2 = (y * y * y) % P; // x^3, 11\n  const b3 = (b2 * b2 * y) % P; // x^7\n  const b6 = (pow2(b3, _3n, P) * b3) % P;\n  const b9 = (pow2(b6, _3n, P) * b3) % P;\n  const b11 = (pow2(b9, _2n, P) * b2) % P;\n  const b22 = (pow2(b11, _11n, P) * b11) % P;\n  const b44 = (pow2(b22, _22n, P) * b22) % P;\n  const b88 = (pow2(b44, _44n, P) * b44) % P;\n  const b176 = (pow2(b88, _88n, P) * b88) % P;\n  const b220 = (pow2(b176, _44n, P) * b44) % P;\n  const b223 = (pow2(b220, _3n, P) * b3) % P;\n  const t1 = (pow2(b223, _23n, P) * b22) % P;\n  const t2 = (pow2(t1, _6n, P) * b2) % P;\n  const root = pow2(t2, _2n, P);\n  if (!Fpk1.eql(Fpk1.sqr(root), y)) throw new Error('Cannot find square root');\n  return root;\n}\n\nconst Fpk1 = Field(secp256k1_CURVE.p, { sqrt: sqrtMod });\nconst Pointk1 = /* @__PURE__ */ weierstrass(secp256k1_CURVE, {\n  Fp: Fpk1,\n  endo: secp256k1_ENDO,\n});\n\n/**\n * secp256k1 curve: ECDSA and ECDH methods.\n *\n * Uses sha256 to hash messages. To use a different hash,\n * pass `{ prehash: false }` to sign / verify.\n *\n * @example\n * Generate one secp256k1 keypair, sign a message, and verify it.\n *\n * ```js\n * import { secp256k1 } from '@noble/curves/secp256k1.js';\n * const { secretKey, publicKey } = secp256k1.keygen();\n * // const publicKey = secp256k1.getPublicKey(secretKey);\n * const msg = new TextEncoder().encode('hello noble');\n * const sig = secp256k1.sign(msg, secretKey);\n * const isValid = secp256k1.verify(sig, msg, publicKey);\n * // const sigKeccak = secp256k1.sign(keccak256(msg), secretKey, { prehash: false });\n * ```\n */\nexport const secp256k1: ECDSA = /* @__PURE__ */ ecdsa(Pointk1, sha256);\n\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES: { [tag: string]: Uint8Array } = {};\n// BIP-340 phrases tags as UTF-8, but all current standardized names here are 7-bit ASCII.\nfunction taggedHash(tag: string, ...messages: TArg<Uint8Array[]>): TRet<Uint8Array> {\n  let tagP = TAGGED_HASH_PREFIXES[tag];\n  if (tagP === undefined) {\n    const tagH = sha256(asciiToBytes(tag));\n    tagP = concatBytes(tagH, tagH);\n    TAGGED_HASH_PREFIXES[tag] = tagP;\n  }\n  return sha256(concatBytes(tagP, ...messages)) as TRet<Uint8Array>;\n}\n\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point: TArg<PointType<bigint>>): TRet<Uint8Array> =>\n  point.toBytes(true).slice(1) as TRet<Uint8Array>;\nconst hasEven = (y: bigint) => y % _2n === _0n;\n\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv: TArg<Uint8Array>) {\n  const { Fn, BASE } = Pointk1;\n  const d_ = Fn.fromBytes(priv);\n  const p = BASE.multiply(d_); // P = d'⋅G; 0 < d' < n check is done inside\n  const scalar = hasEven(p.y) ? d_ : Fn.neg(d_);\n  return { scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x: bigint): PointType<bigint> {\n  const Fp = Fpk1;\n  if (!Fp.isValidNot0(x)) throw new Error('invalid x: Fail if x ≥ p');\n  const xx = Fp.create(x * x);\n  const c = Fp.create(xx * x + BigInt(7)); // Let c = x³ + 7 mod p.\n  let y = Fp.sqrt(c); // Let y = c^(p+1)/4 mod p. Same as sqrt().\n  // Return the unique point P such that x(P) = x and\n  // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n  if (!hasEven(y)) y = Fp.neg(y);\n  const p = Pointk1.fromAffine({ x, y });\n  p.assertValidity();\n  return p;\n}\n// BIP-340 callers still need to supply canonical 32-byte inputs where required; this alias only\n// parses big-endian bytes and does not enforce the fixed-width contract itself.\nconst num = bytesToNumberBE;\n/** Create tagged hash, convert it to bigint, reduce modulo-n. */\nfunction challenge(...args: TArg<Uint8Array[]>): bigint {\n  return Pointk1.Fn.create(num(taggedHash('BIP0340/challenge', ...args)));\n}\n\n/** Schnorr public key is just `x` coordinate of Point as per BIP340. */\nfunction schnorrGetPublicKey(secretKey: TArg<Uint8Array>): TRet<Uint8Array> {\n  return schnorrGetExtPubKey(secretKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)\n}\n\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * `auxRand` is optional and is not the sole source of `k` generation: bad CSPRNG output will not\n * be catastrophic, but BIP-340 still recommends fresh auxiliary randomness when available to harden\n * deterministic signing against side-channel and fault-injection attacks.\n */\nfunction schnorrSign(\n  message: TArg<Uint8Array>,\n  secretKey: TArg<Uint8Array>,\n  auxRand: TArg<Uint8Array> = randomBytes(32)\n): TRet<Uint8Array> {\n  const { Fn, BASE } = Pointk1;\n  const m = abytes(message, undefined, 'message');\n  const { bytes: px, scalar: d } = schnorrGetExtPubKey(secretKey); // checks for isWithinCurveOrder\n  const a = abytes(auxRand, 32, 'auxRand'); // Auxiliary random data a: a 32-byte array\n  // Let t be the byte-wise xor of bytes(d) and hash/aux(a).\n  const t = Fn.toBytes(d ^ num(taggedHash('BIP0340/aux', a)));\n  const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)\n  // BIP340 defines k' = int(rand) mod n. We can't reuse schnorrGetExtPubKey(rand)\n  // here: that helper parses canonical secret keys and rejects rand >= n instead\n  // of reducing the nonce hash modulo the group order.\n  const k_ = Fn.create(num(rand));\n  // BIP-340: \"Let k' = int(rand) mod n. Fail if k' = 0. Let R = k'⋅G.\"\n  if (k_ === 0n) throw new Error('sign failed: k is zero');\n  const p = BASE.multiply(k_); // Rejects zero; only the raw nonce hash needs reduction.\n  const k = hasEven(p.y) ? k_ : Fn.neg(k_);\n  const rx = pointToBytes(p);\n  const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.\n  const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).\n  sig.set(rx, 0);\n  sig.set(Fn.toBytes(Fn.create(k + e * d)), 32);\n  // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n  if (!schnorrVerify(sig, m, px)) throw new Error('sign: Invalid signature produced');\n  return sig as TRet<Uint8Array>;\n}\n\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(\n  signature: TArg<Uint8Array>,\n  message: TArg<Uint8Array>,\n  publicKey: TArg<Uint8Array>\n): boolean {\n  const { Fp, Fn, BASE } = Pointk1;\n  const sig = abytes(signature, 64, 'signature');\n  const m = abytes(message, undefined, 'message');\n  const pub = abytes(publicKey, 32, 'publicKey');\n  try {\n    const P = lift_x(num(pub)); // P = lift_x(int(pk)); fail if that fails\n    const r = num(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r ≥ p.\n    if (!Fp.isValidNot0(r)) return false;\n    const s = num(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n    // Stricter than BIP-340/libsecp256k1, which only reject s >= n. Honest signing reaches\n    // s = 0 only with negligible probability (k + e*d ≡ 0 mod n), so treat zero-s inputs as\n    // crafted edge cases and fail closed instead of carrying that extra verification surface.\n    if (!Fn.isValidNot0(s)) return false;\n\n    // int(challenge(bytes(r) || bytes(P) || m)) % n\n    const e = challenge(Fn.toBytes(r), pointToBytes(P), m);\n    // R = s⋅G - e⋅P, where -eP == (n-e)P\n    const R = BASE.multiplyUnsafe(s).add(P.multiplyUnsafe(Fn.neg(e)));\n    const { x, y } = R.toAffine();\n    // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.\n    if (R.is0() || !hasEven(y) || x !== r) return false;\n    return true;\n  } catch (error) {\n    return false;\n  }\n}\n\nexport const __TEST: { lift_x: typeof lift_x } = /* @__PURE__ */ Object.freeze({ lift_x });\n\n/** Schnorr-specific secp256k1 API from BIP340. */\nexport type SecpSchnorr = {\n  /**\n   * Generate one Schnorr secret/public keypair.\n   * @param seed - Optional seed for deterministic testing or custom randomness.\n   * @returns Fresh secret/public keypair.\n   */\n  keygen: (seed?: TArg<Uint8Array>) => { secretKey: TRet<Uint8Array>; publicKey: TRet<Uint8Array> };\n  /**\n   * Derive the x-only public key from a secret key.\n   * @param secretKey - Secret key bytes.\n   * @returns X-only public key bytes.\n   */\n  getPublicKey: typeof schnorrGetPublicKey;\n  /**\n   * Create one BIP340 Schnorr signature.\n   * @param message - Message bytes to sign.\n   * @param secretKey - Secret key bytes.\n   * @param auxRand - Optional auxiliary randomness.\n   * @returns Compact Schnorr signature bytes.\n   */\n  sign: typeof schnorrSign;\n  /**\n   * Verify one BIP340 Schnorr signature.\n   * @param signature - Compact signature bytes.\n   * @param message - Signed message bytes.\n   * @param publicKey - X-only public key bytes.\n   * @returns `true` when the signature is valid.\n   */\n  verify: typeof schnorrVerify;\n  /** Underlying secp256k1 point constructor. */\n  Point: WeierstrassPointCons<bigint>;\n  /** Helper utilities for Schnorr-specific key handling and tagged hashing. */\n  utils: {\n    /** Generate one Schnorr secret key. */\n    randomSecretKey: (seed?: TArg<Uint8Array>) => TRet<Uint8Array>;\n    /** Convert one point into its x-only BIP340 byte encoding. */\n    pointToBytes: (point: TArg<PointType<bigint>>) => TRet<Uint8Array>;\n    /** Lift one x coordinate into the unique even-Y point. */\n    lift_x: typeof lift_x;\n    /** Compute a BIP340 tagged hash. */\n    taggedHash: typeof taggedHash;\n  };\n  /** Public byte lengths for keys, signatures, and seeds. */\n  lengths: CurveLengths;\n};\n/**\n * Schnorr signatures over secp256k1.\n * See {@link https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki | BIP 340}.\n * @example\n * Generate one BIP340 Schnorr keypair, sign a message, and verify it.\n *\n * ```js\n * import { schnorr } from '@noble/curves/secp256k1.js';\n * const { secretKey, publicKey } = schnorr.keygen();\n * // const publicKey = schnorr.getPublicKey(secretKey);\n * const msg = new TextEncoder().encode('hello');\n * const sig = schnorr.sign(msg, secretKey);\n * const isValid = schnorr.verify(sig, msg, publicKey);\n * ```\n */\nexport const schnorr: SecpSchnorr = /* @__PURE__ */ (() => {\n  const size = 32;\n  const seedLength = 48;\n  const randomSecretKey = (seed?: TArg<Uint8Array>): TRet<Uint8Array> => {\n    seed = seed === undefined ? randomBytes(seedLength) : seed;\n    return mapHashToField(seed, secp256k1_CURVE.n);\n  };\n  return Object.freeze({\n    keygen: createKeygen(randomSecretKey, schnorrGetPublicKey),\n    getPublicKey: schnorrGetPublicKey,\n    sign: schnorrSign,\n    verify: schnorrVerify,\n    Point: Pointk1,\n    utils: Object.freeze({\n      randomSecretKey,\n      taggedHash,\n      lift_x,\n      pointToBytes,\n    }),\n    lengths: Object.freeze({\n      secretKey: size,\n      publicKey: size,\n      publicKeyHasPrefix: false,\n      signature: size * 2,\n      seed: seedLength,\n    }),\n  });\n})();\n\n// RFC 9380 Appendix E.1 3-isogeny coefficients for secp256k1, stored in ascending degree order.\n// The final `1` in each denominator array is the explicit monic leading term.\nconst isoMap = /* @__PURE__ */ (() =>\n  isogenyMap(\n    Fpk1,\n    [\n      // xNum\n      [\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n        '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n        '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n      ],\n      // xDen\n      [\n        '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n        '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n      ],\n      // yNum\n      [\n        '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n        '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n        '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n        '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n      ],\n      // yDen\n      [\n        '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n        '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n        '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n      ],\n    ].map((i) => i.map((j) => BigInt(j))) as [bigint[], bigint[], bigint[], bigint[]]\n  ))();\n// RFC 9380 §8.7 secp256k1 E' parameters for the SWU-to-isogeny pipeline below.\nlet mapSWU: ((u: bigint) => { x: bigint; y: bigint }) | undefined;\nconst getMapSWU = () =>\n  mapSWU ||\n  (mapSWU = mapToCurveSimpleSWU(Fpk1, {\n    // Building the SWU sqrt-ratio helper eagerly adds noticeable `secp256k1.js` import cost, so\n    // defer it to first use; after that the cached mapper is reused directly.\n    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n    B: BigInt('1771'),\n    Z: Fpk1.create(BigInt('-11')),\n  }));\n\n/**\n * Hashing / encoding to secp256k1 points / field. RFC 9380 methods.\n * @example\n * Hash one message onto secp256k1.\n *\n * ```ts\n * const point = secp256k1_hasher.hashToCurve(new TextEncoder().encode('hello noble'));\n * ```\n */\nexport const secp256k1_hasher: H2CHasher<WeierstrassPointCons<bigint>> = /* @__PURE__ */ (() =>\n  createHasher(\n    Pointk1,\n    (scalars: bigint[]) => {\n      const { x, y } = getMapSWU()(Fpk1.create(scalars[0]));\n      return isoMap(x, y);\n    },\n    {\n      DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n      encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n      p: Fpk1.ORDER,\n      m: 1,\n      k: 128,\n      expand: 'xmd',\n      hash: sha256,\n    }\n  ))();\n/**\n * FROST threshold signatures over secp256k1. RFC 9591.\n * @example\n * Create one trusted-dealer package for 2-of-3 secp256k1 signing.\n *\n * ```ts\n * const alice = secp256k1_FROST.Identifier.derive('alice@example.com');\n * const bob = secp256k1_FROST.Identifier.derive('bob@example.com');\n * const carol = secp256k1_FROST.Identifier.derive('carol@example.com');\n * const deal = secp256k1_FROST.trustedDealer({ min: 2, max: 3 }, [alice, bob, carol]);\n * ```\n */\nexport const secp256k1_FROST: TRet<FROST> = /* @__PURE__ */ (() =>\n  createFROST({\n    name: 'FROST-secp256k1-SHA256-v1',\n    Point: Pointk1,\n    hashToScalar: secp256k1_hasher.hashToScalar,\n    hash: sha256,\n  }))();\n\n// Taproot utils\n// `undefined` means \"disable TapTweak entirely\"; callers that want the BIP-341/BIP-386 empty\n// merkle root must pass `new Uint8Array(0)` explicitly.\nfunction tweak(point: PointType<bigint>, merkleRoot?: TArg<Uint8Array>): bigint {\n  if (merkleRoot === undefined) return _0n;\n  const x = pointToBytes(point);\n  const t = bytesToNumberBE(taggedHash('TapTweak', x, merkleRoot));\n  // BIP-341 taproot_tweak_pubkey/taproot_tweak_seckey: \"if t >= SECP256K1_ORDER:\n  // raise ValueError\". TapTweak must reject overflow instead of reducing modulo n.\n  if (!Pointk1.Fn.isValid(t)) throw new Error('invalid TapTweak hash');\n  return t;\n}\nfunction frostPubToEvenY(pub: TArg<FrostPublic>): TRet<FrostPublic> {\n  const VK = Pointk1.fromBytes(pub.commitments[0]);\n  // Keep aliasing on the already-even path so wrapper callers can skip unnecessary cloning.\n  if (hasEven(VK.y)) return pub as TRet<FrostPublic>;\n  return {\n    signers: { min: pub.signers.min, max: pub.signers.max },\n    commitments: pub.commitments.map((i) => Pointk1.fromBytes(i).negate().toBytes()),\n    verifyingShares: Object.fromEntries(\n      Object.entries(pub.verifyingShares).map(([k, v]) => [\n        k,\n        Pointk1.fromBytes(v).negate().toBytes(),\n      ])\n    ),\n  } as TRet<FrostPublic>;\n}\nfunction frostSecretToEvenY(s: TArg<FrostSecret>, pub: TArg<FrostPublic>): TRet<FrostSecret> {\n  const VK = Pointk1.fromBytes(pub.commitments[0]);\n  // Keep aliasing on the already-even path so wrapper callers can preserve package identity.\n  if (hasEven(VK.y)) return s as TRet<FrostSecret>;\n  const Fn = Pointk1.Fn;\n  return {\n    ...s,\n    signingShare: Fn.toBytes(Fn.neg(Fn.fromBytes(s.signingShare))),\n  } as TRet<FrostSecret>;\n}\nfunction frostNoncesToEvenY(PK: PointType<bigint>, nonces: TArg<Nonces>): TRet<Nonces> {\n  if (hasEven(PK.y)) return nonces as TRet<Nonces>;\n  const Fn = Pointk1.Fn;\n  return {\n    binding: Fn.toBytes(Fn.neg(Fn.fromBytes(nonces.binding))),\n    hiding: Fn.toBytes(Fn.neg(Fn.fromBytes(nonces.hiding))),\n  } as TRet<Nonces>;\n}\n\nfunction frostTweakSecret(\n  s: TArg<FrostSecret>,\n  pub: TArg<FrostPublic>,\n  merkleRoot?: TArg<Uint8Array>\n): TRet<FrostSecret> {\n  const Fn = Pointk1.Fn;\n  const keyPackage = frostSecretToEvenY(s, pub);\n  const evenPub = frostPubToEvenY(pub);\n  const t = tweak(Pointk1.fromBytes(evenPub.commitments[0]), merkleRoot);\n  const signingShare = Fn.toBytes(Fn.add(Fn.fromBytes(keyPackage.signingShare), t));\n  return {\n    identifier: keyPackage.identifier,\n    signingShare,\n  } as TRet<FrostSecret>;\n}\n\nfunction frostTweakPublic(\n  pub: TArg<FrostPublic>,\n  merkleRoot?: TArg<Uint8Array>\n): TRet<FrostPublic> {\n  const PKPackage = frostPubToEvenY(pub);\n  const t = tweak(Pointk1.fromBytes(PKPackage.commitments[0]), merkleRoot);\n  const tp = Pointk1.BASE.multiply(t);\n  const commitments = PKPackage.commitments.map((c, i) =>\n    (i === 0 ? Pointk1.fromBytes(c).add(tp) : Pointk1.fromBytes(c)).toBytes()\n  );\n  const verifyingShares: Record<string, Uint8Array> = {};\n  for (const k in PKPackage.verifyingShares) {\n    verifyingShares[k] = Pointk1.fromBytes(PKPackage.verifyingShares[k]).add(tp).toBytes();\n  }\n  return {\n    signers: { min: PKPackage.signers.min, max: PKPackage.signers.max },\n    commitments,\n    verifyingShares,\n  } as TRet<FrostPublic>;\n}\n\n/**\n * FROST threshold signatures over secp256k1-schnorr-taproot. RFC 9591.\n * DKG outputs are auto-tweaked with the empty Taproot merkle root for compatibility, while\n * `trustedDealer()` outputs stay untweaked unless callers apply the Taproot tweak themselves.\n * @example\n * Create one trusted-dealer package for Taproot-compatible FROST signing.\n *\n * ```ts\n * const alice = schnorr_FROST.Identifier.derive('alice@example.com');\n * const bob = schnorr_FROST.Identifier.derive('bob@example.com');\n * const carol = schnorr_FROST.Identifier.derive('carol@example.com');\n * const deal = schnorr_FROST.trustedDealer({ min: 2, max: 3 }, [alice, bob, carol]);\n * ```\n */\nexport const schnorr_FROST: TRet<FROST> = /* @__PURE__ */ (() =>\n  createFROST({\n    name: 'FROST-secp256k1-SHA256-TR-v1',\n    Point: Pointk1,\n    hashToScalar: secp256k1_hasher.hashToScalar,\n    hash: sha256,\n    // Taproot related hacks\n    parsePublicKey(publicKey) {\n      // External Taproot keys are x-only, but local key packages still use compressed points.\n      if (publicKey.length === 32) return lift_x(bytesToNumberBE(publicKey));\n      if (publicKey.length === 33) return Pointk1.fromBytes(publicKey);\n      throw new Error(`expected x-only or compressed public key, got length=${publicKey.length}`);\n    },\n    adjustScalar(n: bigint) {\n      const PK = Pointk1.BASE.multiply(n);\n      return hasEven(PK.y) ? n : Pointk1.Fn.neg(n);\n    },\n    adjustPoint: (p) => (hasEven(p.y) ? p : p.negate()),\n    challenge(R, PK, msg) {\n      return challenge(pointToBytes(R), pointToBytes(PK), msg);\n    },\n    adjustNonces: frostNoncesToEvenY,\n    adjustGroupCommitmentShare: (GC, GCShare) => (!hasEven(GC.y) ? GCShare.negate() : GCShare),\n    adjustPublic: frostPubToEvenY,\n    adjustSecret: frostSecretToEvenY,\n    adjustTx: {\n      // Compat with official implementation\n      encode: (tx) => tx.subarray(1) as TRet<Uint8Array>,\n      decode: (tx) => concatBytes(Uint8Array.of(0x02), tx) as TRet<Uint8Array>,\n    },\n    adjustDKG: (k) => {\n      // Compatibility with frost-secp256k1-tr: DKG output is auto-tweaked with the\n      // empty Taproot merkle root, while dealer-generated keys stay untweaked.\n      const merkleRoot = new Uint8Array(0);\n      return {\n        public: frostTweakPublic(k.public, merkleRoot),\n        secret: frostTweakSecret(k.secret, k.public, merkleRoot),\n      };\n    },\n  }))();\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n  (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n    ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n    : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Print warning and recommend using `buffer` v4.x which has an Object\n *               implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n    typeof console.error === 'function') {\n  console.error(\n    'This browser lacks typed array (Uint8Array) support which is required by ' +\n    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n  )\n}\n\nfunction typedArraySupport () {\n  // Can typed array instances can be augmented?\n  try {\n    const arr = new Uint8Array(1)\n    const proto = { foo: function () { return 42 } }\n    Object.setPrototypeOf(proto, Uint8Array.prototype)\n    Object.setPrototypeOf(arr, proto)\n    return arr.foo() === 42\n  } catch (e) {\n    return false\n  }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.buffer\n  }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.byteOffset\n  }\n})\n\nfunction createBuffer (length) {\n  if (length > K_MAX_LENGTH) {\n    throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n  }\n  // Return an augmented `Uint8Array` instance\n  const buf = new Uint8Array(length)\n  Object.setPrototypeOf(buf, Buffer.prototype)\n  return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError(\n        'The \"string\" argument must be of type string. Received type number'\n      )\n    }\n    return allocUnsafe(arg)\n  }\n  return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n  if (typeof value === 'string') {\n    return fromString(value, encodingOrOffset)\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return fromArrayView(value)\n  }\n\n  if (value == null) {\n    throw new TypeError(\n      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n      'or Array-like Object. Received type ' + (typeof value)\n    )\n  }\n\n  if (isInstance(value, ArrayBuffer) ||\n      (value && isInstance(value.buffer, ArrayBuffer))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n      (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'number') {\n    throw new TypeError(\n      'The \"value\" argument must not be of type number. Received type number'\n    )\n  }\n\n  const valueOf = value.valueOf && value.valueOf()\n  if (valueOf != null && valueOf !== value) {\n    return Buffer.from(valueOf, encodingOrOffset, length)\n  }\n\n  const b = fromObject(value)\n  if (b) return b\n\n  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function') {\n    return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n  }\n\n  throw new TypeError(\n    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n    'or Array-like Object. Received type ' + (typeof value)\n  )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number')\n  } else if (size < 0) {\n    throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n  }\n}\n\nfunction alloc (size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpreted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(size).fill(fill, encoding)\n      : createBuffer(size).fill(fill)\n  }\n  return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n  assertSize(size)\n  return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('Unknown encoding: ' + encoding)\n  }\n\n  const length = byteLength(string, encoding) | 0\n  let buf = createBuffer(length)\n\n  const actual = buf.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual)\n  }\n\n  return buf\n}\n\nfunction fromArrayLike (array) {\n  const length = array.length < 0 ? 0 : checked(array.length) | 0\n  const buf = createBuffer(length)\n  for (let i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255\n  }\n  return buf\n}\n\nfunction fromArrayView (arrayView) {\n  if (isInstance(arrayView, Uint8Array)) {\n    const copy = new Uint8Array(arrayView)\n    return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n  }\n  return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds')\n  }\n\n  let buf\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array)\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset)\n  } else {\n    buf = new Uint8Array(array, byteOffset, length)\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype)\n\n  return buf\n}\n\nfunction fromObject (obj) {\n  if (Buffer.isBuffer(obj)) {\n    const len = checked(obj.length) | 0\n    const buf = createBuffer(len)\n\n    if (buf.length === 0) {\n      return buf\n    }\n\n    obj.copy(buf, 0, 0, len)\n    return buf\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return createBuffer(0)\n    }\n    return fromArrayLike(obj)\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data)\n  }\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= K_MAX_LENGTH) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return b != null && b._isBuffer === true &&\n    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError(\n      'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n    )\n  }\n\n  if (a === b) return 0\n\n  let x = a.length\n  let y = b.length\n\n  for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!Array.isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  let i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  const buffer = Buffer.allocUnsafe(length)\n  let pos = 0\n  for (i = 0; i < list.length; ++i) {\n    let buf = list[i]\n    if (isInstance(buf, Uint8Array)) {\n      if (pos + buf.length > buffer.length) {\n        if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n        buf.copy(buffer, pos)\n      } else {\n        Uint8Array.prototype.set.call(\n          buffer,\n          buf,\n          pos\n        )\n      }\n    } else if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    } else {\n      buf.copy(buffer, pos)\n    }\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n      'Received type ' + typeof string\n    )\n  }\n\n  const len = string.length\n  const mustMatch = (arguments.length > 2 && arguments[2] === true)\n  if (!mustMatch && len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n        }\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  let loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  const i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  const len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (let i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  const len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (let i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  const len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (let i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  const length = this.length\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  let str = ''\n  const max = exports.INSPECT_MAX_BYTES\n  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n  if (this.length > max) str += ' ... '\n  return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (isInstance(target, Uint8Array)) {\n    target = Buffer.from(target, target.offset, target.byteLength)\n  }\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError(\n      'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n      'Received type ' + (typeof target)\n    )\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  let x = thisEnd - thisStart\n  let y = end - start\n  const len = Math.min(x, y)\n\n  const thisCopy = this.slice(thisStart, thisEnd)\n  const targetCopy = target.slice(start, end)\n\n  for (let i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  let indexSize = 1\n  let arrLength = arr.length\n  let valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  let i\n  if (dir) {\n    let foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      let found = true\n      for (let j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  const remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  const strLen = string.length\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  let i\n  for (i = 0; i < length; ++i) {\n    const parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (numberIsNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset >>> 0\n    if (isFinite(length)) {\n      length = length >>> 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  const remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return asciiWrite(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  const res = []\n\n  let i = start\n  while (i < end) {\n    const firstByte = buf[i]\n    let codePoint = null\n    let bytesPerSequence = (firstByte > 0xEF)\n      ? 4\n      : (firstByte > 0xDF)\n          ? 3\n          : (firstByte > 0xBF)\n              ? 2\n              : 1\n\n    if (i + bytesPerSequence <= end) {\n      let secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  const len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  let res = ''\n  let i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  const len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  let out = ''\n  for (let i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]]\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  const bytes = buf.slice(start, end)\n  let res = ''\n  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n  for (let i = 0; i < bytes.length - 1; i += 2) {\n    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  const len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  const newBuf = this.subarray(start, end)\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  let val = this[offset + --byteLength]\n  let mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const lo = first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24\n\n  const hi = this[++offset] +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    last * 2 ** 24\n\n  return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const hi = first * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  const lo = this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last\n\n  return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let i = byteLength\n  let mul = 1\n  let val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = this[offset + 4] +\n    this[offset + 5] * 2 ** 8 +\n    this[offset + 6] * 2 ** 16 +\n    (last << 24) // Overflow\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = (first << 24) + // Overflow\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let mul = 1\n  let i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset + 3] = (value >>> 24)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 1] = (value >>> 8)\n  this[offset] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset + 7] = lo\n  lo = lo >> 8\n  buf[offset + 6] = lo\n  lo = lo >> 8\n  buf[offset + 5] = lo\n  lo = lo >> 8\n  buf[offset + 4] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset + 3] = hi\n  hi = hi >> 8\n  buf[offset + 2] = hi\n  hi = hi >> 8\n  buf[offset + 1] = hi\n  hi = hi >> 8\n  buf[offset] = hi\n  return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = 0\n  let mul = 1\n  let sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  let sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 3] = (value >>> 24)\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  const len = end - start\n\n  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n    // Use built-in when available, missing from IE11\n    this.copyWithin(targetStart, start, end)\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, end),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n    if (val.length === 1) {\n      const code = val.charCodeAt(0)\n      if ((encoding === 'utf8' && code < 128) ||\n          encoding === 'latin1') {\n        // Fast path: If `val` fits into a single byte, use that numeric value.\n        val = code\n      }\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  } else if (typeof val === 'boolean') {\n    val = Number(val)\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  let i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    const bytes = Buffer.isBuffer(val)\n      ? val\n      : Buffer.from(val, encoding)\n    const len = bytes.length\n    if (len === 0) {\n      throw new TypeError('The value \"' + val +\n        '\" is invalid for argument \"value\"')\n    }\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n  errors[sym] = class NodeError extends Base {\n    constructor () {\n      super()\n\n      Object.defineProperty(this, 'message', {\n        value: getMessage.apply(this, arguments),\n        writable: true,\n        configurable: true\n      })\n\n      // Add the error code to the name to include it in the stack trace.\n      this.name = `${this.name} [${sym}]`\n      // Access the stack to generate the error message including the error code\n      // from the name.\n      this.stack // eslint-disable-line no-unused-expressions\n      // Reset the name to the actual name.\n      delete this.name\n    }\n\n    get code () {\n      return sym\n    }\n\n    set code (value) {\n      Object.defineProperty(this, 'code', {\n        configurable: true,\n        enumerable: true,\n        value,\n        writable: true\n      })\n    }\n\n    toString () {\n      return `${this.name} [${sym}]: ${this.message}`\n    }\n  }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n  function (name) {\n    if (name) {\n      return `${name} is outside of buffer bounds`\n    }\n\n    return 'Attempt to access memory outside buffer bounds'\n  }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n  function (name, actual) {\n    return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n  }, TypeError)\nE('ERR_OUT_OF_RANGE',\n  function (str, range, input) {\n    let msg = `The value of \"${str}\" is out of range.`\n    let received = input\n    if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n      received = addNumericalSeparator(String(input))\n    } else if (typeof input === 'bigint') {\n      received = String(input)\n      if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n        received = addNumericalSeparator(received)\n      }\n      received += 'n'\n    }\n    msg += ` It must be ${range}. Received ${received}`\n    return msg\n  }, RangeError)\n\nfunction addNumericalSeparator (val) {\n  let res = ''\n  let i = val.length\n  const start = val[0] === '-' ? 1 : 0\n  for (; i >= start + 4; i -= 3) {\n    res = `_${val.slice(i - 3, i)}${res}`\n  }\n  return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n  validateNumber(offset, 'offset')\n  if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n    boundsError(offset, buf.length - (byteLength + 1))\n  }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n  if (value > max || value < min) {\n    const n = typeof min === 'bigint' ? 'n' : ''\n    let range\n    if (byteLength > 3) {\n      if (min === 0 || min === BigInt(0)) {\n        range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n      } else {\n        range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n                `${(byteLength + 1) * 8 - 1}${n}`\n      }\n    } else {\n      range = `>= ${min}${n} and <= ${max}${n}`\n    }\n    throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n  }\n  checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n  if (typeof value !== 'number') {\n    throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n  }\n}\n\nfunction boundsError (value, length, type) {\n  if (Math.floor(value) !== value) {\n    validateNumber(value, type)\n    throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n  }\n\n  if (length < 0) {\n    throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n  }\n\n  throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n                                    `>= ${type ? 1 : 0} and <= ${length}`,\n                                    value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0]\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  let codePoint\n  const length = string.length\n  let leadSurrogate = null\n  const bytes = []\n\n  for (let i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  let c, hi, lo\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  let i\n  for (i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n  return obj instanceof type ||\n    (obj != null && obj.constructor != null && obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n  // For IE11 support\n  return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n  const alphabet = '0123456789abcdef'\n  const table = new Array(256)\n  for (let i = 0; i < 16; ++i) {\n    const i16 = i * 16\n    for (let j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j]\n    }\n  }\n  return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n  return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n  throw new Error('BigInt not supported')\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.emptyLeaf = void 0;\nexports.emptyLeaf = { type: 'empty' };\n//# sourceMappingURL=types.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.buildTree = buildTree;\nconst types_1 = require(\"./types\");\nfunction buildHigherLayer(elements) {\n    if (elements.length === 0)\n        throw new Error(\"Cannot work on empty arrays\");\n    if (elements.length === 1)\n        return elements[0];\n    const result = [];\n    let i = 0;\n    while (i < elements.length - 1) {\n        result.push({ type: 'node', left: elements[i], right: elements[i + 1] });\n        i += 2;\n    }\n    if (i < elements.length)\n        result.push(elements[i]);\n    return buildHigherLayer(result);\n}\nfunction handleArrayContainer(items, merkleHashVersion) {\n    if (items.length === 0) {\n        return {\n            type: 'node',\n            left: types_1.emptyLeaf,\n            right: types_1.emptyLeaf,\n            content: [],\n            size: 0,\n            kind: 'array',\n        };\n    }\n    const leaves = items.map(item => buildTree(item, merkleHashVersion));\n    if (leaves.length == 1 && leaves[0].type == 'node' && merkleHashVersion >= 2) {\n        return {\n            type: 'node',\n            left: leaves[0],\n            right: types_1.emptyLeaf,\n            content: items,\n            size: items.length,\n            kind: 'array',\n        };\n    }\n    const root = leaves.length === 1 ? leaves[0] : buildHigherLayer(leaves);\n    if (root.type === 'node') {\n        return { ...root, content: items, size: items.length, kind: 'array' };\n    }\n    return {\n        type: 'node',\n        left: root,\n        right: types_1.emptyLeaf,\n        content: items,\n        size: items.length,\n        kind: 'array',\n    };\n}\nfunction handleDictContainer(items, merkleHashVersion) {\n    if (items.length === 0) {\n        return {\n            type: 'node',\n            left: types_1.emptyLeaf,\n            right: types_1.emptyLeaf,\n            content: [],\n            size: 0,\n            kind: 'dict',\n        };\n    }\n    const leaves = [];\n    for (const [key, value] of items) {\n        leaves.push({ type: 'leaf', content: key });\n        leaves.push(buildTree(value, merkleHashVersion));\n    }\n    const root = leaves.length === 2\n        ? { left: leaves[0], right: leaves[1] }\n        : buildHigherLayer(leaves);\n    if ('left' in root && 'right' in root) {\n        return {\n            type: 'node',\n            left: root.left,\n            right: root.right,\n            content: items,\n            size: items.length,\n            kind: 'dict',\n        };\n    }\n    return {\n        type: 'node',\n        left: root,\n        right: types_1.emptyLeaf,\n        content: items,\n        size: items.length,\n        kind: 'dict',\n    };\n}\nfunction buildTree(value, merkleHashVersion) {\n    if (Array.isArray(value)) {\n        return handleArrayContainer(value, merkleHashVersion);\n    }\n    if (typeof value === 'object' && value !== null && !Buffer.isBuffer(value)) {\n        const entries = Object.entries(value);\n        return handleDictContainer(entries, merkleHashVersion);\n    }\n    return { type: 'leaf', content: value };\n}\n//# sourceMappingURL=factory.js.map","(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    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","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","/* eslint-disable node/no-deprecated-api */\n\n'use strict'\n\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\nvar safer = {}\n\nvar key\n\nfor (key in buffer) {\n  if (!buffer.hasOwnProperty(key)) continue\n  if (key === 'SlowBuffer' || key === 'Buffer') continue\n  safer[key] = buffer[key]\n}\n\nvar Safer = safer.Buffer = {}\nfor (key in Buffer) {\n  if (!Buffer.hasOwnProperty(key)) continue\n  if (key === 'allocUnsafe' || key === 'allocUnsafeSlow') continue\n  Safer[key] = Buffer[key]\n}\n\nsafer.Buffer.prototype = Buffer.prototype\n\nif (!Safer.from || Safer.from === Uint8Array.from) {\n  Safer.from = function (value, encodingOrOffset, length) {\n    if (typeof value === 'number') {\n      throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value)\n    }\n    if (value && typeof value.length === 'undefined') {\n      throw new TypeError('The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type ' + typeof value)\n    }\n    return Buffer(value, encodingOrOffset, length)\n  }\n}\n\nif (!Safer.alloc) {\n  Safer.alloc = function (size, fill, encoding) {\n    if (typeof size !== 'number') {\n      throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size)\n    }\n    if (size < 0 || size >= 2 * (1 << 30)) {\n      throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n    }\n    var buf = Buffer(size)\n    if (!fill || fill.length === 0) {\n      buf.fill(0)\n    } else if (typeof encoding === 'string') {\n      buf.fill(fill, encoding)\n    } else {\n      buf.fill(fill)\n    }\n    return buf\n  }\n}\n\nif (!safer.kStringMaxLength) {\n  try {\n    safer.kStringMaxLength = process.binding('buffer').kStringMaxLength\n  } catch (e) {\n    // we can't determine kStringMaxLength in environments where process.binding\n    // is unsupported, so let's not set it\n  }\n}\n\nif (!safer.constants) {\n  safer.constants = {\n    MAX_LENGTH: safer.kMaxLength\n  }\n  if (safer.kStringMaxLength) {\n    safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength\n  }\n}\n\nmodule.exports = safer\n","'use strict';\n\nconst inherits = require('inherits');\n\nfunction Reporter(options) {\n  this._reporterState = {\n    obj: null,\n    path: [],\n    options: options || {},\n    errors: []\n  };\n}\nexports.Reporter = Reporter;\n\nReporter.prototype.isError = function isError(obj) {\n  return obj instanceof ReporterError;\n};\n\nReporter.prototype.save = function save() {\n  const state = this._reporterState;\n\n  return { obj: state.obj, pathLen: state.path.length };\n};\n\nReporter.prototype.restore = function restore(data) {\n  const state = this._reporterState;\n\n  state.obj = data.obj;\n  state.path = state.path.slice(0, data.pathLen);\n};\n\nReporter.prototype.enterKey = function enterKey(key) {\n  return this._reporterState.path.push(key);\n};\n\nReporter.prototype.exitKey = function exitKey(index) {\n  const state = this._reporterState;\n\n  state.path = state.path.slice(0, index - 1);\n};\n\nReporter.prototype.leaveKey = function leaveKey(index, key, value) {\n  const state = this._reporterState;\n\n  this.exitKey(index);\n  if (state.obj !== null)\n    state.obj[key] = value;\n};\n\nReporter.prototype.path = function path() {\n  return this._reporterState.path.join('/');\n};\n\nReporter.prototype.enterObject = function enterObject() {\n  const state = this._reporterState;\n\n  const prev = state.obj;\n  state.obj = {};\n  return prev;\n};\n\nReporter.prototype.leaveObject = function leaveObject(prev) {\n  const state = this._reporterState;\n\n  const now = state.obj;\n  state.obj = prev;\n  return now;\n};\n\nReporter.prototype.error = function error(msg) {\n  let err;\n  const state = this._reporterState;\n\n  const inherited = msg instanceof ReporterError;\n  if (inherited) {\n    err = msg;\n  } else {\n    err = new ReporterError(state.path.map(function(elem) {\n      return '[' + JSON.stringify(elem) + ']';\n    }).join(''), msg.message || msg, msg.stack);\n  }\n\n  if (!state.options.partial)\n    throw err;\n\n  if (!inherited)\n    state.errors.push(err);\n\n  return err;\n};\n\nReporter.prototype.wrapResult = function wrapResult(result) {\n  const state = this._reporterState;\n  if (!state.options.partial)\n    return result;\n\n  return {\n    result: this.isError(result) ? null : result,\n    errors: state.errors\n  };\n};\n\nfunction ReporterError(path, msg) {\n  this.path = path;\n  this.rethrow(msg);\n}\ninherits(ReporterError, Error);\n\nReporterError.prototype.rethrow = function rethrow(msg) {\n  this.message = msg + ' at: ' + (this.path || '(shallow)');\n  if (Error.captureStackTrace)\n    Error.captureStackTrace(this, ReporterError);\n\n  if (!this.stack) {\n    try {\n      // IE only adds stack when thrown\n      throw new Error(this.message);\n    } catch (e) {\n      this.stack = e.stack;\n    }\n  }\n  return this;\n};\n","'use strict';\n\nconst inherits = require('inherits');\nconst Reporter = require('../base/reporter').Reporter;\nconst Buffer = require('safer-buffer').Buffer;\n\nfunction DecoderBuffer(base, options) {\n  Reporter.call(this, options);\n  if (!Buffer.isBuffer(base)) {\n    this.error('Input not Buffer');\n    return;\n  }\n\n  this.base = base;\n  this.offset = 0;\n  this.length = base.length;\n}\ninherits(DecoderBuffer, Reporter);\nexports.DecoderBuffer = DecoderBuffer;\n\nDecoderBuffer.isDecoderBuffer = function isDecoderBuffer(data) {\n  if (data instanceof DecoderBuffer) {\n    return true;\n  }\n\n  // Or accept compatible API\n  const isCompatible = typeof data === 'object' &&\n    Buffer.isBuffer(data.base) &&\n    data.constructor.name === 'DecoderBuffer' &&\n    typeof data.offset === 'number' &&\n    typeof data.length === 'number' &&\n    typeof data.save === 'function' &&\n    typeof data.restore === 'function' &&\n    typeof data.isEmpty === 'function' &&\n    typeof data.readUInt8 === 'function' &&\n    typeof data.skip === 'function' &&\n    typeof data.raw === 'function';\n\n  return isCompatible;\n};\n\nDecoderBuffer.prototype.save = function save() {\n  return { offset: this.offset, reporter: Reporter.prototype.save.call(this) };\n};\n\nDecoderBuffer.prototype.restore = function restore(save) {\n  // Return skipped data\n  const res = new DecoderBuffer(this.base);\n  res.offset = save.offset;\n  res.length = this.offset;\n\n  this.offset = save.offset;\n  Reporter.prototype.restore.call(this, save.reporter);\n\n  return res;\n};\n\nDecoderBuffer.prototype.isEmpty = function isEmpty() {\n  return this.offset === this.length;\n};\n\nDecoderBuffer.prototype.readUInt8 = function readUInt8(fail) {\n  if (this.offset + 1 <= this.length)\n    return this.base.readUInt8(this.offset++, true);\n  else\n    return this.error(fail || 'DecoderBuffer overrun');\n};\n\nDecoderBuffer.prototype.skip = function skip(bytes, fail) {\n  if (!(this.offset + bytes <= this.length))\n    return this.error(fail || 'DecoderBuffer overrun');\n\n  const res = new DecoderBuffer(this.base);\n\n  // Share reporter state\n  res._reporterState = this._reporterState;\n\n  res.offset = this.offset;\n  res.length = this.offset + bytes;\n  this.offset += bytes;\n  return res;\n};\n\nDecoderBuffer.prototype.raw = function raw(save) {\n  return this.base.slice(save ? save.offset : this.offset, this.length);\n};\n\nfunction EncoderBuffer(value, reporter) {\n  if (Array.isArray(value)) {\n    this.length = 0;\n    this.value = value.map(function(item) {\n      if (!EncoderBuffer.isEncoderBuffer(item))\n        item = new EncoderBuffer(item, reporter);\n      this.length += item.length;\n      return item;\n    }, this);\n  } else if (typeof value === 'number') {\n    if (!(0 <= value && value <= 0xff))\n      return reporter.error('non-byte EncoderBuffer value');\n    this.value = value;\n    this.length = 1;\n  } else if (typeof value === 'string') {\n    this.value = value;\n    this.length = Buffer.byteLength(value);\n  } else if (Buffer.isBuffer(value)) {\n    this.value = value;\n    this.length = value.length;\n  } else {\n    return reporter.error('Unsupported type: ' + typeof value);\n  }\n}\nexports.EncoderBuffer = EncoderBuffer;\n\nEncoderBuffer.isEncoderBuffer = function isEncoderBuffer(data) {\n  if (data instanceof EncoderBuffer) {\n    return true;\n  }\n\n  // Or accept compatible API\n  const isCompatible = typeof data === 'object' &&\n    data.constructor.name === 'EncoderBuffer' &&\n    typeof data.length === 'number' &&\n    typeof data.join === 'function';\n\n  return isCompatible;\n};\n\nEncoderBuffer.prototype.join = function join(out, offset) {\n  if (!out)\n    out = Buffer.alloc(this.length);\n  if (!offset)\n    offset = 0;\n\n  if (this.length === 0)\n    return out;\n\n  if (Array.isArray(this.value)) {\n    this.value.forEach(function(item) {\n      item.join(out, offset);\n      offset += item.length;\n    });\n  } else {\n    if (typeof this.value === 'number')\n      out[offset] = this.value;\n    else if (typeof this.value === 'string')\n      out.write(this.value, offset);\n    else if (Buffer.isBuffer(this.value))\n      this.value.copy(out, offset);\n    offset += this.length;\n  }\n\n  return out;\n};\n","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\nconst Reporter = require('../base/reporter').Reporter;\nconst EncoderBuffer = require('../base/buffer').EncoderBuffer;\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst assert = require('minimalistic-assert');\n\n// Supported tags\nconst tags = [\n  'seq', 'seqof', 'set', 'setof', 'objid', 'bool',\n  'gentime', 'utctime', 'null_', 'enum', 'int', 'objDesc',\n  'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str',\n  'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr'\n];\n\n// Public methods list\nconst methods = [\n  'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice',\n  'any', 'contains'\n].concat(tags);\n\n// Overrided methods list\nconst overrided = [\n  '_peekTag', '_decodeTag', '_use',\n  '_decodeStr', '_decodeObjid', '_decodeTime',\n  '_decodeNull', '_decodeInt', '_decodeBool', '_decodeList',\n\n  '_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime',\n  '_encodeNull', '_encodeInt', '_encodeBool'\n];\n\nfunction Node(enc, parent, name) {\n  const state = {};\n  this._baseState = state;\n\n  state.name = name;\n  state.enc = enc;\n\n  state.parent = parent || null;\n  state.children = null;\n\n  // State\n  state.tag = null;\n  state.args = null;\n  state.reverseArgs = null;\n  state.choice = null;\n  state.optional = false;\n  state.any = false;\n  state.obj = false;\n  state.use = null;\n  state.useDecoder = null;\n  state.key = null;\n  state['default'] = null;\n  state.explicit = null;\n  state.implicit = null;\n  state.contains = null;\n\n  // Should create new instance on each method\n  if (!state.parent) {\n    state.children = [];\n    this._wrap();\n  }\n}\nmodule.exports = Node;\n\nconst stateProps = [\n  'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice',\n  'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit',\n  'implicit', 'contains'\n];\n\nNode.prototype.clone = function clone() {\n  const state = this._baseState;\n  const cstate = {};\n  stateProps.forEach(function(prop) {\n    cstate[prop] = state[prop];\n  });\n  const res = new this.constructor(cstate.parent);\n  res._baseState = cstate;\n  return res;\n};\n\nNode.prototype._wrap = function wrap() {\n  const state = this._baseState;\n  methods.forEach(function(method) {\n    this[method] = function _wrappedMethod() {\n      const clone = new this.constructor(this);\n      state.children.push(clone);\n      return clone[method].apply(clone, arguments);\n    };\n  }, this);\n};\n\nNode.prototype._init = function init(body) {\n  const state = this._baseState;\n\n  assert(state.parent === null);\n  body.call(this);\n\n  // Filter children\n  state.children = state.children.filter(function(child) {\n    return child._baseState.parent === this;\n  }, this);\n  assert.equal(state.children.length, 1, 'Root node can have only one child');\n};\n\nNode.prototype._useArgs = function useArgs(args) {\n  const state = this._baseState;\n\n  // Filter children and args\n  const children = args.filter(function(arg) {\n    return arg instanceof this.constructor;\n  }, this);\n  args = args.filter(function(arg) {\n    return !(arg instanceof this.constructor);\n  }, this);\n\n  if (children.length !== 0) {\n    assert(state.children === null);\n    state.children = children;\n\n    // Replace parent to maintain backward link\n    children.forEach(function(child) {\n      child._baseState.parent = this;\n    }, this);\n  }\n  if (args.length !== 0) {\n    assert(state.args === null);\n    state.args = args;\n    state.reverseArgs = args.map(function(arg) {\n      if (typeof arg !== 'object' || arg.constructor !== Object)\n        return arg;\n\n      const res = {};\n      Object.keys(arg).forEach(function(key) {\n        if (key == (key | 0))\n          key |= 0;\n        const value = arg[key];\n        res[value] = key;\n      });\n      return res;\n    });\n  }\n};\n\n//\n// Overrided methods\n//\n\noverrided.forEach(function(method) {\n  Node.prototype[method] = function _overrided() {\n    const state = this._baseState;\n    throw new Error(method + ' not implemented for encoding: ' + state.enc);\n  };\n});\n\n//\n// Public methods\n//\n\ntags.forEach(function(tag) {\n  Node.prototype[tag] = function _tagMethod() {\n    const state = this._baseState;\n    const args = Array.prototype.slice.call(arguments);\n\n    assert(state.tag === null);\n    state.tag = tag;\n\n    this._useArgs(args);\n\n    return this;\n  };\n});\n\nNode.prototype.use = function use(item) {\n  assert(item);\n  const state = this._baseState;\n\n  assert(state.use === null);\n  state.use = item;\n\n  return this;\n};\n\nNode.prototype.optional = function optional() {\n  const state = this._baseState;\n\n  state.optional = true;\n\n  return this;\n};\n\nNode.prototype.def = function def(val) {\n  const state = this._baseState;\n\n  assert(state['default'] === null);\n  state['default'] = val;\n  state.optional = true;\n\n  return this;\n};\n\nNode.prototype.explicit = function explicit(num) {\n  const state = this._baseState;\n\n  assert(state.explicit === null && state.implicit === null);\n  state.explicit = num;\n\n  return this;\n};\n\nNode.prototype.implicit = function implicit(num) {\n  const state = this._baseState;\n\n  assert(state.explicit === null && state.implicit === null);\n  state.implicit = num;\n\n  return this;\n};\n\nNode.prototype.obj = function obj() {\n  const state = this._baseState;\n  const args = Array.prototype.slice.call(arguments);\n\n  state.obj = true;\n\n  if (args.length !== 0)\n    this._useArgs(args);\n\n  return this;\n};\n\nNode.prototype.key = function key(newKey) {\n  const state = this._baseState;\n\n  assert(state.key === null);\n  state.key = newKey;\n\n  return this;\n};\n\nNode.prototype.any = function any() {\n  const state = this._baseState;\n\n  state.any = true;\n\n  return this;\n};\n\nNode.prototype.choice = function choice(obj) {\n  const state = this._baseState;\n\n  assert(state.choice === null);\n  state.choice = obj;\n  this._useArgs(Object.keys(obj).map(function(key) {\n    return obj[key];\n  }));\n\n  return this;\n};\n\nNode.prototype.contains = function contains(item) {\n  const state = this._baseState;\n\n  assert(state.use === null);\n  state.contains = item;\n\n  return this;\n};\n\n//\n// Decoding\n//\n\nNode.prototype._decode = function decode(input, options) {\n  const state = this._baseState;\n\n  // Decode root node\n  if (state.parent === null)\n    return input.wrapResult(state.children[0]._decode(input, options));\n\n  let result = state['default'];\n  let present = true;\n\n  let prevKey = null;\n  if (state.key !== null)\n    prevKey = input.enterKey(state.key);\n\n  // Check if tag is there\n  if (state.optional) {\n    let tag = null;\n    if (state.explicit !== null)\n      tag = state.explicit;\n    else if (state.implicit !== null)\n      tag = state.implicit;\n    else if (state.tag !== null)\n      tag = state.tag;\n\n    if (tag === null && !state.any) {\n      // Trial and Error\n      const save = input.save();\n      try {\n        if (state.choice === null)\n          this._decodeGeneric(state.tag, input, options);\n        else\n          this._decodeChoice(input, options);\n        present = true;\n      } catch (e) {\n        present = false;\n      }\n      input.restore(save);\n    } else {\n      present = this._peekTag(input, tag, state.any);\n\n      if (input.isError(present))\n        return present;\n    }\n  }\n\n  // Push object on stack\n  let prevObj;\n  if (state.obj && present)\n    prevObj = input.enterObject();\n\n  if (present) {\n    // Unwrap explicit values\n    if (state.explicit !== null) {\n      const explicit = this._decodeTag(input, state.explicit);\n      if (input.isError(explicit))\n        return explicit;\n      input = explicit;\n    }\n\n    const start = input.offset;\n\n    // Unwrap implicit and normal values\n    if (state.use === null && state.choice === null) {\n      let save;\n      if (state.any)\n        save = input.save();\n      const body = this._decodeTag(\n        input,\n        state.implicit !== null ? state.implicit : state.tag,\n        state.any\n      );\n      if (input.isError(body))\n        return body;\n\n      if (state.any)\n        result = input.raw(save);\n      else\n        input = body;\n    }\n\n    if (options && options.track && state.tag !== null)\n      options.track(input.path(), start, input.length, 'tagged');\n\n    if (options && options.track && state.tag !== null)\n      options.track(input.path(), input.offset, input.length, 'content');\n\n    // Select proper method for tag\n    if (state.any) {\n      // no-op\n    } else if (state.choice === null) {\n      result = this._decodeGeneric(state.tag, input, options);\n    } else {\n      result = this._decodeChoice(input, options);\n    }\n\n    if (input.isError(result))\n      return result;\n\n    // Decode children\n    if (!state.any && state.choice === null && state.children !== null) {\n      state.children.forEach(function decodeChildren(child) {\n        // NOTE: We are ignoring errors here, to let parser continue with other\n        // parts of encoded data\n        child._decode(input, options);\n      });\n    }\n\n    // Decode contained/encoded by schema, only in bit or octet strings\n    if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) {\n      const data = new DecoderBuffer(result);\n      result = this._getUse(state.contains, input._reporterState.obj)\n        ._decode(data, options);\n    }\n  }\n\n  // Pop object\n  if (state.obj && present)\n    result = input.leaveObject(prevObj);\n\n  // Set key\n  if (state.key !== null && (result !== null || present === true))\n    input.leaveKey(prevKey, state.key, result);\n  else if (prevKey !== null)\n    input.exitKey(prevKey);\n\n  return result;\n};\n\nNode.prototype._decodeGeneric = function decodeGeneric(tag, input, options) {\n  const state = this._baseState;\n\n  if (tag === 'seq' || tag === 'set')\n    return null;\n  if (tag === 'seqof' || tag === 'setof')\n    return this._decodeList(input, tag, state.args[0], options);\n  else if (/str$/.test(tag))\n    return this._decodeStr(input, tag, options);\n  else if (tag === 'objid' && state.args)\n    return this._decodeObjid(input, state.args[0], state.args[1], options);\n  else if (tag === 'objid')\n    return this._decodeObjid(input, null, null, options);\n  else if (tag === 'gentime' || tag === 'utctime')\n    return this._decodeTime(input, tag, options);\n  else if (tag === 'null_')\n    return this._decodeNull(input, options);\n  else if (tag === 'bool')\n    return this._decodeBool(input, options);\n  else if (tag === 'objDesc')\n    return this._decodeStr(input, tag, options);\n  else if (tag === 'int' || tag === 'enum')\n    return this._decodeInt(input, state.args && state.args[0], options);\n\n  if (state.use !== null) {\n    return this._getUse(state.use, input._reporterState.obj)\n      ._decode(input, options);\n  } else {\n    return input.error('unknown tag: ' + tag);\n  }\n};\n\nNode.prototype._getUse = function _getUse(entity, obj) {\n\n  const state = this._baseState;\n  // Create altered use decoder if implicit is set\n  state.useDecoder = this._use(entity, obj);\n  assert(state.useDecoder._baseState.parent === null);\n  state.useDecoder = state.useDecoder._baseState.children[0];\n  if (state.implicit !== state.useDecoder._baseState.implicit) {\n    state.useDecoder = state.useDecoder.clone();\n    state.useDecoder._baseState.implicit = state.implicit;\n  }\n  return state.useDecoder;\n};\n\nNode.prototype._decodeChoice = function decodeChoice(input, options) {\n  const state = this._baseState;\n  let result = null;\n  let match = false;\n\n  Object.keys(state.choice).some(function(key) {\n    const save = input.save();\n    const node = state.choice[key];\n    try {\n      const value = node._decode(input, options);\n      if (input.isError(value))\n        return false;\n\n      result = { type: key, value: value };\n      match = true;\n    } catch (e) {\n      input.restore(save);\n      return false;\n    }\n    return true;\n  }, this);\n\n  if (!match)\n    return input.error('Choice not matched');\n\n  return result;\n};\n\n//\n// Encoding\n//\n\nNode.prototype._createEncoderBuffer = function createEncoderBuffer(data) {\n  return new EncoderBuffer(data, this.reporter);\n};\n\nNode.prototype._encode = function encode(data, reporter, parent) {\n  const state = this._baseState;\n  if (state['default'] !== null && state['default'] === data)\n    return;\n\n  const result = this._encodeValue(data, reporter, parent);\n  if (result === undefined)\n    return;\n\n  if (this._skipDefault(result, reporter, parent))\n    return;\n\n  return result;\n};\n\nNode.prototype._encodeValue = function encode(data, reporter, parent) {\n  const state = this._baseState;\n\n  // Decode root node\n  if (state.parent === null)\n    return state.children[0]._encode(data, reporter || new Reporter());\n\n  let result = null;\n\n  // Set reporter to share it with a child class\n  this.reporter = reporter;\n\n  // Check if data is there\n  if (state.optional && data === undefined) {\n    if (state['default'] !== null)\n      data = state['default'];\n    else\n      return;\n  }\n\n  // Encode children first\n  let content = null;\n  let primitive = false;\n  if (state.any) {\n    // Anything that was given is translated to buffer\n    result = this._createEncoderBuffer(data);\n  } else if (state.choice) {\n    result = this._encodeChoice(data, reporter);\n  } else if (state.contains) {\n    content = this._getUse(state.contains, parent)._encode(data, reporter);\n    primitive = true;\n  } else if (state.children) {\n    content = state.children.map(function(child) {\n      if (child._baseState.tag === 'null_')\n        return child._encode(null, reporter, data);\n\n      if (child._baseState.key === null)\n        return reporter.error('Child should have a key');\n      const prevKey = reporter.enterKey(child._baseState.key);\n\n      if (typeof data !== 'object')\n        return reporter.error('Child expected, but input is not object');\n\n      const res = child._encode(data[child._baseState.key], reporter, data);\n      reporter.leaveKey(prevKey);\n\n      return res;\n    }, this).filter(function(child) {\n      return child;\n    });\n    content = this._createEncoderBuffer(content);\n  } else {\n    if (state.tag === 'seqof' || state.tag === 'setof') {\n      // TODO(indutny): this should be thrown on DSL level\n      if (!(state.args && state.args.length === 1))\n        return reporter.error('Too many args for : ' + state.tag);\n\n      if (!Array.isArray(data))\n        return reporter.error('seqof/setof, but data is not Array');\n\n      const child = this.clone();\n      child._baseState.implicit = null;\n      content = this._createEncoderBuffer(data.map(function(item) {\n        const state = this._baseState;\n\n        return this._getUse(state.args[0], data)._encode(item, reporter);\n      }, child));\n    } else if (state.use !== null) {\n      result = this._getUse(state.use, parent)._encode(data, reporter);\n    } else {\n      content = this._encodePrimitive(state.tag, data);\n      primitive = true;\n    }\n  }\n\n  // Encode data itself\n  if (!state.any && state.choice === null) {\n    const tag = state.implicit !== null ? state.implicit : state.tag;\n    const cls = state.implicit === null ? 'universal' : 'context';\n\n    if (tag === null) {\n      if (state.use === null)\n        reporter.error('Tag could be omitted only for .use()');\n    } else {\n      if (state.use === null)\n        result = this._encodeComposite(tag, primitive, cls, content);\n    }\n  }\n\n  // Wrap in explicit\n  if (state.explicit !== null)\n    result = this._encodeComposite(state.explicit, false, 'context', result);\n\n  return result;\n};\n\nNode.prototype._encodeChoice = function encodeChoice(data, reporter) {\n  const state = this._baseState;\n\n  const node = state.choice[data.type];\n  if (!node) {\n    assert(\n      false,\n      data.type + ' not found in ' +\n            JSON.stringify(Object.keys(state.choice)));\n  }\n  return node._encode(data.value, reporter);\n};\n\nNode.prototype._encodePrimitive = function encodePrimitive(tag, data) {\n  const state = this._baseState;\n\n  if (/str$/.test(tag))\n    return this._encodeStr(data, tag);\n  else if (tag === 'objid' && state.args)\n    return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n  else if (tag === 'objid')\n    return this._encodeObjid(data, null, null);\n  else if (tag === 'gentime' || tag === 'utctime')\n    return this._encodeTime(data, tag);\n  else if (tag === 'null_')\n    return this._encodeNull();\n  else if (tag === 'int' || tag === 'enum')\n    return this._encodeInt(data, state.args && state.reverseArgs[0]);\n  else if (tag === 'bool')\n    return this._encodeBool(data);\n  else if (tag === 'objDesc')\n    return this._encodeStr(data, tag);\n  else\n    throw new Error('Unsupported tag: ' + tag);\n};\n\nNode.prototype._isNumstr = function isNumstr(str) {\n  return /^[0-9 ]*$/.test(str);\n};\n\nNode.prototype._isPrintstr = function isPrintstr(str) {\n  return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n};\n","'use strict';\n\n// Helper\nfunction reverse(map) {\n  const res = {};\n\n  Object.keys(map).forEach(function(key) {\n    // Convert key to integer if it is stringified\n    if ((key | 0) == key)\n      key = key | 0;\n\n    const value = map[key];\n    res[value] = key;\n  });\n\n  return res;\n}\n\nexports.tagClass = {\n  0: 'universal',\n  1: 'application',\n  2: 'context',\n  3: 'private'\n};\nexports.tagClassByName = reverse(exports.tagClass);\n\nexports.tag = {\n  0x00: 'end',\n  0x01: 'bool',\n  0x02: 'int',\n  0x03: 'bitstr',\n  0x04: 'octstr',\n  0x05: 'null_',\n  0x06: 'objid',\n  0x07: 'objDesc',\n  0x08: 'external',\n  0x09: 'real',\n  0x0a: 'enum',\n  0x0b: 'embed',\n  0x0c: 'utf8str',\n  0x0d: 'relativeOid',\n  0x10: 'seq',\n  0x11: 'set',\n  0x12: 'numstr',\n  0x13: 'printstr',\n  0x14: 't61str',\n  0x15: 'videostr',\n  0x16: 'ia5str',\n  0x17: 'utctime',\n  0x18: 'gentime',\n  0x19: 'graphstr',\n  0x1a: 'iso646str',\n  0x1b: 'genstr',\n  0x1c: 'unistr',\n  0x1d: 'charstr',\n  0x1e: 'bmpstr'\n};\nexports.tagByName = reverse(exports.tag);\n","/* eslint-disable no-console */\n'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\nconst Node = require('../base/node');\nconst asn1 = require('../../asn1');\nconst bignum = asn1.bignum;\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DEREncoder(entity) {\n  this.enc = 'der';\n  this.name = entity.name;\n  this.entity = entity;\n\n  // Construct base tree\n  this.tree = new DERNode();\n  this.tree._init(entity.body);\n}\nmodule.exports = DEREncoder;\n\nDEREncoder.prototype.encode = function encode(data, reporter) {\n  return this.tree._encode(data, reporter).join();\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n  Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._encodeComposite = function encodeComposite(tag,\n  primitive,\n  cls,\n  content) {\n  const encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n\n  // Short form\n  if (content.length < 0x80) {\n    const header = Buffer.alloc(2);\n    header[0] = encodedTag;\n    header[1] = content.length;\n    return this._createEncoderBuffer([ header, content ]);\n  }\n\n  // Long form\n  // Count octets required to store length\n  let lenOctets = 1;\n  for (let i = content.length; i >= 0x100; i >>= 8)\n    lenOctets++;\n\n  const header = Buffer.alloc(1 + 1 + lenOctets);\n  header[0] = encodedTag;\n  header[1] = 0x80 | lenOctets;\n\n  for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8)\n    header[i] = j & 0xff;\n\n  return this._createEncoderBuffer([ header, content ]);\n};\n\nDERNode.prototype._encodeStr = function encodeStr(str, tag) {\n  if (tag === 'bitstr') {\n    return this._createEncoderBuffer([ str.unused | 0, str.data ]);\n  } else if (tag === 'bmpstr') {\n    const buf = Buffer.alloc(str.length * 2);\n    for (let i = 0; i < str.length; i++) {\n      buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n    }\n    return this._createEncoderBuffer(buf);\n  } else if (tag === 'numstr') {\n    if (!this._isNumstr(str)) {\n      return this.reporter.error('Encoding of string type: numstr supports ' +\n                                 'only digits and space');\n    }\n    return this._createEncoderBuffer(str);\n  } else if (tag === 'printstr') {\n    if (!this._isPrintstr(str)) {\n      return this.reporter.error('Encoding of string type: printstr supports ' +\n                                 'only latin upper and lower case letters, ' +\n                                 'digits, space, apostrophe, left and rigth ' +\n                                 'parenthesis, plus sign, comma, hyphen, ' +\n                                 'dot, slash, colon, equal sign, ' +\n                                 'question mark');\n    }\n    return this._createEncoderBuffer(str);\n  } else if (/str$/.test(tag)) {\n    return this._createEncoderBuffer(str);\n  } else if (tag === 'objDesc') {\n    return this._createEncoderBuffer(str);\n  } else {\n    return this.reporter.error('Encoding of string type: ' + tag +\n                               ' unsupported');\n  }\n};\n\nDERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) {\n  if (typeof id === 'string') {\n    if (!values)\n      return this.reporter.error('string objid given, but no values map found');\n    if (!values.hasOwnProperty(id))\n      return this.reporter.error('objid not found in values map');\n    id = values[id].split(/[\\s.]+/g);\n    for (let i = 0; i < id.length; i++)\n      id[i] |= 0;\n  } else if (Array.isArray(id)) {\n    id = id.slice();\n    for (let i = 0; i < id.length; i++)\n      id[i] |= 0;\n  }\n\n  if (!Array.isArray(id)) {\n    return this.reporter.error('objid() should be either array or string, ' +\n                               'got: ' + JSON.stringify(id));\n  }\n\n  if (!relative) {\n    if (id[1] >= 40)\n      return this.reporter.error('Second objid identifier OOB');\n    id.splice(0, 2, id[0] * 40 + id[1]);\n  }\n\n  // Count number of octets\n  let size = 0;\n  for (let i = 0; i < id.length; i++) {\n    let ident = id[i];\n    for (size++; ident >= 0x80; ident >>= 7)\n      size++;\n  }\n\n  const objid = Buffer.alloc(size);\n  let offset = objid.length - 1;\n  for (let i = id.length - 1; i >= 0; i--) {\n    let ident = id[i];\n    objid[offset--] = ident & 0x7f;\n    while ((ident >>= 7) > 0)\n      objid[offset--] = 0x80 | (ident & 0x7f);\n  }\n\n  return this._createEncoderBuffer(objid);\n};\n\nfunction two(num) {\n  if (num < 10)\n    return '0' + num;\n  else\n    return num;\n}\n\nDERNode.prototype._encodeTime = function encodeTime(time, tag) {\n  let str;\n  const date = new Date(time);\n\n  if (tag === 'gentime') {\n    str = [\n      two(date.getUTCFullYear()),\n      two(date.getUTCMonth() + 1),\n      two(date.getUTCDate()),\n      two(date.getUTCHours()),\n      two(date.getUTCMinutes()),\n      two(date.getUTCSeconds()),\n      'Z'\n    ].join('');\n  } else if (tag === 'utctime') {\n    str = [\n      two(date.getUTCFullYear() % 100),\n      two(date.getUTCMonth() + 1),\n      two(date.getUTCDate()),\n      two(date.getUTCHours()),\n      two(date.getUTCMinutes()),\n      two(date.getUTCSeconds()),\n      'Z'\n    ].join('');\n  } else {\n    this.reporter.error('Encoding ' + tag + ' time is not supported yet');\n  }\n\n  return this._encodeStr(str, 'octstr');\n};\n\nDERNode.prototype._encodeNull = function encodeNull() {\n  return this._createEncoderBuffer('');\n};\n\nDERNode.prototype._encodeInt = function encodeInt(num, values) {\n  if (typeof num === 'string') {\n    if (!values)\n      return this.reporter.error('String int or enum given, but no values map');\n    if (!values.hasOwnProperty(num)) {\n      return this.reporter.error('Values map doesn\\'t contain: ' +\n                                 JSON.stringify(num));\n    }\n    num = values[num];\n  }\n  // Bignum, assume big endian\n  if (typeof num !== 'number' && !Buffer.isBuffer(num)) {\n    let numArray;\n    if (num.negative) {\n      const bitLength = num.bitLength();\n      let width = Math.ceil(bitLength / 8) * 8;\n\n      if(((bitLength % 8) === 0) && (num.zeroBits() + 1 !== num.bitLength())) {\n        width += 8;\n      }\n      \n      numArray = num.toTwos(width).toArray();\n    }else {\n      numArray = num.toArray();\n\n      if (numArray[0] & 0x80) {\n        numArray.unshift(0);\n      }\n    }\n    num = Buffer.from(numArray);\n  }\n\n  if (Buffer.isBuffer(num)) {\n    let size = num.length;\n    if (num.length === 0)\n      size++;\n\n    const out = Buffer.alloc(size);\n    num.copy(out);\n    if (num.length === 0)\n      out[0] = 0;\n    return this._createEncoderBuffer(out);\n  }\n\n  if (num < 0)\n    return this._encodeInt(new bignum(num));\n  \n  if (num < 0x80)\n    return this._createEncoderBuffer(num);\n\n  if (num < 0x100)\n    return this._createEncoderBuffer([0, num]);\n\n  let size = 1;\n  for (let i = num; i >= 0x100; i >>= 8)\n    size++;\n\n  const out = new Array(size);\n  for (let i = out.length - 1; i >= 0; i--) {\n    out[i] = num & 0xff;\n    num >>= 8;\n  }\n  if(out[0] & 0x80) {\n    out.unshift(0);\n  }\n\n  return this._createEncoderBuffer(Buffer.from(out));\n};\n\nDERNode.prototype._encodeBool = function encodeBool(value) {\n  return this._createEncoderBuffer(value ? 0xff : 0);\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n  if (typeof entity === 'function')\n    entity = entity(obj);\n  return entity._getEncoder('der').tree;\n};\n\nDERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {\n  const state = this._baseState;\n  let i;\n  if (state['default'] === null)\n    return false;\n\n  const data = dataBuffer.join();\n  if (state.defaultBuffer === undefined)\n    state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();\n\n  if (data.length !== state.defaultBuffer.length)\n    return false;\n\n  for (i=0; i < data.length; i++)\n    if (data[i] !== state.defaultBuffer[i])\n      return false;\n\n  return true;\n};\n\n// Utility methods\n\nfunction encodeTag(tag, primitive, cls, reporter) {\n  let res;\n\n  if (tag === 'seqof')\n    tag = 'seq';\n  else if (tag === 'setof')\n    tag = 'set';\n\n  if (der.tagByName.hasOwnProperty(tag))\n    res = der.tagByName[tag];\n  else if (typeof tag === 'number' && (tag | 0) === tag)\n    res = tag;\n  else\n    return reporter.error('Unknown tag: ' + tag);\n\n  if (res >= 0x1f)\n    return reporter.error('Multi-octet tag encoding unsupported');\n\n  if (!primitive)\n    res |= 0x20;\n\n  res |= (der.tagClassByName[cls || 'universal'] << 6);\n\n  return res;\n}\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst DEREncoder = require('./der');\n\nfunction PEMEncoder(entity) {\n  DEREncoder.call(this, entity);\n  this.enc = 'pem';\n}\ninherits(PEMEncoder, DEREncoder);\nmodule.exports = PEMEncoder;\n\nPEMEncoder.prototype.encode = function encode(data, options) {\n  const buf = DEREncoder.prototype.encode.call(this, data);\n\n  const p = buf.toString('base64');\n  const out = [ '-----BEGIN ' + options.label + '-----' ];\n  for (let i = 0; i < p.length; i += 64)\n    out.push(p.slice(i, i + 64));\n  out.push('-----END ' + options.label + '-----');\n  return out.join('\\n');\n};\n","'use strict';\n\nconst encoders = exports;\n\nencoders.der = require('./der');\nencoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst bignum = require('bn.js');\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DERDecoder(entity) {\n  this.enc = 'der';\n  this.name = entity.name;\n  this.entity = entity;\n\n  // Construct base tree\n  this.tree = new DERNode();\n  this.tree._init(entity.body);\n}\nmodule.exports = DERDecoder;\n\nDERDecoder.prototype.decode = function decode(data, options) {\n  if (!DecoderBuffer.isDecoderBuffer(data)) {\n    data = new DecoderBuffer(data, options);\n  }\n\n  return this.tree._decode(data, options);\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n  Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._peekTag = function peekTag(buffer, tag, any) {\n  if (buffer.isEmpty())\n    return false;\n\n  const state = buffer.save();\n  const decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n  if (buffer.isError(decodedTag))\n    return decodedTag;\n\n  buffer.restore(state);\n\n  return decodedTag.tag === tag || decodedTag.tagStr === tag ||\n    (decodedTag.tagStr + 'of') === tag || any;\n};\n\nDERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {\n  const decodedTag = derDecodeTag(buffer,\n    'Failed to decode tag of \"' + tag + '\"');\n  if (buffer.isError(decodedTag))\n    return decodedTag;\n\n  let len = derDecodeLen(buffer,\n    decodedTag.primitive,\n    'Failed to get length of \"' + tag + '\"');\n\n  // Failure\n  if (buffer.isError(len))\n    return len;\n\n  if (!any &&\n      decodedTag.tag !== tag &&\n      decodedTag.tagStr !== tag &&\n      decodedTag.tagStr + 'of' !== tag) {\n    return buffer.error('Failed to match tag: \"' + tag + '\"');\n  }\n\n  if (decodedTag.primitive || len !== null)\n    return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n\n  // Indefinite length... find END tag\n  const state = buffer.save();\n  const res = this._skipUntilEnd(\n    buffer,\n    'Failed to skip indefinite length body: \"' + this.tag + '\"');\n  if (buffer.isError(res))\n    return res;\n\n  len = buffer.offset - state.offset;\n  buffer.restore(state);\n  return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n};\n\nDERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) {\n  for (;;) {\n    const tag = derDecodeTag(buffer, fail);\n    if (buffer.isError(tag))\n      return tag;\n    const len = derDecodeLen(buffer, tag.primitive, fail);\n    if (buffer.isError(len))\n      return len;\n\n    let res;\n    if (tag.primitive || len !== null)\n      res = buffer.skip(len);\n    else\n      res = this._skipUntilEnd(buffer, fail);\n\n    // Failure\n    if (buffer.isError(res))\n      return res;\n\n    if (tag.tagStr === 'end')\n      break;\n  }\n};\n\nDERNode.prototype._decodeList = function decodeList(buffer, tag, decoder,\n  options) {\n  const result = [];\n  while (!buffer.isEmpty()) {\n    const possibleEnd = this._peekTag(buffer, 'end');\n    if (buffer.isError(possibleEnd))\n      return possibleEnd;\n\n    const res = decoder.decode(buffer, 'der', options);\n    if (buffer.isError(res) && possibleEnd)\n      break;\n    result.push(res);\n  }\n  return result;\n};\n\nDERNode.prototype._decodeStr = function decodeStr(buffer, tag) {\n  if (tag === 'bitstr') {\n    const unused = buffer.readUInt8();\n    if (buffer.isError(unused))\n      return unused;\n    return { unused: unused, data: buffer.raw() };\n  } else if (tag === 'bmpstr') {\n    const raw = buffer.raw();\n    if (raw.length % 2 === 1)\n      return buffer.error('Decoding of string type: bmpstr length mismatch');\n\n    let str = '';\n    for (let i = 0; i < raw.length / 2; i++) {\n      str += String.fromCharCode(raw.readUInt16BE(i * 2));\n    }\n    return str;\n  } else if (tag === 'numstr') {\n    const numstr = buffer.raw().toString('ascii');\n    if (!this._isNumstr(numstr)) {\n      return buffer.error('Decoding of string type: ' +\n                          'numstr unsupported characters');\n    }\n    return numstr;\n  } else if (tag === 'octstr') {\n    return buffer.raw();\n  } else if (tag === 'objDesc') {\n    return buffer.raw();\n  } else if (tag === 'printstr') {\n    const printstr = buffer.raw().toString('ascii');\n    if (!this._isPrintstr(printstr)) {\n      return buffer.error('Decoding of string type: ' +\n                          'printstr unsupported characters');\n    }\n    return printstr;\n  } else if (/str$/.test(tag)) {\n    return buffer.raw().toString();\n  } else {\n    return buffer.error('Decoding of string type: ' + tag + ' unsupported');\n  }\n};\n\nDERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) {\n  let result;\n  const identifiers = [];\n  let ident = 0;\n  let subident = 0;\n  while (!buffer.isEmpty()) {\n    subident = buffer.readUInt8();\n    ident <<= 7;\n    ident |= subident & 0x7f;\n    if ((subident & 0x80) === 0) {\n      identifiers.push(ident);\n      ident = 0;\n    }\n  }\n  if (subident & 0x80)\n    identifiers.push(ident);\n\n  const first = (identifiers[0] / 40) | 0;\n  const second = identifiers[0] % 40;\n\n  if (relative)\n    result = identifiers;\n  else\n    result = [first, second].concat(identifiers.slice(1));\n\n  if (values) {\n    let tmp = values[result.join(' ')];\n    if (tmp === undefined)\n      tmp = values[result.join('.')];\n    if (tmp !== undefined)\n      result = tmp;\n  }\n\n  return result;\n};\n\nDERNode.prototype._decodeTime = function decodeTime(buffer, tag) {\n  const str = buffer.raw().toString();\n\n  let year;\n  let mon;\n  let day;\n  let hour;\n  let min;\n  let sec;\n  if (tag === 'gentime') {\n    year = str.slice(0, 4) | 0;\n    mon = str.slice(4, 6) | 0;\n    day = str.slice(6, 8) | 0;\n    hour = str.slice(8, 10) | 0;\n    min = str.slice(10, 12) | 0;\n    sec = str.slice(12, 14) | 0;\n  } else if (tag === 'utctime') {\n    year = str.slice(0, 2) | 0;\n    mon = str.slice(2, 4) | 0;\n    day = str.slice(4, 6) | 0;\n    hour = str.slice(6, 8) | 0;\n    min = str.slice(8, 10) | 0;\n    sec = str.slice(10, 12) | 0;\n    if (year < 70)\n      year = 2000 + year;\n    else\n      year = 1900 + year;\n  } else {\n    return buffer.error('Decoding ' + tag + ' time is not supported yet');\n  }\n\n  return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n};\n\nDERNode.prototype._decodeNull = function decodeNull() {\n  return null;\n};\n\nDERNode.prototype._decodeBool = function decodeBool(buffer) {\n  const res = buffer.readUInt8();\n  if (buffer.isError(res))\n    return res;\n  else\n    return res !== 0;\n};\n\nDERNode.prototype._decodeInt = function decodeInt(buffer, values) {\n  // Bigint, return as it is (assume big endian)\n  const raw = buffer.raw();\n  let res = new bignum(raw);\n  \n  if ((raw[0] & 0x80) > 0) {\n    res = res.fromTwos(raw.length * 8);\n  }\n\n  if (values)\n    res = values[res.toString(10)] || res;\n\n  return res;\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n  if (typeof entity === 'function')\n    entity = entity(obj);\n  return entity._getDecoder('der').tree;\n};\n\n// Utility methods\n\nfunction derDecodeTag(buf, fail) {\n  let tag = buf.readUInt8(fail);\n  if (buf.isError(tag))\n    return tag;\n\n  const cls = der.tagClass[tag >> 6];\n  const primitive = (tag & 0x20) === 0;\n\n  // Multi-octet tag - load\n  if ((tag & 0x1f) === 0x1f) {\n    let oct = tag;\n    tag = 0;\n    while ((oct & 0x80) === 0x80) {\n      oct = buf.readUInt8(fail);\n      if (buf.isError(oct))\n        return oct;\n\n      tag <<= 7;\n      tag |= oct & 0x7f;\n    }\n  } else {\n    tag &= 0x1f;\n  }\n  const tagStr = der.tag[tag];\n\n  return {\n    cls: cls,\n    primitive: primitive,\n    tag: tag,\n    tagStr: tagStr\n  };\n}\n\nfunction derDecodeLen(buf, primitive, fail) {\n  let len = buf.readUInt8(fail);\n  if (buf.isError(len))\n    return len;\n\n  // Indefinite form\n  if (!primitive && len === 0x80)\n    return null;\n\n  // Definite form\n  if ((len & 0x80) === 0) {\n    // Short form\n    return len;\n  }\n\n  // Long form\n  const num = len & 0x7f;\n  if (num > 4)\n    return buf.error('length octect is too long');\n\n  len = 0;\n  for (let i = 0; i < num; i++) {\n    len <<= 8;\n    const j = buf.readUInt8(fail);\n    if (buf.isError(j))\n      return j;\n    len |= j;\n  }\n\n  return len;\n}\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\n\nconst DERDecoder = require('./der');\n\nfunction PEMDecoder(entity) {\n  DERDecoder.call(this, entity);\n  this.enc = 'pem';\n}\ninherits(PEMDecoder, DERDecoder);\nmodule.exports = PEMDecoder;\n\nPEMDecoder.prototype.decode = function decode(data, options) {\n  const lines = data.toString().split(/[\\r\\n]+/g);\n\n  const label = options.label.toUpperCase();\n\n  const re = /^-----(BEGIN|END) ([^-]+)-----$/;\n  let start = -1;\n  let end = -1;\n  for (let i = 0; i < lines.length; i++) {\n    const match = lines[i].match(re);\n    if (match === null)\n      continue;\n\n    if (match[2] !== label)\n      continue;\n\n    if (start === -1) {\n      if (match[1] !== 'BEGIN')\n        break;\n      start = i;\n    } else {\n      if (match[1] !== 'END')\n        break;\n      end = i;\n      break;\n    }\n  }\n  if (start === -1 || end === -1)\n    throw new Error('PEM section not found for: ' + label);\n\n  const base64 = lines.slice(start + 1, end).join('');\n  // Remove excessive symbols\n  base64.replace(/[^a-z0-9+/=]+/gi, '');\n\n  const input = Buffer.from(base64, 'base64');\n  return DERDecoder.prototype.decode.call(this, input, options);\n};\n","'use strict';\n\nconst decoders = exports;\n\ndecoders.der = require('./der');\ndecoders.pem = require('./pem');\n","'use strict';\n\nconst encoders = require('./encoders');\nconst decoders = require('./decoders');\nconst inherits = require('inherits');\n\nconst api = exports;\n\napi.define = function define(name, body) {\n  return new Entity(name, body);\n};\n\nfunction Entity(name, body) {\n  this.name = name;\n  this.body = body;\n\n  this.decoders = {};\n  this.encoders = {};\n}\n\nEntity.prototype._createNamed = function createNamed(Base) {\n  const name = this.name;\n\n  function Generated(entity) {\n    this._initNamed(entity, name);\n  }\n  inherits(Generated, Base);\n  Generated.prototype._initNamed = function _initNamed(entity, name) {\n    Base.call(this, entity, name);\n  };\n\n  return new Generated(this);\n};\n\nEntity.prototype._getDecoder = function _getDecoder(enc) {\n  enc = enc || 'der';\n  // Lazily create decoder\n  if (!this.decoders.hasOwnProperty(enc))\n    this.decoders[enc] = this._createNamed(decoders[enc]);\n  return this.decoders[enc];\n};\n\nEntity.prototype.decode = function decode(data, enc, options) {\n  return this._getDecoder(enc).decode(data, options);\n};\n\nEntity.prototype._getEncoder = function _getEncoder(enc) {\n  enc = enc || 'der';\n  // Lazily create encoder\n  if (!this.encoders.hasOwnProperty(enc))\n    this.encoders[enc] = this._createNamed(encoders[enc]);\n  return this.encoders[enc];\n};\n\nEntity.prototype.encode = function encode(data, enc, /* internal */ reporter) {\n  return this._getEncoder(enc).encode(data, reporter);\n};\n","'use strict';\n\nconst base = exports;\n\nbase.Reporter = require('./reporter').Reporter;\nbase.DecoderBuffer = require('./buffer').DecoderBuffer;\nbase.EncoderBuffer = require('./buffer').EncoderBuffer;\nbase.Node = require('./node');\n","'use strict';\n\nconst constants = exports;\n\n// Helper\nconstants._reverse = function reverse(map) {\n  const res = {};\n\n  Object.keys(map).forEach(function(key) {\n    // Convert key to integer if it is stringified\n    if ((key | 0) == key)\n      key = key | 0;\n\n    const value = map[key];\n    res[value] = key;\n  });\n\n  return res;\n};\n\nconstants.der = require('./der');\n","'use strict';\n\nconst asn1 = exports;\n\nasn1.bignum = require('bn.js');\n\nasn1.define = require('./asn1/api').define;\nasn1.base = require('./asn1/base');\nasn1.constants = require('./asn1/constants');\nasn1.decoders = require('./asn1/decoders');\nasn1.encoders = require('./asn1/encoders');\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.encode_value = encode_value;\nconst buffer_1 = require(\"buffer\");\nconst asn1_1 = __importDefault(require(\"@chromia/asn1\"));\nconst bn_js_1 = __importDefault(require(\"bn.js\"));\nconst ASNDictPair = asn1_1.default.define(\"DictPair\", function () {\n    this.seq().obj(this.key(\"name\").utf8str(), this.key(\"value\").use(GTV_ASN));\n});\nconst GTV_ASN = asn1_1.default.define('GTV', function () {\n    this.choice({\n        null: this.explicit(0).null_(),\n        byteArray: this.explicit(1).octstr(),\n        string: this.explicit(2).utf8str(),\n        integer: this.explicit(3).int(),\n        dict: this.explicit(4).seqof(ASNDictPair),\n        array: this.explicit(5).seqof(GTV_ASN),\n        bigInteger: this.explicit(6).int(),\n    });\n});\nfunction encode_value(value) {\n    const asn = to_asn_object(value);\n    return GTV_ASN.encode(asn, 'der');\n}\nfunction to_asn_object(value) {\n    try {\n        if (value == null) {\n            return { type: \"null\", value: null };\n        }\n        if (buffer_1.Buffer.isBuffer(value)) {\n            return { type: \"byteArray\", value: value };\n        }\n        if (typeof value === \"boolean\") {\n            return { type: \"integer\", value: value ? 1 : 0 };\n        }\n        if (typeof value === \"string\") {\n            return { type: \"string\", value: value };\n        }\n        if (typeof value === \"number\") {\n            if (!Number.isInteger(value)) {\n                throw Error(\"User error: Only integers are supported\");\n            }\n            return { type: \"integer\", value: new bn_js_1.default(value) };\n        }\n        if (typeof value === \"bigint\") {\n            const val = new bn_js_1.default(value.toString());\n            return { type: \"bigInteger\", value: val };\n        }\n        if (value.constructor === Array) {\n            return {\n                type: \"array\",\n                value: value.map(item => to_asn_object(item)),\n            };\n        }\n        if (typeof value === \"object\") {\n            let valueAsDictPair = value;\n            valueAsDictPair = sortDictPairByKey(valueAsDictPair);\n            return {\n                type: \"dict\",\n                value: Object.keys(valueAsDictPair).map(function (key) {\n                    return { name: key, value: to_asn_object(valueAsDictPair[key]) };\n                }),\n            };\n        }\n    }\n    catch (error) {\n        const message = value ? value.toString() : \"RawGtv\";\n        throw new Error(`Failed to encode ${message}: ${error}`);\n    }\n    throw new Error(`value ${value} have unsupported type: ${typeof value}`);\n}\nfunction sortDictPairByKey(dict) {\n    const sortedArray = Object.entries(dict).sort(([keyA], [keyB]) => {\n        if (keyA < keyB) {\n            return -1;\n        }\n        if (keyA > keyB) {\n            return 1;\n        }\n        return 0;\n    });\n    const sortedDict = {};\n    for (const [key, value] of sortedArray) {\n        sortedDict[key] = value;\n    }\n    return sortedDict;\n}\n//# sourceMappingURL=utils.js.map","/*! 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\n// limit of Crypto.getRandomValues()\n// https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues\nvar MAX_BYTES = 65536\n\n// Node supports requesting up to this number of bytes\n// https://github.com/nodejs/node/blob/master/lib/internal/crypto/random.js#L48\nvar MAX_UINT32 = 4294967295\n\nfunction oldBrowser () {\n  throw new Error('Secure random number generation is not supported by this browser.\\nUse Chrome, Firefox or Internet Explorer 11')\n}\n\nvar Buffer = require('safe-buffer').Buffer\nvar crypto = global.crypto || global.msCrypto\n\nif (crypto && crypto.getRandomValues) {\n  module.exports = randomBytes\n} else {\n  module.exports = oldBrowser\n}\n\nfunction randomBytes (size, cb) {\n  // phantomjs needs to throw\n  if (size > MAX_UINT32) throw new RangeError('requested too many random bytes')\n\n  var bytes = Buffer.allocUnsafe(size)\n\n  if (size > 0) {  // getRandomValues fails on IE if size == 0\n    if (size > MAX_BYTES) { // this is the max bytes crypto.getRandomValues\n      // can do at once see https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues\n      for (var generated = 0; generated < size; generated += MAX_BYTES) {\n        // buffer.slice automatically checks if the end is past the end of\n        // the buffer so we don't have to here\n        crypto.getRandomValues(bytes.slice(generated, generated + MAX_BYTES))\n      }\n    } else {\n      crypto.getRandomValues(bytes)\n    }\n  }\n\n  if (typeof cb === 'function') {\n    return process.nextTick(function () {\n      cb(null, bytes)\n    })\n  }\n\n  return bytes\n}\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n  ? R.apply\n  : function ReflectApply(target, receiver, args) {\n    return Function.prototype.apply.call(target, receiver, args);\n  }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n  ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target)\n      .concat(Object.getOwnPropertySymbols(target));\n  };\n} else {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target);\n  };\n}\n\nfunction ProcessEmitWarning(warning) {\n  if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n  return value !== value;\n}\n\nfunction EventEmitter() {\n  EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n  if (typeof listener !== 'function') {\n    throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n  }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n  enumerable: true,\n  get: function() {\n    return defaultMaxListeners;\n  },\n  set: function(arg) {\n    if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n      throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n    }\n    defaultMaxListeners = arg;\n  }\n});\n\nEventEmitter.init = function() {\n\n  if (this._events === undefined ||\n      this._events === Object.getPrototypeOf(this)._events) {\n    this._events = Object.create(null);\n    this._eventsCount = 0;\n  }\n\n  this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n  if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n    throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n  }\n  this._maxListeners = n;\n  return this;\n};\n\nfunction _getMaxListeners(that) {\n  if (that._maxListeners === undefined)\n    return EventEmitter.defaultMaxListeners;\n  return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n  return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n  var args = [];\n  for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n  var doError = (type === 'error');\n\n  var events = this._events;\n  if (events !== undefined)\n    doError = (doError && events.error === undefined);\n  else if (!doError)\n    return false;\n\n  // If there is no 'error' event listener then throw.\n  if (doError) {\n    var er;\n    if (args.length > 0)\n      er = args[0];\n    if (er instanceof Error) {\n      // Note: The comments on the `throw` lines are intentional, they show\n      // up in Node's output if this results in an unhandled exception.\n      throw er; // Unhandled 'error' event\n    }\n    // At least give some kind of context to the user\n    var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n    err.context = er;\n    throw err; // Unhandled 'error' event\n  }\n\n  var handler = events[type];\n\n  if (handler === undefined)\n    return false;\n\n  if (typeof handler === 'function') {\n    ReflectApply(handler, this, args);\n  } else {\n    var len = handler.length;\n    var listeners = arrayClone(handler, len);\n    for (var i = 0; i < len; ++i)\n      ReflectApply(listeners[i], this, args);\n  }\n\n  return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n  var m;\n  var events;\n  var existing;\n\n  checkListener(listener);\n\n  events = target._events;\n  if (events === undefined) {\n    events = target._events = Object.create(null);\n    target._eventsCount = 0;\n  } else {\n    // To avoid recursion in the case that type === \"newListener\"! Before\n    // adding it to the listeners, first emit \"newListener\".\n    if (events.newListener !== undefined) {\n      target.emit('newListener', type,\n                  listener.listener ? listener.listener : listener);\n\n      // Re-assign `events` because a newListener handler could have caused the\n      // this._events to be assigned to a new object\n      events = target._events;\n    }\n    existing = events[type];\n  }\n\n  if (existing === undefined) {\n    // Optimize the case of one listener. Don't need the extra array object.\n    existing = events[type] = listener;\n    ++target._eventsCount;\n  } else {\n    if (typeof existing === 'function') {\n      // Adding the second element, need to change to array.\n      existing = events[type] =\n        prepend ? [listener, existing] : [existing, listener];\n      // If we've already got an array, just append.\n    } else if (prepend) {\n      existing.unshift(listener);\n    } else {\n      existing.push(listener);\n    }\n\n    // Check for listener leak\n    m = _getMaxListeners(target);\n    if (m > 0 && existing.length > m && !existing.warned) {\n      existing.warned = true;\n      // No error code for this since it is a Warning\n      // eslint-disable-next-line no-restricted-syntax\n      var w = new Error('Possible EventEmitter memory leak detected. ' +\n                          existing.length + ' ' + String(type) + ' listeners ' +\n                          'added. Use emitter.setMaxListeners() to ' +\n                          'increase limit');\n      w.name = 'MaxListenersExceededWarning';\n      w.emitter = target;\n      w.type = type;\n      w.count = existing.length;\n      ProcessEmitWarning(w);\n    }\n  }\n\n  return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n  return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n    function prependListener(type, listener) {\n      return _addListener(this, type, listener, true);\n    };\n\nfunction onceWrapper() {\n  if (!this.fired) {\n    this.target.removeListener(this.type, this.wrapFn);\n    this.fired = true;\n    if (arguments.length === 0)\n      return this.listener.call(this.target);\n    return this.listener.apply(this.target, arguments);\n  }\n}\n\nfunction _onceWrap(target, type, listener) {\n  var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n  var wrapped = onceWrapper.bind(state);\n  wrapped.listener = listener;\n  state.wrapFn = wrapped;\n  return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n  checkListener(listener);\n  this.on(type, _onceWrap(this, type, listener));\n  return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n    function prependOnceListener(type, listener) {\n      checkListener(listener);\n      this.prependListener(type, _onceWrap(this, type, listener));\n      return this;\n    };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n    function removeListener(type, listener) {\n      var list, events, position, i, originalListener;\n\n      checkListener(listener);\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      list = events[type];\n      if (list === undefined)\n        return this;\n\n      if (list === listener || list.listener === listener) {\n        if (--this._eventsCount === 0)\n          this._events = Object.create(null);\n        else {\n          delete events[type];\n          if (events.removeListener)\n            this.emit('removeListener', type, list.listener || listener);\n        }\n      } else if (typeof list !== 'function') {\n        position = -1;\n\n        for (i = list.length - 1; i >= 0; i--) {\n          if (list[i] === listener || list[i].listener === listener) {\n            originalListener = list[i].listener;\n            position = i;\n            break;\n          }\n        }\n\n        if (position < 0)\n          return this;\n\n        if (position === 0)\n          list.shift();\n        else {\n          spliceOne(list, position);\n        }\n\n        if (list.length === 1)\n          events[type] = list[0];\n\n        if (events.removeListener !== undefined)\n          this.emit('removeListener', type, originalListener || listener);\n      }\n\n      return this;\n    };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n    function removeAllListeners(type) {\n      var listeners, events, i;\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      // not listening for removeListener, no need to emit\n      if (events.removeListener === undefined) {\n        if (arguments.length === 0) {\n          this._events = Object.create(null);\n          this._eventsCount = 0;\n        } else if (events[type] !== undefined) {\n          if (--this._eventsCount === 0)\n            this._events = Object.create(null);\n          else\n            delete events[type];\n        }\n        return this;\n      }\n\n      // emit removeListener for all listeners on all events\n      if (arguments.length === 0) {\n        var keys = Object.keys(events);\n        var key;\n        for (i = 0; i < keys.length; ++i) {\n          key = keys[i];\n          if (key === 'removeListener') continue;\n          this.removeAllListeners(key);\n        }\n        this.removeAllListeners('removeListener');\n        this._events = Object.create(null);\n        this._eventsCount = 0;\n        return this;\n      }\n\n      listeners = events[type];\n\n      if (typeof listeners === 'function') {\n        this.removeListener(type, listeners);\n      } else if (listeners !== undefined) {\n        // LIFO order\n        for (i = listeners.length - 1; i >= 0; i--) {\n          this.removeListener(type, listeners[i]);\n        }\n      }\n\n      return this;\n    };\n\nfunction _listeners(target, type, unwrap) {\n  var events = target._events;\n\n  if (events === undefined)\n    return [];\n\n  var evlistener = events[type];\n  if (evlistener === undefined)\n    return [];\n\n  if (typeof evlistener === 'function')\n    return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n  return unwrap ?\n    unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n  return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n  return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n  if (typeof emitter.listenerCount === 'function') {\n    return emitter.listenerCount(type);\n  } else {\n    return listenerCount.call(emitter, type);\n  }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n  var events = this._events;\n\n  if (events !== undefined) {\n    var evlistener = events[type];\n\n    if (typeof evlistener === 'function') {\n      return 1;\n    } else if (evlistener !== undefined) {\n      return evlistener.length;\n    }\n  }\n\n  return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n  return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n  var copy = new Array(n);\n  for (var i = 0; i < n; ++i)\n    copy[i] = arr[i];\n  return copy;\n}\n\nfunction spliceOne(list, index) {\n  for (; index + 1 < list.length; index++)\n    list[index] = list[index + 1];\n  list.pop();\n}\n\nfunction unwrapListeners(arr) {\n  var ret = new Array(arr.length);\n  for (var i = 0; i < ret.length; ++i) {\n    ret[i] = arr[i].listener || arr[i];\n  }\n  return ret;\n}\n\nfunction once(emitter, name) {\n  return new Promise(function (resolve, reject) {\n    function errorListener(err) {\n      emitter.removeListener(name, resolver);\n      reject(err);\n    }\n\n    function resolver() {\n      if (typeof emitter.removeListener === 'function') {\n        emitter.removeListener('error', errorListener);\n      }\n      resolve([].slice.call(arguments));\n    };\n\n    eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n    if (name !== 'error') {\n      addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n    }\n  });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n  if (typeof emitter.on === 'function') {\n    eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n  }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n  if (typeof emitter.on === 'function') {\n    if (flags.once) {\n      emitter.once(name, listener);\n    } else {\n      emitter.on(name, listener);\n    }\n  } else if (typeof emitter.addEventListener === 'function') {\n    // EventTarget does not have `error` event semantics like Node\n    // EventEmitters, we do not listen for `error` events here.\n    emitter.addEventListener(name, function wrapListener(arg) {\n      // IE does not have builtin `{ once: true }` support so we\n      // have to do it manually.\n      if (flags.once) {\n        emitter.removeEventListener(name, wrapListener);\n      }\n      listener(arg);\n    });\n  } else {\n    throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n  }\n}\n","module.exports = require('events').EventEmitter;\n","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar _require = require('buffer'),\n  Buffer = _require.Buffer;\nvar _require2 = require('util'),\n  inspect = _require2.inspect;\nvar custom = inspect && inspect.custom || 'inspect';\nfunction copyBuffer(src, target, offset) {\n  Buffer.prototype.copy.call(src, target, offset);\n}\nmodule.exports = /*#__PURE__*/function () {\n  function BufferList() {\n    _classCallCheck(this, BufferList);\n    this.head = null;\n    this.tail = null;\n    this.length = 0;\n  }\n  _createClass(BufferList, [{\n    key: \"push\",\n    value: function push(v) {\n      var entry = {\n        data: v,\n        next: null\n      };\n      if (this.length > 0) this.tail.next = entry;else this.head = entry;\n      this.tail = entry;\n      ++this.length;\n    }\n  }, {\n    key: \"unshift\",\n    value: function unshift(v) {\n      var entry = {\n        data: v,\n        next: this.head\n      };\n      if (this.length === 0) this.tail = entry;\n      this.head = entry;\n      ++this.length;\n    }\n  }, {\n    key: \"shift\",\n    value: function shift() {\n      if (this.length === 0) return;\n      var ret = this.head.data;\n      if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n      --this.length;\n      return ret;\n    }\n  }, {\n    key: \"clear\",\n    value: function clear() {\n      this.head = this.tail = null;\n      this.length = 0;\n    }\n  }, {\n    key: \"join\",\n    value: function join(s) {\n      if (this.length === 0) return '';\n      var p = this.head;\n      var ret = '' + p.data;\n      while (p = p.next) ret += s + p.data;\n      return ret;\n    }\n  }, {\n    key: \"concat\",\n    value: function concat(n) {\n      if (this.length === 0) return Buffer.alloc(0);\n      var ret = Buffer.allocUnsafe(n >>> 0);\n      var p = this.head;\n      var i = 0;\n      while (p) {\n        copyBuffer(p.data, ret, i);\n        i += p.data.length;\n        p = p.next;\n      }\n      return ret;\n    }\n\n    // Consumes a specified amount of bytes or characters from the buffered data.\n  }, {\n    key: \"consume\",\n    value: function consume(n, hasStrings) {\n      var ret;\n      if (n < this.head.data.length) {\n        // `slice` is the same for buffers and strings.\n        ret = this.head.data.slice(0, n);\n        this.head.data = this.head.data.slice(n);\n      } else if (n === this.head.data.length) {\n        // First chunk is a perfect match.\n        ret = this.shift();\n      } else {\n        // Result spans more than one buffer.\n        ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n      }\n      return ret;\n    }\n  }, {\n    key: \"first\",\n    value: function first() {\n      return this.head.data;\n    }\n\n    // Consumes a specified amount of characters from the buffered data.\n  }, {\n    key: \"_getString\",\n    value: function _getString(n) {\n      var p = this.head;\n      var c = 1;\n      var ret = p.data;\n      n -= ret.length;\n      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) this.head = p.next;else this.head = this.tail = null;\n          } else {\n            this.head = p;\n            p.data = str.slice(nb);\n          }\n          break;\n        }\n        ++c;\n      }\n      this.length -= c;\n      return ret;\n    }\n\n    // Consumes a specified amount of bytes from the buffered data.\n  }, {\n    key: \"_getBuffer\",\n    value: function _getBuffer(n) {\n      var ret = Buffer.allocUnsafe(n);\n      var p = this.head;\n      var c = 1;\n      p.data.copy(ret);\n      n -= p.data.length;\n      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) this.head = p.next;else this.head = this.tail = null;\n          } else {\n            this.head = p;\n            p.data = buf.slice(nb);\n          }\n          break;\n        }\n        ++c;\n      }\n      this.length -= c;\n      return ret;\n    }\n\n    // Make sure the linked list only shows the minimal necessary information.\n  }, {\n    key: custom,\n    value: function value(_, options) {\n      return inspect(this, _objectSpread(_objectSpread({}, options), {}, {\n        // Only inspect one level.\n        depth: 0,\n        // It should not recurse.\n        customInspect: false\n      }));\n    }\n  }]);\n  return BufferList;\n}();","'use strict';\n\n// undocumented cb() API, needed for core, not for public API\nfunction destroy(err, cb) {\n  var _this = this;\n  var readableDestroyed = this._readableState && this._readableState.destroyed;\n  var writableDestroyed = this._writableState && this._writableState.destroyed;\n  if (readableDestroyed || writableDestroyed) {\n    if (cb) {\n      cb(err);\n    } else if (err) {\n      if (!this._writableState) {\n        process.nextTick(emitErrorNT, this, err);\n      } else if (!this._writableState.errorEmitted) {\n        this._writableState.errorEmitted = true;\n        process.nextTick(emitErrorNT, this, err);\n      }\n    }\n    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  this._destroy(err || null, function (err) {\n    if (!cb && err) {\n      if (!_this._writableState) {\n        process.nextTick(emitErrorAndCloseNT, _this, err);\n      } else if (!_this._writableState.errorEmitted) {\n        _this._writableState.errorEmitted = true;\n        process.nextTick(emitErrorAndCloseNT, _this, err);\n      } else {\n        process.nextTick(emitCloseNT, _this);\n      }\n    } else if (cb) {\n      process.nextTick(emitCloseNT, _this);\n      cb(err);\n    } else {\n      process.nextTick(emitCloseNT, _this);\n    }\n  });\n  return this;\n}\nfunction emitErrorAndCloseNT(self, err) {\n  emitErrorNT(self, err);\n  emitCloseNT(self);\n}\nfunction emitCloseNT(self) {\n  if (self._writableState && !self._writableState.emitClose) return;\n  if (self._readableState && !self._readableState.emitClose) return;\n  self.emit('close');\n}\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  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}\nfunction emitErrorNT(self, err) {\n  self.emit('error', err);\n}\nfunction errorOrDestroy(stream, err) {\n  // We have tests that rely on errors being emitted\n  // in the same tick, so changing this is semver major.\n  // For now when you opt-in to autoDestroy we allow\n  // the error to be emitted nextTick. In a future\n  // semver major update we should change the default to this.\n\n  var rState = stream._readableState;\n  var wState = stream._writableState;\n  if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\nmodule.exports = {\n  destroy: destroy,\n  undestroy: undestroy,\n  errorOrDestroy: errorOrDestroy\n};","'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n  if (!Base) {\n    Base = Error;\n  }\n\n  function getMessage(arg1, arg2, arg3) {\n    if (typeof message === 'string') {\n      return message;\n    } else {\n      return message(arg1, arg2, arg3);\n    }\n  }\n\n  var NodeError =\n  /*#__PURE__*/\n  function (_Base) {\n    _inheritsLoose(NodeError, _Base);\n\n    function NodeError(arg1, arg2, arg3) {\n      return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n    }\n\n    return NodeError;\n  }(Base);\n\n  NodeError.prototype.name = Base.name;\n  NodeError.prototype.code = code;\n  codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n  if (Array.isArray(expected)) {\n    var len = expected.length;\n    expected = expected.map(function (i) {\n      return String(i);\n    });\n\n    if (len > 2) {\n      return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n    } else if (len === 2) {\n      return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n    } else {\n      return \"of \".concat(thing, \" \").concat(expected[0]);\n    }\n  } else {\n    return \"of \".concat(thing, \" \").concat(String(expected));\n  }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n  return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n  if (this_len === undefined || this_len > str.length) {\n    this_len = str.length;\n  }\n\n  return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n  if (typeof start !== 'number') {\n    start = 0;\n  }\n\n  if (start + search.length > str.length) {\n    return false;\n  } else {\n    return str.indexOf(search, start) !== -1;\n  }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n  return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n  // determiner: 'must be' or 'must not be'\n  var determiner;\n\n  if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n    determiner = 'must not be';\n    expected = expected.replace(/^not /, '');\n  } else {\n    determiner = 'must be';\n  }\n\n  var msg;\n\n  if (endsWith(name, ' argument')) {\n    // For cases like 'first argument'\n    msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n  } else {\n    var type = includes(name, '.') ? 'property' : 'argument';\n    msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n  }\n\n  msg += \". Received type \".concat(typeof actual);\n  return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n  return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n  return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n  return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\n","'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n  return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n  var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n  if (hwm != null) {\n    if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n      var name = isDuplex ? duplexKey : 'highWaterMark';\n      throw new ERR_INVALID_OPT_VALUE(name, hwm);\n    }\n    return Math.floor(hwm);\n  }\n\n  // Default value\n  return state.objectMode ? 16 : 16 * 1024;\n}\nmodule.exports = {\n  getHighWaterMark: getHighWaterMark\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// 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\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  this.next = null;\n  this.entry = null;\n  this.finish = function () {\n    onCorkedFinish(_this, state);\n  };\n}\n/* </replacement> */\n\n/*<replacement>*/\nvar Duplex;\n/*</replacement>*/\n\nWritable.WritableState = WritableState;\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\nvar Buffer = require('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}\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n  getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n  ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n  ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n  ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n  ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n  ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n  ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n  ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n  ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nrequire('inherits')(Writable, Stream);\nfunction nop() {}\nfunction WritableState(options, stream, isDuplex) {\n  Duplex = Duplex || require('./_stream_duplex');\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  // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n  if (typeof isDuplex !== 'boolean') 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  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  this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex);\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  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  // Should close be emitted on destroy. Defaults to true.\n  this.emitClose = options.emitClose !== false;\n\n  // Should .destroy() be called after 'finish' (and potentially 'end')\n  this.autoDestroy = !!options.autoDestroy;\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}\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(function () {\n  try {\n    Object.defineProperty(WritableState.prototype, 'buffer', {\n      get: internalUtil.deprecate(function writableStateBufferGetter() {\n        return this.getBuffer();\n      }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n    });\n  } catch (_) {}\n})();\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 value(object) {\n      if (realHasInstance.call(this, object)) return true;\n      if (this !== Writable) return false;\n      return object && object._writableState instanceof WritableState;\n    }\n  });\n} else {\n  realHasInstance = function realHasInstance(object) {\n    return object instanceof this;\n  };\n}\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\n  // Checking for a Stream.Duplex instance is faster here instead of inside\n  // the WritableState constructor, at least with V8 6.5\n  var isDuplex = this instanceof Duplex;\n  if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n  this._writableState = new WritableState(options, this, isDuplex);\n\n  // legacy.\n  this.writable = true;\n  if (options) {\n    if (typeof options.write === 'function') this._write = options.write;\n    if (typeof options.writev === 'function') this._writev = options.writev;\n    if (typeof options.destroy === 'function') this._destroy = options.destroy;\n    if (typeof options.final === 'function') this._final = options.final;\n  }\n  Stream.call(this);\n}\n\n// Otherwise people can pipe Writable streams, which is just wrong.\nWritable.prototype.pipe = function () {\n  errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\nfunction writeAfterEnd(stream, cb) {\n  var er = new ERR_STREAM_WRITE_AFTER_END();\n  // TODO: defer error events consistently everywhere, not just the cb\n  errorOrDestroy(stream, er);\n  process.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 er;\n  if (chunk === null) {\n    er = new ERR_STREAM_NULL_VALUES();\n  } else if (typeof chunk !== 'string' && !state.objectMode) {\n    er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n  }\n  if (er) {\n    errorOrDestroy(stream, er);\n    process.nextTick(cb, er);\n    return false;\n  }\n  return true;\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  if (isBuf && !Buffer.isBuffer(chunk)) {\n    chunk = _uint8ArrayToBuffer(chunk);\n  }\n  if (typeof encoding === 'function') {\n    cb = encoding;\n    encoding = null;\n  }\n  if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n  if (typeof cb !== 'function') cb = nop;\n  if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n    state.pendingcb++;\n    ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n  }\n  return ret;\n};\nWritable.prototype.cork = function () {\n  this._writableState.corked++;\n};\nWritable.prototype.uncork = function () {\n  var state = this._writableState;\n  if (state.corked) {\n    state.corked--;\n    if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n  }\n};\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n  // node::ParseEncoding() requires lower case.\n  if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n  if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding);\n  this._writableState.defaultEncoding = encoding;\n  return this;\n};\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState && this._writableState.getBuffer();\n  }\n});\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}\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.highWaterMark;\n  }\n});\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  state.length += len;\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  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  return ret;\n}\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n  state.writelen = len;\n  state.writecb = cb;\n  state.writing = true;\n  state.sync = true;\n  if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n  state.sync = false;\n}\nfunction onwriteError(stream, state, sync, er, cb) {\n  --state.pendingcb;\n  if (sync) {\n    // defer the callback if we are being called synchronously\n    // to avoid piling up things on the stack\n    process.nextTick(cb, er);\n    // this can emit finish, and it will always happen\n    // after error\n    process.nextTick(finishMaybe, stream, state);\n    stream._writableState.errorEmitted = true;\n    errorOrDestroy(stream, er);\n  } else {\n    // the caller expect this to happen before if\n    // it is async\n    cb(er);\n    stream._writableState.errorEmitted = true;\n    errorOrDestroy(stream, er);\n    // this can emit finish, but finish must\n    // always follow error\n    finishMaybe(stream, state);\n  }\n}\nfunction onwriteStateUpdate(state) {\n  state.writing = false;\n  state.writecb = null;\n  state.length -= state.writelen;\n  state.writelen = 0;\n}\nfunction onwrite(stream, er) {\n  var state = stream._writableState;\n  var sync = state.sync;\n  var cb = state.writecb;\n  if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\n  onwriteStateUpdate(state);\n  if (er) onwriteError(stream, state, sync, er, cb);else {\n    // Check if we're actually ready to finish, but don't emit yet\n    var finished = needFinish(state) || stream.destroyed;\n    if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n      clearBuffer(stream, state);\n    }\n    if (sync) {\n      process.nextTick(afterWrite, stream, state, finished, cb);\n    } else {\n      afterWrite(stream, state, finished, cb);\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  if (stream._writev && entry && entry.next) {\n    // Fast case, write everything using _writev()\n    var l = state.bufferedRequestCount;\n    var buffer = new Array(l);\n    var holder = state.corkedRequestsFree;\n    holder.entry = entry;\n    var count = 0;\n    var allBuffers = true;\n    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    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      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    if (entry === null) state.lastBufferedRequest = null;\n  }\n  state.bufferedRequest = entry;\n  state.bufferProcessing = false;\n}\nWritable.prototype._write = function (chunk, encoding, cb) {\n  cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()'));\n};\nWritable.prototype._writev = null;\nWritable.prototype.end = function (chunk, encoding, cb) {\n  var state = this._writableState;\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  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  return this;\n};\nObject.defineProperty(Writable.prototype, 'writableLength', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.length;\n  }\n});\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      errorOrDestroy(stream, 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' && !state.destroyed) {\n      state.pendingcb++;\n      state.finalCalled = true;\n      process.nextTick(callFinal, stream, state);\n    } else {\n      state.prefinished = true;\n      stream.emit('prefinish');\n    }\n  }\n}\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      if (state.autoDestroy) {\n        // In case of duplex streams we need a way to detect\n        // if the readable side is ready for autoDestroy as well\n        var rState = stream._readableState;\n        if (!rState || rState.autoDestroy && rState.endEmitted) {\n          stream.destroy();\n        }\n      }\n    }\n  }\n  return need;\n}\nfunction endWritable(stream, state, cb) {\n  state.ending = true;\n  finishMaybe(stream, state);\n  if (cb) {\n    if (state.finished) process.nextTick(cb);else stream.once('finish', cb);\n  }\n  state.ended = true;\n  stream.writable = false;\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}\nObject.defineProperty(Writable.prototype, 'destroyed', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    if (this._writableState === undefined) {\n      return false;\n    }\n    return this._writableState.destroyed;\n  },\n  set: function set(value) {\n    // we ignore the value if the stream\n    // has not been initialized yet\n    if (!this._writableState) {\n      return;\n    }\n\n    // backward compatibility, the user is explicitly\n    // managing destroyed\n    this._writableState.destroyed = value;\n  }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\nWritable.prototype._destroy = function (err, cb) {\n  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 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>*/\nvar objectKeys = Object.keys || function (obj) {\n  var keys = [];\n  for (var key in obj) keys.push(key);\n  return keys;\n};\n/*</replacement>*/\n\nmodule.exports = Duplex;\nvar Readable = require('./_stream_readable');\nvar Writable = require('./_stream_writable');\nrequire('inherits')(Duplex, Readable);\n{\n  // Allow the keys array to be GC'ed.\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}\nfunction Duplex(options) {\n  if (!(this instanceof Duplex)) return new Duplex(options);\n  Readable.call(this, options);\n  Writable.call(this, options);\n  this.allowHalfOpen = true;\n  if (options) {\n    if (options.readable === false) this.readable = false;\n    if (options.writable === false) this.writable = false;\n    if (options.allowHalfOpen === false) {\n      this.allowHalfOpen = false;\n      this.once('end', onend);\n    }\n  }\n}\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.highWaterMark;\n  }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState && this._writableState.getBuffer();\n  }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.length;\n  }\n});\n\n// the no-half-open enforcer\nfunction onend() {\n  // If the writable side ended, then we're ok.\n  if (this._writableState.ended) return;\n\n  // no more data can be written.\n  // But allow more writes to happen in this tick.\n  process.nextTick(onEndNT, this);\n}\nfunction onEndNT(self) {\n  self.end();\n}\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    if (this._readableState === undefined || this._writableState === undefined) {\n      return false;\n    }\n    return this._readableState.destroyed && this._writableState.destroyed;\n  },\n  set: function set(value) {\n    // we ignore the value if the stream\n    // has not been initialized yet\n    if (this._readableState === undefined || this._writableState === undefined) {\n      return;\n    }\n\n    // backward compatibility, the user is explicitly\n    // managing destroyed\n    this._readableState.destroyed = value;\n    this._writableState.destroyed = value;\n  }\n});","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\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}","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\nfunction once(callback) {\n  var called = false;\n  return function () {\n    if (called) return;\n    called = true;\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n    callback.apply(this, args);\n  };\n}\nfunction noop() {}\nfunction isRequest(stream) {\n  return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction eos(stream, opts, callback) {\n  if (typeof opts === 'function') return eos(stream, null, opts);\n  if (!opts) opts = {};\n  callback = once(callback || noop);\n  var readable = opts.readable || opts.readable !== false && stream.readable;\n  var writable = opts.writable || opts.writable !== false && stream.writable;\n  var onlegacyfinish = function onlegacyfinish() {\n    if (!stream.writable) onfinish();\n  };\n  var writableEnded = stream._writableState && stream._writableState.finished;\n  var onfinish = function onfinish() {\n    writable = false;\n    writableEnded = true;\n    if (!readable) callback.call(stream);\n  };\n  var readableEnded = stream._readableState && stream._readableState.endEmitted;\n  var onend = function onend() {\n    readable = false;\n    readableEnded = true;\n    if (!writable) callback.call(stream);\n  };\n  var onerror = function onerror(err) {\n    callback.call(stream, err);\n  };\n  var onclose = function onclose() {\n    var err;\n    if (readable && !readableEnded) {\n      if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n      return callback.call(stream, err);\n    }\n    if (writable && !writableEnded) {\n      if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n      return callback.call(stream, err);\n    }\n  };\n  var onrequest = function onrequest() {\n    stream.req.on('finish', onfinish);\n  };\n  if (isRequest(stream)) {\n    stream.on('complete', onfinish);\n    stream.on('abort', onclose);\n    if (stream.req) onrequest();else stream.on('request', onrequest);\n  } else if (writable && !stream._writableState) {\n    // legacy streams\n    stream.on('end', onlegacyfinish);\n    stream.on('close', onlegacyfinish);\n  }\n  stream.on('end', onend);\n  stream.on('finish', onfinish);\n  if (opts.error !== false) stream.on('error', onerror);\n  stream.on('close', onclose);\n  return function () {\n    stream.removeListener('complete', onfinish);\n    stream.removeListener('abort', onclose);\n    stream.removeListener('request', onrequest);\n    if (stream.req) stream.req.removeListener('finish', onfinish);\n    stream.removeListener('end', onlegacyfinish);\n    stream.removeListener('close', onlegacyfinish);\n    stream.removeListener('finish', onfinish);\n    stream.removeListener('end', onend);\n    stream.removeListener('error', onerror);\n    stream.removeListener('close', onclose);\n  };\n}\nmodule.exports = eos;","'use strict';\n\nvar _Object$setPrototypeO;\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return typeof key === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (typeof input !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (typeof res !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nvar finished = require('./end-of-stream');\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\nfunction createIterResult(value, done) {\n  return {\n    value: value,\n    done: done\n  };\n}\nfunction readAndResolve(iter) {\n  var resolve = iter[kLastResolve];\n  if (resolve !== null) {\n    var data = iter[kStream].read();\n    // we defer if data is null\n    // we can be expecting either 'end' or\n    // 'error'\n    if (data !== null) {\n      iter[kLastPromise] = null;\n      iter[kLastResolve] = null;\n      iter[kLastReject] = null;\n      resolve(createIterResult(data, false));\n    }\n  }\n}\nfunction onReadable(iter) {\n  // we wait for the next tick, because it might\n  // emit an error with process.nextTick\n  process.nextTick(readAndResolve, iter);\n}\nfunction wrapForNext(lastPromise, iter) {\n  return function (resolve, reject) {\n    lastPromise.then(function () {\n      if (iter[kEnded]) {\n        resolve(createIterResult(undefined, true));\n        return;\n      }\n      iter[kHandlePromise](resolve, reject);\n    }, reject);\n  };\n}\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n  get stream() {\n    return this[kStream];\n  },\n  next: function next() {\n    var _this = this;\n    // if we have detected an error in the meanwhile\n    // reject straight away\n    var error = this[kError];\n    if (error !== null) {\n      return Promise.reject(error);\n    }\n    if (this[kEnded]) {\n      return Promise.resolve(createIterResult(undefined, true));\n    }\n    if (this[kStream].destroyed) {\n      // We need to defer via nextTick because if .destroy(err) is\n      // called, the error will be emitted via nextTick, and\n      // we cannot guarantee that there is no error lingering around\n      // waiting to be emitted.\n      return new Promise(function (resolve, reject) {\n        process.nextTick(function () {\n          if (_this[kError]) {\n            reject(_this[kError]);\n          } else {\n            resolve(createIterResult(undefined, true));\n          }\n        });\n      });\n    }\n\n    // if we have multiple next() calls\n    // we will wait for the previous Promise to finish\n    // this logic is optimized to support for await loops,\n    // where next() is only called once at a time\n    var lastPromise = this[kLastPromise];\n    var promise;\n    if (lastPromise) {\n      promise = new Promise(wrapForNext(lastPromise, this));\n    } else {\n      // fast path needed to support multiple this.push()\n      // without triggering the next() queue\n      var data = this[kStream].read();\n      if (data !== null) {\n        return Promise.resolve(createIterResult(data, false));\n      }\n      promise = new Promise(this[kHandlePromise]);\n    }\n    this[kLastPromise] = promise;\n    return promise;\n  }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n  return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n  var _this2 = this;\n  // destroy(err, cb) is a private API\n  // we can guarantee we have that here, because we control the\n  // Readable class this is attached to\n  return new Promise(function (resolve, reject) {\n    _this2[kStream].destroy(null, function (err) {\n      if (err) {\n        reject(err);\n        return;\n      }\n      resolve(createIterResult(undefined, true));\n    });\n  });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n  var _Object$create;\n  var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n    value: stream,\n    writable: true\n  }), _defineProperty(_Object$create, kLastResolve, {\n    value: null,\n    writable: true\n  }), _defineProperty(_Object$create, kLastReject, {\n    value: null,\n    writable: true\n  }), _defineProperty(_Object$create, kError, {\n    value: null,\n    writable: true\n  }), _defineProperty(_Object$create, kEnded, {\n    value: stream._readableState.endEmitted,\n    writable: true\n  }), _defineProperty(_Object$create, kHandlePromise, {\n    value: function value(resolve, reject) {\n      var data = iterator[kStream].read();\n      if (data) {\n        iterator[kLastPromise] = null;\n        iterator[kLastResolve] = null;\n        iterator[kLastReject] = null;\n        resolve(createIterResult(data, false));\n      } else {\n        iterator[kLastResolve] = resolve;\n        iterator[kLastReject] = reject;\n      }\n    },\n    writable: true\n  }), _Object$create));\n  iterator[kLastPromise] = null;\n  finished(stream, function (err) {\n    if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n      var reject = iterator[kLastReject];\n      // reject if we are waiting for data in the Promise\n      // returned by next() and store the error\n      if (reject !== null) {\n        iterator[kLastPromise] = null;\n        iterator[kLastResolve] = null;\n        iterator[kLastReject] = null;\n        reject(err);\n      }\n      iterator[kError] = err;\n      return;\n    }\n    var resolve = iterator[kLastResolve];\n    if (resolve !== null) {\n      iterator[kLastPromise] = null;\n      iterator[kLastResolve] = null;\n      iterator[kLastReject] = null;\n      resolve(createIterResult(undefined, true));\n    }\n    iterator[kEnded] = true;\n  });\n  stream.on('readable', onReadable.bind(null, iterator));\n  return iterator;\n};\nmodule.exports = createReadableStreamAsyncIterator;","module.exports = function () {\n  throw new Error('Readable.from is not available in the browser')\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nmodule.exports = Readable;\n\n/*<replacement>*/\nvar Duplex;\n/*</replacement>*/\n\nReadable.ReadableState = ReadableState;\n\n/*<replacement>*/\nvar EE = require('events').EventEmitter;\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n  return emitter.listeners(type).length;\n};\n/*</replacement>*/\n\n/*<replacement>*/\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\nvar Buffer = require('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>*/\nvar debugUtil = require('util');\nvar debug;\nif (debugUtil && debugUtil.debuglog) {\n  debug = debugUtil.debuglog('stream');\n} else {\n  debug = function debug() {};\n}\n/*</replacement>*/\n\nvar BufferList = require('./internal/streams/buffer_list');\nvar destroyImpl = require('./internal/streams/destroy');\nvar _require = require('./internal/streams/state'),\n  getHighWaterMark = _require.getHighWaterMark;\nvar _require$codes = require('../errors').codes,\n  ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n  ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n  ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n  ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;\n\n// Lazy loaded to improve the startup performance.\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\nrequire('inherits')(Readable, Stream);\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\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 (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\nfunction ReadableState(options, stream, isDuplex) {\n  Duplex = Duplex || require('./_stream_duplex');\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  if (typeof isDuplex !== 'boolean') 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  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  this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex);\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  this.paused = true;\n\n  // Should close be emitted on destroy. Defaults to true.\n  this.emitClose = options.emitClose !== false;\n\n  // Should .destroy() be called after 'end' (and potentially 'finish')\n  this.autoDestroy = !!options.autoDestroy;\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  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}\nfunction Readable(options) {\n  Duplex = Duplex || require('./_stream_duplex');\n  if (!(this instanceof Readable)) return new Readable(options);\n\n  // Checking for a Stream.Duplex instance is faster here instead of inside\n  // the ReadableState constructor, at least with V8 6.5\n  var isDuplex = this instanceof Duplex;\n  this._readableState = new ReadableState(options, this, isDuplex);\n\n  // legacy\n  this.readable = true;\n  if (options) {\n    if (typeof options.read === 'function') this._read = options.read;\n    if (typeof options.destroy === 'function') this._destroy = options.destroy;\n  }\n  Stream.call(this);\n}\nObject.defineProperty(Readable.prototype, 'destroyed', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    if (this._readableState === undefined) {\n      return false;\n    }\n    return this._readableState.destroyed;\n  },\n  set: function set(value) {\n    // we ignore the value if the stream\n    // has not been initialized yet\n    if (!this._readableState) {\n      return;\n    }\n\n    // backward compatibility, the user is explicitly\n    // managing destroyed\n    this._readableState.destroyed = value;\n  }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\nReadable.prototype._destroy = function (err, cb) {\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  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  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};\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n  debug('readableAddChunk', chunk);\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      errorOrDestroy(stream, er);\n    } else if (state.objectMode || chunk && chunk.length > 0) {\n      if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n        chunk = _uint8ArrayToBuffer(chunk);\n      }\n      if (addToFront) {\n        if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n      } else if (state.ended) {\n        errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n      } else if (state.destroyed) {\n        return false;\n      } else {\n        state.reading = false;\n        if (state.decoder && !encoding) {\n          chunk = state.decoder.write(chunk);\n          if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n        } else {\n          addChunk(stream, state, chunk, false);\n        }\n      }\n    } else if (!addToFront) {\n      state.reading = false;\n      maybeReadMore(stream, state);\n    }\n  }\n\n  // We can push more data if we are below the highWaterMark.\n  // Also, if we have no data yet, we can stand some more bytes.\n  // This is to work around cases where hwm=0, such as the repl.\n  return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\nfunction addChunk(stream, state, chunk, addToFront) {\n  if (state.flowing && state.length === 0 && !state.sync) {\n    state.awaitDrain = 0;\n    stream.emit('data', chunk);\n  } else {\n    // update the buffer info.\n    state.length += state.objectMode ? 1 : chunk.length;\n    if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n    if (state.needReadable) emitReadable(stream);\n  }\n  maybeReadMore(stream, state);\n}\nfunction chunkInvalid(state, chunk) {\n  var er;\n  if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n    er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n  }\n  return er;\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  var decoder = new StringDecoder(enc);\n  this._readableState.decoder = decoder;\n  // If setEncoding(null), decoder.encoding equals utf8\n  this._readableState.encoding = this._readableState.decoder.encoding;\n\n  // Iterate over current buffer to convert already stored Buffers:\n  var p = this._readableState.buffer.head;\n  var content = '';\n  while (p !== null) {\n    content += decoder.write(p.data);\n    p = p.next;\n  }\n  this._readableState.buffer.clear();\n  if (content !== '') this._readableState.buffer.push(content);\n  this._readableState.length = content.length;\n  return this;\n};\n\n// Don't raise the hwm > 1GB\nvar MAX_HWM = 0x40000000;\nfunction computeNewHighWaterMark(n) {\n  if (n >= MAX_HWM) {\n    // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\n    n = MAX_HWM;\n  } else {\n    // Get the next highest power of 2 to prevent increasing hwm excessively in\n    // tiny amounts\n    n--;\n    n |= n >>> 1;\n    n |= n >>> 2;\n    n |= n >>> 4;\n    n |= n >>> 8;\n    n |= n >>> 16;\n    n++;\n  }\n  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  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.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) {\n    debug('read: emitReadable', state.length, state.ended);\n    if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n    return null;\n  }\n  n = 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  var ret;\n  if (n > 0) ret = fromList(n, state);else ret = null;\n  if (ret === null) {\n    state.needReadable = state.length <= state.highWaterMark;\n    n = 0;\n  } else {\n    state.length -= n;\n    state.awaitDrain = 0;\n  }\n  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  if (ret !== null) this.emit('data', ret);\n  return ret;\n};\nfunction onEofChunk(stream, state) {\n  debug('onEofChunk');\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  if (state.sync) {\n    // if we are sync, wait until next tick to emit the data.\n    // Otherwise we risk emitting data in the flow()\n    // the readable code triggers during a read() call\n    emitReadable(stream);\n  } else {\n    // emit 'readable' now to make sure it gets picked up.\n    state.needReadable = false;\n    if (!state.emittedReadable) {\n      state.emittedReadable = true;\n      emitReadable_(stream);\n    }\n  }\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  debug('emitReadable', state.needReadable, state.emittedReadable);\n  state.needReadable = false;\n  if (!state.emittedReadable) {\n    debug('emitReadable', state.flowing);\n    state.emittedReadable = true;\n    process.nextTick(emitReadable_, stream);\n  }\n}\nfunction emitReadable_(stream) {\n  var state = stream._readableState;\n  debug('emitReadable_', state.destroyed, state.length, state.ended);\n  if (!state.destroyed && (state.length || state.ended)) {\n    stream.emit('readable');\n    state.emittedReadable = false;\n  }\n\n  // The stream needs another readable event if\n  // 1. It is not flowing, as the flow mechanism will take\n  //    care of it.\n  // 2. It is not ended.\n  // 3. It is below the highWaterMark, so we can schedule\n  //    another readable later.\n  state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\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    process.nextTick(maybeReadMore_, stream, state);\n  }\n}\nfunction maybeReadMore_(stream, state) {\n  // Attempt to read more data if we should.\n  //\n  // The conditions for reading more data are (one of):\n  // - Not enough data buffered (state.length < state.highWaterMark). The loop\n  //   is responsible for filling the buffer with enough data if such data\n  //   is available. If highWaterMark is 0 and we are not in the flowing mode\n  //   we should _not_ attempt to buffer any extra data. We'll get more data\n  //   when the stream consumer calls read() instead.\n  // - No data in the buffer, and the stream is in flowing mode. In this mode\n  //   the loop below is responsible for ensuring read() is called. Failing to\n  //   call read here would abort the flow and there's no other mechanism for\n  //   continuing the flow if the stream consumer has just subscribed to the\n  //   'data' event.\n  //\n  // In addition to the above conditions to keep reading data, the following\n  // conditions prevent the data from being read:\n  // - The stream has ended (state.ended).\n  // - There is already a pending 'read' operation (state.reading). This is a\n  //   case where the the stream has called the implementation defined _read()\n  //   method, but they are processing the call asynchronously and have _not_\n  //   called push() with new data. In this case we skip performing more\n  //   read()s. The execution ends in this method again after the _read() ends\n  //   up calling push() with more data.\n  while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n    var len = state.length;\n    debug('maybeReadMore read 0');\n    stream.read(0);\n    if (len === state.length)\n      // didn't get any data, stop spinning.\n      break;\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  errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\n};\nReadable.prototype.pipe = function (dest, pipeOpts) {\n  var src = this;\n  var state = this._readableState;\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  var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n  var endFn = doEnd ? onend : unpipe;\n  if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn);\n  dest.on('unpipe', onunpipe);\n  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  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  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    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  src.on('data', ondata);\n  function ondata(chunk) {\n    debug('ondata');\n    var ret = dest.write(chunk);\n    debug('dest.write', ret);\n    if (ret === false) {\n      // If the user unpiped during `dest.write()`, it is possible\n      // to get stuck in a permanently paused state if that write\n      // also returned false.\n      // => Check whether `dest` is still a piping destination.\n      if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n        debug('false write response, pause', state.awaitDrain);\n        state.awaitDrain++;\n      }\n      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) errorOrDestroy(dest, 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  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  return dest;\n};\nfunction pipeOnDrain(src) {\n  return function pipeOnDrainFunctionResult() {\n    var state = src._readableState;\n    debug('pipeOnDrain', state.awaitDrain);\n    if (state.awaitDrain) state.awaitDrain--;\n    if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n      state.flowing = true;\n      flow(src);\n    }\n  };\n}\nReadable.prototype.unpipe = function (dest) {\n  var state = this._readableState;\n  var unpipeInfo = {\n    hasUnpiped: false\n  };\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    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    for (var i = 0; i < len; i++) dests[i].emit('unpipe', this, {\n      hasUnpiped: false\n    });\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  state.pipes.splice(index, 1);\n  state.pipesCount -= 1;\n  if (state.pipesCount === 1) state.pipes = state.pipes[0];\n  dest.emit('unpipe', this, unpipeInfo);\n  return this;\n};\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  var state = this._readableState;\n  if (ev === 'data') {\n    // update readableListening so that resume() may be a no-op\n    // a few lines down. This is needed to support once('readable').\n    state.readableListening = this.listenerCount('readable') > 0;\n\n    // Try start flowing on next tick if stream isn't explicitly paused\n    if (state.flowing !== false) this.resume();\n  } else if (ev === 'readable') {\n    if (!state.endEmitted && !state.readableListening) {\n      state.readableListening = state.needReadable = true;\n      state.flowing = false;\n      state.emittedReadable = false;\n      debug('on readable', state.length, state.reading);\n      if (state.length) {\n        emitReadable(this);\n      } else if (!state.reading) {\n        process.nextTick(nReadingNextTick, this);\n      }\n    }\n  }\n  return res;\n};\nReadable.prototype.addListener = Readable.prototype.on;\nReadable.prototype.removeListener = function (ev, fn) {\n  var res = Stream.prototype.removeListener.call(this, ev, fn);\n  if (ev === 'readable') {\n    // We need to check if there is someone still listening to\n    // readable and reset the state. However this needs to happen\n    // after readable has been emitted but before I/O (nextTick) to\n    // support once('readable', fn) cycles. This means that calling\n    // resume within the same tick will have no\n    // effect.\n    process.nextTick(updateReadableListening, this);\n  }\n  return res;\n};\nReadable.prototype.removeAllListeners = function (ev) {\n  var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n  if (ev === 'readable' || ev === undefined) {\n    // We need to check if there is someone still listening to\n    // readable and reset the state. However this needs to happen\n    // after readable has been emitted but before I/O (nextTick) to\n    // support once('readable', fn) cycles. This means that calling\n    // resume within the same tick will have no\n    // effect.\n    process.nextTick(updateReadableListening, this);\n  }\n  return res;\n};\nfunction updateReadableListening(self) {\n  var state = self._readableState;\n  state.readableListening = self.listenerCount('readable') > 0;\n  if (state.resumeScheduled && !state.paused) {\n    // flowing needs to be set to true now, otherwise\n    // the upcoming resume will not flow.\n    state.flowing = true;\n\n    // crude way to check if we should resume\n  } else if (self.listenerCount('data') > 0) {\n    self.resume();\n  }\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    // we flow only if there is no one listening\n    // for readable, but we still have to call\n    // resume()\n    state.flowing = !state.readableListening;\n    resume(this, state);\n  }\n  state.paused = false;\n  return this;\n};\nfunction resume(stream, state) {\n  if (!state.resumeScheduled) {\n    state.resumeScheduled = true;\n    process.nextTick(resume_, stream, state);\n  }\n}\nfunction resume_(stream, state) {\n  debug('resume', state.reading);\n  if (!state.reading) {\n    stream.read(0);\n  }\n  state.resumeScheduled = false;\n  stream.emit('resume');\n  flow(stream);\n  if (state.flowing && !state.reading) stream.read(0);\n}\nReadable.prototype.pause = function () {\n  debug('call pause flowing=%j', this._readableState.flowing);\n  if (this._readableState.flowing !== false) {\n    debug('pause');\n    this._readableState.flowing = false;\n    this.emit('pause');\n  }\n  this._readableState.paused = true;\n  return this;\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  var state = this._readableState;\n  var paused = false;\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    _this.push(null);\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    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 methodWrap(method) {\n        return function methodWrapReturnFunction() {\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  return this;\n};\nif (typeof Symbol === 'function') {\n  Readable.prototype[Symbol.asyncIterator] = function () {\n    if (createReadableStreamAsyncIterator === undefined) {\n      createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n    }\n    return createReadableStreamAsyncIterator(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 get() {\n    return this._readableState.highWaterMark;\n  }\n});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState && this._readableState.buffer;\n  }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState.flowing;\n  },\n  set: function set(state) {\n    if (this._readableState) {\n      this._readableState.flowing = state;\n    }\n  }\n});\n\n// exposed for testing purposes only.\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState.length;\n  }\n});\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  var ret;\n  if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n    // read it all, truncate the list\n    if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length);\n    state.buffer.clear();\n  } else {\n    // read part of list\n    ret = state.buffer.consume(n, state.decoder);\n  }\n  return ret;\n}\nfunction endReadable(stream) {\n  var state = stream._readableState;\n  debug('endReadable', state.endEmitted);\n  if (!state.endEmitted) {\n    state.ended = true;\n    process.nextTick(endReadableNT, state, stream);\n  }\n}\nfunction endReadableNT(state, stream) {\n  debug('endReadableNT', state.endEmitted, state.length);\n\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    if (state.autoDestroy) {\n      // In case of duplex streams we need a way to detect\n      // if the writable side is ready for autoDestroy as well\n      var wState = stream._writableState;\n      if (!wState || wState.autoDestroy && wState.finished) {\n        stream.destroy();\n      }\n    }\n  }\n}\nif (typeof Symbol === 'function') {\n  Readable.from = function (iterable, opts) {\n    if (from === undefined) {\n      from = require('./internal/streams/from');\n    }\n    return from(Readable, iterable, opts);\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}","// 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;\nvar _require$codes = require('../errors').codes,\n  ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n  ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n  ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n  ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\nvar Duplex = require('./_stream_duplex');\nrequire('inherits')(Transform, Duplex);\nfunction afterTransform(er, data) {\n  var ts = this._transformState;\n  ts.transforming = false;\n  var cb = ts.writecb;\n  if (cb === null) {\n    return this.emit('error', new ERR_MULTIPLE_CALLBACK());\n  }\n  ts.writechunk = null;\n  ts.writecb = null;\n  if (data != null)\n    // single equals check for both `null` and `undefined`\n    this.push(data);\n  cb(er);\n  var rs = this._readableState;\n  rs.reading = false;\n  if (rs.needReadable || rs.length < rs.highWaterMark) {\n    this._read(rs.highWaterMark);\n  }\n}\nfunction Transform(options) {\n  if (!(this instanceof Transform)) return new Transform(options);\n  Duplex.call(this, options);\n  this._transformState = {\n    afterTransform: afterTransform.bind(this),\n    needTransform: false,\n    transforming: false,\n    writecb: null,\n    writechunk: null,\n    writeencoding: null\n  };\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  if (options) {\n    if (typeof options.transform === 'function') this._transform = options.transform;\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}\nfunction prefinish() {\n  var _this = this;\n  if (typeof this._flush === 'function' && !this._readableState.destroyed) {\n    this._flush(function (er, data) {\n      done(_this, er, data);\n    });\n  } else {\n    done(this, null, null);\n  }\n}\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  cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\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  if (ts.writechunk !== null && !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};\nTransform.prototype._destroy = function (err, cb) {\n  Duplex.prototype._destroy.call(this, err, function (err2) {\n    cb(err2);\n  });\n};\nfunction done(stream, er, data) {\n  if (er) return stream.emit('error', er);\n  if (data != null)\n    // single equals check for both `null` and `undefined`\n    stream.push(data);\n\n  // TODO(BridgeAR): Write a test for these two error cases\n  // if there's nothing in the write buffer, then that means\n  // that nothing more will ever be provided\n  if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0();\n  if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n  return stream.push(null);\n}","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\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;\nvar Transform = require('./_stream_transform');\nrequire('inherits')(PassThrough, Transform);\nfunction PassThrough(options) {\n  if (!(this instanceof PassThrough)) return new PassThrough(options);\n  Transform.call(this, options);\n}\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n  cb(null, chunk);\n};","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n\n'use strict';\n\nvar eos;\nfunction once(callback) {\n  var called = false;\n  return function () {\n    if (called) return;\n    called = true;\n    callback.apply(void 0, arguments);\n  };\n}\nvar _require$codes = require('../../../errors').codes,\n  ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n  ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\nfunction noop(err) {\n  // Rethrow the error if it exists to avoid swallowing it\n  if (err) throw err;\n}\nfunction isRequest(stream) {\n  return stream.setHeader && typeof stream.abort === 'function';\n}\nfunction destroyer(stream, reading, writing, callback) {\n  callback = once(callback);\n  var closed = false;\n  stream.on('close', function () {\n    closed = true;\n  });\n  if (eos === undefined) eos = require('./end-of-stream');\n  eos(stream, {\n    readable: reading,\n    writable: writing\n  }, function (err) {\n    if (err) return callback(err);\n    closed = true;\n    callback();\n  });\n  var destroyed = false;\n  return function (err) {\n    if (closed) return;\n    if (destroyed) return;\n    destroyed = true;\n\n    // request.destroy just do .end - .abort is what we want\n    if (isRequest(stream)) return stream.abort();\n    if (typeof stream.destroy === 'function') return stream.destroy();\n    callback(err || new ERR_STREAM_DESTROYED('pipe'));\n  };\n}\nfunction call(fn) {\n  fn();\n}\nfunction pipe(from, to) {\n  return from.pipe(to);\n}\nfunction popCallback(streams) {\n  if (!streams.length) return noop;\n  if (typeof streams[streams.length - 1] !== 'function') return noop;\n  return streams.pop();\n}\nfunction pipeline() {\n  for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n    streams[_key] = arguments[_key];\n  }\n  var callback = popCallback(streams);\n  if (Array.isArray(streams[0])) streams = streams[0];\n  if (streams.length < 2) {\n    throw new ERR_MISSING_ARGS('streams');\n  }\n  var error;\n  var destroys = streams.map(function (stream, i) {\n    var reading = i < streams.length - 1;\n    var writing = i > 0;\n    return destroyer(stream, reading, writing, function (err) {\n      if (!error) error = err;\n      if (err) destroys.forEach(call);\n      if (reading) return;\n      destroys.forEach(call);\n      callback(error);\n    });\n  });\n  return streams.reduce(pipe);\n}\nmodule.exports = pipeline;","// 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\nmodule.exports = Stream;\n\nvar EE = require('events').EventEmitter;\nvar inherits = require('inherits');\n\ninherits(Stream, EE);\nStream.Readable = require('readable-stream/lib/_stream_readable.js');\nStream.Writable = require('readable-stream/lib/_stream_writable.js');\nStream.Duplex = require('readable-stream/lib/_stream_duplex.js');\nStream.Transform = require('readable-stream/lib/_stream_transform.js');\nStream.PassThrough = require('readable-stream/lib/_stream_passthrough.js');\nStream.finished = require('readable-stream/lib/internal/streams/end-of-stream.js')\nStream.pipeline = require('readable-stream/lib/internal/streams/pipeline.js')\n\n// Backwards-compat with node 0.4.x\nStream.Stream = Stream;\n\n\n\n// old-style streams.  Note that the pipe method (the only relevant\n// part of this class) is overridden in the Readable class.\n\nfunction Stream() {\n  EE.call(this);\n}\n\nStream.prototype.pipe = function(dest, options) {\n  var source = this;\n\n  function ondata(chunk) {\n    if (dest.writable) {\n      if (false === dest.write(chunk) && source.pause) {\n        source.pause();\n      }\n    }\n  }\n\n  source.on('data', ondata);\n\n  function ondrain() {\n    if (source.readable && source.resume) {\n      source.resume();\n    }\n  }\n\n  dest.on('drain', ondrain);\n\n  // If the 'end' option is not supplied, dest.end() will be called when\n  // source gets the 'end' or 'close' events.  Only dest.end() once.\n  if (!dest._isStdio && (!options || options.end !== false)) {\n    source.on('end', onend);\n    source.on('close', onclose);\n  }\n\n  var didOnEnd = false;\n  function onend() {\n    if (didOnEnd) return;\n    didOnEnd = true;\n\n    dest.end();\n  }\n\n\n  function onclose() {\n    if (didOnEnd) return;\n    didOnEnd = true;\n\n    if (typeof dest.destroy === 'function') dest.destroy();\n  }\n\n  // don't leave dangling pipes when there are errors.\n  function onerror(er) {\n    cleanup();\n    if (EE.listenerCount(this, 'error') === 0) {\n      throw er; // Unhandled stream error in pipe.\n    }\n  }\n\n  source.on('error', onerror);\n  dest.on('error', onerror);\n\n  // remove all the event listeners that were added.\n  function cleanup() {\n    source.removeListener('data', ondata);\n    dest.removeListener('drain', ondrain);\n\n    source.removeListener('end', onend);\n    source.removeListener('close', onclose);\n\n    source.removeListener('error', onerror);\n    dest.removeListener('error', onerror);\n\n    source.removeListener('end', cleanup);\n    source.removeListener('close', cleanup);\n\n    dest.removeListener('close', cleanup);\n  }\n\n  source.on('end', cleanup);\n  source.on('close', cleanup);\n\n  dest.on('close', cleanup);\n\n  dest.emit('pipe', source);\n\n  // Allow for unix-like usage: A.pipe(B).pipe(C)\n  return dest;\n};\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('stream').Transform\nvar inherits = require('inherits')\n\nfunction HashBase (blockSize) {\n  Transform.call(this)\n\n  this._block = Buffer.allocUnsafe(blockSize)\n  this._blockSize = blockSize\n  this._blockOffset = 0\n  this._length = [0, 0, 0, 0]\n\n  this._finalized = false\n}\n\ninherits(HashBase, Transform)\n\nHashBase.prototype._transform = function (chunk, encoding, callback) {\n  var error = null\n  try {\n    this.update(chunk, encoding)\n  } catch (err) {\n    error = err\n  }\n\n  callback(error)\n}\n\nHashBase.prototype._flush = function (callback) {\n  var error = null\n  try {\n    this.push(this.digest())\n  } catch (err) {\n    error = err\n  }\n\n  callback(error)\n}\n\nvar useUint8Array = typeof Uint8Array !== 'undefined'\nvar useArrayBuffer = typeof ArrayBuffer !== 'undefined' &&\n  typeof Uint8Array !== 'undefined' &&\n  ArrayBuffer.isView &&\n  (Buffer.prototype instanceof Uint8Array || Buffer.TYPED_ARRAY_SUPPORT)\n\nfunction toBuffer (data, encoding) {\n  // No need to do anything for exact instance\n  // This is only valid when safe-buffer.Buffer === buffer.Buffer, i.e. when Buffer.from/Buffer.alloc existed\n  if (data instanceof Buffer) return data\n\n  // Convert strings to Buffer\n  if (typeof data === 'string') return Buffer.from(data, encoding)\n\n  /*\n   * Wrap any TypedArray instances and DataViews\n   * Makes sense only on engines with full TypedArray support -- let Buffer detect that\n   */\n  if (useArrayBuffer && ArrayBuffer.isView(data)) {\n    if (data.byteLength === 0) return Buffer.alloc(0) // Bug in Node.js <6.3.1, which treats this as out-of-bounds\n    var res = Buffer.from(data.buffer, data.byteOffset, data.byteLength)\n    // Recheck result size, as offset/length doesn't work on Node.js <5.10\n    // We just go to Uint8Array case if this fails\n    if (res.byteLength === data.byteLength) return res\n  }\n\n  /*\n   * Uint8Array in engines where Buffer.from might not work with ArrayBuffer, just copy over\n   * Doesn't make sense with other TypedArray instances\n   */\n  if (useUint8Array && data instanceof Uint8Array) return Buffer.from(data)\n\n  /*\n   * Old Buffer polyfill on an engine that doesn't have TypedArray support\n   * Also, this is from a different Buffer polyfill implementation then we have, as instanceof check failed\n   * Convert to our current Buffer implementation\n   */\n  if (\n    Buffer.isBuffer(data) &&\n    data.constructor &&\n    typeof data.constructor.isBuffer === 'function' &&\n    data.constructor.isBuffer(data)\n  ) {\n    return Buffer.from(data)\n  }\n\n  throw new TypeError('The \"data\" argument must be of type string or an instance of Buffer, TypedArray, or DataView.')\n}\n\nHashBase.prototype.update = function (data, encoding) {\n  if (this._finalized) throw new Error('Digest already called')\n\n  data = toBuffer(data, encoding) // asserts correct input type\n\n  // consume data\n  var block = this._block\n  var offset = 0\n  while (this._blockOffset + data.length - offset >= this._blockSize) {\n    for (var i = this._blockOffset; i < this._blockSize;) block[i++] = data[offset++]\n    this._update()\n    this._blockOffset = 0\n  }\n  while (offset < data.length) block[this._blockOffset++] = data[offset++]\n\n  // update length\n  for (var j = 0, carry = data.length * 8; carry > 0; ++j) {\n    this._length[j] += carry\n    carry = (this._length[j] / 0x0100000000) | 0\n    if (carry > 0) this._length[j] -= 0x0100000000 * carry\n  }\n\n  return this\n}\n\nHashBase.prototype._update = function () {\n  throw new Error('_update is not implemented')\n}\n\nHashBase.prototype.digest = function (encoding) {\n  if (this._finalized) throw new Error('Digest already called')\n  this._finalized = true\n\n  var digest = this._digest()\n  if (encoding !== undefined) digest = digest.toString(encoding)\n\n  // reset state\n  this._block.fill(0)\n  this._blockOffset = 0\n  for (var i = 0; i < 4; ++i) this._length[i] = 0\n\n  return digest\n}\n\nHashBase.prototype._digest = function () {\n  throw new Error('_digest is not implemented')\n}\n\nmodule.exports = HashBase\n","'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","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n  return toString.call(arr) == '[object Array]';\n};\n","'use strict';\n\n/** @type {import('./type')} */\nmodule.exports = TypeError;\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\n/** @type {import('./isNaN')} */\nmodule.exports = Number.isNaN || function isNaN(a) {\n\treturn a !== a;\n};\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('./gOPD')} */\nmodule.exports = Object.getOwnPropertyDescriptor;\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('.')} */\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\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 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('./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\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\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","'use strict';\n\n/** @type {import('./functionCall')} */\nmodule.exports = Function.prototype.call;\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 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\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 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 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\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 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\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 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 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\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 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\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 $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\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 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\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 hasSymbols = require('has-symbols/shams');\n\n/** @type {import('.')} */\nmodule.exports = function hasToStringTagShams() {\n\treturn hasSymbols() && !!Symbol.toStringTag;\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\t// @ts-expect-error TODO: fix\n\t\t\tcache['$' + typedArray] = callBind(descriptor.get);\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\tcache[\n\t\t\t\t/** @type {`$${import('.').TypedArrayName}`} */ ('$' + typedArray)\n\t\t\t] = /** @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}\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 whichTypedArray = require('which-typed-array');\n\n/** @type {import('.')} */\nmodule.exports = function isTypedArray(value) {\n\treturn !!whichTypedArray(value);\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\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","'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\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';\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 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};","// 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'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}","// 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}","// 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};","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","'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('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\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","'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\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 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\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\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';\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\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","'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 Buffer = require('safe-buffer').Buffer\n\nvar Base = require('cipher-base')\n\nvar ZEROS = Buffer.alloc(128)\nvar blocksize = 64\n\nfunction Hmac (alg, key) {\n  Base.call(this, 'digest')\n  if (typeof key === 'string') {\n    key = Buffer.from(key)\n  }\n\n  this._alg = alg\n  this._key = key\n\n  if (key.length > blocksize) {\n    key = alg(key)\n  } else if (key.length < blocksize) {\n    key = Buffer.concat([key, ZEROS], blocksize)\n  }\n\n  var ipad = this._ipad = Buffer.allocUnsafe(blocksize)\n  var opad = this._opad = Buffer.allocUnsafe(blocksize)\n\n  for (var i = 0; i < blocksize; i++) {\n    ipad[i] = key[i] ^ 0x36\n    opad[i] = key[i] ^ 0x5C\n  }\n\n  this._hash = [ipad]\n}\n\ninherits(Hmac, Base)\n\nHmac.prototype._update = function (data) {\n  this._hash.push(data)\n}\n\nHmac.prototype._final = function () {\n  var h = this._alg(Buffer.concat(this._hash))\n  return this._alg(Buffer.concat([this._opad, h]))\n}\nmodule.exports = Hmac\n","var MD5 = require('md5.js')\n\nmodule.exports = function (buffer) {\n  return new MD5().update(buffer).digest()\n}\n","'use strict'\nvar inherits = require('inherits')\nvar Legacy = require('./legacy')\nvar Base = require('cipher-base')\nvar Buffer = require('safe-buffer').Buffer\nvar md5 = require('create-hash/md5')\nvar RIPEMD160 = require('ripemd160')\n\nvar sha = require('sha.js')\n\nvar ZEROS = Buffer.alloc(128)\n\nfunction Hmac (alg, key) {\n  Base.call(this, 'digest')\n  if (typeof key === 'string') {\n    key = Buffer.from(key)\n  }\n\n  var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64\n\n  this._alg = alg\n  this._key = key\n  if (key.length > blocksize) {\n    var hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg)\n    key = hash.update(key).digest()\n  } else if (key.length < blocksize) {\n    key = Buffer.concat([key, ZEROS], blocksize)\n  }\n\n  var ipad = this._ipad = Buffer.allocUnsafe(blocksize)\n  var opad = this._opad = Buffer.allocUnsafe(blocksize)\n\n  for (var i = 0; i < blocksize; i++) {\n    ipad[i] = key[i] ^ 0x36\n    opad[i] = key[i] ^ 0x5C\n  }\n  this._hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg)\n  this._hash.update(ipad)\n}\n\ninherits(Hmac, Base)\n\nHmac.prototype._update = function (data) {\n  this._hash.update(data)\n}\n\nHmac.prototype._final = function () {\n  var h = this._hash.digest()\n  var hash = this._alg === 'rmd160' ? new RIPEMD160() : sha(this._alg)\n  return hash.update(this._opad).update(h).digest()\n}\n\nmodule.exports = function createHmac (alg, key) {\n  alg = alg.toLowerCase()\n  if (alg === 'rmd160' || alg === 'ripemd160') {\n    return new Hmac('rmd160', key)\n  }\n  if (alg === 'md5') {\n    return new Legacy(md5, key)\n  }\n  return new Hmac(alg, key)\n}\n","'use strict';\n\nmodule.exports = require('./browser/algorithms.json');\n","'use strict';\n\nvar $isFinite = isFinite;\nvar MAX_ALLOC = Math.pow(2, 30) - 1; // default in iojs\n\nmodule.exports = function (iterations, keylen) {\n\tif (typeof iterations !== 'number') {\n\t\tthrow new TypeError('Iterations not a number');\n\t}\n\n\tif (iterations < 0 || !$isFinite(iterations)) {\n\t\tthrow new TypeError('Bad iterations');\n\t}\n\n\tif (typeof keylen !== 'number') {\n\t\tthrow new TypeError('Key length not a number');\n\t}\n\n\tif (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) { /* eslint no-self-compare: 0 */\n\t\tthrow new TypeError('Bad key length');\n\t}\n};\n","'use strict';\n\nvar defaultEncoding;\n/* istanbul ignore next */\nif (global.process && global.process.browser) {\n\tdefaultEncoding = 'utf-8';\n} else if (global.process && global.process.version) {\n\tvar pVersionMajor = parseInt(process.version.split('.')[0].slice(1), 10);\n\n\tdefaultEncoding = pVersionMajor >= 6 ? 'utf-8' : 'binary';\n} else {\n\tdefaultEncoding = 'utf-8';\n}\nmodule.exports = defaultEncoding;\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, name) {\n\tif (\n\t\ttypeof thing === 'string'\n\t\t|| Buffer.isBuffer(thing)\n\t\t|| (useUint8Array && thing instanceof Uint8Array)\n\t\t|| (isView && isView(thing))\n\t) {\n\t\treturn toBuffer(thing, encoding);\n\t}\n\tthrow new TypeError(name + ' must be a string, a Buffer, a Uint8Array, or a DataView');\n};\n","'use strict';\n\nvar md5 = require('create-hash/md5');\nvar RIPEMD160 = require('ripemd160');\nvar sha = require('sha.js');\nvar Buffer = require('safe-buffer').Buffer;\n\nvar checkParameters = require('./precondition');\nvar defaultEncoding = require('./default-encoding');\nvar toBuffer = require('./to-buffer');\n\nvar ZEROS = Buffer.alloc(128);\nvar sizes = {\n\t__proto__: null,\n\tmd5: 16,\n\tsha1: 20,\n\tsha224: 28,\n\tsha256: 32,\n\tsha384: 48,\n\tsha512: 64,\n\t'sha512-256': 32,\n\tripemd160: 20,\n\trmd160: 20\n};\n\nvar mapping = {\n\t__proto__: null,\n\t'sha-1': 'sha1',\n\t'sha-224': 'sha224',\n\t'sha-256': 'sha256',\n\t'sha-384': 'sha384',\n\t'sha-512': 'sha512',\n\t'ripemd-160': 'ripemd160'\n};\n\nfunction rmd160Func(data) {\n\treturn new RIPEMD160().update(data).digest();\n}\n\nfunction getDigest(alg) {\n\tfunction shaFunc(data) {\n\t\treturn sha(alg).update(data).digest();\n\t}\n\n\tif (alg === 'rmd160' || alg === 'ripemd160') {\n\t\treturn rmd160Func;\n\t}\n\tif (alg === 'md5') {\n\t\treturn md5;\n\t}\n\treturn shaFunc;\n}\n\nfunction Hmac(alg, key, saltLen) {\n\tvar hash = getDigest(alg);\n\tvar blocksize = alg === 'sha512' || alg === 'sha384' ? 128 : 64;\n\n\tif (key.length > blocksize) {\n\t\tkey = hash(key);\n\t} else if (key.length < blocksize) {\n\t\tkey = Buffer.concat([key, ZEROS], blocksize);\n\t}\n\n\tvar ipad = Buffer.allocUnsafe(blocksize + sizes[alg]);\n\tvar opad = Buffer.allocUnsafe(blocksize + sizes[alg]);\n\tfor (var i = 0; i < blocksize; i++) {\n\t\tipad[i] = key[i] ^ 0x36;\n\t\topad[i] = key[i] ^ 0x5C;\n\t}\n\n\tvar ipad1 = Buffer.allocUnsafe(blocksize + saltLen + 4);\n\tipad.copy(ipad1, 0, 0, blocksize);\n\tthis.ipad1 = ipad1;\n\tthis.ipad2 = ipad;\n\tthis.opad = opad;\n\tthis.alg = alg;\n\tthis.blocksize = blocksize;\n\tthis.hash = hash;\n\tthis.size = sizes[alg];\n}\n\nHmac.prototype.run = function (data, ipad) {\n\tdata.copy(ipad, this.blocksize);\n\tvar h = this.hash(ipad);\n\th.copy(this.opad, this.blocksize);\n\treturn this.hash(this.opad);\n};\n\nfunction pbkdf2(password, salt, iterations, keylen, digest) {\n\tcheckParameters(iterations, keylen);\n\tpassword = toBuffer(password, defaultEncoding, 'Password');\n\tsalt = toBuffer(salt, defaultEncoding, 'Salt');\n\n\tvar lowerDigest = (digest || 'sha1').toLowerCase();\n\tvar mappedDigest = mapping[lowerDigest] || lowerDigest;\n\tvar size = sizes[mappedDigest];\n\tif (typeof size !== 'number' || !size) {\n\t\tthrow new TypeError('Digest algorithm not supported: ' + digest);\n\t}\n\n\tvar hmac = new Hmac(mappedDigest, password, salt.length);\n\n\tvar DK = Buffer.allocUnsafe(keylen);\n\tvar block1 = Buffer.allocUnsafe(salt.length + 4);\n\tsalt.copy(block1, 0, 0, salt.length);\n\n\tvar destPos = 0;\n\tvar hLen = size;\n\tvar l = Math.ceil(keylen / hLen);\n\n\tfor (var i = 1; i <= l; i++) {\n\t\tblock1.writeUInt32BE(i, salt.length);\n\n\t\tvar T = hmac.run(block1, hmac.ipad1);\n\t\tvar U = T;\n\n\t\tfor (var j = 1; j < iterations; j++) {\n\t\t\tU = hmac.run(U, hmac.ipad2);\n\t\t\tfor (var k = 0; k < hLen; k++) {\n\t\t\t\tT[k] ^= U[k];\n\t\t\t}\n\t\t}\n\n\t\tT.copy(DK, destPos);\n\t\tdestPos += hLen;\n\t}\n\n\treturn DK;\n}\n\nmodule.exports = pbkdf2;\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar checkParameters = require('./precondition');\nvar defaultEncoding = require('./default-encoding');\nvar sync = require('./sync');\nvar toBuffer = require('./to-buffer');\n\nvar ZERO_BUF;\nvar subtle = global.crypto && global.crypto.subtle;\nvar toBrowser = {\n\tsha: 'SHA-1',\n\t'sha-1': 'SHA-1',\n\tsha1: 'SHA-1',\n\tsha256: 'SHA-256',\n\t'sha-256': 'SHA-256',\n\tsha384: 'SHA-384',\n\t'sha-384': 'SHA-384',\n\t'sha-512': 'SHA-512',\n\tsha512: 'SHA-512'\n};\nvar checks = [];\nvar nextTick;\nfunction getNextTick() {\n\tif (nextTick) {\n\t\treturn nextTick;\n\t}\n\tif (global.process && global.process.nextTick) {\n\t\tnextTick = global.process.nextTick;\n\t} else if (global.queueMicrotask) {\n\t\tnextTick = global.queueMicrotask;\n\t} else if (global.setImmediate) {\n\t\tnextTick = global.setImmediate;\n\t} else {\n\t\tnextTick = global.setTimeout;\n\t}\n\treturn nextTick;\n}\nfunction browserPbkdf2(password, salt, iterations, length, algo) {\n\treturn subtle.importKey('raw', password, { name: 'PBKDF2' }, false, ['deriveBits']).then(function (key) {\n\t\treturn subtle.deriveBits({\n\t\t\tname: 'PBKDF2',\n\t\t\tsalt: salt,\n\t\t\titerations: iterations,\n\t\t\thash: {\n\t\t\t\tname: algo\n\t\t\t}\n\t\t}, key, length << 3);\n\t}).then(function (res) {\n\t\treturn Buffer.from(res);\n\t});\n}\nfunction checkNative(algo) {\n\tif (global.process && !global.process.browser) {\n\t\treturn Promise.resolve(false);\n\t}\n\tif (!subtle || !subtle.importKey || !subtle.deriveBits) {\n\t\treturn Promise.resolve(false);\n\t}\n\tif (checks[algo] !== undefined) {\n\t\treturn checks[algo];\n\t}\n\tZERO_BUF = ZERO_BUF || Buffer.alloc(8);\n\tvar prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n\t\t.then(\n\t\t\tfunction () { return true; },\n\t\t\tfunction () { return false; }\n\t\t);\n\tchecks[algo] = prom;\n\treturn prom;\n}\n\nfunction resolvePromise(promise, callback) {\n\tpromise.then(function (out) {\n\t\tgetNextTick()(function () {\n\t\t\tcallback(null, out);\n\t\t});\n\t}, function (e) {\n\t\tgetNextTick()(function () {\n\t\t\tcallback(e);\n\t\t});\n\t});\n}\nmodule.exports = function (password, salt, iterations, keylen, digest, callback) {\n\tif (typeof digest === 'function') {\n\t\tcallback = digest;\n\t\tdigest = undefined;\n\t}\n\n\tcheckParameters(iterations, keylen);\n\tpassword = toBuffer(password, defaultEncoding, 'Password');\n\tsalt = toBuffer(salt, defaultEncoding, 'Salt');\n\tif (typeof callback !== 'function') {\n\t\tthrow new Error('No callback provided to pbkdf2');\n\t}\n\n\tdigest = digest || 'sha1';\n\tvar algo = toBrowser[digest.toLowerCase()];\n\n\tif (!algo || typeof global.Promise !== 'function') {\n\t\tgetNextTick()(function () {\n\t\t\tvar out;\n\t\t\ttry {\n\t\t\t\tout = sync(password, salt, iterations, keylen, digest);\n\t\t\t} catch (e) {\n\t\t\t\tcallback(e);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tcallback(null, out);\n\t\t});\n\t\treturn;\n\t}\n\n\tresolvePromise(checkNative(algo).then(function (resp) {\n\t\tif (resp) {\n\t\t\treturn browserPbkdf2(password, salt, iterations, keylen, algo);\n\t\t}\n\n\t\treturn sync(password, salt, iterations, keylen, digest);\n\t}), callback);\n};\n","'use strict';\n\nexports.pbkdf2 = require('./lib/async');\nexports.pbkdf2Sync = require('./lib/sync');\n","'use strict';\n\nexports.readUInt32BE = function readUInt32BE(bytes, off) {\n  var res =  (bytes[0 + off] << 24) |\n             (bytes[1 + off] << 16) |\n             (bytes[2 + off] << 8) |\n             bytes[3 + off];\n  return res >>> 0;\n};\n\nexports.writeUInt32BE = function writeUInt32BE(bytes, value, off) {\n  bytes[0 + off] = value >>> 24;\n  bytes[1 + off] = (value >>> 16) & 0xff;\n  bytes[2 + off] = (value >>> 8) & 0xff;\n  bytes[3 + off] = value & 0xff;\n};\n\nexports.ip = function ip(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  for (var i = 6; i >= 0; i -= 2) {\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inR >>> (j + i)) & 1;\n    }\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inL >>> (j + i)) & 1;\n    }\n  }\n\n  for (var i = 6; i >= 0; i -= 2) {\n    for (var j = 1; j <= 25; j += 8) {\n      outR <<= 1;\n      outR |= (inR >>> (j + i)) & 1;\n    }\n    for (var j = 1; j <= 25; j += 8) {\n      outR <<= 1;\n      outR |= (inL >>> (j + i)) & 1;\n    }\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.rip = function rip(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  for (var i = 0; i < 4; i++) {\n    for (var j = 24; j >= 0; j -= 8) {\n      outL <<= 1;\n      outL |= (inR >>> (j + i)) & 1;\n      outL <<= 1;\n      outL |= (inL >>> (j + i)) & 1;\n    }\n  }\n  for (var i = 4; i < 8; i++) {\n    for (var j = 24; j >= 0; j -= 8) {\n      outR <<= 1;\n      outR |= (inR >>> (j + i)) & 1;\n      outR <<= 1;\n      outR |= (inL >>> (j + i)) & 1;\n    }\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.pc1 = function pc1(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  // 7, 15, 23, 31, 39, 47, 55, 63\n  // 6, 14, 22, 30, 39, 47, 55, 63\n  // 5, 13, 21, 29, 39, 47, 55, 63\n  // 4, 12, 20, 28\n  for (var i = 7; i >= 5; i--) {\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inR >> (j + i)) & 1;\n    }\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inL >> (j + i)) & 1;\n    }\n  }\n  for (var j = 0; j <= 24; j += 8) {\n    outL <<= 1;\n    outL |= (inR >> (j + i)) & 1;\n  }\n\n  // 1, 9, 17, 25, 33, 41, 49, 57\n  // 2, 10, 18, 26, 34, 42, 50, 58\n  // 3, 11, 19, 27, 35, 43, 51, 59\n  // 36, 44, 52, 60\n  for (var i = 1; i <= 3; i++) {\n    for (var j = 0; j <= 24; j += 8) {\n      outR <<= 1;\n      outR |= (inR >> (j + i)) & 1;\n    }\n    for (var j = 0; j <= 24; j += 8) {\n      outR <<= 1;\n      outR |= (inL >> (j + i)) & 1;\n    }\n  }\n  for (var j = 0; j <= 24; j += 8) {\n    outR <<= 1;\n    outR |= (inL >> (j + i)) & 1;\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.r28shl = function r28shl(num, shift) {\n  return ((num << shift) & 0xfffffff) | (num >>> (28 - shift));\n};\n\nvar pc2table = [\n  // inL => outL\n  14, 11, 17, 4, 27, 23, 25, 0,\n  13, 22, 7, 18, 5, 9, 16, 24,\n  2, 20, 12, 21, 1, 8, 15, 26,\n\n  // inR => outR\n  15, 4, 25, 19, 9, 1, 26, 16,\n  5, 11, 23, 8, 12, 7, 17, 0,\n  22, 3, 10, 14, 6, 20, 27, 24\n];\n\nexports.pc2 = function pc2(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  var len = pc2table.length >>> 1;\n  for (var i = 0; i < len; i++) {\n    outL <<= 1;\n    outL |= (inL >>> pc2table[i]) & 0x1;\n  }\n  for (var i = len; i < pc2table.length; i++) {\n    outR <<= 1;\n    outR |= (inR >>> pc2table[i]) & 0x1;\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.expand = function expand(r, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  outL = ((r & 1) << 5) | (r >>> 27);\n  for (var i = 23; i >= 15; i -= 4) {\n    outL <<= 6;\n    outL |= (r >>> i) & 0x3f;\n  }\n  for (var i = 11; i >= 3; i -= 4) {\n    outR |= (r >>> i) & 0x3f;\n    outR <<= 6;\n  }\n  outR |= ((r & 0x1f) << 1) | (r >>> 31);\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nvar sTable = [\n  14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1,\n  3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8,\n  4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7,\n  15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13,\n\n  15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14,\n  9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5,\n  0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2,\n  5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9,\n\n  10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10,\n  1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1,\n  13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7,\n  11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12,\n\n  7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3,\n  1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9,\n  10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8,\n  15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14,\n\n  2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1,\n  8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6,\n  4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n  15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3,\n\n  12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5,\n  0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8,\n  9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10,\n  7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13,\n\n  4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10,\n  3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6,\n  1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7,\n  10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12,\n\n  13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4,\n  10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2,\n  7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13,\n  0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11\n];\n\nexports.substitute = function substitute(inL, inR) {\n  var out = 0;\n  for (var i = 0; i < 4; i++) {\n    var b = (inL >>> (18 - i * 6)) & 0x3f;\n    var sb = sTable[i * 0x40 + b];\n\n    out <<= 4;\n    out |= sb;\n  }\n  for (var i = 0; i < 4; i++) {\n    var b = (inR >>> (18 - i * 6)) & 0x3f;\n    var sb = sTable[4 * 0x40 + i * 0x40 + b];\n\n    out <<= 4;\n    out |= sb;\n  }\n  return out >>> 0;\n};\n\nvar permuteTable = [\n  16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22,\n  30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28, 7\n];\n\nexports.permute = function permute(num) {\n  var out = 0;\n  for (var i = 0; i < permuteTable.length; i++) {\n    out <<= 1;\n    out |= (num >>> permuteTable[i]) & 0x1;\n  }\n  return out >>> 0;\n};\n\nexports.padSplit = function padSplit(num, size, group) {\n  var str = num.toString(2);\n  while (str.length < size)\n    str = '0' + str;\n\n  var out = [];\n  for (var i = 0; i < size; i += group)\n    out.push(str.slice(i, i + group));\n  return out.join(' ');\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\n\nfunction Cipher(options) {\n  this.options = options;\n\n  this.type = this.options.type;\n  this.blockSize = 8;\n  this._init();\n\n  this.buffer = new Array(this.blockSize);\n  this.bufferOff = 0;\n  this.padding = options.padding !== false\n}\nmodule.exports = Cipher;\n\nCipher.prototype._init = function _init() {\n  // Might be overrided\n};\n\nCipher.prototype.update = function update(data) {\n  if (data.length === 0)\n    return [];\n\n  if (this.type === 'decrypt')\n    return this._updateDecrypt(data);\n  else\n    return this._updateEncrypt(data);\n};\n\nCipher.prototype._buffer = function _buffer(data, off) {\n  // Append data to buffer\n  var min = Math.min(this.buffer.length - this.bufferOff, data.length - off);\n  for (var i = 0; i < min; i++)\n    this.buffer[this.bufferOff + i] = data[off + i];\n  this.bufferOff += min;\n\n  // Shift next\n  return min;\n};\n\nCipher.prototype._flushBuffer = function _flushBuffer(out, off) {\n  this._update(this.buffer, 0, out, off);\n  this.bufferOff = 0;\n  return this.blockSize;\n};\n\nCipher.prototype._updateEncrypt = function _updateEncrypt(data) {\n  var inputOff = 0;\n  var outputOff = 0;\n\n  var count = ((this.bufferOff + data.length) / this.blockSize) | 0;\n  var out = new Array(count * this.blockSize);\n\n  if (this.bufferOff !== 0) {\n    inputOff += this._buffer(data, inputOff);\n\n    if (this.bufferOff === this.buffer.length)\n      outputOff += this._flushBuffer(out, outputOff);\n  }\n\n  // Write blocks\n  var max = data.length - ((data.length - inputOff) % this.blockSize);\n  for (; inputOff < max; inputOff += this.blockSize) {\n    this._update(data, inputOff, out, outputOff);\n    outputOff += this.blockSize;\n  }\n\n  // Queue rest\n  for (; inputOff < data.length; inputOff++, this.bufferOff++)\n    this.buffer[this.bufferOff] = data[inputOff];\n\n  return out;\n};\n\nCipher.prototype._updateDecrypt = function _updateDecrypt(data) {\n  var inputOff = 0;\n  var outputOff = 0;\n\n  var count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1;\n  var out = new Array(count * this.blockSize);\n\n  // TODO(indutny): optimize it, this is far from optimal\n  for (; count > 0; count--) {\n    inputOff += this._buffer(data, inputOff);\n    outputOff += this._flushBuffer(out, outputOff);\n  }\n\n  // Buffer rest of the input\n  inputOff += this._buffer(data, inputOff);\n\n  return out;\n};\n\nCipher.prototype.final = function final(buffer) {\n  var first;\n  if (buffer)\n    first = this.update(buffer);\n\n  var last;\n  if (this.type === 'encrypt')\n    last = this._finalEncrypt();\n  else\n    last = this._finalDecrypt();\n\n  if (first)\n    return first.concat(last);\n  else\n    return last;\n};\n\nCipher.prototype._pad = function _pad(buffer, off) {\n  if (off === 0)\n    return false;\n\n  while (off < buffer.length)\n    buffer[off++] = 0;\n\n  return true;\n};\n\nCipher.prototype._finalEncrypt = function _finalEncrypt() {\n  if (!this._pad(this.buffer, this.bufferOff))\n    return [];\n\n  var out = new Array(this.blockSize);\n  this._update(this.buffer, 0, out, 0);\n  return out;\n};\n\nCipher.prototype._unpad = function _unpad(buffer) {\n  return buffer;\n};\n\nCipher.prototype._finalDecrypt = function _finalDecrypt() {\n  assert.equal(this.bufferOff, this.blockSize, 'Not enough data to decrypt');\n  var out = new Array(this.blockSize);\n  this._flushBuffer(out, 0);\n\n  return this._unpad(out);\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar utils = require('./utils');\nvar Cipher = require('./cipher');\n\nfunction DESState() {\n  this.tmp = new Array(2);\n  this.keys = null;\n}\n\nfunction DES(options) {\n  Cipher.call(this, options);\n\n  var state = new DESState();\n  this._desState = state;\n\n  this.deriveKeys(state, options.key);\n}\ninherits(DES, Cipher);\nmodule.exports = DES;\n\nDES.create = function create(options) {\n  return new DES(options);\n};\n\nvar shiftTable = [\n  1, 1, 2, 2, 2, 2, 2, 2,\n  1, 2, 2, 2, 2, 2, 2, 1\n];\n\nDES.prototype.deriveKeys = function deriveKeys(state, key) {\n  state.keys = new Array(16 * 2);\n\n  assert.equal(key.length, this.blockSize, 'Invalid key length');\n\n  var kL = utils.readUInt32BE(key, 0);\n  var kR = utils.readUInt32BE(key, 4);\n\n  utils.pc1(kL, kR, state.tmp, 0);\n  kL = state.tmp[0];\n  kR = state.tmp[1];\n  for (var i = 0; i < state.keys.length; i += 2) {\n    var shift = shiftTable[i >>> 1];\n    kL = utils.r28shl(kL, shift);\n    kR = utils.r28shl(kR, shift);\n    utils.pc2(kL, kR, state.keys, i);\n  }\n};\n\nDES.prototype._update = function _update(inp, inOff, out, outOff) {\n  var state = this._desState;\n\n  var l = utils.readUInt32BE(inp, inOff);\n  var r = utils.readUInt32BE(inp, inOff + 4);\n\n  // Initial Permutation\n  utils.ip(l, r, state.tmp, 0);\n  l = state.tmp[0];\n  r = state.tmp[1];\n\n  if (this.type === 'encrypt')\n    this._encrypt(state, l, r, state.tmp, 0);\n  else\n    this._decrypt(state, l, r, state.tmp, 0);\n\n  l = state.tmp[0];\n  r = state.tmp[1];\n\n  utils.writeUInt32BE(out, l, outOff);\n  utils.writeUInt32BE(out, r, outOff + 4);\n};\n\nDES.prototype._pad = function _pad(buffer, off) {\n  if (this.padding === false) {\n    return false;\n  }\n\n  var value = buffer.length - off;\n  for (var i = off; i < buffer.length; i++)\n    buffer[i] = value;\n\n  return true;\n};\n\nDES.prototype._unpad = function _unpad(buffer) {\n  if (this.padding === false) {\n    return buffer;\n  }\n\n  var pad = buffer[buffer.length - 1];\n  for (var i = buffer.length - pad; i < buffer.length; i++)\n    assert.equal(buffer[i], pad);\n\n  return buffer.slice(0, buffer.length - pad);\n};\n\nDES.prototype._encrypt = function _encrypt(state, lStart, rStart, out, off) {\n  var l = lStart;\n  var r = rStart;\n\n  // Apply f() x16 times\n  for (var i = 0; i < state.keys.length; i += 2) {\n    var keyL = state.keys[i];\n    var keyR = state.keys[i + 1];\n\n    // f(r, k)\n    utils.expand(r, state.tmp, 0);\n\n    keyL ^= state.tmp[0];\n    keyR ^= state.tmp[1];\n    var s = utils.substitute(keyL, keyR);\n    var f = utils.permute(s);\n\n    var t = r;\n    r = (l ^ f) >>> 0;\n    l = t;\n  }\n\n  // Reverse Initial Permutation\n  utils.rip(r, l, out, off);\n};\n\nDES.prototype._decrypt = function _decrypt(state, lStart, rStart, out, off) {\n  var l = rStart;\n  var r = lStart;\n\n  // Apply f() x16 times\n  for (var i = state.keys.length - 2; i >= 0; i -= 2) {\n    var keyL = state.keys[i];\n    var keyR = state.keys[i + 1];\n\n    // f(r, k)\n    utils.expand(l, state.tmp, 0);\n\n    keyL ^= state.tmp[0];\n    keyR ^= state.tmp[1];\n    var s = utils.substitute(keyL, keyR);\n    var f = utils.permute(s);\n\n    var t = l;\n    l = (r ^ f) >>> 0;\n    r = t;\n  }\n\n  // Reverse Initial Permutation\n  utils.rip(l, r, out, off);\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar proto = {};\n\nfunction CBCState(iv) {\n  assert.equal(iv.length, 8, 'Invalid IV length');\n\n  this.iv = new Array(8);\n  for (var i = 0; i < this.iv.length; i++)\n    this.iv[i] = iv[i];\n}\n\nfunction instantiate(Base) {\n  function CBC(options) {\n    Base.call(this, options);\n    this._cbcInit();\n  }\n  inherits(CBC, Base);\n\n  var keys = Object.keys(proto);\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i];\n    CBC.prototype[key] = proto[key];\n  }\n\n  CBC.create = function create(options) {\n    return new CBC(options);\n  };\n\n  return CBC;\n}\n\nexports.instantiate = instantiate;\n\nproto._cbcInit = function _cbcInit() {\n  var state = new CBCState(this.options.iv);\n  this._cbcState = state;\n};\n\nproto._update = function _update(inp, inOff, out, outOff) {\n  var state = this._cbcState;\n  var superProto = this.constructor.super_.prototype;\n\n  var iv = state.iv;\n  if (this.type === 'encrypt') {\n    for (var i = 0; i < this.blockSize; i++)\n      iv[i] ^= inp[inOff + i];\n\n    superProto._update.call(this, iv, 0, out, outOff);\n\n    for (var i = 0; i < this.blockSize; i++)\n      iv[i] = out[outOff + i];\n  } else {\n    superProto._update.call(this, inp, inOff, out, outOff);\n\n    for (var i = 0; i < this.blockSize; i++)\n      out[outOff + i] ^= iv[i];\n\n    for (var i = 0; i < this.blockSize; i++)\n      iv[i] = inp[inOff + i];\n  }\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar Cipher = require('./cipher');\nvar DES = require('./des');\n\nfunction EDEState(type, key) {\n  assert.equal(key.length, 24, 'Invalid key length');\n\n  var k1 = key.slice(0, 8);\n  var k2 = key.slice(8, 16);\n  var k3 = key.slice(16, 24);\n\n  if (type === 'encrypt') {\n    this.ciphers = [\n      DES.create({ type: 'encrypt', key: k1 }),\n      DES.create({ type: 'decrypt', key: k2 }),\n      DES.create({ type: 'encrypt', key: k3 })\n    ];\n  } else {\n    this.ciphers = [\n      DES.create({ type: 'decrypt', key: k3 }),\n      DES.create({ type: 'encrypt', key: k2 }),\n      DES.create({ type: 'decrypt', key: k1 })\n    ];\n  }\n}\n\nfunction EDE(options) {\n  Cipher.call(this, options);\n\n  var state = new EDEState(this.type, this.options.key);\n  this._edeState = state;\n}\ninherits(EDE, Cipher);\n\nmodule.exports = EDE;\n\nEDE.create = function create(options) {\n  return new EDE(options);\n};\n\nEDE.prototype._update = function _update(inp, inOff, out, outOff) {\n  var state = this._edeState;\n\n  state.ciphers[0]._update(inp, inOff, out, outOff);\n  state.ciphers[1]._update(out, outOff, out, outOff);\n  state.ciphers[2]._update(out, outOff, out, outOff);\n};\n\nEDE.prototype._pad = DES.prototype._pad;\nEDE.prototype._unpad = DES.prototype._unpad;\n","'use strict';\n\nexports.utils = require('./des/utils');\nexports.Cipher = require('./des/cipher');\nexports.DES = require('./des/des');\nexports.CBC = require('./des/cbc');\nexports.EDE = require('./des/ede');\n","var CipherBase = require('cipher-base')\nvar des = require('des.js')\nvar inherits = require('inherits')\nvar Buffer = require('safe-buffer').Buffer\n\nvar modes = {\n  'des-ede3-cbc': des.CBC.instantiate(des.EDE),\n  'des-ede3': des.EDE,\n  'des-ede-cbc': des.CBC.instantiate(des.EDE),\n  'des-ede': des.EDE,\n  'des-cbc': des.CBC.instantiate(des.DES),\n  'des-ecb': des.DES\n}\nmodes.des = modes['des-cbc']\nmodes.des3 = modes['des-ede3-cbc']\nmodule.exports = DES\ninherits(DES, CipherBase)\nfunction DES (opts) {\n  CipherBase.call(this)\n  var modeName = opts.mode.toLowerCase()\n  var mode = modes[modeName]\n  var type\n  if (opts.decrypt) {\n    type = 'decrypt'\n  } else {\n    type = 'encrypt'\n  }\n  var key = opts.key\n  if (!Buffer.isBuffer(key)) {\n    key = Buffer.from(key)\n  }\n  if (modeName === 'des-ede' || modeName === 'des-ede-cbc') {\n    key = Buffer.concat([key, key.slice(0, 8)])\n  }\n  var iv = opts.iv\n  if (!Buffer.isBuffer(iv)) {\n    iv = Buffer.from(iv)\n  }\n  this._des = mode.create({\n    key: key,\n    iv: iv,\n    type: type\n  })\n}\nDES.prototype._update = function (data) {\n  return Buffer.from(this._des.update(data))\n}\nDES.prototype._final = function () {\n  return Buffer.from(this._des.final())\n}\n","exports.encrypt = function (self, block) {\n  return self._cipher.encryptBlock(block)\n}\n\nexports.decrypt = function (self, block) {\n  return self._cipher.decryptBlock(block)\n}\n","module.exports = function xor (a, b) {\n  var length = Math.min(a.length, b.length)\n  var buffer = new Buffer(length)\n\n  for (var i = 0; i < length; ++i) {\n    buffer[i] = a[i] ^ b[i]\n  }\n\n  return buffer\n}\n","var xor = require('buffer-xor')\n\nexports.encrypt = function (self, block) {\n  var data = xor(block, self._prev)\n\n  self._prev = self._cipher.encryptBlock(data)\n  return self._prev\n}\n\nexports.decrypt = function (self, block) {\n  var pad = self._prev\n\n  self._prev = block\n  var out = self._cipher.decryptBlock(block)\n\n  return xor(out, pad)\n}\n","var Buffer = require('safe-buffer').Buffer\nvar xor = require('buffer-xor')\n\nfunction encryptStart (self, data, decrypt) {\n  var len = data.length\n  var out = xor(data, self._cache)\n  self._cache = self._cache.slice(len)\n  self._prev = Buffer.concat([self._prev, decrypt ? data : out])\n  return out\n}\n\nexports.encrypt = function (self, data, decrypt) {\n  var out = Buffer.allocUnsafe(0)\n  var len\n\n  while (data.length) {\n    if (self._cache.length === 0) {\n      self._cache = self._cipher.encryptBlock(self._prev)\n      self._prev = Buffer.allocUnsafe(0)\n    }\n\n    if (self._cache.length <= data.length) {\n      len = self._cache.length\n      out = Buffer.concat([out, encryptStart(self, data.slice(0, len), decrypt)])\n      data = data.slice(len)\n    } else {\n      out = Buffer.concat([out, encryptStart(self, data, decrypt)])\n      break\n    }\n  }\n\n  return out\n}\n","var Buffer = require('safe-buffer').Buffer\n\nfunction encryptByte (self, byteParam, decrypt) {\n  var pad = self._cipher.encryptBlock(self._prev)\n  var out = pad[0] ^ byteParam\n\n  self._prev = Buffer.concat([\n    self._prev.slice(1),\n    Buffer.from([decrypt ? byteParam : out])\n  ])\n\n  return out\n}\n\nexports.encrypt = function (self, chunk, decrypt) {\n  var len = chunk.length\n  var out = Buffer.allocUnsafe(len)\n  var i = -1\n\n  while (++i < len) {\n    out[i] = encryptByte(self, chunk[i], decrypt)\n  }\n\n  return out\n}\n","var Buffer = require('safe-buffer').Buffer\n\nfunction encryptByte (self, byteParam, decrypt) {\n  var pad\n  var i = -1\n  var len = 8\n  var out = 0\n  var bit, value\n  while (++i < len) {\n    pad = self._cipher.encryptBlock(self._prev)\n    bit = (byteParam & (1 << (7 - i))) ? 0x80 : 0\n    value = pad[0] ^ bit\n    out += ((value & 0x80) >> (i % 8))\n    self._prev = shiftIn(self._prev, decrypt ? bit : value)\n  }\n  return out\n}\n\nfunction shiftIn (buffer, value) {\n  var len = buffer.length\n  var i = -1\n  var out = Buffer.allocUnsafe(buffer.length)\n  buffer = Buffer.concat([buffer, Buffer.from([value])])\n\n  while (++i < len) {\n    out[i] = buffer[i] << 1 | buffer[i + 1] >> (7)\n  }\n\n  return out\n}\n\nexports.encrypt = function (self, chunk, decrypt) {\n  var len = chunk.length\n  var out = Buffer.allocUnsafe(len)\n  var i = -1\n\n  while (++i < len) {\n    out[i] = encryptByte(self, chunk[i], decrypt)\n  }\n\n  return out\n}\n","var xor = require('buffer-xor')\n\nfunction getBlock (self) {\n  self._prev = self._cipher.encryptBlock(self._prev)\n  return self._prev\n}\n\nexports.encrypt = function (self, chunk) {\n  while (self._cache.length < chunk.length) {\n    self._cache = Buffer.concat([self._cache, getBlock(self)])\n  }\n\n  var pad = self._cache.slice(0, chunk.length)\n  self._cache = self._cache.slice(chunk.length)\n  return xor(chunk, pad)\n}\n","function incr32 (iv) {\n  var len = iv.length\n  var item\n  while (len--) {\n    item = iv.readUInt8(len)\n    if (item === 255) {\n      iv.writeUInt8(0, len)\n    } else {\n      item++\n      iv.writeUInt8(item, len)\n      break\n    }\n  }\n}\nmodule.exports = incr32\n","var xor = require('buffer-xor')\nvar Buffer = require('safe-buffer').Buffer\nvar incr32 = require('../incr32')\n\nfunction getBlock (self) {\n  var out = self._cipher.encryptBlockRaw(self._prev)\n  incr32(self._prev)\n  return out\n}\n\nvar blockSize = 16\nexports.encrypt = function (self, chunk) {\n  var chunkNum = Math.ceil(chunk.length / blockSize)\n  var start = self._cache.length\n  self._cache = Buffer.concat([\n    self._cache,\n    Buffer.allocUnsafe(chunkNum * blockSize)\n  ])\n  for (var i = 0; i < chunkNum; i++) {\n    var out = getBlock(self)\n    var offset = start + i * blockSize\n    self._cache.writeUInt32BE(out[0], offset + 0)\n    self._cache.writeUInt32BE(out[1], offset + 4)\n    self._cache.writeUInt32BE(out[2], offset + 8)\n    self._cache.writeUInt32BE(out[3], offset + 12)\n  }\n  var pad = self._cache.slice(0, chunk.length)\n  self._cache = self._cache.slice(chunk.length)\n  return xor(chunk, pad)\n}\n","var modeModules = {\n  ECB: require('./ecb'),\n  CBC: require('./cbc'),\n  CFB: require('./cfb'),\n  CFB8: require('./cfb8'),\n  CFB1: require('./cfb1'),\n  OFB: require('./ofb'),\n  CTR: require('./ctr'),\n  GCM: require('./ctr')\n}\n\nvar modes = require('./list.json')\n\nfor (var key in modes) {\n  modes[key].module = modeModules[modes[key].mode]\n}\n\nmodule.exports = modes\n","// based on the aes implimentation in triple sec\n// https://github.com/keybase/triplesec\n// which is in turn based on the one from crypto-js\n// https://code.google.com/p/crypto-js/\n\nvar Buffer = require('safe-buffer').Buffer\n\nfunction asUInt32Array (buf) {\n  if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n\n  var len = (buf.length / 4) | 0\n  var out = new Array(len)\n\n  for (var i = 0; i < len; i++) {\n    out[i] = buf.readUInt32BE(i * 4)\n  }\n\n  return out\n}\n\nfunction scrubVec (v) {\n  for (var i = 0; i < v.length; v++) {\n    v[i] = 0\n  }\n}\n\nfunction cryptBlock (M, keySchedule, SUB_MIX, SBOX, nRounds) {\n  var SUB_MIX0 = SUB_MIX[0]\n  var SUB_MIX1 = SUB_MIX[1]\n  var SUB_MIX2 = SUB_MIX[2]\n  var SUB_MIX3 = SUB_MIX[3]\n\n  var s0 = M[0] ^ keySchedule[0]\n  var s1 = M[1] ^ keySchedule[1]\n  var s2 = M[2] ^ keySchedule[2]\n  var s3 = M[3] ^ keySchedule[3]\n  var t0, t1, t2, t3\n  var ksRow = 4\n\n  for (var round = 1; round < nRounds; round++) {\n    t0 = SUB_MIX0[s0 >>> 24] ^ SUB_MIX1[(s1 >>> 16) & 0xff] ^ SUB_MIX2[(s2 >>> 8) & 0xff] ^ SUB_MIX3[s3 & 0xff] ^ keySchedule[ksRow++]\n    t1 = SUB_MIX0[s1 >>> 24] ^ SUB_MIX1[(s2 >>> 16) & 0xff] ^ SUB_MIX2[(s3 >>> 8) & 0xff] ^ SUB_MIX3[s0 & 0xff] ^ keySchedule[ksRow++]\n    t2 = SUB_MIX0[s2 >>> 24] ^ SUB_MIX1[(s3 >>> 16) & 0xff] ^ SUB_MIX2[(s0 >>> 8) & 0xff] ^ SUB_MIX3[s1 & 0xff] ^ keySchedule[ksRow++]\n    t3 = SUB_MIX0[s3 >>> 24] ^ SUB_MIX1[(s0 >>> 16) & 0xff] ^ SUB_MIX2[(s1 >>> 8) & 0xff] ^ SUB_MIX3[s2 & 0xff] ^ keySchedule[ksRow++]\n    s0 = t0\n    s1 = t1\n    s2 = t2\n    s3 = t3\n  }\n\n  t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++]\n  t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++]\n  t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++]\n  t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++]\n  t0 = t0 >>> 0\n  t1 = t1 >>> 0\n  t2 = t2 >>> 0\n  t3 = t3 >>> 0\n\n  return [t0, t1, t2, t3]\n}\n\n// AES constants\nvar RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36]\nvar G = (function () {\n  // Compute double table\n  var d = new Array(256)\n  for (var j = 0; j < 256; j++) {\n    if (j < 128) {\n      d[j] = j << 1\n    } else {\n      d[j] = (j << 1) ^ 0x11b\n    }\n  }\n\n  var SBOX = []\n  var INV_SBOX = []\n  var SUB_MIX = [[], [], [], []]\n  var INV_SUB_MIX = [[], [], [], []]\n\n  // Walk GF(2^8)\n  var x = 0\n  var xi = 0\n  for (var i = 0; i < 256; ++i) {\n    // Compute sbox\n    var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4)\n    sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63\n    SBOX[x] = sx\n    INV_SBOX[sx] = x\n\n    // Compute multiplication\n    var x2 = d[x]\n    var x4 = d[x2]\n    var x8 = d[x4]\n\n    // Compute sub bytes, mix columns tables\n    var t = (d[sx] * 0x101) ^ (sx * 0x1010100)\n    SUB_MIX[0][x] = (t << 24) | (t >>> 8)\n    SUB_MIX[1][x] = (t << 16) | (t >>> 16)\n    SUB_MIX[2][x] = (t << 8) | (t >>> 24)\n    SUB_MIX[3][x] = t\n\n    // Compute inv sub bytes, inv mix columns tables\n    t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100)\n    INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)\n    INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)\n    INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)\n    INV_SUB_MIX[3][sx] = t\n\n    if (x === 0) {\n      x = xi = 1\n    } else {\n      x = x2 ^ d[d[d[x8 ^ x2]]]\n      xi ^= d[d[xi]]\n    }\n  }\n\n  return {\n    SBOX: SBOX,\n    INV_SBOX: INV_SBOX,\n    SUB_MIX: SUB_MIX,\n    INV_SUB_MIX: INV_SUB_MIX\n  }\n})()\n\nfunction AES (key) {\n  this._key = asUInt32Array(key)\n  this._reset()\n}\n\nAES.blockSize = 4 * 4\nAES.keySize = 256 / 8\nAES.prototype.blockSize = AES.blockSize\nAES.prototype.keySize = AES.keySize\nAES.prototype._reset = function () {\n  var keyWords = this._key\n  var keySize = keyWords.length\n  var nRounds = keySize + 6\n  var ksRows = (nRounds + 1) * 4\n\n  var keySchedule = []\n  for (var k = 0; k < keySize; k++) {\n    keySchedule[k] = keyWords[k]\n  }\n\n  for (k = keySize; k < ksRows; k++) {\n    var t = keySchedule[k - 1]\n\n    if (k % keySize === 0) {\n      t = (t << 8) | (t >>> 24)\n      t =\n        (G.SBOX[t >>> 24] << 24) |\n        (G.SBOX[(t >>> 16) & 0xff] << 16) |\n        (G.SBOX[(t >>> 8) & 0xff] << 8) |\n        (G.SBOX[t & 0xff])\n\n      t ^= RCON[(k / keySize) | 0] << 24\n    } else if (keySize > 6 && k % keySize === 4) {\n      t =\n        (G.SBOX[t >>> 24] << 24) |\n        (G.SBOX[(t >>> 16) & 0xff] << 16) |\n        (G.SBOX[(t >>> 8) & 0xff] << 8) |\n        (G.SBOX[t & 0xff])\n    }\n\n    keySchedule[k] = keySchedule[k - keySize] ^ t\n  }\n\n  var invKeySchedule = []\n  for (var ik = 0; ik < ksRows; ik++) {\n    var ksR = ksRows - ik\n    var tt = keySchedule[ksR - (ik % 4 ? 0 : 4)]\n\n    if (ik < 4 || ksR <= 4) {\n      invKeySchedule[ik] = tt\n    } else {\n      invKeySchedule[ik] =\n        G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n        G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 0xff]] ^\n        G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 0xff]] ^\n        G.INV_SUB_MIX[3][G.SBOX[tt & 0xff]]\n    }\n  }\n\n  this._nRounds = nRounds\n  this._keySchedule = keySchedule\n  this._invKeySchedule = invKeySchedule\n}\n\nAES.prototype.encryptBlockRaw = function (M) {\n  M = asUInt32Array(M)\n  return cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds)\n}\n\nAES.prototype.encryptBlock = function (M) {\n  var out = this.encryptBlockRaw(M)\n  var buf = Buffer.allocUnsafe(16)\n  buf.writeUInt32BE(out[0], 0)\n  buf.writeUInt32BE(out[1], 4)\n  buf.writeUInt32BE(out[2], 8)\n  buf.writeUInt32BE(out[3], 12)\n  return buf\n}\n\nAES.prototype.decryptBlock = function (M) {\n  M = asUInt32Array(M)\n\n  // swap\n  var m1 = M[1]\n  M[1] = M[3]\n  M[3] = m1\n\n  var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds)\n  var buf = Buffer.allocUnsafe(16)\n  buf.writeUInt32BE(out[0], 0)\n  buf.writeUInt32BE(out[3], 4)\n  buf.writeUInt32BE(out[2], 8)\n  buf.writeUInt32BE(out[1], 12)\n  return buf\n}\n\nAES.prototype.scrub = function () {\n  scrubVec(this._keySchedule)\n  scrubVec(this._invKeySchedule)\n  scrubVec(this._key)\n}\n\nmodule.exports.AES = AES\n","var Buffer = require('safe-buffer').Buffer\nvar ZEROES = Buffer.alloc(16, 0)\n\nfunction toArray (buf) {\n  return [\n    buf.readUInt32BE(0),\n    buf.readUInt32BE(4),\n    buf.readUInt32BE(8),\n    buf.readUInt32BE(12)\n  ]\n}\n\nfunction fromArray (out) {\n  var buf = Buffer.allocUnsafe(16)\n  buf.writeUInt32BE(out[0] >>> 0, 0)\n  buf.writeUInt32BE(out[1] >>> 0, 4)\n  buf.writeUInt32BE(out[2] >>> 0, 8)\n  buf.writeUInt32BE(out[3] >>> 0, 12)\n  return buf\n}\n\nfunction GHASH (key) {\n  this.h = key\n  this.state = Buffer.alloc(16, 0)\n  this.cache = Buffer.allocUnsafe(0)\n}\n\n// from http://bitwiseshiftleft.github.io/sjcl/doc/symbols/src/core_gcm.js.html\n// by Juho Vähä-Herttua\nGHASH.prototype.ghash = function (block) {\n  var i = -1\n  while (++i < block.length) {\n    this.state[i] ^= block[i]\n  }\n  this._multiply()\n}\n\nGHASH.prototype._multiply = function () {\n  var Vi = toArray(this.h)\n  var Zi = [0, 0, 0, 0]\n  var j, xi, lsbVi\n  var i = -1\n  while (++i < 128) {\n    xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0\n    if (xi) {\n      // Z_i+1 = Z_i ^ V_i\n      Zi[0] ^= Vi[0]\n      Zi[1] ^= Vi[1]\n      Zi[2] ^= Vi[2]\n      Zi[3] ^= Vi[3]\n    }\n\n    // Store the value of LSB(V_i)\n    lsbVi = (Vi[3] & 1) !== 0\n\n    // V_i+1 = V_i >> 1\n    for (j = 3; j > 0; j--) {\n      Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31)\n    }\n    Vi[0] = Vi[0] >>> 1\n\n    // If LSB(V_i) is 1, V_i+1 = (V_i >> 1) ^ R\n    if (lsbVi) {\n      Vi[0] = Vi[0] ^ (0xe1 << 24)\n    }\n  }\n  this.state = fromArray(Zi)\n}\n\nGHASH.prototype.update = function (buf) {\n  this.cache = Buffer.concat([this.cache, buf])\n  var chunk\n  while (this.cache.length >= 16) {\n    chunk = this.cache.slice(0, 16)\n    this.cache = this.cache.slice(16)\n    this.ghash(chunk)\n  }\n}\n\nGHASH.prototype.final = function (abl, bl) {\n  if (this.cache.length) {\n    this.ghash(Buffer.concat([this.cache, ZEROES], 16))\n  }\n\n  this.ghash(fromArray([0, abl, 0, bl]))\n  return this.state\n}\n\nmodule.exports = GHASH\n","var aes = require('./aes')\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('cipher-base')\nvar inherits = require('inherits')\nvar GHASH = require('./ghash')\nvar xor = require('buffer-xor')\nvar incr32 = require('./incr32')\n\nfunction xorTest (a, b) {\n  var out = 0\n  if (a.length !== b.length) out++\n\n  var len = Math.min(a.length, b.length)\n  for (var i = 0; i < len; ++i) {\n    out += (a[i] ^ b[i])\n  }\n\n  return out\n}\n\nfunction calcIv (self, iv, ck) {\n  if (iv.length === 12) {\n    self._finID = Buffer.concat([iv, Buffer.from([0, 0, 0, 1])])\n    return Buffer.concat([iv, Buffer.from([0, 0, 0, 2])])\n  }\n  var ghash = new GHASH(ck)\n  var len = iv.length\n  var toPad = len % 16\n  ghash.update(iv)\n  if (toPad) {\n    toPad = 16 - toPad\n    ghash.update(Buffer.alloc(toPad, 0))\n  }\n  ghash.update(Buffer.alloc(8, 0))\n  var ivBits = len * 8\n  var tail = Buffer.alloc(8)\n  tail.writeUIntBE(ivBits, 0, 8)\n  ghash.update(tail)\n  self._finID = ghash.state\n  var out = Buffer.from(self._finID)\n  incr32(out)\n  return out\n}\nfunction StreamCipher (mode, key, iv, decrypt) {\n  Transform.call(this)\n\n  var h = Buffer.alloc(4, 0)\n\n  this._cipher = new aes.AES(key)\n  var ck = this._cipher.encryptBlock(h)\n  this._ghash = new GHASH(ck)\n  iv = calcIv(this, iv, ck)\n\n  this._prev = Buffer.from(iv)\n  this._cache = Buffer.allocUnsafe(0)\n  this._secCache = Buffer.allocUnsafe(0)\n  this._decrypt = decrypt\n  this._alen = 0\n  this._len = 0\n  this._mode = mode\n\n  this._authTag = null\n  this._called = false\n}\n\ninherits(StreamCipher, Transform)\n\nStreamCipher.prototype._update = function (chunk) {\n  if (!this._called && this._alen) {\n    var rump = 16 - (this._alen % 16)\n    if (rump < 16) {\n      rump = Buffer.alloc(rump, 0)\n      this._ghash.update(rump)\n    }\n  }\n\n  this._called = true\n  var out = this._mode.encrypt(this, chunk)\n  if (this._decrypt) {\n    this._ghash.update(chunk)\n  } else {\n    this._ghash.update(out)\n  }\n  this._len += chunk.length\n  return out\n}\n\nStreamCipher.prototype._final = function () {\n  if (this._decrypt && !this._authTag) throw new Error('Unsupported state or unable to authenticate data')\n\n  var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID))\n  if (this._decrypt && xorTest(tag, this._authTag)) throw new Error('Unsupported state or unable to authenticate data')\n\n  this._authTag = tag\n  this._cipher.scrub()\n}\n\nStreamCipher.prototype.getAuthTag = function getAuthTag () {\n  if (this._decrypt || !Buffer.isBuffer(this._authTag)) throw new Error('Attempting to get auth tag in unsupported state')\n\n  return this._authTag\n}\n\nStreamCipher.prototype.setAuthTag = function setAuthTag (tag) {\n  if (!this._decrypt) throw new Error('Attempting to set auth tag in unsupported state')\n\n  this._authTag = tag\n}\n\nStreamCipher.prototype.setAAD = function setAAD (buf) {\n  if (this._called) throw new Error('Attempting to set AAD in unsupported state')\n\n  this._ghash.update(buf)\n  this._alen += buf.length\n}\n\nmodule.exports = StreamCipher\n","var aes = require('./aes')\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('cipher-base')\nvar inherits = require('inherits')\n\nfunction StreamCipher (mode, key, iv, decrypt) {\n  Transform.call(this)\n\n  this._cipher = new aes.AES(key)\n  this._prev = Buffer.from(iv)\n  this._cache = Buffer.allocUnsafe(0)\n  this._secCache = Buffer.allocUnsafe(0)\n  this._decrypt = decrypt\n  this._mode = mode\n}\n\ninherits(StreamCipher, Transform)\n\nStreamCipher.prototype._update = function (chunk) {\n  return this._mode.encrypt(this, chunk, this._decrypt)\n}\n\nStreamCipher.prototype._final = function () {\n  this._cipher.scrub()\n}\n\nmodule.exports = StreamCipher\n","var Buffer = require('safe-buffer').Buffer\nvar MD5 = require('md5.js')\n\n/* eslint-disable camelcase */\nfunction EVP_BytesToKey (password, salt, keyBits, ivLen) {\n  if (!Buffer.isBuffer(password)) password = Buffer.from(password, 'binary')\n  if (salt) {\n    if (!Buffer.isBuffer(salt)) salt = Buffer.from(salt, 'binary')\n    if (salt.length !== 8) throw new RangeError('salt should be Buffer with 8 byte length')\n  }\n\n  var keyLen = keyBits / 8\n  var key = Buffer.alloc(keyLen)\n  var iv = Buffer.alloc(ivLen || 0)\n  var tmp = Buffer.alloc(0)\n\n  while (keyLen > 0 || ivLen > 0) {\n    var hash = new MD5()\n    hash.update(tmp)\n    hash.update(password)\n    if (salt) hash.update(salt)\n    tmp = hash.digest()\n\n    var used = 0\n\n    if (keyLen > 0) {\n      var keyStart = key.length - keyLen\n      used = Math.min(keyLen, tmp.length)\n      tmp.copy(key, keyStart, 0, used)\n      keyLen -= used\n    }\n\n    if (used < tmp.length && ivLen > 0) {\n      var ivStart = iv.length - ivLen\n      var length = Math.min(ivLen, tmp.length - used)\n      tmp.copy(iv, ivStart, used, used + length)\n      ivLen -= length\n    }\n  }\n\n  tmp.fill(0)\n  return { key: key, iv: iv }\n}\n\nmodule.exports = EVP_BytesToKey\n","var MODES = require('./modes')\nvar AuthCipher = require('./authCipher')\nvar Buffer = require('safe-buffer').Buffer\nvar StreamCipher = require('./streamCipher')\nvar Transform = require('cipher-base')\nvar aes = require('./aes')\nvar ebtk = require('evp_bytestokey')\nvar inherits = require('inherits')\n\nfunction Cipher (mode, key, iv) {\n  Transform.call(this)\n\n  this._cache = new Splitter()\n  this._cipher = new aes.AES(key)\n  this._prev = Buffer.from(iv)\n  this._mode = mode\n  this._autopadding = true\n}\n\ninherits(Cipher, Transform)\n\nCipher.prototype._update = function (data) {\n  this._cache.add(data)\n  var chunk\n  var thing\n  var out = []\n\n  while ((chunk = this._cache.get())) {\n    thing = this._mode.encrypt(this, chunk)\n    out.push(thing)\n  }\n\n  return Buffer.concat(out)\n}\n\nvar PADDING = Buffer.alloc(16, 0x10)\n\nCipher.prototype._final = function () {\n  var chunk = this._cache.flush()\n  if (this._autopadding) {\n    chunk = this._mode.encrypt(this, chunk)\n    this._cipher.scrub()\n    return chunk\n  }\n\n  if (!chunk.equals(PADDING)) {\n    this._cipher.scrub()\n    throw new Error('data not multiple of block length')\n  }\n}\n\nCipher.prototype.setAutoPadding = function (setTo) {\n  this._autopadding = !!setTo\n  return this\n}\n\nfunction Splitter () {\n  this.cache = Buffer.allocUnsafe(0)\n}\n\nSplitter.prototype.add = function (data) {\n  this.cache = Buffer.concat([this.cache, data])\n}\n\nSplitter.prototype.get = function () {\n  if (this.cache.length > 15) {\n    var out = this.cache.slice(0, 16)\n    this.cache = this.cache.slice(16)\n    return out\n  }\n  return null\n}\n\nSplitter.prototype.flush = function () {\n  var len = 16 - this.cache.length\n  var padBuff = Buffer.allocUnsafe(len)\n\n  var i = -1\n  while (++i < len) {\n    padBuff.writeUInt8(len, i)\n  }\n\n  return Buffer.concat([this.cache, padBuff])\n}\n\nfunction createCipheriv (suite, password, iv) {\n  var config = MODES[suite.toLowerCase()]\n  if (!config) throw new TypeError('invalid suite type')\n\n  if (typeof password === 'string') password = Buffer.from(password)\n  if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)\n\n  if (typeof iv === 'string') iv = Buffer.from(iv)\n  if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)\n\n  if (config.type === 'stream') {\n    return new StreamCipher(config.module, password, iv)\n  } else if (config.type === 'auth') {\n    return new AuthCipher(config.module, password, iv)\n  }\n\n  return new Cipher(config.module, password, iv)\n}\n\nfunction createCipher (suite, password) {\n  var config = MODES[suite.toLowerCase()]\n  if (!config) throw new TypeError('invalid suite type')\n\n  var keys = ebtk(password, false, config.key, config.iv)\n  return createCipheriv(suite, keys.key, keys.iv)\n}\n\nexports.createCipheriv = createCipheriv\nexports.createCipher = createCipher\n","var AuthCipher = require('./authCipher')\nvar Buffer = require('safe-buffer').Buffer\nvar MODES = require('./modes')\nvar StreamCipher = require('./streamCipher')\nvar Transform = require('cipher-base')\nvar aes = require('./aes')\nvar ebtk = require('evp_bytestokey')\nvar inherits = require('inherits')\n\nfunction Decipher (mode, key, iv) {\n  Transform.call(this)\n\n  this._cache = new Splitter()\n  this._last = void 0\n  this._cipher = new aes.AES(key)\n  this._prev = Buffer.from(iv)\n  this._mode = mode\n  this._autopadding = true\n}\n\ninherits(Decipher, Transform)\n\nDecipher.prototype._update = function (data) {\n  this._cache.add(data)\n  var chunk\n  var thing\n  var out = []\n  while ((chunk = this._cache.get(this._autopadding))) {\n    thing = this._mode.decrypt(this, chunk)\n    out.push(thing)\n  }\n  return Buffer.concat(out)\n}\n\nDecipher.prototype._final = function () {\n  var chunk = this._cache.flush()\n  if (this._autopadding) {\n    return unpad(this._mode.decrypt(this, chunk))\n  } else if (chunk) {\n    throw new Error('data not multiple of block length')\n  }\n}\n\nDecipher.prototype.setAutoPadding = function (setTo) {\n  this._autopadding = !!setTo\n  return this\n}\n\nfunction Splitter () {\n  this.cache = Buffer.allocUnsafe(0)\n}\n\nSplitter.prototype.add = function (data) {\n  this.cache = Buffer.concat([this.cache, data])\n}\n\nSplitter.prototype.get = function (autoPadding) {\n  var out\n  if (autoPadding) {\n    if (this.cache.length > 16) {\n      out = this.cache.slice(0, 16)\n      this.cache = this.cache.slice(16)\n      return out\n    }\n  } else {\n    if (this.cache.length >= 16) {\n      out = this.cache.slice(0, 16)\n      this.cache = this.cache.slice(16)\n      return out\n    }\n  }\n\n  return null\n}\n\nSplitter.prototype.flush = function () {\n  if (this.cache.length) return this.cache\n}\n\nfunction unpad (last) {\n  var padded = last[15]\n  if (padded < 1 || padded > 16) {\n    throw new Error('unable to decrypt data')\n  }\n  var i = -1\n  while (++i < padded) {\n    if (last[(i + (16 - padded))] !== padded) {\n      throw new Error('unable to decrypt data')\n    }\n  }\n  if (padded === 16) return\n\n  return last.slice(0, 16 - padded)\n}\n\nfunction createDecipheriv (suite, password, iv) {\n  var config = MODES[suite.toLowerCase()]\n  if (!config) throw new TypeError('invalid suite type')\n\n  if (typeof iv === 'string') iv = Buffer.from(iv)\n  if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)\n\n  if (typeof password === 'string') password = Buffer.from(password)\n  if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)\n\n  if (config.type === 'stream') {\n    return new StreamCipher(config.module, password, iv, true)\n  } else if (config.type === 'auth') {\n    return new AuthCipher(config.module, password, iv, true)\n  }\n\n  return new Decipher(config.module, password, iv)\n}\n\nfunction createDecipher (suite, password) {\n  var config = MODES[suite.toLowerCase()]\n  if (!config) throw new TypeError('invalid suite type')\n\n  var keys = ebtk(password, false, config.key, config.iv)\n  return createDecipheriv(suite, keys.key, keys.iv)\n}\n\nexports.createDecipher = createDecipher\nexports.createDecipheriv = createDecipheriv\n","var ciphers = require('./encrypter')\nvar deciphers = require('./decrypter')\nvar modes = require('./modes/list.json')\n\nfunction getCiphers () {\n  return Object.keys(modes)\n}\n\nexports.createCipher = exports.Cipher = ciphers.createCipher\nexports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv\nexports.createDecipher = exports.Decipher = deciphers.createDecipher\nexports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv\nexports.listCiphers = exports.getCiphers = getCiphers\n","exports['des-ecb'] = {\n  key: 8,\n  iv: 0\n}\nexports['des-cbc'] = exports.des = {\n  key: 8,\n  iv: 8\n}\nexports['des-ede3-cbc'] = exports.des3 = {\n  key: 24,\n  iv: 8\n}\nexports['des-ede3'] = {\n  key: 24,\n  iv: 0\n}\nexports['des-ede-cbc'] = {\n  key: 16,\n  iv: 8\n}\nexports['des-ede'] = {\n  key: 16,\n  iv: 0\n}\n","var DES = require('browserify-des')\nvar aes = require('browserify-aes/browser')\nvar aesModes = require('browserify-aes/modes')\nvar desModes = require('browserify-des/modes')\nvar ebtk = require('evp_bytestokey')\n\nfunction createCipher (suite, password) {\n  suite = suite.toLowerCase()\n\n  var keyLen, ivLen\n  if (aesModes[suite]) {\n    keyLen = aesModes[suite].key\n    ivLen = aesModes[suite].iv\n  } else if (desModes[suite]) {\n    keyLen = desModes[suite].key * 8\n    ivLen = desModes[suite].iv\n  } else {\n    throw new TypeError('invalid suite type')\n  }\n\n  var keys = ebtk(password, false, keyLen, ivLen)\n  return createCipheriv(suite, keys.key, keys.iv)\n}\n\nfunction createDecipher (suite, password) {\n  suite = suite.toLowerCase()\n\n  var keyLen, ivLen\n  if (aesModes[suite]) {\n    keyLen = aesModes[suite].key\n    ivLen = aesModes[suite].iv\n  } else if (desModes[suite]) {\n    keyLen = desModes[suite].key * 8\n    ivLen = desModes[suite].iv\n  } else {\n    throw new TypeError('invalid suite type')\n  }\n\n  var keys = ebtk(password, false, keyLen, ivLen)\n  return createDecipheriv(suite, keys.key, keys.iv)\n}\n\nfunction createCipheriv (suite, key, iv) {\n  suite = suite.toLowerCase()\n  if (aesModes[suite]) return aes.createCipheriv(suite, key, iv)\n  if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite })\n\n  throw new TypeError('invalid suite type')\n}\n\nfunction createDecipheriv (suite, key, iv) {\n  suite = suite.toLowerCase()\n  if (aesModes[suite]) return aes.createDecipheriv(suite, key, iv)\n  if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite, decrypt: true })\n\n  throw new TypeError('invalid suite type')\n}\n\nfunction getCiphers () {\n  return Object.keys(desModes).concat(aes.getCiphers())\n}\n\nexports.createCipher = exports.Cipher = createCipher\nexports.createCipheriv = exports.Cipheriv = createCipheriv\nexports.createDecipher = exports.Decipher = createDecipher\nexports.createDecipheriv = exports.Decipheriv = createDecipheriv\nexports.listCiphers = exports.getCiphers = getCiphers\n","var 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","var bn = require('bn.js');\nvar brorand = require('brorand');\n\nfunction MillerRabin(rand) {\n  this.rand = rand || new brorand.Rand();\n}\nmodule.exports = MillerRabin;\n\nMillerRabin.create = function create(rand) {\n  return new MillerRabin(rand);\n};\n\nMillerRabin.prototype._randbelow = function _randbelow(n) {\n  var len = n.bitLength();\n  var min_bytes = Math.ceil(len / 8);\n\n  // Generage random bytes until a number less than n is found.\n  // This ensures that 0..n-1 have an equal probability of being selected.\n  do\n    var a = new bn(this.rand.generate(min_bytes));\n  while (a.cmp(n) >= 0);\n\n  return a;\n};\n\nMillerRabin.prototype._randrange = function _randrange(start, stop) {\n  // Generate a random number greater than or equal to start and less than stop.\n  var size = stop.sub(start);\n  return start.add(this._randbelow(size));\n};\n\nMillerRabin.prototype.test = function test(n, k, cb) {\n  var len = n.bitLength();\n  var red = bn.mont(n);\n  var rone = new bn(1).toRed(red);\n\n  if (!k)\n    k = Math.max(1, (len / 48) | 0);\n\n  // Find d and s, (n - 1) = (2 ^ s) * d;\n  var n1 = n.subn(1);\n  for (var s = 0; !n1.testn(s); s++) {}\n  var d = n.shrn(s);\n\n  var rn1 = n1.toRed(red);\n\n  var prime = true;\n  for (; k > 0; k--) {\n    var a = this._randrange(new bn(2), n1);\n    if (cb)\n      cb(a);\n\n    var x = a.toRed(red).redPow(d);\n    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n      continue;\n\n    for (var i = 1; i < s; i++) {\n      x = x.redSqr();\n\n      if (x.cmp(rone) === 0)\n        return false;\n      if (x.cmp(rn1) === 0)\n        break;\n    }\n\n    if (i === s)\n      return false;\n  }\n\n  return prime;\n};\n\nMillerRabin.prototype.getDivisor = function getDivisor(n, k) {\n  var len = n.bitLength();\n  var red = bn.mont(n);\n  var rone = new bn(1).toRed(red);\n\n  if (!k)\n    k = Math.max(1, (len / 48) | 0);\n\n  // Find d and s, (n - 1) = (2 ^ s) * d;\n  var n1 = n.subn(1);\n  for (var s = 0; !n1.testn(s); s++) {}\n  var d = n.shrn(s);\n\n  var rn1 = n1.toRed(red);\n\n  for (; k > 0; k--) {\n    var a = this._randrange(new bn(2), n1);\n\n    var g = n.gcd(a);\n    if (g.cmpn(1) !== 0)\n      return g;\n\n    var x = a.toRed(red).redPow(d);\n    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n      continue;\n\n    for (var i = 1; i < s; i++) {\n      x = x.redSqr();\n\n      if (x.cmp(rone) === 0)\n        return x.fromRed().subn(1).gcd(n);\n      if (x.cmp(rn1) === 0)\n        break;\n    }\n\n    if (i === s) {\n      x = x.redSqr();\n      return x.fromRed().subn(1).gcd(n);\n    }\n  }\n\n  return false;\n};\n","var randomBytes = require('randombytes');\nmodule.exports = findPrime;\nfindPrime.simpleSieve = simpleSieve;\nfindPrime.fermatTest = fermatTest;\nvar BN = require('bn.js');\nvar TWENTYFOUR = new BN(24);\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar ONE = new BN(1);\nvar TWO = new BN(2);\nvar FIVE = new BN(5);\nvar SIXTEEN = new BN(16);\nvar EIGHT = new BN(8);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar ELEVEN = new BN(11);\nvar FOUR = new BN(4);\nvar TWELVE = new BN(12);\nvar primes = null;\n\nfunction _getPrimes() {\n  if (primes !== null)\n    return primes;\n\n  var limit = 0x100000;\n  var res = [];\n  res[0] = 2;\n  for (var i = 1, k = 3; k < limit; k += 2) {\n    var sqrt = Math.ceil(Math.sqrt(k));\n    for (var j = 0; j < i && res[j] <= sqrt; j++)\n      if (k % res[j] === 0)\n        break;\n\n    if (i !== j && res[j] <= sqrt)\n      continue;\n\n    res[i++] = k;\n  }\n  primes = res;\n  return res;\n}\n\nfunction simpleSieve(p) {\n  var primes = _getPrimes();\n\n  for (var i = 0; i < primes.length; i++)\n    if (p.modn(primes[i]) === 0) {\n      if (p.cmpn(primes[i]) === 0) {\n        return true;\n      } else {\n        return false;\n      }\n    }\n\n  return true;\n}\n\nfunction fermatTest(p) {\n  var red = BN.mont(p);\n  return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n}\n\nfunction findPrime(bits, gen) {\n  if (bits < 16) {\n    // this is what openssl does\n    if (gen === 2 || gen === 5) {\n      return new BN([0x8c, 0x7b]);\n    } else {\n      return new BN([0x8c, 0x27]);\n    }\n  }\n  gen = new BN(gen);\n\n  var num, n2;\n\n  while (true) {\n    num = new BN(randomBytes(Math.ceil(bits / 8)));\n    while (num.bitLength() > bits) {\n      num.ishrn(1);\n    }\n    if (num.isEven()) {\n      num.iadd(ONE);\n    }\n    if (!num.testn(1)) {\n      num.iadd(TWO);\n    }\n    if (!gen.cmp(TWO)) {\n      while (num.mod(TWENTYFOUR).cmp(ELEVEN)) {\n        num.iadd(FOUR);\n      }\n    } else if (!gen.cmp(FIVE)) {\n      while (num.mod(TEN).cmp(THREE)) {\n        num.iadd(FOUR);\n      }\n    }\n    n2 = num.shrn(1);\n    if (simpleSieve(n2) && simpleSieve(num) &&\n      fermatTest(n2) && fermatTest(num) &&\n      millerRabin.test(n2) && millerRabin.test(num)) {\n      return num;\n    }\n  }\n\n}\n","var BN = require('bn.js');\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar TWENTYFOUR = new BN(24);\nvar ELEVEN = new BN(11);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar primes = require('./generatePrime');\nvar randomBytes = require('randombytes');\nmodule.exports = DH;\n\nfunction setPublicKey(pub, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(pub)) {\n    pub = new Buffer(pub, enc);\n  }\n  this._pub = new BN(pub);\n  return this;\n}\n\nfunction setPrivateKey(priv, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(priv)) {\n    priv = new Buffer(priv, enc);\n  }\n  this._priv = new BN(priv);\n  return this;\n}\n\nvar primeCache = {};\nfunction checkPrime(prime, generator) {\n  var gen = generator.toString('hex');\n  var hex = [gen, prime.toString(16)].join('_');\n  if (hex in primeCache) {\n    return primeCache[hex];\n  }\n  var error = 0;\n\n  if (prime.isEven() ||\n    !primes.simpleSieve ||\n    !primes.fermatTest(prime) ||\n    !millerRabin.test(prime)) {\n    //not a prime so +1\n    error += 1;\n\n    if (gen === '02' || gen === '05') {\n      // we'd be able to check the generator\n      // it would fail so +8\n      error += 8;\n    } else {\n      //we wouldn't be able to test the generator\n      // so +4\n      error += 4;\n    }\n    primeCache[hex] = error;\n    return error;\n  }\n  if (!millerRabin.test(prime.shrn(1))) {\n    //not a safe prime\n    error += 2;\n  }\n  var rem;\n  switch (gen) {\n    case '02':\n      if (prime.mod(TWENTYFOUR).cmp(ELEVEN)) {\n        // unsuidable generator\n        error += 8;\n      }\n      break;\n    case '05':\n      rem = prime.mod(TEN);\n      if (rem.cmp(THREE) && rem.cmp(SEVEN)) {\n        // prime mod 10 needs to equal 3 or 7\n        error += 8;\n      }\n      break;\n    default:\n      error += 4;\n  }\n  primeCache[hex] = error;\n  return error;\n}\n\nfunction DH(prime, generator, malleable) {\n  this.setGenerator(generator);\n  this.__prime = new BN(prime);\n  this._prime = BN.mont(this.__prime);\n  this._primeLen = prime.length;\n  this._pub = undefined;\n  this._priv = undefined;\n  this._primeCode = undefined;\n  if (malleable) {\n    this.setPublicKey = setPublicKey;\n    this.setPrivateKey = setPrivateKey;\n  } else {\n    this._primeCode = 8;\n  }\n}\nObject.defineProperty(DH.prototype, 'verifyError', {\n  enumerable: true,\n  get: function () {\n    if (typeof this._primeCode !== 'number') {\n      this._primeCode = checkPrime(this.__prime, this.__gen);\n    }\n    return this._primeCode;\n  }\n});\nDH.prototype.generateKeys = function () {\n  if (!this._priv) {\n    this._priv = new BN(randomBytes(this._primeLen));\n  }\n  this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed();\n  return this.getPublicKey();\n};\n\nDH.prototype.computeSecret = function (other) {\n  other = new BN(other);\n  other = other.toRed(this._prime);\n  var secret = other.redPow(this._priv).fromRed();\n  var out = new Buffer(secret.toArray());\n  var prime = this.getPrime();\n  if (out.length < prime.length) {\n    var front = new Buffer(prime.length - out.length);\n    front.fill(0);\n    out = Buffer.concat([front, out]);\n  }\n  return out;\n};\n\nDH.prototype.getPublicKey = function getPublicKey(enc) {\n  return formatReturnValue(this._pub, enc);\n};\n\nDH.prototype.getPrivateKey = function getPrivateKey(enc) {\n  return formatReturnValue(this._priv, enc);\n};\n\nDH.prototype.getPrime = function (enc) {\n  return formatReturnValue(this.__prime, enc);\n};\n\nDH.prototype.getGenerator = function (enc) {\n  return formatReturnValue(this._gen, enc);\n};\n\nDH.prototype.setGenerator = function (gen, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(gen)) {\n    gen = new Buffer(gen, enc);\n  }\n  this.__gen = gen;\n  this._gen = new BN(gen);\n  return this;\n};\n\nfunction formatReturnValue(bn, enc) {\n  var buf = new Buffer(bn.toArray());\n  if (!enc) {\n    return buf;\n  } else {\n    return buf.toString(enc);\n  }\n}\n","var generatePrime = require('./lib/generatePrime')\nvar primes = require('./lib/primes.json')\n\nvar DH = require('./lib/dh')\n\nfunction getDiffieHellman (mod) {\n  var prime = new Buffer(primes[mod].prime, 'hex')\n  var gen = new Buffer(primes[mod].gen, 'hex')\n\n  return new DH(prime, gen)\n}\n\nvar ENCODINGS = {\n  'binary': true, 'hex': true, 'base64': true\n}\n\nfunction createDiffieHellman (prime, enc, generator, genc) {\n  if (Buffer.isBuffer(enc) || ENCODINGS[enc] === undefined) {\n    return createDiffieHellman(prime, 'binary', enc, generator)\n  }\n\n  enc = enc || 'binary'\n  genc = genc || 'binary'\n  generator = generator || new Buffer([2])\n\n  if (!Buffer.isBuffer(generator)) {\n    generator = new Buffer(generator, genc)\n  }\n\n  if (typeof prime === 'number') {\n    return new DH(generatePrime(prime, generator), generator, true)\n  }\n\n  if (!Buffer.isBuffer(prime)) {\n    prime = new Buffer(prime, enc)\n  }\n\n  return new DH(prime, generator, true)\n}\n\nexports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman\nexports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman\n","(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [number & 0x3ffffff];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [0];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this._strip();\n  };\n\n  function parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // '0' - '9'\n    if (c >= 48 && c <= 57) {\n      return c - 48;\n    // 'A' - 'F'\n    } else if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    } else {\n      assert(false, 'Invalid character in ' + string);\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this._strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var b = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        b = c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        b = c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        b = c;\n      }\n      assert(c >= 0 && b < mul, 'Invalid character');\n      r += b;\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [0];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this._strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  function move (dest, src) {\n    dest.words = src.words;\n    dest.length = src.length;\n    dest.negative = src.negative;\n    dest.red = src.red;\n  }\n\n  BN.prototype._move = function _move (dest) {\n    move(dest, this);\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype._strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  // Check Symbol.for because not everywhere where Symbol defined\n  // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n  if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n    try {\n      BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n    } catch (e) {\n      BN.prototype.inspect = inspect;\n    }\n  } else {\n    BN.prototype.inspect = inspect;\n  }\n\n  function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  }\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        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.modrn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16, 2);\n  };\n\n  if (Buffer) {\n    BN.prototype.toBuffer = function toBuffer (endian, length) {\n      return this.toArrayLike(Buffer, endian, length);\n    };\n  }\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  var allocate = function allocate (ArrayType, size) {\n    if (ArrayType.allocUnsafe) {\n      return ArrayType.allocUnsafe(size);\n    }\n    return new ArrayType(size);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    this._strip();\n\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    var res = allocate(ArrayType, reqLength);\n    var postfix = endian === 'le' ? 'LE' : 'BE';\n    this['_toArrayLike' + postfix](res, byteLength);\n    return res;\n  };\n\n  BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n    var position = 0;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position++] = word & 0xff;\n      if (position < res.length) {\n        res[position++] = (word >> 8) & 0xff;\n      }\n      if (position < res.length) {\n        res[position++] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position < res.length) {\n          res[position++] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position < res.length) {\n      res[position++] = carry;\n\n      while (position < res.length) {\n        res[position++] = 0;\n      }\n    }\n  };\n\n  BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n    var position = res.length - 1;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position--] = word & 0xff;\n      if (position >= 0) {\n        res[position--] = (word >> 8) & 0xff;\n      }\n      if (position >= 0) {\n        res[position--] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position >= 0) {\n          res[position--] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position >= 0) {\n      res[position--] = carry;\n\n      while (position >= 0) {\n        res[position--] = 0;\n      }\n    }\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] >>> wbit) & 0x01;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this._strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this._strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this._strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n    // var fftm = new FFTM();\n    // return fftm.mulp(self, num, out);\n    return bigMulTo(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out._strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    this.length = num === 0 ? 1 : this.length;\n\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this._strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) <= num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this._strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this._strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q._strip();\n    }\n    a._strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modrn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modrn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modrn = function modrn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return isNegNum ? -acc : acc;\n  };\n\n  // WARNING: DEPRECATED\n  BN.prototype.modn = function modn (num) {\n    return this.modrn(num);\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    this._strip();\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this._strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is a BN v4 instance\n        r.strip();\n      } else {\n        // r is a BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n    move(a, a.umod(this.m)._forceRed(this));\n    return a;\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","'use strict';\n\nvar BN = require('bn.js');\nvar randomBytes = require('randombytes');\nvar Buffer = require('safe-buffer').Buffer;\n\nfunction getr(priv) {\n\tvar len = priv.modulus.byteLength();\n\tvar r;\n\tdo {\n\t\tr = new BN(randomBytes(len));\n\t} while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2));\n\treturn r;\n}\n\nfunction blind(priv) {\n\tvar r = getr(priv);\n\tvar blinder = r.toRed(BN.mont(priv.modulus)).redPow(new BN(priv.publicExponent)).fromRed();\n\treturn { blinder: blinder, unblinder: r.invm(priv.modulus) };\n}\n\nfunction crt(msg, priv) {\n\tvar blinds = blind(priv);\n\tvar len = priv.modulus.byteLength();\n\tvar blinded = new BN(msg).mul(blinds.blinder).umod(priv.modulus);\n\tvar c1 = blinded.toRed(BN.mont(priv.prime1));\n\tvar c2 = blinded.toRed(BN.mont(priv.prime2));\n\tvar qinv = priv.coefficient;\n\tvar p = priv.prime1;\n\tvar q = priv.prime2;\n\tvar m1 = c1.redPow(priv.exponent1).fromRed();\n\tvar m2 = c2.redPow(priv.exponent2).fromRed();\n\tvar h = m1.isub(m2).imul(qinv).umod(p).imul(q);\n\treturn m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, 'be', len);\n}\ncrt.getr = getr;\n\nmodule.exports = crt;\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","'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","'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 curve = exports;\n\ncurve.base = require('./base');\ncurve.short = require('./short');\ncurve.mont = require('./mont');\ncurve.edwards = require('./edwards');\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\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 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 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');\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 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');\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\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');\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","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","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 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","'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 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 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","'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 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","var asn1 = require('../asn1');\nvar inherits = require('inherits');\n\nvar api = exports;\n\napi.define = function define(name, body) {\n  return new Entity(name, body);\n};\n\nfunction Entity(name, body) {\n  this.name = name;\n  this.body = body;\n\n  this.decoders = {};\n  this.encoders = {};\n};\n\nEntity.prototype._createNamed = function createNamed(base) {\n  var named;\n  try {\n    named = require('vm').runInThisContext(\n      '(function ' + this.name + '(entity) {\\n' +\n      '  this._initNamed(entity);\\n' +\n      '})'\n    );\n  } catch (e) {\n    named = function (entity) {\n      this._initNamed(entity);\n    };\n  }\n  inherits(named, base);\n  named.prototype._initNamed = function initnamed(entity) {\n    base.call(this, entity);\n  };\n\n  return new named(this);\n};\n\nEntity.prototype._getDecoder = function _getDecoder(enc) {\n  enc = enc || 'der';\n  // Lazily create decoder\n  if (!this.decoders.hasOwnProperty(enc))\n    this.decoders[enc] = this._createNamed(asn1.decoders[enc]);\n  return this.decoders[enc];\n};\n\nEntity.prototype.decode = function decode(data, enc, options) {\n  return this._getDecoder(enc).decode(data, options);\n};\n\nEntity.prototype._getEncoder = function _getEncoder(enc) {\n  enc = enc || 'der';\n  // Lazily create encoder\n  if (!this.encoders.hasOwnProperty(enc))\n    this.encoders[enc] = this._createNamed(asn1.encoders[enc]);\n  return this.encoders[enc];\n};\n\nEntity.prototype.encode = function encode(data, enc, /* internal */ reporter) {\n  return this._getEncoder(enc).encode(data, reporter);\n};\n","var inherits = require('inherits');\n\nfunction Reporter(options) {\n  this._reporterState = {\n    obj: null,\n    path: [],\n    options: options || {},\n    errors: []\n  };\n}\nexports.Reporter = Reporter;\n\nReporter.prototype.isError = function isError(obj) {\n  return obj instanceof ReporterError;\n};\n\nReporter.prototype.save = function save() {\n  var state = this._reporterState;\n\n  return { obj: state.obj, pathLen: state.path.length };\n};\n\nReporter.prototype.restore = function restore(data) {\n  var state = this._reporterState;\n\n  state.obj = data.obj;\n  state.path = state.path.slice(0, data.pathLen);\n};\n\nReporter.prototype.enterKey = function enterKey(key) {\n  return this._reporterState.path.push(key);\n};\n\nReporter.prototype.exitKey = function exitKey(index) {\n  var state = this._reporterState;\n\n  state.path = state.path.slice(0, index - 1);\n};\n\nReporter.prototype.leaveKey = function leaveKey(index, key, value) {\n  var state = this._reporterState;\n\n  this.exitKey(index);\n  if (state.obj !== null)\n    state.obj[key] = value;\n};\n\nReporter.prototype.path = function path() {\n  return this._reporterState.path.join('/');\n};\n\nReporter.prototype.enterObject = function enterObject() {\n  var state = this._reporterState;\n\n  var prev = state.obj;\n  state.obj = {};\n  return prev;\n};\n\nReporter.prototype.leaveObject = function leaveObject(prev) {\n  var state = this._reporterState;\n\n  var now = state.obj;\n  state.obj = prev;\n  return now;\n};\n\nReporter.prototype.error = function error(msg) {\n  var err;\n  var state = this._reporterState;\n\n  var inherited = msg instanceof ReporterError;\n  if (inherited) {\n    err = msg;\n  } else {\n    err = new ReporterError(state.path.map(function(elem) {\n      return '[' + JSON.stringify(elem) + ']';\n    }).join(''), msg.message || msg, msg.stack);\n  }\n\n  if (!state.options.partial)\n    throw err;\n\n  if (!inherited)\n    state.errors.push(err);\n\n  return err;\n};\n\nReporter.prototype.wrapResult = function wrapResult(result) {\n  var state = this._reporterState;\n  if (!state.options.partial)\n    return result;\n\n  return {\n    result: this.isError(result) ? null : result,\n    errors: state.errors\n  };\n};\n\nfunction ReporterError(path, msg) {\n  this.path = path;\n  this.rethrow(msg);\n};\ninherits(ReporterError, Error);\n\nReporterError.prototype.rethrow = function rethrow(msg) {\n  this.message = msg + ' at: ' + (this.path || '(shallow)');\n  if (Error.captureStackTrace)\n    Error.captureStackTrace(this, ReporterError);\n\n  if (!this.stack) {\n    try {\n      // IE only adds stack when thrown\n      throw new Error(this.message);\n    } catch (e) {\n      this.stack = e.stack;\n    }\n  }\n  return this;\n};\n","var inherits = require('inherits');\nvar Reporter = require('../base').Reporter;\nvar Buffer = require('buffer').Buffer;\n\nfunction DecoderBuffer(base, options) {\n  Reporter.call(this, options);\n  if (!Buffer.isBuffer(base)) {\n    this.error('Input not Buffer');\n    return;\n  }\n\n  this.base = base;\n  this.offset = 0;\n  this.length = base.length;\n}\ninherits(DecoderBuffer, Reporter);\nexports.DecoderBuffer = DecoderBuffer;\n\nDecoderBuffer.prototype.save = function save() {\n  return { offset: this.offset, reporter: Reporter.prototype.save.call(this) };\n};\n\nDecoderBuffer.prototype.restore = function restore(save) {\n  // Return skipped data\n  var res = new DecoderBuffer(this.base);\n  res.offset = save.offset;\n  res.length = this.offset;\n\n  this.offset = save.offset;\n  Reporter.prototype.restore.call(this, save.reporter);\n\n  return res;\n};\n\nDecoderBuffer.prototype.isEmpty = function isEmpty() {\n  return this.offset === this.length;\n};\n\nDecoderBuffer.prototype.readUInt8 = function readUInt8(fail) {\n  if (this.offset + 1 <= this.length)\n    return this.base.readUInt8(this.offset++, true);\n  else\n    return this.error(fail || 'DecoderBuffer overrun');\n}\n\nDecoderBuffer.prototype.skip = function skip(bytes, fail) {\n  if (!(this.offset + bytes <= this.length))\n    return this.error(fail || 'DecoderBuffer overrun');\n\n  var res = new DecoderBuffer(this.base);\n\n  // Share reporter state\n  res._reporterState = this._reporterState;\n\n  res.offset = this.offset;\n  res.length = this.offset + bytes;\n  this.offset += bytes;\n  return res;\n}\n\nDecoderBuffer.prototype.raw = function raw(save) {\n  return this.base.slice(save ? save.offset : this.offset, this.length);\n}\n\nfunction EncoderBuffer(value, reporter) {\n  if (Array.isArray(value)) {\n    this.length = 0;\n    this.value = value.map(function(item) {\n      if (!(item instanceof EncoderBuffer))\n        item = new EncoderBuffer(item, reporter);\n      this.length += item.length;\n      return item;\n    }, this);\n  } else if (typeof value === 'number') {\n    if (!(0 <= value && value <= 0xff))\n      return reporter.error('non-byte EncoderBuffer value');\n    this.value = value;\n    this.length = 1;\n  } else if (typeof value === 'string') {\n    this.value = value;\n    this.length = Buffer.byteLength(value);\n  } else if (Buffer.isBuffer(value)) {\n    this.value = value;\n    this.length = value.length;\n  } else {\n    return reporter.error('Unsupported type: ' + typeof value);\n  }\n}\nexports.EncoderBuffer = EncoderBuffer;\n\nEncoderBuffer.prototype.join = function join(out, offset) {\n  if (!out)\n    out = new Buffer(this.length);\n  if (!offset)\n    offset = 0;\n\n  if (this.length === 0)\n    return out;\n\n  if (Array.isArray(this.value)) {\n    this.value.forEach(function(item) {\n      item.join(out, offset);\n      offset += item.length;\n    });\n  } else {\n    if (typeof this.value === 'number')\n      out[offset] = this.value;\n    else if (typeof this.value === 'string')\n      out.write(this.value, offset);\n    else if (Buffer.isBuffer(this.value))\n      this.value.copy(out, offset);\n    offset += this.length;\n  }\n\n  return out;\n};\n","var Reporter = require('../base').Reporter;\nvar EncoderBuffer = require('../base').EncoderBuffer;\nvar DecoderBuffer = require('../base').DecoderBuffer;\nvar assert = require('minimalistic-assert');\n\n// Supported tags\nvar tags = [\n  'seq', 'seqof', 'set', 'setof', 'objid', 'bool',\n  'gentime', 'utctime', 'null_', 'enum', 'int', 'objDesc',\n  'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str',\n  'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr'\n];\n\n// Public methods list\nvar methods = [\n  'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice',\n  'any', 'contains'\n].concat(tags);\n\n// Overrided methods list\nvar overrided = [\n  '_peekTag', '_decodeTag', '_use',\n  '_decodeStr', '_decodeObjid', '_decodeTime',\n  '_decodeNull', '_decodeInt', '_decodeBool', '_decodeList',\n\n  '_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime',\n  '_encodeNull', '_encodeInt', '_encodeBool'\n];\n\nfunction Node(enc, parent) {\n  var state = {};\n  this._baseState = state;\n\n  state.enc = enc;\n\n  state.parent = parent || null;\n  state.children = null;\n\n  // State\n  state.tag = null;\n  state.args = null;\n  state.reverseArgs = null;\n  state.choice = null;\n  state.optional = false;\n  state.any = false;\n  state.obj = false;\n  state.use = null;\n  state.useDecoder = null;\n  state.key = null;\n  state['default'] = null;\n  state.explicit = null;\n  state.implicit = null;\n  state.contains = null;\n\n  // Should create new instance on each method\n  if (!state.parent) {\n    state.children = [];\n    this._wrap();\n  }\n}\nmodule.exports = Node;\n\nvar stateProps = [\n  'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice',\n  'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit',\n  'implicit', 'contains'\n];\n\nNode.prototype.clone = function clone() {\n  var state = this._baseState;\n  var cstate = {};\n  stateProps.forEach(function(prop) {\n    cstate[prop] = state[prop];\n  });\n  var res = new this.constructor(cstate.parent);\n  res._baseState = cstate;\n  return res;\n};\n\nNode.prototype._wrap = function wrap() {\n  var state = this._baseState;\n  methods.forEach(function(method) {\n    this[method] = function _wrappedMethod() {\n      var clone = new this.constructor(this);\n      state.children.push(clone);\n      return clone[method].apply(clone, arguments);\n    };\n  }, this);\n};\n\nNode.prototype._init = function init(body) {\n  var state = this._baseState;\n\n  assert(state.parent === null);\n  body.call(this);\n\n  // Filter children\n  state.children = state.children.filter(function(child) {\n    return child._baseState.parent === this;\n  }, this);\n  assert.equal(state.children.length, 1, 'Root node can have only one child');\n};\n\nNode.prototype._useArgs = function useArgs(args) {\n  var state = this._baseState;\n\n  // Filter children and args\n  var children = args.filter(function(arg) {\n    return arg instanceof this.constructor;\n  }, this);\n  args = args.filter(function(arg) {\n    return !(arg instanceof this.constructor);\n  }, this);\n\n  if (children.length !== 0) {\n    assert(state.children === null);\n    state.children = children;\n\n    // Replace parent to maintain backward link\n    children.forEach(function(child) {\n      child._baseState.parent = this;\n    }, this);\n  }\n  if (args.length !== 0) {\n    assert(state.args === null);\n    state.args = args;\n    state.reverseArgs = args.map(function(arg) {\n      if (typeof arg !== 'object' || arg.constructor !== Object)\n        return arg;\n\n      var res = {};\n      Object.keys(arg).forEach(function(key) {\n        if (key == (key | 0))\n          key |= 0;\n        var value = arg[key];\n        res[value] = key;\n      });\n      return res;\n    });\n  }\n};\n\n//\n// Overrided methods\n//\n\noverrided.forEach(function(method) {\n  Node.prototype[method] = function _overrided() {\n    var state = this._baseState;\n    throw new Error(method + ' not implemented for encoding: ' + state.enc);\n  };\n});\n\n//\n// Public methods\n//\n\ntags.forEach(function(tag) {\n  Node.prototype[tag] = function _tagMethod() {\n    var state = this._baseState;\n    var args = Array.prototype.slice.call(arguments);\n\n    assert(state.tag === null);\n    state.tag = tag;\n\n    this._useArgs(args);\n\n    return this;\n  };\n});\n\nNode.prototype.use = function use(item) {\n  assert(item);\n  var state = this._baseState;\n\n  assert(state.use === null);\n  state.use = item;\n\n  return this;\n};\n\nNode.prototype.optional = function optional() {\n  var state = this._baseState;\n\n  state.optional = true;\n\n  return this;\n};\n\nNode.prototype.def = function def(val) {\n  var state = this._baseState;\n\n  assert(state['default'] === null);\n  state['default'] = val;\n  state.optional = true;\n\n  return this;\n};\n\nNode.prototype.explicit = function explicit(num) {\n  var state = this._baseState;\n\n  assert(state.explicit === null && state.implicit === null);\n  state.explicit = num;\n\n  return this;\n};\n\nNode.prototype.implicit = function implicit(num) {\n  var state = this._baseState;\n\n  assert(state.explicit === null && state.implicit === null);\n  state.implicit = num;\n\n  return this;\n};\n\nNode.prototype.obj = function obj() {\n  var state = this._baseState;\n  var args = Array.prototype.slice.call(arguments);\n\n  state.obj = true;\n\n  if (args.length !== 0)\n    this._useArgs(args);\n\n  return this;\n};\n\nNode.prototype.key = function key(newKey) {\n  var state = this._baseState;\n\n  assert(state.key === null);\n  state.key = newKey;\n\n  return this;\n};\n\nNode.prototype.any = function any() {\n  var state = this._baseState;\n\n  state.any = true;\n\n  return this;\n};\n\nNode.prototype.choice = function choice(obj) {\n  var state = this._baseState;\n\n  assert(state.choice === null);\n  state.choice = obj;\n  this._useArgs(Object.keys(obj).map(function(key) {\n    return obj[key];\n  }));\n\n  return this;\n};\n\nNode.prototype.contains = function contains(item) {\n  var state = this._baseState;\n\n  assert(state.use === null);\n  state.contains = item;\n\n  return this;\n};\n\n//\n// Decoding\n//\n\nNode.prototype._decode = function decode(input, options) {\n  var state = this._baseState;\n\n  // Decode root node\n  if (state.parent === null)\n    return input.wrapResult(state.children[0]._decode(input, options));\n\n  var result = state['default'];\n  var present = true;\n\n  var prevKey = null;\n  if (state.key !== null)\n    prevKey = input.enterKey(state.key);\n\n  // Check if tag is there\n  if (state.optional) {\n    var tag = null;\n    if (state.explicit !== null)\n      tag = state.explicit;\n    else if (state.implicit !== null)\n      tag = state.implicit;\n    else if (state.tag !== null)\n      tag = state.tag;\n\n    if (tag === null && !state.any) {\n      // Trial and Error\n      var save = input.save();\n      try {\n        if (state.choice === null)\n          this._decodeGeneric(state.tag, input, options);\n        else\n          this._decodeChoice(input, options);\n        present = true;\n      } catch (e) {\n        present = false;\n      }\n      input.restore(save);\n    } else {\n      present = this._peekTag(input, tag, state.any);\n\n      if (input.isError(present))\n        return present;\n    }\n  }\n\n  // Push object on stack\n  var prevObj;\n  if (state.obj && present)\n    prevObj = input.enterObject();\n\n  if (present) {\n    // Unwrap explicit values\n    if (state.explicit !== null) {\n      var explicit = this._decodeTag(input, state.explicit);\n      if (input.isError(explicit))\n        return explicit;\n      input = explicit;\n    }\n\n    var start = input.offset;\n\n    // Unwrap implicit and normal values\n    if (state.use === null && state.choice === null) {\n      if (state.any)\n        var save = input.save();\n      var body = this._decodeTag(\n        input,\n        state.implicit !== null ? state.implicit : state.tag,\n        state.any\n      );\n      if (input.isError(body))\n        return body;\n\n      if (state.any)\n        result = input.raw(save);\n      else\n        input = body;\n    }\n\n    if (options && options.track && state.tag !== null)\n      options.track(input.path(), start, input.length, 'tagged');\n\n    if (options && options.track && state.tag !== null)\n      options.track(input.path(), input.offset, input.length, 'content');\n\n    // Select proper method for tag\n    if (state.any)\n      result = result;\n    else if (state.choice === null)\n      result = this._decodeGeneric(state.tag, input, options);\n    else\n      result = this._decodeChoice(input, options);\n\n    if (input.isError(result))\n      return result;\n\n    // Decode children\n    if (!state.any && state.choice === null && state.children !== null) {\n      state.children.forEach(function decodeChildren(child) {\n        // NOTE: We are ignoring errors here, to let parser continue with other\n        // parts of encoded data\n        child._decode(input, options);\n      });\n    }\n\n    // Decode contained/encoded by schema, only in bit or octet strings\n    if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) {\n      var data = new DecoderBuffer(result);\n      result = this._getUse(state.contains, input._reporterState.obj)\n          ._decode(data, options);\n    }\n  }\n\n  // Pop object\n  if (state.obj && present)\n    result = input.leaveObject(prevObj);\n\n  // Set key\n  if (state.key !== null && (result !== null || present === true))\n    input.leaveKey(prevKey, state.key, result);\n  else if (prevKey !== null)\n    input.exitKey(prevKey);\n\n  return result;\n};\n\nNode.prototype._decodeGeneric = function decodeGeneric(tag, input, options) {\n  var state = this._baseState;\n\n  if (tag === 'seq' || tag === 'set')\n    return null;\n  if (tag === 'seqof' || tag === 'setof')\n    return this._decodeList(input, tag, state.args[0], options);\n  else if (/str$/.test(tag))\n    return this._decodeStr(input, tag, options);\n  else if (tag === 'objid' && state.args)\n    return this._decodeObjid(input, state.args[0], state.args[1], options);\n  else if (tag === 'objid')\n    return this._decodeObjid(input, null, null, options);\n  else if (tag === 'gentime' || tag === 'utctime')\n    return this._decodeTime(input, tag, options);\n  else if (tag === 'null_')\n    return this._decodeNull(input, options);\n  else if (tag === 'bool')\n    return this._decodeBool(input, options);\n  else if (tag === 'objDesc')\n    return this._decodeStr(input, tag, options);\n  else if (tag === 'int' || tag === 'enum')\n    return this._decodeInt(input, state.args && state.args[0], options);\n\n  if (state.use !== null) {\n    return this._getUse(state.use, input._reporterState.obj)\n        ._decode(input, options);\n  } else {\n    return input.error('unknown tag: ' + tag);\n  }\n};\n\nNode.prototype._getUse = function _getUse(entity, obj) {\n\n  var state = this._baseState;\n  // Create altered use decoder if implicit is set\n  state.useDecoder = this._use(entity, obj);\n  assert(state.useDecoder._baseState.parent === null);\n  state.useDecoder = state.useDecoder._baseState.children[0];\n  if (state.implicit !== state.useDecoder._baseState.implicit) {\n    state.useDecoder = state.useDecoder.clone();\n    state.useDecoder._baseState.implicit = state.implicit;\n  }\n  return state.useDecoder;\n};\n\nNode.prototype._decodeChoice = function decodeChoice(input, options) {\n  var state = this._baseState;\n  var result = null;\n  var match = false;\n\n  Object.keys(state.choice).some(function(key) {\n    var save = input.save();\n    var node = state.choice[key];\n    try {\n      var value = node._decode(input, options);\n      if (input.isError(value))\n        return false;\n\n      result = { type: key, value: value };\n      match = true;\n    } catch (e) {\n      input.restore(save);\n      return false;\n    }\n    return true;\n  }, this);\n\n  if (!match)\n    return input.error('Choice not matched');\n\n  return result;\n};\n\n//\n// Encoding\n//\n\nNode.prototype._createEncoderBuffer = function createEncoderBuffer(data) {\n  return new EncoderBuffer(data, this.reporter);\n};\n\nNode.prototype._encode = function encode(data, reporter, parent) {\n  var state = this._baseState;\n  if (state['default'] !== null && state['default'] === data)\n    return;\n\n  var result = this._encodeValue(data, reporter, parent);\n  if (result === undefined)\n    return;\n\n  if (this._skipDefault(result, reporter, parent))\n    return;\n\n  return result;\n};\n\nNode.prototype._encodeValue = function encode(data, reporter, parent) {\n  var state = this._baseState;\n\n  // Decode root node\n  if (state.parent === null)\n    return state.children[0]._encode(data, reporter || new Reporter());\n\n  var result = null;\n\n  // Set reporter to share it with a child class\n  this.reporter = reporter;\n\n  // Check if data is there\n  if (state.optional && data === undefined) {\n    if (state['default'] !== null)\n      data = state['default']\n    else\n      return;\n  }\n\n  // Encode children first\n  var content = null;\n  var primitive = false;\n  if (state.any) {\n    // Anything that was given is translated to buffer\n    result = this._createEncoderBuffer(data);\n  } else if (state.choice) {\n    result = this._encodeChoice(data, reporter);\n  } else if (state.contains) {\n    content = this._getUse(state.contains, parent)._encode(data, reporter);\n    primitive = true;\n  } else if (state.children) {\n    content = state.children.map(function(child) {\n      if (child._baseState.tag === 'null_')\n        return child._encode(null, reporter, data);\n\n      if (child._baseState.key === null)\n        return reporter.error('Child should have a key');\n      var prevKey = reporter.enterKey(child._baseState.key);\n\n      if (typeof data !== 'object')\n        return reporter.error('Child expected, but input is not object');\n\n      var res = child._encode(data[child._baseState.key], reporter, data);\n      reporter.leaveKey(prevKey);\n\n      return res;\n    }, this).filter(function(child) {\n      return child;\n    });\n    content = this._createEncoderBuffer(content);\n  } else {\n    if (state.tag === 'seqof' || state.tag === 'setof') {\n      // TODO(indutny): this should be thrown on DSL level\n      if (!(state.args && state.args.length === 1))\n        return reporter.error('Too many args for : ' + state.tag);\n\n      if (!Array.isArray(data))\n        return reporter.error('seqof/setof, but data is not Array');\n\n      var child = this.clone();\n      child._baseState.implicit = null;\n      content = this._createEncoderBuffer(data.map(function(item) {\n        var state = this._baseState;\n\n        return this._getUse(state.args[0], data)._encode(item, reporter);\n      }, child));\n    } else if (state.use !== null) {\n      result = this._getUse(state.use, parent)._encode(data, reporter);\n    } else {\n      content = this._encodePrimitive(state.tag, data);\n      primitive = true;\n    }\n  }\n\n  // Encode data itself\n  var result;\n  if (!state.any && state.choice === null) {\n    var tag = state.implicit !== null ? state.implicit : state.tag;\n    var cls = state.implicit === null ? 'universal' : 'context';\n\n    if (tag === null) {\n      if (state.use === null)\n        reporter.error('Tag could be omitted only for .use()');\n    } else {\n      if (state.use === null)\n        result = this._encodeComposite(tag, primitive, cls, content);\n    }\n  }\n\n  // Wrap in explicit\n  if (state.explicit !== null)\n    result = this._encodeComposite(state.explicit, false, 'context', result);\n\n  return result;\n};\n\nNode.prototype._encodeChoice = function encodeChoice(data, reporter) {\n  var state = this._baseState;\n\n  var node = state.choice[data.type];\n  if (!node) {\n    assert(\n        false,\n        data.type + ' not found in ' +\n            JSON.stringify(Object.keys(state.choice)));\n  }\n  return node._encode(data.value, reporter);\n};\n\nNode.prototype._encodePrimitive = function encodePrimitive(tag, data) {\n  var state = this._baseState;\n\n  if (/str$/.test(tag))\n    return this._encodeStr(data, tag);\n  else if (tag === 'objid' && state.args)\n    return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n  else if (tag === 'objid')\n    return this._encodeObjid(data, null, null);\n  else if (tag === 'gentime' || tag === 'utctime')\n    return this._encodeTime(data, tag);\n  else if (tag === 'null_')\n    return this._encodeNull();\n  else if (tag === 'int' || tag === 'enum')\n    return this._encodeInt(data, state.args && state.reverseArgs[0]);\n  else if (tag === 'bool')\n    return this._encodeBool(data);\n  else if (tag === 'objDesc')\n    return this._encodeStr(data, tag);\n  else\n    throw new Error('Unsupported tag: ' + tag);\n};\n\nNode.prototype._isNumstr = function isNumstr(str) {\n  return /^[0-9 ]*$/.test(str);\n};\n\nNode.prototype._isPrintstr = function isPrintstr(str) {\n  return /^[A-Za-z0-9 '\\(\\)\\+,\\-\\.\\/:=\\?]*$/.test(str);\n};\n","var base = exports;\n\nbase.Reporter = require('./reporter').Reporter;\nbase.DecoderBuffer = require('./buffer').DecoderBuffer;\nbase.EncoderBuffer = require('./buffer').EncoderBuffer;\nbase.Node = require('./node');\n","var constants = require('../constants');\n\nexports.tagClass = {\n  0: 'universal',\n  1: 'application',\n  2: 'context',\n  3: 'private'\n};\nexports.tagClassByName = constants._reverse(exports.tagClass);\n\nexports.tag = {\n  0x00: 'end',\n  0x01: 'bool',\n  0x02: 'int',\n  0x03: 'bitstr',\n  0x04: 'octstr',\n  0x05: 'null_',\n  0x06: 'objid',\n  0x07: 'objDesc',\n  0x08: 'external',\n  0x09: 'real',\n  0x0a: 'enum',\n  0x0b: 'embed',\n  0x0c: 'utf8str',\n  0x0d: 'relativeOid',\n  0x10: 'seq',\n  0x11: 'set',\n  0x12: 'numstr',\n  0x13: 'printstr',\n  0x14: 't61str',\n  0x15: 'videostr',\n  0x16: 'ia5str',\n  0x17: 'utctime',\n  0x18: 'gentime',\n  0x19: 'graphstr',\n  0x1a: 'iso646str',\n  0x1b: 'genstr',\n  0x1c: 'unistr',\n  0x1d: 'charstr',\n  0x1e: 'bmpstr'\n};\nexports.tagByName = constants._reverse(exports.tag);\n","var constants = exports;\n\n// Helper\nconstants._reverse = function reverse(map) {\n  var res = {};\n\n  Object.keys(map).forEach(function(key) {\n    // Convert key to integer if it is stringified\n    if ((key | 0) == key)\n      key = key | 0;\n\n    var value = map[key];\n    res[value] = key;\n  });\n\n  return res;\n};\n\nconstants.der = require('./der');\n","var inherits = require('inherits');\n\nvar asn1 = require('../../asn1');\nvar base = asn1.base;\nvar bignum = asn1.bignum;\n\n// Import DER constants\nvar der = asn1.constants.der;\n\nfunction DERDecoder(entity) {\n  this.enc = 'der';\n  this.name = entity.name;\n  this.entity = entity;\n\n  // Construct base tree\n  this.tree = new DERNode();\n  this.tree._init(entity.body);\n};\nmodule.exports = DERDecoder;\n\nDERDecoder.prototype.decode = function decode(data, options) {\n  if (!(data instanceof base.DecoderBuffer))\n    data = new base.DecoderBuffer(data, options);\n\n  return this.tree._decode(data, options);\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n  base.Node.call(this, 'der', parent);\n}\ninherits(DERNode, base.Node);\n\nDERNode.prototype._peekTag = function peekTag(buffer, tag, any) {\n  if (buffer.isEmpty())\n    return false;\n\n  var state = buffer.save();\n  var decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n  if (buffer.isError(decodedTag))\n    return decodedTag;\n\n  buffer.restore(state);\n\n  return decodedTag.tag === tag || decodedTag.tagStr === tag ||\n    (decodedTag.tagStr + 'of') === tag || any;\n};\n\nDERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {\n  var decodedTag = derDecodeTag(buffer,\n                                'Failed to decode tag of \"' + tag + '\"');\n  if (buffer.isError(decodedTag))\n    return decodedTag;\n\n  var len = derDecodeLen(buffer,\n                         decodedTag.primitive,\n                         'Failed to get length of \"' + tag + '\"');\n\n  // Failure\n  if (buffer.isError(len))\n    return len;\n\n  if (!any &&\n      decodedTag.tag !== tag &&\n      decodedTag.tagStr !== tag &&\n      decodedTag.tagStr + 'of' !== tag) {\n    return buffer.error('Failed to match tag: \"' + tag + '\"');\n  }\n\n  if (decodedTag.primitive || len !== null)\n    return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n\n  // Indefinite length... find END tag\n  var state = buffer.save();\n  var res = this._skipUntilEnd(\n      buffer,\n      'Failed to skip indefinite length body: \"' + this.tag + '\"');\n  if (buffer.isError(res))\n    return res;\n\n  len = buffer.offset - state.offset;\n  buffer.restore(state);\n  return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n};\n\nDERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) {\n  while (true) {\n    var tag = derDecodeTag(buffer, fail);\n    if (buffer.isError(tag))\n      return tag;\n    var len = derDecodeLen(buffer, tag.primitive, fail);\n    if (buffer.isError(len))\n      return len;\n\n    var res;\n    if (tag.primitive || len !== null)\n      res = buffer.skip(len)\n    else\n      res = this._skipUntilEnd(buffer, fail);\n\n    // Failure\n    if (buffer.isError(res))\n      return res;\n\n    if (tag.tagStr === 'end')\n      break;\n  }\n};\n\nDERNode.prototype._decodeList = function decodeList(buffer, tag, decoder,\n                                                    options) {\n  var result = [];\n  while (!buffer.isEmpty()) {\n    var possibleEnd = this._peekTag(buffer, 'end');\n    if (buffer.isError(possibleEnd))\n      return possibleEnd;\n\n    var res = decoder.decode(buffer, 'der', options);\n    if (buffer.isError(res) && possibleEnd)\n      break;\n    result.push(res);\n  }\n  return result;\n};\n\nDERNode.prototype._decodeStr = function decodeStr(buffer, tag) {\n  if (tag === 'bitstr') {\n    var unused = buffer.readUInt8();\n    if (buffer.isError(unused))\n      return unused;\n    return { unused: unused, data: buffer.raw() };\n  } else if (tag === 'bmpstr') {\n    var raw = buffer.raw();\n    if (raw.length % 2 === 1)\n      return buffer.error('Decoding of string type: bmpstr length mismatch');\n\n    var str = '';\n    for (var i = 0; i < raw.length / 2; i++) {\n      str += String.fromCharCode(raw.readUInt16BE(i * 2));\n    }\n    return str;\n  } else if (tag === 'numstr') {\n    var numstr = buffer.raw().toString('ascii');\n    if (!this._isNumstr(numstr)) {\n      return buffer.error('Decoding of string type: ' +\n                          'numstr unsupported characters');\n    }\n    return numstr;\n  } else if (tag === 'octstr') {\n    return buffer.raw();\n  } else if (tag === 'objDesc') {\n    return buffer.raw();\n  } else if (tag === 'printstr') {\n    var printstr = buffer.raw().toString('ascii');\n    if (!this._isPrintstr(printstr)) {\n      return buffer.error('Decoding of string type: ' +\n                          'printstr unsupported characters');\n    }\n    return printstr;\n  } else if (/str$/.test(tag)) {\n    return buffer.raw().toString();\n  } else {\n    return buffer.error('Decoding of string type: ' + tag + ' unsupported');\n  }\n};\n\nDERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) {\n  var result;\n  var identifiers = [];\n  var ident = 0;\n  while (!buffer.isEmpty()) {\n    var subident = buffer.readUInt8();\n    ident <<= 7;\n    ident |= subident & 0x7f;\n    if ((subident & 0x80) === 0) {\n      identifiers.push(ident);\n      ident = 0;\n    }\n  }\n  if (subident & 0x80)\n    identifiers.push(ident);\n\n  var first = (identifiers[0] / 40) | 0;\n  var second = identifiers[0] % 40;\n\n  if (relative)\n    result = identifiers;\n  else\n    result = [first, second].concat(identifiers.slice(1));\n\n  if (values) {\n    var tmp = values[result.join(' ')];\n    if (tmp === undefined)\n      tmp = values[result.join('.')];\n    if (tmp !== undefined)\n      result = tmp;\n  }\n\n  return result;\n};\n\nDERNode.prototype._decodeTime = function decodeTime(buffer, tag) {\n  var str = buffer.raw().toString();\n  if (tag === 'gentime') {\n    var year = str.slice(0, 4) | 0;\n    var mon = str.slice(4, 6) | 0;\n    var day = str.slice(6, 8) | 0;\n    var hour = str.slice(8, 10) | 0;\n    var min = str.slice(10, 12) | 0;\n    var sec = str.slice(12, 14) | 0;\n  } else if (tag === 'utctime') {\n    var year = str.slice(0, 2) | 0;\n    var mon = str.slice(2, 4) | 0;\n    var day = str.slice(4, 6) | 0;\n    var hour = str.slice(6, 8) | 0;\n    var min = str.slice(8, 10) | 0;\n    var sec = str.slice(10, 12) | 0;\n    if (year < 70)\n      year = 2000 + year;\n    else\n      year = 1900 + year;\n  } else {\n    return buffer.error('Decoding ' + tag + ' time is not supported yet');\n  }\n\n  return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n};\n\nDERNode.prototype._decodeNull = function decodeNull(buffer) {\n  return null;\n};\n\nDERNode.prototype._decodeBool = function decodeBool(buffer) {\n  var res = buffer.readUInt8();\n  if (buffer.isError(res))\n    return res;\n  else\n    return res !== 0;\n};\n\nDERNode.prototype._decodeInt = function decodeInt(buffer, values) {\n  // Bigint, return as it is (assume big endian)\n  var raw = buffer.raw();\n  var res = new bignum(raw);\n\n  if (values)\n    res = values[res.toString(10)] || res;\n\n  return res;\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n  if (typeof entity === 'function')\n    entity = entity(obj);\n  return entity._getDecoder('der').tree;\n};\n\n// Utility methods\n\nfunction derDecodeTag(buf, fail) {\n  var tag = buf.readUInt8(fail);\n  if (buf.isError(tag))\n    return tag;\n\n  var cls = der.tagClass[tag >> 6];\n  var primitive = (tag & 0x20) === 0;\n\n  // Multi-octet tag - load\n  if ((tag & 0x1f) === 0x1f) {\n    var oct = tag;\n    tag = 0;\n    while ((oct & 0x80) === 0x80) {\n      oct = buf.readUInt8(fail);\n      if (buf.isError(oct))\n        return oct;\n\n      tag <<= 7;\n      tag |= oct & 0x7f;\n    }\n  } else {\n    tag &= 0x1f;\n  }\n  var tagStr = der.tag[tag];\n\n  return {\n    cls: cls,\n    primitive: primitive,\n    tag: tag,\n    tagStr: tagStr\n  };\n}\n\nfunction derDecodeLen(buf, primitive, fail) {\n  var len = buf.readUInt8(fail);\n  if (buf.isError(len))\n    return len;\n\n  // Indefinite form\n  if (!primitive && len === 0x80)\n    return null;\n\n  // Definite form\n  if ((len & 0x80) === 0) {\n    // Short form\n    return len;\n  }\n\n  // Long form\n  var num = len & 0x7f;\n  if (num > 4)\n    return buf.error('length octect is too long');\n\n  len = 0;\n  for (var i = 0; i < num; i++) {\n    len <<= 8;\n    var j = buf.readUInt8(fail);\n    if (buf.isError(j))\n      return j;\n    len |= j;\n  }\n\n  return len;\n}\n","var inherits = require('inherits');\nvar Buffer = require('buffer').Buffer;\n\nvar DERDecoder = require('./der');\n\nfunction PEMDecoder(entity) {\n  DERDecoder.call(this, entity);\n  this.enc = 'pem';\n};\ninherits(PEMDecoder, DERDecoder);\nmodule.exports = PEMDecoder;\n\nPEMDecoder.prototype.decode = function decode(data, options) {\n  var lines = data.toString().split(/[\\r\\n]+/g);\n\n  var label = options.label.toUpperCase();\n\n  var re = /^-----(BEGIN|END) ([^-]+)-----$/;\n  var start = -1;\n  var end = -1;\n  for (var i = 0; i < lines.length; i++) {\n    var match = lines[i].match(re);\n    if (match === null)\n      continue;\n\n    if (match[2] !== label)\n      continue;\n\n    if (start === -1) {\n      if (match[1] !== 'BEGIN')\n        break;\n      start = i;\n    } else {\n      if (match[1] !== 'END')\n        break;\n      end = i;\n      break;\n    }\n  }\n  if (start === -1 || end === -1)\n    throw new Error('PEM section not found for: ' + label);\n\n  var base64 = lines.slice(start + 1, end).join('');\n  // Remove excessive symbols\n  base64.replace(/[^a-z0-9\\+\\/=]+/gi, '');\n\n  var input = new Buffer(base64, 'base64');\n  return DERDecoder.prototype.decode.call(this, input, options);\n};\n","var decoders = exports;\n\ndecoders.der = require('./der');\ndecoders.pem = require('./pem');\n","var inherits = require('inherits');\nvar Buffer = require('buffer').Buffer;\n\nvar asn1 = require('../../asn1');\nvar base = asn1.base;\n\n// Import DER constants\nvar der = asn1.constants.der;\n\nfunction DEREncoder(entity) {\n  this.enc = 'der';\n  this.name = entity.name;\n  this.entity = entity;\n\n  // Construct base tree\n  this.tree = new DERNode();\n  this.tree._init(entity.body);\n};\nmodule.exports = DEREncoder;\n\nDEREncoder.prototype.encode = function encode(data, reporter) {\n  return this.tree._encode(data, reporter).join();\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n  base.Node.call(this, 'der', parent);\n}\ninherits(DERNode, base.Node);\n\nDERNode.prototype._encodeComposite = function encodeComposite(tag,\n                                                              primitive,\n                                                              cls,\n                                                              content) {\n  var encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n\n  // Short form\n  if (content.length < 0x80) {\n    var header = new Buffer(2);\n    header[0] = encodedTag;\n    header[1] = content.length;\n    return this._createEncoderBuffer([ header, content ]);\n  }\n\n  // Long form\n  // Count octets required to store length\n  var lenOctets = 1;\n  for (var i = content.length; i >= 0x100; i >>= 8)\n    lenOctets++;\n\n  var header = new Buffer(1 + 1 + lenOctets);\n  header[0] = encodedTag;\n  header[1] = 0x80 | lenOctets;\n\n  for (var i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8)\n    header[i] = j & 0xff;\n\n  return this._createEncoderBuffer([ header, content ]);\n};\n\nDERNode.prototype._encodeStr = function encodeStr(str, tag) {\n  if (tag === 'bitstr') {\n    return this._createEncoderBuffer([ str.unused | 0, str.data ]);\n  } else if (tag === 'bmpstr') {\n    var buf = new Buffer(str.length * 2);\n    for (var i = 0; i < str.length; i++) {\n      buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n    }\n    return this._createEncoderBuffer(buf);\n  } else if (tag === 'numstr') {\n    if (!this._isNumstr(str)) {\n      return this.reporter.error('Encoding of string type: numstr supports ' +\n                                 'only digits and space');\n    }\n    return this._createEncoderBuffer(str);\n  } else if (tag === 'printstr') {\n    if (!this._isPrintstr(str)) {\n      return this.reporter.error('Encoding of string type: printstr supports ' +\n                                 'only latin upper and lower case letters, ' +\n                                 'digits, space, apostrophe, left and rigth ' +\n                                 'parenthesis, plus sign, comma, hyphen, ' +\n                                 'dot, slash, colon, equal sign, ' +\n                                 'question mark');\n    }\n    return this._createEncoderBuffer(str);\n  } else if (/str$/.test(tag)) {\n    return this._createEncoderBuffer(str);\n  } else if (tag === 'objDesc') {\n    return this._createEncoderBuffer(str);\n  } else {\n    return this.reporter.error('Encoding of string type: ' + tag +\n                               ' unsupported');\n  }\n};\n\nDERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) {\n  if (typeof id === 'string') {\n    if (!values)\n      return this.reporter.error('string objid given, but no values map found');\n    if (!values.hasOwnProperty(id))\n      return this.reporter.error('objid not found in values map');\n    id = values[id].split(/[\\s\\.]+/g);\n    for (var i = 0; i < id.length; i++)\n      id[i] |= 0;\n  } else if (Array.isArray(id)) {\n    id = id.slice();\n    for (var i = 0; i < id.length; i++)\n      id[i] |= 0;\n  }\n\n  if (!Array.isArray(id)) {\n    return this.reporter.error('objid() should be either array or string, ' +\n                               'got: ' + JSON.stringify(id));\n  }\n\n  if (!relative) {\n    if (id[1] >= 40)\n      return this.reporter.error('Second objid identifier OOB');\n    id.splice(0, 2, id[0] * 40 + id[1]);\n  }\n\n  // Count number of octets\n  var size = 0;\n  for (var i = 0; i < id.length; i++) {\n    var ident = id[i];\n    for (size++; ident >= 0x80; ident >>= 7)\n      size++;\n  }\n\n  var objid = new Buffer(size);\n  var offset = objid.length - 1;\n  for (var i = id.length - 1; i >= 0; i--) {\n    var ident = id[i];\n    objid[offset--] = ident & 0x7f;\n    while ((ident >>= 7) > 0)\n      objid[offset--] = 0x80 | (ident & 0x7f);\n  }\n\n  return this._createEncoderBuffer(objid);\n};\n\nfunction two(num) {\n  if (num < 10)\n    return '0' + num;\n  else\n    return num;\n}\n\nDERNode.prototype._encodeTime = function encodeTime(time, tag) {\n  var str;\n  var date = new Date(time);\n\n  if (tag === 'gentime') {\n    str = [\n      two(date.getFullYear()),\n      two(date.getUTCMonth() + 1),\n      two(date.getUTCDate()),\n      two(date.getUTCHours()),\n      two(date.getUTCMinutes()),\n      two(date.getUTCSeconds()),\n      'Z'\n    ].join('');\n  } else if (tag === 'utctime') {\n    str = [\n      two(date.getFullYear() % 100),\n      two(date.getUTCMonth() + 1),\n      two(date.getUTCDate()),\n      two(date.getUTCHours()),\n      two(date.getUTCMinutes()),\n      two(date.getUTCSeconds()),\n      'Z'\n    ].join('');\n  } else {\n    this.reporter.error('Encoding ' + tag + ' time is not supported yet');\n  }\n\n  return this._encodeStr(str, 'octstr');\n};\n\nDERNode.prototype._encodeNull = function encodeNull() {\n  return this._createEncoderBuffer('');\n};\n\nDERNode.prototype._encodeInt = function encodeInt(num, values) {\n  if (typeof num === 'string') {\n    if (!values)\n      return this.reporter.error('String int or enum given, but no values map');\n    if (!values.hasOwnProperty(num)) {\n      return this.reporter.error('Values map doesn\\'t contain: ' +\n                                 JSON.stringify(num));\n    }\n    num = values[num];\n  }\n\n  // Bignum, assume big endian\n  if (typeof num !== 'number' && !Buffer.isBuffer(num)) {\n    var numArray = num.toArray();\n    if (!num.sign && numArray[0] & 0x80) {\n      numArray.unshift(0);\n    }\n    num = new Buffer(numArray);\n  }\n\n  if (Buffer.isBuffer(num)) {\n    var size = num.length;\n    if (num.length === 0)\n      size++;\n\n    var out = new Buffer(size);\n    num.copy(out);\n    if (num.length === 0)\n      out[0] = 0\n    return this._createEncoderBuffer(out);\n  }\n\n  if (num < 0x80)\n    return this._createEncoderBuffer(num);\n\n  if (num < 0x100)\n    return this._createEncoderBuffer([0, num]);\n\n  var size = 1;\n  for (var i = num; i >= 0x100; i >>= 8)\n    size++;\n\n  var out = new Array(size);\n  for (var i = out.length - 1; i >= 0; i--) {\n    out[i] = num & 0xff;\n    num >>= 8;\n  }\n  if(out[0] & 0x80) {\n    out.unshift(0);\n  }\n\n  return this._createEncoderBuffer(new Buffer(out));\n};\n\nDERNode.prototype._encodeBool = function encodeBool(value) {\n  return this._createEncoderBuffer(value ? 0xff : 0);\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n  if (typeof entity === 'function')\n    entity = entity(obj);\n  return entity._getEncoder('der').tree;\n};\n\nDERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {\n  var state = this._baseState;\n  var i;\n  if (state['default'] === null)\n    return false;\n\n  var data = dataBuffer.join();\n  if (state.defaultBuffer === undefined)\n    state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();\n\n  if (data.length !== state.defaultBuffer.length)\n    return false;\n\n  for (i=0; i < data.length; i++)\n    if (data[i] !== state.defaultBuffer[i])\n      return false;\n\n  return true;\n};\n\n// Utility methods\n\nfunction encodeTag(tag, primitive, cls, reporter) {\n  var res;\n\n  if (tag === 'seqof')\n    tag = 'seq';\n  else if (tag === 'setof')\n    tag = 'set';\n\n  if (der.tagByName.hasOwnProperty(tag))\n    res = der.tagByName[tag];\n  else if (typeof tag === 'number' && (tag | 0) === tag)\n    res = tag;\n  else\n    return reporter.error('Unknown tag: ' + tag);\n\n  if (res >= 0x1f)\n    return reporter.error('Multi-octet tag encoding unsupported');\n\n  if (!primitive)\n    res |= 0x20;\n\n  res |= (der.tagClassByName[cls || 'universal'] << 6);\n\n  return res;\n}\n","var inherits = require('inherits');\n\nvar DEREncoder = require('./der');\n\nfunction PEMEncoder(entity) {\n  DEREncoder.call(this, entity);\n  this.enc = 'pem';\n};\ninherits(PEMEncoder, DEREncoder);\nmodule.exports = PEMEncoder;\n\nPEMEncoder.prototype.encode = function encode(data, options) {\n  var buf = DEREncoder.prototype.encode.call(this, data);\n\n  var p = buf.toString('base64');\n  var out = [ '-----BEGIN ' + options.label + '-----' ];\n  for (var i = 0; i < p.length; i += 64)\n    out.push(p.slice(i, i + 64));\n  out.push('-----END ' + options.label + '-----');\n  return out.join('\\n');\n};\n","var encoders = exports;\n\nencoders.der = require('./der');\nencoders.pem = require('./pem');\n","var asn1 = exports;\n\nasn1.bignum = require('bn.js');\n\nasn1.define = require('./asn1/api').define;\nasn1.base = require('./asn1/base');\nasn1.constants = require('./asn1/constants');\nasn1.decoders = require('./asn1/decoders');\nasn1.encoders = require('./asn1/encoders');\n","// from https://github.com/Rantanen/node-dtls/blob/25a7dc861bda38cfeac93a723500eea4f0ac2e86/Certificate.js\n// thanks to @Rantanen\n\n'use strict';\n\nvar asn = require('asn1.js');\n\nvar Time = asn.define('Time', function () {\n\tthis.choice({\n\t\tutcTime: this.utctime(),\n\t\tgeneralTime: this.gentime()\n\t});\n});\n\nvar AttributeTypeValue = asn.define('AttributeTypeValue', function () {\n\tthis.seq().obj(\n\t\tthis.key('type').objid(),\n\t\tthis.key('value').any()\n\t);\n});\n\nvar AlgorithmIdentifier = asn.define('AlgorithmIdentifier', function () {\n\tthis.seq().obj(\n\t\tthis.key('algorithm').objid(),\n\t\tthis.key('parameters').optional(),\n\t\tthis.key('curve').objid().optional()\n\t);\n});\n\nvar SubjectPublicKeyInfo = asn.define('SubjectPublicKeyInfo', function () {\n\tthis.seq().obj(\n\t\tthis.key('algorithm').use(AlgorithmIdentifier),\n\t\tthis.key('subjectPublicKey').bitstr()\n\t);\n});\n\nvar RelativeDistinguishedName = asn.define('RelativeDistinguishedName', function () {\n\tthis.setof(AttributeTypeValue);\n});\n\nvar RDNSequence = asn.define('RDNSequence', function () {\n\tthis.seqof(RelativeDistinguishedName);\n});\n\nvar Name = asn.define('Name', function () {\n\tthis.choice({\n\t\trdnSequence: this.use(RDNSequence)\n\t});\n});\n\nvar Validity = asn.define('Validity', function () {\n\tthis.seq().obj(\n\t\tthis.key('notBefore').use(Time),\n\t\tthis.key('notAfter').use(Time)\n\t);\n});\n\nvar Extension = asn.define('Extension', function () {\n\tthis.seq().obj(\n\t\tthis.key('extnID').objid(),\n\t\tthis.key('critical').bool().def(false),\n\t\tthis.key('extnValue').octstr()\n\t);\n});\n\nvar TBSCertificate = asn.define('TBSCertificate', function () {\n\tthis.seq().obj(\n\t\tthis.key('version').explicit(0)['int']().optional(),\n\t\tthis.key('serialNumber')['int'](),\n\t\tthis.key('signature').use(AlgorithmIdentifier),\n\t\tthis.key('issuer').use(Name),\n\t\tthis.key('validity').use(Validity),\n\t\tthis.key('subject').use(Name),\n\t\tthis.key('subjectPublicKeyInfo').use(SubjectPublicKeyInfo),\n\t\tthis.key('issuerUniqueID').implicit(1).bitstr().optional(),\n\t\tthis.key('subjectUniqueID').implicit(2).bitstr().optional(),\n\t\tthis.key('extensions').explicit(3).seqof(Extension).optional()\n\t);\n});\n\nvar X509Certificate = asn.define('X509Certificate', function () {\n\tthis.seq().obj(\n\t\tthis.key('tbsCertificate').use(TBSCertificate),\n\t\tthis.key('signatureAlgorithm').use(AlgorithmIdentifier),\n\t\tthis.key('signatureValue').bitstr()\n\t);\n});\n\nmodule.exports = X509Certificate;\n","// from https://github.com/indutny/self-signed/blob/gh-pages/lib/asn1.js\n// Fedor, you are amazing.\n\n'use strict';\n\nvar asn1 = require('asn1.js');\n\nexports.certificate = require('./certificate');\n\nvar RSAPrivateKey = asn1.define('RSAPrivateKey', function () {\n\tthis.seq().obj(\n\t\tthis.key('version')['int'](),\n\t\tthis.key('modulus')['int'](),\n\t\tthis.key('publicExponent')['int'](),\n\t\tthis.key('privateExponent')['int'](),\n\t\tthis.key('prime1')['int'](),\n\t\tthis.key('prime2')['int'](),\n\t\tthis.key('exponent1')['int'](),\n\t\tthis.key('exponent2')['int'](),\n\t\tthis.key('coefficient')['int']()\n\t);\n});\nexports.RSAPrivateKey = RSAPrivateKey;\n\nvar RSAPublicKey = asn1.define('RSAPublicKey', function () {\n\tthis.seq().obj(\n\t\tthis.key('modulus')['int'](),\n\t\tthis.key('publicExponent')['int']()\n\t);\n});\nexports.RSAPublicKey = RSAPublicKey;\n\nvar AlgorithmIdentifier = asn1.define('AlgorithmIdentifier', function () {\n\tthis.seq().obj(\n\t\tthis.key('algorithm').objid(),\n\t\tthis.key('none').null_().optional(),\n\t\tthis.key('curve').objid().optional(),\n\t\tthis.key('params').seq().obj(\n\t\t\tthis.key('p')['int'](),\n\t\t\tthis.key('q')['int'](),\n\t\t\tthis.key('g')['int']()\n\t\t).optional()\n\t);\n});\n\nvar PublicKey = asn1.define('SubjectPublicKeyInfo', function () {\n\tthis.seq().obj(\n\t\tthis.key('algorithm').use(AlgorithmIdentifier),\n\t\tthis.key('subjectPublicKey').bitstr()\n\t);\n});\nexports.PublicKey = PublicKey;\n\nvar PrivateKeyInfo = asn1.define('PrivateKeyInfo', function () {\n\tthis.seq().obj(\n\t\tthis.key('version')['int'](),\n\t\tthis.key('algorithm').use(AlgorithmIdentifier),\n\t\tthis.key('subjectPrivateKey').octstr()\n\t);\n});\nexports.PrivateKey = PrivateKeyInfo;\nvar EncryptedPrivateKeyInfo = asn1.define('EncryptedPrivateKeyInfo', function () {\n\tthis.seq().obj(\n\t\tthis.key('algorithm').seq().obj(\n\t\t\tthis.key('id').objid(),\n\t\t\tthis.key('decrypt').seq().obj(\n\t\t\t\tthis.key('kde').seq().obj(\n\t\t\t\t\tthis.key('id').objid(),\n\t\t\t\t\tthis.key('kdeparams').seq().obj(\n\t\t\t\t\t\tthis.key('salt').octstr(),\n\t\t\t\t\t\tthis.key('iters')['int']()\n\t\t\t\t\t)\n\t\t\t\t),\n\t\t\t\tthis.key('cipher').seq().obj(\n\t\t\t\t\tthis.key('algo').objid(),\n\t\t\t\t\tthis.key('iv').octstr()\n\t\t\t\t)\n\t\t\t)\n\t\t),\n\t\tthis.key('subjectPrivateKey').octstr()\n\t);\n});\n\nexports.EncryptedPrivateKey = EncryptedPrivateKeyInfo;\n\nvar DSAPrivateKey = asn1.define('DSAPrivateKey', function () {\n\tthis.seq().obj(\n\t\tthis.key('version')['int'](),\n\t\tthis.key('p')['int'](),\n\t\tthis.key('q')['int'](),\n\t\tthis.key('g')['int'](),\n\t\tthis.key('pub_key')['int'](),\n\t\tthis.key('priv_key')['int']()\n\t);\n});\nexports.DSAPrivateKey = DSAPrivateKey;\n\nexports.DSAparam = asn1.define('DSAparam', function () {\n\tthis['int']();\n});\n\nvar ECParameters = asn1.define('ECParameters', function () {\n\tthis.choice({\n\t\tnamedCurve: this.objid()\n\t});\n});\n\nvar ECPrivateKey = asn1.define('ECPrivateKey', function () {\n\tthis.seq().obj(\n\t\tthis.key('version')['int'](),\n\t\tthis.key('privateKey').octstr(),\n\t\tthis.key('parameters').optional().explicit(0).use(ECParameters),\n\t\tthis.key('publicKey').optional().explicit(1).bitstr()\n\t);\n});\nexports.ECPrivateKey = ECPrivateKey;\n\nexports.signature = asn1.define('signature', function () {\n\tthis.seq().obj(\n\t\tthis.key('r')['int'](),\n\t\tthis.key('s')['int']()\n\t);\n});\n","'use strict';\n\n// adapted from https://github.com/apatil/pemstrip\nvar findProc = /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m;\nvar startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m;\nvar fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m;\nvar evp = require('evp_bytestokey');\nvar ciphers = require('browserify-aes');\nvar Buffer = require('safe-buffer').Buffer;\nmodule.exports = function (okey, password) {\n\tvar key = okey.toString();\n\tvar match = key.match(findProc);\n\tvar decrypted;\n\tif (!match) {\n\t\tvar match2 = key.match(fullRegex);\n\t\tdecrypted = Buffer.from(match2[2].replace(/[\\r\\n]/g, ''), 'base64');\n\t} else {\n\t\tvar suite = 'aes' + match[1];\n\t\tvar iv = Buffer.from(match[2], 'hex');\n\t\tvar cipherText = Buffer.from(match[3].replace(/[\\r\\n]/g, ''), 'base64');\n\t\tvar cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key;\n\t\tvar out = [];\n\t\tvar cipher = ciphers.createDecipheriv(suite, cipherKey, iv);\n\t\tout.push(cipher.update(cipherText));\n\t\tout.push(cipher['final']());\n\t\tdecrypted = Buffer.concat(out);\n\t}\n\tvar tag = key.match(startRegex)[1];\n\treturn {\n\t\ttag: tag,\n\t\tdata: decrypted\n\t};\n};\n","'use strict';\n\nvar asn1 = require('./asn1');\nvar aesid = require('./aesid.json');\nvar fixProc = require('./fixProc');\nvar ciphers = require('browserify-aes');\nvar pbkdf2Sync = require('pbkdf2').pbkdf2Sync;\nvar Buffer = require('safe-buffer').Buffer;\n\nfunction decrypt(data, password) {\n\tvar salt = data.algorithm.decrypt.kde.kdeparams.salt;\n\tvar iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10);\n\tvar algo = aesid[data.algorithm.decrypt.cipher.algo.join('.')];\n\tvar iv = data.algorithm.decrypt.cipher.iv;\n\tvar cipherText = data.subjectPrivateKey;\n\tvar keylen = parseInt(algo.split('-')[1], 10) / 8;\n\tvar key = pbkdf2Sync(password, salt, iters, keylen, 'sha1');\n\tvar cipher = ciphers.createDecipheriv(algo, key, iv);\n\tvar out = [];\n\tout.push(cipher.update(cipherText));\n\tout.push(cipher['final']());\n\treturn Buffer.concat(out);\n}\n\nfunction parseKeys(buffer) {\n\tvar password;\n\tif (typeof buffer === 'object' && !Buffer.isBuffer(buffer)) {\n\t\tpassword = buffer.passphrase;\n\t\tbuffer = buffer.key;\n\t}\n\tif (typeof buffer === 'string') {\n\t\tbuffer = Buffer.from(buffer);\n\t}\n\n\tvar stripped = fixProc(buffer, password);\n\n\tvar type = stripped.tag;\n\tvar data = stripped.data;\n\tvar subtype, ndata;\n\tswitch (type) {\n\t\tcase 'CERTIFICATE':\n\t\t\tndata = asn1.certificate.decode(data, 'der').tbsCertificate.subjectPublicKeyInfo;\n\t\t\t// falls through\n\t\tcase 'PUBLIC KEY':\n\t\t\tif (!ndata) {\n\t\t\t\tndata = asn1.PublicKey.decode(data, 'der');\n\t\t\t}\n\t\t\tsubtype = ndata.algorithm.algorithm.join('.');\n\t\t\tswitch (subtype) {\n\t\t\t\tcase '1.2.840.113549.1.1.1':\n\t\t\t\t\treturn asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, 'der');\n\t\t\t\tcase '1.2.840.10045.2.1':\n\t\t\t\t\tndata.subjectPrivateKey = ndata.subjectPublicKey;\n\t\t\t\t\treturn {\n\t\t\t\t\t\ttype: 'ec',\n\t\t\t\t\t\tdata: ndata\n\t\t\t\t\t};\n\t\t\t\tcase '1.2.840.10040.4.1':\n\t\t\t\t\tndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, 'der');\n\t\t\t\t\treturn {\n\t\t\t\t\t\ttype: 'dsa',\n\t\t\t\t\t\tdata: ndata.algorithm.params\n\t\t\t\t\t};\n\t\t\t\tdefault: throw new Error('unknown key id ' + subtype);\n\t\t\t}\n\t\t\t// throw new Error('unknown key type ' + type)\n\t\tcase 'ENCRYPTED PRIVATE KEY':\n\t\t\tdata = asn1.EncryptedPrivateKey.decode(data, 'der');\n\t\t\tdata = decrypt(data, password);\n\t\t\t// falls through\n\t\tcase 'PRIVATE KEY':\n\t\t\tndata = asn1.PrivateKey.decode(data, 'der');\n\t\t\tsubtype = ndata.algorithm.algorithm.join('.');\n\t\t\tswitch (subtype) {\n\t\t\t\tcase '1.2.840.113549.1.1.1':\n\t\t\t\t\treturn asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, 'der');\n\t\t\t\tcase '1.2.840.10045.2.1':\n\t\t\t\t\treturn {\n\t\t\t\t\t\tcurve: ndata.algorithm.curve,\n\t\t\t\t\t\tprivateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, 'der').privateKey\n\t\t\t\t\t};\n\t\t\t\tcase '1.2.840.10040.4.1':\n\t\t\t\t\tndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, 'der');\n\t\t\t\t\treturn {\n\t\t\t\t\t\ttype: 'dsa',\n\t\t\t\t\t\tparams: ndata.algorithm.params\n\t\t\t\t\t};\n\t\t\t\tdefault: throw new Error('unknown key id ' + subtype);\n\t\t\t}\n\t\t\t// throw new Error('unknown key type ' + type)\n\t\tcase 'RSA PUBLIC KEY':\n\t\t\treturn asn1.RSAPublicKey.decode(data, 'der');\n\t\tcase 'RSA PRIVATE KEY':\n\t\t\treturn asn1.RSAPrivateKey.decode(data, 'der');\n\t\tcase 'DSA PRIVATE KEY':\n\t\t\treturn {\n\t\t\t\ttype: 'dsa',\n\t\t\t\tparams: asn1.DSAPrivateKey.decode(data, 'der')\n\t\t\t};\n\t\tcase 'EC PRIVATE KEY':\n\t\t\tdata = asn1.ECPrivateKey.decode(data, 'der');\n\t\t\treturn {\n\t\t\t\tcurve: data.parameters.value,\n\t\t\t\tprivateKey: data.privateKey\n\t\t\t};\n\t\tdefault: throw new Error('unknown key type ' + type);\n\t}\n}\nparseKeys.signature = asn1.signature;\n\nmodule.exports = parseKeys;\n","'use strict';\n\n// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('safe-buffer').Buffer;\nvar createHmac = require('create-hmac');\nvar crt = require('browserify-rsa');\nvar EC = require('elliptic').ec;\nvar BN = require('bn.js');\nvar parseKeys = require('parse-asn1');\nvar curves = require('./curves.json');\n\nvar RSA_PKCS1_PADDING = 1;\n\nfunction sign(hash, key, hashType, signType, tag) {\n  var priv = parseKeys(key);\n  if (priv.curve) {\n    // rsa keys can be interpreted as ecdsa ones in openssl\n    if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') { throw new Error('wrong private key type'); }\n    return ecSign(hash, priv);\n  } else if (priv.type === 'dsa') {\n    if (signType !== 'dsa') { throw new Error('wrong private key type'); }\n    return dsaSign(hash, priv, hashType);\n  }\n  if (signType !== 'rsa' && signType !== 'ecdsa/rsa') { throw new Error('wrong private key type'); }\n  if (key.padding !== undefined && key.padding !== RSA_PKCS1_PADDING) { throw new Error('illegal or unsupported padding mode'); }\n\n  hash = Buffer.concat([tag, hash]);\n  var len = priv.modulus.byteLength();\n  var pad = [0, 1];\n  while (hash.length + pad.length + 1 < len) { pad.push(0xff); }\n  pad.push(0x00);\n  var i = -1;\n  while (++i < hash.length) { pad.push(hash[i]); }\n\n  var out = crt(pad, priv);\n  return out;\n}\n\nfunction ecSign(hash, priv) {\n  var curveId = curves[priv.curve.join('.')];\n  if (!curveId) { throw new Error('unknown curve ' + priv.curve.join('.')); }\n\n  var curve = new EC(curveId);\n  var key = curve.keyFromPrivate(priv.privateKey);\n  var out = key.sign(hash);\n\n  return Buffer.from(out.toDER());\n}\n\nfunction dsaSign(hash, priv, algo) {\n  var x = priv.params.priv_key;\n  var p = priv.params.p;\n  var q = priv.params.q;\n  var g = priv.params.g;\n  var r = new BN(0);\n  var k;\n  var H = bits2int(hash, q).mod(q);\n  var s = false;\n  var kv = getKey(x, q, hash, algo);\n  while (s === false) {\n    k = makeKey(q, kv, algo);\n    r = makeR(g, k, p, q);\n    s = k.invm(q).imul(H.add(x.mul(r))).mod(q);\n    if (s.cmpn(0) === 0) {\n      s = false;\n      r = new BN(0);\n    }\n  }\n  return toDER(r, s);\n}\n\nfunction toDER(r, s) {\n  r = r.toArray();\n  s = s.toArray();\n\n  // Pad values\n  if (r[0] & 0x80) { r = [0].concat(r); }\n  if (s[0] & 0x80) { s = [0].concat(s); }\n\n  var total = r.length + s.length + 4;\n  var res = [\n    0x30, total, 0x02, r.length\n  ];\n  res = res.concat(r, [0x02, s.length], s);\n  return Buffer.from(res);\n}\n\nfunction getKey(x, q, hash, algo) {\n  x = Buffer.from(x.toArray());\n  if (x.length < q.byteLength()) {\n    var zeros = Buffer.alloc(q.byteLength() - x.length);\n    x = Buffer.concat([zeros, x]);\n  }\n  var hlen = hash.length;\n  var hbits = bits2octets(hash, q);\n  var v = Buffer.alloc(hlen);\n  v.fill(1);\n  var k = Buffer.alloc(hlen);\n  k = createHmac(algo, k).update(v).update(Buffer.from([0])).update(x).update(hbits).digest();\n  v = createHmac(algo, k).update(v).digest();\n  k = createHmac(algo, k).update(v).update(Buffer.from([1])).update(x).update(hbits).digest();\n  v = createHmac(algo, k).update(v).digest();\n  return { k: k, v: v };\n}\n\nfunction bits2int(obits, q) {\n  var bits = new BN(obits);\n  var shift = (obits.length << 3) - q.bitLength();\n  if (shift > 0) { bits.ishrn(shift); }\n  return bits;\n}\n\nfunction bits2octets(bits, q) {\n  bits = bits2int(bits, q);\n  bits = bits.mod(q);\n  var out = Buffer.from(bits.toArray());\n  if (out.length < q.byteLength()) {\n    var zeros = Buffer.alloc(q.byteLength() - out.length);\n    out = Buffer.concat([zeros, out]);\n  }\n  return out;\n}\n\nfunction makeKey(q, kv, algo) {\n  var t;\n  var k;\n\n  do {\n    t = Buffer.alloc(0);\n\n    while (t.length * 8 < q.bitLength()) {\n      kv.v = createHmac(algo, kv.k).update(kv.v).digest();\n      t = Buffer.concat([t, kv.v]);\n    }\n\n    k = bits2int(t, q);\n    kv.k = createHmac(algo, kv.k).update(kv.v).update(Buffer.from([0])).digest();\n    kv.v = createHmac(algo, kv.k).update(kv.v).digest();\n  } while (k.cmp(q) !== -1);\n\n  return k;\n}\n\nfunction makeR(g, k, p, q) {\n  return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q);\n}\n\nmodule.exports = sign;\nmodule.exports.getKey = getKey;\nmodule.exports.makeKey = makeKey;\n","'use strict';\n\n// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('safe-buffer').Buffer;\nvar BN = require('bn.js');\nvar EC = require('elliptic').ec;\nvar parseKeys = require('parse-asn1');\nvar curves = require('./curves.json');\n\nfunction verify(sig, hash, key, signType, tag) {\n  var pub = parseKeys(key);\n  if (pub.type === 'ec') {\n    // rsa keys can be interpreted as ecdsa ones in openssl\n    if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') { throw new Error('wrong public key type'); }\n    return ecVerify(sig, hash, pub);\n  } else if (pub.type === 'dsa') {\n    if (signType !== 'dsa') { throw new Error('wrong public key type'); }\n    return dsaVerify(sig, hash, pub);\n  }\n  if (signType !== 'rsa' && signType !== 'ecdsa/rsa') { throw new Error('wrong public key type'); }\n\n  hash = Buffer.concat([tag, hash]);\n  var len = pub.modulus.byteLength();\n  var pad = [1];\n  var padNum = 0;\n  while (hash.length + pad.length + 2 < len) {\n    pad.push(0xff);\n    padNum += 1;\n  }\n  pad.push(0x00);\n  var i = -1;\n  while (++i < hash.length) {\n    pad.push(hash[i]);\n  }\n  pad = Buffer.from(pad);\n  var red = BN.mont(pub.modulus);\n  sig = new BN(sig).toRed(red);\n\n  sig = sig.redPow(new BN(pub.publicExponent));\n  sig = Buffer.from(sig.fromRed().toArray());\n  var out = padNum < 8 ? 1 : 0;\n  len = Math.min(sig.length, pad.length);\n  if (sig.length !== pad.length) { out = 1; }\n\n  i = -1;\n  while (++i < len) { out |= sig[i] ^ pad[i]; }\n  return out === 0;\n}\n\nfunction ecVerify(sig, hash, pub) {\n  var curveId = curves[pub.data.algorithm.curve.join('.')];\n  if (!curveId) { throw new Error('unknown curve ' + pub.data.algorithm.curve.join('.')); }\n\n  var curve = new EC(curveId);\n  var pubkey = pub.data.subjectPrivateKey.data;\n\n  return curve.verify(hash, sig, pubkey);\n}\n\nfunction dsaVerify(sig, hash, pub) {\n  var p = pub.data.p;\n  var q = pub.data.q;\n  var g = pub.data.g;\n  var y = pub.data.pub_key;\n  var unpacked = parseKeys.signature.decode(sig, 'der');\n  var s = unpacked.s;\n  var r = unpacked.r;\n  checkValue(s, q);\n  checkValue(r, q);\n  var montp = BN.mont(p);\n  var w = s.invm(q);\n  var v = g.toRed(montp)\n    .redPow(new BN(hash).mul(w).mod(q))\n    .fromRed()\n    .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n    .mod(p)\n    .mod(q);\n  return v.cmp(r) === 0;\n}\n\nfunction checkValue(b, q) {\n  if (b.cmpn(0) <= 0) { throw new Error('invalid sig'); }\n  if (b.cmp(q) >= 0) { throw new Error('invalid sig'); }\n}\n\nmodule.exports = verify;\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\nvar createHash = require('create-hash');\nvar stream = require('readable-stream');\nvar inherits = require('inherits');\nvar sign = require('./sign');\nvar verify = require('./verify');\n\nvar algorithms = require('./algorithms.json');\nObject.keys(algorithms).forEach(function (key) {\n  algorithms[key].id = Buffer.from(algorithms[key].id, 'hex');\n  algorithms[key.toLowerCase()] = algorithms[key];\n});\n\nfunction Sign(algorithm) {\n  stream.Writable.call(this);\n\n  var data = algorithms[algorithm];\n  if (!data) { throw new Error('Unknown message digest'); }\n\n  this._hashType = data.hash;\n  this._hash = createHash(data.hash);\n  this._tag = data.id;\n  this._signType = data.sign;\n}\ninherits(Sign, stream.Writable);\n\nSign.prototype._write = function _write(data, _, done) {\n  this._hash.update(data);\n  done();\n};\n\nSign.prototype.update = function update(data, enc) {\n  this._hash.update(typeof data === 'string' ? Buffer.from(data, enc) : data);\n\n  return this;\n};\n\nSign.prototype.sign = function signMethod(key, enc) {\n  this.end();\n  var hash = this._hash.digest();\n  var sig = sign(hash, key, this._hashType, this._signType, this._tag);\n\n  return enc ? sig.toString(enc) : sig;\n};\n\nfunction Verify(algorithm) {\n  stream.Writable.call(this);\n\n  var data = algorithms[algorithm];\n  if (!data) { throw new Error('Unknown message digest'); }\n\n  this._hash = createHash(data.hash);\n  this._tag = data.id;\n  this._signType = data.sign;\n}\ninherits(Verify, stream.Writable);\n\nVerify.prototype._write = function _write(data, _, done) {\n  this._hash.update(data);\n  done();\n};\n\nVerify.prototype.update = function update(data, enc) {\n  this._hash.update(typeof data === 'string' ? Buffer.from(data, enc) : data);\n\n  return this;\n};\n\nVerify.prototype.verify = function verifyMethod(key, sig, enc) {\n  var sigBuffer = typeof sig === 'string' ? Buffer.from(sig, enc) : sig;\n\n  this.end();\n  var hash = this._hash.digest();\n  return verify(sigBuffer, hash, key, this._signType, this._tag);\n};\n\nfunction createSign(algorithm) {\n  return new Sign(algorithm);\n}\n\nfunction createVerify(algorithm) {\n  return new Verify(algorithm);\n}\n\nmodule.exports = {\n  Sign: createSign,\n  Verify: createVerify,\n  createSign: createSign,\n  createVerify: createVerify\n};\n","var elliptic = require('elliptic')\nvar BN = require('bn.js')\n\nmodule.exports = function createECDH (curve) {\n  return new ECDH(curve)\n}\n\nvar aliases = {\n  secp256k1: {\n    name: 'secp256k1',\n    byteLength: 32\n  },\n  secp224r1: {\n    name: 'p224',\n    byteLength: 28\n  },\n  prime256v1: {\n    name: 'p256',\n    byteLength: 32\n  },\n  prime192v1: {\n    name: 'p192',\n    byteLength: 24\n  },\n  ed25519: {\n    name: 'ed25519',\n    byteLength: 32\n  },\n  secp384r1: {\n    name: 'p384',\n    byteLength: 48\n  },\n  secp521r1: {\n    name: 'p521',\n    byteLength: 66\n  }\n}\n\naliases.p224 = aliases.secp224r1\naliases.p256 = aliases.secp256r1 = aliases.prime256v1\naliases.p192 = aliases.secp192r1 = aliases.prime192v1\naliases.p384 = aliases.secp384r1\naliases.p521 = aliases.secp521r1\n\nfunction ECDH (curve) {\n  this.curveType = aliases[curve]\n  if (!this.curveType) {\n    this.curveType = {\n      name: curve\n    }\n  }\n  this.curve = new elliptic.ec(this.curveType.name) // eslint-disable-line new-cap\n  this.keys = void 0\n}\n\nECDH.prototype.generateKeys = function (enc, format) {\n  this.keys = this.curve.genKeyPair()\n  return this.getPublicKey(enc, format)\n}\n\nECDH.prototype.computeSecret = function (other, inenc, enc) {\n  inenc = inenc || 'utf8'\n  if (!Buffer.isBuffer(other)) {\n    other = new Buffer(other, inenc)\n  }\n  var otherPub = this.curve.keyFromPublic(other).getPublic()\n  var out = otherPub.mul(this.keys.getPrivate()).getX()\n  return formatReturnValue(out, enc, this.curveType.byteLength)\n}\n\nECDH.prototype.getPublicKey = function (enc, format) {\n  var key = this.keys.getPublic(format === 'compressed', true)\n  if (format === 'hybrid') {\n    if (key[key.length - 1] % 2) {\n      key[0] = 7\n    } else {\n      key[0] = 6\n    }\n  }\n  return formatReturnValue(key, enc)\n}\n\nECDH.prototype.getPrivateKey = function (enc) {\n  return formatReturnValue(this.keys.getPrivate(), enc)\n}\n\nECDH.prototype.setPublicKey = function (pub, enc) {\n  enc = enc || 'utf8'\n  if (!Buffer.isBuffer(pub)) {\n    pub = new Buffer(pub, enc)\n  }\n  this.keys._importPublic(pub)\n  return this\n}\n\nECDH.prototype.setPrivateKey = function (priv, enc) {\n  enc = enc || 'utf8'\n  if (!Buffer.isBuffer(priv)) {\n    priv = new Buffer(priv, enc)\n  }\n\n  var _priv = new BN(priv)\n  _priv = _priv.toString(16)\n  this.keys = this.curve.genKeyPair()\n  this.keys._importPrivate(_priv)\n  return this\n}\n\nfunction formatReturnValue (bn, enc, len) {\n  if (!Array.isArray(bn)) {\n    bn = bn.toArray()\n  }\n  var buf = new Buffer(bn)\n  if (len && buf.length < len) {\n    var zeros = new Buffer(len - buf.length)\n    zeros.fill(0)\n    buf = Buffer.concat([zeros, buf])\n  }\n  if (!enc) {\n    return buf\n  } else {\n    return buf.toString(enc)\n  }\n}\n","var createHash = require('create-hash')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (seed, len) {\n  var t = Buffer.alloc(0)\n  var i = 0\n  var c\n  while (t.length < len) {\n    c = i2ops(i++)\n    t = Buffer.concat([t, createHash('sha1').update(seed).update(c).digest()])\n  }\n  return t.slice(0, len)\n}\n\nfunction i2ops (c) {\n  var out = Buffer.allocUnsafe(4)\n  out.writeUInt32BE(c, 0)\n  return out\n}\n","module.exports = function xor (a, b) {\n  var len = a.length\n  var i = -1\n  while (++i < len) {\n    a[i] ^= b[i]\n  }\n  return a\n}\n","var BN = require('bn.js')\nvar Buffer = require('safe-buffer').Buffer\n\nfunction withPublic (paddedMsg, key) {\n  return Buffer.from(paddedMsg\n    .toRed(BN.mont(key.modulus))\n    .redPow(new BN(key.publicExponent))\n    .fromRed()\n    .toArray())\n}\n\nmodule.exports = withPublic\n","var parseKeys = require('parse-asn1')\nvar randomBytes = require('randombytes')\nvar createHash = require('create-hash')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar withPublic = require('./withPublic')\nvar crt = require('browserify-rsa')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function publicEncrypt (publicKey, msg, reverse) {\n  var padding\n  if (publicKey.padding) {\n    padding = publicKey.padding\n  } else if (reverse) {\n    padding = 1\n  } else {\n    padding = 4\n  }\n  var key = parseKeys(publicKey)\n  var paddedMsg\n  if (padding === 4) {\n    paddedMsg = oaep(key, msg)\n  } else if (padding === 1) {\n    paddedMsg = pkcs1(key, msg, reverse)\n  } else if (padding === 3) {\n    paddedMsg = new BN(msg)\n    if (paddedMsg.cmp(key.modulus) >= 0) {\n      throw new Error('data too long for modulus')\n    }\n  } else {\n    throw new Error('unknown padding')\n  }\n  if (reverse) {\n    return crt(paddedMsg, key)\n  } else {\n    return withPublic(paddedMsg, key)\n  }\n}\n\nfunction oaep (key, msg) {\n  var k = key.modulus.byteLength()\n  var mLen = msg.length\n  var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n  var hLen = iHash.length\n  var hLen2 = 2 * hLen\n  if (mLen > k - hLen2 - 2) {\n    throw new Error('message too long')\n  }\n  var ps = Buffer.alloc(k - mLen - hLen2 - 2)\n  var dblen = k - hLen - 1\n  var seed = randomBytes(hLen)\n  var maskedDb = xor(Buffer.concat([iHash, ps, Buffer.alloc(1, 1), msg], dblen), mgf(seed, dblen))\n  var maskedSeed = xor(seed, mgf(maskedDb, hLen))\n  return new BN(Buffer.concat([Buffer.alloc(1), maskedSeed, maskedDb], k))\n}\nfunction pkcs1 (key, msg, reverse) {\n  var mLen = msg.length\n  var k = key.modulus.byteLength()\n  if (mLen > k - 11) {\n    throw new Error('message too long')\n  }\n  var ps\n  if (reverse) {\n    ps = Buffer.alloc(k - mLen - 3, 0xff)\n  } else {\n    ps = nonZero(k - mLen - 3)\n  }\n  return new BN(Buffer.concat([Buffer.from([0, reverse ? 1 : 2]), ps, Buffer.alloc(1), msg], k))\n}\nfunction nonZero (len) {\n  var out = Buffer.allocUnsafe(len)\n  var i = 0\n  var cache = randomBytes(len * 2)\n  var cur = 0\n  var num\n  while (i < len) {\n    if (cur === cache.length) {\n      cache = randomBytes(len * 2)\n      cur = 0\n    }\n    num = cache[cur++]\n    if (num) {\n      out[i++] = num\n    }\n  }\n  return out\n}\n","var parseKeys = require('parse-asn1')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar crt = require('browserify-rsa')\nvar createHash = require('create-hash')\nvar withPublic = require('./withPublic')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function privateDecrypt (privateKey, enc, reverse) {\n  var padding\n  if (privateKey.padding) {\n    padding = privateKey.padding\n  } else if (reverse) {\n    padding = 1\n  } else {\n    padding = 4\n  }\n\n  var key = parseKeys(privateKey)\n  var k = key.modulus.byteLength()\n  if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) {\n    throw new Error('decryption error')\n  }\n  var msg\n  if (reverse) {\n    msg = withPublic(new BN(enc), key)\n  } else {\n    msg = crt(enc, key)\n  }\n  var zBuffer = Buffer.alloc(k - msg.length)\n  msg = Buffer.concat([zBuffer, msg], k)\n  if (padding === 4) {\n    return oaep(key, msg)\n  } else if (padding === 1) {\n    return pkcs1(key, msg, reverse)\n  } else if (padding === 3) {\n    return msg\n  } else {\n    throw new Error('unknown padding')\n  }\n}\n\nfunction oaep (key, msg) {\n  var k = key.modulus.byteLength()\n  var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n  var hLen = iHash.length\n  if (msg[0] !== 0) {\n    throw new Error('decryption error')\n  }\n  var maskedSeed = msg.slice(1, hLen + 1)\n  var maskedDb = msg.slice(hLen + 1)\n  var seed = xor(maskedSeed, mgf(maskedDb, hLen))\n  var db = xor(maskedDb, mgf(seed, k - hLen - 1))\n  if (compare(iHash, db.slice(0, hLen))) {\n    throw new Error('decryption error')\n  }\n  var i = hLen\n  while (db[i] === 0) {\n    i++\n  }\n  if (db[i++] !== 1) {\n    throw new Error('decryption error')\n  }\n  return db.slice(i)\n}\n\nfunction pkcs1 (key, msg, reverse) {\n  var p1 = msg.slice(0, 2)\n  var i = 2\n  var status = 0\n  while (msg[i++] !== 0) {\n    if (i >= msg.length) {\n      status++\n      break\n    }\n  }\n  var ps = msg.slice(2, i - 1)\n\n  if ((p1.toString('hex') !== '0002' && !reverse) || (p1.toString('hex') !== '0001' && reverse)) {\n    status++\n  }\n  if (ps.length < 8) {\n    status++\n  }\n  if (status) {\n    throw new Error('decryption error')\n  }\n  return msg.slice(i)\n}\nfunction compare (a, b) {\n  a = Buffer.from(a)\n  b = Buffer.from(b)\n  var dif = 0\n  var len = a.length\n  if (a.length !== b.length) {\n    dif++\n    len = Math.min(a.length, b.length)\n  }\n  var i = -1\n  while (++i < len) {\n    dif += (a[i] ^ b[i])\n  }\n  return dif\n}\n","exports.publicEncrypt = require('./publicEncrypt')\nexports.privateDecrypt = require('./privateDecrypt')\n\nexports.privateEncrypt = function privateEncrypt (key, buf) {\n  return exports.publicEncrypt(key, buf, true)\n}\n\nexports.publicDecrypt = function publicDecrypt (key, buf) {\n  return exports.privateDecrypt(key, buf, true)\n}\n","'use strict'\n\nfunction oldBrowser () {\n  throw new Error('secure random number generation not supported by this browser\\nuse chrome, FireFox or Internet Explorer 11')\n}\nvar safeBuffer = require('safe-buffer')\nvar randombytes = require('randombytes')\nvar Buffer = safeBuffer.Buffer\nvar kBufferMaxLength = safeBuffer.kMaxLength\nvar crypto = global.crypto || global.msCrypto\nvar kMaxUint32 = Math.pow(2, 32) - 1\nfunction assertOffset (offset, length) {\n  if (typeof offset !== 'number' || offset !== offset) { // eslint-disable-line no-self-compare\n    throw new TypeError('offset must be a number')\n  }\n\n  if (offset > kMaxUint32 || offset < 0) {\n    throw new TypeError('offset must be a uint32')\n  }\n\n  if (offset > kBufferMaxLength || offset > length) {\n    throw new RangeError('offset out of range')\n  }\n}\n\nfunction assertSize (size, offset, length) {\n  if (typeof size !== 'number' || size !== size) { // eslint-disable-line no-self-compare\n    throw new TypeError('size must be a number')\n  }\n\n  if (size > kMaxUint32 || size < 0) {\n    throw new TypeError('size must be a uint32')\n  }\n\n  if (size + offset > length || size > kBufferMaxLength) {\n    throw new RangeError('buffer too small')\n  }\n}\nif ((crypto && crypto.getRandomValues) || !process.browser) {\n  exports.randomFill = randomFill\n  exports.randomFillSync = randomFillSync\n} else {\n  exports.randomFill = oldBrowser\n  exports.randomFillSync = oldBrowser\n}\nfunction randomFill (buf, offset, size, cb) {\n  if (!Buffer.isBuffer(buf) && !(buf instanceof global.Uint8Array)) {\n    throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array')\n  }\n\n  if (typeof offset === 'function') {\n    cb = offset\n    offset = 0\n    size = buf.length\n  } else if (typeof size === 'function') {\n    cb = size\n    size = buf.length - offset\n  } else if (typeof cb !== 'function') {\n    throw new TypeError('\"cb\" argument must be a function')\n  }\n  assertOffset(offset, buf.length)\n  assertSize(size, offset, buf.length)\n  return actualFill(buf, offset, size, cb)\n}\n\nfunction actualFill (buf, offset, size, cb) {\n  if (process.browser) {\n    var ourBuf = buf.buffer\n    var uint = new Uint8Array(ourBuf, offset, size)\n    crypto.getRandomValues(uint)\n    if (cb) {\n      process.nextTick(function () {\n        cb(null, buf)\n      })\n      return\n    }\n    return buf\n  }\n  if (cb) {\n    randombytes(size, function (err, bytes) {\n      if (err) {\n        return cb(err)\n      }\n      bytes.copy(buf, offset)\n      cb(null, buf)\n    })\n    return\n  }\n  var bytes = randombytes(size)\n  bytes.copy(buf, offset)\n  return buf\n}\nfunction randomFillSync (buf, offset, size) {\n  if (typeof offset === 'undefined') {\n    offset = 0\n  }\n  if (!Buffer.isBuffer(buf) && !(buf instanceof global.Uint8Array)) {\n    throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array')\n  }\n\n  assertOffset(offset, buf.length)\n\n  if (size === undefined) size = buf.length - offset\n\n  assertSize(size, offset, buf.length)\n\n  return actualFill(buf, offset, size)\n}\n","'use strict';\n\n// eslint-disable-next-line no-multi-assign\nexports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require('randombytes');\n\n// eslint-disable-next-line no-multi-assign\nexports.createHash = exports.Hash = require('create-hash');\n\n// eslint-disable-next-line no-multi-assign\nexports.createHmac = exports.Hmac = require('create-hmac');\n\nvar algos = require('browserify-sign/algos');\nvar algoKeys = Object.keys(algos);\nvar hashes = [\n\t'sha1',\n\t'sha224',\n\t'sha256',\n\t'sha384',\n\t'sha512',\n\t'md5',\n\t'rmd160'\n].concat(algoKeys);\n\nexports.getHashes = function () {\n\treturn hashes;\n};\n\nvar p = require('pbkdf2');\nexports.pbkdf2 = p.pbkdf2;\nexports.pbkdf2Sync = p.pbkdf2Sync;\n\nvar aes = require('browserify-cipher');\n\nexports.Cipher = aes.Cipher;\nexports.createCipher = aes.createCipher;\nexports.Cipheriv = aes.Cipheriv;\nexports.createCipheriv = aes.createCipheriv;\nexports.Decipher = aes.Decipher;\nexports.createDecipher = aes.createDecipher;\nexports.Decipheriv = aes.Decipheriv;\nexports.createDecipheriv = aes.createDecipheriv;\nexports.getCiphers = aes.getCiphers;\nexports.listCiphers = aes.listCiphers;\n\nvar dh = require('diffie-hellman');\n\nexports.DiffieHellmanGroup = dh.DiffieHellmanGroup;\nexports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup;\nexports.getDiffieHellman = dh.getDiffieHellman;\nexports.createDiffieHellman = dh.createDiffieHellman;\nexports.DiffieHellman = dh.DiffieHellman;\n\nvar sign = require('browserify-sign');\n\nexports.createSign = sign.createSign;\nexports.Sign = sign.Sign;\nexports.createVerify = sign.createVerify;\nexports.Verify = sign.Verify;\n\nexports.createECDH = require('create-ecdh');\n\nvar publicEncrypt = require('public-encrypt');\n\nexports.publicEncrypt = publicEncrypt.publicEncrypt;\nexports.privateEncrypt = publicEncrypt.privateEncrypt;\nexports.publicDecrypt = publicEncrypt.publicDecrypt;\nexports.privateDecrypt = publicEncrypt.privateDecrypt;\n\n// the least I can do is make error messages for the rest of the node.js/crypto api.\n// [\n//   'createCredentials'\n// ].forEach(function (name) {\n//   exports[name] = function () {\n//     throw new Error('sorry, ' + name + ' is not implemented yet\\nwe accept pull requests\\nhttps://github.com/browserify/crypto-browserify');\n//   };\n// });\n\nvar rf = require('randomfill');\n\nexports.randomFill = rf.randomFill;\nexports.randomFillSync = rf.randomFillSync;\n\nexports.createCredentials = function () {\n\tthrow new Error('sorry, createCredentials is not implemented yet\\nwe accept pull requests\\nhttps://github.com/browserify/crypto-browserify');\n};\n\nexports.constants = {\n\tDH_CHECK_P_NOT_SAFE_PRIME: 2,\n\tDH_CHECK_P_NOT_PRIME: 1,\n\tDH_UNABLE_TO_CHECK_GENERATOR: 4,\n\tDH_NOT_SUITABLE_GENERATOR: 8,\n\tNPN_ENABLED: 1,\n\tALPN_ENABLED: 1,\n\tRSA_PKCS1_PADDING: 1,\n\tRSA_SSLV23_PADDING: 2,\n\tRSA_NO_PADDING: 3,\n\tRSA_PKCS1_OAEP_PADDING: 4,\n\tRSA_X931_PADDING: 5,\n\tRSA_PKCS1_PSS_PADDING: 6,\n\tPOINT_CONVERSION_COMPRESSED: 2,\n\tPOINT_CONVERSION_UNCOMPRESSED: 4,\n\tPOINT_CONVERSION_HYBRID: 6\n};\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sha256 = sha256;\nconst crypto_1 = require(\"crypto\");\nfunction sha256(data) {\n    return (0, crypto_1.createHash)('sha256').update(data).digest();\n}\n//# sourceMappingURL=crypto.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.HASH_PREFIX_NODE_DICT = exports.HASH_PREFIX_NODE_ARRAY = exports.HASH_PREFIX_LEAF = exports.HASH_PREFIX_NODE = void 0;\nexports.HASH_PREFIX_NODE = 0;\nexports.HASH_PREFIX_LEAF = 1;\nexports.HASH_PREFIX_NODE_ARRAY = 7;\nexports.HASH_PREFIX_NODE_DICT = 8;\n//# sourceMappingURL=constants.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.calculateMerkleHash = calculateMerkleHash;\nconst utils_1 = require(\"../gtv/utils\");\nconst crypto_1 = require(\"../crypto\");\nconst constants_1 = require(\"../constants\");\nfunction calculateNodeHash(prefix, leftHash, rightHash) {\n    return (0, crypto_1.sha256)(Buffer.concat([Buffer.from([prefix]), leftHash, rightHash]));\n}\nfunction calculateLeafHash(gtv) {\n    const ret = (0, crypto_1.sha256)(Buffer.concat([Buffer.from([constants_1.HASH_PREFIX_LEAF]), Buffer.from((0, utils_1.encode_value)(gtv))]));\n    return ret;\n}\nfunction calculateMerkleHash(element) {\n    if (element.type === 'empty')\n        return Buffer.alloc(32);\n    if (element.type === 'leaf')\n        return calculateLeafHash(element.content);\n    const prefix = 'kind' in element\n        ? element.kind === 'array' ? constants_1.HASH_PREFIX_NODE_ARRAY : constants_1.HASH_PREFIX_NODE_DICT\n        : constants_1.HASH_PREFIX_NODE;\n    return calculateNodeHash(prefix, calculateMerkleHash(element.left), calculateMerkleHash(element.right));\n}\n//# sourceMappingURL=hash.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.gtvHash = gtvHash;\nconst factory_1 = require(\"./tree/factory\");\nconst hash_1 = require(\"./tree/hash\");\nfunction gtvHash(value, merkleHashVersion) {\n    const tree = (0, factory_1.buildTree)(value, merkleHashVersion);\n    return (0, hash_1.calculateMerkleHash)(tree);\n}\n//# sourceMappingURL=index.js.map","\"use strict\";\n/* eslint-disable @typescript-eslint/ban-ts-comment */\n// @ts-nocheck\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ASNBuffer = exports.rawGTV = exports.ASNDictPair = void 0;\n// eslint-disable-next-line @typescript-eslint/no-var-requires\nconst asn = require(\"@chromia/asn1/lib/asn1\");\nexports.ASNDictPair = asn.define(\"DictPair\", function () {\n    this.seq().obj(this.key(\"name\").utf8str(), this.key(\"value\").use(exports.rawGTV));\n});\nexports.rawGTV = asn.define(\"GtvValue\", function () {\n    this.choice({\n        null: this.explicit(0).null_(),\n        byteArray: this.explicit(1).octstr(),\n        string: this.explicit(2).utf8str(),\n        integer: this.explicit(3).int(),\n        dict: this.explicit(4).seqof(exports.ASNDictPair),\n        array: this.explicit(5).seqof(exports.rawGTV),\n        bigInteger: this.explicit(6).int(),\n    });\n});\nexports.ASNBuffer = asn.define(\"Buffer\", function () {\n    this.octstr();\n});\n//# sourceMappingURL=definition.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CustomError = void 0;\nclass CustomError extends Error {\n    constructor(message, status) {\n        super(message);\n        this.name = this.constructor.name;\n        this.status = status;\n    }\n}\nexports.CustomError = CustomError;\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MissingSignerException = exports.NumberOfSignersAndSignaturesException = exports.AlreadySignedTransactionException = exports.MissingGtxException = exports.UnexpectedArgumentTypeError = void 0;\nconst customError_1 = require(\"../customError\");\nclass UnexpectedArgumentTypeError extends customError_1.CustomError {\n    constructor(typedArg) {\n        super(`Cannot parse typedArg ${JSON.stringify(typedArg)}. Unknown type ${typedArg.type}`, 400);\n    }\n}\nexports.UnexpectedArgumentTypeError = UnexpectedArgumentTypeError;\nclass MissingGtxException extends customError_1.CustomError {\n    constructor() {\n        super(`Missing instance of gtx protocol (used for communicating with postchain) to add operation to`, 400);\n    }\n}\nexports.MissingGtxException = MissingGtxException;\nclass AlreadySignedTransactionException extends customError_1.CustomError {\n    constructor(operation) {\n        super(`Cannot add ${operation} calls to an already signed gtx`, 400);\n    }\n}\nexports.AlreadySignedTransactionException = AlreadySignedTransactionException;\nclass NumberOfSignersAndSignaturesException extends customError_1.CustomError {\n    constructor() {\n        super(`Not matching number of signers and signatures`, 400);\n    }\n}\nexports.NumberOfSignersAndSignaturesException = NumberOfSignersAndSignaturesException;\nclass MissingSignerException extends customError_1.CustomError {\n    constructor() {\n        super(`No such signer, remember to add signer to transaction before adding a signature`, 400);\n    }\n}\nexports.MissingSignerException = MissingSignerException;\n//# sourceMappingURL=errors.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getParsedType = exports.ZodParsedType = exports.objectUtil = exports.util = void 0;\nvar util;\n(function (util) {\n    util.assertEqual = (_) => { };\n    function assertIs(_arg) { }\n    util.assertIs = assertIs;\n    function assertNever(_x) {\n        throw new Error();\n    }\n    util.assertNever = assertNever;\n    util.arrayToEnum = (items) => {\n        const obj = {};\n        for (const item of items) {\n            obj[item] = item;\n        }\n        return obj;\n    };\n    util.getValidEnumValues = (obj) => {\n        const validKeys = util.objectKeys(obj).filter((k) => typeof obj[obj[k]] !== \"number\");\n        const filtered = {};\n        for (const k of validKeys) {\n            filtered[k] = obj[k];\n        }\n        return util.objectValues(filtered);\n    };\n    util.objectValues = (obj) => {\n        return util.objectKeys(obj).map(function (e) {\n            return obj[e];\n        });\n    };\n    util.objectKeys = typeof Object.keys === \"function\" // eslint-disable-line ban/ban\n        ? (obj) => Object.keys(obj) // eslint-disable-line ban/ban\n        : (object) => {\n            const keys = [];\n            for (const key in object) {\n                if (Object.prototype.hasOwnProperty.call(object, key)) {\n                    keys.push(key);\n                }\n            }\n            return keys;\n        };\n    util.find = (arr, checker) => {\n        for (const item of arr) {\n            if (checker(item))\n                return item;\n        }\n        return undefined;\n    };\n    util.isInteger = typeof Number.isInteger === \"function\"\n        ? (val) => Number.isInteger(val) // eslint-disable-line ban/ban\n        : (val) => typeof val === \"number\" && Number.isFinite(val) && Math.floor(val) === val;\n    function joinValues(array, separator = \" | \") {\n        return array.map((val) => (typeof val === \"string\" ? `'${val}'` : val)).join(separator);\n    }\n    util.joinValues = joinValues;\n    util.jsonStringifyReplacer = (_, value) => {\n        if (typeof value === \"bigint\") {\n            return value.toString();\n        }\n        return value;\n    };\n})(util || (exports.util = util = {}));\nvar objectUtil;\n(function (objectUtil) {\n    objectUtil.mergeShapes = (first, second) => {\n        return {\n            ...first,\n            ...second, // second overwrites first\n        };\n    };\n})(objectUtil || (exports.objectUtil = objectUtil = {}));\nexports.ZodParsedType = util.arrayToEnum([\n    \"string\",\n    \"nan\",\n    \"number\",\n    \"integer\",\n    \"float\",\n    \"boolean\",\n    \"date\",\n    \"bigint\",\n    \"symbol\",\n    \"function\",\n    \"undefined\",\n    \"null\",\n    \"array\",\n    \"object\",\n    \"unknown\",\n    \"promise\",\n    \"void\",\n    \"never\",\n    \"map\",\n    \"set\",\n]);\nconst getParsedType = (data) => {\n    const t = typeof data;\n    switch (t) {\n        case \"undefined\":\n            return exports.ZodParsedType.undefined;\n        case \"string\":\n            return exports.ZodParsedType.string;\n        case \"number\":\n            return Number.isNaN(data) ? exports.ZodParsedType.nan : exports.ZodParsedType.number;\n        case \"boolean\":\n            return exports.ZodParsedType.boolean;\n        case \"function\":\n            return exports.ZodParsedType.function;\n        case \"bigint\":\n            return exports.ZodParsedType.bigint;\n        case \"symbol\":\n            return exports.ZodParsedType.symbol;\n        case \"object\":\n            if (Array.isArray(data)) {\n                return exports.ZodParsedType.array;\n            }\n            if (data === null) {\n                return exports.ZodParsedType.null;\n            }\n            if (data.then && typeof data.then === \"function\" && data.catch && typeof data.catch === \"function\") {\n                return exports.ZodParsedType.promise;\n            }\n            if (typeof Map !== \"undefined\" && data instanceof Map) {\n                return exports.ZodParsedType.map;\n            }\n            if (typeof Set !== \"undefined\" && data instanceof Set) {\n                return exports.ZodParsedType.set;\n            }\n            if (typeof Date !== \"undefined\" && data instanceof Date) {\n                return exports.ZodParsedType.date;\n            }\n            return exports.ZodParsedType.object;\n        default:\n            return exports.ZodParsedType.unknown;\n    }\n};\nexports.getParsedType = getParsedType;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ZodError = exports.quotelessJson = exports.ZodIssueCode = void 0;\nconst util_js_1 = require(\"./helpers/util.cjs\");\nexports.ZodIssueCode = util_js_1.util.arrayToEnum([\n    \"invalid_type\",\n    \"invalid_literal\",\n    \"custom\",\n    \"invalid_union\",\n    \"invalid_union_discriminator\",\n    \"invalid_enum_value\",\n    \"unrecognized_keys\",\n    \"invalid_arguments\",\n    \"invalid_return_type\",\n    \"invalid_date\",\n    \"invalid_string\",\n    \"too_small\",\n    \"too_big\",\n    \"invalid_intersection_types\",\n    \"not_multiple_of\",\n    \"not_finite\",\n]);\nconst quotelessJson = (obj) => {\n    const json = JSON.stringify(obj, null, 2);\n    return json.replace(/\"([^\"]+)\":/g, \"$1:\");\n};\nexports.quotelessJson = quotelessJson;\nclass ZodError extends Error {\n    get errors() {\n        return this.issues;\n    }\n    constructor(issues) {\n        super();\n        this.issues = [];\n        this.addIssue = (sub) => {\n            this.issues = [...this.issues, sub];\n        };\n        this.addIssues = (subs = []) => {\n            this.issues = [...this.issues, ...subs];\n        };\n        const actualProto = new.target.prototype;\n        if (Object.setPrototypeOf) {\n            // eslint-disable-next-line ban/ban\n            Object.setPrototypeOf(this, actualProto);\n        }\n        else {\n            this.__proto__ = actualProto;\n        }\n        this.name = \"ZodError\";\n        this.issues = issues;\n    }\n    format(_mapper) {\n        const mapper = _mapper ||\n            function (issue) {\n                return issue.message;\n            };\n        const fieldErrors = { _errors: [] };\n        const processError = (error) => {\n            for (const issue of error.issues) {\n                if (issue.code === \"invalid_union\") {\n                    issue.unionErrors.map(processError);\n                }\n                else if (issue.code === \"invalid_return_type\") {\n                    processError(issue.returnTypeError);\n                }\n                else if (issue.code === \"invalid_arguments\") {\n                    processError(issue.argumentsError);\n                }\n                else if (issue.path.length === 0) {\n                    fieldErrors._errors.push(mapper(issue));\n                }\n                else {\n                    let curr = fieldErrors;\n                    let i = 0;\n                    while (i < issue.path.length) {\n                        const el = issue.path[i];\n                        const terminal = i === issue.path.length - 1;\n                        if (!terminal) {\n                            curr[el] = curr[el] || { _errors: [] };\n                            // if (typeof el === \"string\") {\n                            //   curr[el] = curr[el] || { _errors: [] };\n                            // } else if (typeof el === \"number\") {\n                            //   const errorArray: any = [];\n                            //   errorArray._errors = [];\n                            //   curr[el] = curr[el] || errorArray;\n                            // }\n                        }\n                        else {\n                            curr[el] = curr[el] || { _errors: [] };\n                            curr[el]._errors.push(mapper(issue));\n                        }\n                        curr = curr[el];\n                        i++;\n                    }\n                }\n            }\n        };\n        processError(this);\n        return fieldErrors;\n    }\n    static assert(value) {\n        if (!(value instanceof ZodError)) {\n            throw new Error(`Not a ZodError: ${value}`);\n        }\n    }\n    toString() {\n        return this.message;\n    }\n    get message() {\n        return JSON.stringify(this.issues, util_js_1.util.jsonStringifyReplacer, 2);\n    }\n    get isEmpty() {\n        return this.issues.length === 0;\n    }\n    flatten(mapper = (issue) => issue.message) {\n        const fieldErrors = {};\n        const formErrors = [];\n        for (const sub of this.issues) {\n            if (sub.path.length > 0) {\n                const firstEl = sub.path[0];\n                fieldErrors[firstEl] = fieldErrors[firstEl] || [];\n                fieldErrors[firstEl].push(mapper(sub));\n            }\n            else {\n                formErrors.push(mapper(sub));\n            }\n        }\n        return { formErrors, fieldErrors };\n    }\n    get formErrors() {\n        return this.flatten();\n    }\n}\nexports.ZodError = ZodError;\nZodError.create = (issues) => {\n    const error = new ZodError(issues);\n    return error;\n};\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst ZodError_js_1 = require(\"../ZodError.cjs\");\nconst util_js_1 = require(\"../helpers/util.cjs\");\nconst errorMap = (issue, _ctx) => {\n    let message;\n    switch (issue.code) {\n        case ZodError_js_1.ZodIssueCode.invalid_type:\n            if (issue.received === util_js_1.ZodParsedType.undefined) {\n                message = \"Required\";\n            }\n            else {\n                message = `Expected ${issue.expected}, received ${issue.received}`;\n            }\n            break;\n        case ZodError_js_1.ZodIssueCode.invalid_literal:\n            message = `Invalid literal value, expected ${JSON.stringify(issue.expected, util_js_1.util.jsonStringifyReplacer)}`;\n            break;\n        case ZodError_js_1.ZodIssueCode.unrecognized_keys:\n            message = `Unrecognized key(s) in object: ${util_js_1.util.joinValues(issue.keys, \", \")}`;\n            break;\n        case ZodError_js_1.ZodIssueCode.invalid_union:\n            message = `Invalid input`;\n            break;\n        case ZodError_js_1.ZodIssueCode.invalid_union_discriminator:\n            message = `Invalid discriminator value. Expected ${util_js_1.util.joinValues(issue.options)}`;\n            break;\n        case ZodError_js_1.ZodIssueCode.invalid_enum_value:\n            message = `Invalid enum value. Expected ${util_js_1.util.joinValues(issue.options)}, received '${issue.received}'`;\n            break;\n        case ZodError_js_1.ZodIssueCode.invalid_arguments:\n            message = `Invalid function arguments`;\n            break;\n        case ZodError_js_1.ZodIssueCode.invalid_return_type:\n            message = `Invalid function return type`;\n            break;\n        case ZodError_js_1.ZodIssueCode.invalid_date:\n            message = `Invalid date`;\n            break;\n        case ZodError_js_1.ZodIssueCode.invalid_string:\n            if (typeof issue.validation === \"object\") {\n                if (\"includes\" in issue.validation) {\n                    message = `Invalid input: must include \"${issue.validation.includes}\"`;\n                    if (typeof issue.validation.position === \"number\") {\n                        message = `${message} at one or more positions greater than or equal to ${issue.validation.position}`;\n                    }\n                }\n                else if (\"startsWith\" in issue.validation) {\n                    message = `Invalid input: must start with \"${issue.validation.startsWith}\"`;\n                }\n                else if (\"endsWith\" in issue.validation) {\n                    message = `Invalid input: must end with \"${issue.validation.endsWith}\"`;\n                }\n                else {\n                    util_js_1.util.assertNever(issue.validation);\n                }\n            }\n            else if (issue.validation !== \"regex\") {\n                message = `Invalid ${issue.validation}`;\n            }\n            else {\n                message = \"Invalid\";\n            }\n            break;\n        case ZodError_js_1.ZodIssueCode.too_small:\n            if (issue.type === \"array\")\n                message = `Array must contain ${issue.exact ? \"exactly\" : issue.inclusive ? `at least` : `more than`} ${issue.minimum} element(s)`;\n            else if (issue.type === \"string\")\n                message = `String must contain ${issue.exact ? \"exactly\" : issue.inclusive ? `at least` : `over`} ${issue.minimum} character(s)`;\n            else if (issue.type === \"number\")\n                message = `Number must be ${issue.exact ? `exactly equal to ` : issue.inclusive ? `greater than or equal to ` : `greater than `}${issue.minimum}`;\n            else if (issue.type === \"bigint\")\n                message = `Number must be ${issue.exact ? `exactly equal to ` : issue.inclusive ? `greater than or equal to ` : `greater than `}${issue.minimum}`;\n            else if (issue.type === \"date\")\n                message = `Date must be ${issue.exact ? `exactly equal to ` : issue.inclusive ? `greater than or equal to ` : `greater than `}${new Date(Number(issue.minimum))}`;\n            else\n                message = \"Invalid input\";\n            break;\n        case ZodError_js_1.ZodIssueCode.too_big:\n            if (issue.type === \"array\")\n                message = `Array must contain ${issue.exact ? `exactly` : issue.inclusive ? `at most` : `less than`} ${issue.maximum} element(s)`;\n            else if (issue.type === \"string\")\n                message = `String must contain ${issue.exact ? `exactly` : issue.inclusive ? `at most` : `under`} ${issue.maximum} character(s)`;\n            else if (issue.type === \"number\")\n                message = `Number must be ${issue.exact ? `exactly` : issue.inclusive ? `less than or equal to` : `less than`} ${issue.maximum}`;\n            else if (issue.type === \"bigint\")\n                message = `BigInt must be ${issue.exact ? `exactly` : issue.inclusive ? `less than or equal to` : `less than`} ${issue.maximum}`;\n            else if (issue.type === \"date\")\n                message = `Date must be ${issue.exact ? `exactly` : issue.inclusive ? `smaller than or equal to` : `smaller than`} ${new Date(Number(issue.maximum))}`;\n            else\n                message = \"Invalid input\";\n            break;\n        case ZodError_js_1.ZodIssueCode.custom:\n            message = `Invalid input`;\n            break;\n        case ZodError_js_1.ZodIssueCode.invalid_intersection_types:\n            message = `Intersection results could not be merged`;\n            break;\n        case ZodError_js_1.ZodIssueCode.not_multiple_of:\n            message = `Number must be a multiple of ${issue.multipleOf}`;\n            break;\n        case ZodError_js_1.ZodIssueCode.not_finite:\n            message = \"Number must be finite\";\n            break;\n        default:\n            message = _ctx.defaultError;\n            util_js_1.util.assertNever(issue);\n    }\n    return { message };\n};\nexports.default = errorMap;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.defaultErrorMap = void 0;\nexports.setErrorMap = setErrorMap;\nexports.getErrorMap = getErrorMap;\nconst en_js_1 = __importDefault(require(\"./locales/en.cjs\"));\nexports.defaultErrorMap = en_js_1.default;\nlet overrideErrorMap = en_js_1.default;\nfunction setErrorMap(map) {\n    overrideErrorMap = map;\n}\nfunction getErrorMap() {\n    return overrideErrorMap;\n}\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isAsync = exports.isValid = exports.isDirty = exports.isAborted = exports.OK = exports.DIRTY = exports.INVALID = exports.ParseStatus = exports.EMPTY_PATH = exports.makeIssue = void 0;\nexports.addIssueToContext = addIssueToContext;\nconst errors_js_1 = require(\"../errors.cjs\");\nconst en_js_1 = __importDefault(require(\"../locales/en.cjs\"));\nconst makeIssue = (params) => {\n    const { data, path, errorMaps, issueData } = params;\n    const fullPath = [...path, ...(issueData.path || [])];\n    const fullIssue = {\n        ...issueData,\n        path: fullPath,\n    };\n    if (issueData.message !== undefined) {\n        return {\n            ...issueData,\n            path: fullPath,\n            message: issueData.message,\n        };\n    }\n    let errorMessage = \"\";\n    const maps = errorMaps\n        .filter((m) => !!m)\n        .slice()\n        .reverse();\n    for (const map of maps) {\n        errorMessage = map(fullIssue, { data, defaultError: errorMessage }).message;\n    }\n    return {\n        ...issueData,\n        path: fullPath,\n        message: errorMessage,\n    };\n};\nexports.makeIssue = makeIssue;\nexports.EMPTY_PATH = [];\nfunction addIssueToContext(ctx, issueData) {\n    const overrideMap = (0, errors_js_1.getErrorMap)();\n    const issue = (0, exports.makeIssue)({\n        issueData: issueData,\n        data: ctx.data,\n        path: ctx.path,\n        errorMaps: [\n            ctx.common.contextualErrorMap, // contextual error map is first priority\n            ctx.schemaErrorMap, // then schema-bound map if available\n            overrideMap, // then global override map\n            overrideMap === en_js_1.default ? undefined : en_js_1.default, // then global default map\n        ].filter((x) => !!x),\n    });\n    ctx.common.issues.push(issue);\n}\nclass ParseStatus {\n    constructor() {\n        this.value = \"valid\";\n    }\n    dirty() {\n        if (this.value === \"valid\")\n            this.value = \"dirty\";\n    }\n    abort() {\n        if (this.value !== \"aborted\")\n            this.value = \"aborted\";\n    }\n    static mergeArray(status, results) {\n        const arrayValue = [];\n        for (const s of results) {\n            if (s.status === \"aborted\")\n                return exports.INVALID;\n            if (s.status === \"dirty\")\n                status.dirty();\n            arrayValue.push(s.value);\n        }\n        return { status: status.value, value: arrayValue };\n    }\n    static async mergeObjectAsync(status, pairs) {\n        const syncPairs = [];\n        for (const pair of pairs) {\n            const key = await pair.key;\n            const value = await pair.value;\n            syncPairs.push({\n                key,\n                value,\n            });\n        }\n        return ParseStatus.mergeObjectSync(status, syncPairs);\n    }\n    static mergeObjectSync(status, pairs) {\n        const finalObject = {};\n        for (const pair of pairs) {\n            const { key, value } = pair;\n            if (key.status === \"aborted\")\n                return exports.INVALID;\n            if (value.status === \"aborted\")\n                return exports.INVALID;\n            if (key.status === \"dirty\")\n                status.dirty();\n            if (value.status === \"dirty\")\n                status.dirty();\n            if (key.value !== \"__proto__\" && (typeof value.value !== \"undefined\" || pair.alwaysSet)) {\n                finalObject[key.value] = value.value;\n            }\n        }\n        return { status: status.value, value: finalObject };\n    }\n}\nexports.ParseStatus = ParseStatus;\nexports.INVALID = Object.freeze({\n    status: \"aborted\",\n});\nconst DIRTY = (value) => ({ status: \"dirty\", value });\nexports.DIRTY = DIRTY;\nconst OK = (value) => ({ status: \"valid\", value });\nexports.OK = OK;\nconst isAborted = (x) => x.status === \"aborted\";\nexports.isAborted = isAborted;\nconst isDirty = (x) => x.status === \"dirty\";\nexports.isDirty = isDirty;\nconst isValid = (x) => x.status === \"valid\";\nexports.isValid = isValid;\nconst isAsync = (x) => typeof Promise !== \"undefined\" && x instanceof Promise;\nexports.isAsync = isAsync;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.errorUtil = void 0;\nvar errorUtil;\n(function (errorUtil) {\n    errorUtil.errToObj = (message) => typeof message === \"string\" ? { message } : message || {};\n    // biome-ignore lint:\n    errorUtil.toString = (message) => typeof message === \"string\" ? message : message?.message;\n})(errorUtil || (exports.errorUtil = errorUtil = {}));\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.discriminatedUnion = exports.date = exports.boolean = exports.bigint = exports.array = exports.any = exports.coerce = exports.ZodFirstPartyTypeKind = exports.late = exports.ZodSchema = exports.Schema = exports.ZodReadonly = exports.ZodPipeline = exports.ZodBranded = exports.BRAND = exports.ZodNaN = exports.ZodCatch = exports.ZodDefault = exports.ZodNullable = exports.ZodOptional = exports.ZodTransformer = exports.ZodEffects = exports.ZodPromise = exports.ZodNativeEnum = exports.ZodEnum = exports.ZodLiteral = exports.ZodLazy = exports.ZodFunction = exports.ZodSet = exports.ZodMap = exports.ZodRecord = exports.ZodTuple = exports.ZodIntersection = exports.ZodDiscriminatedUnion = exports.ZodUnion = exports.ZodObject = exports.ZodArray = exports.ZodVoid = exports.ZodNever = exports.ZodUnknown = exports.ZodAny = exports.ZodNull = exports.ZodUndefined = exports.ZodSymbol = exports.ZodDate = exports.ZodBoolean = exports.ZodBigInt = exports.ZodNumber = exports.ZodString = exports.ZodType = void 0;\nexports.NEVER = exports.void = exports.unknown = exports.union = exports.undefined = exports.tuple = exports.transformer = exports.symbol = exports.string = exports.strictObject = exports.set = exports.record = exports.promise = exports.preprocess = exports.pipeline = exports.ostring = exports.optional = exports.onumber = exports.oboolean = exports.object = exports.number = exports.nullable = exports.null = exports.never = exports.nativeEnum = exports.nan = exports.map = exports.literal = exports.lazy = exports.intersection = exports.instanceof = exports.function = exports.enum = exports.effect = void 0;\nexports.datetimeRegex = datetimeRegex;\nexports.custom = custom;\nconst ZodError_js_1 = require(\"./ZodError.cjs\");\nconst errors_js_1 = require(\"./errors.cjs\");\nconst errorUtil_js_1 = require(\"./helpers/errorUtil.cjs\");\nconst parseUtil_js_1 = require(\"./helpers/parseUtil.cjs\");\nconst util_js_1 = require(\"./helpers/util.cjs\");\nclass ParseInputLazyPath {\n    constructor(parent, value, path, key) {\n        this._cachedPath = [];\n        this.parent = parent;\n        this.data = value;\n        this._path = path;\n        this._key = key;\n    }\n    get path() {\n        if (!this._cachedPath.length) {\n            if (Array.isArray(this._key)) {\n                this._cachedPath.push(...this._path, ...this._key);\n            }\n            else {\n                this._cachedPath.push(...this._path, this._key);\n            }\n        }\n        return this._cachedPath;\n    }\n}\nconst handleResult = (ctx, result) => {\n    if ((0, parseUtil_js_1.isValid)(result)) {\n        return { success: true, data: result.value };\n    }\n    else {\n        if (!ctx.common.issues.length) {\n            throw new Error(\"Validation failed but no issues detected.\");\n        }\n        return {\n            success: false,\n            get error() {\n                if (this._error)\n                    return this._error;\n                const error = new ZodError_js_1.ZodError(ctx.common.issues);\n                this._error = error;\n                return this._error;\n            },\n        };\n    }\n};\nfunction processCreateParams(params) {\n    if (!params)\n        return {};\n    const { errorMap, invalid_type_error, required_error, description } = params;\n    if (errorMap && (invalid_type_error || required_error)) {\n        throw new Error(`Can't use \"invalid_type_error\" or \"required_error\" in conjunction with custom error map.`);\n    }\n    if (errorMap)\n        return { errorMap: errorMap, description };\n    const customMap = (iss, ctx) => {\n        const { message } = params;\n        if (iss.code === \"invalid_enum_value\") {\n            return { message: message ?? ctx.defaultError };\n        }\n        if (typeof ctx.data === \"undefined\") {\n            return { message: message ?? required_error ?? ctx.defaultError };\n        }\n        if (iss.code !== \"invalid_type\")\n            return { message: ctx.defaultError };\n        return { message: message ?? invalid_type_error ?? ctx.defaultError };\n    };\n    return { errorMap: customMap, description };\n}\nclass ZodType {\n    get description() {\n        return this._def.description;\n    }\n    _getType(input) {\n        return (0, util_js_1.getParsedType)(input.data);\n    }\n    _getOrReturnCtx(input, ctx) {\n        return (ctx || {\n            common: input.parent.common,\n            data: input.data,\n            parsedType: (0, util_js_1.getParsedType)(input.data),\n            schemaErrorMap: this._def.errorMap,\n            path: input.path,\n            parent: input.parent,\n        });\n    }\n    _processInputParams(input) {\n        return {\n            status: new parseUtil_js_1.ParseStatus(),\n            ctx: {\n                common: input.parent.common,\n                data: input.data,\n                parsedType: (0, util_js_1.getParsedType)(input.data),\n                schemaErrorMap: this._def.errorMap,\n                path: input.path,\n                parent: input.parent,\n            },\n        };\n    }\n    _parseSync(input) {\n        const result = this._parse(input);\n        if ((0, parseUtil_js_1.isAsync)(result)) {\n            throw new Error(\"Synchronous parse encountered promise.\");\n        }\n        return result;\n    }\n    _parseAsync(input) {\n        const result = this._parse(input);\n        return Promise.resolve(result);\n    }\n    parse(data, params) {\n        const result = this.safeParse(data, params);\n        if (result.success)\n            return result.data;\n        throw result.error;\n    }\n    safeParse(data, params) {\n        const ctx = {\n            common: {\n                issues: [],\n                async: params?.async ?? false,\n                contextualErrorMap: params?.errorMap,\n            },\n            path: params?.path || [],\n            schemaErrorMap: this._def.errorMap,\n            parent: null,\n            data,\n            parsedType: (0, util_js_1.getParsedType)(data),\n        };\n        const result = this._parseSync({ data, path: ctx.path, parent: ctx });\n        return handleResult(ctx, result);\n    }\n    \"~validate\"(data) {\n        const ctx = {\n            common: {\n                issues: [],\n                async: !!this[\"~standard\"].async,\n            },\n            path: [],\n            schemaErrorMap: this._def.errorMap,\n            parent: null,\n            data,\n            parsedType: (0, util_js_1.getParsedType)(data),\n        };\n        if (!this[\"~standard\"].async) {\n            try {\n                const result = this._parseSync({ data, path: [], parent: ctx });\n                return (0, parseUtil_js_1.isValid)(result)\n                    ? {\n                        value: result.value,\n                    }\n                    : {\n                        issues: ctx.common.issues,\n                    };\n            }\n            catch (err) {\n                if (err?.message?.toLowerCase()?.includes(\"encountered\")) {\n                    this[\"~standard\"].async = true;\n                }\n                ctx.common = {\n                    issues: [],\n                    async: true,\n                };\n            }\n        }\n        return this._parseAsync({ data, path: [], parent: ctx }).then((result) => (0, parseUtil_js_1.isValid)(result)\n            ? {\n                value: result.value,\n            }\n            : {\n                issues: ctx.common.issues,\n            });\n    }\n    async parseAsync(data, params) {\n        const result = await this.safeParseAsync(data, params);\n        if (result.success)\n            return result.data;\n        throw result.error;\n    }\n    async safeParseAsync(data, params) {\n        const ctx = {\n            common: {\n                issues: [],\n                contextualErrorMap: params?.errorMap,\n                async: true,\n            },\n            path: params?.path || [],\n            schemaErrorMap: this._def.errorMap,\n            parent: null,\n            data,\n            parsedType: (0, util_js_1.getParsedType)(data),\n        };\n        const maybeAsyncResult = this._parse({ data, path: ctx.path, parent: ctx });\n        const result = await ((0, parseUtil_js_1.isAsync)(maybeAsyncResult) ? maybeAsyncResult : Promise.resolve(maybeAsyncResult));\n        return handleResult(ctx, result);\n    }\n    refine(check, message) {\n        const getIssueProperties = (val) => {\n            if (typeof message === \"string\" || typeof message === \"undefined\") {\n                return { message };\n            }\n            else if (typeof message === \"function\") {\n                return message(val);\n            }\n            else {\n                return message;\n            }\n        };\n        return this._refinement((val, ctx) => {\n            const result = check(val);\n            const setError = () => ctx.addIssue({\n                code: ZodError_js_1.ZodIssueCode.custom,\n                ...getIssueProperties(val),\n            });\n            if (typeof Promise !== \"undefined\" && result instanceof Promise) {\n                return result.then((data) => {\n                    if (!data) {\n                        setError();\n                        return false;\n                    }\n                    else {\n                        return true;\n                    }\n                });\n            }\n            if (!result) {\n                setError();\n                return false;\n            }\n            else {\n                return true;\n            }\n        });\n    }\n    refinement(check, refinementData) {\n        return this._refinement((val, ctx) => {\n            if (!check(val)) {\n                ctx.addIssue(typeof refinementData === \"function\" ? refinementData(val, ctx) : refinementData);\n                return false;\n            }\n            else {\n                return true;\n            }\n        });\n    }\n    _refinement(refinement) {\n        return new ZodEffects({\n            schema: this,\n            typeName: ZodFirstPartyTypeKind.ZodEffects,\n            effect: { type: \"refinement\", refinement },\n        });\n    }\n    superRefine(refinement) {\n        return this._refinement(refinement);\n    }\n    constructor(def) {\n        /** Alias of safeParseAsync */\n        this.spa = this.safeParseAsync;\n        this._def = def;\n        this.parse = this.parse.bind(this);\n        this.safeParse = this.safeParse.bind(this);\n        this.parseAsync = this.parseAsync.bind(this);\n        this.safeParseAsync = this.safeParseAsync.bind(this);\n        this.spa = this.spa.bind(this);\n        this.refine = this.refine.bind(this);\n        this.refinement = this.refinement.bind(this);\n        this.superRefine = this.superRefine.bind(this);\n        this.optional = this.optional.bind(this);\n        this.nullable = this.nullable.bind(this);\n        this.nullish = this.nullish.bind(this);\n        this.array = this.array.bind(this);\n        this.promise = this.promise.bind(this);\n        this.or = this.or.bind(this);\n        this.and = this.and.bind(this);\n        this.transform = this.transform.bind(this);\n        this.brand = this.brand.bind(this);\n        this.default = this.default.bind(this);\n        this.catch = this.catch.bind(this);\n        this.describe = this.describe.bind(this);\n        this.pipe = this.pipe.bind(this);\n        this.readonly = this.readonly.bind(this);\n        this.isNullable = this.isNullable.bind(this);\n        this.isOptional = this.isOptional.bind(this);\n        this[\"~standard\"] = {\n            version: 1,\n            vendor: \"zod\",\n            validate: (data) => this[\"~validate\"](data),\n        };\n    }\n    optional() {\n        return ZodOptional.create(this, this._def);\n    }\n    nullable() {\n        return ZodNullable.create(this, this._def);\n    }\n    nullish() {\n        return this.nullable().optional();\n    }\n    array() {\n        return ZodArray.create(this);\n    }\n    promise() {\n        return ZodPromise.create(this, this._def);\n    }\n    or(option) {\n        return ZodUnion.create([this, option], this._def);\n    }\n    and(incoming) {\n        return ZodIntersection.create(this, incoming, this._def);\n    }\n    transform(transform) {\n        return new ZodEffects({\n            ...processCreateParams(this._def),\n            schema: this,\n            typeName: ZodFirstPartyTypeKind.ZodEffects,\n            effect: { type: \"transform\", transform },\n        });\n    }\n    default(def) {\n        const defaultValueFunc = typeof def === \"function\" ? def : () => def;\n        return new ZodDefault({\n            ...processCreateParams(this._def),\n            innerType: this,\n            defaultValue: defaultValueFunc,\n            typeName: ZodFirstPartyTypeKind.ZodDefault,\n        });\n    }\n    brand() {\n        return new ZodBranded({\n            typeName: ZodFirstPartyTypeKind.ZodBranded,\n            type: this,\n            ...processCreateParams(this._def),\n        });\n    }\n    catch(def) {\n        const catchValueFunc = typeof def === \"function\" ? def : () => def;\n        return new ZodCatch({\n            ...processCreateParams(this._def),\n            innerType: this,\n            catchValue: catchValueFunc,\n            typeName: ZodFirstPartyTypeKind.ZodCatch,\n        });\n    }\n    describe(description) {\n        const This = this.constructor;\n        return new This({\n            ...this._def,\n            description,\n        });\n    }\n    pipe(target) {\n        return ZodPipeline.create(this, target);\n    }\n    readonly() {\n        return ZodReadonly.create(this);\n    }\n    isOptional() {\n        return this.safeParse(undefined).success;\n    }\n    isNullable() {\n        return this.safeParse(null).success;\n    }\n}\nexports.ZodType = ZodType;\nexports.Schema = ZodType;\nexports.ZodSchema = ZodType;\nconst cuidRegex = /^c[^\\s-]{8,}$/i;\nconst cuid2Regex = /^[0-9a-z]+$/;\nconst ulidRegex = /^[0-9A-HJKMNP-TV-Z]{26}$/i;\n// const uuidRegex =\n//   /^([a-f0-9]{8}-[a-f0-9]{4}-[1-5][a-f0-9]{3}-[a-f0-9]{4}-[a-f0-9]{12}|00000000-0000-0000-0000-000000000000)$/i;\nconst uuidRegex = /^[0-9a-fA-F]{8}\\b-[0-9a-fA-F]{4}\\b-[0-9a-fA-F]{4}\\b-[0-9a-fA-F]{4}\\b-[0-9a-fA-F]{12}$/i;\nconst nanoidRegex = /^[a-z0-9_-]{21}$/i;\nconst jwtRegex = /^[A-Za-z0-9-_]+\\.[A-Za-z0-9-_]+\\.[A-Za-z0-9-_]*$/;\nconst durationRegex = /^[-+]?P(?!$)(?:(?:[-+]?\\d+Y)|(?:[-+]?\\d+[.,]\\d+Y$))?(?:(?:[-+]?\\d+M)|(?:[-+]?\\d+[.,]\\d+M$))?(?:(?:[-+]?\\d+W)|(?:[-+]?\\d+[.,]\\d+W$))?(?:(?:[-+]?\\d+D)|(?:[-+]?\\d+[.,]\\d+D$))?(?:T(?=[\\d+-])(?:(?:[-+]?\\d+H)|(?:[-+]?\\d+[.,]\\d+H$))?(?:(?:[-+]?\\d+M)|(?:[-+]?\\d+[.,]\\d+M$))?(?:[-+]?\\d+(?:[.,]\\d+)?S)?)??$/;\n// from https://stackoverflow.com/a/46181/1550155\n// old version: too slow, didn't support unicode\n// const emailRegex = /^((([a-z]|\\d|[!#\\$%&'\\*\\+\\-\\/=\\?\\^_`{\\|}~]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])+(\\.([a-z]|\\d|[!#\\$%&'\\*\\+\\-\\/=\\?\\^_`{\\|}~]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])+)*)|((\\x22)((((\\x20|\\x09)*(\\x0d\\x0a))?(\\x20|\\x09)+)?(([\\x01-\\x08\\x0b\\x0c\\x0e-\\x1f\\x7f]|\\x21|[\\x23-\\x5b]|[\\x5d-\\x7e]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])|(\\\\([\\x01-\\x09\\x0b\\x0c\\x0d-\\x7f]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]))))*(((\\x20|\\x09)*(\\x0d\\x0a))?(\\x20|\\x09)+)?(\\x22)))@((([a-z]|\\d|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])|(([a-z]|\\d|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]|\\d|-|\\.|_|~|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])*([a-z]|\\d|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])))\\.)+(([a-z]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])|(([a-z]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]|\\d|-|\\.|_|~|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])*([a-z]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])))$/i;\n//old email regex\n// const emailRegex = /^(([^<>()[\\].,;:\\s@\"]+(\\.[^<>()[\\].,;:\\s@\"]+)*)|(\".+\"))@((?!-)([^<>()[\\].,;:\\s@\"]+\\.)+[^<>()[\\].,;:\\s@\"]{1,})[^-<>()[\\].,;:\\s@\"]$/i;\n// eslint-disable-next-line\n// const emailRegex =\n//   /^(([^<>()[\\]\\\\.,;:\\s@\\\"]+(\\.[^<>()[\\]\\\\.,;:\\s@\\\"]+)*)|(\\\".+\\\"))@((\\[(((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\\.){3}((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\\])|(\\[IPv6:(([a-f0-9]{1,4}:){7}|::([a-f0-9]{1,4}:){0,6}|([a-f0-9]{1,4}:){1}:([a-f0-9]{1,4}:){0,5}|([a-f0-9]{1,4}:){2}:([a-f0-9]{1,4}:){0,4}|([a-f0-9]{1,4}:){3}:([a-f0-9]{1,4}:){0,3}|([a-f0-9]{1,4}:){4}:([a-f0-9]{1,4}:){0,2}|([a-f0-9]{1,4}:){5}:([a-f0-9]{1,4}:){0,1})([a-f0-9]{1,4}|(((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\\.){3}((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2})))\\])|([A-Za-z0-9]([A-Za-z0-9-]*[A-Za-z0-9])*(\\.[A-Za-z]{2,})+))$/;\n// const emailRegex =\n//   /^[a-zA-Z0-9\\.\\!\\#\\$\\%\\&\\'\\*\\+\\/\\=\\?\\^\\_\\`\\{\\|\\}\\~\\-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*$/;\n// const emailRegex =\n//   /^(?:[a-z0-9!#$%&'*+/=?^_`{|}~-]+(?:\\.[a-z0-9!#$%&'*+/=?^_`{|}~-]+)*|\"(?:[\\x01-\\x08\\x0b\\x0c\\x0e-\\x1f\\x21\\x23-\\x5b\\x5d-\\x7f]|\\\\[\\x01-\\x09\\x0b\\x0c\\x0e-\\x7f])*\")@(?:(?:[a-z0-9](?:[a-z0-9-]*[a-z0-9])?\\.)+[a-z0-9](?:[a-z0-9-]*[a-z0-9])?|\\[(?:(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\\.){3}(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?|[a-z0-9-]*[a-z0-9]:(?:[\\x01-\\x08\\x0b\\x0c\\x0e-\\x1f\\x21-\\x5a\\x53-\\x7f]|\\\\[\\x01-\\x09\\x0b\\x0c\\x0e-\\x7f])+)\\])$/i;\nconst emailRegex = /^(?!\\.)(?!.*\\.\\.)([A-Z0-9_'+\\-\\.]*)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\\-]*\\.)+[A-Z]{2,}$/i;\n// const emailRegex =\n//   /^[a-z0-9.!#$%&’*+/=?^_`{|}~-]+@[a-z0-9-]+(?:\\.[a-z0-9\\-]+)*$/i;\n// from https://thekevinscott.com/emojis-in-javascript/#writing-a-regular-expression\nconst _emojiRegex = `^(\\\\p{Extended_Pictographic}|\\\\p{Emoji_Component})+$`;\nlet emojiRegex;\n// faster, simpler, safer\nconst ipv4Regex = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])$/;\nconst ipv4CidrRegex = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\\/(3[0-2]|[12]?[0-9])$/;\n// const ipv6Regex =\n// /^(([a-f0-9]{1,4}:){7}|::([a-f0-9]{1,4}:){0,6}|([a-f0-9]{1,4}:){1}:([a-f0-9]{1,4}:){0,5}|([a-f0-9]{1,4}:){2}:([a-f0-9]{1,4}:){0,4}|([a-f0-9]{1,4}:){3}:([a-f0-9]{1,4}:){0,3}|([a-f0-9]{1,4}:){4}:([a-f0-9]{1,4}:){0,2}|([a-f0-9]{1,4}:){5}:([a-f0-9]{1,4}:){0,1})([a-f0-9]{1,4}|(((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\\.){3}((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2})))$/;\nconst ipv6Regex = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))$/;\nconst ipv6CidrRegex = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))\\/(12[0-8]|1[01][0-9]|[1-9]?[0-9])$/;\n// https://stackoverflow.com/questions/7860392/determine-if-string-is-in-base64-using-javascript\nconst base64Regex = /^([0-9a-zA-Z+/]{4})*(([0-9a-zA-Z+/]{2}==)|([0-9a-zA-Z+/]{3}=))?$/;\n// https://base64.guru/standards/base64url\nconst base64urlRegex = /^([0-9a-zA-Z-_]{4})*(([0-9a-zA-Z-_]{2}(==)?)|([0-9a-zA-Z-_]{3}(=)?))?$/;\n// simple\n// const dateRegexSource = `\\\\d{4}-\\\\d{2}-\\\\d{2}`;\n// no leap year validation\n// const dateRegexSource = `\\\\d{4}-((0[13578]|10|12)-31|(0[13-9]|1[0-2])-30|(0[1-9]|1[0-2])-(0[1-9]|1\\\\d|2\\\\d))`;\n// with leap year validation\nconst dateRegexSource = `((\\\\d\\\\d[2468][048]|\\\\d\\\\d[13579][26]|\\\\d\\\\d0[48]|[02468][048]00|[13579][26]00)-02-29|\\\\d{4}-((0[13578]|1[02])-(0[1-9]|[12]\\\\d|3[01])|(0[469]|11)-(0[1-9]|[12]\\\\d|30)|(02)-(0[1-9]|1\\\\d|2[0-8])))`;\nconst dateRegex = new RegExp(`^${dateRegexSource}$`);\nfunction timeRegexSource(args) {\n    let secondsRegexSource = `[0-5]\\\\d`;\n    if (args.precision) {\n        secondsRegexSource = `${secondsRegexSource}\\\\.\\\\d{${args.precision}}`;\n    }\n    else if (args.precision == null) {\n        secondsRegexSource = `${secondsRegexSource}(\\\\.\\\\d+)?`;\n    }\n    const secondsQuantifier = args.precision ? \"+\" : \"?\"; // require seconds if precision is nonzero\n    return `([01]\\\\d|2[0-3]):[0-5]\\\\d(:${secondsRegexSource})${secondsQuantifier}`;\n}\nfunction timeRegex(args) {\n    return new RegExp(`^${timeRegexSource(args)}$`);\n}\n// Adapted from https://stackoverflow.com/a/3143231\nfunction datetimeRegex(args) {\n    let regex = `${dateRegexSource}T${timeRegexSource(args)}`;\n    const opts = [];\n    opts.push(args.local ? `Z?` : `Z`);\n    if (args.offset)\n        opts.push(`([+-]\\\\d{2}:?\\\\d{2})`);\n    regex = `${regex}(${opts.join(\"|\")})`;\n    return new RegExp(`^${regex}$`);\n}\nfunction isValidIP(ip, version) {\n    if ((version === \"v4\" || !version) && ipv4Regex.test(ip)) {\n        return true;\n    }\n    if ((version === \"v6\" || !version) && ipv6Regex.test(ip)) {\n        return true;\n    }\n    return false;\n}\nfunction isValidJWT(jwt, alg) {\n    if (!jwtRegex.test(jwt))\n        return false;\n    try {\n        const [header] = jwt.split(\".\");\n        if (!header)\n            return false;\n        // Convert base64url to base64\n        const base64 = header\n            .replace(/-/g, \"+\")\n            .replace(/_/g, \"/\")\n            .padEnd(header.length + ((4 - (header.length % 4)) % 4), \"=\");\n        const decoded = JSON.parse(atob(base64));\n        if (typeof decoded !== \"object\" || decoded === null)\n            return false;\n        if (\"typ\" in decoded && decoded?.typ !== \"JWT\")\n            return false;\n        if (!decoded.alg)\n            return false;\n        if (alg && decoded.alg !== alg)\n            return false;\n        return true;\n    }\n    catch {\n        return false;\n    }\n}\nfunction isValidCidr(ip, version) {\n    if ((version === \"v4\" || !version) && ipv4CidrRegex.test(ip)) {\n        return true;\n    }\n    if ((version === \"v6\" || !version) && ipv6CidrRegex.test(ip)) {\n        return true;\n    }\n    return false;\n}\nclass ZodString extends ZodType {\n    _parse(input) {\n        if (this._def.coerce) {\n            input.data = String(input.data);\n        }\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.string) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.string,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        const status = new parseUtil_js_1.ParseStatus();\n        let ctx = undefined;\n        for (const check of this._def.checks) {\n            if (check.kind === \"min\") {\n                if (input.data.length < check.value) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.too_small,\n                        minimum: check.value,\n                        type: \"string\",\n                        inclusive: true,\n                        exact: false,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"max\") {\n                if (input.data.length > check.value) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.too_big,\n                        maximum: check.value,\n                        type: \"string\",\n                        inclusive: true,\n                        exact: false,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"length\") {\n                const tooBig = input.data.length > check.value;\n                const tooSmall = input.data.length < check.value;\n                if (tooBig || tooSmall) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    if (tooBig) {\n                        (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                            code: ZodError_js_1.ZodIssueCode.too_big,\n                            maximum: check.value,\n                            type: \"string\",\n                            inclusive: true,\n                            exact: true,\n                            message: check.message,\n                        });\n                    }\n                    else if (tooSmall) {\n                        (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                            code: ZodError_js_1.ZodIssueCode.too_small,\n                            minimum: check.value,\n                            type: \"string\",\n                            inclusive: true,\n                            exact: true,\n                            message: check.message,\n                        });\n                    }\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"email\") {\n                if (!emailRegex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"email\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"emoji\") {\n                if (!emojiRegex) {\n                    emojiRegex = new RegExp(_emojiRegex, \"u\");\n                }\n                if (!emojiRegex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"emoji\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"uuid\") {\n                if (!uuidRegex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"uuid\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"nanoid\") {\n                if (!nanoidRegex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"nanoid\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"cuid\") {\n                if (!cuidRegex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"cuid\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"cuid2\") {\n                if (!cuid2Regex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"cuid2\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"ulid\") {\n                if (!ulidRegex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"ulid\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"url\") {\n                try {\n                    new URL(input.data);\n                }\n                catch {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"url\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"regex\") {\n                check.regex.lastIndex = 0;\n                const testResult = check.regex.test(input.data);\n                if (!testResult) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"regex\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"trim\") {\n                input.data = input.data.trim();\n            }\n            else if (check.kind === \"includes\") {\n                if (!input.data.includes(check.value, check.position)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        validation: { includes: check.value, position: check.position },\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"toLowerCase\") {\n                input.data = input.data.toLowerCase();\n            }\n            else if (check.kind === \"toUpperCase\") {\n                input.data = input.data.toUpperCase();\n            }\n            else if (check.kind === \"startsWith\") {\n                if (!input.data.startsWith(check.value)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        validation: { startsWith: check.value },\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"endsWith\") {\n                if (!input.data.endsWith(check.value)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        validation: { endsWith: check.value },\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"datetime\") {\n                const regex = datetimeRegex(check);\n                if (!regex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        validation: \"datetime\",\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"date\") {\n                const regex = dateRegex;\n                if (!regex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        validation: \"date\",\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"time\") {\n                const regex = timeRegex(check);\n                if (!regex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        validation: \"time\",\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"duration\") {\n                if (!durationRegex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"duration\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"ip\") {\n                if (!isValidIP(input.data, check.version)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"ip\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"jwt\") {\n                if (!isValidJWT(input.data, check.alg)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"jwt\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"cidr\") {\n                if (!isValidCidr(input.data, check.version)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"cidr\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"base64\") {\n                if (!base64Regex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"base64\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"base64url\") {\n                if (!base64urlRegex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        validation: \"base64url\",\n                        code: ZodError_js_1.ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else {\n                util_js_1.util.assertNever(check);\n            }\n        }\n        return { status: status.value, value: input.data };\n    }\n    _regex(regex, validation, message) {\n        return this.refinement((data) => regex.test(data), {\n            validation,\n            code: ZodError_js_1.ZodIssueCode.invalid_string,\n            ...errorUtil_js_1.errorUtil.errToObj(message),\n        });\n    }\n    _addCheck(check) {\n        return new ZodString({\n            ...this._def,\n            checks: [...this._def.checks, check],\n        });\n    }\n    email(message) {\n        return this._addCheck({ kind: \"email\", ...errorUtil_js_1.errorUtil.errToObj(message) });\n    }\n    url(message) {\n        return this._addCheck({ kind: \"url\", ...errorUtil_js_1.errorUtil.errToObj(message) });\n    }\n    emoji(message) {\n        return this._addCheck({ kind: \"emoji\", ...errorUtil_js_1.errorUtil.errToObj(message) });\n    }\n    uuid(message) {\n        return this._addCheck({ kind: \"uuid\", ...errorUtil_js_1.errorUtil.errToObj(message) });\n    }\n    nanoid(message) {\n        return this._addCheck({ kind: \"nanoid\", ...errorUtil_js_1.errorUtil.errToObj(message) });\n    }\n    cuid(message) {\n        return this._addCheck({ kind: \"cuid\", ...errorUtil_js_1.errorUtil.errToObj(message) });\n    }\n    cuid2(message) {\n        return this._addCheck({ kind: \"cuid2\", ...errorUtil_js_1.errorUtil.errToObj(message) });\n    }\n    ulid(message) {\n        return this._addCheck({ kind: \"ulid\", ...errorUtil_js_1.errorUtil.errToObj(message) });\n    }\n    base64(message) {\n        return this._addCheck({ kind: \"base64\", ...errorUtil_js_1.errorUtil.errToObj(message) });\n    }\n    base64url(message) {\n        // base64url encoding is a modification of base64 that can safely be used in URLs and filenames\n        return this._addCheck({\n            kind: \"base64url\",\n            ...errorUtil_js_1.errorUtil.errToObj(message),\n        });\n    }\n    jwt(options) {\n        return this._addCheck({ kind: \"jwt\", ...errorUtil_js_1.errorUtil.errToObj(options) });\n    }\n    ip(options) {\n        return this._addCheck({ kind: \"ip\", ...errorUtil_js_1.errorUtil.errToObj(options) });\n    }\n    cidr(options) {\n        return this._addCheck({ kind: \"cidr\", ...errorUtil_js_1.errorUtil.errToObj(options) });\n    }\n    datetime(options) {\n        if (typeof options === \"string\") {\n            return this._addCheck({\n                kind: \"datetime\",\n                precision: null,\n                offset: false,\n                local: false,\n                message: options,\n            });\n        }\n        return this._addCheck({\n            kind: \"datetime\",\n            precision: typeof options?.precision === \"undefined\" ? null : options?.precision,\n            offset: options?.offset ?? false,\n            local: options?.local ?? false,\n            ...errorUtil_js_1.errorUtil.errToObj(options?.message),\n        });\n    }\n    date(message) {\n        return this._addCheck({ kind: \"date\", message });\n    }\n    time(options) {\n        if (typeof options === \"string\") {\n            return this._addCheck({\n                kind: \"time\",\n                precision: null,\n                message: options,\n            });\n        }\n        return this._addCheck({\n            kind: \"time\",\n            precision: typeof options?.precision === \"undefined\" ? null : options?.precision,\n            ...errorUtil_js_1.errorUtil.errToObj(options?.message),\n        });\n    }\n    duration(message) {\n        return this._addCheck({ kind: \"duration\", ...errorUtil_js_1.errorUtil.errToObj(message) });\n    }\n    regex(regex, message) {\n        return this._addCheck({\n            kind: \"regex\",\n            regex: regex,\n            ...errorUtil_js_1.errorUtil.errToObj(message),\n        });\n    }\n    includes(value, options) {\n        return this._addCheck({\n            kind: \"includes\",\n            value: value,\n            position: options?.position,\n            ...errorUtil_js_1.errorUtil.errToObj(options?.message),\n        });\n    }\n    startsWith(value, message) {\n        return this._addCheck({\n            kind: \"startsWith\",\n            value: value,\n            ...errorUtil_js_1.errorUtil.errToObj(message),\n        });\n    }\n    endsWith(value, message) {\n        return this._addCheck({\n            kind: \"endsWith\",\n            value: value,\n            ...errorUtil_js_1.errorUtil.errToObj(message),\n        });\n    }\n    min(minLength, message) {\n        return this._addCheck({\n            kind: \"min\",\n            value: minLength,\n            ...errorUtil_js_1.errorUtil.errToObj(message),\n        });\n    }\n    max(maxLength, message) {\n        return this._addCheck({\n            kind: \"max\",\n            value: maxLength,\n            ...errorUtil_js_1.errorUtil.errToObj(message),\n        });\n    }\n    length(len, message) {\n        return this._addCheck({\n            kind: \"length\",\n            value: len,\n            ...errorUtil_js_1.errorUtil.errToObj(message),\n        });\n    }\n    /**\n     * Equivalent to `.min(1)`\n     */\n    nonempty(message) {\n        return this.min(1, errorUtil_js_1.errorUtil.errToObj(message));\n    }\n    trim() {\n        return new ZodString({\n            ...this._def,\n            checks: [...this._def.checks, { kind: \"trim\" }],\n        });\n    }\n    toLowerCase() {\n        return new ZodString({\n            ...this._def,\n            checks: [...this._def.checks, { kind: \"toLowerCase\" }],\n        });\n    }\n    toUpperCase() {\n        return new ZodString({\n            ...this._def,\n            checks: [...this._def.checks, { kind: \"toUpperCase\" }],\n        });\n    }\n    get isDatetime() {\n        return !!this._def.checks.find((ch) => ch.kind === \"datetime\");\n    }\n    get isDate() {\n        return !!this._def.checks.find((ch) => ch.kind === \"date\");\n    }\n    get isTime() {\n        return !!this._def.checks.find((ch) => ch.kind === \"time\");\n    }\n    get isDuration() {\n        return !!this._def.checks.find((ch) => ch.kind === \"duration\");\n    }\n    get isEmail() {\n        return !!this._def.checks.find((ch) => ch.kind === \"email\");\n    }\n    get isURL() {\n        return !!this._def.checks.find((ch) => ch.kind === \"url\");\n    }\n    get isEmoji() {\n        return !!this._def.checks.find((ch) => ch.kind === \"emoji\");\n    }\n    get isUUID() {\n        return !!this._def.checks.find((ch) => ch.kind === \"uuid\");\n    }\n    get isNANOID() {\n        return !!this._def.checks.find((ch) => ch.kind === \"nanoid\");\n    }\n    get isCUID() {\n        return !!this._def.checks.find((ch) => ch.kind === \"cuid\");\n    }\n    get isCUID2() {\n        return !!this._def.checks.find((ch) => ch.kind === \"cuid2\");\n    }\n    get isULID() {\n        return !!this._def.checks.find((ch) => ch.kind === \"ulid\");\n    }\n    get isIP() {\n        return !!this._def.checks.find((ch) => ch.kind === \"ip\");\n    }\n    get isCIDR() {\n        return !!this._def.checks.find((ch) => ch.kind === \"cidr\");\n    }\n    get isBase64() {\n        return !!this._def.checks.find((ch) => ch.kind === \"base64\");\n    }\n    get isBase64url() {\n        // base64url encoding is a modification of base64 that can safely be used in URLs and filenames\n        return !!this._def.checks.find((ch) => ch.kind === \"base64url\");\n    }\n    get minLength() {\n        let min = null;\n        for (const ch of this._def.checks) {\n            if (ch.kind === \"min\") {\n                if (min === null || ch.value > min)\n                    min = ch.value;\n            }\n        }\n        return min;\n    }\n    get maxLength() {\n        let max = null;\n        for (const ch of this._def.checks) {\n            if (ch.kind === \"max\") {\n                if (max === null || ch.value < max)\n                    max = ch.value;\n            }\n        }\n        return max;\n    }\n}\nexports.ZodString = ZodString;\nZodString.create = (params) => {\n    return new ZodString({\n        checks: [],\n        typeName: ZodFirstPartyTypeKind.ZodString,\n        coerce: params?.coerce ?? false,\n        ...processCreateParams(params),\n    });\n};\n// https://stackoverflow.com/questions/3966484/why-does-modulus-operator-return-fractional-number-in-javascript/31711034#31711034\nfunction floatSafeRemainder(val, step) {\n    const valDecCount = (val.toString().split(\".\")[1] || \"\").length;\n    const stepDecCount = (step.toString().split(\".\")[1] || \"\").length;\n    const decCount = valDecCount > stepDecCount ? valDecCount : stepDecCount;\n    const valInt = Number.parseInt(val.toFixed(decCount).replace(\".\", \"\"));\n    const stepInt = Number.parseInt(step.toFixed(decCount).replace(\".\", \"\"));\n    return (valInt % stepInt) / 10 ** decCount;\n}\nclass ZodNumber extends ZodType {\n    constructor() {\n        super(...arguments);\n        this.min = this.gte;\n        this.max = this.lte;\n        this.step = this.multipleOf;\n    }\n    _parse(input) {\n        if (this._def.coerce) {\n            input.data = Number(input.data);\n        }\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.number) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.number,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        let ctx = undefined;\n        const status = new parseUtil_js_1.ParseStatus();\n        for (const check of this._def.checks) {\n            if (check.kind === \"int\") {\n                if (!util_js_1.util.isInteger(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.invalid_type,\n                        expected: \"integer\",\n                        received: \"float\",\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"min\") {\n                const tooSmall = check.inclusive ? input.data < check.value : input.data <= check.value;\n                if (tooSmall) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.too_small,\n                        minimum: check.value,\n                        type: \"number\",\n                        inclusive: check.inclusive,\n                        exact: false,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"max\") {\n                const tooBig = check.inclusive ? input.data > check.value : input.data >= check.value;\n                if (tooBig) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.too_big,\n                        maximum: check.value,\n                        type: \"number\",\n                        inclusive: check.inclusive,\n                        exact: false,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"multipleOf\") {\n                if (floatSafeRemainder(input.data, check.value) !== 0) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.not_multiple_of,\n                        multipleOf: check.value,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"finite\") {\n                if (!Number.isFinite(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.not_finite,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else {\n                util_js_1.util.assertNever(check);\n            }\n        }\n        return { status: status.value, value: input.data };\n    }\n    gte(value, message) {\n        return this.setLimit(\"min\", value, true, errorUtil_js_1.errorUtil.toString(message));\n    }\n    gt(value, message) {\n        return this.setLimit(\"min\", value, false, errorUtil_js_1.errorUtil.toString(message));\n    }\n    lte(value, message) {\n        return this.setLimit(\"max\", value, true, errorUtil_js_1.errorUtil.toString(message));\n    }\n    lt(value, message) {\n        return this.setLimit(\"max\", value, false, errorUtil_js_1.errorUtil.toString(message));\n    }\n    setLimit(kind, value, inclusive, message) {\n        return new ZodNumber({\n            ...this._def,\n            checks: [\n                ...this._def.checks,\n                {\n                    kind,\n                    value,\n                    inclusive,\n                    message: errorUtil_js_1.errorUtil.toString(message),\n                },\n            ],\n        });\n    }\n    _addCheck(check) {\n        return new ZodNumber({\n            ...this._def,\n            checks: [...this._def.checks, check],\n        });\n    }\n    int(message) {\n        return this._addCheck({\n            kind: \"int\",\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    positive(message) {\n        return this._addCheck({\n            kind: \"min\",\n            value: 0,\n            inclusive: false,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    negative(message) {\n        return this._addCheck({\n            kind: \"max\",\n            value: 0,\n            inclusive: false,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    nonpositive(message) {\n        return this._addCheck({\n            kind: \"max\",\n            value: 0,\n            inclusive: true,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    nonnegative(message) {\n        return this._addCheck({\n            kind: \"min\",\n            value: 0,\n            inclusive: true,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    multipleOf(value, message) {\n        return this._addCheck({\n            kind: \"multipleOf\",\n            value: value,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    finite(message) {\n        return this._addCheck({\n            kind: \"finite\",\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    safe(message) {\n        return this._addCheck({\n            kind: \"min\",\n            inclusive: true,\n            value: Number.MIN_SAFE_INTEGER,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        })._addCheck({\n            kind: \"max\",\n            inclusive: true,\n            value: Number.MAX_SAFE_INTEGER,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    get minValue() {\n        let min = null;\n        for (const ch of this._def.checks) {\n            if (ch.kind === \"min\") {\n                if (min === null || ch.value > min)\n                    min = ch.value;\n            }\n        }\n        return min;\n    }\n    get maxValue() {\n        let max = null;\n        for (const ch of this._def.checks) {\n            if (ch.kind === \"max\") {\n                if (max === null || ch.value < max)\n                    max = ch.value;\n            }\n        }\n        return max;\n    }\n    get isInt() {\n        return !!this._def.checks.find((ch) => ch.kind === \"int\" || (ch.kind === \"multipleOf\" && util_js_1.util.isInteger(ch.value)));\n    }\n    get isFinite() {\n        let max = null;\n        let min = null;\n        for (const ch of this._def.checks) {\n            if (ch.kind === \"finite\" || ch.kind === \"int\" || ch.kind === \"multipleOf\") {\n                return true;\n            }\n            else if (ch.kind === \"min\") {\n                if (min === null || ch.value > min)\n                    min = ch.value;\n            }\n            else if (ch.kind === \"max\") {\n                if (max === null || ch.value < max)\n                    max = ch.value;\n            }\n        }\n        return Number.isFinite(min) && Number.isFinite(max);\n    }\n}\nexports.ZodNumber = ZodNumber;\nZodNumber.create = (params) => {\n    return new ZodNumber({\n        checks: [],\n        typeName: ZodFirstPartyTypeKind.ZodNumber,\n        coerce: params?.coerce || false,\n        ...processCreateParams(params),\n    });\n};\nclass ZodBigInt extends ZodType {\n    constructor() {\n        super(...arguments);\n        this.min = this.gte;\n        this.max = this.lte;\n    }\n    _parse(input) {\n        if (this._def.coerce) {\n            try {\n                input.data = BigInt(input.data);\n            }\n            catch {\n                return this._getInvalidInput(input);\n            }\n        }\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.bigint) {\n            return this._getInvalidInput(input);\n        }\n        let ctx = undefined;\n        const status = new parseUtil_js_1.ParseStatus();\n        for (const check of this._def.checks) {\n            if (check.kind === \"min\") {\n                const tooSmall = check.inclusive ? input.data < check.value : input.data <= check.value;\n                if (tooSmall) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.too_small,\n                        type: \"bigint\",\n                        minimum: check.value,\n                        inclusive: check.inclusive,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"max\") {\n                const tooBig = check.inclusive ? input.data > check.value : input.data >= check.value;\n                if (tooBig) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.too_big,\n                        type: \"bigint\",\n                        maximum: check.value,\n                        inclusive: check.inclusive,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"multipleOf\") {\n                if (input.data % check.value !== BigInt(0)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.not_multiple_of,\n                        multipleOf: check.value,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else {\n                util_js_1.util.assertNever(check);\n            }\n        }\n        return { status: status.value, value: input.data };\n    }\n    _getInvalidInput(input) {\n        const ctx = this._getOrReturnCtx(input);\n        (0, parseUtil_js_1.addIssueToContext)(ctx, {\n            code: ZodError_js_1.ZodIssueCode.invalid_type,\n            expected: util_js_1.ZodParsedType.bigint,\n            received: ctx.parsedType,\n        });\n        return parseUtil_js_1.INVALID;\n    }\n    gte(value, message) {\n        return this.setLimit(\"min\", value, true, errorUtil_js_1.errorUtil.toString(message));\n    }\n    gt(value, message) {\n        return this.setLimit(\"min\", value, false, errorUtil_js_1.errorUtil.toString(message));\n    }\n    lte(value, message) {\n        return this.setLimit(\"max\", value, true, errorUtil_js_1.errorUtil.toString(message));\n    }\n    lt(value, message) {\n        return this.setLimit(\"max\", value, false, errorUtil_js_1.errorUtil.toString(message));\n    }\n    setLimit(kind, value, inclusive, message) {\n        return new ZodBigInt({\n            ...this._def,\n            checks: [\n                ...this._def.checks,\n                {\n                    kind,\n                    value,\n                    inclusive,\n                    message: errorUtil_js_1.errorUtil.toString(message),\n                },\n            ],\n        });\n    }\n    _addCheck(check) {\n        return new ZodBigInt({\n            ...this._def,\n            checks: [...this._def.checks, check],\n        });\n    }\n    positive(message) {\n        return this._addCheck({\n            kind: \"min\",\n            value: BigInt(0),\n            inclusive: false,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    negative(message) {\n        return this._addCheck({\n            kind: \"max\",\n            value: BigInt(0),\n            inclusive: false,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    nonpositive(message) {\n        return this._addCheck({\n            kind: \"max\",\n            value: BigInt(0),\n            inclusive: true,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    nonnegative(message) {\n        return this._addCheck({\n            kind: \"min\",\n            value: BigInt(0),\n            inclusive: true,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    multipleOf(value, message) {\n        return this._addCheck({\n            kind: \"multipleOf\",\n            value,\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    get minValue() {\n        let min = null;\n        for (const ch of this._def.checks) {\n            if (ch.kind === \"min\") {\n                if (min === null || ch.value > min)\n                    min = ch.value;\n            }\n        }\n        return min;\n    }\n    get maxValue() {\n        let max = null;\n        for (const ch of this._def.checks) {\n            if (ch.kind === \"max\") {\n                if (max === null || ch.value < max)\n                    max = ch.value;\n            }\n        }\n        return max;\n    }\n}\nexports.ZodBigInt = ZodBigInt;\nZodBigInt.create = (params) => {\n    return new ZodBigInt({\n        checks: [],\n        typeName: ZodFirstPartyTypeKind.ZodBigInt,\n        coerce: params?.coerce ?? false,\n        ...processCreateParams(params),\n    });\n};\nclass ZodBoolean extends ZodType {\n    _parse(input) {\n        if (this._def.coerce) {\n            input.data = Boolean(input.data);\n        }\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.boolean) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.boolean,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        return (0, parseUtil_js_1.OK)(input.data);\n    }\n}\nexports.ZodBoolean = ZodBoolean;\nZodBoolean.create = (params) => {\n    return new ZodBoolean({\n        typeName: ZodFirstPartyTypeKind.ZodBoolean,\n        coerce: params?.coerce || false,\n        ...processCreateParams(params),\n    });\n};\nclass ZodDate extends ZodType {\n    _parse(input) {\n        if (this._def.coerce) {\n            input.data = new Date(input.data);\n        }\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.date) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.date,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        if (Number.isNaN(input.data.getTime())) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_date,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        const status = new parseUtil_js_1.ParseStatus();\n        let ctx = undefined;\n        for (const check of this._def.checks) {\n            if (check.kind === \"min\") {\n                if (input.data.getTime() < check.value) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.too_small,\n                        message: check.message,\n                        inclusive: true,\n                        exact: false,\n                        minimum: check.value,\n                        type: \"date\",\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"max\") {\n                if (input.data.getTime() > check.value) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.too_big,\n                        message: check.message,\n                        inclusive: true,\n                        exact: false,\n                        maximum: check.value,\n                        type: \"date\",\n                    });\n                    status.dirty();\n                }\n            }\n            else {\n                util_js_1.util.assertNever(check);\n            }\n        }\n        return {\n            status: status.value,\n            value: new Date(input.data.getTime()),\n        };\n    }\n    _addCheck(check) {\n        return new ZodDate({\n            ...this._def,\n            checks: [...this._def.checks, check],\n        });\n    }\n    min(minDate, message) {\n        return this._addCheck({\n            kind: \"min\",\n            value: minDate.getTime(),\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    max(maxDate, message) {\n        return this._addCheck({\n            kind: \"max\",\n            value: maxDate.getTime(),\n            message: errorUtil_js_1.errorUtil.toString(message),\n        });\n    }\n    get minDate() {\n        let min = null;\n        for (const ch of this._def.checks) {\n            if (ch.kind === \"min\") {\n                if (min === null || ch.value > min)\n                    min = ch.value;\n            }\n        }\n        return min != null ? new Date(min) : null;\n    }\n    get maxDate() {\n        let max = null;\n        for (const ch of this._def.checks) {\n            if (ch.kind === \"max\") {\n                if (max === null || ch.value < max)\n                    max = ch.value;\n            }\n        }\n        return max != null ? new Date(max) : null;\n    }\n}\nexports.ZodDate = ZodDate;\nZodDate.create = (params) => {\n    return new ZodDate({\n        checks: [],\n        coerce: params?.coerce || false,\n        typeName: ZodFirstPartyTypeKind.ZodDate,\n        ...processCreateParams(params),\n    });\n};\nclass ZodSymbol extends ZodType {\n    _parse(input) {\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.symbol) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.symbol,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        return (0, parseUtil_js_1.OK)(input.data);\n    }\n}\nexports.ZodSymbol = ZodSymbol;\nZodSymbol.create = (params) => {\n    return new ZodSymbol({\n        typeName: ZodFirstPartyTypeKind.ZodSymbol,\n        ...processCreateParams(params),\n    });\n};\nclass ZodUndefined extends ZodType {\n    _parse(input) {\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.undefined) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.undefined,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        return (0, parseUtil_js_1.OK)(input.data);\n    }\n}\nexports.ZodUndefined = ZodUndefined;\nZodUndefined.create = (params) => {\n    return new ZodUndefined({\n        typeName: ZodFirstPartyTypeKind.ZodUndefined,\n        ...processCreateParams(params),\n    });\n};\nclass ZodNull extends ZodType {\n    _parse(input) {\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.null) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.null,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        return (0, parseUtil_js_1.OK)(input.data);\n    }\n}\nexports.ZodNull = ZodNull;\nZodNull.create = (params) => {\n    return new ZodNull({\n        typeName: ZodFirstPartyTypeKind.ZodNull,\n        ...processCreateParams(params),\n    });\n};\nclass ZodAny extends ZodType {\n    constructor() {\n        super(...arguments);\n        // to prevent instances of other classes from extending ZodAny. this causes issues with catchall in ZodObject.\n        this._any = true;\n    }\n    _parse(input) {\n        return (0, parseUtil_js_1.OK)(input.data);\n    }\n}\nexports.ZodAny = ZodAny;\nZodAny.create = (params) => {\n    return new ZodAny({\n        typeName: ZodFirstPartyTypeKind.ZodAny,\n        ...processCreateParams(params),\n    });\n};\nclass ZodUnknown extends ZodType {\n    constructor() {\n        super(...arguments);\n        // required\n        this._unknown = true;\n    }\n    _parse(input) {\n        return (0, parseUtil_js_1.OK)(input.data);\n    }\n}\nexports.ZodUnknown = ZodUnknown;\nZodUnknown.create = (params) => {\n    return new ZodUnknown({\n        typeName: ZodFirstPartyTypeKind.ZodUnknown,\n        ...processCreateParams(params),\n    });\n};\nclass ZodNever extends ZodType {\n    _parse(input) {\n        const ctx = this._getOrReturnCtx(input);\n        (0, parseUtil_js_1.addIssueToContext)(ctx, {\n            code: ZodError_js_1.ZodIssueCode.invalid_type,\n            expected: util_js_1.ZodParsedType.never,\n            received: ctx.parsedType,\n        });\n        return parseUtil_js_1.INVALID;\n    }\n}\nexports.ZodNever = ZodNever;\nZodNever.create = (params) => {\n    return new ZodNever({\n        typeName: ZodFirstPartyTypeKind.ZodNever,\n        ...processCreateParams(params),\n    });\n};\nclass ZodVoid extends ZodType {\n    _parse(input) {\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.undefined) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.void,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        return (0, parseUtil_js_1.OK)(input.data);\n    }\n}\nexports.ZodVoid = ZodVoid;\nZodVoid.create = (params) => {\n    return new ZodVoid({\n        typeName: ZodFirstPartyTypeKind.ZodVoid,\n        ...processCreateParams(params),\n    });\n};\nclass ZodArray extends ZodType {\n    _parse(input) {\n        const { ctx, status } = this._processInputParams(input);\n        const def = this._def;\n        if (ctx.parsedType !== util_js_1.ZodParsedType.array) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.array,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        if (def.exactLength !== null) {\n            const tooBig = ctx.data.length > def.exactLength.value;\n            const tooSmall = ctx.data.length < def.exactLength.value;\n            if (tooBig || tooSmall) {\n                (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                    code: tooBig ? ZodError_js_1.ZodIssueCode.too_big : ZodError_js_1.ZodIssueCode.too_small,\n                    minimum: (tooSmall ? def.exactLength.value : undefined),\n                    maximum: (tooBig ? def.exactLength.value : undefined),\n                    type: \"array\",\n                    inclusive: true,\n                    exact: true,\n                    message: def.exactLength.message,\n                });\n                status.dirty();\n            }\n        }\n        if (def.minLength !== null) {\n            if (ctx.data.length < def.minLength.value) {\n                (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                    code: ZodError_js_1.ZodIssueCode.too_small,\n                    minimum: def.minLength.value,\n                    type: \"array\",\n                    inclusive: true,\n                    exact: false,\n                    message: def.minLength.message,\n                });\n                status.dirty();\n            }\n        }\n        if (def.maxLength !== null) {\n            if (ctx.data.length > def.maxLength.value) {\n                (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                    code: ZodError_js_1.ZodIssueCode.too_big,\n                    maximum: def.maxLength.value,\n                    type: \"array\",\n                    inclusive: true,\n                    exact: false,\n                    message: def.maxLength.message,\n                });\n                status.dirty();\n            }\n        }\n        if (ctx.common.async) {\n            return Promise.all([...ctx.data].map((item, i) => {\n                return def.type._parseAsync(new ParseInputLazyPath(ctx, item, ctx.path, i));\n            })).then((result) => {\n                return parseUtil_js_1.ParseStatus.mergeArray(status, result);\n            });\n        }\n        const result = [...ctx.data].map((item, i) => {\n            return def.type._parseSync(new ParseInputLazyPath(ctx, item, ctx.path, i));\n        });\n        return parseUtil_js_1.ParseStatus.mergeArray(status, result);\n    }\n    get element() {\n        return this._def.type;\n    }\n    min(minLength, message) {\n        return new ZodArray({\n            ...this._def,\n            minLength: { value: minLength, message: errorUtil_js_1.errorUtil.toString(message) },\n        });\n    }\n    max(maxLength, message) {\n        return new ZodArray({\n            ...this._def,\n            maxLength: { value: maxLength, message: errorUtil_js_1.errorUtil.toString(message) },\n        });\n    }\n    length(len, message) {\n        return new ZodArray({\n            ...this._def,\n            exactLength: { value: len, message: errorUtil_js_1.errorUtil.toString(message) },\n        });\n    }\n    nonempty(message) {\n        return this.min(1, message);\n    }\n}\nexports.ZodArray = ZodArray;\nZodArray.create = (schema, params) => {\n    return new ZodArray({\n        type: schema,\n        minLength: null,\n        maxLength: null,\n        exactLength: null,\n        typeName: ZodFirstPartyTypeKind.ZodArray,\n        ...processCreateParams(params),\n    });\n};\nfunction deepPartialify(schema) {\n    if (schema instanceof ZodObject) {\n        const newShape = {};\n        for (const key in schema.shape) {\n            const fieldSchema = schema.shape[key];\n            newShape[key] = ZodOptional.create(deepPartialify(fieldSchema));\n        }\n        return new ZodObject({\n            ...schema._def,\n            shape: () => newShape,\n        });\n    }\n    else if (schema instanceof ZodArray) {\n        return new ZodArray({\n            ...schema._def,\n            type: deepPartialify(schema.element),\n        });\n    }\n    else if (schema instanceof ZodOptional) {\n        return ZodOptional.create(deepPartialify(schema.unwrap()));\n    }\n    else if (schema instanceof ZodNullable) {\n        return ZodNullable.create(deepPartialify(schema.unwrap()));\n    }\n    else if (schema instanceof ZodTuple) {\n        return ZodTuple.create(schema.items.map((item) => deepPartialify(item)));\n    }\n    else {\n        return schema;\n    }\n}\nclass ZodObject extends ZodType {\n    constructor() {\n        super(...arguments);\n        this._cached = null;\n        /**\n         * @deprecated In most cases, this is no longer needed - unknown properties are now silently stripped.\n         * If you want to pass through unknown properties, use `.passthrough()` instead.\n         */\n        this.nonstrict = this.passthrough;\n        // extend<\n        //   Augmentation extends ZodRawShape,\n        //   NewOutput extends util.flatten<{\n        //     [k in keyof Augmentation | keyof Output]: k extends keyof Augmentation\n        //       ? Augmentation[k][\"_output\"]\n        //       : k extends keyof Output\n        //       ? Output[k]\n        //       : never;\n        //   }>,\n        //   NewInput extends util.flatten<{\n        //     [k in keyof Augmentation | keyof Input]: k extends keyof Augmentation\n        //       ? Augmentation[k][\"_input\"]\n        //       : k extends keyof Input\n        //       ? Input[k]\n        //       : never;\n        //   }>\n        // >(\n        //   augmentation: Augmentation\n        // ): ZodObject<\n        //   extendShape<T, Augmentation>,\n        //   UnknownKeys,\n        //   Catchall,\n        //   NewOutput,\n        //   NewInput\n        // > {\n        //   return new ZodObject({\n        //     ...this._def,\n        //     shape: () => ({\n        //       ...this._def.shape(),\n        //       ...augmentation,\n        //     }),\n        //   }) as any;\n        // }\n        /**\n         * @deprecated Use `.extend` instead\n         *  */\n        this.augment = this.extend;\n    }\n    _getCached() {\n        if (this._cached !== null)\n            return this._cached;\n        const shape = this._def.shape();\n        const keys = util_js_1.util.objectKeys(shape);\n        this._cached = { shape, keys };\n        return this._cached;\n    }\n    _parse(input) {\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.object) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.object,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        const { status, ctx } = this._processInputParams(input);\n        const { shape, keys: shapeKeys } = this._getCached();\n        const extraKeys = [];\n        if (!(this._def.catchall instanceof ZodNever && this._def.unknownKeys === \"strip\")) {\n            for (const key in ctx.data) {\n                if (!shapeKeys.includes(key)) {\n                    extraKeys.push(key);\n                }\n            }\n        }\n        const pairs = [];\n        for (const key of shapeKeys) {\n            const keyValidator = shape[key];\n            const value = ctx.data[key];\n            pairs.push({\n                key: { status: \"valid\", value: key },\n                value: keyValidator._parse(new ParseInputLazyPath(ctx, value, ctx.path, key)),\n                alwaysSet: key in ctx.data,\n            });\n        }\n        if (this._def.catchall instanceof ZodNever) {\n            const unknownKeys = this._def.unknownKeys;\n            if (unknownKeys === \"passthrough\") {\n                for (const key of extraKeys) {\n                    pairs.push({\n                        key: { status: \"valid\", value: key },\n                        value: { status: \"valid\", value: ctx.data[key] },\n                    });\n                }\n            }\n            else if (unknownKeys === \"strict\") {\n                if (extraKeys.length > 0) {\n                    (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                        code: ZodError_js_1.ZodIssueCode.unrecognized_keys,\n                        keys: extraKeys,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (unknownKeys === \"strip\") {\n            }\n            else {\n                throw new Error(`Internal ZodObject error: invalid unknownKeys value.`);\n            }\n        }\n        else {\n            // run catchall validation\n            const catchall = this._def.catchall;\n            for (const key of extraKeys) {\n                const value = ctx.data[key];\n                pairs.push({\n                    key: { status: \"valid\", value: key },\n                    value: catchall._parse(new ParseInputLazyPath(ctx, value, ctx.path, key) //, ctx.child(key), value, getParsedType(value)\n                    ),\n                    alwaysSet: key in ctx.data,\n                });\n            }\n        }\n        if (ctx.common.async) {\n            return Promise.resolve()\n                .then(async () => {\n                const syncPairs = [];\n                for (const pair of pairs) {\n                    const key = await pair.key;\n                    const value = await pair.value;\n                    syncPairs.push({\n                        key,\n                        value,\n                        alwaysSet: pair.alwaysSet,\n                    });\n                }\n                return syncPairs;\n            })\n                .then((syncPairs) => {\n                return parseUtil_js_1.ParseStatus.mergeObjectSync(status, syncPairs);\n            });\n        }\n        else {\n            return parseUtil_js_1.ParseStatus.mergeObjectSync(status, pairs);\n        }\n    }\n    get shape() {\n        return this._def.shape();\n    }\n    strict(message) {\n        errorUtil_js_1.errorUtil.errToObj;\n        return new ZodObject({\n            ...this._def,\n            unknownKeys: \"strict\",\n            ...(message !== undefined\n                ? {\n                    errorMap: (issue, ctx) => {\n                        const defaultError = this._def.errorMap?.(issue, ctx).message ?? ctx.defaultError;\n                        if (issue.code === \"unrecognized_keys\")\n                            return {\n                                message: errorUtil_js_1.errorUtil.errToObj(message).message ?? defaultError,\n                            };\n                        return {\n                            message: defaultError,\n                        };\n                    },\n                }\n                : {}),\n        });\n    }\n    strip() {\n        return new ZodObject({\n            ...this._def,\n            unknownKeys: \"strip\",\n        });\n    }\n    passthrough() {\n        return new ZodObject({\n            ...this._def,\n            unknownKeys: \"passthrough\",\n        });\n    }\n    // const AugmentFactory =\n    //   <Def extends ZodObjectDef>(def: Def) =>\n    //   <Augmentation extends ZodRawShape>(\n    //     augmentation: Augmentation\n    //   ): ZodObject<\n    //     extendShape<ReturnType<Def[\"shape\"]>, Augmentation>,\n    //     Def[\"unknownKeys\"],\n    //     Def[\"catchall\"]\n    //   > => {\n    //     return new ZodObject({\n    //       ...def,\n    //       shape: () => ({\n    //         ...def.shape(),\n    //         ...augmentation,\n    //       }),\n    //     }) as any;\n    //   };\n    extend(augmentation) {\n        return new ZodObject({\n            ...this._def,\n            shape: () => ({\n                ...this._def.shape(),\n                ...augmentation,\n            }),\n        });\n    }\n    /**\n     * Prior to zod@1.0.12 there was a bug in the\n     * inferred type of merged objects. Please\n     * upgrade if you are experiencing issues.\n     */\n    merge(merging) {\n        const merged = new ZodObject({\n            unknownKeys: merging._def.unknownKeys,\n            catchall: merging._def.catchall,\n            shape: () => ({\n                ...this._def.shape(),\n                ...merging._def.shape(),\n            }),\n            typeName: ZodFirstPartyTypeKind.ZodObject,\n        });\n        return merged;\n    }\n    // merge<\n    //   Incoming extends AnyZodObject,\n    //   Augmentation extends Incoming[\"shape\"],\n    //   NewOutput extends {\n    //     [k in keyof Augmentation | keyof Output]: k extends keyof Augmentation\n    //       ? Augmentation[k][\"_output\"]\n    //       : k extends keyof Output\n    //       ? Output[k]\n    //       : never;\n    //   },\n    //   NewInput extends {\n    //     [k in keyof Augmentation | keyof Input]: k extends keyof Augmentation\n    //       ? Augmentation[k][\"_input\"]\n    //       : k extends keyof Input\n    //       ? Input[k]\n    //       : never;\n    //   }\n    // >(\n    //   merging: Incoming\n    // ): ZodObject<\n    //   extendShape<T, ReturnType<Incoming[\"_def\"][\"shape\"]>>,\n    //   Incoming[\"_def\"][\"unknownKeys\"],\n    //   Incoming[\"_def\"][\"catchall\"],\n    //   NewOutput,\n    //   NewInput\n    // > {\n    //   const merged: any = new ZodObject({\n    //     unknownKeys: merging._def.unknownKeys,\n    //     catchall: merging._def.catchall,\n    //     shape: () =>\n    //       objectUtil.mergeShapes(this._def.shape(), merging._def.shape()),\n    //     typeName: ZodFirstPartyTypeKind.ZodObject,\n    //   }) as any;\n    //   return merged;\n    // }\n    setKey(key, schema) {\n        return this.augment({ [key]: schema });\n    }\n    // merge<Incoming extends AnyZodObject>(\n    //   merging: Incoming\n    // ): //ZodObject<T & Incoming[\"_shape\"], UnknownKeys, Catchall> = (merging) => {\n    // ZodObject<\n    //   extendShape<T, ReturnType<Incoming[\"_def\"][\"shape\"]>>,\n    //   Incoming[\"_def\"][\"unknownKeys\"],\n    //   Incoming[\"_def\"][\"catchall\"]\n    // > {\n    //   // const mergedShape = objectUtil.mergeShapes(\n    //   //   this._def.shape(),\n    //   //   merging._def.shape()\n    //   // );\n    //   const merged: any = new ZodObject({\n    //     unknownKeys: merging._def.unknownKeys,\n    //     catchall: merging._def.catchall,\n    //     shape: () =>\n    //       objectUtil.mergeShapes(this._def.shape(), merging._def.shape()),\n    //     typeName: ZodFirstPartyTypeKind.ZodObject,\n    //   }) as any;\n    //   return merged;\n    // }\n    catchall(index) {\n        return new ZodObject({\n            ...this._def,\n            catchall: index,\n        });\n    }\n    pick(mask) {\n        const shape = {};\n        for (const key of util_js_1.util.objectKeys(mask)) {\n            if (mask[key] && this.shape[key]) {\n                shape[key] = this.shape[key];\n            }\n        }\n        return new ZodObject({\n            ...this._def,\n            shape: () => shape,\n        });\n    }\n    omit(mask) {\n        const shape = {};\n        for (const key of util_js_1.util.objectKeys(this.shape)) {\n            if (!mask[key]) {\n                shape[key] = this.shape[key];\n            }\n        }\n        return new ZodObject({\n            ...this._def,\n            shape: () => shape,\n        });\n    }\n    /**\n     * @deprecated\n     */\n    deepPartial() {\n        return deepPartialify(this);\n    }\n    partial(mask) {\n        const newShape = {};\n        for (const key of util_js_1.util.objectKeys(this.shape)) {\n            const fieldSchema = this.shape[key];\n            if (mask && !mask[key]) {\n                newShape[key] = fieldSchema;\n            }\n            else {\n                newShape[key] = fieldSchema.optional();\n            }\n        }\n        return new ZodObject({\n            ...this._def,\n            shape: () => newShape,\n        });\n    }\n    required(mask) {\n        const newShape = {};\n        for (const key of util_js_1.util.objectKeys(this.shape)) {\n            if (mask && !mask[key]) {\n                newShape[key] = this.shape[key];\n            }\n            else {\n                const fieldSchema = this.shape[key];\n                let newField = fieldSchema;\n                while (newField instanceof ZodOptional) {\n                    newField = newField._def.innerType;\n                }\n                newShape[key] = newField;\n            }\n        }\n        return new ZodObject({\n            ...this._def,\n            shape: () => newShape,\n        });\n    }\n    keyof() {\n        return createZodEnum(util_js_1.util.objectKeys(this.shape));\n    }\n}\nexports.ZodObject = ZodObject;\nZodObject.create = (shape, params) => {\n    return new ZodObject({\n        shape: () => shape,\n        unknownKeys: \"strip\",\n        catchall: ZodNever.create(),\n        typeName: ZodFirstPartyTypeKind.ZodObject,\n        ...processCreateParams(params),\n    });\n};\nZodObject.strictCreate = (shape, params) => {\n    return new ZodObject({\n        shape: () => shape,\n        unknownKeys: \"strict\",\n        catchall: ZodNever.create(),\n        typeName: ZodFirstPartyTypeKind.ZodObject,\n        ...processCreateParams(params),\n    });\n};\nZodObject.lazycreate = (shape, params) => {\n    return new ZodObject({\n        shape,\n        unknownKeys: \"strip\",\n        catchall: ZodNever.create(),\n        typeName: ZodFirstPartyTypeKind.ZodObject,\n        ...processCreateParams(params),\n    });\n};\nclass ZodUnion extends ZodType {\n    _parse(input) {\n        const { ctx } = this._processInputParams(input);\n        const options = this._def.options;\n        function handleResults(results) {\n            // return first issue-free validation if it exists\n            for (const result of results) {\n                if (result.result.status === \"valid\") {\n                    return result.result;\n                }\n            }\n            for (const result of results) {\n                if (result.result.status === \"dirty\") {\n                    // add issues from dirty option\n                    ctx.common.issues.push(...result.ctx.common.issues);\n                    return result.result;\n                }\n            }\n            // return invalid\n            const unionErrors = results.map((result) => new ZodError_js_1.ZodError(result.ctx.common.issues));\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_union,\n                unionErrors,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        if (ctx.common.async) {\n            return Promise.all(options.map(async (option) => {\n                const childCtx = {\n                    ...ctx,\n                    common: {\n                        ...ctx.common,\n                        issues: [],\n                    },\n                    parent: null,\n                };\n                return {\n                    result: await option._parseAsync({\n                        data: ctx.data,\n                        path: ctx.path,\n                        parent: childCtx,\n                    }),\n                    ctx: childCtx,\n                };\n            })).then(handleResults);\n        }\n        else {\n            let dirty = undefined;\n            const issues = [];\n            for (const option of options) {\n                const childCtx = {\n                    ...ctx,\n                    common: {\n                        ...ctx.common,\n                        issues: [],\n                    },\n                    parent: null,\n                };\n                const result = option._parseSync({\n                    data: ctx.data,\n                    path: ctx.path,\n                    parent: childCtx,\n                });\n                if (result.status === \"valid\") {\n                    return result;\n                }\n                else if (result.status === \"dirty\" && !dirty) {\n                    dirty = { result, ctx: childCtx };\n                }\n                if (childCtx.common.issues.length) {\n                    issues.push(childCtx.common.issues);\n                }\n            }\n            if (dirty) {\n                ctx.common.issues.push(...dirty.ctx.common.issues);\n                return dirty.result;\n            }\n            const unionErrors = issues.map((issues) => new ZodError_js_1.ZodError(issues));\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_union,\n                unionErrors,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n    }\n    get options() {\n        return this._def.options;\n    }\n}\nexports.ZodUnion = ZodUnion;\nZodUnion.create = (types, params) => {\n    return new ZodUnion({\n        options: types,\n        typeName: ZodFirstPartyTypeKind.ZodUnion,\n        ...processCreateParams(params),\n    });\n};\n/////////////////////////////////////////////////////\n/////////////////////////////////////////////////////\n//////////                                 //////////\n//////////      ZodDiscriminatedUnion      //////////\n//////////                                 //////////\n/////////////////////////////////////////////////////\n/////////////////////////////////////////////////////\nconst getDiscriminator = (type) => {\n    if (type instanceof ZodLazy) {\n        return getDiscriminator(type.schema);\n    }\n    else if (type instanceof ZodEffects) {\n        return getDiscriminator(type.innerType());\n    }\n    else if (type instanceof ZodLiteral) {\n        return [type.value];\n    }\n    else if (type instanceof ZodEnum) {\n        return type.options;\n    }\n    else if (type instanceof ZodNativeEnum) {\n        // eslint-disable-next-line ban/ban\n        return util_js_1.util.objectValues(type.enum);\n    }\n    else if (type instanceof ZodDefault) {\n        return getDiscriminator(type._def.innerType);\n    }\n    else if (type instanceof ZodUndefined) {\n        return [undefined];\n    }\n    else if (type instanceof ZodNull) {\n        return [null];\n    }\n    else if (type instanceof ZodOptional) {\n        return [undefined, ...getDiscriminator(type.unwrap())];\n    }\n    else if (type instanceof ZodNullable) {\n        return [null, ...getDiscriminator(type.unwrap())];\n    }\n    else if (type instanceof ZodBranded) {\n        return getDiscriminator(type.unwrap());\n    }\n    else if (type instanceof ZodReadonly) {\n        return getDiscriminator(type.unwrap());\n    }\n    else if (type instanceof ZodCatch) {\n        return getDiscriminator(type._def.innerType);\n    }\n    else {\n        return [];\n    }\n};\nclass ZodDiscriminatedUnion extends ZodType {\n    _parse(input) {\n        const { ctx } = this._processInputParams(input);\n        if (ctx.parsedType !== util_js_1.ZodParsedType.object) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.object,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        const discriminator = this.discriminator;\n        const discriminatorValue = ctx.data[discriminator];\n        const option = this.optionsMap.get(discriminatorValue);\n        if (!option) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_union_discriminator,\n                options: Array.from(this.optionsMap.keys()),\n                path: [discriminator],\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        if (ctx.common.async) {\n            return option._parseAsync({\n                data: ctx.data,\n                path: ctx.path,\n                parent: ctx,\n            });\n        }\n        else {\n            return option._parseSync({\n                data: ctx.data,\n                path: ctx.path,\n                parent: ctx,\n            });\n        }\n    }\n    get discriminator() {\n        return this._def.discriminator;\n    }\n    get options() {\n        return this._def.options;\n    }\n    get optionsMap() {\n        return this._def.optionsMap;\n    }\n    /**\n     * The constructor of the discriminated union schema. Its behaviour is very similar to that of the normal z.union() constructor.\n     * However, it only allows a union of objects, all of which need to share a discriminator property. This property must\n     * have a different value for each object in the union.\n     * @param discriminator the name of the discriminator property\n     * @param types an array of object schemas\n     * @param params\n     */\n    static create(discriminator, options, params) {\n        // Get all the valid discriminator values\n        const optionsMap = new Map();\n        // try {\n        for (const type of options) {\n            const discriminatorValues = getDiscriminator(type.shape[discriminator]);\n            if (!discriminatorValues.length) {\n                throw new Error(`A discriminator value for key \\`${discriminator}\\` could not be extracted from all schema options`);\n            }\n            for (const value of discriminatorValues) {\n                if (optionsMap.has(value)) {\n                    throw new Error(`Discriminator property ${String(discriminator)} has duplicate value ${String(value)}`);\n                }\n                optionsMap.set(value, type);\n            }\n        }\n        return new ZodDiscriminatedUnion({\n            typeName: ZodFirstPartyTypeKind.ZodDiscriminatedUnion,\n            discriminator,\n            options,\n            optionsMap,\n            ...processCreateParams(params),\n        });\n    }\n}\nexports.ZodDiscriminatedUnion = ZodDiscriminatedUnion;\nfunction mergeValues(a, b) {\n    const aType = (0, util_js_1.getParsedType)(a);\n    const bType = (0, util_js_1.getParsedType)(b);\n    if (a === b) {\n        return { valid: true, data: a };\n    }\n    else if (aType === util_js_1.ZodParsedType.object && bType === util_js_1.ZodParsedType.object) {\n        const bKeys = util_js_1.util.objectKeys(b);\n        const sharedKeys = util_js_1.util.objectKeys(a).filter((key) => bKeys.indexOf(key) !== -1);\n        const newObj = { ...a, ...b };\n        for (const key of sharedKeys) {\n            const sharedValue = mergeValues(a[key], b[key]);\n            if (!sharedValue.valid) {\n                return { valid: false };\n            }\n            newObj[key] = sharedValue.data;\n        }\n        return { valid: true, data: newObj };\n    }\n    else if (aType === util_js_1.ZodParsedType.array && bType === util_js_1.ZodParsedType.array) {\n        if (a.length !== b.length) {\n            return { valid: false };\n        }\n        const newArray = [];\n        for (let index = 0; index < a.length; index++) {\n            const itemA = a[index];\n            const itemB = b[index];\n            const sharedValue = mergeValues(itemA, itemB);\n            if (!sharedValue.valid) {\n                return { valid: false };\n            }\n            newArray.push(sharedValue.data);\n        }\n        return { valid: true, data: newArray };\n    }\n    else if (aType === util_js_1.ZodParsedType.date && bType === util_js_1.ZodParsedType.date && +a === +b) {\n        return { valid: true, data: a };\n    }\n    else {\n        return { valid: false };\n    }\n}\nclass ZodIntersection extends ZodType {\n    _parse(input) {\n        const { status, ctx } = this._processInputParams(input);\n        const handleParsed = (parsedLeft, parsedRight) => {\n            if ((0, parseUtil_js_1.isAborted)(parsedLeft) || (0, parseUtil_js_1.isAborted)(parsedRight)) {\n                return parseUtil_js_1.INVALID;\n            }\n            const merged = mergeValues(parsedLeft.value, parsedRight.value);\n            if (!merged.valid) {\n                (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                    code: ZodError_js_1.ZodIssueCode.invalid_intersection_types,\n                });\n                return parseUtil_js_1.INVALID;\n            }\n            if ((0, parseUtil_js_1.isDirty)(parsedLeft) || (0, parseUtil_js_1.isDirty)(parsedRight)) {\n                status.dirty();\n            }\n            return { status: status.value, value: merged.data };\n        };\n        if (ctx.common.async) {\n            return Promise.all([\n                this._def.left._parseAsync({\n                    data: ctx.data,\n                    path: ctx.path,\n                    parent: ctx,\n                }),\n                this._def.right._parseAsync({\n                    data: ctx.data,\n                    path: ctx.path,\n                    parent: ctx,\n                }),\n            ]).then(([left, right]) => handleParsed(left, right));\n        }\n        else {\n            return handleParsed(this._def.left._parseSync({\n                data: ctx.data,\n                path: ctx.path,\n                parent: ctx,\n            }), this._def.right._parseSync({\n                data: ctx.data,\n                path: ctx.path,\n                parent: ctx,\n            }));\n        }\n    }\n}\nexports.ZodIntersection = ZodIntersection;\nZodIntersection.create = (left, right, params) => {\n    return new ZodIntersection({\n        left: left,\n        right: right,\n        typeName: ZodFirstPartyTypeKind.ZodIntersection,\n        ...processCreateParams(params),\n    });\n};\n// type ZodTupleItems = [ZodTypeAny, ...ZodTypeAny[]];\nclass ZodTuple extends ZodType {\n    _parse(input) {\n        const { status, ctx } = this._processInputParams(input);\n        if (ctx.parsedType !== util_js_1.ZodParsedType.array) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.array,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        if (ctx.data.length < this._def.items.length) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.too_small,\n                minimum: this._def.items.length,\n                inclusive: true,\n                exact: false,\n                type: \"array\",\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        const rest = this._def.rest;\n        if (!rest && ctx.data.length > this._def.items.length) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.too_big,\n                maximum: this._def.items.length,\n                inclusive: true,\n                exact: false,\n                type: \"array\",\n            });\n            status.dirty();\n        }\n        const items = [...ctx.data]\n            .map((item, itemIndex) => {\n            const schema = this._def.items[itemIndex] || this._def.rest;\n            if (!schema)\n                return null;\n            return schema._parse(new ParseInputLazyPath(ctx, item, ctx.path, itemIndex));\n        })\n            .filter((x) => !!x); // filter nulls\n        if (ctx.common.async) {\n            return Promise.all(items).then((results) => {\n                return parseUtil_js_1.ParseStatus.mergeArray(status, results);\n            });\n        }\n        else {\n            return parseUtil_js_1.ParseStatus.mergeArray(status, items);\n        }\n    }\n    get items() {\n        return this._def.items;\n    }\n    rest(rest) {\n        return new ZodTuple({\n            ...this._def,\n            rest,\n        });\n    }\n}\nexports.ZodTuple = ZodTuple;\nZodTuple.create = (schemas, params) => {\n    if (!Array.isArray(schemas)) {\n        throw new Error(\"You must pass an array of schemas to z.tuple([ ... ])\");\n    }\n    return new ZodTuple({\n        items: schemas,\n        typeName: ZodFirstPartyTypeKind.ZodTuple,\n        rest: null,\n        ...processCreateParams(params),\n    });\n};\nclass ZodRecord extends ZodType {\n    get keySchema() {\n        return this._def.keyType;\n    }\n    get valueSchema() {\n        return this._def.valueType;\n    }\n    _parse(input) {\n        const { status, ctx } = this._processInputParams(input);\n        if (ctx.parsedType !== util_js_1.ZodParsedType.object) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.object,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        const pairs = [];\n        const keyType = this._def.keyType;\n        const valueType = this._def.valueType;\n        for (const key in ctx.data) {\n            pairs.push({\n                key: keyType._parse(new ParseInputLazyPath(ctx, key, ctx.path, key)),\n                value: valueType._parse(new ParseInputLazyPath(ctx, ctx.data[key], ctx.path, key)),\n                alwaysSet: key in ctx.data,\n            });\n        }\n        if (ctx.common.async) {\n            return parseUtil_js_1.ParseStatus.mergeObjectAsync(status, pairs);\n        }\n        else {\n            return parseUtil_js_1.ParseStatus.mergeObjectSync(status, pairs);\n        }\n    }\n    get element() {\n        return this._def.valueType;\n    }\n    static create(first, second, third) {\n        if (second instanceof ZodType) {\n            return new ZodRecord({\n                keyType: first,\n                valueType: second,\n                typeName: ZodFirstPartyTypeKind.ZodRecord,\n                ...processCreateParams(third),\n            });\n        }\n        return new ZodRecord({\n            keyType: ZodString.create(),\n            valueType: first,\n            typeName: ZodFirstPartyTypeKind.ZodRecord,\n            ...processCreateParams(second),\n        });\n    }\n}\nexports.ZodRecord = ZodRecord;\nclass ZodMap extends ZodType {\n    get keySchema() {\n        return this._def.keyType;\n    }\n    get valueSchema() {\n        return this._def.valueType;\n    }\n    _parse(input) {\n        const { status, ctx } = this._processInputParams(input);\n        if (ctx.parsedType !== util_js_1.ZodParsedType.map) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.map,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        const keyType = this._def.keyType;\n        const valueType = this._def.valueType;\n        const pairs = [...ctx.data.entries()].map(([key, value], index) => {\n            return {\n                key: keyType._parse(new ParseInputLazyPath(ctx, key, ctx.path, [index, \"key\"])),\n                value: valueType._parse(new ParseInputLazyPath(ctx, value, ctx.path, [index, \"value\"])),\n            };\n        });\n        if (ctx.common.async) {\n            const finalMap = new Map();\n            return Promise.resolve().then(async () => {\n                for (const pair of pairs) {\n                    const key = await pair.key;\n                    const value = await pair.value;\n                    if (key.status === \"aborted\" || value.status === \"aborted\") {\n                        return parseUtil_js_1.INVALID;\n                    }\n                    if (key.status === \"dirty\" || value.status === \"dirty\") {\n                        status.dirty();\n                    }\n                    finalMap.set(key.value, value.value);\n                }\n                return { status: status.value, value: finalMap };\n            });\n        }\n        else {\n            const finalMap = new Map();\n            for (const pair of pairs) {\n                const key = pair.key;\n                const value = pair.value;\n                if (key.status === \"aborted\" || value.status === \"aborted\") {\n                    return parseUtil_js_1.INVALID;\n                }\n                if (key.status === \"dirty\" || value.status === \"dirty\") {\n                    status.dirty();\n                }\n                finalMap.set(key.value, value.value);\n            }\n            return { status: status.value, value: finalMap };\n        }\n    }\n}\nexports.ZodMap = ZodMap;\nZodMap.create = (keyType, valueType, params) => {\n    return new ZodMap({\n        valueType,\n        keyType,\n        typeName: ZodFirstPartyTypeKind.ZodMap,\n        ...processCreateParams(params),\n    });\n};\nclass ZodSet extends ZodType {\n    _parse(input) {\n        const { status, ctx } = this._processInputParams(input);\n        if (ctx.parsedType !== util_js_1.ZodParsedType.set) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.set,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        const def = this._def;\n        if (def.minSize !== null) {\n            if (ctx.data.size < def.minSize.value) {\n                (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                    code: ZodError_js_1.ZodIssueCode.too_small,\n                    minimum: def.minSize.value,\n                    type: \"set\",\n                    inclusive: true,\n                    exact: false,\n                    message: def.minSize.message,\n                });\n                status.dirty();\n            }\n        }\n        if (def.maxSize !== null) {\n            if (ctx.data.size > def.maxSize.value) {\n                (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                    code: ZodError_js_1.ZodIssueCode.too_big,\n                    maximum: def.maxSize.value,\n                    type: \"set\",\n                    inclusive: true,\n                    exact: false,\n                    message: def.maxSize.message,\n                });\n                status.dirty();\n            }\n        }\n        const valueType = this._def.valueType;\n        function finalizeSet(elements) {\n            const parsedSet = new Set();\n            for (const element of elements) {\n                if (element.status === \"aborted\")\n                    return parseUtil_js_1.INVALID;\n                if (element.status === \"dirty\")\n                    status.dirty();\n                parsedSet.add(element.value);\n            }\n            return { status: status.value, value: parsedSet };\n        }\n        const elements = [...ctx.data.values()].map((item, i) => valueType._parse(new ParseInputLazyPath(ctx, item, ctx.path, i)));\n        if (ctx.common.async) {\n            return Promise.all(elements).then((elements) => finalizeSet(elements));\n        }\n        else {\n            return finalizeSet(elements);\n        }\n    }\n    min(minSize, message) {\n        return new ZodSet({\n            ...this._def,\n            minSize: { value: minSize, message: errorUtil_js_1.errorUtil.toString(message) },\n        });\n    }\n    max(maxSize, message) {\n        return new ZodSet({\n            ...this._def,\n            maxSize: { value: maxSize, message: errorUtil_js_1.errorUtil.toString(message) },\n        });\n    }\n    size(size, message) {\n        return this.min(size, message).max(size, message);\n    }\n    nonempty(message) {\n        return this.min(1, message);\n    }\n}\nexports.ZodSet = ZodSet;\nZodSet.create = (valueType, params) => {\n    return new ZodSet({\n        valueType,\n        minSize: null,\n        maxSize: null,\n        typeName: ZodFirstPartyTypeKind.ZodSet,\n        ...processCreateParams(params),\n    });\n};\nclass ZodFunction extends ZodType {\n    constructor() {\n        super(...arguments);\n        this.validate = this.implement;\n    }\n    _parse(input) {\n        const { ctx } = this._processInputParams(input);\n        if (ctx.parsedType !== util_js_1.ZodParsedType.function) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.function,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        function makeArgsIssue(args, error) {\n            return (0, parseUtil_js_1.makeIssue)({\n                data: args,\n                path: ctx.path,\n                errorMaps: [ctx.common.contextualErrorMap, ctx.schemaErrorMap, (0, errors_js_1.getErrorMap)(), errors_js_1.defaultErrorMap].filter((x) => !!x),\n                issueData: {\n                    code: ZodError_js_1.ZodIssueCode.invalid_arguments,\n                    argumentsError: error,\n                },\n            });\n        }\n        function makeReturnsIssue(returns, error) {\n            return (0, parseUtil_js_1.makeIssue)({\n                data: returns,\n                path: ctx.path,\n                errorMaps: [ctx.common.contextualErrorMap, ctx.schemaErrorMap, (0, errors_js_1.getErrorMap)(), errors_js_1.defaultErrorMap].filter((x) => !!x),\n                issueData: {\n                    code: ZodError_js_1.ZodIssueCode.invalid_return_type,\n                    returnTypeError: error,\n                },\n            });\n        }\n        const params = { errorMap: ctx.common.contextualErrorMap };\n        const fn = ctx.data;\n        if (this._def.returns instanceof ZodPromise) {\n            // Would love a way to avoid disabling this rule, but we need\n            // an alias (using an arrow function was what caused 2651).\n            // eslint-disable-next-line @typescript-eslint/no-this-alias\n            const me = this;\n            return (0, parseUtil_js_1.OK)(async function (...args) {\n                const error = new ZodError_js_1.ZodError([]);\n                const parsedArgs = await me._def.args.parseAsync(args, params).catch((e) => {\n                    error.addIssue(makeArgsIssue(args, e));\n                    throw error;\n                });\n                const result = await Reflect.apply(fn, this, parsedArgs);\n                const parsedReturns = await me._def.returns._def.type\n                    .parseAsync(result, params)\n                    .catch((e) => {\n                    error.addIssue(makeReturnsIssue(result, e));\n                    throw error;\n                });\n                return parsedReturns;\n            });\n        }\n        else {\n            // Would love a way to avoid disabling this rule, but we need\n            // an alias (using an arrow function was what caused 2651).\n            // eslint-disable-next-line @typescript-eslint/no-this-alias\n            const me = this;\n            return (0, parseUtil_js_1.OK)(function (...args) {\n                const parsedArgs = me._def.args.safeParse(args, params);\n                if (!parsedArgs.success) {\n                    throw new ZodError_js_1.ZodError([makeArgsIssue(args, parsedArgs.error)]);\n                }\n                const result = Reflect.apply(fn, this, parsedArgs.data);\n                const parsedReturns = me._def.returns.safeParse(result, params);\n                if (!parsedReturns.success) {\n                    throw new ZodError_js_1.ZodError([makeReturnsIssue(result, parsedReturns.error)]);\n                }\n                return parsedReturns.data;\n            });\n        }\n    }\n    parameters() {\n        return this._def.args;\n    }\n    returnType() {\n        return this._def.returns;\n    }\n    args(...items) {\n        return new ZodFunction({\n            ...this._def,\n            args: ZodTuple.create(items).rest(ZodUnknown.create()),\n        });\n    }\n    returns(returnType) {\n        return new ZodFunction({\n            ...this._def,\n            returns: returnType,\n        });\n    }\n    implement(func) {\n        const validatedFunc = this.parse(func);\n        return validatedFunc;\n    }\n    strictImplement(func) {\n        const validatedFunc = this.parse(func);\n        return validatedFunc;\n    }\n    static create(args, returns, params) {\n        return new ZodFunction({\n            args: (args ? args : ZodTuple.create([]).rest(ZodUnknown.create())),\n            returns: returns || ZodUnknown.create(),\n            typeName: ZodFirstPartyTypeKind.ZodFunction,\n            ...processCreateParams(params),\n        });\n    }\n}\nexports.ZodFunction = ZodFunction;\nclass ZodLazy extends ZodType {\n    get schema() {\n        return this._def.getter();\n    }\n    _parse(input) {\n        const { ctx } = this._processInputParams(input);\n        const lazySchema = this._def.getter();\n        return lazySchema._parse({ data: ctx.data, path: ctx.path, parent: ctx });\n    }\n}\nexports.ZodLazy = ZodLazy;\nZodLazy.create = (getter, params) => {\n    return new ZodLazy({\n        getter: getter,\n        typeName: ZodFirstPartyTypeKind.ZodLazy,\n        ...processCreateParams(params),\n    });\n};\nclass ZodLiteral extends ZodType {\n    _parse(input) {\n        if (input.data !== this._def.value) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                received: ctx.data,\n                code: ZodError_js_1.ZodIssueCode.invalid_literal,\n                expected: this._def.value,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        return { status: \"valid\", value: input.data };\n    }\n    get value() {\n        return this._def.value;\n    }\n}\nexports.ZodLiteral = ZodLiteral;\nZodLiteral.create = (value, params) => {\n    return new ZodLiteral({\n        value: value,\n        typeName: ZodFirstPartyTypeKind.ZodLiteral,\n        ...processCreateParams(params),\n    });\n};\nfunction createZodEnum(values, params) {\n    return new ZodEnum({\n        values,\n        typeName: ZodFirstPartyTypeKind.ZodEnum,\n        ...processCreateParams(params),\n    });\n}\nclass ZodEnum extends ZodType {\n    _parse(input) {\n        if (typeof input.data !== \"string\") {\n            const ctx = this._getOrReturnCtx(input);\n            const expectedValues = this._def.values;\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                expected: util_js_1.util.joinValues(expectedValues),\n                received: ctx.parsedType,\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        if (!this._cache) {\n            this._cache = new Set(this._def.values);\n        }\n        if (!this._cache.has(input.data)) {\n            const ctx = this._getOrReturnCtx(input);\n            const expectedValues = this._def.values;\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                received: ctx.data,\n                code: ZodError_js_1.ZodIssueCode.invalid_enum_value,\n                options: expectedValues,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        return (0, parseUtil_js_1.OK)(input.data);\n    }\n    get options() {\n        return this._def.values;\n    }\n    get enum() {\n        const enumValues = {};\n        for (const val of this._def.values) {\n            enumValues[val] = val;\n        }\n        return enumValues;\n    }\n    get Values() {\n        const enumValues = {};\n        for (const val of this._def.values) {\n            enumValues[val] = val;\n        }\n        return enumValues;\n    }\n    get Enum() {\n        const enumValues = {};\n        for (const val of this._def.values) {\n            enumValues[val] = val;\n        }\n        return enumValues;\n    }\n    extract(values, newDef = this._def) {\n        return ZodEnum.create(values, {\n            ...this._def,\n            ...newDef,\n        });\n    }\n    exclude(values, newDef = this._def) {\n        return ZodEnum.create(this.options.filter((opt) => !values.includes(opt)), {\n            ...this._def,\n            ...newDef,\n        });\n    }\n}\nexports.ZodEnum = ZodEnum;\nZodEnum.create = createZodEnum;\nclass ZodNativeEnum extends ZodType {\n    _parse(input) {\n        const nativeEnumValues = util_js_1.util.getValidEnumValues(this._def.values);\n        const ctx = this._getOrReturnCtx(input);\n        if (ctx.parsedType !== util_js_1.ZodParsedType.string && ctx.parsedType !== util_js_1.ZodParsedType.number) {\n            const expectedValues = util_js_1.util.objectValues(nativeEnumValues);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                expected: util_js_1.util.joinValues(expectedValues),\n                received: ctx.parsedType,\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        if (!this._cache) {\n            this._cache = new Set(util_js_1.util.getValidEnumValues(this._def.values));\n        }\n        if (!this._cache.has(input.data)) {\n            const expectedValues = util_js_1.util.objectValues(nativeEnumValues);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                received: ctx.data,\n                code: ZodError_js_1.ZodIssueCode.invalid_enum_value,\n                options: expectedValues,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        return (0, parseUtil_js_1.OK)(input.data);\n    }\n    get enum() {\n        return this._def.values;\n    }\n}\nexports.ZodNativeEnum = ZodNativeEnum;\nZodNativeEnum.create = (values, params) => {\n    return new ZodNativeEnum({\n        values: values,\n        typeName: ZodFirstPartyTypeKind.ZodNativeEnum,\n        ...processCreateParams(params),\n    });\n};\nclass ZodPromise extends ZodType {\n    unwrap() {\n        return this._def.type;\n    }\n    _parse(input) {\n        const { ctx } = this._processInputParams(input);\n        if (ctx.parsedType !== util_js_1.ZodParsedType.promise && ctx.common.async === false) {\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.promise,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        const promisified = ctx.parsedType === util_js_1.ZodParsedType.promise ? ctx.data : Promise.resolve(ctx.data);\n        return (0, parseUtil_js_1.OK)(promisified.then((data) => {\n            return this._def.type.parseAsync(data, {\n                path: ctx.path,\n                errorMap: ctx.common.contextualErrorMap,\n            });\n        }));\n    }\n}\nexports.ZodPromise = ZodPromise;\nZodPromise.create = (schema, params) => {\n    return new ZodPromise({\n        type: schema,\n        typeName: ZodFirstPartyTypeKind.ZodPromise,\n        ...processCreateParams(params),\n    });\n};\nclass ZodEffects extends ZodType {\n    innerType() {\n        return this._def.schema;\n    }\n    sourceType() {\n        return this._def.schema._def.typeName === ZodFirstPartyTypeKind.ZodEffects\n            ? this._def.schema.sourceType()\n            : this._def.schema;\n    }\n    _parse(input) {\n        const { status, ctx } = this._processInputParams(input);\n        const effect = this._def.effect || null;\n        const checkCtx = {\n            addIssue: (arg) => {\n                (0, parseUtil_js_1.addIssueToContext)(ctx, arg);\n                if (arg.fatal) {\n                    status.abort();\n                }\n                else {\n                    status.dirty();\n                }\n            },\n            get path() {\n                return ctx.path;\n            },\n        };\n        checkCtx.addIssue = checkCtx.addIssue.bind(checkCtx);\n        if (effect.type === \"preprocess\") {\n            const processed = effect.transform(ctx.data, checkCtx);\n            if (ctx.common.async) {\n                return Promise.resolve(processed).then(async (processed) => {\n                    if (status.value === \"aborted\")\n                        return parseUtil_js_1.INVALID;\n                    const result = await this._def.schema._parseAsync({\n                        data: processed,\n                        path: ctx.path,\n                        parent: ctx,\n                    });\n                    if (result.status === \"aborted\")\n                        return parseUtil_js_1.INVALID;\n                    if (result.status === \"dirty\")\n                        return (0, parseUtil_js_1.DIRTY)(result.value);\n                    if (status.value === \"dirty\")\n                        return (0, parseUtil_js_1.DIRTY)(result.value);\n                    return result;\n                });\n            }\n            else {\n                if (status.value === \"aborted\")\n                    return parseUtil_js_1.INVALID;\n                const result = this._def.schema._parseSync({\n                    data: processed,\n                    path: ctx.path,\n                    parent: ctx,\n                });\n                if (result.status === \"aborted\")\n                    return parseUtil_js_1.INVALID;\n                if (result.status === \"dirty\")\n                    return (0, parseUtil_js_1.DIRTY)(result.value);\n                if (status.value === \"dirty\")\n                    return (0, parseUtil_js_1.DIRTY)(result.value);\n                return result;\n            }\n        }\n        if (effect.type === \"refinement\") {\n            const executeRefinement = (acc) => {\n                const result = effect.refinement(acc, checkCtx);\n                if (ctx.common.async) {\n                    return Promise.resolve(result);\n                }\n                if (result instanceof Promise) {\n                    throw new Error(\"Async refinement encountered during synchronous parse operation. Use .parseAsync instead.\");\n                }\n                return acc;\n            };\n            if (ctx.common.async === false) {\n                const inner = this._def.schema._parseSync({\n                    data: ctx.data,\n                    path: ctx.path,\n                    parent: ctx,\n                });\n                if (inner.status === \"aborted\")\n                    return parseUtil_js_1.INVALID;\n                if (inner.status === \"dirty\")\n                    status.dirty();\n                // return value is ignored\n                executeRefinement(inner.value);\n                return { status: status.value, value: inner.value };\n            }\n            else {\n                return this._def.schema._parseAsync({ data: ctx.data, path: ctx.path, parent: ctx }).then((inner) => {\n                    if (inner.status === \"aborted\")\n                        return parseUtil_js_1.INVALID;\n                    if (inner.status === \"dirty\")\n                        status.dirty();\n                    return executeRefinement(inner.value).then(() => {\n                        return { status: status.value, value: inner.value };\n                    });\n                });\n            }\n        }\n        if (effect.type === \"transform\") {\n            if (ctx.common.async === false) {\n                const base = this._def.schema._parseSync({\n                    data: ctx.data,\n                    path: ctx.path,\n                    parent: ctx,\n                });\n                if (!(0, parseUtil_js_1.isValid)(base))\n                    return parseUtil_js_1.INVALID;\n                const result = effect.transform(base.value, checkCtx);\n                if (result instanceof Promise) {\n                    throw new Error(`Asynchronous transform encountered during synchronous parse operation. Use .parseAsync instead.`);\n                }\n                return { status: status.value, value: result };\n            }\n            else {\n                return this._def.schema._parseAsync({ data: ctx.data, path: ctx.path, parent: ctx }).then((base) => {\n                    if (!(0, parseUtil_js_1.isValid)(base))\n                        return parseUtil_js_1.INVALID;\n                    return Promise.resolve(effect.transform(base.value, checkCtx)).then((result) => ({\n                        status: status.value,\n                        value: result,\n                    }));\n                });\n            }\n        }\n        util_js_1.util.assertNever(effect);\n    }\n}\nexports.ZodEffects = ZodEffects;\nexports.ZodTransformer = ZodEffects;\nZodEffects.create = (schema, effect, params) => {\n    return new ZodEffects({\n        schema,\n        typeName: ZodFirstPartyTypeKind.ZodEffects,\n        effect,\n        ...processCreateParams(params),\n    });\n};\nZodEffects.createWithPreprocess = (preprocess, schema, params) => {\n    return new ZodEffects({\n        schema,\n        effect: { type: \"preprocess\", transform: preprocess },\n        typeName: ZodFirstPartyTypeKind.ZodEffects,\n        ...processCreateParams(params),\n    });\n};\nclass ZodOptional extends ZodType {\n    _parse(input) {\n        const parsedType = this._getType(input);\n        if (parsedType === util_js_1.ZodParsedType.undefined) {\n            return (0, parseUtil_js_1.OK)(undefined);\n        }\n        return this._def.innerType._parse(input);\n    }\n    unwrap() {\n        return this._def.innerType;\n    }\n}\nexports.ZodOptional = ZodOptional;\nZodOptional.create = (type, params) => {\n    return new ZodOptional({\n        innerType: type,\n        typeName: ZodFirstPartyTypeKind.ZodOptional,\n        ...processCreateParams(params),\n    });\n};\nclass ZodNullable extends ZodType {\n    _parse(input) {\n        const parsedType = this._getType(input);\n        if (parsedType === util_js_1.ZodParsedType.null) {\n            return (0, parseUtil_js_1.OK)(null);\n        }\n        return this._def.innerType._parse(input);\n    }\n    unwrap() {\n        return this._def.innerType;\n    }\n}\nexports.ZodNullable = ZodNullable;\nZodNullable.create = (type, params) => {\n    return new ZodNullable({\n        innerType: type,\n        typeName: ZodFirstPartyTypeKind.ZodNullable,\n        ...processCreateParams(params),\n    });\n};\nclass ZodDefault extends ZodType {\n    _parse(input) {\n        const { ctx } = this._processInputParams(input);\n        let data = ctx.data;\n        if (ctx.parsedType === util_js_1.ZodParsedType.undefined) {\n            data = this._def.defaultValue();\n        }\n        return this._def.innerType._parse({\n            data,\n            path: ctx.path,\n            parent: ctx,\n        });\n    }\n    removeDefault() {\n        return this._def.innerType;\n    }\n}\nexports.ZodDefault = ZodDefault;\nZodDefault.create = (type, params) => {\n    return new ZodDefault({\n        innerType: type,\n        typeName: ZodFirstPartyTypeKind.ZodDefault,\n        defaultValue: typeof params.default === \"function\" ? params.default : () => params.default,\n        ...processCreateParams(params),\n    });\n};\nclass ZodCatch extends ZodType {\n    _parse(input) {\n        const { ctx } = this._processInputParams(input);\n        // newCtx is used to not collect issues from inner types in ctx\n        const newCtx = {\n            ...ctx,\n            common: {\n                ...ctx.common,\n                issues: [],\n            },\n        };\n        const result = this._def.innerType._parse({\n            data: newCtx.data,\n            path: newCtx.path,\n            parent: {\n                ...newCtx,\n            },\n        });\n        if ((0, parseUtil_js_1.isAsync)(result)) {\n            return result.then((result) => {\n                return {\n                    status: \"valid\",\n                    value: result.status === \"valid\"\n                        ? result.value\n                        : this._def.catchValue({\n                            get error() {\n                                return new ZodError_js_1.ZodError(newCtx.common.issues);\n                            },\n                            input: newCtx.data,\n                        }),\n                };\n            });\n        }\n        else {\n            return {\n                status: \"valid\",\n                value: result.status === \"valid\"\n                    ? result.value\n                    : this._def.catchValue({\n                        get error() {\n                            return new ZodError_js_1.ZodError(newCtx.common.issues);\n                        },\n                        input: newCtx.data,\n                    }),\n            };\n        }\n    }\n    removeCatch() {\n        return this._def.innerType;\n    }\n}\nexports.ZodCatch = ZodCatch;\nZodCatch.create = (type, params) => {\n    return new ZodCatch({\n        innerType: type,\n        typeName: ZodFirstPartyTypeKind.ZodCatch,\n        catchValue: typeof params.catch === \"function\" ? params.catch : () => params.catch,\n        ...processCreateParams(params),\n    });\n};\nclass ZodNaN extends ZodType {\n    _parse(input) {\n        const parsedType = this._getType(input);\n        if (parsedType !== util_js_1.ZodParsedType.nan) {\n            const ctx = this._getOrReturnCtx(input);\n            (0, parseUtil_js_1.addIssueToContext)(ctx, {\n                code: ZodError_js_1.ZodIssueCode.invalid_type,\n                expected: util_js_1.ZodParsedType.nan,\n                received: ctx.parsedType,\n            });\n            return parseUtil_js_1.INVALID;\n        }\n        return { status: \"valid\", value: input.data };\n    }\n}\nexports.ZodNaN = ZodNaN;\nZodNaN.create = (params) => {\n    return new ZodNaN({\n        typeName: ZodFirstPartyTypeKind.ZodNaN,\n        ...processCreateParams(params),\n    });\n};\nexports.BRAND = Symbol(\"zod_brand\");\nclass ZodBranded extends ZodType {\n    _parse(input) {\n        const { ctx } = this._processInputParams(input);\n        const data = ctx.data;\n        return this._def.type._parse({\n            data,\n            path: ctx.path,\n            parent: ctx,\n        });\n    }\n    unwrap() {\n        return this._def.type;\n    }\n}\nexports.ZodBranded = ZodBranded;\nclass ZodPipeline extends ZodType {\n    _parse(input) {\n        const { status, ctx } = this._processInputParams(input);\n        if (ctx.common.async) {\n            const handleAsync = async () => {\n                const inResult = await this._def.in._parseAsync({\n                    data: ctx.data,\n                    path: ctx.path,\n                    parent: ctx,\n                });\n                if (inResult.status === \"aborted\")\n                    return parseUtil_js_1.INVALID;\n                if (inResult.status === \"dirty\") {\n                    status.dirty();\n                    return (0, parseUtil_js_1.DIRTY)(inResult.value);\n                }\n                else {\n                    return this._def.out._parseAsync({\n                        data: inResult.value,\n                        path: ctx.path,\n                        parent: ctx,\n                    });\n                }\n            };\n            return handleAsync();\n        }\n        else {\n            const inResult = this._def.in._parseSync({\n                data: ctx.data,\n                path: ctx.path,\n                parent: ctx,\n            });\n            if (inResult.status === \"aborted\")\n                return parseUtil_js_1.INVALID;\n            if (inResult.status === \"dirty\") {\n                status.dirty();\n                return {\n                    status: \"dirty\",\n                    value: inResult.value,\n                };\n            }\n            else {\n                return this._def.out._parseSync({\n                    data: inResult.value,\n                    path: ctx.path,\n                    parent: ctx,\n                });\n            }\n        }\n    }\n    static create(a, b) {\n        return new ZodPipeline({\n            in: a,\n            out: b,\n            typeName: ZodFirstPartyTypeKind.ZodPipeline,\n        });\n    }\n}\nexports.ZodPipeline = ZodPipeline;\nclass ZodReadonly extends ZodType {\n    _parse(input) {\n        const result = this._def.innerType._parse(input);\n        const freeze = (data) => {\n            if ((0, parseUtil_js_1.isValid)(data)) {\n                data.value = Object.freeze(data.value);\n            }\n            return data;\n        };\n        return (0, parseUtil_js_1.isAsync)(result) ? result.then((data) => freeze(data)) : freeze(result);\n    }\n    unwrap() {\n        return this._def.innerType;\n    }\n}\nexports.ZodReadonly = ZodReadonly;\nZodReadonly.create = (type, params) => {\n    return new ZodReadonly({\n        innerType: type,\n        typeName: ZodFirstPartyTypeKind.ZodReadonly,\n        ...processCreateParams(params),\n    });\n};\n////////////////////////////////////////\n////////////////////////////////////////\n//////////                    //////////\n//////////      z.custom      //////////\n//////////                    //////////\n////////////////////////////////////////\n////////////////////////////////////////\nfunction cleanParams(params, data) {\n    const p = typeof params === \"function\" ? params(data) : typeof params === \"string\" ? { message: params } : params;\n    const p2 = typeof p === \"string\" ? { message: p } : p;\n    return p2;\n}\nfunction custom(check, _params = {}, \n/**\n * @deprecated\n *\n * Pass `fatal` into the params object instead:\n *\n * ```ts\n * z.string().custom((val) => val.length > 5, { fatal: false })\n * ```\n *\n */\nfatal) {\n    if (check)\n        return ZodAny.create().superRefine((data, ctx) => {\n            const r = check(data);\n            if (r instanceof Promise) {\n                return r.then((r) => {\n                    if (!r) {\n                        const params = cleanParams(_params, data);\n                        const _fatal = params.fatal ?? fatal ?? true;\n                        ctx.addIssue({ code: \"custom\", ...params, fatal: _fatal });\n                    }\n                });\n            }\n            if (!r) {\n                const params = cleanParams(_params, data);\n                const _fatal = params.fatal ?? fatal ?? true;\n                ctx.addIssue({ code: \"custom\", ...params, fatal: _fatal });\n            }\n            return;\n        });\n    return ZodAny.create();\n}\nexports.late = {\n    object: ZodObject.lazycreate,\n};\nvar ZodFirstPartyTypeKind;\n(function (ZodFirstPartyTypeKind) {\n    ZodFirstPartyTypeKind[\"ZodString\"] = \"ZodString\";\n    ZodFirstPartyTypeKind[\"ZodNumber\"] = \"ZodNumber\";\n    ZodFirstPartyTypeKind[\"ZodNaN\"] = \"ZodNaN\";\n    ZodFirstPartyTypeKind[\"ZodBigInt\"] = \"ZodBigInt\";\n    ZodFirstPartyTypeKind[\"ZodBoolean\"] = \"ZodBoolean\";\n    ZodFirstPartyTypeKind[\"ZodDate\"] = \"ZodDate\";\n    ZodFirstPartyTypeKind[\"ZodSymbol\"] = \"ZodSymbol\";\n    ZodFirstPartyTypeKind[\"ZodUndefined\"] = \"ZodUndefined\";\n    ZodFirstPartyTypeKind[\"ZodNull\"] = \"ZodNull\";\n    ZodFirstPartyTypeKind[\"ZodAny\"] = \"ZodAny\";\n    ZodFirstPartyTypeKind[\"ZodUnknown\"] = \"ZodUnknown\";\n    ZodFirstPartyTypeKind[\"ZodNever\"] = \"ZodNever\";\n    ZodFirstPartyTypeKind[\"ZodVoid\"] = \"ZodVoid\";\n    ZodFirstPartyTypeKind[\"ZodArray\"] = \"ZodArray\";\n    ZodFirstPartyTypeKind[\"ZodObject\"] = \"ZodObject\";\n    ZodFirstPartyTypeKind[\"ZodUnion\"] = \"ZodUnion\";\n    ZodFirstPartyTypeKind[\"ZodDiscriminatedUnion\"] = \"ZodDiscriminatedUnion\";\n    ZodFirstPartyTypeKind[\"ZodIntersection\"] = \"ZodIntersection\";\n    ZodFirstPartyTypeKind[\"ZodTuple\"] = \"ZodTuple\";\n    ZodFirstPartyTypeKind[\"ZodRecord\"] = \"ZodRecord\";\n    ZodFirstPartyTypeKind[\"ZodMap\"] = \"ZodMap\";\n    ZodFirstPartyTypeKind[\"ZodSet\"] = \"ZodSet\";\n    ZodFirstPartyTypeKind[\"ZodFunction\"] = \"ZodFunction\";\n    ZodFirstPartyTypeKind[\"ZodLazy\"] = \"ZodLazy\";\n    ZodFirstPartyTypeKind[\"ZodLiteral\"] = \"ZodLiteral\";\n    ZodFirstPartyTypeKind[\"ZodEnum\"] = \"ZodEnum\";\n    ZodFirstPartyTypeKind[\"ZodEffects\"] = \"ZodEffects\";\n    ZodFirstPartyTypeKind[\"ZodNativeEnum\"] = \"ZodNativeEnum\";\n    ZodFirstPartyTypeKind[\"ZodOptional\"] = \"ZodOptional\";\n    ZodFirstPartyTypeKind[\"ZodNullable\"] = \"ZodNullable\";\n    ZodFirstPartyTypeKind[\"ZodDefault\"] = \"ZodDefault\";\n    ZodFirstPartyTypeKind[\"ZodCatch\"] = \"ZodCatch\";\n    ZodFirstPartyTypeKind[\"ZodPromise\"] = \"ZodPromise\";\n    ZodFirstPartyTypeKind[\"ZodBranded\"] = \"ZodBranded\";\n    ZodFirstPartyTypeKind[\"ZodPipeline\"] = \"ZodPipeline\";\n    ZodFirstPartyTypeKind[\"ZodReadonly\"] = \"ZodReadonly\";\n})(ZodFirstPartyTypeKind || (exports.ZodFirstPartyTypeKind = ZodFirstPartyTypeKind = {}));\n// requires TS 4.4+\nclass Class {\n    constructor(..._) { }\n}\nconst instanceOfType = (\n// const instanceOfType = <T extends new (...args: any[]) => any>(\ncls, params = {\n    message: `Input not instance of ${cls.name}`,\n}) => custom((data) => data instanceof cls, params);\nexports.instanceof = instanceOfType;\nconst stringType = ZodString.create;\nexports.string = stringType;\nconst numberType = ZodNumber.create;\nexports.number = numberType;\nconst nanType = ZodNaN.create;\nexports.nan = nanType;\nconst bigIntType = ZodBigInt.create;\nexports.bigint = bigIntType;\nconst booleanType = ZodBoolean.create;\nexports.boolean = booleanType;\nconst dateType = ZodDate.create;\nexports.date = dateType;\nconst symbolType = ZodSymbol.create;\nexports.symbol = symbolType;\nconst undefinedType = ZodUndefined.create;\nexports.undefined = undefinedType;\nconst nullType = ZodNull.create;\nexports.null = nullType;\nconst anyType = ZodAny.create;\nexports.any = anyType;\nconst unknownType = ZodUnknown.create;\nexports.unknown = unknownType;\nconst neverType = ZodNever.create;\nexports.never = neverType;\nconst voidType = ZodVoid.create;\nexports.void = voidType;\nconst arrayType = ZodArray.create;\nexports.array = arrayType;\nconst objectType = ZodObject.create;\nexports.object = objectType;\nconst strictObjectType = ZodObject.strictCreate;\nexports.strictObject = strictObjectType;\nconst unionType = ZodUnion.create;\nexports.union = unionType;\nconst discriminatedUnionType = ZodDiscriminatedUnion.create;\nexports.discriminatedUnion = discriminatedUnionType;\nconst intersectionType = ZodIntersection.create;\nexports.intersection = intersectionType;\nconst tupleType = ZodTuple.create;\nexports.tuple = tupleType;\nconst recordType = ZodRecord.create;\nexports.record = recordType;\nconst mapType = ZodMap.create;\nexports.map = mapType;\nconst setType = ZodSet.create;\nexports.set = setType;\nconst functionType = ZodFunction.create;\nexports.function = functionType;\nconst lazyType = ZodLazy.create;\nexports.lazy = lazyType;\nconst literalType = ZodLiteral.create;\nexports.literal = literalType;\nconst enumType = ZodEnum.create;\nexports.enum = enumType;\nconst nativeEnumType = ZodNativeEnum.create;\nexports.nativeEnum = nativeEnumType;\nconst promiseType = ZodPromise.create;\nexports.promise = promiseType;\nconst effectsType = ZodEffects.create;\nexports.effect = effectsType;\nexports.transformer = effectsType;\nconst optionalType = ZodOptional.create;\nexports.optional = optionalType;\nconst nullableType = ZodNullable.create;\nexports.nullable = nullableType;\nconst preprocessType = ZodEffects.createWithPreprocess;\nexports.preprocess = preprocessType;\nconst pipelineType = ZodPipeline.create;\nexports.pipeline = pipelineType;\nconst ostring = () => stringType().optional();\nexports.ostring = ostring;\nconst onumber = () => numberType().optional();\nexports.onumber = onumber;\nconst oboolean = () => booleanType().optional();\nexports.oboolean = oboolean;\nexports.coerce = {\n    string: ((arg) => ZodString.create({ ...arg, coerce: true })),\n    number: ((arg) => ZodNumber.create({ ...arg, coerce: true })),\n    boolean: ((arg) => ZodBoolean.create({\n        ...arg,\n        coerce: true,\n    })),\n    bigint: ((arg) => ZodBigInt.create({ ...arg, coerce: true })),\n    date: ((arg) => ZodDate.create({ ...arg, coerce: true })),\n};\nexports.NEVER = parseUtil_js_1.INVALID;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./errors.cjs\"), exports);\n__exportStar(require(\"./helpers/parseUtil.cjs\"), exports);\n__exportStar(require(\"./helpers/typeAliases.cjs\"), exports);\n__exportStar(require(\"./helpers/util.cjs\"), exports);\n__exportStar(require(\"./types.cjs\"), exports);\n__exportStar(require(\"./ZodError.cjs\"), exports);\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.z = void 0;\nconst z = __importStar(require(\"./v3/external.cjs\"));\nexports.z = z;\n__exportStar(require(\"./v3/external.cjs\"), exports);\nexports.default = z;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isRawGtx = isRawGtx;\nconst buffer_1 = require(\"buffer\");\nconst zod_1 = require(\"zod\");\nconst bufferSchema = zod_1.z.custom(val => buffer_1.Buffer.isBuffer(val), {\n    message: \"Expected Buffer\",\n});\nconst rawGtvSchema = zod_1.z.lazy(() => zod_1.z.union([\n    zod_1.z.null(),\n    zod_1.z.boolean(),\n    bufferSchema,\n    zod_1.z.string(),\n    zod_1.z.number(),\n    zod_1.z.bigint(),\n    zod_1.z.array(rawGtvSchema),\n    zod_1.z.record(rawGtvSchema),\n]));\nconst rawGtxOpSchema = zod_1.z.tuple([zod_1.z.string(), zod_1.z.array(rawGtvSchema)]);\nconst rawGtxBodySchema = zod_1.z.tuple([bufferSchema, zod_1.z.array(rawGtxOpSchema), zod_1.z.array(bufferSchema)]);\nconst rawGtxSchema = zod_1.z.tuple([rawGtxBodySchema, zod_1.z.array(bufferSchema)]);\nfunction isRawGtx(value) {\n    const result = rawGtxSchema.safeParse(value);\n    return result.success;\n}\n//# sourceMappingURL=rawGtx.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isBuffer = isBuffer;\nconst buffer_1 = require(\"buffer\");\n/**\n * Type guard to check if a value is a Buffer instance.\n * Works correctly with Buffer imported from the 'buffer' package.\n */\nfunction isBuffer(value) {\n    return buffer_1.Buffer.isBuffer(value);\n}\n//# sourceMappingURL=bufferUtils.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PgBytesInputException = void 0;\nexports.pgBytes = pgBytes;\nexports.toBuffer = toBuffer;\nexports.toString = toString;\nexports.toQueryObjectGTV = toQueryObjectGTV;\nexports.ensureBuffer = ensureBuffer;\nexports.ensureString = ensureString;\nexports.checkGtvType = checkGtvType;\nexports.rawGtxToGtx = rawGtxToGtx;\nexports.rawGtxToRawGtxBody = rawGtxToRawGtxBody;\nexports.checkGtxType = checkGtxType;\nexports.removeDuplicateSigners = removeDuplicateSigners;\nexports.matchRellErrorString = matchRellErrorString;\nconst buffer_1 = require(\"buffer\");\nconst rawGtx_1 = require(\"./blockchainClient/validation/rawGtx\");\nconst bufferUtils_1 = require(\"./utils/bufferUtils\");\nfunction pgBytes(buffer) {\n    if (!buffer_1.Buffer.isBuffer(buffer)) {\n        throw new PgBytesInputException(buffer);\n    }\n    return `\\\\x${buffer.toString(\"hex\")}`;\n}\n/**\n * Converts hex string to Buffer\n * @param key: string\n * @returns {Buffer}\n */\nfunction toBuffer(key) {\n    return buffer_1.Buffer.from(key, \"hex\");\n}\n/**\n * Converts Buffer to hex string\n * @param buffer: Buffer\n * @returns {string}\n */\nfunction toString(buffer) {\n    return buffer.toString(\"hex\").toUpperCase();\n}\nfunction toQueryObjectGTV(nameOrObject, queryArguments) {\n    if (typeof nameOrObject === \"string\") {\n        return [nameOrObject, Object.assign({}, queryArguments)];\n    }\n    else {\n        const { name, args } = nameOrObject;\n        return [name, args || {}];\n    }\n}\nclass PgBytesInputException extends Error {\n    constructor(buffer) {\n        super(`util.pgBytes expects a buffer, but got ${typeof buffer}`);\n    }\n}\nexports.PgBytesInputException = PgBytesInputException;\nfunction ensureBuffer(value) {\n    if ((0, bufferUtils_1.isBuffer)(value)) {\n        return value;\n    }\n    return toBuffer(value);\n}\nfunction ensureString(value) {\n    if (typeof value === \"string\") {\n        return value.toUpperCase();\n    }\n    else {\n        return toString(value);\n    }\n}\nfunction checkGtvType(value) {\n    try {\n        if (value == null) {\n            return true;\n        }\n        if (buffer_1.Buffer.isBuffer(value)) {\n            return true;\n        }\n        if (typeof value === \"string\" || typeof value === \"bigint\") {\n            return true;\n        }\n        if (typeof value === \"number\") {\n            if (!Number.isInteger(value)) {\n                throw Error(\"User error: Only integers are supported\");\n            }\n            return true;\n        }\n        if (Array.isArray(value)) {\n            return value.every(item => checkGtvType(item));\n        }\n        if (typeof value === \"object\") {\n            return Object.values(value).every(val => checkGtvType(val));\n        }\n    }\n    catch (error) {\n        throw new Error(`Failed to check type: ${error}`);\n    }\n    return false;\n}\nfunction rawGtxToGtx(rawGtx) {\n    const rawGtxBody = rawGtx[0];\n    const signatures = rawGtx[1];\n    const gtxBody = {\n        blockchainRid: rawGtxBody[0],\n        operations: rawGtxBody[1].map((operation) => ({\n            opName: operation[0],\n            args: operation[1],\n        })),\n        signers: rawGtxBody[2],\n    };\n    return {\n        blockchainRid: gtxBody.blockchainRid,\n        operations: gtxBody.operations,\n        signers: gtxBody.signers,\n        signatures,\n    };\n}\nfunction rawGtxToRawGtxBody(rawGtx) {\n    return rawGtx[0];\n}\nfunction checkGtxType(value) {\n    if (!(0, rawGtx_1.isRawGtx)(value))\n        return false;\n    try {\n        rawGtxToGtx(value);\n        return true;\n    }\n    catch (error) {\n        return false;\n    }\n}\nfunction removeDuplicateSigners(signers) {\n    const signersAsString = [];\n    signers.forEach(item => {\n        const itemAsString = item.toString(\"hex\");\n        if (!signersAsString.includes(itemAsString)) {\n            signersAsString.push(itemAsString);\n        }\n    });\n    const result = [];\n    signersAsString.forEach(item => {\n        result.push(buffer_1.Buffer.from(item, \"hex\"));\n    });\n    return result;\n}\nfunction matchRellErrorString(rellError) {\n    const parsed = rellError.match(/\\[([^\\]]+)\\]\\sOperation\\s'([^']+)'\\sfailed:\\s(.+)$/);\n    if (!parsed)\n        return {};\n    const [rellLine, operation, shortReason] = parsed.slice(1);\n    return { shortReason, rellLine, operation };\n}\n//# sourceMappingURL=formatter.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.encodeValue = encodeValue;\nexports.encodeValueGtx = encodeValueGtx;\nexports.decodeValue = decodeValue;\nexports.decodeValueGtx = decodeValueGtx;\nexports.parseValue = parseValue;\nexports.createTypedArg = createTypedArg;\nconst buffer_1 = require(\"buffer\");\nconst definition_1 = require(\"../gtv/definition\");\nconst bn_js_1 = require(\"bn.js\");\nconst errors_1 = require(\"./errors\");\nconst formatter_1 = require(\"../formatter\");\nfunction encodeValue(rawGtv) {\n    return definition_1.rawGTV.encode(createTypedArg(rawGtv));\n}\nfunction encodeValueGtx(rawGtx) {\n    return encodeValue(rawGtx);\n}\nfunction decodeValue(bytes) {\n    try {\n        const obj = definition_1.rawGTV.decode(bytes);\n        return parseValue(obj);\n    }\n    catch (error) {\n        throw new Error(`Invalid GTV data. ${error}`);\n    }\n}\nfunction decodeValueGtx(bytes) {\n    const decodedValue = decodeValue(bytes);\n    if (!(0, formatter_1.checkGtxType)(decodedValue)) {\n        throw new Error(`Unexpected type of value: ${decodedValue}, expected decoded value to be of type RawGtx`);\n    }\n    return decodedValue;\n}\nfunction parseValue(typedArg) {\n    var _a, _b;\n    if (typedArg.type === \"null\") {\n        return null;\n    }\n    else if (typedArg.type === \"byteArray\") {\n        return typedArg.value;\n    }\n    else if (typedArg.type === \"string\") {\n        return typedArg.value;\n    }\n    else if (typedArg.type === \"integer\") {\n        return Number(typedArg.value);\n    }\n    else if (typedArg.type === \"array\") {\n        const arrayValue = typedArg.value;\n        return arrayValue.map((item) => parseValue(item));\n    }\n    else if (typedArg.type === \"bigInteger\") {\n        return BigInt((_b = (_a = typedArg.value) === null || _a === void 0 ? void 0 : _a.toString()) !== null && _b !== void 0 ? _b : \"\");\n    }\n    else if (typedArg.type === \"dict\") {\n        const arrayValue = typedArg.value;\n        const result = {};\n        arrayValue.forEach((pair) => {\n            result[pair.name] = parseValue(pair.value);\n        });\n        return result;\n    }\n    else {\n        throw new errors_1.UnexpectedArgumentTypeError(typedArg);\n    }\n}\nfunction createTypedArg(value) {\n    try {\n        if (value == null) {\n            return { type: \"null\", value: null };\n        }\n        if (buffer_1.Buffer.isBuffer(value)) {\n            return { type: \"byteArray\", value: value };\n        }\n        if (typeof value === \"boolean\") {\n            return { type: \"integer\", value: value ? 1 : 0 };\n        }\n        if (typeof value === \"string\") {\n            return { type: \"string\", value: value };\n        }\n        if (typeof value === \"number\") {\n            if (!Number.isInteger(value)) {\n                throw Error(\"User error: Only integers are supported\");\n            }\n            return { type: \"integer\", value: new bn_js_1.BN(value) };\n        }\n        if (typeof value === \"bigint\") {\n            return { type: \"bigInteger\", value: new bn_js_1.BN(value.toString()) };\n        }\n        if (value.constructor === Array) {\n            return {\n                type: \"array\",\n                value: value.map(item => createTypedArg(item)),\n            };\n        }\n        if (typeof value === \"object\") {\n            let valueAsDictPair = value;\n            if (isDictPairWithStringKey(valueAsDictPair)) {\n                valueAsDictPair = sortDictPairByKey(valueAsDictPair);\n            }\n            return {\n                type: \"dict\",\n                value: Object.keys(valueAsDictPair).map(function (key) {\n                    return { name: key, value: createTypedArg(valueAsDictPair[key]) };\n                }),\n            };\n        }\n    }\n    catch (error) {\n        const message = value ? value.toString() : \"RawGtv\";\n        throw new Error(`Failed to encode ${message}: ${error}`);\n    }\n    throw new Error(`value ${value} have unsupported type: ${typeof value}`);\n}\nfunction isDictPairWithStringKey(obj) {\n    for (const key in obj) {\n        if (typeof key !== \"string\") {\n            return false;\n        }\n    }\n    return true;\n}\nfunction sortDictPairByKey(dict) {\n    const sortedArray = Object.entries(dict).sort(([keyA], [keyB]) => {\n        if (keyA < keyB) {\n            return -1;\n        }\n        if (keyA > keyB) {\n            return 1;\n        }\n        return 0;\n    });\n    const sortedDict = {};\n    for (const [key, value] of sortedArray) {\n        sortedDict[key] = value;\n    }\n    return sortedDict;\n}\n//# sourceMappingURL=serialization.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MERKLE_HASH_VERSIONS = void 0;\nexports.MERKLE_HASH_VERSIONS = {\n    ONE: 1,\n    TWO: 2,\n    UNSET: NaN,\n};\n//# sourceMappingURL=constants.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.gtvHash = exports.decode = exports.encode = void 0;\nconst merklehashts_1 = require(\"merklehashts\");\nconst serialization = __importStar(require(\"../gtx/serialization\"));\nconst constants_1 = require(\"../utils/constants\");\nconst gtvHash2 = (obj, merkleHashVersion) => {\n    if (!Object.values(constants_1.MERKLE_HASH_VERSIONS).includes(merkleHashVersion)) {\n        throw new Error(\"Merkle hash version is not valid\");\n    }\n    if (isNaN(merkleHashVersion)) {\n        throw new Error(\"Merkle hash version is not set\");\n    }\n    return (0, merklehashts_1.gtvHash)(obj, merkleHashVersion);\n};\nexports.gtvHash = gtvHash2;\nconst encode = serialization.encodeValue;\nexports.encode = encode;\nconst decode = serialization.decodeValue;\nexports.decode = decode;\n//# sourceMappingURL=index.js.map","const errors = {\n  IMPOSSIBLE_CASE: 'Impossible case. Please create issue.',\n  TWEAK_ADD:\n    'The tweak was out of range or the resulted private key is invalid',\n  TWEAK_MUL: 'The tweak was out of range or equal to zero',\n  CONTEXT_RANDOMIZE_UNKNOW: 'Unknow error on context randomization',\n  SECKEY_INVALID: 'Private Key is invalid',\n  PUBKEY_PARSE: 'Public Key could not be parsed',\n  PUBKEY_SERIALIZE: 'Public Key serialization error',\n  PUBKEY_COMBINE: 'The sum of the public keys is not valid',\n  SIG_PARSE: 'Signature could not be parsed',\n  SIGN: 'The nonce generation function failed, or the private key was invalid',\n  RECOVER: 'Public key could not be recover',\n  ECDH: 'Scalar was invalid (zero or overflow)'\n}\n\nfunction assert (cond, msg) {\n  if (!cond) throw new Error(msg)\n}\n\nfunction isUint8Array (name, value, length) {\n  assert(value instanceof Uint8Array, `Expected ${name} to be an Uint8Array`)\n\n  if (length !== undefined) {\n    if (Array.isArray(length)) {\n      const numbers = length.join(', ')\n      const msg = `Expected ${name} to be an Uint8Array with length [${numbers}]`\n      assert(length.includes(value.length), msg)\n    } else {\n      const msg = `Expected ${name} to be an Uint8Array with length ${length}`\n      assert(value.length === length, msg)\n    }\n  }\n}\n\nfunction isCompressed (value) {\n  assert(toTypeString(value) === 'Boolean', 'Expected compressed to be a Boolean')\n}\n\nfunction getAssertedOutput (output = (len) => new Uint8Array(len), length) {\n  if (typeof output === 'function') output = output(length)\n  isUint8Array('output', output, length)\n  return output\n}\n\nfunction toTypeString (value) {\n  return Object.prototype.toString.call(value).slice(8, -1)\n}\n\nmodule.exports = (secp256k1) => {\n  return {\n    contextRandomize (seed) {\n      assert(\n        seed === null || seed instanceof Uint8Array,\n        'Expected seed to be an Uint8Array or null'\n      )\n      if (seed !== null) isUint8Array('seed', seed, 32)\n\n      switch (secp256k1.contextRandomize(seed)) {\n        case 1:\n          throw new Error(errors.CONTEXT_RANDOMIZE_UNKNOW)\n      }\n    },\n\n    privateKeyVerify (seckey) {\n      isUint8Array('private key', seckey, 32)\n\n      return secp256k1.privateKeyVerify(seckey) === 0\n    },\n\n    privateKeyNegate (seckey) {\n      isUint8Array('private key', seckey, 32)\n\n      switch (secp256k1.privateKeyNegate(seckey)) {\n        case 0:\n          return seckey\n        case 1:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n      }\n    },\n\n    privateKeyTweakAdd (seckey, tweak) {\n      isUint8Array('private key', seckey, 32)\n      isUint8Array('tweak', tweak, 32)\n\n      switch (secp256k1.privateKeyTweakAdd(seckey, tweak)) {\n        case 0:\n          return seckey\n        case 1:\n          throw new Error(errors.TWEAK_ADD)\n      }\n    },\n\n    privateKeyTweakMul (seckey, tweak) {\n      isUint8Array('private key', seckey, 32)\n      isUint8Array('tweak', tweak, 32)\n\n      switch (secp256k1.privateKeyTweakMul(seckey, tweak)) {\n        case 0:\n          return seckey\n        case 1:\n          throw new Error(errors.TWEAK_MUL)\n      }\n    },\n\n    publicKeyVerify (pubkey) {\n      isUint8Array('public key', pubkey, [33, 65])\n\n      return secp256k1.publicKeyVerify(pubkey) === 0\n    },\n\n    publicKeyCreate (seckey, compressed = true, output) {\n      isUint8Array('private key', seckey, 32)\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyCreate(output, seckey)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.SECKEY_INVALID)\n        case 2:\n          throw new Error(errors.PUBKEY_SERIALIZE)\n      }\n    },\n\n    publicKeyConvert (pubkey, compressed = true, output) {\n      isUint8Array('public key', pubkey, [33, 65])\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyConvert(output, pubkey)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.PUBKEY_SERIALIZE)\n      }\n    },\n\n    publicKeyNegate (pubkey, compressed = true, output) {\n      isUint8Array('public key', pubkey, [33, 65])\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyNegate(output, pubkey)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n        case 3:\n          throw new Error(errors.PUBKEY_SERIALIZE)\n      }\n    },\n\n    publicKeyCombine (pubkeys, compressed = true, output) {\n      assert(Array.isArray(pubkeys), 'Expected public keys to be an Array')\n      assert(pubkeys.length > 0, 'Expected public keys array will have more than zero items')\n      for (const pubkey of pubkeys) {\n        isUint8Array('public key', pubkey, [33, 65])\n      }\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyCombine(output, pubkeys)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.PUBKEY_COMBINE)\n        case 3:\n          throw new Error(errors.PUBKEY_SERIALIZE)\n      }\n    },\n\n    publicKeyTweakAdd (pubkey, tweak, compressed = true, output) {\n      isUint8Array('public key', pubkey, [33, 65])\n      isUint8Array('tweak', tweak, 32)\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyTweakAdd(output, pubkey, tweak)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.TWEAK_ADD)\n      }\n    },\n\n    publicKeyTweakMul (pubkey, tweak, compressed = true, output) {\n      isUint8Array('public key', pubkey, [33, 65])\n      isUint8Array('tweak', tweak, 32)\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyTweakMul(output, pubkey, tweak)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.TWEAK_MUL)\n      }\n    },\n\n    signatureNormalize (sig) {\n      isUint8Array('signature', sig, 64)\n\n      switch (secp256k1.signatureNormalize(sig)) {\n        case 0:\n          return sig\n        case 1:\n          throw new Error(errors.SIG_PARSE)\n      }\n    },\n\n    signatureExport (sig, output) {\n      isUint8Array('signature', sig, 64)\n      output = getAssertedOutput(output, 72)\n\n      const obj = { output, outputlen: 72 }\n      switch (secp256k1.signatureExport(obj, sig)) {\n        case 0:\n          return output.slice(0, obj.outputlen)\n        case 1:\n          throw new Error(errors.SIG_PARSE)\n        case 2:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n      }\n    },\n\n    signatureImport (sig, output) {\n      isUint8Array('signature', sig)\n      output = getAssertedOutput(output, 64)\n\n      switch (secp256k1.signatureImport(output, sig)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.SIG_PARSE)\n        case 2:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n      }\n    },\n\n    ecdsaSign (msg32, seckey, options = {}, output) {\n      isUint8Array('message', msg32, 32)\n      isUint8Array('private key', seckey, 32)\n      assert(toTypeString(options) === 'Object', 'Expected options to be an Object')\n      if (options.data !== undefined) isUint8Array('options.data', options.data)\n      if (options.noncefn !== undefined) assert(toTypeString(options.noncefn) === 'Function', 'Expected options.noncefn to be a Function')\n      output = getAssertedOutput(output, 64)\n\n      const obj = { signature: output, recid: null }\n      switch (secp256k1.ecdsaSign(obj, msg32, seckey, options.data, options.noncefn)) {\n        case 0:\n          return obj\n        case 1:\n          throw new Error(errors.SIGN)\n        case 2:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n      }\n    },\n\n    ecdsaVerify (sig, msg32, pubkey) {\n      isUint8Array('signature', sig, 64)\n      isUint8Array('message', msg32, 32)\n      isUint8Array('public key', pubkey, [33, 65])\n\n      switch (secp256k1.ecdsaVerify(sig, msg32, pubkey)) {\n        case 0:\n          return true\n        case 3:\n          return false\n        case 1:\n          throw new Error(errors.SIG_PARSE)\n        case 2:\n          throw new Error(errors.PUBKEY_PARSE)\n      }\n    },\n\n    ecdsaRecover (sig, recid, msg32, compressed = true, output) {\n      isUint8Array('signature', sig, 64)\n      assert(\n        toTypeString(recid) === 'Number' &&\n          recid >= 0 &&\n          recid <= 3,\n        'Expected recovery id to be a Number within interval [0, 3]'\n      )\n      isUint8Array('message', msg32, 32)\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.ecdsaRecover(output, sig, recid, msg32)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.SIG_PARSE)\n        case 2:\n          throw new Error(errors.RECOVER)\n        case 3:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n      }\n    },\n\n    ecdh (pubkey, seckey, options = {}, output) {\n      isUint8Array('public key', pubkey, [33, 65])\n      isUint8Array('private key', seckey, 32)\n      assert(toTypeString(options) === 'Object', 'Expected options to be an Object')\n      if (options.data !== undefined) isUint8Array('options.data', options.data)\n      if (options.hashfn !== undefined) {\n        assert(toTypeString(options.hashfn) === 'Function', 'Expected options.hashfn to be a Function')\n        if (options.xbuf !== undefined) isUint8Array('options.xbuf', options.xbuf, 32)\n        if (options.ybuf !== undefined) isUint8Array('options.ybuf', options.ybuf, 32)\n        isUint8Array('output', output)\n      } else {\n        output = getAssertedOutput(output, 32)\n      }\n\n      switch (secp256k1.ecdh(output, pubkey, seckey, options.data, options.hashfn, options.xbuf, options.ybuf)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.ECDH)\n      }\n    }\n  }\n}\n","const EC = require('elliptic').ec\n\nconst ec = new EC('secp256k1')\nconst ecparams = ec.curve\n\n// Hack, we can not use bn.js@5, while elliptic uses bn.js@4\n// See https://github.com/indutny/elliptic/issues/191#issuecomment-569888758\nconst BN = ecparams.n.constructor\n\nfunction loadCompressedPublicKey (first, xbuf) {\n  let x = new BN(xbuf)\n\n  // overflow\n  if (x.cmp(ecparams.p) >= 0) return null\n  x = x.toRed(ecparams.red)\n\n  // compute corresponding Y\n  let y = x.redSqr().redIMul(x).redIAdd(ecparams.b).redSqrt()\n  if ((first === 0x03) !== y.isOdd()) y = y.redNeg()\n\n  // 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, xbuf, ybuf) {\n  let x = new BN(xbuf)\n  let y = new BN(ybuf)\n\n  // overflow\n  if (x.cmp(ecparams.p) >= 0 || y.cmp(ecparams.p) >= 0) return null\n\n  x = x.toRed(ecparams.red)\n  y = y.toRed(ecparams.red)\n\n  // is odd flag\n  if ((first === 0x06 || first === 0x07) && y.isOdd() !== (first === 0x07)) return null\n\n  // x*x*x + b = y*y\n  const x3 = x.redSqr().redIMul(x)\n  if (!y.redSqr().redISub(x3.redIAdd(ecparams.b)).isZero()) return null\n\n  return ec.keyPair({ pub: { x: x, y: y } })\n}\n\nfunction loadPublicKey (pubkey) {\n  // length should be validated in interface\n  const first = pubkey[0]\n  switch (first) {\n    case 0x02:\n    case 0x03:\n      if (pubkey.length !== 33) return null\n      return loadCompressedPublicKey(first, pubkey.subarray(1, 33))\n    case 0x04:\n    case 0x06:\n    case 0x07:\n      if (pubkey.length !== 65) return null\n      return loadUncompressedPublicKey(first, pubkey.subarray(1, 33), pubkey.subarray(33, 65))\n    default:\n      return null\n  }\n}\n\nfunction savePublicKey (output, point) {\n  const pubkey = point.encode(null, output.length === 33)\n  // Loop should be faster because we do not need create extra Uint8Array\n  // output.set(new Uint8Array(pubkey))\n  for (let i = 0; i < output.length; ++i) output[i] = pubkey[i]\n}\n\nmodule.exports = {\n  contextRandomize () {\n    return 0\n  },\n\n  privateKeyVerify (seckey) {\n    const bn = new BN(seckey)\n    return bn.cmp(ecparams.n) < 0 && !bn.isZero() ? 0 : 1\n  },\n\n  privateKeyNegate (seckey) {\n    const bn = new BN(seckey)\n    const negate = ecparams.n.sub(bn).umod(ecparams.n).toArrayLike(Uint8Array, 'be', 32)\n    seckey.set(negate)\n    return 0\n  },\n\n  privateKeyTweakAdd (seckey, tweak) {\n    const bn = new BN(tweak)\n    if (bn.cmp(ecparams.n) >= 0) return 1\n\n    bn.iadd(new BN(seckey))\n    if (bn.cmp(ecparams.n) >= 0) bn.isub(ecparams.n)\n    if (bn.isZero()) return 1\n\n    const tweaked = bn.toArrayLike(Uint8Array, 'be', 32)\n    seckey.set(tweaked)\n\n    return 0\n  },\n\n  privateKeyTweakMul (seckey, tweak) {\n    let bn = new BN(tweak)\n    if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) return 1\n\n    bn.imul(new BN(seckey))\n    if (bn.cmp(ecparams.n) >= 0) bn = bn.umod(ecparams.n)\n\n    const tweaked = bn.toArrayLike(Uint8Array, 'be', 32)\n    seckey.set(tweaked)\n\n    return 0\n  },\n\n  publicKeyVerify (pubkey) {\n    const pair = loadPublicKey(pubkey)\n    return pair === null ? 1 : 0\n  },\n\n  publicKeyCreate (output, seckey) {\n    const bn = new BN(seckey)\n    if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) return 1\n\n    const point = ec.keyFromPrivate(seckey).getPublic()\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  publicKeyConvert (output, pubkey) {\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 1\n\n    const point = pair.getPublic()\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  publicKeyNegate (output, pubkey) {\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 1\n\n    const point = pair.getPublic()\n    point.y = point.y.redNeg()\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  publicKeyCombine (output, pubkeys) {\n    const pairs = new Array(pubkeys.length)\n    for (let i = 0; i < pubkeys.length; ++i) {\n      pairs[i] = loadPublicKey(pubkeys[i])\n      if (pairs[i] === null) return 1\n    }\n\n    let point = pairs[0].getPublic()\n    for (let i = 1; i < pairs.length; ++i) point = point.add(pairs[i].pub)\n    if (point.isInfinity()) return 2\n\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  publicKeyTweakAdd (output, pubkey, tweak) {\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 1\n\n    tweak = new BN(tweak)\n    if (tweak.cmp(ecparams.n) >= 0) return 2\n\n    const point = pair.getPublic().add(ecparams.g.mul(tweak))\n    if (point.isInfinity()) return 2\n\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  publicKeyTweakMul (output, pubkey, tweak) {\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 1\n\n    tweak = new BN(tweak)\n    if (tweak.cmp(ecparams.n) >= 0 || tweak.isZero()) return 2\n\n    const point = pair.getPublic().mul(tweak)\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  signatureNormalize (sig) {\n    const r = new BN(sig.subarray(0, 32))\n    const s = new BN(sig.subarray(32, 64))\n    if (r.cmp(ecparams.n) >= 0 || s.cmp(ecparams.n) >= 0) return 1\n\n    if (s.cmp(ec.nh) === 1) {\n      sig.set(ecparams.n.sub(s).toArrayLike(Uint8Array, 'be', 32), 32)\n    }\n\n    return 0\n  },\n\n  // Copied 1-to-1 from https://github.com/bitcoinjs/bip66/blob/master/index.js\n  // Adapted for Uint8Array instead Buffer\n  signatureExport (obj, sig) {\n    const sigR = sig.subarray(0, 32)\n    const sigS = sig.subarray(32, 64)\n    if (new BN(sigR).cmp(ecparams.n) >= 0) return 1\n    if (new BN(sigS).cmp(ecparams.n) >= 0) return 1\n\n    const { output } = obj\n\n    // Prepare R\n    let r = output.subarray(4, 4 + 33)\n    r[0] = 0x00\n    r.set(sigR, 1)\n\n    let lenR = 33\n    let posR = 0\n    for (; lenR > 1 && r[posR] === 0x00 && !(r[posR + 1] & 0x80); --lenR, ++posR);\n\n    r = r.subarray(posR)\n    if (r[0] & 0x80) return 1\n    if (lenR > 1 && (r[0] === 0x00) && !(r[1] & 0x80)) return 1\n\n    // Prepare S\n    let s = output.subarray(6 + 33, 6 + 33 + 33)\n    s[0] = 0x00\n    s.set(sigS, 1)\n\n    let lenS = 33\n    let posS = 0\n    for (; lenS > 1 && s[posS] === 0x00 && !(s[posS + 1] & 0x80); --lenS, ++posS);\n\n    s = s.subarray(posS)\n    if (s[0] & 0x80) return 1\n    if (lenS > 1 && (s[0] === 0x00) && !(s[1] & 0x80)) return 1\n\n    // Set output length for return\n    obj.outputlen = 6 + lenR + lenS\n\n    // Output in specified format\n    // 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S]\n    output[0] = 0x30\n    output[1] = obj.outputlen - 2\n    output[2] = 0x02\n    output[3] = r.length\n    output.set(r, 4)\n    output[4 + lenR] = 0x02\n    output[5 + lenR] = s.length\n    output.set(s, 6 + lenR)\n\n    return 0\n  },\n\n  // Copied 1-to-1 from https://github.com/bitcoinjs/bip66/blob/master/index.js\n  // Adapted for Uint8Array instead Buffer\n  signatureImport (output, sig) {\n    if (sig.length < 8) return 1\n    if (sig.length > 72) return 1\n    if (sig[0] !== 0x30) return 1\n    if (sig[1] !== sig.length - 2) return 1\n    if (sig[2] !== 0x02) return 1\n\n    const lenR = sig[3]\n    if (lenR === 0) return 1\n    if (5 + lenR >= sig.length) return 1\n    if (sig[4 + lenR] !== 0x02) return 1\n\n    const lenS = sig[5 + lenR]\n    if (lenS === 0) return 1\n    if ((6 + lenR + lenS) !== sig.length) return 1\n\n    if (sig[4] & 0x80) return 1\n    if (lenR > 1 && (sig[4] === 0x00) && !(sig[5] & 0x80)) return 1\n\n    if (sig[lenR + 6] & 0x80) return 1\n    if (lenS > 1 && (sig[lenR + 6] === 0x00) && !(sig[lenR + 7] & 0x80)) return 1\n\n    let sigR = sig.subarray(4, 4 + lenR)\n    if (sigR.length === 33 && sigR[0] === 0x00) sigR = sigR.subarray(1)\n    if (sigR.length > 32) return 1\n\n    let sigS = sig.subarray(6 + lenR)\n    if (sigS.length === 33 && sigS[0] === 0x00) sigS = sigS.slice(1)\n    if (sigS.length > 32) throw new Error('S length is too long')\n\n    let r = new BN(sigR)\n    if (r.cmp(ecparams.n) >= 0) r = new BN(0)\n\n    let s = new BN(sig.subarray(6 + lenR))\n    if (s.cmp(ecparams.n) >= 0) s = new BN(0)\n\n    output.set(r.toArrayLike(Uint8Array, 'be', 32), 0)\n    output.set(s.toArrayLike(Uint8Array, 'be', 32), 32)\n\n    return 0\n  },\n\n  ecdsaSign (obj, message, seckey, data, noncefn) {\n    if (noncefn) {\n      const _noncefn = noncefn\n      noncefn = (counter) => {\n        const nonce = _noncefn(message, seckey, null, data, counter)\n\n        const isValid = nonce instanceof Uint8Array && nonce.length === 32\n        if (!isValid) throw new Error('This is the way')\n\n        return new BN(nonce)\n      }\n    }\n\n    const d = new BN(seckey)\n    if (d.cmp(ecparams.n) >= 0 || d.isZero()) return 1\n\n    let sig\n    try {\n      sig = ec.sign(message, seckey, { canonical: true, k: noncefn, pers: data })\n    } catch (err) {\n      return 1\n    }\n\n    obj.signature.set(sig.r.toArrayLike(Uint8Array, 'be', 32), 0)\n    obj.signature.set(sig.s.toArrayLike(Uint8Array, 'be', 32), 32)\n    obj.recid = sig.recoveryParam\n\n    return 0\n  },\n\n  ecdsaVerify (sig, msg32, pubkey) {\n    const sigObj = { r: sig.subarray(0, 32), s: sig.subarray(32, 64) }\n\n    const sigr = new BN(sigObj.r)\n    const sigs = new BN(sigObj.s)\n    if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) return 1\n    if (sigs.cmp(ec.nh) === 1 || sigr.isZero() || sigs.isZero()) return 3\n\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 2\n\n    const point = pair.getPublic()\n    const isValid = ec.verify(msg32, sigObj, point)\n    return isValid ? 0 : 3\n  },\n\n  ecdsaRecover (output, sig, recid, msg32) {\n    const sigObj = { r: sig.slice(0, 32), s: sig.slice(32, 64) }\n\n    const sigr = new BN(sigObj.r)\n    const sigs = new BN(sigObj.s)\n    if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) return 1\n\n    if (sigr.isZero() || sigs.isZero()) return 2\n\n    // Can throw `throw new Error('Unable to find sencond key candinate');`\n    let point\n    try {\n      point = ec.recoverPubKey(msg32, sigObj, recid)\n    } catch (err) {\n      return 2\n    }\n\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  ecdh (output, pubkey, seckey, data, hashfn, xbuf, ybuf) {\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 1\n\n    const scalar = new BN(seckey)\n    if (scalar.cmp(ecparams.n) >= 0 || scalar.isZero()) return 2\n\n    const point = pair.getPublic().mul(scalar)\n\n    if (hashfn === undefined) {\n      const data = point.encode(null, true)\n      const sha256 = ec.hash().update(data).digest()\n      for (let i = 0; i < 32; ++i) output[i] = sha256[i]\n    } else {\n      if (!xbuf) xbuf = new Uint8Array(32)\n      const x = point.getX().toArray('be', 32)\n      for (let i = 0; i < 32; ++i) xbuf[i] = x[i]\n\n      if (!ybuf) ybuf = new Uint8Array(32)\n      const y = point.getY().toArray('be', 32)\n      for (let i = 0; i < 32; ++i) ybuf[i] = y[i]\n\n      const hash = hashfn(xbuf, ybuf, data)\n\n      const isValid = hash instanceof Uint8Array && hash.length === output.length\n      if (!isValid) return 2\n\n      output.set(hash)\n    }\n\n    return 0\n  }\n}\n","module.exports = require('./lib')(require('./lib/elliptic'))\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MissingPrivKeyArgumentException = exports.PrivKeyFormatException = void 0;\nclass PrivKeyFormatException extends Error {\n    constructor(privKey) {\n        super(`Invalid key length. Expected 32, but got ${privKey.length}`);\n    }\n}\nexports.PrivKeyFormatException = PrivKeyFormatException;\nclass MissingPrivKeyArgumentException extends Error {\n    constructor() {\n        super(`Missing argument privKey`);\n    }\n}\nexports.MissingPrivKeyArgumentException = MissingPrivKeyArgumentException;\n//# sourceMappingURL=errors.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.hash256 = void 0;\nexports.createPublicKey = createPublicKey;\nexports.randomBytes = randomBytes;\nexports.sha256 = sha256;\nexports.hashConcat = hashConcat;\nexports.checkSignature = checkSignature;\nexports.checkDigestSignature = checkDigestSignature;\nexports.sign = sign;\nexports.signDigest = signDigest;\nexports.makeKeyPair = makeKeyPair;\nexports.makeTuid = makeTuid;\nexports.verifyKeyPair = verifyKeyPair;\nconst buffer_1 = require(\"buffer\");\nconst crypto = __importStar(require(\"crypto\"));\nconst secp256k1 = __importStar(require(\"secp256k1\"));\nconst formatter_1 = require(\"../formatter\");\nconst errors_1 = require(\"./errors\");\nfunction createPublicKey(privKey) {\n    validatePrivKeyFormat(privKey);\n    return buffer_1.Buffer.from(secp256k1.publicKeyCreate(privKey, true).buffer);\n}\nfunction randomBytes(size) {\n    return crypto.randomBytes(size);\n}\nfunction sha256(buffer) {\n    return crypto.createHash(\"sha256\").update(buffer).digest();\n}\nexports.hash256 = sha256;\nfunction hashConcat(items) {\n    return (0, exports.hash256)(buffer_1.Buffer.concat(items));\n}\n/**\n * @param content the content that the signature signs. It will be digested before validating.\n * @param pubKey The pubKey to validate the signature with\n * @param signature the signature to validate\n *\n * @return true if signature ok, false otherwise\n */\nfunction checkSignature(content, pubKey, signature) {\n    const digest = (0, exports.hash256)(content);\n    return checkDigestSignature(digest, pubKey, signature);\n}\n/**\n * @param digest the signed digest. It will not be digested before validating.\n * @param pubKey The pubKey to validate the signature with\n * @param signature the signature to validate\n *\n * @return true if signature ok, false otherwise\n */\nfunction checkDigestSignature(digest, pubKey, signature) {\n    return secp256k1.ecdsaVerify(signature, digest, pubKey);\n}\n/**\n * @param content to sign. It will be digested before signing.\n * @param privKey The private key to sign the content with\n *\n * @return the signature\n */\nfunction sign(content, privKey) {\n    validatePrivKeyFormat(privKey);\n    const digestBuffer = sha256(content);\n    return signDigest(digestBuffer, privKey);\n}\n/**\n * @param digestBuffer to sign. It will not be digested before signing.\n * @param privKey The private key to sign the digest with\n *\n * @return the signature\n */\nfunction signDigest(digestBuffer, privKey) {\n    return buffer_1.Buffer.from(secp256k1.ecdsaSign(digestBuffer, privKey).signature);\n}\n/**\n * Creates a key pair (which usually represents one user)\n * @param privKey to create key pair based on\n * @returns {{pubKey: Buffer, privKey: Buffer}}\n */\nfunction makeKeyPair(privKey) {\n    let pubKey;\n    if (privKey) {\n        privKey = (0, formatter_1.ensureBuffer)(privKey);\n        pubKey = createPublicKey(privKey);\n    }\n    else {\n        do {\n            privKey = randomBytes(32);\n        } while (!secp256k1.privateKeyVerify(privKey));\n        pubKey = buffer_1.Buffer.from(secp256k1.publicKeyCreate(privKey).buffer);\n    }\n    return { pubKey, privKey };\n}\n/**\n * Generates a 16bytes TUID (Text unique ID) (a 32characters long string)\n * @returns string\n */\nfunction makeTuid() {\n    return randomBytes(16).toString(\"hex\");\n}\n/**\n * Verify that keypair is correct. Providing the private key, this function returns its associated public key\n * @param privKey: Buffer\n * @returns {{pubKey: Buffer, privKey: Buffer}}\n */\nfunction verifyKeyPair(privKey) {\n    validatePrivKeyFormat(privKey);\n    const pubKey = buffer_1.Buffer.from(secp256k1.publicKeyCreate(privKey).buffer);\n    return { pubKey, privKey };\n}\nfunction validatePrivKeyFormat(privKey) {\n    if (!privKey) {\n        throw new errors_1.MissingPrivKeyArgumentException();\n    }\n    if (!buffer_1.Buffer.isBuffer(privKey) || privKey.length !== 32) {\n        throw new errors_1.PrivKeyFormatException(privKey);\n    }\n}\n//# sourceMappingURL=encryption.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decode = exports.encode = void 0;\nconst serialization = __importStar(require(\"./serialization\"));\nconst encode = serialization.encodeValueGtx;\nexports.encode = encode;\nconst decode = serialization.decodeValueGtx;\nexports.decode = decode;\n//# sourceMappingURL=index.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.emptyGtx = emptyGtx;\nexports.addTransactionToGtx = addTransactionToGtx;\nexports.addSignerToGtx = addSignerToGtx;\nexports.getDigest = getDigest;\nexports.getDigestToSign = getDigestToSign;\nexports.getDigestToSignFromRawGtxBody = getDigestToSignFromRawGtxBody;\nexports.gtxToRawGtxBody = gtxToRawGtxBody;\nexports.gtxToRawGtx = gtxToRawGtx;\nexports.sign = sign;\nexports.addSignature = addSignature;\nexports.serialize = serialize;\nexports.deserialize = deserialize;\nexports.checkGTXSignatures = checkGTXSignatures;\nexports.checkExistingGTXSignatures = checkExistingGTXSignatures;\nexports.newSignatureProvider = newSignatureProvider;\nexports.rawGtvToGtx = rawGtvToGtx;\nconst buffer_1 = require(\"buffer\");\nconst gtv = __importStar(require(\"../gtv\"));\nconst encryption_1 = require(\"../encryption/encryption\");\nconst errors_1 = require(\"./errors\");\nconst index_1 = require(\"./index\");\nconst formatter_1 = require(\"../formatter\");\nconst bufferUtils_1 = require(\"../utils/bufferUtils\");\nfunction emptyGtx(blockchainRid) {\n    return { blockchainRid, operations: [], signers: [] };\n}\n/**\n * Adds a function call to a GTX. Creates a new GTX if none specified.\n * This function will throw Error if gtx is already signed\n * @param opName the name of the function to call\n * @param args the array of arguments of the function call. If no args, this must be an empty array\n * @param gtx the function call will be added to this gtx\n * @returns the gtx\n * @throws if gtx is null or if gtx is already signed\n */\nfunction addTransactionToGtx(opName, args, gtx) {\n    if (gtx == null) {\n        throw new errors_1.MissingGtxException();\n    }\n    if (gtx.signatures) {\n        throw new errors_1.AlreadySignedTransactionException(\"function\");\n    }\n    gtx.operations.push({ opName: opName, args: args });\n    return gtx;\n}\nfunction addSignerToGtx(signer, gtx) {\n    if (gtx.signatures) {\n        throw new errors_1.AlreadySignedTransactionException(\"signer\");\n    }\n    gtx.signers.push(signer);\n}\n/**\n * Serializes the gtx to get tx hash\n * @param gtx the gtx to serialize\n */\nfunction getDigest(gtx, merkleHashVersion) {\n    return gtv.gtvHash(gtxToRawGtxBody(gtx), merkleHashVersion);\n}\n/**\n * Serializes the gtx for signing\n * @param gtx the gtx to serialize\n */\nfunction getDigestToSign(gtx, merkleHashVersion) {\n    return gtv.gtvHash(gtxToRawGtxBody(gtx), merkleHashVersion);\n}\nfunction getDigestToSignFromRawGtxBody(gtxBody, merkleHashVersion) {\n    return gtv.gtvHash(gtxBody, merkleHashVersion);\n}\nfunction gtxToRawGtxBody(gtx) {\n    return [\n        gtx.blockchainRid,\n        gtx.operations.map((op) => [op.opName, op.args]),\n        gtx.signers,\n    ];\n}\nfunction gtxToRawGtx(gtx) {\n    var _a;\n    return [\n        [\n            gtx.blockchainRid,\n            gtx.operations.map((op) => [op.opName, op.args]),\n            gtx.signers,\n        ],\n        (_a = gtx.signatures) !== null && _a !== void 0 ? _a : [],\n    ];\n}\nfunction sign(gtx, privOrSigProv, merkleHashVersion, pubKey) {\n    return __awaiter(this, void 0, void 0, function* () {\n        if ((0, bufferUtils_1.isBuffer)(privOrSigProv)) {\n            const digestToSign = getDigestToSign(gtx, merkleHashVersion);\n            const signature = (0, encryption_1.signDigest)(digestToSign, privOrSigProv);\n            return addSignature(pubKey || (0, encryption_1.makeKeyPair)(privOrSigProv).pubKey, signature, gtx);\n        }\n        else {\n            // Removes signatures and extract the rawgtxBody\n            const rawGtxBody = gtxToRawGtxBody(gtx);\n            const signature = yield privOrSigProv.sign(rawGtxBody, merkleHashVersion);\n            return addSignature(privOrSigProv.pubKey, signature, gtx);\n        }\n    });\n}\n/**\n * Adds a signature to the gtx\n */\nfunction addSignature(pubKeyBuffer, signatureBuffer, gtx) {\n    if (!gtx.signatures) {\n        gtx.signatures = Array(gtx.signers.length);\n    }\n    const signerIndex = gtx.signers.findIndex((signer) => pubKeyBuffer.equals(signer));\n    if (signerIndex === -1) {\n        throw new errors_1.MissingSignerException();\n    }\n    gtx.signatures[signerIndex] = signatureBuffer;\n    return gtx;\n}\nfunction serialize(gtx) {\n    if (!gtx.signatures) {\n        // TODO\n        // The gtx is not signed, but we must include\n        // the signatures attribute, so let's add that.\n        gtx.signatures = [];\n    }\n    return (0, index_1.encode)([gtxToRawGtxBody(gtx), gtx.signatures]);\n}\nfunction deserialize(gtxBytes) {\n    const deserializedTx = (0, index_1.decode)(gtxBytes);\n    const body = deserializedTx[0];\n    const gtvTxBody = {\n        blockchainRid: body[0],\n        operations: body[1].map((operation) => ({\n            opName: operation[0],\n            args: operation[1],\n        })),\n        signers: body[2],\n    };\n    const signatures = deserializedTx[1];\n    return {\n        blockchainRid: gtvTxBody.blockchainRid,\n        operations: gtvTxBody.operations,\n        signers: gtvTxBody.signers,\n        signatures,\n    };\n}\nfunction checkGTXSignatures(txHash, gtx) {\n    var _a;\n    if (!Array.isArray(gtx.signatures) || gtx.signatures.length === 0) {\n        return false;\n    }\n    for (const i in gtx.signers) {\n        const signValid = (0, encryption_1.checkDigestSignature)(txHash, gtx.signers[i], (_a = gtx.signatures) === null || _a === void 0 ? void 0 : _a[i]);\n        if (!signValid)\n            return signValid;\n    }\n    return true;\n}\nfunction checkExistingGTXSignatures(txHash, gtx) {\n    var _a;\n    for (const i in gtx.signers) {\n        if ((_a = gtx.signatures) === null || _a === void 0 ? void 0 : _a[i]) {\n            const signValid = (0, encryption_1.checkDigestSignature)(txHash, gtx.signers[i], gtx.signatures[i]);\n            if (!signValid)\n                return signValid;\n        }\n    }\n    return true;\n}\nfunction newSignatureProvider(keyPair) {\n    let pub, priv;\n    if (keyPair) {\n        priv = (0, formatter_1.ensureBuffer)(keyPair.privKey);\n        pub = keyPair.pubKey ? (0, formatter_1.ensureBuffer)(keyPair.pubKey) : (0, encryption_1.createPublicKey)(priv);\n    }\n    else {\n        ({ privKey: priv, pubKey: pub } = (0, encryption_1.makeKeyPair)());\n    }\n    return {\n        pubKey: pub,\n        sign: (gtx, merkleHashVersion) => __awaiter(this, void 0, void 0, function* () {\n            const signature = getDigestToSignFromRawGtxBody(gtx, merkleHashVersion);\n            return (0, encryption_1.signDigest)(signature, priv);\n        }),\n    };\n}\nfunction rawGtvToGtx(gtv) {\n    if (Array.isArray(gtv) && gtv.length !== 2) {\n        throw new Error(\"Gtv must be an array of size 2\");\n    }\n    const gtvArray = gtv;\n    if (!Array.isArray(gtvArray[0])) {\n        throw new Error(\"First element must be an array\");\n    }\n    if (!Array.isArray(gtvArray[1])) {\n        throw new Error(\"Second element must be an array\");\n    }\n    gtvArray[1].forEach(element => {\n        if (!buffer_1.Buffer.isBuffer(element)) {\n            throw new Error(\"Element must be a buffer\");\n        }\n    });\n    const gtxBody = rawGtvToGtxBody(gtvArray[0]);\n    return Object.assign(Object.assign({}, gtxBody), { signatures: gtvArray[1] });\n}\nfunction rawGtvToGtxBody(gtv) {\n    if (Array.isArray(gtv) && gtv.length !== 3) {\n        throw new Error(\"Gtv must be an array of size 3\");\n    }\n    const array = gtv;\n    if (!buffer_1.Buffer.isBuffer(array[0])) {\n        throw new Error(\"First element must be a byte array\");\n    }\n    if (!Array.isArray(array[1])) {\n        throw new Error(\"Second element must be an array\");\n    }\n    if (!Array.isArray(array[2])) {\n        throw new Error(\"Third element must be an array\");\n    }\n    array[2].forEach(element => {\n        if (!buffer_1.Buffer.isBuffer(element)) {\n            throw new Error(\"Element must be a buffer\");\n        }\n    });\n    return {\n        blockchainRid: array[0],\n        operations: array[1].map(element => rawGtvToRellOp(element)),\n        signers: array[2],\n    };\n}\nfunction rawGtvToRellOp(gtv) {\n    if (Array.isArray(gtv) && gtv.length !== 2) {\n        throw new Error(\"Gtv must be an array of size 2\");\n    }\n    const array = gtv;\n    if (typeof array[0] !== \"string\") {\n        throw new Error(\"First element must be a string\");\n    }\n    if (!Array.isArray(array[1])) {\n        throw new Error(\"Second element must be an array\");\n    }\n    return { opName: array[0], args: array[1] };\n}\n//# sourceMappingURL=gtx.js.map","\"use strict\";\nvar _a;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.LogLevel = void 0;\nexports.setLogLevel = setLogLevel;\nexports.getLogLevel = getLogLevel;\nexports.debug = debug;\nexports.info = info;\nexports.error = error;\nexports.warning = warning;\nexports.logger = logger;\nvar MsgType;\n(function (MsgType) {\n    MsgType[\"Debug\"] = \"DEBUG\";\n    MsgType[\"Info\"] = \"INFO\";\n    MsgType[\"Error\"] = \"ERROR\";\n    MsgType[\"Warning\"] = \"WARNING\";\n})(MsgType || (MsgType = {}));\nvar LogColor;\n(function (LogColor) {\n    LogColor[\"Red\"] = \"\\u001B[91m\";\n    LogColor[\"Green\"] = \"\\u001B[92m\";\n    LogColor[\"Blue\"] = \"\\u001B[36m\";\n    LogColor[\"Yellow\"] = \"\\u001B[93m\";\n    LogColor[\"StopColor\"] = \"\\u001B[0m\";\n})(LogColor || (LogColor = {}));\nvar LogLevel;\n(function (LogLevel) {\n    LogLevel[\"Debug\"] = \"DEBUG\";\n    LogLevel[\"Info\"] = \"INFO\";\n    LogLevel[\"Error\"] = \"ERROR\";\n    LogLevel[\"Warning\"] = \"WARNING\";\n    LogLevel[\"Disabled\"] = \"DISABLED\";\n})(LogLevel || (exports.LogLevel = LogLevel = {}));\nconst logLevelMap = {\n    [LogLevel.Warning]: 1,\n    [LogLevel.Info]: 2,\n    [LogLevel.Debug]: 3,\n    [LogLevel.Error]: 0,\n    [LogLevel.Disabled]: -1,\n};\nconst DEFAULT_LOG_LEVEL = logLevelMap[LogLevel.Warning];\nlet logLevel = typeof process === \"undefined\"\n    ? DEFAULT_LOG_LEVEL\n    : (_a = logLevelMap[process.env.LOG_LEVEL]) !== null && _a !== void 0 ? _a : DEFAULT_LOG_LEVEL;\nfunction setLogLevel(level) {\n    logLevel = logLevelMap[level];\n}\nfunction getLogLevel() {\n    return Object.keys(logLevelMap).find(key => logLevelMap[key] === logLevel);\n}\nfunction debug(message, moduleName) {\n    if (logLevel >= 3) {\n        emitLogMessage({\n            message,\n            moduleName,\n            msgType: MsgType.Debug,\n            color: LogColor.Blue,\n        });\n    }\n}\nfunction info(message, moduleName) {\n    if (logLevel >= 2) {\n        emitLogMessage({\n            message,\n            moduleName,\n            msgType: MsgType.Info,\n            color: LogColor.Green,\n        });\n    }\n}\nfunction error(message, moduleName) {\n    if (logLevel != -1) {\n        emitLogMessage({\n            message,\n            moduleName,\n            msgType: MsgType.Error,\n            color: LogColor.Red,\n        });\n    }\n}\nfunction warning(message, moduleName) {\n    if (logLevel >= 1) {\n        emitLogMessage({\n            message,\n            moduleName,\n            msgType: MsgType.Warning,\n            color: LogColor.Yellow,\n        });\n    }\n}\nfunction emitLogMessage({ msgType, message, color, moduleName, }) {\n    const time = getTimestamp();\n    const moduleNameMessage = moduleName ? `[${moduleName}]` : \"\";\n    console.log(`[${time}] ${color}${msgType}:${LogColor.StopColor} ${moduleNameMessage} ${message}`);\n}\nfunction getTimestamp() {\n    const pad = (n, s = 2) => `${new Array(s).fill(0)}${n}`.slice(-s);\n    const date = new Date();\n    return `${pad(date.getHours())}:${pad(date.getMinutes())}:${pad(date.getSeconds())}:${pad(date.getMilliseconds(), 3)}`;\n}\nfunction logger(moduleName) {\n    return {\n        debug: (message) => debug(message, moduleName),\n        info,\n        error,\n        warning,\n        setLogLevel,\n        disable: () => setLogLevel(LogLevel.Disabled),\n    };\n}\n//# sourceMappingURL=logger.js.map","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nmodule.exports = listCacheClear;\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n","var eq = require('./eq');\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = assocIndexOf;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nmodule.exports = listCacheDelete;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nmodule.exports = listCacheGet;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nmodule.exports = listCacheHas;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nmodule.exports = listCacheSet;\n","var listCacheClear = require('./_listCacheClear'),\n    listCacheDelete = require('./_listCacheDelete'),\n    listCacheGet = require('./_listCacheGet'),\n    listCacheHas = require('./_listCacheHas'),\n    listCacheSet = require('./_listCacheSet');\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n","var ListCache = require('./_ListCache');\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nmodule.exports = stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nmodule.exports = stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nmodule.exports = stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nmodule.exports = stackHas;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nmodule.exports = root;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","var Symbol = require('./_Symbol');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nmodule.exports = getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","var Symbol = require('./_Symbol'),\n    getRawTag = require('./_getRawTag'),\n    objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n","var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n","var root = require('./_root');\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","var coreJsData = require('./_coreJsData');\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nmodule.exports = toSource;\n","var isFunction = require('./isFunction'),\n    isMasked = require('./_isMasked'),\n    isObject = require('./isObject'),\n    toSource = require('./_toSource');\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","var baseIsNative = require('./_baseIsNative'),\n    getValue = require('./_getValue');\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n","var getNative = require('./_getNative');\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nmodule.exports = nativeCreate;\n","var nativeCreate = require('./_nativeCreate');\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nmodule.exports = hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = hashDelete;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nmodule.exports = hashGet;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nmodule.exports = hashHas;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nmodule.exports = hashSet;\n","var hashClear = require('./_hashClear'),\n    hashDelete = require('./_hashDelete'),\n    hashGet = require('./_hashGet'),\n    hashHas = require('./_hashHas'),\n    hashSet = require('./_hashSet');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n","var Hash = require('./_Hash'),\n    ListCache = require('./_ListCache'),\n    Map = require('./_Map');\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nmodule.exports = mapCacheClear;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nmodule.exports = isKeyable;\n","var isKeyable = require('./_isKeyable');\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nmodule.exports = getMapData;\n","var getMapData = require('./_getMapData');\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = mapCacheDelete;\n","var getMapData = require('./_getMapData');\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nmodule.exports = mapCacheGet;\n","var getMapData = require('./_getMapData');\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nmodule.exports = mapCacheHas;\n","var getMapData = require('./_getMapData');\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nmodule.exports = mapCacheSet;\n","var mapCacheClear = require('./_mapCacheClear'),\n    mapCacheDelete = require('./_mapCacheDelete'),\n    mapCacheGet = require('./_mapCacheGet'),\n    mapCacheHas = require('./_mapCacheHas'),\n    mapCacheSet = require('./_mapCacheSet');\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n","var ListCache = require('./_ListCache'),\n    Map = require('./_Map'),\n    MapCache = require('./_MapCache');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nmodule.exports = stackSet;\n","var ListCache = require('./_ListCache'),\n    stackClear = require('./_stackClear'),\n    stackDelete = require('./_stackDelete'),\n    stackGet = require('./_stackGet'),\n    stackHas = require('./_stackHas'),\n    stackSet = require('./_stackSet');\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n","/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\nmodule.exports = arrayEach;\n","var getNative = require('./_getNative');\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\nmodule.exports = defineProperty;\n","var defineProperty = require('./_defineProperty');\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nmodule.exports = baseAssignValue;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignValue;\n","var assignValue = require('./_assignValue'),\n    baseAssignValue = require('./_baseAssignValue');\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  var isNew = !object;\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer\n      ? customizer(object[key], source[key], key, object, source)\n      : undefined;\n\n    if (newValue === undefined) {\n      newValue = source[key];\n    }\n    if (isNew) {\n      baseAssignValue(object, key, newValue);\n    } else {\n      assignValue(object, key, newValue);\n    }\n  }\n  return object;\n}\n\nmodule.exports = copyObject;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","var baseIsArguments = require('./_baseIsArguments'),\n    isObjectLike = require('./isObjectLike');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = stubFalse;\n","var root = require('./_root'),\n    stubFalse = require('./stubFalse');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nmodule.exports = isBuffer;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nmodule.exports = isLength;\n","var baseGetTag = require('./_baseGetTag'),\n    isLength = require('./isLength'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nmodule.exports = baseIsTypedArray;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nmodule.exports = baseUnary;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n","var baseIsTypedArray = require('./_baseIsTypedArray'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nmodule.exports = isTypedArray;\n","var baseTimes = require('./_baseTimes'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isIndex = require('./_isIndex'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nmodule.exports = isPrototype;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nmodule.exports = overArg;\n","var overArg = require('./_overArg');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nmodule.exports = nativeKeys;\n","var isPrototype = require('./_isPrototype'),\n    nativeKeys = require('./_nativeKeys');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeys;\n","var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeys = require('./_baseKeys'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","var copyObject = require('./_copyObject'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssign(object, source) {\n  return object && copyObject(source, keys(source), object);\n}\n\nmodule.exports = baseAssign;\n","/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n  var result = [];\n  if (object != null) {\n    for (var key in Object(object)) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = nativeKeysIn;\n","var isObject = require('./isObject'),\n    isPrototype = require('./_isPrototype'),\n    nativeKeysIn = require('./_nativeKeysIn');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeysIn(object) {\n  if (!isObject(object)) {\n    return nativeKeysIn(object);\n  }\n  var isProto = isPrototype(object),\n      result = [];\n\n  for (var key in object) {\n    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeysIn;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeysIn = require('./_baseKeysIn'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nmodule.exports = keysIn;\n","var copyObject = require('./_copyObject'),\n    keysIn = require('./keysIn');\n\n/**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssignIn(object, source) {\n  return object && copyObject(source, keysIn(source), object);\n}\n\nmodule.exports = baseAssignIn;\n","var root = require('./_root');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var length = buffer.length,\n      result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n  buffer.copy(result);\n  return result;\n}\n\nmodule.exports = cloneBuffer;\n","/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\nmodule.exports = copyArray;\n","/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayFilter;\n","/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nmodule.exports = stubArray;\n","var arrayFilter = require('./_arrayFilter'),\n    stubArray = require('./stubArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nmodule.exports = getSymbols;\n","var copyObject = require('./_copyObject'),\n    getSymbols = require('./_getSymbols');\n\n/**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbols(source, object) {\n  return copyObject(source, getSymbols(source), object);\n}\n\nmodule.exports = copySymbols;\n","/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nmodule.exports = arrayPush;\n","var overArg = require('./_overArg');\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nmodule.exports = getPrototype;\n","var arrayPush = require('./_arrayPush'),\n    getPrototype = require('./_getPrototype'),\n    getSymbols = require('./_getSymbols'),\n    stubArray = require('./stubArray');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n  var result = [];\n  while (object) {\n    arrayPush(result, getSymbols(object));\n    object = getPrototype(object);\n  }\n  return result;\n};\n\nmodule.exports = getSymbolsIn;\n","var copyObject = require('./_copyObject'),\n    getSymbolsIn = require('./_getSymbolsIn');\n\n/**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbolsIn(source, object) {\n  return copyObject(source, getSymbolsIn(source), object);\n}\n\nmodule.exports = copySymbolsIn;\n","var arrayPush = require('./_arrayPush'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nmodule.exports = baseGetAllKeys;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbols = require('./_getSymbols'),\n    keys = require('./keys');\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nmodule.exports = getAllKeys;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbolsIn = require('./_getSymbolsIn'),\n    keysIn = require('./keysIn');\n\n/**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeysIn(object) {\n  return baseGetAllKeys(object, keysIn, getSymbolsIn);\n}\n\nmodule.exports = getAllKeysIn;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nmodule.exports = DataView;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nmodule.exports = Promise;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nmodule.exports = WeakMap;\n","var DataView = require('./_DataView'),\n    Map = require('./_Map'),\n    Promise = require('./_Promise'),\n    Set = require('./_Set'),\n    WeakMap = require('./_WeakMap'),\n    baseGetTag = require('./_baseGetTag'),\n    toSource = require('./_toSource');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    setTag = '[object Set]',\n    weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = baseGetTag(value),\n        Ctor = result == objectTag ? value.constructor : undefined,\n        ctorString = Ctor ? toSource(Ctor) : '';\n\n    if (ctorString) {\n      switch (ctorString) {\n        case dataViewCtorString: return dataViewTag;\n        case mapCtorString: return mapTag;\n        case promiseCtorString: return promiseTag;\n        case setCtorString: return setTag;\n        case weakMapCtorString: return weakMapTag;\n      }\n    }\n    return result;\n  };\n}\n\nmodule.exports = getTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\nfunction initCloneArray(array) {\n  var length = array.length,\n      result = new array.constructor(length);\n\n  // Add properties assigned by `RegExp#exec`.\n  if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n    result.index = array.index;\n    result.input = array.input;\n  }\n  return result;\n}\n\nmodule.exports = initCloneArray;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n","var Uint8Array = require('./_Uint8Array');\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\nmodule.exports = cloneArrayBuffer;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\nfunction cloneDataView(dataView, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n  return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\nmodule.exports = cloneDataView;\n","/** Used to match `RegExp` flags from their coerced string values. */\nvar reFlags = /\\w*$/;\n\n/**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\nfunction cloneRegExp(regexp) {\n  var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n  result.lastIndex = regexp.lastIndex;\n  return result;\n}\n\nmodule.exports = cloneRegExp;\n","var Symbol = require('./_Symbol');\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\nfunction cloneSymbol(symbol) {\n  return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\nmodule.exports = cloneSymbol;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\nmodule.exports = cloneTypedArray;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer'),\n    cloneDataView = require('./_cloneDataView'),\n    cloneRegExp = require('./_cloneRegExp'),\n    cloneSymbol = require('./_cloneSymbol'),\n    cloneTypedArray = require('./_cloneTypedArray');\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneByTag(object, tag, isDeep) {\n  var Ctor = object.constructor;\n  switch (tag) {\n    case arrayBufferTag:\n      return cloneArrayBuffer(object);\n\n    case boolTag:\n    case dateTag:\n      return new Ctor(+object);\n\n    case dataViewTag:\n      return cloneDataView(object, isDeep);\n\n    case float32Tag: case float64Tag:\n    case int8Tag: case int16Tag: case int32Tag:\n    case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n      return cloneTypedArray(object, isDeep);\n\n    case mapTag:\n      return new Ctor;\n\n    case numberTag:\n    case stringTag:\n      return new Ctor(object);\n\n    case regexpTag:\n      return cloneRegExp(object);\n\n    case setTag:\n      return new Ctor;\n\n    case symbolTag:\n      return cloneSymbol(object);\n  }\n}\n\nmodule.exports = initCloneByTag;\n","var isObject = require('./isObject');\n\n/** Built-in value references. */\nvar objectCreate = Object.create;\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nvar baseCreate = (function() {\n  function object() {}\n  return function(proto) {\n    if (!isObject(proto)) {\n      return {};\n    }\n    if (objectCreate) {\n      return objectCreate(proto);\n    }\n    object.prototype = proto;\n    var result = new object;\n    object.prototype = undefined;\n    return result;\n  };\n}());\n\nmodule.exports = baseCreate;\n","var baseCreate = require('./_baseCreate'),\n    getPrototype = require('./_getPrototype'),\n    isPrototype = require('./_isPrototype');\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return (typeof object.constructor == 'function' && !isPrototype(object))\n    ? baseCreate(getPrototype(object))\n    : {};\n}\n\nmodule.exports = initCloneObject;\n","var getTag = require('./_getTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]';\n\n/**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\nfunction baseIsMap(value) {\n  return isObjectLike(value) && getTag(value) == mapTag;\n}\n\nmodule.exports = baseIsMap;\n","var baseIsMap = require('./_baseIsMap'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\n\n/**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nmodule.exports = isMap;\n","var getTag = require('./_getTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar setTag = '[object Set]';\n\n/**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\nfunction baseIsSet(value) {\n  return isObjectLike(value) && getTag(value) == setTag;\n}\n\nmodule.exports = baseIsSet;\n","var baseIsSet = require('./_baseIsSet'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nmodule.exports = isSet;\n","var Stack = require('./_Stack'),\n    arrayEach = require('./_arrayEach'),\n    assignValue = require('./_assignValue'),\n    baseAssign = require('./_baseAssign'),\n    baseAssignIn = require('./_baseAssignIn'),\n    cloneBuffer = require('./_cloneBuffer'),\n    copyArray = require('./_copyArray'),\n    copySymbols = require('./_copySymbols'),\n    copySymbolsIn = require('./_copySymbolsIn'),\n    getAllKeys = require('./_getAllKeys'),\n    getAllKeysIn = require('./_getAllKeysIn'),\n    getTag = require('./_getTag'),\n    initCloneArray = require('./_initCloneArray'),\n    initCloneByTag = require('./_initCloneByTag'),\n    initCloneObject = require('./_initCloneObject'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isMap = require('./isMap'),\n    isObject = require('./isObject'),\n    isSet = require('./isSet'),\n    keys = require('./keys'),\n    keysIn = require('./keysIn');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_FLAT_FLAG = 2,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values supported by `_.clone`. */\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Deep clone\n *  2 - Flatten inherited properties\n *  4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\nfunction baseClone(value, bitmask, customizer, key, object, stack) {\n  var result,\n      isDeep = bitmask & CLONE_DEEP_FLAG,\n      isFlat = bitmask & CLONE_FLAT_FLAG,\n      isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n  if (customizer) {\n    result = object ? customizer(value, key, object, stack) : customizer(value);\n  }\n  if (result !== undefined) {\n    return result;\n  }\n  if (!isObject(value)) {\n    return value;\n  }\n  var isArr = isArray(value);\n  if (isArr) {\n    result = initCloneArray(value);\n    if (!isDeep) {\n      return copyArray(value, result);\n    }\n  } else {\n    var tag = getTag(value),\n        isFunc = tag == funcTag || tag == genTag;\n\n    if (isBuffer(value)) {\n      return cloneBuffer(value, isDeep);\n    }\n    if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n      result = (isFlat || isFunc) ? {} : initCloneObject(value);\n      if (!isDeep) {\n        return isFlat\n          ? copySymbolsIn(value, baseAssignIn(result, value))\n          : copySymbols(value, baseAssign(result, value));\n      }\n    } else {\n      if (!cloneableTags[tag]) {\n        return object ? value : {};\n      }\n      result = initCloneByTag(value, tag, isDeep);\n    }\n  }\n  // Check for circular references and return its corresponding clone.\n  stack || (stack = new Stack);\n  var stacked = stack.get(value);\n  if (stacked) {\n    return stacked;\n  }\n  stack.set(value, result);\n\n  if (isSet(value)) {\n    value.forEach(function(subValue) {\n      result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n    });\n  } else if (isMap(value)) {\n    value.forEach(function(subValue, key) {\n      result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n    });\n  }\n\n  var keysFunc = isFull\n    ? (isFlat ? getAllKeysIn : getAllKeys)\n    : (isFlat ? keysIn : keys);\n\n  var props = isArr ? undefined : keysFunc(value);\n  arrayEach(props || value, function(subValue, key) {\n    if (props) {\n      key = subValue;\n      subValue = value[key];\n    }\n    // Recursively populate clone (susceptible to call stack limits).\n    assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n  });\n  return result;\n}\n\nmodule.exports = baseClone;\n","var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = cloneDeep;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.GetBridFromChainException = exports.SerializedTransactionFormatException = exports.InvalidTxRidException = exports.UnexpectedStatusError = exports.TxRejectedError = exports.GetTransactionRidException = exports.InvalidTransactionFormatException = exports.FilteredNodeUrlPoolEmptyError = exports.DirectoryNodeUrlPoolException = exports.BlockchainUrlUndefinedException = exports.MissingNodeUrlError = exports.MissingBlockchainIdentifierError = exports.MissingPubKeyError = void 0;\nconst customError_1 = require(\"../customError\");\nconst formatter_1 = require(\"../formatter\");\nclass MissingPubKeyError extends customError_1.CustomError {\n    constructor() {\n        super(`No public key was provided`, 400);\n    }\n}\nexports.MissingPubKeyError = MissingPubKeyError;\nclass MissingBlockchainIdentifierError extends customError_1.CustomError {\n    constructor() {\n        super(`No blockchain identifier was provided. Include either a blockchainRid (string) or a blockchainIid (number).`, 400);\n    }\n}\nexports.MissingBlockchainIdentifierError = MissingBlockchainIdentifierError;\nclass MissingNodeUrlError extends customError_1.CustomError {\n    constructor() {\n        super(`No node url or directory node url was provided. Include either a nodeUrl (string or string[]) or a directory node url (string or string[]).`, 400);\n    }\n}\nexports.MissingNodeUrlError = MissingNodeUrlError;\nclass BlockchainUrlUndefinedException extends customError_1.CustomError {\n    constructor(brid) {\n        const idType = typeof brid === \"string\" ? \"BRID\" : \"IID\";\n        super(`Cannot find nodes hosting the blockchain with ${idType} ${brid}`, 400);\n    }\n}\nexports.BlockchainUrlUndefinedException = BlockchainUrlUndefinedException;\nclass DirectoryNodeUrlPoolException extends customError_1.CustomError {\n    constructor() {\n        super(`No directory node url was provided`, 400);\n    }\n}\nexports.DirectoryNodeUrlPoolException = DirectoryNodeUrlPoolException;\nclass FilteredNodeUrlPoolEmptyError extends customError_1.CustomError {\n    constructor(poolName) {\n        super(`All node URLs were filtered out for pool \"${poolName}\". Update node URL filters or pool configuration.`, 400);\n    }\n}\nexports.FilteredNodeUrlPoolEmptyError = FilteredNodeUrlPoolEmptyError;\nclass InvalidTransactionFormatException extends customError_1.CustomError {\n    constructor() {\n        super(`The transaction is not in the right format`, 400);\n    }\n}\nexports.InvalidTransactionFormatException = InvalidTransactionFormatException;\nclass GetTransactionRidException extends customError_1.CustomError {\n    constructor(error) {\n        super(`\"Error occurred while getting transaction RID:\", ${error}`, 400);\n    }\n}\nexports.GetTransactionRidException = GetTransactionRidException;\nclass TxRejectedError extends Error {\n    constructor(rejectReason) {\n        super(`Transaction was rejected, ${rejectReason}`);\n        this.name = \"TxRejectedError\";\n        this.fullReason = rejectReason;\n        const result = (0, formatter_1.matchRellErrorString)(rejectReason);\n        this.shortReason = result.shortReason;\n        this.rellLine = result.rellLine;\n        this.operation = result.operation;\n    }\n}\nexports.TxRejectedError = TxRejectedError;\nclass UnexpectedStatusError extends customError_1.CustomError {\n    constructor(status, error) {\n        let errorMessage = `Unexpected status code from server. Code: ${status}.`;\n        if (status === null) {\n            super(errorMessage, 500); // default status code\n        }\n        else {\n            if (error) {\n                errorMessage += ` Message: ${error}.`;\n            }\n            super(errorMessage, status);\n        }\n    }\n}\nexports.UnexpectedStatusError = UnexpectedStatusError;\nclass InvalidTxRidException extends customError_1.CustomError {\n    constructor(txRID) {\n        super(`expected length 32 of txRID, but got ${txRID && txRID.length}`, 400);\n    }\n}\nexports.InvalidTxRidException = InvalidTxRidException;\nclass SerializedTransactionFormatException extends customError_1.CustomError {\n    constructor() {\n        super(`messageHash is not a Buffer`, 400);\n    }\n}\nexports.SerializedTransactionFormatException = SerializedTransactionFormatException;\nclass GetBridFromChainException extends Error {\n    constructor(chainId, reason) {\n        super(`Error resolving BRID for chainId ${chainId}, reason: ${reason}`);\n    }\n}\nexports.GetBridFromChainException = GetBridFromChainException;\n//# sourceMappingURL=errors.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Method = exports.ChainConfirmationLevel = exports.AnchoringStatus = exports.TransactionEvent = exports.ResponseStatus = exports.FailoverStrategy = void 0;\nvar FailoverStrategy;\n(function (FailoverStrategy) {\n    FailoverStrategy[\"AbortOnError\"] = \"abortOnError\";\n    FailoverStrategy[\"TryNextOnError\"] = \"tryNextOnError\";\n    FailoverStrategy[\"SingleEndpoint\"] = \"singleEndpoint\";\n    FailoverStrategy[\"QueryMajority\"] = \"queryMajority\";\n})(FailoverStrategy || (exports.FailoverStrategy = FailoverStrategy = {}));\nvar ResponseStatus;\n(function (ResponseStatus) {\n    ResponseStatus[\"Pending\"] = \"pending\";\n    ResponseStatus[\"Confirmed\"] = \"confirmed\";\n    ResponseStatus[\"Rejected\"] = \"rejected\";\n    ResponseStatus[\"Unknown\"] = \"unknown\";\n    ResponseStatus[\"Waiting\"] = \"waiting\";\n})(ResponseStatus || (exports.ResponseStatus = ResponseStatus = {}));\nvar TransactionEvent;\n(function (TransactionEvent) {\n    TransactionEvent[\"ClusterAnchoringConfirmation\"] = \"clusterAnchoringConfirmed\";\n    TransactionEvent[\"SystemAnchoringConfirmation\"] = \"systemAnchoringConfirmed\";\n    TransactionEvent[\"DappConfirmed\"] = \"dappConfirmed\";\n    TransactionEvent[\"DappReceived\"] = \"dappReceived\";\n    TransactionEvent[\"Signed\"] = \"signed\";\n    TransactionEvent[\"Rejected\"] = \"rejected\";\n})(TransactionEvent || (exports.TransactionEvent = TransactionEvent = {}));\nvar AnchoringStatus;\n(function (AnchoringStatus) {\n    AnchoringStatus[\"NotAnchored\"] = \"notAnchored\";\n    AnchoringStatus[\"ClusterAnchored\"] = \"clusterAnchored\";\n    AnchoringStatus[\"SystemAnchored\"] = \"systemAnchored\";\n    AnchoringStatus[\"FailedAnchoring\"] = \"failedAnchoring\";\n})(AnchoringStatus || (exports.AnchoringStatus = AnchoringStatus = {}));\nvar ChainConfirmationLevel;\n(function (ChainConfirmationLevel) {\n    ChainConfirmationLevel[\"None\"] = \"none\";\n    ChainConfirmationLevel[\"Dapp\"] = \"dapp\";\n    ChainConfirmationLevel[\"ClusterAnchoring\"] = \"clusterAnchoring\";\n    ChainConfirmationLevel[\"SystemAnchoring\"] = \"systemAnchoring\";\n    ChainConfirmationLevel[\"EvmNetwork\"] = \"evmNetwork\";\n})(ChainConfirmationLevel || (exports.ChainConfirmationLevel = ChainConfirmationLevel = {}));\nvar Method;\n(function (Method) {\n    Method[\"GET\"] = \"get\";\n    Method[\"POST\"] = \"post\";\n})(Method || (exports.Method = Method = {}));\n//# sourceMappingURL=enums.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createNodeManager = exports.NetworkNode = void 0;\nconst logger = __importStar(require(\"../logger\"));\nclass NetworkNode {\n    constructor(url) {\n        this.availabilityDate = 0;\n        this.url = url;\n    }\n    isAvailable() {\n        return Date.now() >= this.availabilityDate;\n    }\n    makeUnavailable(duration) {\n        this.availabilityDate = Date.now() + duration;\n    }\n    makeAvailable() {\n        this.availabilityDate = 0;\n    }\n}\nexports.NetworkNode = NetworkNode;\nconst shuffleArray = (array) => {\n    const shuffledArray = [...array];\n    for (let i = shuffledArray.length - 1; i > 0; i--) {\n        const j = Math.floor(Math.random() * (i + 1));\n        [shuffledArray[i], shuffledArray[j]] = [shuffledArray[j], shuffledArray[i]];\n    }\n    return shuffledArray;\n};\nconst createNodeManager = ({ nodeUrls, useStickyNode = false, unavailableDuration = 5000, }) => {\n    const nodes = nodeUrls.map(url => new NetworkNode(url));\n    return {\n        nodes,\n        stickedNode: null,\n        useStickyNode: useStickyNode,\n        lastUsedNode: null,\n        getAvailableNodes(customRecoveryThreshold) {\n            const availableNodes = this.nodes.filter((node) => node.isAvailable());\n            if (this.nodes.length >= 3) {\n                // Default to conservative threshold (2x formula) if no custom threshold provided\n                const recoveryThreshold = customRecoveryThreshold !== null && customRecoveryThreshold !== void 0 ? customRecoveryThreshold : this.nodes.length - Math.floor((2 * (this.nodes.length - 1)) / 3);\n                if (availableNodes.length < recoveryThreshold) {\n                    logger.debug(`Auto-recovery: ${availableNodes.length} < ${recoveryThreshold} nodes (${this.nodes.length} total)`);\n                    const previousStickyUrl = this.stickedNode;\n                    this.makeAllNodesAvailable();\n                    if (this.useStickyNode && previousStickyUrl) {\n                        if (previousStickyUrl) {\n                            this.setStickyNode(previousStickyUrl);\n                            logger.info(`Sticky node preserved during recovery: ${previousStickyUrl}`);\n                        }\n                    }\n                    const updatedAvailableNodes = this.nodes.filter((node) => node.isAvailable());\n                    return shuffleArray(updatedAvailableNodes);\n                }\n            }\n            const shuffledAvailableNodes = shuffleArray(availableNodes);\n            // set sticky node as the first node, and then shuffle the rest\n            if (useStickyNode && this.stickedNode && this.stickedNode.isAvailable()) {\n                const nodesWithoutSticky = shuffledAvailableNodes.filter(node => node !== this.stickedNode);\n                return [this.stickedNode, ...nodesWithoutSticky];\n            }\n            return shuffledAvailableNodes;\n        },\n        setStickyNode(node) {\n            this.stickedNode = node;\n        },\n        setUseStickyNode(useSticky) {\n            this.useStickyNode = useSticky;\n        },\n        getNode() {\n            const nodes = this.getAvailableNodes();\n            if (nodes.length === 0) {\n                return null;\n            }\n            const index = Math.floor(Math.random() * nodes.length);\n            const node = nodes[index];\n            this.lastUsedNode = node;\n            if (!this.useStickyNode) {\n                return node;\n            }\n            if (!this.stickedNode) {\n                this.setStickyNode(node);\n                return node;\n            }\n            this.lastUsedNode = this.stickedNode;\n            return this.stickedNode;\n        },\n        makeAllNodesAvailable() {\n            for (const node of this.nodes) {\n                node.makeAvailable();\n            }\n        },\n        makeNodeUnavailable(nodeUrl, duration = unavailableDuration) {\n            if (this.stickedNode && this.stickedNode.url === nodeUrl) {\n                this.stickedNode = null;\n            }\n            const invalidNode = this.nodes.find((node) => node.url === nodeUrl);\n            if (!invalidNode)\n                return;\n            invalidNode.makeUnavailable(duration);\n        },\n    };\n};\nexports.createNodeManager = createNodeManager;\n//# sourceMappingURL=nodeManager.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.BufferSchema = void 0;\nconst buffer_1 = require(\"buffer\");\nconst zod_1 = require(\"zod\");\nexports.BufferSchema = zod_1.z.union([zod_1.z.instanceof(Uint8Array), zod_1.z.instanceof(buffer_1.Buffer)]);\n//# sourceMappingURL=bufferSchema.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isTxRidValid = exports.TxRidSchema = void 0;\nconst errors_1 = require(\"../errors\");\nconst bufferSchema_1 = require(\"./bufferSchema\");\nexports.TxRidSchema = bufferSchema_1.BufferSchema.refine(x => x.length === 32, \"Rid must be 32 bytes long\");\nconst isTxRidValid = (rid, options) => {\n    const TxRidValidationContext = exports.TxRidSchema.safeParse(rid);\n    const { throwOnError = false } = options || {};\n    const hasError = \"error\" in TxRidValidationContext;\n    if (!hasError) {\n        return { success: true };\n    }\n    const validationError = new errors_1.InvalidTxRidException(rid);\n    if (throwOnError) {\n        throw validationError;\n    }\n    return {\n        success: false,\n        error: TxRidValidationContext.error,\n        message: validationError.message,\n    };\n};\nexports.isTxRidValid = isTxRidValid;\n//# sourceMappingURL=txRid.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AnchoringTransactionSchema = void 0;\nconst buffer_1 = require(\"buffer\");\nconst zod_1 = require(\"zod\");\nconst txRid_1 = require(\"./txRid\");\nexports.AnchoringTransactionSchema = zod_1.z.object({\n    txRid: zod_1.z.instanceof(buffer_1.Buffer).superRefine((rid, refCtx) => {\n        const txRidValidation = txRid_1.TxRidSchema.safeParse(rid);\n        if (!txRidValidation.success)\n            txRidValidation.error.issues.forEach(issue => refCtx.addIssue(issue));\n    }),\n    txData: zod_1.z.instanceof(buffer_1.Buffer).refine(data => data.length > 0, {\n        message: \"txData must be a non-empty Buffer\",\n    }),\n    txOpIndex: zod_1.z.number().int().nonnegative({ message: \"txOpIndex must be a non-negative integer\" }),\n});\n//# sourceMappingURL=anchoringTransaction.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.BlockAnchoringException = exports.ConfirmationProofException = exports.SystemChainException = exports.ProofRidException = exports.SignatureException = exports.DifferentNumberOfSignersException = exports.MissingTransactionProof = void 0;\nconst formatter_1 = require(\"../formatter\");\nclass MissingTransactionProof extends Error {\n    constructor(proofHash, fetchedTxHash) {\n        super(`Unable to verify source transaction proof,transaction hash in proof ${(0, formatter_1.toString)(proofHash)} does not match hash from fetched transaction ${(0, formatter_1.toString)(fetchedTxHash)}`);\n    }\n}\nexports.MissingTransactionProof = MissingTransactionProof;\nclass DifferentNumberOfSignersException extends Error {\n    constructor(length, comparableLength) {\n        super(`Transaction signatures amount ${length} do not match expected amount of signers ${comparableLength}`);\n    }\n}\nexports.DifferentNumberOfSignersException = DifferentNumberOfSignersException;\nclass SignatureException extends Error {\n    constructor(signer) {\n        super(`Expected signer ${(0, formatter_1.toString)(signer)} has not signed source transaction`);\n    }\n}\nexports.SignatureException = SignatureException;\nclass ProofRidException extends Error {\n    constructor() {\n        super(\"Unable to verify source transaction proof, got a different transaction from query than we asked for\");\n    }\n}\nexports.ProofRidException = ProofRidException;\nclass SystemChainException extends Error {\n    constructor(errorMessage) {\n        super(`Query to system chain failed with error: ${errorMessage}`);\n    }\n}\nexports.SystemChainException = SystemChainException;\nclass ConfirmationProofException extends Error {\n    constructor(transactionRid) {\n        super(`Unable to fetch confirmation proof for transaction RID: ${(0, formatter_1.ensureString)(transactionRid)}.`);\n    }\n}\nexports.ConfirmationProofException = ConfirmationProofException;\nclass BlockAnchoringException extends Error {\n    constructor() {\n        super(`Block is not present in cluster anchoring chain`);\n    }\n}\nexports.BlockAnchoringException = BlockAnchoringException;\n//# sourceMappingURL=error.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isString = isString;\nexports.isDictPair = isDictPair;\nexports.isRawGtv = isRawGtv;\nexports.isTransactionInfoInBlockResponse = isTransactionInfoInBlockResponse;\nexports.isTransactionInfoInBlockResponseArray = isTransactionInfoInBlockResponseArray;\nexports.isBlockInfoResponse = isBlockInfoResponse;\nexports.isBlockInfoResponseArray = isBlockInfoResponseArray;\nexports.isTransaction = isTransaction;\nexports.isTransactionsCount = isTransactionsCount;\nexports.isTransactionConfirmationProof = isTransactionConfirmationProof;\nexports.isConfirmationProof = isConfirmationProof;\nexports.isTransactionInfoResponse = isTransactionInfoResponse;\nexports.isTransactionInfoResponseArray = isTransactionInfoResponseArray;\nexports.isTransactionInfo = isTransactionInfo;\nexports.isTransactionInfoArray = isTransactionInfoArray;\nexports.isRejectedTransaction = isRejectedTransaction;\nexports.isRejectedTransactionArray = isRejectedTransactionArray;\nexports.isRejectedTransactionResponse = isRejectedTransactionResponse;\nexports.isRejectedTransactionResponseArray = isRejectedTransactionResponseArray;\nconst buffer_1 = require(\"buffer\");\nconst zod_1 = require(\"zod\");\nconst RawGtvSchema = zod_1.z.union([\n    zod_1.z.boolean(),\n    zod_1.z.string(),\n    zod_1.z.number(),\n    zod_1.z.bigint(),\n    zod_1.z.instanceof(buffer_1.Buffer),\n    zod_1.z.array(zod_1.z.unknown()),\n    zod_1.z.record(zod_1.z.unknown()),\n]);\nconst DictPairSchema = zod_1.z.record(RawGtvSchema);\nconst TransactionInfoInBlockResponseSchema = zod_1.z.object({\n    rid: zod_1.z.string(),\n    hash: zod_1.z.string(),\n    data: zod_1.z.string().optional(),\n});\nconst BlockInfoResponseSchema = zod_1.z.object({\n    rid: zod_1.z.string(),\n    prevBlockRID: zod_1.z.string(),\n    header: zod_1.z.string(),\n    height: zod_1.z.number(),\n    transactions: zod_1.z.array(TransactionInfoInBlockResponseSchema),\n    witness: zod_1.z.string(),\n    witnesses: zod_1.z.array(zod_1.z.string()),\n    timestamp: zod_1.z.number(),\n});\nconst TransactionObjectSchema = zod_1.z.object({\n    tx: zod_1.z.string(),\n});\nconst TransactionsCountSchema = zod_1.z.object({\n    transactionsCount: zod_1.z.number(),\n});\nconst TransactionConfirmationProofSchema = zod_1.z.object({\n    proof: zod_1.z.string(),\n});\nconst ConfirmationProofSchema = zod_1.z.object({\n    hash: zod_1.z.instanceof(buffer_1.Buffer),\n    blockHeader: zod_1.z.instanceof(buffer_1.Buffer),\n    witness: zod_1.z.instanceof(buffer_1.Buffer),\n    merkleProofTree: RawGtvSchema,\n    txIndex: zod_1.z.number(),\n});\nconst TransactionInfoResponseSchema = zod_1.z.object({\n    blockRID: zod_1.z.string(),\n    blockHeight: zod_1.z.number(),\n    blockHeader: zod_1.z.string(),\n    witness: zod_1.z.string(),\n    timestamp: zod_1.z.number(),\n    txRID: zod_1.z.string(),\n    txHash: zod_1.z.string(),\n    txData: zod_1.z.string(),\n});\nconst TransactionInfoSchema = zod_1.z.object({\n    blockRid: zod_1.z.instanceof(buffer_1.Buffer),\n    blockHeight: zod_1.z.number(),\n    blockHeader: zod_1.z.instanceof(buffer_1.Buffer),\n    witness: zod_1.z.instanceof(buffer_1.Buffer),\n    timestamp: zod_1.z.number(),\n    txRid: zod_1.z.instanceof(buffer_1.Buffer),\n    txHash: zod_1.z.instanceof(buffer_1.Buffer),\n    txData: zod_1.z.instanceof(buffer_1.Buffer),\n});\nconst RejectedTransactionSchema = zod_1.z.object({\n    txRid: zod_1.z.instanceof(buffer_1.Buffer),\n    rejectReason: zod_1.z.string(),\n    rejectTimestamp: zod_1.z.number(),\n});\nconst RejectedTransactionResponseSchema = zod_1.z.object({\n    txRID: zod_1.z.string(),\n    rejectReason: zod_1.z.string(),\n    rejectTimestamp: zod_1.z.number(),\n});\nfunction isString(value) {\n    const result = zod_1.z.string().safeParse(value);\n    return result.success ? value : null;\n}\nfunction isDictPair(value) {\n    const result = DictPairSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isRawGtv(value) {\n    const result = RawGtvSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isTransactionInfoInBlockResponse(value) {\n    const result = TransactionInfoInBlockResponseSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isTransactionInfoInBlockResponseArray(value) {\n    const result = zod_1.z.array(TransactionInfoInBlockResponseSchema).safeParse(value);\n    return result.success ? value : null;\n}\nfunction isBlockInfoResponse(value) {\n    const result = BlockInfoResponseSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isBlockInfoResponseArray(value) {\n    const result = zod_1.z.array(BlockInfoResponseSchema).safeParse(value);\n    return result.success ? value : null;\n}\nfunction isTransaction(value) {\n    const result = TransactionObjectSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isTransactionsCount(value) {\n    const result = TransactionsCountSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isTransactionConfirmationProof(value) {\n    const result = TransactionConfirmationProofSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isConfirmationProof(value) {\n    const result = ConfirmationProofSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isTransactionInfoResponse(value) {\n    const result = TransactionInfoResponseSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isTransactionInfoResponseArray(value) {\n    const result = zod_1.z.array(TransactionInfoResponseSchema).safeParse(value);\n    return result.success ? value : null;\n}\nfunction isTransactionInfo(value) {\n    const result = TransactionInfoSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isTransactionInfoArray(value) {\n    const result = zod_1.z.array(TransactionInfoSchema).safeParse(value);\n    return result.success ? value : null;\n}\nfunction isRejectedTransaction(value) {\n    const result = RejectedTransactionSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isRejectedTransactionArray(value) {\n    const result = zod_1.z.array(RejectedTransactionSchema).safeParse(value);\n    return result.success ? value : null;\n}\nfunction isRejectedTransactionResponse(value) {\n    const result = RejectedTransactionResponseSchema.safeParse(value);\n    return result.success ? value : null;\n}\nfunction isRejectedTransactionResponseArray(value) {\n    const result = zod_1.z.array(RejectedTransactionResponseSchema).safeParse(value);\n    return result.success ? value : null;\n}\n//# sourceMappingURL=requests.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.encodeTransaction = encodeTransaction;\nconst gtx_1 = require(\"../gtx/gtx\");\n/**\n *\n * Encodes the gtx using ASN.1.\n * @returns the gtx encoded\n */\nfunction encodeTransaction(gtx) {\n    return (0, gtx_1.serialize)(gtx);\n}\n//# sourceMappingURL=encodeTransaction.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.validateMerkleHash = void 0;\nconst zod_1 = require(\"zod\");\nconst constants_1 = require(\"../../utils/constants\");\nconst MerkleHashSchema = zod_1.z.object({\n    merkle_hash_version: zod_1.z.number().int().positive(),\n});\nconst validateMerkleHash = (data) => {\n    const result = MerkleHashSchema.safeParse(data);\n    if (!result.success) {\n        return { merkle_hash_version: constants_1.MERKLE_HASH_VERSIONS.ONE };\n    }\n    return result.data;\n};\nexports.validateMerkleHash = validateMerkleHash;\n//# sourceMappingURL=merkleHash.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.handleRequest = handleRequest;\nconst buffer_1 = require(\"buffer\");\nconst logger = __importStar(require(\"../logger\"));\nconst serialization_1 = require(\"../gtx/serialization\");\nconst enums_1 = require(\"./enums\");\nfunction createTimeoutController(timeout) {\n    if (!timeout)\n        return { controller: undefined, timeoutId: undefined };\n    const controller = new AbortController();\n    const timeoutError = new Error(`Request timeout after ${timeout}ms`);\n    timeoutError.name = 'TimeoutError';\n    const timeoutId = setTimeout(() => controller.abort(timeoutError), timeout);\n    return { controller, timeoutId };\n}\nfunction handleRequest(method, path, endpoint, timeout, postObject) {\n    return __awaiter(this, void 0, void 0, function* () {\n        if (method == enums_1.Method.GET) {\n            return yield get(path, endpoint, timeout);\n        }\n        else {\n            return yield post(path, endpoint, timeout, postObject);\n        }\n    });\n}\n/**\n * Sends request to get data from a given API endpoint.\n * @param path API endpoint of Rell backend\n * @param endpoint\n * @param timeout\n */\nfunction get(path, endpoint, timeout) {\n    return __awaiter(this, void 0, void 0, function* () {\n        logger.debug(`GET URL ${new URL(path, endpoint).href}`);\n        try {\n            const { controller, timeoutId } = createTimeoutController(timeout);\n            const response = yield fetch(new URL(path, endpoint).href, {\n                signal: controller === null || controller === void 0 ? void 0 : controller.signal,\n            });\n            if (timeoutId)\n                clearTimeout(timeoutId);\n            const contentType = response.headers.get(\"Content-Type\");\n            const transactionTimestamp = response.headers.get(\"X-Transaction-Timestamp\");\n            let rspBody = null;\n            const error = null;\n            if (contentType === null || contentType === void 0 ? void 0 : contentType.includes(\"application/json\")) {\n                rspBody = yield response.json();\n            }\n            else if (contentType === null || contentType === void 0 ? void 0 : contentType.includes(\"text/plain\")) {\n                rspBody = yield response.text();\n            }\n            else if (contentType === null || contentType === void 0 ? void 0 : contentType.includes(\"application/octet-stream\")) {\n                rspBody = yield constructBufferResponseBody(response);\n            }\n            return createResponseObject(error, response.status, rspBody, transactionTimestamp);\n        }\n        catch (error) {\n            logger.error(error.message);\n            return createResponseObject(error, null, null);\n        }\n    });\n}\nfunction constructBufferResponseBody(response) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const contentType = response.headers.get(\"content-type\");\n        if (contentType === \"application/octet-stream\") {\n            const responseBuffer = yield response.arrayBuffer();\n            const buffer = buffer_1.Buffer.from(responseBuffer);\n            return (0, serialization_1.decodeValue)(buffer);\n        }\n        if (contentType === \"application/json\") {\n            return yield response.json();\n        }\n        const responseText = yield response.text();\n        return responseText ? responseText : response.statusText;\n    });\n}\n/**\n * Sends request to post data to a given API endpoint.\n * @param path API endpoint of Rell backend\n * @param endpoint\n * @param timeout\n * @param requestBody request body\n */\nfunction post(path, endpoint, timeout, requestBody) {\n    return __awaiter(this, void 0, void 0, function* () {\n        logger.debug(`POST URL ${new URL(path, endpoint).href}`);\n        logger.debug(`POST body ${JSON.stringify(requestBody)}`);\n        if (buffer_1.Buffer.isBuffer(requestBody)) {\n            try {\n                const { controller, timeoutId } = createTimeoutController(timeout);\n                const requestOptions = {\n                    method: \"post\",\n                    body: new Uint8Array(requestBody),\n                    headers: {\n                        Accept: \"application/octet-stream\",\n                        \"Content-Type\": \"application/octet-stream\",\n                    },\n                    signal: controller === null || controller === void 0 ? void 0 : controller.signal,\n                };\n                const response = yield fetch(new URL(path, endpoint).href, requestOptions);\n                if (timeoutId)\n                    clearTimeout(timeoutId);\n                const transactionTimestamp = response.headers.get(\"X-Transaction-Timestamp\");\n                return createResponseObject(null, response.status, yield constructBufferResponseBody(response), transactionTimestamp);\n            }\n            catch (error) {\n                return createResponseObject(error, null, null);\n            }\n        }\n        else {\n            try {\n                const { controller, timeoutId } = createTimeoutController(timeout);\n                const response = yield fetch(new URL(path, endpoint).href, {\n                    method: \"post\",\n                    body: JSON.stringify(requestBody),\n                    headers: {\n                        Accept: \"application/json\",\n                        \"Content-Type\": \"application/json\",\n                    },\n                    signal: controller === null || controller === void 0 ? void 0 : controller.signal,\n                });\n                if (timeoutId)\n                    clearTimeout(timeoutId);\n                const transactionTimestamp = response.headers.get(\"X-Transaction-Timestamp\");\n                return createResponseObject(null, response.status, yield constructBufferResponseBody(response), transactionTimestamp);\n            }\n            catch (error) {\n                return createResponseObject(error, null, null);\n            }\n        }\n    });\n}\nfunction createResponseObject(error, statusCode, rspBody, transactionTimestamp) {\n    let finalStatusCode = statusCode;\n    // Handle browser network errors as a specific status code for smart timeout logic\n    if (error && !statusCode && !rspBody) {\n        finalStatusCode = 502; // Treat as Bad Gateway for timeout purposes\n    }\n    const responseObject = {\n        error,\n        statusCode: finalStatusCode,\n        rspBody,\n    };\n    if (transactionTimestamp) {\n        responseObject.transactionTimestamp = transactionTimestamp;\n    }\n    return responseObject;\n}\n//# sourceMappingURL=httpUtil.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isSuccessfulStatusCode = exports.isServerErrorStatusCode = exports.isClientErrorStatusCode = void 0;\nexports.isQueryNotFoundError = isQueryNotFoundError;\nexports.isHttpStatusError = isHttpStatusError;\nexports.isNetworkError = isNetworkError;\nexports.isRetriableClientError = isRetriableClientError;\nfunction isQueryNotFoundError(error) {\n    return (typeof error === \"object\" &&\n        error !== null &&\n        \"code\" in error &&\n        error.code === \"QUERY_NOT_FOUND\");\n}\nfunction isHttpStatusError(error) {\n    return (typeof error === \"object\" &&\n        error !== null &&\n        \"status\" in error &&\n        typeof error.status === \"number\");\n}\nfunction isNetworkError(error) {\n    return (typeof error === \"object\" && error !== null && \"code\" in error && typeof error.code === \"string\");\n}\nfunction isRetriableClientError(response) {\n    if (typeof response === \"object\" && response !== null) {\n        // Check error field first\n        if (\"error\" in response && isQueryNotFoundError(response.error)) {\n            return false;\n        }\n        // Check rspBody if no error\n        if (\"rspBody\" in response && isQueryNotFoundError(response.rspBody)) {\n            return false;\n        }\n    }\n    return true;\n}\nconst isClientErrorStatusCode = (status) => {\n    return status >= 400 && status < 500;\n};\nexports.isClientErrorStatusCode = isClientErrorStatusCode;\nconst isServerErrorStatusCode = (status) => {\n    return status >= 500 && status < 600;\n};\nexports.isServerErrorStatusCode = isServerErrorStatusCode;\nconst isSuccessfulStatusCode = (statusCode) => statusCode >= 200 && statusCode < 300;\nexports.isSuccessfulStatusCode = isSuccessfulStatusCode;\n//# sourceMappingURL=http-utils.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.groupResponses = exports.checkStateOfPromises = exports.errorMessages = void 0;\nexports.abortOnError = abortOnError;\nexports.tryNextOnError = tryNextOnError;\nexports.queryMajority = queryMajority;\nexports.singleEndpoint = singleEndpoint;\nexports.retryRequest = retryRequest;\nexports.racePromisesWithTimeout = racePromisesWithTimeout;\nexports.createTimeoutPromise = createTimeoutPromise;\nconst utils_1 = require(\"./utils\");\nconst httpUtil_1 = require(\"./httpUtil\");\nconst logger = __importStar(require(\"../logger\"));\nconst http_utils_1 = require(\"../utils/http-utils\");\nfunction getUnreachableDuration(statusCode, error) {\n    if ((0, http_utils_1.isNetworkError)(error)) {\n        const { code } = error;\n        if (code === \"ENOTFOUND\")\n            return 5 * 60 * 1000;\n        if (code === \"ECONNREFUSED\")\n            return 5 * 60 * 1000;\n    }\n    const status = (0, http_utils_1.isHttpStatusError)(error) ? error.status : statusCode;\n    switch (status) {\n        case 500:\n            return 10 * 1000; // Server restart: 10s\n        case 502:\n            return 30 * 1000; // Gateway: 30s\n        case 503:\n            return 2 * 1000; // Load: 2s\n        case 504:\n            return 60 * 1000; // Timeout: 60s\n        default:\n            return 5 * 1000;\n    }\n}\nfunction abortOnError(_a) {\n    return __awaiter(this, arguments, void 0, function* ({ method, path, config, postObject, timeoutOverride, }) {\n        return yield retryRequest({\n            method,\n            path,\n            config,\n            postObject,\n            timeoutOverride,\n            useNextNodeOnError: false,\n            recoveryThreshold: config.recoveryThreshold, // Use user config or let nodeManager use default\n        });\n    });\n}\nfunction tryNextOnError(_a) {\n    return __awaiter(this, arguments, void 0, function* ({ method, path, config, postObject, timeoutOverride, }) {\n        return yield retryRequest({\n            method,\n            path,\n            config,\n            postObject,\n            timeoutOverride,\n            useNextNodeOnError: true,\n            recoveryThreshold: config.recoveryThreshold,\n        });\n    });\n}\nexports.errorMessages = {\n    NO_CONSENSUS: \"Nodes were not able to reach a consensus\",\n};\nfunction calculateBftMajorityThreshold(endpointPoolLength) {\n    return endpointPoolLength - (endpointPoolLength - 1) / 3;\n}\nfunction queryMajority(_a) {\n    return __awaiter(this, arguments, void 0, function* ({ method, path, config, postObject, timeoutOverride, }) {\n        var _b;\n        // Set up constants\n        const bftMajorityThreshold = calculateBftMajorityThreshold(config.endpointPool.length);\n        const failureThreshold = config.endpointPool.length - bftMajorityThreshold + 1;\n        const { nodeManager } = config;\n        const timeout = 15000;\n        const availableNodes = nodeManager.getAvailableNodes((_b = config.recoveryThreshold) !== null && _b !== void 0 ? _b : bftMajorityThreshold);\n        const outcomes = [];\n        const promises = availableNodes.map((node) => __awaiter(this, void 0, void 0, function* () {\n            try {\n                const requestTimeout = timeoutOverride !== null && timeoutOverride !== void 0 ? timeoutOverride : config.responseTimeout;\n                const response = yield (0, httpUtil_1.handleRequest)(method, path, node.url, requestTimeout, postObject);\n                const { statusCode } = response;\n                if (statusCode && (0, http_utils_1.isSuccessfulStatusCode)(statusCode)) {\n                    outcomes.push({ type: \"SUCCESS\", result: response });\n                }\n                else {\n                    if (statusCode && (0, http_utils_1.isServerErrorStatusCode)(statusCode)) {\n                        const duration = getUnreachableDuration(statusCode, response.error);\n                        nodeManager.makeNodeUnavailable(node.url, duration);\n                    }\n                    outcomes.push({ type: \"FAILURE\", result: response });\n                }\n                return response;\n            }\n            catch (error) {\n                outcomes.push({ type: \"ERROR\", result: error });\n                return error;\n            }\n        }));\n        let remainingPromises = promises;\n        // Wait for the necessary majority of outcomes to come back or for the timeout to be reached, whichever comes first.\n        for (let i = 0; i < bftMajorityThreshold; i++) {\n            remainingPromises = yield racePromisesWithTimeout(remainingPromises, timeout);\n        }\n        // Evaluate the outcomes\n        const successfulOutcomes = outcomes.filter(outcome => outcome.type === \"SUCCESS\");\n        const failureOutcomes = outcomes.filter(outcome => outcome.type === \"FAILURE\");\n        const errorOutcomes = outcomes.filter(outcome => outcome.type === \"ERROR\");\n        // group all of the same responses together into groups and count each groups size\n        const groupedSuccessfulResponses = (0, exports.groupResponses)(successfulOutcomes);\n        // validate the responses\n        // eslint-disable-next-line no-constant-condition\n        while (true) {\n            // Successful majority response was found\n            if (groupedSuccessfulResponses.maxNumberOfEqualResponses() >= bftMajorityThreshold) {\n                if (groupedSuccessfulResponses.numberOfDistinctResponses() > 1) {\n                    logger.warning(`Got disagreeing responses, but could still reach BFT majority`);\n                }\n                return groupedSuccessfulResponses.majorityResponse();\n            }\n            // Too many failures or errors to be able to reach a consensus\n            // If the number of failures and errors is greater than the failure threshold, return first failure, if any, otherwise throw the first error.\n            if ([...failureOutcomes, ...errorOutcomes].length >= failureThreshold) {\n                if (failureOutcomes.length > 0) {\n                    return failureOutcomes[0].result;\n                }\n                else {\n                    throw errorOutcomes[0].result;\n                }\n            }\n            // If all nodes have responded without a majority, throw an error.\n            if (outcomes.length >= config.endpointPool.length) {\n                throw new Error(exports.errorMessages.NO_CONSENSUS);\n            }\n            // Wait for more one more response to come back. ( we need to set a timeout here)\n            remainingPromises = yield racePromisesWithTimeout(remainingPromises, timeout);\n        }\n    });\n}\nfunction singleEndpoint(_a) {\n    return __awaiter(this, arguments, void 0, function* ({ method, path, config, postObject, timeoutOverride, }) {\n        let statusCode = null;\n        let rspBody = null;\n        let error = null;\n        let transactionTimestamp = undefined;\n        const endpoint = config.nodeManager.getNode();\n        if (!endpoint) {\n            throw new Error(\"No nodes available after recovery attempt. Check node configuration.\");\n        }\n        for (let attempt = 0; attempt < config.attemptsPerEndpoint; attempt++) {\n            const requestTimeout = timeoutOverride !== null && timeoutOverride !== void 0 ? timeoutOverride : config.responseTimeout;\n            const response = yield (0, httpUtil_1.handleRequest)(method, path, endpoint.url, requestTimeout, postObject);\n            if (response) {\n                ({ error, statusCode, rspBody, transactionTimestamp } = response);\n            }\n            const isError = statusCode\n                ? (0, http_utils_1.isClientErrorStatusCode)(statusCode) || (0, http_utils_1.isServerErrorStatusCode)(statusCode)\n                : false;\n            if (!isError && !error) {\n                return { error, statusCode, rspBody, transactionTimestamp };\n            }\n            logger.info(`${method} request failed on ${endpoint.url}. Attempt: ${attempt + 1} / ${config.attemptsPerEndpoint}`);\n            yield (0, utils_1.sleep)(config.attemptInterval);\n        }\n        return { error, statusCode, rspBody, transactionTimestamp };\n    });\n}\nfunction retryRequest(_a) {\n    return __awaiter(this, arguments, void 0, function* ({ method, path, config, postObject, useNextNodeOnError, recoveryThreshold, timeoutOverride, }) {\n        var _b, _c, _d;\n        let statusCode = null;\n        let rspBody = null;\n        let error = null;\n        let transactionTimestamp = undefined;\n        const { nodeManager } = config;\n        const availableNodes = nodeManager.getAvailableNodes(recoveryThreshold);\n        for (const node of availableNodes) {\n            for (let attempt = 0; attempt < config.attemptsPerEndpoint; attempt++) {\n                const requestTimeout = timeoutOverride !== null && timeoutOverride !== void 0 ? timeoutOverride : config.responseTimeout;\n                const response = yield (0, httpUtil_1.handleRequest)(method, path, node.url, requestTimeout, postObject);\n                error = (_b = response === null || response === void 0 ? void 0 : response.error) !== null && _b !== void 0 ? _b : null;\n                statusCode = (_c = response === null || response === void 0 ? void 0 : response.statusCode) !== null && _c !== void 0 ? _c : null;\n                rspBody = (_d = response === null || response === void 0 ? void 0 : response.rspBody) !== null && _d !== void 0 ? _d : null;\n                transactionTimestamp = response === null || response === void 0 ? void 0 : response.transactionTimestamp;\n                const isServerError = !!statusCode && (0, http_utils_1.isServerErrorStatusCode)(statusCode);\n                const isClientError = !!statusCode && (0, http_utils_1.isClientErrorStatusCode)(statusCode);\n                if (!isServerError && !isClientError && statusCode) {\n                    // Find a way to have this handled more elegantly in the node manager.\n                    nodeManager.lastUsedNode = node;\n                    if (nodeManager.stickedNode !== node) {\n                        node.makeAvailable();\n                        nodeManager.setStickyNode(node);\n                    }\n                    return { error, statusCode, rspBody, transactionTimestamp };\n                }\n                if (isServerError) {\n                    const duration = getUnreachableDuration(statusCode !== null && statusCode !== void 0 ? statusCode : undefined, response.error);\n                    nodeManager.makeNodeUnavailable(node.url, duration);\n                    logger.info(`request failed with server error on ${node.url} trying next node`);\n                    break;\n                }\n                if (isClientError) {\n                    if (!useNextNodeOnError || !(0, http_utils_1.isRetriableClientError)(response)) {\n                        return { error, statusCode, rspBody, transactionTimestamp };\n                    }\n                    if (!nodeManager.useStickyNode) {\n                        logger.info(`request failed client error on ${node.url} trying next node`);\n                        break;\n                    }\n                    // Otherwise continue with next attempt for this node\n                }\n                logger.info(`${method} request failed on ${node.url}. Attempt: ${attempt + 1} / ${config.attemptsPerEndpoint}`);\n                // if statement is workaround for test utils\n                if (config.attemptInterval > 0) {\n                    yield (0, utils_1.sleep)(config.attemptInterval);\n                }\n            }\n        }\n        return { error, statusCode, rspBody, transactionTimestamp };\n    });\n}\nfunction racePromisesWithTimeout(promises, timeout) {\n    return __awaiter(this, void 0, void 0, function* () {\n        let remainingPromises = [];\n        try {\n            const resolvedPromise = yield Promise.race([createTimeoutPromise(timeout), ...promises]);\n            const promisesWithState = yield (0, exports.checkStateOfPromises)(promises);\n            const indexOfpromiseToRemove = promisesWithState.findIndex(p => JSON.stringify(p.value) === JSON.stringify(resolvedPromise));\n            // Remove the promise that resolved from the list of promises\n            promisesWithState.splice(indexOfpromiseToRemove, 1);\n            // Remove the state before returning the promises.\n            remainingPromises = promisesWithState.map(p => p.value);\n            return remainingPromises;\n        }\n        catch (error) {\n            if (error instanceof Error && error.message === \"Timeout exceeded\") {\n                throw error;\n            }\n            return remainingPromises;\n        }\n    });\n}\nfunction createTimeoutPromise(timeoutMs) {\n    return __awaiter(this, void 0, void 0, function* () {\n        return new Promise((_, reject) => {\n            setTimeout(() => {\n                reject(new Error(\"Timeout exceeded\"));\n            }, timeoutMs);\n        });\n    });\n}\nconst checkStateOfPromises = (promises) => __awaiter(void 0, void 0, void 0, function* () {\n    const promiseList = [];\n    const pendingState = { status: \"pending\" };\n    for (const p of promises) {\n        promiseList.push(yield Promise.race([p, pendingState]).then(value => value === pendingState ? Object.assign(Object.assign({}, pendingState), { value: p }) : { status: \"fulfilled\", value }, reason => ({ status: \"rejected\", value: reason })));\n    }\n    return promiseList;\n});\nexports.checkStateOfPromises = checkStateOfPromises;\nconst stableStringify = (obj) => {\n    if (obj && typeof obj === \"object\" && !Array.isArray(obj)) {\n        return JSON.stringify(obj, Object.keys(obj).sort());\n    }\n    return JSON.stringify(obj);\n};\nconst groupResponses = (responses) => {\n    const responseMap = responses.reduce((acc, response) => {\n        const key = stableStringify(response.result);\n        acc[key] = acc[key]\n            ? { response: acc[key].response, count: acc[key].count + 1 }\n            : { response, count: 1 };\n        return acc;\n    }, {});\n    const distinctResponses = Object.values(responseMap).sort((a, b) => b.count - a.count);\n    // Returns the count of the most common response\n    const maxNumberOfEqualResponses = () => {\n        return distinctResponses.length > 0 ? distinctResponses[0].count : 0;\n    };\n    // Returns the number of distinct responses\n    const numberOfDistinctResponses = () => {\n        return distinctResponses.length;\n    };\n    // Returns the most common response\n    const majorityResponse = () => {\n        return distinctResponses[0].response.result;\n    };\n    return {\n        maxNumberOfEqualResponses,\n        numberOfDistinctResponses,\n        majorityResponse,\n    };\n};\nexports.groupResponses = groupResponses;\n//# sourceMappingURL=failoverStrategies.js.map","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.requestWithFailoverStrategy = requestWithFailoverStrategy;\nconst enums_1 = require(\"./enums\");\nconst failoverStrategies_1 = require(\"./failoverStrategies\");\nfunction requestWithFailoverStrategy(method_1, path_1, config_1, postObject_1) {\n    return __awaiter(this, arguments, void 0, function* (method, path, config, postObject, forceSingleEndpoint = false, timeoutOverride) {\n        switch (config.failoverStrategy) {\n            case enums_1.FailoverStrategy.AbortOnError:\n                return yield (0, failoverStrategies_1.abortOnError)({ method, path, config, postObject, timeoutOverride });\n            case enums_1.FailoverStrategy.TryNextOnError:\n                return yield (0, failoverStrategies_1.tryNextOnError)({ method, path, config, postObject, timeoutOverride });\n            case enums_1.FailoverStrategy.SingleEndpoint:\n                return yield (0, failoverStrategies_1.singleEndpoint)({ method, path, config, postObject, timeoutOverride });\n            case enums_1.FailoverStrategy.QueryMajority:\n                if (forceSingleEndpoint) {\n                    return yield (0, failoverStrategies_1.singleEndpoint)({ method, path, config, postObject, timeoutOverride });\n                }\n                return yield (0, failoverStrategies_1.queryMajority)({ method, path, config, postObject, timeoutOverride });\n            default:\n                throw new Error(`Unsupported failover strategy: ${config.failoverStrategy}`);\n        }\n    });\n}\n//# sourceMappingURL=requestWithFailoverStrategy.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sleep = exports.getUrlsFromEndpoints = exports.createEndpointObjects = exports.defaultFailoverConfig = exports.isKeyPair = exports.formatBlockInfoResponse = exports.formatTransactionInfoResponse = exports.handlePostResponsePromisified = exports.callbackPromiseBuilder = void 0;\nexports.getClientConfigFromSettings = getClientConfigFromSettings;\nexports.getMerkleHashVersionFromDapp = getMerkleHashVersionFromDapp;\nexports.validTxRid = validTxRid;\nexports.nodeDiscovery = nodeDiscovery;\nexports.getBlockchainApiUrls = getBlockchainApiUrls;\nexports.convertToRellOperation = convertToRellOperation;\nexports.getSerializedGTX = getSerializedGTX;\nexports.getGTXFromBufferOrTransactionOrOperation = getGTXFromBufferOrTransactionOrOperation;\nexports.formatRejectedTransactionFromResponse = formatRejectedTransactionFromResponse;\nexports.getSystemClient = getSystemClient;\nexports.getSystemAnchoringChain = getSystemAnchoringChain;\nexports.awaitDappConfirmation = awaitDappConfirmation;\nexports.awaitClusterAnchoringChainConfirmation = awaitClusterAnchoringChainConfirmation;\nexports.handleDappConfirmations = handleDappConfirmations;\nexports.handleSystemConfirmations = handleSystemConfirmations;\nexports.getAnchoringClientAndSystemChainRid = getAnchoringClientAndSystemChainRid;\nexports.getSystemAnchoringTransaction = getSystemAnchoringTransaction;\nexports.setStatusPolling = setStatusPolling;\nexports.setRetryTransactionPolling = setRetryTransactionPolling;\nexports.linkPromiEvents = linkPromiEvents;\nexports.handleGetResponse = handleGetResponse;\nexports.handlePostResponse = handlePostResponse;\nexports.getBlockchainRidFromIid = getBlockchainRidFromIid;\nexports.convertToPrintable = convertToPrintable;\nconst buffer_1 = require(\"buffer\");\nconst logger = __importStar(require(\"../logger\"));\nconst errors_1 = require(\"./errors\");\nconst gtxTool = __importStar(require(\"../gtx/gtx\"));\nconst errors_2 = require(\"./errors\");\nconst formatter_1 = require(\"../formatter\");\nconst blockchainClient_1 = require(\"./blockchainClient\");\nconst enums_1 = require(\"./enums\");\nconst nodeManager_1 = require(\"./nodeManager\");\nconst anchoringTransaction_1 = require(\"./validation/anchoringTransaction\");\nconst error_1 = require(\"../ICCF/error\");\nconst IccfProofTxMaterialBuilder_1 = require(\"../ICCF/IccfProofTxMaterialBuilder\");\nconst utils_1 = require(\"../ICCF/utils\");\nconst requests_1 = require(\"./validation/requests\");\nconst encodeTransaction_1 = require(\"../utils/encodeTransaction\");\nconst merkleHash_1 = require(\"./validation/merkleHash\");\nconst requestWithFailoverStrategy_1 = require(\"./requestWithFailoverStrategy\");\nconst constants_1 = require(\"../utils/constants\");\nconst http_utils_1 = require(\"../utils/http-utils\");\nfunction getClientConfigFromSettings(settings) {\n    return __awaiter(this, void 0, void 0, function* () {\n        var _a, _b, _c, _d, _e, _f, _g, _h, _j;\n        const nodeUrlPoolToUse = yield getNodeUrlsFromSettings(settings);\n        if (nodeUrlPoolToUse === null || nodeUrlPoolToUse.length === 0) {\n            const id = (_b = (_a = settings.blockchainRid) !== null && _a !== void 0 ? _a : settings.blockchainIid) !== null && _b !== void 0 ? _b : \"Unknown\";\n            throw new errors_2.BlockchainUrlUndefinedException(id);\n        }\n        const endpointPool = (0, exports.createEndpointObjects)(nodeUrlPoolToUse);\n        const nodeManager = (0, nodeManager_1.createNodeManager)({\n            nodeUrls: nodeUrlPoolToUse,\n            useStickyNode: (_c = settings.useStickyNode) !== null && _c !== void 0 ? _c : false,\n            unavailableDuration: (_d = settings.failOverConfig) === null || _d === void 0 ? void 0 : _d.unreachableDuration,\n        });\n        const blockchainRidToUse = yield (() => __awaiter(this, void 0, void 0, function* () {\n            var _a;\n            if (settings.blockchainRid) {\n                return settings.blockchainRid;\n            }\n            if (settings.blockchainIid !== undefined) {\n                return yield getBlockchainRidFromIid({\n                    nodeManager,\n                    endpointPool,\n                    chainId: settings.blockchainIid,\n                    merkleHashVersion: (_a = settings.merkleHashVersion) !== null && _a !== void 0 ? _a : constants_1.MERKLE_HASH_VERSIONS.UNSET,\n                    connectTimeout: settings.connectTimeout,\n                    responseTimeout: settings.responseTimeout,\n                });\n            }\n            throw new errors_2.MissingBlockchainIdentifierError();\n        }))();\n        const directoryChainRid = yield (() => __awaiter(this, void 0, void 0, function* () {\n            var _a;\n            if (settings.directoryChainRid) {\n                return settings.directoryChainRid;\n            }\n            const directoryChainIid = 0;\n            return yield getBlockchainRidFromIid({\n                nodeManager,\n                endpointPool,\n                chainId: directoryChainIid,\n                merkleHashVersion: (_a = settings.merkleHashVersion) !== null && _a !== void 0 ? _a : constants_1.MERKLE_HASH_VERSIONS.UNSET,\n                connectTimeout: settings.connectTimeout,\n                responseTimeout: settings.responseTimeout,\n            });\n        }))();\n        return Object.assign(Object.assign(Object.assign({ endpointPool, nodeManager: nodeManager }, (settings.blockedNodeUrlSubstrings !== undefined\n            ? { blockedNodeUrlSubstrings: settings.blockedNodeUrlSubstrings }\n            : {})), (settings.nodeUrlFilter !== undefined ? { nodeUrlFilter: settings.nodeUrlFilter } : {})), { blockchainRid: blockchainRidToUse, merkleHashVersion: (_e = settings.merkleHashVersion) !== null && _e !== void 0 ? _e : constants_1.MERKLE_HASH_VERSIONS.UNSET, dappStatusPolling: setStatusPolling(settings.dappStatusPolling), clusterAnchoringStatusPolling: setStatusPolling(settings.clusterAnchoringStatusPolling), systemAnchoringStatusPolling: setStatusPolling(settings.systemAnchoringStatusPolling), retryTransactionPolling: setRetryTransactionPolling(settings.retryTransactionPolling), failoverStrategy: ((_f = settings.failOverConfig) === null || _f === void 0 ? void 0 : _f.strategy) || exports.defaultFailoverConfig.strategy, attemptsPerEndpoint: ((_g = settings.failOverConfig) === null || _g === void 0 ? void 0 : _g.attemptsPerEndpoint) || exports.defaultFailoverConfig.attemptsPerEndpoint, attemptInterval: ((_h = settings.failOverConfig) === null || _h === void 0 ? void 0 : _h.attemptInterval) || exports.defaultFailoverConfig.attemptInterval, unreachableDuration: ((_j = settings.failOverConfig) === null || _j === void 0 ? void 0 : _j.unreachableDuration) || exports.defaultFailoverConfig.unreachableDuration, directoryChainRid: settings.directoryChainRid || directoryChainRid, connectTimeout: settings.connectTimeout, responseTimeout: settings.responseTimeout });\n    });\n}\nfunction getMerkleHashVersionFromDapp(config) {\n    return __awaiter(this, void 0, void 0, function* () {\n        var _a;\n        try {\n            const response = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `/config/${config.blockchainRid}/features`, config, undefined, false, (_a = config.connectTimeout) !== null && _a !== void 0 ? _a : config.responseTimeout);\n            const validatedResponse = (0, merkleHash_1.validateMerkleHash)(response.rspBody);\n            return validatedResponse.merkle_hash_version;\n        }\n        catch (error) {\n            console.warn(\"MERKLE_HASH_WARNING: version not found or endpoint unreachable\", error);\n            return constants_1.MERKLE_HASH_VERSIONS.ONE;\n        }\n    });\n}\nfunction validTxRid(txRID) {\n    if (txRID.length != 32) {\n        const error = new errors_1.InvalidTxRidException(txRID);\n        logger.error(error.toString());\n        return false;\n    }\n    return true;\n}\nfunction nodeDiscovery(_a) {\n    return __awaiter(this, arguments, void 0, function* ({ nodeManager, directoryEndpointPool, blockedNodeUrlSubstrings, nodeUrlFilter, failOverConfig, blockchainRid, blockchainIid, connectTimeout, responseTimeout, }) {\n        if (directoryEndpointPool.length === 0) {\n            throw new errors_2.DirectoryNodeUrlPoolException();\n        }\n        if (!blockchainRid && blockchainIid === undefined) {\n            throw new errors_2.MissingBlockchainIdentifierError();\n        }\n        const directoryIid = 0;\n        const directoryBRID = yield getBlockchainRidFromIid({\n            nodeManager,\n            endpointPool: directoryEndpointPool,\n            chainId: directoryIid,\n            failOverConfig,\n            connectTimeout,\n            responseTimeout,\n        });\n        const blockchainRidToUse = yield (() => __awaiter(this, void 0, void 0, function* () {\n            if (blockchainRid) {\n                return blockchainRid;\n            }\n            if (blockchainIid !== undefined) {\n                return yield getBlockchainRidFromIid({\n                    nodeManager,\n                    endpointPool: directoryEndpointPool,\n                    chainId: blockchainIid,\n                    failOverConfig,\n                    connectTimeout,\n                    responseTimeout,\n                });\n            }\n            throw new errors_2.MissingBlockchainIdentifierError();\n        }))();\n        const D1Client = yield (0, blockchainClient_1.createClient)({\n            nodeUrlPool: (0, exports.getUrlsFromEndpoints)(directoryEndpointPool),\n            blockchainRid: directoryBRID,\n        });\n        const discoveredNodes = yield getBlockchainApiUrls(D1Client, (0, formatter_1.ensureBuffer)(blockchainRidToUse));\n        return applyNodeUrlFilters(discoveredNodes, {\n            blockedNodeUrlSubstrings,\n            nodeUrlFilter,\n        }, \"discoveredNodeUrlPool\");\n    });\n}\nfunction getBlockchainApiUrls(directoryClient, blockchainRid) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const queryObject = {\n            name: \"cm_get_blockchain_api_urls\",\n            args: { blockchain_rid: blockchainRid },\n        };\n        return yield directoryClient.query(queryObject);\n    });\n}\nfunction convertToRellOperation(operations) {\n    return operations.map(operation => {\n        var _a;\n        return {\n            opName: operation.name,\n            args: (_a = operation.args) !== null && _a !== void 0 ? _a : [],\n        };\n    });\n}\nfunction getSerializedGTX(gtx) {\n    const gtxBytes = (0, encodeTransaction_1.encodeTransaction)(gtx);\n    if (!buffer_1.Buffer.isBuffer(gtxBytes)) {\n        throw new errors_1.SerializedTransactionFormatException();\n    }\n    return gtxBytes;\n}\nfunction getGTXFromBufferOrTransactionOrOperation(transaction, blockchainRid) {\n    if (buffer_1.Buffer.isBuffer(transaction)) {\n        return gtxTool.deserialize(transaction);\n    }\n    else if (\"operations\" in transaction) {\n        return {\n            blockchainRid: (0, formatter_1.ensureBuffer)(blockchainRid),\n            operations: convertToRellOperation(transaction.operations),\n            signers: transaction.signers,\n            signatures: [],\n        };\n    }\n    else if (\"name\" in transaction) {\n        return {\n            blockchainRid: (0, formatter_1.ensureBuffer)(blockchainRid),\n            operations: convertToRellOperation([transaction]),\n            signers: [],\n            signatures: [],\n        };\n    }\n    else {\n        throw new errors_2.InvalidTransactionFormatException();\n    }\n}\nconst callbackPromiseBuilder = (reject, resolve, callback) => {\n    return (error, result) => {\n        var _a;\n        if (error) {\n            callback === null || callback === void 0 ? void 0 : callback(error, null);\n            reject(error);\n        }\n        else {\n            callback === null || callback === void 0 ? void 0 : callback(null, (_a = result) !== null && _a !== void 0 ? _a : null);\n            resolve(result !== null && result !== void 0 ? result : null);\n        }\n    };\n};\nexports.callbackPromiseBuilder = callbackPromiseBuilder;\nconst handlePostResponsePromisified = (error, statusCode, rspBody) => {\n    return new Promise((resolve, reject) => {\n        handlePostResponse(error, statusCode, rspBody, _error => {\n            if (_error) {\n                reject(_error);\n            }\n            else {\n                resolve();\n            }\n        });\n    });\n};\nexports.handlePostResponsePromisified = handlePostResponsePromisified;\nfunction ensureArray(input) {\n    if (typeof input === \"string\") {\n        return [input];\n    }\n    return input;\n}\nconst formatTransactionInfoResponse = (transactionInfoResponse) => {\n    return {\n        blockRid: (0, formatter_1.toBuffer)(transactionInfoResponse.blockRID),\n        blockHeight: transactionInfoResponse.blockHeight,\n        blockHeader: (0, formatter_1.toBuffer)(transactionInfoResponse.blockHeader),\n        witness: (0, formatter_1.toBuffer)(transactionInfoResponse.witness),\n        timestamp: transactionInfoResponse.timestamp,\n        txRid: (0, formatter_1.toBuffer)(transactionInfoResponse.txRID),\n        txHash: (0, formatter_1.toBuffer)(transactionInfoResponse.txHash),\n        txData: (0, formatter_1.toBuffer)(transactionInfoResponse.txData),\n    };\n};\nexports.formatTransactionInfoResponse = formatTransactionInfoResponse;\nconst formatBlockInfoResponse = (blockInfoResponse) => {\n    return {\n        rid: (0, formatter_1.toBuffer)(blockInfoResponse.rid),\n        prevBlockRid: (0, formatter_1.toBuffer)(blockInfoResponse.prevBlockRID),\n        header: (0, formatter_1.toBuffer)(blockInfoResponse.header),\n        transactions: blockInfoResponse.transactions.map(formatTransaction),\n        height: blockInfoResponse.height,\n        witness: (0, formatter_1.toBuffer)(blockInfoResponse.witness),\n        witnesses: blockInfoResponse.witnesses.map(witness => {\n            return (0, formatter_1.toBuffer)(witness);\n        }),\n        timestamp: blockInfoResponse.timestamp,\n    };\n};\nexports.formatBlockInfoResponse = formatBlockInfoResponse;\nconst formatTransaction = (transaction) => {\n    const formattedTransaction = {\n        rid: (0, formatter_1.toBuffer)(transaction.rid),\n        hash: (0, formatter_1.toBuffer)(transaction.hash),\n    };\n    if (transaction.data !== undefined) {\n        formattedTransaction.data = (0, formatter_1.toBuffer)(transaction.data);\n    }\n    return formattedTransaction;\n};\nfunction formatRejectedTransactionFromResponse(rejectedTransactionResponse) {\n    return {\n        txRid: (0, formatter_1.toBuffer)(rejectedTransactionResponse.txRID),\n        rejectReason: rejectedTransactionResponse.rejectReason,\n        rejectTimestamp: rejectedTransactionResponse.rejectTimestamp,\n    };\n}\nconst isKeyPair = (keypair) => {\n    return (typeof keypair === \"object\" &&\n        keypair !== null &&\n        \"privKey\" in keypair &&\n        \"pubKey\" in keypair &&\n        keypair.privKey instanceof buffer_1.Buffer &&\n        keypair.pubKey instanceof buffer_1.Buffer);\n};\nexports.isKeyPair = isKeyPair;\nfunction getNodeUrlsFromSettings(settings) {\n    return __awaiter(this, void 0, void 0, function* () {\n        var _a;\n        if (settings.directoryNodeUrlPool) {\n            const directoryNodeUrlsOrNull = applyNodeUrlFilters(ensureArray(settings.directoryNodeUrlPool), settings, \"directoryNodeUrlPool\");\n            if (directoryNodeUrlsOrNull === null) {\n                throw new errors_2.DirectoryNodeUrlPoolException();\n            }\n            const directoryNodeUrls = directoryNodeUrlsOrNull;\n            // If directoryNodeUrlPool is provided, use nodeDiscovery\n            const nodeManager = (0, nodeManager_1.createNodeManager)({\n                nodeUrls: directoryNodeUrls,\n                unavailableDuration: (_a = settings.failOverConfig) === null || _a === void 0 ? void 0 : _a.unreachableDuration,\n            });\n            const discoveredNodes = yield nodeDiscovery({\n                nodeManager,\n                directoryEndpointPool: (0, exports.createEndpointObjects)(directoryNodeUrls),\n                blockedNodeUrlSubstrings: settings.blockedNodeUrlSubstrings,\n                nodeUrlFilter: settings.nodeUrlFilter,\n                failOverConfig: settings.failOverConfig,\n                blockchainRid: settings.blockchainRid,\n                blockchainIid: settings.blockchainIid,\n                connectTimeout: settings.connectTimeout,\n                responseTimeout: settings.responseTimeout,\n            });\n            return discoveredNodes;\n        }\n        else if (typeof settings.nodeUrlPool === \"string\") {\n            // If nodeUrlPool is a string, convert it to an array\n            return applyNodeUrlFilters([settings.nodeUrlPool], settings, \"nodeUrlPool\");\n        }\n        else if (Array.isArray(settings.nodeUrlPool)) {\n            // If nodeUrlPool is already an array, use it as-is\n            return applyNodeUrlFilters(settings.nodeUrlPool, settings, \"nodeUrlPool\");\n        }\n        else {\n            // Default to an empty array if no valid configuration is provided\n            return [];\n        }\n    });\n}\nfunction applyNodeUrlFilters(nodeUrls, settings, poolName) {\n    var _a;\n    if (nodeUrls === null) {\n        return null;\n    }\n    const hasBlockedSubstringsFilter = Array.isArray(settings.blockedNodeUrlSubstrings) &&\n        settings.blockedNodeUrlSubstrings.length > 0;\n    const hasNodeUrlFilter = typeof settings.nodeUrlFilter === \"function\";\n    if (!hasBlockedSubstringsFilter && !hasNodeUrlFilter) {\n        return nodeUrls;\n    }\n    const blockedSubstrings = ((_a = settings.blockedNodeUrlSubstrings) !== null && _a !== void 0 ? _a : [])\n        .map(substring => substring.toLowerCase())\n        .filter(substring => substring.length > 0);\n    const filteredNodeUrls = nodeUrls.filter(url => {\n        const isBlockedBySubstring = blockedSubstrings.some(substring => url.toLowerCase().includes(substring));\n        const passesCustomFilter = settings.nodeUrlFilter ? settings.nodeUrlFilter(url) : true;\n        return !isBlockedBySubstring && passesCustomFilter;\n    });\n    if (filteredNodeUrls.length === 0) {\n        throw new errors_2.FilteredNodeUrlPoolEmptyError(poolName);\n    }\n    return filteredNodeUrls;\n}\nfunction getSystemClient(directoryNodeUrlPool, directoryChainRid, blockedNodeUrlSubstrings, nodeUrlFilter) {\n    return __awaiter(this, void 0, void 0, function* () {\n        return yield (0, blockchainClient_1.createClient)({\n            directoryNodeUrlPool,\n            blockchainRid: directoryChainRid,\n            blockedNodeUrlSubstrings,\n            nodeUrlFilter,\n        });\n    });\n}\nfunction getSystemAnchoringChain(directoryClient) {\n    return __awaiter(this, void 0, void 0, function* () {\n        try {\n            const queryObject = {\n                name: \"cm_get_system_anchoring_chain\",\n            };\n            const systemAnchoringChain = yield directoryClient.query(queryObject);\n            if (!systemAnchoringChain) {\n                throw new error_1.SystemChainException(\"Directory chain client must be provided.\");\n            }\n            return systemAnchoringChain;\n        }\n        catch (error) {\n            throw new error_1.SystemChainException(error.message);\n        }\n    });\n}\nexports.defaultFailoverConfig = {\n    strategy: enums_1.FailoverStrategy.AbortOnError,\n    attemptsPerEndpoint: 3,\n    attemptInterval: 500,\n    unreachableDuration: 30000,\n};\nconst createEndpointObjects = (endpointPoolUrls) => {\n    const endpoints = endpointPoolUrls.map(endpointUrl => {\n        return { url: endpointUrl, whenAvailable: 0 };\n    });\n    return endpoints;\n};\nexports.createEndpointObjects = createEndpointObjects;\nconst getUrlsFromEndpoints = (endpointPool) => {\n    return endpointPool.map(endpoint => endpoint.url);\n};\nexports.getUrlsFromEndpoints = getUrlsFromEndpoints;\nfunction awaitDappConfirmation(txRID, dappStatusPolling, getTransactionStatus) {\n    return __awaiter(this, void 0, void 0, function* () {\n        var _a;\n        let lastKnownResult = null;\n        for (let i = 0; i < dappStatusPolling.count; i++) {\n            lastKnownResult = yield getTransactionStatus(txRID);\n            if (lastKnownResult.status === enums_1.ResponseStatus.Confirmed) {\n                return lastKnownResult;\n            }\n            else if (lastKnownResult.status === enums_1.ResponseStatus.Rejected) {\n                throw new errors_1.TxRejectedError((_a = lastKnownResult.rejectReason) !== null && _a !== void 0 ? _a : \"\");\n            }\n            yield (0, exports.sleep)(dappStatusPolling.interval);\n        }\n        throw new Error(`Retry count exceeded. Confirmation not received. Last transaction status: ${lastKnownResult === null || lastKnownResult === void 0 ? void 0 : lastKnownResult.status}`);\n    });\n}\nfunction awaitClusterAnchoringChainConfirmation(txRID, clusterAnchoringStatusPolling, getClusterAnchoringTransactionConfirmation) {\n    return __awaiter(this, void 0, void 0, function* () {\n        var _a;\n        let clusterAnchoringConfirmation;\n        for (let i = 0; i < clusterAnchoringStatusPolling.count; i++) {\n            clusterAnchoringConfirmation = yield getClusterAnchoringTransactionConfirmation(txRID);\n            const anchoringTransactionValidaiton = anchoringTransaction_1.AnchoringTransactionSchema.safeParse(clusterAnchoringConfirmation);\n            if (anchoringTransactionValidaiton.success) {\n                return {\n                    status: enums_1.AnchoringStatus.ClusterAnchored,\n                    clusterAnchoredTx: anchoringTransactionValidaiton.data,\n                };\n            }\n            else if (!anchoringTransactionValidaiton.success) {\n                throw new errors_1.TxRejectedError((_a = enums_1.AnchoringStatus.FailedAnchoring) !== null && _a !== void 0 ? _a : \"\");\n            }\n            yield (0, exports.sleep)(clusterAnchoringStatusPolling.interval);\n        }\n        // TS issue. This could be fixed by implementing new retry strategy\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        //@ts-expect-error\n        return clusterAnchoringConfirmation;\n    });\n}\nfunction handleDappConfirmations(transactionRid, doStatusPolling, confirmationLevel, promiEvent, dappStatusPolling, getTransactionStatus, client) {\n    return __awaiter(this, void 0, void 0, function* () {\n        var _a, _b;\n        const transactionReceipt = {\n            status: enums_1.ResponseStatus.Pending,\n            statusCode: null,\n            transactionRid: transactionRid,\n            node: (_a = client.config.nodeManager.lastUsedNode) === null || _a === void 0 ? void 0 : _a.url,\n        };\n        promiEvent.emit(enums_1.TransactionEvent.DappReceived, transactionReceipt);\n        if (doStatusPolling === false || confirmationLevel === enums_1.ChainConfirmationLevel.None) {\n            return transactionReceipt;\n        }\n        const dappConfirmationStatus = yield awaitDappConfirmation(transactionRid, dappStatusPolling, getTransactionStatus);\n        transactionReceipt.statusCode = dappConfirmationStatus.statusCode;\n        transactionReceipt.status = dappConfirmationStatus.status;\n        transactionReceipt.node = (_b = client.config.nodeManager.lastUsedNode) === null || _b === void 0 ? void 0 : _b.url;\n        promiEvent.emit(enums_1.TransactionEvent.DappConfirmed, transactionReceipt);\n        if (confirmationLevel === enums_1.ChainConfirmationLevel.Dapp) {\n            return transactionReceipt;\n        }\n        return transactionReceipt;\n    });\n}\nfunction handleSystemConfirmations(transactionReceipt, confirmationLevel, promiEvent, statusPollingConfig, anchoringClient, systemAnchoringChainBrid, getClusterAnchoringTransactionConfirmation, getSystemAnchoringTransactionConfirmation) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const clusterAnchoringChainConfirmation = yield awaitClusterAnchoringChainConfirmation(transactionReceipt.transactionRid, statusPollingConfig.clusterAnchoringStatusPolling, getClusterAnchoringTransactionConfirmation);\n        transactionReceipt.status = clusterAnchoringChainConfirmation.status;\n        transactionReceipt.clusterAnchoredTx = clusterAnchoringChainConfirmation.clusterAnchoredTx;\n        transactionReceipt.clusterAnchoringClientBrid = anchoringClient.config.blockchainRid;\n        promiEvent.emit(enums_1.TransactionEvent.ClusterAnchoringConfirmation, transactionReceipt);\n        if (confirmationLevel === enums_1.ChainConfirmationLevel.ClusterAnchoring) {\n            return transactionReceipt;\n        }\n        const systemAnchoringConfirmation = yield getSystemAnchoringTransactionConfirmation(clusterAnchoringChainConfirmation.clusterAnchoredTx.txRid, anchoringClient, systemAnchoringChainBrid);\n        if (!systemAnchoringConfirmation) {\n            return transactionReceipt;\n        }\n        transactionReceipt.status = enums_1.AnchoringStatus.SystemAnchored;\n        transactionReceipt.systemAnchoredTx = systemAnchoringConfirmation;\n        transactionReceipt.systemAnchoringClientBrid = systemAnchoringChainBrid;\n        promiEvent.emit(enums_1.TransactionEvent.SystemAnchoringConfirmation, transactionReceipt);\n        if (confirmationLevel === enums_1.ChainConfirmationLevel.SystemAnchoring) {\n            return transactionReceipt;\n        }\n        return transactionReceipt;\n    });\n}\nfunction getAnchoringClientAndSystemChainRid(client) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const directoryClient = yield getSystemClient((0, exports.getUrlsFromEndpoints)(client.config.endpointPool), client.config.directoryChainRid, client.config.blockedNodeUrlSubstrings, client.config.nodeUrlFilter);\n        const anchoringClient = yield (0, IccfProofTxMaterialBuilder_1.getAnchoringClient)(directoryClient, client.config.blockchainRid);\n        const systemAnchoringChainRidBuffer = yield getSystemAnchoringChain(directoryClient);\n        const systemAnchoringChainBridString = systemAnchoringChainRidBuffer.toString(\"hex\");\n        return { anchoringClient, systemAnchoringChainBridString };\n    });\n}\nfunction getSystemAnchoringTransaction(dappClientEndpointPool, anchoredTxRid, anchoringClient, systemAnchoringChainRid, systemAnchoringStatusPolling, merkleHashVersion, blockedNodeUrlSubstrings, nodeUrlFilter) {\n    return __awaiter(this, void 0, void 0, function* () {\n        const systemAnchoringChainClient = yield getSystemClient((0, exports.getUrlsFromEndpoints)(dappClientEndpointPool), systemAnchoringChainRid, blockedNodeUrlSubstrings, nodeUrlFilter);\n        const clusterAnchoringProof = yield anchoringClient.getConfirmationProof(anchoredTxRid);\n        const clusterBlockRid = (0, utils_1.calculateBlockRID)(clusterAnchoringProof, merkleHashVersion);\n        const systemAnchoringTransactionConfirmation = yield (0, utils_1.awaitGetAnchoringTransactionForBlockRid)(systemAnchoringChainClient, (0, formatter_1.toBuffer)(anchoringClient.config.blockchainRid), clusterBlockRid, systemAnchoringStatusPolling);\n        const systemAnchoringTransactionValidation = anchoringTransaction_1.AnchoringTransactionSchema.safeParse(systemAnchoringTransactionConfirmation);\n        if (!systemAnchoringTransactionValidation.success) {\n            return null;\n        }\n        return systemAnchoringTransactionValidation.data;\n    });\n}\n/**\n * Should be used to configure the `IClient` `ClientConfig` (config) properties\n * `dappStatusPolling`, `clusterAnchoringStatusPolling` and `systemAnchoringStatusPolling` with\n * the corresponding status polling configuration `interval` and `status`.\n * If the values are not provided, they do default to `500` for `interval` and `20` for `count`\n *\n * @param statusPolling - An optional partial configuration object, that can set the status polling interval and count properties\n * @returns - Returns a complete `StatusPolling` configuration object, with default values for any missing properties\n * of the provided partial configuration\n */\nfunction setStatusPolling(statusPolling) {\n    var _a, _b;\n    return {\n        interval: (_a = statusPolling === null || statusPolling === void 0 ? void 0 : statusPolling.interval) !== null && _a !== void 0 ? _a : 500,\n        count: (_b = statusPolling === null || statusPolling === void 0 ? void 0 : statusPolling.count) !== null && _b !== void 0 ? _b : 20,\n    };\n}\nfunction setRetryTransactionPolling(statusPolling) {\n    var _a, _b;\n    return {\n        interval: (_a = statusPolling === null || statusPolling === void 0 ? void 0 : statusPolling.interval) !== null && _a !== void 0 ? _a : 500,\n        count: (_b = statusPolling === null || statusPolling === void 0 ? void 0 : statusPolling.count) !== null && _b !== void 0 ? _b : 3,\n    };\n}\nfunction linkPromiEvents(event1, event2) {\n    const transactionEvents = Object.values(enums_1.TransactionEvent).filter((event) => typeof event === \"string\");\n    /* eslint-disable @typescript-eslint/no-explicit-any */\n    const forwardEvent = (eventName) => (receipt) => event2.emit(eventName, receipt);\n    for (const eventName of transactionEvents) {\n        event1.on(eventName, forwardEvent(eventName));\n    }\n}\n/**\n * @param error response error\n * @param statusCode response status code\n * @param responseObject the responsebody from the server\n * @param callback the callback function to propagate the error and response back to the caller\n */\nfunction handleGetResponse(error, statusCode, responseObject, callback) {\n    try {\n        const responseObjectPrintable = convertToPrintable(responseObject);\n        logger.debug(`error: ${error}, status code: ${statusCode}, response body: ${responseObjectPrintable}`);\n        if (error) {\n            return callback(error, null);\n        }\n        if (statusCode !== 200) {\n            return callback(new errors_1.UnexpectedStatusError(statusCode !== null && statusCode !== void 0 ? statusCode : 400, responseObjectPrintable), null);\n        }\n        return callback(null, responseObject);\n    }\n    catch (error) {\n        callback(error, null);\n        logger.error(`client.handleGetResponse(): Failed to call the callback function. ${error}`);\n    }\n}\n/**\n * @param error response error\n * @param statusCode response status code\n * @param responseObject the responsebody from the server\n * @param callback the callback function to propagate the error and response back to the caller\n */\nfunction handlePostResponse(error, statusCode, responseObject, callback) {\n    var _a;\n    const responseObjectPrintable = convertToPrintable(responseObject);\n    logger.debug(`error: ${error}, status code: ${statusCode}, response body: ${responseObjectPrintable}`);\n    try {\n        if (error) {\n            logger.error(`In client post(). ${error}`);\n            callback(error, null);\n        }\n        else if (!statusCode || !(0, http_utils_1.isSuccessfulStatusCode)(statusCode)) {\n            let errorMessage = `Unexpected status code from server. Code: ${statusCode}.`;\n            const errorMessageInResponseBody = !!responseObject && typeof responseObject === \"object\" && \"error\" in responseObject\n                ? (_a = responseObject.error) === null || _a === void 0 ? void 0 : _a.toString()\n                : \"\";\n            if (responseObjectPrintable) {\n                errorMessage += ` Message: ${responseObjectPrintable}.`;\n            }\n            logger.error(errorMessage);\n            callback(new errors_1.UnexpectedStatusError(statusCode !== null && statusCode !== void 0 ? statusCode : 400, errorMessageInResponseBody || responseObjectPrintable), responseObject);\n        }\n        else {\n            logger.info(`Calling responseCallback with responseObject: ${responseObjectPrintable}`);\n            callback(null, responseObject);\n        }\n    }\n    catch (error) {\n        logger.error(`client.handlePostResponse(): Failed to call callback function ${error}`);\n    }\n}\nfunction getBlockchainRidFromIid(_a) {\n    return __awaiter(this, arguments, void 0, function* ({ endpointPool, chainId, failOverConfig = {}, nodeManager, connectTimeout, responseTimeout, }) {\n        var _b;\n        const mergedFailOverConfig = Object.assign(Object.assign({}, exports.defaultFailoverConfig), failOverConfig);\n        const config = {\n            endpointPool,\n            nodeManager,\n            dappStatusPolling: setStatusPolling(),\n            clusterAnchoringStatusPolling: setStatusPolling(),\n            systemAnchoringStatusPolling: setStatusPolling(),\n            retryTransactionPolling: setRetryTransactionPolling(),\n            failoverStrategy: mergedFailOverConfig.strategy,\n            attemptsPerEndpoint: mergedFailOverConfig.attemptsPerEndpoint,\n            attemptInterval: mergedFailOverConfig.attemptInterval,\n            unreachableDuration: mergedFailOverConfig.unreachableDuration,\n            merkleHashVersion: constants_1.MERKLE_HASH_VERSIONS.UNSET,\n            connectTimeout,\n            responseTimeout,\n        };\n        const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `/brid/iid_${chainId}`, config, undefined, false, (_b = config.connectTimeout) !== null && _b !== void 0 ? _b : config.responseTimeout);\n        const blockchainRid = (0, requests_1.isString)(rspBody);\n        if (!blockchainRid) {\n            throw error;\n        }\n        if (error) {\n            throw new errors_1.GetBridFromChainException(chainId, error.message);\n        }\n        else if (statusCode !== 200) {\n            throw new errors_1.GetBridFromChainException(chainId, blockchainRid);\n        }\n        return blockchainRid;\n    });\n}\nconst sleep = (ms) => new Promise(r => setTimeout(r, ms));\nexports.sleep = sleep;\nfunction convertToPrintable(responseObject) {\n    if (typeof responseObject === \"bigint\") {\n        return `${responseObject}n`;\n    }\n    else if (typeof responseObject === \"object\") {\n        return JSON.stringify(responseObject, (key, value) => typeof value === \"bigint\" ? `${value}n` : value);\n    }\n    else {\n        return String(responseObject);\n    }\n}\n//# sourceMappingURL=utils.js.map","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getClusterOfBlockchain = getClusterOfBlockchain;\nexports.getClusterInfo = getClusterInfo;\nexports.awaitGetAnchoringTransactionForBlockRid = awaitGetAnchoringTransactionForBlockRid;\nexports.getAnchoringTransactionForBlockRid = getAnchoringTransactionForBlockRid;\nexports.convertToAnchoringTransaction = convertToAnchoringTransaction;\nexports.calculateBlockRID = calculateBlockRID;\nexports.fetchAndVerifyTransaction = fetchAndVerifyTransaction;\nexports.composeProofTransactionObject = composeProofTransactionObject;\nconst buffer_1 = require(\"buffer\");\nconst errors_1 = require(\"../blockchainClient/errors\");\nconst utils_1 = require(\"../blockchainClient/utils\");\nconst anchoringTransaction_1 = require(\"../blockchainClient/validation/anchoringTransaction\");\nconst encryption_1 = require(\"../encryption/encryption\");\nconst formatter_1 = require(\"../formatter\");\nconst gtv_1 = require(\"../gtv\");\nconst gtx_1 = require(\"../gtx/gtx\");\nconst serialization_1 = require(\"../gtx/serialization\");\nconst error_1 = require(\"./error\");\nfunction getClusterOfBlockchain(client, blockchainRid) {\n    return __awaiter(this, void 0, void 0, function* () {\n        try {\n            const clusterName = yield client.query({\n                name: \"cm_get_blockchain_cluster\",\n                args: { brid: blockchainRid },\n            });\n            return clusterName;\n        }\n        catch (error) {\n            throw new error_1.SystemChainException(error.message);\n        }\n    });\n}\nfunction getClusterInfo(client, name) {\n    return __awaiter(this, void 0, void 0, function* () {\n        try {\n            const clusterInfo = yield client.query({\n                name: \"cm_get_cluster_info\",\n                args: { name },\n            });\n            return clusterInfo;\n        }\n        catch (error) {\n            throw new error_1.SystemChainException(error.message);\n        }\n    });\n}\nfunction awaitGetAnchoringTransactionForBlockRid(client, blockchainRid, blockRid, systemAnchoringStatusPolling) {\n    return __awaiter(this, void 0, void 0, function* () {\n        let anchoringTransactionResponse = null;\n        for (let i = 0; i < systemAnchoringStatusPolling.count; i++) {\n            anchoringTransactionResponse = yield getAnchoringTransactionForBlockRid(client, blockchainRid, blockRid);\n            if (anchoringTransactionResponse) {\n                const anchoringTransactionValidaiton = anchoringTransaction_1.AnchoringTransactionSchema.safeParse(anchoringTransactionResponse);\n                if (anchoringTransactionValidaiton.success) {\n                    return anchoringTransactionValidaiton.data;\n                }\n                else if (!anchoringTransactionValidaiton.success) {\n                    throw new errors_1.TxRejectedError(\"Invalid anchoring transaction format\");\n                }\n            }\n            yield (0, utils_1.sleep)(systemAnchoringStatusPolling.interval);\n        }\n        return anchoringTransactionResponse;\n    });\n}\nfunction getAnchoringTransactionForBlockRid(client, blockchainRid, blockRid) {\n    return __awaiter(this, void 0, void 0, function* () {\n        try {\n            const anchoringTxForBlockRid = yield client.query({\n                name: \"get_anchoring_transaction_for_block_rid\",\n                args: { blockchain_rid: blockchainRid, block_rid: blockRid },\n            });\n            if (!anchoringTxForBlockRid)\n                return null;\n            return convertToAnchoringTransaction(anchoringTxForBlockRid);\n        }\n        catch (error) {\n            throw new error_1.SystemChainException(error.message);\n        }\n    });\n}\nfunction convertToAnchoringTransaction(responseTx) {\n    const { tx_rid, tx_data, tx_op_index } = responseTx;\n    return {\n        txRid: tx_rid,\n        txData: tx_data,\n        txOpIndex: tx_op_index,\n    };\n}\nfunction calculateBlockRID(decodedTxProof, merkleHashVersion) {\n    const sourceBlockHeader = decodedTxProof.blockHeader;\n    if (!sourceBlockHeader) {\n        throw new Error(\"Failed to get blockHeader from confirmation proof\");\n    }\n    const decodeSourceBlockRid = (0, serialization_1.decodeValue)(sourceBlockHeader);\n    return (0, gtv_1.gtvHash)(decodeSourceBlockRid, merkleHashVersion);\n}\n// fetch tx from txRID and verifies with secp256k1.ecdsaVerify that txRID and signer creates signatures that are on the blockchain transaction\nfunction fetchAndVerifyTransaction(sourceClient, txToProveRID, proofHash, txToProveSigners) {\n    return __awaiter(this, void 0, void 0, function* () {\n        var _a, _b, _c;\n        const rawTx = yield sourceClient.getTransaction(txToProveRID);\n        const txGtv = (0, serialization_1.decodeValue)(rawTx);\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const fetchedTxHash = (0, gtv_1.gtvHash)(txGtv, sourceClient.config.merkleHashVersion);\n        if (buffer_1.Buffer.compare(fetchedTxHash, proofHash)) {\n            // We received another hash for tx RID than what was included in proof\n            // Possibly rouge or faulty node(s). Anyway, we need to give up.\n            throw new error_1.MissingTransactionProof(proofHash, fetchedTxHash);\n        }\n        const fetchedTx = (0, gtx_1.rawGtvToGtx)(txGtv);\n        if (txToProveSigners.length != ((_a = fetchedTx.signatures) === null || _a === void 0 ? void 0 : _a.length)) {\n            throw new error_1.DifferentNumberOfSignersException((_c = (_b = fetchedTx.signatures) === null || _b === void 0 ? void 0 : _b.length) !== null && _c !== void 0 ? _c : 0, txToProveSigners.length);\n        }\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const txRID = (0, gtx_1.getDigestToSign)(fetchedTx, sourceClient.config.merkleHashVersion);\n        if (buffer_1.Buffer.compare(txRID, (0, formatter_1.ensureBuffer)(txToProveRID))) {\n            throw new error_1.ProofRidException();\n        }\n        for (const signer of txToProveSigners) {\n            let hasSignature = false;\n            for (const signature of fetchedTx.signatures) {\n                // verify that txRID (hash of gtxBody) signed by signers equals the signatures from network\n                if ((0, encryption_1.checkDigestSignature)(txRID, signer, signature)) {\n                    hasSignature = true;\n                    break;\n                }\n            }\n            if (!hasSignature)\n                throw new error_1.SignatureException(signer);\n        }\n        return { verifiedTx: fetchedTx, verifiedTxHash: fetchedTxHash };\n    });\n}\nfunction composeProofTransactionObject(sourceBlockchainRid, verifiedTxHash, txProof, iccfTxSigners, anchoringTx, anchoringProof, isNetwork = true) {\n    let operationArgs;\n    operationArgs = {\n        sourceBlockchainRid: (0, formatter_1.ensureBuffer)(sourceBlockchainRid),\n        transactionHash: verifiedTxHash,\n        transactionProof: (0, serialization_1.encodeValue)(txProof),\n    };\n    if (isNetwork) {\n        operationArgs = Object.assign(Object.assign({}, operationArgs), { transactionData: anchoringTx === null || anchoringTx === void 0 ? void 0 : anchoringTx.txData, transactionIndex: anchoringTx === null || anchoringTx === void 0 ? void 0 : anchoringTx.txOpIndex, anchoringProof: anchoringProof && (0, serialization_1.encodeValue)(anchoringProof) });\n    }\n    return {\n        operations: [\n            {\n                name: \"iccf_proof\",\n                args: Object.values(operationArgs),\n            },\n        ],\n        signers: iccfTxSigners,\n    };\n}\n//# sourceMappingURL=utils.js.map","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createIccfProofTx = createIccfProofTx;\nexports.getBlockAnchoringTransaction = getBlockAnchoringTransaction;\nexports.isBlockAnchored = isBlockAnchored;\nexports.getAnchoringClient = getAnchoringClient;\nconst blockchainClient_1 = require(\"../blockchainClient/blockchainClient\");\nconst utils_1 = require(\"./utils\");\nconst formatter_1 = require(\"../formatter\");\nconst error_1 = require(\"./error\");\nconst utils_2 = require(\"../blockchainClient/utils\");\nconst enums_1 = require(\"../blockchainClient/enums\");\n/**\n * Creates an ICCF (Inter-Chain Communication Framework) proof transaction.\n * This function generates a proof that a specific transaction has occurred on the source blockchain\n * and constructs an ICCF proof transaction that can be posted to the target blockchain.\n *\n * @param {IClient} directoryClient - The client configured to communicate with the management chain.\n * @param {BufferId} txToProveRid - The RID of the transaction to be proven.\n * @param {Buffer} txToProveHash - The hash of the transaction to be proven.\n * @param {PubKey[]} txToProveSigners - An array of public keys representing signers of the transaction to be proven.\n * @param {BufferId} sourceBlockchainRid - The RID of the source blockchain.\n * @param {BufferId} targetBlockchainRid - The RID of the target blockchain.\n * @param {PubKey[]} iccfTxSigners - An array of public keys representing signers of the ICCF proof transaction (optional, default: []).\n * @param {boolean} forceIntraNetworkIccfOperation - Whether to force the ICCF operation to be performed within the same network (optional, default: false).\n * @param {number} merkleHashVersion - The version of the merkle hash to use.\n * @param {string} nodeIdentifierURL - The URL of the node to use.\n * @returns {Promise<IccfProof>} A promise that resolves to an ICCF proof object containing the ICCF proof transaction.\n */\nfunction createIccfProofTx(directoryClient_1, txToProveRid_1, txToProveHash_1, txToProveSigners_1, sourceBlockchainRid_1, targetBlockchainRid_1) {\n    return __awaiter(this, arguments, void 0, function* (directoryClient, txToProveRid, txToProveHash, txToProveSigners, sourceBlockchainRid, targetBlockchainRid, iccfTxSigners = [], forceIntraNetworkIccfOperation = false, merkleHashVersion, nodeIdentifierURL) {\n        let clientConfiguredToSource;\n        if (!nodeIdentifierURL) {\n            clientConfiguredToSource = yield (0, blockchainClient_1.createClient)({\n                directoryNodeUrlPool: (0, utils_2.getUrlsFromEndpoints)(directoryClient.config.endpointPool),\n                blockchainRid: (0, formatter_1.ensureString)(sourceBlockchainRid),\n                merkleHashVersion: merkleHashVersion,\n                useStickyNode: true,\n                blockedNodeUrlSubstrings: directoryClient.config.blockedNodeUrlSubstrings,\n                nodeUrlFilter: directoryClient.config.nodeUrlFilter,\n            });\n        }\n        else {\n            clientConfiguredToSource = yield (0, blockchainClient_1.createClient)({\n                nodeUrlPool: nodeIdentifierURL,\n                blockchainRid: (0, formatter_1.ensureString)(sourceBlockchainRid),\n                merkleHashVersion: merkleHashVersion,\n                useStickyNode: true,\n                blockedNodeUrlSubstrings: directoryClient.config.blockedNodeUrlSubstrings,\n                nodeUrlFilter: directoryClient.config.nodeUrlFilter,\n            });\n        }\n        const txProof = yield clientConfiguredToSource.getConfirmationProof(txToProveRid);\n        if (!txProof || !txProof.hash) {\n            throw new error_1.ConfirmationProofException(txToProveRid);\n        }\n        const proofHash = txProof.hash;\n        const { verifiedTx, verifiedTxHash } = !txToProveHash.equals(proofHash)\n            ? yield (0, utils_1.fetchAndVerifyTransaction)(clientConfiguredToSource, txToProveRid, proofHash, txToProveSigners)\n            : { verifiedTx: null, verifiedTxHash: txToProveHash };\n        const sourceCluster = yield (0, utils_1.getClusterOfBlockchain)(directoryClient, (0, formatter_1.ensureBuffer)(sourceBlockchainRid));\n        const targetCluster = yield (0, utils_1.getClusterOfBlockchain)(directoryClient, (0, formatter_1.ensureBuffer)(targetBlockchainRid));\n        if (!forceIntraNetworkIccfOperation && sourceCluster === targetCluster) {\n            // intra-cluster\n            const intraClusterProofTx = (0, utils_1.composeProofTransactionObject)(sourceBlockchainRid, verifiedTxHash, txProof, iccfTxSigners, undefined, undefined, false);\n            return { iccfTx: intraClusterProofTx };\n        }\n        else {\n            // intra-network\n            const systemClientUsingStickyNode = Object.assign(Object.assign({}, directoryClient), { config: Object.assign(Object.assign({}, directoryClient.config), { failoverStrategy: enums_1.FailoverStrategy.SingleEndpoint }) });\n            const anchoringClient = yield getAnchoringClient(systemClientUsingStickyNode, sourceBlockchainRid, sourceCluster);\n            const clusterAnchoredTx = yield getBlockAnchoringTransaction(clientConfiguredToSource, anchoringClient, undefined, txProof);\n            if (!clusterAnchoredTx) {\n                throw new error_1.BlockAnchoringException();\n            }\n            const anchoringProof = yield anchoringClient.getConfirmationProof(clusterAnchoredTx.txRid);\n            const intraNetworkProofTx = (0, utils_1.composeProofTransactionObject)(sourceBlockchainRid, verifiedTxHash, txProof, iccfTxSigners, clusterAnchoredTx, anchoringProof);\n            return { iccfTx: intraNetworkProofTx, verifiedTx };\n        }\n    });\n}\n/**\n * Checks whether a given transaction is included in the cluster anchoring chain and returns the\n * block anchoring transaction. If `txProof` is not provided, it fetches the confirmation proof\n * using the `sourceClient`.\n *\n * @param sourceClient - A client configured to the blockchain where the transaction was made.\n * @param anchoringClient - The client responsible for querying the anchoring blockchain.\n * @param txRid - The transaction RID to check for anchoring.\n * @param txProof - (Optional) The transaction proof for the specified `txRid`.\n * @returns A Promise that resolves to the anchored transaction response object.\n */\nfunction getBlockAnchoringTransaction(sourceClient, anchoringClient, txRid, txProof) {\n    return __awaiter(this, void 0, void 0, function* () {\n        if (!txRid && !txProof) {\n            throw Error(\"Missing a txRid or TxProof\");\n        }\n        const confirmationProof = txProof !== null && txProof !== void 0 ? txProof : (txRid && (yield sourceClient.getConfirmationProof(txRid)));\n        if (!confirmationProof) {\n            throw Error(\"Confirmation proof not found\");\n        }\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        const blockRid = (0, utils_1.calculateBlockRID)(confirmationProof, sourceClient.config.merkleHashVersion);\n        const blockchainRid = sourceClient.config.blockchainRid;\n        const anchoringTxResponse = yield (0, utils_1.awaitGetAnchoringTransactionForBlockRid)(anchoringClient, (0, formatter_1.toBuffer)(blockchainRid), blockRid, sourceClient.config.clusterAnchoringStatusPolling);\n        return anchoringTxResponse;\n    });\n}\n/**\n * Checks whether a given transaction is included in the anchoring blockchain.\n *\n * @param sourceClient - A client configured to the blockchain where the transaction was made.\n * @param anchoringClient - The client responsible for querying the anchoring blockchain.\n * @param txRid - The transaction RID to check for anchoring.\n * @param txProof - (Optional) The transaction proof for the specified `txRid`.\n * @returns A Promise that resolves to `true` if the transaction is anchored, `false` otherwise.\n */\nfunction isBlockAnchored(sourceClient, anchoringClient, txRid, txProof) {\n    return __awaiter(this, void 0, void 0, function* () {\n        return !!(yield getBlockAnchoringTransaction(sourceClient, anchoringClient, txRid, txProof));\n    });\n}\n/**\n * Gets a client configured for the cluster anchoring blockchain of a cluster. Takes a specific\n * cluster name or blockchain RID to determine the cluster.\n * @param client - The client configured to communicate with the management chain.\n * @param dappBlockchainRid - (Optional) The RID of a blockchain which anchoring wants to be checked.\n * @param cluster - (Optional) The cluster of interest.\n * @returns A Promise that resolves to the client configured to a cluster anchoring chain.\n */\nfunction getAnchoringClient(client, dappBlockchainRid, cluster) {\n    return __awaiter(this, void 0, void 0, function* () {\n        if (!dappBlockchainRid && !cluster) {\n            throw Error(\"Missing a dapp blockchainRid or cluster name\");\n        }\n        const sourceCluster = cluster !== null && cluster !== void 0 ? cluster : (dappBlockchainRid && (yield (0, utils_1.getClusterOfBlockchain)(client, (0, formatter_1.ensureBuffer)(dappBlockchainRid))));\n        if (!sourceCluster) {\n            throw Error(\"No cluster could be found\");\n        }\n        const sourceClusterInfo = yield (0, utils_1.getClusterInfo)(client, sourceCluster);\n        if (!sourceClusterInfo || !sourceClusterInfo.anchoring_chain) {\n            throw Error(\"Cluster info could not be found\");\n        }\n        const networkSettings = Object.assign(Object.assign({}, client.config), { directoryNodeUrlPool: (0, utils_2.getUrlsFromEndpoints)(client.config.endpointPool), blockchainRid: (0, formatter_1.toString)(sourceClusterInfo.anchoring_chain) });\n        const clientConfiguredToAnchoringchain = yield (0, blockchainClient_1.createClient)(networkSettings);\n        return clientConfiguredToAnchoringchain;\n    });\n}\n//# sourceMappingURL=IccfProofTxMaterialBuilder.js.map","\"use strict\";\n/*\nThis file is part of web3.js.\n\nweb3.js is free software: you can redistribute it and/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n\nweb3.js is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with web3.js.  If not, see <http://www.gnu.org/licenses/>.\n*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Web3EventEmitter = void 0;\nconst events_1 = require(\"events\");\nclass Web3EventEmitter {\n    constructor() {\n        this._emitter = new events_1.EventEmitter();\n    }\n    on(eventName, fn) {\n        // eslint-disable-next-line @typescript-eslint/no-misused-promises\n        this._emitter.on(eventName, fn);\n    }\n    once(eventName, fn) {\n        // eslint-disable-next-line @typescript-eslint/no-misused-promises\n        this._emitter.once(eventName, fn);\n    }\n    off(eventName, fn) {\n        // eslint-disable-next-line @typescript-eslint/no-misused-promises\n        this._emitter.off(eventName, fn);\n    }\n    emit(eventName, params) {\n        this._emitter.emit(eventName, params);\n    }\n    listenerCount(eventName) {\n        return this._emitter.listenerCount(eventName);\n    }\n    listeners(eventName) {\n        return this._emitter.listeners(eventName);\n    }\n    eventNames() {\n        return this._emitter.eventNames();\n    }\n    removeAllListeners() {\n        this._emitter.removeAllListeners();\n    }\n    setMaxListenerWarningThreshold(maxListenersWarningThreshold) {\n        this._emitter.setMaxListeners(maxListenersWarningThreshold);\n    }\n    getMaxListeners() {\n        return this._emitter.getMaxListeners();\n    }\n}\nexports.Web3EventEmitter = Web3EventEmitter;\n//# sourceMappingURL=promiEventEmitter.js.map","\"use strict\";\n/*\nThis file is part of web3.js.\n\nweb3.js is free software: you can redistribute it and/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n\nweb3.js is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with web3.js.  If not, see <http://www.gnu.org/licenses/>.\n*/\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nvar _a;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Web3PromiEvent = void 0;\nconst promiEventEmitter_1 = require(\"./promiEventEmitter\");\nclass Web3PromiEvent extends promiEventEmitter_1.Web3EventEmitter {\n    constructor(executor) {\n        super();\n        // public tag to treat object as promise by different libs\n        // eslint-disable-next-line @typescript-eslint/prefer-as-const\n        this[_a] = \"Promise\";\n        this._promise = new Promise(executor);\n    }\n    then(onfulfilled, onrejected) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return this._promise.then(onfulfilled, onrejected);\n        });\n    }\n    catch(onrejected) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return this._promise.catch(onrejected);\n        });\n    }\n    finally(onfinally) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return this._promise.finally(onfinally);\n        });\n    }\n    on(eventName, fn) {\n        super.on(eventName, fn);\n        return this;\n    }\n    once(eventName, fn) {\n        super.once(eventName, fn);\n        return this;\n    }\n}\nexports.Web3PromiEvent = Web3PromiEvent;\n_a = Symbol.toStringTag;\n//# sourceMappingURL=promiEvents.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isBlockIdentifierValid = exports.BlockIdentifierSchema = void 0;\nconst zod_1 = require(\"zod\");\nconst WRONG_STRING_LENGTH = \"wrong string length\";\nexports.BlockIdentifierSchema = zod_1.z.union([\n    zod_1.z.string().refine(val => /^[0-9a-fA-F]{64}$/.test(val), WRONG_STRING_LENGTH),\n    zod_1.z.number(),\n]);\nconst isBlockIdentifierValid = (blockIdentifier, options) => {\n    const ctx = exports.BlockIdentifierSchema.safeParse(blockIdentifier);\n    const { success } = ctx;\n    const hasError = \"error\" in ctx;\n    const { throwOnError = false } = options || {};\n    if (!hasError) {\n        return { success };\n    }\n    const { error } = ctx;\n    const isInvalidInputType = error === null || error === void 0 ? void 0 : error.issues.some(({ code }) => code === \"invalid_union\");\n    const isInvalidStringLength = error === null || error === void 0 ? void 0 : error.issues.some(({ message }) => message === WRONG_STRING_LENGTH);\n    const message = (() => {\n        if (isInvalidInputType) {\n            return `Invalid \"blockIdentifier\" type. Expected string or number, but received ${typeof blockIdentifier}.`;\n        }\n        if (isInvalidStringLength) {\n            return \"Parameter 'blockIdentifier' does not have the correct format (64-character hexadecimal string).\";\n        }\n        return error === null || error === void 0 ? void 0 : error.issues.map(issue => issue.message).join(\", \");\n    })();\n    if (throwOnError) {\n        throw new Error(message);\n    }\n    return {\n        success,\n        error,\n        message: error === null || error === void 0 ? void 0 : error.issues.map(issue => issue.message).join(\", \"),\n    };\n};\nexports.isBlockIdentifierValid = isBlockIdentifierValid;\n//# sourceMappingURL=blockIdentifier.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isNetworkSettingValid = exports.validateBlockChainIdentifier = void 0;\nconst zod_1 = require(\"zod\");\nconst enums_1 = require(\"../enums\");\nconst errors_1 = require(\"../errors\");\nconst IdentifierSchema = zod_1.z.union([\n    zod_1.z.object({\n        blockchainRid: zod_1.z.undefined(),\n        blockchainIid: zod_1.z.number(),\n    }),\n    zod_1.z.object({\n        blockchainRid: zod_1.z.string(),\n        blockchainIid: zod_1.z.undefined(),\n    }),\n]);\nconst NodeUrlSchema = zod_1.z.union([\n    zod_1.z.object({\n        nodeUrlPool: zod_1.z.union([zod_1.z.string(), zod_1.z.array(zod_1.z.string())]),\n        directoryNodeUrlPool: zod_1.z.undefined(),\n    }),\n    zod_1.z.object({\n        nodeUrlPool: zod_1.z.undefined(),\n        directoryNodeUrlPool: zod_1.z.union([zod_1.z.string(), zod_1.z.array(zod_1.z.string())]),\n    }),\n]);\nconst RestNetworkSettingsSchema = zod_1.z.object({\n    statusPollingInterval: zod_1.z.number().optional(),\n    statusPollingCount: zod_1.z.number().optional(),\n    failOverConfig: zod_1.z\n        .object({\n        strategy: zod_1.z.nativeEnum(enums_1.FailoverStrategy).optional(),\n        attemptsPerEndpoint: zod_1.z.number().optional(),\n        attemptInterval: zod_1.z.number().optional(),\n        unreachableDuration: zod_1.z.number().optional(),\n    })\n        .optional(),\n});\nconst validateBlockChainIdentifier = (networkSettings, options) => {\n    const { throwOnError = false } = options || {};\n    const identifierValidationContext = IdentifierSchema.safeParse(networkSettings);\n    if (\"error\" in identifierValidationContext) {\n        const missingBlockchainIdentifierError = new errors_1.MissingBlockchainIdentifierError();\n        if (throwOnError) {\n            throw missingBlockchainIdentifierError;\n        }\n        return {\n            success: identifierValidationContext.success,\n            error: identifierValidationContext.error,\n            message: missingBlockchainIdentifierError.message,\n        };\n    }\n    return { success: true };\n};\nexports.validateBlockChainIdentifier = validateBlockChainIdentifier;\nconst validateNodeUrl = (networkSettings, options) => {\n    const { throwOnError = false } = options || {};\n    const nodeUrlValidationContext = NodeUrlSchema.safeParse(networkSettings);\n    if (\"error\" in nodeUrlValidationContext) {\n        const missingNodeUrlError = new errors_1.MissingNodeUrlError();\n        if (throwOnError) {\n            throw missingNodeUrlError;\n        }\n        return {\n            success: nodeUrlValidationContext.success,\n            error: nodeUrlValidationContext.error,\n            message: missingNodeUrlError.message,\n        };\n    }\n    return { success: true };\n};\nconst validateRestNetworkSettings = (networkSettings, options) => {\n    const { throwOnError = false } = options || {};\n    const restNetworkSettingsValidationContext = RestNetworkSettingsSchema.safeParse(networkSettings);\n    if (\"error\" in restNetworkSettingsValidationContext) {\n        const { error: { issues } = {} } = restNetworkSettingsValidationContext;\n        const errorMessage = issues === null || issues === void 0 ? void 0 : issues.map(({ message, path }) => `${path[0]}: ${message}`).join(\", \");\n        if (throwOnError) {\n            throw new Error(errorMessage);\n        }\n        return {\n            success: restNetworkSettingsValidationContext.success,\n            error: restNetworkSettingsValidationContext.error,\n            message: errorMessage,\n        };\n    }\n    return { success: true };\n};\nconst isNetworkSettingValid = (networkSettings, options) => {\n    const identifierValidationContext = (0, exports.validateBlockChainIdentifier)(networkSettings, options);\n    if (\"error\" in identifierValidationContext) {\n        return identifierValidationContext;\n    }\n    const nodeUrlValidationContext = validateNodeUrl(networkSettings, options);\n    if (\"error\" in nodeUrlValidationContext) {\n        return nodeUrlValidationContext;\n    }\n    const restNetworkSettingsValidationContext = validateRestNetworkSettings(networkSettings, options);\n    if (\"error\" in restNetworkSettingsValidationContext) {\n        return restNetworkSettingsValidationContext;\n    }\n    return { success: true };\n};\nexports.isNetworkSettingValid = isNetworkSettingValid;\n//# sourceMappingURL=networkSettings.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isSignMethodValid = exports.SignMethodSchema = void 0;\nconst zod_1 = require(\"zod\");\nconst bufferSchema_1 = require(\"./bufferSchema\");\nconst KeyPairSchema = zod_1.z.object({\n    privKey: bufferSchema_1.BufferSchema,\n    pubKey: bufferSchema_1.BufferSchema,\n});\nconst SignatureProviderSchema = zod_1.z.object({\n    pubKey: bufferSchema_1.BufferSchema,\n    sign: zod_1.z.function().args(bufferSchema_1.BufferSchema).returns(zod_1.z.promise(bufferSchema_1.BufferSchema)),\n});\nexports.SignMethodSchema = zod_1.z.union([KeyPairSchema, SignatureProviderSchema]);\nconst isSignMethodValid = (signMethod, options) => {\n    const signMethodValidationCtx = exports.SignMethodSchema.safeParse(signMethod);\n    const { throwOnError = false } = options || {};\n    const hasError = \"error\" in signMethodValidationCtx;\n    if (!hasError) {\n        return { success: true };\n    }\n    const message = \"Invalid sign method\";\n    if (throwOnError) {\n        throw new Error(message);\n    }\n    return {\n        success: false,\n        error: signMethodValidationCtx.error,\n        message,\n    };\n};\nexports.isSignMethodValid = isSignMethodValid;\n//# sourceMappingURL=signMethod.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.validateTransactionStatusReponse = validateTransactionStatusReponse;\nconst zod_1 = require(\"zod\");\nconst enums_1 = require(\"../enums\");\nconst statusEnum = zod_1.z.union([zod_1.z.nativeEnum(enums_1.ResponseStatus), zod_1.z.nativeEnum(enums_1.AnchoringStatus)]);\nconst transactionStatusReponseSchema = zod_1.z\n    .object({\n    statusCode: zod_1.z.number().nullable(),\n    result: zod_1.z.object({\n        status: statusEnum,\n        rejectReason: zod_1.z.string().optional(),\n    }),\n})\n    .transform(({ statusCode, result }) => ({\n    statusCode,\n    status: result.status,\n    rejectReason: result.rejectReason,\n}));\nfunction validateTransactionStatusReponse(input) {\n    const result = transactionStatusReponseSchema.safeParse(input);\n    if (!result.success) {\n        throw new Error(\"Model does not match TransactionStatusReponse\");\n    }\n    return result.data;\n}\n//# sourceMappingURL=transactionStatusReponse.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createClient = createClient;\nconst crypto_1 = require(\"crypto\");\nconst cloneDeep_1 = __importDefault(require(\"lodash/cloneDeep\"));\nconst IccfProofTxMaterialBuilder_1 = require(\"../ICCF/IccfProofTxMaterialBuilder\");\nconst logger = __importStar(require(\"../logger\"));\nconst formatter_1 = require(\"../formatter\");\nconst serialization_1 = require(\"../gtx/serialization\");\nconst gtxTool = __importStar(require(\"../gtx/gtx\"));\nconst utils_1 = require(\"./utils\");\nconst promiEvents_1 = require(\"../promiEvent/promiEvents\");\nconst errors_1 = require(\"../gtx/errors\");\nconst enums_1 = require(\"./enums\");\nconst blockIdentifier_1 = require(\"./validation/blockIdentifier\");\nconst networkSettings_1 = require(\"./validation/networkSettings\");\nconst signMethod_1 = require(\"./validation/signMethod\");\nconst txRid_1 = require(\"./validation/txRid\");\nconst anchoringTransaction_1 = require(\"./validation/anchoringTransaction\");\nconst requests_1 = require(\"./validation/requests\");\nconst utils_2 = require(\"../ICCF/utils\");\nconst requestWithFailoverStrategy_1 = require(\"./requestWithFailoverStrategy\");\nconst transactionStatusReponse_1 = require(\"./validation/transactionStatusReponse\");\nfunction createClient(settings) {\n    return __awaiter(this, void 0, void 0, function* () {\n        (0, networkSettings_1.isNetworkSettingValid)(settings, { throwOnError: true });\n        const config = yield (0, utils_1.getClientConfigFromSettings)(settings);\n        config.merkleHashVersion = yield getMerkleHashVersion(settings);\n        return {\n            config,\n            query(nameOrQueryObject, args, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    let _name, _args;\n                    if (typeof nameOrQueryObject === \"string\") {\n                        _name = nameOrQueryObject;\n                        _args = args;\n                    }\n                    else {\n                        _name = nameOrQueryObject === null || nameOrQueryObject === void 0 ? void 0 : nameOrQueryObject.name;\n                        _args = nameOrQueryObject === null || nameOrQueryObject === void 0 ? void 0 : nameOrQueryObject.args;\n                    }\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.POST, `query_gtv/${config.blockchainRid}`, config, (0, serialization_1.encodeValue)((0, formatter_1.toQueryObjectGTV)(_name, _args)));\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handlePostResponse)(error, statusCode, (0, requests_1.isRawGtv)(rspBody), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            signTransaction(transaction, signMethod, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    logger.debug(`Signing transaction with ${!(0, utils_1.isKeyPair)(signMethod) ? \"signature provider containing \" : \"\"}pubKey: ${(0, formatter_1.toString)(signMethod.pubKey)}`);\n                    const gtx = (0, utils_1.getGTXFromBufferOrTransactionOrOperation)(transaction, config.blockchainRid);\n                    try {\n                        const signedTx = yield ((0, utils_1.isKeyPair)(signMethod)\n                            ? gtxTool.sign(gtx, signMethod.privKey, config.merkleHashVersion, signMethod.pubKey)\n                            : gtxTool.sign(gtx, signMethod, config.merkleHashVersion));\n                        const gtxBytes = (0, utils_1.getSerializedGTX)(signedTx);\n                        if (typeof callback === \"function\") {\n                            callback(null, gtxBytes);\n                        }\n                        return gtxBytes;\n                    }\n                    catch (error) {\n                        if (typeof callback === \"function\") {\n                            callback(error, null);\n                        }\n                        // Todo the error should be replaced with the custom error MissingSignerException\n                        throw new Error(error);\n                    }\n                });\n            },\n            sendTransactionWithRetries(transaction, callback, confirmationLevel = enums_1.ChainConfirmationLevel.Dapp) {\n                const client = this;\n                function sendOnce() {\n                    return client.sendTransaction(transaction, true, callback, confirmationLevel);\n                }\n                const promiEvent = new promiEvents_1.Web3PromiEvent((resolve, reject) => __awaiter(this, void 0, void 0, function* () {\n                    let error = null;\n                    // await sleep(1000);\n                    for (let i = 0; i < config.retryTransactionPolling.count; i++) {\n                        logger.info(`sendTransactionWithRetries attempt ${i + 1} of ${config.retryTransactionPolling.count}`);\n                        const tmpPromiEvent = sendOnce()\n                            .on(enums_1.TransactionEvent.ClusterAnchoringConfirmation, receipt => {\n                            promiEvent.emit(enums_1.TransactionEvent.ClusterAnchoringConfirmation, receipt);\n                        })\n                            .on(enums_1.TransactionEvent.SystemAnchoringConfirmation, receipt => {\n                            promiEvent.emit(enums_1.TransactionEvent.SystemAnchoringConfirmation, receipt);\n                        })\n                            .on(enums_1.TransactionEvent.DappReceived, receipt => {\n                            promiEvent.emit(enums_1.TransactionEvent.DappReceived, receipt);\n                        })\n                            .on(enums_1.TransactionEvent.Signed, receipt => {\n                            promiEvent.emit(enums_1.TransactionEvent.Signed, receipt);\n                        })\n                            .on(enums_1.TransactionEvent.DappConfirmed, receipt => {\n                            promiEvent.emit(enums_1.TransactionEvent.DappConfirmed, receipt);\n                        })\n                            .catch(tmpError => {\n                            logger.warning(`sendTransactionWithRetries error on attempt ${i + 1} of ${config.retryTransactionPolling.count}: ${tmpError}`);\n                            promiEvent.emit(enums_1.TransactionEvent.Rejected, tmpError);\n                            error = tmpError;\n                        });\n                        const tmpReceipt = yield tmpPromiEvent;\n                        if (tmpReceipt) {\n                            resolve(tmpReceipt);\n                            return;\n                        }\n                        yield (0, utils_1.sleep)(config.retryTransactionPolling.interval);\n                    }\n                    reject(error);\n                }));\n                return promiEvent;\n            },\n            sendTransaction(transaction, doStatusPolling = true, callback, confirmationLevel = enums_1.ChainConfirmationLevel.Dapp) {\n                const promiEvent = new promiEvents_1.Web3PromiEvent((resolve, reject) => __awaiter(this, void 0, void 0, function* () {\n                    var _a, _b;\n                    try {\n                        const gtx = (0, utils_1.getGTXFromBufferOrTransactionOrOperation)(transaction, config.blockchainRid);\n                        if (gtx.signers.length !== ((_a = gtx.signatures) === null || _a === void 0 ? void 0 : _a.length)) {\n                            reject(new errors_1.NumberOfSignersAndSignaturesException());\n                        }\n                        const gtxBytes = (0, utils_1.getSerializedGTX)(gtx);\n                        const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.POST, `tx/${config.blockchainRid}`, config, gtxBytes);\n                        const transactionRid = gtxTool.getDigestToSign(gtx, config.merkleHashVersion);\n                        try {\n                            yield (0, utils_1.handlePostResponsePromisified)(error, statusCode, (0, requests_1.isRawGtv)(rspBody));\n                            if (typeof callback === \"function\") {\n                                callback(null, {\n                                    status: enums_1.ResponseStatus.Waiting,\n                                    statusCode,\n                                    transactionRid: transactionRid,\n                                    node: (_b = config.nodeManager.lastUsedNode) === null || _b === void 0 ? void 0 : _b.url,\n                                });\n                            }\n                        }\n                        catch (_error) {\n                            if (typeof callback === \"function\") {\n                                callback(_error, null);\n                            }\n                            return reject(_error);\n                        }\n                        const client = this;\n                        const statusPollingConfig = {\n                            dappStatusPolling: client.config.dappStatusPolling,\n                            clusterAnchoringStatusPolling: client.config.clusterAnchoringStatusPolling,\n                            systemAnchoringStatusPolling: client.config.systemAnchoringStatusPolling,\n                        };\n                        const stickyNodeClient = yield createStickyNodeClient(client); //to avoid false rejections by oblivious nodes\n                        let transactionReceipt = yield (0, utils_1.handleDappConfirmations)(transactionRid, doStatusPolling, confirmationLevel, promiEvent, statusPollingConfig.dappStatusPolling, () => stickyNodeClient.getTransactionStatus(transactionRid, callback), stickyNodeClient);\n                        if (confirmationLevel === enums_1.ChainConfirmationLevel.None ||\n                            confirmationLevel === enums_1.ChainConfirmationLevel.Dapp) {\n                            resolve(transactionReceipt);\n                            return;\n                        }\n                        const { anchoringClient, systemAnchoringChainBridString } = yield (0, utils_1.getAnchoringClientAndSystemChainRid)(client);\n                        transactionReceipt = yield (0, utils_1.handleSystemConfirmations)(transactionReceipt, confirmationLevel, promiEvent, statusPollingConfig, anchoringClient, systemAnchoringChainBridString, () => stickyNodeClient.getClusterAnchoringTransactionConfirmation(transactionRid, anchoringClient, callback), anchoredTxRid => stickyNodeClient.getSystemAnchoringTransactionConfirmation(anchoredTxRid, anchoringClient, systemAnchoringChainBridString, callback));\n                        resolve(transactionReceipt);\n                    }\n                    catch (error) {\n                        callback === null || callback === void 0 ? void 0 : callback(error, null);\n                        reject(error);\n                    }\n                }));\n                return promiEvent;\n            },\n            signAndSendUniqueTransaction(transactionOrOperation, signMethod, doStatusPolling = true, callback, confirmationLevel = enums_1.ChainConfirmationLevel.Dapp) {\n                (0, signMethod_1.isSignMethodValid)(signMethod, { throwOnError: true });\n                const promiEvent = new promiEvents_1.Web3PromiEvent((resolve, reject) => __awaiter(this, void 0, void 0, function* () {\n                    const client = this;\n                    const transaction = \"name\" in transactionOrOperation\n                        ? {\n                            operations: [transactionOrOperation],\n                            signers: [signMethod.pubKey],\n                        }\n                        : transactionOrOperation;\n                    const hasNop = transaction.operations.some(operation => {\n                        return operation.name === \"nop\";\n                    });\n                    const transactionWithNop = hasNop ? transaction : client.addNop(transaction);\n                    try {\n                        const signedTx = yield client.signTransaction(transactionWithNop, signMethod);\n                        promiEvent.emit(enums_1.TransactionEvent.Signed, signedTx);\n                        const sendTransactionPromiEvent = client.sendTransaction(signedTx, doStatusPolling, callback, confirmationLevel);\n                        (0, utils_1.linkPromiEvents)(sendTransactionPromiEvent, promiEvent);\n                        resolve(yield sendTransactionPromiEvent);\n                    }\n                    catch (error) {\n                        reject(error);\n                    }\n                }));\n                return promiEvent;\n            },\n            getTransaction(transactionRid, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    try {\n                        (0, txRid_1.isTxRidValid)(transactionRid, { throwOnError: true });\n                    }\n                    catch (error) {\n                        callback === null || callback === void 0 ? void 0 : callback(error, null);\n                        throw error;\n                    }\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `tx/${config.blockchainRid}/${(0, formatter_1.ensureString)(transactionRid)}`, config);\n                    const transaction = (0, requests_1.isTransaction)(rspBody);\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, statusCode === 200 && transaction ? (0, formatter_1.toBuffer)(transaction.tx) : (0, requests_1.isRawGtv)(rspBody), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            getTransactionStatus(transactionRid, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    try {\n                        (0, txRid_1.isTxRidValid)(transactionRid, { throwOnError: true });\n                    }\n                    catch (error) {\n                        callback === null || callback === void 0 ? void 0 : callback(error, null);\n                        throw error;\n                    }\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `tx/${config.blockchainRid}/${transactionRid.toString(\"hex\")}/status`, config);\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, (0, requests_1.isRawGtv)(rspBody), (0, utils_1.callbackPromiseBuilder)(reject, result => resolve((0, transactionStatusReponse_1.validateTransactionStatusReponse)({\n                            statusCode,\n                            result,\n                        })), callback));\n                    });\n                });\n            },\n            addNop(transaction) {\n                const _transaction = (0, cloneDeep_1.default)(transaction);\n                const noOperation = {\n                    name: \"nop\",\n                    args: [(0, crypto_1.randomBytes)(32)],\n                };\n                _transaction.operations = [..._transaction.operations, noOperation];\n                return _transaction;\n            },\n            getTransactionsInfo() {\n                return __awaiter(this, arguments, void 0, function* (limit = 25, beforeTime, callback, afterTime, signerPubKey) {\n                    const beforeTimeQueryParam = beforeTime ? `&before-time=${beforeTime.getTime()}` : \"\";\n                    const afterTimeQueryParam = afterTime ? `&after-time=${afterTime.getTime()}` : \"\";\n                    const signerQueryParam = signerPubKey ? `&signer=${signerPubKey}` : \"\";\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `transactions/${config.blockchainRid}?limit=${limit}${beforeTimeQueryParam}${afterTimeQueryParam}${signerQueryParam}`, config);\n                    const transactionsInfoResponseArray = (0, requests_1.isTransactionInfoResponseArray)(rspBody);\n                    const body = statusCode === 200 && transactionsInfoResponseArray\n                        ? transactionsInfoResponseArray.map(utils_1.formatTransactionInfoResponse)\n                        : rspBody;\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, (0, requests_1.isRawGtv)(body), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            getTransactionInfo(transactionRid, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    try {\n                        (0, txRid_1.isTxRidValid)(transactionRid, { throwOnError: true });\n                    }\n                    catch (error) {\n                        callback === null || callback === void 0 ? void 0 : callback(error, null);\n                        throw error;\n                    }\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `transactions/${config.blockchainRid}/${(0, formatter_1.ensureString)(transactionRid)}`, config);\n                    const transactionInfoResponse = (0, requests_1.isTransactionInfoResponse)(rspBody);\n                    const body = statusCode === 200 && transactionInfoResponse\n                        ? (0, utils_1.formatTransactionInfoResponse)(transactionInfoResponse)\n                        : rspBody;\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, (0, requests_1.isRawGtv)(body), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            getAnchoringStatusForBlockRid(blockRid, anchoringClient, systemAnchoringChainRid) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    const client = this;\n                    const result = { status: enums_1.AnchoringStatus.NotAnchored };\n                    const clusterAnchoredTx = yield (0, utils_2.awaitGetAnchoringTransactionForBlockRid)(anchoringClient, (0, formatter_1.ensureBuffer)(client.config.blockchainRid), (0, formatter_1.ensureBuffer)(blockRid), config.clusterAnchoringStatusPolling);\n                    if (!clusterAnchoredTx) {\n                        return result;\n                    }\n                    const anchoringTransactionValidation = anchoringTransaction_1.AnchoringTransactionSchema.safeParse(clusterAnchoredTx);\n                    if (!anchoringTransactionValidation.success) {\n                        return result;\n                    }\n                    result.status = enums_1.AnchoringStatus.ClusterAnchored;\n                    result.clusterAnchoredTx = anchoringTransactionValidation.data;\n                    const systemAnchoredTransaction = yield (0, utils_1.getSystemAnchoringTransaction)(config.endpointPool, anchoringTransactionValidation.data.txRid, anchoringClient, systemAnchoringChainRid, config.systemAnchoringStatusPolling, config.merkleHashVersion, config.blockedNodeUrlSubstrings, config.nodeUrlFilter);\n                    if (!systemAnchoredTransaction) {\n                        return result;\n                    }\n                    result.status = enums_1.AnchoringStatus.SystemAnchored;\n                    result.systemAnchoredTx = systemAnchoredTransaction;\n                    return result;\n                });\n            },\n            getTransactionConfirmationLevel(transactionRid, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    var _a;\n                    try {\n                        const client = this;\n                        const dappConfirmation = yield client.getTransactionStatus(transactionRid);\n                        const response = {\n                            status: dappConfirmation.status,\n                            statusCode: dappConfirmation.statusCode,\n                            transactionRid: (0, formatter_1.ensureBuffer)(transactionRid),\n                            node: (_a = client.config.nodeManager.lastUsedNode) === null || _a === void 0 ? void 0 : _a.url,\n                        };\n                        if (dappConfirmation.status === enums_1.ResponseStatus.Waiting) {\n                            return response;\n                        }\n                        let clusterAnchoringResult = null;\n                        if (dappConfirmation.status === enums_1.ResponseStatus.Confirmed) {\n                            const { anchoringClient, systemAnchoringChainBridString } = yield (0, utils_1.getAnchoringClientAndSystemChainRid)(client);\n                            clusterAnchoringResult = yield client.getClusterAnchoringTransactionConfirmation(transactionRid, anchoringClient);\n                            if (clusterAnchoringResult === enums_1.AnchoringStatus.NotAnchored || !clusterAnchoringResult) {\n                                return response;\n                            }\n                            if (clusterAnchoringResult === enums_1.AnchoringStatus.FailedAnchoring) {\n                                response.status = enums_1.AnchoringStatus.FailedAnchoring;\n                                response.statusCode = 400;\n                                return response;\n                            }\n                            const anchoringTransactionValidation = anchoringTransaction_1.AnchoringTransactionSchema.safeParse(clusterAnchoringResult);\n                            if (!anchoringTransactionValidation.success) {\n                                return response;\n                            }\n                            if (anchoringTransactionValidation.success) {\n                                response.status = enums_1.AnchoringStatus.ClusterAnchored;\n                                response.statusCode = 200;\n                                response.clusterAnchoredTx = anchoringTransactionValidation.data;\n                                response.clusterAnchoringClientBrid = anchoringClient.config.blockchainRid;\n                                const systemAnchoringResult = yield client.getSystemAnchoringTransactionConfirmation(anchoringTransactionValidation.data.txRid, anchoringClient, systemAnchoringChainBridString);\n                                if (!systemAnchoringResult) {\n                                    return response;\n                                }\n                                response.status = enums_1.AnchoringStatus.SystemAnchored;\n                                response.systemAnchoredTx = systemAnchoringResult;\n                                response.systemAnchoringClientBrid = systemAnchoringChainBridString;\n                                return response;\n                            }\n                        }\n                        return response;\n                    }\n                    catch (error) {\n                        callback === null || callback === void 0 ? void 0 : callback(error, null);\n                        throw error;\n                    }\n                });\n            },\n            getTransactionCount(callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `transactions/${config.blockchainRid}/count`, config, undefined, true);\n                    const transactionsCount = (0, requests_1.isTransactionsCount)(rspBody);\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, statusCode === 200 ? transactionsCount === null || transactionsCount === void 0 ? void 0 : transactionsCount.transactionsCount : (0, requests_1.isRawGtv)(rspBody), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            getBlockInfo(blockIdentifier_2) {\n                return __awaiter(this, arguments, void 0, function* (blockIdentifier, txs = false, callback) {\n                    (0, blockIdentifier_1.isBlockIdentifierValid)(blockIdentifier, { throwOnError: true });\n                    const queryString = typeof blockIdentifier === \"string\" ? blockIdentifier : `height/${blockIdentifier}`;\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `blocks/${config.blockchainRid}/${queryString}?txs=${txs}`, config);\n                    const blockInfoResponse = (0, requests_1.isBlockInfoResponse)(rspBody);\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, statusCode === 200 && blockInfoResponse !== null && blockInfoResponse\n                            ? (0, utils_1.formatBlockInfoResponse)(blockInfoResponse)\n                            : (0, requests_1.isRawGtv)(rspBody), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            getLatestBlock() {\n                return __awaiter(this, arguments, void 0, function* (txs = false, callback) {\n                    const shouldIncludeFullTransaction = txs ? `&txs=${txs}` : \"\";\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `blocks/${config.blockchainRid}?limit=1${shouldIncludeFullTransaction}`, config, undefined, true);\n                    const indexOfLatestBlock = 0;\n                    const blockInfoResponseArray = (0, requests_1.isBlockInfoResponseArray)(rspBody);\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, statusCode === 200 && blockInfoResponseArray !== null && blockInfoResponseArray\n                            ? (0, utils_1.formatBlockInfoResponse)(blockInfoResponseArray[indexOfLatestBlock])\n                            : (0, requests_1.isRawGtv)(rspBody), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            getBlocks() {\n                return __awaiter(this, arguments, void 0, function* ({ limit, beforeTime, afterTime, beforeHeight, afterHeight, excludeEmpty, txs, callback, } = {}) {\n                    const searchValues = {\n                        limit,\n                        txs,\n                        \"before-time\": beforeTime,\n                        \"after-time\": afterTime,\n                        \"before-height\": beforeHeight,\n                        \"after-height\": afterHeight,\n                        \"exclude-empty\": excludeEmpty,\n                    };\n                    const searchParams = new URLSearchParams();\n                    for (const [key, value] of Object.entries(searchValues)) {\n                        if (value !== undefined) {\n                            searchParams.append(key, value.toString());\n                        }\n                    }\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `blocks/${config.blockchainRid}?${searchParams}`, config);\n                    const blockInfoResponseArray = (0, requests_1.isBlockInfoResponseArray)(rspBody);\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, statusCode === 200 && blockInfoResponseArray\n                            ? blockInfoResponseArray.map(utils_1.formatBlockInfoResponse)\n                            : (0, requests_1.isRawGtv)(rspBody), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            getClientNodeUrlPool() {\n                return config.endpointPool.map((endpoint) => endpoint.url);\n            },\n            /**\n             * Retrieves a confirmation proof for a transaction with the specified sha256\n             * hash.\n             * @param txRid A buffer of 32 bytes\n             * @param callback parameters (error, responseObjectProof) if first\n             * parameter is not null, an error occurred.\n             * If first parameter is null, then the second parameter is an object\n             * like the following:\n             *\n             * {hash: messageHashBuffer,\n             *  blockHeader: blockHeaderBuffer,\n             *  signatures: [{pubKey: pubKeyBuffer, signature: sigBuffer}, ...],\n             *  merklePath: [{side: <0|1>, hash: <hash buffer level n-1>},\n             *               ...\n             *               {side: <0|1>, hash: <hash buffer level 1>}]}\n             *\n             * If no such transaction RID exists, the callback will be called with (null, null).\n             *\n             * The proof object can be validated using\n             * postchain-common.util.validateMerklePath(proof.merklePath, proof.hash,\n             * proof.blockHeader.slice(32, 64))\n             *\n             * The signatures must be validated agains some know trusted source for valid signers\n             * at this specific block height.\n             */\n            getConfirmationProof(txRid, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    try {\n                        (0, txRid_1.isTxRidValid)(txRid, { throwOnError: true });\n                    }\n                    catch (error) {\n                        callback === null || callback === void 0 ? void 0 : callback(error, null);\n                        throw error;\n                    }\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `tx/${config.blockchainRid}/${(0, formatter_1.ensureString)(txRid)}/confirmationProof`, config);\n                    const confirmationProof = {\n                        merkleProofTree: \"\",\n                        txIndex: 0,\n                    };\n                    if (statusCode === 200) {\n                        try {\n                            const transactionConfirmationProof = (0, requests_1.isTransactionConfirmationProof)(rspBody);\n                            if (!transactionConfirmationProof) {\n                                throw error;\n                            }\n                            const decodedProof = (0, serialization_1.decodeValue)((0, formatter_1.toBuffer)(transactionConfirmationProof.proof));\n                            confirmationProof.txIndex = decodedProof.txIndex;\n                            confirmationProof.hash = decodedProof.hash;\n                            confirmationProof.blockHeader = decodedProof.blockHeader;\n                            confirmationProof.witness = decodedProof.witness;\n                            confirmationProof.merkleProofTree = decodedProof.merkleProofTree;\n                        }\n                        catch (decodeError) {\n                            if (callback) {\n                                callback(decodeError, null);\n                            }\n                            throw decodeError;\n                        }\n                    }\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, statusCode === 200 ? confirmationProof : (0, requests_1.isRawGtv)(rspBody), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            getClusterAnchoringTransactionConfirmation(transactionRid, anchoringClient, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    try {\n                        (0, txRid_1.isTxRidValid)(transactionRid, { throwOnError: true });\n                    }\n                    catch (error) {\n                        callback === null || callback === void 0 ? void 0 : callback(error, null);\n                        throw error;\n                    }\n                    const client = this;\n                    try {\n                        let confirmationProof;\n                        try {\n                            confirmationProof = yield client.getConfirmationProof(transactionRid);\n                        }\n                        catch (error) {\n                            callback === null || callback === void 0 ? void 0 : callback(error, null);\n                            return enums_1.AnchoringStatus.NotAnchored;\n                        }\n                        const anchoringTransaction = yield (0, IccfProofTxMaterialBuilder_1.getBlockAnchoringTransaction)(client, anchoringClient, transactionRid, confirmationProof);\n                        if (!anchoringTransaction)\n                            return enums_1.AnchoringStatus.NotAnchored;\n                        return anchoringTransaction;\n                    }\n                    catch (error) {\n                        callback === null || callback === void 0 ? void 0 : callback(error, null);\n                        return enums_1.AnchoringStatus.FailedAnchoring;\n                    }\n                });\n            },\n            getSystemAnchoringTransactionConfirmation(anchoredTxRid, anchoringClient, systemAnchoringChainRid, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    try {\n                        (0, txRid_1.isTxRidValid)(anchoredTxRid, { throwOnError: true });\n                    }\n                    catch (error) {\n                        callback === null || callback === void 0 ? void 0 : callback(error, null);\n                        throw error;\n                    }\n                    const systemAnchoringTransactionTransaction = yield (0, utils_1.getSystemAnchoringTransaction)(config.endpointPool, anchoredTxRid, anchoringClient, systemAnchoringChainRid, config.systemAnchoringStatusPolling, config.merkleHashVersion, config.blockedNodeUrlSubstrings, config.nodeUrlFilter);\n                    return systemAnchoringTransactionTransaction;\n                });\n            },\n            getWaitingTransactions(blockchainRid, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `/tx/${(0, formatter_1.ensureString)(blockchainRid)}/waiting`, config);\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, (0, requests_1.isRawGtv)(rspBody), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            getWaitingTransaction(blockchainRid, txRid, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    const { error, statusCode, rspBody, transactionTimestamp } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `/tx/${(0, formatter_1.ensureString)(blockchainRid)}/waiting/${(0, formatter_1.ensureString)(txRid)}`, config);\n                    const transaction = (0, requests_1.isTransaction)(rspBody);\n                    const result = transaction ? (0, formatter_1.toBuffer)(transaction.tx) : (0, requests_1.isRawGtv)(rspBody);\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, result, (0, utils_1.callbackPromiseBuilder)(reject, txData => resolve({\n                            txData: (0, requests_1.isRawGtv)(txData),\n                            transactionTimestamp: Number(transactionTimestamp),\n                        }), callback));\n                    });\n                });\n            },\n            getRejectedTransactions(blockchainRid, callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `/tx/${(0, formatter_1.ensureString)(blockchainRid)}/rejected`, config);\n                    const rejectedTransactionsArray = (0, requests_1.isRejectedTransactionResponseArray)(rspBody);\n                    const validResponseBody = statusCode === 200 && rejectedTransactionsArray\n                        ? rejectedTransactionsArray.map(rejectedTransaction => (0, utils_1.formatRejectedTransactionFromResponse)(rejectedTransaction))\n                        : rspBody;\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, (0, requests_1.isRawGtv)(validResponseBody), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n            /**\n             * Get app structure. Returns list of app modules in JSON format\n             * @param callback - leverages error-first pattern and called when promise resolves\n             */\n            getAppStructure(callback) {\n                return __awaiter(this, void 0, void 0, function* () {\n                    const { error, statusCode, rspBody } = yield (0, requestWithFailoverStrategy_1.requestWithFailoverStrategy)(enums_1.Method.GET, `/query/${config.blockchainRid}?type=rell.get_app_structure`, config);\n                    return new Promise((resolve, reject) => {\n                        (0, utils_1.handleGetResponse)(error, statusCode, (0, requests_1.isRawGtv)(rspBody), (0, utils_1.callbackPromiseBuilder)(reject, resolve, callback));\n                    });\n                });\n            },\n        };\n        function getMerkleHashVersion(settings) {\n            return __awaiter(this, void 0, void 0, function* () {\n                let merkleHashVersion;\n                if (settings.merkleHashVersion !== undefined) {\n                    merkleHashVersion = settings.merkleHashVersion;\n                }\n                else {\n                    merkleHashVersion = yield (0, utils_1.getMerkleHashVersionFromDapp)(config);\n                }\n                return merkleHashVersion;\n            });\n        }\n        function createStickyNodeClient(client) {\n            return __awaiter(this, void 0, void 0, function* () {\n                var _a;\n                if (!client.config.nodeManager.lastUsedNode) {\n                    throw new Error(\"No last used node found; cannot create sticky node client\");\n                }\n                const stickyNodeClient = yield createClient({\n                    nodeUrlPool: (_a = client.config.nodeManager.lastUsedNode) === null || _a === void 0 ? void 0 : _a.url,\n                    blockchainRid: client.config.blockchainRid,\n                    merkleHashVersion: client.config.merkleHashVersion,\n                    useStickyNode: true,\n                    blockedNodeUrlSubstrings: client.config.blockedNodeUrlSubstrings,\n                    nodeUrlFilter: client.config.nodeUrlFilter,\n                });\n                return stickyNodeClient;\n            });\n        }\n    });\n}\n//# sourceMappingURL=blockchainClient.js.map","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n    return new (P || (P = Promise))(function (resolve, reject) {\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\n    });\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createStubClient = createStubClient;\nconst enums_1 = require(\"./enums\");\nconst promiEvents_1 = require(\"../promiEvent/promiEvents\");\nconst nodeManager_1 = require(\"./nodeManager\");\nconst utils_1 = require(\"./utils\");\nconst constants_1 = require(\"../utils/constants\");\nfunction createStubClient() {\n    return __awaiter(this, void 0, void 0, function* () {\n        return {\n            config: {\n                merkleHashVersion: constants_1.MERKLE_HASH_VERSIONS.ONE,\n                nodeManager: (0, nodeManager_1.createNodeManager)({\n                    nodeUrls: [],\n                }),\n                endpointPool: [],\n                blockchainRid: \"0000000000000000000000000000000000000000000000000000000000000000\",\n                dappStatusPolling: (0, utils_1.setStatusPolling)({ interval: 5000, count: 5 }),\n                clusterAnchoringStatusPolling: (0, utils_1.setStatusPolling)(),\n                systemAnchoringStatusPolling: (0, utils_1.setStatusPolling)(),\n                retryTransactionPolling: (0, utils_1.setRetryTransactionPolling)(),\n                failoverStrategy: enums_1.FailoverStrategy.AbortOnError,\n                attemptsPerEndpoint: 3,\n                attemptInterval: 5000,\n                unreachableDuration: 30000,\n                directoryChainRid: \"1111111111111111111111111111111111111111111111111111111111111111\",\n                connectTimeout: 1000,\n                responseTimeout: 1000,\n            },\n            query() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"query rejected\");\n                });\n            },\n            signTransaction() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"signTransaction rejected\");\n                });\n            },\n            sendTransaction() {\n                return new promiEvents_1.Web3PromiEvent((_resolve, reject) => reject(\"sendTransaction rejected\"));\n            },\n            sendTransactionWithRetries() {\n                return new promiEvents_1.Web3PromiEvent((_resolve, reject) => reject(\"sendTransactionWithRetries rejected\"));\n            },\n            signAndSendUniqueTransaction() {\n                return new promiEvents_1.Web3PromiEvent((_resolve, reject) => reject(\"signAndSendUniqueTransaction rejected\"));\n            },\n            getTransaction() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getTransaction rejected\");\n                });\n            },\n            getTransactionStatus() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getTransactionStatus rejected\");\n                });\n            },\n            addNop() {\n                throw new Error(\"addNop error\");\n            },\n            getTransactionsInfo() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getTransactionsInfo rejected\");\n                });\n            },\n            getTransactionInfo() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getTransactionInfo rejected\");\n                });\n            },\n            getAnchoringStatusForBlockRid() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getAnchoringStatusForBlockRid rejected\");\n                });\n            },\n            getTransactionConfirmationLevel() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getTransactionConfirmationLevel rejected\");\n                });\n            },\n            getTransactionCount() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getTransactionCount rejected\");\n                });\n            },\n            getBlocks() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getBlockInfo rejected\");\n                });\n            },\n            getBlockInfo() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getBlockInfo rejected\");\n                });\n            },\n            getLatestBlock() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getLatestBlock rejected\");\n                });\n            },\n            getClientNodeUrlPool() {\n                return [];\n            },\n            getConfirmationProof() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getConfirmationProof rejected\");\n                });\n            },\n            getClusterAnchoringTransactionConfirmation() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getClusterAnchoringTransactionConfirmation rejected\");\n                });\n            },\n            getSystemAnchoringTransactionConfirmation() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getSystemAnchoringTransactionConfirmation rejected\");\n                });\n            },\n            getAppStructure() {\n                return Promise.reject(\"getAppStructure rejected\");\n            },\n            getWaitingTransactions() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getWaitingTransactions rejected\");\n                });\n            },\n            getWaitingTransaction() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getWaitingTransaction rejected\");\n                });\n            },\n            getRejectedTransactions() {\n                return __awaiter(this, void 0, void 0, function* () {\n                    return Promise.reject(\"getRejectedTransactions rejected\");\n                });\n            },\n        };\n    });\n}\n//# sourceMappingURL=clientStub.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.calculateTransactionRid = calculateTransactionRid;\nconst errors_1 = require(\"../blockchainClient/errors\");\nconst gtx_1 = require(\"../gtx/gtx\");\n/**\n * Calculates and returns the transaction RID, i.e., the merkle root hash of the transaction.\n * @param transaction The transaction in format of RawGtxBody\n *\n */\nfunction calculateTransactionRid(transaction, merkleHashVersion) {\n    try {\n        return (0, gtx_1.getDigestToSignFromRawGtxBody)(transaction, merkleHashVersion);\n    }\n    catch (error) {\n        throw new errors_1.GetTransactionRidException(error);\n    }\n}\n//# sourceMappingURL=calculateTransactionRid.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.dumpGtx = dumpGtx;\nexports.dumpGtv = dumpGtv;\nconst buffer_1 = require(\"buffer\");\nconst __1 = require(\"../..\");\nfunction dumpGtx(gtxTx) {\n    var _a;\n    return `blockchainRid:\\n${__1.formatter.toString(gtxTx.blockchainRid)}\\n\noperations:\n${gtxTx.operations.map(op => ` - ${op.opName}(${op.args.map(dumpGtv).join(\", \")})\\n`).join(\"\")}\nsigners:\n${gtxTx.signers.map(s => ` - ${__1.formatter.toString(s)}\\n`).join(\"\")}\nsignatures:\n${(_a = gtxTx.signatures) === null || _a === void 0 ? void 0 : _a.map(s => ` - ${__1.formatter.toString(s)}\\n`).join(\"\")}`;\n}\nfunction dumpGtv(rawGtv) {\n    return JSON.stringify(rawGtv, (_key, value) => {\n        if (typeof value === \"bigint\") {\n            return `${value.toString()}L`;\n        }\n        if (buffer_1.Buffer.isBuffer(value)) {\n            return __1.formatter.toString(value);\n        }\n        if (typeof value === \"object\" &&\n            value !== null &&\n            value.type === \"Buffer\" &&\n            Array.isArray(value.data)) {\n            return `0x${value.data}`;\n        }\n        return value;\n    });\n}\n//# sourceMappingURL=dump.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeTransactionToGtx = decodeTransactionToGtx;\nconst gtxTool = __importStar(require(\"../gtx/gtx\"));\nconst logger = __importStar(require(\"../logger\"));\nconst dump_1 = require(\"./dump\");\n/**\n * Decodes the transaction using ASN.1.\n * @returns the transaction decoded in GTX format\n */\nfunction decodeTransactionToGtx(encodedTransaction) {\n    const gtx = gtxTool.deserialize(encodedTransaction);\n    logger.debug(`Output from deserializing a raw transaction: ${(0, dump_1.dumpGtv)(gtx)}`);\n    return gtx;\n}\n//# sourceMappingURL=decodeTransactionToGtx.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MERKLE_HASH_VERSIONS = exports.isTransactionInfoArray = exports.isTransactionInfo = exports.isTransactionInfoResponseArray = exports.isTransactionInfoResponse = exports.isConfirmationProof = exports.isTransactionConfirmationProof = exports.isTransactionsCount = exports.isTransaction = exports.isBlockInfoResponseArray = exports.isBlockInfoResponse = exports.isTransactionInfoInBlockResponseArray = exports.isTransactionInfoInBlockResponse = exports.isRawGtv = exports.isDictPair = exports.isString = exports.setStatusPolling = exports.getSystemAnchoringTransaction = exports.getAnchoringClientAndSystemChainRid = exports.getSystemAnchoringChain = exports.getSystemClient = exports.convertToRellOperation = exports.CustomError = exports.Web3PromiEvent = exports.TransactionEvent = exports.ChainConfirmationLevel = exports.AnchoringStatus = exports.ResponseStatus = exports.FailoverStrategy = exports.requestWithFailoverStrategy = exports.dumpGtv = exports.dumpGtx = exports.decodeTransactionToGtx = exports.encodeTransaction = exports.calculateTransactionRid = exports.getAnchoringClient = exports.getBlockAnchoringTransaction = exports.isBlockAnchored = exports.createIccfProofTx = exports.getDigestToSignFromRawGtxBody = exports.newSignatureProvider = exports.createStubClient = exports.createClient = exports.encryption = exports.logger = exports.gtx = exports.formatter = exports.gtv = exports.Buffer = void 0;\nvar buffer_1 = require(\"buffer\");\nObject.defineProperty(exports, \"Buffer\", { enumerable: true, get: function () { return buffer_1.Buffer; } });\nexports.gtv = __importStar(require(\"./src/gtv/index\"));\nexports.formatter = __importStar(require(\"./src/formatter\"));\nexports.gtx = __importStar(require(\"./src/gtx/gtx\"));\nexports.logger = __importStar(require(\"./src/logger\"));\nexports.encryption = __importStar(require(\"./src/encryption/encryption\"));\nvar blockchainClient_1 = require(\"./src/blockchainClient/blockchainClient\");\nObject.defineProperty(exports, \"createClient\", { enumerable: true, get: function () { return blockchainClient_1.createClient; } });\nvar clientStub_1 = require(\"./src/blockchainClient/clientStub\");\nObject.defineProperty(exports, \"createStubClient\", { enumerable: true, get: function () { return clientStub_1.createStubClient; } });\nvar gtx_1 = require(\"./src/gtx/gtx\");\nObject.defineProperty(exports, \"newSignatureProvider\", { enumerable: true, get: function () { return gtx_1.newSignatureProvider; } });\nObject.defineProperty(exports, \"getDigestToSignFromRawGtxBody\", { enumerable: true, get: function () { return gtx_1.getDigestToSignFromRawGtxBody; } });\nvar IccfProofTxMaterialBuilder_1 = require(\"./src/ICCF/IccfProofTxMaterialBuilder\");\nObject.defineProperty(exports, \"createIccfProofTx\", { enumerable: true, get: function () { return IccfProofTxMaterialBuilder_1.createIccfProofTx; } });\nObject.defineProperty(exports, \"isBlockAnchored\", { enumerable: true, get: function () { return IccfProofTxMaterialBuilder_1.isBlockAnchored; } });\nObject.defineProperty(exports, \"getBlockAnchoringTransaction\", { enumerable: true, get: function () { return IccfProofTxMaterialBuilder_1.getBlockAnchoringTransaction; } });\nObject.defineProperty(exports, \"getAnchoringClient\", { enumerable: true, get: function () { return IccfProofTxMaterialBuilder_1.getAnchoringClient; } });\nvar calculateTransactionRid_1 = require(\"./src/utils/calculateTransactionRid\");\nObject.defineProperty(exports, \"calculateTransactionRid\", { enumerable: true, get: function () { return calculateTransactionRid_1.calculateTransactionRid; } });\nvar encodeTransaction_1 = require(\"./src/utils/encodeTransaction\");\nObject.defineProperty(exports, \"encodeTransaction\", { enumerable: true, get: function () { return encodeTransaction_1.encodeTransaction; } });\nvar decodeTransactionToGtx_1 = require(\"./src/utils/decodeTransactionToGtx\");\nObject.defineProperty(exports, \"decodeTransactionToGtx\", { enumerable: true, get: function () { return decodeTransactionToGtx_1.decodeTransactionToGtx; } });\nvar dump_1 = require(\"./src/utils/dump\");\nObject.defineProperty(exports, \"dumpGtx\", { enumerable: true, get: function () { return dump_1.dumpGtx; } });\nObject.defineProperty(exports, \"dumpGtv\", { enumerable: true, get: function () { return dump_1.dumpGtv; } });\nvar requestWithFailoverStrategy_1 = require(\"./src/blockchainClient/requestWithFailoverStrategy\");\nObject.defineProperty(exports, \"requestWithFailoverStrategy\", { enumerable: true, get: function () { return requestWithFailoverStrategy_1.requestWithFailoverStrategy; } });\nvar enums_1 = require(\"./src/blockchainClient/enums\");\nObject.defineProperty(exports, \"FailoverStrategy\", { enumerable: true, get: function () { return enums_1.FailoverStrategy; } });\nObject.defineProperty(exports, \"ResponseStatus\", { enumerable: true, get: function () { return enums_1.ResponseStatus; } });\nObject.defineProperty(exports, \"AnchoringStatus\", { enumerable: true, get: function () { return enums_1.AnchoringStatus; } });\nObject.defineProperty(exports, \"ChainConfirmationLevel\", { enumerable: true, get: function () { return enums_1.ChainConfirmationLevel; } });\nObject.defineProperty(exports, \"TransactionEvent\", { enumerable: true, get: function () { return enums_1.TransactionEvent; } });\nvar promiEvents_1 = require(\"./src/promiEvent/promiEvents\");\nObject.defineProperty(exports, \"Web3PromiEvent\", { enumerable: true, get: function () { return promiEvents_1.Web3PromiEvent; } });\nvar customError_1 = require(\"./src/customError\");\nObject.defineProperty(exports, \"CustomError\", { enumerable: true, get: function () { return customError_1.CustomError; } });\nvar utils_1 = require(\"./src/blockchainClient/utils\");\nObject.defineProperty(exports, \"convertToRellOperation\", { enumerable: true, get: function () { return utils_1.convertToRellOperation; } });\nObject.defineProperty(exports, \"getSystemClient\", { enumerable: true, get: function () { return utils_1.getSystemClient; } });\nObject.defineProperty(exports, \"getSystemAnchoringChain\", { enumerable: true, get: function () { return utils_1.getSystemAnchoringChain; } });\nObject.defineProperty(exports, \"getAnchoringClientAndSystemChainRid\", { enumerable: true, get: function () { return utils_1.getAnchoringClientAndSystemChainRid; } });\nObject.defineProperty(exports, \"getSystemAnchoringTransaction\", { enumerable: true, get: function () { return utils_1.getSystemAnchoringTransaction; } });\nObject.defineProperty(exports, \"setStatusPolling\", { enumerable: true, get: function () { return utils_1.setStatusPolling; } });\nvar requests_1 = require(\"./src/blockchainClient/validation/requests\");\nObject.defineProperty(exports, \"isString\", { enumerable: true, get: function () { return requests_1.isString; } });\nObject.defineProperty(exports, \"isDictPair\", { enumerable: true, get: function () { return requests_1.isDictPair; } });\nObject.defineProperty(exports, \"isRawGtv\", { enumerable: true, get: function () { return requests_1.isRawGtv; } });\nObject.defineProperty(exports, \"isTransactionInfoInBlockResponse\", { enumerable: true, get: function () { return requests_1.isTransactionInfoInBlockResponse; } });\nObject.defineProperty(exports, \"isTransactionInfoInBlockResponseArray\", { enumerable: true, get: function () { return requests_1.isTransactionInfoInBlockResponseArray; } });\nObject.defineProperty(exports, \"isBlockInfoResponse\", { enumerable: true, get: function () { return requests_1.isBlockInfoResponse; } });\nObject.defineProperty(exports, \"isBlockInfoResponseArray\", { enumerable: true, get: function () { return requests_1.isBlockInfoResponseArray; } });\nObject.defineProperty(exports, \"isTransaction\", { enumerable: true, get: function () { return requests_1.isTransaction; } });\nObject.defineProperty(exports, \"isTransactionsCount\", { enumerable: true, get: function () { return requests_1.isTransactionsCount; } });\nObject.defineProperty(exports, \"isTransactionConfirmationProof\", { enumerable: true, get: function () { return requests_1.isTransactionConfirmationProof; } });\nObject.defineProperty(exports, \"isConfirmationProof\", { enumerable: true, get: function () { return requests_1.isConfirmationProof; } });\nObject.defineProperty(exports, \"isTransactionInfoResponse\", { enumerable: true, get: function () { return requests_1.isTransactionInfoResponse; } });\nObject.defineProperty(exports, \"isTransactionInfoResponseArray\", { enumerable: true, get: function () { return requests_1.isTransactionInfoResponseArray; } });\nObject.defineProperty(exports, \"isTransactionInfo\", { enumerable: true, get: function () { return requests_1.isTransactionInfo; } });\nObject.defineProperty(exports, \"isTransactionInfoArray\", { enumerable: true, get: function () { return requests_1.isTransactionInfoArray; } });\nvar constants_1 = require(\"./src/utils/constants\");\nObject.defineProperty(exports, \"MERKLE_HASH_VERSIONS\", { enumerable: true, get: function () { return constants_1.MERKLE_HASH_VERSIONS; } });\n__exportStar(require(\"./src/blockchainClient/errors\"), exports);\n__exportStar(require(\"./src/gtx/errors\"), exports);\n__exportStar(require(\"./src/encryption/errors\"), exports);\n__exportStar(require(\"./src/ICCF/error\"), exports);\n//# sourceMappingURL=index.js.map","import { getDefaultExportFromCjs } from \"\u0000commonjsHelpers.js\";\nimport { __require as requireBuilt } from \"/opt/atlassian/pipelines/agent/build/built/index.js\";\nvar builtExports = requireBuilt();\nexport { builtExports as __moduleExports };export default /*@__PURE__*/getDefaultExportFromCjs(builtExports);","/**\n * Browser implementation of the NativeBindings surface.\n *\n * The Node bundle backs this with a compiled Rust binary via NAPI-RS. Browsers\n * can't load `.node` binaries, so this file re-implements the same operations\n * on top of pure-JS libraries: `@noble/curves` for secp256k1, `postchain-client`\n * for GTX encoding.\n *\n * Signing output matches the Rust core byte-for-byte for the same inputs\n * (both call postchain-client with `merkleHashVersion = 2`). Redaction,\n * memory diff, and normalization are stubbed to identity/no-op — the strict\n * browser subset does not offer them; callers that need those must run on Node.\n */\n\nimport { secp256k1 } from \"@noble/curves/secp256k1.js\";\nimport { sha256 } from \"@noble/hashes/sha2.js\";\nimport { bytesToHex, hexToBytes } from \"@noble/curves/utils.js\";\nimport postchain from \"postchain-client\";\n\nconst { Buffer, gtx: pcgtx } = postchain;\n\nimport type { NativeBindings } from \"../native.js\";\nimport type {\n  AgentAuth,\n  KeyPair,\n  MemoryDiffResult,\n  MemoryEntry,\n  MemorySnapshot,\n  RedactResult,\n} from \"../types.js\";\n\n// Chain constants. Every other binding reads these from the Rust core, which\n// resolves them per build flavour. `dist/browser.mjs` has no build-time channel\n// to the core, so it hardcodes one coherent set — the **production** set, since\n// the bundle is published to npm and must not ship a dev host or a dev chain.\n//\n// These must stay internally consistent: pairing the prod judge with dev chain\n// RIDs makes the judge reject every signed operation with \"bound to an\n// unrecognized blockchain\". Keep in sync with the PROD_* values in\n// `.env.example` / the repo's Actions variables.\nconst PROD_ENDPOINT = \"https://atbash.ai\";\nconst PROD_BLOCKCHAIN_RID =\n  \"0163241D9AF137638E63E48EFCDE15510F38C2426F7AD5DC726AF60351BF4DFE\";\nconst PROD_PRIVATE_BLOCKCHAIN_RID =\n  \"39FFD3557D0296CB2C57FDC6A3B8C024E95639CF4964DA08141AC20C6344D408\";\nconst DEFAULT_CHROMIA_NODE_URLS_ARR: readonly string[] = [\n  \"https://node0.testnet.chromia.com:7740\",\n  \"https://node1.testnet.chromia.com:7740\",\n  \"https://node3.testnet.chromia.com:7740\",\n];\nconst DEFAULT_PRIVATE_NODE_URLS_ARR: readonly string[] = [\n  \"https://node0-pvn-testnet.dynamic.chromia.dev\",\n];\n\nconst MERKLE_HASH_VERSION = 2;\n\nfunction stripHex(s: string): string {\n  return s.trim().replace(/^0x/i, \"\").toLowerCase();\n}\n\nfunction isHex64(s: string): boolean {\n  return /^[0-9a-f]{64}$/.test(stripHex(s));\n}\n\nfunction privKeyBytes(hex: string): Uint8Array {\n  return hexToBytes(stripHex(hex));\n}\n\nfunction compressedPubKey(privHex: string): Uint8Array {\n  return secp256k1.getPublicKey(privKeyBytes(privHex), true);\n}\n\nfunction bodyAsUint8(body: Uint8Array | Buffer | { data: number[] }): Uint8Array {\n  if (body instanceof Uint8Array) return body;\n  if (typeof body === \"object\" && body !== null && \"data\" in body) {\n    return new Uint8Array((body as { data: number[] }).data);\n  }\n  return new Uint8Array(body as ArrayBufferLike);\n}\n\n/** SHA-256(body) → 32 bytes. */\nfunction digestBody(body: Uint8Array): Uint8Array {\n  return sha256(body);\n}\n\nfunction isValidPrivateKey(hex: string): boolean {\n  if (!isHex64(hex)) return false;\n  try {\n    return secp256k1.utils.isValidSecretKey(privKeyBytes(hex));\n  } catch {\n    return false;\n  }\n}\n\nfunction derivePublicKey(hex: string): string {\n  if (!isValidPrivateKey(hex)) {\n    throw new Error(\"invalid private key — must be 64 hex characters (secp256k1)\");\n  }\n  return bytesToHex(compressedPubKey(hex));\n}\n\nfunction generateKeypair(): KeyPair {\n  const priv = secp256k1.utils.randomSecretKey();\n  return {\n    priv_key: bytesToHex(priv),\n    pub_key: bytesToHex(secp256k1.getPublicKey(priv, true)),\n  };\n}\n\nfunction loadAgent(privkey: string): AgentAuth {\n  if (!isValidPrivateKey(privkey)) {\n    throw new Error(\"invalid private key — must be 64 hex characters (secp256k1)\");\n  }\n  const clean = stripHex(privkey);\n  return { privkey: clean, pubkey: derivePublicKey(clean) };\n}\n\n/**\n * Build → sign → serialize a single-operation GTX transaction. The Rust core\n * uses postchain-client 0.0.5 (crate) with `merkle_hash_version = 2`; we call\n * postchain-client 2.1.5 (npm) with the same version, so the output hex is\n * byte-identical for the same inputs.\n */\nfunction signOp(\n  opName: string,\n  args: string[],\n  privkeyHex: string,\n  blockchainRidHex: string,\n): string {\n  if (!isValidPrivateKey(privkeyHex)) {\n    throw new Error(\"invalid private key\");\n  }\n  const ridBytes = hexToBytes(stripHex(blockchainRidHex));\n  if (ridBytes.length !== 32) {\n    throw new Error(\"invalid blockchain rid — must be 32 bytes hex\");\n  }\n\n  const brid = Buffer.from(ridBytes);\n  const priv = Buffer.from(privKeyBytes(privkeyHex));\n  const pub = Buffer.from(compressedPubKey(privkeyHex));\n\n  let g = pcgtx.emptyGtx(brid);\n  g = pcgtx.addTransactionToGtx(opName, args, g);\n  pcgtx.addSignerToGtx(pub, g);\n\n  // Deterministic sync ECDSA signing over the GTX body digest. postchain-client\n  // v2.x's `sign()` is async only to accommodate hardware signers; here we do\n  // the digest → sign → attach roundtrip inline so the shim matches the Rust\n  // core's synchronous surface. `prehash: false` because `getDigestToSign`\n  // already returns the SHA-256 digest — passing default `prehash: true`\n  // would hash it a second time and produce non-matching signatures.\n  const digest = pcgtx.getDigestToSign(g, MERKLE_HASH_VERSION);\n  const signature = secp256k1.sign(digest, priv, { prehash: false });\n  g = pcgtx.addSignature(pub, Buffer.from(signature), g);\n\n  return pcgtx.serialize(g).toString(\"hex\");\n}\n\nfunction signLogToolCall(\n  toolCallId: string,\n  action: string,\n  context: string,\n  toolName: string,\n  toolArgsJson: string,\n  privkey: string,\n  blockchainRid: string,\n): string {\n  return signOp(\n    \"log_tool_call\",\n    [toolCallId, action, context, toolName, toolArgsJson],\n    privkey,\n    blockchainRid,\n  );\n}\n\nfunction signJudgeAction(\n  judgmentId: string,\n  action: string,\n  context: string,\n  extra: string,\n  privkey: string,\n  blockchainRid: string,\n): string {\n  return signOp(\n    \"judge_action\",\n    [judgmentId, action, context, extra],\n    privkey,\n    blockchainRid,\n  );\n}\n\n/**\n * Verify secp256k1 signature over SHA-256(body). Accepts compact (r||s) or\n * DER encoding, matching the Rust core's `verify_signature` behavior.\n */\nfunction verifySignature(\n  body: Buffer | Uint8Array | { data: number[] },\n  signatureHex: string,\n  pubkeyHex: string,\n): boolean {\n  const sigClean = signatureHex.trim().replace(/^0x/i, \"\").toLowerCase();\n  if (!/^[0-9a-f]+$/.test(sigClean)) {\n    throw new Error(\"signature is not hex\");\n  }\n  if (sigClean.length < 64 || sigClean.length > 256) {\n    throw new Error(\"signature length out of range\");\n  }\n  const pkClean = pubkeyHex.trim().replace(/^0x/i, \"\").toLowerCase();\n  const pkBytes = hexToBytes(pkClean);\n\n  const digest = digestBody(bodyAsUint8(body));\n  const sigBytes = hexToBytes(sigClean);\n  // `prehash: false` — the digest is already SHA-256(body), matching what the\n  // Rust core hashes before calling secp256k1 verify. Passing default would\n  // double-hash and reject valid signatures.\n  return secp256k1.verify(sigBytes, digest, pkBytes, { prehash: false });\n}\n\n/* ── Stubbed operations (Node-only in the strict subset) ─────────────────── */\n\nconst STUB_MSG =\n  \"not available in @atbash/sdk browser bundle — call from Node or handle server-side\";\n\nfunction redactSecrets(input: string): RedactResult {\n  return { redacted: input, found: [] };\n}\n\nfunction containsSecret(_: string): boolean {\n  return false;\n}\n\nfunction normalizeForMatching(s: string): string {\n  return s.normalize(\"NFKC\").toLowerCase();\n}\n\nfunction containsEvasionCharacters(_: string): boolean {\n  return false;\n}\n\nfunction createMemorySnapshot(_: MemoryEntry[], __: number): MemorySnapshot {\n  throw new Error(`createMemorySnapshot ${STUB_MSG}`);\n}\n\nfunction diffMemorySnapshots(_: MemorySnapshot, __: MemorySnapshot): MemoryDiffResult {\n  throw new Error(`diffMemorySnapshots ${STUB_MSG}`);\n}\n\n// Memory encryption / scan stubs — the browser build has no native\n// AES-GCM or regex engine available through this loader. Consumers who\n// need memory ops should run the SDK server-side.\nfunction deriveMemoryKey(_: string): never {\n  throw new Error(`deriveMemoryKey ${STUB_MSG}`);\n}\n\nfunction encryptMemoryContent(_: string, __: Buffer): never {\n  throw new Error(`encryptMemoryContent ${STUB_MSG}`);\n}\n\nfunction decryptMemoryContent(_: Buffer, __: Buffer, ___: Buffer): never {\n  throw new Error(`decryptMemoryContent ${STUB_MSG}`);\n}\n\n// Server-only APIs — browser has no NAPI; these stubs throw instead of no-op.\n// Dashboard callers should use `crypto/ecies.ts` or their own crypto helpers.\n// `T` is bound to the target NativeBindings method type so each call site\n// keeps its signature and the one cast lives here, not at every use.\nfunction stub<T extends (...args: never[]) => unknown>(name: string): T {\n  return ((..._args: never[]): never => {\n    throw new Error(`${name} ${STUB_MSG}`);\n  }) as unknown as T;\n}\n\nexport const native: NativeBindings = {\n  isValidPrivateKey,\n  derivePublicKey,\n  generateKeypair,\n  loadAgent,\n  signLogToolCall,\n  signJudgeAction,\n  verifySignature: verifySignature as NativeBindings[\"verifySignature\"],\n  normalizeForMatching,\n  containsEvasionCharacters,\n  redactSecrets,\n  containsSecret,\n  createMemorySnapshot,\n  diffMemorySnapshots,\n  deriveMemoryKey: deriveMemoryKey as NativeBindings[\"deriveMemoryKey\"],\n  encryptMemoryContent: encryptMemoryContent as NativeBindings[\"encryptMemoryContent\"],\n  decryptMemoryContent: decryptMemoryContent as NativeBindings[\"decryptMemoryContent\"],\n  DEFAULT_BLOCKCHAIN_RID: PROD_BLOCKCHAIN_RID,\n  DEFAULT_PRIVATE_BLOCKCHAIN_RID: PROD_PRIVATE_BLOCKCHAIN_RID,\n  DEFAULT_ENDPOINT: PROD_ENDPOINT,\n  // Browser has no NAPI channel to Rust's HONEYCOMB_KEY — telemetry\n  // silently no-ops. `HONEYCOMB_API_KEY` env var still overrides at runtime.\n  HONEYCOMB_KEY: \"\",\n  defaultChromiaNodeUrls: () => [...DEFAULT_CHROMIA_NODE_URLS_ARR],\n  defaultPrivateNodeUrls: () => [...DEFAULT_PRIVATE_NODE_URLS_ARR],\n\n  // Server-only surfaces — throw at runtime, keep types satisfied.\n  classifyMemoryWrite: stub<NativeBindings[\"classifyMemoryWrite\"]>(\"classifyMemoryWrite\"),\n  classifyMemoryRead: stub<NativeBindings[\"classifyMemoryRead\"]>(\"classifyMemoryRead\"),\n  defaultMemoryWriteToolNames: stub<NativeBindings[\"defaultMemoryWriteToolNames\"]>(\"defaultMemoryWriteToolNames\"),\n  defaultMemoryPathPatterns: stub<NativeBindings[\"defaultMemoryPathPatterns\"]>(\"defaultMemoryPathPatterns\"),\n  defaultMemoryReadToolNames: stub<NativeBindings[\"defaultMemoryReadToolNames\"]>(\"defaultMemoryReadToolNames\"),\n  memoryScanContext: stub<NativeBindings[\"memoryScanContext\"]>(\"memoryScanContext\"),\n  buildScanRequest: stub<NativeBindings[\"buildScanRequest\"]>(\"buildScanRequest\"),\n  formatEntryForScan: stub<NativeBindings[\"formatEntryForScan\"]>(\"formatEntryForScan\"),\n  mapVerdict: stub<NativeBindings[\"mapVerdict\"]>(\"mapVerdict\"),\n  parseScoreFromReason: stub<NativeBindings[\"parseScoreFromReason\"]>(\"parseScoreFromReason\"),\n  defaultScoreForVerdict: stub<NativeBindings[\"defaultScoreForVerdict\"]>(\"defaultScoreForVerdict\"),\n  encryptForOrg: stub<NativeBindings[\"encryptForOrg\"]>(\"encryptForOrg\"),\n  decryptForOrg: stub<NativeBindings[\"decryptForOrg\"]>(\"decryptForOrg\"),\n  encryptedLength: stub<NativeBindings[\"encryptedLength\"]>(\"encryptedLength\"),\n  ECIES_FORMAT_VERSION: 1,\n  verifyJudgeResponseSignature: stub<NativeBindings[\"verifyJudgeResponseSignature\"]>(\"verifyJudgeResponseSignature\"),\n  buildAddAgentMemoryArgs: stub<NativeBindings[\"buildAddAgentMemoryArgs\"]>(\"buildAddAgentMemoryArgs\"),\n  buildRollbackAgentMemoryArgs: stub<NativeBindings[\"buildRollbackAgentMemoryArgs\"]>(\"buildRollbackAgentMemoryArgs\"),\n  validateScore: stub<NativeBindings[\"validateScore\"]>(\"validateScore\"),\n  validateAgentPubkeyHex: stub<NativeBindings[\"validateAgentPubkeyHex\"]>(\"validateAgentPubkeyHex\"),\n  validateMemoryId: stub<NativeBindings[\"validateMemoryId\"]>(\"validateMemoryId\"),\n  validateRollbackReason: stub<NativeBindings[\"validateRollbackReason\"]>(\"validateRollbackReason\"),\n  validateMemoryNonce: stub<NativeBindings[\"validateMemoryNonce\"]>(\"validateMemoryNonce\"),\n  buildGetActiveMemoryIdQuery: stub<NativeBindings[\"buildGetActiveMemoryIdQuery\"]>(\"buildGetActiveMemoryIdQuery\"),\n  buildGetAgentMemoryQuery: stub<NativeBindings[\"buildGetAgentMemoryQuery\"]>(\"buildGetAgentMemoryQuery\"),\n  buildGetAllAgentMemoryQuery: stub<NativeBindings[\"buildGetAllAgentMemoryQuery\"]>(\"buildGetAllAgentMemoryQuery\"),\n  buildGetAgentMemoryHistoryQuery: stub<NativeBindings[\"buildGetAgentMemoryHistoryQuery\"]>(\"buildGetAgentMemoryHistoryQuery\"),\n  buildGetAgentMemoryRollbackHistoryQuery: stub<NativeBindings[\"buildGetAgentMemoryRollbackHistoryQuery\"]>(\"buildGetAgentMemoryRollbackHistoryQuery\"),\n  buildGetAgentMemoryByIdQuery: stub<NativeBindings[\"buildGetAgentMemoryByIdQuery\"]>(\"buildGetAgentMemoryByIdQuery\"),\n  parseByteArrayField: stub<NativeBindings[\"parseByteArrayField\"]>(\"parseByteArrayField\"),\n  parseMemoryRow: stub<NativeBindings[\"parseMemoryRow\"]>(\"parseMemoryRow\"),\n  parseMemoryRows: stub<NativeBindings[\"parseMemoryRows\"]>(\"parseMemoryRows\"),\n  parseRollbackRow: stub<NativeBindings[\"parseRollbackRow\"]>(\"parseRollbackRow\"),\n  parseRollbackRows: stub<NativeBindings[\"parseRollbackRows\"]>(\"parseRollbackRows\"),\n  parseActiveMemoryId: stub<NativeBindings[\"parseActiveMemoryId\"]>(\"parseActiveMemoryId\"),\n  normalizeActionForHash: stub<NativeBindings[\"normalizeActionForHash\"]>(\"normalizeActionForHash\"),\n  computeActionHash: stub<NativeBindings[\"computeActionHash\"]>(\"computeActionHash\"),\n  claimHashHex: stub<NativeBindings[\"claimHashHex\"]>(\"claimHashHex\"),\n  buildEncryptedToolcallArgs: stub<NativeBindings[\"buildEncryptedToolcallArgs\"]>(\"buildEncryptedToolcallArgs\"),\n  signEncryptedToolCall: stub<NativeBindings[\"signEncryptedToolCall\"]>(\"signEncryptedToolCall\"),\n  OP_ADD_AGENT_MEMORY: \"add_agent_memory\",\n  OP_ROLLBACK_AGENT_MEMORY: \"rollback_agent_memory\",\n  OP_LOG_ENCRYPTED_TOOL_CALL: \"log_encrypted_tool_call\",\n  QUERY_GET_ACTIVE_MEMORY_ID: \"get_active_memory_id\",\n  QUERY_GET_AGENT_MEMORY: \"get_agent_memory\",\n  QUERY_GET_ALL_AGENT_MEMORY: \"get_all_agent_memory\",\n  QUERY_GET_AGENT_MEMORY_HISTORY: \"get_agent_memory_history\",\n  QUERY_GET_AGENT_MEMORY_BY_ID: \"get_agent_memory_by_id\",\n  QUERY_GET_AGENT_MEMORY_ROLLBACK_HISTORY: \"get_agent_memory_rollback_history\",\n  ARG_AGENT_PUBKEY: \"agent_pubkey\",\n  ARG_ID: \"id\",\n};\n","/**\n * Universal random helpers backed by the Web Crypto API — available on\n * Node ≥18 and every modern browser. Avoids importing `node:crypto` so the\n * same source compiles for both the Node and browser bundles.\n */\n\nexport function randomBytes(size: number): Uint8Array {\n  const buf = new Uint8Array(size);\n  globalThis.crypto.getRandomValues(buf);\n  return buf;\n}\n\nexport function randomHex(size: number): string {\n  const buf = randomBytes(size);\n  let hex = \"\";\n  for (let i = 0; i < buf.length; i++) {\n    hex += buf[i].toString(16).padStart(2, \"0\");\n  }\n  return hex;\n}\n","/**\n * Public wire constants — all sourced from the Rust core so every\n * language binding agrees byte-for-byte. To switch dev ↔ prod, edit\n * `core/src/constants.rs` and rebuild the native binding; no edits\n * here are needed.\n */\nimport { native } from \"./native.js\";\n\nexport const DEFAULT_ENDPOINT: string = native.DEFAULT_ENDPOINT;\n\nexport const DEFAULT_CHROMIA_NODE_URLS: readonly string[] = Object.freeze(\n  native.defaultChromiaNodeUrls(),\n);\n\nexport const DEFAULT_BLOCKCHAIN_RID: string = native.DEFAULT_BLOCKCHAIN_RID;\n","/**\n * Internal chain-config plumbing. Maps the `Network` selector type to the\n * known public / private chains. Not part of the public SDK surface — the\n * consumer-facing API is `Network` + `ChainOpts`. This file is consumed\n * internally by the chain resolver and the HTTP client.\n *\n * BRIDs come from the Rust core via NAPI so all language bindings agree\n * byte-for-byte; node URLs are wire constants that live alongside them.\n */\nimport {\n  DEFAULT_BLOCKCHAIN_RID,\n  DEFAULT_CHROMIA_NODE_URLS,\n} from \"./constants.js\";\nimport { native } from \"./native.js\";\nimport type { Network } from \"./types.js\";\n\nconst DEFAULT_PRIVATE_NODE_URLS: readonly string[] = Object.freeze(\n  native.defaultPrivateNodeUrls(),\n);\n\nconst DEFAULT_PRIVATE_BLOCKCHAIN_RID: string =\n  native.DEFAULT_PRIVATE_BLOCKCHAIN_RID;\n\nexport interface ChainConfig {\n  readonly network: Network;\n  readonly blockchainRid: string;\n  readonly nodeUrls: readonly string[];\n}\n\nexport const PUBLIC_CHAIN: ChainConfig = {\n  network: \"public\",\n  blockchainRid: DEFAULT_BLOCKCHAIN_RID,\n  nodeUrls: DEFAULT_CHROMIA_NODE_URLS,\n};\n\nexport const PRIVATE_CHAIN: ChainConfig = {\n  network: \"private\",\n  blockchainRid: DEFAULT_PRIVATE_BLOCKCHAIN_RID,\n  nodeUrls: DEFAULT_PRIVATE_NODE_URLS,\n};\n\nexport function chainForNetwork(network: Network): ChainConfig {\n  return network === \"private\" ? PRIVATE_CHAIN : PUBLIC_CHAIN;\n}\n","/**\n * HKDF (RFC 5869): extract + expand in one step.\n * See {@link https://soatok.blog/2021/11/17/understanding-hkdf/}.\n * @module\n */\nimport { hmac } from './hmac.ts';\nimport { abytes, ahash, anumber, type CHash, clean, type TArg, type TRet } from './utils.ts';\n\n/**\n * HKDF-extract from spec. Less important part. `HKDF-Extract(IKM, salt) -> PRK`\n * Arguments position differs from spec (IKM is first one, since it is not optional)\n * Local validation only checks `hash`; `ikm` / `salt` byte validation is delegated to `hmac()`.\n * @param hash - hash function that would be used (e.g. sha256)\n * @param ikm - input keying material, the initial key\n * @param salt - optional salt value (a non-secret random value)\n * @returns Pseudorandom key derived from input keying material.\n * @example\n * Run the HKDF extract step.\n * ```ts\n * import { extract } from '@noble/hashes/hkdf.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * extract(sha256, new Uint8Array([1, 2, 3]), new Uint8Array([4, 5, 6]));\n * ```\n */\nexport function extract(\n  hash: TArg<CHash>,\n  ikm: TArg<Uint8Array>,\n  salt?: TArg<Uint8Array>\n): TRet<Uint8Array> {\n  ahash(hash);\n  // NOTE: some libraries treat zero-length array as 'not provided';\n  // we don't, since we have undefined as 'not provided'\n  // https://github.com/RustCrypto/KDFs/issues/15\n  if (salt === undefined) salt = new Uint8Array(hash.outputLen);\n  return hmac(hash, salt, ikm);\n}\n\n// Shared mutable scratch byte for the RFC 5869 block counter `N`.\n// Safe to reuse because `expand()` is synchronous and resets it with `clean(...)` before returning.\nconst HKDF_COUNTER = /* @__PURE__ */ Uint8Array.of(0);\n// Shared RFC 5869 empty string for both `info === undefined` and the first-block `T(0)` input.\nconst EMPTY_BUFFER = /* @__PURE__ */ Uint8Array.of();\n\n/**\n * HKDF-expand from the spec. The most important part. `HKDF-Expand(PRK, info, L) -> OKM`\n * @param hash - hash function that would be used (e.g. sha256)\n * @param prk - a pseudorandom key of at least HashLen octets\n *   (usually, the output from the extract step)\n * @param info - optional context and application specific information (can be a zero-length string)\n * @param length - length of output keying material in bytes.\n *   RFC 5869 §2.3 allows `0..255*HashLen`, so `0` returns an empty OKM.\n * @returns Output keying material with the requested length.\n * @throws If the requested output length exceeds the HKDF limit\n *   for the selected hash. {@link Error}\n * @example\n * Run the HKDF expand step.\n * ```ts\n * import { expand } from '@noble/hashes/hkdf.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * expand(sha256, new Uint8Array(32), new Uint8Array([1, 2, 3]), 16);\n * ```\n */\nexport function expand(\n  hash: TArg<CHash>,\n  prk: TArg<Uint8Array>,\n  info?: TArg<Uint8Array>,\n  length: number = 32\n): TRet<Uint8Array> {\n  ahash(hash);\n  anumber(length, 'length');\n  abytes(prk, undefined, 'prk');\n  const olen = hash.outputLen;\n  // RFC 5869 §2.3: PRK is \"a pseudorandom key of at least HashLen octets\".\n  if (prk.length < olen) throw new Error('\"prk\" must be at least HashLen octets');\n  // RFC 5869 §2.3 only bounds `L` by `<= 255*HashLen`; `L=0` is valid and yields empty OKM.\n  if (length > 255 * olen) throw new Error('Length must be <= 255*HashLen');\n  const blocks = Math.ceil(length / olen);\n  if (info === undefined) info = EMPTY_BUFFER;\n  else abytes(info, undefined, 'info');\n  // first L(ength) octets of T\n  const okm = new Uint8Array(blocks * olen);\n  // Re-use HMAC instance between blocks\n  const HMAC = hmac.create(hash, prk);\n  const HMACTmp = HMAC._cloneInto();\n  const T = new Uint8Array(HMAC.outputLen);\n  for (let counter = 0; counter < blocks; counter++) {\n    HKDF_COUNTER[0] = counter + 1;\n    // T(0) = empty string (zero length)\n    // T(N) = HMAC-Hash(PRK, T(N-1) | info | N)\n    HMACTmp.update(counter === 0 ? EMPTY_BUFFER : T)\n      .update(info)\n      .update(HKDF_COUNTER)\n      .digestInto(T);\n    okm.set(T, olen * counter);\n    HMAC._cloneInto(HMACTmp);\n  }\n  HMAC.destroy();\n  HMACTmp.destroy();\n  clean(T, HKDF_COUNTER);\n  return okm.slice(0, length) as TRet<Uint8Array>;\n}\n\n/**\n * HKDF (RFC 5869): derive keys from an initial input.\n * Combines hkdf_extract + hkdf_expand in one step\n * @param hash - hash function that would be used (e.g. sha256)\n * @param ikm - input keying material, the initial key\n * @param salt - optional salt value (a non-secret random value)\n * @param info - optional context and application specific information bytes\n * @param length - length of output keying material in bytes.\n *   RFC 5869 §2.3 allows `0..255*HashLen`, so `0` returns an empty OKM.\n * @returns Output keying material derived from the input key.\n * @throws If the requested output length exceeds the HKDF limit\n *   for the selected hash. {@link Error}\n * @example\n * HKDF (RFC 5869): derive keys from an initial input.\n * ```ts\n * import { hkdf } from '@noble/hashes/hkdf.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * import { randomBytes, utf8ToBytes } from '@noble/hashes/utils.js';\n * const inputKey = randomBytes(32);\n * const salt = randomBytes(32);\n * const info = utf8ToBytes('application-key');\n * const okm = hkdf(sha256, inputKey, salt, info, 32);\n * ```\n */\nexport const hkdf = (\n  hash: TArg<CHash>,\n  ikm: TArg<Uint8Array>,\n  salt: TArg<Uint8Array | undefined>,\n  info: TArg<Uint8Array | undefined>,\n  length: number\n): TRet<Uint8Array> => expand(hash, extract(hash, ikm, salt), info, length);\n","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */\nexport function aarray(item, title, inner = () => { }) {\n    if (!Array.isArray(item))\n        throw new TypeError(`\"${title}\" expected array, got type=${typeof item}`);\n    for (let i = 0; i < item.length; i++)\n        inner(item[i], `${title}[${i}]`);\n    return item;\n}\n/**\n * Checks if something is Uint8Array. Be careful: nodejs Buffer will return true.\n * @param a - Value to inspect.\n * @returns `true` when the value is a Uint8Array view, including Node's `Buffer`.\n * @example\n * Guards a value before treating it as raw key material.\n *\n * ```ts\n * isBytes(new Uint8Array());\n * ```\n */\nexport function isBytes(a) {\n    // Plain `instanceof Uint8Array` is too strict for some Buffer / proxy /\n    // cross-realm cases. The fallback still requires a real ArrayBuffer view\n    // so plain JSON-deserialized `{ constructor: ... }`\n    // spoofing is rejected, and `BYTES_PER_ELEMENT === 1` keeps the fallback on byte-oriented views.\n    return (a instanceof Uint8Array ||\n        (ArrayBuffer.isView(a) &&\n            a.constructor.name === 'Uint8Array' &&\n            'BYTES_PER_ELEMENT' in a &&\n            a.BYTES_PER_ELEMENT === 1));\n}\n// Shared error-message prefix builder. Only called on throw paths, so assert\n// success paths never pay for the string concatenation.\nconst atitle = (title) => (title ? `\"${title}\" ` : '');\n/**\n * Asserts something is boolean.\n * @param value - Value to validate.\n * @returns The validated boolean.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validates a boolean option before branching on it.\n *\n * ```ts\n * abool(true);\n * ```\n */\nexport function abool(value, title = '') {\n    if (typeof value !== 'boolean')\n        throw new TypeError(atitle(title) + 'expected boolean, got type=' + typeof value);\n    return value;\n}\n/**\n * Asserts something is a non-negative safe integer.\n * @param n - Value to validate.\n * @returns The validated number.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validates a non-negative length or counter.\n *\n * ```ts\n * anumber(1);\n * ```\n */\nexport function anumber(n, title = '') {\n    if (typeof n !== 'number')\n        throw new TypeError(atitle(title) + 'expected number, got ' + typeof n);\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new RangeError(atitle(title) + 'expected integer >= 0, got ' + n);\n    return n;\n}\n/**\n * Asserts something is Uint8Array.\n * @param value - Value to validate.\n * @param length - Expected byte length.\n * @param title - Optional label used in error messages.\n * @returns The validated byte array.\n * On Node, `Buffer` is accepted too because it is a Uint8Array view.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument lengths. {@link RangeError}\n * @example\n * Validates a fixed-length nonce or key buffer.\n *\n * ```ts\n * abytes(new Uint8Array([1, 2]), 2);\n * ```\n */\nexport function abytes(value, length, title = '') {\n    // Success path first: this runs at the start of every update() / digestInto(), and the\n    // common `abytes(data)` form must not pay for length handling it does not use.\n    if (isBytes(value) && (length === undefined || value.length === length))\n        return value;\n    // Error path: recompute freely to build the exact message.\n    if (length !== undefined)\n        anumber(length, 'length');\n    const bytes = isBytes(value);\n    const ofLen = length !== undefined ? ` of length ${length}` : '';\n    const got = bytes ? `length=${value.length}` : `type=${typeof value}`;\n    const message = atitle(title) + 'expected Uint8Array' + ofLen + ', got ' + got;\n    if (!bytes)\n        throw new TypeError(message);\n    throw new RangeError(message);\n}\nconst aobject = (value, label) => {\n    if (value === null || typeof value !== 'object' || Array.isArray(value))\n        throw new TypeError(label === 'object'\n            ? 'expected valid options object'\n            : `\"${label}\" expected object, got type=${typeof value}`);\n};\n/**\n * Asserts a hash- or MAC-like instance has not been destroyed or finished.\n * @param instance - Stateful instance to validate.\n * @param checkFinished - Whether to reject finished instances.\n * When `false`, only `destroyed` is checked.\n * @throws If the hash instance has already been destroyed or finalized. {@link Error}\n * @example\n * Guards against calling `update()` or `digest()` on a finished hash.\n *\n * ```ts\n * aexists({ destroyed: false, finished: false });\n * ```\n */\nexport function aexists(instance, checkFinished = true) {\n    // Runs on every update()/digestInto(); the flags are library-owned booleans, so only their\n    // truthiness is checked - re-validating their type per call was pure hot-path overhead.\n    if (instance.destroyed)\n        throw new Error('hash was destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('digest() was already called');\n}\n/**\n * Asserts output is a sufficiently-sized byte array.\n * @param out - Output buffer to validate.\n * @param instance - Hash-like instance providing `outputLen`.\n * This is the relaxed `digestInto()`-style contract: output must be at least `outputLen`,\n * unlike one-shot cipher helpers elsewhere in the repo that often require exact lengths.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong output buffer lengths. {@link RangeError}\n * @example\n * Verifies that a caller-provided output buffer is large enough.\n *\n * ```ts\n * aoutput(new Uint8Array(16), { outputLen: 16 });\n * ```\n */\nexport function aoutput(out, instance) {\n    abytes(out, undefined, 'output');\n    // `outputLen` is a library-owned readonly number; the negated comparison keeps failing fast\n    // when it is missing/NaN (comparisons with undefined/NaN are false) without an anumber() call.\n    const min = instance.outputLen;\n    if (!(out.length >= min)) {\n        throw new RangeError('\"output\" expected length >= ' + min);\n    }\n}\n/**\n * Asserts output is a sufficiently-sized, 4-byte-aligned byte array.\n * {@link aoutput} plus an {@link isAligned32} check, for `digestInto()` paths\n * that write through zero-allocation `u32` word views.\n * @param out - Output buffer to validate.\n * @param instance - Hash-like instance providing `outputLen`.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong output buffer lengths. {@link RangeError}\n * @throws On wrong output buffer alignment. {@link Error}\n * @example\n * Verifies that a caller-provided output buffer is large enough and aligned.\n *\n * ```ts\n * aoutput32(new Uint8Array(16), { outputLen: 16 });\n * ```\n */\nexport function aoutput32(out, instance) {\n    aoutput(out, instance);\n    if (!isAligned32(out))\n        throw new Error('invalid output, must be aligned');\n}\n/**\n * Casts a typed-array view to Uint8Array.\n * @param arr - Typed-array view to reinterpret.\n * @returns Uint8Array view over the same bytes.\n * @example\n * Views 32-bit words as raw bytes without copying.\n *\n * ```ts\n * u8(new Uint32Array([1]));\n * ```\n */\nexport function u8(arr) {\n    return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/**\n * Casts a typed-array view to Uint32Array.\n * @param arr - Typed-array view to reinterpret.\n * @returns Uint32Array view over the same bytes. Callers are expected to provide a\n * 4-byte-aligned offset; trailing `1..3` bytes are silently dropped.\n * @example\n * Views a byte buffer as 32-bit words for block processing.\n *\n * ```ts\n * u32(new Uint8Array(4));\n * ```\n */\nexport function u32(arr) {\n    return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/**\n * Zeroizes typed arrays in place.\n * Warning: JS provides no guarantees.\n * @param arrays - Arrays to wipe.\n * @example\n * Wipes a temporary key buffer after use.\n *\n * ```ts\n * const bytes = new Uint8Array([1]);\n * clean(bytes);\n * ```\n */\nexport function clean(...arrays) {\n    for (let i = 0; i < arrays.length; i++) {\n        arrays[i].fill(0);\n    }\n}\n/**\n * Creates a DataView for byte-level manipulation.\n * @param arr - Typed-array view to wrap.\n * @returns DataView over the same bytes.\n * @example\n * Creates an endian-aware view for length encoding.\n *\n * ```ts\n * createView(new Uint8Array(4));\n * ```\n */\nexport function createView(arr) {\n    return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/**\n * Whether the current platform is little-endian.\n * Most are; some IBM systems are not.\n */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/**\n * Reverses byte order of one 32-bit word.\n * @param word - Unsigned 32-bit word to swap.\n * @returns The same word with bytes reversed.\n * @example\n * Swaps a big-endian word into little-endian byte order.\n *\n * ```ts\n * byteSwap(0x11223344);\n * ```\n */\nexport function byteSwap(word) {\n    return (((word << 24) & 0xff000000) |\n        ((word << 8) & 0xff0000) |\n        ((word >>> 8) & 0xff00) |\n        ((word >>> 24) & 0xff));\n}\n/**\n * Normalizes one 32-bit word to the little-endian representation expected by cipher cores.\n * @param n - Unsigned 32-bit word to normalize.\n * @returns Little-endian normalized word on big-endian hosts, else the input word unchanged.\n * @example\n * Normalizes a host-endian word before passing it into an ARX/AES core.\n *\n * ```ts\n * swap8IfBE(0x11223344);\n * ```\n */\nexport const swap8IfBE = isLE\n    ? (n) => n\n    : (n) => byteSwap(n) >>> 0;\n/**\n * Byte-swaps every word of a Uint32Array in place.\n * @param arr - Uint32Array whose words should be swapped.\n * @returns The same array after in-place byte swapping.\n * @example\n * Swaps every 32-bit word in a word-view buffer.\n *\n * ```ts\n * byteSwap32(new Uint32Array([0x11223344]));\n * ```\n */\nexport function byteSwap32(arr) {\n    for (let i = 0; i < arr.length; i++) {\n        arr[i] = byteSwap(arr[i]);\n    }\n    return arr;\n}\n/**\n * Normalizes a Uint32Array view to the little-endian representation expected by cipher cores.\n * @param u - Word view to normalize in place.\n * @returns Little-endian normalized word view.\n * @example\n * Normalizes a word-view buffer before block processing.\n *\n * ```ts\n * swap32IfBE(new Uint32Array([0x11223344]));\n * ```\n */\nexport const swap32IfBE = isLE\n    ? (u) => u\n    : byteSwap32;\n// Built-in hex conversion:\n// {@link https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex | caniuse entry}\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 * @param bytes - Bytes to encode.\n * @returns Lowercase hexadecimal string.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Formats ciphertext bytes for logs or test vectors.\n *\n * ```ts\n * bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])); // 'cafe0123'\n * ```\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// Strict ASCII nibble parser: non-ASCII hex lookalikes are rejected as undefined.\n// ASCII codes: '0'..'9' = 48..57, 'A'..'F' = 65..70, 'a'..'f' = 97..102.\n// prettier-ignore\nfunction asciiToBase16(ch) {\n    return ch >= 48 && ch <= 57 ? ch - 48 // '2' => 50-48\n        : ch >= 65 && ch <= 70 ? ch - (65 - 10) // 'B' => 66-(65-10)\n            : ch >= 97 && ch <= 102 ? ch - (97 - 10) // 'b' => 98-(97-10)\n                : undefined;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @param hex - hexadecimal string to decode\n * @returns Decoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Decode lowercase hexadecimal into bytes.\n * ```ts\n * hexToBytes('cafe0123'); // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n * ```\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new TypeError('hex string expected, got ' + typeof hex);\n    if (hasHexBuiltin) {\n        try {\n            return Uint8Array.fromHex(hex);\n        }\n        catch (error) {\n            if (error instanceof SyntaxError)\n                throw new RangeError(error.message);\n            throw error;\n        }\n    }\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new RangeError('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)); // parse first char, multiply it by 16\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1)); // parse second char\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new RangeError('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2; // example: 'A9' => 10*16 + 9\n    }\n    return array;\n}\nconst _0n = /* @__PURE__ */ BigInt(0);\n// Used in ff1, via bytesToNumberBE\n/**\n * Converts a big-endian hex string into bigint.\n * @param hex - Hexadecimal string without `0x`.\n * @returns Parsed bigint value. The empty string is treated as `0n`.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Parses a big-endian field element or counter from hex.\n *\n * ```ts\n * hexToNumber('ff');\n * ```\n */\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new TypeError('hex string expected, got ' + typeof hex);\n    // Numeric parser, not byte-hex decoder: odd-length forms like 'f' are valid,\n    // and malformed syntax follows BigInt's native error behavior.\n    return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n// Used in ff1\n// BE: Big Endian, LE: Little Endian\n/**\n * Converts big-endian bytes into bigint.\n * @param bytes - Big-endian bytes.\n * @returns Parsed bigint value. Empty input is treated as `0n`.\n * @throws On invalid byte input passed to the internal hex conversion. {@link TypeError}\n * @example\n * Reads a big-endian integer from serialized bytes.\n *\n * ```ts\n * bytesToNumberBE(new Uint8Array([1, 0]));\n * ```\n */\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\n/**\n * Validates that a value is a non-negative bigint or safe integer.\n * @param n - Value to validate.\n * @returns The same validated value.\n * @throws On wrong argument ranges or values. {@link RangeError}\n */\nfunction abignumber(n) {\n    if (typeof n === 'bigint') {\n        if (!(_0n <= n))\n            throw new RangeError('positive bigint expected, got ' + n);\n    }\n    else\n        anumber(n);\n    return n;\n}\n// Used in ff1\n/**\n * Converts a number into big-endian bytes of fixed length.\n * @param n - Number to encode.\n * @param len - Output length in bytes. Must be greater than zero.\n * @returns Big-endian bytes padded to `len`.\n * Negative values, `len = 0`, and values that do not fit are rejected before\n * downstream hex parsing.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If a documented runtime validation or state check fails. {@link Error}\n * @example\n * Encodes a counter as fixed-width big-endian bytes.\n *\n * ```ts\n * numberToBytesBE(1, 2);\n * ```\n */\nexport function numberToBytesBE(n, len) {\n    anumber(len);\n    if (len === 0)\n        throw new Error('zero output length is invalid');\n    n = abignumber(n);\n    const expectedLen = len * 2;\n    const hex = n.toString(16);\n    // Detect overflow before hex parsing so oversized values don't leak the shared odd-hex error.\n    if (hex.length > expectedLen)\n        throw new RangeError('number is too large');\n    return hexToBytes(hex.padStart(expectedLen, '0'));\n}\n/**\n * Converts string to bytes using UTF8 encoding.\n * @param str - String to encode.\n * @returns UTF-8 bytes in a detached fresh Uint8Array copy.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Encodes application text before encryption or MACing.\n *\n * ```ts\n * utf8ToBytes('abc'); // new Uint8Array([97, 98, 99])\n * ```\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new TypeError('string expected');\n    return new Uint8Array(new TextEncoder().encode(str)); // {@link https://bugzil.la/1681809 | Firefox bug 1681809}\n}\n/**\n * Converts bytes to string using UTF8 encoding.\n * @param bytes - UTF-8 bytes.\n * @returns Decoded string. Input validation is delegated to `TextDecoder`, and malformed\n * UTF-8 is replacement-decoded instead of rejected.\n * @example\n * Decodes UTF-8 plaintext back into a string.\n *\n * ```ts\n * bytesToUtf8(new Uint8Array([97, 98, 99])); // 'abc'\n * ```\n */\nexport function bytesToUtf8(bytes) {\n    return new TextDecoder().decode(bytes);\n}\n/**\n * Checks if two U8A use same underlying buffer and overlaps.\n * This is invalid and can corrupt data.\n * @param a - First byte view.\n * @param b - Second byte view.\n * @returns `true` when the views overlap in memory.\n * @example\n * Detects whether two slices alias the same backing buffer.\n *\n * ```ts\n * overlapBytes(new Uint8Array(4), new Uint8Array(4));\n * ```\n */\nexport function overlapBytes(a, b) {\n    // Zero-length views cannot overwrite anything, even if their offset sits inside another range.\n    if (!a.byteLength || !b.byteLength)\n        return false;\n    return (a.buffer === b.buffer && // best we can do, may fail with an obscure Proxy\n        a.byteOffset < b.byteOffset + b.byteLength && // a starts before b end\n        b.byteOffset < a.byteOffset + a.byteLength // b starts before a end\n    );\n}\n/**\n * If input and output overlap and input starts before output, we will overwrite end of input before\n * we start processing it, so this is not supported for most ciphers\n * (except chacha/salsa, which were designed for this)\n * @param input - Input bytes.\n * @param output - Output bytes.\n * @throws If the output view would overwrite unread input bytes. {@link Error}\n * @example\n * Rejects an in-place layout that would overwrite unread input bytes.\n *\n * ```ts\n * complexOverlapBytes(new Uint8Array(4), new Uint8Array(4));\n * ```\n */\nexport function complexOverlapBytes(input, output) {\n    // This is very cursed. It works somehow, but I'm completely unsure,\n    // reasoning about overlapping aligned windows is very hard.\n    if (overlapBytes(input, output) && input.byteOffset < output.byteOffset)\n        throw new Error('complex overlap of input and output is not supported');\n}\n/**\n * Copies several Uint8Arrays into one.\n * @param arrays - Byte arrays to concatenate.\n * @returns Combined byte array.\n * @throws On wrong argument types inside the byte-array list. {@link TypeError}\n * @example\n * Builds a `nonce || ciphertext` style buffer.\n *\n * ```ts\n * concatBytes(new Uint8Array([1]), new Uint8Array([2]));\n * ```\n */\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/**\n * Merges user options into defaults.\n * @param defaults - Default option values.\n * @param opts - User-provided overrides.\n * @returns Combined options object.\n * `defaults` is a library-owned mutable object; user-provided `opts` only need to be\n * object-shaped, since \"plain object\" checks reject valid proxy/cross-realm containers.\n * The merge mutates `defaults` in place and returns the same object, so direct callers\n * should pass a fresh defaults object unless they intentionally want shared state updated.\n * @throws If options are missing or not an object. {@link Error}\n * @example\n * Applies user overrides to the default cipher options.\n *\n * ```ts\n * checkOpts({ rounds: 20 }, { rounds: 8 });\n * ```\n */\nexport function checkOpts(defaults, opts) {\n    aobject(defaults, 'defaults');\n    aobject(opts, 'opts');\n    // Mutates defaults by design. __proto__ follows Object.assign semantics here and can only\n    // affect this local option object; callers already control this low-level options surface.\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\n/**\n * Compares two byte arrays in kinda constant time once lengths already match.\n * @param a - First byte array.\n * @param b - Second byte array.\n * @returns `true` when the arrays contain the same bytes. Different lengths still return early.\n * @example\n * Compares an expected authentication tag with the received one.\n *\n * ```ts\n * equalBytes(new Uint8Array([1]), new Uint8Array([1]));\n * ```\n */\nexport function equalBytes(a, b) {\n    a = abytes(a);\n    b = abytes(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 * Wraps a keyed MAC constructor into a one-shot helper with `.create()`.\n * @param keyLen - Valid probe-key length used to read static metadata once.\n * The probe key is only used for `outputLen` / `blockLen`, so callers with several valid key sizes\n * can pass any representative size as long as those values stay fixed.\n * @param macCons - Keyed MAC constructor or factory.\n * @param fromMsg - Optional adapter that derives extra constructor args from the one-shot message.\n * @returns Callable MAC helper with `.create()`.\n */\nexport function wrapMacConstructor(keyLen, macCons, fromMsg) {\n    const mac = macCons;\n    const getArgs = (fromMsg || (() => []));\n    const macC = (msg, key) => mac(key, ...getArgs(msg))\n        .update(msg)\n        .digest();\n    const tmp = mac(new Uint8Array(keyLen), ...getArgs(new Uint8Array(0)));\n    macC.outputLen = tmp.outputLen;\n    macC.blockLen = tmp.blockLen;\n    macC.create = (key, ...args) => mac(key, ...args);\n    return macC;\n}\n/**\n * Wraps a cipher: validates args, ensures encrypt() can only be called once.\n * Used internally by the exported cipher constructors.\n * Output-buffer support is inferred from the wrapped `encrypt` / `decrypt`\n * arity (`fn.length === 2`), so wrapped output-capable methods must use a normal\n * second parameter, not a default/rest parameter. AAD support is explicit in\n * `params.withAAD`; optional AAD starts after the nonce slot when one is present.\n * @__NO_SIDE_EFFECTS__\n * @param params - Static cipher metadata. See {@link CipherParams}.\n * @param constructor - Cipher constructor.\n * @returns Wrapped constructor with validation.\n */\nexport const wrapCipher = (params, constructor) => {\n    function wrappedCipher(key, ...args) {\n        // Validate key\n        abytes(key, undefined, 'key');\n        // Validate nonce if nonceLength is present\n        if (params.nonceLength !== undefined) {\n            const nonce = args[0];\n            abytes(nonce, params.varSizeNonce ? undefined : params.nonceLength, 'nonce');\n        }\n        // Keep tag length available for decrypt-size checks after constructor validation.\n        const tagl = params.tagLength;\n        const aadStart = params.nonceLength !== undefined ? 1 : 0;\n        // No-AAD constructors otherwise silently ignore byte args meant as AAD.\n        if (!params.withAAD) {\n            for (let i = aadStart; i < args.length; i++)\n                if (isBytes(args[i]))\n                    throw new Error('AAD not supported');\n        }\n        // Validate the first AAD slot early; rest-arg AAD constructors validate the tail themselves.\n        if (params.withAAD && args[aadStart] !== undefined)\n            abytes(args[aadStart], undefined, 'AAD');\n        const cipher = constructor(key, ...args);\n        const checkOutput = (fnLength, output) => {\n            if (output !== undefined) {\n                if (fnLength !== 2)\n                    throw new Error('cipher output not supported');\n                abytes(output, undefined, 'output');\n            }\n        };\n        // Create wrapped cipher with validation and single-use encryption\n        let called = false;\n        const wrCipher = {\n            encrypt(data, output) {\n                if (called)\n                    throw new Error('cannot encrypt() twice with same key + nonce');\n                // Any encrypt attempt consumes the instance, even if validation rejects below.\n                called = true;\n                abytes(data, undefined, 'data');\n                checkOutput(cipher.encrypt.length, output);\n                return cipher.encrypt(data, output);\n            },\n            decrypt(data, output) {\n                abytes(data, undefined, 'data');\n                if (tagl && data.length < tagl)\n                    throw new Error('\"ciphertext\" expected length >= tagLength=' + tagl);\n                checkOutput(cipher.decrypt.length, output);\n                return cipher.decrypt(data, output);\n            },\n        };\n        return wrCipher;\n    }\n    Object.assign(wrappedCipher, params);\n    return wrappedCipher;\n};\n/**\n * By default, returns u8a of length.\n * When out is available, it checks it for validity and uses it.\n * @param expectedLength - Required output length.\n * @param out - Optional destination buffer.\n * @param onlyAligned - Whether `out` must be 4-byte aligned.\n * @returns Output buffer ready for writing.\n * @throws On wrong argument types. {@link TypeError}\n * @throws If the provided output buffer has the wrong size. {@link RangeError}\n * @throws If the provided output buffer has the wrong alignment. {@link Error}\n * @example\n * Reuses a caller-provided output buffer when lengths match.\n *\n * ```ts\n * getOutput(16, new Uint8Array(16));\n * ```\n */\nexport function getOutput(expectedLength, out, onlyAligned = true) {\n    if (out === undefined)\n        return new Uint8Array(expectedLength);\n    // Keep Buffer/cross-realm Uint8Array support here instead of trusting a shape-compatible object.\n    abytes(out, expectedLength, 'output');\n    if (onlyAligned && !isAligned32(out))\n        throw new Error('invalid output, must be aligned');\n    return out;\n}\n/**\n * Encodes data and AAD lengths into a 16-byte buffer.\n * @param dataLength - Data length. Units are caller-defined: GCM passes bit\n * lengths, ChaCha20-Poly1305 passes byte lengths — the helper writes the raw values.\n * @param aadLength - AAD length, same unit convention as `dataLength`.\n * The serialized block is still `aadLength || dataLength`, matching GCM/Poly1305\n * conventions even though the helper parameter order is `(dataLength, aadLength)`.\n * @param isLE - Whether to encode lengths as little-endian.\n * @returns 16-byte length block.\n * @throws On wrong argument types passed to the endian validator. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Builds the length block appended by GCM and Poly1305.\n *\n * ```ts\n * u64Lengths(16, 8, true);\n * ```\n */\nexport function u64Lengths(dataLength, aadLength, isLE) {\n    // Reject coercible non-number lengths like '10' and true before BigInt(...) accepts them.\n    anumber(dataLength);\n    anumber(aadLength);\n    abool(isLE);\n    const num = new Uint8Array(16);\n    const view = createView(num);\n    view.setBigUint64(0, BigInt(aadLength), isLE);\n    view.setBigUint64(8, BigInt(dataLength), isLE);\n    return num;\n}\n/**\n * Checks whether a byte array is aligned to a 4-byte offset.\n * @param bytes - Byte array to inspect.\n * @returns `true` when the view is 4-byte aligned.\n * @example\n * Checks whether a buffer can be safely viewed as Uint32Array.\n *\n * ```ts\n * isAligned32(new Uint8Array(4));\n * ```\n */\nexport function isAligned32(bytes) {\n    return bytes.byteOffset % 4 === 0;\n}\n/**\n * Copies bytes into a new Uint8Array.\n * @param bytes - Bytes to copy.\n * @returns Copied byte array.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Copies input into an aligned Uint8Array before block processing.\n *\n * ```ts\n * copyBytes(new Uint8Array([1, 2]));\n * ```\n */\nexport function copyBytes(bytes) {\n    // `Uint8Array.from(...)` would also accept arrays / other typed arrays. Keep this helper strict\n    // because callers use it at byte-validation boundaries before mutating the detached copy.\n    return Uint8Array.from(abytes(bytes));\n}\n/**\n * Cryptographically secure PRNG backed by `crypto.getRandomValues`.\n * @param bytesLength - number of random bytes to generate\n * @returns Random bytes.\n * The platform `getRandomValues()` implementation still defines any\n * single-call length cap, and this helper rejects oversize requests\n * with a stable library `RangeError` instead of host-specific errors.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If the current runtime does not provide `crypto.getRandomValues`. {@link Error}\n * @example\n * Generate a fresh random key or nonce.\n * ```ts\n * const key = randomBytes(16);\n * ```\n */\nexport function randomBytes(bytesLength = 32) {\n    // Match the repo's other length-taking helpers instead of relying on Uint8Array coercion.\n    anumber(bytesLength, 'bytesLength');\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    // Web Cryptography API Level 2 §10.1.1:\n    // if `byteLength > 65536`, throw `QuotaExceededError`.\n    // Keep the guard explicit so callers can see the quota in code\n    // instead of discovering it by reading the spec or host errors.\n    // This wrapper surfaces the same quota as a stable library RangeError.\n    if (bytesLength > 65536)\n        throw new RangeError(`\"bytesLength\" expected <= 65536, got ${bytesLength}`);\n    return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n/**\n * Uses CSPRNG for nonce, nonce injected in ciphertext.\n * For `encrypt`, a `nonceBytes`-length buffer is fetched from CSPRNG and\n * prepended to encrypted ciphertext. For `decrypt`, first `nonceBytes` of ciphertext\n * are treated as nonce. The wrapper always allocates a fresh `nonce || ciphertext`\n * buffer on encrypt and intentionally does not support caller-provided destination buffers.\n * Too-short decrypt inputs are split into short/empty nonce views and then delegated\n * to the wrapped cipher instead of being rejected here first.\n *\n * NOTE: Under the same key, using random nonces (e.g. `managedNonce`) with AES-GCM and ChaCha\n * should be limited to `2**23` (8M) messages to get a collision chance of\n * `2**-50`. Stretching to `2**32` (4B) messages would raise that chance to\n * `2**-33`, still negligible but creeping up.\n * @param fn - Cipher constructor that expects a nonce.\n * @param randomBytes_ - Random-byte source used for nonce generation.\n * @returns Cipher constructor that prepends the nonce to ciphertext.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On invalid nonce lengths observed at wrapper construction or use. {@link RangeError}\n * @example\n * Prepends a fresh random nonce to every ciphertext.\n *\n * ```ts\n * import { gcm } from '@noble/ciphers/aes.js';\n * import { managedNonce, randomBytes } from '@noble/ciphers/utils.js';\n * const wrapped = managedNonce(gcm);\n * const key = randomBytes(16);\n * const ciphertext = wrapped(key).encrypt(new Uint8Array([1, 2, 3]));\n * wrapped(key).decrypt(ciphertext);\n * ```\n */\nexport function managedNonce(fn, randomBytes_ = randomBytes) {\n    if (typeof fn !== 'function')\n        throw new TypeError('\"fn\" expected cipher constructor, got type=' + typeof fn);\n    if (typeof randomBytes_ !== 'function')\n        throw new TypeError('\"randomBytes_\" expected function, got type=' + typeof randomBytes_);\n    const { nonceLength } = fn;\n    anumber(nonceLength, 'fn.nonceLength');\n    const addNonce = (nonce, ciphertext, plaintext) => {\n        const out = concatBytes(nonce, ciphertext);\n        // Wrapped ciphers may alias caller plaintext on encrypt(); never zero\n        // caller-owned buffers here.\n        if (!overlapBytes(plaintext, ciphertext))\n            ciphertext.fill(0);\n        return out;\n    };\n    // NOTE: we cannot support DST here, it would be mistake:\n    // - we don't know how much dst length cipher requires\n    // - nonce may unalign dst and break everything\n    // - we create new u8a anyway (concatBytes)\n    // - previously we passed all args to cipher, but that was mistake!\n    const res = ((key, ...args) => ({\n        encrypt(plaintext) {\n            abytes(plaintext, undefined, 'data');\n            const nonce = randomBytes_(nonceLength);\n            const encrypted = fn(key, nonce, ...args).encrypt(plaintext);\n            // @ts-ignore\n            if (encrypted instanceof Promise)\n                return encrypted.then((ct) => addNonce(nonce, ct, plaintext));\n            return addNonce(nonce, encrypted, plaintext);\n        },\n        decrypt(ciphertext) {\n            abytes(ciphertext, undefined, 'data');\n            const nonce = ciphertext.subarray(0, nonceLength);\n            const decrypted = ciphertext.subarray(nonceLength);\n            return fn(key, nonce, ...args).decrypt(decrypted);\n        },\n    }));\n    // Auto-nonce wrappers still preserve the wrapped payload geometry.\n    if ('blockSize' in fn)\n        res.blockSize = fn.blockSize;\n    if ('tagLength' in fn)\n        res.tagLength = fn.tagLength;\n    if ('withAAD' in fn)\n        res.withAAD = fn.withAAD;\n    return res;\n}\n","/**\n * GHash from AES-GCM and its little-endian \"mirror image\" Polyval from AES-SIV.\n *\n * Implemented in terms of GHash with conversion function for keys\n * GCM GHASH from\n * {@link https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-38d.pdf | NIST SP800-38d},\n * SIV from\n * {@link https://www.rfc-editor.org/rfc/rfc8452 | RFC 8452}.\n *\n * GHASH   modulo: x^128 + x^7   + x^2   + x     + 1\n * POLYVAL modulo: x^128 + x^127 + x^126 + x^121 + 1\n *\n * @module\n */\nimport { abytes, aexists, aoutput32, clean, copyBytes, createView, isLE, swap32IfBE, swap8IfBE, u32, wrapMacConstructor, } from \"./utils.js\";\nconst BLOCK_SIZE = 16;\n// TODO: rewrite\n// temporary padding buffer\n// ZEROS32 aliases these bytes, so clean(ZEROS32) also resets this shared tail-padding scratch.\nconst ZEROS16 = /* @__PURE__ */ new Uint8Array(16);\nconst ZEROS32 = /* @__PURE__ */ u32(ZEROS16);\n// GHASH reduces modulo x^128 + x^7 + x^2 + x + 1, so the low-degree terms\n// x^7 + x^2 + x + 1 become bits `11100001` = 0xe1 in R = 0xe1 || 0^120.\nconst POLY = 0xe1;\n// v = 2*v % POLY\n// NOTE: because x + x = 0 (add/sub is same), mul2(x) != x+x\n// Montgomery ladder can multiply any field element with this doubling step;\n// addition stays simple xor.\nconst mul2 = (s0, s1, s2, s3) => {\n    const hiBit = s3 & 1;\n    return {\n        s3: (s2 << 31) | (s3 >>> 1),\n        s2: (s1 << 31) | (s2 >>> 1),\n        s1: (s0 << 31) | (s1 >>> 1),\n        // NIST SP 800-38D §6.3 applies `V >> 1` and XORs R on carry. In this\n        // 4x32-bit split, R = 0xe1 || 0^120 lives in the top byte of s0.\n        s0: (s0 >>> 1) ^ ((POLY << 24) & -(hiBit & 1)), // reduce % poly\n    };\n};\n// Per-word part of RFC 8452 `ByteReverse`; callers also reverse the 32-bit word order.\nconst swapLE = (n) => (((n >>> 0) & 0xff) << 24) |\n    (((n >>> 8) & 0xff) << 16) |\n    (((n >>> 16) & 0xff) << 8) |\n    ((n >>> 24) & 0xff) |\n    0;\n// POLYVAL first applies RFC 8452's per-word byte reversal, then re-normalizes\n// host-endian u32 loads to the little-endian word value `_updateBlock()` expects.\nconst swap8IfLE = (n) => swap8IfBE(swapLE(n));\n/**\n * `mulX_GHASH(ByteReverse(H))` from RFC 8452 Appendix A.\n * @param k mutated in place\n */\nexport function _toGHASHKey(k) {\n    // The input is the original POLYVAL key H; reverse() materializes\n    // RFC 8452's `ByteReverse(H)` before the GHASH mulX step.\n    k.reverse();\n    const hiBit = k[15] & 1;\n    // k >>= 1\n    let carry = 0;\n    for (let i = 0; i < k.length; i++) {\n        const t = k[i];\n        k[i] = (t >>> 1) | carry;\n        carry = (t & 1) << 7;\n    }\n    k[0] ^= -hiBit & 0xe1; // if (hiBit) n ^= 0xe1000000000000000000000000000000;\n    return k;\n}\n// Precompute-window heuristic only: larger inputs trade memory for fewer table lookups.\n// Any caller-provided length hint still collapses to one of the supported windows {2, 4, 8}.\nconst estimateWindow = (bytes) => {\n    if (bytes > 64 * 1024)\n        return 8;\n    if (bytes > 1024)\n        return 4;\n    return 2;\n};\n/**\n * Incremental GHASH state for AES-GCM.\n * @param key - 16-byte GHASH key.\n * @param expectedLength - Expected message length for table sizing.\n * Chunking is segment-based, not hash-streaming: every `update()` call is zero-padded\n * to the next 16-byte boundary before it is absorbed. This matches the internal AES/GCM\n * use where AAD, payload, and length block are separate padded segments.\n * @example\n * Feeds one ciphertext block into an incremental GHASH state with a fresh hash key.\n *\n * ```ts\n * import { GHASH } from '@noble/ciphers/_polyval.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * const mac = new GHASH(key);\n * mac.update(new Uint8Array(16));\n * mac.digest();\n * ```\n */\nexport class GHASH {\n    blockLen = BLOCK_SIZE;\n    outputLen = BLOCK_SIZE;\n    s0 = 0;\n    s1 = 0;\n    s2 = 0;\n    s3 = 0;\n    finished = false;\n    destroyed = false;\n    t;\n    W;\n    windowSize;\n    // We select bits per window adaptively based on expectedLength\n    constructor(key, expectedLength) {\n        abytes(key, 16, 'key');\n        key = copyBytes(key);\n        const kView = createView(key);\n        let k0 = kView.getUint32(0, false);\n        let k1 = kView.getUint32(4, false);\n        let k2 = kView.getUint32(8, false);\n        let k3 = kView.getUint32(12, false);\n        // generate table of doubled keys (half of montgomery ladder)\n        const doubles = [];\n        for (let i = 0; i < 128; i++) {\n            doubles.push({ s0: swapLE(k0), s1: swapLE(k1), s2: swapLE(k2), s3: swapLE(k3) });\n            ({ s0: k0, s1: k1, s2: k2, s3: k3 } = mul2(k0, k1, k2, k3));\n        }\n        const W = estimateWindow(expectedLength || 1024);\n        if (![1, 2, 4, 8].includes(W))\n            throw new Error('ghash: invalid window size, expected 2, 4 or 8');\n        this.W = W;\n        const bits = 128; // always 128 bits;\n        const windows = bits / W;\n        const windowSize = (this.windowSize = 2 ** W);\n        const items = [];\n        // Create precompute table for window of W bits\n        for (let w = 0; w < windows; w++) {\n            // truth table: 00, 01, 10, 11\n            for (let byte = 0; byte < windowSize; byte++) {\n                // prettier-ignore\n                let s0 = 0, s1 = 0, s2 = 0, s3 = 0;\n                for (let j = 0; j < W; j++) {\n                    const bit = (byte >>> (W - j - 1)) & 1;\n                    if (!bit)\n                        continue;\n                    const { s0: d0, s1: d1, s2: d2, s3: d3 } = doubles[W * w + j];\n                    ((s0 ^= d0), (s1 ^= d1), (s2 ^= d2), (s3 ^= d3));\n                }\n                items.push({ s0, s1, s2, s3 });\n            }\n        }\n        this.t = items;\n    }\n    _updateBlock(s0, s1, s2, s3) {\n        ((s0 ^= this.s0), (s1 ^= this.s1), (s2 ^= this.s2), (s3 ^= this.s3));\n        const { W, t, windowSize } = this;\n        // prettier-ignore\n        let o0 = 0, o1 = 0, o2 = 0, o3 = 0;\n        const mask = (1 << W) - 1; // 2**W will kill performance.\n        let w = 0;\n        // NIST SP 800-38D §6.3 interprets blocks as little-endian polynomials,\n        // so the lookup walk consumes each word byte-by-byte from\n        // least-significant to most-significant bits.\n        for (const num of [s0, s1, s2, s3]) {\n            for (let bytePos = 0; bytePos < 4; bytePos++) {\n                const byte = (num >>> (8 * bytePos)) & 0xff;\n                for (let bitPos = 8 / W - 1; bitPos >= 0; bitPos--) {\n                    const bit = (byte >>> (W * bitPos)) & mask;\n                    const { s0: e0, s1: e1, s2: e2, s3: e3 } = t[w * windowSize + bit];\n                    ((o0 ^= e0), (o1 ^= e1), (o2 ^= e2), (o3 ^= e3));\n                    w += 1;\n                }\n            }\n        }\n        this.s0 = o0;\n        this.s1 = o1;\n        this.s2 = o2;\n        this.s3 = o3;\n    }\n    update(data) {\n        aexists(this);\n        abytes(data);\n        data = copyBytes(data);\n        const b32 = u32(data);\n        const blocks = Math.floor(data.length / BLOCK_SIZE);\n        const left = data.length % BLOCK_SIZE;\n        for (let i = 0; i < blocks; i++) {\n            this._updateBlock(swap8IfBE(b32[i * 4 + 0]), swap8IfBE(b32[i * 4 + 1]), swap8IfBE(b32[i * 4 + 2]), swap8IfBE(b32[i * 4 + 3]));\n        }\n        if (left) {\n            ZEROS16.set(data.subarray(blocks * BLOCK_SIZE));\n            // Tail blocks go through the shared ZEROS32 scratch, so they need the same host-endian\n            // normalization as full blocks; otherwise segmented GHASH/POLYVAL updates diverge on BE.\n            this._updateBlock(swap8IfBE(ZEROS32[0]), swap8IfBE(ZEROS32[1]), swap8IfBE(ZEROS32[2]), swap8IfBE(ZEROS32[3]));\n            clean(ZEROS32); // clean tmp buffer\n        }\n        return this;\n    }\n    destroy() {\n        // `aexists(this)` guards update/digest paths, so destroy must mark the instance unusable too.\n        this.destroyed = true;\n        const { t } = this;\n        // Wipe the key-derived precompute table; scalar accumulator words remain,\n        // but the destroyed guard blocks further use.\n        // clean precompute table\n        for (const elm of t) {\n            ((elm.s0 = 0), (elm.s1 = 0), (elm.s2 = 0), (elm.s3 = 0));\n        }\n    }\n    digestInto(out) {\n        aexists(this);\n        // `digestInto(out)` is the no-allocation fast path, so callers must pass a\n        // 32-bit-aligned buffer before we reinterpret it with `u32(out)`.\n        aoutput32(out, this);\n        this.finished = true;\n        // NIST SP 800-38D §6.4 returns the final 128-bit block Y_m.\n        // `digestInto()` follows the relaxed `aoutput()` contract, so only\n        // out[0..15] may be touched.\n        const { s0, s1, s2, s3 } = this;\n        const o32 = u32(out);\n        o32[0] = s0;\n        o32[1] = s1;\n        o32[2] = s2;\n        o32[3] = s3;\n        // Only the tag words need host-endian normalization; oversized output tails are caller-owned.\n        if (!isLE)\n            swap32IfBE(o32.subarray(0, BLOCK_SIZE / 4));\n    }\n    digest() {\n        const res = new Uint8Array(BLOCK_SIZE);\n        this.digestInto(res);\n        // `res` is independent of internal state, so it stays valid after destroy() wipes the table.\n        this.destroy();\n        return res;\n    }\n}\n/**\n * Incremental POLYVAL state for AES-SIV.\n * @param key - 16-byte POLYVAL key.\n * @param expectedLength - Expected message length for table sizing.\n * Inherits GHASH's segment-padded `update()` behavior: each call is padded\n * independently to a 16-byte boundary before absorption.\n * @example\n * Feeds one block into an incremental POLYVAL state with a fresh hash key.\n *\n * ```ts\n * import { Polyval } from '@noble/ciphers/_polyval.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * const mac = new Polyval(key);\n * mac.update(new Uint8Array(16));\n * mac.digest();\n * ```\n */\nexport class Polyval extends GHASH {\n    constructor(key, expectedLength) {\n        abytes(key);\n        // RFC 8452 Appendix A converts the POLYVAL key with\n        // `mulX_GHASH(ByteReverse(H))`; copy first because `_toGHASHKey(...)`\n        // mutates in place.\n        const ghKey = _toGHASHKey(copyBytes(key));\n        super(ghKey, expectedLength);\n        clean(ghKey);\n    }\n    update(data) {\n        aexists(this);\n        abytes(data);\n        data = copyBytes(data);\n        const b32 = u32(data);\n        const left = data.length % BLOCK_SIZE;\n        const blocks = Math.floor(data.length / BLOCK_SIZE);\n        for (let i = 0; i < blocks; i++) {\n            // RFC 8452 Appendix A feeds `ByteReverse(X_i)` into GHASH, so POLYVAL\n            // reverses the 32-bit word order in addition to the per-word byte swap.\n            this._updateBlock(swap8IfLE(b32[i * 4 + 3]), swap8IfLE(b32[i * 4 + 2]), swap8IfLE(b32[i * 4 + 1]), swap8IfLE(b32[i * 4 + 0]));\n        }\n        if (left) {\n            ZEROS16.set(data.subarray(blocks * BLOCK_SIZE));\n            this._updateBlock(swap8IfLE(ZEROS32[3]), swap8IfLE(ZEROS32[2]), swap8IfLE(ZEROS32[1]), swap8IfLE(ZEROS32[0]));\n            clean(ZEROS32);\n        }\n        return this;\n    }\n    digestInto(out) {\n        aexists(this);\n        // `digestInto(out)` is the no-allocation fast path, so callers must pass a\n        // 32-bit-aligned buffer before we reinterpret the output prefix with `u32(view)`.\n        aoutput32(out, this);\n        this.finished = true;\n        // RFC 8452 Appendix A maps POLYVAL output back through `ByteReverse(...)`.\n        // `digestInto()` follows the relaxed `aoutput()` contract, so only out[0..15] may be touched.\n        const view = out.subarray(0, this.outputLen);\n        const { s0, s1, s2, s3 } = this;\n        const o32 = u32(view);\n        o32[0] = s0;\n        o32[1] = s1;\n        o32[2] = s2;\n        o32[3] = s3;\n        swap32IfBE(o32);\n        view.reverse();\n    }\n}\n/**\n * GHash MAC for AES-GCM.\n * @param msg - Message bytes to authenticate.\n * @param key - 16-byte GHASH key.\n * @returns 16-byte authentication tag.\n * @example\n * Authenticates a short message with GHASH and a fresh hash key.\n *\n * ```ts\n * import { ghash } from '@noble/ciphers/_polyval.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * ghash(new Uint8Array(), key);\n * ```\n */\nexport const ghash = \n/* @__PURE__ */ wrapMacConstructor(16, (key, expectedLength) => new GHASH(key, expectedLength), (msg) => [msg.length]);\n/**\n * POLYVAL MAC for AES-SIV.\n * @param msg - Message bytes to authenticate.\n * @param key - 16-byte POLYVAL key.\n * @returns 16-byte authentication tag.\n * @example\n * Authenticates a short message with POLYVAL and a fresh hash key.\n *\n * ```ts\n * import { polyval } from '@noble/ciphers/_polyval.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * polyval(new Uint8Array(), key);\n * ```\n */\nexport const polyval = \n/* @__PURE__ */ wrapMacConstructor(16, (key, expectedLength) => new Polyval(key, expectedLength), (msg) => [msg.length]);\n","/**\n * {@link https://en.wikipedia.org/wiki/Advanced_Encryption_Standard | AES}\n * a.k.a. Advanced Encryption Standard\n * is a variant of Rijndael block cipher, standardized by NIST in 2001.\n * We provide the fastest available pure JS implementation.\n *\n * `cipher = encrypt(block, key)`\n *\n * Data is split into 128-bit blocks.\n * Encrypted in 10/12/14 rounds (128/192/256 bits). In every round:\n * 1. **S-box**, table substitution\n * 2. **Shift rows**, cyclic shift left of all rows of data array\n * 3. **Mix columns**, multiplying every column by fixed polynomial\n * 4. **Add round key**, round_key xor i-th column of array\n *\n * Check out\n * {@link https://csrc.nist.gov/files/pubs/fips/197/final/docs/fips-197.pdf | FIPS-197},\n * {@link https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-38G.pdf | NIST 800-38G},\n * and {@link https://csrc.nist.gov/csrc/media/projects/cryptographic-standards-and-guidelines/documents/aes-development/rijndael-ammended.pdf | original proposal}.\n * @module\n */\nimport { ghash, polyval } from \"./_polyval.js\";\n// prettier-ignore\nimport { abytes, aexists, anumber, aoutput32, byteSwap, clean, complexOverlapBytes, concatBytes, copyBytes, createView, equalBytes, getOutput, isAligned32, isLE, overlapBytes, swap32IfBE, swap8IfBE, u32, u64Lengths, u8, wrapCipher, wrapMacConstructor } from \"./utils.js\";\nconst BLOCK_SIZE = 16;\n// AES operates on 16-byte blocks, i.e. 4 32-bit words.\nconst BLOCK_SIZE32 = 4;\n// Shared zero block (`0^128`) used by GCM's `H = CIPH_K(0^128)` / J0 scratch\n// and by CMAC / SIV helpers; callers take `.slice()` before mutating it.\nconst EMPTY_BLOCK = /* @__PURE__ */ new Uint8Array(BLOCK_SIZE);\n// RFC 5297 §2.1 / §2.4: S2V uses `<one> = 0^127 || 1` for the `n = 0` special case.\nconst ONE_BLOCK = /* @__PURE__ */ Uint8Array.from([\n    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,\n]);\nconst POLY = 0x11b; // 1 + x + x**3 + x**4 + x**8\n// Validates plain AES key sizes only; AES-SIV's doubled-key contract is checked elsewhere.\nfunction validateKeyLength(key) {\n    if (![16, 24, 32].includes(key.length))\n        throw new Error('\"aes key\" expected Uint8Array of length 16/24/32, got length=' + key.length);\n}\n// TODO: remove multiplication, binary ops only\n// Doubles one GF(2^8) field element; callers are expected to stay in byte range.\n// FIPS 197 upd1 §4.3 equation (4.5): XTIMES(b) left-shifts by one and, when\n// b7=1, reduces by m(x); using POLY=0x11b here yields the same byte result\n// as XORing with {1b} after the shift.\nfunction mul2(n) {\n    return (n << 1) ^ (POLY & -(n >> 7));\n}\n// Shift-and-add multiplication in GF(2^8); callers are expected to pass byte values.\n// FIPS 197 upd1 §4.3 equation (4.7): general products are XORs of repeated\n// XTIMES() multiples, e.g. {57}•{13} = {57}⊕{ae}⊕{07}.\nfunction mul(a, b) {\n    let res = 0;\n    for (; b > 0; b >>= 1) {\n        // Usual shift-and-add step in GF(2^8), not a scalar-multiplication ladder.\n        res ^= a & -(b & 1); // if (b&1) res ^=a (but const-time).\n        a = mul2(a); // a = 2*a\n    }\n    return res;\n}\n/**\n * Increments a counter block with wrap around.\n * AES call sites here currently use the big-endian branch, but the helper supports both layouts.\n * NIST SP 800-38A Appendix B.1 and SP 800-38D §6.2 increment the\n * least-significant/rightmost bits.\n * `isLE=false` matches that standard counter-block layout, while `isLE=true`\n * is a generic extension for non-AES callers.\n * The implementation keeps a 32-bit bitwise carry path, so `carry` is capped at `0xffffff00`;\n * larger values throw instead of silently overflowing before the next-byte propagation step.\n */\n// Keep the helper explicitly typed so `--isolatedDeclarations` can expose it\n// through the test-only `__TESTS` export without inference errors.\nconst incBytes = (data, isLE, carry = 1) => {\n    // Carry is an increment count, not a signed delta; negatives would wrap through `| 0`.\n    // Keep `carry + byte <= 0xffffffff` so the `| 0` / `>>> 8` path below\n    // never truncates a real carry bit.\n    if (!Number.isSafeInteger(carry) || carry < 0 || carry > 0xffffff00)\n        throw new Error('incBytes: wrong carry ' + carry);\n    abytes(data);\n    for (let i = 0; i < data.length; i++) {\n        const pos = !isLE ? data.length - 1 - i : i;\n        carry = (carry + (data[pos] & 0xff)) | 0;\n        data[pos] = carry & 0xff;\n        carry >>>= 8;\n    }\n};\n// AES S-box is generated using finite field inversion,\n// an affine transform, and xor of a constant 0x63.\nconst sbox = /* @__PURE__ */ (() => {\n    const t = new Uint8Array(256);\n    // Repeated multiplication by {03} walks all 255 nonzero field elements\n    // once, so t[255 - i] is the multiplicative inverse of t[i] for the\n    // affine step.\n    for (let i = 0, x = 1; i < 256; i++, x ^= mul2(x))\n        t[i] = x;\n    const box = new Uint8Array(256);\n    // FIPS 197 upd1 §5.1.1: SBOX({00}) = {63} because the inverse step leaves\n    // {00} at {00}, then the affine transform xors in c = {63}.\n    box[0] = 0x63;\n    for (let i = 0; i < 255; i++) {\n        let x = t[255 - i];\n        x |= x << 8;\n        box[t[i]] = (x ^ (x >> 4) ^ (x >> 5) ^ (x >> 6) ^ (x >> 7) ^ 0x63) & 0xff;\n    }\n    clean(t);\n    return box;\n})();\n// FIPS 197 upd1 §5.3.2: INVSBOX() is derived from SBOX() by swapping input\n// and output roles (Table 6).\n// `indexOf` is only used once at module init, so the quadratic setup cost stays off hot paths.\nconst invSbox = /* @__PURE__ */ sbox.map((_, j) => sbox.indexOf(j));\n// FIPS 197 upd1 §5.2: ROTWORD([a0,a1,a2,a3]) = [a1,a2,a3,a0]; with this LE\n// word packing that is a right rotate by 8 bits.\nconst rotr32_8 = (n) => (n << 24) | (n >>> 8);\n// LE T-table helper: rotates one precomputed word by one byte so T1/T2/T3\n// reuse T0's substitution/mix result in the other byte lanes.\nconst rotl32_8 = (n) => (n << 8) | (n >>> 24);\n// T-table is optimization suggested in 5.2 of original proposal (missed from FIPS-197). Changes:\n// - LE instead of BE\n// - bigger tables: T0 and T1 are merged into T01 table and T2 & T3 into T23;\n//   so index is u16, instead of u8. This speeds up things, unexpectedly\nfunction genTtable(sbox, fn) {\n    if (sbox.length !== 256)\n        throw new Error('wrong sbox length');\n    const T0 = new Uint32Array(256).map((_, j) => fn(sbox[j]));\n    const T1 = T0.map(rotl32_8);\n    const T2 = T1.map(rotl32_8);\n    const T3 = T2.map(rotl32_8);\n    // Pre-xor adjacent lanes so apply0123/applySbox can fetch two substituted\n    // byte lanes per lookup in the LE round layout.\n    const T01 = new Uint32Array(256 * 256);\n    const T23 = new Uint32Array(256 * 256);\n    const sbox2 = new Uint16Array(256 * 256);\n    for (let i = 0; i < 256; i++) {\n        for (let j = 0; j < 256; j++) {\n            const idx = i * 256 + j;\n            T01[idx] = T0[i] ^ T1[j];\n            T23[idx] = T2[i] ^ T3[j];\n            sbox2[idx] = (sbox[i] << 8) | sbox[j];\n        }\n    }\n    return { sbox, sbox2, T0, T1, T2, T3, T01, T23 };\n}\n// Forward round precompute: the packed word stores the MIXCOLUMNS row\n// [{02},{01},{01},{03}] in LE byte-lane order, and the returned `sbox2`\n// is also reused by key expansion and the final round.\nconst tableEncoding = /* @__PURE__ */ genTtable(sbox, (s) => (mul(s, 3) << 24) | (s << 16) | (s << 8) | mul(s, 2));\n// Inverse round precompute: the packed word stores the INVMIXCOLUMNS row\n// [{0e},{09},{0d},{0b}] in LE byte-lane order, and the tables are reused\n// by decrypt() and expandKeyDecLE().\nconst tableDecoding = /* @__PURE__ */ genTtable(invSbox, (s) => (mul(s, 11) << 24) | (mul(s, 13) << 16) | (mul(s, 9) << 8) | mul(s, 14));\n// FIPS 197 upd1 §5.2 Table 5: left-most bytes of Rcon[j] = x^(j-1), generated by repeated XTIMES().\nconst xPowers = /* @__PURE__ */ (() => {\n    const p = new Uint8Array(16);\n    for (let i = 0, x = 1; i < 16; i++, x = mul2(x))\n        p[i] = x;\n    return p;\n})();\n/** Forward AES key expansion used across ECB/CBC/CTR/GCM/CMAC/KW-style paths. */\nfunction expandKeyLE(key) {\n    abytes(key);\n    const len = key.length;\n    validateKeyLength(key);\n    const { sbox2 } = tableEncoding;\n    const toClean = [];\n    // Copy on BE or misaligned inputs so the LE word normalization below never\n    // mutates caller key bytes in place.\n    if (!isLE || !isAligned32(key))\n        toClean.push((key = copyBytes(key)));\n    const k32 = swap32IfBE(u32(key));\n    const Nk = k32.length;\n    // `applySbox` normally reads one byte lane from each argument; repeating\n    // `n` across all four lanes turns it into SUBWORD(n).\n    const subByte = (n) => applySbox(sbox2, n, n, n, n);\n    // AES key sizes are 16/24/32 bytes, so len + 28 yields the 44/52/60\n    // schedule words from FIPS 197 §5.2 / Table 3.\n    const xk = new Uint32Array(len + 28); // expanded key\n    xk.set(k32);\n    // 4.3.1 Key expansion\n    for (let i = Nk; i < xk.length; i++) {\n        let t = xk[i - 1];\n        if (i % Nk === 0)\n            t = subByte(rotr32_8(t)) ^ xPowers[i / Nk - 1];\n        else if (Nk > 6 && i % Nk === 4)\n            t = subByte(t);\n        xk[i] = xk[i - Nk] ^ t;\n    }\n    clean(...toClean);\n    return xk;\n}\nfunction expandKeyDecLE(key) {\n    const encKey = expandKeyLE(key);\n    const xk = encKey.slice();\n    const Nk = encKey.length;\n    const { sbox2 } = tableEncoding;\n    const { T0, T1, T2, T3 } = tableDecoding;\n    // Local decrypt() walks round keys forward from xk[0], so reverse the\n    // encryption round-key blocks first before applying the equivalent-inverse\n    // middle-round transform.\n    for (let i = 0; i < Nk; i += 4) {\n        for (let j = 0; j < 4; j++)\n            xk[i + j] = encKey[Nk - i - 4 + j];\n    }\n    clean(encKey);\n    // Apply InvMixColumn to the reversed round keys using the same LE sbox2\n    // packing as the forward path.\n    // apply InvMixColumn except first & last round\n    for (let i = 4; i < Nk - 4; i++) {\n        const x = xk[i];\n        const w = applySbox(sbox2, x, x, x, x);\n        xk[i] = T0[w & 0xff] ^ T1[(w >>> 8) & 0xff] ^ T2[(w >>> 16) & 0xff] ^ T3[w >>> 24];\n    }\n    return xk;\n}\n// Apply tables\nfunction apply0123(T01, T23, s0, s1, s2, s3) {\n    // `T01` takes the low byte lane from `s0` plus the next lane from `s1`;\n    // `T23` does the same for `s2`/`s3`.\n    // Equivalent to `T0[s0&0xff] ^ T1[(s1>>>8)&0xff] ^ T2[(s2>>>16)&0xff] ^\n    // T3[s3>>>24]`, but with two merged-table fetches.\n    return (T01[((s0 << 8) & 0xff00) | ((s1 >>> 8) & 0xff)] ^\n        T23[((s2 >>> 8) & 0xff00) | ((s3 >>> 24) & 0xff)]);\n}\nfunction applySbox(sbox2, s0, s1, s2, s3) {\n    // `sbox2` packs two substituted byte lanes at a time in the same LE\n    // layout used by the round code.\n    // Equivalent to `SBOX(byte0(s0)) | SBOX(byte1(s1))<<8 |\n    // SBOX(byte2(s2))<<16 | SBOX(byte3(s3))<<24`.\n    return (sbox2[(s0 & 0xff) | (s1 & 0xff00)] |\n        (sbox2[((s2 >>> 16) & 0xff) | ((s3 >>> 16) & 0xff00)] << 16));\n}\nfunction encrypt(xk, s0, s1, s2, s3) {\n    const { sbox2, T01, T23 } = tableEncoding;\n    let k = 0;\n    ((s0 ^= xk[k++]), (s1 ^= xk[k++]), (s2 ^= xk[k++]), (s3 ^= xk[k++]));\n    // `xk` has Nr+1 round-key blocks, so after the initial AddRoundKey and the\n    // final S-box-only round there are Nr-1 full table/MixColumns rounds left.\n    const rounds = xk.length / 4 - 2;\n    for (let i = 0; i < rounds; i++) {\n        const t0 = xk[k++] ^ apply0123(T01, T23, s0, s1, s2, s3);\n        const t1 = xk[k++] ^ apply0123(T01, T23, s1, s2, s3, s0);\n        const t2 = xk[k++] ^ apply0123(T01, T23, s2, s3, s0, s1);\n        const t3 = xk[k++] ^ apply0123(T01, T23, s3, s0, s1, s2);\n        ((s0 = t0), (s1 = t1), (s2 = t2), (s3 = t3));\n    }\n    // last round (without mixcolumns, so using SBOX2 table)\n    const t0 = xk[k++] ^ applySbox(sbox2, s0, s1, s2, s3);\n    const t1 = xk[k++] ^ applySbox(sbox2, s1, s2, s3, s0);\n    const t2 = xk[k++] ^ applySbox(sbox2, s2, s3, s0, s1);\n    const t3 = xk[k++] ^ applySbox(sbox2, s3, s0, s1, s2);\n    return { s0: t0, s1: t1, s2: t2, s3: t3 };\n}\n// Can't be merged with encrypt: arg positions for apply0123 / applySbox are different\nfunction decrypt(xk, s0, s1, s2, s3) {\n    const { sbox2, T01, T23 } = tableDecoding;\n    let k = 0;\n    ((s0 ^= xk[k++]), (s1 ^= xk[k++]), (s2 ^= xk[k++]), (s3 ^= xk[k++]));\n    // With `expandKeyDecLE()` the round keys are already reversed and middle\n    // rounds are InvMixColumns-adjusted, so this loop follows the equivalent\n    // inverse cipher order directly.\n    const rounds = xk.length / 4 - 2;\n    for (let i = 0; i < rounds; i++) {\n        const t0 = xk[k++] ^ apply0123(T01, T23, s0, s3, s2, s1);\n        const t1 = xk[k++] ^ apply0123(T01, T23, s1, s0, s3, s2);\n        const t2 = xk[k++] ^ apply0123(T01, T23, s2, s1, s0, s3);\n        const t3 = xk[k++] ^ apply0123(T01, T23, s3, s2, s1, s0);\n        ((s0 = t0), (s1 = t1), (s2 = t2), (s3 = t3));\n    }\n    // Final equivalent-inverse round omits InvMixColumns, so use inverse\n    // S-box lanes in InvShiftRows order.\n    const t0 = xk[k++] ^ applySbox(sbox2, s0, s3, s2, s1);\n    const t1 = xk[k++] ^ applySbox(sbox2, s1, s0, s3, s2);\n    const t2 = xk[k++] ^ applySbox(sbox2, s2, s1, s0, s3);\n    const t3 = xk[k++] ^ applySbox(sbox2, s3, s2, s1, s0);\n    return { s0: t0, s1: t1, s2: t2, s3: t3 };\n}\nfunction ctrCounter(xk, nonce, src, dst) {\n    abytes(nonce, BLOCK_SIZE, 'nonce');\n    abytes(src);\n    const srcLen = src.length;\n    dst = getOutput(srcLen, dst);\n    complexOverlapBytes(src, dst);\n    // Internal helper: mutate `nonce` in place as the live counter block so\n    // each encrypted block uses the next CTR value.\n    const ctr = nonce;\n    const c32 = u32(ctr);\n    const src32 = u32(src);\n    const dst32 = u32(dst);\n    // process blocks\n    for (let i = 0; i + 4 <= src32.length; i += 4) {\n        const { s0, s1, s2, s3 } = encrypt(xk, swap8IfBE(c32[0]), swap8IfBE(c32[1]), swap8IfBE(c32[2]), swap8IfBE(c32[3]));\n        dst32[i + 0] = src32[i + 0] ^ swap8IfBE(s0);\n        dst32[i + 1] = src32[i + 1] ^ swap8IfBE(s1);\n        dst32[i + 2] = src32[i + 2] ^ swap8IfBE(s2);\n        dst32[i + 3] = src32[i + 3] ^ swap8IfBE(s3);\n        // Full 128 bit big-endian counter with wrap around. Same fixed-shape\n        // 16-byte carry walk as incBytes(ctr, false, 1), inlined to skip its\n        // per-call argument validation on the per-block hot path.\n        for (let j = BLOCK_SIZE - 1, carry = 1; j >= 0; j--) {\n            carry = (carry + ctr[j]) | 0;\n            ctr[j] = carry & 0xff;\n            carry >>>= 8;\n        }\n    }\n    // NIST SP 800-38A CTR mode uses the leading `u` bits of the next output\n    // block for the final short block.\n    // It's possible to handle > u32 fast, but is it worth it?\n    const start = BLOCK_SIZE * Math.floor(src32.length / BLOCK_SIZE32);\n    if (start < srcLen) {\n        const { s0, s1, s2, s3 } = encrypt(xk, swap8IfBE(c32[0]), swap8IfBE(c32[1]), swap8IfBE(c32[2]), swap8IfBE(c32[3]));\n        const b32 = new Uint32Array([s0, s1, s2, s3]);\n        swap32IfBE(b32);\n        const buf = u8(b32);\n        for (let i = start, pos = 0; i < srcLen; i++, pos++)\n            dst[i] = src[i] ^ buf[pos];\n        clean(b32);\n    }\n    // Unsafe mutable-counter API only advances whole blocks. Callers that want to\n    // resume after consuming part of this block must re-run from the same counter\n    // with left-padding and strip the already-consumed prefix themselves.\n    return dst;\n}\n// AES CTR with overflowing 32 bit counter\n// It's possible to do 32le significantly simpler (and probably faster) by using u32.\n// But, we need both, and perf bottleneck is in ghash anyway.\n// Unsafe 32-bit CTR helper: mutates `nonce` in place, expects aligned `src`/`dst`,\n// and uses `isLE` to choose which 32-bit counter word is incremented.\nfunction ctr32(xk, isLE, nonce, src, dst) {\n    abytes(nonce, BLOCK_SIZE, 'nonce');\n    abytes(src);\n    dst = getOutput(src.length, dst);\n    const ctr = nonce; // write new value to nonce, so it can be re-used\n    const c32 = u32(ctr);\n    const view = createView(ctr);\n    const src32 = u32(src);\n    const dst32 = u32(dst);\n    // NIST SP 800-38D GCTR increments the rightmost 32 bits of J0, while\n    // RFC 8452 AES-GCM-SIV increments the first 32 bits as a little-endian u32.\n    const ctrPos = isLE ? 0 : 12;\n    const srcLen = src.length;\n    let ctrNum = view.getUint32(ctrPos, isLE); // read current counter value\n    // process blocks\n    for (let i = 0; i + 4 <= src32.length; i += 4) {\n        const { s0, s1, s2, s3 } = encrypt(xk, swap8IfBE(c32[0]), swap8IfBE(c32[1]), swap8IfBE(c32[2]), swap8IfBE(c32[3]));\n        dst32[i + 0] = src32[i + 0] ^ swap8IfBE(s0);\n        dst32[i + 1] = src32[i + 1] ^ swap8IfBE(s1);\n        dst32[i + 2] = src32[i + 2] ^ swap8IfBE(s2);\n        dst32[i + 3] = src32[i + 3] ^ swap8IfBE(s3);\n        ctrNum = (ctrNum + 1) >>> 0; // u32 wrap\n        view.setUint32(ctrPos, ctrNum, isLE);\n    }\n    // leftovers (less than a block)\n    const start = BLOCK_SIZE * Math.floor(src32.length / BLOCK_SIZE32);\n    if (start < srcLen) {\n        const { s0, s1, s2, s3 } = encrypt(xk, swap8IfBE(c32[0]), swap8IfBE(c32[1]), swap8IfBE(c32[2]), swap8IfBE(c32[3]));\n        const b32 = new Uint32Array([s0, s1, s2, s3]);\n        swap32IfBE(b32);\n        const buf = u8(b32);\n        for (let i = start, pos = 0; i < srcLen; i++, pos++)\n            dst[i] = src[i] ^ buf[pos];\n        clean(b32);\n    }\n    // Same unsafe contract as ctrCounter(): only full blocks advance the stored\n    // mutable counter state; partial-block continuation is caller-managed.\n    return dst;\n}\n/**\n * **CTR** (Counter Mode): turns a block cipher into a stream cipher using a\n * full 16-byte counter block.\n * Efficient and parallelizable. Requires a unique nonce per encryption. Unauthenticated: needs MAC.\n * @param key - AES key bytes.\n * @param nonce - 16-byte counter block, incremented as a full AES block.\n * @returns Cipher instance with `encrypt()` and `decrypt()`.\n * @example\n * Encrypts a short payload with a fresh AES key and counter block.\n *\n * ```ts\n * import { ctr } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * const nonce = randomBytes(16);\n * const cipher = ctr(key, nonce);\n * cipher.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const ctr = /* @__PURE__ */ wrapCipher({ blockSize: 16, nonceLength: 16 }, function aesctr(key, nonce) {\n    function processCtr(buf, dst) {\n        abytes(buf);\n        if (dst !== undefined) {\n            abytes(dst);\n            // Optional output buffers must stay 4-byte aligned because\n            // ctrCounter() reinterprets them as Uint32Array words.\n            if (!isAligned32(dst))\n                throw new Error('unaligned destination');\n        }\n        const xk = expandKeyLE(key);\n        // Public CTR keeps caller nonce bytes immutable even though ctrCounter()\n        // advances the live 16-byte counter block in place.\n        const n = copyBytes(nonce); // align + avoid changing\n        const toClean = [xk, n];\n        if (!isAligned32(buf))\n            toClean.push((buf = copyBytes(buf)));\n        const out = ctrCounter(xk, n, buf, dst);\n        clean(...toClean);\n        return out;\n    }\n    return {\n        encrypt: (plaintext, dst) => processCtr(plaintext, dst),\n        decrypt: (ciphertext, dst) => processCtr(ciphertext, dst),\n    };\n});\nfunction validateBlockDecrypt(data, dst) {\n    abytes(data);\n    // ECB/CBC decryption always consumes whole ciphertext blocks; PKCS#7/CMS\n    // padding, when enabled, is removed only after decrypting the final block.\n    if (data.length % BLOCK_SIZE !== 0) {\n        throw new Error('ciphertext must be multiple of ' + BLOCK_SIZE);\n    }\n    // Validate caller-provided output before key expansion; allocation happens after it.\n    if (dst !== undefined) {\n        getOutput(data.length, dst);\n        complexOverlapBytes(data, dst);\n    }\n}\n// ECB/CBC core modes operate on whole blocks; `pkcs5` enables the library's\n// PKCS#7/CMS-compatible final-block padding convenience before encryption.\nfunction validateBlockEncrypt(plaintext, pkcs5, dst) {\n    abytes(plaintext);\n    let outLen = plaintext.length;\n    const remaining = outLen % BLOCK_SIZE;\n    if (!pkcs5 && remaining !== 0)\n        throw new Error('plaintext must be multiple of ' + BLOCK_SIZE);\n    if (pkcs5) {\n        let left = BLOCK_SIZE - remaining;\n        // RFC 5652 pads even already-aligned inputs, so a full extra block is\n        // appended when the plaintext length is already a multiple of 16 bytes.\n        if (!left)\n            left = BLOCK_SIZE; // if no bytes left, create empty padding block\n        outLen = outLen + left;\n    }\n    // Validate caller-provided output before key expansion; allocation happens after it.\n    if (dst !== undefined) {\n        getOutput(outLen, dst);\n        complexOverlapBytes(plaintext, dst);\n    }\n    return outLen;\n}\nfunction prepareBlockEncrypt(plaintext, outLen, dst) {\n    if (dst === undefined)\n        dst = new Uint8Array(outLen);\n    // Copy on BE or misaligned inputs so u32()/swap32IfBE() normalization never\n    // mutates caller plaintext bytes in place before ECB/CBC processing.\n    if (!isLE || !isAligned32(plaintext))\n        plaintext = copyBytes(plaintext);\n    const o = u32(dst);\n    // Keep the full byte owner so callers can wipe a conditional copy without rebuilding a view.\n    return { b: plaintext, o, out: dst };\n}\n// `pkcs5` is the historical option name; for AES's 16-byte block this is the\n// generic PKCS#7/CMS-style block-padding rule on decrypt.\nfunction validatePKCS(data, pkcs5) {\n    if (!pkcs5)\n        return data;\n    const len = data.length;\n    // RFC 5652 pads even empty / already-aligned inputs, so a valid padded\n    // ECB/CBC ciphertext is never empty when PKCS#7/CMS unpadding is enabled.\n    // AES-CBC/ECB ciphertext should be full blocks before unpadding\n    if (len === 0)\n        throw new Error('pkcs7: empty ciphertext not allowed');\n    const lastByte = data[len - 1];\n    let valid = 1;\n    valid &= ((lastByte - 1) >>> 31) ^ 1; // pad >= 1\n    valid &= ((16 - lastByte) >>> 31) ^ 1; // pad <= 16\n    // Check exactly 16 tail bytes in constant-shape loop\n    // For i < pad: byte must equal pad\n    // For i >= pad: ignore byte\n    for (let i = 0; i < 16; i++) {\n        // const b = data[len - 1 - i];\n        const shouldCheck = (i - lastByte) >>> 31; // 1 if i < pad else 0\n        const eq = (data[len - 1 - i] ^ lastByte) === 0 ? 1 : 0; // 1 if equal\n        valid &= eq | (shouldCheck ^ 1); // pass if equal OR not checked\n    }\n    // if (invalidLen) throw new Error('aes/pkcs7: ciphertext length must be multiple of 16');\n    // Padding rejection is observable as a decrypt failure; authenticate CBC/ECB\n    // ciphertexts before decrypting or use `disablePadding` in a higher-level protocol.\n    if (!valid)\n        throw new Error('aes: bad decrypt');\n    return data.subarray(0, len - lastByte);\n}\n// ECB/CBC callers only pass the final short block here, so `left.length` is\n// 0..15 and the helper always emits exactly one padded 16-byte block.\nfunction padPCKS(left) {\n    const tmp = new Uint8Array(16);\n    const tmp32 = u32(tmp);\n    tmp.set(left);\n    const paddingByte = BLOCK_SIZE - left.length;\n    // RFC 5652 §6.3 fills the whole suffix with the padding length byte:\n    // e.g. `aa 0f..0f` for a 1-byte tail, or `10..10` for a full extra block.\n    for (let i = BLOCK_SIZE - paddingByte; i < BLOCK_SIZE; i++)\n        tmp[i] = paddingByte;\n    return tmp32;\n}\n/**\n * **ECB** (Electronic Codebook): Deterministic encryption; identical plaintext blocks yield\n * identical ciphertexts. Not secure due to pattern leakage.\n * See {@link https://words.filippo.io/the-ecb-penguin/ | the AES Penguin}.\n * @param key - AES key bytes.\n * @param opts - Padding options. See {@link BlockOpts}.\n * @returns Cipher instance with `encrypt()` and `decrypt()`.\n * @example\n * Shows the basic ECB encrypt call shape with a fresh key; avoid ECB in new designs.\n *\n * ```ts\n * import { ecb } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * const cipher = ecb(key);\n * cipher.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const ecb = /* @__PURE__ */ wrapCipher({ blockSize: 16 }, function aesecb(key, opts = {}) {\n    const pkcs5 = !opts.disablePadding;\n    return {\n        encrypt(plaintext, dst) {\n            const outLen = validateBlockEncrypt(plaintext, pkcs5, dst);\n            const xk = expandKeyLE(key);\n            const { b: input, o, out: _out } = prepareBlockEncrypt(plaintext, outLen, dst);\n            const b = u32(input);\n            swap32IfBE(b);\n            let i = 0;\n            for (; i + 4 <= b.length;) {\n                const { s0, s1, s2, s3 } = encrypt(xk, b[i + 0], b[i + 1], b[i + 2], b[i + 3]);\n                ((o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3));\n            }\n            if (pkcs5) {\n                const tmp32 = padPCKS(plaintext.subarray(i * 4));\n                swap32IfBE(tmp32);\n                const { s0, s1, s2, s3 } = encrypt(xk, tmp32[0], tmp32[1], tmp32[2], tmp32[3]);\n                ((o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3));\n                // The padding scratch contains the final plaintext tail; wipe it as soon as consumed.\n                clean(tmp32);\n            }\n            swap32IfBE(o);\n            clean(xk);\n            if (input !== plaintext)\n                clean(input);\n            return _out;\n        },\n        decrypt(ciphertext, dst) {\n            // Validate inputs before expanding the key, so a validation throw\n            // never leaves an unwiped expanded key behind.\n            validateBlockDecrypt(ciphertext, dst);\n            const xk = expandKeyDecLE(key);\n            if (dst === undefined)\n                dst = new Uint8Array(ciphertext.length);\n            const toClean = [xk];\n            // Copy on BE or misaligned ciphertext so u32()/swap32IfBE()\n            // normalization never mutates caller bytes in place before decrypt().\n            if (!isLE || !isAligned32(ciphertext))\n                toClean.push((ciphertext = copyBytes(ciphertext)));\n            const b = u32(ciphertext);\n            const o = u32(dst);\n            swap32IfBE(b);\n            for (let i = 0; i + 4 <= b.length;) {\n                const { s0, s1, s2, s3 } = decrypt(xk, b[i + 0], b[i + 1], b[i + 2], b[i + 3]);\n                ((o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3));\n            }\n            swap32IfBE(o);\n            clean(...toClean);\n            return validatePKCS(dst, pkcs5);\n        },\n    };\n});\n/**\n * **CBC** (Cipher Block Chaining): Each plaintext block is XORed with the\n * previous block of ciphertext before encryption.\n * Hard to use: requires proper padding and an unpredictable IV. Unauthenticated: needs MAC.\n * Bad padding is reported as decrypt failure, which can be a padding oracle if exposed.\n * @param key - AES key bytes.\n * @param iv - 16-byte unpredictable initialization vector.\n * @param opts - Padding options. See {@link BlockOpts}.\n * @returns Cipher instance with `encrypt()` and `decrypt()`.\n * @example\n * Encrypts a padded message with a fresh key and 16-byte IV.\n *\n * ```ts\n * import { cbc } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * const iv = randomBytes(16);\n * const cipher = cbc(key, iv);\n * cipher.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const cbc = /* @__PURE__ */ wrapCipher({ blockSize: 16, nonceLength: 16 }, function aescbc(key, iv, opts = {}) {\n    const pkcs5 = !opts.disablePadding;\n    return {\n        encrypt(plaintext, dst) {\n            // Validate inputs before expanding the key, so a validation throw\n            // never leaves an unwiped expanded key behind.\n            const outLen = validateBlockEncrypt(plaintext, pkcs5, dst);\n            const xk = expandKeyLE(key);\n            const { b: input, o, out: _out } = prepareBlockEncrypt(plaintext, outLen, dst);\n            const b = u32(input);\n            swap32IfBE(b);\n            let _iv = iv;\n            const toClean = [xk];\n            // Copy on BE or misaligned inputs so IV normalization and the mutable\n            // local chaining state never write back into caller IV bytes.\n            if (!isLE || !isAligned32(_iv))\n                toClean.push((_iv = copyBytes(_iv)));\n            const n32 = u32(_iv);\n            swap32IfBE(n32);\n            // prettier-ignore\n            let s0 = n32[0], s1 = n32[1], s2 = n32[2], s3 = n32[3];\n            let i = 0;\n            for (; i + 4 <= b.length;) {\n                ((s0 ^= b[i + 0]), (s1 ^= b[i + 1]), (s2 ^= b[i + 2]), (s3 ^= b[i + 3]));\n                ({ s0, s1, s2, s3 } = encrypt(xk, s0, s1, s2, s3));\n                ((o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3));\n            }\n            if (pkcs5) {\n                const tmp32 = padPCKS(plaintext.subarray(i * 4));\n                swap32IfBE(tmp32);\n                ((s0 ^= tmp32[0]), (s1 ^= tmp32[1]), (s2 ^= tmp32[2]), (s3 ^= tmp32[3]));\n                ({ s0, s1, s2, s3 } = encrypt(xk, s0, s1, s2, s3));\n                ((o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3));\n                // The padding scratch contains the final plaintext tail; wipe it as soon as consumed.\n                clean(tmp32);\n            }\n            swap32IfBE(o);\n            clean(...toClean);\n            if (input !== plaintext)\n                clean(input);\n            return _out;\n        },\n        decrypt(ciphertext, dst) {\n            // Validate inputs before expanding the key, so a validation throw\n            // never leaves an unwiped expanded key behind.\n            validateBlockDecrypt(ciphertext, dst);\n            const xk = expandKeyDecLE(key);\n            if (dst === undefined)\n                dst = new Uint8Array(ciphertext.length);\n            let _iv = iv;\n            const toClean = [xk];\n            // Copy on BE or misaligned inputs so IV normalization and the mutable\n            // local chaining state never write back into caller IV bytes.\n            if (!isLE || !isAligned32(_iv))\n                toClean.push((_iv = copyBytes(_iv)));\n            const n32 = u32(_iv);\n            swap32IfBE(n32);\n            // Copy on BE or misaligned ciphertext so u32()/swap32IfBE()\n            // normalization never mutates caller bytes in place before decrypt().\n            if (!isLE || !isAligned32(ciphertext))\n                toClean.push((ciphertext = copyBytes(ciphertext)));\n            const b = u32(ciphertext);\n            const o = u32(dst);\n            swap32IfBE(b);\n            // prettier-ignore\n            let s0 = n32[0], s1 = n32[1], s2 = n32[2], s3 = n32[3];\n            for (let i = 0; i + 4 <= b.length;) {\n                // prettier-ignore\n                const ps0 = s0, ps1 = s1, ps2 = s2, ps3 = s3;\n                ((s0 = b[i + 0]), (s1 = b[i + 1]), (s2 = b[i + 2]), (s3 = b[i + 3]));\n                const { s0: o0, s1: o1, s2: o2, s3: o3 } = decrypt(xk, s0, s1, s2, s3);\n                ((o[i++] = o0 ^ ps0), (o[i++] = o1 ^ ps1), (o[i++] = o2 ^ ps2), (o[i++] = o3 ^ ps3));\n            }\n            swap32IfBE(o);\n            clean(...toClean);\n            return validatePKCS(dst, pkcs5);\n        },\n    };\n});\n/**\n * CFB (CFB-128): Cipher Feedback Mode with 128-bit segments. The input for the\n * block cipher is the previous cipher output.\n * Unauthenticated: needs MAC.\n * @param key - AES key bytes.\n * @param iv - 16-byte unpredictable initialization vector.\n * @returns Cipher instance with `encrypt()` and `decrypt()`.\n * @example\n * Encrypts a short message with feedback mode and a fresh key/IV pair.\n *\n * ```ts\n * import { cfb } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * const iv = randomBytes(16);\n * const cipher = cfb(key, iv);\n * cipher.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const cfb = /* @__PURE__ */ wrapCipher({ blockSize: 16, nonceLength: 16 }, function aescfb(key, iv) {\n    function processCfb(src, isEncrypt, dst) {\n        abytes(src);\n        const srcLen = src.length;\n        dst = getOutput(srcLen, dst);\n        // CFB feeds back previous ciphertext, so overlapping src/dst could\n        // overwrite bytes that are still needed as the next feedback block.\n        if (overlapBytes(src, dst))\n            throw new Error('overlapping src and dst not supported');\n        const xk = expandKeyLE(key);\n        let _iv = iv;\n        const toClean = [xk];\n        // Copy on BE or misaligned inputs so u32()/swap32IfBE() normalization\n        // never mutates caller IV/src bytes in place before CFB processing.\n        if (!isLE || !isAligned32(_iv))\n            toClean.push((_iv = copyBytes(_iv)));\n        if (!isLE || !isAligned32(src))\n            toClean.push((src = copyBytes(src)));\n        const src32 = u32(src);\n        const dst32 = u32(dst);\n        // NIST SP 800-38A §6.3 feeds back the previous ciphertext segment in\n        // both directions: encrypt reuses freshly written dst words, decrypt\n        // reuses the source ciphertext words.\n        const next32 = isEncrypt ? dst32 : src32;\n        const n32 = u32(_iv);\n        swap32IfBE(src32);\n        swap32IfBE(n32);\n        // prettier-ignore\n        let s0 = n32[0], s1 = n32[1], s2 = n32[2], s3 = n32[3];\n        for (let i = 0; i + 4 <= src32.length;) {\n            const { s0: e0, s1: e1, s2: e2, s3: e3 } = encrypt(xk, s0, s1, s2, s3);\n            dst32[i + 0] = src32[i + 0] ^ e0;\n            dst32[i + 1] = src32[i + 1] ^ e1;\n            dst32[i + 2] = src32[i + 2] ^ e2;\n            dst32[i + 3] = src32[i + 3] ^ e3;\n            ((s0 = next32[i++]), (s1 = next32[i++]), (s2 = next32[i++]), (s3 = next32[i++]));\n        }\n        // leftovers (less than block)\n        const start = BLOCK_SIZE * Math.floor(src32.length / BLOCK_SIZE32);\n        if (start < srcLen) {\n            // The byte tail loop reads `src` directly; restore any BE-swapped tail words first.\n            if (!isLE)\n                swap32IfBE(src32.subarray(start / 4));\n            // Byte-oriented API: for a final short tail, reuse the next CFB-128\n            // output block and XOR only the needed prefix. RFC 3826 §3.1.3 /\n            // §3.1.4 describes the same no-padding rule at bit granularity for a\n            // final r<=128 segment.\n            ({ s0, s1, s2, s3 } = encrypt(xk, s0, s1, s2, s3));\n            const tmp = new Uint32Array([s0, s1, s2, s3]);\n            swap32IfBE(tmp);\n            const buf = u8(tmp);\n            for (let i = start, pos = 0; i < srcLen; i++, pos++)\n                dst[i] = src[i] ^ buf[pos];\n            clean(buf);\n        }\n        if (!isLE)\n            swap32IfBE(dst32.subarray(0, start / 4));\n        clean(...toClean);\n        return dst;\n    }\n    return {\n        encrypt: (plaintext, dst) => processCfb(plaintext, true, dst),\n        decrypt: (ciphertext, dst) => processCfb(ciphertext, false, dst),\n    };\n});\n// TODO: merge with chacha, however gcm has bitLen while chacha has byteLen\n// `data` is the payload covered by the polynomial MAC: ciphertext for GCM,\n// plaintext for GCM-SIV. Keep AAD/data/length as separate updates because\n// GHASH/POLYVAL pad each call to block boundaries, so the chunks must match the\n// spec-defined segments instead of arbitrary concatenation boundaries.\nfunction computeTag(fn, isLE, key, data, AAD) {\n    const aadLength = AAD ? AAD.length : 0;\n    const h = fn.create(key, data.length + aadLength);\n    if (AAD)\n        h.update(AAD);\n    // u64Lengths() takes (dataBits, aadBits) but still serializes the final\n    // block as len(AAD) || len(data), matching both GCM and GCM-SIV.\n    const num = u64Lengths(8 * data.length, 8 * aadLength, isLE);\n    h.update(data);\n    h.update(num);\n    const res = h.digest();\n    clean(num);\n    return res;\n}\n/**\n * **GCM** (Galois/Counter Mode): Combines CTR mode with polynomial MAC. Efficient and widely used.\n * Not perfect:\n * a) conservative key wear-out is `2**32` (4B) msgs.\n * b) key wear-out under random nonces is even smaller: `2**23` (8M) messages for `2**-50` chance.\n * c) MAC can be forged: see Poly1305 documentation.\n * @param key - AES key bytes.\n * @param nonce - Nonce bytes (12 recommended, minimum 8; other lengths use GHASH J0 derivation).\n * @param AAD - Additional authenticated data.\n * @returns AEAD cipher instance with a fixed 16-byte tag.\n * @example\n * Encrypts and authenticates plaintext with a fresh key and 12-byte nonce.\n *\n * ```ts\n * import { gcm } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * const nonce = randomBytes(12);\n * const aad = new TextEncoder().encode('session metadata');\n * const cipher = gcm(key, nonce, aad);\n * cipher.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const gcm = /* @__PURE__ */ wrapCipher({ blockSize: 16, nonceLength: 12, tagLength: 16, withAAD: true, varSizeNonce: true }, function aesgcm(key, nonce, AAD) {\n    // SP 800-38D lets implementations narrow supported IV lengths.\n    // This wrapper intentionally requires at least 8 bytes; OpenSSL accepts shorter IVs too.\n    // 12-byte nonces take the fast path; other allowed lengths use GHASH to derive J0.\n    if (nonce.length < 8)\n        throw new Error('aes/gcm: invalid nonce length');\n    const tagLength = 16;\n    function _computeTag(authKey, tagMask, data) {\n        const tag = computeTag(ghash, false, authKey, data, AAD);\n        for (let i = 0; i < tagMask.length; i++)\n            tag[i] ^= tagMask[i];\n        return tag;\n    }\n    function deriveKeys() {\n        const xk = expandKeyLE(key);\n        const authKey = EMPTY_BLOCK.slice();\n        const counter = EMPTY_BLOCK.slice();\n        ctr32(xk, false, counter, counter, authKey);\n        // NIST 800-38d, page 15: different behavior for 96-bit and non-96-bit nonces\n        if (nonce.length === 12) {\n            counter.set(nonce);\n        }\n        else {\n            const nonceLen = EMPTY_BLOCK.slice();\n            const view = createView(nonceLen);\n            view.setBigUint64(8, BigInt(nonce.length * 8), false);\n            // GHASH.update() pads each call to 16 bytes, so\n            // update(nonce).update(nonceLen) realizes\n            // IV || 0^s || 0^64 || [len(IV)]_64 for non-96-bit nonces.\n            // ghash(nonce || u64be(0) || u64be(nonceLen*8))\n            const g = ghash.create(authKey).update(nonce).update(nonceLen);\n            g.digestInto(counter); // digestInto doesn't trigger '.destroy'\n            g.destroy();\n        }\n        // GCTR_K(J0, 0^128) = E_K(J0); reusing ctr32() here extracts that tag\n        // mask and leaves `counter` advanced to inc32(J0) for payload GCTR.\n        const tagMask = ctr32(xk, false, counter, EMPTY_BLOCK);\n        return { xk, authKey, counter, tagMask };\n    }\n    return {\n        encrypt(plaintext) {\n            const { xk, authKey, counter, tagMask } = deriveKeys();\n            const out = new Uint8Array(plaintext.length + tagLength);\n            const toClean = [xk, authKey, counter, tagMask];\n            if (!isAligned32(plaintext))\n                toClean.push((plaintext = copyBytes(plaintext)));\n            ctr32(xk, false, counter, plaintext, out.subarray(0, plaintext.length));\n            const tag = _computeTag(authKey, tagMask, out.subarray(0, out.length - tagLength));\n            toClean.push(tag);\n            out.set(tag, plaintext.length);\n            clean(...toClean);\n            return out;\n        },\n        decrypt(ciphertext) {\n            const { xk, authKey, counter, tagMask } = deriveKeys();\n            const toClean = [xk, authKey, tagMask, counter];\n            if (!isAligned32(ciphertext))\n                toClean.push((ciphertext = copyBytes(ciphertext)));\n            const data = ciphertext.subarray(0, -tagLength);\n            const passedTag = ciphertext.subarray(-tagLength);\n            const tag = _computeTag(authKey, tagMask, data);\n            toClean.push(tag);\n            // NIST SP 800-38D §7.2 permits equivalent step orderings; verify the\n            // tag before CTR so unauthenticated plaintext is never materialized.\n            if (!equalBytes(tag, passedTag)) {\n                clean(...toClean);\n                throw new Error('aes-gcm: invalid tag');\n            }\n            const out = ctr32(xk, false, counter, data);\n            clean(...toClean);\n            return out;\n        },\n    };\n});\nconst limit = (name, min, max) => (value) => {\n    // Current AES-SIV/GCM-SIV callers pass protocol limits from RFC 8452 / RFC 5297,\n    // not arbitrary library-preference bounds.\n    // Callers feed Uint8Array.length values here, so safe-integer rejection\n    // does not exclude any representable input even when an RFC bound is larger.\n    if (!Number.isSafeInteger(value) || min > value || value > max) {\n        const minmax = '[' + min + '..' + max + ']';\n        throw new Error('' + name + ': expected value in range ' + minmax + ', got ' + value);\n    }\n};\n/**\n * **SIV** (Synthetic IV): GCM with nonce-misuse resistance.\n * Repeating nonces reveal only the fact plaintexts are identical.\n * Also suffers from GCM issues: key wear-out limits & MAC forging.\n * See {@link https://www.rfc-editor.org/rfc/rfc8452 | RFC 8452}.\n * RFC 8452 defines 16-byte and 32-byte AES keys for this mode.\n * This implementation also accepts 24-byte AES-192 keys as a local\n * extension; see the inline comment next to `validateKeyLength(key)` below\n * for the exact scope note.\n * @param key - AES key bytes.\n * @param nonce - 12-byte nonce.\n * @param AAD - Additional authenticated data.\n * @returns AEAD cipher instance.\n * @example\n * Encrypts and authenticates plaintext with a fresh key and nonce, while tolerating reuse.\n *\n * ```ts\n * import { gcmsiv } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * const nonce = randomBytes(12);\n * const aad = new TextEncoder().encode('session metadata');\n * const cipher = gcmsiv(key, nonce, aad);\n * cipher.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const gcmsiv = /* @__PURE__ */ wrapCipher({ blockSize: 16, nonceLength: 12, tagLength: 16, withAAD: true, varSizeNonce: true }, function aessiv(key, nonce, AAD) {\n    const tagLength = 16;\n    // From RFC 8452: Section 6\n    const AAD_LIMIT = limit('AAD', 0, 2 ** 36);\n    const PLAIN_LIMIT = limit('plaintext', 0, 2 ** 36);\n    const NONCE_LIMIT = limit('nonce', 12, 12);\n    const CIPHER_LIMIT = limit('ciphertext', 16, 2 ** 36 + 16);\n    abytes(key);\n    // RFC 8452 only standardizes 16-byte and 32-byte key-generating keys.\n    // The accepted 24-byte path is a local AES-192 extension outside the RFC-defined AEADs.\n    validateKeyLength(key);\n    NONCE_LIMIT(nonce.length);\n    if (AAD !== undefined)\n        AAD_LIMIT(AAD.length);\n    function deriveKeys() {\n        const xk = expandKeyLE(key);\n        const encKey = new Uint8Array(key.length);\n        const authKey = new Uint8Array(16);\n        const toClean = [xk, encKey];\n        let _nonce = nonce;\n        // Copy on BE or misaligned nonce so u32()/swap32IfBE() normalization\n        // never mutates caller nonce bytes before RFC 8452 key derivation.\n        if (!isLE || !isAligned32(_nonce))\n            toClean.push((_nonce = copyBytes(_nonce)));\n        const n32 = u32(_nonce);\n        swap32IfBE(n32);\n        // prettier-ignore\n        let s0 = 0, s1 = n32[0], s2 = n32[1], s3 = n32[2];\n        let counter = 0;\n        for (const derivedKey of [authKey, encKey].map(u32)) {\n            const d32 = u32(derivedKey);\n            for (let i = 0; i < d32.length; i += 2) {\n                // aes(u32le(0) || nonce)[:8] || aes(u32le(1) || nonce)[:8] ...\n                const { s0: o0, s1: o1 } = encrypt(xk, s0, s1, s2, s3);\n                d32[i + 0] = o0;\n                d32[i + 1] = o1;\n                s0 = ++counter; // increment counter inside state\n            }\n            swap32IfBE(d32);\n        }\n        const res = { authKey, encKey: expandKeyLE(encKey) };\n        // Cleanup\n        clean(...toClean);\n        return res;\n    }\n    function _computeTag(encKey, authKey, data) {\n        const tag = computeTag(polyval, true, authKey, data, AAD);\n        // Compute the expected tag by XORing S_s and the nonce, clearing the\n        // most significant bit of the last byte and encrypting with the\n        // message-encryption key.\n        for (let i = 0; i < 12; i++)\n            tag[i] ^= nonce[i];\n        tag[15] &= 0x7f; // Clear the highest bit\n        // encrypt tag as block\n        const t32 = u32(tag);\n        swap32IfBE(t32);\n        // prettier-ignore\n        let s0 = t32[0], s1 = t32[1], s2 = t32[2], s3 = t32[3];\n        ({ s0, s1, s2, s3 } = encrypt(encKey, s0, s1, s2, s3));\n        ((t32[0] = s0), (t32[1] = s1), (t32[2] = s2), (t32[3] = s3));\n        swap32IfBE(t32);\n        return tag;\n    }\n    // actual decrypt/encrypt of message.\n    function processSiv(encKey, tag, input) {\n        let block = copyBytes(tag);\n        // RFC 8452 §4 / §5 use the tag with the highest bit of the last byte\n        // forced to one as the initial AES-CTR counter block.\n        block[15] |= 0x80; // Force highest bit\n        const res = ctr32(encKey, true, block, input);\n        // Cleanup\n        clean(block);\n        return res;\n    }\n    return {\n        encrypt(plaintext) {\n            PLAIN_LIMIT(plaintext.length);\n            const { encKey, authKey } = deriveKeys();\n            const tag = _computeTag(encKey, authKey, plaintext);\n            const toClean = [encKey, authKey, tag];\n            if (!isAligned32(plaintext))\n                toClean.push((plaintext = copyBytes(plaintext)));\n            const out = new Uint8Array(plaintext.length + tagLength);\n            out.set(tag, plaintext.length);\n            out.set(processSiv(encKey, tag, plaintext));\n            // Cleanup\n            clean(...toClean);\n            return out;\n        },\n        decrypt(ciphertext) {\n            CIPHER_LIMIT(ciphertext.length);\n            const tag = ciphertext.subarray(-tagLength);\n            const { encKey, authKey } = deriveKeys();\n            const toClean = [encKey, authKey];\n            if (!isAligned32(ciphertext))\n                toClean.push((ciphertext = copyBytes(ciphertext)));\n            const plaintext = processSiv(encKey, tag, ciphertext.subarray(0, -tagLength));\n            const expectedTag = _computeTag(encKey, authKey, plaintext);\n            toClean.push(expectedTag);\n            // RFC 8452 §5: plaintext is unauthenticated here and MUST NOT be\n            // returned until the expected-tag check completes successfully.\n            if (!equalBytes(tag, expectedTag)) {\n                clean(plaintext, ...toClean);\n                throw new Error('invalid polyval tag');\n            }\n            // Cleanup\n            clean(...toClean);\n            return plaintext;\n        },\n    };\n});\nfunction isBytes32(a) {\n    // Plain `instanceof Uint32Array` is too strict for cross-realm expanded-key views.\n    // This is only a best-effort unsafe-export guard, not a provenance proof for `expandKeyLE`.\n    return (a instanceof Uint32Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint32Array'));\n}\n// Unsafe single-block helpers: mutate `block` in place and require its 16-byte\n// Uint8Array view to be 4-byte aligned because `u32(block)` reinterprets it.\nfunction encryptBlock(xk, block) {\n    abytes(block, 16, 'block');\n    if (!isBytes32(xk))\n        throw new Error('_encryptBlock accepts result of expandKeyLE');\n    const b32 = u32(block);\n    swap32IfBE(b32);\n    let { s0, s1, s2, s3 } = encrypt(xk, b32[0], b32[1], b32[2], b32[3]);\n    ((b32[0] = s0), (b32[1] = s1), (b32[2] = s2), (b32[3] = s3));\n    swap32IfBE(b32);\n    return block;\n}\nfunction decryptBlock(xk, block) {\n    abytes(block, 16, 'block');\n    if (!isBytes32(xk))\n        throw new Error('_decryptBlock accepts result of expandKeyLE');\n    const b32 = u32(block);\n    swap32IfBE(b32);\n    let { s0, s1, s2, s3 } = decrypt(xk, b32[0], b32[1], b32[2], b32[3]);\n    ((b32[0] = s0), (b32[1] = s1), (b32[2] = s2), (b32[3] = s3));\n    swap32IfBE(b32);\n    return block;\n}\n/**\n * AES-W (base for AESKW/AESKWP).\n * Specs:\n * {@link https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-38F.pdf | SP800-38F},\n * {@link https://www.rfc-editor.org/rfc/rfc3394 | RFC 3394},\n * {@link https://www.rfc-editor.org/rfc/rfc5649 | RFC 5649}.\n * Shared core mutates `out` in place; callers are responsible for prepending\n * the right IV/AIV and checking the recovered value after decrypt.\n */\nconst AESW = {\n    /*\n    High-level pseudocode:\n    ```\n    A: u64 = IV\n    out = []\n    for (let i=0, ctr = 0; i<6; i++) {\n      for (const chunk of chunks(plaintext, 8)) {\n        A ^= swapEndianess(ctr++)\n        [A, res] = chunks(encrypt(A || chunk), 8);\n        out ||= res\n      }\n    }\n    out = A || out\n    ```\n    Decrypt is the same, but reversed.\n    */\n    encrypt(kek, out) {\n        // Current implementation keeps RFC 3394/5649 `t` in a u32-shaped counter,\n        // so the shared core caps plaintext below 4 GiB even though the specs allow more.\n        if (out.length >= 2 ** 32)\n            throw new Error('plaintext should be less than 4gb');\n        const xk = expandKeyLE(kek);\n        // 16-byte `S = A || P[1]` is the RFC 5649 KWP special case for n=1;\n        // KW callers never reach it because KW requires at least two plaintext semiblocks.\n        if (out.length === 16)\n            encryptBlock(xk, out);\n        else {\n            const o32 = u32(out);\n            swap32IfBE(o32);\n            // prettier-ignore\n            let a0 = o32[0], a1 = o32[1]; // A\n            for (let j = 0, ctr = 1; j < 6; j++) {\n                for (let pos = 2; pos < o32.length; pos += 2, ctr++) {\n                    const { s0, s1, s2, s3 } = encrypt(xk, a0, a1, o32[pos], o32[pos + 1]);\n                    // A = MSB(64, B) ^ t where t = (n*j)+i. Under the 32-bit length cap\n                    // above, `t` fits in the low half of `[t]_64`, so xor only the low\n                    // 32 bits of A after converting `ctr` to network order.\n                    ((a0 = s0), (a1 = s1 ^ byteSwap(ctr)), (o32[pos] = s2), (o32[pos + 1] = s3));\n                }\n            }\n            ((o32[0] = a0), (o32[1] = a1)); // out = A || out\n            swap32IfBE(o32);\n        }\n        xk.fill(0);\n    },\n    decrypt(kek, out) {\n        // Same implementation cap on the recovered plaintext length after\n        // removing the 8-byte A/IV prefix.\n        if (out.length - 8 >= 2 ** 32)\n            throw new Error('ciphertext should be less than 4gb');\n        const xk = expandKeyDecLE(kek);\n        const chunks = out.length / 8 - 1; // first chunk is IV\n        // `n = 2` semiblocks is the RFC 5649 KWP special case; KW ciphertexts\n        // always have at least three semiblocks and therefore use the W^-1 loop.\n        if (chunks === 1)\n            decryptBlock(xk, out);\n        else {\n            const o32 = u32(out);\n            swap32IfBE(o32);\n            // prettier-ignore\n            let a0 = o32[0], a1 = o32[1]; // A\n            for (let j = 0, ctr = chunks * 6; j < 6; j++) {\n                for (let pos = chunks * 2; pos >= 1; pos -= 2, ctr--) {\n                    a1 ^= byteSwap(ctr);\n                    const { s0, s1, s2, s3 } = decrypt(xk, a0, a1, o32[pos], o32[pos + 1]);\n                    ((a0 = s0), (a1 = s1), (o32[pos] = s2), (o32[pos + 1] = s3));\n                }\n            }\n            ((o32[0] = a0), (o32[1] = a1));\n            swap32IfBE(o32);\n        }\n        xk.fill(0);\n    },\n};\n// RFC 3394 §2.2.3.1 / NIST SP 800-38F Algorithm 3 / Algorithm 4: KW prepends\n// the default 64-bit ICV1 and unwrap must verify the same value.\nconst AESKW_IV = /* @__PURE__ */ new Uint8Array(8).fill(0xa6); // A6A6A6A6A6A6A6A6\n/**\n * AES-KW (key-wrap). Injects static IV into plaintext, adds counter, encrypts 6 times.\n * Reduces block size from 16 to 8 bytes.\n * Plaintext must be a non-empty multiple of 8 bytes with minimum 16 bytes.\n * 8-byte inputs use aeskwp.\n * Wrapped ciphertext must be a multiple of 8 bytes with minimum 24 bytes.\n * For padded version, use aeskwp.\n * See {@link https://www.rfc-editor.org/rfc/rfc3394/ | RFC 3394} and\n * {@link https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-38F.pdf | NIST SP 800-38F}.\n * @param kek - AES key-encryption key.\n * @returns Key-wrap cipher instance.\n * As with other `wrapCipher(...)` wrappers, `encrypt()` is single-use per\n * instance.\n * @example\n * Wraps a 128-bit content-encryption key with a fresh key-encryption key.\n *\n * ```ts\n * import { aeskw } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const kek = randomBytes(16);\n * const cek = randomBytes(16);\n * const wrap = aeskw(kek);\n * wrap.encrypt(cek);\n * ```\n */\nexport const aeskw = /* @__PURE__ */ wrapCipher({ blockSize: 8 }, (kek) => ({\n    encrypt(plaintext) {\n        if (!plaintext.length || plaintext.length % 8 !== 0)\n            throw new Error('invalid plaintext length');\n        // RFC 3394 / NIST SP 800-38F define KW only for >=2 plaintext\n        // semiblocks; the 1-semiblock case belongs to RFC 5649 KWP.\n        if (plaintext.length === 8)\n            throw new Error('8-byte keys not allowed, use AESKWP');\n        const out = concatBytes(AESKW_IV, plaintext);\n        AESW.encrypt(kek, out);\n        return out;\n    },\n    decrypt(ciphertext) {\n        // ciphertext must be at least 24 bytes and a multiple of 8 bytes\n        // 24 because should have at least two block (1 iv + 2).\n        // Replace with 16 to enable '8-byte keys'\n        if (ciphertext.length % 8 !== 0 || ciphertext.length < 3 * 8)\n            throw new Error('invalid ciphertext length');\n        // AESW.decrypt() mutates its buffer in place, so keep caller ciphertext\n        // immutable across the unwrap, ICV1 check, and IV scrubbing below.\n        const out = copyBytes(ciphertext);\n        AESW.decrypt(kek, out);\n        if (!equalBytes(out.subarray(0, 8), AESKW_IV))\n            throw new Error('integrity check failed');\n        out.subarray(0, 8).fill(0); // ciphertext.subarray(0, 8) === IV, but we clean it anyway\n        return out.subarray(8);\n    },\n}));\n/*\nWe don't support 8-byte keys. The rabbit hole:\n\n- Wycheproof says: \"NIST SP 800-38F does not define the wrapping of 8 byte keys.\n  RFC 3394 Section 2  on the other hand specifies that 8 byte keys are wrapped\n  by directly encrypting one block with AES.\"\n    - {@link https://github.com/C2SP/wycheproof/blob/master/doc/key_wrap.md | Wycheproof key-wrap note}\n    - \"RFC 3394 specifies in Section 2, that the input for the key wrap\n      algorithm must be at least two blocks and otherwise the constant\n      field and key are simply encrypted with ECB as a single block\"\n- What RFC 3394 actually says (in Section 2):\n    - \"Before being wrapped, the key data is parsed into n blocks of 64 bits.\n      The only restriction the key wrap algorithm places on n is that n be\n      at least two\"\n    - \"For key data with length less than or equal to 64 bits, the constant\n      field used in this specification and the key data form a single\n      128-bit codebook input making this key wrap unnecessary.\"\n- Which means \"assert(n >= 2)\" and \"use something else for 8 byte keys\"\n- NIST SP800-38F actually prohibits 8-byte in \"5.3.1 Mandatory Limits\".\n  It states that plaintext for KW should be \"2 to 2^54 -1 semiblocks\".\n- So, where does \"directly encrypt single block with AES\" come from?\n    - Not RFC 3394. Pseudocode of key wrap in 2.2 explicitly uses\n      loop of 6 for any code path\n    - There is a weird W3C spec:\n      {@link https://www.w3.org/TR/2002/REC-xmlenc-core-20021210/Overview.html#kw-aes128 | XML Encryption AES key-wrap section}\n    - This spec is outdated, as admitted by Wycheproof authors\n    - There is RFC 5649 for padded key wrap, which is padding construction on\n      top of AESKW. In '4.1.2' it says: \"If the padded plaintext contains exactly\n      eight octets, then prepend the AIV as defined in Section 3 above to P[1] and\n      encrypt the resulting 128-bit block using AES in ECB mode [Modes] with key\n      K (the KEK).  In this case, the output is two 64-bit blocks C[0] and C[1]:\"\n    - Browser subtle crypto is actually crashes on wrapping keys less than 16 bytes:\n      `Error: error:1C8000E6:Provider routines::invalid input length]\n       { opensslErrorStack: [ 'error:030000BD:digital envelope routines::update error' ]`\n\nIn the end, seems like a bug in Wycheproof.\nThe 8-byte check can be easily disabled inside of AES_W.\n*/\n// RFC 5649 §3 / NIST SP 800-38F Algorithm 5 / Algorithm 6: KWP uses ICV2 as\n// the high 32 bits of the AIV; the low 32 bits carry the MLI in network order.\nconst AESKWP_IV = 0xa65959a6; // single u32le value\n/**\n * AES-KW, but with padding and allows random keys.\n * Uses the RFC 5649 alternative initial value; the second u32 stores the\n * 32-bit MLI in network order.\n * Wrapped ciphertext must be at least 16 bytes; malformed lengths are\n * rejected during AIV/padding checks.\n * See {@link https://www.rfc-editor.org/rfc/rfc5649 | RFC 5649}.\n * @param kek - AES key-encryption key.\n * @returns Padded key-wrap cipher instance.\n * @example\n * Wraps a short key blob using the padded variant and a fresh key-encryption key.\n *\n * ```ts\n * import { aeskwp } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const kek = randomBytes(16);\n * const wrap = aeskwp(kek);\n * wrap.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const aeskwp = /* @__PURE__ */ wrapCipher({ blockSize: 8 }, (kek) => ({\n    encrypt(plaintext) {\n        if (!plaintext.length)\n            throw new Error('invalid plaintext length');\n        const padded = Math.ceil(plaintext.length / 8) * 8;\n        const out = new Uint8Array(8 + padded);\n        out.set(plaintext, 8);\n        const out32 = u32(out);\n        out32[0] = swap8IfBE(AESKWP_IV);\n        // RFC 5649 §3: the low 32 bits of the AIV carry the octet-length MLI in\n        // network order, even though this buffer is addressed through LE u32s.\n        out32[1] = swap8IfBE(byteSwap(plaintext.length));\n        AESW.encrypt(kek, out);\n        return out;\n    },\n    decrypt(ciphertext) {\n        // 16 because should have at least one block\n        if (ciphertext.length < 16)\n            throw new Error('invalid ciphertext length');\n        // AESW.decrypt() mutates its buffer in place, so keep caller ciphertext\n        // immutable across the unwrap, AIV checks, and IV scrubbing below.\n        const out = copyBytes(ciphertext);\n        const o32 = u32(out);\n        AESW.decrypt(kek, out);\n        const len = byteSwap(swap8IfBE(o32[1])) >>> 0;\n        const padded = Math.ceil(len / 8) * 8;\n        if (swap8IfBE(o32[0]) !== AESKWP_IV || out.length - 8 !== padded)\n            throw new Error('integrity check failed');\n        // RFC 5649 §3 / NIST SP 800-38F Algorithm 6: recovered padding length\n        // must be in [0,7], and every recovered pad octet must be zero.\n        for (let i = len; i < padded; i++)\n            if (out[8 + i] !== 0)\n                throw new Error('integrity check failed');\n        out.subarray(0, 8).fill(0); // ciphertext.subarray(0, 8) === IV, but we clean it anyway\n        return out.subarray(8, 8 + len);\n    },\n}));\nclass _AesCtrDRBG {\n    blockLen;\n    key;\n    nonce;\n    state;\n    reseedCnt;\n    constructor(keyLen, seed, personalization) {\n        this.blockLen = ctr.blockSize;\n        const keyLenBytes = keyLen / 8;\n        const nonceLen = 16;\n        // Store the full seedlen state as key || V so CTR_DRBG_Update-style steps\n        // can rewrite the entire internal state in place.\n        this.state = new Uint8Array(keyLenBytes + nonceLen);\n        this.key = this.state.subarray(0, keyLenBytes);\n        this.nonce = this.state.subarray(keyLenBytes, keyLenBytes + nonceLen);\n        this.reseedCnt = 1;\n        // Keep the stored counter one step ahead of SP 800-90A's formal V so\n        // ctr(key, nonce) uses the next counter block directly.\n        incBytes(this.nonce, false, 1);\n        this.addEntropy(seed, personalization);\n    }\n    update(data) {\n        // cannot re-use state here, because we will wipe current key\n        ctr(this.key, this.nonce).encrypt(new Uint8Array(this.state.length), this.state);\n        if (data) {\n            abytes(data);\n            // CTR_DRBG without a derivation function pads shorter additional_input\n            // with zeros to seedlen, so XOR only the provided prefix here.\n            for (let i = 0; i < data.length; i++)\n                this.state[i] ^= data[i];\n        }\n        // Keep storing V+1 so the next ctr(key, nonce) call starts from the\n        // spec's post-update counter state.\n        incBytes(this.nonce, false, 1);\n    }\n    // Optional `info` is additional input XORed into the reseed block and is\n    // limited to the internal state width.\n    addEntropy(seed, info) {\n        abytes(seed, this.state.length, 'seed');\n        // Copy caller entropy before XORing in personalization/additional input,\n        // then wipe the mixed seed material after CTR_DRBG_Update consumes it.\n        const _seed = seed.slice();\n        if (info) {\n            abytes(info);\n            if (info.length > _seed.length)\n                throw new Error('info length is too big');\n            for (let i = 0; i < info.length; i++)\n                _seed[i] ^= info[i];\n        }\n        this.update(_seed);\n        _seed.fill(0);\n        this.reseedCnt = 1;\n    }\n    // Optional `info` is additional input for the pre/post-update steps; bytes\n    // SP 800-90A Rev. 1 CTR_DRBG without a derivation function limits\n    // additional_input to seedlen, which is exactly this internal state width.\n    randomBytes(len, info) {\n        anumber(len);\n        // SP 800-90A Table 3 caps AES CTR_DRBG requests at 2^16 bits = 65536 bytes.\n        if (len > 2 ** 16)\n            throw new Error('requested output is too big');\n        // The spec allows generate while reseed_counter == reseed_interval and increments afterwards.\n        if (this.reseedCnt > 2 ** 48)\n            throw new Error('entropy exhausted');\n        if (info) {\n            abytes(info);\n            if (info.length > this.state.length)\n                throw new Error('info length is too big');\n            this.update(info);\n        }\n        const res = new Uint8Array(len);\n        ctr(this.key, this.nonce).encrypt(res, res);\n        incBytes(this.nonce, false, Math.ceil(len / this.blockLen));\n        this.update(info);\n        this.reseedCnt++;\n        return res;\n    }\n    // Zeroes the current state and resets the counter, but does not make the\n    // instance unusable: later calls continue from the zeroed state.\n    clean() {\n        // `key` and `nonce` alias this backing buffer, so one fill wipes the full\n        // secret state in place.\n        this.state.fill(0);\n        this.reseedCnt = 0;\n    }\n}\n// Internal helper for the exported 128-bit and 256-bit aliases; other key\n// lengths are not validated here.\nconst createAesDrbg = (keyLen) => {\n    return (seed, personalization = undefined) => new _AesCtrDRBG(keyLen, seed, personalization);\n};\n/**\n * AES-CTR DRBG 128-bit - CSPRNG (cryptographically secure pseudorandom number generator).\n * It's best to limit usage to non-production, non-critical cases: for example, test-only.\n * @param seed - Initial 32-byte entropy input.\n * @param personalization - Optional personalization string.\n * @returns Seeded DRBG instance. The concrete methods also accept optional additional-input bytes.\n * @example\n * Seeds the test-only AES-CTR DRBG from fresh entropy and reads bytes from it.\n *\n * ```ts\n * import { rngAesCtrDrbg128 } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const seed = randomBytes(32);\n * const prg = rngAesCtrDrbg128(seed);\n * prg.randomBytes(8);\n * ```\n */\nexport const rngAesCtrDrbg128 = /* @__PURE__ */ createAesDrbg(128);\n/**\n * AES-CTR DRBG 256-bit - CSPRNG (cryptographically secure pseudorandom number generator).\n * It's best to limit usage to non-production, non-critical cases: for example, test-only.\n * @param seed - Initial 48-byte entropy input.\n * @param personalization - Optional personalization string.\n * @returns Seeded DRBG instance. The concrete methods also accept optional additional-input bytes.\n * @example\n * Seeds the test-only AES-CTR DRBG from fresh entropy and reads bytes from it.\n *\n * ```ts\n * import { rngAesCtrDrbg256 } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const seed = randomBytes(48);\n * const prg = rngAesCtrDrbg256(seed);\n * prg.randomBytes(8);\n * ```\n */\nexport const rngAesCtrDrbg256 = /* @__PURE__ */ createAesDrbg(256);\n//#region CMAC\n/**\n * Left-shift by one bit and conditionally XOR with 0x87:\n * ```\n * if MSB(L) is equal to 0\n * then    K1 := L << 1;\n * else    K1 := (L << 1) XOR const_Rb;\n * ```\n *\n * Specs:\n * {@link https://www.rfc-editor.org/rfc/rfc4493.html#section-2.3 | RFC 4493 Section 2.3},\n * {@link https://datatracker.ietf.org/doc/html/rfc5297.html#section-2.3 | RFC 5297 Section 2.3}\n *\n * @returns modified `block` (for chaining)\n */\nfunction dbl(block) {\n    let carry = 0;\n    // Left shift by 1 bit\n    for (let i = BLOCK_SIZE - 1; i >= 0; i--) {\n        const newCarry = (block[i] & 0x80) >>> 7;\n        block[i] = (block[i] << 1) | carry;\n        carry = newCarry;\n    }\n    // XOR with 0x87 if there was a carry from the most significant bit.\n    // RFC 4493 §2.3 / RFC 5297 §2.1: 0x87 is const_Rb for doubling in the\n    // CMAC/S2V finite field with primitive polynomial x^128 + x^7 + x^2 + x + 1.\n    // Branchless: `carry` derives from secret CMAC subkey material.\n    block[BLOCK_SIZE - 1] ^= 0x87 & -carry;\n    return block;\n}\n/**\n * `a XOR b`, running in-place on `a`.\n * @param a left operand and output\n * @param b right operand\n * @returns `a` (for chaining)\n */\nfunction xorBlock(a, b) {\n    if (a.length !== b.length)\n        throw new Error('xorBlock: blocks must have same length');\n    for (let i = 0; i < a.length; i++) {\n        a[i] = a[i] ^ b[i];\n    }\n    return a;\n}\n/**\n * xorend as defined in\n * {@link https://datatracker.ietf.org/doc/html/rfc5297.html#section-2.1 | RFC 5297 Section 2.1}.\n *\n * ```\n * leftmost(A, len(A)-len(B)) || (rightmost(A, len(B)) xor B)\n * ```\n *\n * Mutates `a` in place so the left prefix stays untouched and only the\n * rightmost `len(B)` bytes are xored with `b`.\n */\nfunction xorend(a, b) {\n    if (b.length > a.length) {\n        throw new Error('xorend: expected len(B) <= len(A)');\n    }\n    // keep leftmost part of `a` unchanged\n    // and xor only the rightmost part:\n    const offset = a.length - b.length;\n    for (let i = 0; i < b.length; i++) {\n        a[offset + i] = a[offset + i] ^ b[i];\n    }\n    return a;\n}\n/**\n * Internal CMAC class.\n */\nclass _CMAC {\n    blockLen = BLOCK_SIZE;\n    outputLen = BLOCK_SIZE;\n    // CMAC can only decide between `K1` and `K2` once the true final block is known,\n    // so updates process older blocks eagerly but keep one pending block buffered.\n    buffer;\n    pos;\n    finished;\n    destroyed;\n    k1;\n    k2;\n    x;\n    x32;\n    xk;\n    constructor(key) {\n        abytes(key);\n        validateKeyLength(key);\n        this.xk = expandKeyLE(key);\n        this.buffer = new Uint8Array(BLOCK_SIZE);\n        this.pos = 0;\n        this.finished = false;\n        this.destroyed = false;\n        this.x = new Uint8Array(BLOCK_SIZE);\n        // Cached word view over `x`: process() runs once per 16 input bytes, so\n        // it must not re-create views or re-validate per block like encryptBlock().\n        this.x32 = u32(this.x);\n        // L = AES_encrypt(K, const_Zero)\n        const L = new Uint8Array(BLOCK_SIZE);\n        encryptBlock(this.xk, L);\n        // Generate subkeys K1 and K2 from the main key according to\n        // {@link https://www.rfc-editor.org/rfc/rfc4493.html#section-2.3 | RFC 4493 Section 2.3}\n        // K1\n        this.k1 = dbl(L);\n        this.k2 = dbl(new Uint8Array(this.k1));\n    }\n    // Consumes 16 bytes of `data` starting at `pos`; `pos` avoids a per-block\n    // subarray view allocation in update().\n    process(data, pos) {\n        // RFC 4493 §2.4 step 6 loop body: Y := X XOR M_i; X := AES-128(K, Y).\n        const { x, x32, xk } = this;\n        for (let i = 0; i < BLOCK_SIZE; i++)\n            x[i] ^= data[pos + i];\n        swap32IfBE(x32);\n        const { s0, s1, s2, s3 } = encrypt(xk, x32[0], x32[1], x32[2], x32[3]);\n        ((x32[0] = s0), (x32[1] = s1), (x32[2] = s2), (x32[3] = s3));\n        swap32IfBE(x32);\n    }\n    update(data) {\n        aexists(this);\n        abytes(data);\n        let pos = 0;\n        if (this.pos) {\n            const take = Math.min(BLOCK_SIZE - this.pos, data.length);\n            this.buffer.set(data.subarray(0, take), this.pos);\n            this.pos += take;\n            pos = take;\n            if (this.pos === BLOCK_SIZE && pos < data.length) {\n                this.process(this.buffer, 0);\n                this.pos = 0;\n            }\n        }\n        // Keep one complete block buffered: an exact 16-byte tail may still be\n        // M_n, and digestInto() must decide there whether RFC 4493 uses K1 or K2.\n        while (pos + BLOCK_SIZE < data.length) {\n            this.process(data, pos);\n            pos += BLOCK_SIZE;\n        }\n        if (pos < data.length) {\n            this.buffer.set(data.subarray(pos), 0);\n            this.pos = data.length - pos;\n        }\n        return this;\n    }\n    // See {@link https://www.rfc-editor.org/rfc/rfc4493.html#section-2.4 | RFC 4493 Section 2.4}.\n    digestInto(out) {\n        aexists(this);\n        // `digestInto(out)` is the no-allocation fast path, so AES block re-use below\n        // requires a 32-bit-aligned caller buffer instead of hidden temp copies.\n        aoutput32(out, this);\n        this.finished = true;\n        // `digestInto()` accepts out.length >= outputLen, so only the first block stores the tag.\n        const view = out.subarray(0, this.outputLen);\n        let last = new Uint8Array(BLOCK_SIZE);\n        if (this.pos === BLOCK_SIZE) {\n            // M_last := M_n XOR K1;\n            last.set(this.buffer);\n            xorBlock(last, this.k1);\n        }\n        else {\n            // M_last := padding(M_n) XOR K2;\n            //\n            // [...] padding(x) is the concatenation of x and a single '1',\n            // followed by the minimum number of '0's, so that the total length is\n            // equal to 128 bits.\n            last.set(this.buffer.subarray(0, this.pos));\n            last[this.pos] = 0x80; // single '1' bit\n            xorBlock(last, this.k2);\n        }\n        view.set(this.x); // X := AES_CBC(K, M_1..M_{n-1})\n        xorBlock(view, last); // Y := X XOR M_last\n        encryptBlock(this.xk, view); // T := AES-128(K, Y)\n        clean(last);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        // Copy out before destroy() wipes the internal digest buffer in place.\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    destroy() {\n        const { buffer, destroyed, x, xk, k1, k2 } = this;\n        if (destroyed)\n            return;\n        this.destroyed = true;\n        // Wipe the buffered tail, chaining value, expanded AES key, and both CMAC subkeys.\n        clean(buffer, x, xk, k1, k2);\n    }\n}\n/**\n * AES-CMAC (Cipher-based Message Authentication Code).\n * Specs: {@link https://www.rfc-editor.org/rfc/rfc4493.html | RFC 4493}.\n * @param msg - Message bytes to authenticate.\n * @param key - AES key bytes.\n * @returns 16-byte authentication tag. `cmac.create(...)` follows the same incremental MAC shape as\n * the other keyed helpers in this repo, including `blockLen`,\n * `outputLen`, `digestInto()` and `destroy()`.\n * @example\n * Authenticates a message with AES-CMAC and a fresh key.\n *\n * ```ts\n * import { cmac } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * cmac(new Uint8Array(), key);\n * ```\n */\n// The 16-byte probe key is only used to read static metadata; runtime CMAC\n// still accepts AES-128/192/256 keys.\nexport const cmac = /* @__PURE__ */ wrapMacConstructor(16, (key) => new _CMAC(key));\n/**\n * S2V (Synthetic Initialization Vector) function as described in\n * {@link https://datatracker.ietf.org/doc/html/rfc5297.html#section-2.4 | RFC 5297 Section 2.4}.\n *\n * ```\n * S2V(K, S1, ..., Sn) {\n *   if n = 0 then\n *     return V = AES-CMAC(K, <one>)\n *   fi\n *   D = AES-CMAC(K, <zero>)\n *   for i = 1 to n-1 do\n *     D = dbl(D) xor AES-CMAC(K, Si)\n *   done\n *   if len(Sn) >= 128 then\n *     T = Sn xorend D\n *   else\n *     T = dbl(D) xor pad(Sn)\n *   fi\n *   return V = AES-CMAC(K, T)\n * }\n * ```\n *\n * S2V takes a key and a vector of strings S1, S2, ..., Sn and returns a 128-bit string.\n * The S2V function is used to generate a synthetic IV for AES-SIV.\n *\n * @param key - AES key (128, 192, or 256 bits)\n * @param strings - Array of byte arrays to process\n * @returns 128-bit synthetic IV\n */\nfunction s2v(key, strings) {\n    validateKeyLength(key);\n    const len = strings.length;\n    if (len > 127) {\n        // RFC 5297 §7 only proves S2V secure for at most 127 components; SIV\n        // spends one of those on the plaintext, leaving at most 126 AAD inputs.\n        throw new Error('s2v: expected <= 127 inputs');\n    }\n    if (len === 0)\n        return cmac(ONE_BLOCK, key);\n    // D = AES-CMAC(K, <zero>)\n    let d = cmac(EMPTY_BLOCK, key);\n    // for i = 1 to n-1 do\n    //   D = dbl(D) xor AES-CMAC(K, Si)\n    for (let i = 0; i < len - 1; i++) {\n        dbl(d);\n        const cmacResult = cmac(strings[i], key);\n        xorBlock(d, cmacResult);\n        clean(cmacResult);\n    }\n    const s_n = strings[len - 1];\n    // Earlier components are validated through cmac(...); validate the final one explicitly because\n    // the Uint8Array.from()/set() paths below would otherwise coerce array-like inputs silently.\n    abytes(s_n);\n    let t;\n    // if len(Sn) >= 128 then\n    if (s_n.byteLength >= BLOCK_SIZE) {\n        // T = Sn xorend D\n        t = xorend(Uint8Array.from(s_n), d);\n    }\n    else {\n        // pad(Sn):\n        const paddedSn = new Uint8Array(BLOCK_SIZE);\n        paddedSn.set(s_n);\n        paddedSn[s_n.length] = 0x80; // padding: 0x80 followed by zeros\n        // T = dbl(D) xor pad(Sn)\n        t = xorBlock(dbl(d), paddedSn);\n        clean(paddedSn);\n    }\n    // V = AES-CMAC(K, T)\n    const result = cmac(t, key);\n    clean(d, t);\n    return result;\n}\n/**\n * Use `gcmsiv` or `aessiv`.\n * @returns Never; always throws with the migration hint.\n * @throws If called; `siv()` is a removed v1 alias. {@link Error}\n * @example\n * `siv()` was removed in v2; use `gcmsiv()` for nonce-based SIV instead.\n *\n * ```ts\n * import { gcmsiv } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(16);\n * const nonce = randomBytes(12);\n * const cipher = gcmsiv(key, nonce);\n * cipher.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const siv = () => {\n    throw new Error('\"siv\" from v1 is now \"gcmsiv\"');\n};\n/**\n * **SIV**: Synthetic Initialization Vector (SIV) Authenticated Encryption\n * Nonce is derived from the plaintext and AAD using the S2V function.\n * Supports at most 126 AAD components. RFC 5297 nonce-based use is expressed by\n * passing the nonce as the final AAD component before the plaintext.\n * See {@link https://datatracker.ietf.org/doc/html/rfc5297.html | RFC 5297}.\n * @param key - 32-byte, 48-byte, or 64-byte key.\n * @param AAD - Additional authenticated data chunks (up to 126).\n * @returns AEAD cipher instance.\n * @example\n * Authenticates and encrypts plaintext with a fresh key without requiring unique nonces.\n *\n * ```ts\n * import { aessiv } from '@noble/ciphers/aes.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(32);\n * const cipher = aessiv(key);\n * cipher.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const aessiv = /* @__PURE__ */ wrapCipher({ blockSize: 16, tagLength: 16, withAAD: true }, function aessiv(key, ...AAD) {\n    // From RFC 5297: Section 6.1, 6.2, 6.3:\n    const PLAIN_LIMIT = limit('plaintext', 0, 2 ** 132);\n    const CIPHER_LIMIT = limit('ciphertext', 16, 2 ** 132 + 16);\n    if (AAD.length > 126) {\n        // RFC 5297 §2.6 / §2.7 / §7: SIV passes the plaintext as the last S2V\n        // component, so callers only get 126 associated-data components.\n        throw new Error('\"AAD\" expected <= 126 items');\n    }\n    AAD.forEach((aad) => abytes(aad));\n    abytes(key);\n    if (![32, 48, 64].includes(key.length))\n        throw new Error('\"aes key\" expected Uint8Array of length 32/48/64, got length=' + key.length);\n    // The key is split into equal halves, K1 = leftmost(K, len(K)/2) and\n    // K2 = rightmost(K, len(K)/2).  K1 is used for S2V and K2 is used for CTR.\n    // This borrows caller key/AAD buffers by reference; mutating them after\n    // construction changes future encrypt/decrypt results.\n    const k1 = key.subarray(0, key.length / 2);\n    const k2 = key.subarray(key.length / 2);\n    return {\n        // {@link https://datatracker.ietf.org/doc/html/rfc5297.html#section-2.6 | RFC 5297 Section 2.6}\n        encrypt(plaintext) {\n            PLAIN_LIMIT(plaintext.length);\n            const v = s2v(k1, [...AAD, plaintext]);\n            // clear out the 31st and 63rd (rightmost) bit:\n            const q = Uint8Array.from(v);\n            q[8] &= 0x7f;\n            q[12] &= 0x7f;\n            // encrypt:\n            const c = ctr(k2, q).encrypt(plaintext);\n            return concatBytes(v, c);\n        },\n        // {@link https://datatracker.ietf.org/doc/html/rfc5297.html#section-2.7 | RFC 5297 Section 2.7}\n        decrypt(ciphertext) {\n            CIPHER_LIMIT(ciphertext.length);\n            const v = ciphertext.subarray(0, BLOCK_SIZE);\n            const c = ciphertext.subarray(BLOCK_SIZE);\n            // clear out the 31st and 63rd (rightmost) bit:\n            const q = Uint8Array.from(v);\n            q[8] &= 0x7f;\n            q[12] &= 0x7f;\n            // decrypt:\n            const p = ctr(k2, q).decrypt(c);\n            // verify tag:\n            const t = s2v(k1, [...AAD, p]);\n            if (equalBytes(t, v)) {\n                return p;\n            }\n            else {\n                clean(p);\n                throw new Error('invalid siv tag');\n            }\n        },\n    };\n});\n//#endregion\n/**\n * Unsafe low-level internal methods. May change at any time.\n * Callers are expected to use reviewed expanded-key outputs, pass mutable and\n * aligned 16-byte blocks where required, and treat several helpers as in-place\n * mutations of their input buffers or counters.\n */\nexport const unsafe = /* @__PURE__ */ Object.freeze({\n    expandKeyLE,\n    expandKeyDecLE,\n    encrypt,\n    decrypt,\n    encryptBlock,\n    decryptBlock,\n    ctrCounter,\n    ctr32,\n    dbl,\n    xorBlock,\n    xorend,\n    s2v,\n});\nexport const __TESTS = /* @__PURE__ */ Object.freeze({\n    incBytes: incBytes,\n});\n","/**\n * ECIES over secp256k1 for on-chain payloads. Only the org's private key can\n * decrypt; every other reader — including Chromia nodes and Atbash — sees\n * ciphertext. Wire format is mirrored byte-for-byte in the dashboard\n * (`src/lib/chromia/ecies.ts`) — the SDK encrypts, the dashboard decrypts.\n *\n * Wire format (frozen — records exist on-chain under v1):\n *   version           1 byte   = 0x01\n *   ephemeral_pubkey  33 bytes   compressed secp256k1\n *   nonce             12 bytes\n *   ciphertext+tag    N bytes    AES-256-GCM (16-byte tag suffix)\n *\n * Fresh ephemeral keypair per message → forward secrecy against sender key\n * compromise. Three separate bindings close different substitutions:\n *   salt = ephemeral pubkey  — ties key to this handshake\n *   info = domain            — verdict payload can't be read as tool call\n *   aad  = domain|record_id  — payload can't be lifted onto another row\n */\n\nimport { secp256k1 } from \"@noble/curves/secp256k1.js\";\nimport { hexToBytes } from \"@noble/curves/utils.js\";\nimport { hkdf } from \"@noble/hashes/hkdf.js\";\nimport { sha256 } from \"@noble/hashes/sha2.js\";\nimport { gcm } from \"@noble/ciphers/aes.js\";\n\nconst FORMAT_VERSION = 0x01;\nconst EPH_PUBKEY_LEN = 33;\nconst NONCE_LEN = 12;\nconst GCM_TAG_LEN = 16;\nconst HEADER_LEN = 1 + EPH_PUBKEY_LEN + NONCE_LEN;\n\n/**\n * HKDF `info` — each domain derives a distinct key from the same handshake.\n * Must match dashboard's `EciesDomain` (`src/lib/chromia/ecies.ts`) exactly.\n */\nexport const EciesDomain = {\n  toolCall: \"atbash:chain-encryption:v1:toolcall\",\n  verdict: \"atbash:chain-encryption:v1:verdict\",\n  note: \"atbash:chain-encryption:v1:note\",\n  policy: \"atbash:chain-encryption:v1:policy\",\n  raw: \"atbash:chain-encryption:v1:raw\",\n} as const;\nexport type EciesDomain = (typeof EciesDomain)[keyof typeof EciesDomain];\n\nfunction deriveKey(\n  sharedPoint: Uint8Array,\n  ephPubKey: Uint8Array,\n  domain: EciesDomain,\n): Uint8Array {\n  // Byte 0 is the compressed-point parity prefix — carries no entropy.\n  const sharedX = sharedPoint.slice(1);\n  return hkdf(sha256, sharedX, ephPubKey, new TextEncoder().encode(domain), 32);\n}\n\nfunction normalizeHex(hex: string): string {\n  return hex.trim().replace(/^0x/i, \"\").toLowerCase();\n}\n\n/**\n * Encrypt `plaintext` so only the holder of `orgPubKeyHex` can read it.\n * `aad` binds the ciphertext to a specific record (pass the record id).\n */\nexport function encryptForOrg(\n  plaintext: string,\n  orgPubKeyHex: string,\n  aad: string,\n  domain: EciesDomain = EciesDomain.raw,\n): Uint8Array {\n  const orgPubKey = hexToBytes(normalizeHex(orgPubKeyHex));\n  if (orgPubKey.length !== EPH_PUBKEY_LEN) {\n    throw new Error(\n      `Invalid org public key: expected ${EPH_PUBKEY_LEN} bytes (compressed secp256k1), got ${orgPubKey.length}`,\n    );\n  }\n\n  const ephPrivKey = secp256k1.utils.randomSecretKey();\n  const ephPubKey = secp256k1.getPublicKey(ephPrivKey, true);\n  const key = deriveKey(secp256k1.getSharedSecret(ephPrivKey, orgPubKey, true), ephPubKey, domain);\n\n  const nonce = new Uint8Array(NONCE_LEN);\n  crypto.getRandomValues(nonce);\n\n  const aadBytes = new TextEncoder().encode(`${domain}|${aad}`);\n  const sealed = gcm(key, nonce, aadBytes).encrypt(\n    new TextEncoder().encode(plaintext),\n  );\n\n  const payload = new Uint8Array(HEADER_LEN + sealed.length);\n  payload[0] = FORMAT_VERSION;\n  payload.set(ephPubKey, 1);\n  payload.set(nonce, 1 + EPH_PUBKEY_LEN);\n  payload.set(sealed, HEADER_LEN);\n\n  return payload;\n}\n\n/**\n * Decrypt a payload from {@link encryptForOrg}. Throws on wrong key, wrong\n * `aad`, or tampering — GCM makes these indistinguishable.\n */\nexport function decryptForOrg(\n  payload: Uint8Array,\n  orgPrivKeyHex: string,\n  aad: string,\n  domain: EciesDomain = EciesDomain.raw,\n): string {\n  if (payload.length < HEADER_LEN + GCM_TAG_LEN) {\n    throw new Error(\"Malformed encrypted payload: too short\");\n  }\n\n  const version = payload[0];\n  if (version !== FORMAT_VERSION) {\n    throw new Error(\n      `Unsupported encrypted payload version: ${version} (expected ${FORMAT_VERSION})`,\n    );\n  }\n\n  const ephPubKey = payload.subarray(1, 1 + EPH_PUBKEY_LEN);\n  const nonce = payload.subarray(1 + EPH_PUBKEY_LEN, HEADER_LEN);\n  const sealed = payload.subarray(HEADER_LEN);\n\n  const orgPrivKey = hexToBytes(normalizeHex(orgPrivKeyHex));\n  const key = deriveKey(secp256k1.getSharedSecret(orgPrivKey, ephPubKey, true), ephPubKey, domain);\n\n  const aadBytes = new TextEncoder().encode(`${domain}|${aad}`);\n  const opened = gcm(key, nonce, aadBytes).decrypt(sealed);\n  return new TextDecoder().decode(opened);\n}\n\n/** Encrypted payload size for a given plaintext length — check against on-chain column cap. */\nexport function encryptedLength(plaintextByteLength: number): number {\n  return HEADER_LEN + plaintextByteLength + GCM_TAG_LEN;\n}\n","/**\n *   atb1.<key-fingerprint>.<claim-hash>.<base64 ciphertext>\n *\n * Normative spec: `core/src/crypto_envelope.rs`. This mirrors it for the browser.\n */\n\nconst PREFIX = \"atb1\";\nconst SEPARATOR = \".\";\n\nexport interface Envelope {\n  /** First 8 bytes of the recipient public key, hex. May be empty. */\n  keyFingerprint: string;\n  /** Commitment to the accompanying plaintext claims. May be empty. */\n  claimHash: string;\n  /** Raw ECIES payload. */\n  payload: Uint8Array;\n}\n\nfunction toBase64(bytes: Uint8Array): string {\n  let binary = \"\";\n  for (const b of bytes) binary += String.fromCharCode(b);\n  return btoa(binary);\n}\n\nfunction fromBase64(text: string): Uint8Array {\n  const binary = atob(text);\n  const out = new Uint8Array(binary.length);\n  for (let i = 0; i < binary.length; i++) out[i] = binary.charCodeAt(i);\n  return out;\n}\n\nexport function packEnvelope(\n  payload: Uint8Array,\n  keyFingerprint = \"\",\n  claimHash = \"\",\n): string {\n  return [PREFIX, keyFingerprint, claimHash, toBase64(payload)].join(SEPARATOR);\n}\n\nfunction fieldWidthOk(value: string, hexChars: number): boolean {\n  return value.length === 0\n    ? true\n    : value.length === hexChars && /^[0-9a-f]+$/.test(value);\n}\n\n/**\n * Stays true for a truncated envelope that `parseEnvelope` rejects — a severed\n * ciphertext is not plaintext, so callers must show a placeholder.\n */\nexport function isEnvelope(value: string): boolean {\n  if (typeof value !== \"string\" || !value.startsWith(PREFIX + SEPARATOR)) return false;\n  const parts = value.split(SEPARATOR);\n  return parts.length >= 4 && fieldWidthOk(parts[1], 16) && fieldWidthOk(parts[2], 64);\n}\n\n/** Null, not a throw — pre-encryption records are plaintext. */\nexport function parseEnvelope(value: string): Envelope | null {\n  if (!isEnvelope(value)) return null;\n  const [, keyFingerprint, claimHash, ...rest] = value.split(SEPARATOR);\n  try {\n    return { keyFingerprint, claimHash, payload: fromBase64(rest.join(SEPARATOR)) };\n  } catch {\n    return null;\n  }\n}\n\nexport function keyFingerprintOf(pubKeyHex: string): string {\n  return pubKeyHex.trim().replace(/^0x/i, \"\").toLowerCase().slice(0, 16);\n}\n","/** Pure-TS mirror of the core's signing, for the browser. Same columns as the core. */\n\nimport { secp256k1 } from \"@noble/curves/secp256k1.js\";\nimport { sha256 } from \"@noble/hashes/sha2.js\";\nimport { bytesToHex, hexToBytes } from \"@noble/curves/utils.js\";\nimport postchain from \"postchain-client\";\n\nimport { encryptForOrg, EciesDomain } from \"../crypto/ecies.js\";\nimport { packEnvelope, keyFingerprintOf } from \"../crypto/envelope.js\";\n\n// postchain-client's re-exported Buffer passes its internal `Buffer.isBuffer()`\n// check; a native Buffer silently encodes as a GTV dict and the chain rejects it.\nconst { Buffer: PolyBuffer, gtx: pcgtx } = postchain as typeof postchain & {\n  Buffer: { from: (data: Uint8Array) => Buffer };\n};\n\nconst MERKLE_HASH_VERSION = 2;\n\n/**\n * SHA-256 commitment to plaintext claims sent alongside the ciphertext. The\n * judge has no org key, so this signed op-arg is the only thing it can check\n * body-vs-ciphertext with. Array (not object) so key order can't drift. Must\n * match `claimHashHex` in dashboard `src/lib/api/judge/action-hash.ts`.\n */\nexport function claimHashHex(\n  toolName: string,\n  action: string,\n  context: string,\n  toolArgsJson: string,\n): string {\n  const canonical = JSON.stringify([\n    toolName.trim(),\n    normalizeActionForHash(action),\n    context.trim(),\n    toolArgsJson.trim(),\n  ]);\n  return bytesToHex(sha256(new TextEncoder().encode(canonical)));\n}\n\n/** Must match `column_aad` in the core — the label binds a ciphertext to its column. */\nexport function columnAad(toolCallId: string, column: string): string {\n  return `${toolCallId}:${column}`;\n}\n\n/**\n * Canonical action for the retry-cache hash. Must match dashboard's\n * `normalizeActionForHash` (`src/lib/api/judge/on-chain.ts`) — divergence\n * silently breaks YELLOW-hold retry resolution.\n */\nexport function normalizeActionForHash(action: string): string {\n  // Judge endpoint trims the action before validating, so hash the trimmed form.\n  action = action.trim();\n  try {\n    const parsed: unknown = JSON.parse(action);\n    if (parsed && typeof parsed === \"object\" && \"args\" in parsed) {\n      const obj = parsed as Record<string, unknown>;\n      const dynamicKeys = [\n        \"session_id\",\n        \"task_id\",\n        \"tool_call_id\",\n        \"turn_id\",\n        \"api_request_id\",\n      ];\n      if (dynamicKeys.some((k) => k in obj)) {\n        return JSON.stringify({ tool_name: obj.tool_name, args: obj.args });\n      }\n    }\n  } catch {\n    /* not JSON — hash the raw string */\n  }\n  return action;\n}\n\n/**\n * Mirrors `signOp` in `browser/native.ts` but accepts `Uint8Array` args so\n * `byte_array` params can be passed. Kept separate to match the Rust\n * function's `&[&str]` signature on the node side.\n */\nfunction signOpWithBytes(\n  opName: string,\n  args: readonly (string | Uint8Array)[],\n  privkeyHex: string,\n  blockchainRidHex: string,\n): string {\n  const priv = hexToBytes(privkeyHex.trim().replace(/^0x/i, \"\").toLowerCase());\n  if (priv.length !== 32) {\n    throw new Error(\"invalid private key\");\n  }\n  const ridBytes = hexToBytes(\n    blockchainRidHex.trim().replace(/^0x/i, \"\").toLowerCase(),\n  );\n  if (ridBytes.length !== 32) {\n    throw new Error(\"invalid blockchain rid — must be 32 bytes hex\");\n  }\n\n  const pub = secp256k1.getPublicKey(priv, true);\n  const encodedArgs = args.map((a) =>\n    typeof a === \"string\" ? a : PolyBuffer.from(a),\n  );\n\n  let g = pcgtx.emptyGtx(PolyBuffer.from(ridBytes));\n  g = pcgtx.addTransactionToGtx(opName, encodedArgs, g);\n  pcgtx.addSignerToGtx(PolyBuffer.from(pub), g);\n\n  // `prehash: false` — `getDigestToSign` already returns the SHA-256 digest.\n  const digest = pcgtx.getDigestToSign(g, MERKLE_HASH_VERSION);\n  const signature = secp256k1.sign(digest, priv, { prehash: false });\n  g = pcgtx.addSignature(PolyBuffer.from(pub), PolyBuffer.from(signature), g);\n\n  return pcgtx.serialize(g).toString(\"hex\");\n}\n\n/** @returns hex-encoded signed tx, ready to POST as `signed_log_tool_call`. */\nexport function signEncryptedToolCall(\n  toolCallId: string,\n  action: string,\n  context: string,\n  toolName: string,\n  toolArgsJson: string,\n  orgEncryptionPubKey: string,\n  privkeyHex: string,\n  blockchainRidHex: string,\n): string {\n  const fingerprint = keyFingerprintOf(orgEncryptionPubKey);\n  const seal = (text: string, column: string): string =>\n    text === \"\"\n      ? \"\"\n      : packEnvelope(\n          encryptForOrg(\n            text,\n            orgEncryptionPubKey,\n            columnAad(toolCallId, column),\n            EciesDomain.toolCall,\n          ),\n          fingerprint,\n        );\n\n  // The claim hash rides on `action_text` alone — it already commits to all four.\n  const actionColumn = packEnvelope(\n    encryptForOrg(\n      action,\n      orgEncryptionPubKey,\n      columnAad(toolCallId, \"action\"),\n      EciesDomain.toolCall,\n    ),\n    fingerprint,\n    claimHashHex(toolName, action, context, toolArgsJson),\n  );\n\n  return signOpWithBytes(\n    \"log_tool_call\",\n    [\n      toolCallId,\n      actionColumn,\n      seal(context, \"context\"),\n      toolName,\n      seal(toolArgsJson, \"tool_args\"),\n    ],\n    privkeyHex,\n    blockchainRidHex,\n  );\n}\n","/**\n * Judge endpoint validation. Rejects anything that could silently redirect\n * verdicts: non-https, embedded credentials, or hosts outside the trusted\n * allowlist. A self-hosted judge is allowed only when it also supplies a\n * response-signing pubkey so the SDK can detect a compromised judge.\n */\nimport { DEFAULT_ENDPOINT } from \"./constants.js\";\n\nexport type JudgeEndpointConfig =\n  | { policy?: \"default\"; endpoint?: string }\n  | { policy: \"self-hosted\"; endpoint: string; verifyPubKey: string };\n\nexport interface ValidatedEndpoint {\n  url: string;\n  policy: \"default\" | \"self-hosted\";\n  verifyPubKey: string | null;\n}\n\n/**\n * Builds the trusted judge host set.\n *\n * The compiled-in default is always trusted: a `prod` build resolves it to\n * atbash.ai, a dev build to whatever DEV_ENDPOINT was set at build time. No\n * dev host is spelled out in source, and dev builds still validate their own\n * default.\n *\n * Exported for tests only. The set is a build-time value and is deliberately\n * never read from the process environment — an env var would let anyone widen\n * the allowlist of an already-shipped artifact, which is the silent-redirection\n * attack the allowlist exists to prevent (F-003). Asserting that requires\n * calling this with the environment set, so it cannot stay module-private.\n *\n * @internal\n */\nexport function buildAllowedJudgeHosts(): ReadonlySet<string> {\n  return new Set([\n    \"atbash.ai\",\n    \"www.atbash.ai\",\n    new URL(DEFAULT_ENDPOINT).hostname.toLowerCase(),\n  ]);\n}\n\nconst ALLOWED_JUDGE_HOSTS: ReadonlySet<string> = buildAllowedJudgeHosts();\n\nexport function validateJudgeEndpoint(\n  judge?: JudgeEndpointConfig,\n): ValidatedEndpoint {\n  const policy: \"default\" | \"self-hosted\" =\n    judge?.policy === \"self-hosted\" ? \"self-hosted\" : \"default\";\n  const candidate = judge?.endpoint?.trim() || DEFAULT_ENDPOINT;\n\n  let parsed: URL;\n  try {\n    parsed = new URL(candidate);\n  } catch {\n    throw new Error(\n      `[atbash] invalid judge endpoint URL: ${candidate}. ` +\n        `Refusing to load — fix the URL or omit it to use the default (${DEFAULT_ENDPOINT}).`,\n    );\n  }\n\n  // Loopback carve-out: http://localhost or http://127.0.0.1 traffic\n  // never leaves the machine, so the MITM threat model that motivates\n  // the https-only rule doesn't apply. Needed for local-dev testing\n  // against a locally-running dashboard.\n  const isLoopback =\n    parsed.protocol === \"http:\" &&\n    (parsed.hostname === \"localhost\" ||\n      parsed.hostname === \"127.0.0.1\" ||\n      parsed.hostname === \"[::1]\" ||\n      parsed.hostname === \"::1\");\n  if (parsed.protocol !== \"https:\" && !isLoopback) {\n    throw new Error(\n      `[atbash] judge endpoint must use https:// (got \"${parsed.protocol}\"). ` +\n        `Refusing to load — plaintext endpoints leak verdicts and enable trivial MITM bypass.`,\n    );\n  }\n\n  if (parsed.username || parsed.password) {\n    throw new Error(\n      `[atbash] judge endpoint must not contain credentials (user:pass@host). ` +\n        `Refusing to load — credentials embedded in URLs leak to logs and process listings.`,\n    );\n  }\n\n  const normalisedUrl = parsed.origin;\n\n  if (policy === \"self-hosted\") {\n    const verifyPubKey = (judge as { verifyPubKey?: string } | undefined)\n      ?.verifyPubKey;\n    const key = verifyPubKey?.trim().toLowerCase();\n    if (!key || !/^[0-9a-f]{66}$/.test(key)) {\n      throw new Error(\n        `[atbash] judge endpoint policy \"self-hosted\" requires verifyPubKey ` +\n          `to be a 66-hex-char compressed secp256k1 pubkey. Refusing to load — ` +\n          `self-hosted judges must produce signed responses so the SDK can ` +\n          `detect a malicious or compromised judge.`,\n      );\n    }\n    return { url: normalisedUrl, policy, verifyPubKey: key };\n  }\n\n  // Loopback carve-out mirrors the http one above — traffic to localhost /\n  // 127.0.0.1 / ::1 never traverses an untrusted network, so the\n  // endpoint-redirection threat (F-003) doesn't apply.\n  if (!isLoopback && !ALLOWED_JUDGE_HOSTS.has(parsed.hostname.toLowerCase())) {\n    throw new Error(\n      `[atbash] judge endpoint hostname \"${parsed.hostname}\" is not in the trusted allowlist. ` +\n        `Allowed: ${[...ALLOWED_JUDGE_HOSTS].join(\", \")}. ` +\n        `To use a self-hosted judge, set BOTH policy=\"self-hosted\" AND verifyPubKey ` +\n        `to the 66-hex pubkey of your judge's response-signing key. ` +\n        `Refusing to load — silent endpoint redirection is a known attack vector (F-003).`,\n    );\n  }\n\n  return { url: normalisedUrl, policy, verifyPubKey: null };\n}\n","/**\n * SDK exceptions.\n *\n * `AtbashAPIError` is thrown for any non-2xx HTTP response from the judge or\n * risk-engine API. It surfaces the raw body in `Error.message` and appends\n * dashboard-aware hints for the common operational failure modes.\n */\nimport { DEFAULT_ENDPOINT } from \"./constants.js\";\n\nexport class AtbashAPIError extends Error {\n  /** HTTP status code (or 0 if the request never completed). */\n  readonly status: number;\n  /** Raw response body text (may be empty). */\n  readonly body: string;\n\n  constructor(\n    status: number,\n    body: string,\n    statusText = \"\",\n    endpoint: string = DEFAULT_ENDPOINT,\n  ) {\n    super(enrich(status, body, statusText, endpoint));\n    this.name = \"AtbashAPIError\";\n    this.status = status;\n    this.body = body;\n  }\n}\n\nexport class SignatureVerificationError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = \"SignatureVerificationError\";\n  }\n}\n\n/** Append dashboard-aware hints for common operational failure modes. */\nfunction enrich(\n  status: number,\n  body: string,\n  statusText: string,\n  endpoint: string,\n): string {\n  const dashboard = endpoint.replace(/\\/+$/, \"\") || DEFAULT_ENDPOINT;\n  let msg = `API error ${status}: ${body || statusText}`;\n  const lowered = body.toLowerCase();\n  if (lowered.includes(\"agent not registered\")) {\n    msg += `\\n  → Onboard the agent at ${dashboard}/risk-engine/agents`;\n  } else if (\n    lowered.includes(\"agent has no policy\") ||\n    lowered.includes(\"no policy configured\")\n  ) {\n    msg += `\\n  → Attach a policy at ${dashboard}/risk-engine/agents`;\n  } else if (\n    lowered.includes(\"agent is jailed\") ||\n    lowered.includes(\"jailed\")\n  ) {\n    msg += `\\n  → Unjail the agent at ${dashboard}/risk-engine/agents`;\n  } else if (\n    lowered.includes(\"audit tier\") ||\n    lowered.includes(\"verdict disabled\") ||\n    lowered.includes(\"verdict not supported\")\n  ) {\n    msg += `\\n  → Upgrade the org tier at ${dashboard}/risk-engine/settings`;\n  } else if (status >= 400 && status < 500) {\n    msg += `\\n  → Dashboard: ${dashboard}/risk-engine/feed`;\n  }\n  return msg;\n}\n","/**\n * Thin typed fetch wrapper.\n *\n * openapi-typescript emits types only (no runtime client), so this is the\n * single hand-written transport — generic `get`/`post` over global `fetch`\n * with a per-request timeout. The endpoint-specific request/response *shapes*\n * are pulled from the generated `schema.ts` at the call sites in client.ts, so\n * the wire contract still lives in spec/openapi.yaml. Methods return the raw\n * `Response` so the caller can read the exact bytes the server signed before\n * any decode (judge signature verification) — mirroring the Python surface's\n * use of raw httpx (DECISIONS 2026-05-22).\n */\nexport type QueryValue = string | number | boolean | undefined | null;\n\nexport class HttpClient {\n  readonly baseUrl: string;\n  readonly timeoutMs: number;\n\n  constructor(baseUrl: string, timeoutMs: number) {\n    this.baseUrl = baseUrl.replace(/\\/+$/, \"\");\n    this.timeoutMs = timeoutMs;\n  }\n\n  buildUrl(path: string, query?: Record<string, QueryValue>): string {\n    const url = new URL(this.baseUrl + path);\n    if (query) {\n      for (const [k, v] of Object.entries(query)) {\n        if (v !== undefined && v !== null && v !== \"\") {\n          url.searchParams.set(k, String(v));\n        }\n      }\n    }\n    return url.toString();\n  }\n\n  async get(\n    path: string,\n    query?: Record<string, QueryValue>,\n    headers?: Record<string, string>,\n  ): Promise<Response> {\n    return this.fetch(this.buildUrl(path, query), {\n      method: \"GET\",\n      ...(headers && { headers }),\n    });\n  }\n\n  async post(\n    path: string,\n    body: unknown,\n    headers?: Record<string, string>,\n  ): Promise<Response> {\n    return this.fetch(this.buildUrl(path), {\n      method: \"POST\",\n      headers: { \"Content-Type\": \"application/json\", ...headers },\n      body: JSON.stringify(body),\n    });\n  }\n\n  private async fetch(url: string, init: RequestInit): Promise<Response> {\n    return fetch(url, { ...init, signal: AbortSignal.timeout(this.timeoutMs) });\n  }\n}\n","/**\n * Browser stub for keyLoader. The Node version reads\n * `~/.config/atbash/guard-client-key` from disk; browsers have no filesystem,\n * so both operations throw. Callers should pass `agentKey` explicitly to\n * `Atbash.fromConfig` or use `new Atbash(privkey, opts)` directly.\n */\n\nimport type { AgentAuth } from \"../types.js\";\n\nconst NOT_AVAILABLE =\n  \"keyLoader is not available in the browser bundle — pass `agentKey` explicitly to Atbash.fromConfig or use `new Atbash(privkey, opts)`.\";\n\nexport function resolveKeyPath(_input?: string): string {\n  throw new Error(NOT_AVAILABLE);\n}\n\nexport function loadAgentFromFile(_keyPath?: string): AgentAuth {\n  throw new Error(NOT_AVAILABLE);\n}\n","/** Normalize wire shapes (verdict casing, status, pubkey) to canonical forms. */\nimport type { JudgmentState, Verdict } from \"./types.js\";\n\nexport function normalizeVerdict(raw: unknown): Verdict {\n  if (raw === null || raw === undefined) return \"No verdict\";\n  const v = String(raw).toUpperCase();\n  if (v === \"ALLOW\" || v === \"GREEN\") return \"ALLOW\";\n  if (v === \"HOLD\" || v === \"YELLOW\") return \"HOLD\";\n  if (v === \"BLOCK\" || v === \"RED\") return \"BLOCK\";\n  return \"HOLD\";\n}\n\nexport function normalizeStatus(raw: unknown): JudgmentState {\n  const s = String(raw ?? \"\").toLowerCase();\n  if (s === \"pending\" || s === \"answered\" || s === \"error\") return s;\n  return \"error\";\n}\n\n/** Wire pubkey may be a hex string, a Buffer/Uint8Array, or `{ data: [...] }`. */\nexport function pubkeyToHex(val: unknown): string {\n  if (!val) return \"\";\n  if (typeof val === \"string\") return val;\n  if (val instanceof Uint8Array) return Buffer.from(val).toString(\"hex\");\n  if (typeof val === \"object\") {\n    const data = (val as { data?: unknown }).data;\n    if (Array.isArray(data)) return Buffer.from(data).toString(\"hex\");\n  }\n  return \"\";\n}\n","/**\n * Browser stub for telemetry. The Node version reads\n * `~/.config/atbash/telemetry.json` for opt-out and pushes OTLP metrics to\n * Honeycomb. Browsers can't read the opt-out file and shouldn't ship\n * per-page-load metrics from every dashboard visitor. All calls are no-ops.\n */\n\nexport type ClientSource =\n  | \"cli\"\n  | \"sdk\"\n  | \"plugin:openclaw\"\n  | \"plugin:langchain\"\n  | \"plugin:langgraph\"\n  | \"plugin:hermes\"\n  | \"plugin:eliza\"\n  | \"plugin:crewai\"\n  | \"plugin:mcp\"\n  | \"plugin:autogen\"\n  | \"plugin:jeenai\"\n  | (string & {});\n\nexport interface TelemetryConfig {\n  enabled: boolean;\n  source?: ClientSource;\n  exportIntervalMs?: number;\n}\n\nexport function setupTelemetry(_config: TelemetryConfig): void {}\n\nexport function recordCall(\n  _functionName: string,\n  _source?: ClientSource,\n  _agentPubkey?: string,\n): void {}\n\nexport function recordDuration(\n  _functionName: string,\n  _durationMs: number,\n  _status: \"success\" | \"error\",\n  _source?: ClientSource,\n): void {}\n\nexport async function flushTelemetry(): Promise<void> {}\n\nexport async function shutdownTelemetry(): Promise<void> {}\n","/**\n * Browser stub for userConfig. The Node version reads\n * `~/.config/atbash/config.json` and env vars; browsers have neither, so\n * `resolve()` always falls through to the caller's explicit value.\n * `loadUserConfig()` returns `{}` and `saveUserConfig` throws.\n */\n\nexport interface AtbashUserConfig {\n  agentKey?: string;\n  orgName?: string;\n  judgeEndpoint?: string;\n  blockchainRid?: string;\n  provider?: string;\n  providerModel?: string;\n}\n\nconst NOT_AVAILABLE =\n  \"userConfig file I/O is not available in the browser bundle.\";\n\nexport function getConfigDir(): string {\n  throw new Error(NOT_AVAILABLE);\n}\n\nexport function getConfigPath(): string {\n  throw new Error(NOT_AVAILABLE);\n}\n\nexport function loadUserConfig(): AtbashUserConfig {\n  return {};\n}\n\nexport function saveUserConfig(_: AtbashUserConfig): void {\n  throw new Error(NOT_AVAILABLE);\n}\n\n/**\n * Browser resolve: returns the explicit `flagValue` if provided, else \"\".\n * There is no env fallback (browsers don't have `process.env`) and no config\n * file fallback. Callers must supply values explicitly at construction time.\n */\nexport function resolve(\n  _key: keyof AtbashUserConfig,\n  flagValue?: string,\n): string {\n  return flagValue ?? \"\";\n}\n","/**\n * `Atbash` — the Node SDK client. Composes the Rust core (signing, identity,\n * redaction; via NAPI) with the judge / risk-engine HTTP surface.\n *\n * For `/api/risk-engine` we parse the raw JSON ourselves: that endpoint is\n * RPC-style with `?action=`, and the spec encodes its response as a single\n * `oneOf` — generator dispatch is dict-ambiguous (TierInfo vs ToolCallFull).\n * Each method knows the action it called and casts deterministically.\n */\nimport { randomHex } from \"./random.js\";\n\nimport {\n  PRIVATE_CHAIN,\n  PUBLIC_CHAIN,\n  type ChainConfig,\n} from \"./chain-config.js\";\nimport { DEFAULT_CHROMIA_NODE_URLS, DEFAULT_ENDPOINT } from \"./constants.js\";\nimport { signEncryptedToolCall } from \"./encrypted-toolcall.js\";\nimport { validateJudgeEndpoint } from \"./endpoint.js\";\nimport { AtbashAPIError, SignatureVerificationError } from \"./errors.js\";\nimport { HttpClient, type QueryValue } from \"./http/client.js\";\nimport type { components } from \"./http/schema.js\";\nimport { loadAgentFromFile } from \"./keyLoader.js\";\nimport { native } from \"./native.js\";\nimport { normalizeStatus, normalizeVerdict, pubkeyToHex } from \"./normalize.js\";\nimport { recordCall, recordDuration } from \"./opentel/telemetry.js\";\nimport { resolve } from \"./userConfig.js\";\nimport type {\n  AgentAuth,\n  AgentPolicy,\n  AtbashLogger,\n  AtbashOptions,\n  ChainOpts,\n  Decision,\n  FromConfigOptions,\n  HeldAction,\n  HeldActionReview,\n  JudgeOptions,\n  JudgeResult,\n  JudgmentStatus,\n  KeyPair,\n  LogToolCallOptions,\n  LogToolCallResult,\n  Network,\n  OrgSubscription,\n  RedactResult,\n  TierInfo,\n  ToolCallFull,\n  ToolCallInput,\n  ToolCallRecord,\n} from \"./types.js\";\n\ntype JudgeRequestWire = components[\"schemas\"][\"JudgeRequest\"];\n\n/** `tc-<unix_ms>-<8 hex chars>`. */\nfunction generateToolCallId(): string {\n  return `tc-${Date.now()}-${randomHex(4)}`;\n}\n\nexport class Atbash {\n  readonly auth: AgentAuth;\n  readonly endpoint: string;\n  readonly nodeUrls: readonly string[];\n  readonly blockchainRid: string;\n  /** Default org name used by `auditToolCall` / `judgeAction`. */\n  readonly orgName?: string;\n  /** Default judge response-signing pubkey, if configured (see fromConfig). */\n  readonly verifyPubKey?: string;\n  /** Default org encryption key — see {@link AtbashOptions.orgEncryptionPubKey}. */\n  readonly orgEncryptionPubKey?: string;\n  /** When true (default), `auditToolCall` denies on any error. */\n  readonly failClosed: boolean;\n\n  /** Org key learned from the last agent-exists check, for this agent only. */\n  private _orgKeyFromChain: string | null = null;\n  private readonly logger: AtbashLogger;\n  private readonly http: HttpClient;\n  /**\n   * Per-client cache of resolved chains. Keyed by orgName so repeated\n   * calls don't re-hit the dashboard. Cleared by `clearChainCache()`.\n   */\n  private readonly _chainCache = new Map<string, ChainConfig>();\n  /**\n   * Cached bearer token for risk-engine / insurance read calls. Built\n   * lazily as a signed `log_tool_call` tx and refreshed every 4 min so\n   * server-side replay protection windows never expire it mid-session.\n   */\n  private _authBearer: { hex: string; issuedAt: number } | null = null;\n\n  constructor(privkey: string, options: AtbashOptions = {}) {\n    this.auth = native.loadAgent(privkey);\n    this.endpoint =\n      (options.endpoint ?? DEFAULT_ENDPOINT).replace(/\\/+$/, \"\") ||\n      DEFAULT_ENDPOINT;\n    this.nodeUrls = options.nodeUrls\n      ? [...options.nodeUrls]\n      : DEFAULT_CHROMIA_NODE_URLS;\n    this.blockchainRid = options.blockchainRid ?? native.DEFAULT_BLOCKCHAIN_RID;\n    this.orgName = options.orgName;\n    this.verifyPubKey = options.verifyPubKey;\n    this.orgEncryptionPubKey = options.orgEncryptionPubKey;\n    this.failClosed = options.failClosed !== false;\n    this.logger = options.logger ?? {};\n    this.http = new HttpClient(this.endpoint, options.timeoutMs ?? 30_000);\n\n    if (this.endpoint !== DEFAULT_ENDPOINT) {\n      this.logger.warn?.(\"[atbash] running on non-default judge endpoint\", {\n        endpoint: this.endpoint,\n        verifying: this.verifyPubKey\n          ? \"with response-signature pubkey configured\"\n          : \"without signature verification\",\n      });\n    }\n  }\n\n  /**\n   * Construct from resolved config: explicit overrides → env vars → the\n   * `~/.config/atbash/config.json` file (see userConfig.resolve). The private\n   * key comes from `agentKey` (override/env/file) or, failing that, the agent\n   * key file (`~/.config/atbash/guard-client-key`). The judge endpoint is\n   * validated against the trusted allowlist / self-hosted policy; a\n   * self-hosted endpoint's `verifyPubKey` becomes the client default.\n   */\n  static fromConfig(options: FromConfigOptions = {}): Atbash {\n    const validated = validateJudgeEndpoint(\n      options.judge ?? { endpoint: resolve(\"judgeEndpoint\") || undefined },\n    );\n\n    const agentKey = resolve(\"agentKey\", options.agentKey);\n    const auth: AgentAuth = agentKey\n      ? native.loadAgent(agentKey)\n      : loadAgentFromFile(options.keyPath);\n\n    const blockchainRid =\n      resolve(\"blockchainRid\", options.blockchainRid) || undefined;\n\n    return new Atbash(auth.privkey, {\n      endpoint: validated.url,\n      blockchainRid,\n      timeoutMs: options.timeoutMs,\n      nodeUrls: options.nodeUrls,\n      orgName: options.orgName,\n      verifyPubKey: validated.verifyPubKey ?? undefined,\n      failClosed: options.failClosed,\n      logger: options.logger,\n    });\n  }\n\n  get pubkey(): string {\n    return this.auth.pubkey;\n  }\n\n  get privkey(): string {\n    return this.auth.privkey;\n  }\n\n  /* ── agent existence (/api/ai/exists) ──────────────────────────────────── */\n\n  /**\n   * `GET /api/ai/exists?pubkey=…[&network=…]` — defaults to this client's\n   * pubkey. Pass `opts.network` when the caller already knows which\n   * network the agent lives on (e.g. after resolving via `orgName`) so\n   * the dashboard queries that chain directly instead of falling back\n   * across public → private, which double-round-trips and can return\n   * false negatives when the fallback chain client is misconfigured.\n   */\n  async checkAgentExists(\n    pubkey?: string,\n    opts?: { network?: Network },\n  ): Promise<boolean> {\n    const pk = pubkey ?? this.auth.pubkey;\n    return this.track(\"checkAgentExists\", pk, async () => {\n      const query: Record<string, string> = { pubkey: pk };\n      if (opts?.network) query.network = opts.network;\n      const resp = await this.http.get(\n        \"/api/ai/exists\",\n        query,\n        this.authHeaders(),\n      );\n      await this.raiseIfError(resp);\n      const data = (await this.json(resp)) as {\n        registered?: unknown;\n        org_encryption_pubkey?: unknown;\n      } | null;\n      if (pk === this.auth.pubkey) {\n        const key = data?.org_encryption_pubkey;\n        this._orgKeyFromChain = typeof key === \"string\" && key ? key : null;\n      }\n      return Boolean(data?.registered);\n    });\n  }\n\n  /* ── log_tool_call (sign-only) ─────────────────────────────────────────── */\n\n  /**\n   * Pre-flight `checkAgentExists`, then sign `log_tool_call` locally and\n   * return the signed tx hex. The server broadcasts to chain.\n   */\n  async logToolCall(\n    action: string,\n    context = \"\",\n    options: LogToolCallOptions = {},\n  ): Promise<LogToolCallResult> {\n    const start = performance.now();\n    recordCall(\"logToolCall\", undefined, this.auth.pubkey);\n\n    let exists: boolean;\n    try {\n      exists = await this.checkAgentExists(this.auth.pubkey, {\n        network: options.chainOpts?.network,\n      });\n    } catch (err) {\n      recordDuration(\"logToolCall\", performance.now() - start, \"error\");\n      return { success: false, toolCallId: null, error: errorMessage(err) };\n    }\n    if (!exists) {\n      recordDuration(\"logToolCall\", performance.now() - start, \"error\");\n      return {\n        success: false,\n        toolCallId: null,\n        error:\n          \"Agent not registered. Onboard the agent at the dashboard before \" +\n          \"submitting actions.\",\n      };\n    }\n\n    const toolCallId = generateToolCallId();\n    // Derive brid from full chainOpts (network → default brid, or explicit\n    // pin, or fall back to client default). Reading only .blockchainRid\n    // silently drops a `{ network: \"private\" }` hint and signs with the\n    // client's default (usually public) — breaking any judge that routes\n    // by the signed brid.\n    const brid = this.bridFromChainOpts(options.chainOpts);\n    // The contract refuses plaintext once an org registers a key, and a caller\n    // has no way to know that key — so fall back to the one the exists-check\n    // above just returned.\n    const orgKey =\n      options.orgEncryptionPubKey ?? this.orgEncryptionPubKey ?? this._orgKeyFromChain;\n    try {\n      const signedHex = orgKey\n        ? signEncryptedToolCall(\n            toolCallId,\n            action,\n            context,\n            options.toolName ?? \"\",\n            options.toolArgsJson ?? \"\",\n            orgKey,\n            this.auth.privkey,\n            brid,\n          )\n        : native.signLogToolCall(\n            toolCallId,\n            action,\n            context,\n            options.toolName ?? \"\",\n            options.toolArgsJson ?? \"\",\n            this.auth.privkey,\n            brid,\n          );\n      recordDuration(\"logToolCall\", performance.now() - start, \"success\");\n      return { success: true, toolCallId, signedHex };\n    } catch (err) {\n      recordDuration(\"logToolCall\", performance.now() - start, \"error\");\n      return { success: false, toolCallId: null, error: errorMessage(err) };\n    }\n  }\n\n  /* ── judge_action ──────────────────────────────────────────────────────── */\n\n  /**\n   * Sign log_tool_call + optionally judge_action, POST /api/v1/judge.\n   *\n   * `verifyPubKey` checks the `X-Atbash-Signature` header against the exact\n   * response bytes via the Rust core's `verifySignature`.\n   */\n  async judgeAction(\n    action: string,\n    context = \"\",\n    options: JudgeOptions = {},\n  ): Promise<JudgeResult> {\n    return this.track(\"judgeAction\", this.auth.pubkey, () =>\n      this._judgeAction(action, context, options),\n    );\n  }\n\n  private async _judgeAction(\n    action: string,\n    context: string,\n    options: JudgeOptions,\n  ): Promise<JudgeResult> {\n    if (!action?.trim()) {\n      throw new Error(\"action is required and cannot be empty.\");\n    }\n\n    // Resolve chain when orgName is provided. Order:\n    //   1. org_networks map (authoritative post-upgrade — wins over any\n    //      stale BRID hint on chainOpts).\n    //   2. Caller-pinned chainOpts.blockchainRid (no map entry).\n    //   3. Per-chain subscription resolution (no map, no pin).\n    let chainOpts: ChainOpts | undefined = options.chainOpts;\n    if (options.orgName) {\n      const mapNetwork = await this.getActiveNetworkForOrg(options.orgName);\n      if (mapNetwork) {\n        chainOpts = { network: mapNetwork };\n      } else if (!chainOpts?.blockchainRid) {\n        // No map entry — hand the fetched result (null) to the fallback\n        // resolver so it doesn't re-hit /api/org-network for the same org.\n        const resolved = await this.resolveChainFromMap(options.orgName, null);\n        chainOpts = { ...chainOpts, network: resolved.network };\n      }\n    }\n    const brid = this.bridFromChainOpts(chainOpts);\n\n    const logResult = await this.logToolCall(action, context, {\n      toolName: options.toolName,\n      toolArgsJson: options.toolArgsJson,\n      chainOpts,\n    });\n    if (!logResult.success || !logResult.toolCallId || !logResult.signedHex) {\n      throw new Error(logResult.error || \"Failed to sign log_tool_call\");\n    }\n\n    let signedJudgeAction: string | undefined;\n    if (!options.provider) {\n      const judgmentId = generateToolCallId();\n      signedJudgeAction = native.signJudgeAction(\n        judgmentId,\n        action,\n        context || \"\",\n        \"\",\n        this.auth.privkey,\n        brid,\n      );\n    }\n\n    const body: JudgeRequestWire = {\n      tool_call_id: logResult.toolCallId,\n      agent_pubkey: this.auth.pubkey,\n      action,\n      signed_log_tool_call: logResult.signedHex,\n    };\n    if (signedJudgeAction) body.signed_judge_action = signedJudgeAction;\n    if (context) body.context = context;\n    if (options.provider) body.provider = options.provider;\n    if (options.toolName) body.tool_name = options.toolName;\n    if (options.toolArgsJson) body.tool_args_json = options.toolArgsJson;\n    if (options.model) body.model = options.model;\n    // `resolved` bypasses redaction — the caller vouches for its\n    // contents. See JudgeRequest.resolved in spec/openapi.yaml.\n    if (options.resolved) body.resolved = options.resolved;\n    if (options.mode) body.mode = options.mode;\n\n    let resp: Response;\n    try {\n      resp = await this.http.post(\"/api/v1/judge\", body);\n    } catch (err) {\n      throw this.transportError(err);\n    }\n    if (!resp.ok) throw await this.httpError(resp);\n\n    // Read the raw bytes before any decode so signature verification runs\n    // against exactly what the server signed.\n    const bodyBytes = Buffer.from(await resp.arrayBuffer());\n    const verifyPubKey = options.verifyPubKey ?? this.verifyPubKey;\n    if (verifyPubKey !== undefined) {\n      const sig = resp.headers.get(\"X-Atbash-Signature\");\n      if (!sig) {\n        throw new SignatureVerificationError(\n          \"missing X-Atbash-Signature header\",\n        );\n      }\n      let ok: boolean;\n      try {\n        ok = native.verifySignature(bodyBytes, sig, verifyPubKey);\n      } catch (err) {\n        throw new SignatureVerificationError(\n          `signature verification threw: ${errorMessage(err)}`,\n        );\n      }\n      if (!ok) {\n        throw new SignatureVerificationError(\n          \"signature does not verify against configured verifyPubKey\",\n        );\n      }\n    }\n\n    const data = parseJson(bodyBytes) as Record<string, unknown>;\n    // `score` only appears on memory-scan responses. Coerce when\n    // present; leave undefined otherwise so callers can distinguish\n    // \"absent\" from \"invalid\" (NaN would collapse both).\n    const rawScore = data.score;\n    const score =\n      typeof rawScore === \"number\" && Number.isInteger(rawScore) && rawScore >= 1 && rawScore <= 10\n        ? rawScore\n        : undefined;\n    return {\n      verdict: normalizeVerdict(data.verdict),\n      actionType: String(data.action_type ?? \"\"),\n      reason: String(data.reason ?? \"\"),\n      confidence: Number(data.confidence ?? 0),\n      provider: String(data.provider ?? \"\"),\n      latencyMs: Number(data.latency_ms ?? 0),\n      toolCallId: String(data.tool_call_id ?? logResult.toolCallId),\n      onChain: Boolean(data.on_chain),\n      enforced: Boolean(data.enforced),\n      enforcementMode: String(data.enforcement_mode ?? \"\"),\n      status: String(data.status ?? \"\"),\n      score,\n    };\n  }\n\n  /* ── audit_tool_call (redact → judge → decision) ───────────────────────── */\n\n  /**\n   * High-level guard: redact secrets, submit for judgement, and collapse the\n   * result into an allow/deny `Decision`. Fails closed by default — any error\n   * (judge unreachable, unrecognized verdict) denies unless `failClosed` is\n   * explicitly false.\n   */\n  async auditToolCall(input: ToolCallInput): Promise<Decision> {\n    const toolName = input.toolName || \"unknown\";\n\n    // Redact secret-shaped values BEFORE signing so they never reach the\n    // signed bytes, the request body, the on-chain log, or the LLM prompt.\n    const argsRedaction = native.redactSecrets(stringifyArgs(input.args));\n    const ctxRedaction = native.redactSecrets(input.context ?? toolName);\n    const argsJson = argsRedaction.redacted;\n    const actionText = truncate(argsJson);\n    const contextText = ctxRedaction.redacted;\n    const totalRedactions =\n      argsRedaction.found.length + ctxRedaction.found.length;\n    if (totalRedactions > 0) {\n      const kinds = [\n        ...new Set([\n          ...argsRedaction.found.map((f) => f.kind),\n          ...ctxRedaction.found.map((f) => f.kind),\n        ]),\n      ];\n      this.logger.warn?.(\"[atbash] redacted secrets before judge call\", {\n        tool: toolName,\n        count: totalRedactions,\n        kinds,\n      });\n    }\n\n    try {\n      this.logger.info?.(\"[atbash] judge API called\", { tool: toolName });\n      const result = await this.judgeAction(actionText, contextText, {\n        toolName,\n        toolArgsJson: argsJson,\n        orgName: this.orgName,\n        // Passed through unredacted — caller vouches for the contents.\n        resolved: input.resolved,\n      });\n\n      // AUDIT tier — server returns no verdict (log only, no AI enforcement).\n      //\n      // A missing verdict on its own must NOT mean allow. `{}`, a truncated or\n      // empty body, a buggy judge, or a compromised endpoint all normalize to\n      // \"No verdict\" too, and treating those as ALLOW would silently disable\n      // the guardrail exactly when it is least trustworthy. Require the\n      // server's explicit AUDIT-tier marker (`status: \"logged\"`); anything else\n      // with an absent verdict fails closed via `fail()`.\n      if (result.verdict === \"No verdict\") {\n        if (result.status !== \"logged\") {\n          return this.fail(\n            `judge returned no verdict without an audit-tier marker (status: ${\n              result.status || \"absent\"\n            })`,\n            result.toolCallId,\n          );\n        }\n        return {\n          allow: true,\n          verdict: \"ALLOW\",\n          reason:\n            result.reason ||\n            \"audit tier — request logged on-chain, no AI enforcement\",\n          toolCallId: result.toolCallId,\n        };\n      }\n\n      const action = result.actionType;\n      if (action === \"block\") {\n        return {\n          allow: false,\n          verdict: \"BLOCK\",\n          reason: result.reason,\n          toolCallId: result.toolCallId,\n        };\n      }\n      if (action === \"hold_for_user_confirm\") {\n        return {\n          allow: false,\n          verdict: \"HOLD\",\n          reason: result.reason || \"held for human confirmation\",\n          toolCallId: result.toolCallId,\n        };\n      }\n      if (action === \"allow\") {\n        // If verdict conflicts with action_type (server confusion), respect the\n        // more restrictive signal rather than blindly allowing.\n        if (result.verdict === \"HOLD\") {\n          return {\n            allow: false,\n            verdict: \"HOLD\",\n            reason: result.reason,\n            toolCallId: result.toolCallId,\n          };\n        }\n        if (result.verdict === \"BLOCK\") {\n          return {\n            allow: false,\n            verdict: \"BLOCK\",\n            reason: result.reason,\n            toolCallId: result.toolCallId,\n          };\n        }\n        return {\n          allow: true,\n          verdict: \"ALLOW\",\n          reason: result.reason,\n          toolCallId: result.toolCallId,\n        };\n      }\n\n      return this.fail(\n        \"unrecognized action_type from judge\",\n        result.toolCallId,\n      );\n    } catch (err) {\n      const message = errorMessage(err);\n      this.logger.warn?.(\"[atbash] judge API failed\", { reason: message });\n      return this.fail(message);\n    }\n  }\n\n  private fail(reason: string, toolCallId?: string): Decision {\n    return { allow: !this.failClosed, verdict: \"ERROR\", reason, toolCallId };\n  }\n\n  /* ── judgment status ───────────────────────────────────────────────────── */\n\n  async getJudgmentStatus(\n    judgmentId: string,\n    agentPubkey?: string,\n  ): Promise<JudgmentStatus> {\n    const pk = agentPubkey ?? this.auth.pubkey;\n    return this.track(\"getJudgmentStatus\", pk, async () => {\n      const resp = await this.http.get(\n        \"/api/v1/judge\",\n        { tool_call_id: judgmentId, agent_pubkey: pk },\n        this.authHeaders(),\n      );\n      await this.raiseIfError(resp);\n      const data = ((await this.json(resp)) ?? {}) as Record<string, unknown>;\n      return {\n        status: normalizeStatus(data.status),\n        verdict: normalizeVerdict(data.verdict),\n        reason: String(data.reason ?? \"\"),\n        judgmentId: String(data.judgmentId ?? judgmentId),\n        onChain: optBool(data.onChain),\n        cached: optBool(data.cached),\n        responseTimeMs: optNumber(data.responseTimeMs),\n      };\n    });\n  }\n\n  /* ── risk-engine queries (action-dispatched GET) ───────────────────────── */\n\n  getToolCalls(maxCount: number): Promise<ToolCallRecord[]> {\n    return this.track(\"getToolCalls\", undefined, () =>\n      this.riskEngineRecords(\"tool-calls\", { limit: maxCount }),\n    );\n  }\n\n  getOrgToolCalls(\n    orgName: string,\n    maxCount: number,\n  ): Promise<ToolCallRecord[]> {\n    return this.track(\"getOrgToolCalls\", undefined, () =>\n      this.riskEngineRecords(\"org-tool-calls\", {\n        org: orgName,\n        limit: maxCount,\n      }),\n    );\n  }\n\n  getAgentToolCalls(\n    agentPubkey: string,\n    maxCount: number,\n  ): Promise<ToolCallRecord[]> {\n    return this.track(\"getAgentToolCalls\", agentPubkey, () =>\n      this.riskEngineRecords(\"agent-tool-calls\", {\n        agent: agentPubkey,\n        limit: maxCount,\n      }),\n    );\n  }\n\n  async getToolCallCount(): Promise<number> {\n    return this.track(\"getToolCallCount\", undefined, async () => {\n      const raw = await this.riskEngineGet(\"tool-call-count\", {});\n      const n = Number(raw);\n      return Number.isFinite(n) ? n : 0;\n    });\n  }\n\n  async getToolCallFull(toolCallId: string): Promise<ToolCallFull | null> {\n    return this.track(\"getToolCallFull\", undefined, async () => {\n      const raw = await this.riskEngineGet(\"tool-call-full\", {\n        tool_call_id: toolCallId,\n      });\n      if (!isRecord(raw)) return null;\n      return toToolCallFull(raw);\n    });\n  }\n\n  async getOrgTierInfo(orgName: string): Promise<TierInfo | null> {\n    return this.track(\"getOrgTierInfo\", undefined, async () => {\n      const raw = await this.riskEngineGet(\"org-tier-info\", { org: orgName });\n      if (!isRecord(raw)) return null;\n      return {\n        orgName: String(raw.org_name ?? \"\"),\n        tier: String(raw.tier ?? \"\"),\n        verdictEnabled: Boolean(raw.verdict_enabled),\n        enforcementEnabled: Boolean(raw.enforcement_enabled),\n      };\n    });\n  }\n\n  async getPendingHeldActions(\n    orgName: string,\n    maxCount: number,\n  ): Promise<HeldAction[]> {\n    return this.track(\"getPendingHeldActions\", undefined, async () => {\n      const raw = await this.riskEngineGet(\"pending-held-actions\", {\n        org: orgName,\n        limit: maxCount,\n      });\n      if (!Array.isArray(raw)) return [];\n      return raw.map((item) => toHeldAction(item as Record<string, unknown>));\n    });\n  }\n\n  async getHeldActionReviews(\n    orgName: string,\n    maxCount: number,\n  ): Promise<HeldActionReview[]> {\n    return this.track(\"getHeldActionReviews\", undefined, async () => {\n      const raw = await this.riskEngineGet(\"held-action-reviews\", {\n        org: orgName,\n        limit: maxCount,\n      });\n      if (!Array.isArray(raw)) return [];\n      return raw.map((item) =>\n        toHeldActionReview(item as Record<string, unknown>),\n      );\n    });\n  }\n\n  /* ── risk-engine batched (action-dispatched POST) ──────────────────────── */\n\n  getAgentDetail(agentPubkey: string): Promise<Record<string, unknown>> {\n    return this.track(\"getAgentDetail\", agentPubkey, () =>\n      this.riskEnginePost({ action: \"agent-detail-batch\", agent: agentPubkey }),\n    );\n  }\n\n  async getAgentPolicy(agentPubkey: string): Promise<AgentPolicy> {\n    return this.track(\"getAgentPolicy\", agentPubkey, async () => {\n      const raw = await this.riskEnginePost({\n        action: \"agent-policy-batch\",\n        agent: agentPubkey,\n      });\n      return {\n        policy: String(raw.policy ?? \"\"),\n        isJailed: Boolean(raw.is_jailed),\n        isCustom: Boolean(raw.is_custom),\n        defaultPolicy: String(raw.default_policy ?? \"\"),\n      };\n    });\n  }\n\n  /* ── safety stats (/api/insurance?action=safety-stats) ─────────────────── */\n\n  async getSafetyStats(): Promise<Record<string, unknown>> {\n    return this.track(\"getSafetyStats\", undefined, async () => {\n      const resp = await this.http.get(\n        \"/api/insurance\",\n        { action: \"safety-stats\" },\n        this.authHeaders(),\n      );\n      await this.raiseIfError(resp);\n      const data = ((await this.json(resp)) ?? {}) as Record<string, unknown>;\n      // TS unwraps `.data` when present.\n      if (isRecord(data.data)) return data.data;\n      return data;\n    });\n  }\n\n  /* ── chain resolution (org → chain) ────────────────────────────────────── */\n\n  /**\n   * Org's subscription on a specific chain. The `network` arg selects\n   * which chain to query; without it, the dashboard picks the default.\n   * Returns null when the org has no record on that chain.\n   */\n  async getOrgSubscription(\n    orgName: string,\n    network?: Network,\n  ): Promise<OrgSubscription | null> {\n    return this.track(\"getOrgSubscription\", undefined, async () => {\n      const params: Record<string, QueryValue> = { org: orgName };\n      if (network) params.network = network;\n      const raw = await this.riskEngineGet(\"org-subscription\", params);\n      if (!isRecord(raw)) return null;\n      return coerceOrgSubscription(raw, orgName);\n    });\n  }\n\n  /**\n   * Read the org's active network from the dashboard's off-chain\n   * `org_networks` map. The map is the authoritative source after a\n   * plan switch — subscription rows on the source chain go stale, but\n   * the map is updated on every assign. Returns null when there's no\n   * entry (caller falls back to per-chain subscription resolution).\n   */\n  async getActiveNetworkForOrg(orgName: string): Promise<Network | null> {\n    try {\n      const resp = await this.http.get(\n        \"/api/org-network\",\n        { org: orgName },\n        this.authHeaders(),\n      );\n      if (resp.status !== 200) return null;\n      const data = (await this.json(resp)) as {\n        network?: string | null;\n      } | null;\n      if (data?.network === \"public\" || data?.network === \"private\") {\n        return data.network;\n      }\n      return null;\n    } catch {\n      return null;\n    }\n  }\n\n  /**\n   * Resolve which chain an org's actions should run against. Cached\n   * per-client by orgName. Resolution order:\n   *   1. `org_networks` map (authoritative).\n   *   2. Per-chain subscription fallback — public + private records\n   *      are fetched in parallel, with `is_private_blockchain` and\n   *      `assigned_at` reconciling mixed states.\n   * Defaults to the public chain when nothing else resolves.\n   */\n  async resolveChainForOrg(orgName: string): Promise<ChainConfig> {\n    const cached = this._chainCache.get(orgName);\n    if (cached) return cached;\n    const mapNetwork = await this.getActiveNetworkForOrg(orgName);\n    return this.resolveChainFromMap(orgName, mapNetwork);\n  }\n\n  /**\n   * Resolve a chain given an already-fetched `org_networks` map result.\n   * Split out from {@link resolveChainForOrg} so callers that have already\n   * queried the map (the judge path) don't fetch /api/org-network twice.\n   * Caches per orgName like its caller.\n   */\n  private async resolveChainFromMap(\n    orgName: string,\n    mapNetwork: Network | null,\n  ): Promise<ChainConfig> {\n    const cached = this._chainCache.get(orgName);\n    if (cached) return cached;\n\n    if (mapNetwork) {\n      const chain = mapNetwork === \"private\" ? PRIVATE_CHAIN : PUBLIC_CHAIN;\n      this._chainCache.set(orgName, chain);\n      return chain;\n    }\n\n    // Fallback: both subscription rows can exist after a plan switch\n    // because `admin_assign_subscription` writes only to the destination\n    // chain. Reconcile with `is_private_blockchain` + `assigned_at`.\n    try {\n      const [pubSub, privSub] = await Promise.all([\n        this.getOrgSubscription(orgName, \"public\").catch(() => null),\n        this.getOrgSubscription(orgName, \"private\").catch(() => null),\n      ]);\n\n      if (pubSub?.is_private_blockchain) {\n        this._chainCache.set(orgName, PRIVATE_CHAIN);\n        return PRIVATE_CHAIN;\n      }\n      if (pubSub && privSub) {\n        const chain =\n          privSub.assigned_at > pubSub.assigned_at\n            ? PRIVATE_CHAIN\n            : PUBLIC_CHAIN;\n        this._chainCache.set(orgName, chain);\n        return chain;\n      }\n      if (pubSub) {\n        this._chainCache.set(orgName, PUBLIC_CHAIN);\n        return PUBLIC_CHAIN;\n      }\n      if (privSub?.is_private_blockchain) {\n        this._chainCache.set(orgName, PRIVATE_CHAIN);\n        return PRIVATE_CHAIN;\n      }\n    } catch {\n      // Fall through to public default if subscription lookup fails.\n    }\n    this._chainCache.set(orgName, PUBLIC_CHAIN);\n    return PUBLIC_CHAIN;\n  }\n\n  /** Drop any cached chain resolutions. Useful in tests. */\n  clearChainCache(): void {\n    this._chainCache.clear();\n  }\n\n  /* ── internals ─────────────────────────────────────────────────────────── */\n\n  /**\n   * Wrap an SDK method body in telemetry — records the call at start\n   * and a success/error duration at end. Re-throws on failure so the\n   * caller sees the original exception. Pass `agentPubkey` when the\n   * method is keyed to a specific agent; tracked methods that don't\n   * depend on an agent (read queries) pass `undefined`.\n   */\n  private async track<T>(\n    name: string,\n    agentPubkey: string | undefined,\n    fn: () => Promise<T>,\n  ): Promise<T> {\n    const start = performance.now();\n    recordCall(name, undefined, agentPubkey);\n    try {\n      const result = await fn();\n      recordDuration(name, performance.now() - start, \"success\");\n      return result;\n    } catch (err) {\n      recordDuration(name, performance.now() - start, \"error\");\n      throw err;\n    }\n  }\n\n  /**\n   * Pick the BRID for a given per-call chain override. `blockchainRid`\n   * takes precedence; otherwise `network` maps to one of the known\n   * chains; otherwise the client's default.\n   */\n  private bridFromChainOpts(chainOpts?: ChainOpts): string {\n    if (chainOpts?.blockchainRid) return chainOpts.blockchainRid;\n    if (chainOpts?.network === \"private\") return PRIVATE_CHAIN.blockchainRid;\n    if (chainOpts?.network === \"public\") return PUBLIC_CHAIN.blockchainRid;\n    return this.blockchainRid;\n  }\n\n  /**\n   * Get-or-create a Bearer token for dashboard reads. The token is a\n   * signed `log_tool_call` op (locally signed, never submitted) — the\n   * dashboard verifies the signature against the agent's pubkey. Cached\n   * for 4 minutes; refreshed after that so a long-lived client never\n   * trips the server's replay window.\n   */\n  private getAuthBearer(): string {\n    const now = Date.now();\n    if (this._authBearer && now - this._authBearer.issuedAt < 4 * 60 * 1000) {\n      return this._authBearer.hex;\n    }\n    const nonce = `auth-${now.toString(36)}-${randomHex(4)}`;\n    const hex = native.signLogToolCall(\n      nonce,\n      `auth:${now}`,\n      \"\",\n      \"auth-bearer\",\n      \"\",\n      this.auth.privkey,\n      this.blockchainRid,\n    );\n    this._authBearer = { hex, issuedAt: now };\n    return hex;\n  }\n\n  private authHeaders(): Record<string, string> {\n    return { Authorization: `Bearer ${this.getAuthBearer()}` };\n  }\n\n  private async riskEngineGet(\n    action: string,\n    params: Record<string, QueryValue>,\n  ): Promise<unknown> {\n    let resp: Response;\n    try {\n      resp = await this.http.get(\n        \"/api/risk-engine\",\n        { action, ...params },\n        this.authHeaders(),\n      );\n    } catch (err) {\n      throw this.transportError(err);\n    }\n    if (resp.status !== 200) throw await this.httpError(resp);\n    return this.json(resp);\n  }\n\n  private async riskEnginePost(\n    body: Record<string, unknown>,\n  ): Promise<Record<string, unknown>> {\n    let resp: Response;\n    try {\n      resp = await this.http.post(\"/api/risk-engine\", body, this.authHeaders());\n    } catch (err) {\n      throw this.transportError(err);\n    }\n    if (resp.status !== 200) throw await this.httpError(resp);\n    const data = await this.json(resp);\n    return isRecord(data) ? data : {};\n  }\n\n  private async riskEngineRecords(\n    action: string,\n    params: Record<string, QueryValue>,\n  ): Promise<ToolCallRecord[]> {\n    const raw = await this.riskEngineGet(action, params);\n    if (!Array.isArray(raw)) return [];\n    return raw.map((item) => toToolCallRecord(item as Record<string, unknown>));\n  }\n\n  private async raiseIfError(resp: Response): Promise<void> {\n    if (resp.ok) return;\n    throw await this.httpError(resp);\n  }\n\n  /** Wrap a failed HTTP *response* (non-2xx / non-200) as an AtbashAPIError. */\n  private async httpError(resp: Response): Promise<AtbashAPIError> {\n    return new AtbashAPIError(\n      resp.status,\n      await safeText(resp),\n      resp.statusText,\n      this.endpoint,\n    );\n  }\n\n  /** Wrap a *transport* failure (fetch threw, no response) as an AtbashAPIError. */\n  private transportError(err: unknown): AtbashAPIError {\n    return new AtbashAPIError(0, errorMessage(err), \"\", this.endpoint);\n  }\n\n  private async json(resp: Response): Promise<unknown> {\n    const text = await safeText(resp);\n    if (!text) return null;\n    const parsed = tryParseJson(text);\n    return parsed === undefined ? null : parsed;\n  }\n\n  /* ── crypto / redaction passthroughs (Rust core) ───────────────────────── */\n\n  static generateKeypair(): KeyPair {\n    return native.generateKeypair();\n  }\n\n  static isValidPrivateKey(hex: string): boolean {\n    return native.isValidPrivateKey(hex);\n  }\n\n  static derivePublicKey(privkey: string): string {\n    return native.derivePublicKey(privkey);\n  }\n\n  static redactSecrets(text: string): RedactResult {\n    return native.redactSecrets(text);\n  }\n\n  static normalizeForMatching(text: string): string {\n    return native.normalizeForMatching(text);\n  }\n\n  static containsEvasionCharacters(text: string): boolean {\n    return native.containsEvasionCharacters(text);\n  }\n}\n\n/* ── record converters ─────────────────────────────────────────────────── */\n\n/** Fields shared by ToolCallRecord and ToolCallFull. */\nfunction baseToolCall(raw: Record<string, unknown>) {\n  return {\n    toolCallId: String(raw.tool_call_id ?? \"\"),\n    agentPubkey: pubkeyToHex(raw.agent_pubkey),\n    toolName: String(raw.tool_name ?? \"\"),\n    commandText: String(raw.command_text ?? \"\"),\n    contextText: String(raw.context_text ?? \"\"),\n    orgName: String(raw.org_name ?? \"\"),\n  };\n}\n\nfunction toToolCallRecord(raw: Record<string, unknown>): ToolCallRecord {\n  return {\n    ...baseToolCall(raw),\n    toolArgsJson: String(raw.tool_args_json ?? \"\"),\n    rowid: Number(raw.rowid ?? 0),\n  };\n}\n\nfunction toToolCallFull(raw: Record<string, unknown>): ToolCallFull {\n  return {\n    ...baseToolCall(raw),\n    toolArgsJson: optString(raw.tool_args_json),\n    createdAt: optNumber(raw.created_at),\n    actionType: optString(raw.action_type),\n    resultStatus: optString(raw.result_status),\n    verdictColor: optString(raw.verdict_color),\n    verdictReason: optString(raw.verdict_reason),\n    verdictSource: optString(raw.verdict_source),\n    verdictResponseTimeMs: optNumber(raw.verdict_response_time_ms),\n  };\n}\n\nfunction toHeldAction(raw: Record<string, unknown>): HeldAction {\n  return {\n    judgmentId: String(raw.judgment_id ?? \"\"),\n    agentPubkey: pubkeyToHex(raw.agent_pubkey),\n    actionText: String(raw.action_text ?? \"\"),\n    actionContext: String(raw.action_context ?? \"\"),\n    verdict: normalizeVerdict(raw.verdict),\n    reason: String(raw.reason ?? \"\"),\n    createdAt: Number(raw.created_at ?? 0),\n  };\n}\n\nfunction toHeldActionReview(raw: Record<string, unknown>): HeldActionReview {\n  return {\n    judgmentId: String(raw.judgment_id ?? \"\"),\n    actionText: String(raw.action_text ?? \"\"),\n    status: String(raw.status ?? \"\"),\n    reviewNote: String(raw.review_note ?? \"\"),\n    reviewedAt: Number(raw.reviewed_at ?? 0),\n    createdAt: Number(raw.created_at ?? 0),\n    reviewedBy:\n      optString(raw.reviewed_by) || pubkeyToHex(raw.reviewed_by) || undefined,\n  };\n}\n\nfunction coerceOrgSubscription(\n  raw: Record<string, unknown>,\n  orgName: string,\n): OrgSubscription {\n  return {\n    org_name: String(raw.org_name ?? orgName),\n    subscription_name: String(raw.subscription_name ?? \"\"),\n    agent_number: Number(raw.agent_number ?? 0),\n    is_private_blockchain: Boolean(raw.is_private_blockchain),\n    monthly_price: Number(raw.monthly_price ?? 0),\n    yearly_price: Number(raw.yearly_price ?? 0),\n    duration_months: Number(raw.duration_months ?? 0),\n    assigned_at: Number(raw.assigned_at ?? 0),\n    expires_at: Number(raw.expires_at ?? 0),\n    is_active: Boolean(raw.is_active),\n  };\n}\n\n/* ── small helpers ─────────────────────────────────────────────────────── */\n\nfunction isRecord(v: unknown): v is Record<string, unknown> {\n  return typeof v === \"object\" && v !== null && !Array.isArray(v);\n}\n\nfunction optString(v: unknown): string | undefined {\n  if (v === null || v === undefined) return undefined;\n  return typeof v === \"string\" ? v : String(v);\n}\n\nfunction optNumber(v: unknown): number | undefined {\n  if (v === null || v === undefined) return undefined;\n  const n = Number(v);\n  return Number.isFinite(n) ? n : undefined;\n}\n\nfunction optBool(v: unknown): boolean | undefined {\n  if (v === null || v === undefined) return undefined;\n  return Boolean(v);\n}\n\n/** Parse JSON, returning `undefined` (not throwing) on malformed input. */\nfunction tryParseJson(text: string): unknown {\n  try {\n    return JSON.parse(text);\n  } catch {\n    return undefined;\n  }\n}\n\nfunction parseJson(bytes: Buffer): unknown {\n  const parsed = tryParseJson(bytes.toString(\"utf-8\"));\n  return parsed === undefined ? {} : parsed;\n}\n\nasync function safeText(resp: Response): Promise<string> {\n  try {\n    return await resp.text();\n  } catch {\n    return \"\";\n  }\n}\n\nfunction errorMessage(err: unknown): string {\n  return err instanceof Error ? err.message : String(err);\n}\n\nfunction stringifyArgs(args: unknown): string {\n  if (args === null || args === undefined) return \"\";\n  if (typeof args === \"string\") return args;\n  try {\n    return JSON.stringify(args);\n  } catch {\n    return String(args);\n  }\n}\n\nconst MAX_ACTION_LEN = 4000;\nfunction truncate(text: string): string {\n  if (text.length <= MAX_ACTION_LEN) return text;\n  return text.slice(0, MAX_ACTION_LEN) + \"…\";\n}\n","/**\n * TS-side helpers that compose the Rust core's `redactSecrets`. The core\n * handles single-string redaction; recursive / JSON-aware shapes belong\n * up here so the FFI surface stays minimal.\n */\nimport { native } from \"./native.js\";\n\n/**\n * Canonical secret kinds reported by the Rust core in `SecretMatch.kind`.\n * Wire is permissive (modelled as a free string in {@link SecretMatch})\n * so unknown kinds don't break callers; use this union when narrowing.\n */\nexport type SecretKind =\n  | \"anthropic\"\n  | \"openai\"\n  | \"openai_project\"\n  | \"github\"\n  | \"google\"\n  | \"google_oauth\"\n  | \"aws_access_key\"\n  | \"aws_secret_key\"\n  | \"stripe\"\n  | \"slack\"\n  | \"slack_webhook\"\n  | \"sendgrid\"\n  | \"twilio_sid\"\n  | \"mailgun\"\n  | \"npm_token\"\n  | \"jwt\"\n  | \"private_key_pem\"\n  | \"context_secret\"\n  | \"bearer\"\n  | \"base64\"\n  | \"generic_token\";\n\n/**\n * Walk a JSON-shaped value and redact secrets inside every string leaf.\n * Object keys are not touched; only values. Arrays and nested objects\n * are recursed structurally so the returned value has the same shape.\n */\nexport function redactJsonStrings<T>(value: T): T {\n  if (typeof value === \"string\") {\n    return native.redactSecrets(value).redacted as unknown as T;\n  }\n  if (Array.isArray(value)) {\n    return value.map((v) => redactJsonStrings(v)) as unknown as T;\n  }\n  if (value !== null && typeof value === \"object\") {\n    const out: Record<string, unknown> = {};\n    for (const [k, v] of Object.entries(value as Record<string, unknown>)) {\n      out[k] = redactJsonStrings(v);\n    }\n    return out as unknown as T;\n  }\n  return value;\n}\n","/**\n * Standalone judge-response signature verification.\n *\n * `Atbash.judgeAction` already verifies the response signature inline when\n * `verifyPubKey` is set. This wrapper exposes the same check for use\n * outside of `judgeAction` — webhook receivers, stored response replay,\n * test fixtures — preserving the legacy SDK's `{ ok, reason }` contract.\n *\n * Validation (hex format, length bounds, secp256k1 verify) happens in\n * the Rust core via `native.verifySignature`, so all language bindings\n * agree byte-for-byte on what counts as a valid signature.\n */\nimport { native } from \"./native.js\";\n\nexport function verifyJudgeResponseSignature(\n  bodyBytes: Uint8Array,\n  signatureHex: string | null,\n  pubKeyHex: string,\n): { ok: boolean; reason?: string } {\n  if (!signatureHex) {\n    return { ok: false, reason: \"missing X-Atbash-Signature header\" };\n  }\n\n  const body = Buffer.isBuffer(bodyBytes) ? bodyBytes : Buffer.from(bodyBytes);\n\n  let isValid: boolean;\n  try {\n    isValid = native.verifySignature(body, signatureHex, pubKeyHex);\n  } catch (err) {\n    const message = err instanceof Error ? err.message : String(err ?? \"\");\n    // Rust core throws on malformed inputs (non-hex, wrong length, etc.).\n    // Surface that distinct from \"well-formed but doesn't verify\" so callers\n    // can log differently if they want.\n    if (\n      message.includes(\"signature is not hex\") ||\n      message.includes(\"signature length out of range\")\n    ) {\n      return { ok: false, reason: \"malformed signature header\" };\n    }\n    return { ok: false, reason: `signature verification threw: ${message}` };\n  }\n\n  return isValid\n    ? { ok: true }\n    : {\n        ok: false,\n        reason: \"signature does not verify against configured verifyPubKey\",\n      };\n}\n","/**\n * Browser AES-256-GCM memory encryption via Web Crypto. Swapped in for\n * `memory/crypto.ts` at browser build time by the tsup shim. Same\n * public signatures as the Node variant so callers work unchanged.\n *\n * Key material stays in runtime memory only — never persisted,\n * never transmitted.\n */\nimport postchain from \"postchain-client\";\n\nconst { Buffer } = postchain as unknown as { Buffer: typeof import(\"buffer\").Buffer };\n\nconst HKDF_INFO = new TextEncoder().encode(\"atbash:memory-encryption\");\nconst KEY_LEN = 32;\nconst NONCE_LEN = 12;\n\nfunction stripHex(s: string): string {\n  return s.trim().replace(/^0x/i, \"\").toLowerCase();\n}\n\nfunction hexToU8(hex: string): Uint8Array {\n  const clean = stripHex(hex);\n  if (!/^[0-9a-f]+$/.test(clean) || clean.length % 2 !== 0) {\n    throw new Error(\"invalid hex\");\n  }\n  const out = new Uint8Array(clean.length / 2);\n  for (let i = 0; i < out.length; i++) {\n    out[i] = parseInt(clean.slice(i * 2, i * 2 + 2), 16);\n  }\n  return out;\n}\n\n/** Copy any byte view into a fresh, pure ArrayBuffer so Web Crypto's strict typing accepts it. */\nfunction toArrayBuffer(u8: Uint8Array | Buffer): ArrayBuffer {\n  const ab = new ArrayBuffer(u8.byteLength);\n  new Uint8Array(ab).set(u8 as Uint8Array);\n  return ab;\n}\n\nasync function deriveRawKeyBytes(privkeyHex: string): Promise<Uint8Array> {\n  const ikm = hexToU8(privkeyHex);\n  if (ikm.byteLength !== KEY_LEN) {\n    throw new Error(`deriveMemoryKey: privkey must be ${KEY_LEN} bytes (64 hex chars)`);\n  }\n  const keyMaterial = await crypto.subtle.importKey(\"raw\", toArrayBuffer(ikm), \"HKDF\", false, [\"deriveBits\"]);\n  const bits = await crypto.subtle.deriveBits(\n    { name: \"HKDF\", hash: \"SHA-256\", salt: new ArrayBuffer(0), info: toArrayBuffer(HKDF_INFO) },\n    keyMaterial,\n    KEY_LEN * 8,\n  );\n  return new Uint8Array(bits);\n}\n\nasync function importAesKey(keyBytes: Uint8Array): Promise<CryptoKey> {\n  return crypto.subtle.importKey(\"raw\", toArrayBuffer(keyBytes), { name: \"AES-GCM\" }, false, [\"encrypt\", \"decrypt\"]);\n}\n\n/** Derive the 32-byte AES key from an agent's secp256k1 privkey (hex). Deterministic — same privkey always yields the same key. */\nexport async function deriveMemoryKey(privkey: string): Promise<Buffer> {\n  const raw = await deriveRawKeyBytes(privkey);\n  return Buffer.from(raw);\n}\n\n/** Encrypt UTF-8 plaintext. `ciphertext` has the 16-byte GCM auth tag appended, matching the SDK's on-chain byte layout. */\nexport async function encryptMemoryContent(\n  plaintext: string,\n  key: Buffer,\n): Promise<{ ciphertext: Buffer; nonce: Buffer }> {\n  if (key.byteLength !== KEY_LEN) {\n    throw new Error(`encryptMemoryContent: key must be ${KEY_LEN} bytes`);\n  }\n  const nonce = new Uint8Array(NONCE_LEN);\n  crypto.getRandomValues(nonce);\n  const aesKey = await importAesKey(new Uint8Array(key));\n  const cipherBuf = await crypto.subtle.encrypt(\n    { name: \"AES-GCM\", iv: toArrayBuffer(nonce) },\n    aesKey,\n    toArrayBuffer(new TextEncoder().encode(plaintext)),\n  );\n  return { ciphertext: Buffer.from(new Uint8Array(cipherBuf)), nonce: Buffer.from(nonce) };\n}\n\n/** Decrypt ciphertext produced by `encryptMemoryContent`. Throws on GCM tag mismatch — indicates tampered ciphertext or wrong key. */\nexport async function decryptMemoryContent(\n  ciphertext: Buffer,\n  nonce: Buffer,\n  key: Buffer,\n): Promise<string> {\n  if (key.byteLength !== KEY_LEN) {\n    throw new Error(`decryptMemoryContent: key must be ${KEY_LEN} bytes`);\n  }\n  if (nonce.byteLength !== NONCE_LEN) {\n    throw new Error(`decryptMemoryContent: nonce must be ${NONCE_LEN} bytes`);\n  }\n  const aesKey = await importAesKey(new Uint8Array(key));\n  const plainBuf = await crypto.subtle.decrypt(\n    { name: \"AES-GCM\", iv: toArrayBuffer(nonce) },\n    aesKey,\n    toArrayBuffer(ciphertext),\n  );\n  return new TextDecoder().decode(plainBuf);\n}\n","/**\n * Browser stub for `memory/scan.ts`. Memory scanning uses the judge\n * endpoint from an agent process; browser gets a throw stub.\n */\nimport type { AgentAuth, MemoryEntry, MemoryScanOptions, MemoryScanResult } from \"../types.js\";\n\nconst STUB_MSG = \"not available in @atbash/sdk browser bundle — scan memory server-side\";\n\nexport async function scanMemory(\n  _entry: MemoryEntry,\n  _auth: AgentAuth,\n  _opts?: MemoryScanOptions,\n): Promise<MemoryScanResult> {\n  throw new Error(`scanMemory ${STUB_MSG}`);\n}\n\nexport async function scanMemoryBatch(\n  _entries: MemoryEntry[],\n  _auth: AgentAuth,\n  _opts?: MemoryScanOptions & { stopOnRed?: boolean },\n): Promise<MemoryScanResult[]> {\n  throw new Error(`scanMemoryBatch ${STUB_MSG}`);\n}\n","/**\n * Browser stub for `memory/chain.ts`. The dashboard doesn't submit\n * agent-memory txs; agent-side callers should use the Node bundle.\n * Types are re-exported so callers who import them for typing continue\n * to compile against the browser build.\n */\nimport type { AgentAuth, ChainOpts } from \"../types.js\";\n\nconst STUB_MSG =\n  \"not available in @atbash/sdk browser bundle — commit/rollback memory server-side\";\n\nexport interface CommitMemoryOptions {\n  score?: number;\n  orgName?: string;\n  endpoint?: string;\n  chainOpts?: ChainOpts;\n}\n\nexport interface RollbackMemoryOptions {\n  orgName?: string;\n  endpoint?: string;\n  chainOpts?: ChainOpts;\n}\n\nexport interface AgentMemoryEntry {\n  id: number;\n  content: string;\n  decryptError?: string;\n  score: number;\n  isActive: boolean;\n  createdAt: number;\n  updatedAt: number;\n}\n\nexport interface MemoryRollbackEvent {\n  fromId: number;\n  toId: number;\n  reason: string;\n  signer: string;\n  createdAt: number;\n}\n\nexport async function commitMemoryVersion(\n  _plaintext: string,\n  _auth: AgentAuth,\n  _opts?: CommitMemoryOptions,\n): Promise<void> {\n  throw new Error(`commitMemoryVersion ${STUB_MSG}`);\n}\n\nexport async function getActiveMemoryId(\n  _auth: AgentAuth,\n  _chainOpts?: ChainOpts,\n): Promise<number | null> {\n  throw new Error(`getActiveMemoryId ${STUB_MSG}`);\n}\n\nexport async function getActiveMemory(\n  _auth: AgentAuth,\n  _chainOpts?: ChainOpts,\n): Promise<AgentMemoryEntry[]> {\n  throw new Error(`getActiveMemory ${STUB_MSG}`);\n}\n\nexport async function getAllAgentMemory(\n  _auth: AgentAuth,\n  _chainOpts?: ChainOpts,\n): Promise<AgentMemoryEntry[]> {\n  throw new Error(`getAllAgentMemory ${STUB_MSG}`);\n}\n\nexport async function getMemoryHistory(\n  _auth: AgentAuth,\n  _chainOpts?: ChainOpts,\n): Promise<AgentMemoryEntry[]> {\n  throw new Error(`getMemoryHistory ${STUB_MSG}`);\n}\n\nexport async function getMemoryById(\n  _id: number,\n  _auth: AgentAuth,\n  _chainOpts?: ChainOpts,\n): Promise<AgentMemoryEntry> {\n  throw new Error(`getMemoryById ${STUB_MSG}`);\n}\n\nexport async function getRollbackHistory(\n  _auth: AgentAuth,\n  _chainOpts?: ChainOpts,\n): Promise<MemoryRollbackEvent[]> {\n  throw new Error(`getRollbackHistory ${STUB_MSG}`);\n}\n\nexport async function rollbackMemory(\n  _toId: number,\n  _reason: string,\n  _auth: AgentAuth,\n  _opts?: RollbackMemoryOptions,\n): Promise<void> {\n  throw new Error(`rollbackMemory ${STUB_MSG}`);\n}\n","/**\n * Browser stub for `memory/classifier.ts`. Memory-write classification\n * is agent-side; the browser bundle exposes the same names so imports\n * don't break at build time, but the functions throw with a clear\n * message if called.\n *\n * The default constant arrays are inlined here (byte-identical to the\n * Rust core) so consumers can still enumerate them without triggering\n * the NAPI stub.\n */\nimport type { MemoryEntry } from \"../types.js\";\n\nconst STUB_MSG =\n  \"not available in @atbash/sdk browser bundle — classify memory writes server-side\";\n\nexport const DEFAULT_MEMORY_WRITE_TOOL_NAMES: ReadonlyArray<string> = [\n  \"write\",\n  \"edit\",\n  \"multiedit\",\n];\n\nexport const DEFAULT_MEMORY_PATH_PATTERNS: ReadonlyArray<string> = [\n  \"/.openclaw/workspace/\",\n  \"/.openclaw/memory/\",\n  \"/.claude/projects/\",\n  \"/memory/\",\n  \"memory/\",\n  \"Memory.md\",\n  \"DREAMS.md\",\n  \"CLAUDE.md\",\n  \"AGENTS.md\",\n];\n\nexport interface ClassifierToolContext {\n  tool?: { name?: string };\n  toolName?: string;\n  name?: string;\n  params?: unknown;\n  args?: unknown;\n  arguments?: unknown;\n}\n\nexport interface ClassifierToolEvent {\n  toolName?: string;\n  params?: unknown;\n  args?: unknown;\n  arguments?: unknown;\n}\n\nexport interface ClassifyMemoryWriteOptions {\n  patterns?: ReadonlyArray<string>;\n  toolNames?: ReadonlyArray<string>;\n}\n\nexport function classifyMemoryWrite(\n  _event: unknown,\n  _ctx: unknown,\n  _opts: ClassifyMemoryWriteOptions = {},\n): MemoryEntry | null {\n  throw new Error(`classifyMemoryWrite ${STUB_MSG}`);\n}\n","/**\n * Plugin-agnostic memory-write guard.\n *\n * A single call that replaces the plugin's usual memory-write branch:\n *   classify → scan (Layer 1 regex + Layer 2 LLM) → gate on verdict →\n *   persist to chain (fire-and-forget when allowed) → return decision.\n *\n * Plugins call this from their `before_tool_call` hook. When it returns\n * `{ handled: false }` the call wasn't a memory write and the plugin\n * should fall through to its regular tool-call audit. When\n * `{ handled: true }` the plugin returns `decision` directly.\n */\nimport type { AgentAuth, MemoryEntry, MemoryScanResult } from \"../types.js\";\nimport {\n  classifyMemoryWrite,\n  type ClassifyMemoryWriteOptions,\n} from \"./classifier.js\";\nimport { commitMemoryVersion } from \"./chain.js\";\nimport { scanMemory } from \"./scan.js\";\n\n/**\n * Minimal logger accepted by `guardMemoryWrite`. Plugins pass their\n * host runtime's logger (openclaw's `api.logger`, MCP's console, etc.).\n * Only `info` and `warn` are used — omitted methods no-op.\n */\nexport interface GuardLogger {\n  info?: (message: string, meta?: unknown) => void;\n  warn?: (message: string, meta?: unknown) => void;\n}\n\nexport interface GuardMemoryWriteInput extends ClassifyMemoryWriteOptions {\n  /** The plugin's raw `before_tool_call` event. */\n  event: unknown;\n  /** The plugin's `before_tool_call` context. */\n  ctx: unknown;\n  /** Agent auth used to sign the scan's on-chain audit and the memory-commit tx. */\n  auth: AgentAuth;\n  /** Judge endpoint override (dev vs prod). */\n  endpoint?: string;\n  /** Self-hosted judge response-signing pubkey. */\n  verifyPubKey?: string;\n  /** Org name for chain resolution (public vs org-private chain). */\n  orgName?: string;\n  /** LLM confidence threshold for yellow escalation. Default 0.6. */\n  threshold?: number;\n  /** When false, red verdicts log but don't block. Default true. */\n  enforce?: boolean;\n  /** When true, emit a classifier-probe log line via `logger.info`. */\n  debug?: boolean;\n  /** Optional logger for debug probe + persist-failure warnings. */\n  logger?: GuardLogger;\n}\n\n/** Plugin-facing decision. Shape mirrors what plugins return from `before_tool_call`. */\nexport interface GuardMemoryDecision {\n  allow: boolean;\n  block?: boolean;\n  reason?: string;\n}\n\nexport interface GuardMemoryWriteResult {\n  /** True when this call was a memory write and `decision` was set. False = plugin should run its regular audit. */\n  handled: boolean;\n  /** Present when handled. Plugin returns this from its hook. */\n  decision?: GuardMemoryDecision;\n  /** Present when handled and scan ran. Absent when scan threw. */\n  scanResult?: MemoryScanResult;\n  /** Present when handled. True when a chain-commit was dispatched (fire-and-forget). */\n  committed?: boolean;\n}\n\n/**\n * Log the classifier-probe surface — what the plugin actually sent and\n * whether the SDK's classifier picked it up. Useful when a plugin's\n * event/ctx shape drifts from what the SDK expects; guarded by\n * `debug: true`. Path is logged (file paths are not secret); arg\n * *values* are not.\n */\nfunction emitDebugProbe(\n  event: unknown,\n  ctx: unknown,\n  memEntry: MemoryEntry | null,\n  logger: GuardLogger | undefined,\n): void {\n  if (!logger?.info) return;\n\n  const ev = (event ?? {}) as Record<string, unknown>;\n  const c = (ctx ?? {}) as Record<string, unknown>;\n  const argsCandidate =\n    ev.params ?? c.params ?? ev.args ?? c.args ?? ev.arguments ?? c.arguments;\n  const argsObj =\n    argsCandidate && typeof argsCandidate === \"object\"\n      ? (argsCandidate as Record<string, unknown>)\n      : {};\n  const argsKeys = Object.keys(argsObj).slice(0, 20);\n  const pickedPath =\n    (typeof argsObj.file_path === \"string\" && argsObj.file_path) ||\n    (typeof argsObj.path === \"string\" && argsObj.path) ||\n    (typeof argsObj.filename === \"string\" && argsObj.filename) ||\n    null;\n  const editsArr = Array.isArray(argsObj.edits) ? argsObj.edits : null;\n  const firstEditKeys =\n    editsArr && editsArr[0] && typeof editsArr[0] === \"object\"\n      ? Object.keys(editsArr[0] as Record<string, unknown>).slice(0, 10)\n      : null;\n  const tool =\n    (ev.toolName as string) ??\n    (c.tool as { name?: string })?.name ??\n    (c.toolName as string) ??\n    (c.name as string) ??\n    \"(none)\";\n\n  logger.info(\"[atbash][probe] before_tool_call\", {\n    toolName: tool,\n    eventKeys: Object.keys(ev).slice(0, 20),\n    ctxKeys: Object.keys(c).slice(0, 20),\n    argsKeys,\n    pickedPath,\n    firstEditKeys,\n    editsCount: editsArr?.length,\n    memoryWrite: !!memEntry,\n    memoryPath: memEntry?.key,\n  });\n}\n\n/**\n * Guarded memory-write flow. Returns `{ handled: false }` when the tool\n * call isn't a memory write, otherwise returns a `decision` the plugin\n * should return from its hook.\n *\n * Verdict handling:\n * - `red`  → not persisted to chain; decision blocks (unless `enforce: false`)\n * - `yellow` → persisted with LLM score; decision allows\n * - `green`  → persisted with LLM score; decision allows\n *\n * Chain commit is fire-and-forget: network errors are logged via\n * `logger.warn` but never surfaced to the caller. This mirrors the\n * existing plugin behaviour — chain is for audit/recovery, not gating.\n */\nexport async function guardMemoryWrite(\n  input: GuardMemoryWriteInput,\n): Promise<GuardMemoryWriteResult> {\n  const {\n    event,\n    ctx,\n    auth,\n    endpoint,\n    verifyPubKey,\n    orgName,\n    threshold,\n    patterns,\n    toolNames,\n    enforce = true,\n    debug = false,\n    logger,\n  } = input;\n\n  const memEntry = classifyMemoryWrite(event, ctx, { patterns, toolNames });\n\n  if (debug) emitDebugProbe(event, ctx, memEntry, logger);\n\n  if (!memEntry) return { handled: false };\n\n  // Scan — Layer 1 (regex) + Layer 2 (LLM) via scanMemory.\n  let scanResult: MemoryScanResult;\n  try {\n    scanResult = await scanMemory(memEntry, auth, {\n      endpoint,\n      verifyPubKey,\n      orgName,\n      threshold,\n    });\n  } catch (err) {\n    const reason = err instanceof Error ? err.message : String(err);\n    logger?.warn?.(\"[atbash] memory scan failed\", {\n      path: memEntry.key,\n      reason,\n    });\n    // Fail closed when enforcing; fail open when observing.\n    return {\n      handled: true,\n      decision: enforce\n        ? { allow: false, block: true, reason }\n        : { allow: true },\n    };\n  }\n\n  // Red is final — never persisted. Poisoning payload should not become\n  // a versioned snapshot even in observe mode.\n  if (scanResult.verdict === \"red\") {\n    logger?.warn?.(\"[atbash] memory BLOCK\", {\n      path: memEntry.key,\n      reason: scanResult.reason,\n    });\n    return {\n      handled: true,\n      decision: enforce\n        ? { allow: false, block: true, reason: scanResult.reason }\n        : { allow: true },\n      scanResult,\n      committed: false,\n    };\n  }\n\n  // Yellow / green — persist to chain fire-and-forget. LLM score wins\n  // over any static verdict→score mapping (A2 in the plan).\n  commitMemoryVersion(memEntry.value, auth, {\n    score: scanResult.score,\n    orgName,\n    endpoint,\n  }).catch((err: unknown) => {\n    const reason = err instanceof Error ? err.message : String(err);\n    logger?.warn?.(\"[atbash] memory commit to chain failed\", {\n      path: memEntry.key,\n      reason,\n    });\n  });\n\n  logger?.info?.(\n    scanResult.verdict === \"yellow\" ? \"[atbash] memory HOLD\" : \"[atbash] memory ALLOW\",\n    { path: memEntry.key, score: scanResult.score, reason: scanResult.reason },\n  );\n\n  return {\n    handled: true,\n    decision: { allow: true },\n    scanResult,\n    committed: true,\n  };\n}\n","/**\n * Aligns a local `MemoryPointer` with chain's active memory version\n * via a TTL-cached pointer check. Inside the TTL window: no-op.\n * Past it: one cheap chain query for the current active id; only on\n * mismatch does the full row get refetched and decrypted.\n *\n * Fail modes:\n *   - Chain unreachable → throws the network error verbatim; caller\n *     serves the local copy and retries on the next check.\n *   - Tampered ciphertext (GCM tag mismatch) → throws\n *     `MemoryIntegrityError`. Fail-closed — never silent.\n */\nimport { getActiveMemoryId, getMemoryById, type AgentMemoryEntry } from \"./chain.js\";\nimport type { AgentAuth, ChainOpts } from \"../types.js\";\n\n/** Per-agent state the caller persists between sync calls. */\nexport interface MemoryPointer {\n  /** Last known chain-active memory id, or null if the agent had no active memory at the last check. */\n  activeId: number | null;\n  /** Wall-clock ms of the last successful chain check. Use 0 to force a check on the next call. */\n  checkedAt: number;\n}\n\nexport interface SyncMemoryOptions {\n  /** Trust the pointer without touching chain for this many ms since `checkedAt`. Default 30_000. */\n  ttlMs?: number;\n  /** Skip the TTL gate and force a chain check this call. Default false. */\n  force?: boolean;\n  chainOpts?: ChainOpts;\n}\n\n/**\n * `drifted: false` — pointer is still valid; caller can keep serving the local copy.\n * `drifted: true`  — active id changed on chain; `current` is the fresh decrypted row\n *                    (or `null` if active memory was removed entirely).\n */\nexport type SyncMemoryResult =\n  | { drifted: false; pointer: MemoryPointer }\n  | { drifted: true; current: AgentMemoryEntry | null; pointer: MemoryPointer };\n\n/** Thrown when a fetched active row fails its GCM integrity check. Poisoning signal — do not swallow. */\nexport class MemoryIntegrityError extends Error {\n  constructor(\n    public readonly id: number,\n    reason: string,\n  ) {\n    super(`memory integrity check failed on id ${id}: ${reason}`);\n    this.name = \"MemoryIntegrityError\";\n  }\n}\n\nconst DEFAULT_TTL_MS = 30_000;\n\nexport async function syncLocalMemory(\n  auth: AgentAuth,\n  pointer: MemoryPointer,\n  opts: SyncMemoryOptions = {},\n): Promise<SyncMemoryResult> {\n  const ttl = opts.ttlMs ?? DEFAULT_TTL_MS;\n  const now = Date.now();\n\n  const withinTtl = !opts.force && now - pointer.checkedAt < ttl;\n  if (withinTtl) {\n    return { drifted: false, pointer };\n  }\n\n  const currentId = await getActiveMemoryId(auth, opts.chainOpts);\n  const nextPointer: MemoryPointer = { activeId: currentId, checkedAt: now };\n\n  if (currentId === pointer.activeId) {\n    return { drifted: false, pointer: nextPointer };\n  }\n\n  if (currentId === null) {\n    return { drifted: true, current: null, pointer: nextPointer };\n  }\n\n  const row = await getMemoryById(currentId, auth, opts.chainOpts);\n  if (row.decryptError) {\n    throw new MemoryIntegrityError(currentId, row.decryptError);\n  }\n  return { drifted: true, current: row, pointer: nextPointer };\n}\n","3// Browser stub for `memory/pointer-store.ts`. The real module reads/writes\n// a JSON file under the workspace to cache the last-known chain pointer.\n// Browsers have no filesystem access — any consumer that tries to use it\n// from a browser is likely wiring the wrong subsystem, so we throw loudly.\n//\n// Type exports are preserved so the browser bundle can still resolve\n// re-exports from `memory/index.ts` without runtime cost.\n\nimport type { MemoryPointer } from \"../memory/sync.js\";\n\nconst unavailable = (name: string): never => {\n  throw new Error(`${name} is not available in the browser bundle`);\n};\n\nexport class PointerStore {\n  constructor(_filePath: string) {}\n  get(_pubkey: string): Promise<MemoryPointer> {\n    return Promise.reject(new Error(\"PointerStore.get is not available in the browser bundle\"));\n  }\n  set(_pubkey: string, _pointer: MemoryPointer): Promise<void> {\n    return Promise.reject(new Error(\"PointerStore.set is not available in the browser bundle\"));\n  }\n}\n\nexport function defaultPointerPath(_workspaceDir?: string): string {\n  return unavailable(\"defaultPointerPath\");\n}\n","// Browser stub for `memory/file-logger.ts`. The real module tees log lines\n// into a workspace file for post-hoc plugin debugging; browsers don't have\n// filesystem access, so any call throws.\n//\n// Type exports are preserved so re-exports from `memory/index.ts` resolve\n// cleanly in browser bundles even when the concrete symbols are unused.\n\nexport interface WrappedLogger {\n  info: (msg: string, meta?: Record<string, unknown>) => void;\n  warn: (msg: string, meta?: Record<string, unknown>) => void;\n}\n\nconst unavailable = (name: string): never => {\n  throw new Error(`${name} is not available in the browser bundle`);\n};\n\nexport function createFileLogger(\n  _logFilePath: string,\n  _hostLogger?: { info?: (...args: unknown[]) => void; warn?: (...args: unknown[]) => void },\n): WrappedLogger {\n  return unavailable(\"createFileLogger\");\n}\n\nexport function defaultPluginLogPath(_workspaceDir?: string): string {\n  return unavailable(\"defaultPluginLogPath\");\n}\n","/**\n * Browser stub for `memory/read-classifier.ts`. Memory-read\n * classification is agent-side; browser gets a throw stub.\n */\nimport type { ClassifierToolContext, ClassifierToolEvent } from \"./memory-classifier.js\";\n\nconst STUB_MSG =\n  \"not available in @atbash/sdk browser bundle — classify memory reads server-side\";\n\nexport const DEFAULT_MEMORY_READ_TOOL_NAMES: ReadonlyArray<string> = [\n  \"memory_search\",\n  \"memory_get\",\n];\n\nexport interface ClassifyMemoryReadOptions {\n  readToolNames?: ReadonlyArray<string>;\n  patterns?: ReadonlyArray<string>;\n  genericReadToolNames?: ReadonlyArray<string>;\n}\n\nexport function classifyMemoryRead(\n  _event: unknown,\n  _ctx: unknown,\n  _opts: ClassifyMemoryReadOptions = {},\n): boolean {\n  throw new Error(`classifyMemoryRead ${STUB_MSG}`);\n}\n\nexport type { ClassifierToolContext, ClassifierToolEvent };\n","// Browser stub for `memory/guard-manager.ts`. The real orchestrator wires\n// filesystem-backed pointer + logger + boot probe + before_tool_call hook\n// dispatch. All of it is host-runtime plumbing (openclaw, MCP server, etc.)\n// with no browser use case.\n//\n// Type exports are preserved so re-exports from `memory/index.ts` and\n// consumer type imports resolve cleanly in browser bundles.\n\nimport type { AgentAuth } from \"../types.js\";\nimport type { ClassifyMemoryReadOptions } from \"../memory/read-classifier.js\";\n\nexport interface HookDecision {\n  allow?: boolean;\n  block?: boolean;\n  blockReason?: string;\n  reason?: string;\n}\n\nexport interface MemoryGuardManagerOptions {\n  auth: AgentAuth;\n  workspaceDir: string;\n  memoryFilePath?: string;\n  pointerFilePath?: string;\n  logFilePath?: string;\n  hostLogger?: { info: (...args: unknown[]) => void; warn: (...args: unknown[]) => void };\n  ttlMs?: number;\n  rollbackMinScore?: number;\n  enforce?: boolean;\n  memoryReadClassifier?: ClassifyMemoryReadOptions;\n  memoryWriteToolNames?: ReadonlyArray<string>;\n  memoryPathPatterns?: ReadonlyArray<string>;\n  judgeEndpoint?: string;\n  judgeVerifyPubKey?: string;\n  orgName?: string;\n  debug?: boolean;\n}\n\nconst unavailable = (name: string): never => {\n  throw new Error(`${name} is not available in the browser bundle`);\n};\n\nexport class MemoryGuardManager {\n  constructor(_opts: MemoryGuardManagerOptions) {}\n  runBootProbe(): Promise<void> {\n    return Promise.reject(\n      new Error(\"MemoryGuardManager.runBootProbe is not available in the browser bundle\"),\n    );\n  }\n  handleBeforeToolCall(_event: unknown, _ctx: unknown): Promise<HookDecision | null> {\n    return Promise.reject(\n      new Error(\n        \"MemoryGuardManager.handleBeforeToolCall is not available in the browser bundle\",\n      ),\n    );\n  }\n}\n\nexport function createMemoryGuardManager(_opts: MemoryGuardManagerOptions): MemoryGuardManager {\n  return unavailable(\"createMemoryGuardManager\");\n}\n","/**\n * Atbash SDK for Node.js — public surface.\n *\n * Crypto / redaction / memory primitives are re-exported from the NAPI-bound\n * Rust core as plain functions; the HTTP-facing surface (`judgeAction`,\n * `logToolCall`, `get*`) lives on the `Atbash` class.\n */\nimport { native } from \"./native.js\";\nimport type {\n  AgentAuth,\n  KeyPair,\n  MemoryDiffResult,\n  MemoryEntry,\n  MemorySnapshot,\n  RedactResult,\n} from \"./types.js\";\n\nexport { Atbash } from \"./client.js\";\nexport {\n  DEFAULT_BLOCKCHAIN_RID,\n  DEFAULT_CHROMIA_NODE_URLS,\n  DEFAULT_ENDPOINT,\n} from \"./constants.js\";\nexport { AtbashAPIError, SignatureVerificationError } from \"./errors.js\";\nexport {\n  normalizeVerdict,\n  normalizeStatus,\n  pubkeyToHex,\n} from \"./normalize.js\";\nexport type * from \"./types.js\";\n\n// config loading (file/env resolution, endpoint validation, key file)\nexport {\n  type AtbashUserConfig,\n  getConfigDir,\n  getConfigPath,\n  loadUserConfig,\n  saveUserConfig,\n  resolve,\n} from \"./userConfig.js\";\nexport {\n  type JudgeEndpointConfig,\n  type ValidatedEndpoint,\n  validateJudgeEndpoint,\n  buildAllowedJudgeHosts,\n} from \"./endpoint.js\";\nexport { resolveKeyPath, loadAgentFromFile } from \"./keyLoader.js\";\nexport { redactJsonStrings, type SecretKind } from \"./redact.js\";\nexport { verifyJudgeResponseSignature } from \"./signature.js\";\n\n// Memory-poisoning surface — crypto + regex pre-filter live in the Rust\n// core, `scanMemory` composes them with the HTTP LLM-judge call, and\n// `chain.ts` handles direct Postchain commit/rollback.\nexport {\n  deriveMemoryKey,\n  encryptMemoryContent,\n  decryptMemoryContent,\n  scanMemory,\n  scanMemoryBatch,\n  commitMemoryVersion,\n  rollbackMemory,\n  getActiveMemory,\n  getActiveMemoryId,\n  getAllAgentMemory,\n  getMemoryHistory,\n  getMemoryById,\n  getRollbackHistory,\n  classifyMemoryWrite,\n  DEFAULT_MEMORY_PATH_PATTERNS,\n  DEFAULT_MEMORY_WRITE_TOOL_NAMES,\n  guardMemoryWrite,\n  syncLocalMemory,\n  MemoryIntegrityError,\n  PointerStore,\n  defaultPointerPath,\n  createFileLogger,\n  defaultPluginLogPath,\n  classifyMemoryRead,\n  DEFAULT_MEMORY_READ_TOOL_NAMES,\n  MemoryGuardManager,\n  createMemoryGuardManager,\n  type CommitMemoryOptions,\n  type RollbackMemoryOptions,\n  type AgentMemoryEntry,\n  type MemoryRollbackEvent,\n  type ClassifierToolContext,\n  type ClassifierToolEvent,\n  type ClassifyMemoryWriteOptions,\n  type GuardMemoryWriteInput,\n  type GuardMemoryWriteResult,\n  type GuardMemoryDecision,\n  type GuardLogger,\n  type MemoryPointer,\n  type SyncMemoryOptions,\n  type SyncMemoryResult,\n  type WrappedLogger,\n  type ClassifyMemoryReadOptions,\n  type MemoryGuardManagerOptions,\n  type HookDecision,\n} from \"./memory/index.js\";\nexport {\n  flushTelemetry,\n  recordCall,\n  recordDuration,\n  setupTelemetry,\n  shutdownTelemetry,\n  type ClientSource,\n  type TelemetryConfig,\n} from \"./opentel/telemetry.js\";\n\n/* ── crypto / redaction / memory primitives (Rust core) ────────────────── */\n\nexport function isValidPrivateKey(hex: string): boolean {\n  return native.isValidPrivateKey(hex);\n}\n\nexport function derivePublicKey(privkey: string): string {\n  return native.derivePublicKey(privkey);\n}\n\nexport function generateKeypair(): KeyPair {\n  return native.generateKeypair();\n}\n\nexport function loadAgent(privkey: string): AgentAuth {\n  return native.loadAgent(privkey);\n}\n\nexport function signLogToolCall(\n  toolCallId: string,\n  action: string,\n  context: string,\n  toolName: string,\n  toolArgsJson: string,\n  privkey: string,\n  blockchainRid: string,\n): string {\n  return native.signLogToolCall(\n    toolCallId,\n    action,\n    context,\n    toolName,\n    toolArgsJson,\n    privkey,\n    blockchainRid,\n  );\n}\n\nexport {\n  signEncryptedToolCall,\n  normalizeActionForHash,\n  claimHashHex,\n  columnAad,\n} from \"./encrypted-toolcall.js\";\nexport {\n  encryptForOrg,\n  decryptForOrg,\n  encryptedLength,\n  EciesDomain,\n} from \"./crypto/ecies.js\";\nexport {\n  packEnvelope,\n  parseEnvelope,\n  isEnvelope,\n  keyFingerprintOf,\n  type Envelope,\n} from \"./crypto/envelope.js\";\n\nexport function signJudgeAction(\n  judgmentId: string,\n  action: string,\n  context: string,\n  extra: string,\n  privkey: string,\n  blockchainRid: string,\n): string {\n  return native.signJudgeAction(\n    judgmentId,\n    action,\n    context,\n    extra,\n    privkey,\n    blockchainRid,\n  );\n}\n\nexport function verifySignature(\n  body: Buffer,\n  signatureHex: string,\n  pubkeyHex: string,\n): boolean {\n  return native.verifySignature(body, signatureHex, pubkeyHex);\n}\n\nexport function normalizeForMatching(text: string): string {\n  return native.normalizeForMatching(text);\n}\n\nexport function containsEvasionCharacters(text: string): boolean {\n  return native.containsEvasionCharacters(text);\n}\n\nexport function redactSecrets(text: string): RedactResult {\n  return native.redactSecrets(text);\n}\n\nexport function containsSecret(text: string): boolean {\n  return native.containsSecret(text);\n}\n\nexport function createMemorySnapshot(\n  entries: MemoryEntry[],\n  takenAt: number,\n): MemorySnapshot {\n  return native.createMemorySnapshot(entries, takenAt);\n}\n\nexport function diffMemorySnapshots(\n  before: MemorySnapshot,\n  after: MemorySnapshot,\n): MemoryDiffResult {\n  return native.diffMemorySnapshots(before, after);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA,KAAC,SAAUA,SAAQC,UAAS;AAC1B;AAGA,eAASC,QAAQ,KAAK,KAAK;AACzB,YAAI,CAAC,IAAK,OAAM,IAAI,MAAM,OAAO,kBAAkB;AAAA,MACrD;AAIA,eAASC,UAAU,MAAM,WAAW;AAClC,aAAK,SAAS;AACd,YAAI,WAAW,WAAY;AAAA,QAAC;AAC5B,iBAAS,YAAY,UAAU;AAC/B,aAAK,YAAY,IAAI,SAAS;AAC9B,aAAK,UAAU,cAAc;AAAA,MAC/B;AAIA,eAASC,IAAI,QAAQC,OAAM,QAAQ;AACjC,YAAID,IAAG,KAAK,MAAM,GAAG;AACnB,iBAAO;AAAA,QACT;AAEA,aAAK,WAAW;AAChB,aAAK,QAAQ;AACb,aAAK,SAAS;AAGd,aAAK,MAAM;AAEX,YAAI,WAAW,MAAM;AACnB,cAAIC,UAAS,QAAQA,UAAS,MAAM;AAClC,qBAASA;AACT,YAAAA,QAAO;AAAA,UACT;AAEA,eAAK,MAAM,UAAU,GAAGA,SAAQ,IAAI,UAAU,IAAI;AAAA,QACpD;AAAA,MACF;AACA,UAAI,OAAOL,YAAW,UAAU;AAC9B,QAAAA,QAAO,UAAUI;AAAA,MACnB,OAAO;AACL,QAAAH,SAAQ,KAAKG;AAAA,MACf;AAEA,MAAAA,IAAG,KAAKA;AACR,MAAAA,IAAG,WAAW;AAEd,UAAIE;AACJ,UAAI;AACF,YAAI,OAAO,WAAW,eAAe,OAAO,OAAO,WAAW,aAAa;AACzE,UAAAA,UAAS,OAAO;AAAA,QAClB,OAAO;AACL,UAAAA,UAAS,iBAAkB;AAAA,QAC7B;AAAA,MACF,SAAS,GAAG;AAAA,MACZ;AAEA,MAAAF,IAAG,OAAO,SAAS,KAAM,KAAK;AAC5B,YAAI,eAAeA,KAAI;AACrB,iBAAO;AAAA,QACT;AAEA,eAAO,QAAQ,QAAQ,OAAO,QAAQ,YACpC,IAAI,YAAY,aAAaA,IAAG,YAAY,MAAM,QAAQ,IAAI,KAAK;AAAA,MACvE;AAEA,MAAAA,IAAG,MAAM,SAASG,KAAK,MAAM,OAAO;AAClC,YAAI,KAAK,IAAI,KAAK,IAAI,EAAG,QAAO;AAChC,eAAO;AAAA,MACT;AAEA,MAAAH,IAAG,MAAM,SAASI,KAAK,MAAM,OAAO;AAClC,YAAI,KAAK,IAAI,KAAK,IAAI,EAAG,QAAO;AAChC,eAAO;AAAA,MACT;AAEA,MAAAJ,IAAG,UAAU,QAAQ,SAASK,MAAM,QAAQJ,OAAM,QAAQ;AACxD,YAAI,OAAO,WAAW,UAAU;AAC9B,iBAAO,KAAK,YAAY,QAAQA,OAAM,MAAM;AAAA,QAC9C;AAEA,YAAI,OAAO,WAAW,UAAU;AAC9B,iBAAO,KAAK,WAAW,QAAQA,OAAM,MAAM;AAAA,QAC7C;AAEA,YAAIA,UAAS,OAAO;AAClB,UAAAA,QAAO;AAAA,QACT;AACA,QAAAH,QAAOG,WAAUA,QAAO,MAAMA,SAAQ,KAAKA,SAAQ,EAAE;AAErD,iBAAS,OAAO,SAAS,EAAE,QAAQ,QAAQ,EAAE;AAC7C,YAAI,QAAQ;AACZ,YAAI,OAAO,CAAC,MAAM,KAAK;AACrB;AACA,eAAK,WAAW;AAAA,QAClB;AAEA,YAAI,QAAQ,OAAO,QAAQ;AACzB,cAAIA,UAAS,IAAI;AACf,iBAAK,UAAU,QAAQ,OAAO,MAAM;AAAA,UACtC,OAAO;AACL,iBAAK,WAAW,QAAQA,OAAM,KAAK;AACnC,gBAAI,WAAW,MAAM;AACnB,mBAAK,WAAW,KAAK,QAAQ,GAAGA,OAAM,MAAM;AAAA,YAC9C;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,MAAAD,IAAG,UAAU,cAAc,SAAS,YAAa,QAAQC,OAAM,QAAQ;AACrE,YAAI,SAAS,GAAG;AACd,eAAK,WAAW;AAChB,mBAAS,CAAC;AAAA,QACZ;AACA,YAAI,SAAS,UAAW;AACtB,eAAK,QAAQ,CAAE,SAAS,QAAU;AAClC,eAAK,SAAS;AAAA,QAChB,WAAW,SAAS,kBAAkB;AACpC,eAAK,QAAQ;AAAA,YACX,SAAS;AAAA,YACR,SAAS,WAAa;AAAA,UACzB;AACA,eAAK,SAAS;AAAA,QAChB,OAAO;AACL,UAAAH,QAAO,SAAS,gBAAgB;AAChC,eAAK,QAAQ;AAAA,YACX,SAAS;AAAA,YACR,SAAS,WAAa;AAAA,YACvB;AAAA,UACF;AACA,eAAK,SAAS;AAAA,QAChB;AAEA,YAAI,WAAW,KAAM;AAGrB,aAAK,WAAW,KAAK,QAAQ,GAAGG,OAAM,MAAM;AAAA,MAC9C;AAEA,MAAAD,IAAG,UAAU,aAAa,SAAS,WAAY,QAAQC,OAAM,QAAQ;AAEnE,QAAAH,QAAO,OAAO,OAAO,WAAW,QAAQ;AACxC,YAAI,OAAO,UAAU,GAAG;AACtB,eAAK,QAAQ,CAAE,CAAE;AACjB,eAAK,SAAS;AACd,iBAAO;AAAA,QACT;AAEA,aAAK,SAAS,KAAK,KAAK,OAAO,SAAS,CAAC;AACzC,aAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;AAClC,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,eAAK,MAAM,CAAC,IAAI;AAAA,QAClB;AAEA,YAAI,GAAG;AACP,YAAI,MAAM;AACV,YAAI,WAAW,MAAM;AACnB,eAAK,IAAI,OAAO,SAAS,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG;AACjD,gBAAI,OAAO,CAAC,IAAK,OAAO,IAAI,CAAC,KAAK,IAAM,OAAO,IAAI,CAAC,KAAK;AACzD,iBAAK,MAAM,CAAC,KAAM,KAAK,MAAO;AAC9B,iBAAK,MAAM,IAAI,CAAC,IAAK,MAAO,KAAK,MAAQ;AACzC,mBAAO;AACP,gBAAI,OAAO,IAAI;AACb,qBAAO;AACP;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,WAAW,MAAM;AAC1B,eAAK,IAAI,GAAG,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC5C,gBAAI,OAAO,CAAC,IAAK,OAAO,IAAI,CAAC,KAAK,IAAM,OAAO,IAAI,CAAC,KAAK;AACzD,iBAAK,MAAM,CAAC,KAAM,KAAK,MAAO;AAC9B,iBAAK,MAAM,IAAI,CAAC,IAAK,MAAO,KAAK,MAAQ;AACzC,mBAAO;AACP,gBAAI,OAAO,IAAI;AACb,qBAAO;AACP;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,eAAS,cAAe,QAAQQ,QAAO;AACrC,YAAI,IAAI,OAAO,WAAWA,MAAK;AAE/B,YAAI,KAAK,MAAM,KAAK,IAAI;AACtB,iBAAO,IAAI;AAAA,QAEb,WAAW,KAAK,MAAM,KAAK,KAAK;AAC9B,iBAAO,IAAI;AAAA,QAEb,OAAO;AACL,iBAAQ,IAAI,KAAM;AAAA,QACpB;AAAA,MACF;AAEA,eAAS,aAAc,QAAQ,YAAYA,QAAO;AAChD,YAAIC,KAAI,cAAc,QAAQD,MAAK;AACnC,YAAIA,SAAQ,KAAK,YAAY;AAC3B,UAAAC,MAAK,cAAc,QAAQD,SAAQ,CAAC,KAAK;AAAA,QAC3C;AACA,eAAOC;AAAA,MACT;AAEA,MAAAP,IAAG,UAAU,YAAY,SAAS,UAAW,QAAQ,OAAO,QAAQ;AAElE,aAAK,SAAS,KAAK,MAAM,OAAO,SAAS,SAAS,CAAC;AACnD,aAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;AAClC,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,eAAK,MAAM,CAAC,IAAI;AAAA,QAClB;AAGA,YAAI,MAAM;AACV,YAAI,IAAI;AAER,YAAI;AACJ,YAAI,WAAW,MAAM;AACnB,eAAK,IAAI,OAAO,SAAS,GAAG,KAAK,OAAO,KAAK,GAAG;AAC9C,gBAAI,aAAa,QAAQ,OAAO,CAAC,KAAK;AACtC,iBAAK,MAAM,CAAC,KAAK,IAAI;AACrB,gBAAI,OAAO,IAAI;AACb,qBAAO;AACP,mBAAK;AACL,mBAAK,MAAM,CAAC,KAAK,MAAM;AAAA,YACzB,OAAO;AACL,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF,OAAO;AACL,cAAI,cAAc,OAAO,SAAS;AAClC,eAAK,IAAI,cAAc,MAAM,IAAI,QAAQ,IAAI,OAAO,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC7E,gBAAI,aAAa,QAAQ,OAAO,CAAC,KAAK;AACtC,iBAAK,MAAM,CAAC,KAAK,IAAI;AACrB,gBAAI,OAAO,IAAI;AACb,qBAAO;AACP,mBAAK;AACL,mBAAK,MAAM,CAAC,KAAK,MAAM;AAAA,YACzB,OAAO;AACL,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AAEA,aAAK,MAAM;AAAA,MACb;AAEA,eAAS,UAAW,KAAK,OAAO,KAAKQ,MAAK;AACxC,YAAID,KAAI;AACR,YAAI,MAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAClC,iBAAS,IAAI,OAAO,IAAI,KAAK,KAAK;AAChC,cAAI,IAAI,IAAI,WAAW,CAAC,IAAI;AAE5B,UAAAA,MAAKC;AAGL,cAAI,KAAK,IAAI;AACX,YAAAD,MAAK,IAAI,KAAK;AAAA,UAGhB,WAAW,KAAK,IAAI;AAClB,YAAAA,MAAK,IAAI,KAAK;AAAA,UAGhB,OAAO;AACL,YAAAA,MAAK;AAAA,UACP;AAAA,QACF;AACA,eAAOA;AAAA,MACT;AAEA,MAAAP,IAAG,UAAU,aAAa,SAAS,WAAY,QAAQC,OAAM,OAAO;AAElE,aAAK,QAAQ,CAAE,CAAE;AACjB,aAAK,SAAS;AAGd,iBAAS,UAAU,GAAG,UAAU,GAAG,WAAW,UAAW,WAAWA,OAAM;AACxE;AAAA,QACF;AACA;AACA,kBAAW,UAAUA,QAAQ;AAE7B,YAAI,QAAQ,OAAO,SAAS;AAC5B,YAAIQ,OAAM,QAAQ;AAClB,YAAI,MAAM,KAAK,IAAI,OAAO,QAAQA,IAAG,IAAI;AAEzC,YAAI,OAAO;AACX,iBAAS,IAAI,OAAO,IAAI,KAAK,KAAK,SAAS;AACzC,iBAAO,UAAU,QAAQ,GAAG,IAAI,SAASR,KAAI;AAE7C,eAAK,MAAM,OAAO;AAClB,cAAI,KAAK,MAAM,CAAC,IAAI,OAAO,UAAW;AACpC,iBAAK,MAAM,CAAC,KAAK;AAAA,UACnB,OAAO;AACL,iBAAK,OAAO,IAAI;AAAA,UAClB;AAAA,QACF;AAEA,YAAIQ,SAAQ,GAAG;AACb,cAAIC,OAAM;AACV,iBAAO,UAAU,QAAQ,GAAG,OAAO,QAAQT,KAAI;AAE/C,eAAK,IAAI,GAAG,IAAIQ,MAAK,KAAK;AACxB,YAAAC,QAAOT;AAAA,UACT;AAEA,eAAK,MAAMS,IAAG;AACd,cAAI,KAAK,MAAM,CAAC,IAAI,OAAO,UAAW;AACpC,iBAAK,MAAM,CAAC,KAAK;AAAA,UACnB,OAAO;AACL,iBAAK,OAAO,IAAI;AAAA,UAClB;AAAA,QACF;AAEA,aAAK,MAAM;AAAA,MACb;AAEA,MAAAV,IAAG,UAAU,OAAO,SAAS,KAAM,MAAM;AACvC,aAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;AAClC,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,eAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC;AAAA,QAC9B;AACA,aAAK,SAAS,KAAK;AACnB,aAAK,WAAW,KAAK;AACrB,aAAK,MAAM,KAAK;AAAA,MAClB;AAEA,MAAAA,IAAG,UAAU,QAAQ,SAASW,SAAS;AACrC,YAAIJ,KAAI,IAAIP,IAAG,IAAI;AACnB,aAAK,KAAKO,EAAC;AACX,eAAOA;AAAA,MACT;AAEA,MAAAP,IAAG,UAAU,UAAU,SAAS,QAAS,MAAM;AAC7C,eAAO,KAAK,SAAS,MAAM;AACzB,eAAK,MAAM,KAAK,QAAQ,IAAI;AAAA,QAC9B;AACA,eAAO;AAAA,MACT;AAGA,MAAAA,IAAG,UAAU,QAAQ,SAAS,QAAS;AACrC,eAAO,KAAK,SAAS,KAAK,KAAK,MAAM,KAAK,SAAS,CAAC,MAAM,GAAG;AAC3D,eAAK;AAAA,QACP;AACA,eAAO,KAAK,UAAU;AAAA,MACxB;AAEA,MAAAA,IAAG,UAAU,YAAY,SAAS,YAAa;AAE7C,YAAI,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,MAAM,GAAG;AAC5C,eAAK,WAAW;AAAA,QAClB;AACA,eAAO;AAAA,MACT;AAEA,MAAAA,IAAG,UAAU,UAAU,SAASY,WAAW;AACzC,gBAAQ,KAAK,MAAM,YAAY,WAAW,KAAK,SAAS,EAAE,IAAI;AAAA,MAChE;AAgCA,UAAI,QAAQ;AAAA,QACV;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,UAAI,aAAa;AAAA,QACf;AAAA,QAAG;AAAA,QACH;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QACvB;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAClB;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAClB;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAClB;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,MACpB;AAEA,UAAI,aAAa;AAAA,QACf;AAAA,QAAG;AAAA,QACH;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAC5D;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAS;AAAA,QAC3D;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAS;AAAA,QAC3D;AAAA,QAAS;AAAA,QAAS;AAAA,QAAS;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QACzD;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,QAAU;AAAA,MAC9D;AAEA,MAAAZ,IAAG,UAAU,WAAW,SAASa,UAAUZ,OAAM,SAAS;AACxD,QAAAA,QAAOA,SAAQ;AACf,kBAAU,UAAU,KAAK;AAEzB,YAAI;AACJ,YAAIA,UAAS,MAAMA,UAAS,OAAO;AACjC,gBAAM;AACN,cAAI,MAAM;AACV,cAAI,QAAQ;AACZ,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,gBAAI,IAAI,KAAK,MAAM,CAAC;AACpB,gBAAI,SAAU,KAAK,MAAO,SAAS,UAAU,SAAS,EAAE;AACxD,oBAAS,MAAO,KAAK,MAAQ;AAC7B,mBAAO;AACP,gBAAI,OAAO,IAAI;AACb,qBAAO;AACP;AAAA,YACF;AACA,gBAAI,UAAU,KAAK,MAAM,KAAK,SAAS,GAAG;AACxC,oBAAM,MAAM,IAAI,KAAK,MAAM,IAAI,OAAO;AAAA,YACxC,OAAO;AACL,oBAAM,OAAO;AAAA,YACf;AAAA,UACF;AACA,cAAI,UAAU,GAAG;AACf,kBAAM,MAAM,SAAS,EAAE,IAAI;AAAA,UAC7B;AACA,iBAAO,IAAI,SAAS,YAAY,GAAG;AACjC,kBAAM,MAAM;AAAA,UACd;AACA,cAAI,KAAK,aAAa,GAAG;AACvB,kBAAM,MAAM;AAAA,UACd;AACA,iBAAO;AAAA,QACT;AAEA,YAAIA,WAAUA,QAAO,MAAMA,SAAQ,KAAKA,SAAQ,IAAI;AAElD,cAAI,YAAY,WAAWA,KAAI;AAE/B,cAAI,YAAY,WAAWA,KAAI;AAC/B,gBAAM;AACN,cAAI,IAAI,KAAK,MAAM;AACnB,YAAE,WAAW;AACb,iBAAO,CAAC,EAAE,OAAO,GAAG;AAClB,gBAAIM,KAAI,EAAE,KAAK,SAAS,EAAE,SAASN,KAAI;AACvC,gBAAI,EAAE,MAAM,SAAS;AAErB,gBAAI,CAAC,EAAE,OAAO,GAAG;AACf,oBAAM,MAAM,YAAYM,GAAE,MAAM,IAAIA,KAAI;AAAA,YAC1C,OAAO;AACL,oBAAMA,KAAI;AAAA,YACZ;AAAA,UACF;AACA,cAAI,KAAK,OAAO,GAAG;AACjB,kBAAM,MAAM;AAAA,UACd;AACA,iBAAO,IAAI,SAAS,YAAY,GAAG;AACjC,kBAAM,MAAM;AAAA,UACd;AACA,cAAI,KAAK,aAAa,GAAG;AACvB,kBAAM,MAAM;AAAA,UACd;AACA,iBAAO;AAAA,QACT;AAEA,QAAAT,QAAO,OAAO,iCAAiC;AAAA,MACjD;AAEA,MAAAE,IAAG,UAAU,WAAW,SAAS,WAAY;AAC3C,YAAI,MAAM,KAAK,MAAM,CAAC;AACtB,YAAI,KAAK,WAAW,GAAG;AACrB,iBAAO,KAAK,MAAM,CAAC,IAAI;AAAA,QACzB,WAAW,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,MAAM,GAAM;AAEtD,iBAAO,mBAAoB,KAAK,MAAM,CAAC,IAAI;AAAA,QAC7C,WAAW,KAAK,SAAS,GAAG;AAC1B,UAAAF,QAAO,OAAO,4CAA4C;AAAA,QAC5D;AACA,eAAQ,KAAK,aAAa,IAAK,CAAC,MAAM;AAAA,MACxC;AAEA,MAAAE,IAAG,UAAU,SAAS,SAASc,UAAU;AACvC,eAAO,KAAK,SAAS,EAAE;AAAA,MACzB;AAEA,MAAAd,IAAG,UAAU,WAAW,SAASe,UAAU,QAAQ,QAAQ;AACzD,QAAAjB,QAAO,OAAOI,YAAW,WAAW;AACpC,eAAO,KAAK,YAAYA,SAAQ,QAAQ,MAAM;AAAA,MAChD;AAEA,MAAAF,IAAG,UAAU,UAAU,SAASgB,SAAS,QAAQ,QAAQ;AACvD,eAAO,KAAK,YAAY,OAAO,QAAQ,MAAM;AAAA,MAC/C;AAEA,MAAAhB,IAAG,UAAU,cAAc,SAAS,YAAa,WAAW,QAAQ,QAAQ;AAC1E,YAAIiB,cAAa,KAAK,WAAW;AACjC,YAAI,YAAY,UAAU,KAAK,IAAI,GAAGA,WAAU;AAChD,QAAAnB,QAAOmB,eAAc,WAAW,uCAAuC;AACvE,QAAAnB,QAAO,YAAY,GAAG,6BAA6B;AAEnD,aAAK,MAAM;AACX,YAAI,eAAe,WAAW;AAC9B,YAAI,MAAM,IAAI,UAAU,SAAS;AAEjC,YAAI,GAAG;AACP,YAAI,IAAI,KAAK,MAAM;AACnB,YAAI,CAAC,cAAc;AAEjB,eAAK,IAAI,GAAG,IAAI,YAAYmB,aAAY,KAAK;AAC3C,gBAAI,CAAC,IAAI;AAAA,UACX;AAEA,eAAK,IAAI,GAAG,CAAC,EAAE,OAAO,GAAG,KAAK;AAC5B,gBAAI,EAAE,MAAM,GAAI;AAChB,cAAE,OAAO,CAAC;AAEV,gBAAI,YAAY,IAAI,CAAC,IAAI;AAAA,UAC3B;AAAA,QACF,OAAO;AACL,eAAK,IAAI,GAAG,CAAC,EAAE,OAAO,GAAG,KAAK;AAC5B,gBAAI,EAAE,MAAM,GAAI;AAChB,cAAE,OAAO,CAAC;AAEV,gBAAI,CAAC,IAAI;AAAA,UACX;AAEA,iBAAO,IAAI,WAAW,KAAK;AACzB,gBAAI,CAAC,IAAI;AAAA,UACX;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAEA,UAAI,KAAK,OAAO;AACd,QAAAjB,IAAG,UAAU,aAAa,SAAS,WAAY,GAAG;AAChD,iBAAO,KAAK,KAAK,MAAM,CAAC;AAAA,QAC1B;AAAA,MACF,OAAO;AACL,QAAAA,IAAG,UAAU,aAAa,SAAS,WAAY,GAAG;AAChD,cAAI,IAAI;AACR,cAAIO,KAAI;AACR,cAAI,KAAK,MAAQ;AACf,YAAAA,MAAK;AACL,mBAAO;AAAA,UACT;AACA,cAAI,KAAK,IAAM;AACb,YAAAA,MAAK;AACL,mBAAO;AAAA,UACT;AACA,cAAI,KAAK,GAAK;AACZ,YAAAA,MAAK;AACL,mBAAO;AAAA,UACT;AACA,cAAI,KAAK,GAAM;AACb,YAAAA,MAAK;AACL,mBAAO;AAAA,UACT;AACA,iBAAOA,KAAI;AAAA,QACb;AAAA,MACF;AAEA,MAAAP,IAAG,UAAU,YAAY,SAAS,UAAW,GAAG;AAE9C,YAAI,MAAM,EAAG,QAAO;AAEpB,YAAI,IAAI;AACR,YAAIO,KAAI;AACR,aAAK,IAAI,UAAY,GAAG;AACtB,UAAAA,MAAK;AACL,iBAAO;AAAA,QACT;AACA,aAAK,IAAI,SAAU,GAAG;AACpB,UAAAA,MAAK;AACL,iBAAO;AAAA,QACT;AACA,aAAK,IAAI,QAAS,GAAG;AACnB,UAAAA,MAAK;AACL,iBAAO;AAAA,QACT;AACA,aAAK,IAAI,OAAS,GAAG;AACnB,UAAAA,MAAK;AACL,iBAAO;AAAA,QACT;AACA,aAAK,IAAI,OAAS,GAAG;AACnB,UAAAA;AAAA,QACF;AACA,eAAOA;AAAA,MACT;AAGA,MAAAP,IAAG,UAAU,YAAY,SAAS,YAAa;AAC7C,YAAI,IAAI,KAAK,MAAM,KAAK,SAAS,CAAC;AAClC,YAAI,KAAK,KAAK,WAAW,CAAC;AAC1B,gBAAQ,KAAK,SAAS,KAAK,KAAK;AAAA,MAClC;AAEA,eAAS,WAAY,KAAK;AACxB,YAAI,IAAI,IAAI,MAAM,IAAI,UAAU,CAAC;AAEjC,iBAAS,MAAM,GAAG,MAAM,EAAE,QAAQ,OAAO;AACvC,cAAI,MAAO,MAAM,KAAM;AACvB,cAAI,OAAO,MAAM;AAEjB,YAAE,GAAG,KAAK,IAAI,MAAM,GAAG,IAAK,KAAK,UAAW;AAAA,QAC9C;AAEA,eAAO;AAAA,MACT;AAGA,MAAAA,IAAG,UAAU,WAAW,SAAS,WAAY;AAC3C,YAAI,KAAK,OAAO,EAAG,QAAO;AAE1B,YAAIO,KAAI;AACR,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAI,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,CAAC;AACpC,UAAAA,MAAK;AACL,cAAI,MAAM,GAAI;AAAA,QAChB;AACA,eAAOA;AAAA,MACT;AAEA,MAAAP,IAAG,UAAU,aAAa,SAASiB,cAAc;AAC/C,eAAO,KAAK,KAAK,KAAK,UAAU,IAAI,CAAC;AAAA,MACvC;AAEA,MAAAjB,IAAG,UAAU,SAAS,SAAS,OAAQ,OAAO;AAC5C,YAAI,KAAK,aAAa,GAAG;AACvB,iBAAO,KAAK,IAAI,EAAE,MAAM,KAAK,EAAE,MAAM,CAAC;AAAA,QACxC;AACA,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAA,IAAG,UAAU,WAAW,SAAS,SAAU,OAAO;AAChD,YAAI,KAAK,MAAM,QAAQ,CAAC,GAAG;AACzB,iBAAO,KAAK,KAAK,KAAK,EAAE,MAAM,CAAC,EAAE,KAAK;AAAA,QACxC;AACA,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAA,IAAG,UAAU,QAAQ,SAAS,QAAS;AACrC,eAAO,KAAK,aAAa;AAAA,MAC3B;AAGA,MAAAA,IAAG,UAAU,MAAM,SAASkB,OAAO;AACjC,eAAO,KAAK,MAAM,EAAE,KAAK;AAAA,MAC3B;AAEA,MAAAlB,IAAG,UAAU,OAAO,SAAS,OAAQ;AACnC,YAAI,CAAC,KAAK,OAAO,GAAG;AAClB,eAAK,YAAY;AAAA,QACnB;AAEA,eAAO;AAAA,MACT;AAGA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,eAAO,KAAK,SAAS,IAAI,QAAQ;AAC/B,eAAK,MAAM,KAAK,QAAQ,IAAI;AAAA,QAC9B;AAEA,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,eAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC;AAAA,QAC7C;AAEA,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,QAAAF,SAAQ,KAAK,WAAW,IAAI,cAAc,CAAC;AAC3C,eAAO,KAAK,KAAK,GAAG;AAAA,MACtB;AAGA,MAAAE,IAAG,UAAU,KAAK,SAAS,GAAI,KAAK;AAClC,YAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAM,EAAE,IAAI,GAAG;AACzD,eAAO,IAAI,MAAM,EAAE,IAAI,IAAI;AAAA,MAC7B;AAEA,MAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,YAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAM,EAAE,KAAK,GAAG;AAC1D,eAAO,IAAI,MAAM,EAAE,KAAK,IAAI;AAAA,MAC9B;AAGA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AAExC,YAAI;AACJ,YAAI,KAAK,SAAS,IAAI,QAAQ;AAC5B,cAAI;AAAA,QACN,OAAO;AACL,cAAI;AAAA,QACN;AAEA,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,eAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC;AAAA,QAC7C;AAEA,aAAK,SAAS,EAAE;AAEhB,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,QAAAF,SAAQ,KAAK,WAAW,IAAI,cAAc,CAAC;AAC3C,eAAO,KAAK,MAAM,GAAG;AAAA,MACvB;AAGA,MAAAE,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,YAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAM,EAAE,KAAK,GAAG;AAC1D,eAAO,IAAI,MAAM,EAAE,KAAK,IAAI;AAAA,MAC9B;AAEA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,YAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAM,EAAE,MAAM,GAAG;AAC3D,eAAO,IAAI,MAAM,EAAE,MAAM,IAAI;AAAA,MAC/B;AAGA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AAExC,YAAI;AACJ,YAAI;AACJ,YAAI,KAAK,SAAS,IAAI,QAAQ;AAC5B,cAAI;AACJ,cAAI;AAAA,QACN,OAAO;AACL,cAAI;AACJ,cAAI;AAAA,QACN;AAEA,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,eAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;AAAA,QACxC;AAEA,YAAI,SAAS,GAAG;AACd,iBAAO,IAAI,EAAE,QAAQ,KAAK;AACxB,iBAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;AAAA,UAC3B;AAAA,QACF;AAEA,aAAK,SAAS,EAAE;AAEhB,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,QAAAF,SAAQ,KAAK,WAAW,IAAI,cAAc,CAAC;AAC3C,eAAO,KAAK,MAAM,GAAG;AAAA,MACvB;AAGA,MAAAE,IAAG,UAAU,MAAM,SAASmB,KAAK,KAAK;AACpC,YAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAM,EAAE,KAAK,GAAG;AAC1D,eAAO,IAAI,MAAM,EAAE,KAAK,IAAI;AAAA,MAC9B;AAEA,MAAAnB,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,YAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAM,EAAE,MAAM,GAAG;AAC3D,eAAO,IAAI,MAAM,EAAE,MAAM,IAAI;AAAA,MAC/B;AAGA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,OAAO;AAC1C,QAAAF,QAAO,OAAO,UAAU,YAAY,SAAS,CAAC;AAE9C,YAAI,cAAc,KAAK,KAAK,QAAQ,EAAE,IAAI;AAC1C,YAAI,WAAW,QAAQ;AAGvB,aAAK,QAAQ,WAAW;AAExB,YAAI,WAAW,GAAG;AAChB;AAAA,QACF;AAGA,iBAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,eAAK,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI;AAAA,QACnC;AAGA,YAAI,WAAW,GAAG;AAChB,eAAK,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,IAAK,YAAc,KAAK;AACrD;AAAA,QACF;AAGA,eAAO,IAAI,KAAK,QAAQ,KAAK;AAC3B,eAAK,MAAM,CAAC,IAAI;AAAA,QAClB;AAGA,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,OAAO;AACxC,eAAO,KAAK,MAAM,EAAE,MAAM,KAAK;AAAA,MACjC;AAGA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK,KAAK;AAC3C,QAAAF,QAAO,OAAO,QAAQ,YAAY,OAAO,CAAC;AAE1C,YAAI,MAAO,MAAM,KAAM;AACvB,YAAI,OAAO,MAAM;AAEjB,aAAK,QAAQ,MAAM,CAAC;AAEpB,YAAI,KAAK;AACP,eAAK,MAAM,GAAG,IAAI,KAAK,MAAM,GAAG,IAAK,KAAK;AAAA,QAC5C,OAAO;AACL,eAAK,MAAM,GAAG,IAAI,KAAK,MAAM,GAAG,IAAI,EAAE,KAAK;AAAA,QAC7C;AAEA,eAAO,KAAK,MAAM;AAAA,MACpB;AAGA,MAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,YAAIO;AAGJ,YAAI,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AAC7C,eAAK,WAAW;AAChB,UAAAA,KAAI,KAAK,KAAK,GAAG;AACjB,eAAK,YAAY;AACjB,iBAAO,KAAK,UAAU;AAAA,QAGxB,WAAW,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AACpD,cAAI,WAAW;AACf,UAAAA,KAAI,KAAK,KAAK,GAAG;AACjB,cAAI,WAAW;AACf,iBAAOA,GAAE,UAAU;AAAA,QACrB;AAGA,YAAI,GAAG;AACP,YAAI,KAAK,SAAS,IAAI,QAAQ;AAC5B,cAAI;AACJ,cAAI;AAAA,QACN,OAAO;AACL,cAAI;AACJ,cAAI;AAAA,QACN;AAEA,YAAI,QAAQ;AACZ,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK;AAC1C,eAAK,MAAM,CAAC,IAAIA,KAAI;AACpB,kBAAQA,OAAM;AAAA,QAChB;AACA,eAAO,UAAU,KAAK,IAAI,EAAE,QAAQ,KAAK;AACvC,UAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,KAAK;AACvB,eAAK,MAAM,CAAC,IAAIA,KAAI;AACpB,kBAAQA,OAAM;AAAA,QAChB;AAEA,aAAK,SAAS,EAAE;AAChB,YAAI,UAAU,GAAG;AACf,eAAK,MAAM,KAAK,MAAM,IAAI;AAC1B,eAAK;AAAA,QAEP,WAAW,MAAM,MAAM;AACrB,iBAAO,IAAI,EAAE,QAAQ,KAAK;AACxB,iBAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;AAAA,UAC3B;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAGA,MAAAP,IAAG,UAAU,MAAM,SAASoB,KAAK,KAAK;AACpC,YAAI;AACJ,YAAI,IAAI,aAAa,KAAK,KAAK,aAAa,GAAG;AAC7C,cAAI,WAAW;AACf,gBAAM,KAAK,IAAI,GAAG;AAClB,cAAI,YAAY;AAChB,iBAAO;AAAA,QACT,WAAW,IAAI,aAAa,KAAK,KAAK,aAAa,GAAG;AACpD,eAAK,WAAW;AAChB,gBAAM,IAAI,IAAI,IAAI;AAClB,eAAK,WAAW;AAChB,iBAAO;AAAA,QACT;AAEA,YAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAM,EAAE,KAAK,GAAG;AAE1D,eAAO,IAAI,MAAM,EAAE,KAAK,IAAI;AAAA,MAC9B;AAGA,MAAApB,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AAEtC,YAAI,IAAI,aAAa,GAAG;AACtB,cAAI,WAAW;AACf,cAAIO,KAAI,KAAK,KAAK,GAAG;AACrB,cAAI,WAAW;AACf,iBAAOA,GAAE,UAAU;AAAA,QAGrB,WAAW,KAAK,aAAa,GAAG;AAC9B,eAAK,WAAW;AAChB,eAAK,KAAK,GAAG;AACb,eAAK,WAAW;AAChB,iBAAO,KAAK,UAAU;AAAA,QACxB;AAGA,YAAI,MAAM,KAAK,IAAI,GAAG;AAGtB,YAAI,QAAQ,GAAG;AACb,eAAK,WAAW;AAChB,eAAK,SAAS;AACd,eAAK,MAAM,CAAC,IAAI;AAChB,iBAAO;AAAA,QACT;AAGA,YAAI,GAAG;AACP,YAAI,MAAM,GAAG;AACX,cAAI;AACJ,cAAI;AAAA,QACN,OAAO;AACL,cAAI;AACJ,cAAI;AAAA,QACN;AAEA,YAAI,QAAQ;AACZ,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK;AAC1C,kBAAQA,MAAK;AACb,eAAK,MAAM,CAAC,IAAIA,KAAI;AAAA,QACtB;AACA,eAAO,UAAU,KAAK,IAAI,EAAE,QAAQ,KAAK;AACvC,UAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,KAAK;AACvB,kBAAQA,MAAK;AACb,eAAK,MAAM,CAAC,IAAIA,KAAI;AAAA,QACtB;AAGA,YAAI,UAAU,KAAK,IAAI,EAAE,UAAU,MAAM,MAAM;AAC7C,iBAAO,IAAI,EAAE,QAAQ,KAAK;AACxB,iBAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;AAAA,UAC3B;AAAA,QACF;AAEA,aAAK,SAAS,KAAK,IAAI,KAAK,QAAQ,CAAC;AAErC,YAAI,MAAM,MAAM;AACd,eAAK,WAAW;AAAA,QAClB;AAEA,eAAO,KAAK,MAAM;AAAA,MACpB;AAGA,MAAAP,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,eAAO,KAAK,MAAM,EAAE,KAAK,GAAG;AAAA,MAC9B;AAEA,eAAS,WAAYqB,OAAM,KAAK,KAAK;AACnC,YAAI,WAAW,IAAI,WAAWA,MAAK;AACnC,YAAI,MAAOA,MAAK,SAAS,IAAI,SAAU;AACvC,YAAI,SAAS;AACb,cAAO,MAAM,IAAK;AAGlB,YAAI,IAAIA,MAAK,MAAM,CAAC,IAAI;AACxB,YAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AACvB,YAAId,KAAI,IAAI;AAEZ,YAAI,KAAKA,KAAI;AACb,YAAI,QAASA,KAAI,WAAa;AAC9B,YAAI,MAAM,CAAC,IAAI;AAEf,iBAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAG5B,cAAI,SAAS,UAAU;AACvB,cAAI,QAAQ,QAAQ;AACpB,cAAI,OAAO,KAAK,IAAI,GAAG,IAAI,SAAS,CAAC;AACrC,mBAAS,IAAI,KAAK,IAAI,GAAG,IAAIc,MAAK,SAAS,CAAC,GAAG,KAAK,MAAM,KAAK;AAC7D,gBAAI,IAAK,IAAI,IAAK;AAClB,gBAAIA,MAAK,MAAM,CAAC,IAAI;AACpB,gBAAI,IAAI,MAAM,CAAC,IAAI;AACnB,YAAAd,KAAI,IAAI,IAAI;AACZ,sBAAWA,KAAI,WAAa;AAC5B,oBAAQA,KAAI;AAAA,UACd;AACA,cAAI,MAAM,CAAC,IAAI,QAAQ;AACvB,kBAAQ,SAAS;AAAA,QACnB;AACA,YAAI,UAAU,GAAG;AACf,cAAI,MAAM,CAAC,IAAI,QAAQ;AAAA,QACzB,OAAO;AACL,cAAI;AAAA,QACN;AAEA,eAAO,IAAI,MAAM;AAAA,MACnB;AAKA,UAAI,cAAc,SAASe,aAAaD,OAAM,KAAK,KAAK;AACtD,YAAI,IAAIA,MAAK;AACb,YAAI,IAAI,IAAI;AACZ,YAAI,IAAI,IAAI;AACZ,YAAI,IAAI;AACR,YAAI;AACJ,YAAI;AACJ,YAAI;AACJ,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AACjB,YAAI,KAAK,EAAE,CAAC,IAAI;AAChB,YAAI,MAAM,KAAK;AACf,YAAI,MAAM,OAAO;AAEjB,YAAI,WAAWA,MAAK,WAAW,IAAI;AACnC,YAAI,SAAS;AAEb,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,aAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,cAAM;AAEN,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,aAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,cAAM;AAEN,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,aAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,cAAM;AAEN,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,aAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,cAAM;AAEN,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,aAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,cAAM;AAEN,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,aAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,cAAM;AAEN,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,aAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,cAAM;AAEN,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,aAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,cAAM;AAEN,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,aAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,cAAM;AAEN,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,aAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,cAAM;AAEN,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,aAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,eAAO;AAEP,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,aAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,eAAO;AAEP,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,aAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,eAAO;AAEP,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,aAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,eAAO;AAEP,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,aAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,eAAO;AAEP,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,aAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,eAAO;AAEP,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,aAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,eAAO;AAEP,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,aAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,eAAO;AAEP,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,cAAM,KAAK,KAAK,KAAK,GAAG;AACxB,cAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,aAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,aAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,eAAO;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,CAAC,IAAI;AACP,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,UAAE,EAAE,IAAI;AACR,YAAI,MAAM,GAAG;AACX,YAAE,EAAE,IAAI;AACR,cAAI;AAAA,QACN;AACA,eAAO;AAAA,MACT;AAGA,UAAI,CAAC,KAAK,MAAM;AACd,sBAAc;AAAA,MAChB;AAEA,eAAS,SAAUA,OAAM,KAAK,KAAK;AACjC,YAAI,WAAW,IAAI,WAAWA,MAAK;AACnC,YAAI,SAASA,MAAK,SAAS,IAAI;AAE/B,YAAI,QAAQ;AACZ,YAAI,UAAU;AACd,iBAAS,IAAI,GAAG,IAAI,IAAI,SAAS,GAAG,KAAK;AAGvC,cAAI,SAAS;AACb,oBAAU;AACV,cAAI,QAAQ,QAAQ;AACpB,cAAI,OAAO,KAAK,IAAI,GAAG,IAAI,SAAS,CAAC;AACrC,mBAAS,IAAI,KAAK,IAAI,GAAG,IAAIA,MAAK,SAAS,CAAC,GAAG,KAAK,MAAM,KAAK;AAC7D,gBAAI,IAAI,IAAI;AACZ,gBAAI,IAAIA,MAAK,MAAM,CAAC,IAAI;AACxB,gBAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AACvB,gBAAId,KAAI,IAAI;AAEZ,gBAAI,KAAKA,KAAI;AACb,qBAAU,UAAWA,KAAI,WAAa,KAAM;AAC5C,iBAAM,KAAK,QAAS;AACpB,oBAAQ,KAAK;AACb,qBAAU,UAAU,OAAO,MAAO;AAElC,uBAAW,WAAW;AACtB,sBAAU;AAAA,UACZ;AACA,cAAI,MAAM,CAAC,IAAI;AACf,kBAAQ;AACR,mBAAS;AAAA,QACX;AACA,YAAI,UAAU,GAAG;AACf,cAAI,MAAM,CAAC,IAAI;AAAA,QACjB,OAAO;AACL,cAAI;AAAA,QACN;AAEA,eAAO,IAAI,MAAM;AAAA,MACnB;AAEA,eAAS,WAAYc,OAAM,KAAK,KAAK;AACnC,YAAI,OAAO,IAAI,KAAK;AACpB,eAAO,KAAK,KAAKA,OAAM,KAAK,GAAG;AAAA,MACjC;AAEA,MAAArB,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK,KAAK;AAC7C,YAAI;AACJ,YAAI,MAAM,KAAK,SAAS,IAAI;AAC5B,YAAI,KAAK,WAAW,MAAM,IAAI,WAAW,IAAI;AAC3C,gBAAM,YAAY,MAAM,KAAK,GAAG;AAAA,QAClC,WAAW,MAAM,IAAI;AACnB,gBAAM,WAAW,MAAM,KAAK,GAAG;AAAA,QACjC,WAAW,MAAM,MAAM;AACrB,gBAAM,SAAS,MAAM,KAAK,GAAG;AAAA,QAC/B,OAAO;AACL,gBAAM,WAAW,MAAM,KAAK,GAAG;AAAA,QACjC;AAEA,eAAO;AAAA,MACT;AAKA,eAAS,KAAM,GAAG,GAAG;AACnB,aAAK,IAAI;AACT,aAAK,IAAI;AAAA,MACX;AAEA,WAAK,UAAU,UAAU,SAAS,QAAS,GAAG;AAC5C,YAAI,IAAI,IAAI,MAAM,CAAC;AACnB,YAAI,IAAIA,IAAG,UAAU,WAAW,CAAC,IAAI;AACrC,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAE,CAAC,IAAI,KAAK,OAAO,GAAG,GAAG,CAAC;AAAA,QAC5B;AAEA,eAAO;AAAA,MACT;AAGA,WAAK,UAAU,SAAS,SAAS,OAAQ,GAAG,GAAG,GAAG;AAChD,YAAI,MAAM,KAAK,MAAM,IAAI,EAAG,QAAO;AAEnC,YAAI,KAAK;AACT,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,iBAAO,IAAI,MAAO,IAAI,IAAI;AAC1B,gBAAM;AAAA,QACR;AAEA,eAAO;AAAA,MACT;AAIA,WAAK,UAAU,UAAU,SAASuB,SAAS,KAAK,KAAK,KAAK,MAAM,MAAM,GAAG;AACvE,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAK,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;AACpB,eAAK,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;AAAA,QACtB;AAAA,MACF;AAEA,WAAK,UAAU,YAAY,SAAS,UAAW,KAAK,KAAK,MAAM,MAAM,GAAG,KAAK;AAC3E,aAAK,QAAQ,KAAK,KAAK,KAAK,MAAM,MAAM,CAAC;AAEzC,iBAASC,KAAI,GAAGA,KAAI,GAAGA,OAAM,GAAG;AAC9B,cAAI,IAAIA,MAAK;AAEb,cAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AACpC,cAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AAEpC,mBAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC7B,gBAAI,SAAS;AACb,gBAAI,SAAS;AAEb,qBAAS,IAAI,GAAG,IAAIA,IAAG,KAAK;AAC1B,kBAAI,KAAK,KAAK,IAAI,CAAC;AACnB,kBAAI,KAAK,KAAK,IAAI,CAAC;AAEnB,kBAAI,KAAK,KAAK,IAAI,IAAIA,EAAC;AACvB,kBAAI,KAAK,KAAK,IAAI,IAAIA,EAAC;AAEvB,kBAAI,KAAK,SAAS,KAAK,SAAS;AAEhC,mBAAK,SAAS,KAAK,SAAS;AAC5B,mBAAK;AAEL,mBAAK,IAAI,CAAC,IAAI,KAAK;AACnB,mBAAK,IAAI,CAAC,IAAI,KAAK;AAEnB,mBAAK,IAAI,IAAIA,EAAC,IAAI,KAAK;AACvB,mBAAK,IAAI,IAAIA,EAAC,IAAI,KAAK;AAGvB,kBAAI,MAAM,GAAG;AACX,qBAAK,QAAQ,SAAS,QAAQ;AAE9B,yBAAS,QAAQ,SAAS,QAAQ;AAClC,yBAAS;AAAA,cACX;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,WAAK,UAAU,cAAc,SAAS,YAAa,GAAG,GAAG;AACvD,YAAI,IAAI,KAAK,IAAI,GAAG,CAAC,IAAI;AACzB,YAAI,MAAM,IAAI;AACd,YAAI,IAAI;AACR,aAAK,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,MAAM,GAAG;AAClC;AAAA,QACF;AAEA,eAAO,KAAK,IAAI,IAAI;AAAA,MACtB;AAEA,WAAK,UAAU,YAAY,SAAS,UAAW,KAAK,KAAK,GAAG;AAC1D,YAAI,KAAK,EAAG;AAEZ,iBAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,cAAI,IAAI,IAAI,CAAC;AAEb,cAAI,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC;AACtB,cAAI,IAAI,IAAI,CAAC,IAAI;AAEjB,cAAI,IAAI,CAAC;AAET,cAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;AACvB,cAAI,IAAI,IAAI,CAAC,IAAI,CAAC;AAAA,QACpB;AAAA,MACF;AAEA,WAAK,UAAU,eAAe,SAAS,aAAc,IAAI,GAAG;AAC1D,YAAI,QAAQ;AACZ,iBAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,cAAI,IAAI,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,OACtC,KAAK,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IACxB;AAEF,aAAG,CAAC,IAAI,IAAI;AAEZ,cAAI,IAAI,UAAW;AACjB,oBAAQ;AAAA,UACV,OAAO;AACL,oBAAQ,IAAI,WAAY;AAAA,UAC1B;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAEA,WAAK,UAAU,aAAa,SAAS,WAAY,IAAI,KAAK,KAAK,GAAG;AAChE,YAAI,QAAQ;AACZ,iBAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,kBAAQ,SAAS,GAAG,CAAC,IAAI;AAEzB,cAAI,IAAI,CAAC,IAAI,QAAQ;AAAQ,kBAAQ,UAAU;AAC/C,cAAI,IAAI,IAAI,CAAC,IAAI,QAAQ;AAAQ,kBAAQ,UAAU;AAAA,QACrD;AAGA,aAAK,IAAI,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG;AAC5B,cAAI,CAAC,IAAI;AAAA,QACX;AAEA,QAAA1B,QAAO,UAAU,CAAC;AAClB,QAAAA,SAAQ,QAAQ,CAAC,UAAY,CAAC;AAAA,MAChC;AAEA,WAAK,UAAU,OAAO,SAAS2B,MAAM,GAAG;AACtC,YAAI,KAAK,IAAI,MAAM,CAAC;AACpB,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAG,CAAC,IAAI;AAAA,QACV;AAEA,eAAO;AAAA,MACT;AAEA,WAAK,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG,KAAK;AAC9C,YAAI,IAAI,IAAI,KAAK,YAAY,EAAE,QAAQ,EAAE,MAAM;AAE/C,YAAI,MAAM,KAAK,QAAQ,CAAC;AAExB,YAAI,IAAI,KAAK,KAAK,CAAC;AAEnB,YAAI,MAAM,IAAI,MAAM,CAAC;AACrB,YAAI,OAAO,IAAI,MAAM,CAAC;AACtB,YAAI,OAAO,IAAI,MAAM,CAAC;AAEtB,YAAI,OAAO,IAAI,MAAM,CAAC;AACtB,YAAI,QAAQ,IAAI,MAAM,CAAC;AACvB,YAAI,QAAQ,IAAI,MAAM,CAAC;AAEvB,YAAI,OAAO,IAAI;AACf,aAAK,SAAS;AAEd,aAAK,WAAW,EAAE,OAAO,EAAE,QAAQ,KAAK,CAAC;AACzC,aAAK,WAAW,EAAE,OAAO,EAAE,QAAQ,MAAM,CAAC;AAE1C,aAAK,UAAU,KAAK,GAAG,MAAM,MAAM,GAAG,GAAG;AACzC,aAAK,UAAU,MAAM,GAAG,OAAO,OAAO,GAAG,GAAG;AAE5C,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAI,KAAK,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC;AAC/C,eAAK,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC;AAChD,eAAK,CAAC,IAAI;AAAA,QACZ;AAEA,aAAK,UAAU,MAAM,MAAM,CAAC;AAC5B,aAAK,UAAU,MAAM,MAAM,MAAM,GAAG,GAAG,GAAG;AAC1C,aAAK,UAAU,MAAM,GAAG,CAAC;AACzB,aAAK,aAAa,MAAM,CAAC;AAEzB,YAAI,WAAW,EAAE,WAAW,EAAE;AAC9B,YAAI,SAAS,EAAE,SAAS,EAAE;AAC1B,eAAO,IAAI,MAAM;AAAA,MACnB;AAGA,MAAAzB,IAAG,UAAU,MAAM,SAASQ,KAAK,KAAK;AACpC,YAAI,MAAM,IAAIR,IAAG,IAAI;AACrB,YAAI,QAAQ,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM;AAC9C,eAAO,KAAK,MAAM,KAAK,GAAG;AAAA,MAC5B;AAGA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,YAAI,MAAM,IAAIA,IAAG,IAAI;AACrB,YAAI,QAAQ,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM;AAC9C,eAAO,WAAW,MAAM,KAAK,GAAG;AAAA,MAClC;AAGA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,eAAO,KAAK,MAAM,EAAE,MAAM,KAAK,IAAI;AAAA,MACrC;AAEA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,QAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,QAAAA,QAAO,MAAM,QAAS;AAGtB,YAAI,QAAQ;AACZ,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAI,KAAK,KAAK,MAAM,CAAC,IAAI,KAAK;AAC9B,cAAI,MAAM,IAAI,aAAc,QAAQ;AACpC,oBAAU;AACV,mBAAU,IAAI,WAAa;AAE3B,mBAAS,OAAO;AAChB,eAAK,MAAM,CAAC,IAAI,KAAK;AAAA,QACvB;AAEA,YAAI,UAAU,GAAG;AACf,eAAK,MAAM,CAAC,IAAI;AAChB,eAAK;AAAA,QACP;AACA,YAAI,QAAQ,GAAG;AACb,eAAK,SAAS;AACd,eAAK,UAAU;AAAA,QACjB;AAEA,eAAO;AAAA,MACT;AAEA,MAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,eAAO,KAAK,MAAM,EAAE,MAAM,GAAG;AAAA,MAC/B;AAGA,MAAAA,IAAG,UAAU,MAAM,SAAS,MAAO;AACjC,eAAO,KAAK,IAAI,IAAI;AAAA,MACtB;AAGA,MAAAA,IAAG,UAAU,OAAO,SAAS,OAAQ;AACnC,eAAO,KAAK,KAAK,KAAK,MAAM,CAAC;AAAA,MAC/B;AAGA,MAAAA,IAAG,UAAU,MAAM,SAASU,KAAK,KAAK;AACpC,YAAI,IAAI,WAAW,GAAG;AACtB,YAAI,EAAE,WAAW,EAAG,QAAO,IAAIV,IAAG,CAAC;AAGnC,YAAI,MAAM;AACV,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,MAAM,IAAI,IAAI,GAAG;AAClD,cAAI,EAAE,CAAC,MAAM,EAAG;AAAA,QAClB;AAEA,YAAI,EAAE,IAAI,EAAE,QAAQ;AAClB,mBAAS,IAAI,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,IAAI,EAAE,IAAI,GAAG;AACtD,gBAAI,EAAE,CAAC,MAAM,EAAG;AAEhB,kBAAM,IAAI,IAAI,CAAC;AAAA,UACjB;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAGA,MAAAA,IAAG,UAAU,SAAS,SAAS,OAAQ,MAAM;AAC3C,QAAAF,QAAO,OAAO,SAAS,YAAY,QAAQ,CAAC;AAC5C,YAAIS,KAAI,OAAO;AACf,YAAIiB,MAAK,OAAOjB,MAAK;AACrB,YAAI,YAAa,aAAe,KAAKA,MAAQ,KAAKA;AAClD,YAAI;AAEJ,YAAIA,OAAM,GAAG;AACX,cAAI,QAAQ;AAEZ,eAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,gBAAI,WAAW,KAAK,MAAM,CAAC,IAAI;AAC/B,gBAAI,KAAM,KAAK,MAAM,CAAC,IAAI,KAAK,YAAaA;AAC5C,iBAAK,MAAM,CAAC,IAAI,IAAI;AACpB,oBAAQ,aAAc,KAAKA;AAAA,UAC7B;AAEA,cAAI,OAAO;AACT,iBAAK,MAAM,CAAC,IAAI;AAChB,iBAAK;AAAA,UACP;AAAA,QACF;AAEA,YAAIiB,OAAM,GAAG;AACX,eAAK,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACrC,iBAAK,MAAM,IAAIA,EAAC,IAAI,KAAK,MAAM,CAAC;AAAA,UAClC;AAEA,eAAK,IAAI,GAAG,IAAIA,IAAG,KAAK;AACtB,iBAAK,MAAM,CAAC,IAAI;AAAA,UAClB;AAEA,eAAK,UAAUA;AAAA,QACjB;AAEA,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAxB,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AAEzC,QAAAF,QAAO,KAAK,aAAa,CAAC;AAC1B,eAAO,KAAK,OAAO,IAAI;AAAA,MACzB;AAKA,MAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,MAAM,MAAM,UAAU;AAC3D,QAAAF,QAAO,OAAO,SAAS,YAAY,QAAQ,CAAC;AAC5C,YAAI;AACJ,YAAI,MAAM;AACR,eAAK,OAAQ,OAAO,MAAO;AAAA,QAC7B,OAAO;AACL,cAAI;AAAA,QACN;AAEA,YAAIS,KAAI,OAAO;AACf,YAAIiB,KAAI,KAAK,KAAK,OAAOjB,MAAK,IAAI,KAAK,MAAM;AAC7C,YAAI,OAAO,WAAc,aAAcA,MAAMA;AAC7C,YAAI,cAAc;AAElB,aAAKiB;AACL,YAAI,KAAK,IAAI,GAAG,CAAC;AAGjB,YAAI,aAAa;AACf,mBAAS,IAAI,GAAG,IAAIA,IAAG,KAAK;AAC1B,wBAAY,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC;AAAA,UACrC;AACA,sBAAY,SAASA;AAAA,QACvB;AAEA,YAAIA,OAAM,GAAG;AAAA,QAEb,WAAW,KAAK,SAASA,IAAG;AAC1B,eAAK,UAAUA;AACf,eAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,iBAAK,MAAM,CAAC,IAAI,KAAK,MAAM,IAAIA,EAAC;AAAA,UAClC;AAAA,QACF,OAAO;AACL,eAAK,MAAM,CAAC,IAAI;AAChB,eAAK,SAAS;AAAA,QAChB;AAEA,YAAI,QAAQ;AACZ,aAAK,IAAI,KAAK,SAAS,GAAG,KAAK,MAAM,UAAU,KAAK,KAAK,IAAI,KAAK;AAChE,cAAI,OAAO,KAAK,MAAM,CAAC,IAAI;AAC3B,eAAK,MAAM,CAAC,IAAK,SAAU,KAAKjB,KAAO,SAASA;AAChD,kBAAQ,OAAO;AAAA,QACjB;AAGA,YAAI,eAAe,UAAU,GAAG;AAC9B,sBAAY,MAAM,YAAY,QAAQ,IAAI;AAAA,QAC5C;AAEA,YAAI,KAAK,WAAW,GAAG;AACrB,eAAK,MAAM,CAAC,IAAI;AAChB,eAAK,SAAS;AAAA,QAChB;AAEA,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAP,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM,MAAM,UAAU;AAEzD,QAAAF,QAAO,KAAK,aAAa,CAAC;AAC1B,eAAO,KAAK,OAAO,MAAM,MAAM,QAAQ;AAAA,MACzC;AAGA,MAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,MAAM;AACvC,eAAO,KAAK,MAAM,EAAE,MAAM,IAAI;AAAA,MAChC;AAEA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AACzC,eAAO,KAAK,MAAM,EAAE,OAAO,IAAI;AAAA,MACjC;AAGA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,MAAM;AACvC,eAAO,KAAK,MAAM,EAAE,MAAM,IAAI;AAAA,MAChC;AAEA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AACzC,eAAO,KAAK,MAAM,EAAE,OAAO,IAAI;AAAA,MACjC;AAGA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,QAAAF,QAAO,OAAO,QAAQ,YAAY,OAAO,CAAC;AAC1C,YAAIS,KAAI,MAAM;AACd,YAAIiB,MAAK,MAAMjB,MAAK;AACpB,YAAI,IAAI,KAAKA;AAGb,YAAI,KAAK,UAAUiB,GAAG,QAAO;AAG7B,YAAI,IAAI,KAAK,MAAMA,EAAC;AAEpB,eAAO,CAAC,EAAE,IAAI;AAAA,MAChB;AAGA,MAAAxB,IAAG,UAAU,SAAS,SAAS,OAAQ,MAAM;AAC3C,QAAAF,QAAO,OAAO,SAAS,YAAY,QAAQ,CAAC;AAC5C,YAAIS,KAAI,OAAO;AACf,YAAIiB,MAAK,OAAOjB,MAAK;AAErB,QAAAT,QAAO,KAAK,aAAa,GAAG,yCAAyC;AAErE,YAAI,KAAK,UAAU0B,IAAG;AACpB,iBAAO;AAAA,QACT;AAEA,YAAIjB,OAAM,GAAG;AACX,UAAAiB;AAAA,QACF;AACA,aAAK,SAAS,KAAK,IAAIA,IAAG,KAAK,MAAM;AAErC,YAAIjB,OAAM,GAAG;AACX,cAAI,OAAO,WAAc,aAAcA,MAAMA;AAC7C,eAAK,MAAM,KAAK,SAAS,CAAC,KAAK;AAAA,QACjC;AAEA,YAAI,KAAK,WAAW,GAAG;AACrB,eAAK,MAAM,CAAC,IAAI;AAChB,eAAK,SAAS;AAAA,QAChB;AAEA,eAAO,KAAK,MAAM;AAAA,MACpB;AAGA,MAAAP,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AACzC,eAAO,KAAK,MAAM,EAAE,OAAO,IAAI;AAAA,MACjC;AAGA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,QAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,QAAAA,QAAO,MAAM,QAAS;AACtB,YAAI,MAAM,EAAG,QAAO,KAAK,MAAM,CAAC,GAAG;AAGnC,YAAI,KAAK,aAAa,GAAG;AACvB,cAAI,KAAK,WAAW,MAAM,KAAK,MAAM,CAAC,IAAI,KAAK,KAAK;AAClD,iBAAK,MAAM,CAAC,IAAI,OAAO,KAAK,MAAM,CAAC,IAAI;AACvC,iBAAK,WAAW;AAChB,mBAAO;AAAA,UACT;AAEA,eAAK,WAAW;AAChB,eAAK,MAAM,GAAG;AACd,eAAK,WAAW;AAChB,iBAAO;AAAA,QACT;AAGA,eAAO,KAAK,OAAO,GAAG;AAAA,MACxB;AAEA,MAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,aAAK,MAAM,CAAC,KAAK;AAGjB,iBAAS,IAAI,GAAG,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,KAAK,UAAW,KAAK;AAClE,eAAK,MAAM,CAAC,KAAK;AACjB,cAAI,MAAM,KAAK,SAAS,GAAG;AACzB,iBAAK,MAAM,IAAI,CAAC,IAAI;AAAA,UACtB,OAAO;AACL,iBAAK,MAAM,IAAI,CAAC;AAAA,UAClB;AAAA,QACF;AACA,aAAK,SAAS,KAAK,IAAI,KAAK,QAAQ,IAAI,CAAC;AAEzC,eAAO;AAAA,MACT;AAGA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,QAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,QAAAA,QAAO,MAAM,QAAS;AACtB,YAAI,MAAM,EAAG,QAAO,KAAK,MAAM,CAAC,GAAG;AAEnC,YAAI,KAAK,aAAa,GAAG;AACvB,eAAK,WAAW;AAChB,eAAK,MAAM,GAAG;AACd,eAAK,WAAW;AAChB,iBAAO;AAAA,QACT;AAEA,aAAK,MAAM,CAAC,KAAK;AAEjB,YAAI,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,IAAI,GAAG;AAC1C,eAAK,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;AAC7B,eAAK,WAAW;AAAA,QAClB,OAAO;AAEL,mBAAS,IAAI,GAAG,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,IAAI,GAAG,KAAK;AACzD,iBAAK,MAAM,CAAC,KAAK;AACjB,iBAAK,MAAM,IAAI,CAAC,KAAK;AAAA,UACvB;AAAA,QACF;AAEA,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,eAAO,KAAK,MAAM,EAAE,MAAM,GAAG;AAAA,MAC/B;AAEA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,eAAO,KAAK,MAAM,EAAE,MAAM,GAAG;AAAA,MAC/B;AAEA,MAAAA,IAAG,UAAU,OAAO,SAAS,OAAQ;AACnC,aAAK,WAAW;AAEhB,eAAO;AAAA,MACT;AAEA,MAAAA,IAAG,UAAU,MAAM,SAAS0B,OAAO;AACjC,eAAO,KAAK,MAAM,EAAE,KAAK;AAAA,MAC3B;AAEA,MAAA1B,IAAG,UAAU,eAAe,SAAS,aAAc,KAAKQ,MAAK,OAAO;AAClE,YAAI,MAAM,IAAI,SAAS;AACvB,YAAI;AAEJ,aAAK,QAAQ,GAAG;AAEhB,YAAI;AACJ,YAAI,QAAQ;AACZ,aAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC/B,eAAK,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AAClC,cAAI,SAAS,IAAI,MAAM,CAAC,IAAI,KAAKA;AACjC,eAAK,QAAQ;AACb,mBAAS,KAAK,OAAQ,QAAQ,WAAa;AAC3C,eAAK,MAAM,IAAI,KAAK,IAAI,IAAI;AAAA,QAC9B;AACA,eAAO,IAAI,KAAK,SAAS,OAAO,KAAK;AACnC,eAAK,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AAClC,kBAAQ,KAAK;AACb,eAAK,MAAM,IAAI,KAAK,IAAI,IAAI;AAAA,QAC9B;AAEA,YAAI,UAAU,EAAG,QAAO,KAAK,MAAM;AAGnC,QAAAV,QAAO,UAAU,EAAE;AACnB,gBAAQ;AACR,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,cAAI,EAAE,KAAK,MAAM,CAAC,IAAI,KAAK;AAC3B,kBAAQ,KAAK;AACb,eAAK,MAAM,CAAC,IAAI,IAAI;AAAA,QACtB;AACA,aAAK,WAAW;AAEhB,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAE,IAAG,UAAU,WAAW,SAAS,SAAU,KAAK,MAAM;AACpD,YAAI,QAAQ,KAAK,SAAS,IAAI;AAE9B,YAAI,IAAI,KAAK,MAAM;AACnB,YAAI,IAAI;AAGR,YAAI,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI;AAClC,YAAI,UAAU,KAAK,WAAW,GAAG;AACjC,gBAAQ,KAAK;AACb,YAAI,UAAU,GAAG;AACf,cAAI,EAAE,MAAM,KAAK;AACjB,YAAE,OAAO,KAAK;AACd,gBAAM,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI;AAAA,QAChC;AAGA,YAAI,IAAI,EAAE,SAAS,EAAE;AACrB,YAAI;AAEJ,YAAI,SAAS,OAAO;AAClB,cAAI,IAAIA,IAAG,IAAI;AACf,YAAE,SAAS,IAAI;AACf,YAAE,QAAQ,IAAI,MAAM,EAAE,MAAM;AAC5B,mBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,cAAE,MAAM,CAAC,IAAI;AAAA,UACf;AAAA,QACF;AAEA,YAAI,OAAO,EAAE,MAAM,EAAE,aAAa,GAAG,GAAG,CAAC;AACzC,YAAI,KAAK,aAAa,GAAG;AACvB,cAAI;AACJ,cAAI,GAAG;AACL,cAAE,MAAM,CAAC,IAAI;AAAA,UACf;AAAA,QACF;AAEA,iBAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,cAAI,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI,KAAK,YACpC,EAAE,MAAM,EAAE,SAAS,IAAI,CAAC,IAAI;AAI/B,eAAK,KAAK,IAAK,KAAK,MAAO,GAAG,QAAS;AAEvC,YAAE,aAAa,GAAG,IAAI,CAAC;AACvB,iBAAO,EAAE,aAAa,GAAG;AACvB;AACA,cAAE,WAAW;AACb,cAAE,aAAa,GAAG,GAAG,CAAC;AACtB,gBAAI,CAAC,EAAE,OAAO,GAAG;AACf,gBAAE,YAAY;AAAA,YAChB;AAAA,UACF;AACA,cAAI,GAAG;AACL,cAAE,MAAM,CAAC,IAAI;AAAA,UACf;AAAA,QACF;AACA,YAAI,GAAG;AACL,YAAE,MAAM;AAAA,QACV;AACA,UAAE,MAAM;AAGR,YAAI,SAAS,SAAS,UAAU,GAAG;AACjC,YAAE,OAAO,KAAK;AAAA,QAChB;AAEA,eAAO;AAAA,UACL,KAAK,KAAK;AAAA,UACV,KAAK;AAAA,QACP;AAAA,MACF;AAMA,MAAAA,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK,MAAM,UAAU;AAC1D,QAAAF,QAAO,CAAC,IAAI,OAAO,CAAC;AAEpB,YAAI,KAAK,OAAO,GAAG;AACjB,iBAAO;AAAA,YACL,KAAK,IAAIE,IAAG,CAAC;AAAA,YACb,KAAK,IAAIA,IAAG,CAAC;AAAA,UACf;AAAA,QACF;AAEA,YAAI,KAAKS,MAAK;AACd,YAAI,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AAC7C,gBAAM,KAAK,IAAI,EAAE,OAAO,KAAK,IAAI;AAEjC,cAAI,SAAS,OAAO;AAClB,kBAAM,IAAI,IAAI,IAAI;AAAA,UACpB;AAEA,cAAI,SAAS,OAAO;AAClB,YAAAA,OAAM,IAAI,IAAI,IAAI;AAClB,gBAAI,YAAYA,KAAI,aAAa,GAAG;AAClC,cAAAA,KAAI,KAAK,GAAG;AAAA,YACd;AAAA,UACF;AAEA,iBAAO;AAAA,YACL;AAAA,YACA,KAAKA;AAAA,UACP;AAAA,QACF;AAEA,YAAI,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AAC7C,gBAAM,KAAK,OAAO,IAAI,IAAI,GAAG,IAAI;AAEjC,cAAI,SAAS,OAAO;AAClB,kBAAM,IAAI,IAAI,IAAI;AAAA,UACpB;AAEA,iBAAO;AAAA,YACL;AAAA,YACA,KAAK,IAAI;AAAA,UACX;AAAA,QACF;AAEA,aAAK,KAAK,WAAW,IAAI,cAAc,GAAG;AACxC,gBAAM,KAAK,IAAI,EAAE,OAAO,IAAI,IAAI,GAAG,IAAI;AAEvC,cAAI,SAAS,OAAO;AAClB,YAAAA,OAAM,IAAI,IAAI,IAAI;AAClB,gBAAI,YAAYA,KAAI,aAAa,GAAG;AAClC,cAAAA,KAAI,KAAK,GAAG;AAAA,YACd;AAAA,UACF;AAEA,iBAAO;AAAA,YACL,KAAK,IAAI;AAAA,YACT,KAAKA;AAAA,UACP;AAAA,QACF;AAKA,YAAI,IAAI,SAAS,KAAK,UAAU,KAAK,IAAI,GAAG,IAAI,GAAG;AACjD,iBAAO;AAAA,YACL,KAAK,IAAIT,IAAG,CAAC;AAAA,YACb,KAAK;AAAA,UACP;AAAA,QACF;AAGA,YAAI,IAAI,WAAW,GAAG;AACpB,cAAI,SAAS,OAAO;AAClB,mBAAO;AAAA,cACL,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,CAAC;AAAA,cAC3B,KAAK;AAAA,YACP;AAAA,UACF;AAEA,cAAI,SAAS,OAAO;AAClB,mBAAO;AAAA,cACL,KAAK;AAAA,cACL,KAAK,IAAIA,IAAG,KAAK,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC;AAAA,YACrC;AAAA,UACF;AAEA,iBAAO;AAAA,YACL,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,CAAC;AAAA,YAC3B,KAAK,IAAIA,IAAG,KAAK,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC;AAAA,UACrC;AAAA,QACF;AAEA,eAAO,KAAK,SAAS,KAAK,IAAI;AAAA,MAChC;AAGA,MAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,eAAO,KAAK,OAAO,KAAK,OAAO,KAAK,EAAE;AAAA,MACxC;AAGA,MAAAA,IAAG,UAAU,MAAM,SAASS,KAAK,KAAK;AACpC,eAAO,KAAK,OAAO,KAAK,OAAO,KAAK,EAAE;AAAA,MACxC;AAEA,MAAAT,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,eAAO,KAAK,OAAO,KAAK,OAAO,IAAI,EAAE;AAAA,MACvC;AAGA,MAAAA,IAAG,UAAU,WAAW,SAAS,SAAU,KAAK;AAC9C,YAAI,KAAK,KAAK,OAAO,GAAG;AAGxB,YAAI,GAAG,IAAI,OAAO,EAAG,QAAO,GAAG;AAE/B,YAAIS,OAAM,GAAG,IAAI,IAAI;AAErB,YAAI,OAAO,IAAI,IAAI,EAAE,OAAO,CAAC;AAC7B,YAAI,KAAK,IAAI,MAAM,CAAC,IAAI;AACxB,YAAI,MAAMA,KAAI,IAAI,IAAI;AAGtB,YAAI,MAAM,KAAK,OAAO,KAAK,QAAQ,EAAG,QAAO,GAAG;AAGhD,YAAI,KAAK,IAAIT,IAAG,CAAC;AACjB,WAAG,WAAW,KAAK,WAAW,IAAI;AAClC,eAAO,GAAG,IAAI,KAAK,EAAE;AAAA,MACvB;AAEA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,QAAAF,QAAO,OAAO,QAAS;AACvB,YAAI,KAAK,KAAK,MAAM;AAEpB,YAAI,MAAM;AACV,iBAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,iBAAO,IAAI,OAAO,KAAK,MAAM,CAAC,IAAI,MAAM;AAAA,QAC1C;AAEA,eAAO;AAAA,MACT;AAGA,MAAAE,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,QAAAF,QAAO,OAAO,QAAS;AAEvB,YAAI,QAAQ;AACZ,iBAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,cAAI,KAAK,KAAK,MAAM,CAAC,IAAI,KAAK,QAAQ;AACtC,eAAK,MAAM,CAAC,IAAK,IAAI,MAAO;AAC5B,kBAAQ,IAAI;AAAA,QACd;AAEA,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,eAAO,KAAK,MAAM,EAAE,MAAM,GAAG;AAAA,MAC/B;AAEA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,GAAG;AACpC,QAAAF,QAAO,EAAE,aAAa,CAAC;AACvB,QAAAA,QAAO,CAAC,EAAE,OAAO,CAAC;AAElB,YAAI,IAAI;AACR,YAAI,IAAI,EAAE,MAAM;AAEhB,YAAI,EAAE,aAAa,GAAG;AACpB,cAAI,EAAE,KAAK,CAAC;AAAA,QACd,OAAO;AACL,cAAI,EAAE,MAAM;AAAA,QACd;AAGA,YAAI,IAAI,IAAIE,IAAG,CAAC;AAChB,YAAI,IAAI,IAAIA,IAAG,CAAC;AAGhB,YAAI,IAAI,IAAIA,IAAG,CAAC;AAChB,YAAI,IAAI,IAAIA,IAAG,CAAC;AAEhB,YAAI,IAAI;AAER,eAAO,EAAE,OAAO,KAAK,EAAE,OAAO,GAAG;AAC/B,YAAE,OAAO,CAAC;AACV,YAAE,OAAO,CAAC;AACV,YAAE;AAAA,QACJ;AAEA,YAAI,KAAK,EAAE,MAAM;AACjB,YAAI,KAAK,EAAE,MAAM;AAEjB,eAAO,CAAC,EAAE,OAAO,GAAG;AAClB,mBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,cAAI,IAAI,GAAG;AACT,cAAE,OAAO,CAAC;AACV,mBAAO,MAAM,GAAG;AACd,kBAAI,EAAE,MAAM,KAAK,EAAE,MAAM,GAAG;AAC1B,kBAAE,KAAK,EAAE;AACT,kBAAE,KAAK,EAAE;AAAA,cACX;AAEA,gBAAE,OAAO,CAAC;AACV,gBAAE,OAAO,CAAC;AAAA,YACZ;AAAA,UACF;AAEA,mBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,cAAI,IAAI,GAAG;AACT,cAAE,OAAO,CAAC;AACV,mBAAO,MAAM,GAAG;AACd,kBAAI,EAAE,MAAM,KAAK,EAAE,MAAM,GAAG;AAC1B,kBAAE,KAAK,EAAE;AACT,kBAAE,KAAK,EAAE;AAAA,cACX;AAEA,gBAAE,OAAO,CAAC;AACV,gBAAE,OAAO,CAAC;AAAA,YACZ;AAAA,UACF;AAEA,cAAI,EAAE,IAAI,CAAC,KAAK,GAAG;AACjB,cAAE,KAAK,CAAC;AACR,cAAE,KAAK,CAAC;AACR,cAAE,KAAK,CAAC;AAAA,UACV,OAAO;AACL,cAAE,KAAK,CAAC;AACR,cAAE,KAAK,CAAC;AACR,cAAE,KAAK,CAAC;AAAA,UACV;AAAA,QACF;AAEA,eAAO;AAAA,UACL,GAAG;AAAA,UACH,GAAG;AAAA,UACH,KAAK,EAAE,OAAO,CAAC;AAAA,QACjB;AAAA,MACF;AAKA,MAAAA,IAAG,UAAU,SAAS,SAAS,OAAQ,GAAG;AACxC,QAAAF,QAAO,EAAE,aAAa,CAAC;AACvB,QAAAA,QAAO,CAAC,EAAE,OAAO,CAAC;AAElB,YAAI,IAAI;AACR,YAAI,IAAI,EAAE,MAAM;AAEhB,YAAI,EAAE,aAAa,GAAG;AACpB,cAAI,EAAE,KAAK,CAAC;AAAA,QACd,OAAO;AACL,cAAI,EAAE,MAAM;AAAA,QACd;AAEA,YAAI,KAAK,IAAIE,IAAG,CAAC;AACjB,YAAI,KAAK,IAAIA,IAAG,CAAC;AAEjB,YAAI,QAAQ,EAAE,MAAM;AAEpB,eAAO,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG;AACrC,mBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,cAAI,IAAI,GAAG;AACT,cAAE,OAAO,CAAC;AACV,mBAAO,MAAM,GAAG;AACd,kBAAI,GAAG,MAAM,GAAG;AACd,mBAAG,KAAK,KAAK;AAAA,cACf;AAEA,iBAAG,OAAO,CAAC;AAAA,YACb;AAAA,UACF;AAEA,mBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,cAAI,IAAI,GAAG;AACT,cAAE,OAAO,CAAC;AACV,mBAAO,MAAM,GAAG;AACd,kBAAI,GAAG,MAAM,GAAG;AACd,mBAAG,KAAK,KAAK;AAAA,cACf;AAEA,iBAAG,OAAO,CAAC;AAAA,YACb;AAAA,UACF;AAEA,cAAI,EAAE,IAAI,CAAC,KAAK,GAAG;AACjB,cAAE,KAAK,CAAC;AACR,eAAG,KAAK,EAAE;AAAA,UACZ,OAAO;AACL,cAAE,KAAK,CAAC;AACR,eAAG,KAAK,EAAE;AAAA,UACZ;AAAA,QACF;AAEA,YAAI;AACJ,YAAI,EAAE,KAAK,CAAC,MAAM,GAAG;AACnB,gBAAM;AAAA,QACR,OAAO;AACL,gBAAM;AAAA,QACR;AAEA,YAAI,IAAI,KAAK,CAAC,IAAI,GAAG;AACnB,cAAI,KAAK,CAAC;AAAA,QACZ;AAEA,eAAO;AAAA,MACT;AAEA,MAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,YAAI,KAAK,OAAO,EAAG,QAAO,IAAI,IAAI;AAClC,YAAI,IAAI,OAAO,EAAG,QAAO,KAAK,IAAI;AAElC,YAAI,IAAI,KAAK,MAAM;AACnB,YAAI,IAAI,IAAI,MAAM;AAClB,UAAE,WAAW;AACb,UAAE,WAAW;AAGb,iBAAS,QAAQ,GAAG,EAAE,OAAO,KAAK,EAAE,OAAO,GAAG,SAAS;AACrD,YAAE,OAAO,CAAC;AACV,YAAE,OAAO,CAAC;AAAA,QACZ;AAEA,WAAG;AACD,iBAAO,EAAE,OAAO,GAAG;AACjB,cAAE,OAAO,CAAC;AAAA,UACZ;AACA,iBAAO,EAAE,OAAO,GAAG;AACjB,cAAE,OAAO,CAAC;AAAA,UACZ;AAEA,cAAIO,KAAI,EAAE,IAAI,CAAC;AACf,cAAIA,KAAI,GAAG;AAET,gBAAI,IAAI;AACR,gBAAI;AACJ,gBAAI;AAAA,UACN,WAAWA,OAAM,KAAK,EAAE,KAAK,CAAC,MAAM,GAAG;AACrC;AAAA,UACF;AAEA,YAAE,KAAK,CAAC;AAAA,QACV,SAAS;AAET,eAAO,EAAE,OAAO,KAAK;AAAA,MACvB;AAGA,MAAAP,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,eAAO,KAAK,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG;AAAA,MAClC;AAEA,MAAAA,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,gBAAQ,KAAK,MAAM,CAAC,IAAI,OAAO;AAAA,MACjC;AAEA,MAAAA,IAAG,UAAU,QAAQ,SAAS,QAAS;AACrC,gBAAQ,KAAK,MAAM,CAAC,IAAI,OAAO;AAAA,MACjC;AAGA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,eAAO,KAAK,MAAM,CAAC,IAAI;AAAA,MACzB;AAGA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,QAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,YAAIS,KAAI,MAAM;AACd,YAAIiB,MAAK,MAAMjB,MAAK;AACpB,YAAI,IAAI,KAAKA;AAGb,YAAI,KAAK,UAAUiB,IAAG;AACpB,eAAK,QAAQA,KAAI,CAAC;AAClB,eAAK,MAAMA,EAAC,KAAK;AACjB,iBAAO;AAAA,QACT;AAGA,YAAI,QAAQ;AACZ,iBAAS,IAAIA,IAAG,UAAU,KAAK,IAAI,KAAK,QAAQ,KAAK;AACnD,cAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AACxB,eAAK;AACL,kBAAQ,MAAM;AACd,eAAK;AACL,eAAK,MAAM,CAAC,IAAI;AAAA,QAClB;AACA,YAAI,UAAU,GAAG;AACf,eAAK,MAAM,CAAC,IAAI;AAChB,eAAK;AAAA,QACP;AACA,eAAO;AAAA,MACT;AAEA,MAAAxB,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,eAAO,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,MAAM;AAAA,MAChD;AAEA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,YAAI,WAAW,MAAM;AAErB,YAAI,KAAK,aAAa,KAAK,CAAC,SAAU,QAAO;AAC7C,YAAI,KAAK,aAAa,KAAK,SAAU,QAAO;AAE5C,aAAK,MAAM;AAEX,YAAI;AACJ,YAAI,KAAK,SAAS,GAAG;AACnB,gBAAM;AAAA,QACR,OAAO;AACL,cAAI,UAAU;AACZ,kBAAM,CAAC;AAAA,UACT;AAEA,UAAAF,QAAO,OAAO,UAAW,mBAAmB;AAE5C,cAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AACxB,gBAAM,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK;AAAA,QACvC;AACA,YAAI,KAAK,aAAa,EAAG,QAAO,CAAC,MAAM;AACvC,eAAO;AAAA,MACT;AAMA,MAAAE,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,YAAI,KAAK,aAAa,KAAK,IAAI,aAAa,EAAG,QAAO;AACtD,YAAI,KAAK,aAAa,KAAK,IAAI,aAAa,EAAG,QAAO;AAEtD,YAAI,MAAM,KAAK,KAAK,GAAG;AACvB,YAAI,KAAK,aAAa,EAAG,QAAO,CAAC,MAAM;AACvC,eAAO;AAAA,MACT;AAGA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AAEtC,YAAI,KAAK,SAAS,IAAI,OAAQ,QAAO;AACrC,YAAI,KAAK,SAAS,IAAI,OAAQ,QAAO;AAErC,YAAI,MAAM;AACV,iBAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,cAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AACxB,cAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AAEvB,cAAI,MAAM,EAAG;AACb,cAAI,IAAI,GAAG;AACT,kBAAM;AAAA,UACR,WAAW,IAAI,GAAG;AAChB,kBAAM;AAAA,UACR;AACA;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAEA,MAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,eAAO,KAAK,KAAK,GAAG,MAAM;AAAA,MAC5B;AAEA,MAAAA,IAAG,UAAU,KAAK,SAAS,GAAI,KAAK;AAClC,eAAO,KAAK,IAAI,GAAG,MAAM;AAAA,MAC3B;AAEA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,eAAO,KAAK,KAAK,GAAG,KAAK;AAAA,MAC3B;AAEA,MAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,eAAO,KAAK,IAAI,GAAG,KAAK;AAAA,MAC1B;AAEA,MAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,eAAO,KAAK,KAAK,GAAG,MAAM;AAAA,MAC5B;AAEA,MAAAA,IAAG,UAAU,KAAK,SAAS,GAAI,KAAK;AAClC,eAAO,KAAK,IAAI,GAAG,MAAM;AAAA,MAC3B;AAEA,MAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,eAAO,KAAK,KAAK,GAAG,KAAK;AAAA,MAC3B;AAEA,MAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,eAAO,KAAK,IAAI,GAAG,KAAK;AAAA,MAC1B;AAEA,MAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,eAAO,KAAK,KAAK,GAAG,MAAM;AAAA,MAC5B;AAEA,MAAAA,IAAG,UAAU,KAAK,SAAS2B,IAAI,KAAK;AAClC,eAAO,KAAK,IAAI,GAAG,MAAM;AAAA,MAC3B;AAMA,MAAA3B,IAAG,MAAM,SAAS,IAAK,KAAK;AAC1B,eAAO,IAAI,IAAI,GAAG;AAAA,MACpB;AAEA,MAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,QAAAF,QAAO,CAAC,KAAK,KAAK,uCAAuC;AACzD,QAAAA,QAAO,KAAK,aAAa,GAAG,+BAA+B;AAC3D,eAAO,IAAI,UAAU,IAAI,EAAE,UAAU,GAAG;AAAA,MAC1C;AAEA,MAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,QAAAF,QAAO,KAAK,KAAK,sDAAsD;AACvE,eAAO,KAAK,IAAI,YAAY,IAAI;AAAA,MAClC;AAEA,MAAAE,IAAG,UAAU,YAAY,SAAS,UAAW,KAAK;AAChD,aAAK,MAAM;AACX,eAAO;AAAA,MACT;AAEA,MAAAA,IAAG,UAAU,WAAW,SAAS,SAAU,KAAK;AAC9C,QAAAF,QAAO,CAAC,KAAK,KAAK,uCAAuC;AACzD,eAAO,KAAK,UAAU,GAAG;AAAA,MAC3B;AAEA,MAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,QAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,eAAO,KAAK,IAAI,IAAI,MAAM,GAAG;AAAA,MAC/B;AAEA,MAAAE,IAAG,UAAU,UAAU,SAAS,QAAS,KAAK;AAC5C,QAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,eAAO,KAAK,IAAI,KAAK,MAAM,GAAG;AAAA,MAChC;AAEA,MAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,QAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,eAAO,KAAK,IAAI,IAAI,MAAM,GAAG;AAAA,MAC/B;AAEA,MAAAE,IAAG,UAAU,UAAU,SAAS,QAAS,KAAK;AAC5C,QAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,eAAO,KAAK,IAAI,KAAK,MAAM,GAAG;AAAA,MAChC;AAEA,MAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,QAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,eAAO,KAAK,IAAI,IAAI,MAAM,GAAG;AAAA,MAC/B;AAEA,MAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,QAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,aAAK,IAAI,SAAS,MAAM,GAAG;AAC3B,eAAO,KAAK,IAAI,IAAI,MAAM,GAAG;AAAA,MAC/B;AAEA,MAAAE,IAAG,UAAU,UAAU,SAAS,QAAS,KAAK;AAC5C,QAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,aAAK,IAAI,SAAS,MAAM,GAAG;AAC3B,eAAO,KAAK,IAAI,KAAK,MAAM,GAAG;AAAA,MAChC;AAEA,MAAAE,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,QAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,aAAK,IAAI,SAAS,IAAI;AACtB,eAAO,KAAK,IAAI,IAAI,IAAI;AAAA,MAC1B;AAEA,MAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,QAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,aAAK,IAAI,SAAS,IAAI;AACtB,eAAO,KAAK,IAAI,KAAK,IAAI;AAAA,MAC3B;AAGA,MAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,QAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,aAAK,IAAI,SAAS,IAAI;AACtB,eAAO,KAAK,IAAI,KAAK,IAAI;AAAA,MAC3B;AAEA,MAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,QAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,aAAK,IAAI,SAAS,IAAI;AACtB,eAAO,KAAK,IAAI,KAAK,IAAI;AAAA,MAC3B;AAGA,MAAAE,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,QAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,aAAK,IAAI,SAAS,IAAI;AACtB,eAAO,KAAK,IAAI,IAAI,IAAI;AAAA,MAC1B;AAEA,MAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,QAAAF,QAAO,KAAK,OAAO,CAAC,IAAI,KAAK,mBAAmB;AAChD,aAAK,IAAI,SAAS,IAAI;AACtB,eAAO,KAAK,IAAI,IAAI,MAAM,GAAG;AAAA,MAC/B;AAGA,UAAI,SAAS;AAAA,QACX,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ;AAAA,MACV;AAGA,eAAS,OAAQ8B,OAAM,GAAG;AAExB,aAAK,OAAOA;AACZ,aAAK,IAAI,IAAI5B,IAAG,GAAG,EAAE;AACrB,aAAK,IAAI,KAAK,EAAE,UAAU;AAC1B,aAAK,IAAI,IAAIA,IAAG,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC;AAE7C,aAAK,MAAM,KAAK,KAAK;AAAA,MACvB;AAEA,aAAO,UAAU,OAAO,SAAS,OAAQ;AACvC,YAAI,MAAM,IAAIA,IAAG,IAAI;AACrB,YAAI,QAAQ,IAAI,MAAM,KAAK,KAAK,KAAK,IAAI,EAAE,CAAC;AAC5C,eAAO;AAAA,MACT;AAEA,aAAO,UAAU,UAAU,SAAS,QAAS,KAAK;AAGhD,YAAIO,KAAI;AACR,YAAI;AAEJ,WAAG;AACD,eAAK,MAAMA,IAAG,KAAK,GAAG;AACtB,UAAAA,KAAI,KAAK,MAAMA,EAAC;AAChB,UAAAA,KAAIA,GAAE,KAAK,KAAK,GAAG;AACnB,iBAAOA,GAAE,UAAU;AAAA,QACrB,SAAS,OAAO,KAAK;AAErB,YAAI,MAAM,OAAO,KAAK,IAAI,KAAKA,GAAE,KAAK,KAAK,CAAC;AAC5C,YAAI,QAAQ,GAAG;AACb,UAAAA,GAAE,MAAM,CAAC,IAAI;AACb,UAAAA,GAAE,SAAS;AAAA,QACb,WAAW,MAAM,GAAG;AAClB,UAAAA,GAAE,KAAK,KAAK,CAAC;AAAA,QACf,OAAO;AACL,cAAIA,GAAE,UAAU,QAAW;AAEzB,YAAAA,GAAE,MAAM;AAAA,UACV,OAAO;AAEL,YAAAA,GAAE,OAAO;AAAA,UACX;AAAA,QACF;AAEA,eAAOA;AAAA,MACT;AAEA,aAAO,UAAU,QAAQ,SAAS,MAAO,OAAO,KAAK;AACnD,cAAM,OAAO,KAAK,GAAG,GAAG,GAAG;AAAA,MAC7B;AAEA,aAAO,UAAU,QAAQ,SAAS,MAAO,KAAK;AAC5C,eAAO,IAAI,KAAK,KAAK,CAAC;AAAA,MACxB;AAEA,eAAS,OAAQ;AACf,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,QAAyE;AAAA,MAC7E;AACA,MAAAR,UAAS,MAAM,MAAM;AAErB,WAAK,UAAU,QAAQ,SAAS,MAAO,OAAO,QAAQ;AAEpD,YAAI,OAAO;AAEX,YAAI,SAAS,KAAK,IAAI,MAAM,QAAQ,CAAC;AACrC,iBAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,iBAAO,MAAM,CAAC,IAAI,MAAM,MAAM,CAAC;AAAA,QACjC;AACA,eAAO,SAAS;AAEhB,YAAI,MAAM,UAAU,GAAG;AACrB,gBAAM,MAAM,CAAC,IAAI;AACjB,gBAAM,SAAS;AACf;AAAA,QACF;AAGA,YAAI,OAAO,MAAM,MAAM,CAAC;AACxB,eAAO,MAAM,OAAO,QAAQ,IAAI,OAAO;AAEvC,aAAK,IAAI,IAAI,IAAI,MAAM,QAAQ,KAAK;AAClC,cAAI,OAAO,MAAM,MAAM,CAAC,IAAI;AAC5B,gBAAM,MAAM,IAAI,EAAE,KAAM,OAAO,SAAS,IAAM,SAAS;AACvD,iBAAO;AAAA,QACT;AACA,kBAAU;AACV,cAAM,MAAM,IAAI,EAAE,IAAI;AACtB,YAAI,SAAS,KAAK,MAAM,SAAS,IAAI;AACnC,gBAAM,UAAU;AAAA,QAClB,OAAO;AACL,gBAAM,UAAU;AAAA,QAClB;AAAA,MACF;AAEA,WAAK,UAAU,QAAQ,SAAS,MAAO,KAAK;AAE1C,YAAI,MAAM,IAAI,MAAM,IAAI;AACxB,YAAI,MAAM,IAAI,SAAS,CAAC,IAAI;AAC5B,YAAI,UAAU;AAGd,YAAI,KAAK;AACT,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,cAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AACvB,gBAAM,IAAI;AACV,cAAI,MAAM,CAAC,IAAI,KAAK;AACpB,eAAK,IAAI,MAAS,KAAK,WAAa;AAAA,QACtC;AAGA,YAAI,IAAI,MAAM,IAAI,SAAS,CAAC,MAAM,GAAG;AACnC,cAAI;AACJ,cAAI,IAAI,MAAM,IAAI,SAAS,CAAC,MAAM,GAAG;AACnC,gBAAI;AAAA,UACN;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAEA,eAAS,OAAQ;AACf,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,QAAgE;AAAA,MACpE;AACA,MAAAA,UAAS,MAAM,MAAM;AAErB,eAAS,OAAQ;AACf,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,QAAuD;AAAA,MAC3D;AACA,MAAAA,UAAS,MAAM,MAAM;AAErB,eAAS,SAAU;AAEjB,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,QAAqE;AAAA,MACzE;AACA,MAAAA,UAAS,QAAQ,MAAM;AAEvB,aAAO,UAAU,QAAQ,SAAS,MAAO,KAAK;AAE5C,YAAI,QAAQ;AACZ,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,cAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,KAAO;AACrC,cAAI,KAAK,KAAK;AACd,kBAAQ;AAER,cAAI,MAAM,CAAC,IAAI;AACf,kBAAQ;AAAA,QACV;AACA,YAAI,UAAU,GAAG;AACf,cAAI,MAAM,IAAI,QAAQ,IAAI;AAAA,QAC5B;AACA,eAAO;AAAA,MACT;AAGA,MAAAC,IAAG,SAAS,SAAS,MAAO4B,OAAM;AAEhC,YAAI,OAAOA,KAAI,EAAG,QAAO,OAAOA,KAAI;AAEpC,YAAIC;AACJ,YAAID,UAAS,QAAQ;AACnB,UAAAC,SAAQ,IAAI,KAAK;AAAA,QACnB,WAAWD,UAAS,QAAQ;AAC1B,UAAAC,SAAQ,IAAI,KAAK;AAAA,QACnB,WAAWD,UAAS,QAAQ;AAC1B,UAAAC,SAAQ,IAAI,KAAK;AAAA,QACnB,WAAWD,UAAS,UAAU;AAC5B,UAAAC,SAAQ,IAAI,OAAO;AAAA,QACrB,OAAO;AACL,gBAAM,IAAI,MAAM,mBAAmBD,KAAI;AAAA,QACzC;AACA,eAAOA,KAAI,IAAIC;AAEf,eAAOA;AAAA,MACT;AAKA,eAAS,IAAK,GAAG;AACf,YAAI,OAAO,MAAM,UAAU;AACzB,cAAI,QAAQ7B,IAAG,OAAO,CAAC;AACvB,eAAK,IAAI,MAAM;AACf,eAAK,QAAQ;AAAA,QACf,OAAO;AACL,UAAAF,QAAO,EAAE,IAAI,CAAC,GAAG,gCAAgC;AACjD,eAAK,IAAI;AACT,eAAK,QAAQ;AAAA,QACf;AAAA,MACF;AAEA,UAAI,UAAU,WAAW,SAAS,SAAU,GAAG;AAC7C,QAAAA,QAAO,EAAE,aAAa,GAAG,+BAA+B;AACxD,QAAAA,QAAO,EAAE,KAAK,iCAAiC;AAAA,MACjD;AAEA,UAAI,UAAU,WAAW,SAAS,SAAU,GAAG,GAAG;AAChD,QAAAA,SAAQ,EAAE,WAAW,EAAE,cAAc,GAAG,+BAA+B;AACvE,QAAAA;AAAA,UAAO,EAAE,OAAO,EAAE,QAAQ,EAAE;AAAA,UAC1B;AAAA,QAAiC;AAAA,MACrC;AAEA,UAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,YAAI,KAAK,MAAO,QAAO,KAAK,MAAM,QAAQ,CAAC,EAAE,UAAU,IAAI;AAC3D,eAAO,EAAE,KAAK,KAAK,CAAC,EAAE,UAAU,IAAI;AAAA,MACtC;AAEA,UAAI,UAAU,MAAM,SAASoB,KAAK,GAAG;AACnC,YAAI,EAAE,OAAO,GAAG;AACd,iBAAO,EAAE,MAAM;AAAA,QACjB;AAEA,eAAO,KAAK,EAAE,IAAI,CAAC,EAAE,UAAU,IAAI;AAAA,MACrC;AAEA,UAAI,UAAU,MAAM,SAASE,KAAK,GAAG,GAAG;AACtC,aAAK,SAAS,GAAG,CAAC;AAElB,YAAI,MAAM,EAAE,IAAI,CAAC;AACjB,YAAI,IAAI,IAAI,KAAK,CAAC,KAAK,GAAG;AACxB,cAAI,KAAK,KAAK,CAAC;AAAA,QACjB;AACA,eAAO,IAAI,UAAU,IAAI;AAAA,MAC3B;AAEA,UAAI,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACxC,aAAK,SAAS,GAAG,CAAC;AAElB,YAAI,MAAM,EAAE,KAAK,CAAC;AAClB,YAAI,IAAI,IAAI,KAAK,CAAC,KAAK,GAAG;AACxB,cAAI,KAAK,KAAK,CAAC;AAAA,QACjB;AACA,eAAO;AAAA,MACT;AAEA,UAAI,UAAU,MAAM,SAAS,IAAK,GAAG,GAAG;AACtC,aAAK,SAAS,GAAG,CAAC;AAElB,YAAI,MAAM,EAAE,IAAI,CAAC;AACjB,YAAI,IAAI,KAAK,CAAC,IAAI,GAAG;AACnB,cAAI,KAAK,KAAK,CAAC;AAAA,QACjB;AACA,eAAO,IAAI,UAAU,IAAI;AAAA,MAC3B;AAEA,UAAI,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACxC,aAAK,SAAS,GAAG,CAAC;AAElB,YAAI,MAAM,EAAE,KAAK,CAAC;AAClB,YAAI,IAAI,KAAK,CAAC,IAAI,GAAG;AACnB,cAAI,KAAK,KAAK,CAAC;AAAA,QACjB;AACA,eAAO;AAAA,MACT;AAEA,UAAI,UAAU,MAAM,SAAS,IAAK,GAAG,KAAK;AACxC,aAAK,SAAS,CAAC;AACf,eAAO,KAAK,KAAK,EAAE,MAAM,GAAG,CAAC;AAAA,MAC/B;AAEA,UAAI,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACxC,aAAK,SAAS,GAAG,CAAC;AAClB,eAAO,KAAK,KAAK,EAAE,KAAK,CAAC,CAAC;AAAA,MAC5B;AAEA,UAAI,UAAU,MAAM,SAASZ,KAAK,GAAG,GAAG;AACtC,aAAK,SAAS,GAAG,CAAC;AAClB,eAAO,KAAK,KAAK,EAAE,IAAI,CAAC,CAAC;AAAA,MAC3B;AAEA,UAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,eAAO,KAAK,KAAK,GAAG,EAAE,MAAM,CAAC;AAAA,MAC/B;AAEA,UAAI,UAAU,MAAM,SAAS,IAAK,GAAG;AACnC,eAAO,KAAK,IAAI,GAAG,CAAC;AAAA,MACtB;AAEA,UAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,YAAI,EAAE,OAAO,EAAG,QAAO,EAAE,MAAM;AAE/B,YAAI,OAAO,KAAK,EAAE,MAAM,CAAC;AACzB,QAAAV,QAAO,OAAO,MAAM,CAAC;AAGrB,YAAI,SAAS,GAAG;AACd,cAAIY,OAAM,KAAK,EAAE,IAAI,IAAIV,IAAG,CAAC,CAAC,EAAE,OAAO,CAAC;AACxC,iBAAO,KAAK,IAAI,GAAGU,IAAG;AAAA,QACxB;AAKA,YAAI,IAAI,KAAK,EAAE,KAAK,CAAC;AACrB,YAAIc,KAAI;AACR,eAAO,CAAC,EAAE,OAAO,KAAK,EAAE,MAAM,CAAC,MAAM,GAAG;AACtC,UAAAA;AACA,YAAE,OAAO,CAAC;AAAA,QACZ;AACA,QAAA1B,QAAO,CAAC,EAAE,OAAO,CAAC;AAElB,YAAI,MAAM,IAAIE,IAAG,CAAC,EAAE,MAAM,IAAI;AAC9B,YAAI,OAAO,IAAI,OAAO;AAItB,YAAI,OAAO,KAAK,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC;AAClC,YAAI,IAAI,KAAK,EAAE,UAAU;AACzB,YAAI,IAAIA,IAAG,IAAI,IAAI,CAAC,EAAE,MAAM,IAAI;AAEhC,eAAO,KAAK,IAAI,GAAG,IAAI,EAAE,IAAI,IAAI,MAAM,GAAG;AACxC,YAAE,QAAQ,IAAI;AAAA,QAChB;AAEA,YAAI,IAAI,KAAK,IAAI,GAAG,CAAC;AACrB,YAAIO,KAAI,KAAK,IAAI,GAAG,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;AACvC,YAAI,IAAI,KAAK,IAAI,GAAG,CAAC;AACrB,YAAI,IAAIiB;AACR,eAAO,EAAE,IAAI,GAAG,MAAM,GAAG;AACvB,cAAI,MAAM;AACV,mBAAS,IAAI,GAAG,IAAI,IAAI,GAAG,MAAM,GAAG,KAAK;AACvC,kBAAM,IAAI,OAAO;AAAA,UACnB;AACA,UAAA1B,QAAO,IAAI,CAAC;AACZ,cAAI,IAAI,KAAK,IAAI,GAAG,IAAIE,IAAG,CAAC,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC;AAE/C,UAAAO,KAAIA,GAAE,OAAO,CAAC;AACd,cAAI,EAAE,OAAO;AACb,cAAI,EAAE,OAAO,CAAC;AACd,cAAI;AAAA,QACN;AAEA,eAAOA;AAAA,MACT;AAEA,UAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,YAAI,MAAM,EAAE,OAAO,KAAK,CAAC;AACzB,YAAI,IAAI,aAAa,GAAG;AACtB,cAAI,WAAW;AACf,iBAAO,KAAK,KAAK,GAAG,EAAE,OAAO;AAAA,QAC/B,OAAO;AACL,iBAAO,KAAK,KAAK,GAAG;AAAA,QACtB;AAAA,MACF;AAEA,UAAI,UAAU,MAAM,SAASG,KAAK,GAAG,KAAK;AACxC,YAAI,IAAI,OAAO,EAAG,QAAO,IAAIV,IAAG,CAAC,EAAE,MAAM,IAAI;AAC7C,YAAI,IAAI,KAAK,CAAC,MAAM,EAAG,QAAO,EAAE,MAAM;AAEtC,YAAI,aAAa;AACjB,YAAI,MAAM,IAAI,MAAM,KAAK,UAAU;AACnC,YAAI,CAAC,IAAI,IAAIA,IAAG,CAAC,EAAE,MAAM,IAAI;AAC7B,YAAI,CAAC,IAAI;AACT,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,cAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC;AAAA,QACjC;AAEA,YAAI,MAAM,IAAI,CAAC;AACf,YAAI,UAAU;AACd,YAAI,aAAa;AACjB,YAAI,QAAQ,IAAI,UAAU,IAAI;AAC9B,YAAI,UAAU,GAAG;AACf,kBAAQ;AAAA,QACV;AAEA,aAAK,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACpC,cAAI,OAAO,IAAI,MAAM,CAAC;AACtB,mBAAS,IAAI,QAAQ,GAAG,KAAK,GAAG,KAAK;AACnC,gBAAI,MAAO,QAAQ,IAAK;AACxB,gBAAI,QAAQ,IAAI,CAAC,GAAG;AAClB,oBAAM,KAAK,IAAI,GAAG;AAAA,YACpB;AAEA,gBAAI,QAAQ,KAAK,YAAY,GAAG;AAC9B,2BAAa;AACb;AAAA,YACF;AAEA,wBAAY;AACZ,uBAAW;AACX;AACA,gBAAI,eAAe,eAAe,MAAM,KAAK,MAAM,GAAI;AAEvD,kBAAM,KAAK,IAAI,KAAK,IAAI,OAAO,CAAC;AAChC,yBAAa;AACb,sBAAU;AAAA,UACZ;AACA,kBAAQ;AAAA,QACV;AAEA,eAAO;AAAA,MACT;AAEA,UAAI,UAAU,YAAY,SAAS,UAAW,KAAK;AACjD,YAAIO,KAAI,IAAI,KAAK,KAAK,CAAC;AAEvB,eAAOA,OAAM,MAAMA,GAAE,MAAM,IAAIA;AAAA,MACjC;AAEA,UAAI,UAAU,cAAc,SAAS,YAAa,KAAK;AACrD,YAAI,MAAM,IAAI,MAAM;AACpB,YAAI,MAAM;AACV,eAAO;AAAA,MACT;AAMA,MAAAP,IAAG,OAAO,SAAS8B,MAAM,KAAK;AAC5B,eAAO,IAAI,KAAK,GAAG;AAAA,MACrB;AAEA,eAAS,KAAM,GAAG;AAChB,YAAI,KAAK,MAAM,CAAC;AAEhB,aAAK,QAAQ,KAAK,EAAE,UAAU;AAC9B,YAAI,KAAK,QAAQ,OAAO,GAAG;AACzB,eAAK,SAAS,KAAM,KAAK,QAAQ;AAAA,QACnC;AAEA,aAAK,IAAI,IAAI9B,IAAG,CAAC,EAAE,OAAO,KAAK,KAAK;AACpC,aAAK,KAAK,KAAK,KAAK,KAAK,EAAE,IAAI,CAAC;AAChC,aAAK,OAAO,KAAK,EAAE,OAAO,KAAK,CAAC;AAEhC,aAAK,OAAO,KAAK,KAAK,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,KAAK,CAAC;AACrD,aAAK,OAAO,KAAK,KAAK,KAAK,KAAK,CAAC;AACjC,aAAK,OAAO,KAAK,EAAE,IAAI,KAAK,IAAI;AAAA,MAClC;AACA,MAAAD,UAAS,MAAM,GAAG;AAElB,WAAK,UAAU,YAAY,SAAS,UAAW,KAAK;AAClD,eAAO,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,CAAC;AAAA,MACxC;AAEA,WAAK,UAAU,cAAc,SAAS,YAAa,KAAK;AACtD,YAAIQ,KAAI,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC;AACpC,QAAAA,GAAE,MAAM;AACR,eAAOA;AAAA,MACT;AAEA,WAAK,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACzC,YAAI,EAAE,OAAO,KAAK,EAAE,OAAO,GAAG;AAC5B,YAAE,MAAM,CAAC,IAAI;AACb,YAAE,SAAS;AACX,iBAAO;AAAA,QACT;AAEA,YAAI,IAAI,EAAE,KAAK,CAAC;AAChB,YAAI,IAAI,EAAE,MAAM,KAAK,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,OAAO,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC;AACxE,YAAI,IAAI,EAAE,KAAK,CAAC,EAAE,OAAO,KAAK,KAAK;AACnC,YAAI,MAAM;AAEV,YAAI,EAAE,IAAI,KAAK,CAAC,KAAK,GAAG;AACtB,gBAAM,EAAE,KAAK,KAAK,CAAC;AAAA,QACrB,WAAW,EAAE,KAAK,CAAC,IAAI,GAAG;AACxB,gBAAM,EAAE,KAAK,KAAK,CAAC;AAAA,QACrB;AAEA,eAAO,IAAI,UAAU,IAAI;AAAA,MAC3B;AAEA,WAAK,UAAU,MAAM,SAASC,KAAK,GAAG,GAAG;AACvC,YAAI,EAAE,OAAO,KAAK,EAAE,OAAO,EAAG,QAAO,IAAIR,IAAG,CAAC,EAAE,UAAU,IAAI;AAE7D,YAAI,IAAI,EAAE,IAAI,CAAC;AACf,YAAI,IAAI,EAAE,MAAM,KAAK,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,OAAO,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC;AACxE,YAAI,IAAI,EAAE,KAAK,CAAC,EAAE,OAAO,KAAK,KAAK;AACnC,YAAI,MAAM;AACV,YAAI,EAAE,IAAI,KAAK,CAAC,KAAK,GAAG;AACtB,gBAAM,EAAE,KAAK,KAAK,CAAC;AAAA,QACrB,WAAW,EAAE,KAAK,CAAC,IAAI,GAAG;AACxB,gBAAM,EAAE,KAAK,KAAK,CAAC;AAAA,QACrB;AAEA,eAAO,IAAI,UAAU,IAAI;AAAA,MAC3B;AAEA,WAAK,UAAU,OAAO,SAAS,KAAM,GAAG;AAEtC,YAAI,MAAM,KAAK,KAAK,EAAE,OAAO,KAAK,CAAC,EAAE,IAAI,KAAK,EAAE,CAAC;AACjD,eAAO,IAAI,UAAU,IAAI;AAAA,MAC3B;AAAA,IACF,GAAG,OAAO,WAAW,eAAe,QAAQ,OAAI;AAAA;AAAA;;;AC9wG1C,SAAU,QAAQ,GAAU;AAKhC,SACE,aAAa,cACZ,YAAY,OAAO,CAAC,KACnB,EAAE,YAAY,SAAS,gBACvB,uBAAuB,KACvB,EAAE,sBAAsB;AAE9B;AAcM,SAAU,QAAQ,GAAW,QAAgB,IAAE;AACnD,MAAI,OAAO,MAAM,UAAU;AACzB,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,IAAI,UAAU,GAAG,MAAM,wBAAwB,OAAO,CAAC,EAAE;EACjE;AACA,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,GAAG;AACrC,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,IAAI,WAAW,GAAG,MAAM,8BAA8B,CAAC,EAAE;EACjE;AACF;AAgBM,SAAU,OACd,OACA,QACA,QAAgB,IAAE;AAElB,QAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAM,MAAM,OAAO;AACnB,QAAM,WAAW,WAAW;AAC5B,MAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,UAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,UAAM,UAAU,SAAS,wBAAwB,QAAQ,WAAW;AACpE,QAAI,CAAC;AAAO,YAAM,IAAI,UAAU,OAAO;AACvC,UAAM,IAAI,WAAW,OAAO;EAC9B;AACA,SAAO;AACT;AAkCM,SAAU,MAAM,GAAc;AAClC,MAAI,OAAO,MAAM,cAAc,OAAO,EAAE,WAAW;AACjD,UAAM,IAAI,UAAU,yCAAyC;AAC/D,UAAQ,EAAE,SAAS;AACnB,UAAQ,EAAE,QAAQ;AAGlB,MAAI,EAAE,YAAY;AAAG,UAAM,IAAI,MAAM,0BAA0B;AAC/D,MAAI,EAAE,WAAW;AAAG,UAAM,IAAI,MAAM,yBAAyB;AAC/D;AAgBM,SAAU,QAAQ,UAAe,gBAAgB,MAAI;AACzD,MAAI,SAAS;AAAW,UAAM,IAAI,MAAM,kCAAkC;AAC1E,MAAI,iBAAiB,SAAS;AAAU,UAAM,IAAI,MAAM,uCAAuC;AACjG;AAkBM,SAAU,QAAQ,KAAU,UAAa;AAC7C,SAAO,KAAK,QAAW,qBAAqB;AAC5C,QAAM+B,OAAM,SAAS;AACrB,MAAI,IAAI,SAASA,MAAK;AACpB,UAAM,IAAI,WAAW,sDAAsDA,IAAG;EAChF;AACF;AAkDM,SAAU,SAAS,QAA0B;AACjD,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,WAAO,CAAC,EAAE,KAAK,CAAC;EAClB;AACF;AAYM,SAAU,WAAW,KAAqB;AAC9C,SAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;AAChE;AAaM,SAAU,KAAK,MAAc,OAAa;AAC9C,SAAQ,QAAS,KAAK,QAAW,SAAS;AAC5C;AAsFA,IAAM,gBAA0C;;EAE9C,OAAO,WAAW,KAAK,CAAA,CAAE,EAAE,UAAU,cAAc,OAAO,WAAW,YAAY;GAAW;AAG9F,IAAM,QAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAG,GAAI,CAAC,GAAG,MAC5D,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAgB3B,SAAU,WAAW,OAAuB;AAChD,SAAO,KAAK;AAEZ,MAAI;AAAe,WAAO,MAAM,MAAK;AAErC,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,WAAO,MAAM,MAAM,CAAC,CAAC;EACvB;AACA,SAAO;AACT;AAGA,IAAM,SAAS,EAAE,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAG;AAC5D,SAAS,cAAcC,KAAU;AAC/B,MAAIA,OAAM,OAAO,MAAMA,OAAM,OAAO;AAAI,WAAOA,MAAK,OAAO;AAC3D,MAAIA,OAAM,OAAO,KAAKA,OAAM,OAAO;AAAG,WAAOA,OAAM,OAAO,IAAI;AAC9D,MAAIA,OAAM,OAAO,KAAKA,OAAM,OAAO;AAAG,WAAOA,OAAM,OAAO,IAAI;AAC9D;AACF;AAcM,SAAU,WAAW,KAAW;AACpC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,UAAU,8BAA8B,OAAO,GAAG;AACzF,MAAI,eAAe;AACjB,QAAI;AACF,aAAQ,WAAmB,QAAQ,GAAG;IACxC,SAASC,QAAO;AACd,UAAIA,kBAAiB;AAAa,cAAM,IAAI,WAAWA,OAAM,OAAO;AACpE,YAAMA;IACR;EACF;AACA,QAAMC,MAAK,IAAI;AACf,QAAM,KAAKA,MAAK;AAChB,MAAIA,MAAK;AAAG,UAAM,IAAI,WAAW,qDAAqDA,GAAE;AACxF,QAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,WAAS,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AAC/C,UAAM,KAAK,cAAc,IAAI,WAAW,EAAE,CAAC;AAC3C,UAAM,KAAK,cAAc,IAAI,WAAW,KAAK,CAAC,CAAC;AAC/C,QAAI,OAAO,UAAa,OAAO,QAAW;AACxC,YAAM,OAAO,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC;AACjC,YAAM,IAAI,WACR,iDAAiD,OAAO,gBAAgB,EAAE;IAE9E;AACA,UAAM,EAAE,IAAI,KAAK,KAAK;EACxB;AACA,SAAO;AACT;AA+FM,SAAU,eAAe,QAA0B;AACvD,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,CAAC;AAClB,WAAO,CAAC;AACR,WAAO,EAAE;EACX;AACA,QAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,WAAS,IAAI,GAAGC,OAAM,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC/C,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,IAAI,GAAGA,IAAG;AACd,IAAAA,QAAO,EAAE;EACX;AACA,SAAO;AACT;AAqJM,SAAU,aACd,UACAC,QAAuB,CAAA,GAAE;AAEzB,QAAM,QAAa,CAAC,KAAuB,SACzC,SAAS,IAAY,EAClB,OAAO,GAAG,EACV,OAAM;AACX,QAAM,MAAM,SAAS,MAAS;AAC9B,QAAM,YAAY,IAAI;AACtB,QAAM,WAAW,IAAI;AACrB,QAAM,SAAS,IAAI;AACnB,QAAM,SAAS,CAAC,SAAgB,SAAS,IAAI;AAC7C,SAAO,OAAO,OAAOA,KAAI;AACzB,SAAO,OAAO,OAAO,KAAK;AAC5B;AAkBM,SAAU,YAAY,cAAc,IAAE;AAE1C,UAAQ,aAAa,aAAa;AAClC,QAAM,KAAK,OAAO,eAAe,WAAY,WAAmB,SAAS;AACzE,MAAI,OAAO,IAAI,oBAAoB;AACjC,UAAM,IAAI,MAAM,wCAAwC;AAM1D,MAAI,cAAc;AAChB,UAAM,IAAI,WAAW,wCAAwC,WAAW,EAAE;AAC5E,SAAO,GAAG,gBAAgB,IAAI,WAAW,WAAW,CAAC;AACvD;AAcO,IAAM,UAAU,CAAC,YAA8C;;;EAGpE,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;;;;AChzBrF,SAAU,IAAI,GAAW,GAAW,GAAS;AACjD,SAAQ,IAAI,IAAM,CAAC,IAAI;AACzB;AAeM,SAAU,IAAI,GAAW,GAAW,GAAS;AACjD,SAAQ,IAAI,IAAM,IAAI,IAAM,IAAI;AAClC;AAoBM,IAAgB,SAAhB,MAAsB;EASjB;EACA;EACA,SAAS;EACT;EACA;;EAGC;EACA;EACA,WAAW;EACX,SAAS;EACT,MAAM;EACN,YAAY;EAEtB,YAAY,UAAkB,WAAmB,WAAmBC,OAAa;AAC/E,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,YAAY;AACjB,SAAK,OAAOA;AACZ,SAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,SAAK,OAAO,WAAW,KAAK,MAAM;EACpC;EACA,OAAO,MAAsB;AAC3B,YAAQ,IAAI;AACZ,WAAO,IAAI;AACX,UAAM,EAAE,MAAM,QAAAC,SAAQ,SAAQ,IAAK;AACnC,UAAM,MAAM,KAAK;AACjB,aAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAGpD,UAAI,SAAS,UAAU;AACrB,cAAM,WAAW,WAAW,IAAI;AAChC,eAAO,YAAY,MAAM,KAAK,OAAO;AAAU,eAAK,QAAQ,UAAU,GAAG;AACzE;MACF;AACA,MAAAA,QAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,WAAK,OAAO;AACZ,aAAO;AACP,UAAI,KAAK,QAAQ,UAAU;AACzB,aAAK,QAAQ,MAAM,CAAC;AACpB,aAAK,MAAM;MACb;IACF;AACA,SAAK,UAAU,KAAK;AACpB,SAAK,WAAU;AACf,WAAO;EACT;EACA,WAAW,KAAqB;AAC9B,YAAQ,IAAI;AACZ,YAAQ,KAAK,IAAI;AACjB,SAAK,WAAW;AAIhB,UAAM,EAAE,QAAAA,SAAQ,MAAM,UAAU,MAAAD,MAAI,IAAK;AACzC,QAAI,EAAE,IAAG,IAAK;AAEd,IAAAC,QAAO,KAAK,IAAI;AAChB,UAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,QAAI,KAAK,YAAY,WAAW,KAAK;AACnC,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM;IACR;AAEA,aAAS,IAAI,KAAK,IAAI,UAAU;AAAK,MAAAA,QAAO,CAAC,IAAI;AAIjD,SAAK,aAAa,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGD,KAAI;AAC7D,SAAK,QAAQ,MAAM,CAAC;AACpB,UAAM,QAAQ,WAAW,GAAG;AAC5B,UAAM,MAAM,KAAK;AAEjB,QAAI,MAAM;AAAG,YAAM,IAAI,MAAM,2CAA2C;AACxE,UAAM,SAAS,MAAM;AACrB,UAAME,SAAQ,KAAK,IAAG;AACtB,QAAI,SAASA,OAAM;AAAQ,YAAM,IAAI,MAAM,oCAAoC;AAC/E,aAAS,IAAI,GAAG,IAAI,QAAQ;AAAK,YAAM,UAAU,IAAI,GAAGA,OAAM,CAAC,GAAGF,KAAI;EACxE;EACA,SAAM;AACJ,UAAM,EAAE,QAAAC,SAAQ,UAAS,IAAK;AAC9B,SAAK,WAAWA,OAAM;AAGtB,UAAM,MAAMA,QAAO,MAAM,GAAG,SAAS;AACrC,SAAK,QAAO;AACZ,WAAO;EACT;EACA,WAAW,IAAM;AACf,WAAO,IAAK,KAAK,YAAmB;AACpC,OAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,UAAM,EAAE,UAAU,QAAAA,SAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,OAAG,YAAY;AACf,OAAG,WAAW;AACd,OAAG,SAAS;AACZ,OAAG,MAAM;AAGT,QAAI,SAAS;AAAU,SAAG,OAAO,IAAIA,OAAM;AAC3C,WAAO;EACT;EACA,QAAK;AACH,WAAO,KAAK,WAAU;EACxB;;AAWK,IAAM,YAA+C,4BAAY,KAAK;EAC3E;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;CACrF;;;ACrLD,IAAM,WAA2B,4BAAY,KAAK;EAChD;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;CACrF;AAGD,IAAM,WAA2B,oBAAI,YAAY,EAAE;AAGnD,IAAe,WAAf,cAAuD,OAAS;EAY9D,YAAY,WAAiB;AAC3B,UAAM,IAAI,WAAW,GAAG,KAAK;EAC/B;EACU,MAAG;AACX,UAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAAE,IAAG,EAAC,IAAK;AACnC,WAAO,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGA,IAAG,CAAC;EAChC;;EAEU,IACR,GAAW,GAAW,GAAW,GAAW,GAAW,GAAWA,IAAW,GAAS;AAEtF,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAIA,KAAI;AACb,SAAK,IAAI,IAAI;EACf;EACU,QAAQ,MAAgB,QAAc;AAE9C,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,UAAU;AAAG,eAAS,CAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAC5B,YAAM,MAAM,SAAS,IAAI,EAAE;AAC3B,YAAM,KAAK,SAAS,IAAI,CAAC;AACzB,YAAM,KAAK,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,YAAM,KAAK,KAAK,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,IAAK,OAAO;AACjD,eAAS,CAAC,IAAK,KAAK,SAAS,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,EAAE,IAAK;IACjE;AAEA,QAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAAA,IAAG,EAAC,IAAK;AACjC,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAMC,UAAS,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE;AACpD,YAAM,KAAM,IAAIA,UAAS,IAAI,GAAG,GAAGD,EAAC,IAAI,SAAS,CAAC,IAAI,SAAS,CAAC,IAAK;AACrE,YAAME,UAAS,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE;AACpD,YAAM,KAAMA,UAAS,IAAI,GAAG,GAAG,CAAC,IAAK;AACrC,UAAIF;AACJ,MAAAA,KAAI;AACJ,UAAI;AACJ,UAAK,IAAI,KAAM;AACf,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAK,KAAK,KAAM;IAClB;AAEA,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,IAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGA,IAAG,CAAC;EACjC;EACU,aAAU;AAClB,UAAM,QAAQ;EAChB;EACA,UAAO;AAGL,SAAK,YAAY;AACjB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,UAAM,KAAK,MAAM;EACnB;;AAII,IAAO,UAAP,cAAuB,SAAiB;;;EAGlC,IAAY,UAAU,CAAC,IAAI;EAC3B,IAAY,UAAU,CAAC,IAAI;EAC3B,IAAY,UAAU,CAAC,IAAI;EAC3B,IAAY,UAAU,CAAC,IAAI;EAC3B,IAAY,UAAU,CAAC,IAAI;EAC3B,IAAY,UAAU,CAAC,IAAI;EAC3B,IAAY,UAAU,CAAC,IAAI;EAC3B,IAAY,UAAU,CAAC,IAAI;EACrC,cAAA;AACE,UAAM,EAAE;EACV;;AAsUK,IAAM,SAA+C;EAC1D,MAAM,IAAI,QAAO;EACD,wBAAQ,CAAI;AAAC;;;AClUxB,IAAMG,UAAS,CAA6B,OAAU,QAAiB,UAC5E,OAAQ,OAAO,QAAQ,KAAK;AAYvB,IAAMC,WAA2B;AAYjC,IAAMC,cAAiC;AAYvC,IAAMC,eAAc,IAAI,WAC7B,YAAa,GAAG,MAAM;AAYjB,IAAMC,cAAa,CAAC,QAAkC,WAAY,GAAG;AAYrE,IAAMC,WAA2B;AAYjC,IAAMC,eAAc,CAAC,gBAC1B,YAAa,WAAW;AAC1B,IAAM,MAAsB,uBAAO,CAAC;AACpC,IAAM,MAAsB,uBAAO,CAAC;AAyC9B,SAAU,MAAM,OAAgB,QAAgB,IAAE;AACtD,MAAI,OAAO,UAAU,WAAW;AAC9B,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,IAAI,UAAU,SAAS,gCAAgC,OAAO,KAAK;EAC3E;AACA,SAAO;AACT;AAcM,SAAU,WAAsC,GAAI;AACxD,MAAI,OAAO,MAAM,UAAU;AACzB,QAAI,CAAC,SAAS,CAAC;AAAG,YAAM,IAAI,WAAW,mCAAmC,CAAC;EAC7E;AAAO,IAAAL,SAAQ,CAAC;AAChB,SAAO;AACT;AAeM,SAAU,YAAY,OAAe,QAAgB,IAAE;AAC3D,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,IAAI,UAAU,SAAS,+BAA+B,OAAO,KAAK;EAC1E;AACA,MAAI,CAAC,OAAO,cAAc,KAAK,GAAG;AAChC,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,IAAI,WAAW,SAAS,gCAAgC,KAAK;EACrE;AACF;AAgBM,SAAU,oBAAoB,KAAoB;AACtD,QAAM,MAAM,WAAW,GAAG,EAAE,SAAS,EAAE;AACvC,SAAO,IAAI,SAAS,IAAI,MAAM,MAAM;AACtC;AAgBM,SAAU,YAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,UAAU,8BAA8B,OAAO,GAAG;AACzF,SAAO,QAAQ,KAAK,MAAM,OAAO,OAAO,GAAG;AAC7C;AAeM,SAAU,gBAAgB,OAAuB;AACrD,SAAO,YAAY,WAAY,KAAK,CAAC;AACvC;AAaM,SAAU,gBAAgB,OAAuB;AACrD,SAAO,YAAY,WAAY,UAAU,OAAQ,KAAK,CAAC,EAAE,QAAO,CAAE,CAAC;AACrE;AAeM,SAAU,gBAAgB,GAAoB,KAAW;AAC7D,UAAS,GAAG;AACZ,MAAI,QAAQ;AAAG,UAAM,IAAI,WAAW,aAAa;AACjD,MAAI,WAAW,CAAC;AAChB,QAAM,MAAM,EAAE,SAAS,EAAE;AAEzB,MAAI,IAAI,SAAS,MAAM;AAAG,UAAM,IAAI,WAAW,kBAAkB;AACjE,SAAO,WAAY,IAAI,SAAS,MAAM,GAAG,GAAG,CAAC;AAC/C;AAcM,SAAU,gBAAgB,GAAoB,KAAW;AAC7D,SAAO,gBAAgB,GAAG,GAAG,EAAE,QAAO;AACxC;AAoDM,SAAU,UAAU,OAAuB;AAG/C,SAAO,WAAW,KAAKM,QAAO,KAAK,CAAC;AACtC;AA8BA,IAAM,WAAW,CAAC,MAAc,OAAO,MAAM,YAAY,OAAO;AAe1D,SAAU,QAAQ,GAAWC,MAAaC,MAAW;AACzD,SAAO,SAAS,CAAC,KAAK,SAASD,IAAG,KAAK,SAASC,IAAG,KAAKD,QAAO,KAAK,IAAIC;AAC1E;AAkBM,SAAU,SAAS,OAAe,GAAWD,MAAaC,MAAW;AAMzE,MAAI,CAAC,QAAQ,GAAGD,MAAKC,IAAG;AACtB,UAAM,IAAI,WAAW,oBAAoB,QAAQ,OAAOD,OAAM,aAAaC,OAAM,WAAW,CAAC;AACjG;AAkBM,SAAU,OAAO,GAAS;AAG9B,MAAI,IAAI;AAAK,UAAM,IAAI,MAAM,uCAAuC,CAAC;AACrE,MAAI;AACJ,OAAK,MAAM,GAAG,IAAI,KAAK,MAAM,KAAK,OAAO;AAAE;AAC3C,SAAO;AACT;AAuDO,IAAM,UAAU,CAAC,OAAuB,OAAO,OAAO,CAAC,KAAK;AA0B7D,SAAU,eACd,SACA,UACA,QAAoB;AAEpB,UAAS,SAAS,SAAS;AAC3B,UAAS,UAAU,UAAU;AAC7B,MAAI,OAAO,WAAW;AAAY,UAAM,IAAI,UAAU,2BAA2B;AAEjF,QAAM,MAAM,CAAC,QAAkC,IAAI,WAAW,GAAG;AACjE,QAAM,OAAO,WAAW,GAAE;AAC1B,QAAM,QAAQ,WAAW,GAAG,CAAI;AAChC,QAAM,QAAQ,WAAW,GAAG,CAAI;AAChC,QAAM,gBAAgB;AAItB,MAAI,IAAgB,IAAI,OAAO;AAE/B,MAAI,IAAgB,IAAI,OAAO;AAC/B,MAAI,IAAI;AACR,QAAM,QAAQ,MAAK;AACjB,MAAE,KAAK,CAAC;AACR,MAAE,KAAK,CAAC;AACR,QAAI;EACN;AAEA,QAAM,IAAI,IAAI,SAA8B,OAAkB,GAAGC,aAAY,GAAG,GAAG,IAAI,CAAC;AACxF,QAAMC,UAAS,CAAC,OAAyB,SAAQ;AAE/C,QAAI,EAAE,OAAO,IAAI;AACjB,QAAI,EAAC;AACL,QAAI,KAAK,WAAW;AAAG;AACvB,QAAI,EAAE,OAAO,IAAI;AACjB,QAAI,EAAC;EACP;AACA,QAAM,MAAM,MAAK;AAEf,QAAI,OAAO;AAAe,YAAM,IAAI,MAAM,sCAAsC;AAChF,QAAI,MAAM;AACV,UAAM,MAAoB,CAAA;AAC1B,WAAO,MAAM,UAAU;AACrB,UAAI,EAAC;AACL,YAAMC,MAAK,EAAE,MAAK;AAClB,UAAI,KAAKA,GAAE;AACX,aAAO,EAAE;IACX;AACA,WAAOF,aAAY,GAAG,GAAG;EAC3B;AACA,QAAM,WAAW,CAAC,MAAwB,SAA0B;AAClE,UAAK;AACL,IAAAC,QAAO,IAAI;AACX,QAAI,MAAqB;AAEzB,YAAQ,MAAO,KAAiB,IAAG,CAAE,OAAO;AAAW,MAAAA,QAAM;AAC7D,UAAK;AACL,WAAO;EACT;AACA,SAAO;AACT;AAiBM,SAAU,eACd,QACA,SAAiC,CAAA,GACjC,YAAoC,CAAA,GAAE;AAEtC,MAAI,OAAO,UAAU,SAAS,KAAK,MAAM,MAAM;AAC7C,UAAM,IAAI,UAAU,+BAA+B;AAErD,WAAS,WAAW,WAAiB,cAAsB,OAAc;AAGvE,QAAI,CAAC,SAAS,iBAAiB,cAAc,CAAC,OAAO,OAAO,QAAQ,SAAS;AAC3E,YAAM,IAAI,UAAU,UAAU,SAAS,qCAAqC;AAC9E,UAAM,MAAM,OAAO,SAAS;AAC5B,QAAI,SAAS,QAAQ;AAAW;AAChC,UAAM,UAAU,OAAO;AACvB,QAAI,YAAY,gBAAgB,QAAQ;AACtC,YAAM,IAAI,UACR,UAAU,SAAS,0BAA0B,YAAY,SAAS,OAAO,EAAE;EAEjF;AACA,QAAM,OAAO,CAACE,IAAkB,UAC9B,OAAO,QAAQA,EAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,WAAW,GAAG,GAAG,KAAK,CAAC;AAC/D,OAAK,QAAQ,KAAK;AAClB,OAAK,WAAW,IAAI;AACtB;;;AChtBA,IAAMC,OAAsB,uBAAO,CAAC;AAApC,IAAuCC,OAAsB,uBAAO,CAAC;AAArE,IAAwE,MAAsB,uBAAO,CAAC;AAEtG,IAAM,MAAsB,uBAAO,CAAC;AAApC,IAAuC,MAAsB,uBAAO,CAAC;AAArE,IAAwE,MAAsB,uBAAO,CAAC;AAEtG,IAAM,MAAsB,uBAAO,CAAC;AAApC,IAAuC,MAAsB,uBAAO,CAAC;AAArE,IAAwE,MAAsB,uBAAO,CAAC;AACtG,IAAM,OAAuB,uBAAO,EAAE;AAchC,SAAU,IAAI,GAAW,GAAS;AACtC,MAAI,KAAKD;AAAK,UAAM,IAAI,MAAM,yCAAyC,CAAC;AACxE,QAAM,SAAS,IAAI;AACnB,SAAO,UAAUA,OAAM,SAAS,IAAI;AACtC;AAsCM,SAAU,KAAK,GAAW,OAAe,QAAc;AAC3D,MAAI,QAAQE;AAAK,UAAM,IAAI,MAAM,+CAA+C,KAAK;AACrF,MAAI,MAAM;AACV,SAAO,UAAUA,MAAK;AACpB,WAAO;AACP,WAAO;EACT;AACA,SAAO;AACT;AAgBM,SAAU,OAAO,QAAgB,QAAc;AACnD,MAAI,WAAWA;AAAK,UAAM,IAAI,MAAM,kCAAkC;AACtE,MAAI,UAAUA;AAAK,UAAM,IAAI,MAAM,4CAA4C,MAAM;AAErF,MAAI,IAAI,IAAI,QAAQ,MAAM;AAC1B,MAAI,IAAI;AAER,MAAI,IAAIA,MAAK,IAAIC,MAAK,IAAIA,MAAK,IAAID;AACnC,SAAO,MAAMA,MAAK;AAChB,UAAM,IAAI,IAAI;AACd,UAAME,KAAI,IAAI,IAAI;AAClB,UAAM,IAAI,IAAI,IAAI;AAClB,UAAM,IAAI,IAAI,IAAI;AAElB,QAAI,GAAG,IAAIA,IAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI;EACzC;AACA,QAAM,MAAM;AACZ,MAAI,QAAQD;AAAK,UAAM,IAAI,MAAM,wBAAwB;AACzD,SAAO,IAAI,GAAG,MAAM;AACtB;AAEA,SAAS,eAAkB,IAAqBE,OAAS,GAAI;AAC3D,QAAM,IAAI;AACV,MAAI,CAAC,EAAE,IAAI,EAAE,IAAIA,KAAI,GAAG,CAAC;AAAG,UAAM,IAAI,MAAM,yBAAyB;AACvE;AAMA,SAAS,UAAa,IAAqB,GAAI;AAC7C,QAAM,IAAI;AACV,QAAM,UAAU,EAAE,QAAQF,QAAO;AACjC,QAAME,QAAO,EAAE,IAAI,GAAG,MAAM;AAC5B,iBAAe,GAAGA,OAAM,CAAC;AACzB,SAAOA;AACT;AAIA,SAAS,UAAa,IAAqB,GAAI;AAC7C,QAAM,IAAI;AACV,QAAM,UAAU,EAAE,QAAQ,OAAO;AACjC,QAAM,KAAK,EAAE,IAAI,GAAG,GAAG;AACvB,QAAM,IAAI,EAAE,IAAI,IAAI,MAAM;AAC1B,QAAM,KAAK,EAAE,IAAI,GAAG,CAAC;AACrB,QAAM,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,GAAG,GAAG,CAAC;AACjC,QAAMA,QAAO,EAAE,IAAI,IAAI,EAAE,IAAI,GAAG,EAAE,GAAG,CAAC;AACtC,iBAAe,GAAGA,OAAM,CAAC;AACzB,SAAOA;AACT;AAIA,SAAS,WAAW,GAAS;AAC3B,QAAM,MAAM,MAAM,CAAC;AACnB,QAAM,KAAK,cAAc,CAAC;AAC1B,QAAM,KAAK,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AACnC,QAAM,KAAK,GAAG,KAAK,EAAE;AACrB,QAAM,KAAK,GAAG,KAAK,IAAI,IAAI,EAAE,CAAC;AAC9B,QAAM,MAAM,IAAI,OAAO;AACvB,UAAQ,CAAI,IAAqB,MAAW;AAC1C,UAAM,IAAI;AACV,QAAI,MAAM,EAAE,IAAI,GAAG,EAAE;AACrB,QAAI,MAAM,EAAE,IAAI,KAAK,EAAE;AACvB,UAAM,MAAM,EAAE,IAAI,KAAK,EAAE;AACzB,UAAM,MAAM,EAAE,IAAI,KAAK,EAAE;AACzB,UAAM,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC;AAC9B,UAAM,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC;AAC9B,UAAM,EAAE,KAAK,KAAK,KAAK,EAAE;AACzB,UAAM,EAAE,KAAK,KAAK,KAAK,EAAE;AACzB,UAAM,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC;AAC9B,UAAMA,QAAO,EAAE,KAAK,KAAK,KAAK,EAAE;AAChC,mBAAe,GAAGA,OAAM,CAAC;AACzB,WAAOA;EACT;AACF;AAoBM,SAAU,cAAc,GAAS;AAGrC,MAAI,IAAI;AAAK,UAAM,IAAI,MAAM,qCAAqC;AAElE,MAAI,IAAI,IAAIF;AACZ,MAAIG,KAAI;AACR,SAAO,IAAI,QAAQJ,MAAK;AACtB,SAAK;AACL,IAAAI;EACF;AAGA,MAAI,IAAI;AACR,QAAM,MAAM,MAAM,CAAC;AACnB,SAAO,WAAW,KAAK,CAAC,MAAM,GAAG;AAG/B,QAAI,MAAM;AAAM,YAAM,IAAI,MAAM,+CAA+C;EACjF;AAEA,MAAIA,OAAM;AAAG,WAAO;AAIpB,MAAI,KAAK,IAAI,IAAI,GAAG,CAAC;AACrB,QAAM,UAAU,IAAIH,QAAO;AAC3B,SAAO,SAAS,YAAe,IAAqB,GAAI;AACtD,UAAM,IAAI;AACV,QAAI,EAAE,IAAI,CAAC;AAAG,aAAO;AAErB,QAAI,WAAW,GAAG,CAAC,MAAM;AAAG,YAAM,IAAI,MAAM,yBAAyB;AAGrE,QAAI,IAAIG;AACR,QAAI,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE;AACvB,QAAI,IAAI,EAAE,IAAI,GAAG,CAAC;AAClB,QAAIC,KAAI,EAAE,IAAI,GAAG,MAAM;AAIvB,WAAO,CAAC,EAAE,IAAI,GAAG,EAAE,GAAG,GAAG;AACvB,UAAI,EAAE,IAAI,CAAC;AAAG,eAAO,EAAE;AACvB,UAAI,IAAI;AAGR,UAAI,QAAQ,EAAE,IAAI,CAAC;AACnB,aAAO,CAAC,EAAE,IAAI,OAAO,EAAE,GAAG,GAAG;AAC3B;AACA,gBAAQ,EAAE,IAAI,KAAK;AACnB,YAAI,MAAM;AAAG,gBAAM,IAAI,MAAM,yBAAyB;MACxD;AAGA,YAAM,WAAWJ,QAAO,OAAO,IAAI,IAAI,CAAC;AACxC,YAAM,IAAI,EAAE,IAAI,GAAG,QAAQ;AAG3B,UAAI;AACJ,UAAI,EAAE,IAAI,CAAC;AACX,UAAI,EAAE,IAAI,GAAG,CAAC;AACd,MAAAI,KAAI,EAAE,IAAIA,IAAG,CAAC;IAChB;AACA,WAAOA;EACT;AACF;AA0BM,SAAU,OAAO,GAAS;AAE9B,MAAI,IAAI,QAAQ;AAAK,WAAO;AAE5B,MAAI,IAAI,QAAQ;AAAK,WAAO;AAE5B,MAAI,IAAI,SAAS;AAAK,WAAO,WAAW,CAAC;AAEzC,SAAO,cAAc,CAAC;AACxB;AA6MA,IAAM,eAAe;EACnB;EAAU;EAAW;EAAO;EAAO;EAAO;EAAQ;EAClD;EAAO;EAAO;EAAO;EAAO;EAAO;EACnC;EAAQ;EAAQ;EAAQ;;AAgBpB,SAAU,cAAiB,OAAsB;AACrD,QAAM,UAAU;IACd,OAAO;IACP,OAAO;IACP,MAAM;;AAER,QAAM,OAAO,aAAa,OAAO,CAAC,KAAK,QAAe;AACpD,QAAI,GAAG,IAAI;AACX,WAAO;EACT,GAAG,OAAO;AACV,iBAAe,OAAO,IAAI;AAG1B,cAAY,MAAM,OAAO,OAAO;AAChC,cAAY,MAAM,MAAM,MAAM;AAG9B,MAAI,MAAM,QAAQ,KAAK,MAAM,OAAO;AAAG,UAAM,IAAI,MAAM,wCAAwC;AAC/F,MAAI,MAAM,SAASC;AAAK,UAAM,IAAI,MAAM,4CAA4C,MAAM,KAAK;AAC/F,SAAO;AACT;AAqBM,SAAU,MAAS,IAAqB,KAAQ,OAAa;AACjE,QAAM,IAAI;AACV,MAAI,QAAQC;AAAK,UAAM,IAAI,MAAM,yCAAyC;AAC1E,MAAI,UAAUA;AAAK,WAAO,EAAE;AAC5B,MAAI,UAAUD;AAAK,WAAO;AAC1B,MAAI,IAAI,EAAE;AACV,MAAI,IAAI;AACR,SAAO,QAAQC,MAAK;AAClB,QAAI,QAAQD;AAAK,UAAI,EAAE,IAAI,GAAG,CAAC;AAC/B,QAAI,EAAE,IAAI,CAAC;AACX,cAAUA;EACZ;AACA,SAAO;AACT;AAkBM,SAAU,cAAiB,IAAqB,MAAW,WAAW,OAAK;AAC/E,QAAM,IAAI;AACV,QAAM,WAAW,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,WAAW,EAAE,OAAO,MAAS;AAE1E,QAAM,gBAAgB,KAAK,OAAO,CAAC,KAAK,KAAK,MAAK;AAChD,QAAI,EAAE,IAAI,GAAG;AAAG,aAAO;AACvB,aAAS,CAAC,IAAI;AACd,WAAO,EAAE,IAAI,KAAK,GAAG;EACvB,GAAG,EAAE,GAAG;AAER,QAAM,cAAc,EAAE,IAAI,aAAa;AAEvC,OAAK,YAAY,CAAC,KAAK,KAAK,MAAK;AAC/B,QAAI,EAAE,IAAI,GAAG;AAAG,aAAO;AACvB,aAAS,CAAC,IAAI,EAAE,IAAI,KAAK,SAAS,CAAC,CAAC;AACpC,WAAO,EAAE,IAAI,KAAK,GAAG;EACvB,GAAG,WAAW;AACd,SAAO;AACT;AA2CM,SAAU,WAAc,IAAqB,GAAI;AACrD,QAAM,IAAI;AAGV,QAAM,UAAU,EAAE,QAAQE,QAAO;AACjC,QAAM,UAAU,EAAE,IAAI,GAAG,MAAM;AAC/B,QAAM,MAAM,EAAE,IAAI,SAAS,EAAE,GAAG;AAChC,QAAM,OAAO,EAAE,IAAI,SAAS,EAAE,IAAI;AAClC,QAAM,KAAK,EAAE,IAAI,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC;AACtC,MAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;AAAI,UAAM,IAAI,MAAM,gCAAgC;AAC1E,SAAO,MAAM,IAAI,OAAO,IAAI;AAC9B;AA2CM,SAAU,QAAQ,GAAW,YAAmB;AAEpD,MAAI,eAAe;AAAW,IAAAC,SAAQ,UAAU;AAChD,MAAI,KAAKC;AAAK,UAAM,IAAI,MAAM,gDAAgD,CAAC;AAC/E,MAAI,eAAe,UAAa,aAAa;AAC3C,UAAM,IAAI,MAAM,yDAAyD,UAAU;AACrF,QAAM,OAAO,OAAO,CAAC;AAGrB,MAAI,eAAe,UAAa,aAAa;AAC3C,UAAM,IAAI,MAAM,0CAA0C,IAAI,kBAAkB,UAAU,GAAG;AAC/F,QAAM,cAAc,eAAe,SAAY,aAAa;AAC5D,QAAM,cAAc,KAAK,KAAK,cAAc,CAAC;AAC7C,SAAO,EAAE,YAAY,aAAa,YAAW;AAC/C;AAaA,IAAM,aAAa,oBAAI,QAAO;AAC9B,IAAM,SAAN,MAAY;EACD;EACA;EACA;EACA;EACA,OAAOA;EACP,MAAMC;EACN;EACQ;EACjB,YAAY,OAAe,OAAkB,CAAA,GAAE;AAG7C,QAAI,SAASA;AAAK,YAAM,IAAI,MAAM,4CAA4C,KAAK;AACnF,QAAI,cAAkC;AACtC,SAAK,OAAO;AACZ,QAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAE5C,UAAI,OAAO,KAAK,SAAS;AAAU,sBAAc,KAAK;AACtD,UAAI,OAAO,KAAK,SAAS;AAGvB,eAAO,eAAe,MAAM,QAAQ,EAAE,OAAO,KAAK,MAAM,YAAY,KAAI,CAAE;AAC5E,UAAI,OAAO,KAAK,SAAS;AAAW,aAAK,OAAO,KAAK;AACrD,UAAI,KAAK;AAAgB,aAAK,WAAW,OAAO,OAAO,KAAK,eAAe,MAAK,CAAE;AAClF,UAAI,OAAO,KAAK,iBAAiB;AAAW,aAAK,OAAO,KAAK;IAC/D;AACA,UAAM,EAAE,YAAY,YAAW,IAAK,QAAQ,OAAO,WAAW;AAC9D,QAAI,cAAc;AAAM,YAAM,IAAI,MAAM,gDAAgD;AACxF,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,WAAO,OAAO,IAAI;EACpB;EAEA,OAAO,KAAW;AAChB,WAAO,IAAI,KAAK,KAAK,KAAK;EAC5B;EACA,QAAQ,KAAW;AACjB,QAAI,OAAO,QAAQ;AACjB,YAAM,IAAI,UAAU,iDAAiD,OAAO,GAAG;AACjF,WAAOD,QAAO,OAAO,MAAM,KAAK;EAClC;EACA,IAAI,KAAW;AACb,WAAO,QAAQA;EACjB;;EAEA,YAAY,KAAW;AACrB,WAAO,CAAC,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,GAAG;EAC3C;EACA,MAAM,KAAW;AACf,YAAQ,MAAMC,UAASA;EACzB;EACA,IAAI,KAAW;AACb,WAAO,IAAI,CAAC,KAAK,KAAK,KAAK;EAC7B;EACA,IAAI,KAAa,KAAW;AAC1B,WAAO,QAAQ;EACjB;EAEA,IAAI,KAAW;AACb,WAAO,IAAI,MAAM,KAAK,KAAK,KAAK;EAClC;EACA,IAAI,KAAa,KAAW;AAC1B,WAAO,IAAI,MAAM,KAAK,KAAK,KAAK;EAClC;EACA,IAAI,KAAa,KAAW;AAC1B,WAAO,IAAI,MAAM,KAAK,KAAK,KAAK;EAClC;EACA,IAAI,KAAa,KAAW;AAC1B,WAAO,IAAI,MAAM,KAAK,KAAK,KAAK;EAClC;EACA,IAAI,KAAa,OAAa;AAC5B,WAAO,MAAM,MAAM,KAAK,KAAK;EAC/B;EACA,IAAI,KAAa,KAAW;AAC1B,WAAO,IAAI,MAAM,OAAO,KAAK,KAAK,KAAK,GAAG,KAAK,KAAK;EACtD;;EAGA,KAAK,KAAW;AACd,WAAO,MAAM;EACf;EACA,KAAK,KAAa,KAAW;AAC3B,WAAO,MAAM;EACf;EACA,KAAK,KAAa,KAAW;AAC3B,WAAO,MAAM;EACf;EACA,KAAK,KAAa,KAAW;AAC3B,WAAO,MAAM;EACf;EAEA,IAAI,KAAW;AACb,WAAO,OAAO,KAAK,KAAK,KAAK;EAC/B;EACA,KAAK,KAAW;AAGd,QAAI,OAAO,WAAW,IAAI,IAAI;AAC9B,QAAI,CAAC;AAAM,iBAAW,IAAI,MAAO,OAAO,OAAO,KAAK,KAAK,CAAE;AAC3D,WAAO,KAAK,MAAM,GAAG;EACvB;EACA,QAAQ,KAAW;AAIjB,WAAO,KAAK,OAAO,gBAAgB,KAAK,KAAK,KAAK,IAAI,gBAAgB,KAAK,KAAK,KAAK;EACvF;EACA,UAAU,OAAmB,iBAAiB,OAAK;AACjD,IAAAC,QAAO,KAAK;AACZ,UAAM,EAAE,UAAU,gBAAgB,OAAO,MAAAC,OAAM,OAAO,MAAM,aAAY,IAAK;AAC7E,QAAI,gBAAgB;AAGlB,UAAI,MAAM,SAAS,KAAK,CAAC,eAAe,SAAS,MAAM,MAAM,KAAK,MAAM,SAAS,OAAO;AACtF,cAAM,IAAI,MACR,+BAA+B,iBAAiB,iBAAiB,MAAM,MAAM;MAEjF;AACA,YAAM,SAAS,IAAI,WAAW,KAAK;AAEnC,aAAO,IAAI,OAAOA,QAAO,IAAI,OAAO,SAAS,MAAM,MAAM;AACzD,cAAQ;IACV;AACA,QAAI,MAAM,WAAW;AACnB,YAAM,IAAI,MAAM,+BAA+B,QAAQ,iBAAiB,MAAM,MAAM;AACtF,QAAI,SAASA,QAAO,gBAAgB,KAAK,IAAI,gBAAgB,KAAK;AAClE,QAAI;AAAc,eAAS,IAAI,QAAQ,KAAK;AAC5C,QAAI,CAAC;AACH,UAAI,CAAC,KAAK,QAAQ,MAAM;AACtB,cAAM,IAAI,MAAM,kDAAkD;;AAGtE,WAAO;EACT;;EAEA,YAAY,KAAa;AACvB,WAAO,cAAc,MAAM,GAAG;EAChC;;;EAGA,KAAK,GAAW,GAAW,WAAkB;AAG3C,UAAM,WAAW,WAAW;AAC5B,WAAO,YAAY,IAAI;EACzB;;AAIF,OAAO,OAAO,OAAO,SAAS;AA4BxB,SAAU,MAAM,OAAe,OAAkB,CAAA,GAAE;AACvD,SAAO,IAAI,OAAO,OAAO,IAAI;AAC/B;AAyEM,SAAU,oBAAoB,YAAkB;AACpD,MAAI,OAAO,eAAe;AAAU,UAAM,IAAI,MAAM,4BAA4B;AAEhF,MAAI,cAAcC;AAAK,UAAM,IAAI,MAAM,oCAAoC;AAE3E,QAAM,YAAY,OAAO,aAAaA,IAAG;AACzC,SAAO,KAAK,KAAK,YAAY,CAAC;AAChC;AAkBM,SAAU,iBAAiB,YAAkB;AACjD,QAAM,SAAS,oBAAoB,UAAU;AAC7C,SAAO,SAAS,KAAK,KAAK,SAAS,CAAC;AACtC;AAyBM,SAAU,eACdC,MACA,YACAC,QAAO,OAAK;AAEZ,EAAAC,QAAOF,IAAG;AACV,QAAM,MAAMA,KAAI;AAChB,QAAM,WAAW,oBAAoB,UAAU;AAC/C,QAAM,SAAS,KAAK,IAAI,iBAAiB,UAAU,GAAG,EAAE;AAGxD,MAAI,MAAM,UAAU,MAAM;AACxB,UAAM,IAAI,MAAM,cAAc,SAAS,+BAA+B,GAAG;AAC3E,QAAM,MAAMC,QAAO,gBAAgBD,IAAG,IAAI,gBAAgBA,IAAG;AAE7D,QAAM,UAAU,IAAI,KAAK,aAAaD,IAAG,IAAIA;AAC7C,SAAOE,QAAO,gBAAgB,SAAS,QAAQ,IAAI,gBAAgB,SAAS,QAAQ;AACtF;;;ACliCA,IAAME,OAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AAuR9B,SAAU,SAAwC,WAAoB,MAAO;AACjF,QAAMC,OAAM,KAAK,OAAM;AACvB,SAAO,YAAYA,OAAM;AAC3B;AAoBM,SAAU,WACd,GACA,QAAW;AAEX,QAAM,aAAa,cACjB,EAAE,IACF,OAAO,IAAI,CAAC,MAAM,EAAE,CAAE,CAAC;AAEzB,SAAO,OAAO,IAAI,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,SAAS,WAAW,CAAC,CAAC,CAAC,CAAC;AACrE;AAEA,SAAS,UAAUC,IAAW,MAAY;AACxC,MAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,MAAK,KAAKA,KAAI;AAC5C,UAAM,IAAI,MAAM,uCAAuC,OAAO,cAAcA,EAAC;AACjF;AAcA,SAAS,UAAUA,IAAW,YAAkB;AAC9C,YAAUA,IAAG,UAAU;AACvB,QAAM,UAAU,KAAK,KAAK,aAAaA,EAAC,IAAI;AAC5C,QAAM,aAAa,MAAMA,KAAI;AAC7B,QAAM,YAAY,KAAKA;AACvB,QAAM,OAAO,QAAQA,EAAC;AACtB,QAAM,UAAU,OAAOA,EAAC;AACxB,SAAO,EAAE,SAAS,YAAY,MAAM,WAAW,QAAO;AACxD;AAEA,SAAS,YAAY,GAAWC,SAAgB,OAAY;AAC1D,QAAM,EAAE,YAAY,MAAM,WAAW,QAAO,IAAK;AACjD,MAAI,QAAQ,OAAO,IAAI,IAAI;AAC3B,MAAI,QAAQ,KAAK;AAQjB,MAAI,QAAQ,YAAY;AAEtB,aAAS;AACT,aAASC;EACX;AACA,QAAM,cAAcD,UAAS;AAC7B,QAAM,SAAS,cAAc,KAAK,IAAI,KAAK,IAAI;AAC/C,QAAM,SAAS,UAAU;AACzB,QAAM,QAAQ,QAAQ;AACtB,QAAM,SAASA,UAAS,MAAM;AAC9B,QAAM,UAAU;AAChB,SAAO,EAAE,OAAO,QAAQ,QAAQ,OAAO,QAAQ,QAAO;AACxD;AAkBA,IAAM,mBAAmB,oBAAI,QAAO;AACpC,IAAM,mBAAmB,oBAAI,QAAO;AAEpC,SAAS,KAAK,GAAM;AAIlB,SAAO,iBAAiB,IAAI,CAAC,KAAK;AACpC;AAEA,SAAS,QAAQ,GAAS;AAGxB,MAAI,MAAME;AAAK,UAAM,IAAI,MAAM,cAAc;AAC/C;AA8BM,IAAO,OAAP,MAAW;EACE;EACA;EACA;EACR;;EAGT,YAAYC,QAAW,MAAY;AACjC,SAAK,OAAOA,OAAM;AAClB,SAAK,OAAOA,OAAM;AAClB,SAAK,KAAKA,OAAM;AAChB,SAAK,OAAO;EACd;;EAGA,cAAc,KAAe,GAAW,IAAc,KAAK,MAAI;AAC7D,QAAI,IAAc;AAClB,WAAO,IAAID,MAAK;AACd,UAAI,IAAIE;AAAK,YAAI,EAAE,IAAI,CAAC;AACxB,UAAI,EAAE,OAAM;AACZ,YAAMA;IACR;AACA,WAAO;EACT;;;;;;;;;;;;;EAcQ,iBAAiBC,QAAiBC,IAAS;AACjD,UAAM,EAAE,SAAS,WAAU,IAAK,UAAUA,IAAG,KAAK,IAAI;AACtD,UAAM,SAAqB,CAAA;AAC3B,QAAI,IAAcD;AAClB,QAAIE,QAAO;AACX,aAASC,UAAS,GAAGA,UAAS,SAASA,WAAU;AAC/C,MAAAD,QAAO;AACP,aAAO,KAAKA,KAAI;AAEhB,eAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,QAAAA,QAAOA,MAAK,IAAI,CAAC;AACjB,eAAO,KAAKA,KAAI;MAClB;AACA,UAAIA,MAAK,OAAM;IACjB;AACA,WAAO;EACT;;;;;;;EAQQ,KAAKD,IAAW,aAAyB,GAAS;AAExD,QAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;AAAG,YAAM,IAAI,MAAM,gBAAgB;AAEzD,QAAI,IAAI,KAAK;AACb,QAAIG,KAAI,KAAK;AAMb,UAAM,KAAK,UAAUH,IAAG,KAAK,IAAI;AACjC,aAASE,UAAS,GAAGA,UAAS,GAAG,SAASA,WAAU;AAElD,YAAM,EAAE,OAAO,QAAQ,QAAQ,OAAO,QAAQ,QAAO,IAAK,YAAY,GAAGA,SAAQ,EAAE;AACnF,UAAI;AACJ,UAAI,QAAQ;AAGV,QAAAC,KAAIA,GAAE,IAAI,SAAS,QAAQ,YAAY,OAAO,CAAC,CAAC;MAClD,OAAO;AAEL,YAAI,EAAE,IAAI,SAAS,OAAO,YAAY,MAAM,CAAC,CAAC;MAChD;IACF;AACA,YAAQ,CAAC;AAIT,WAAO,EAAE,GAAG,GAAAA,GAAC;EACf;;;;;;;EAQQ,WACNH,IACA,aACA,GACA,MAAgB,KAAK,MAAI;AAEzB,UAAM,KAAK,UAAUA,IAAG,KAAK,IAAI;AACjC,aAASE,UAAS,GAAGA,UAAS,GAAG,SAASA,WAAU;AAClD,UAAI,MAAMN;AAAK;AACf,YAAM,EAAE,OAAO,QAAQ,QAAQ,MAAK,IAAK,YAAY,GAAGM,SAAQ,EAAE;AAClE,UAAI;AACJ,UAAI,QAAQ;AAGV;MACF,OAAO;AACL,cAAM,OAAO,YAAY,MAAM;AAC/B,cAAM,IAAI,IAAI,QAAQ,KAAK,OAAM,IAAK,IAAI;MAC5C;IACF;AACA,YAAQ,CAAC;AACT,WAAO;EACT;EAEQ,eAAeF,IAAWD,QAAiB,WAA4B;AAG7E,QAAI,OAAO,iBAAiB,IAAIA,MAAK;AACrC,QAAI,CAAC,MAAM;AACT,aAAO,KAAK,iBAAiBA,QAAOC,EAAC;AACrC,UAAIA,OAAM,GAAG;AAEX,YAAI,OAAO,cAAc;AAAY,iBAAO,UAAU,IAAI;AAC1D,yBAAiB,IAAID,QAAO,IAAI;MAClC;IACF;AACA,WAAO;EACT;EAEA,OACEA,QACA,QACA,WAA4B;AAE5B,UAAMC,KAAI,KAAKD,MAAK;AACpB,WAAO,KAAK,KAAKC,IAAG,KAAK,eAAeA,IAAGD,QAAO,SAAS,GAAG,MAAM;EACtE;EAEA,OAAOA,QAAiB,QAAgB,WAA8B,MAAe;AACnF,UAAMC,KAAI,KAAKD,MAAK;AACpB,QAAIC,OAAM;AAAG,aAAO,KAAK,cAAcD,QAAO,QAAQ,IAAI;AAC1D,WAAO,KAAK,WAAWC,IAAG,KAAK,eAAeA,IAAGD,QAAO,SAAS,GAAG,QAAQ,IAAI;EAClF;;;;EAKA,YAAY,GAAaC,IAAS;AAChC,cAAUA,IAAG,KAAK,IAAI;AACtB,qBAAiB,IAAI,GAAGA,EAAC;AACzB,qBAAiB,OAAO,CAAC;EAC3B;EAEA,SAAS,KAAa;AACpB,WAAO,KAAK,GAAG,MAAM;EACvB;;AAoBI,SAAU,cACdH,QACAE,QACA,IACA,IAAU;AAEV,MAAI,MAAMA;AACV,MAAI,KAAKF,OAAM;AACf,MAAI,KAAKA,OAAM;AACf,SAAO,KAAKD,QAAO,KAAKA,MAAK;AAC3B,QAAI,KAAKE;AAAK,WAAK,GAAG,IAAI,GAAG;AAC7B,QAAI,KAAKA;AAAK,WAAK,GAAG,IAAI,GAAG;AAC7B,UAAM,IAAI,OAAM;AAChB,WAAOA;AACP,WAAOA;EACT;AACA,SAAO,EAAE,IAAI,GAAE;AACjB;AAoLA,SAAS,YAAe,OAAe,OAAyBM,OAAc;AAC5E,MAAI,OAAO;AAIT,QAAI,MAAM,UAAU;AAAO,YAAM,IAAI,MAAM,gDAAgD;AAC3F,kBAAc,KAAK;AACnB,WAAO;EACT,OAAO;AACL,WAAO,MAAM,OAAO,EAAE,MAAAA,MAAI,CAAE;EAC9B;AACF;AAoCM,SAAU,kBACdC,OACA,OACA,YAAoC,CAAA,GACpC,QAAgB;AAEhB,MAAI,WAAW;AAAW,aAASA,UAAS;AAC5C,MAAI,CAAC,SAAS,OAAO,UAAU;AAAU,UAAM,IAAI,MAAM,kBAAkBA,KAAI,eAAe;AAC9F,aAAW,KAAK,CAAC,KAAK,KAAK,GAAG,GAAY;AACxC,UAAM,MAAM,MAAM,CAAC;AACnB,QAAI,EAAE,OAAO,QAAQ,YAAY,MAAMC;AACrC,YAAM,IAAI,MAAM,SAAS,CAAC,0BAA0B;EACxD;AACA,QAAM,KAAK,YAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,QAAM,KAAK,YAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,QAAM,KAAgBD,UAAS,gBAAgB,MAAM;AACrD,QAAM,SAAS,CAAC,MAAM,MAAM,KAAK,EAAE;AACnC,aAAW,KAAK,QAAQ;AAEtB,QAAI,CAAC,GAAG,QAAQ,MAAM,CAAC,CAAC;AACtB,YAAM,IAAI,MAAM,SAAS,CAAC,0CAA0C;EACxE;AACA,UAAQ,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,KAAK,CAAC;AAC9C,SAAO,EAAE,OAAO,IAAI,GAAE;AACxB;AAoBM,SAAU,aACd,iBACA,cAA0C;AAE1C,SAAO,SAAS,OAAO,MAAuB;AAC5C,UAAM,YAAY,gBAAgB,IAAI;AACtC,WAAO,EAAE,WAAW,WAAW,aAAa,SAAS,EAAqB;EAC5E;AACF;;;AC93BM,IAAO,QAAP,MAAY;EAChB;EACA;EACA;EACA;EACA,SAAS;EACD,WAAW;EACX,YAAY;EAEpB,YAAYE,OAAmBC,MAAqB;AAClD,UAAMD,KAAI;AACV,WAAOC,MAAK,QAAW,KAAK;AAC5B,SAAK,QAAQD,MAAK,OAAM;AACxB,QAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,YAAM,IAAI,MAAM,qDAAqD;AACvE,SAAK,WAAW,KAAK,MAAM;AAC3B,SAAK,YAAY,KAAK,MAAM;AAC5B,UAAM,WAAW,KAAK;AACtB,UAAME,OAAM,IAAI,WAAW,QAAQ;AAEnC,IAAAA,KAAI,IAAID,KAAI,SAAS,WAAWD,MAAK,OAAM,EAAG,OAAOC,IAAG,EAAE,OAAM,IAAKA,IAAG;AACxE,aAAS,IAAI,GAAG,IAAIC,KAAI,QAAQ;AAAK,MAAAA,KAAI,CAAC,KAAK;AAC/C,SAAK,MAAM,OAAOA,IAAG;AAGrB,SAAK,QAAQF,MAAK,OAAM;AAExB,aAAS,IAAI,GAAG,IAAIE,KAAI,QAAQ;AAAK,MAAAA,KAAI,CAAC,KAAK,KAAO;AACtD,SAAK,MAAM,OAAOA,IAAG;AACrB,UAAMA,IAAG;EACX;EACA,OAAO,KAAqB;AAC1B,YAAQ,IAAI;AACZ,SAAK,MAAM,OAAO,GAAG;AACrB,WAAO;EACT;EACA,WAAW,KAAqB;AAC9B,YAAQ,IAAI;AACZ,YAAQ,KAAK,IAAI;AACjB,SAAK,WAAW;AAChB,UAAM,MAAM,IAAI,SAAS,GAAG,KAAK,SAAS;AAG1C,SAAK,MAAM,WAAW,GAAG;AACzB,SAAK,MAAM,OAAO,GAAG;AACrB,SAAK,MAAM,WAAW,GAAG;AACzB,SAAK,QAAO;EACd;EACA,SAAM;AACJ,UAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,SAAK,WAAW,GAAG;AACnB,WAAO;EACT;EACA,WAAW,IAAa;AAGtB,WAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,UAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,SAAK;AACL,OAAG,WAAW;AACd,OAAG,YAAY;AACf,OAAG,WAAW;AACd,OAAG,YAAY;AACf,OAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,OAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,WAAO;EACT;EACA,QAAK;AACH,WAAO,KAAK,WAAU;EACxB;EACA,UAAO;AACL,SAAK,YAAY;AACjB,SAAK,MAAM,QAAO;AAClB,SAAK,MAAM,QAAO;EACpB;;AAqBK,IAAM,OAAsC,uBAAK;AACtD,QAAM,SAAS,CACbF,OACAC,MACA,YACqB,IAAI,MAAWD,OAAMC,IAAG,EAAE,OAAO,OAAO,EAAE,OAAM;AACvE,QAAM,SAAS,CAACD,OAAmBC,SACjC,IAAI,MAAWD,OAAMC,IAAG;AAC1B,SAAO;AACT,GAAE;;;ACVF,IAAM,aAAa,CAAC,KAAa,SAAiB,OAAO,OAAO,IAAI,MAAM,CAAC,OAAOE,QAAO;AAenF,SAAU,iBAAiB,GAAW,OAAkB,GAAS;AAMrE,WAAS,UAAU,GAAGC,MAAK,CAAC;AAE5B,QAAM,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI;AAC7B,QAAM,KAAK,WAAW,KAAK,GAAG,CAAC;AAC/B,QAAM,KAAK,WAAW,CAAC,KAAK,GAAG,CAAC;AAGhC,MAAI,KAAK,IAAI,KAAK,KAAK,KAAK;AAC5B,MAAI,KAAK,CAAC,KAAK,KAAK,KAAK;AACzB,QAAM,QAAQ,KAAKA;AACnB,QAAM,QAAQ,KAAKA;AACnB,MAAI;AAAO,SAAK,CAAC;AACjB,MAAI;AAAO,SAAK,CAAC;AAIjB,QAAM,UAAU,QAAQ,KAAK,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC,IAAIC;AACpD,MAAI,KAAKD,QAAO,MAAM,WAAW,KAAKA,QAAO,MAAM,SAAS;AAC1D,UAAM,IAAI,MAAM,0CAA0C;EAC5D;AACA,SAAO,EAAE,OAAO,IAAI,OAAO,GAAE;AAC/B;AAwEA,SAAS,kBAAkB,QAAc;AACvC,MAAI,CAAC,CAAC,WAAW,aAAa,KAAK,EAAE,SAAS,MAAM;AAClD,UAAM,IAAI,MAAM,2DAA2D;AAC7E,SAAO;AACT;AAEA,SAAS,gBACP,MACAE,MAAM;AAEN,iBAAe,IAAI;AACnB,QAAM,QAAQ,CAAA;AAId,WAAS,WAAW,OAAO,KAAKA,IAAG,GAAkB;AAEnD,UAAM,OAAO,IAAI,KAAK,OAAO,MAAM,SAAYA,KAAI,OAAO,IAAI,KAAK,OAAO;EAC5E;AACA,QAAM,MAAM,MAAO,MAAM;AACzB,QAAM,MAAM,SAAU,SAAS;AAC/B,MAAI,MAAM,WAAW;AAAW,sBAAkB,MAAM,MAAM;AAC9D,SAAO;AACT;AA2NM,IAAO,SAAP,cAAsB,MAAK;EAC/B,YAAY,IAAI,IAAE;AAChB,UAAM,CAAC;EACT;;AA4EK,IAAM,MAAY;;EAEvB,KAAK;;EAEL,MAAM;IACJ,QAAQ,CAAC,KAAa,SAAwB;AAC5C,YAAM,EAAE,KAAK,EAAC,IAAK;AACnB,kBAAY,KAAK,KAAK;AACtB,UAAI,MAAM,KAAK,MAAM;AAAK,cAAM,IAAI,EAAE,uBAAuB;AAC7D,UAAI,OAAO,SAAS;AAClB,cAAM,IAAI,UAAU,sCAAsC,OAAO,IAAI;AAGvE,UAAI,KAAK,SAAS;AAAG,cAAM,IAAI,EAAE,2BAA2B;AAC5D,YAAM,UAAU,KAAK,SAAS;AAC9B,YAAM,MAAM,oBAAoB,OAAO;AACvC,UAAK,IAAI,SAAS,IAAK;AAAa,cAAM,IAAI,EAAE,sCAAsC;AAEtF,YAAM,SAAS,UAAU,MAAM,oBAAqB,IAAI,SAAS,IAAK,GAAW,IAAI;AACrF,YAAM,IAAI,oBAAoB,GAAG;AACjC,aAAO,IAAI,SAAS,MAAM;IAC5B;;IAEA,OAAO,KAAa,MAAsB;AACxC,YAAM,EAAE,KAAK,EAAC,IAAK;AACnB,aAAOC,QAAO,MAAM,QAAW,UAAU;AACzC,UAAI,MAAM;AACV,UAAI,MAAM,KAAK,MAAM;AAAK,cAAM,IAAI,EAAE,uBAAuB;AAC7D,UAAI,KAAK,SAAS,KAAK,KAAK,KAAK,MAAM;AAAK,cAAM,IAAI,EAAE,uBAAuB;AAC/E,YAAM,QAAQ,KAAK,KAAK;AAExB,YAAM,SAAS,CAAC,EAAE,QAAQ;AAC1B,UAAI,SAAS;AACb,UAAI,CAAC;AAAQ,iBAAS;WACjB;AAEH,cAAM,SAAS,QAAQ;AACvB,YAAI,CAAC;AAAQ,gBAAM,IAAI,EAAE,mDAAmD;AAE5E,YAAI,SAAS;AAAG,gBAAM,IAAI,EAAE,0CAA0C;AACtE,cAAM,cAAc,KAAK,SAAS,KAAK,MAAM,MAAM;AACnD,YAAI,YAAY,WAAW;AAAQ,gBAAM,IAAI,EAAE,uCAAuC;AACtF,YAAI,YAAY,CAAC,MAAM;AAAG,gBAAM,IAAI,EAAE,sCAAsC;AAC5E,mBAAW,KAAK;AAAa,mBAAU,UAAU,IAAK;AACtD,eAAO;AACP,YAAI,SAAS;AAAK,gBAAM,IAAI,EAAE,wCAAwC;MACxE;AACA,YAAM,IAAI,KAAK,SAAS,KAAK,MAAM,MAAM;AACzC,UAAI,EAAE,WAAW;AAAQ,cAAM,IAAI,EAAE,gCAAgC;AACrE,aAAO,EAAE,GAAG,GAAG,KAAK,SAAS,MAAM,MAAM,EAAC;IAC5C;;;;;;EAMF,MAAM;IACJ,OAAO,KAAW;AAChB,YAAM,EAAE,KAAK,EAAC,IAAK;AACnB,iBAAW,GAAG;AACd,UAAI,MAAMH;AAAK,cAAM,IAAI,EAAE,4CAA4C;AACvE,UAAI,MAAM,oBAAoB,GAAG;AAEjC,UAAI,OAAO,SAAS,IAAI,CAAC,GAAG,EAAE,IAAI;AAAQ,cAAM,OAAO;AACvD,UAAI,IAAI,SAAS;AAAG,cAAM,IAAI,EAAE,gDAAgD;AAChF,aAAO;IACT;IACA,OAAO,MAAsB;AAC3B,YAAM,EAAE,KAAK,EAAC,IAAK;AACnB,UAAI,KAAK,SAAS;AAAG,cAAM,IAAI,EAAE,kCAAkC;AACnE,UAAI,KAAK,CAAC,IAAI;AAAa,cAAM,IAAI,EAAE,qCAAqC;AAE5E,UAAI,KAAK,SAAS,KAAK,KAAK,CAAC,MAAM,KAAQ,EAAE,KAAK,CAAC,IAAI;AACrD,cAAM,IAAI,EAAE,qDAAqD;AACnE,aAAO,gBAAgB,IAAI;IAC7B;;EAEF,MAAM,OAAuB;AAE3B,UAAM,EAAE,KAAK,GAAG,MAAM,KAAK,MAAM,IAAG,IAAK;AACzC,UAAM,OAAOG,QAAO,OAAO,QAAW,WAAW;AACjD,UAAM,EAAE,GAAG,UAAU,GAAG,aAAY,IAAK,IAAI,OAAO,IAAM,IAAI;AAC9D,QAAI,aAAa;AAAQ,YAAM,IAAI,EAAE,6CAA6C;AAClF,UAAM,EAAE,GAAG,QAAQ,GAAG,WAAU,IAAK,IAAI,OAAO,GAAM,QAAQ;AAC9D,UAAM,EAAE,GAAG,QAAQ,GAAG,WAAU,IAAK,IAAI,OAAO,GAAM,UAAU;AAChE,QAAI,WAAW;AAAQ,YAAM,IAAI,EAAE,6CAA6C;AAChF,WAAO,EAAE,GAAG,IAAI,OAAO,MAAM,GAAG,GAAG,IAAI,OAAO,MAAM,EAAC;EACvD;EACA,WAAW,KAA6B;AACtC,UAAM,EAAE,MAAM,KAAK,MAAM,IAAG,IAAK;AACjC,UAAM,KAAK,IAAI,OAAO,GAAM,IAAI,OAAO,IAAI,CAAC,CAAC;AAC7C,UAAM,KAAK,IAAI,OAAO,GAAM,IAAI,OAAO,IAAI,CAAC,CAAC;AAC7C,UAAM,MAAM,KAAK;AACjB,WAAO,IAAI,OAAO,IAAM,GAAG;EAC7B;;AAEF,OAAO,OAAO,IAAI,IAAI;AACtB,OAAO,OAAO,IAAI,IAAI;AACtB,OAAO,OAAO,GAAG;AAIjB,IAAMH,OAAsB,uBAAO,CAAC;AAApC,IAAuCC,OAAsB,uBAAO,CAAC;AAArE,IAAwEF,OAAsB,uBAAO,CAAC;AAAtG,IAAyGK,OAAsB,uBAAO,CAAC;AAAvI,IAA0IC,OAAsB,uBAAO,CAAC;AA2BlK,SAAU,YACd,QACA,YAAqC,CAAA,GAAE;AAEvC,QAAM,YAAY,kBAAkB,eAAe,QAAQ,SAAS;AACpE,QAAM,KAAK,UAAU;AACrB,QAAM,KAAK,UAAU;AACrB,MAAI,QAAQ,UAAU;AACtB,QAAM,EAAE,GAAG,UAAU,GAAG,YAAW,IAAK;AACxC,iBACE,WACA,CAAA,GACA;IACE,oBAAoB;IACpB,eAAe;IACf,eAAe;IACf,WAAW;IACX,SAAS;IACT,MAAM;GACP;AAKH,QAAM,EAAE,MAAM,mBAAkB,IAAK;AACrC,MAAI,MAAM;AAER,QAAI,CAAC,GAAG,IAAI,MAAM,CAAC,KAAK,OAAO,KAAK,SAAS,YAAY,CAAC,MAAM,QAAQ,KAAK,OAAO,GAAG;AACrF,YAAM,IAAI,MAAM,4DAA4D;IAC9E;EACF;AAEA,QAAM,UAAU,YAAY,IAAuB,EAAE;AAErD,WAAS,+BAA4B;AACnC,QAAI,CAAC,GAAG;AAAO,YAAM,IAAI,MAAM,4DAA4D;EAC7F;AAGA,WAAS,aACP,IACAC,QACAC,eAAqB;AAIrB,QAAI,sBAAsBD,OAAM,IAAG;AAAI,aAAO,WAAW,GAAG,CAAC;AAC7D,UAAM,EAAE,GAAG,EAAC,IAAKA,OAAM,SAAQ;AAC/B,UAAM,KAAK,GAAG,QAAQ,CAAC;AACvB,UAAMC,eAAc,cAAc;AAClC,QAAIA,eAAc;AAChB,mCAA4B;AAC5B,YAAM,WAAW,CAAC,GAAG,MAAO,CAAC;AAC7B,aAAOC,aAAY,QAAQ,QAAQ,GAAG,EAAE;IAC1C,OAAO;AACL,aAAOA,aAAY,WAAW,GAAG,CAAI,GAAG,IAAI,GAAG,QAAQ,CAAC,CAAC;IAC3D;EACF;AACA,WAAS,eAAe,OAAuB;AAC7C,IAAAL,QAAO,OAAO,QAAW,OAAO;AAChC,UAAM,EAAE,WAAW,MAAM,uBAAuB,OAAM,IAAK;AAC3D,UAAM,SAAS,MAAM;AACrB,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,OAAO,MAAM,SAAS,CAAC;AAC7B,QAAI,sBAAsB,WAAW,KAAK,SAAS;AAAM,aAAO,EAAE,GAAG,GAAG,MAAM,GAAG,GAAG,KAAI;AAOxF,QAAI,WAAW,SAAS,SAAS,KAAQ,SAAS,IAAO;AACvD,YAAM,IAAI,GAAG,UAAU,IAAI;AAC3B,UAAI,CAAC,GAAG,QAAQ,CAAC;AAAG,cAAM,IAAI,MAAM,qCAAqC;AACzE,YAAM,KAAK,oBAAoB,CAAC;AAChC,UAAI;AACJ,UAAI;AACF,YAAI,GAAG,KAAK,EAAE;MAChB,SAAS,WAAW;AAClB,cAAM,MAAM,qBAAqB,QAAQ,OAAO,UAAU,UAAU;AACpE,cAAM,IAAI,MAAM,2CAA2C,GAAG;MAChE;AACA,mCAA4B;AAC5B,YAAM,QAAQ,GAAG,MAAO,CAAC;AACzB,YAAM,SAAS,OAAO,OAAO;AAC7B,UAAI,UAAU;AAAO,YAAI,GAAG,IAAI,CAAC;AACjC,aAAO,EAAE,GAAG,EAAC;IACf,WAAW,WAAW,UAAU,SAAS,GAAM;AAE7C,YAAM,IAAI,GAAG;AACb,YAAM,IAAI,GAAG,UAAU,KAAK,SAAS,GAAG,CAAC,CAAC;AAC1C,YAAM,IAAI,GAAG,UAAU,KAAK,SAAS,GAAG,IAAI,CAAC,CAAC;AAC9C,UAAI,CAAC,UAAU,GAAG,CAAC;AAAG,cAAM,IAAI,MAAM,4BAA4B;AAClE,aAAO,EAAE,GAAG,EAAC;IACf,OAAO;AACL,YAAM,IAAI,MACR,yBAAyB,MAAM,yBAAyB,IAAI,oBAAoB,MAAM,EAAE;IAE5F;EACF;AAEA,QAAMM,eAAc,UAAU,YAAY,SAAY,eAAe,UAAU;AAC/E,QAAMC,eAAc,UAAU,cAAc,SAAY,iBAAiB,UAAU;AACnF,WAAS,oBAAoB,GAAI;AAC/B,UAAM,KAAK,GAAG,IAAI,CAAC;AACnB,UAAM,KAAK,GAAG,IAAI,IAAI,CAAC;AACvB,WAAO,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;EACvD;AAIA,WAAS,UAAU,GAAM,GAAI;AAC3B,UAAM,OAAO,GAAG,IAAI,CAAC;AACrB,UAAM,QAAQ,oBAAoB,CAAC;AACnC,WAAO,GAAG,IAAI,MAAM,KAAK;EAC3B;AAKA,MAAI,CAAC,UAAU,MAAM,IAAI,MAAM,EAAE;AAAG,UAAM,IAAI,MAAM,mCAAmC;AAIvF,QAAM,OAAO,GAAG,IAAI,GAAG,IAAI,MAAM,GAAGN,IAAG,GAAGC,IAAG;AAC7C,QAAM,QAAQ,GAAG,IAAI,GAAG,IAAI,MAAM,CAAC,GAAG,OAAO,EAAE,CAAC;AAChD,MAAI,GAAG,IAAI,GAAG,IAAI,MAAM,KAAK,CAAC;AAAG,UAAM,IAAI,MAAM,0BAA0B;AAG3E,WAAS,OAAO,OAAe,GAAM,UAAU,OAAK;AAClD,QAAI,CAAC,GAAG,QAAQ,CAAC,KAAM,WAAW,GAAG,IAAI,CAAC;AAAI,YAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE;AAC7F,WAAO;EACT;AAEA,WAAS,UAAU,OAAc;AAC/B,QAAI,EAAE,iBAAiBM;AAAQ,YAAM,IAAI,MAAM,4BAA4B;EAC7E;AAEA,WAAS,iBAAiB,GAAS;AACjC,QAAI,CAAC,QAAQ,CAAC,KAAK;AAAS,YAAM,IAAI,MAAM,SAAS;AACrD,WAAO,iBAAiB,GAAG,KAAK,SAAS,GAAG,KAAK;EACnD;AAEA,WAAS,WACP,UACA,KACA,KACA,OACA,OAAc;AAEd,UAAM,IAAIA,OAAM,GAAG,IAAI,IAAI,GAAG,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;AACrD,UAAM,SAAS,OAAO,GAAG;AACzB,UAAM,SAAS,OAAO,GAAG;AACzB,WAAO,IAAI,IAAI,GAAG;EACpB;EAOA,MAAMA,OAAK;;IAET,OAAgB,OAAO,IAAIA,OAAM,MAAM,IAAI,MAAM,IAAI,GAAG,GAAG;;IAE3D,OAAgB,OAAO,IAAIA,OAAM,GAAG,MAAM,GAAG,KAAK,GAAG,IAAI;;;IAEzD,OAAgB,KAAK;;IAErB,OAAgB,KAAK;IAEZ;IACA;IACA;;IAGT,YAAY,GAAM,GAAM,GAAI;AAC1B,WAAK,IAAI,OAAO,KAAK,CAAC;AAItB,WAAK,IAAI,OAAO,KAAK,GAAG,IAAI;AAC5B,WAAK,IAAI,OAAO,KAAK,CAAC;AACtB,aAAO,OAAO,IAAI;IACpB;IAEA,OAAO,QAAK;AACV,aAAO;IACT;;IAGA,OAAO,WAAW,GAAiB;AACjC,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,CAAA;AACtB,UAAI,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC;AAAG,cAAM,IAAI,MAAM,sBAAsB;AAClF,UAAI,aAAaA;AAAO,cAAM,IAAI,MAAM,8BAA8B;AAEtE,UAAI,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;AAAG,eAAOA,OAAM;AACzC,aAAO,IAAIA,OAAM,GAAG,GAAG,GAAG,GAAG;IAC/B;IAEA,OAAO,UAAU,OAAuB;AACtC,YAAM,IAAIA,OAAM,WAAWD,aAAYP,QAAO,OAAO,QAAW,OAAO,CAAC,CAAC;AACzE,QAAE,eAAc;AAChB,aAAO;IACT;IAEA,OAAO,QAAQ,KAAW;AACxB,aAAOQ,OAAM,UAAUC,YAAW,GAAG,CAAC;IACxC;IAEA,IAAI,IAAC;AACH,aAAO,KAAK,SAAQ,EAAG;IACzB;IACA,IAAI,IAAC;AACH,aAAO,KAAK,SAAQ,EAAG;IACzB;;;;;;;IAQA,WAAW,aAAqB,GAAG,SAAS,MAAI;AAC9C,WAAK,YAAY,MAAM,UAAU;AACjC,UAAI,CAAC;AAAQ,aAAK,SAASR,IAAG;AAC9B,aAAO;IACT;;;IAIA,iBAAc;AACZ,YAAM,IAAI;AACV,UAAI,EAAE,IAAG,GAAI;AAKX,YAAI,UAAU,sBAAsB,GAAG,IAAI,EAAE,CAAC,KAAK,GAAG,IAAI,EAAE,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,EAAE,CAAC;AAClF;AACF,cAAM,IAAI,MAAM,iBAAiB;MACnC;AAEA,YAAM,EAAE,GAAG,EAAC,IAAK,EAAE,SAAQ;AAC3B,UAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC;AAAG,cAAM,IAAI,MAAM,sCAAsC;AAC5F,UAAI,CAAC,UAAU,GAAG,CAAC;AAAG,cAAM,IAAI,MAAM,mCAAmC;AACzE,UAAI,CAAC,EAAE,cAAa;AAAI,cAAM,IAAI,MAAM,wCAAwC;IAClF;IAEA,WAAQ;AACN,YAAM,EAAE,EAAC,IAAK,KAAK,SAAQ;AAC3B,UAAI,CAAC,GAAG;AAAO,cAAM,IAAI,MAAM,6BAA6B;AAC5D,aAAO,CAAC,GAAG,MAAM,CAAC;IACpB;;IAGA,OAAO,OAA0B;AAC/B,gBAAU,KAAK;AACf,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAM,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;AAChD,YAAM,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;AAChD,aAAO,MAAM;IACf;;IAGA,SAAM;AACJ,aAAO,IAAIO,OAAM,KAAK,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;IACjD;;;;;IAMA,SAAM;AACJ,YAAM,EAAE,GAAG,EAAC,IAAK;AACjB,YAAM,KAAK,GAAG,IAAI,GAAGP,IAAG;AACxB,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,UAAI,KAAK,GAAG,MAAM,KAAK,GAAG,MAAM,KAAK,GAAG;AACxC,UAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,GAAG,EAAE;AACjB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,GAAG,EAAE;AACjB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,GAAG,EAAE;AACjB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAO,IAAIO,OAAM,IAAI,IAAI,EAAE;IAC7B;;;;;IAMA,IAAI,OAA0B;AAC5B,gBAAU,KAAK;AACf,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,UAAI,KAAK,GAAG,MAAM,KAAK,GAAG,MAAM,KAAK,GAAG;AACxC,YAAM,IAAI,MAAM;AAChB,YAAM,KAAK,GAAG,IAAI,MAAM,GAAGP,IAAG;AAC9B,UAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,UAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,GAAG,EAAE;AACjB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,GAAG,EAAE;AACjB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,GAAG,EAAE;AACjB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,WAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAO,IAAIO,OAAM,IAAI,IAAI,EAAE;IAC7B;IAEA,SAAS,OAA0B;AAGjC,gBAAU,KAAK;AACf,aAAO,KAAK,IAAI,MAAM,OAAM,CAAE;IAChC;IAEA,MAAG;AACD,aAAO,KAAK,OAAOA,OAAM,IAAI;IAC/B;;;;;;;;;;IAWA,SAAS,QAAc;AACrB,YAAM,EAAE,MAAAE,MAAI,IAAK;AAIjB,UAAI,CAAC,GAAG,YAAY,MAAM;AAAG,cAAM,IAAI,WAAW,8BAA8B;AAChF,UAAIP,QAAc;AAClB,YAAMQ,OAAM,CAAC,MAAc,KAAK,OAAO,MAAM,GAAG,CAAC,MAAM,WAAWH,QAAO,CAAC,CAAC;AAE3E,UAAIE,OAAM;AACR,cAAM,EAAE,OAAO,IAAI,OAAO,GAAE,IAAK,iBAAiB,MAAM;AACxD,cAAM,EAAE,GAAG,KAAK,GAAG,IAAG,IAAKC,KAAI,EAAE;AACjC,cAAM,EAAE,GAAG,KAAK,GAAG,IAAG,IAAKA,KAAI,EAAE;AACjC,eAAO,IAAI,IAAI,GAAG;AAClB,QAAAR,SAAQ,WAAWO,MAAK,MAAM,KAAK,KAAK,OAAO,KAAK;MACtD,OAAO;AACL,cAAM,EAAE,GAAG,GAAAE,GAAC,IAAKD,KAAI,MAAM;AAC3B,QAAAR,SAAQ;AACR,eAAOS;MACT;AAEA,aAAO,WAAWJ,QAAO,CAACL,QAAO,IAAI,CAAC,EAAE,CAAC;IAC3C;;;;;;IAOA,eAAe,QAAc;AAC3B,YAAM,EAAE,MAAAO,MAAI,IAAK;AACjB,YAAM,IAAI;AACV,YAAM,KAAK;AAGX,UAAI,CAAC,GAAG,QAAQ,EAAE;AAAG,cAAM,IAAI,WAAW,8BAA8B;AACxE,UAAI,OAAOb,QAAO,EAAE,IAAG;AAAI,eAAOW,OAAM;AACxC,UAAI,OAAOV;AAAK,eAAO;AACvB,UAAI,KAAK,SAAS,IAAI;AAAG,eAAO,KAAK,SAAS,EAAE;AAGhD,UAAIY,OAAM;AACR,cAAM,EAAE,OAAO,IAAI,OAAO,GAAE,IAAK,iBAAiB,EAAE;AACpD,cAAM,EAAE,IAAI,GAAE,IAAK,cAAcF,QAAO,GAAG,IAAI,EAAE;AACjD,eAAO,WAAWE,MAAK,MAAM,IAAI,IAAI,OAAO,KAAK;MACnD,OAAO;AACL,eAAO,KAAK,OAAO,GAAG,EAAE;MAC1B;IACF;;;;;;IAOA,SAAS,WAAa;AACpB,YAAM,IAAI;AACV,UAAI,KAAK;AACT,YAAM,EAAE,GAAG,GAAG,EAAC,IAAK;AAEpB,UAAI,GAAG,IAAI,GAAG,GAAG,GAAG;AAAG,eAAO,EAAE,GAAG,GAAG,GAAG,EAAC;AAC1C,YAAM,MAAM,EAAE,IAAG;AAGjB,UAAI,MAAM;AAAM,aAAK,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;AAC5C,YAAM,IAAI,GAAG,IAAI,GAAG,EAAE;AACtB,YAAM,IAAI,GAAG,IAAI,GAAG,EAAE;AACtB,YAAM,KAAK,GAAG,IAAI,GAAG,EAAE;AACvB,UAAI;AAAK,eAAO,EAAE,GAAG,GAAG,MAAM,GAAG,GAAG,KAAI;AACxC,UAAI,CAAC,GAAG,IAAI,IAAI,GAAG,GAAG;AAAG,cAAM,IAAI,MAAM,kBAAkB;AAC3D,aAAO,EAAE,GAAG,EAAC;IACf;;;;;IAMA,gBAAa;AACX,YAAM,EAAE,cAAa,IAAK;AAC1B,UAAI,aAAaZ;AAAK,eAAO;AAC7B,UAAI;AAAe,eAAO,cAAcU,QAAO,IAAI;AACnD,aAAO,KAAK,OAAO,MAAM,WAAW,EAAE,IAAG;IAC3C;IAEA,gBAAa;AACX,YAAM,EAAE,cAAa,IAAK;AAC1B,UAAI,aAAaV;AAAK,eAAO;AAC7B,UAAI;AAAe,eAAO,cAAcU,QAAO,IAAI;AAInD,aAAO,KAAK,eAAe,QAAQ;IACrC;IAEA,eAAY;AACV,UAAI,aAAaV;AAAK,eAAO,KAAK,IAAG;AACrC,aAAO,KAAK,cAAa,EAAG,IAAG;IACjC;IAEA,QAAQM,gBAAe,MAAI;AACzB,YAAMA,eAAc,cAAc;AAGlC,WAAK,eAAc;AACnB,aAAOE,aAAYE,QAAO,MAAMJ,aAAY;IAC9C;IAEA,MAAMA,gBAAe,MAAI;AACvB,aAAOS,YAAW,KAAK,QAAQT,aAAY,CAAC;IAC9C;IAEA,WAAQ;AACN,aAAO,UAAU,KAAK,IAAG,IAAK,SAAS,KAAK,MAAK,CAAE;IACrD;;AAEF,QAAM,OAAO,GAAG;AAChB,QAAM,OAAO,IAAI,KAAKI,QAAO,UAAU,OAAO,KAAK,KAAK,OAAO,CAAC,IAAI,IAAI;AAGxE,MAAI,QAAQ;AAAG,IAAAA,OAAM,KAAK,WAAW,CAAC;AACtC,SAAO,OAAOA,OAAM,SAAS;AAC7B,SAAO,OAAOA,MAAK;AACnB,SAAOA;AACT;AA6DA,SAAS,QAAQ,UAAiB;AAChC,SAAO,WAAW,GAAG,WAAW,IAAO,CAAI;AAC7C;AA4LA,SAAS,YAAe,IAAqB,IAAwB;AACnE,SAAO;IACL,WAAW,GAAG;IACd,WAAW,IAAI,GAAG;IAClB,uBAAuB,IAAI,IAAI,GAAG;IAClC,oBAAoB;;;IAGpB,WAAW,IAAI,GAAG;;AAEtB;AAoBM,SAAU,KACdM,QACA,WAA+E,CAAA,GAAE;AAEjF,QAAM,EAAE,GAAE,IAAKA;AACf,QAAM,eAAe,SAAS,gBAAgB,SAAYC,eAAgB,SAAS;AAGnF,QAAM,UAAU,OAAO,OAAO,YAAYD,OAAM,IAAI,EAAE,GAAG;IACvD,MAAM,KAAK,IAAI,iBAAiB,GAAG,KAAK,GAAG,EAAE;GAC9C;AAED,WAAS,iBAAiB,WAA2B;AACnD,QAAI;AACF,YAAM,MAAM,GAAG,UAAU,SAAS;AAClC,aAAO,GAAG,YAAY,GAAG;IAC3B,SAASE,QAAO;AACd,aAAO;IACT;EACF;AAEA,WAAS,iBAAiB,WAA6BC,eAAsB;AAC3E,UAAM,EAAE,WAAW,MAAM,sBAAqB,IAAK;AACnD,QAAI;AACF,YAAM,IAAI,UAAU;AACpB,UAAIA,kBAAiB,QAAQ,MAAM;AAAM,eAAO;AAChD,UAAIA,kBAAiB,SAAS,MAAM;AAAuB,eAAO;AAClE,aAAO,CAAC,CAACH,OAAM,UAAU,SAAS;IACpC,SAASE,QAAO;AACd,aAAO;IACT;EACF;AAMA,WAAS,gBAAgB,MAAuB;AAC9C,WAAO,SAAS,SAAY,aAAa,QAAQ,IAAI,IAAI;AACzD,WAAO,eAAeE,QAAO,MAAM,QAAQ,MAAM,MAAM,GAAG,GAAG,KAAK;EACpE;AAOA,WAAS,aAAa,WAA6BD,gBAAe,MAAI;AACpE,WAAOH,OAAM,KAAK,SAAS,GAAG,UAAU,SAAS,CAAC,EAAE,QAAQG,aAAY;EAC1E;AAKA,WAAS,UAAU,MAAsB;AACvC,UAAM,EAAE,WAAW,WAAW,sBAAqB,IAAK;AACxD,UAAM,iBAAkB,GAAwC;AAChE,QAAI,CAACE,SAAQ,IAAI;AAAG,aAAO;AAC3B,UAAM,IAAID,QAAO,MAAM,QAAW,KAAK,EAAE;AACzC,UAAM,QAAQ,MAAM,aAAa,MAAM;AACvC,UAAM,QAAQ,MAAM,aAAa,CAAC,CAAC,gBAAgB,SAAS,CAAC;AAE7D,QAAI,SAAS;AAAO,aAAO;AAC3B,WAAO;EACT;AAcA,WAAS,gBACP,YACA,YACAD,gBAAe,MAAI;AAEnB,QAAI,UAAU,UAAU,MAAM;AAAM,YAAM,IAAI,MAAM,+BAA+B;AACnF,QAAI,UAAU,UAAU,MAAM;AAAO,YAAM,IAAI,MAAM,+BAA+B;AACpF,UAAMG,KAAI,GAAG,UAAU,UAAU;AACjC,UAAM,IAAIN,OAAM,UAAU,UAAU;AACpC,WAAO,EAAE,SAASM,EAAC,EAAE,QAAQH,aAAY;EAC3C;AAEA,QAAMI,SAAQ;IACZ;IACA;IACA;;AAEF,QAAM,SAAS,aAAa,iBAAiB,YAAY;AACzD,SAAO,OAAOA,MAAK;AACnB,SAAO,OAAO,OAAO;AAErB,SAAO,OAAO,OAAO,EAAE,cAAc,iBAAiB,QAAQ,OAAAP,QAAO,OAAAO,QAAO,QAAO,CAAE;AACvF;AA6BM,SAAU,MACdP,QACAQ,OACA,YAA6B,CAAA,GAAE;AAG/B,QAAM,QAAQA;AACd,QAAM,KAAK;AACX,iBACE,WACA,CAAA,GACA;IACE,MAAM;IACN,MAAM;IACN,aAAa;IACb,UAAU;IACV,eAAe;GAChB;AAEH,cAAY,OAAO,OAAO,CAAA,GAAI,SAAS;AACvC,QAAMP,eAAc,UAAU,gBAAgB,SAAYA,eAAgB,UAAU;AACpF,QAAMQ,QACJ,UAAU,SAAS,SACf,CAACC,MAAuB,QAA0B,KAAU,OAAOA,MAAK,GAAG,IAC1E,UAAU;AAEjB,QAAM,EAAE,IAAI,GAAE,IAAKV;AACnB,QAAM,EAAE,OAAO,aAAa,MAAM,OAAM,IAAK;AAC7C,QAAM,EAAE,QAAQ,cAAc,iBAAiB,OAAAO,QAAO,QAAO,IAAK,KAAKP,QAAO,SAAS;AACvF,QAAM,iBAA0C;IAC9C,SAAS;IACT,MAAM,OAAO,UAAU,SAAS,YAAY,UAAU,OAAO;IAC7D,QAAQ;IACR,cAAc;;AAMhB,QAAM,wBAAwB,cAAcW,OAAMC,OAAM,GAAG;AAE3D,WAAS,sBAAsB,QAAc;AAC3C,UAAM,OAAO,eAAeA;AAC5B,WAAO,SAAS;EAClB;AACA,WAAS,WAAW,OAAe,KAAW;AAC5C,QAAI,CAAC,GAAG,YAAY,GAAG;AACrB,YAAM,IAAI,MAAM,qBAAqB,KAAK,kCAAkC;AAC9E,WAAO;EACT;AACA,WAAS,yBAAsB;AAQ7B,QAAI;AACF,YAAM,IAAI,MAAM,8DAA8D;EAClF;AACA,WAAS,kBAAkB,OAAyB,QAA4B;AAC9E,sBAAkB,MAAM;AACxB,UAAM,OAAO,QAAQ;AACrB,UAAM,QAAQ,WAAW,YAAY,OAAO,WAAW,cAAc,OAAO,IAAI;AAChF,WAAOR,QAAO,OAAO,KAAK;EAC5B;EAKA,MAAMS,WAAS;IACJ;IACA;IACA;IAET,YAAYC,IAAWR,IAAW,UAAiB;AACjD,WAAK,IAAI,WAAW,KAAKQ,EAAC;AAC1B,WAAK,IAAI,WAAW,KAAKR,EAAC;AAC1B,UAAI,YAAY,MAAM;AACpB,+BAAsB;AACtB,YAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAAS,QAAQ;AAAG,gBAAM,IAAI,MAAM,qBAAqB;AAC3E,aAAK,WAAW;MAClB;AACA,aAAO,OAAO,IAAI;IACpB;IAEA,OAAO,UACL,OACA,SAA+B,eAAe,QAAM;AAEpD,wBAAkB,OAAO,MAAM;AAC/B,UAAI;AACJ,UAAI,WAAW,OAAO;AACpB,cAAM,EAAE,GAAAQ,IAAG,GAAAR,GAAC,IAAK,IAAI,MAAMF,QAAO,KAAK,CAAC;AACxC,eAAO,IAAIS,WAAUC,IAAGR,EAAC;MAC3B;AACA,UAAI,WAAW,aAAa;AAC1B,gBAAQ,MAAM,CAAC;AACf,iBAAS;AACT,gBAAQ,MAAM,SAAS,CAAC;MAC1B;AACA,YAAM,IAAI,QAAQ,YAAa;AAC/B,YAAMQ,KAAI,MAAM,SAAS,GAAG,CAAC;AAC7B,YAAMR,KAAI,MAAM,SAAS,GAAG,IAAI,CAAC;AACjC,aAAO,IAAIO,WAAU,GAAG,UAAUC,EAAC,GAAG,GAAG,UAAUR,EAAC,GAAG,KAAK;IAC9D;IAEA,OAAO,QAAQ,KAAa,QAA6B;AACvD,aAAO,KAAK,UAAUS,YAAW,GAAG,GAAG,MAAM;IAC/C;IAEQ,iBAAc;AACpB,YAAM,EAAE,SAAQ,IAAK;AACrB,UAAI,YAAY;AAAM,cAAM,IAAI,MAAM,sCAAsC;AAC5E,aAAO;IACT;IAEA,eAAe,UAAgB;AAC7B,aAAO,IAAIF,WAAU,KAAK,GAAG,KAAK,GAAG,QAAQ;IAC/C;;;IAIA,iBAAiB,aAA6B;AAC5C,YAAM,EAAE,GAAAC,IAAG,GAAAR,GAAC,IAAK;AACjB,YAAM,WAAW,KAAK,eAAc;AACpC,YAAM,OAAO,aAAa,KAAK,aAAa,IAAIQ,KAAI,cAAcA;AAClE,UAAI,CAAC,GAAG,QAAQ,IAAI;AAAG,cAAM,IAAI,MAAM,2CAA2C;AAClF,YAAM,IAAI,GAAG,QAAQ,IAAI;AACzB,YAAME,KAAIhB,OAAM,UAAUiB,aAAY,SAAS,WAAW,OAAO,CAAC,GAAG,CAAC,CAAC;AACvE,YAAM,KAAK,GAAG,IAAI,IAAI;AACtB,YAAM,IAAI,cAAcb,QAAO,aAAa,QAAW,SAAS,CAAC;AACjE,YAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE;AAC5B,YAAM,KAAK,GAAG,OAAOE,KAAI,EAAE;AAE3B,YAAM,IAAIN,OAAM,KAAK,eAAe,EAAE,EAAE,IAAIgB,GAAE,eAAe,EAAE,CAAC;AAChE,UAAI,EAAE,IAAG;AAAI,cAAM,IAAI,MAAM,qCAAqC;AAClE,QAAE,eAAc;AAChB,aAAO;IACT;;IAGA,WAAQ;AACN,aAAO,sBAAsB,KAAK,CAAC;IACrC;IAEA,QAAQ,SAA+B,eAAe,QAAM;AAC1D,wBAAkB,MAAM;AACxB,UAAI,WAAW;AAAO,eAAOD,YAAW,IAAI,WAAW,IAAI,CAAC;AAC5D,YAAM,EAAE,GAAAD,IAAG,GAAAR,GAAC,IAAK;AACjB,YAAM,KAAK,GAAG,QAAQQ,EAAC;AACvB,YAAM,KAAK,GAAG,QAAQR,EAAC;AACvB,UAAI,WAAW,aAAa;AAC1B,+BAAsB;AACtB,eAAOW,aAAY,WAAW,GAAG,KAAK,eAAc,CAAE,GAAG,IAAI,EAAE;MACjE;AACA,aAAOA,aAAY,IAAI,EAAE;IAC3B;IAEA,MAAM,QAA6B;AACjC,aAAOC,YAAW,KAAK,QAAQ,MAAM,CAAC;IACxC;;AAGF,SAAO,OAAOL,WAAU,SAAS;AACjC,SAAO,OAAOA,UAAS;AAMvB,QAAM,WACJ,UAAU,aAAa,SACnB,SAAS,aAAa,OAAuB;AAE3C,QAAI,MAAM,SAAS;AAAM,YAAM,IAAI,MAAM,oBAAoB;AAG7D,UAAM,MAAM,gBAAgB,KAAK;AACjC,UAAM,QAAQ,MAAM,SAAS,IAAI;AACjC,WAAO,QAAQ,IAAI,OAAO,OAAO,KAAK,IAAI;EAC5C,IACC,UAAU;AACjB,QAAM,gBACJ,UAAU,kBAAkB,SACxB,SAAS,kBAAkB,OAAuB;AAChD,WAAO,GAAG,OAAO,SAAS,KAAK,CAAC;EAClC,IACC,UAAU;AACjB,QAAM,aAAa,QAAQ,MAAM;AAGjC,WAAS,WAAW,KAAW;AAC7B,aAAS,aAAa,QAAQ,KAAKM,MAAK,UAAU;AAClD,WAAO,GAAG,QAAQ,GAAG;EACvB;AAEA,WAAS,mBAAmB,SAA2B,SAAgB;AACrE,IAAAf,QAAO,SAAS,QAAW,SAAS;AACpC,WACE,UAAUA,QAAO,MAAM,OAAO,GAAG,QAAW,mBAAmB,IAAI;EAEvE;AAUA,WAAS,QACP,SACA,WACA,MAAyB;AAEzB,UAAM,EAAE,MAAM,SAAS,aAAY,IAAK,gBAAgB,MAAM,cAAc;AAC5E,cAAU,mBAAmB,SAAS,OAAO;AAI7C,UAAM,QAAQ,cAAc,OAAO;AACnC,UAAM,IAAI,GAAG,UAAU,SAAS;AAChC,QAAI,CAAC,GAAG,YAAY,CAAC;AAAG,YAAM,IAAI,MAAM,qBAAqB;AAC7D,UAAM,WAA+B,CAAC,WAAW,CAAC,GAAG,WAAW,KAAK,CAAC;AAEtE,QAAI,gBAAgB,QAAQ,iBAAiB,OAAO;AAGlD,YAAM,IAAI,iBAAiB,OAAOH,aAAY,QAAQ,SAAS,IAAI;AACnE,eAAS,KAAKG,QAAO,GAAG,QAAW,cAAc,CAAC;IACpD;AACA,UAAM,OAAOa,aAAY,GAAG,QAAQ;AACpC,UAAM,IAAI;AASV,aAAS,MAAM,QAAwB;AAGrC,YAAM,IAAI,SAAS,MAAM;AACzB,UAAI,CAAC,GAAG,YAAY,CAAC;AAAG;AACxB,YAAM,KAAK,GAAG,IAAI,CAAC;AACnB,YAAM,IAAIjB,OAAM,KAAK,SAAS,CAAC,EAAE,SAAQ;AACzC,YAAMc,KAAI,GAAG,OAAO,EAAE,CAAC;AACvB,UAAIA,OAAMK;AAAK;AACf,YAAMb,KAAI,GAAG,OAAO,KAAK,GAAG,OAAO,IAAIQ,KAAI,CAAC,CAAC;AAC7C,UAAIR,OAAMa;AAAK;AACf,UAAI,YAAY,EAAE,MAAML,KAAI,IAAI,KAAK,OAAO,EAAE,IAAIF,IAAG;AACrD,UAAI,QAAQN;AACZ,UAAI,QAAQ,sBAAsBA,EAAC,GAAG;AACpC,gBAAQ,GAAG,IAAIA,EAAC;AAChB,oBAAY;MACd;AACA,aAAO,IAAIO,WAAUC,IAAG,OAAO,wBAAwB,SAAY,QAAQ;IAC7E;AACA,WAAO,EAAE,MAAM,MAAK;EACtB;AAeA,WAASM,MACP,SACA,WACA,OAA4B,CAAA,GAAE;AAE9B,UAAM,EAAE,MAAM,MAAK,IAAK,QAAQ,SAAS,WAAW,IAAI;AACxD,UAAM,OAAO,eAA0B,MAAM,WAAW,GAAG,OAAOX,KAAI;AACtE,UAAM,MAAM,KAAK,MAAM,KAAK;AAC5B,WAAO,IAAI,QAAQ,KAAK,MAAM;EAChC;AAeA,WAASY,QACPC,YACA,SACA,WACA,OAA8B,CAAA,GAAE;AAEhC,UAAM,EAAE,MAAM,SAAS,OAAM,IAAK,gBAAgB,MAAM,cAAc;AACtE,gBAAYlB,QAAO,WAAW,QAAW,WAAW;AACpD,cAAU,mBAAmB,SAAS,OAAO;AAC7C,QAAI,CAACC,SAAQiB,UAAgB,GAAG;AAC9B,YAAM,MAAMA,sBAAqBT,aAAY,wBAAwB;AACrE,YAAM,IAAI,MAAM,wCAAwC,GAAG;IAC7D;AACA,sBAAkBS,YAAW,MAAM;AACnC,QAAI;AACF,YAAM,MAAMT,WAAU,UAAUS,YAAW,MAAM;AACjD,YAAM,IAAItB,OAAM,UAAU,SAAS;AACnC,UAAI,QAAQ,IAAI,SAAQ;AAAI,eAAO;AACnC,YAAM,EAAE,GAAAc,IAAG,GAAAR,GAAC,IAAK;AACjB,YAAM,IAAI,cAAc,OAAO;AAC/B,YAAM,KAAK,GAAG,IAAIA,EAAC;AACnB,YAAM,KAAK,GAAG,OAAO,IAAI,EAAE;AAC3B,YAAM,KAAK,GAAG,OAAOQ,KAAI,EAAE;AAC3B,YAAME,KAAIhB,OAAM,KAAK,eAAe,EAAE,EAAE,IAAI,EAAE,eAAe,EAAE,CAAC;AAChE,UAAIgB,GAAE,IAAG;AAAI,eAAO;AACpB,YAAM,IAAI,GAAG,OAAOA,GAAE,CAAC;AACvB,aAAO,MAAMF;IACf,SAAS,GAAG;AACV,aAAO;IACT;EACF;AAEA,WAAS,iBACPQ,YACA,SACA,OAA+B,CAAA,GAAE;AAIjC,UAAM,EAAE,QAAO,IAAK,gBAAgB,MAAM,cAAc;AACxD,cAAU,mBAAmB,SAAS,OAAO;AAC7C,WAAOT,WAAU,UAAUS,YAAW,WAAW,EAAE,iBAAiB,OAAO,EAAE,QAAO;EACtF;AAEA,SAAO,OAAO,OAAO;IACnB;IACA;IACA;IACA,OAAAf;IACA;IACA,OAAAP;IACA,MAAAoB;IACA,QAAAC;IACA;IACA,WAAAR;IACA,MAAM;GACP;AACH;;;AC73DA,IAAM,kBAA2C;EAC/C,GAAG,OAAO,oEAAoE;EAC9E,GAAG,OAAO,oEAAoE;EAC9E,GAAG,OAAO,CAAC;EACX,GAAG,OAAO,CAAC;EACX,GAAG,OAAO,CAAC;EACX,IAAI,OAAO,oEAAoE;EAC/E,IAAI,OAAO,oEAAoE;;AAGjF,IAAM,iBAAmC;EACvC,MAAM,OAAO,oEAAoE;EACjF,SAAS;IACP,CAAC,OAAO,oCAAoC,GAAG,CAAC,OAAO,oCAAoC,CAAC;IAC5F,CAAC,OAAO,qCAAqC,GAAG,OAAO,oCAAoC,CAAC;;;AAKhG,IAAMU,OAAsB,uBAAO,CAAC;AAMpC,SAAS,QAAQ,GAAS;AACxB,QAAM,IAAI,gBAAgB;AAE1B,QAAMC,OAAM,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAE3E,QAAM,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAC5D,QAAM,KAAM,IAAI,IAAI,IAAK;AACzB,QAAM,KAAM,KAAK,KAAK,IAAK;AAC3B,QAAM,KAAM,KAAK,IAAIA,MAAK,CAAC,IAAI,KAAM;AACrC,QAAM,KAAM,KAAK,IAAIA,MAAK,CAAC,IAAI,KAAM;AACrC,QAAM,MAAO,KAAK,IAAID,MAAK,CAAC,IAAI,KAAM;AACtC,QAAM,MAAO,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,MAAO,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,MAAO,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,OAAQ,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AAC1C,QAAM,OAAQ,KAAK,MAAM,MAAM,CAAC,IAAI,MAAO;AAC3C,QAAM,OAAQ,KAAK,MAAMC,MAAK,CAAC,IAAI,KAAM;AACzC,QAAM,KAAM,KAAK,MAAM,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,KAAM,KAAK,IAAI,KAAK,CAAC,IAAI,KAAM;AACrC,QAAMC,QAAO,KAAK,IAAIF,MAAK,CAAC;AAC5B,MAAI,CAAC,KAAK,IAAI,KAAK,IAAIE,KAAI,GAAG,CAAC;AAAG,UAAM,IAAI,MAAM,yBAAyB;AAC3E,SAAOA;AACT;AAEA,IAAM,OAAO,MAAM,gBAAgB,GAAG,EAAE,MAAM,QAAO,CAAE;AACvD,IAAM,UAA0B,4BAAY,iBAAiB;EAC3D,IAAI;EACJ,MAAM;CACP;AAqBM,IAAM,YAAmC,sBAAM,SAAS,MAAM;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClHrE,SAAA,aAAqB;AACrB,SAAA,cAAsB;AACtB,SAAA,gBAAwB;AAExB,IAAI,SAAS,CAAA;AACb,IAAI,YAAY,CAAA;AAChB,IAAI,MAAM,OAAO,eAAe,cAAc,aAAa;AAE3D,IAAI,OAAO;AACX,KAAS,IAAI,GAAG,MAAM,KAAK,QAAQ,IAAI,KAAK,EAAE,GAAG;AAC/C,SAAO,CAAC,IAAI,KAAK,CAAC;AAClB,YAAU,KAAK,WAAW,CAAC,CAAC,IAAI;AAClC;AAHS;AAAO;AAOhB,UAAU,IAAI,WAAW,CAAC,CAAC,IAAI;AAC/B,UAAU,IAAI,WAAW,CAAC,CAAC,IAAI;AAE/B,SAAS,QAAS,KAAK;AACrB,MAAI,MAAM,IAAI;AAEd,MAAI,MAAM,IAAI,GAAG;AACf,UAAM,IAAI,MAAM,gDAAgD;EACpE;AAIE,MAAI,WAAW,IAAI,QAAQ,GAAG;AAC9B,MAAI,aAAa,GAAI,YAAW;AAEhC,MAAI,kBAAkB,aAAa,MAC/B,IACA,IAAK,WAAW;AAEpB,SAAO,CAAC,UAAU,eAAe;AACnC;AAGA,SAAS,WAAY,KAAK;AACxB,MAAI,OAAO,QAAQ,GAAG;AACtB,MAAI,WAAW,KAAK,CAAC;AACrB,MAAI,kBAAkB,KAAK,CAAC;AAC5B,UAAS,WAAW,mBAAmB,IAAI,IAAK;AAClD;AAEA,SAAS,YAAa,KAAK,UAAU,iBAAiB;AACpD,UAAS,WAAW,mBAAmB,IAAI,IAAK;AAClD;AAEA,SAAS,YAAa,KAAK;AACzB,MAAI;AACJ,MAAI,OAAO,QAAQ,GAAG;AACtB,MAAI,WAAW,KAAK,CAAC;AACrB,MAAI,kBAAkB,KAAK,CAAC;AAE5B,MAAI,MAAM,IAAI,IAAI,YAAY,KAAK,UAAU,eAAe,CAAC;AAE7D,MAAI,UAAU;AAGd,MAAI,MAAM,kBAAkB,IACxB,WAAW,IACX;AAEJ,MAAI;AACJ,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC3B,UACG,UAAU,IAAI,WAAW,CAAC,CAAC,KAAK,KAChC,UAAU,IAAI,WAAW,IAAI,CAAC,CAAC,KAAK,KACpC,UAAU,IAAI,WAAW,IAAI,CAAC,CAAC,KAAK,IACrC,UAAU,IAAI,WAAW,IAAI,CAAC,CAAC;AACjC,QAAI,SAAS,IAAK,OAAO,KAAM;AAC/B,QAAI,SAAS,IAAK,OAAO,IAAK;AAC9B,QAAI,SAAS,IAAI,MAAM;EAC3B;AAEE,MAAI,oBAAoB,GAAG;AACzB,UACG,UAAU,IAAI,WAAW,CAAC,CAAC,KAAK,IAChC,UAAU,IAAI,WAAW,IAAI,CAAC,CAAC,KAAK;AACvC,QAAI,SAAS,IAAI,MAAM;EAC3B;AAEE,MAAI,oBAAoB,GAAG;AACzB,UACG,UAAU,IAAI,WAAW,CAAC,CAAC,KAAK,KAChC,UAAU,IAAI,WAAW,IAAI,CAAC,CAAC,KAAK,IACpC,UAAU,IAAI,WAAW,IAAI,CAAC,CAAC,KAAK;AACvC,QAAI,SAAS,IAAK,OAAO,IAAK;AAC9B,QAAI,SAAS,IAAI,MAAM;EAC3B;AAEE,SAAO;AACT;AAEA,SAAS,gBAAiB,KAAK;AAC7B,SAAO,OAAO,OAAO,KAAK,EAAI,IAC5B,OAAO,OAAO,KAAK,EAAI,IACvB,OAAO,OAAO,IAAI,EAAI,IACtB,OAAO,MAAM,EAAI;AACrB;AAEA,SAAS,YAAa,OAAO,OAAO,KAAK;AACvC,MAAI;AACJ,MAAI,SAAS,CAAA;AACb,WAAS,IAAI,OAAO,IAAI,KAAK,KAAK,GAAG;AACnC,WACI,MAAM,CAAC,KAAK,KAAM,aAClB,MAAM,IAAI,CAAC,KAAK,IAAK,UACtB,MAAM,IAAI,CAAC,IAAI;AAClB,WAAO,KAAK,gBAAgB,GAAG,CAAC;EACpC;AACE,SAAO,OAAO,KAAK,EAAE;AACvB;AAEA,SAAS,cAAe,OAAO;AAC7B,MAAI;AACJ,MAAI,MAAM,MAAM;AAChB,MAAI,aAAa,MAAM;AACvB,MAAI,QAAQ,CAAA;AACZ,MAAI,iBAAiB;AAGrB,WAAS,IAAI,GAAG,OAAO,MAAM,YAAY,IAAI,MAAM,KAAK,gBAAgB;AACtE,UAAM,KAAK,YAAY,OAAO,GAAI,IAAI,iBAAkB,OAAO,OAAQ,IAAI,cAAe,CAAC;EAC/F;AAGE,MAAI,eAAe,GAAG;AACpB,UAAM,MAAM,MAAM,CAAC;AACnB,UAAM;MACJ,OAAO,OAAO,CAAC,IACf,OAAQ,OAAO,IAAK,EAAI,IACxB;IACN;EACA,WAAa,eAAe,GAAG;AAC3B,WAAO,MAAM,MAAM,CAAC,KAAK,KAAK,MAAM,MAAM,CAAC;AAC3C,UAAM;MACJ,OAAO,OAAO,EAAE,IAChB,OAAQ,OAAO,IAAK,EAAI,IACxB,OAAQ,OAAO,IAAK,EAAI,IACxB;IACN;EACA;AAEE,SAAO,MAAM,KAAK,EAAE;AACtB;;ACpJY,QAAA,OAAG,SAAUC,SAAQ,QAAQC,OAAM,MAAM,QAAQ;AAC3D,MAAI,GAAG;AACP,MAAI,OAAQ,SAAS,IAAK,OAAO;AACjC,MAAI,QAAQ,KAAK,QAAQ;AACzB,MAAI,QAAQ,QAAQ;AACpB,MAAI,QAAQ;AACZ,MAAI,IAAIA,QAAQ,SAAS,IAAK;AAC9B,MAAI,IAAIA,QAAO,KAAK;AACpB,MAAIC,KAAIF,QAAO,SAAS,CAAC;AAEzB,OAAK;AAEL,MAAIE,MAAM,KAAM,CAAC,SAAU;AAC3B,EAAAA,OAAO,CAAC;AACR,WAAS;AACT,SAAO,QAAQ,GAAG,IAAK,IAAI,MAAOF,QAAO,SAAS,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG;EAAA;AAE1E,MAAI,KAAM,KAAM,CAAC,SAAU;AAC3B,QAAO,CAAC;AACR,WAAS;AACT,SAAO,QAAQ,GAAG,IAAK,IAAI,MAAOA,QAAO,SAAS,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG;EAAA;AAE1E,MAAI,MAAM,GAAG;AACX,QAAI,IAAI;EACZ,WAAa,MAAM,MAAM;AACrB,WAAO,IAAI,OAAQE,KAAI,KAAK,KAAK;EACrC,OAAS;AACL,QAAI,IAAI,KAAK,IAAI,GAAG,IAAI;AACxB,QAAI,IAAI;EACZ;AACE,UAAQA,KAAI,KAAK,KAAK,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI;AAChD;AAEA,QAAA,QAAgB,SAAUF,SAAQ,OAAO,QAAQC,OAAM,MAAM,QAAQ;AACnE,MAAI,GAAG,GAAG;AACV,MAAI,OAAQ,SAAS,IAAK,OAAO;AACjC,MAAI,QAAQ,KAAK,QAAQ;AACzB,MAAI,QAAQ,QAAQ;AACpB,MAAI,KAAM,SAAS,KAAK,KAAK,IAAI,GAAG,GAAG,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI;AAC9D,MAAI,IAAIA,QAAO,IAAK,SAAS;AAC7B,MAAI,IAAIA,QAAO,IAAI;AACnB,MAAIC,KAAI,QAAQ,KAAM,UAAU,KAAK,IAAI,QAAQ,IAAK,IAAI;AAE1D,UAAQ,KAAK,IAAI,KAAK;AAEtB,MAAI,MAAM,KAAK,KAAK,UAAU,UAAU;AACtC,QAAI,MAAM,KAAK,IAAI,IAAI;AACvB,QAAI;EACR,OAAS;AACL,QAAI,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG;AACzC,QAAI,SAAS,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG;AACrC;AACA,WAAK;IACX;AACI,QAAI,IAAI,SAAS,GAAG;AAClB,eAAS,KAAK;IACpB,OAAW;AACL,eAAS,KAAK,KAAK,IAAI,GAAG,IAAI,KAAK;IACzC;AACI,QAAI,QAAQ,KAAK,GAAG;AAClB;AACA,WAAK;IACX;AAEI,QAAI,IAAI,SAAS,MAAM;AACrB,UAAI;AACJ,UAAI;IACV,WAAe,IAAI,SAAS,GAAG;AACzB,WAAM,QAAQ,IAAK,KAAK,KAAK,IAAI,GAAG,IAAI;AACxC,UAAI,IAAI;IACd,OAAW;AACL,UAAI,QAAQ,KAAK,IAAI,GAAG,QAAQ,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI;AACrD,UAAI;IACV;EACA;AAEE,SAAO,QAAQ,GAAGF,QAAO,SAAS,CAAC,IAAI,IAAI,KAAM,KAAK,GAAG,KAAK,KAAK,QAAQ,GAAG;EAAA;AAE9E,MAAK,KAAK,OAAQ;AAClB,UAAQ;AACR,SAAO,OAAO,GAAGA,QAAO,SAAS,CAAC,IAAI,IAAI,KAAM,KAAK,GAAG,KAAK,KAAK,QAAQ,GAAG;EAAA;AAE7E,EAAAA,QAAO,SAAS,IAAI,CAAC,KAAKE,KAAI;AAChC;;AC1EA,QAAM,SAASC;AACf,QAAMC,YAAUC;AAChB,QAAM,sBACH,OAAO,WAAW,cAAc,OAAO,OAAO,KAAK,MAAM,aACtD,OAAO,KAAK,EAAE,4BAA4B,IAC1C;AAEN,UAAA,SAAiBC;AACjB,UAAA,aAAqB;AACrB,UAAA,oBAA4B;AAE5B,QAAM,eAAe;AACrB,UAAA,aAAqB;AAgBrB,EAAAA,QAAO,sBAAsB,kBAAiB;AAE9C,MAAI,CAACA,QAAO,uBAAuB,OAAO,YAAY,eAClD,OAAO,QAAQ,UAAU,YAAY;AACvC,YAAQ;MACN;;;AAKJ,WAAS,oBAAqB;AAE5B,QAAI;AACF,YAAM,MAAM,IAAI,WAAW,CAAC;AAC5B,YAAMC,SAAQ,EAAE,KAAK,WAAY;AAAE,eAAO;MAAE,EAAE;AAC9C,aAAO,eAAeA,QAAO,WAAW,SAAS;AACjD,aAAO,eAAe,KAAKA,MAAK;AAChC,aAAO,IAAI,IAAG,MAAO;aACd,GAAG;AACV,aAAO;;;AAIX,SAAO,eAAeD,QAAO,WAAW,UAAU;IAChD,YAAY;IACZ,KAAK,WAAY;AACf,UAAI,CAACA,QAAO,SAAS,IAAI,EAAG,QAAO;AACnC,aAAO,KAAK;;EAEhB,CAAC;AAED,SAAO,eAAeA,QAAO,WAAW,UAAU;IAChD,YAAY;IACZ,KAAK,WAAY;AACf,UAAI,CAACA,QAAO,SAAS,IAAI,EAAG,QAAO;AACnC,aAAO,KAAK;;EAEhB,CAAC;AAED,WAAS,aAAc,QAAQ;AAC7B,QAAI,SAAS,cAAc;AACzB,YAAM,IAAI,WAAW,gBAAgB,SAAS,gCAAgC;;AAGhF,UAAM,MAAM,IAAI,WAAW,MAAM;AACjC,WAAO,eAAe,KAAKA,QAAO,SAAS;AAC3C,WAAO;;AAaT,WAASA,QAAQ,KAAK,kBAAkB,QAAQ;AAE9C,QAAI,OAAO,QAAQ,UAAU;AAC3B,UAAI,OAAO,qBAAqB,UAAU;AACxC,cAAM,IAAI;UACR;;;AAGJ,aAAO,YAAY,GAAG;;AAExB,WAAO,KAAK,KAAK,kBAAkB,MAAM;;AAG3C,EAAAA,QAAO,WAAW;AAElB,WAAS,KAAM,OAAO,kBAAkB,QAAQ;AAC9C,QAAI,OAAO,UAAU,UAAU;AAC7B,aAAO,WAAW,OAAO,gBAAgB;;AAG3C,QAAI,YAAY,OAAO,KAAK,GAAG;AAC7B,aAAO,cAAc,KAAK;;AAG5B,QAAI,SAAS,MAAM;AACjB,YAAM,IAAI;QACR,oHAC0C,OAAO;;;AAIrD,QAAI,WAAW,OAAO,WAAW,KAC5B,SAAS,WAAW,MAAM,QAAQ,WAAW,GAAI;AACpD,aAAO,gBAAgB,OAAO,kBAAkB,MAAM;;AAGxD,QAAI,OAAO,sBAAsB,gBAC5B,WAAW,OAAO,iBAAiB,KACnC,SAAS,WAAW,MAAM,QAAQ,iBAAiB,IAAK;AAC3D,aAAO,gBAAgB,OAAO,kBAAkB,MAAM;;AAGxD,QAAI,OAAO,UAAU,UAAU;AAC7B,YAAM,IAAI;QACR;;;AAIJ,UAAM,UAAU,MAAM,WAAW,MAAM,QAAO;AAC9C,QAAI,WAAW,QAAQ,YAAY,OAAO;AACxC,aAAOA,QAAO,KAAK,SAAS,kBAAkB,MAAM;;AAGtD,UAAM,IAAI,WAAW,KAAK;AAC1B,QAAI,EAAG,QAAO;AAEd,QAAI,OAAO,WAAW,eAAe,OAAO,eAAe,QACvD,OAAO,MAAM,OAAO,WAAW,MAAM,YAAY;AACnD,aAAOA,QAAO,KAAK,MAAM,OAAO,WAAW,EAAE,QAAQ,GAAG,kBAAkB,MAAM;;AAGlF,UAAM,IAAI;MACR,oHAC0C,OAAO;;;AAYrD,EAAAA,QAAO,OAAO,SAAU,OAAO,kBAAkB,QAAQ;AACvD,WAAO,KAAK,OAAO,kBAAkB,MAAM;;AAK7C,SAAO,eAAeA,QAAO,WAAW,WAAW,SAAS;AAC5D,SAAO,eAAeA,SAAQ,UAAU;AAExC,WAASE,YAAY,MAAM;AACzB,QAAI,OAAO,SAAS,UAAU;AAC5B,YAAM,IAAI,UAAU,wCAAwC;IAChE,WAAa,OAAO,GAAG;AACnB,YAAM,IAAI,WAAW,gBAAgB,OAAO,gCAAgC;;;AAIhF,WAAS,MAAO,MAAM,MAAM,UAAU;AACpC,IAAAA,YAAW,IAAI;AACf,QAAI,QAAQ,GAAG;AACb,aAAO,aAAa,IAAI;;AAE1B,QAAI,SAAS,QAAW;AAItB,aAAO,OAAO,aAAa,WACvB,aAAa,IAAI,EAAE,KAAK,MAAM,QAAQ,IACtC,aAAa,IAAI,EAAE,KAAK,IAAI;;AAElC,WAAO,aAAa,IAAI;;AAO1B,EAAAF,QAAO,QAAQ,SAAU,MAAM,MAAM,UAAU;AAC7C,WAAO,MAAM,MAAM,MAAM,QAAQ;;AAGnC,WAAS,YAAa,MAAM;AAC1B,IAAAE,YAAW,IAAI;AACf,WAAO,aAAa,OAAO,IAAI,IAAI,QAAQ,IAAI,IAAI,CAAC;;AAMtD,EAAAF,QAAO,cAAc,SAAU,MAAM;AACnC,WAAO,YAAY,IAAI;;AAKzB,EAAAA,QAAO,kBAAkB,SAAU,MAAM;AACvC,WAAO,YAAY,IAAI;;AAGzB,WAAS,WAAY,QAAQ,UAAU;AACrC,QAAI,OAAO,aAAa,YAAY,aAAa,IAAI;AACnD,iBAAW;;AAGb,QAAI,CAACA,QAAO,WAAW,QAAQ,GAAG;AAChC,YAAM,IAAI,UAAU,uBAAuB,QAAQ;;AAGrD,UAAM,SAASG,YAAW,QAAQ,QAAQ,IAAI;AAC9C,QAAI,MAAM,aAAa,MAAM;AAE7B,UAAM,SAAS,IAAI,MAAM,QAAQ,QAAQ;AAEzC,QAAI,WAAW,QAAQ;AAIrB,YAAM,IAAI,MAAM,GAAG,MAAM;;AAG3B,WAAO;;AAGT,WAAS,cAAe,OAAO;AAC7B,UAAM,SAAS,MAAM,SAAS,IAAI,IAAI,QAAQ,MAAM,MAAM,IAAI;AAC9D,UAAM,MAAM,aAAa,MAAM;AAC/B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK,GAAG;AAClC,UAAI,CAAC,IAAI,MAAM,CAAC,IAAI;;AAEtB,WAAO;;AAGT,WAAS,cAAe,WAAW;AACjC,QAAI,WAAW,WAAW,UAAU,GAAG;AACrC,YAAM,OAAO,IAAI,WAAW,SAAS;AACrC,aAAO,gBAAgB,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;;AAEtE,WAAO,cAAc,SAAS;;AAGhC,WAAS,gBAAiB,OAAO,YAAY,QAAQ;AACnD,QAAI,aAAa,KAAK,MAAM,aAAa,YAAY;AACnD,YAAM,IAAI,WAAW,sCAAsC;;AAG7D,QAAI,MAAM,aAAa,cAAc,UAAU,IAAI;AACjD,YAAM,IAAI,WAAW,sCAAsC;;AAG7D,QAAI;AACJ,QAAI,eAAe,UAAa,WAAW,QAAW;AACpD,YAAM,IAAI,WAAW,KAAK;IAC9B,WAAa,WAAW,QAAW;AAC/B,YAAM,IAAI,WAAW,OAAO,UAAU;IAC1C,OAAS;AACL,YAAM,IAAI,WAAW,OAAO,YAAY,MAAM;;AAIhD,WAAO,eAAe,KAAKH,QAAO,SAAS;AAE3C,WAAO;;AAGT,WAAS,WAAYI,MAAK;AACxB,QAAIJ,QAAO,SAASI,IAAG,GAAG;AACxB,YAAM,MAAM,QAAQA,KAAI,MAAM,IAAI;AAClC,YAAM,MAAM,aAAa,GAAG;AAE5B,UAAI,IAAI,WAAW,GAAG;AACpB,eAAO;;AAGT,MAAAA,KAAI,KAAK,KAAK,GAAG,GAAG,GAAG;AACvB,aAAO;;AAGT,QAAIA,KAAI,WAAW,QAAW;AAC5B,UAAI,OAAOA,KAAI,WAAW,YAAY,YAAYA,KAAI,MAAM,GAAG;AAC7D,eAAO,aAAa,CAAC;;AAEvB,aAAO,cAAcA,IAAG;;AAG1B,QAAIA,KAAI,SAAS,YAAY,MAAM,QAAQA,KAAI,IAAI,GAAG;AACpD,aAAO,cAAcA,KAAI,IAAI;;;AAIjC,WAAS,QAAS,QAAQ;AAGxB,QAAI,UAAU,cAAc;AAC1B,YAAM,IAAI,WAAW,4DACa,aAAa,SAAS,EAAE,IAAI,QAAQ;;AAExE,WAAO,SAAS;;AAGlB,WAAS,WAAY,QAAQ;AAC3B,QAAI,CAAC,UAAU,QAAQ;AACrB,eAAS;;AAEX,WAAOJ,QAAO,MAAM,CAAC,MAAM;;AAG7B,EAAAA,QAAO,WAAW,SAASK,UAAU,GAAG;AACtC,WAAO,KAAK,QAAQ,EAAE,cAAc,QAClC,MAAML,QAAO;;AAGjB,EAAAA,QAAO,UAAU,SAASM,SAAS,GAAG,GAAG;AACvC,QAAI,WAAW,GAAG,UAAU,EAAG,KAAIN,QAAO,KAAK,GAAG,EAAE,QAAQ,EAAE,UAAU;AACxE,QAAI,WAAW,GAAG,UAAU,EAAG,KAAIA,QAAO,KAAK,GAAG,EAAE,QAAQ,EAAE,UAAU;AACxE,QAAI,CAACA,QAAO,SAAS,CAAC,KAAK,CAACA,QAAO,SAAS,CAAC,GAAG;AAC9C,YAAM,IAAI;QACR;;;AAIJ,QAAI,MAAM,EAAG,QAAO;AAEpB,QAAI,IAAI,EAAE;AACV,QAAI,IAAI,EAAE;AAEV,aAAS,IAAI,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,GAAG,IAAI,KAAK,EAAE,GAAG;AAClD,UAAI,EAAE,CAAC,MAAM,EAAE,CAAC,GAAG;AACjB,YAAI,EAAE,CAAC;AACP,YAAI,EAAE,CAAC;AACP;;;AAIJ,QAAI,IAAI,EAAG,QAAO;AAClB,QAAI,IAAI,EAAG,QAAO;AAClB,WAAO;;AAGT,EAAAA,QAAO,aAAa,SAASO,YAAY,UAAU;AACjD,YAAQ,OAAO,QAAQ,EAAE,YAAW,GAAE;MACpC,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO;MACT;AACE,eAAO;;;AAIb,EAAAP,QAAO,SAAS,SAAS,OAAQ,MAAM,QAAQ;AAC7C,QAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,YAAM,IAAI,UAAU,6CAA6C;;AAGnE,QAAI,KAAK,WAAW,GAAG;AACrB,aAAOA,QAAO,MAAM,CAAC;;AAGvB,QAAI;AACJ,QAAI,WAAW,QAAW;AACxB,eAAS;AACT,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,kBAAU,KAAK,CAAC,EAAE;;;AAItB,UAAMN,UAASM,QAAO,YAAY,MAAM;AACxC,QAAI,MAAM;AACV,SAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,UAAI,MAAM,KAAK,CAAC;AAChB,UAAI,WAAW,KAAK,UAAU,GAAG;AAC/B,YAAI,MAAM,IAAI,SAASN,QAAO,QAAQ;AACpC,cAAI,CAACM,QAAO,SAAS,GAAG,EAAG,OAAMA,QAAO,KAAK,GAAG;AAChD,cAAI,KAAKN,SAAQ,GAAG;QAC5B,OAAa;AACL,qBAAW,UAAU,IAAI;YACvBA;YACA;YACA;;;iBAGK,CAACM,QAAO,SAAS,GAAG,GAAG;AAChC,cAAM,IAAI,UAAU,6CAA6C;MACvE,OAAW;AACL,YAAI,KAAKN,SAAQ,GAAG;;AAEtB,aAAO,IAAI;;AAEb,WAAOA;;AAGT,WAASS,YAAY,QAAQ,UAAU;AACrC,QAAIH,QAAO,SAAS,MAAM,GAAG;AAC3B,aAAO,OAAO;;AAEhB,QAAI,YAAY,OAAO,MAAM,KAAK,WAAW,QAAQ,WAAW,GAAG;AACjE,aAAO,OAAO;;AAEhB,QAAI,OAAO,WAAW,UAAU;AAC9B,YAAM,IAAI;QACR,6FACmB,OAAO;;;AAI9B,UAAM,MAAM,OAAO;AACnB,UAAM,YAAa,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM;AAC5D,QAAI,CAAC,aAAa,QAAQ,EAAG,QAAO;AAGpC,QAAI,cAAc;AAClB,eAAS;AACP,cAAQ,UAAQ;QACd,KAAK;QACL,KAAK;QACL,KAAK;AACH,iBAAO;QACT,KAAK;QACL,KAAK;AACH,iBAAO,YAAY,MAAM,EAAE;QAC7B,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;AACH,iBAAO,MAAM;QACf,KAAK;AACH,iBAAO,QAAQ;QACjB,KAAK;AACH,iBAAO,cAAc,MAAM,EAAE;QAC/B;AACE,cAAI,aAAa;AACf,mBAAO,YAAY,KAAK,YAAY,MAAM,EAAE;;AAE9C,sBAAY,KAAK,UAAU,YAAW;AACtC,wBAAc;;;;AAItB,EAAAA,QAAO,aAAaG;AAEpB,WAAS,aAAc,UAAU,OAAO,KAAK;AAC3C,QAAI,cAAc;AASlB,QAAI,UAAU,UAAa,QAAQ,GAAG;AACpC,cAAQ;;AAIV,QAAI,QAAQ,KAAK,QAAQ;AACvB,aAAO;;AAGT,QAAI,QAAQ,UAAa,MAAM,KAAK,QAAQ;AAC1C,YAAM,KAAK;;AAGb,QAAI,OAAO,GAAG;AACZ,aAAO;;AAIT,aAAS;AACT,eAAW;AAEX,QAAI,OAAO,OAAO;AAChB,aAAO;;AAGT,QAAI,CAAC,SAAU,YAAW;AAE1B,WAAO,MAAM;AACX,cAAQ,UAAQ;QACd,KAAK;AACH,iBAAO,SAAS,MAAM,OAAO,GAAG;QAElC,KAAK;QACL,KAAK;AACH,iBAAO,UAAU,MAAM,OAAO,GAAG;QAEnC,KAAK;AACH,iBAAO,WAAW,MAAM,OAAO,GAAG;QAEpC,KAAK;QACL,KAAK;AACH,iBAAO,YAAY,MAAM,OAAO,GAAG;QAErC,KAAK;AACH,iBAAO,YAAY,MAAM,OAAO,GAAG;QAErC,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;AACH,iBAAO,aAAa,MAAM,OAAO,GAAG;QAEtC;AACE,cAAI,YAAa,OAAM,IAAI,UAAU,uBAAuB,QAAQ;AACpE,sBAAY,WAAW,IAAI,YAAW;AACtC,wBAAc;;;;AAWtB,EAAAH,QAAO,UAAU,YAAY;AAE7B,WAAS,KAAM,GAAG,GAAG,GAAG;AACtB,UAAM,IAAI,EAAE,CAAC;AACb,MAAE,CAAC,IAAI,EAAE,CAAC;AACV,MAAE,CAAC,IAAI;;AAGT,EAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,UAAM,MAAM,KAAK;AACjB,QAAI,MAAM,MAAM,GAAG;AACjB,YAAM,IAAI,WAAW,2CAA2C;;AAElE,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,WAAK,MAAM,GAAG,IAAI,CAAC;;AAErB,WAAO;;AAGT,EAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,UAAM,MAAM,KAAK;AACjB,QAAI,MAAM,MAAM,GAAG;AACjB,YAAM,IAAI,WAAW,2CAA2C;;AAElE,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,WAAK,MAAM,GAAG,IAAI,CAAC;AACnB,WAAK,MAAM,IAAI,GAAG,IAAI,CAAC;;AAEzB,WAAO;;AAGT,EAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,UAAM,MAAM,KAAK;AACjB,QAAI,MAAM,MAAM,GAAG;AACjB,YAAM,IAAI,WAAW,2CAA2C;;AAElE,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,WAAK,MAAM,GAAG,IAAI,CAAC;AACnB,WAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AACvB,WAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AACvB,WAAK,MAAM,IAAI,GAAG,IAAI,CAAC;;AAEzB,WAAO;;AAGT,EAAAA,QAAO,UAAU,WAAW,SAASQ,YAAY;AAC/C,UAAM,SAAS,KAAK;AACpB,QAAI,WAAW,EAAG,QAAO;AACzB,QAAI,UAAU,WAAW,EAAG,QAAO,UAAU,MAAM,GAAG,MAAM;AAC5D,WAAO,aAAa,MAAM,MAAM,SAAS;;AAG3C,EAAAR,QAAO,UAAU,iBAAiBA,QAAO,UAAU;AAEnD,EAAAA,QAAO,UAAU,SAAS,SAAS,OAAQ,GAAG;AAC5C,QAAI,CAACA,QAAO,SAAS,CAAC,EAAG,OAAM,IAAI,UAAU,2BAA2B;AACxE,QAAI,SAAS,EAAG,QAAO;AACvB,WAAOA,QAAO,QAAQ,MAAM,CAAC,MAAM;;AAGrC,EAAAA,QAAO,UAAU,UAAU,SAASS,WAAW;AAC7C,QAAI,MAAM;AACV,UAAMC,OAAM,QAAQ;AACpB,UAAM,KAAK,SAAS,OAAO,GAAGA,IAAG,EAAE,QAAQ,WAAW,KAAK,EAAE,KAAI;AACjE,QAAI,KAAK,SAASA,KAAK,QAAO;AAC9B,WAAO,aAAa,MAAM;;AAE5B,MAAI,qBAAqB;AACvB,IAAAV,QAAO,UAAU,mBAAmB,IAAIA,QAAO,UAAU;;AAG3D,EAAAA,QAAO,UAAU,UAAU,SAASM,SAAS,QAAQ,OAAO,KAAK,WAAW,SAAS;AACnF,QAAI,WAAW,QAAQ,UAAU,GAAG;AAClC,eAASN,QAAO,KAAK,QAAQ,OAAO,QAAQ,OAAO,UAAU;;AAE/D,QAAI,CAACA,QAAO,SAAS,MAAM,GAAG;AAC5B,YAAM,IAAI;QACR,mFACoB,OAAO;;;AAI/B,QAAI,UAAU,QAAW;AACvB,cAAQ;;AAEV,QAAI,QAAQ,QAAW;AACrB,YAAM,SAAS,OAAO,SAAS;;AAEjC,QAAI,cAAc,QAAW;AAC3B,kBAAY;;AAEd,QAAI,YAAY,QAAW;AACzB,gBAAU,KAAK;;AAGjB,QAAI,QAAQ,KAAK,MAAM,OAAO,UAAU,YAAY,KAAK,UAAU,KAAK,QAAQ;AAC9E,YAAM,IAAI,WAAW,oBAAoB;;AAG3C,QAAI,aAAa,WAAW,SAAS,KAAK;AACxC,aAAO;;AAET,QAAI,aAAa,SAAS;AACxB,aAAO;;AAET,QAAI,SAAS,KAAK;AAChB,aAAO;;AAGT,eAAW;AACX,aAAS;AACT,mBAAe;AACf,iBAAa;AAEb,QAAI,SAAS,OAAQ,QAAO;AAE5B,QAAI,IAAI,UAAU;AAClB,QAAI,IAAI,MAAM;AACd,UAAM,MAAM,KAAK,IAAI,GAAG,CAAC;AAEzB,UAAM,WAAW,KAAK,MAAM,WAAW,OAAO;AAC9C,UAAM,aAAa,OAAO,MAAM,OAAO,GAAG;AAE1C,aAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,UAAI,SAAS,CAAC,MAAM,WAAW,CAAC,GAAG;AACjC,YAAI,SAAS,CAAC;AACd,YAAI,WAAW,CAAC;AAChB;;;AAIJ,QAAI,IAAI,EAAG,QAAO;AAClB,QAAI,IAAI,EAAG,QAAO;AAClB,WAAO;;AAYT,WAAS,qBAAsBN,SAAQ,KAAK,YAAY,UAAU,KAAK;AAErE,QAAIA,QAAO,WAAW,EAAG,QAAO;AAGhC,QAAI,OAAO,eAAe,UAAU;AAClC,iBAAW;AACX,mBAAa;IACjB,WAAa,aAAa,YAAY;AAClC,mBAAa;IACjB,WAAa,aAAa,aAAa;AACnC,mBAAa;;AAEf,iBAAa,CAAC;AACd,QAAI,YAAY,UAAU,GAAG;AAE3B,mBAAa,MAAM,IAAKA,QAAO,SAAS;;AAI1C,QAAI,aAAa,EAAG,cAAaA,QAAO,SAAS;AACjD,QAAI,cAAcA,QAAO,QAAQ;AAC/B,UAAI,IAAK,QAAO;UACX,cAAaA,QAAO,SAAS;IACtC,WAAa,aAAa,GAAG;AACzB,UAAI,IAAK,cAAa;UACjB,QAAO;;AAId,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAMM,QAAO,KAAK,KAAK,QAAQ;;AAIjC,QAAIA,QAAO,SAAS,GAAG,GAAG;AAExB,UAAI,IAAI,WAAW,GAAG;AACpB,eAAO;;AAET,aAAO,aAAaN,SAAQ,KAAK,YAAY,UAAU,GAAG;IAC9D,WAAa,OAAO,QAAQ,UAAU;AAClC,YAAM,MAAM;AACZ,UAAI,OAAO,WAAW,UAAU,YAAY,YAAY;AACtD,YAAI,KAAK;AACP,iBAAO,WAAW,UAAU,QAAQ,KAAKA,SAAQ,KAAK,UAAU;QACxE,OAAa;AACL,iBAAO,WAAW,UAAU,YAAY,KAAKA,SAAQ,KAAK,UAAU;;;AAGxE,aAAO,aAAaA,SAAQ,CAAC,GAAG,GAAG,YAAY,UAAU,GAAG;;AAG9D,UAAM,IAAI,UAAU,sCAAsC;;AAG5D,WAAS,aAAc,KAAK,KAAK,YAAY,UAAU,KAAK;AAC1D,QAAI,YAAY;AAChB,QAAI,YAAY,IAAI;AACpB,QAAI,YAAY,IAAI;AAEpB,QAAI,aAAa,QAAW;AAC1B,iBAAW,OAAO,QAAQ,EAAE,YAAW;AACvC,UAAI,aAAa,UAAU,aAAa,WACpC,aAAa,aAAa,aAAa,YAAY;AACrD,YAAI,IAAI,SAAS,KAAK,IAAI,SAAS,GAAG;AACpC,iBAAO;;AAET,oBAAY;AACZ,qBAAa;AACb,qBAAa;AACb,sBAAc;;;AAIlB,aAAS,KAAM,KAAKiB,IAAG;AACrB,UAAI,cAAc,GAAG;AACnB,eAAO,IAAIA,EAAC;MAClB,OAAW;AACL,eAAO,IAAI,aAAaA,KAAI,SAAS;;;AAIzC,QAAI;AACJ,QAAI,KAAK;AACP,UAAI,aAAa;AACjB,WAAK,IAAI,YAAY,IAAI,WAAW,KAAK;AACvC,YAAI,KAAK,KAAK,CAAC,MAAM,KAAK,KAAK,eAAe,KAAK,IAAI,IAAI,UAAU,GAAG;AACtE,cAAI,eAAe,GAAI,cAAa;AACpC,cAAI,IAAI,aAAa,MAAM,UAAW,QAAO,aAAa;QAClE,OAAa;AACL,cAAI,eAAe,GAAI,MAAK,IAAI;AAChC,uBAAa;;;IAGrB,OAAS;AACL,UAAI,aAAa,YAAY,UAAW,cAAa,YAAY;AACjE,WAAK,IAAI,YAAY,KAAK,GAAG,KAAK;AAChC,YAAI,QAAQ;AACZ,iBAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,cAAI,KAAK,KAAK,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,GAAG;AACrC,oBAAQ;AACR;;;AAGJ,YAAI,MAAO,QAAO;;;AAItB,WAAO;;AAGT,EAAAX,QAAO,UAAU,WAAW,SAAS,SAAU,KAAK,YAAY,UAAU;AACxE,WAAO,KAAK,QAAQ,KAAK,YAAY,QAAQ,MAAM;;AAGrD,EAAAA,QAAO,UAAU,UAAU,SAAS,QAAS,KAAK,YAAY,UAAU;AACtE,WAAO,qBAAqB,MAAM,KAAK,YAAY,UAAU,IAAI;;AAGnE,EAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,KAAK,YAAY,UAAU;AAC9E,WAAO,qBAAqB,MAAM,KAAK,YAAY,UAAU,KAAK;;AAGpE,WAAS,SAAU,KAAK,QAAQ,QAAQ,QAAQ;AAC9C,aAAS,OAAO,MAAM,KAAK;AAC3B,UAAM,YAAY,IAAI,SAAS;AAC/B,QAAI,CAAC,QAAQ;AACX,eAAS;IACb,OAAS;AACL,eAAS,OAAO,MAAM;AACtB,UAAI,SAAS,WAAW;AACtB,iBAAS;;;AAIb,UAAM,SAAS,OAAO;AAEtB,QAAI,SAAS,SAAS,GAAG;AACvB,eAAS,SAAS;;AAEpB,QAAI;AACJ,SAAK,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC3B,YAAM,SAAS,SAAS,OAAO,OAAO,IAAI,GAAG,CAAC,GAAG,EAAE;AACnD,UAAI,YAAY,MAAM,EAAG,QAAO;AAChC,UAAI,SAAS,CAAC,IAAI;;AAEpB,WAAO;;AAGT,WAAS,UAAW,KAAK,QAAQ,QAAQ,QAAQ;AAC/C,WAAO,WAAW,YAAY,QAAQ,IAAI,SAAS,MAAM,GAAG,KAAK,QAAQ,MAAM;;AAGjF,WAAS,WAAY,KAAK,QAAQ,QAAQ,QAAQ;AAChD,WAAO,WAAW,aAAa,MAAM,GAAG,KAAK,QAAQ,MAAM;;AAG7D,WAAS,YAAa,KAAK,QAAQ,QAAQ,QAAQ;AACjD,WAAO,WAAW,cAAc,MAAM,GAAG,KAAK,QAAQ,MAAM;;AAG9D,WAAS,UAAW,KAAK,QAAQ,QAAQ,QAAQ;AAC/C,WAAO,WAAW,eAAe,QAAQ,IAAI,SAAS,MAAM,GAAG,KAAK,QAAQ,MAAM;;AAGpF,EAAAA,QAAO,UAAU,QAAQ,SAAS,MAAO,QAAQ,QAAQ,QAAQ,UAAU;AAEzE,QAAI,WAAW,QAAW;AACxB,iBAAW;AACX,eAAS,KAAK;AACd,eAAS;eAEA,WAAW,UAAa,OAAO,WAAW,UAAU;AAC7D,iBAAW;AACX,eAAS,KAAK;AACd,eAAS;IAEb,WAAa,SAAS,MAAM,GAAG;AAC3B,eAAS,WAAW;AACpB,UAAI,SAAS,MAAM,GAAG;AACpB,iBAAS,WAAW;AACpB,YAAI,aAAa,OAAW,YAAW;MAC7C,OAAW;AACL,mBAAW;AACX,iBAAS;;IAEf,OAAS;AACL,YAAM,IAAI;QACR;;;AAIJ,UAAM,YAAY,KAAK,SAAS;AAChC,QAAI,WAAW,UAAa,SAAS,UAAW,UAAS;AAEzD,QAAK,OAAO,SAAS,MAAM,SAAS,KAAK,SAAS,MAAO,SAAS,KAAK,QAAQ;AAC7E,YAAM,IAAI,WAAW,wCAAwC;;AAG/D,QAAI,CAAC,SAAU,YAAW;AAE1B,QAAI,cAAc;AAClB,eAAS;AACP,cAAQ,UAAQ;QACd,KAAK;AACH,iBAAO,SAAS,MAAM,QAAQ,QAAQ,MAAM;QAE9C,KAAK;QACL,KAAK;AACH,iBAAO,UAAU,MAAM,QAAQ,QAAQ,MAAM;QAE/C,KAAK;QACL,KAAK;QACL,KAAK;AACH,iBAAO,WAAW,MAAM,QAAQ,QAAQ,MAAM;QAEhD,KAAK;AAEH,iBAAO,YAAY,MAAM,QAAQ,QAAQ,MAAM;QAEjD,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;AACH,iBAAO,UAAU,MAAM,QAAQ,QAAQ,MAAM;QAE/C;AACE,cAAI,YAAa,OAAM,IAAI,UAAU,uBAAuB,QAAQ;AACpE,sBAAY,KAAK,UAAU,YAAW;AACtC,wBAAc;;;;AAKtB,EAAAA,QAAO,UAAU,SAAS,SAASY,UAAU;AAC3C,WAAO;MACL,MAAM;MACN,MAAM,MAAM,UAAU,MAAM,KAAK,KAAK,QAAQ,MAAM,CAAC;;;AAIzD,WAAS,YAAa,KAAK,OAAO,KAAK;AACrC,QAAI,UAAU,KAAK,QAAQ,IAAI,QAAQ;AACrC,aAAO,OAAO,cAAc,GAAG;IACnC,OAAS;AACL,aAAO,OAAO,cAAc,IAAI,MAAM,OAAO,GAAG,CAAC;;;AAIrD,WAAS,UAAW,KAAK,OAAO,KAAK;AACnC,UAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAC9B,UAAM,MAAM,CAAA;AAEZ,QAAI,IAAI;AACR,WAAO,IAAI,KAAK;AACd,YAAM,YAAY,IAAI,CAAC;AACvB,UAAI,YAAY;AAChB,UAAI,mBAAoB,YAAY,MAChC,IACC,YAAY,MACT,IACC,YAAY,MACT,IACA;AAEZ,UAAI,IAAI,oBAAoB,KAAK;AAC/B,YAAI,YAAY,WAAW,YAAY;AAEvC,gBAAQ,kBAAgB;UACtB,KAAK;AACH,gBAAI,YAAY,KAAM;AACpB,0BAAY;;AAEd;UACF,KAAK;AACH,yBAAa,IAAI,IAAI,CAAC;AACtB,iBAAK,aAAa,SAAU,KAAM;AAChC,+BAAiB,YAAY,OAAS,IAAO,aAAa;AAC1D,kBAAI,gBAAgB,KAAM;AACxB,4BAAY;;;AAGhB;UACF,KAAK;AACH,yBAAa,IAAI,IAAI,CAAC;AACtB,wBAAY,IAAI,IAAI,CAAC;AACrB,iBAAK,aAAa,SAAU,QAAS,YAAY,SAAU,KAAM;AAC/D,+BAAiB,YAAY,OAAQ,MAAO,aAAa,OAAS,IAAO,YAAY;AACrF,kBAAI,gBAAgB,SAAU,gBAAgB,SAAU,gBAAgB,QAAS;AAC/E,4BAAY;;;AAGhB;UACF,KAAK;AACH,yBAAa,IAAI,IAAI,CAAC;AACtB,wBAAY,IAAI,IAAI,CAAC;AACrB,yBAAa,IAAI,IAAI,CAAC;AACtB,iBAAK,aAAa,SAAU,QAAS,YAAY,SAAU,QAAS,aAAa,SAAU,KAAM;AAC/F,+BAAiB,YAAY,OAAQ,MAAQ,aAAa,OAAS,MAAO,YAAY,OAAS,IAAO,aAAa;AACnH,kBAAI,gBAAgB,SAAU,gBAAgB,SAAU;AACtD,4BAAY;;;;;AAMtB,UAAI,cAAc,MAAM;AAGtB,oBAAY;AACZ,2BAAmB;MACzB,WAAe,YAAY,OAAQ;AAE7B,qBAAa;AACb,YAAI,KAAK,cAAc,KAAK,OAAQ,KAAM;AAC1C,oBAAY,QAAS,YAAY;;AAGnC,UAAI,KAAK,SAAS;AAClB,WAAK;;AAGP,WAAO,sBAAsB,GAAG;;AAMlC,QAAM,uBAAuB;AAE7B,WAAS,sBAAuB,YAAY;AAC1C,UAAM,MAAM,WAAW;AACvB,QAAI,OAAO,sBAAsB;AAC/B,aAAO,OAAO,aAAa,MAAM,QAAQ,UAAU;;AAIrD,QAAI,MAAM;AACV,QAAI,IAAI;AACR,WAAO,IAAI,KAAK;AACd,aAAO,OAAO,aAAa;QACzB;QACA,WAAW,MAAM,GAAG,KAAK,oBAAoB;;;AAGjD,WAAO;;AAGT,WAAS,WAAY,KAAK,OAAO,KAAK;AACpC,QAAI,MAAM;AACV,UAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAE9B,aAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,aAAO,OAAO,aAAa,IAAI,CAAC,IAAI,GAAI;;AAE1C,WAAO;;AAGT,WAAS,YAAa,KAAK,OAAO,KAAK;AACrC,QAAI,MAAM;AACV,UAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAE9B,aAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,aAAO,OAAO,aAAa,IAAI,CAAC,CAAC;;AAEnC,WAAO;;AAGT,WAAS,SAAU,KAAK,OAAO,KAAK;AAClC,UAAM,MAAM,IAAI;AAEhB,QAAI,CAAC,SAAS,QAAQ,EAAG,SAAQ;AACjC,QAAI,CAAC,OAAO,MAAM,KAAK,MAAM,IAAK,OAAM;AAExC,QAAI,MAAM;AACV,aAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,aAAO,oBAAoB,IAAI,CAAC,CAAC;;AAEnC,WAAO;;AAGT,WAAS,aAAc,KAAK,OAAO,KAAK;AACtC,UAAM,QAAQ,IAAI,MAAM,OAAO,GAAG;AAClC,QAAI,MAAM;AAEV,aAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG;AAC5C,aAAO,OAAO,aAAa,MAAM,CAAC,IAAK,MAAM,IAAI,CAAC,IAAI,GAAI;;AAE5D,WAAO;;AAGT,EAAAZ,QAAO,UAAU,QAAQ,SAAS,MAAO,OAAO,KAAK;AACnD,UAAM,MAAM,KAAK;AACjB,YAAQ,CAAC,CAAC;AACV,UAAM,QAAQ,SAAY,MAAM,CAAC,CAAC;AAElC,QAAI,QAAQ,GAAG;AACb,eAAS;AACT,UAAI,QAAQ,EAAG,SAAQ;IAC3B,WAAa,QAAQ,KAAK;AACtB,cAAQ;;AAGV,QAAI,MAAM,GAAG;AACX,aAAO;AACP,UAAI,MAAM,EAAG,OAAM;IACvB,WAAa,MAAM,KAAK;AACpB,YAAM;;AAGR,QAAI,MAAM,MAAO,OAAM;AAEvB,UAAM,SAAS,KAAK,SAAS,OAAO,GAAG;AAEvC,WAAO,eAAe,QAAQA,QAAO,SAAS;AAE9C,WAAO;;AAMT,WAAS,YAAa,QAAQ,KAAK,QAAQ;AACzC,QAAK,SAAS,MAAO,KAAK,SAAS,EAAG,OAAM,IAAI,WAAW,oBAAoB;AAC/E,QAAI,SAAS,MAAM,OAAQ,OAAM,IAAI,WAAW,uCAAuC;;AAGzF,EAAAA,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,QAAQG,aAAY,UAAU;AAC/E,aAAS,WAAW;AACpB,IAAAA,cAAaA,gBAAe;AAC5B,QAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,QAAI,MAAM,KAAK,MAAM;AACrB,QAAIU,OAAM;AACV,QAAI,IAAI;AACR,WAAO,EAAE,IAAIV,gBAAeU,QAAO,MAAQ;AACzC,aAAO,KAAK,SAAS,CAAC,IAAIA;;AAG5B,WAAO;;AAGT,EAAAb,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,QAAQG,aAAY,UAAU;AAC/E,aAAS,WAAW;AACpB,IAAAA,cAAaA,gBAAe;AAC5B,QAAI,CAAC,UAAU;AACb,kBAAY,QAAQA,aAAY,KAAK,MAAM;;AAG7C,QAAI,MAAM,KAAK,SAAS,EAAEA,WAAU;AACpC,QAAIU,OAAM;AACV,WAAOV,cAAa,MAAMU,QAAO,MAAQ;AACvC,aAAO,KAAK,SAAS,EAAEV,WAAU,IAAIU;;AAGvC,WAAO;;AAGT,EAAAb,QAAO,UAAU,YACjBA,QAAO,UAAU,YAAY,SAASc,WAAW,QAAQ,UAAU;AACjE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,WAAO,KAAK,MAAM;;AAGpB,EAAAd,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,WAAO,KAAK,MAAM,IAAK,KAAK,SAAS,CAAC,KAAK;;AAG7C,EAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,WAAQ,KAAK,MAAM,KAAK,IAAK,KAAK,SAAS,CAAC;;AAG9C,EAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,YAAS,KAAK,MAAM,IACf,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC,KAAK,MACpB,KAAK,SAAS,CAAC,IAAI;;AAG1B,EAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAASe,cAAc,QAAQ,UAAU;AACvE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,WAAQ,KAAK,MAAM,IAAI,YACnB,KAAK,SAAS,CAAC,KAAK,KACrB,KAAK,SAAS,CAAC,KAAK,IACrB,KAAK,SAAS,CAAC;;AAGnB,EAAAf,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,QAAQ;AACtF,aAAS,WAAW;AACpB,mBAAe,QAAQ,QAAQ;AAC/B,UAAM,QAAQ,KAAK,MAAM;AACzB,UAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,QAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,kBAAY,QAAQ,KAAK,SAAS,CAAC;;AAGrC,UAAM,KAAK,QACT,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK;AAExB,UAAM,KAAK,KAAK,EAAE,MAAM,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,OAAO,KAAK;AAEd,WAAO,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE;EAC9C,CAAC;AAED,EAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,QAAQ;AACtF,aAAS,WAAW;AACpB,mBAAe,QAAQ,QAAQ;AAC/B,UAAM,QAAQ,KAAK,MAAM;AACzB,UAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,QAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,kBAAY,QAAQ,KAAK,SAAS,CAAC;;AAGrC,UAAM,KAAK,QAAQ,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM;AAEf,UAAM,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,KAC/B,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB;AAEF,YAAQ,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE;EAC/C,CAAC;AAED,EAAAA,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQG,aAAY,UAAU;AAC7E,aAAS,WAAW;AACpB,IAAAA,cAAaA,gBAAe;AAC5B,QAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,QAAI,MAAM,KAAK,MAAM;AACrB,QAAIU,OAAM;AACV,QAAI,IAAI;AACR,WAAO,EAAE,IAAIV,gBAAeU,QAAO,MAAQ;AACzC,aAAO,KAAK,SAAS,CAAC,IAAIA;;AAE5B,IAAAA,QAAO;AAEP,QAAI,OAAOA,KAAK,QAAO,KAAK,IAAI,GAAG,IAAIV,WAAU;AAEjD,WAAO;;AAGT,EAAAH,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQG,aAAY,UAAU;AAC7E,aAAS,WAAW;AACpB,IAAAA,cAAaA,gBAAe;AAC5B,QAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,QAAI,IAAIA;AACR,QAAIU,OAAM;AACV,QAAI,MAAM,KAAK,SAAS,EAAE,CAAC;AAC3B,WAAO,IAAI,MAAMA,QAAO,MAAQ;AAC9B,aAAO,KAAK,SAAS,EAAE,CAAC,IAAIA;;AAE9B,IAAAA,QAAO;AAEP,QAAI,OAAOA,KAAK,QAAO,KAAK,IAAI,GAAG,IAAIV,WAAU;AAEjD,WAAO;;AAGT,EAAAH,QAAO,UAAU,WAAW,SAAS,SAAU,QAAQ,UAAU;AAC/D,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,QAAI,EAAE,KAAK,MAAM,IAAI,KAAO,QAAQ,KAAK,MAAM;AAC/C,YAAS,MAAO,KAAK,MAAM,IAAI,KAAK;;AAGtC,EAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,UAAM,MAAM,KAAK,MAAM,IAAK,KAAK,SAAS,CAAC,KAAK;AAChD,WAAQ,MAAM,QAAU,MAAM,aAAa;;AAG7C,EAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,UAAM,MAAM,KAAK,SAAS,CAAC,IAAK,KAAK,MAAM,KAAK;AAChD,WAAQ,MAAM,QAAU,MAAM,aAAa;;AAG7C,EAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,WAAQ,KAAK,MAAM,IAChB,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC,KAAK,KACpB,KAAK,SAAS,CAAC,KAAK;;AAGzB,EAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,WAAQ,KAAK,MAAM,KAAK,KACrB,KAAK,SAAS,CAAC,KAAK,KACpB,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC;;AAGpB,EAAAA,QAAO,UAAU,iBAAiB,mBAAmB,SAAS,eAAgB,QAAQ;AACpF,aAAS,WAAW;AACpB,mBAAe,QAAQ,QAAQ;AAC/B,UAAM,QAAQ,KAAK,MAAM;AACzB,UAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,QAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,kBAAY,QAAQ,KAAK,SAAS,CAAC;;AAGrC,UAAM,MAAM,KAAK,SAAS,CAAC,IACzB,KAAK,SAAS,CAAC,IAAI,KAAK,IACxB,KAAK,SAAS,CAAC,IAAI,KAAK,MACvB,QAAQ;AAEX,YAAQ,OAAO,GAAG,KAAK,OAAO,EAAE,KAC9B,OAAO,QACP,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,EAAE;EAC5B,CAAC;AAED,EAAAA,QAAO,UAAU,iBAAiB,mBAAmB,SAAS,eAAgB,QAAQ;AACpF,aAAS,WAAW;AACpB,mBAAe,QAAQ,QAAQ;AAC/B,UAAM,QAAQ,KAAK,MAAM;AACzB,UAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,QAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,kBAAY,QAAQ,KAAK,SAAS,CAAC;;AAGrC,UAAM,OAAO,SAAS;IACpB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM;AAEf,YAAQ,OAAO,GAAG,KAAK,OAAO,EAAE,KAC9B,OAAO,KAAK,EAAE,MAAM,IAAI,KAAK,KAC7B,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,IAAI;EACR,CAAC;AAED,EAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,WAAOF,UAAQ,KAAK,MAAM,QAAQ,MAAM,IAAI,CAAC;;AAG/C,EAAAE,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,WAAOF,UAAQ,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC;;AAGhD,EAAAE,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,WAAOF,UAAQ,KAAK,MAAM,QAAQ,MAAM,IAAI,CAAC;;AAG/C,EAAAE,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,WAAOF,UAAQ,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC;;AAGhD,WAAS,SAAU,KAAK,OAAO,QAAQ,KAAKY,MAAKM,MAAK;AACpD,QAAI,CAAChB,QAAO,SAAS,GAAG,EAAG,OAAM,IAAI,UAAU,6CAA6C;AAC5F,QAAI,QAAQU,QAAO,QAAQM,KAAK,OAAM,IAAI,WAAW,mCAAmC;AACxF,QAAI,SAAS,MAAM,IAAI,OAAQ,OAAM,IAAI,WAAW,oBAAoB;;AAG1E,EAAAhB,QAAO,UAAU,cACjBA,QAAO,UAAU,cAAc,SAAS,YAAa,OAAO,QAAQG,aAAY,UAAU;AACxF,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,IAAAA,cAAaA,gBAAe;AAC5B,QAAI,CAAC,UAAU;AACb,YAAM,WAAW,KAAK,IAAI,GAAG,IAAIA,WAAU,IAAI;AAC/C,eAAS,MAAM,OAAO,QAAQA,aAAY,UAAU,CAAC;;AAGvD,QAAIU,OAAM;AACV,QAAI,IAAI;AACR,SAAK,MAAM,IAAI,QAAQ;AACvB,WAAO,EAAE,IAAIV,gBAAeU,QAAO,MAAQ;AACzC,WAAK,SAAS,CAAC,IAAK,QAAQA,OAAO;;AAGrC,WAAO,SAASV;;AAGlB,EAAAH,QAAO,UAAU,cACjBA,QAAO,UAAU,cAAc,SAAS,YAAa,OAAO,QAAQG,aAAY,UAAU;AACxF,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,IAAAA,cAAaA,gBAAe;AAC5B,QAAI,CAAC,UAAU;AACb,YAAM,WAAW,KAAK,IAAI,GAAG,IAAIA,WAAU,IAAI;AAC/C,eAAS,MAAM,OAAO,QAAQA,aAAY,UAAU,CAAC;;AAGvD,QAAI,IAAIA,cAAa;AACrB,QAAIU,OAAM;AACV,SAAK,SAAS,CAAC,IAAI,QAAQ;AAC3B,WAAO,EAAE,KAAK,MAAMA,QAAO,MAAQ;AACjC,WAAK,SAAS,CAAC,IAAK,QAAQA,OAAO;;AAGrC,WAAO,SAASV;;AAGlB,EAAAH,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQ,UAAU;AAC1E,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,KAAM,CAAC;AACvD,SAAK,MAAM,IAAK,QAAQ;AACxB,WAAO,SAAS;;AAGlB,EAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,CAAC;AACzD,SAAK,MAAM,IAAK,QAAQ;AACxB,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAO,SAAS;;AAGlB,EAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,CAAC;AACzD,SAAK,MAAM,IAAK,UAAU;AAC1B,SAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,WAAO,SAAS;;AAGlB,EAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,CAAC;AAC7D,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,SAAK,MAAM,IAAK,QAAQ;AACxB,WAAO,SAAS;;AAGlB,EAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAASiB,eAAe,OAAO,QAAQ,UAAU;AAChF,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,CAAC;AAC7D,SAAK,MAAM,IAAK,UAAU;AAC1B,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,SAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,WAAO,SAAS;;AAGlB,WAAS,eAAgB,KAAK,OAAO,QAAQD,MAAKN,MAAK;AACrD,eAAW,OAAOM,MAAKN,MAAK,KAAK,QAAQ,CAAC;AAE1C,QAAI,KAAK,OAAO,QAAQ,OAAO,UAAU,CAAC;AAC1C,QAAI,QAAQ,IAAI;AAChB,SAAK,MAAM;AACX,QAAI,QAAQ,IAAI;AAChB,SAAK,MAAM;AACX,QAAI,QAAQ,IAAI;AAChB,SAAK,MAAM;AACX,QAAI,QAAQ,IAAI;AAChB,QAAI,KAAK,OAAO,SAAS,OAAO,EAAE,IAAI,OAAO,UAAU,CAAC;AACxD,QAAI,QAAQ,IAAI;AAChB,SAAK,MAAM;AACX,QAAI,QAAQ,IAAI;AAChB,SAAK,MAAM;AACX,QAAI,QAAQ,IAAI;AAChB,SAAK,MAAM;AACX,QAAI,QAAQ,IAAI;AAChB,WAAO;;AAGT,WAAS,eAAgB,KAAK,OAAO,QAAQM,MAAKN,MAAK;AACrD,eAAW,OAAOM,MAAKN,MAAK,KAAK,QAAQ,CAAC;AAE1C,QAAI,KAAK,OAAO,QAAQ,OAAO,UAAU,CAAC;AAC1C,QAAI,SAAS,CAAC,IAAI;AAClB,SAAK,MAAM;AACX,QAAI,SAAS,CAAC,IAAI;AAClB,SAAK,MAAM;AACX,QAAI,SAAS,CAAC,IAAI;AAClB,SAAK,MAAM;AACX,QAAI,SAAS,CAAC,IAAI;AAClB,QAAI,KAAK,OAAO,SAAS,OAAO,EAAE,IAAI,OAAO,UAAU,CAAC;AACxD,QAAI,SAAS,CAAC,IAAI;AAClB,SAAK,MAAM;AACX,QAAI,SAAS,CAAC,IAAI;AAClB,SAAK,MAAM;AACX,QAAI,SAAS,CAAC,IAAI;AAClB,SAAK,MAAM;AACX,QAAI,MAAM,IAAI;AACd,WAAO,SAAS;;AAGlB,EAAAV,QAAO,UAAU,mBAAmB,mBAAmB,SAAS,iBAAkB,OAAO,SAAS,GAAG;AACnG,WAAO,eAAe,MAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,OAAO,oBAAoB,CAAC;EACpF,CAAC;AAED,EAAAA,QAAO,UAAU,mBAAmB,mBAAmB,SAAS,iBAAkB,OAAO,SAAS,GAAG;AACnG,WAAO,eAAe,MAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,OAAO,oBAAoB,CAAC;EACpF,CAAC;AAED,EAAAA,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQG,aAAY,UAAU;AACtF,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,UAAU;AACb,YAAM,QAAQ,KAAK,IAAI,GAAI,IAAIA,cAAc,CAAC;AAE9C,eAAS,MAAM,OAAO,QAAQA,aAAY,QAAQ,GAAG,CAAC,KAAK;;AAG7D,QAAI,IAAI;AACR,QAAIU,OAAM;AACV,QAAI,MAAM;AACV,SAAK,MAAM,IAAI,QAAQ;AACvB,WAAO,EAAE,IAAIV,gBAAeU,QAAO,MAAQ;AACzC,UAAI,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,GAAG;AACxD,cAAM;;AAER,WAAK,SAAS,CAAC,KAAM,QAAQA,QAAQ,KAAK,MAAM;;AAGlD,WAAO,SAASV;;AAGlB,EAAAH,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQG,aAAY,UAAU;AACtF,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,UAAU;AACb,YAAM,QAAQ,KAAK,IAAI,GAAI,IAAIA,cAAc,CAAC;AAE9C,eAAS,MAAM,OAAO,QAAQA,aAAY,QAAQ,GAAG,CAAC,KAAK;;AAG7D,QAAI,IAAIA,cAAa;AACrB,QAAIU,OAAM;AACV,QAAI,MAAM;AACV,SAAK,SAAS,CAAC,IAAI,QAAQ;AAC3B,WAAO,EAAE,KAAK,MAAMA,QAAO,MAAQ;AACjC,UAAI,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,GAAG;AACxD,cAAM;;AAER,WAAK,SAAS,CAAC,KAAM,QAAQA,QAAQ,KAAK,MAAM;;AAGlD,WAAO,SAASV;;AAGlB,EAAAH,QAAO,UAAU,YAAY,SAAS,UAAW,OAAO,QAAQ,UAAU;AACxE,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,KAAM,IAAK;AAC3D,QAAI,QAAQ,EAAG,SAAQ,MAAO,QAAQ;AACtC,SAAK,MAAM,IAAK,QAAQ;AACxB,WAAO,SAAS;;AAGlB,EAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,MAAO;AAC/D,SAAK,MAAM,IAAK,QAAQ;AACxB,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAO,SAAS;;AAGlB,EAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,MAAO;AAC/D,SAAK,MAAM,IAAK,UAAU;AAC1B,SAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,WAAO,SAAS;;AAGlB,EAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,WAAW;AACvE,SAAK,MAAM,IAAK,QAAQ;AACxB,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAO,SAAS;;AAGlB,EAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,WAAW;AACvE,QAAI,QAAQ,EAAG,SAAQ,aAAa,QAAQ;AAC5C,SAAK,MAAM,IAAK,UAAU;AAC1B,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,SAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,SAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,WAAO,SAAS;;AAGlB,EAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,OAAO,SAAS,GAAG;AACjG,WAAO,eAAe,MAAM,OAAO,QAAQ,CAAC,OAAO,oBAAoB,GAAG,OAAO,oBAAoB,CAAC;EACxG,CAAC;AAED,EAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,OAAO,SAAS,GAAG;AACjG,WAAO,eAAe,MAAM,OAAO,QAAQ,CAAC,OAAO,oBAAoB,GAAG,OAAO,oBAAoB,CAAC;EACxG,CAAC;AAED,WAAS,aAAc,KAAK,OAAO,QAAQ,KAAKU,MAAKM,MAAK;AACxD,QAAI,SAAS,MAAM,IAAI,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AACxE,QAAI,SAAS,EAAG,OAAM,IAAI,WAAW,oBAAoB;;AAG3D,WAAS,WAAY,KAAK,OAAO,QAAQ,cAAc,UAAU;AAC/D,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,UAAU;AACb,mBAAa,KAAK,OAAO,QAAQ,CAAkD;;AAErFlB,cAAQ,MAAM,KAAK,OAAO,QAAQ,cAAc,IAAI,CAAC;AACrD,WAAO,SAAS;;AAGlB,EAAAE,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,WAAO,WAAW,MAAM,OAAO,QAAQ,MAAM,QAAQ;;AAGvD,EAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,WAAO,WAAW,MAAM,OAAO,QAAQ,OAAO,QAAQ;;AAGxD,WAAS,YAAa,KAAK,OAAO,QAAQ,cAAc,UAAU;AAChE,YAAQ,CAAC;AACT,aAAS,WAAW;AACpB,QAAI,CAAC,UAAU;AACb,mBAAa,KAAK,OAAO,QAAQ,CAAoD;;AAEvFF,cAAQ,MAAM,KAAK,OAAO,QAAQ,cAAc,IAAI,CAAC;AACrD,WAAO,SAAS;;AAGlB,EAAAE,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,WAAO,YAAY,MAAM,OAAO,QAAQ,MAAM,QAAQ;;AAGxD,EAAAA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,WAAO,YAAY,MAAM,OAAO,QAAQ,OAAO,QAAQ;;AAIzD,EAAAA,QAAO,UAAU,OAAO,SAAS,KAAM,QAAQ,aAAa,OAAO,KAAK;AACtE,QAAI,CAACA,QAAO,SAAS,MAAM,EAAG,OAAM,IAAI,UAAU,6BAA6B;AAC/E,QAAI,CAAC,MAAO,SAAQ;AACpB,QAAI,CAAC,OAAO,QAAQ,EAAG,OAAM,KAAK;AAClC,QAAI,eAAe,OAAO,OAAQ,eAAc,OAAO;AACvD,QAAI,CAAC,YAAa,eAAc;AAChC,QAAI,MAAM,KAAK,MAAM,MAAO,OAAM;AAGlC,QAAI,QAAQ,MAAO,QAAO;AAC1B,QAAI,OAAO,WAAW,KAAK,KAAK,WAAW,EAAG,QAAO;AAGrD,QAAI,cAAc,GAAG;AACnB,YAAM,IAAI,WAAW,2BAA2B;;AAElD,QAAI,QAAQ,KAAK,SAAS,KAAK,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AAChF,QAAI,MAAM,EAAG,OAAM,IAAI,WAAW,yBAAyB;AAG3D,QAAI,MAAM,KAAK,OAAQ,OAAM,KAAK;AAClC,QAAI,OAAO,SAAS,cAAc,MAAM,OAAO;AAC7C,YAAM,OAAO,SAAS,cAAc;;AAGtC,UAAM,MAAM,MAAM;AAElB,QAAI,SAAS,UAAU,OAAO,WAAW,UAAU,eAAe,YAAY;AAE5E,WAAK,WAAW,aAAa,OAAO,GAAG;IAC3C,OAAS;AACL,iBAAW,UAAU,IAAI;QACvB;QACA,KAAK,SAAS,OAAO,GAAG;QACxB;;;AAIJ,WAAO;;AAOT,EAAAA,QAAO,UAAU,OAAO,SAAS,KAAM,KAAK,OAAO,KAAK,UAAU;AAEhE,QAAI,OAAO,QAAQ,UAAU;AAC3B,UAAI,OAAO,UAAU,UAAU;AAC7B,mBAAW;AACX,gBAAQ;AACR,cAAM,KAAK;MACjB,WAAe,OAAO,QAAQ,UAAU;AAClC,mBAAW;AACX,cAAM,KAAK;;AAEb,UAAI,aAAa,UAAa,OAAO,aAAa,UAAU;AAC1D,cAAM,IAAI,UAAU,2BAA2B;;AAEjD,UAAI,OAAO,aAAa,YAAY,CAACA,QAAO,WAAW,QAAQ,GAAG;AAChE,cAAM,IAAI,UAAU,uBAAuB,QAAQ;;AAErD,UAAI,IAAI,WAAW,GAAG;AACpB,cAAMkB,QAAO,IAAI,WAAW,CAAC;AAC7B,YAAK,aAAa,UAAUA,QAAO,OAC/B,aAAa,UAAU;AAEzB,gBAAMA;;;IAGd,WAAa,OAAO,QAAQ,UAAU;AAClC,YAAM,MAAM;IAChB,WAAa,OAAO,QAAQ,WAAW;AACnC,YAAM,OAAO,GAAG;;AAIlB,QAAI,QAAQ,KAAK,KAAK,SAAS,SAAS,KAAK,SAAS,KAAK;AACzD,YAAM,IAAI,WAAW,oBAAoB;;AAG3C,QAAI,OAAO,OAAO;AAChB,aAAO;;AAGT,YAAQ,UAAU;AAClB,UAAM,QAAQ,SAAY,KAAK,SAAS,QAAQ;AAEhD,QAAI,CAAC,IAAK,OAAM;AAEhB,QAAI;AACJ,QAAI,OAAO,QAAQ,UAAU;AAC3B,WAAK,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAC5B,aAAK,CAAC,IAAI;;IAEhB,OAAS;AACL,YAAM,QAAQlB,QAAO,SAAS,GAAG,IAC7B,MACAA,QAAO,KAAK,KAAK,QAAQ;AAC7B,YAAM,MAAM,MAAM;AAClB,UAAI,QAAQ,GAAG;AACb,cAAM,IAAI,UAAU,gBAAgB,MAClC,mCAAmC;;AAEvC,WAAK,IAAI,GAAG,IAAI,MAAM,OAAO,EAAE,GAAG;AAChC,aAAK,IAAI,KAAK,IAAI,MAAM,IAAI,GAAG;;;AAInC,WAAO;;AAOT,QAAMmB,UAAS,CAAA;AACf,WAAS,EAAG,KAAK,YAAYC,OAAM;AACjC,IAAAD,QAAO,GAAG,IAAI,MAAM,kBAAkBC,MAAK;MACzC,cAAe;AACb,cAAK;AAEL,eAAO,eAAe,MAAM,WAAW;UACrC,OAAO,WAAW,MAAM,MAAM,SAAS;UACvC,UAAU;UACV,cAAc;QACtB,CAAO;AAGD,aAAK,OAAO,GAAG,KAAK,IAAI,KAAK,GAAG;AAGhC,aAAK;AAEL,eAAO,KAAK;;MAGd,IAAI,OAAQ;AACV,eAAO;;MAGT,IAAI,KAAM,OAAO;AACf,eAAO,eAAe,MAAM,QAAQ;UAClC,cAAc;UACd,YAAY;UACZ;UACA,UAAU;QAClB,CAAO;;MAGH,WAAY;AACV,eAAO,GAAG,KAAK,IAAI,KAAK,GAAG,MAAM,KAAK,OAAO;;;;AAKnD;IAAE;IACA,SAAUC,OAAM;AACd,UAAIA,OAAM;AACR,eAAO,GAAGA,KAAI;;AAGhB,aAAO;;IACN;EAAU;AACf;IAAE;IACA,SAAUA,OAAM,QAAQ;AACtB,aAAO,QAAQA,KAAI,oDAAoD,OAAO,MAAM;;IACnF;EAAS;AACd;IAAE;IACA,SAAU,KAAKC,QAAO,OAAO;AAC3B,UAAI,MAAM,iBAAiB,GAAG;AAC9B,UAAI,WAAW;AACf,UAAI,OAAO,UAAU,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI;AACxD,mBAAW,sBAAsB,OAAO,KAAK,CAAC;MACpD,WAAe,OAAO,UAAU,UAAU;AACpC,mBAAW,OAAO,KAAK;AACvB,YAAI,QAAQ,OAAO,CAAC,KAAK,OAAO,EAAE,KAAK,QAAQ,EAAE,OAAO,CAAC,KAAK,OAAO,EAAE,IAAI;AACzE,qBAAW,sBAAsB,QAAQ;;AAE3C,oBAAY;;AAEd,aAAO,eAAeA,MAAK,cAAc,QAAQ;AACjD,aAAO;;IACN;EAAU;AAEf,WAAS,sBAAuB,KAAK;AACnC,QAAI,MAAM;AACV,QAAI,IAAI,IAAI;AACZ,UAAM,QAAQ,IAAI,CAAC,MAAM,MAAM,IAAI;AACnC,WAAO,KAAK,QAAQ,GAAG,KAAK,GAAG;AAC7B,YAAM,IAAI,IAAI,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG;;AAErC,WAAO,GAAG,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG;;AAMjC,WAAS,YAAa,KAAK,QAAQnB,aAAY;AAC7C,mBAAe,QAAQ,QAAQ;AAC/B,QAAI,IAAI,MAAM,MAAM,UAAa,IAAI,SAASA,WAAU,MAAM,QAAW;AACvE,kBAAY,QAAQ,IAAI,UAAUA,cAAa,EAAE;;;AAIrD,WAAS,WAAY,OAAOa,MAAKN,MAAK,KAAK,QAAQP,aAAY;AAC7D,QAAI,QAAQO,QAAO,QAAQM,MAAK;AAC9B,YAAM,IAAI,OAAOA,SAAQ,WAAW,MAAM;AAC1C,UAAIM;AACJ,UAAInB,cAAa,GAAG;AAClB,YAAIa,SAAQ,KAAKA,SAAQ,OAAO,CAAC,GAAG;AAClC,UAAAM,SAAQ,OAAO,CAAC,WAAW,CAAC,QAAQnB,cAAa,KAAK,CAAC,GAAG,CAAC;QACnE,OAAa;AACL,UAAAmB,SAAQ,SAAS,CAAC,QAAQnB,cAAa,KAAK,IAAI,CAAC,GAAG,CAAC,iBACzCA,cAAa,KAAK,IAAI,CAAC,GAAG,CAAC;;MAE/C,OAAW;AACL,QAAAmB,SAAQ,MAAMN,IAAG,GAAG,CAAC,WAAWN,IAAG,GAAG,CAAC;;AAEzC,YAAM,IAAIS,QAAO,iBAAiB,SAASG,QAAO,KAAK;;AAEzD,gBAAY,KAAK,QAAQnB,WAAU;;AAGrC,WAAS,eAAgB,OAAOkB,OAAM;AACpC,QAAI,OAAO,UAAU,UAAU;AAC7B,YAAM,IAAIF,QAAO,qBAAqBE,OAAM,UAAU,KAAK;;;AAI/D,WAAS,YAAa,OAAO,QAAQE,OAAM;AACzC,QAAI,KAAK,MAAM,KAAK,MAAM,OAAO;AAC/B,qBAAe,OAAOA,KAAI;AAC1B,YAAM,IAAIJ,QAAO,iBAAiBI,SAAQ,UAAU,cAAc,KAAK;;AAGzE,QAAI,SAAS,GAAG;AACd,YAAM,IAAIJ,QAAO,yBAAwB;;AAG3C,UAAM,IAAIA,QAAO;MAAiBI,SAAQ;MACR,MAAMA,QAAO,IAAI,CAAC,WAAW,MAAM;MACnC;IAAK;;AAMzC,QAAM,oBAAoB;AAE1B,WAAS,YAAa,KAAK;AAEzB,UAAM,IAAI,MAAM,GAAG,EAAE,CAAC;AAEtB,UAAM,IAAI,KAAI,EAAG,QAAQ,mBAAmB,EAAE;AAE9C,QAAI,IAAI,SAAS,EAAG,QAAO;AAE3B,WAAO,IAAI,SAAS,MAAM,GAAG;AAC3B,YAAM,MAAM;;AAEd,WAAO;;AAGT,WAAS,YAAa,QAAQ,OAAO;AACnC,YAAQ,SAAS;AACjB,QAAI;AACJ,UAAM,SAAS,OAAO;AACtB,QAAI,gBAAgB;AACpB,UAAM,QAAQ,CAAA;AAEd,aAAS,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC/B,kBAAY,OAAO,WAAW,CAAC;AAG/B,UAAI,YAAY,SAAU,YAAY,OAAQ;AAE5C,YAAI,CAAC,eAAe;AAElB,cAAI,YAAY,OAAQ;AAEtB,iBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD;UACV,WAAmB,IAAI,MAAM,QAAQ;AAE3B,iBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD;;AAIF,0BAAgB;AAEhB;;AAIF,YAAI,YAAY,OAAQ;AACtB,eAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD,0BAAgB;AAChB;;AAIF,qBAAa,gBAAgB,SAAU,KAAK,YAAY,SAAU;iBACzD,eAAe;AAExB,aAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;;AAGpD,sBAAgB;AAGhB,UAAI,YAAY,KAAM;AACpB,aAAK,SAAS,KAAK,EAAG;AACtB,cAAM,KAAK,SAAS;MAC1B,WAAe,YAAY,MAAO;AAC5B,aAAK,SAAS,KAAK,EAAG;AACtB,cAAM;UACJ,aAAa,IAAM;UACnB,YAAY,KAAO;;MAE3B,WAAe,YAAY,OAAS;AAC9B,aAAK,SAAS,KAAK,EAAG;AACtB,cAAM;UACJ,aAAa,KAAM;UACnB,aAAa,IAAM,KAAO;UAC1B,YAAY,KAAO;;MAE3B,WAAe,YAAY,SAAU;AAC/B,aAAK,SAAS,KAAK,EAAG;AACtB,cAAM;UACJ,aAAa,KAAO;UACpB,aAAa,KAAM,KAAO;UAC1B,aAAa,IAAM,KAAO;UAC1B,YAAY,KAAO;;MAE3B,OAAW;AACL,cAAM,IAAI,MAAM,oBAAoB;;;AAIxC,WAAO;;AAGT,WAAS,aAAc,KAAK;AAC1B,UAAM,YAAY,CAAA;AAClB,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AAEnC,gBAAU,KAAK,IAAI,WAAW,CAAC,IAAI,GAAI;;AAEzC,WAAO;;AAGT,WAAS,eAAgB,KAAK,OAAO;AACnC,QAAI,GAAG,IAAI;AACX,UAAM,YAAY,CAAA;AAClB,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACnC,WAAK,SAAS,KAAK,EAAG;AAEtB,UAAI,IAAI,WAAW,CAAC;AACpB,WAAK,KAAK;AACV,WAAK,IAAI;AACT,gBAAU,KAAK,EAAE;AACjB,gBAAU,KAAK,EAAE;;AAGnB,WAAO;;AAGT,WAAS,cAAe,KAAK;AAC3B,WAAO,OAAO,YAAY,YAAY,GAAG,CAAC;;AAG5C,WAAS,WAAY,KAAK,KAAK,QAAQ,QAAQ;AAC7C,QAAI;AACJ,SAAK,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC3B,UAAK,IAAI,UAAU,IAAI,UAAY,KAAK,IAAI,OAAS;AACrD,UAAI,IAAI,MAAM,IAAI,IAAI,CAAC;;AAEzB,WAAO;;AAMT,WAAS,WAAYnB,MAAKmB,OAAM;AAC9B,WAAOnB,gBAAemB,SACnBnB,QAAO,QAAQA,KAAI,eAAe,QAAQA,KAAI,YAAY,QAAQ,QACjEA,KAAI,YAAY,SAASmB,MAAK;;AAEpC,WAAS,YAAanB,MAAK;AAEzB,WAAOA,SAAQA;;AAKjB,QAAM,uBAAuB,WAAY;AACvC,UAAM,WAAW;AACjB,UAAM,QAAQ,IAAI,MAAM,GAAG;AAC3B,aAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,YAAM,MAAM,IAAI;AAChB,eAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,cAAM,MAAM,CAAC,IAAI,SAAS,CAAC,IAAI,SAAS,CAAC;;;AAG7C,WAAO;EACT,GAAC;AAGD,WAAS,mBAAoB,IAAI;AAC/B,WAAO,OAAO,WAAW,cAAc,yBAAyB;;AAGlE,WAAS,yBAA0B;AACjC,UAAM,IAAI,MAAM,sBAAsB;EACxC;;;;;;ACxjEA,OAAO,eAAeoB,SAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC3CA,QAAA,YAAG;AACpBA,QAAA,YAAoB,EAAE,MAAM,QAAO;ACFnC,OAAO,eAAe,SAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC3C,QAAA,YAAG;AACpB,IAAM,UAAU3B;AAChB,SAAS,iBAAiB,UAAU;AAChC,MAAI,SAAS,WAAW;AACpB,UAAM,IAAI,MAAM,6BAA6B;AACjD,MAAI,SAAS,WAAW;AACpB,WAAO,SAAS,CAAC;AACrB,QAAM,SAAS,CAAA;AACf,MAAI,IAAI;AACR,SAAO,IAAI,SAAS,SAAS,GAAG;AAC5B,WAAO,KAAK,EAAE,MAAM,QAAQ,MAAM,SAAS,CAAC,GAAG,OAAO,SAAS,IAAI,CAAC,EAAC,CAAE;AACvE,SAAK;EACb;AACI,MAAI,IAAI,SAAS;AACb,WAAO,KAAK,SAAS,CAAC,CAAC;AAC3B,SAAO,iBAAiB,MAAM;AAClC;AACA,SAAS,qBAAqB,OAAO,mBAAmB;AACpD,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;MACH,MAAM;MACN,MAAM,QAAQ;MACd,OAAO,QAAQ;MACf,SAAS,CAAA;MACT,MAAM;MACN,MAAM;IAClB;EACA;AACI,QAAM,SAAS,MAAM,IAAI,UAAQ,UAAU,MAAM,iBAAiB,CAAC;AACnE,MAAI,OAAO,UAAU,KAAK,OAAO,CAAC,EAAE,QAAQ,UAAU,qBAAqB,GAAG;AAC1E,WAAO;MACH,MAAM;MACN,MAAM,OAAO,CAAC;MACd,OAAO,QAAQ;MACf,SAAS;MACT,MAAM,MAAM;MACZ,MAAM;IAClB;EACA;AACI,QAAM4B,QAAO,OAAO,WAAW,IAAI,OAAO,CAAC,IAAI,iBAAiB,MAAM;AACtE,MAAIA,MAAK,SAAS,QAAQ;AACtB,WAAO,EAAE,GAAGA,OAAM,SAAS,OAAO,MAAM,MAAM,QAAQ,MAAM,QAAO;EAC3E;AACI,SAAO;IACH,MAAM;IACN,MAAMA;IACN,OAAO,QAAQ;IACf,SAAS;IACT,MAAM,MAAM;IACZ,MAAM;EACd;AACA;AACA,SAAS,oBAAoB,OAAO,mBAAmB;AACnD,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;MACH,MAAM;MACN,MAAM,QAAQ;MACd,OAAO,QAAQ;MACf,SAAS,CAAA;MACT,MAAM;MACN,MAAM;IAClB;EACA;AACI,QAAM,SAAS,CAAA;AACf,aAAW,CAACC,MAAK,KAAK,KAAK,OAAO;AAC9B,WAAO,KAAK,EAAE,MAAM,QAAQ,SAASA,KAAG,CAAE;AAC1C,WAAO,KAAK,UAAU,OAAO,iBAAiB,CAAC;EACvD;AACI,QAAMD,QAAO,OAAO,WAAW,IACzB,EAAE,MAAM,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAC,IACnC,iBAAiB,MAAM;AAC7B,MAAI,UAAUA,SAAQ,WAAWA,OAAM;AACnC,WAAO;MACH,MAAM;MACN,MAAMA,MAAK;MACX,OAAOA,MAAK;MACZ,SAAS;MACT,MAAM,MAAM;MACZ,MAAM;IAClB;EACA;AACI,SAAO;IACH,MAAM;IACN,MAAMA;IACN,OAAO,QAAQ;IACf,SAAS;IACT,MAAM,MAAM;IACZ,MAAM;EACd;AACA;AACA,SAAS,UAAU,OAAO,mBAAmB;AACzC,MAAI,MAAM,QAAQ,KAAK,GAAG;AACtB,WAAO,qBAAqB,OAAO,iBAAiB;EAC5D;AACI,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,CAACzB,SAAAA,OAAO,SAAS,KAAK,GAAG;AACxE,UAAM,UAAU,OAAO,QAAQ,KAAK;AACpC,WAAO,oBAAoB,SAAS,iBAAiB;EAC7D;AACI,SAAO,EAAE,MAAM,QAAQ,SAAS,MAAK;AACzC;;;;;;;;;;;;;ACrGA,GAAC,SAAU2B,SAAQ,SAAS;AAI1B,aAASC,QAAQ,KAAK,KAAK;AACzB,UAAI,CAAC,IAAK,OAAM,IAAI,MAAM,OAAO,kBAAkB;;AAKrD,aAASC,UAAU,MAAM,WAAW;AAClC,WAAK,SAAS;AACd,UAAI,WAAW,WAAY;MAAA;AAC3B,eAAS,YAAY,UAAU;AAC/B,WAAK,YAAY,IAAI,SAAQ;AAC7B,WAAK,UAAU,cAAc;;AAK/B,aAASC,IAAI,QAAQC,OAAM,QAAQ;AACjC,UAAID,IAAG,KAAK,MAAM,GAAG;AACnB,eAAO;;AAGT,WAAK,WAAW;AAChB,WAAK,QAAQ;AACb,WAAK,SAAS;AAGd,WAAK,MAAM;AAEX,UAAI,WAAW,MAAM;AACnB,YAAIC,UAAS,QAAQA,UAAS,MAAM;AAClC,mBAASA;AACT,UAAAA,QAAO;;AAGT,aAAK,MAAM,UAAU,GAAGA,SAAQ,IAAI,UAAU,IAAI;;;AAGtD,QAAI,OAAOJ,YAAW,UAAU;AAC9B,MAAAA,QAAO,UAAUG;IACrB,OAAS;AACL,cAAQ,KAAKA;;AAGf,IAAAA,IAAG,KAAKA;AACR,IAAAA,IAAG,WAAW;AAEd,QAAI9B;AACJ,QAAI;AACF,UAAI,OAAO,WAAW,eAAe,OAAO,OAAO,WAAW,aAAa;AACzE,QAAAA,UAAS,OAAO;MACtB,OAAW;AACL,QAAAA,UAASH,aAAkB;;aAEtB,GAAG;;AAGZ,IAAAiC,IAAG,OAAO,SAAS,KAAM,KAAK;AAC5B,UAAI,eAAeA,KAAI;AACrB,eAAO;;AAGT,aAAO,QAAQ,QAAQ,OAAO,QAAQ,YACpC,IAAI,YAAY,aAAaA,IAAG,YAAY,MAAM,QAAQ,IAAI,KAAK;IACzE;AAEE,IAAAA,IAAG,MAAM,SAASpB,KAAK,MAAM,OAAO;AAClC,UAAI,KAAK,IAAI,KAAK,IAAI,EAAG,QAAO;AAChC,aAAO;IACX;AAEE,IAAAoB,IAAG,MAAM,SAASd,KAAK,MAAM,OAAO;AAClC,UAAI,KAAK,IAAI,KAAK,IAAI,EAAG,QAAO;AAChC,aAAO;IACX;AAEE,IAAAc,IAAG,UAAU,QAAQ,SAASE,MAAM,QAAQD,OAAM,QAAQ;AACxD,UAAI,OAAO,WAAW,UAAU;AAC9B,eAAO,KAAK,YAAY,QAAQA,OAAM,MAAM;;AAG9C,UAAI,OAAO,WAAW,UAAU;AAC9B,eAAO,KAAK,WAAW,QAAQA,OAAM,MAAM;;AAG7C,UAAIA,UAAS,OAAO;AAClB,QAAAA,QAAO;;AAET,MAAAH,QAAOG,WAAUA,QAAO,MAAMA,SAAQ,KAAKA,SAAQ,EAAE;AAErD,eAAS,OAAO,SAAQ,EAAG,QAAQ,QAAQ,EAAE;AAC7C,UAAI,QAAQ;AACZ,UAAI,OAAO,CAAC,MAAM,KAAK;AACrB;AACA,aAAK,WAAW;;AAGlB,UAAI,QAAQ,OAAO,QAAQ;AACzB,YAAIA,UAAS,IAAI;AACf,eAAK,UAAU,QAAQ,OAAO,MAAM;QAC5C,OAAa;AACL,eAAK,WAAW,QAAQA,OAAM,KAAK;AACnC,cAAI,WAAW,MAAM;AACnB,iBAAK,WAAW,KAAK,QAAO,GAAIA,OAAM,MAAM;;;;IAItD;AAEE,IAAAD,IAAG,UAAU,cAAc,SAAS,YAAa,QAAQC,OAAM,QAAQ;AACrE,UAAI,SAAS,GAAG;AACd,aAAK,WAAW;AAChB,iBAAS,CAAC;;AAEZ,UAAI,SAAS,UAAW;AACtB,aAAK,QAAQ,CAAE,SAAS,QAAS;AACjC,aAAK,SAAS;MACpB,WAAe,SAAS,kBAAkB;AACpC,aAAK,QAAQ;UACX,SAAS;UACR,SAAS,WAAa;QAC/B;AACM,aAAK,SAAS;MACpB,OAAW;AACL,QAAAH,QAAO,SAAS,gBAAgB;AAChC,aAAK,QAAQ;UACX,SAAS;UACR,SAAS,WAAa;UACvB;QACR;AACM,aAAK,SAAS;;AAGhB,UAAI,WAAW,KAAM;AAGrB,WAAK,WAAW,KAAK,QAAO,GAAIG,OAAM,MAAM;IAChD;AAEE,IAAAD,IAAG,UAAU,aAAa,SAAS,WAAY,QAAQC,OAAM,QAAQ;AAEnE,MAAAH,QAAO,OAAO,OAAO,WAAW,QAAQ;AACxC,UAAI,OAAO,UAAU,GAAG;AACtB,aAAK,QAAQ,CAAE,CAAC;AAChB,aAAK,SAAS;AACd,eAAO;;AAGT,WAAK,SAAS,KAAK,KAAK,OAAO,SAAS,CAAC;AACzC,WAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;AAClC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,aAAK,MAAM,CAAC,IAAI;;AAGlB,UAAI,GAAG;AACP,UAAI,MAAM;AACV,UAAI,WAAW,MAAM;AACnB,aAAK,IAAI,OAAO,SAAS,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG;AACjD,cAAI,OAAO,CAAC,IAAK,OAAO,IAAI,CAAC,KAAK,IAAM,OAAO,IAAI,CAAC,KAAK;AACzD,eAAK,MAAM,CAAC,KAAM,KAAK,MAAO;AAC9B,eAAK,MAAM,IAAI,CAAC,IAAK,MAAO,KAAK,MAAQ;AACzC,iBAAO;AACP,cAAI,OAAO,IAAI;AACb,mBAAO;AACP;;;MAGV,WAAe,WAAW,MAAM;AAC1B,aAAK,IAAI,GAAG,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC5C,cAAI,OAAO,CAAC,IAAK,OAAO,IAAI,CAAC,KAAK,IAAM,OAAO,IAAI,CAAC,KAAK;AACzD,eAAK,MAAM,CAAC,KAAM,KAAK,MAAO;AAC9B,eAAK,MAAM,IAAI,CAAC,IAAK,MAAO,KAAK,MAAQ;AACzC,iBAAO;AACP,cAAI,OAAO,IAAI;AACb,mBAAO;AACP;;;;AAIN,aAAO,KAAK,MAAK;IACrB;AAEE,aAAS,cAAe,QAAQK,QAAO;AACrC,UAAI,IAAI,OAAO,WAAWA,MAAK;AAE/B,UAAI,KAAK,MAAM,KAAK,IAAI;AACtB,eAAO,IAAI;iBAEF,KAAK,MAAM,KAAK,KAAK;AAC9B,eAAO,IAAI;MAEjB,OAAW;AACL,eAAQ,IAAI,KAAM;;;AAItB,aAAS,aAAc,QAAQ,YAAYA,QAAO;AAChD,UAAIC,KAAI,cAAc,QAAQD,MAAK;AACnC,UAAIA,SAAQ,KAAK,YAAY;AAC3B,QAAAC,MAAK,cAAc,QAAQD,SAAQ,CAAC,KAAK;;AAE3C,aAAOC;;AAGT,IAAAJ,IAAG,UAAU,YAAY,SAAS,UAAW,QAAQ,OAAO,QAAQ;AAElE,WAAK,SAAS,KAAK,MAAM,OAAO,SAAS,SAAS,CAAC;AACnD,WAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;AAClC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,aAAK,MAAM,CAAC,IAAI;;AAIlB,UAAI,MAAM;AACV,UAAI,IAAI;AAER,UAAI;AACJ,UAAI,WAAW,MAAM;AACnB,aAAK,IAAI,OAAO,SAAS,GAAG,KAAK,OAAO,KAAK,GAAG;AAC9C,cAAI,aAAa,QAAQ,OAAO,CAAC,KAAK;AACtC,eAAK,MAAM,CAAC,KAAK,IAAI;AACrB,cAAI,OAAO,IAAI;AACb,mBAAO;AACP,iBAAK;AACL,iBAAK,MAAM,CAAC,KAAK,MAAM;UACjC,OAAe;AACL,mBAAO;;;MAGjB,OAAW;AACL,YAAI,cAAc,OAAO,SAAS;AAClC,aAAK,IAAI,cAAc,MAAM,IAAI,QAAQ,IAAI,OAAO,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC7E,cAAI,aAAa,QAAQ,OAAO,CAAC,KAAK;AACtC,eAAK,MAAM,CAAC,KAAK,IAAI;AACrB,cAAI,OAAO,IAAI;AACb,mBAAO;AACP,iBAAK;AACL,iBAAK,MAAM,CAAC,KAAK,MAAM;UACjC,OAAe;AACL,mBAAO;;;;AAKb,WAAK,MAAK;IACd;AAEE,aAAS,UAAW,KAAK,OAAO,KAAKjB,MAAK;AACxC,UAAIqB,KAAI;AACR,UAAI,MAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAClC,eAAS,IAAI,OAAO,IAAI,KAAK,KAAK;AAChC,YAAI,IAAI,IAAI,WAAW,CAAC,IAAI;AAE5B,QAAAA,MAAKrB;AAGL,YAAI,KAAK,IAAI;AACX,UAAAqB,MAAK,IAAI,KAAK;QAGtB,WAAiB,KAAK,IAAI;AAClB,UAAAA,MAAK,IAAI,KAAK;QAGtB,OAAa;AACL,UAAAA,MAAK;;;AAGT,aAAOA;;AAGT,IAAAJ,IAAG,UAAU,aAAa,SAAS,WAAY,QAAQC,OAAM,OAAO;AAElE,WAAK,QAAQ,CAAE,CAAC;AAChB,WAAK,SAAS;AAGd,eAAS,UAAU,GAAG,UAAU,GAAG,WAAW,UAAW,WAAWA,OAAM;AACxE;;AAEF;AACA,gBAAW,UAAUA,QAAQ;AAE7B,UAAI,QAAQ,OAAO,SAAS;AAC5B,UAAII,OAAM,QAAQ;AAClB,UAAI,MAAM,KAAK,IAAI,OAAO,QAAQA,IAAG,IAAI;AAEzC,UAAI,OAAO;AACX,eAAS,IAAI,OAAO,IAAI,KAAK,KAAK,SAAS;AACzC,eAAO,UAAU,QAAQ,GAAG,IAAI,SAASJ,KAAI;AAE7C,aAAK,MAAM,OAAO;AAClB,YAAI,KAAK,MAAM,CAAC,IAAI,OAAO,UAAW;AACpC,eAAK,MAAM,CAAC,KAAK;QACzB,OAAa;AACL,eAAK,OAAO,IAAI;;;AAIpB,UAAII,SAAQ,GAAG;AACb,YAAIC,OAAM;AACV,eAAO,UAAU,QAAQ,GAAG,OAAO,QAAQL,KAAI;AAE/C,aAAK,IAAI,GAAG,IAAII,MAAK,KAAK;AACxB,UAAAC,QAAOL;;AAGT,aAAK,MAAMK,IAAG;AACd,YAAI,KAAK,MAAM,CAAC,IAAI,OAAO,UAAW;AACpC,eAAK,MAAM,CAAC,KAAK;QACzB,OAAa;AACL,eAAK,OAAO,IAAI;;;AAIpB,WAAK,MAAK;IACd;AAEE,IAAAN,IAAG,UAAU,OAAO,SAAS,KAAM,MAAM;AACvC,WAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;AAClC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,aAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC;;AAE9B,WAAK,SAAS,KAAK;AACnB,WAAK,WAAW,KAAK;AACrB,WAAK,MAAM,KAAK;IACpB;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAASO,SAAS;AACrC,UAAIH,KAAI,IAAIJ,IAAG,IAAI;AACnB,WAAK,KAAKI,EAAC;AACX,aAAOA;IACX;AAEE,IAAAJ,IAAG,UAAU,UAAU,SAAS,QAAS,MAAM;AAC7C,aAAO,KAAK,SAAS,MAAM;AACzB,aAAK,MAAM,KAAK,QAAQ,IAAI;;AAE9B,aAAO;IACX;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,QAAS;AACrC,aAAO,KAAK,SAAS,KAAK,KAAK,MAAM,KAAK,SAAS,CAAC,MAAM,GAAG;AAC3D,aAAK;;AAEP,aAAO,KAAK,UAAS;IACzB;AAEE,IAAAA,IAAG,UAAU,YAAY,SAAS,YAAa;AAE7C,UAAI,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,MAAM,GAAG;AAC5C,aAAK,WAAW;;AAElB,aAAO;IACX;AAEE,IAAAA,IAAG,UAAU,UAAU,SAASrB,WAAW;AACzC,cAAQ,KAAK,MAAM,YAAY,WAAW,KAAK,SAAS,EAAE,IAAI;IAClE;AAgCE,QAAI,QAAQ;MACV;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;IACJ;AAEE,QAAI,aAAa;MACf;MAAG;MACH;MAAI;MAAI;MAAI;MAAI;MAAI;MAAG;MACvB;MAAG;MAAG;MAAG;MAAG;MAAG;MAAG;MAClB;MAAG;MAAG;MAAG;MAAG;MAAG;MAAG;MAClB;MAAG;MAAG;MAAG;MAAG;MAAG;MAAG;MAClB;MAAG;MAAG;MAAG;MAAG;MAAG;MAAG;IACtB;AAEE,QAAI,aAAa;MACf;MAAG;MACH;MAAU;MAAU;MAAU;MAAU;MAAU;MAAU;MAC5D;MAAU;MAAU;MAAU;MAAU;MAAU;MAAS;MAC3D;MAAU;MAAU;MAAU;MAAU;MAAU;MAAS;MAC3D;MAAS;MAAS;MAAS;MAAU;MAAU;MAAU;MACzD;MAAU;MAAU;MAAU;MAAU;MAAU;MAAU;IAChE;AAEE,IAAAqB,IAAG,UAAU,WAAW,SAAStB,UAAUuB,OAAM,SAAS;AACxD,MAAAA,QAAOA,SAAQ;AACf,gBAAU,UAAU,KAAK;AAEzB,UAAI;AACJ,UAAIA,UAAS,MAAMA,UAAS,OAAO;AACjC,cAAM;AACN,YAAI,MAAM;AACV,YAAI,QAAQ;AACZ,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAI,IAAI,KAAK,MAAM,CAAC;AACpB,cAAI,SAAU,KAAK,MAAO,SAAS,UAAU,SAAS,EAAE;AACxD,kBAAS,MAAO,KAAK,MAAQ;AAC7B,iBAAO;AACP,cAAI,OAAO,IAAI;AACb,mBAAO;AACP;;AAEF,cAAI,UAAU,KAAK,MAAM,KAAK,SAAS,GAAG;AACxC,kBAAM,MAAM,IAAI,KAAK,MAAM,IAAI,OAAO;UAChD,OAAe;AACL,kBAAM,OAAO;;;AAGjB,YAAI,UAAU,GAAG;AACf,gBAAM,MAAM,SAAS,EAAE,IAAI;;AAE7B,eAAO,IAAI,SAAS,YAAY,GAAG;AACjC,gBAAM,MAAM;;AAEd,YAAI,KAAK,aAAa,GAAG;AACvB,gBAAM,MAAM;;AAEd,eAAO;;AAGT,UAAIA,WAAUA,QAAO,MAAMA,SAAQ,KAAKA,SAAQ,IAAI;AAElD,YAAI,YAAY,WAAWA,KAAI;AAE/B,YAAI,YAAY,WAAWA,KAAI;AAC/B,cAAM;AACN,YAAI,IAAI,KAAK,MAAK;AAClB,UAAE,WAAW;AACb,eAAO,CAAC,EAAE,OAAM,GAAI;AAClB,cAAIG,KAAI,EAAE,KAAK,SAAS,EAAE,SAASH,KAAI;AACvC,cAAI,EAAE,MAAM,SAAS;AAErB,cAAI,CAAC,EAAE,OAAM,GAAI;AACf,kBAAM,MAAM,YAAYG,GAAE,MAAM,IAAIA,KAAI;UAClD,OAAe;AACL,kBAAMA,KAAI;;;AAGd,YAAI,KAAK,OAAM,GAAI;AACjB,gBAAM,MAAM;;AAEd,eAAO,IAAI,SAAS,YAAY,GAAG;AACjC,gBAAM,MAAM;;AAEd,YAAI,KAAK,aAAa,GAAG;AACvB,gBAAM,MAAM;;AAEd,eAAO;;AAGT,MAAAN,QAAO,OAAO,iCAAiC;IACnD;AAEE,IAAAE,IAAG,UAAU,WAAW,SAAS,WAAY;AAC3C,UAAI,MAAM,KAAK,MAAM,CAAC;AACtB,UAAI,KAAK,WAAW,GAAG;AACrB,eAAO,KAAK,MAAM,CAAC,IAAI;MAC7B,WAAe,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,MAAM,GAAM;AAEtD,eAAO,mBAAoB,KAAK,MAAM,CAAC,IAAI;MACjD,WAAe,KAAK,SAAS,GAAG;AAC1B,QAAAF,QAAO,OAAO,4CAA4C;;AAE5D,aAAQ,KAAK,aAAa,IAAK,CAAC,MAAM;IAC1C;AAEE,IAAAE,IAAG,UAAU,SAAS,SAASlB,UAAU;AACvC,aAAO,KAAK,SAAS,EAAE;IAC3B;AAEE,IAAAkB,IAAG,UAAU,WAAW,SAASQ,UAAU,QAAQ,QAAQ;AACzD,MAAAV,QAAO,OAAO5B,YAAW,WAAW;AACpC,aAAO,KAAK,YAAYA,SAAQ,QAAQ,MAAM;IAClD;AAEE,IAAA8B,IAAG,UAAU,UAAU,SAASS,SAAS,QAAQ,QAAQ;AACvD,aAAO,KAAK,YAAY,OAAO,QAAQ,MAAM;IACjD;AAEE,IAAAT,IAAG,UAAU,cAAc,SAAS,YAAa,WAAW,QAAQ,QAAQ;AAC1E,UAAI3B,cAAa,KAAK,WAAU;AAChC,UAAI,YAAY,UAAU,KAAK,IAAI,GAAGA,WAAU;AAChD,MAAAyB,QAAOzB,eAAc,WAAW,uCAAuC;AACvE,MAAAyB,QAAO,YAAY,GAAG,6BAA6B;AAEnD,WAAK,MAAK;AACV,UAAI,eAAe,WAAW;AAC9B,UAAI,MAAM,IAAI,UAAU,SAAS;AAEjC,UAAI,GAAG;AACP,UAAI,IAAI,KAAK,MAAK;AAClB,UAAI,CAAC,cAAc;AAEjB,aAAK,IAAI,GAAG,IAAI,YAAYzB,aAAY,KAAK;AAC3C,cAAI,CAAC,IAAI;;AAGX,aAAK,IAAI,GAAG,CAAC,EAAE,OAAM,GAAI,KAAK;AAC5B,cAAI,EAAE,MAAM,GAAI;AAChB,YAAE,OAAO,CAAC;AAEV,cAAI,YAAY,IAAI,CAAC,IAAI;;MAEjC,OAAW;AACL,aAAK,IAAI,GAAG,CAAC,EAAE,OAAM,GAAI,KAAK;AAC5B,cAAI,EAAE,MAAM,GAAI;AAChB,YAAE,OAAO,CAAC;AAEV,cAAI,CAAC,IAAI;;AAGX,eAAO,IAAI,WAAW,KAAK;AACzB,cAAI,CAAC,IAAI;;;AAIb,aAAO;IACX;AAEE,QAAI,KAAK,OAAO;AACd,MAAA2B,IAAG,UAAU,aAAa,SAAS,WAAY,GAAG;AAChD,eAAO,KAAK,KAAK,MAAM,CAAC;MAC9B;IACA,OAAS;AACL,MAAAA,IAAG,UAAU,aAAa,SAAS,WAAY,GAAG;AAChD,YAAI,IAAI;AACR,YAAII,KAAI;AACR,YAAI,KAAK,MAAQ;AACf,UAAAA,MAAK;AACL,iBAAO;;AAET,YAAI,KAAK,IAAM;AACb,UAAAA,MAAK;AACL,iBAAO;;AAET,YAAI,KAAK,GAAK;AACZ,UAAAA,MAAK;AACL,iBAAO;;AAET,YAAI,KAAK,GAAM;AACb,UAAAA,MAAK;AACL,iBAAO;;AAET,eAAOA,KAAI;MACjB;;AAGE,IAAAJ,IAAG,UAAU,YAAY,SAAS,UAAW,GAAG;AAE9C,UAAI,MAAM,EAAG,QAAO;AAEpB,UAAI,IAAI;AACR,UAAII,KAAI;AACR,WAAK,IAAI,UAAY,GAAG;AACtB,QAAAA,MAAK;AACL,eAAO;;AAET,WAAK,IAAI,SAAU,GAAG;AACpB,QAAAA,MAAK;AACL,eAAO;;AAET,WAAK,IAAI,QAAS,GAAG;AACnB,QAAAA,MAAK;AACL,eAAO;;AAET,WAAK,IAAI,OAAS,GAAG;AACnB,QAAAA,MAAK;AACL,eAAO;;AAET,WAAK,IAAI,OAAS,GAAG;AACnB,QAAAA;;AAEF,aAAOA;IACX;AAGE,IAAAJ,IAAG,UAAU,YAAY,SAAS,YAAa;AAC7C,UAAI,IAAI,KAAK,MAAM,KAAK,SAAS,CAAC;AAClC,UAAI,KAAK,KAAK,WAAW,CAAC;AAC1B,cAAQ,KAAK,SAAS,KAAK,KAAK;IACpC;AAEE,aAAS,WAAY,KAAK;AACxB,UAAI,IAAI,IAAI,MAAM,IAAI,UAAS,CAAE;AAEjC,eAAS,MAAM,GAAG,MAAM,EAAE,QAAQ,OAAO;AACvC,YAAI,MAAO,MAAM,KAAM;AACvB,YAAI,OAAO,MAAM;AAEjB,UAAE,GAAG,KAAK,IAAI,MAAM,GAAG,IAAK,KAAK,UAAW;;AAG9C,aAAO;;AAIT,IAAAA,IAAG,UAAU,WAAW,SAAS,WAAY;AAC3C,UAAI,KAAK,OAAM,EAAI,QAAO;AAE1B,UAAII,KAAI;AACR,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAI,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,CAAC;AACpC,QAAAA,MAAK;AACL,YAAI,MAAM,GAAI;;AAEhB,aAAOA;IACX;AAEE,IAAAJ,IAAG,UAAU,aAAa,SAAS3B,cAAc;AAC/C,aAAO,KAAK,KAAK,KAAK,UAAS,IAAK,CAAC;IACzC;AAEE,IAAA2B,IAAG,UAAU,SAAS,SAAS,OAAQ,OAAO;AAC5C,UAAI,KAAK,aAAa,GAAG;AACvB,eAAO,KAAK,IAAG,EAAG,MAAM,KAAK,EAAE,MAAM,CAAC;;AAExC,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAA,IAAG,UAAU,WAAW,SAAS,SAAU,OAAO;AAChD,UAAI,KAAK,MAAM,QAAQ,CAAC,GAAG;AACzB,eAAO,KAAK,KAAK,KAAK,EAAE,MAAM,CAAC,EAAE,KAAI;;AAEvC,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,QAAS;AACrC,aAAO,KAAK,aAAa;IAC7B;AAGE,IAAAA,IAAG,UAAU,MAAM,SAASU,OAAO;AACjC,aAAO,KAAK,MAAK,EAAG,KAAI;IAC5B;AAEE,IAAAV,IAAG,UAAU,OAAO,SAAS,OAAQ;AACnC,UAAI,CAAC,KAAK,OAAM,GAAI;AAClB,aAAK,YAAY;;AAGnB,aAAO;IACX;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,SAAS,IAAI,QAAQ;AAC/B,aAAK,MAAM,KAAK,QAAQ,IAAI;;AAG9B,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,aAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC;;AAG7C,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,MAAAF,SAAQ,KAAK,WAAW,IAAI,cAAc,CAAC;AAC3C,aAAO,KAAK,KAAK,GAAG;IACxB;AAGE,IAAAE,IAAG,UAAU,KAAK,SAAS,GAAI,KAAK;AAClC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,IAAI,GAAG;AACzD,aAAO,IAAI,MAAK,EAAG,IAAI,IAAI;IAC/B;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,KAAK,GAAG;AAC1D,aAAO,IAAI,MAAK,EAAG,KAAK,IAAI;IAChC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AAExC,UAAI;AACJ,UAAI,KAAK,SAAS,IAAI,QAAQ;AAC5B,YAAI;MACV,OAAW;AACL,YAAI;;AAGN,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,aAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC;;AAG7C,WAAK,SAAS,EAAE;AAEhB,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,MAAAF,SAAQ,KAAK,WAAW,IAAI,cAAc,CAAC;AAC3C,aAAO,KAAK,MAAM,GAAG;IACzB;AAGE,IAAAE,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,KAAK,GAAG;AAC1D,aAAO,IAAI,MAAK,EAAG,KAAK,IAAI;IAChC;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,MAAM,GAAG;AAC3D,aAAO,IAAI,MAAK,EAAG,MAAM,IAAI;IACjC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AAExC,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK,SAAS,IAAI,QAAQ;AAC5B,YAAI;AACJ,YAAI;MACV,OAAW;AACL,YAAI;AACJ,YAAI;;AAGN,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,aAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;;AAGxC,UAAI,SAAS,GAAG;AACd,eAAO,IAAI,EAAE,QAAQ,KAAK;AACxB,eAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;;;AAI7B,WAAK,SAAS,EAAE;AAEhB,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,MAAAF,SAAQ,KAAK,WAAW,IAAI,cAAc,CAAC;AAC3C,aAAO,KAAK,MAAM,GAAG;IACzB;AAGE,IAAAE,IAAG,UAAU,MAAM,SAASW,KAAK,KAAK;AACpC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,KAAK,GAAG;AAC1D,aAAO,IAAI,MAAK,EAAG,KAAK,IAAI;IAChC;AAEE,IAAAX,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,MAAM,GAAG;AAC3D,aAAO,IAAI,MAAK,EAAG,MAAM,IAAI;IACjC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,OAAO;AAC1C,MAAAF,QAAO,OAAO,UAAU,YAAY,SAAS,CAAC;AAE9C,UAAI,cAAc,KAAK,KAAK,QAAQ,EAAE,IAAI;AAC1C,UAAI,WAAW,QAAQ;AAGvB,WAAK,QAAQ,WAAW;AAExB,UAAI,WAAW,GAAG;AAChB;;AAIF,eAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,aAAK,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI;;AAInC,UAAI,WAAW,GAAG;AAChB,aAAK,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,IAAK,YAAc,KAAK;;AAIvD,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,OAAO;AACxC,aAAO,KAAK,MAAK,EAAG,MAAM,KAAK;IACnC;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK,KAAK;AAC3C,MAAAF,QAAO,OAAO,QAAQ,YAAY,OAAO,CAAC;AAE1C,UAAI,MAAO,MAAM,KAAM;AACvB,UAAI,OAAO,MAAM;AAEjB,WAAK,QAAQ,MAAM,CAAC;AAEpB,UAAI,KAAK;AACP,aAAK,MAAM,GAAG,IAAI,KAAK,MAAM,GAAG,IAAK,KAAK;MAChD,OAAW;AACL,aAAK,MAAM,GAAG,IAAI,KAAK,MAAM,GAAG,IAAI,EAAE,KAAK;;AAG7C,aAAO,KAAK,MAAK;IACrB;AAGE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,UAAII;AAGJ,UAAI,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AAC7C,aAAK,WAAW;AAChB,QAAAA,KAAI,KAAK,KAAK,GAAG;AACjB,aAAK,YAAY;AACjB,eAAO,KAAK,UAAS;MAG3B,WAAe,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AACpD,YAAI,WAAW;AACf,QAAAA,KAAI,KAAK,KAAK,GAAG;AACjB,YAAI,WAAW;AACf,eAAOA,GAAE,UAAS;;AAIpB,UAAI,GAAG;AACP,UAAI,KAAK,SAAS,IAAI,QAAQ;AAC5B,YAAI;AACJ,YAAI;MACV,OAAW;AACL,YAAI;AACJ,YAAI;;AAGN,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK;AAC1C,aAAK,MAAM,CAAC,IAAIA,KAAI;AACpB,gBAAQA,OAAM;;AAEhB,aAAO,UAAU,KAAK,IAAI,EAAE,QAAQ,KAAK;AACvC,QAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,KAAK;AACvB,aAAK,MAAM,CAAC,IAAIA,KAAI;AACpB,gBAAQA,OAAM;;AAGhB,WAAK,SAAS,EAAE;AAChB,UAAI,UAAU,GAAG;AACf,aAAK,MAAM,KAAK,MAAM,IAAI;AAC1B,aAAK;MAEX,WAAe,MAAM,MAAM;AACrB,eAAO,IAAI,EAAE,QAAQ,KAAK;AACxB,eAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;;;AAI7B,aAAO;IACX;AAGE,IAAAJ,IAAG,UAAU,MAAM,SAASY,KAAK,KAAK;AACpC,UAAI;AACJ,UAAI,IAAI,aAAa,KAAK,KAAK,aAAa,GAAG;AAC7C,YAAI,WAAW;AACf,cAAM,KAAK,IAAI,GAAG;AAClB,YAAI,YAAY;AAChB,eAAO;MACb,WAAe,IAAI,aAAa,KAAK,KAAK,aAAa,GAAG;AACpD,aAAK,WAAW;AAChB,cAAM,IAAI,IAAI,IAAI;AAClB,aAAK,WAAW;AAChB,eAAO;;AAGT,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,KAAK,GAAG;AAE1D,aAAO,IAAI,MAAK,EAAG,KAAK,IAAI;IAChC;AAGE,IAAAZ,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AAEtC,UAAI,IAAI,aAAa,GAAG;AACtB,YAAI,WAAW;AACf,YAAII,KAAI,KAAK,KAAK,GAAG;AACrB,YAAI,WAAW;AACf,eAAOA,GAAE,UAAS;MAGxB,WAAe,KAAK,aAAa,GAAG;AAC9B,aAAK,WAAW;AAChB,aAAK,KAAK,GAAG;AACb,aAAK,WAAW;AAChB,eAAO,KAAK,UAAS;;AAIvB,UAAI,MAAM,KAAK,IAAI,GAAG;AAGtB,UAAI,QAAQ,GAAG;AACb,aAAK,WAAW;AAChB,aAAK,SAAS;AACd,aAAK,MAAM,CAAC,IAAI;AAChB,eAAO;;AAIT,UAAI,GAAG;AACP,UAAI,MAAM,GAAG;AACX,YAAI;AACJ,YAAI;MACV,OAAW;AACL,YAAI;AACJ,YAAI;;AAGN,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK;AAC1C,gBAAQA,MAAK;AACb,aAAK,MAAM,CAAC,IAAIA,KAAI;;AAEtB,aAAO,UAAU,KAAK,IAAI,EAAE,QAAQ,KAAK;AACvC,QAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,KAAK;AACvB,gBAAQA,MAAK;AACb,aAAK,MAAM,CAAC,IAAIA,KAAI;;AAItB,UAAI,UAAU,KAAK,IAAI,EAAE,UAAU,MAAM,MAAM;AAC7C,eAAO,IAAI,EAAE,QAAQ,KAAK;AACxB,eAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;;;AAI7B,WAAK,SAAS,KAAK,IAAI,KAAK,QAAQ,CAAC;AAErC,UAAI,MAAM,MAAM;AACd,aAAK,WAAW;;AAGlB,aAAO,KAAK,MAAK;IACrB;AAGE,IAAAJ,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,MAAK,EAAG,KAAK,GAAG;IAChC;AAEE,aAAS,WAAYa,OAAM,KAAK,KAAK;AACnC,UAAI,WAAW,IAAI,WAAWA,MAAK;AACnC,UAAI,MAAOA,MAAK,SAAS,IAAI,SAAU;AACvC,UAAI,SAAS;AACb,YAAO,MAAM,IAAK;AAGlB,UAAI,IAAIA,MAAK,MAAM,CAAC,IAAI;AACxB,UAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AACvB,UAAIT,KAAI,IAAI;AAEZ,UAAI,KAAKA,KAAI;AACb,UAAI,QAASA,KAAI,WAAa;AAC9B,UAAI,MAAM,CAAC,IAAI;AAEf,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAG5B,YAAI,SAAS,UAAU;AACvB,YAAI,QAAQ,QAAQ;AACpB,YAAI,OAAO,KAAK,IAAI,GAAG,IAAI,SAAS,CAAC;AACrC,iBAAS,IAAI,KAAK,IAAI,GAAG,IAAIS,MAAK,SAAS,CAAC,GAAG,KAAK,MAAM,KAAK;AAC7D,cAAI,IAAK,IAAI,IAAK;AAClB,cAAIA,MAAK,MAAM,CAAC,IAAI;AACpB,cAAI,IAAI,MAAM,CAAC,IAAI;AACnB,UAAAT,KAAI,IAAI,IAAI;AACZ,oBAAWA,KAAI,WAAa;AAC5B,kBAAQA,KAAI;;AAEd,YAAI,MAAM,CAAC,IAAI,QAAQ;AACvB,gBAAQ,SAAS;;AAEnB,UAAI,UAAU,GAAG;AACf,YAAI,MAAM,CAAC,IAAI,QAAQ;MAC7B,OAAW;AACL,YAAI;;AAGN,aAAO,IAAI,MAAK;;AAMlB,QAAI,cAAc,SAASU,aAAaD,OAAM,KAAK,KAAK;AACtD,UAAI,IAAIA,MAAK;AACb,UAAI,IAAI,IAAI;AACZ,UAAI,IAAI,IAAI;AACZ,UAAI,IAAI;AACR,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AAEjB,UAAI,WAAWA,MAAK,WAAW,IAAI;AACnC,UAAI,SAAS;AAEb,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,UAAI,MAAM,GAAG;AACX,UAAE,EAAE,IAAI;AACR,YAAI;;AAEN,aAAO;IACX;AAGE,QAAI,CAAC,KAAK,MAAM;AACd,oBAAc;;AAGhB,aAAS,SAAUA,OAAM,KAAK,KAAK;AACjC,UAAI,WAAW,IAAI,WAAWA,MAAK;AACnC,UAAI,SAASA,MAAK,SAAS,IAAI;AAE/B,UAAI,QAAQ;AACZ,UAAI,UAAU;AACd,eAAS,IAAI,GAAG,IAAI,IAAI,SAAS,GAAG,KAAK;AAGvC,YAAI,SAAS;AACb,kBAAU;AACV,YAAI,QAAQ,QAAQ;AACpB,YAAI,OAAO,KAAK,IAAI,GAAG,IAAI,SAAS,CAAC;AACrC,iBAAS,IAAI,KAAK,IAAI,GAAG,IAAIA,MAAK,SAAS,CAAC,GAAG,KAAK,MAAM,KAAK;AAC7D,cAAI,IAAI,IAAI;AACZ,cAAI,IAAIA,MAAK,MAAM,CAAC,IAAI;AACxB,cAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AACvB,cAAIT,KAAI,IAAI;AAEZ,cAAI,KAAKA,KAAI;AACb,mBAAU,UAAWA,KAAI,WAAa,KAAM;AAC5C,eAAM,KAAK,QAAS;AACpB,kBAAQ,KAAK;AACb,mBAAU,UAAU,OAAO,MAAO;AAElC,qBAAW,WAAW;AACtB,oBAAU;;AAEZ,YAAI,MAAM,CAAC,IAAI;AACf,gBAAQ;AACR,iBAAS;;AAEX,UAAI,UAAU,GAAG;AACf,YAAI,MAAM,CAAC,IAAI;MACrB,OAAW;AACL,YAAI;;AAGN,aAAO,IAAI,MAAK;;AAGlB,aAAS,WAAYS,OAAM,KAAK,KAAK;AACnC,UAAI,OAAO,IAAI,KAAI;AACnB,aAAO,KAAK,KAAKA,OAAM,KAAK,GAAG;;AAGjC,IAAAb,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK,KAAK;AAC7C,UAAI;AACJ,UAAI,MAAM,KAAK,SAAS,IAAI;AAC5B,UAAI,KAAK,WAAW,MAAM,IAAI,WAAW,IAAI;AAC3C,cAAM,YAAY,MAAM,KAAK,GAAG;MACtC,WAAe,MAAM,IAAI;AACnB,cAAM,WAAW,MAAM,KAAK,GAAG;MACrC,WAAe,MAAM,MAAM;AACrB,cAAM,SAAS,MAAM,KAAK,GAAG;MACnC,OAAW;AACL,cAAM,WAAW,MAAM,KAAK,GAAG;;AAGjC,aAAO;IACX;AAKE,aAAS,KAAM,GAAG,GAAG;AACnB,WAAK,IAAI;AACT,WAAK,IAAI;;AAGX,SAAK,UAAU,UAAU,SAAS,QAAS,GAAG;AAC5C,UAAI,IAAI,IAAI,MAAM,CAAC;AACnB,UAAI,IAAIA,IAAG,UAAU,WAAW,CAAC,IAAI;AACrC,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAE,CAAC,IAAI,KAAK,OAAO,GAAG,GAAG,CAAC;;AAG5B,aAAO;IACX;AAGE,SAAK,UAAU,SAAS,SAAS,OAAQ,GAAG,GAAG,GAAG;AAChD,UAAI,MAAM,KAAK,MAAM,IAAI,EAAG,QAAO;AAEnC,UAAI,KAAK;AACT,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAO,IAAI,MAAO,IAAI,IAAI;AAC1B,cAAM;;AAGR,aAAO;IACX;AAIE,SAAK,UAAU,UAAU,SAASe,SAAS,KAAK,KAAK,KAAK,MAAM,MAAM,GAAG;AACvE,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAK,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;AACpB,aAAK,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;;IAE1B;AAEE,SAAK,UAAU,YAAY,SAAS,UAAW,KAAK,KAAK,MAAM,MAAM,GAAG,KAAK;AAC3E,WAAK,QAAQ,KAAK,KAAK,KAAK,MAAM,MAAM,CAAC;AAEzC,eAASjD,KAAI,GAAGA,KAAI,GAAGA,OAAM,GAAG;AAC9B,YAAI,IAAIA,MAAK;AAEb,YAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AACpC,YAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AAEpC,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC7B,cAAI,SAAS;AACb,cAAI,SAAS;AAEb,mBAAS,IAAI,GAAG,IAAIA,IAAG,KAAK;AAC1B,gBAAI,KAAK,KAAK,IAAI,CAAC;AACnB,gBAAI,KAAK,KAAK,IAAI,CAAC;AAEnB,gBAAI,KAAK,KAAK,IAAI,IAAIA,EAAC;AACvB,gBAAI,KAAK,KAAK,IAAI,IAAIA,EAAC;AAEvB,gBAAI,KAAK,SAAS,KAAK,SAAS;AAEhC,iBAAK,SAAS,KAAK,SAAS;AAC5B,iBAAK;AAEL,iBAAK,IAAI,CAAC,IAAI,KAAK;AACnB,iBAAK,IAAI,CAAC,IAAI,KAAK;AAEnB,iBAAK,IAAI,IAAIA,EAAC,IAAI,KAAK;AACvB,iBAAK,IAAI,IAAIA,EAAC,IAAI,KAAK;AAGvB,gBAAI,MAAM,GAAG;AACX,mBAAK,QAAQ,SAAS,QAAQ;AAE9B,uBAAS,QAAQ,SAAS,QAAQ;AAClC,uBAAS;;;;;IAKrB;AAEE,SAAK,UAAU,cAAc,SAAS,YAAa,GAAG,GAAG;AACvD,UAAI,IAAI,KAAK,IAAI,GAAG,CAAC,IAAI;AACzB,UAAI,MAAM,IAAI;AACd,UAAI,IAAI;AACR,WAAK,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,MAAM,GAAG;AAClC;;AAGF,aAAO,KAAK,IAAI,IAAI;IACxB;AAEE,SAAK,UAAU,YAAY,SAAS,UAAW,KAAK,KAAK,GAAG;AAC1D,UAAI,KAAK,EAAG;AAEZ,eAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,YAAI,IAAI,IAAI,CAAC;AAEb,YAAI,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC;AACtB,YAAI,IAAI,IAAI,CAAC,IAAI;AAEjB,YAAI,IAAI,CAAC;AAET,YAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;AACvB,YAAI,IAAI,IAAI,CAAC,IAAI,CAAC;;IAExB;AAEE,SAAK,UAAU,eAAe,SAAS,aAAc,IAAI,GAAG;AAC1D,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,YAAI,IAAI,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,OACtC,KAAK,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IACxB;AAEF,WAAG,CAAC,IAAI,IAAI;AAEZ,YAAI,IAAI,UAAW;AACjB,kBAAQ;QAChB,OAAa;AACL,kBAAQ,IAAI,WAAY;;;AAI5B,aAAO;IACX;AAEE,SAAK,UAAU,aAAa,SAAS,WAAY,IAAI,KAAK,KAAK,GAAG;AAChE,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,gBAAQ,SAAS,GAAG,CAAC,IAAI;AAEzB,YAAI,IAAI,CAAC,IAAI,QAAQ;AAAQ,gBAAQ,UAAU;AAC/C,YAAI,IAAI,IAAI,CAAC,IAAI,QAAQ;AAAQ,gBAAQ,UAAU;;AAIrD,WAAK,IAAI,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG;AAC5B,YAAI,CAAC,IAAI;;AAGX,MAAAgC,QAAO,UAAU,CAAC;AAClB,MAAAA,SAAQ,QAAQ,CAAC,UAAY,CAAC;IAClC;AAEE,SAAK,UAAU,OAAO,SAASkB,MAAM,GAAG;AACtC,UAAI,KAAK,IAAI,MAAM,CAAC;AACpB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,WAAG,CAAC,IAAI;;AAGV,aAAO;IACX;AAEE,SAAK,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG,KAAK;AAC9C,UAAI,IAAI,IAAI,KAAK,YAAY,EAAE,QAAQ,EAAE,MAAM;AAE/C,UAAI,MAAM,KAAK,QAAQ,CAAC;AAExB,UAAI,IAAI,KAAK,KAAK,CAAC;AAEnB,UAAI,MAAM,IAAI,MAAM,CAAC;AACrB,UAAI,OAAO,IAAI,MAAM,CAAC;AACtB,UAAI,OAAO,IAAI,MAAM,CAAC;AAEtB,UAAI,OAAO,IAAI,MAAM,CAAC;AACtB,UAAI,QAAQ,IAAI,MAAM,CAAC;AACvB,UAAI,QAAQ,IAAI,MAAM,CAAC;AAEvB,UAAI,OAAO,IAAI;AACf,WAAK,SAAS;AAEd,WAAK,WAAW,EAAE,OAAO,EAAE,QAAQ,KAAK,CAAC;AACzC,WAAK,WAAW,EAAE,OAAO,EAAE,QAAQ,MAAM,CAAC;AAE1C,WAAK,UAAU,KAAK,GAAG,MAAM,MAAM,GAAG,GAAG;AACzC,WAAK,UAAU,MAAM,GAAG,OAAO,OAAO,GAAG,GAAG;AAE5C,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,KAAK,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC;AAC/C,aAAK,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC;AAChD,aAAK,CAAC,IAAI;;AAGZ,WAAK,UAAU,MAAM,MAAM,CAAC;AAC5B,WAAK,UAAU,MAAM,MAAM,MAAM,GAAG,GAAG,GAAG;AAC1C,WAAK,UAAU,MAAM,GAAG,CAAC;AACzB,WAAK,aAAa,MAAM,CAAC;AAEzB,UAAI,WAAW,EAAE,WAAW,EAAE;AAC9B,UAAI,SAAS,EAAE,SAAS,EAAE;AAC1B,aAAO,IAAI,MAAK;IACpB;AAGE,IAAAhB,IAAG,UAAU,MAAM,SAASjB,KAAK,KAAK;AACpC,UAAI,MAAM,IAAIiB,IAAG,IAAI;AACrB,UAAI,QAAQ,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM;AAC9C,aAAO,KAAK,MAAM,KAAK,GAAG;IAC9B;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,UAAI,MAAM,IAAIA,IAAG,IAAI;AACrB,UAAI,QAAQ,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM;AAC9C,aAAO,WAAW,MAAM,KAAK,GAAG;IACpC;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAK,EAAG,MAAM,KAAK,IAAI;IACvC;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,MAAAA,QAAO,MAAM,QAAS;AAGtB,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAI,KAAK,KAAK,MAAM,CAAC,IAAI,KAAK;AAC9B,YAAI,MAAM,IAAI,aAAc,QAAQ;AACpC,kBAAU;AACV,iBAAU,IAAI,WAAa;AAE3B,iBAAS,OAAO;AAChB,aAAK,MAAM,CAAC,IAAI,KAAK;;AAGvB,UAAI,UAAU,GAAG;AACf,aAAK,MAAM,CAAC,IAAI;AAChB,aAAK;;AAEP,WAAK,SAAS,QAAQ,IAAI,IAAI,KAAK;AAEnC,aAAO;IACX;AAEE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAK,EAAG,MAAM,GAAG;IACjC;AAGE,IAAAA,IAAG,UAAU,MAAM,SAAS,MAAO;AACjC,aAAO,KAAK,IAAI,IAAI;IACxB;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,OAAQ;AACnC,aAAO,KAAK,KAAK,KAAK,MAAK,CAAE;IACjC;AAGE,IAAAA,IAAG,UAAU,MAAM,SAASM,KAAK,KAAK;AACpC,UAAI,IAAI,WAAW,GAAG;AACtB,UAAI,EAAE,WAAW,EAAG,QAAO,IAAIN,IAAG,CAAC;AAGnC,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,MAAM,IAAI,IAAG,GAAI;AAClD,YAAI,EAAE,CAAC,MAAM,EAAG;;AAGlB,UAAI,EAAE,IAAI,EAAE,QAAQ;AAClB,iBAAS,IAAI,IAAI,IAAG,GAAI,IAAI,EAAE,QAAQ,KAAK,IAAI,EAAE,IAAG,GAAI;AACtD,cAAI,EAAE,CAAC,MAAM,EAAG;AAEhB,gBAAM,IAAI,IAAI,CAAC;;;AAInB,aAAO;IACX;AAGE,IAAAA,IAAG,UAAU,SAAS,SAAS,OAAQ,MAAM;AAC3C,MAAAF,QAAO,OAAO,SAAS,YAAY,QAAQ,CAAC;AAC5C,UAAIM,KAAI,OAAO;AACf,UAAItC,MAAK,OAAOsC,MAAK;AACrB,UAAI,YAAa,aAAe,KAAKA,MAAQ,KAAKA;AAClD,UAAI;AAEJ,UAAIA,OAAM,GAAG;AACX,YAAI,QAAQ;AAEZ,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,cAAI,WAAW,KAAK,MAAM,CAAC,IAAI;AAC/B,cAAI,KAAM,KAAK,MAAM,CAAC,IAAI,KAAK,YAAaA;AAC5C,eAAK,MAAM,CAAC,IAAI,IAAI;AACpB,kBAAQ,aAAc,KAAKA;;AAG7B,YAAI,OAAO;AACT,eAAK,MAAM,CAAC,IAAI;AAChB,eAAK;;;AAIT,UAAItC,OAAM,GAAG;AACX,aAAK,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACrC,eAAK,MAAM,IAAIA,EAAC,IAAI,KAAK,MAAM,CAAC;;AAGlC,aAAK,IAAI,GAAG,IAAIA,IAAG,KAAK;AACtB,eAAK,MAAM,CAAC,IAAI;;AAGlB,aAAK,UAAUA;;AAGjB,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAkC,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AAEzC,MAAAF,QAAO,KAAK,aAAa,CAAC;AAC1B,aAAO,KAAK,OAAO,IAAI;IAC3B;AAKE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,MAAM,MAAM,UAAU;AAC3D,MAAAF,QAAO,OAAO,SAAS,YAAY,QAAQ,CAAC;AAC5C,UAAI;AACJ,UAAI,MAAM;AACR,aAAK,OAAQ,OAAO,MAAO;MACjC,OAAW;AACL,YAAI;;AAGN,UAAIM,KAAI,OAAO;AACf,UAAItC,KAAI,KAAK,KAAK,OAAOsC,MAAK,IAAI,KAAK,MAAM;AAC7C,UAAI,OAAO,WAAc,aAAcA,MAAMA;AAC7C,UAAI,cAAc;AAElB,WAAKtC;AACL,UAAI,KAAK,IAAI,GAAG,CAAC;AAGjB,UAAI,aAAa;AACf,iBAAS,IAAI,GAAG,IAAIA,IAAG,KAAK;AAC1B,sBAAY,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC;;AAErC,oBAAY,SAASA;;AAGvB,UAAIA,OAAM,EAAG;eAEF,KAAK,SAASA,IAAG;AAC1B,aAAK,UAAUA;AACf,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,eAAK,MAAM,CAAC,IAAI,KAAK,MAAM,IAAIA,EAAC;;MAExC,OAAW;AACL,aAAK,MAAM,CAAC,IAAI;AAChB,aAAK,SAAS;;AAGhB,UAAI,QAAQ;AACZ,WAAK,IAAI,KAAK,SAAS,GAAG,KAAK,MAAM,UAAU,KAAK,KAAK,IAAI,KAAK;AAChE,YAAI,OAAO,KAAK,MAAM,CAAC,IAAI;AAC3B,aAAK,MAAM,CAAC,IAAK,SAAU,KAAKsC,KAAO,SAASA;AAChD,gBAAQ,OAAO;;AAIjB,UAAI,eAAe,UAAU,GAAG;AAC9B,oBAAY,MAAM,YAAY,QAAQ,IAAI;;AAG5C,UAAI,KAAK,WAAW,GAAG;AACrB,aAAK,MAAM,CAAC,IAAI;AAChB,aAAK,SAAS;;AAGhB,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAJ,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM,MAAM,UAAU;AAEzD,MAAAF,QAAO,KAAK,aAAa,CAAC;AAC1B,aAAO,KAAK,OAAO,MAAM,MAAM,QAAQ;IAC3C;AAGE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,MAAM;AACvC,aAAO,KAAK,MAAK,EAAG,MAAM,IAAI;IAClC;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AACzC,aAAO,KAAK,MAAK,EAAG,OAAO,IAAI;IACnC;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,MAAM;AACvC,aAAO,KAAK,MAAK,EAAG,MAAM,IAAI;IAClC;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AACzC,aAAO,KAAK,MAAK,EAAG,OAAO,IAAI;IACnC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,OAAO,QAAQ,YAAY,OAAO,CAAC;AAC1C,UAAIM,KAAI,MAAM;AACd,UAAItC,MAAK,MAAMsC,MAAK;AACpB,UAAI,IAAI,KAAKA;AAGb,UAAI,KAAK,UAAUtC,GAAG,QAAO;AAG7B,UAAI,IAAI,KAAK,MAAMA,EAAC;AAEpB,aAAO,CAAC,EAAE,IAAI;IAClB;AAGE,IAAAkC,IAAG,UAAU,SAAS,SAAS,OAAQ,MAAM;AAC3C,MAAAF,QAAO,OAAO,SAAS,YAAY,QAAQ,CAAC;AAC5C,UAAIM,KAAI,OAAO;AACf,UAAItC,MAAK,OAAOsC,MAAK;AAErB,MAAAN,QAAO,KAAK,aAAa,GAAG,yCAAyC;AAErE,UAAI,KAAK,UAAUhC,IAAG;AACpB,eAAO;;AAGT,UAAIsC,OAAM,GAAG;AACX,QAAAtC;;AAEF,WAAK,SAAS,KAAK,IAAIA,IAAG,KAAK,MAAM;AAErC,UAAIsC,OAAM,GAAG;AACX,YAAI,OAAO,WAAc,aAAcA,MAAMA;AAC7C,aAAK,MAAM,KAAK,SAAS,CAAC,KAAK;;AAGjC,aAAO,KAAK,MAAK;IACrB;AAGE,IAAAJ,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AACzC,aAAO,KAAK,MAAK,EAAG,OAAO,IAAI;IACnC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,MAAAA,QAAO,MAAM,QAAS;AACtB,UAAI,MAAM,EAAG,QAAO,KAAK,MAAM,CAAC,GAAG;AAGnC,UAAI,KAAK,aAAa,GAAG;AACvB,YAAI,KAAK,WAAW,MAAM,KAAK,MAAM,CAAC,IAAI,KAAK,KAAK;AAClD,eAAK,MAAM,CAAC,IAAI,OAAO,KAAK,MAAM,CAAC,IAAI;AACvC,eAAK,WAAW;AAChB,iBAAO;;AAGT,aAAK,WAAW;AAChB,aAAK,MAAM,GAAG;AACd,aAAK,WAAW;AAChB,eAAO;;AAIT,aAAO,KAAK,OAAO,GAAG;IAC1B;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,WAAK,MAAM,CAAC,KAAK;AAGjB,eAAS,IAAI,GAAG,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,KAAK,UAAW,KAAK;AAClE,aAAK,MAAM,CAAC,KAAK;AACjB,YAAI,MAAM,KAAK,SAAS,GAAG;AACzB,eAAK,MAAM,IAAI,CAAC,IAAI;QAC5B,OAAa;AACL,eAAK,MAAM,IAAI,CAAC;;;AAGpB,WAAK,SAAS,KAAK,IAAI,KAAK,QAAQ,IAAI,CAAC;AAEzC,aAAO;IACX;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,MAAAA,QAAO,MAAM,QAAS;AACtB,UAAI,MAAM,EAAG,QAAO,KAAK,MAAM,CAAC,GAAG;AAEnC,UAAI,KAAK,aAAa,GAAG;AACvB,aAAK,WAAW;AAChB,aAAK,MAAM,GAAG;AACd,aAAK,WAAW;AAChB,eAAO;;AAGT,WAAK,MAAM,CAAC,KAAK;AAEjB,UAAI,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,IAAI,GAAG;AAC1C,aAAK,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;AAC7B,aAAK,WAAW;MACtB,OAAW;AAEL,iBAAS,IAAI,GAAG,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,IAAI,GAAG,KAAK;AACzD,eAAK,MAAM,CAAC,KAAK;AACjB,eAAK,MAAM,IAAI,CAAC,KAAK;;;AAIzB,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAK,EAAG,MAAM,GAAG;IACjC;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAK,EAAG,MAAM,GAAG;IACjC;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,OAAQ;AACnC,WAAK,WAAW;AAEhB,aAAO;IACX;AAEE,IAAAA,IAAG,UAAU,MAAM,SAASiB,OAAO;AACjC,aAAO,KAAK,MAAK,EAAG,KAAI;IAC5B;AAEE,IAAAjB,IAAG,UAAU,eAAe,SAAS,aAAc,KAAKjB,MAAK,OAAO;AAClE,UAAI,MAAM,IAAI,SAAS;AACvB,UAAI;AAEJ,WAAK,QAAQ,GAAG;AAEhB,UAAI;AACJ,UAAI,QAAQ;AACZ,WAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC/B,aAAK,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AAClC,YAAI,SAAS,IAAI,MAAM,CAAC,IAAI,KAAKA;AACjC,aAAK,QAAQ;AACb,iBAAS,KAAK,OAAQ,QAAQ,WAAa;AAC3C,aAAK,MAAM,IAAI,KAAK,IAAI,IAAI;;AAE9B,aAAO,IAAI,KAAK,SAAS,OAAO,KAAK;AACnC,aAAK,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AAClC,gBAAQ,KAAK;AACb,aAAK,MAAM,IAAI,KAAK,IAAI,IAAI;;AAG9B,UAAI,UAAU,EAAG,QAAO,KAAK,MAAK;AAGlC,MAAAe,QAAO,UAAU,EAAE;AACnB,cAAQ;AACR,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,YAAI,EAAE,KAAK,MAAM,CAAC,IAAI,KAAK;AAC3B,gBAAQ,KAAK;AACb,aAAK,MAAM,CAAC,IAAI,IAAI;;AAEtB,WAAK,WAAW;AAEhB,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAE,IAAG,UAAU,WAAW,SAAS,SAAU,KAAK,MAAM;AACpD,UAAI,QAAQ,KAAK,SAAS,IAAI;AAE9B,UAAI,IAAI,KAAK,MAAK;AAClB,UAAI,IAAI;AAGR,UAAI,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI;AAClC,UAAI,UAAU,KAAK,WAAW,GAAG;AACjC,cAAQ,KAAK;AACb,UAAI,UAAU,GAAG;AACf,YAAI,EAAE,MAAM,KAAK;AACjB,UAAE,OAAO,KAAK;AACd,cAAM,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI;;AAIhC,UAAI,IAAI,EAAE,SAAS,EAAE;AACrB,UAAI;AAEJ,UAAI,SAAS,OAAO;AAClB,YAAI,IAAIA,IAAG,IAAI;AACf,UAAE,SAAS,IAAI;AACf,UAAE,QAAQ,IAAI,MAAM,EAAE,MAAM;AAC5B,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,YAAE,MAAM,CAAC,IAAI;;;AAIjB,UAAI,OAAO,EAAE,MAAK,EAAG,aAAa,GAAG,GAAG,CAAC;AACzC,UAAI,KAAK,aAAa,GAAG;AACvB,YAAI;AACJ,YAAI,GAAG;AACL,YAAE,MAAM,CAAC,IAAI;;;AAIjB,eAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,YAAI,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI,KAAK,YACpC,EAAE,MAAM,EAAE,SAAS,IAAI,CAAC,IAAI;AAI/B,aAAK,KAAK,IAAK,KAAK,MAAO,GAAG,QAAS;AAEvC,UAAE,aAAa,GAAG,IAAI,CAAC;AACvB,eAAO,EAAE,aAAa,GAAG;AACvB;AACA,YAAE,WAAW;AACb,YAAE,aAAa,GAAG,GAAG,CAAC;AACtB,cAAI,CAAC,EAAE,OAAM,GAAI;AACf,cAAE,YAAY;;;AAGlB,YAAI,GAAG;AACL,YAAE,MAAM,CAAC,IAAI;;;AAGjB,UAAI,GAAG;AACL,UAAE,MAAK;;AAET,QAAE,MAAK;AAGP,UAAI,SAAS,SAAS,UAAU,GAAG;AACjC,UAAE,OAAO,KAAK;;AAGhB,aAAO;QACL,KAAK,KAAK;QACV,KAAK;MACX;IACA;AAME,IAAAA,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK,MAAM,UAAU;AAC1D,MAAAF,QAAO,CAAC,IAAI,OAAM,CAAE;AAEpB,UAAI,KAAK,OAAM,GAAI;AACjB,eAAO;UACL,KAAK,IAAIE,IAAG,CAAC;UACb,KAAK,IAAIA,IAAG,CAAC;QACrB;;AAGI,UAAI,KAAKK,MAAK;AACd,UAAI,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AAC7C,cAAM,KAAK,IAAG,EAAG,OAAO,KAAK,IAAI;AAEjC,YAAI,SAAS,OAAO;AAClB,gBAAM,IAAI,IAAI,IAAG;;AAGnB,YAAI,SAAS,OAAO;AAClB,UAAAA,OAAM,IAAI,IAAI,IAAG;AACjB,cAAI,YAAYA,KAAI,aAAa,GAAG;AAClC,YAAAA,KAAI,KAAK,GAAG;;;AAIhB,eAAO;UACL;UACA,KAAKA;QACb;;AAGI,UAAI,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AAC7C,cAAM,KAAK,OAAO,IAAI,IAAG,GAAI,IAAI;AAEjC,YAAI,SAAS,OAAO;AAClB,gBAAM,IAAI,IAAI,IAAG;;AAGnB,eAAO;UACL;UACA,KAAK,IAAI;QACjB;;AAGI,WAAK,KAAK,WAAW,IAAI,cAAc,GAAG;AACxC,cAAM,KAAK,IAAG,EAAG,OAAO,IAAI,IAAG,GAAI,IAAI;AAEvC,YAAI,SAAS,OAAO;AAClB,UAAAA,OAAM,IAAI,IAAI,IAAG;AACjB,cAAI,YAAYA,KAAI,aAAa,GAAG;AAClC,YAAAA,KAAI,KAAK,GAAG;;;AAIhB,eAAO;UACL,KAAK,IAAI;UACT,KAAKA;QACb;;AAMI,UAAI,IAAI,SAAS,KAAK,UAAU,KAAK,IAAI,GAAG,IAAI,GAAG;AACjD,eAAO;UACL,KAAK,IAAIL,IAAG,CAAC;UACb,KAAK;QACb;;AAII,UAAI,IAAI,WAAW,GAAG;AACpB,YAAI,SAAS,OAAO;AAClB,iBAAO;YACL,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,CAAC;YAC3B,KAAK;UACf;;AAGM,YAAI,SAAS,OAAO;AAClB,iBAAO;YACL,KAAK;YACL,KAAK,IAAIA,IAAG,KAAK,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC;UAC7C;;AAGM,eAAO;UACL,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,CAAC;UAC3B,KAAK,IAAIA,IAAG,KAAK,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC;QAC3C;;AAGI,aAAO,KAAK,SAAS,KAAK,IAAI;IAClC;AAGE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,OAAO,KAAK,OAAO,KAAK,EAAE;IAC1C;AAGE,IAAAA,IAAG,UAAU,MAAM,SAASK,KAAK,KAAK;AACpC,aAAO,KAAK,OAAO,KAAK,OAAO,KAAK,EAAE;IAC1C;AAEE,IAAAL,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,OAAO,KAAK,OAAO,IAAI,EAAE;IACzC;AAGE,IAAAA,IAAG,UAAU,WAAW,SAAS,SAAU,KAAK;AAC9C,UAAI,KAAK,KAAK,OAAO,GAAG;AAGxB,UAAI,GAAG,IAAI,OAAM,EAAI,QAAO,GAAG;AAE/B,UAAIK,OAAM,GAAG,IAAI,aAAa,IAAI,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG;AAExD,UAAI,OAAO,IAAI,MAAM,CAAC;AACtB,UAAI,KAAK,IAAI,MAAM,CAAC;AACpB,UAAI,MAAMA,KAAI,IAAI,IAAI;AAGtB,UAAI,MAAM,KAAK,OAAO,KAAK,QAAQ,EAAG,QAAO,GAAG;AAGhD,aAAO,GAAG,IAAI,aAAa,IAAI,GAAG,IAAI,MAAM,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC;IACnE;AAEE,IAAAL,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,MAAAF,QAAO,OAAO,QAAS;AACvB,UAAI,KAAK,KAAK,MAAM;AAEpB,UAAI,MAAM;AACV,eAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,eAAO,IAAI,OAAO,KAAK,MAAM,CAAC,IAAI,MAAM;;AAG1C,aAAO;IACX;AAGE,IAAAE,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,OAAO,QAAS;AAEvB,UAAI,QAAQ;AACZ,eAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,YAAI,KAAK,KAAK,MAAM,CAAC,IAAI,KAAK,QAAQ;AACtC,aAAK,MAAM,CAAC,IAAK,IAAI,MAAO;AAC5B,gBAAQ,IAAI;;AAGd,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAK,EAAG,MAAM,GAAG;IACjC;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,GAAG;AACpC,MAAAF,QAAO,EAAE,aAAa,CAAC;AACvB,MAAAA,QAAO,CAAC,EAAE,OAAM,CAAE;AAElB,UAAI,IAAI;AACR,UAAI,IAAI,EAAE,MAAK;AAEf,UAAI,EAAE,aAAa,GAAG;AACpB,YAAI,EAAE,KAAK,CAAC;MAClB,OAAW;AACL,YAAI,EAAE,MAAK;;AAIb,UAAI,IAAI,IAAIE,IAAG,CAAC;AAChB,UAAI,IAAI,IAAIA,IAAG,CAAC;AAGhB,UAAI,IAAI,IAAIA,IAAG,CAAC;AAChB,UAAI,IAAI,IAAIA,IAAG,CAAC;AAEhB,UAAI,IAAI;AAER,aAAO,EAAE,OAAM,KAAM,EAAE,OAAM,GAAI;AAC/B,UAAE,OAAO,CAAC;AACV,UAAE,OAAO,CAAC;AACV,UAAE;;AAGJ,UAAI,KAAK,EAAE,MAAK;AAChB,UAAI,KAAK,EAAE,MAAK;AAEhB,aAAO,CAAC,EAAE,OAAM,GAAI;AAClB,iBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,YAAI,IAAI,GAAG;AACT,YAAE,OAAO,CAAC;AACV,iBAAO,MAAM,GAAG;AACd,gBAAI,EAAE,MAAK,KAAM,EAAE,MAAK,GAAI;AAC1B,gBAAE,KAAK,EAAE;AACT,gBAAE,KAAK,EAAE;;AAGX,cAAE,OAAO,CAAC;AACV,cAAE,OAAO,CAAC;;;AAId,iBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,YAAI,IAAI,GAAG;AACT,YAAE,OAAO,CAAC;AACV,iBAAO,MAAM,GAAG;AACd,gBAAI,EAAE,MAAK,KAAM,EAAE,MAAK,GAAI;AAC1B,gBAAE,KAAK,EAAE;AACT,gBAAE,KAAK,EAAE;;AAGX,cAAE,OAAO,CAAC;AACV,cAAE,OAAO,CAAC;;;AAId,YAAI,EAAE,IAAI,CAAC,KAAK,GAAG;AACjB,YAAE,KAAK,CAAC;AACR,YAAE,KAAK,CAAC;AACR,YAAE,KAAK,CAAC;QAChB,OAAa;AACL,YAAE,KAAK,CAAC;AACR,YAAE,KAAK,CAAC;AACR,YAAE,KAAK,CAAC;;;AAIZ,aAAO;QACL,GAAG;QACH,GAAG;QACH,KAAK,EAAE,OAAO,CAAC;MACrB;IACA;AAKE,IAAAA,IAAG,UAAU,SAAS,SAAS,OAAQ,GAAG;AACxC,MAAAF,QAAO,EAAE,aAAa,CAAC;AACvB,MAAAA,QAAO,CAAC,EAAE,OAAM,CAAE;AAElB,UAAI,IAAI;AACR,UAAI,IAAI,EAAE,MAAK;AAEf,UAAI,EAAE,aAAa,GAAG;AACpB,YAAI,EAAE,KAAK,CAAC;MAClB,OAAW;AACL,YAAI,EAAE,MAAK;;AAGb,UAAI,KAAK,IAAIE,IAAG,CAAC;AACjB,UAAI,KAAK,IAAIA,IAAG,CAAC;AAEjB,UAAI,QAAQ,EAAE,MAAK;AAEnB,aAAO,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG;AACrC,iBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,YAAI,IAAI,GAAG;AACT,YAAE,OAAO,CAAC;AACV,iBAAO,MAAM,GAAG;AACd,gBAAI,GAAG,MAAK,GAAI;AACd,iBAAG,KAAK,KAAK;;AAGf,eAAG,OAAO,CAAC;;;AAIf,iBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,YAAI,IAAI,GAAG;AACT,YAAE,OAAO,CAAC;AACV,iBAAO,MAAM,GAAG;AACd,gBAAI,GAAG,MAAK,GAAI;AACd,iBAAG,KAAK,KAAK;;AAGf,eAAG,OAAO,CAAC;;;AAIf,YAAI,EAAE,IAAI,CAAC,KAAK,GAAG;AACjB,YAAE,KAAK,CAAC;AACR,aAAG,KAAK,EAAE;QAClB,OAAa;AACL,YAAE,KAAK,CAAC;AACR,aAAG,KAAK,EAAE;;;AAId,UAAI;AACJ,UAAI,EAAE,KAAK,CAAC,MAAM,GAAG;AACnB,cAAM;MACZ,OAAW;AACL,cAAM;;AAGR,UAAI,IAAI,KAAK,CAAC,IAAI,GAAG;AACnB,YAAI,KAAK,CAAC;;AAGZ,aAAO;IACX;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,UAAI,KAAK,OAAM,EAAI,QAAO,IAAI,IAAG;AACjC,UAAI,IAAI,OAAM,EAAI,QAAO,KAAK,IAAG;AAEjC,UAAI,IAAI,KAAK,MAAK;AAClB,UAAI,IAAI,IAAI,MAAK;AACjB,QAAE,WAAW;AACb,QAAE,WAAW;AAGb,eAAS,QAAQ,GAAG,EAAE,OAAM,KAAM,EAAE,OAAM,GAAI,SAAS;AACrD,UAAE,OAAO,CAAC;AACV,UAAE,OAAO,CAAC;;AAGZ,SAAG;AACD,eAAO,EAAE,OAAM,GAAI;AACjB,YAAE,OAAO,CAAC;;AAEZ,eAAO,EAAE,OAAM,GAAI;AACjB,YAAE,OAAO,CAAC;;AAGZ,YAAII,KAAI,EAAE,IAAI,CAAC;AACf,YAAIA,KAAI,GAAG;AAET,cAAI,IAAI;AACR,cAAI;AACJ,cAAI;QACZ,WAAiBA,OAAM,KAAK,EAAE,KAAK,CAAC,MAAM,GAAG;AACrC;;AAGF,UAAE,KAAK,CAAC;eACD;AAET,aAAO,EAAE,OAAO,KAAK;IACzB;AAGE,IAAAJ,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG;IACpC;AAEE,IAAAA,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,cAAQ,KAAK,MAAM,CAAC,IAAI,OAAO;IACnC;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,QAAS;AACrC,cAAQ,KAAK,MAAM,CAAC,IAAI,OAAO;IACnC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,aAAO,KAAK,MAAM,CAAC,IAAI;IAC3B;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,UAAIM,KAAI,MAAM;AACd,UAAItC,MAAK,MAAMsC,MAAK;AACpB,UAAI,IAAI,KAAKA;AAGb,UAAI,KAAK,UAAUtC,IAAG;AACpB,aAAK,QAAQA,KAAI,CAAC;AAClB,aAAK,MAAMA,EAAC,KAAK;AACjB,eAAO;;AAIT,UAAI,QAAQ;AACZ,eAAS,IAAIA,IAAG,UAAU,KAAK,IAAI,KAAK,QAAQ,KAAK;AACnD,YAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AACxB,aAAK;AACL,gBAAQ,MAAM;AACd,aAAK;AACL,aAAK,MAAM,CAAC,IAAI;;AAElB,UAAI,UAAU,GAAG;AACf,aAAK,MAAM,CAAC,IAAI;AAChB,aAAK;;AAEP,aAAO;IACX;AAEE,IAAAkC,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,aAAO,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,MAAM;IAClD;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,UAAI,WAAW,MAAM;AAErB,UAAI,KAAK,aAAa,KAAK,CAAC,SAAU,QAAO;AAC7C,UAAI,KAAK,aAAa,KAAK,SAAU,QAAO;AAE5C,WAAK,MAAK;AAEV,UAAI;AACJ,UAAI,KAAK,SAAS,GAAG;AACnB,cAAM;MACZ,OAAW;AACL,YAAI,UAAU;AACZ,gBAAM,CAAC;;AAGT,QAAAF,QAAO,OAAO,UAAW,mBAAmB;AAE5C,YAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AACxB,cAAM,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK;;AAEvC,UAAI,KAAK,aAAa,EAAG,QAAO,CAAC,MAAM;AACvC,aAAO;IACX;AAME,IAAAE,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,UAAI,KAAK,aAAa,KAAK,IAAI,aAAa,EAAG,QAAO;AACtD,UAAI,KAAK,aAAa,KAAK,IAAI,aAAa,EAAG,QAAO;AAEtD,UAAI,MAAM,KAAK,KAAK,GAAG;AACvB,UAAI,KAAK,aAAa,EAAG,QAAO,CAAC,MAAM;AACvC,aAAO;IACX;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AAEtC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO;AACrC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO;AAErC,UAAI,MAAM;AACV,eAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,YAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AACxB,YAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AAEvB,YAAI,MAAM,EAAG;AACb,YAAI,IAAI,GAAG;AACT,gBAAM;QACd,WAAiB,IAAI,GAAG;AAChB,gBAAM;;AAER;;AAEF,aAAO;IACX;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,KAAK,GAAG,MAAM;IAC9B;AAEE,IAAAA,IAAG,UAAU,KAAK,SAAS,GAAI,KAAK;AAClC,aAAO,KAAK,IAAI,GAAG,MAAM;IAC7B;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,KAAK,GAAG,KAAK;IAC7B;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,IAAI,GAAG,KAAK;IAC5B;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,KAAK,GAAG,MAAM;IAC9B;AAEE,IAAAA,IAAG,UAAU,KAAK,SAAS,GAAI,KAAK;AAClC,aAAO,KAAK,IAAI,GAAG,MAAM;IAC7B;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,KAAK,GAAG,KAAK;IAC7B;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,IAAI,GAAG,KAAK;IAC5B;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,KAAK,GAAG,MAAM;IAC9B;AAEE,IAAAA,IAAG,UAAU,KAAK,SAASkB,IAAI,KAAK;AAClC,aAAO,KAAK,IAAI,GAAG,MAAM;IAC7B;AAME,IAAAlB,IAAG,MAAM,SAAS,IAAK,KAAK;AAC1B,aAAO,IAAI,IAAI,GAAG;IACtB;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,CAAC,KAAK,KAAK,uCAAuC;AACzD,MAAAA,QAAO,KAAK,aAAa,GAAG,+BAA+B;AAC3D,aAAO,IAAI,UAAU,IAAI,EAAE,UAAU,GAAG;IAC5C;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,MAAAF,QAAO,KAAK,KAAK,sDAAsD;AACvE,aAAO,KAAK,IAAI,YAAY,IAAI;IACpC;AAEE,IAAAE,IAAG,UAAU,YAAY,SAAS,UAAW,KAAK;AAChD,WAAK,MAAM;AACX,aAAO;IACX;AAEE,IAAAA,IAAG,UAAU,WAAW,SAAS,SAAU,KAAK;AAC9C,MAAAF,QAAO,CAAC,KAAK,KAAK,uCAAuC;AACzD,aAAO,KAAK,UAAU,GAAG;IAC7B;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,aAAO,KAAK,IAAI,IAAI,MAAM,GAAG;IACjC;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,QAAS,KAAK;AAC5C,MAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,aAAO,KAAK,IAAI,KAAK,MAAM,GAAG;IAClC;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,aAAO,KAAK,IAAI,IAAI,MAAM,GAAG;IACjC;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,QAAS,KAAK;AAC5C,MAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,aAAO,KAAK,IAAI,KAAK,MAAM,GAAG;IAClC;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,aAAO,KAAK,IAAI,IAAI,MAAM,GAAG;IACjC;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,WAAK,IAAI,SAAS,MAAM,GAAG;AAC3B,aAAO,KAAK,IAAI,IAAI,MAAM,GAAG;IACjC;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,QAAS,KAAK;AAC5C,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,WAAK,IAAI,SAAS,MAAM,GAAG;AAC3B,aAAO,KAAK,IAAI,KAAK,MAAM,GAAG;IAClC;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,IAAI,IAAI;IAC5B;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,MAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,KAAK,IAAI;IAC7B;AAGE,IAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,MAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,KAAK,IAAI;IAC7B;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,MAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,KAAK,IAAI;IAC7B;AAGE,IAAAE,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,IAAI,IAAI;IAC5B;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,MAAAF,QAAO,KAAK,OAAO,CAAC,IAAI,KAAK,mBAAmB;AAChD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,IAAI,MAAM,GAAG;IACjC;AAGE,QAAI,SAAS;MACX,MAAM;MACN,MAAM;MACN,MAAM;MACN,QAAQ;IACZ;AAGE,aAAS,OAAQP,OAAM,GAAG;AAExB,WAAK,OAAOA;AACZ,WAAK,IAAI,IAAIS,IAAG,GAAG,EAAE;AACrB,WAAK,IAAI,KAAK,EAAE,UAAS;AACzB,WAAK,IAAI,IAAIA,IAAG,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC;AAE7C,WAAK,MAAM,KAAK,KAAI;;AAGtB,WAAO,UAAU,OAAO,SAAS,OAAQ;AACvC,UAAI,MAAM,IAAIA,IAAG,IAAI;AACrB,UAAI,QAAQ,IAAI,MAAM,KAAK,KAAK,KAAK,IAAI,EAAE,CAAC;AAC5C,aAAO;IACX;AAEE,WAAO,UAAU,UAAU,SAAS,QAAS,KAAK;AAGhD,UAAII,KAAI;AACR,UAAI;AAEJ,SAAG;AACD,aAAK,MAAMA,IAAG,KAAK,GAAG;AACtB,QAAAA,KAAI,KAAK,MAAMA,EAAC;AAChB,QAAAA,KAAIA,GAAE,KAAK,KAAK,GAAG;AACnB,eAAOA,GAAE,UAAS;MACxB,SAAa,OAAO,KAAK;AAErB,UAAI,MAAM,OAAO,KAAK,IAAI,KAAKA,GAAE,KAAK,KAAK,CAAC;AAC5C,UAAI,QAAQ,GAAG;AACb,QAAAA,GAAE,MAAM,CAAC,IAAI;AACb,QAAAA,GAAE,SAAS;MACjB,WAAe,MAAM,GAAG;AAClB,QAAAA,GAAE,KAAK,KAAK,CAAC;MACnB,OAAW;AACL,YAAIA,GAAE,UAAU,QAAW;AAEzB,UAAAA,GAAE,MAAK;QACf,OAAa;AAEL,UAAAA,GAAE,OAAM;;;AAIZ,aAAOA;IACX;AAEE,WAAO,UAAU,QAAQ,SAAS,MAAO,OAAO,KAAK;AACnD,YAAM,OAAO,KAAK,GAAG,GAAG,GAAG;IAC/B;AAEE,WAAO,UAAU,QAAQ,SAAS,MAAO,KAAK;AAC5C,aAAO,IAAI,KAAK,KAAK,CAAC;IAC1B;AAEE,aAAS,OAAQ;AACf,aAAO;QACL;QACA;QACA;MAAyE;;AAE7E,IAAAL,UAAS,MAAM,MAAM;AAErB,SAAK,UAAU,QAAQ,SAAS,MAAO,OAAO,QAAQ;AAEpD,UAAI,OAAO;AAEX,UAAI,SAAS,KAAK,IAAI,MAAM,QAAQ,CAAC;AACrC,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,eAAO,MAAM,CAAC,IAAI,MAAM,MAAM,CAAC;;AAEjC,aAAO,SAAS;AAEhB,UAAI,MAAM,UAAU,GAAG;AACrB,cAAM,MAAM,CAAC,IAAI;AACjB,cAAM,SAAS;AACf;;AAIF,UAAI,OAAO,MAAM,MAAM,CAAC;AACxB,aAAO,MAAM,OAAO,QAAQ,IAAI,OAAO;AAEvC,WAAK,IAAI,IAAI,IAAI,MAAM,QAAQ,KAAK;AAClC,YAAI,OAAO,MAAM,MAAM,CAAC,IAAI;AAC5B,cAAM,MAAM,IAAI,EAAE,KAAM,OAAO,SAAS,IAAM,SAAS;AACvD,eAAO;;AAET,gBAAU;AACV,YAAM,MAAM,IAAI,EAAE,IAAI;AACtB,UAAI,SAAS,KAAK,MAAM,SAAS,IAAI;AACnC,cAAM,UAAU;MACtB,OAAW;AACL,cAAM,UAAU;;IAEtB;AAEE,SAAK,UAAU,QAAQ,SAAS,MAAO,KAAK;AAE1C,UAAI,MAAM,IAAI,MAAM,IAAI;AACxB,UAAI,MAAM,IAAI,SAAS,CAAC,IAAI;AAC5B,UAAI,UAAU;AAGd,UAAI,KAAK;AACT,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AACvB,cAAM,IAAI;AACV,YAAI,MAAM,CAAC,IAAI,KAAK;AACpB,aAAK,IAAI,MAAS,KAAK,WAAa;;AAItC,UAAI,IAAI,MAAM,IAAI,SAAS,CAAC,MAAM,GAAG;AACnC,YAAI;AACJ,YAAI,IAAI,MAAM,IAAI,SAAS,CAAC,MAAM,GAAG;AACnC,cAAI;;;AAGR,aAAO;IACX;AAEE,aAAS,OAAQ;AACf,aAAO;QACL;QACA;QACA;MAAgE;;AAEpE,IAAAA,UAAS,MAAM,MAAM;AAErB,aAAS,OAAQ;AACf,aAAO;QACL;QACA;QACA;MAAuD;;AAE3D,IAAAA,UAAS,MAAM,MAAM;AAErB,aAAS,SAAU;AAEjB,aAAO;QACL;QACA;QACA;MAAqE;;AAEzE,IAAAA,UAAS,QAAQ,MAAM;AAEvB,WAAO,UAAU,QAAQ,SAAS,MAAO,KAAK;AAE5C,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,KAAO;AACrC,YAAI,KAAK,KAAK;AACd,gBAAQ;AAER,YAAI,MAAM,CAAC,IAAI;AACf,gBAAQ;;AAEV,UAAI,UAAU,GAAG;AACf,YAAI,MAAM,IAAI,QAAQ,IAAI;;AAE5B,aAAO;IACX;AAGE,IAAAC,IAAG,SAAS,SAAS,MAAOT,OAAM;AAEhC,UAAI,OAAOA,KAAI,EAAG,QAAO,OAAOA,KAAI;AAEpC,UAAI4B;AACJ,UAAI5B,UAAS,QAAQ;AACnB,QAAA4B,SAAQ,IAAI,KAAI;MACtB,WAAe5B,UAAS,QAAQ;AAC1B,QAAA4B,SAAQ,IAAI,KAAI;MACtB,WAAe5B,UAAS,QAAQ;AAC1B,QAAA4B,SAAQ,IAAI,KAAI;MACtB,WAAe5B,UAAS,UAAU;AAC5B,QAAA4B,SAAQ,IAAI,OAAM;MACxB,OAAW;AACL,cAAM,IAAI,MAAM,mBAAmB5B,KAAI;;AAEzC,aAAOA,KAAI,IAAI4B;AAEf,aAAOA;IACX;AAKE,aAAS,IAAK,GAAG;AACf,UAAI,OAAO,MAAM,UAAU;AACzB,YAAI,QAAQnB,IAAG,OAAO,CAAC;AACvB,aAAK,IAAI,MAAM;AACf,aAAK,QAAQ;MACnB,OAAW;AACL,QAAAF,QAAO,EAAE,IAAI,CAAC,GAAG,gCAAgC;AACjD,aAAK,IAAI;AACT,aAAK,QAAQ;;;AAIjB,QAAI,UAAU,WAAW,SAAS,SAAU,GAAG;AAC7C,MAAAA,QAAO,EAAE,aAAa,GAAG,+BAA+B;AACxD,MAAAA,QAAO,EAAE,KAAK,iCAAiC;IACnD;AAEE,QAAI,UAAU,WAAW,SAAS,SAAU,GAAG,GAAG;AAChD,MAAAA,SAAQ,EAAE,WAAW,EAAE,cAAc,GAAG,+BAA+B;AACvE,MAAAA;QAAO,EAAE,OAAO,EAAE,QAAQ,EAAE;QAC1B;MAAiC;IACvC;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,UAAI,KAAK,MAAO,QAAO,KAAK,MAAM,QAAQ,CAAC,EAAE,UAAU,IAAI;AAC3D,aAAO,EAAE,KAAK,KAAK,CAAC,EAAE,UAAU,IAAI;IACxC;AAEE,QAAI,UAAU,MAAM,SAASY,KAAK,GAAG;AACnC,UAAI,EAAE,OAAM,GAAI;AACd,eAAO,EAAE,MAAK;;AAGhB,aAAO,KAAK,EAAE,IAAI,CAAC,EAAE,UAAU,IAAI;IACvC;AAEE,QAAI,UAAU,MAAM,SAASE,KAAK,GAAG,GAAG;AACtC,WAAK,SAAS,GAAG,CAAC;AAElB,UAAI,MAAM,EAAE,IAAI,CAAC;AACjB,UAAI,IAAI,IAAI,KAAK,CAAC,KAAK,GAAG;AACxB,YAAI,KAAK,KAAK,CAAC;;AAEjB,aAAO,IAAI,UAAU,IAAI;IAC7B;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACxC,WAAK,SAAS,GAAG,CAAC;AAElB,UAAI,MAAM,EAAE,KAAK,CAAC;AAClB,UAAI,IAAI,IAAI,KAAK,CAAC,KAAK,GAAG;AACxB,YAAI,KAAK,KAAK,CAAC;;AAEjB,aAAO;IACX;AAEE,QAAI,UAAU,MAAM,SAAS,IAAK,GAAG,GAAG;AACtC,WAAK,SAAS,GAAG,CAAC;AAElB,UAAI,MAAM,EAAE,IAAI,CAAC;AACjB,UAAI,IAAI,KAAK,CAAC,IAAI,GAAG;AACnB,YAAI,KAAK,KAAK,CAAC;;AAEjB,aAAO,IAAI,UAAU,IAAI;IAC7B;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACxC,WAAK,SAAS,GAAG,CAAC;AAElB,UAAI,MAAM,EAAE,KAAK,CAAC;AAClB,UAAI,IAAI,KAAK,CAAC,IAAI,GAAG;AACnB,YAAI,KAAK,KAAK,CAAC;;AAEjB,aAAO;IACX;AAEE,QAAI,UAAU,MAAM,SAAS,IAAK,GAAG,KAAK;AACxC,WAAK,SAAS,CAAC;AACf,aAAO,KAAK,KAAK,EAAE,MAAM,GAAG,CAAC;IACjC;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACxC,WAAK,SAAS,GAAG,CAAC;AAClB,aAAO,KAAK,KAAK,EAAE,KAAK,CAAC,CAAC;IAC9B;AAEE,QAAI,UAAU,MAAM,SAAS7B,KAAK,GAAG,GAAG;AACtC,WAAK,SAAS,GAAG,CAAC;AAClB,aAAO,KAAK,KAAK,EAAE,IAAI,CAAC,CAAC;IAC7B;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,aAAO,KAAK,KAAK,GAAG,EAAE,MAAK,CAAE;IACjC;AAEE,QAAI,UAAU,MAAM,SAAS,IAAK,GAAG;AACnC,aAAO,KAAK,IAAI,GAAG,CAAC;IACxB;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,UAAI,EAAE,OAAM,EAAI,QAAO,EAAE,MAAK;AAE9B,UAAI,OAAO,KAAK,EAAE,MAAM,CAAC;AACzB,MAAAe,QAAO,OAAO,MAAM,CAAC;AAGrB,UAAI,SAAS,GAAG;AACd,YAAIQ,OAAM,KAAK,EAAE,IAAI,IAAIN,IAAG,CAAC,CAAC,EAAE,OAAO,CAAC;AACxC,eAAO,KAAK,IAAI,GAAGM,IAAG;;AAMxB,UAAI,IAAI,KAAK,EAAE,KAAK,CAAC;AACrB,UAAIxC,KAAI;AACR,aAAO,CAAC,EAAE,OAAM,KAAM,EAAE,MAAM,CAAC,MAAM,GAAG;AACtC,QAAAA;AACA,UAAE,OAAO,CAAC;;AAEZ,MAAAgC,QAAO,CAAC,EAAE,OAAM,CAAE;AAElB,UAAI,MAAM,IAAIE,IAAG,CAAC,EAAE,MAAM,IAAI;AAC9B,UAAI,OAAO,IAAI,OAAM;AAIrB,UAAI,OAAO,KAAK,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC;AAClC,UAAI,IAAI,KAAK,EAAE,UAAS;AACxB,UAAI,IAAIA,IAAG,IAAI,IAAI,CAAC,EAAE,MAAM,IAAI;AAEhC,aAAO,KAAK,IAAI,GAAG,IAAI,EAAE,IAAI,IAAI,MAAM,GAAG;AACxC,UAAE,QAAQ,IAAI;;AAGhB,UAAI,IAAI,KAAK,IAAI,GAAG,CAAC;AACrB,UAAII,KAAI,KAAK,IAAI,GAAG,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;AACvC,UAAI,IAAI,KAAK,IAAI,GAAG,CAAC;AACrB,UAAI,IAAItC;AACR,aAAO,EAAE,IAAI,GAAG,MAAM,GAAG;AACvB,YAAI,MAAM;AACV,iBAAS,IAAI,GAAG,IAAI,IAAI,GAAG,MAAM,GAAG,KAAK;AACvC,gBAAM,IAAI,OAAM;;AAElB,QAAAgC,QAAO,IAAI,CAAC;AACZ,YAAI,IAAI,KAAK,IAAI,GAAG,IAAIE,IAAG,CAAC,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC;AAE/C,QAAAI,KAAIA,GAAE,OAAO,CAAC;AACd,YAAI,EAAE,OAAM;AACZ,YAAI,EAAE,OAAO,CAAC;AACd,YAAI;;AAGN,aAAOA;IACX;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,UAAI,MAAM,EAAE,OAAO,KAAK,CAAC;AACzB,UAAI,IAAI,aAAa,GAAG;AACtB,YAAI,WAAW;AACf,eAAO,KAAK,KAAK,GAAG,EAAE,OAAM;MAClC,OAAW;AACL,eAAO,KAAK,KAAK,GAAG;;IAE1B;AAEE,QAAI,UAAU,MAAM,SAASE,KAAK,GAAG,KAAK;AACxC,UAAI,IAAI,OAAM,EAAI,QAAO,IAAIN,IAAG,CAAC,EAAE,MAAM,IAAI;AAC7C,UAAI,IAAI,KAAK,CAAC,MAAM,EAAG,QAAO,EAAE,MAAK;AAErC,UAAI,aAAa;AACjB,UAAI,MAAM,IAAI,MAAM,KAAK,UAAU;AACnC,UAAI,CAAC,IAAI,IAAIA,IAAG,CAAC,EAAE,MAAM,IAAI;AAC7B,UAAI,CAAC,IAAI;AACT,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC;;AAGjC,UAAI,MAAM,IAAI,CAAC;AACf,UAAI,UAAU;AACd,UAAI,aAAa;AACjB,UAAI,QAAQ,IAAI,UAAS,IAAK;AAC9B,UAAI,UAAU,GAAG;AACf,gBAAQ;;AAGV,WAAK,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACpC,YAAI,OAAO,IAAI,MAAM,CAAC;AACtB,iBAAS,IAAI,QAAQ,GAAG,KAAK,GAAG,KAAK;AACnC,cAAI,MAAO,QAAQ,IAAK;AACxB,cAAI,QAAQ,IAAI,CAAC,GAAG;AAClB,kBAAM,KAAK,IAAI,GAAG;;AAGpB,cAAI,QAAQ,KAAK,YAAY,GAAG;AAC9B,yBAAa;AACb;;AAGF,sBAAY;AACZ,qBAAW;AACX;AACA,cAAI,eAAe,eAAe,MAAM,KAAK,MAAM,GAAI;AAEvD,gBAAM,KAAK,IAAI,KAAK,IAAI,OAAO,CAAC;AAChC,uBAAa;AACb,oBAAU;;AAEZ,gBAAQ;;AAGV,aAAO;IACX;AAEE,QAAI,UAAU,YAAY,SAAS,UAAW,KAAK;AACjD,UAAII,KAAI,IAAI,KAAK,KAAK,CAAC;AAEvB,aAAOA,OAAM,MAAMA,GAAE,MAAK,IAAKA;IACnC;AAEE,QAAI,UAAU,cAAc,SAAS,YAAa,KAAK;AACrD,UAAI,MAAM,IAAI,MAAK;AACnB,UAAI,MAAM;AACV,aAAO;IACX;AAME,IAAAJ,IAAG,OAAO,SAASoB,MAAM,KAAK;AAC5B,aAAO,IAAI,KAAK,GAAG;IACvB;AAEE,aAAS,KAAM,GAAG;AAChB,UAAI,KAAK,MAAM,CAAC;AAEhB,WAAK,QAAQ,KAAK,EAAE,UAAS;AAC7B,UAAI,KAAK,QAAQ,OAAO,GAAG;AACzB,aAAK,SAAS,KAAM,KAAK,QAAQ;;AAGnC,WAAK,IAAI,IAAIpB,IAAG,CAAC,EAAE,OAAO,KAAK,KAAK;AACpC,WAAK,KAAK,KAAK,KAAK,KAAK,EAAE,IAAG,CAAE;AAChC,WAAK,OAAO,KAAK,EAAE,OAAO,KAAK,CAAC;AAEhC,WAAK,OAAO,KAAK,KAAK,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,KAAK,CAAC;AACrD,WAAK,OAAO,KAAK,KAAK,KAAK,KAAK,CAAC;AACjC,WAAK,OAAO,KAAK,EAAE,IAAI,KAAK,IAAI;;AAElC,IAAAD,UAAS,MAAM,GAAG;AAElB,SAAK,UAAU,YAAY,SAAS,UAAW,KAAK;AAClD,aAAO,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,CAAC;IAC1C;AAEE,SAAK,UAAU,cAAc,SAAS,YAAa,KAAK;AACtD,UAAIK,KAAI,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC;AACpC,MAAAA,GAAE,MAAM;AACR,aAAOA;IACX;AAEE,SAAK,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACzC,UAAI,EAAE,OAAM,KAAM,EAAE,OAAM,GAAI;AAC5B,UAAE,MAAM,CAAC,IAAI;AACb,UAAE,SAAS;AACX,eAAO;;AAGT,UAAI,IAAI,EAAE,KAAK,CAAC;AAChB,UAAI,IAAI,EAAE,MAAM,KAAK,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,OAAO,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC;AACxE,UAAI,IAAI,EAAE,KAAK,CAAC,EAAE,OAAO,KAAK,KAAK;AACnC,UAAI,MAAM;AAEV,UAAI,EAAE,IAAI,KAAK,CAAC,KAAK,GAAG;AACtB,cAAM,EAAE,KAAK,KAAK,CAAC;iBACV,EAAE,KAAK,CAAC,IAAI,GAAG;AACxB,cAAM,EAAE,KAAK,KAAK,CAAC;;AAGrB,aAAO,IAAI,UAAU,IAAI;IAC7B;AAEE,SAAK,UAAU,MAAM,SAASrB,KAAK,GAAG,GAAG;AACvC,UAAI,EAAE,OAAM,KAAM,EAAE,OAAM,EAAI,QAAO,IAAIiB,IAAG,CAAC,EAAE,UAAU,IAAI;AAE7D,UAAI,IAAI,EAAE,IAAI,CAAC;AACf,UAAI,IAAI,EAAE,MAAM,KAAK,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,OAAO,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC;AACxE,UAAI,IAAI,EAAE,KAAK,CAAC,EAAE,OAAO,KAAK,KAAK;AACnC,UAAI,MAAM;AACV,UAAI,EAAE,IAAI,KAAK,CAAC,KAAK,GAAG;AACtB,cAAM,EAAE,KAAK,KAAK,CAAC;iBACV,EAAE,KAAK,CAAC,IAAI,GAAG;AACxB,cAAM,EAAE,KAAK,KAAK,CAAC;;AAGrB,aAAO,IAAI,UAAU,IAAI;IAC7B;AAEE,SAAK,UAAU,OAAO,SAAS,KAAM,GAAG;AAEtC,UAAI,MAAM,KAAK,KAAK,EAAE,OAAO,KAAK,CAAC,EAAE,IAAI,KAAK,EAAE,CAAC;AACjD,aAAO,IAAI,UAAU,IAAI;IAC7B;KACoC,QAAQqB,cAAI;;;;;;ACt3GhD,IAAI,OAAO,OAAO,WAAW,YAAY;AAEvCC,mBAAA,UAAiB,SAASvB,UAAS,MAAM,WAAW;AAClD,QAAI,WAAW;AACb,WAAK,SAAS;AACd,WAAK,YAAY,OAAO,OAAO,UAAU,WAAW;QAClD,aAAa;UACX,OAAO;UACP,YAAY;UACZ,UAAU;UACV,cAAc;QACxB;MACA,CAAO;IACP;EACA;AACA,OAAO;AAELuB,mBAAA,UAAiB,SAASvB,UAAS,MAAM,WAAW;AAClD,QAAI,WAAW;AACb,WAAK,SAAS;AACd,UAAI,WAAW,WAAY;MAAA;AAC3B,eAAS,YAAY,UAAU;AAC/B,WAAK,YAAY,IAAI,SAAQ;AAC7B,WAAK,UAAU,cAAc;IACnC;EACA;AACA;;ACtBA,IAAInC,WAASG;AACb,IAAIG,WAASN,SAAO;AAEpB,IAAI,QAAQ,CAAA;AAEZ,IAAIgC;AAEJ,KAAKA,SAAOhC,UAAQ;AAClB,MAAI,CAACA,SAAO,eAAegC,KAAG,EAAG;AACjC,MAAIA,UAAQ,gBAAgBA,UAAQ,SAAU;AAC9C,QAAMA,KAAG,IAAIhC,SAAOgC,KAAG;AACzB;AAEA,IAAI,QAAQ,MAAM,SAAS,CAAA;AAC3B,KAAKA,SAAO1B,UAAQ;AAClB,MAAI,CAACA,SAAO,eAAe0B,KAAG,EAAG;AACjC,MAAIA,UAAQ,iBAAiBA,UAAQ,kBAAmB;AACxD,QAAMA,KAAG,IAAI1B,SAAO0B,KAAG;AACzB;AAEA,MAAM,OAAO,YAAY1B,SAAO;AAEhC,IAAI,CAAC,MAAM,QAAQ,MAAM,SAAS,WAAW,MAAM;AACjD,QAAM,OAAO,SAAU,OAAO,kBAAkB,QAAQ;AACtD,QAAI,OAAO,UAAU,UAAU;AAC7B,YAAM,IAAI,UAAU,oEAAoE,OAAO,KAAK;IAC1G;AACI,QAAI,SAAS,OAAO,MAAM,WAAW,aAAa;AAChD,YAAM,IAAI,UAAU,oHAAoH,OAAO,KAAK;IAC1J;AACI,WAAOA,SAAO,OAAO,kBAAkB,MAAM;EACjD;AACA;AAEA,IAAI,CAAC,MAAM,OAAO;AAChB,QAAM,QAAQ,SAAU,MAAM,MAAM,UAAU;AAC5C,QAAI,OAAO,SAAS,UAAU;AAC5B,YAAM,IAAI,UAAU,+DAA+D,OAAO,IAAI;IACpG;AACI,QAAI,OAAO,KAAK,QAAQ,KAAK,KAAK,KAAK;AACrC,YAAM,IAAI,WAAW,gBAAgB,OAAO,gCAAgC;IAClF;AACI,QAAI,MAAMA,SAAO,IAAI;AACrB,QAAI,CAAC,QAAQ,KAAK,WAAW,GAAG;AAC9B,UAAI,KAAK,CAAC;IAChB,WAAe,OAAO,aAAa,UAAU;AACvC,UAAI,KAAK,MAAM,QAAQ;IAC7B,OAAW;AACL,UAAI,KAAK,IAAI;IACnB;AACI,WAAO;EACX;AACA;AAEA,IAAI,CAAC,MAAM,kBAAkB;AAC3B,MAAI;AACF,UAAM,mBAAmB,QAAQ,QAAQ,QAAQ,EAAE;EACvD,SAAW,GAAG;EAGd;AACA;AAEA,IAAI,CAAC,MAAM,WAAW;AACpB,QAAM,YAAY;IAChB,YAAY,MAAM;EACtB;AACE,MAAI,MAAM,kBAAkB;AAC1B,UAAM,UAAU,oBAAoB,MAAM;EAC9C;AACA;AAEA,IAAA,UAAiB;;AC1EjB,IAAM6B,aAAWhC;AAEjB,SAASwD,WAAS,SAAS;AACzB,OAAK,iBAAiB;IACpB,KAAK;IACL,MAAM,CAAA;IACN,SAAS,WAAW,CAAA;IACpB,QAAQ,CAAA;EACZ;AACA;AACgBC,WAAA,WAAGD;AAEnBA,WAAS,UAAU,UAAU,SAAS,QAAQjD,MAAK;AACjD,SAAOA,gBAAemD;AACxB;AAEAF,WAAS,UAAU,OAAO,SAAS,OAAO;AACxC,QAAMG,SAAQ,KAAK;AAEnB,SAAO,EAAE,KAAKA,OAAM,KAAK,SAASA,OAAM,KAAK,OAAM;AACrD;AAEAH,WAAS,UAAU,UAAU,SAAS,QAAQ,MAAM;AAClD,QAAMG,SAAQ,KAAK;AAEnB,EAAAA,OAAM,MAAM,KAAK;AACjB,EAAAA,OAAM,OAAOA,OAAM,KAAK,MAAM,GAAG,KAAK,OAAO;AAC/C;AAEAH,WAAS,UAAU,WAAW,SAAS,SAAS3B,MAAK;AACnD,SAAO,KAAK,eAAe,KAAK,KAAKA,IAAG;AAC1C;AAEA2B,WAAS,UAAU,UAAU,SAAS,QAAQpB,QAAO;AACnD,QAAMuB,SAAQ,KAAK;AAEnB,EAAAA,OAAM,OAAOA,OAAM,KAAK,MAAM,GAAGvB,SAAQ,CAAC;AAC5C;AAEAoB,WAAS,UAAU,WAAW,SAAS,SAASpB,QAAOP,MAAK,OAAO;AACjE,QAAM8B,SAAQ,KAAK;AAEnB,OAAK,QAAQvB,MAAK;AAClB,MAAIuB,OAAM,QAAQ;AAChB,IAAAA,OAAM,IAAI9B,IAAG,IAAI;AACrB;AAEA2B,WAAS,UAAU,OAAO,SAAS,OAAO;AACxC,SAAO,KAAK,eAAe,KAAK,KAAK,GAAG;AAC1C;AAEAA,WAAS,UAAU,cAAc,SAAS,cAAc;AACtD,QAAMG,SAAQ,KAAK;AAEnB,QAAM,OAAOA,OAAM;AACnB,EAAAA,OAAM,MAAM,CAAA;AACZ,SAAO;AACT;AAEAH,WAAS,UAAU,cAAc,SAAS,YAAY,MAAM;AAC1D,QAAMG,SAAQ,KAAK;AAEnB,QAAM,MAAMA,OAAM;AAClB,EAAAA,OAAM,MAAM;AACZ,SAAO;AACT;AAEAH,WAAS,UAAU,QAAQ,SAAS,MAAM,KAAK;AAC7C,MAAI;AACJ,QAAMG,SAAQ,KAAK;AAEnB,QAAM,YAAY,eAAeD;AACjC,MAAI,WAAW;AACb,UAAM;EACV,OAAS;AACL,UAAM,IAAIA,gBAAcC,OAAM,KAAK,IAAI,SAAS,MAAM;AACpD,aAAO,MAAM,KAAK,UAAU,IAAI,IAAI;IAC1C,CAAK,EAAE,KAAK,EAAE,GAAG,IAAI,WAAW,KAAK,IAAI,KAAK;EAC9C;AAEE,MAAI,CAACA,OAAM,QAAQ;AACjB,UAAM;AAER,MAAI,CAAC;AACH,IAAAA,OAAM,OAAO,KAAK,GAAG;AAEvB,SAAO;AACT;AAEAH,WAAS,UAAU,aAAa,SAAS,WAAW,QAAQ;AAC1D,QAAMG,SAAQ,KAAK;AACnB,MAAI,CAACA,OAAM,QAAQ;AACjB,WAAO;AAET,SAAO;IACL,QAAQ,KAAK,QAAQ,MAAM,IAAI,OAAO;IACtC,QAAQA,OAAM;EAClB;AACA;AAEA,SAASD,gBAAcE,OAAM,KAAK;AAChC,OAAK,OAAOA;AACZ,OAAK,QAAQ,GAAG;AAClB;AACA5B,WAAS0B,iBAAe,KAAK;AAE7BA,gBAAc,UAAU,UAAU,SAAS,QAAQ,KAAK;AACtD,OAAK,UAAU,MAAM,WAAW,KAAK,QAAQ;AAC7C,MAAI,MAAM;AACR,UAAM,kBAAkB,MAAMA,eAAa;AAE7C,MAAI,CAAC,KAAK,OAAO;AACf,QAAI;AAEF,YAAM,IAAI,MAAM,KAAK,OAAO;IAClC,SAAa,GAAG;AACV,WAAK,QAAQ,EAAE;IACrB;EACA;AACE,SAAO;AACT;;ACxHA,IAAM1B,aAAWhC;AACjB,IAAMwD,aAAWtD,WAA4B;AAC7C,IAAMC,WAAS0D,QAAwB;AAEvC,SAASC,gBAAc5B,OAAM,SAAS;AACpCsB,aAAS,KAAK,MAAM,OAAO;AAC3B,MAAI,CAACrD,SAAO,SAAS+B,KAAI,GAAG;AAC1B,SAAK,MAAM,kBAAkB;AAC7B;EACJ;AAEE,OAAK,OAAOA;AACZ,OAAK,SAAS;AACd,OAAK,SAASA,MAAK;AACrB;AACAF,WAAS8B,iBAAeN,UAAQ;AACX3D,SAAA,gBAAGiE;AAExBA,gBAAc,kBAAkB,SAAS,gBAAgB,MAAM;AAC7D,MAAI,gBAAgBA,iBAAe;AACjC,WAAO;EACX;AAGE,QAAM,eAAe,OAAO,SAAS,YACnC3D,SAAO,SAAS,KAAK,IAAI,KACzB,KAAK,YAAY,SAAS,mBAC1B,OAAO,KAAK,WAAW,YACvB,OAAO,KAAK,WAAW,YACvB,OAAO,KAAK,SAAS,cACrB,OAAO,KAAK,YAAY,cACxB,OAAO,KAAK,YAAY,cACxB,OAAO,KAAK,cAAc,cAC1B,OAAO,KAAK,SAAS,cACrB,OAAO,KAAK,QAAQ;AAEtB,SAAO;AACT;AAEA2D,gBAAc,UAAU,OAAO,SAASC,QAAO;AAC7C,SAAO,EAAE,QAAQ,KAAK,QAAQ,UAAUP,WAAS,UAAU,KAAK,KAAK,IAAI,EAAC;AAC5E;AAEAM,gBAAc,UAAU,UAAU,SAASE,SAAQD,OAAM;AAEvD,QAAM,MAAM,IAAID,gBAAc,KAAK,IAAI;AACvC,MAAI,SAASC,MAAK;AAClB,MAAI,SAAS,KAAK;AAElB,OAAK,SAASA,MAAK;AACnBP,aAAS,UAAU,QAAQ,KAAK,MAAMO,MAAK,QAAQ;AAEnD,SAAO;AACT;AAEAD,gBAAc,UAAU,UAAU,SAAS,UAAU;AACnD,SAAO,KAAK,WAAW,KAAK;AAC9B;AAEAA,gBAAc,UAAU,YAAY,SAAS,UAAU,MAAM;AAC3D,MAAI,KAAK,SAAS,KAAK,KAAK;AAC1B,WAAO,KAAK,KAAK,UAAU,KAAK,UAAU,IAAI;;AAE9C,WAAO,KAAK,MAAM,QAAQ,uBAAuB;AACrD;AAEAA,gBAAc,UAAU,OAAO,SAAS,KAAK,OAAO,MAAM;AACxD,MAAI,EAAE,KAAK,SAAS,SAAS,KAAK;AAChC,WAAO,KAAK,MAAM,QAAQ,uBAAuB;AAEnD,QAAM,MAAM,IAAIA,gBAAc,KAAK,IAAI;AAGvC,MAAI,iBAAiB,KAAK;AAE1B,MAAI,SAAS,KAAK;AAClB,MAAI,SAAS,KAAK,SAAS;AAC3B,OAAK,UAAU;AACf,SAAO;AACT;AAEAA,gBAAc,UAAU,MAAM,SAAS,IAAIC,OAAM;AAC/C,SAAO,KAAK,KAAK,MAAMA,QAAOA,MAAK,SAAS,KAAK,QAAQ,KAAK,MAAM;AACtE;AAEA,SAASE,gBAAc,OAAOR,WAAU;AACtC,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,SAAK,SAAS;AACd,SAAK,QAAQ,MAAM,IAAI,SAAS,MAAM;AACpC,UAAI,CAACQ,gBAAc,gBAAgB,IAAI;AACrC,eAAO,IAAIA,gBAAc,MAAMR,SAAQ;AACzC,WAAK,UAAU,KAAK;AACpB,aAAO;IACb,GAAO,IAAI;EACX,WAAa,OAAO,UAAU,UAAU;AACpC,QAAI,EAAE,KAAK,SAAS,SAAS;AAC3B,aAAOA,UAAS,MAAM,8BAA8B;AACtD,SAAK,QAAQ;AACb,SAAK,SAAS;EAClB,WAAa,OAAO,UAAU,UAAU;AACpC,SAAK,QAAQ;AACb,SAAK,SAAStD,SAAO,WAAW,KAAK;EACzC,WAAaA,SAAO,SAAS,KAAK,GAAG;AACjC,SAAK,QAAQ;AACb,SAAK,SAAS,MAAM;EACxB,OAAS;AACL,WAAOsD,UAAS,MAAM,uBAAuB,OAAO,KAAK;EAC7D;AACA;AACqB5D,SAAA,gBAAGoE;AAExBA,gBAAc,kBAAkB,SAAS,gBAAgB,MAAM;AAC7D,MAAI,gBAAgBA,iBAAe;AACjC,WAAO;EACX;AAGE,QAAM,eAAe,OAAO,SAAS,YACnC,KAAK,YAAY,SAAS,mBAC1B,OAAO,KAAK,WAAW,YACvB,OAAO,KAAK,SAAS;AAEvB,SAAO;AACT;AAEAA,gBAAc,UAAU,OAAO,SAAS,KAAK,KAAK,QAAQ;AACxD,MAAI,CAAC;AACH,UAAM9D,SAAO,MAAM,KAAK,MAAM;AAChC,MAAI,CAAC;AACH,aAAS;AAEX,MAAI,KAAK,WAAW;AAClB,WAAO;AAET,MAAI,MAAM,QAAQ,KAAK,KAAK,GAAG;AAC7B,SAAK,MAAM,QAAQ,SAAS,MAAM;AAChC,WAAK,KAAK,KAAK,MAAM;AACrB,gBAAU,KAAK;IACrB,CAAK;EACL,OAAS;AACL,QAAI,OAAO,KAAK,UAAU;AACxB,UAAI,MAAM,IAAI,KAAK;aACZ,OAAO,KAAK,UAAU;AAC7B,UAAI,MAAM,KAAK,OAAO,MAAM;aACrBA,SAAO,SAAS,KAAK,KAAK;AACjC,WAAK,MAAM,KAAK,KAAK,MAAM;AAC7B,cAAU,KAAK;EACnB;AAEE,SAAO;AACT;ICxJA,qBAAiB4B;AAEjB,SAASA,SAAO,KAAK,KAAK;AACxB,MAAI,CAAC;AACH,UAAM,IAAI,MAAM,OAAO,kBAAkB;AAC7C;AAEAA,SAAO,QAAQ,SAAS,YAAY,GAAGM,IAAG,KAAK;AAC7C,MAAI,KAAKA;AACP,UAAM,IAAI,MAAM,OAAQ,uBAAuB,IAAI,SAASA,EAAE;AAClE;ACRA,IAAMmB,aAAWxD,WAA4B;AAC7C,IAAM,gBAAgBE,SAA0B;AAChD,IAAM4D,kBAAgB5D,SAA0B;AAChD,IAAM6B,WAAS8B;AAGf,IAAM,OAAO;EACX;EAAO;EAAS;EAAO;EAAS;EAAS;EACzC;EAAW;EAAW;EAAS;EAAQ;EAAO;EAC9C;EAAU;EAAU;EAAW;EAAU;EAAY;EAAU;EAC/D;EAAU;EAAU;EAAY;EAAU;EAAU;EAAW;AACjE;AAGA,IAAM,UAAU;EACd;EAAO;EAAO;EAAO;EAAY;EAAY;EAAY;EAAO;EAChE;EAAO;AACT,EAAE,OAAO,IAAI;AAGb,IAAM,YAAY;EAChB;EAAY;EAAc;EAC1B;EAAc;EAAgB;EAC9B;EAAe;EAAc;EAAe;EAE5C;EAAoB;EAAc;EAAgB;EAClD;EAAe;EAAc;AAC/B;AAEA,SAASK,OAAK,KAAK,QAAQ1C,OAAM;AAC/B,QAAMmC,SAAQ,CAAA;AACd,OAAK,aAAaA;AAElB,EAAAA,OAAM,OAAOnC;AACb,EAAAmC,OAAM,MAAM;AAEZ,EAAAA,OAAM,SAAS,UAAU;AACzB,EAAAA,OAAM,WAAW;AAGjB,EAAAA,OAAM,MAAM;AACZ,EAAAA,OAAM,OAAO;AACb,EAAAA,OAAM,cAAc;AACpB,EAAAA,OAAM,SAAS;AACf,EAAAA,OAAM,WAAW;AACjB,EAAAA,OAAM,MAAM;AACZ,EAAAA,OAAM,MAAM;AACZ,EAAAA,OAAM,MAAM;AACZ,EAAAA,OAAM,aAAa;AACnB,EAAAA,OAAM,MAAM;AACZ,EAAAA,OAAM,SAAS,IAAI;AACnB,EAAAA,OAAM,WAAW;AACjB,EAAAA,OAAM,WAAW;AACjB,EAAAA,OAAM,WAAW;AAGjB,MAAI,CAACA,OAAM,QAAQ;AACjB,IAAAA,OAAM,WAAW,CAAA;AACjB,SAAK,MAAK;EACd;AACA;IACAQ,SAAiBD;AAEjB,IAAM,aAAa;EACjB;EAAO;EAAU;EAAY;EAAO;EAAQ;EAAe;EAC3D;EAAY;EAAO;EAAO;EAAO;EAAc;EAAO;EAAW;EACjE;EAAY;AACd;AAEAA,OAAK,UAAU,QAAQ,SAAS,QAAQ;AACtC,QAAMP,SAAQ,KAAK;AACnB,QAAM,SAAS,CAAA;AACf,aAAW,QAAQ,SAAS,MAAM;AAChC,WAAO,IAAI,IAAIA,OAAM,IAAI;EAC7B,CAAG;AACD,QAAM,MAAM,IAAI,KAAK,YAAY,OAAO,MAAM;AAC9C,MAAI,aAAa;AACjB,SAAO;AACT;AAEAO,OAAK,UAAU,QAAQ,SAAS,OAAO;AACrC,QAAMP,SAAQ,KAAK;AACnB,UAAQ,QAAQ,SAAS,QAAQ;AAC/B,SAAK,MAAM,IAAI,SAAS,iBAAiB;AACvC,YAAMnB,SAAQ,IAAI,KAAK,YAAY,IAAI;AACvC,MAAAmB,OAAM,SAAS,KAAKnB,MAAK;AACzB,aAAOA,OAAM,MAAM,EAAE,MAAMA,QAAO,SAAS;IACjD;EACA,GAAK,IAAI;AACT;AAEA0B,OAAK,UAAU,QAAQ,SAAS,KAAK,MAAM;AACzC,QAAMP,SAAQ,KAAK;AAEnB5B,WAAO4B,OAAM,WAAW,IAAI;AAC5B,OAAK,KAAK,IAAI;AAGd,EAAAA,OAAM,WAAWA,OAAM,SAAS,OAAO,SAAS,OAAO;AACrD,WAAO,MAAM,WAAW,WAAW;EACvC,GAAK,IAAI;AACP5B,WAAO,MAAM4B,OAAM,SAAS,QAAQ,GAAG,mCAAmC;AAC5E;AAEAO,OAAK,UAAU,WAAW,SAAS,QAAQ,MAAM;AAC/C,QAAMP,SAAQ,KAAK;AAGnB,QAAM,WAAW,KAAK,OAAO,SAAS,KAAK;AACzC,WAAO,eAAe,KAAK;EAC/B,GAAK,IAAI;AACP,SAAO,KAAK,OAAO,SAAS,KAAK;AAC/B,WAAO,EAAE,eAAe,KAAK;EACjC,GAAK,IAAI;AAEP,MAAI,SAAS,WAAW,GAAG;AACzB5B,aAAO4B,OAAM,aAAa,IAAI;AAC9B,IAAAA,OAAM,WAAW;AAGjB,aAAS,QAAQ,SAAS,OAAO;AAC/B,YAAM,WAAW,SAAS;IAChC,GAAO,IAAI;EACX;AACE,MAAI,KAAK,WAAW,GAAG;AACrB5B,aAAO4B,OAAM,SAAS,IAAI;AAC1B,IAAAA,OAAM,OAAO;AACb,IAAAA,OAAM,cAAc,KAAK,IAAI,SAAS,KAAK;AACzC,UAAI,OAAO,QAAQ,YAAY,IAAI,gBAAgB;AACjD,eAAO;AAET,YAAM,MAAM,CAAA;AACZ,aAAO,KAAK,GAAG,EAAE,QAAQ,SAAS9B,MAAK;AACrC,YAAIA,SAAQA,OAAM;AAChB,UAAAA,QAAO;AACT,cAAM,QAAQ,IAAIA,IAAG;AACrB,YAAI,KAAK,IAAIA;MACrB,CAAO;AACD,aAAO;IACb,CAAK;EACL;AACA;AAMA,UAAU,QAAQ,SAAS,QAAQ;AACjCqC,SAAK,UAAU,MAAM,IAAI,SAAS,aAAa;AAC7C,UAAMP,SAAQ,KAAK;AACnB,UAAM,IAAI,MAAM,SAAS,oCAAoCA,OAAM,GAAG;EAC1E;AACA,CAAC;AAMD,KAAK,QAAQ,SAAS,KAAK;AACzBO,SAAK,UAAU,GAAG,IAAI,SAAS,aAAa;AAC1C,UAAMP,SAAQ,KAAK;AACnB,UAAM,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AAEjD5B,aAAO4B,OAAM,QAAQ,IAAI;AACzB,IAAAA,OAAM,MAAM;AAEZ,SAAK,SAAS,IAAI;AAElB,WAAO;EACX;AACA,CAAC;AAEDO,OAAK,UAAU,MAAM,SAAS,IAAI,MAAM;AACtCnC,WAAO,IAAI;AACX,QAAM4B,SAAQ,KAAK;AAEnB5B,WAAO4B,OAAM,QAAQ,IAAI;AACzB,EAAAA,OAAM,MAAM;AAEZ,SAAO;AACT;AAEAO,OAAK,UAAU,WAAW,SAAS,WAAW;AAC5C,QAAMP,SAAQ,KAAK;AAEnB,EAAAA,OAAM,WAAW;AAEjB,SAAO;AACT;AAEAO,OAAK,UAAU,MAAM,SAAS,IAAI,KAAK;AACrC,QAAMP,SAAQ,KAAK;AAEnB5B,WAAO4B,OAAM,SAAS,MAAM,IAAI;AAChC,EAAAA,OAAM,SAAS,IAAI;AACnB,EAAAA,OAAM,WAAW;AAEjB,SAAO;AACT;AAEAO,OAAK,UAAU,WAAW,SAAS,SAAS,KAAK;AAC/C,QAAMP,SAAQ,KAAK;AAEnB5B,WAAO4B,OAAM,aAAa,QAAQA,OAAM,aAAa,IAAI;AACzD,EAAAA,OAAM,WAAW;AAEjB,SAAO;AACT;AAEAO,OAAK,UAAU,WAAW,SAAS,SAAS,KAAK;AAC/C,QAAMP,SAAQ,KAAK;AAEnB5B,WAAO4B,OAAM,aAAa,QAAQA,OAAM,aAAa,IAAI;AACzD,EAAAA,OAAM,WAAW;AAEjB,SAAO;AACT;AAEAO,OAAK,UAAU,MAAM,SAAS,MAAM;AAClC,QAAMP,SAAQ,KAAK;AACnB,QAAM,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AAEjD,EAAAA,OAAM,MAAM;AAEZ,MAAI,KAAK,WAAW;AAClB,SAAK,SAAS,IAAI;AAEpB,SAAO;AACT;AAEAO,OAAK,UAAU,MAAM,SAAS,IAAI,QAAQ;AACxC,QAAMP,SAAQ,KAAK;AAEnB5B,WAAO4B,OAAM,QAAQ,IAAI;AACzB,EAAAA,OAAM,MAAM;AAEZ,SAAO;AACT;AAEAO,OAAK,UAAU,MAAM,SAAS,MAAM;AAClC,QAAMP,SAAQ,KAAK;AAEnB,EAAAA,OAAM,MAAM;AAEZ,SAAO;AACT;AAEAO,OAAK,UAAU,SAAS,SAAS,OAAO3D,MAAK;AAC3C,QAAMoD,SAAQ,KAAK;AAEnB5B,WAAO4B,OAAM,WAAW,IAAI;AAC5B,EAAAA,OAAM,SAASpD;AACf,OAAK,SAAS,OAAO,KAAKA,IAAG,EAAE,IAAI,SAASsB,MAAK;AAC/C,WAAOtB,KAAIsB,IAAG;EAClB,CAAG,CAAC;AAEF,SAAO;AACT;AAEAqC,OAAK,UAAU,WAAW,SAAS,SAAS,MAAM;AAChD,QAAMP,SAAQ,KAAK;AAEnB5B,WAAO4B,OAAM,QAAQ,IAAI;AACzB,EAAAA,OAAM,WAAW;AAEjB,SAAO;AACT;AAMAO,OAAK,UAAU,UAAU,SAAS,OAAO,OAAO,SAAS;AACvD,QAAMP,SAAQ,KAAK;AAGnB,MAAIA,OAAM,WAAW;AACnB,WAAO,MAAM,WAAWA,OAAM,SAAS,CAAC,EAAE,QAAQ,OAAO,OAAO,CAAC;AAEnE,MAAI,SAASA,OAAM,SAAS;AAC5B,MAAI,UAAU;AAEd,MAAI,UAAU;AACd,MAAIA,OAAM,QAAQ;AAChB,cAAU,MAAM,SAASA,OAAM,GAAG;AAGpC,MAAIA,OAAM,UAAU;AAClB,QAAI,MAAM;AACV,QAAIA,OAAM,aAAa;AACrB,YAAMA,OAAM;aACLA,OAAM,aAAa;AAC1B,YAAMA,OAAM;aACLA,OAAM,QAAQ;AACrB,YAAMA,OAAM;AAEd,QAAI,QAAQ,QAAQ,CAACA,OAAM,KAAK;AAE9B,YAAMI,QAAO,MAAM,KAAI;AACvB,UAAI;AACF,YAAIJ,OAAM,WAAW;AACnB,eAAK,eAAeA,OAAM,KAAK,OAAO,OAAO;;AAE7C,eAAK,cAAc,OAAO,OAAO;AACnC,kBAAU;MAClB,SAAe,GAAG;AACV,kBAAU;MAClB;AACM,YAAM,QAAQI,KAAI;IACxB,OAAW;AACL,gBAAU,KAAK,SAAS,OAAO,KAAKJ,OAAM,GAAG;AAE7C,UAAI,MAAM,QAAQ,OAAO;AACvB,eAAO;IACf;EACA;AAGE,MAAI;AACJ,MAAIA,OAAM,OAAO;AACf,cAAU,MAAM,YAAW;AAE7B,MAAI,SAAS;AAEX,QAAIA,OAAM,aAAa,MAAM;AAC3B,YAAMS,YAAW,KAAK,WAAW,OAAOT,OAAM,QAAQ;AACtD,UAAI,MAAM,QAAQS,SAAQ;AACxB,eAAOA;AACT,cAAQA;IACd;AAEI,UAAM,QAAQ,MAAM;AAGpB,QAAIT,OAAM,QAAQ,QAAQA,OAAM,WAAW,MAAM;AAC/C,UAAII;AACJ,UAAIJ,OAAM;AACR,QAAAI,QAAO,MAAM,KAAI;AACnB,YAAM,OAAO,KAAK;QAChB;QACAJ,OAAM,aAAa,OAAOA,OAAM,WAAWA,OAAM;QACjDA,OAAM;MACd;AACM,UAAI,MAAM,QAAQ,IAAI;AACpB,eAAO;AAET,UAAIA,OAAM;AACR,iBAAS,MAAM,IAAII,KAAI;;AAEvB,gBAAQ;IAChB;AAEI,QAAI,WAAW,QAAQ,SAASJ,OAAM,QAAQ;AAC5C,cAAQ,MAAM,MAAM,KAAI,GAAI,OAAO,MAAM,QAAQ,QAAQ;AAE3D,QAAI,WAAW,QAAQ,SAASA,OAAM,QAAQ;AAC5C,cAAQ,MAAM,MAAM,KAAI,GAAI,MAAM,QAAQ,MAAM,QAAQ,SAAS;AAGnE,QAAIA,OAAM,IAAK;aAEJA,OAAM,WAAW,MAAM;AAChC,eAAS,KAAK,eAAeA,OAAM,KAAK,OAAO,OAAO;IAC5D,OAAW;AACL,eAAS,KAAK,cAAc,OAAO,OAAO;IAChD;AAEI,QAAI,MAAM,QAAQ,MAAM;AACtB,aAAO;AAGT,QAAI,CAACA,OAAM,OAAOA,OAAM,WAAW,QAAQA,OAAM,aAAa,MAAM;AAClE,MAAAA,OAAM,SAAS,QAAQ,SAAS,eAAe,OAAO;AAGpD,cAAM,QAAQ,OAAO,OAAO;MACpC,CAAO;IACP;AAGI,QAAIA,OAAM,aAAaA,OAAM,QAAQ,YAAYA,OAAM,QAAQ,WAAW;AACxE,YAAM,OAAO,IAAIG,gBAAc,MAAM;AACrC,eAAS,KAAK,QAAQH,OAAM,UAAU,MAAM,eAAe,GAAG,EAC3D,QAAQ,MAAM,OAAO;IAC9B;EACA;AAGE,MAAIA,OAAM,OAAO;AACf,aAAS,MAAM,YAAY,OAAO;AAGpC,MAAIA,OAAM,QAAQ,SAAS,WAAW,QAAQ,YAAY;AACxD,UAAM,SAAS,SAASA,OAAM,KAAK,MAAM;WAClC,YAAY;AACnB,UAAM,QAAQ,OAAO;AAEvB,SAAO;AACT;AAEAO,OAAK,UAAU,iBAAiB,SAAS,cAAc,KAAK,OAAO,SAAS;AAC1E,QAAMP,SAAQ,KAAK;AAEnB,MAAI,QAAQ,SAAS,QAAQ;AAC3B,WAAO;AACT,MAAI,QAAQ,WAAW,QAAQ;AAC7B,WAAO,KAAK,YAAY,OAAO,KAAKA,OAAM,KAAK,CAAC,GAAG,OAAO;WACnD,OAAO,KAAK,GAAG;AACtB,WAAO,KAAK,WAAW,OAAO,KAAK,OAAO;WACnC,QAAQ,WAAWA,OAAM;AAChC,WAAO,KAAK,aAAa,OAAOA,OAAM,KAAK,CAAC,GAAGA,OAAM,KAAK,CAAC,GAAG,OAAO;WAC9D,QAAQ;AACf,WAAO,KAAK,aAAa,OAAO,MAAM,MAAM,OAAO;WAC5C,QAAQ,aAAa,QAAQ;AACpC,WAAO,KAAK,YAAY,OAAO,KAAK,OAAO;WACpC,QAAQ;AACf,WAAO,KAAK,YAAY,OAAO,OAAO;WAC/B,QAAQ;AACf,WAAO,KAAK,YAAY,OAAO,OAAO;WAC/B,QAAQ;AACf,WAAO,KAAK,WAAW,OAAO,KAAK,OAAO;WACnC,QAAQ,SAAS,QAAQ;AAChC,WAAO,KAAK,WAAW,OAAOA,OAAM,QAAQA,OAAM,KAAK,CAAC,GAAG,OAAO;AAEpE,MAAIA,OAAM,QAAQ,MAAM;AACtB,WAAO,KAAK,QAAQA,OAAM,KAAK,MAAM,eAAe,GAAG,EACpD,QAAQ,OAAO,OAAO;EAC7B,OAAS;AACL,WAAO,MAAM,MAAM,kBAAkB,GAAG;EAC5C;AACA;AAEAO,OAAK,UAAU,UAAU,SAAS,QAAQ,QAAQ3D,MAAK;AAErD,QAAMoD,SAAQ,KAAK;AAEnB,EAAAA,OAAM,aAAa,KAAK,KAAK,QAAQpD,IAAG;AACxCwB,WAAO4B,OAAM,WAAW,WAAW,WAAW,IAAI;AAClD,EAAAA,OAAM,aAAaA,OAAM,WAAW,WAAW,SAAS,CAAC;AACzD,MAAIA,OAAM,aAAaA,OAAM,WAAW,WAAW,UAAU;AAC3D,IAAAA,OAAM,aAAaA,OAAM,WAAW,MAAK;AACzC,IAAAA,OAAM,WAAW,WAAW,WAAWA,OAAM;EACjD;AACE,SAAOA,OAAM;AACf;AAEAO,OAAK,UAAU,gBAAgB,SAAS,aAAa,OAAO,SAAS;AACnE,QAAMP,SAAQ,KAAK;AACnB,MAAI,SAAS;AACb,MAAI,QAAQ;AAEZ,SAAO,KAAKA,OAAM,MAAM,EAAE,KAAK,SAAS9B,MAAK;AAC3C,UAAMkC,QAAO,MAAM,KAAI;AACvB,UAAMI,QAAOR,OAAM,OAAO9B,IAAG;AAC7B,QAAI;AACF,YAAM,QAAQsC,MAAK,QAAQ,OAAO,OAAO;AACzC,UAAI,MAAM,QAAQ,KAAK;AACrB,eAAO;AAET,eAAS,EAAE,MAAMtC,MAAK,MAAY;AAClC,cAAQ;IACd,SAAa,GAAG;AACV,YAAM,QAAQkC,KAAI;AAClB,aAAO;IACb;AACI,WAAO;EACX,GAAK,IAAI;AAEP,MAAI,CAAC;AACH,WAAO,MAAM,MAAM,oBAAoB;AAEzC,SAAO;AACT;AAMAG,OAAK,UAAU,uBAAuB,SAAS,oBAAoB,MAAM;AACvE,SAAO,IAAI,cAAc,MAAM,KAAK,QAAQ;AAC9C;AAEAA,OAAK,UAAU,UAAU,SAAS,OAAO,MAAMT,WAAU,QAAQ;AAC/D,QAAME,SAAQ,KAAK;AACnB,MAAIA,OAAM,SAAS,MAAM,QAAQA,OAAM,SAAS,MAAM;AACpD;AAEF,QAAM,SAAS,KAAK,aAAa,MAAMF,WAAU,MAAM;AACvD,MAAI,WAAW;AACb;AAEF,MAAI,KAAK,aAAa,QAAQA,WAAU,MAAM;AAC5C;AAEF,SAAO;AACT;AAEAS,OAAK,UAAU,eAAe,SAASG,QAAO,MAAMZ,WAAU,QAAQ;AACpE,QAAME,SAAQ,KAAK;AAGnB,MAAIA,OAAM,WAAW;AACnB,WAAOA,OAAM,SAAS,CAAC,EAAE,QAAQ,MAAMF,aAAY,IAAID,WAAQ,CAAE;AAEnE,MAAI,SAAS;AAGb,OAAK,WAAWC;AAGhB,MAAIE,OAAM,YAAY,SAAS,QAAW;AACxC,QAAIA,OAAM,SAAS,MAAM;AACvB,aAAOA,OAAM,SAAS;;AAEtB;EACN;AAGE,MAAI,UAAU;AACd,MAAI,YAAY;AAChB,MAAIA,OAAM,KAAK;AAEb,aAAS,KAAK,qBAAqB,IAAI;EAC3C,WAAaA,OAAM,QAAQ;AACvB,aAAS,KAAK,cAAc,MAAMF,SAAQ;EAC9C,WAAaE,OAAM,UAAU;AACzB,cAAU,KAAK,QAAQA,OAAM,UAAU,MAAM,EAAE,QAAQ,MAAMF,SAAQ;AACrE,gBAAY;EAChB,WAAaE,OAAM,UAAU;AACzB,cAAUA,OAAM,SAAS,IAAI,SAAS,OAAO;AAC3C,UAAI,MAAM,WAAW,QAAQ;AAC3B,eAAO,MAAM,QAAQ,MAAMF,WAAU,IAAI;AAE3C,UAAI,MAAM,WAAW,QAAQ;AAC3B,eAAOA,UAAS,MAAM,yBAAyB;AACjD,YAAM,UAAUA,UAAS,SAAS,MAAM,WAAW,GAAG;AAEtD,UAAI,OAAO,SAAS;AAClB,eAAOA,UAAS,MAAM,yCAAyC;AAEjE,YAAM,MAAM,MAAM,QAAQ,KAAK,MAAM,WAAW,GAAG,GAAGA,WAAU,IAAI;AACpE,MAAAA,UAAS,SAAS,OAAO;AAEzB,aAAO;IACb,GAAO,IAAI,EAAE,OAAO,SAAS,OAAO;AAC9B,aAAO;IACb,CAAK;AACD,cAAU,KAAK,qBAAqB,OAAO;EAC/C,OAAS;AACL,QAAIE,OAAM,QAAQ,WAAWA,OAAM,QAAQ,SAAS;AAElD,UAAI,EAAEA,OAAM,QAAQA,OAAM,KAAK,WAAW;AACxC,eAAOF,UAAS,MAAM,yBAAyBE,OAAM,GAAG;AAE1D,UAAI,CAAC,MAAM,QAAQ,IAAI;AACrB,eAAOF,UAAS,MAAM,oCAAoC;AAE5D,YAAM,QAAQ,KAAK,MAAK;AACxB,YAAM,WAAW,WAAW;AAC5B,gBAAU,KAAK,qBAAqB,KAAK,IAAI,SAAS,MAAM;AAC1D,cAAME,SAAQ,KAAK;AAEnB,eAAO,KAAK,QAAQA,OAAM,KAAK,CAAC,GAAG,IAAI,EAAE,QAAQ,MAAMF,SAAQ;MACvE,GAAS,KAAK,CAAC;IACf,WAAeE,OAAM,QAAQ,MAAM;AAC7B,eAAS,KAAK,QAAQA,OAAM,KAAK,MAAM,EAAE,QAAQ,MAAMF,SAAQ;IACrE,OAAW;AACL,gBAAU,KAAK,iBAAiBE,OAAM,KAAK,IAAI;AAC/C,kBAAY;IAClB;EACA;AAGE,MAAI,CAACA,OAAM,OAAOA,OAAM,WAAW,MAAM;AACvC,UAAM,MAAMA,OAAM,aAAa,OAAOA,OAAM,WAAWA,OAAM;AAC7D,UAAM,MAAMA,OAAM,aAAa,OAAO,cAAc;AAEpD,QAAI,QAAQ,MAAM;AAChB,UAAIA,OAAM,QAAQ;AAChB,QAAAF,UAAS,MAAM,sCAAsC;IAC7D,OAAW;AACL,UAAIE,OAAM,QAAQ;AAChB,iBAAS,KAAK,iBAAiB,KAAK,WAAW,KAAK,OAAO;IACnE;EACA;AAGE,MAAIA,OAAM,aAAa;AACrB,aAAS,KAAK,iBAAiBA,OAAM,UAAU,OAAO,WAAW,MAAM;AAEzE,SAAO;AACT;AAEAO,OAAK,UAAU,gBAAgB,SAAS,aAAa,MAAMT,WAAU;AACnE,QAAME,SAAQ,KAAK;AAEnB,QAAMQ,QAAOR,OAAM,OAAO,KAAK,IAAI;AACnC,MAAI,CAACQ,OAAM;AACTpC;MACE;MACA,KAAK,OAAO,mBACN,KAAK,UAAU,OAAO,KAAK4B,OAAM,MAAM,CAAC;IAAC;EACrD;AACE,SAAOQ,MAAK,QAAQ,KAAK,OAAOV,SAAQ;AAC1C;AAEAS,OAAK,UAAU,mBAAmB,SAAS,gBAAgB,KAAK,MAAM;AACpE,QAAMP,SAAQ,KAAK;AAEnB,MAAI,OAAO,KAAK,GAAG;AACjB,WAAO,KAAK,WAAW,MAAM,GAAG;WACzB,QAAQ,WAAWA,OAAM;AAChC,WAAO,KAAK,aAAa,MAAMA,OAAM,YAAY,CAAC,GAAGA,OAAM,KAAK,CAAC,CAAC;WAC3D,QAAQ;AACf,WAAO,KAAK,aAAa,MAAM,MAAM,IAAI;WAClC,QAAQ,aAAa,QAAQ;AACpC,WAAO,KAAK,YAAY,MAAM,GAAG;WAC1B,QAAQ;AACf,WAAO,KAAK,YAAW;WAChB,QAAQ,SAAS,QAAQ;AAChC,WAAO,KAAK,WAAW,MAAMA,OAAM,QAAQA,OAAM,YAAY,CAAC,CAAC;WACxD,QAAQ;AACf,WAAO,KAAK,YAAY,IAAI;WACrB,QAAQ;AACf,WAAO,KAAK,WAAW,MAAM,GAAG;;AAEhC,UAAM,IAAI,MAAM,sBAAsB,GAAG;AAC7C;AAEAO,OAAK,UAAU,YAAY,SAAS,SAAS,KAAK;AAChD,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEAA,OAAK,UAAU,cAAc,SAAS,WAAW,KAAK;AACpD,SAAO,6BAA6B,KAAK,GAAG;AAC9C;;;AC1nBA,WAAS,QAAQ,KAAK;AACpB,UAAM,MAAM,CAAA;AAEZ,WAAO,KAAK,GAAG,EAAE,QAAQ,SAASrC,MAAK;AAErC,WAAKA,OAAM,MAAMA;AACf,QAAAA,OAAMA,OAAM;AAEd,YAAM,QAAQ,IAAIA,IAAG;AACrB,UAAI,KAAK,IAAIA;IACjB,CAAG;AAED,WAAO;;AAGT,UAAmB,WAAA;IACjB,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;EACL;AACA,UAAA,iBAAyB,QAAQ,QAAQ,QAAQ;AAEjD,UAAc,MAAA;IACZ,GAAM;IACN,GAAM;IACN,GAAM;IACN,GAAM;IACN,GAAM;IACN,GAAM;IACN,GAAM;IACN,GAAM;IACN,GAAM;IACN,GAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;IACN,IAAM;EACR;AACA,UAAA,YAAoB,QAAQ,QAAQ,GAAG;;;;;;;ACtDvC,QAAMG,YAAWhC;AACjB,QAAMG,UAASD,QAAwB;AACvC,QAAMgE,QAAOL;AACb,QAAMS,QAAOC,cAAA;AACb,QAAMC,UAASF,MAAK;AAEpB,QAAMG,OAAMC;AAEZ,WAAS,WAAW,QAAQ;AAC1B,SAAK,MAAM;AACX,SAAK,OAAO,OAAO;AACnB,SAAK,SAAS;AAGd,SAAK,OAAO,IAAIC,SAAO;AACvB,SAAK,KAAK,MAAM,OAAO,IAAI;;AAEfC,YAAG;AAEjB,aAAW,UAAU,SAAS,SAASP,QAAO,MAAMZ,WAAU;AAC5D,WAAO,KAAK,KAAK,QAAQ,MAAMA,SAAQ,EAAE,KAAI;EAC/C;AAIA,WAASkB,SAAQ,QAAQ;AACvB,IAAAT,MAAK,KAAK,MAAM,OAAO,MAAM;;AAE/B,EAAAlC,UAAS2C,UAAST,KAAI;AAEtB,EAAAS,SAAQ,UAAU,mBAAmB,SAAS,gBAAgB,KAC5D,WACA,KACA,SAAS;AACT,UAAM,aAAa,UAAU,KAAK,WAAW,KAAK,KAAK,QAAQ;AAG/D,QAAI,QAAQ,SAAS,KAAM;AACzB,YAAME,UAAS1E,QAAO,MAAM,CAAC;AAC7B,MAAA0E,QAAO,CAAC,IAAI;AACZ,MAAAA,QAAO,CAAC,IAAI,QAAQ;AACpB,aAAO,KAAK,qBAAqB,CAAEA,SAAQ,OAAO,CAAE;;AAKtD,QAAI,YAAY;AAChB,aAAS,IAAI,QAAQ,QAAQ,KAAK,KAAO,MAAM;AAC7C;AAEF,UAAM,SAAS1E,QAAO,MAAM,IAAI,IAAI,SAAS;AAC7C,WAAO,CAAC,IAAI;AACZ,WAAO,CAAC,IAAI,MAAO;AAEnB,aAAS,IAAI,IAAI,WAAW,IAAI,QAAQ,QAAQ,IAAI,GAAG,KAAK,MAAM;AAChE,aAAO,CAAC,IAAI,IAAI;AAElB,WAAO,KAAK,qBAAqB,CAAE,QAAQ,OAAO,CAAE;EACtD;AAEA,EAAAwE,SAAQ,UAAU,aAAa,SAAS,UAAU,KAAK,KAAK;AAC1D,QAAI,QAAQ,UAAU;AACpB,aAAO,KAAK,qBAAqB,CAAE,IAAI,SAAS,GAAG,IAAI,IAAI,CAAE;IACjE,WAAa,QAAQ,UAAU;AAC3B,YAAM,MAAMxE,QAAO,MAAM,IAAI,SAAS,CAAC;AACvC,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,cAAc,IAAI,WAAW,CAAC,GAAG,IAAI,CAAC;;AAE5C,aAAO,KAAK,qBAAqB,GAAG;IACxC,WAAa,QAAQ,UAAU;AAC3B,UAAI,CAAC,KAAK,UAAU,GAAG,GAAG;AACxB,eAAO,KAAK,SAAS,MAAM,gEACuB;;AAEpD,aAAO,KAAK,qBAAqB,GAAG;IACxC,WAAa,QAAQ,YAAY;AAC7B,UAAI,CAAC,KAAK,YAAY,GAAG,GAAG;AAC1B,eAAO,KAAK,SAAS,MAAM,mNAKe;;AAE5C,aAAO,KAAK,qBAAqB,GAAG;eAC3B,OAAO,KAAK,GAAG,GAAG;AAC3B,aAAO,KAAK,qBAAqB,GAAG;IACxC,WAAa,QAAQ,WAAW;AAC5B,aAAO,KAAK,qBAAqB,GAAG;IACxC,OAAS;AACL,aAAO,KAAK,SAAS,MAAM,8BAA8B,MAC9B,cAAc;;EAE7C;AAEA,EAAAwE,SAAQ,UAAU,eAAe,SAAS,YAAY,IAAI,QAAQ,UAAU;AAC1E,QAAI,OAAO,OAAO,UAAU;AAC1B,UAAI,CAAC;AACH,eAAO,KAAK,SAAS,MAAM,6CAA6C;AAC1E,UAAI,CAAC,OAAO,eAAe,EAAE;AAC3B,eAAO,KAAK,SAAS,MAAM,+BAA+B;AAC5D,WAAK,OAAO,EAAE,EAAE,MAAM,SAAS;AAC/B,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ;AAC7B,WAAG,CAAC,KAAK;eACF,MAAM,QAAQ,EAAE,GAAG;AAC5B,WAAK,GAAG,MAAK;AACb,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ;AAC7B,WAAG,CAAC,KAAK;;AAGb,QAAI,CAAC,MAAM,QAAQ,EAAE,GAAG;AACtB,aAAO,KAAK,SAAS,MAAM,oDACU,KAAK,UAAU,EAAE,CAAC;;AAGzD,QAAI,CAAC,UAAU;AACb,UAAI,GAAG,CAAC,KAAK;AACX,eAAO,KAAK,SAAS,MAAM,6BAA6B;AAC1D,SAAG,OAAO,GAAG,GAAG,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC;;AAIpC,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,UAAI,QAAQ,GAAG,CAAC;AAChB,WAAK,QAAQ,SAAS,KAAM,UAAU;AACpC;;AAGJ,UAAM,QAAQxE,QAAO,MAAM,IAAI;AAC/B,QAAI,SAAS,MAAM,SAAS;AAC5B,aAAS,IAAI,GAAG,SAAS,GAAG,KAAK,GAAG,KAAK;AACvC,UAAI,QAAQ,GAAG,CAAC;AAChB,YAAM,QAAQ,IAAI,QAAQ;AAC1B,cAAQ,UAAU,KAAK;AACrB,cAAM,QAAQ,IAAI,MAAQ,QAAQ;;AAGtC,WAAO,KAAK,qBAAqB,KAAK;EACxC;AAEA,WAAS,IAAI,KAAK;AAChB,QAAI,MAAM;AACR,aAAO,MAAM;;AAEb,aAAO;;AAGX,EAAAwE,SAAQ,UAAU,cAAc,SAAS,WAAW,MAAM,KAAK;AAC7D,QAAI;AACJ,UAAM,OAAO,IAAI,KAAK,IAAI;AAE1B,QAAI,QAAQ,WAAW;AACrB,YAAM;QACJ,IAAI,KAAK,eAAc,CAAE;QACzB,IAAI,KAAK,YAAW,IAAK,CAAC;QAC1B,IAAI,KAAK,WAAU,CAAE;QACrB,IAAI,KAAK,YAAW,CAAE;QACtB,IAAI,KAAK,cAAa,CAAE;QACxB,IAAI,KAAK,cAAa,CAAE;QACxB;MACN,EAAM,KAAK,EAAE;IACb,WAAa,QAAQ,WAAW;AAC5B,YAAM;QACJ,IAAI,KAAK,eAAc,IAAK,GAAG;QAC/B,IAAI,KAAK,YAAW,IAAK,CAAC;QAC1B,IAAI,KAAK,WAAU,CAAE;QACrB,IAAI,KAAK,YAAW,CAAE;QACtB,IAAI,KAAK,cAAa,CAAE;QACxB,IAAI,KAAK,cAAa,CAAE;QACxB;MACN,EAAM,KAAK,EAAE;IACb,OAAS;AACL,WAAK,SAAS,MAAM,cAAc,MAAM,4BAA4B;;AAGtE,WAAO,KAAK,WAAW,KAAK,QAAQ;EACtC;AAEA,EAAAA,SAAQ,UAAU,cAAc,SAAS,aAAa;AACpD,WAAO,KAAK,qBAAqB,EAAE;EACrC;AAEA,EAAAA,SAAQ,UAAU,aAAa,SAASG,WAAU,KAAK,QAAQ;AAC7D,QAAI,OAAO,QAAQ,UAAU;AAC3B,UAAI,CAAC;AACH,eAAO,KAAK,SAAS,MAAM,6CAA6C;AAC1E,UAAI,CAAC,OAAO,eAAe,GAAG,GAAG;AAC/B,eAAO,KAAK,SAAS,MAAM,iCACA,KAAK,UAAU,GAAG,CAAC;;AAEhD,YAAM,OAAO,GAAG;;AAGlB,QAAI,OAAO,QAAQ,YAAY,CAAC3E,QAAO,SAAS,GAAG,GAAG;AACpD,UAAI;AACJ,UAAI,IAAI,UAAU;AAChB,cAAM,YAAY,IAAI,UAAS;AAC/B,YAAI,QAAQ,KAAK,KAAK,YAAY,CAAC,IAAI;AAEvC,YAAK,YAAY,MAAO,KAAO,IAAI,SAAQ,IAAK,MAAM,IAAI,UAAS,GAAK;AACtE,mBAAS;;AAGX,mBAAW,IAAI,OAAO,KAAK,EAAE,QAAO;MAC1C,OAAU;AACJ,mBAAW,IAAI,QAAO;AAEtB,YAAI,SAAS,CAAC,IAAI,KAAM;AACtB,mBAAS,QAAQ,CAAC;;;AAGtB,YAAMA,QAAO,KAAK,QAAQ;;AAG5B,QAAIA,QAAO,SAAS,GAAG,GAAG;AACxB,UAAI4E,QAAO,IAAI;AACf,UAAI,IAAI,WAAW;AACjB,QAAAA;AAEF,YAAMC,OAAM7E,QAAO,MAAM4E,KAAI;AAC7B,UAAI,KAAKC,IAAG;AACZ,UAAI,IAAI,WAAW;AACjB,QAAAA,KAAI,CAAC,IAAI;AACX,aAAO,KAAK,qBAAqBA,IAAG;;AAGtC,QAAI,MAAM;AACR,aAAO,KAAK,WAAW,IAAIR,QAAO,GAAG,CAAC;AAExC,QAAI,MAAM;AACR,aAAO,KAAK,qBAAqB,GAAG;AAEtC,QAAI,MAAM;AACR,aAAO,KAAK,qBAAqB,CAAC,GAAG,GAAG,CAAC;AAE3C,QAAI,OAAO;AACX,aAAS,IAAI,KAAK,KAAK,KAAO,MAAM;AAClC;AAEF,UAAM,MAAM,IAAI,MAAM,IAAI;AAC1B,aAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,UAAI,CAAC,IAAI,MAAM;AACf,cAAQ;;AAEV,QAAG,IAAI,CAAC,IAAI,KAAM;AAChB,UAAI,QAAQ,CAAC;;AAGf,WAAO,KAAK,qBAAqBrE,QAAO,KAAK,GAAG,CAAC;EACnD;AAEA,EAAAwE,SAAQ,UAAU,cAAc,SAAS,WAAW,OAAO;AACzD,WAAO,KAAK,qBAAqB,QAAQ,MAAO,CAAC;EACnD;AAEA,EAAAA,SAAQ,UAAU,OAAO,SAASM,KAAI,QAAQ1E,MAAK;AACjD,QAAI,OAAO,WAAW;AACpB,eAAS,OAAOA,IAAG;AACrB,WAAO,OAAO,YAAY,KAAK,EAAE;EACnC;AAEA,EAAAoE,SAAQ,UAAU,eAAe,SAAS,YAAY,YAAYlB,WAAU,QAAQ;AAClF,UAAME,SAAQ,KAAK;AACnB,QAAI;AACJ,QAAIA,OAAM,SAAS,MAAM;AACvB,aAAO;AAET,UAAM,OAAO,WAAW,KAAI;AAC5B,QAAIA,OAAM,kBAAkB;AAC1B,MAAAA,OAAM,gBAAgB,KAAK,aAAaA,OAAM,SAAS,GAAGF,WAAU,MAAM,EAAE,KAAI;AAElF,QAAI,KAAK,WAAWE,OAAM,cAAc;AACtC,aAAO;AAET,SAAK,IAAE,GAAG,IAAI,KAAK,QAAQ;AACzB,UAAI,KAAK,CAAC,MAAMA,OAAM,cAAc,CAAC;AACnC,eAAO;AAEX,WAAO;EACT;AAIA,WAAS,UAAU,KAAK,WAAW,KAAKF,WAAU;AAChD,QAAI;AAEJ,QAAI,QAAQ;AACV,YAAM;aACC,QAAQ;AACf,YAAM;AAER,QAAIgB,KAAI,UAAU,eAAe,GAAG;AAClC,YAAMA,KAAI,UAAU,GAAG;aAChB,OAAO,QAAQ,aAAa,MAAM,OAAO;AAChD,YAAM;;AAEN,aAAOhB,UAAS,MAAM,kBAAkB,GAAG;AAE7C,QAAI,OAAO;AACT,aAAOA,UAAS,MAAM,sCAAsC;AAE9D,QAAI,CAAC;AACH,aAAO;AAET,WAAQgB,KAAI,eAAe,OAAO,WAAW,KAAK;AAElD,WAAO;EACT;;;;;;;;ACrTA,QAAMzC,YAAWhC;AAEjB,QAAM,aAAaE,aAAA;AAEnB,WAAS,WAAW,QAAQ;AAC1B,eAAW,KAAK,MAAM,MAAM;AAC5B,SAAK,MAAM;;AAEb,EAAA8B,UAAS,YAAY,UAAU;AACjBkD,UAAG;AAEjB,aAAW,UAAU,SAAS,SAASb,QAAO,MAAM,SAAS;AAC3D,UAAM,MAAM,WAAW,UAAU,OAAO,KAAK,MAAM,IAAI;AAEvD,UAAM,IAAI,IAAI,SAAS,QAAQ;AAC/B,UAAM,MAAM,CAAE,gBAAgB,QAAQ,QAAQ,OAAO;AACrD,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAI,KAAK,EAAE,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7B,QAAI,KAAK,cAAc,QAAQ,QAAQ,OAAO;AAC9C,WAAO,IAAI,KAAK,IAAI;;;;;;;;;ACnBtB,UAAMc,YAAW;AAEjB,IAAAA,UAAS,MAAMnF,aAAA;AACf,IAAAmF,UAAS,MAAMjF,aAAgB;;;;;ACH/B,IAAM8B,aAAWhC;AAEjB,IAAM,SAASE;AACf,IAAM,gBAAgB2D,SAA0B;AAChD,IAAM,OAAOU;AAGb,IAAME,QAAMC;AAEZ,SAASU,aAAW,QAAQ;AAC1B,OAAK,MAAM;AACX,OAAK,OAAO,OAAO;AACnB,OAAK,SAAS;AAGd,OAAK,OAAO,IAAI,QAAO;AACvB,OAAK,KAAK,MAAM,OAAO,IAAI;AAC7B;IACAR,UAAiBQ;AAEjBA,aAAW,UAAU,SAAS,SAASC,QAAO,MAAM,SAAS;AAC3D,MAAI,CAAC,cAAc,gBAAgB,IAAI,GAAG;AACxC,WAAO,IAAI,cAAc,MAAM,OAAO;EAC1C;AAEE,SAAO,KAAK,KAAK,QAAQ,MAAM,OAAO;AACxC;AAIA,SAAS,QAAQ,QAAQ;AACvB,OAAK,KAAK,MAAM,OAAO,MAAM;AAC/B;AACArD,WAAS,SAAS,IAAI;AAEtB,QAAQ,UAAU,WAAW,SAAS,QAAQnC,SAAQ,KAAKyF,MAAK;AAC9D,MAAIzF,QAAO,QAAO;AAChB,WAAO;AAET,QAAM8D,SAAQ9D,QAAO,KAAI;AACzB,QAAM,aAAa,aAAaA,SAAQ,0BAA0B,MAAM,GAAG;AAC3E,MAAIA,QAAO,QAAQ,UAAU;AAC3B,WAAO;AAET,EAAAA,QAAO,QAAQ8D,MAAK;AAEpB,SAAO,WAAW,QAAQ,OAAO,WAAW,WAAW,OACpD,WAAW,SAAS,SAAU,OAAO2B;AAC1C;AAEA,QAAQ,UAAU,aAAa,SAAS,UAAUzF,SAAQ,KAAKyF,MAAK;AAClE,QAAM,aAAa;IAAazF;IAC9B,8BAA8B,MAAM;EAAG;AACzC,MAAIA,QAAO,QAAQ,UAAU;AAC3B,WAAO;AAET,MAAI,MAAM;IAAaA;IACrB,WAAW;IACX,8BAA8B,MAAM;EAAG;AAGzC,MAAIA,QAAO,QAAQ,GAAG;AACpB,WAAO;AAET,MAAI,CAACyF,QACD,WAAW,QAAQ,OACnB,WAAW,WAAW,OACtB,WAAW,SAAS,SAAS,KAAK;AACpC,WAAOzF,QAAO,MAAM,2BAA2B,MAAM,GAAG;EAC5D;AAEE,MAAI,WAAW,aAAa,QAAQ;AAClC,WAAOA,QAAO,KAAK,KAAK,+BAA+B,MAAM,GAAG;AAGlE,QAAM8D,SAAQ9D,QAAO,KAAI;AACzB,QAAM,MAAM,KAAK;IACfA;IACA,6CAA6C,KAAK,MAAM;EAAG;AAC7D,MAAIA,QAAO,QAAQ,GAAG;AACpB,WAAO;AAET,QAAMA,QAAO,SAAS8D,OAAM;AAC5B,EAAA9D,QAAO,QAAQ8D,MAAK;AACpB,SAAO9D,QAAO,KAAK,KAAK,+BAA+B,MAAM,GAAG;AAClE;AAEA,QAAQ,UAAU,gBAAgB,SAAS,aAAaA,SAAQ,MAAM;AACpE,aAAS;AACP,UAAM,MAAM,aAAaA,SAAQ,IAAI;AACrC,QAAIA,QAAO,QAAQ,GAAG;AACpB,aAAO;AACT,UAAM,MAAM,aAAaA,SAAQ,IAAI,WAAW,IAAI;AACpD,QAAIA,QAAO,QAAQ,GAAG;AACpB,aAAO;AAET,QAAI;AACJ,QAAI,IAAI,aAAa,QAAQ;AAC3B,YAAMA,QAAO,KAAK,GAAG;;AAErB,YAAM,KAAK,cAAcA,SAAQ,IAAI;AAGvC,QAAIA,QAAO,QAAQ,GAAG;AACpB,aAAO;AAET,QAAI,IAAI,WAAW;AACjB;EACN;AACA;AAEA,QAAQ,UAAU,cAAc,SAAS,WAAWA,SAAQ,KAAK,SAC/D,SAAS;AACT,QAAM,SAAS,CAAA;AACf,SAAO,CAACA,QAAO,QAAO,GAAI;AACxB,UAAM,cAAc,KAAK,SAASA,SAAQ,KAAK;AAC/C,QAAIA,QAAO,QAAQ,WAAW;AAC5B,aAAO;AAET,UAAM,MAAM,QAAQ,OAAOA,SAAQ,OAAO,OAAO;AACjD,QAAIA,QAAO,QAAQ,GAAG,KAAK;AACzB;AACF,WAAO,KAAK,GAAG;EACnB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,aAAa,SAAS,UAAUA,SAAQ,KAAK;AAC7D,MAAI,QAAQ,UAAU;AACpB,UAAM,SAASA,QAAO,UAAS;AAC/B,QAAIA,QAAO,QAAQ,MAAM;AACvB,aAAO;AACT,WAAO,EAAE,QAAgB,MAAMA,QAAO,IAAG,EAAE;EAC/C,WAAa,QAAQ,UAAU;AAC3B,UAAM0F,OAAM1F,QAAO,IAAG;AACtB,QAAI0F,KAAI,SAAS,MAAM;AACrB,aAAO1F,QAAO,MAAM,iDAAiD;AAEvE,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI0F,KAAI,SAAS,GAAG,KAAK;AACvC,aAAO,OAAO,aAAaA,KAAI,aAAa,IAAI,CAAC,CAAC;IACxD;AACI,WAAO;EACX,WAAa,QAAQ,UAAU;AAC3B,UAAM,SAAS1F,QAAO,IAAG,EAAG,SAAS,OAAO;AAC5C,QAAI,CAAC,KAAK,UAAU,MAAM,GAAG;AAC3B,aAAOA,QAAO,MAAM,wDAC+B;IACzD;AACI,WAAO;EACX,WAAa,QAAQ,UAAU;AAC3B,WAAOA,QAAO,IAAG;EACrB,WAAa,QAAQ,WAAW;AAC5B,WAAOA,QAAO,IAAG;EACrB,WAAa,QAAQ,YAAY;AAC7B,UAAM,WAAWA,QAAO,IAAG,EAAG,SAAS,OAAO;AAC9C,QAAI,CAAC,KAAK,YAAY,QAAQ,GAAG;AAC/B,aAAOA,QAAO,MAAM,0DACiC;IAC3D;AACI,WAAO;EACX,WAAa,OAAO,KAAK,GAAG,GAAG;AAC3B,WAAOA,QAAO,IAAG,EAAG,SAAQ;EAChC,OAAS;AACL,WAAOA,QAAO,MAAM,8BAA8B,MAAM,cAAc;EAC1E;AACA;AAEA,QAAQ,UAAU,eAAe,SAAS,YAAYA,SAAQ,QAAQ,UAAU;AAC9E,MAAI;AACJ,QAAM,cAAc,CAAA;AACpB,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,SAAO,CAACA,QAAO,QAAO,GAAI;AACxB,eAAWA,QAAO,UAAS;AAC3B,cAAU;AACV,aAAS,WAAW;AACpB,SAAK,WAAW,SAAU,GAAG;AAC3B,kBAAY,KAAK,KAAK;AACtB,cAAQ;IACd;EACA;AACE,MAAI,WAAW;AACb,gBAAY,KAAK,KAAK;AAExB,QAAM,QAAS,YAAY,CAAC,IAAI,KAAM;AACtC,QAAM,SAAS,YAAY,CAAC,IAAI;AAEhC,MAAI;AACF,aAAS;;AAET,aAAS,CAAC,OAAO,MAAM,EAAE,OAAO,YAAY,MAAM,CAAC,CAAC;AAEtD,MAAI,QAAQ;AACV,QAAI,MAAM,OAAO,OAAO,KAAK,GAAG,CAAC;AACjC,QAAI,QAAQ;AACV,YAAM,OAAO,OAAO,KAAK,GAAG,CAAC;AAC/B,QAAI,QAAQ;AACV,eAAS;EACf;AAEE,SAAO;AACT;AAEA,QAAQ,UAAU,cAAc,SAAS,WAAWA,SAAQ,KAAK;AAC/D,QAAM,MAAMA,QAAO,IAAG,EAAG,SAAQ;AAEjC,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAIsB;AACJ,MAAI;AACJ,MAAI,QAAQ,WAAW;AACrB,WAAO,IAAI,MAAM,GAAG,CAAC,IAAI;AACzB,UAAM,IAAI,MAAM,GAAG,CAAC,IAAI;AACxB,UAAM,IAAI,MAAM,GAAG,CAAC,IAAI;AACxB,WAAO,IAAI,MAAM,GAAG,EAAE,IAAI;AAC1B,IAAAA,OAAM,IAAI,MAAM,IAAI,EAAE,IAAI;AAC1B,UAAM,IAAI,MAAM,IAAI,EAAE,IAAI;EAC9B,WAAa,QAAQ,WAAW;AAC5B,WAAO,IAAI,MAAM,GAAG,CAAC,IAAI;AACzB,UAAM,IAAI,MAAM,GAAG,CAAC,IAAI;AACxB,UAAM,IAAI,MAAM,GAAG,CAAC,IAAI;AACxB,WAAO,IAAI,MAAM,GAAG,CAAC,IAAI;AACzB,IAAAA,OAAM,IAAI,MAAM,GAAG,EAAE,IAAI;AACzB,UAAM,IAAI,MAAM,IAAI,EAAE,IAAI;AAC1B,QAAI,OAAO;AACT,aAAO,MAAO;;AAEd,aAAO,OAAO;EACpB,OAAS;AACL,WAAOtB,QAAO,MAAM,cAAc,MAAM,4BAA4B;EACxE;AAEE,SAAO,KAAK,IAAI,MAAM,MAAM,GAAG,KAAK,MAAMsB,MAAK,KAAK,CAAC;AACvD;AAEA,QAAQ,UAAU,cAAc,SAAS,aAAa;AACpD,SAAO;AACT;AAEA,QAAQ,UAAU,cAAc,SAAS,WAAWtB,SAAQ;AAC1D,QAAM,MAAMA,QAAO,UAAS;AAC5B,MAAIA,QAAO,QAAQ,GAAG;AACpB,WAAO;;AAEP,WAAO,QAAQ;AACnB;AAEA,QAAQ,UAAU,aAAa,SAAS,UAAUA,SAAQ,QAAQ;AAEhE,QAAM0F,OAAM1F,QAAO,IAAG;AACtB,MAAI,MAAM,IAAI,OAAO0F,IAAG;AAExB,OAAKA,KAAI,CAAC,IAAI,OAAQ,GAAG;AACvB,UAAM,IAAI,SAASA,KAAI,SAAS,CAAC;EACrC;AAEE,MAAI;AACF,UAAM,OAAO,IAAI,SAAS,EAAE,CAAC,KAAK;AAEpC,SAAO;AACT;AAEA,QAAQ,UAAU,OAAO,SAASN,KAAI,QAAQ1E,MAAK;AACjD,MAAI,OAAO,WAAW;AACpB,aAAS,OAAOA,IAAG;AACrB,SAAO,OAAO,YAAY,KAAK,EAAE;AACnC;AAIA,SAAS,aAAa,KAAK,MAAM;AAC/B,MAAI,MAAM,IAAI,UAAU,IAAI;AAC5B,MAAI,IAAI,QAAQ,GAAG;AACjB,WAAO;AAET,QAAM,MAAMkE,MAAI,SAAS,OAAO,CAAC;AACjC,QAAM,aAAa,MAAM,QAAU;AAGnC,OAAK,MAAM,QAAU,IAAM;AACzB,QAAI,MAAM;AACV,UAAM;AACN,YAAQ,MAAM,SAAU,KAAM;AAC5B,YAAM,IAAI,UAAU,IAAI;AACxB,UAAI,IAAI,QAAQ,GAAG;AACjB,eAAO;AAET,cAAQ;AACR,aAAO,MAAM;IACnB;EACA,OAAS;AACL,WAAO;EACX;AACE,QAAM,SAASA,MAAI,IAAI,GAAG;AAE1B,SAAO;IACL;IACA;IACA;IACA;EACJ;AACA;AAEA,SAAS,aAAa,KAAK,WAAW,MAAM;AAC1C,MAAI,MAAM,IAAI,UAAU,IAAI;AAC5B,MAAI,IAAI,QAAQ,GAAG;AACjB,WAAO;AAGT,MAAI,CAAC,aAAa,QAAQ;AACxB,WAAO;AAGT,OAAK,MAAM,SAAU,GAAG;AAEtB,WAAO;EACX;AAGE,QAAM,MAAM,MAAM;AAClB,MAAI,MAAM;AACR,WAAO,IAAI,MAAM,2BAA2B;AAE9C,QAAM;AACN,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,YAAQ;AACR,UAAM,IAAI,IAAI,UAAU,IAAI;AAC5B,QAAI,IAAI,QAAQ,CAAC;AACf,aAAO;AACT,WAAO;EACX;AAEE,SAAO;AACT;AChVA,IAAMzC,aAAWhC;AACjB,IAAMG,WAASD,QAAwB;AAEvC,IAAM,aAAa2D;AAEnB,SAAS,WAAW,QAAQ;AAC1B,aAAW,KAAK,MAAM,MAAM;AAC5B,OAAK,MAAM;AACb;AACA7B,WAAS,YAAY,UAAU;IAC/BkD,QAAiB;AAEjB,WAAW,UAAU,SAAS,SAASG,QAAO,MAAM,SAAS;AAC3D,QAAM,QAAQ,KAAK,SAAQ,EAAG,MAAM,UAAU;AAE9C,QAAM,QAAQ,QAAQ,MAAM,YAAW;AAEvC,QAAM,KAAK;AACX,MAAI,QAAQ;AACZ,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,QAAQ,MAAM,CAAC,EAAE,MAAM,EAAE;AAC/B,QAAI,UAAU;AACZ;AAEF,QAAI,MAAM,CAAC,MAAM;AACf;AAEF,QAAI,UAAU,IAAI;AAChB,UAAI,MAAM,CAAC,MAAM;AACf;AACF,cAAQ;IACd,OAAW;AACL,UAAI,MAAM,CAAC,MAAM;AACf;AACF,YAAM;AACN;IACN;EACA;AACE,MAAI,UAAU,MAAM,QAAQ;AAC1B,UAAM,IAAI,MAAM,gCAAgC,KAAK;AAEvD,QAAM,SAAS,MAAM,MAAM,QAAQ,GAAG,GAAG,EAAE,KAAK,EAAE;AAElD,SAAO,QAAQ,mBAAmB,EAAE;AAEpC,QAAM,QAAQlF,SAAO,KAAK,QAAQ,QAAQ;AAC1C,SAAO,WAAW,UAAU,OAAO,KAAK,MAAM,OAAO,OAAO;AAC9D;;AChDA,QAAMqF,YAAW;AAEjB,EAAAA,UAAS,MAAMxF;AACf,EAAAwF,UAAS,MAAMtF;;;;;;;ACHf,UAAMiF,YAAWnF,kBAAA;AACjB,UAAMwF,YAAWtF;AACjB,UAAM8B,YAAW6B;AAEjB,UAAM4B,OAAM;AAEZ,IAAAA,KAAI,SAAS,SAAS,OAAOjE,OAAM,MAAM;AACvC,aAAO,IAAI,OAAOA,OAAM,IAAI;IAC9B;AAEA,aAAS,OAAOA,OAAM,MAAM;AAC1B,WAAK,OAAOA;AACZ,WAAK,OAAO;AAEZ,WAAK,WAAW,CAAA;AAChB,WAAK,WAAW,CAAA;;AAGlB,WAAO,UAAU,eAAe,SAAS,YAAYD,OAAM;AACzD,YAAMC,QAAO,KAAK;AAElB,eAAS,UAAU,QAAQ;AACzB,aAAK,WAAW,QAAQA,KAAI;;AAE9B,MAAAQ,UAAS,WAAWT,KAAI;AACxB,gBAAU,UAAU,aAAa,SAAS,WAAW,QAAQC,OAAM;AACjE,QAAAD,MAAK,KAAK,MAAM,QAAQC,KAAI;MAChC;AAEE,aAAO,IAAI,UAAU,IAAI;IAC3B;AAEA,WAAO,UAAU,cAAc,SAAS,YAAY,KAAK;AACvD,YAAM,OAAO;AAEb,UAAI,CAAC,KAAK,SAAS,eAAe,GAAG;AACnC,aAAK,SAAS,GAAG,IAAI,KAAK,aAAagE,UAAS,GAAG,CAAC;AACtD,aAAO,KAAK,SAAS,GAAG;IAC1B;AAEA,WAAO,UAAU,SAAS,SAASH,QAAO,MAAM,KAAK,SAAS;AAC5D,aAAO,KAAK,YAAY,GAAG,EAAE,OAAO,MAAM,OAAO;IACnD;AAEA,WAAO,UAAU,cAAc,SAAS,YAAY,KAAK;AACvD,YAAM,OAAO;AAEb,UAAI,CAAC,KAAK,SAAS,eAAe,GAAG;AACnC,aAAK,SAAS,GAAG,IAAI,KAAK,aAAaF,UAAS,GAAG,CAAC;AACtD,aAAO,KAAK,SAAS,GAAG;IAC1B;AAEA,WAAO,UAAU,SAAS,SAASd,QAAO,MAAM,KAAoBZ,WAAU;AAC5E,aAAO,KAAK,YAAY,GAAG,EAAE,OAAO,MAAMA,SAAQ;;;;;;;ACrDpD,QAAMvB,QAAO;AAEb,EAAAA,MAAK,WAAWlC,WAAsB;AACtC,EAAAkC,MAAK,gBAAgBhC,SAAoB;AACzC,EAAAgC,MAAK,gBAAgBhC,SAAoB;AACzC,EAAAgC,MAAK,OAAO2B;;;;ACLZ,QAAM6B,aAAY;AAGlB,EAAAA,WAAU,WAAW,SAAS,QAAQ,KAAK;AACzC,UAAM,MAAM,CAAA;AAEZ,WAAO,KAAK,GAAG,EAAE,QAAQ,SAAS7D,MAAK;AAErC,WAAKA,OAAM,MAAMA;AACf,QAAAA,OAAMA,OAAM;AAEd,YAAM,QAAQ,IAAIA,IAAG;AACrB,UAAI,KAAK,IAAIA;IACjB,CAAG;AAED,WAAO;EACT;AAEA,EAAA6D,WAAU,MAAM1F;;;;;;;AClBhB,UAAMsE,QAAO;AAEb,IAAAA,MAAK,SAAStE;AAEd,IAAAsE,MAAK,SAASpE,aAAqB,EAAC;AACpC,IAAAoE,MAAK,OAAOT;AACZ,IAAAS,MAAK,YAAYC;AACjB,IAAAD,MAAK,WAAWI;AAChB,IAAAJ,MAAK,WAAWqB,kBAA0B;;;;ACT1C,IAAIC,oBAAmBtC,kBAAQA,eAAK,mBAAoB,SAAUhB,MAAK;AACnE,SAAQA,QAAOA,KAAI,aAAcA,OAAM,EAAE,WAAWA,KAAG;AAC3D;AACA,OAAO,eAAeuD,SAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACxCA,QAAA,eAAG;AACvB,IAAMC,aAAW9F;AACjB,IAAM,SAAS4F,kBAAgB1F,cAAA,CAAwB;AACvD,IAAM6F,YAAUH,kBAAgB/B,WAAgB;AAChD,IAAM,cAAc,OAAO,QAAQ,OAAO,YAAY,WAAY;AAC9D,OAAK,IAAG,EAAG,IAAI,KAAK,IAAI,MAAM,EAAE,QAAO,GAAI,KAAK,IAAI,OAAO,EAAE,IAAI,OAAO,CAAC;AAC7E,CAAC;AACD,IAAM,UAAU,OAAO,QAAQ,OAAO,OAAO,WAAY;AACrD,OAAK,OAAO;IACR,MAAM,KAAK,SAAS,CAAC,EAAE,MAAK;IAC5B,WAAW,KAAK,SAAS,CAAC,EAAE,OAAM;IAClC,QAAQ,KAAK,SAAS,CAAC,EAAE,QAAO;IAChC,SAAS,KAAK,SAAS,CAAC,EAAE,IAAG;IAC7B,MAAM,KAAK,SAAS,CAAC,EAAE,MAAM,WAAW;IACxC,OAAO,KAAK,SAAS,CAAC,EAAE,MAAM,OAAO;IACrC,YAAY,KAAK,SAAS,CAAC,EAAE,IAAG;EACxC,CAAK;AACL,CAAC;AACD,SAAS,aAAa,OAAO;AACzB,QAAMmC,OAAM,cAAc,KAAK;AAC/B,SAAO,QAAQ,OAAOA,MAAK,KAAK;AACpC;AACA,SAAS,cAAc,OAAO;AAC1B,MAAI;AACA,QAAI,SAAS,MAAM;AACf,aAAO,EAAE,MAAM,QAAQ,OAAO,KAAI;IAC9C;AACQ,QAAIF,WAAS,OAAO,SAAS,KAAK,GAAG;AACjC,aAAO,EAAE,MAAM,aAAa,MAAY;IACpD;AACQ,QAAI,OAAO,UAAU,WAAW;AAC5B,aAAO,EAAE,MAAM,WAAW,OAAO,QAAQ,IAAI,EAAC;IAC1D;AACQ,QAAI,OAAO,UAAU,UAAU;AAC3B,aAAO,EAAE,MAAM,UAAU,MAAY;IACjD;AACQ,QAAI,OAAO,UAAU,UAAU;AAC3B,UAAI,CAAC,OAAO,UAAU,KAAK,GAAG;AAC1B,cAAM,MAAM,yCAAyC;MACrE;AACY,aAAO,EAAE,MAAM,WAAW,OAAO,IAAIC,UAAQ,QAAQ,KAAK,EAAC;IACvE;AACQ,QAAI,OAAO,UAAU,UAAU;AAC3B,YAAM,MAAM,IAAIA,UAAQ,QAAQ,MAAM,SAAQ,CAAE;AAChD,aAAO,EAAE,MAAM,cAAc,OAAO,IAAG;IACnD;AACQ,QAAI,MAAM,gBAAgB,OAAO;AAC7B,aAAO;QACH,MAAM;QACN,OAAO,MAAM,IAAI,UAAQ,cAAc,IAAI,CAAC;MAC5D;IACA;AACQ,QAAI,OAAO,UAAU,UAAU;AAC3B,UAAI,kBAAkB;AACtB,wBAAkBE,oBAAkB,eAAe;AACnD,aAAO;QACH,MAAM;QACN,OAAO,OAAO,KAAK,eAAe,EAAE,IAAI,SAAUpE,MAAK;AACnD,iBAAO,EAAE,MAAMA,MAAK,OAAO,cAAc,gBAAgBA,IAAG,CAAC,EAAC;QAClF,CAAiB;MACjB;IACA;EACA,SACWqE,QAAO;AACV,UAAM,UAAU,QAAQ,MAAM,SAAQ,IAAK;AAC3C,UAAM,IAAI,MAAM,oBAAoB,OAAO,KAAKA,MAAK,EAAE;EAC/D;AACI,QAAM,IAAI,MAAM,SAAS,KAAK,2BAA2B,OAAO,KAAK,EAAE;AAC3E;AACA,SAASD,oBAAkB,MAAM;AAC7B,QAAM,cAAc,OAAO,QAAQ,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,MAAM;AAC9D,QAAI,OAAO,MAAM;AACb,aAAO;IACnB;AACQ,QAAI,OAAO,MAAM;AACb,aAAO;IACnB;AACQ,WAAO;EACf,CAAK;AACD,QAAM,aAAa,CAAA;AACnB,aAAW,CAACpE,MAAK,KAAK,KAAK,aAAa;AACpC,eAAWA,IAAG,IAAI;EAC1B;AACI,SAAO;AACX;;;;;;ACvFA,MAAIhC,UAASG;AACb,MAAIG,UAASN,QAAO;AAGpB,WAAS,UAAW,KAAK,KAAK;AAC5B,aAASgC,QAAO,KAAK;AACnB,UAAIA,IAAG,IAAI,IAAIA,IAAG;;;AAGtB,MAAI1B,QAAO,QAAQA,QAAO,SAASA,QAAO,eAAeA,QAAO,iBAAiB;AAC/E,WAAA,UAAiBN;EACnB,OAAO;AAEL,cAAUA,SAAQ,OAAO;AACzB,YAAA,SAAiB;;AAGnB,WAAS,WAAY,KAAK,kBAAkB,QAAQ;AAClD,WAAOM,QAAO,KAAK,kBAAkB,MAAM;;AAG7C,aAAW,YAAY,OAAO,OAAOA,QAAO,SAAS;AAGrD,YAAUA,SAAQ,UAAU;AAE5B,aAAW,OAAO,SAAU,KAAK,kBAAkB,QAAQ;AACzD,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,IAAI,UAAU,+BAA+B;;AAErD,WAAOA,QAAO,KAAK,kBAAkB,MAAM;;AAG7C,aAAW,QAAQ,SAAU,MAAM,MAAM,UAAU;AACjD,QAAI,OAAO,SAAS,UAAU;AAC5B,YAAM,IAAI,UAAU,2BAA2B;;AAEjD,QAAI,MAAMA,QAAO,IAAI;AACrB,QAAI,SAAS,QAAW;AACtB,UAAI,OAAO,aAAa,UAAU;AAChC,YAAI,KAAK,MAAM,QAAQ;MAC7B,OAAW;AACL,YAAI,KAAK,IAAI;;IAEnB,OAAS;AACL,UAAI,KAAK,CAAC;;AAEZ,WAAO;;AAGT,aAAW,cAAc,SAAU,MAAM;AACvC,QAAI,OAAO,SAAS,UAAU;AAC5B,YAAM,IAAI,UAAU,2BAA2B;;AAEjD,WAAOA,QAAO,IAAI;;AAGpB,aAAW,kBAAkB,SAAU,MAAM;AAC3C,QAAI,OAAO,SAAS,UAAU;AAC5B,YAAM,IAAI,UAAU,2BAA2B;;AAEjD,WAAON,QAAO,WAAW,IAAI;EAC/B;;;AC5DA,IAAI,YAAY;AAIhB,IAAI,aAAa;AAEjB,SAASsG,eAAc;AACrB,QAAM,IAAI,MAAM,gHAAgH;AAClI;AAEA,IAAIhG,WAASH,oBAAuB;AACpC,IAAIoG,WAASC,eAAO,UAAUA,eAAO;AAErC,IAAID,YAAUA,SAAO,iBAAiB;AACpCE,YAAA,UAAiBC;AACnB,OAAO;AACLD,YAAA,UAAiBH;AACnB;AAEA,SAASI,cAAa,MAAM,IAAI;AAE9B,MAAI,OAAO,WAAY,OAAM,IAAI,WAAW,iCAAiC;AAE7E,MAAI,QAAQpG,SAAO,YAAY,IAAI;AAEnC,MAAI,OAAO,GAAG;AACZ,QAAI,OAAO,WAAW;AAEpB,eAAS,YAAY,GAAG,YAAY,MAAM,aAAa,WAAW;AAGhEiG,iBAAO,gBAAgB,MAAM,MAAM,WAAW,YAAY,SAAS,CAAC;MAC5E;IACA,OAAW;AACLA,eAAO,gBAAgB,KAAK;IAClC;EACA;AAEE,MAAI,OAAO,OAAO,YAAY;AAC5B,WAAO,QAAQ,SAAS,WAAY;AAClC,SAAG,MAAM,KAAK;IACpB,CAAK;EACL;AAEE,SAAO;AACT;;;AC1BA,IAAI,IAAI,OAAO,YAAY,WAAW,UAAU;AAChD,IAAI,eAAe,KAAK,OAAO,EAAE,UAAU,aACvC,EAAE,QACF,SAASI,cAAa,QAAQ,UAAU,MAAM;AAC9C,SAAO,SAAS,UAAU,MAAM,KAAK,QAAQ,UAAU,IAAI;AAC/D;AAEA,IAAI;AACJ,IAAI,KAAK,OAAO,EAAE,YAAY,YAAY;AACxC,mBAAiB,EAAE;AACrB,WAAW,OAAO,uBAAuB;AACvC,mBAAiB,SAASC,gBAAe,QAAQ;AAC/C,WAAO,OAAO,oBAAoB,MAAM,EACrC,OAAO,OAAO,sBAAsB,MAAM,CAAC;EAClD;AACA,OAAO;AACL,mBAAiB,SAASA,gBAAe,QAAQ;AAC/C,WAAO,OAAO,oBAAoB,MAAM;EAC5C;AACA;AAEA,SAAS,mBAAmBC,UAAS;AACnC,MAAI,WAAW,QAAQ,KAAM,SAAQ,KAAKA,QAAO;AACnD;AAEA,IAAI,cAAc,OAAO,SAAS,SAASC,aAAY,OAAO;AAC5D,SAAO,UAAU;AACnB;AAEA,SAAS,eAAe;AACtB,eAAa,KAAK,KAAK,IAAI;AAC7B;AACAC,OAAc,UAAG;AACEA,OAAA,QAAA,OAAGC;AAGtB,aAAa,eAAe;AAE5B,aAAa,UAAU,UAAU;AACjC,aAAa,UAAU,eAAe;AACtC,aAAa,UAAU,gBAAgB;AAIvC,IAAI,sBAAsB;AAE1B,SAAS,cAAc,UAAU;AAC/B,MAAI,OAAO,aAAa,YAAY;AAClC,UAAM,IAAI,UAAU,qEAAqE,OAAO,QAAQ;EAC5G;AACA;AAEA,OAAO,eAAe,cAAc,uBAAuB;EACzD,YAAY;EACZ,KAAK,WAAW;AACd,WAAO;EACX;EACE,KAAK,SAAS,KAAK;AACjB,QAAI,OAAO,QAAQ,YAAY,MAAM,KAAK,YAAY,GAAG,GAAG;AAC1D,YAAM,IAAI,WAAW,oGAAoG,MAAM,GAAG;IACxI;AACI,0BAAsB;EAC1B;AACA,CAAC;AAED,aAAa,OAAO,WAAW;AAE7B,MAAI,KAAK,YAAY,UACjB,KAAK,YAAY,OAAO,eAAe,IAAI,EAAE,SAAS;AACxD,SAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,SAAK,eAAe;EACxB;AAEE,OAAK,gBAAgB,KAAK,iBAAiB;AAC7C;AAIA,aAAa,UAAU,kBAAkB,SAAS,gBAAgB,GAAG;AACnE,MAAI,OAAO,MAAM,YAAY,IAAI,KAAK,YAAY,CAAC,GAAG;AACpD,UAAM,IAAI,WAAW,kFAAkF,IAAI,GAAG;EAClH;AACE,OAAK,gBAAgB;AACrB,SAAO;AACT;AAEA,SAAS,iBAAiB,MAAM;AAC9B,MAAI,KAAK,kBAAkB;AACzB,WAAO,aAAa;AACtB,SAAO,KAAK;AACd;AAEA,aAAa,UAAU,kBAAkB,SAAS,kBAAkB;AAClE,SAAO,iBAAiB,IAAI;AAC9B;AAEA,aAAa,UAAU,OAAO,SAAS,KAAKnF,OAAM;AAChD,MAAI,OAAO,CAAA;AACX,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAK,MAAK,KAAK,UAAU,CAAC,CAAC;AACjE,MAAI,UAAWA,UAAS;AAExB,MAAIoF,UAAS,KAAK;AAClB,MAAIA,YAAW;AACb,cAAW,WAAWA,QAAO,UAAU;WAChC,CAAC;AACR,WAAO;AAGT,MAAI,SAAS;AACX,QAAI;AACJ,QAAI,KAAK,SAAS;AAChB,WAAK,KAAK,CAAC;AACb,QAAI,cAAc,OAAO;AAGvB,YAAM;IACZ;AAEI,QAAI,MAAM,IAAI,MAAM,sBAAsB,KAAK,OAAO,GAAG,UAAU,MAAM,GAAG;AAC5E,QAAI,UAAU;AACd,UAAM;EACV;AAEE,MAAI,UAAUA,QAAOpF,KAAI;AAEzB,MAAI,YAAY;AACd,WAAO;AAET,MAAI,OAAO,YAAY,YAAY;AACjC,iBAAa,SAAS,MAAM,IAAI;EACpC,OAAS;AACL,QAAI,MAAM,QAAQ;AAClB,QAAIqF,aAAY,WAAW,SAAS,GAAG;AACvC,aAAS,IAAI,GAAG,IAAI,KAAK,EAAE;AACzB,mBAAaA,WAAU,CAAC,GAAG,MAAM,IAAI;EAC3C;AAEE,SAAO;AACT;AAEA,SAAS,aAAa,QAAQrF,OAAM,UAAU,SAAS;AACrD,MAAI;AACJ,MAAIoF;AACJ,MAAI;AAEJ,gBAAc,QAAQ;AAEtB,EAAAA,UAAS,OAAO;AAChB,MAAIA,YAAW,QAAW;AACxB,IAAAA,UAAS,OAAO,UAAU,uBAAO,OAAO,IAAI;AAC5C,WAAO,eAAe;EAC1B,OAAS;AAGL,QAAIA,QAAO,gBAAgB,QAAW;AACpC,aAAO;QAAK;QAAepF;QACf,SAAS,WAAW,SAAS,WAAW;MAAQ;AAI5D,MAAAoF,UAAS,OAAO;IACtB;AACI,eAAWA,QAAOpF,KAAI;EAC1B;AAEE,MAAI,aAAa,QAAW;AAE1B,eAAWoF,QAAOpF,KAAI,IAAI;AAC1B,MAAE,OAAO;EACb,OAAS;AACL,QAAI,OAAO,aAAa,YAAY;AAElC,iBAAWoF,QAAOpF,KAAI,IACpB,UAAU,CAAC,UAAU,QAAQ,IAAI,CAAC,UAAU,QAAQ;IAE5D,WAAe,SAAS;AAClB,eAAS,QAAQ,QAAQ;IAC/B,OAAW;AACL,eAAS,KAAK,QAAQ;IAC5B;AAGI,QAAI,iBAAiB,MAAM;AAC3B,QAAI,IAAI,KAAK,SAAS,SAAS,KAAK,CAAC,SAAS,QAAQ;AACpD,eAAS,SAAS;AAGlB,UAAI,IAAI,IAAI,MAAM,iDACE,SAAS,SAAS,MAAM,OAAOA,KAAI,IAAI,mEAEvB;AACpC,QAAE,OAAO;AACT,QAAE,UAAU;AACZ,QAAE,OAAOA;AACT,QAAE,QAAQ,SAAS;AACnB,yBAAmB,CAAC;IAC1B;EACA;AAEE,SAAO;AACT;AAEA,aAAa,UAAU,cAAc,SAAS,YAAYA,OAAM,UAAU;AACxE,SAAO,aAAa,MAAMA,OAAM,UAAU,KAAK;AACjD;AAEA,aAAa,UAAU,KAAK,aAAa,UAAU;AAEnD,aAAa,UAAU,kBACnB,SAAS,gBAAgBA,OAAM,UAAU;AACvC,SAAO,aAAa,MAAMA,OAAM,UAAU,IAAI;AACpD;AAEA,SAAS,cAAc;AACrB,MAAI,CAAC,KAAK,OAAO;AACf,SAAK,OAAO,eAAe,KAAK,MAAM,KAAK,MAAM;AACjD,SAAK,QAAQ;AACb,QAAI,UAAU,WAAW;AACvB,aAAO,KAAK,SAAS,KAAK,KAAK,MAAM;AACvC,WAAO,KAAK,SAAS,MAAM,KAAK,QAAQ,SAAS;EACrD;AACA;AAEA,SAAS,UAAU,QAAQA,OAAM,UAAU;AACzC,MAAIiC,SAAQ,EAAE,OAAO,OAAO,QAAQ,QAAW,QAAgB,MAAMjC,OAAM,SAAkB;AAC7F,MAAI,UAAU,YAAY,KAAKiC,MAAK;AACpC,UAAQ,WAAW;AACnB,EAAAA,OAAM,SAAS;AACf,SAAO;AACT;AAEA,aAAa,UAAU,OAAO,SAAS,KAAKjC,OAAM,UAAU;AAC1D,gBAAc,QAAQ;AACtB,OAAK,GAAGA,OAAM,UAAU,MAAMA,OAAM,QAAQ,CAAC;AAC7C,SAAO;AACT;AAEA,aAAa,UAAU,sBACnB,SAAS,oBAAoBA,OAAM,UAAU;AAC3C,gBAAc,QAAQ;AACtB,OAAK,gBAAgBA,OAAM,UAAU,MAAMA,OAAM,QAAQ,CAAC;AAC1D,SAAO;AACb;AAGA,aAAa,UAAU,iBACnB,SAAS,eAAeA,OAAM,UAAU;AACtC,MAAI,MAAMoF,SAAQ,UAAU,GAAG;AAE/B,gBAAc,QAAQ;AAEtB,EAAAA,UAAS,KAAK;AACd,MAAIA,YAAW;AACb,WAAO;AAET,SAAOA,QAAOpF,KAAI;AAClB,MAAI,SAAS;AACX,WAAO;AAET,MAAI,SAAS,YAAY,KAAK,aAAa,UAAU;AACnD,QAAI,EAAE,KAAK,iBAAiB;AAC1B,WAAK,UAAU,uBAAO,OAAO,IAAI;SAC9B;AACH,aAAOoF,QAAOpF,KAAI;AAClB,UAAIoF,QAAO;AACT,aAAK,KAAK,kBAAkBpF,OAAM,KAAK,YAAY,QAAQ;IACvE;EACA,WAAiB,OAAO,SAAS,YAAY;AACrC,eAAW;AAEX,SAAK,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACrC,UAAI,KAAK,CAAC,MAAM,YAAY,KAAK,CAAC,EAAE,aAAa,UAAU;AACzD,2BAAmB,KAAK,CAAC,EAAE;AAC3B,mBAAW;AACX;MACZ;IACA;AAEQ,QAAI,WAAW;AACb,aAAO;AAET,QAAI,aAAa;AACf,WAAK,MAAK;SACP;AACH,gBAAU,MAAM,QAAQ;IAClC;AAEQ,QAAI,KAAK,WAAW;AAClB,MAAAoF,QAAOpF,KAAI,IAAI,KAAK,CAAC;AAEvB,QAAIoF,QAAO,mBAAmB;AAC5B,WAAK,KAAK,kBAAkBpF,OAAM,oBAAoB,QAAQ;EACxE;AAEM,SAAO;AACb;AAEA,aAAa,UAAU,MAAM,aAAa,UAAU;AAEpD,aAAa,UAAU,qBACnB,SAAS,mBAAmBA,OAAM;AAChC,MAAIqF,YAAWD,SAAQ;AAEvB,EAAAA,UAAS,KAAK;AACd,MAAIA,YAAW;AACb,WAAO;AAGT,MAAIA,QAAO,mBAAmB,QAAW;AACvC,QAAI,UAAU,WAAW,GAAG;AAC1B,WAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,WAAK,eAAe;IAC9B,WAAmBA,QAAOpF,KAAI,MAAM,QAAW;AACrC,UAAI,EAAE,KAAK,iBAAiB;AAC1B,aAAK,UAAU,uBAAO,OAAO,IAAI;;AAEjC,eAAOoF,QAAOpF,KAAI;IAC9B;AACQ,WAAO;EACf;AAGM,MAAI,UAAU,WAAW,GAAG;AAC1B,QAAIsF,QAAO,OAAO,KAAKF,OAAM;AAC7B,QAAIjF;AACJ,SAAK,IAAI,GAAG,IAAImF,MAAK,QAAQ,EAAE,GAAG;AAChC,MAAAnF,OAAMmF,MAAK,CAAC;AACZ,UAAInF,SAAQ,iBAAkB;AAC9B,WAAK,mBAAmBA,IAAG;IACrC;AACQ,SAAK,mBAAmB,gBAAgB;AACxC,SAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,SAAK,eAAe;AACpB,WAAO;EACf;AAEM,EAAAkF,aAAYD,QAAOpF,KAAI;AAEvB,MAAI,OAAOqF,eAAc,YAAY;AACnC,SAAK,eAAerF,OAAMqF,UAAS;EAC3C,WAAiBA,eAAc,QAAW;AAElC,SAAK,IAAIA,WAAU,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,WAAK,eAAerF,OAAMqF,WAAU,CAAC,CAAC;IAChD;EACA;AAEM,SAAO;AACb;AAEA,SAAS,WAAW,QAAQrF,OAAM,QAAQ;AACxC,MAAIoF,UAAS,OAAO;AAEpB,MAAIA,YAAW;AACb,WAAO,CAAA;AAET,MAAI,aAAaA,QAAOpF,KAAI;AAC5B,MAAI,eAAe;AACjB,WAAO,CAAA;AAET,MAAI,OAAO,eAAe;AACxB,WAAO,SAAS,CAAC,WAAW,YAAY,UAAU,IAAI,CAAC,UAAU;AAEnE,SAAO,SACL,gBAAgB,UAAU,IAAI,WAAW,YAAY,WAAW,MAAM;AAC1E;AAEA,aAAa,UAAU,YAAY,SAAS,UAAUA,OAAM;AAC1D,SAAO,WAAW,MAAMA,OAAM,IAAI;AACpC;AAEA,aAAa,UAAU,eAAe,SAAS,aAAaA,OAAM;AAChE,SAAO,WAAW,MAAMA,OAAM,KAAK;AACrC;AAEA,aAAa,gBAAgB,SAAS,SAASA,OAAM;AACnD,MAAI,OAAO,QAAQ,kBAAkB,YAAY;AAC/C,WAAO,QAAQ,cAAcA,KAAI;EACrC,OAAS;AACL,WAAO,cAAc,KAAK,SAASA,KAAI;EAC3C;AACA;AAEA,aAAa,UAAU,gBAAgB;AACvC,SAAS,cAAcA,OAAM;AAC3B,MAAIoF,UAAS,KAAK;AAElB,MAAIA,YAAW,QAAW;AACxB,QAAI,aAAaA,QAAOpF,KAAI;AAE5B,QAAI,OAAO,eAAe,YAAY;AACpC,aAAO;IACb,WAAe,eAAe,QAAW;AACnC,aAAO,WAAW;IACxB;EACA;AAEE,SAAO;AACT;AAEA,aAAa,UAAU,aAAa,SAAS,aAAa;AACxD,SAAO,KAAK,eAAe,IAAI,eAAe,KAAK,OAAO,IAAI,CAAA;AAChE;AAEA,SAAS,WAAW,KAAK,GAAG;AAC1B,MAAI,OAAO,IAAI,MAAM,CAAC;AACtB,WAAS,IAAI,GAAG,IAAI,GAAG,EAAE;AACvB,SAAK,CAAC,IAAI,IAAI,CAAC;AACjB,SAAO;AACT;AAEA,SAAS,UAAU,MAAMU,QAAO;AAC9B,SAAOA,SAAQ,IAAI,KAAK,QAAQA;AAC9B,SAAKA,MAAK,IAAI,KAAKA,SAAQ,CAAC;AAC9B,OAAK,IAAG;AACV;AAEA,SAAS,gBAAgB,KAAK;AAC5B,MAAI,MAAM,IAAI,MAAM,IAAI,MAAM;AAC9B,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACnC,QAAI,CAAC,IAAI,IAAI,CAAC,EAAE,YAAY,IAAI,CAAC;EACrC;AACE,SAAO;AACT;AAEA,SAASyE,MAAK,SAASrF,OAAM;AAC3B,SAAO,IAAI,QAAQ,SAAUyF,UAAS,QAAQ;AAC5C,aAAS,cAAc,KAAK;AAC1B,cAAQ,eAAezF,OAAM,QAAQ;AACrC,aAAO,GAAG;IAChB;AAEI,aAAS,WAAW;AAClB,UAAI,OAAO,QAAQ,mBAAmB,YAAY;AAChD,gBAAQ,eAAe,SAAS,aAAa;MACrD;AACM,MAAAyF,SAAQ,CAAA,EAAG,MAAM,KAAK,SAAS,CAAC;IACtC;AAEI,mCAA+B,SAASzF,OAAM,UAAU,EAAE,MAAM,KAAI,CAAE;AACtE,QAAIA,UAAS,SAAS;AACpB,oCAA8B,SAAS,eAAe,EAAE,MAAM,KAAI,CAAE;IAC1E;EACA,CAAG;AACH;AAEA,SAAS,8BAA8B,SAAS,SAAS,OAAO;AAC9D,MAAI,OAAO,QAAQ,OAAO,YAAY;AACpC,mCAA+B,SAAS,SAAS,SAAS,KAAK;EACnE;AACA;AAEA,SAAS,+BAA+B,SAASA,OAAM,UAAU,OAAO;AACtE,MAAI,OAAO,QAAQ,OAAO,YAAY;AACpC,QAAI,MAAM,MAAM;AACd,cAAQ,KAAKA,OAAM,QAAQ;IACjC,OAAW;AACL,cAAQ,GAAGA,OAAM,QAAQ;IAC/B;EACA,WAAa,OAAO,QAAQ,qBAAqB,YAAY;AAGzD,YAAQ,iBAAiBA,OAAM,SAAS,aAAa,KAAK;AAGxD,UAAI,MAAM,MAAM;AACd,gBAAQ,oBAAoBA,OAAM,YAAY;MACtD;AACM,eAAS,GAAG;IAClB,CAAK;EACL,OAAS;AACL,UAAM,IAAI,UAAU,wEAAwE,OAAO,OAAO;EAC9G;AACA;;;;;;;AChfc0F,oBAAGlH,cAAkB;;;;;;;;ACEnC,WAAS,QAAQ,QAAQ,gBAAgB;AAAE,QAAIgH,QAAO,OAAO,KAAK,MAAM;AAAG,QAAI,OAAO,uBAAuB;AAAE,UAAI,UAAU,OAAO,sBAAsB,MAAM;AAAG,yBAAmB,UAAU,QAAQ,OAAO,SAAU,KAAK;AAAE,eAAO,OAAO,yBAAyB,QAAQ,GAAG,EAAE;MAAW,CAAE,IAAIA,MAAK,KAAK,MAAMA,OAAM,OAAO;IAAE;AAAG,WAAOA;EAAK;AACnV,WAAS,cAAc,QAAQ;AAAE,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAAE,UAAI,SAAS,QAAQ,UAAU,CAAC,IAAI,UAAU,CAAC,IAAI,CAAA;AAAI,UAAI,IAAI,QAAQ,OAAO,MAAM,GAAG,IAAE,EAAE,QAAQ,SAAUnF,MAAK;AAAE,QAAAsF,iBAAgB,QAAQtF,MAAK,OAAOA,IAAG,CAAC;MAAE,CAAE,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,QAAQ,OAAO,0BAA0B,MAAM,CAAC,IAAI,QAAQ,OAAO,MAAM,CAAC,EAAE,QAAQ,SAAUA,MAAK;AAAE,eAAO,eAAe,QAAQA,MAAK,OAAO,yBAAyB,QAAQA,IAAG,CAAC;MAAE,CAAE;IAAE;AAAG,WAAO;EAAO;AACxf,WAASsF,iBAAgB5G,MAAKsB,MAAK,OAAO;AAAE,IAAAA,OAAM,eAAeA,IAAG;AAAG,QAAIA,QAAOtB,MAAK;AAAE,aAAO,eAAeA,MAAKsB,MAAK,EAAE,OAAc,YAAY,MAAM,cAAc,MAAM,UAAU,KAAI,CAAE;IAAE,OAAQ;AAAE,MAAAtB,KAAIsB,IAAG,IAAI;IAAM;AAAG,WAAOtB;EAAI;AAC1O,WAAS,gBAAgB,UAAU,aAAa;AAAE,QAAI,EAAE,oBAAoB,cAAc;AAAE,YAAM,IAAI,UAAU,mCAAmC;IAAE;EAAE;AACvJ,WAAS,kBAAkB,QAAQ,OAAO;AAAE,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAAE,UAAI,aAAa,MAAM,CAAC;AAAG,iBAAW,aAAa,WAAW,cAAc;AAAO,iBAAW,eAAe;AAAM,UAAI,WAAW,WAAY,YAAW,WAAW;AAAM,aAAO,eAAe,QAAQ,eAAe,WAAW,GAAG,GAAG,UAAU;IAAE;EAAE;AAC3U,WAAS,aAAa,aAAa,YAAY,aAAa;AAAE,QAAI,WAAY,mBAAkB,YAAY,WAAW,UAAU;AAAG,QAAI,YAAa,mBAAkB,aAAa,WAAW;AAAG,WAAO,eAAe,aAAa,aAAa,EAAE,UAAU,MAAK,CAAE;AAAG,WAAO;EAAY;AAC3R,WAAS,eAAe,KAAK;AAAE,QAAIsB,OAAM,aAAa,KAAK,QAAQ;AAAG,WAAO,OAAOA,SAAQ,WAAWA,OAAM,OAAOA,IAAG;EAAE;AACzH,WAAS,aAAa,OAAO,MAAM;AAAE,QAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AAAO,QAAI,OAAO,MAAM,OAAO,WAAW;AAAG,QAAI,SAAS,QAAW;AAAE,UAAI,MAAM,KAAK,KAAK,OAAO,QAAQ,SAAS;AAAG,UAAI,OAAO,QAAQ,SAAU,QAAO;AAAK,YAAM,IAAI,UAAU,8CAA8C;IAAE;AAAG,YAAQ,SAAS,WAAW,SAAS,QAAQ,KAAK;EAAE;AACvX,MAAI,WAAW7B,UACbG,UAAS,SAAS;AACpB,MAAI,YAAYD,cACdU,WAAU,UAAU;AACtB,MAAIwG,UAASxG,YAAWA,SAAQ,UAAU;AAC1C,WAAS,WAAW,KAAK,QAAQ,QAAQ;AACvC,IAAAT,QAAO,UAAU,KAAK,KAAK,KAAK,QAAQ,MAAM;;AAElC,gBAAgB,4BAAY;AACxC,aAASkH,cAAa;AACpB,sBAAgB,MAAMA,WAAU;AAChC,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,SAAS;;AAEhB,iBAAaA,aAAY,CAAC;MACxB,KAAK;MACL,OAAO,SAAS,KAAK,GAAG;AACtB,YAAI,QAAQ;UACV,MAAM;UACN,MAAM;QACd;AACM,YAAI,KAAK,SAAS,EAAG,MAAK,KAAK,OAAO;YAAW,MAAK,OAAO;AAC7D,aAAK,OAAO;AACZ,UAAE,KAAK;;IAEb,GAAK;MACD,KAAK;MACL,OAAO,SAAS,QAAQ,GAAG;AACzB,YAAI,QAAQ;UACV,MAAM;UACN,MAAM,KAAK;QACnB;AACM,YAAI,KAAK,WAAW,EAAG,MAAK,OAAO;AACnC,aAAK,OAAO;AACZ,UAAE,KAAK;;IAEb,GAAK;MACD,KAAK;MACL,OAAO,SAAS,QAAQ;AACtB,YAAI,KAAK,WAAW,EAAG;AACvB,YAAI,MAAM,KAAK,KAAK;AACpB,YAAI,KAAK,WAAW,EAAG,MAAK,OAAO,KAAK,OAAO;YAAU,MAAK,OAAO,KAAK,KAAK;AAC/E,UAAE,KAAK;AACP,eAAO;;IAEb,GAAK;MACD,KAAK;MACL,OAAO,SAAS,QAAQ;AACtB,aAAK,OAAO,KAAK,OAAO;AACxB,aAAK,SAAS;;IAEpB,GAAK;MACD,KAAK;MACL,OAAO,SAASC,MAAKvH,IAAG;AACtB,YAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,YAAI,IAAI,KAAK;AACb,YAAI,MAAM,KAAK,EAAE;AACjB,eAAO,IAAI,EAAE,KAAM,QAAOA,KAAI,EAAE;AAChC,eAAO;;IAEb,GAAK;MACD,KAAK;MACL,OAAO,SAAS,OAAO,GAAG;AACxB,YAAI,KAAK,WAAW,EAAG,QAAOI,QAAO,MAAM,CAAC;AAC5C,YAAI,MAAMA,QAAO,YAAY,MAAM,CAAC;AACpC,YAAI,IAAI,KAAK;AACb,YAAI,IAAI;AACR,eAAO,GAAG;AACR,qBAAW,EAAE,MAAM,KAAK,CAAC;AACzB,eAAK,EAAE,KAAK;AACZ,cAAI,EAAE;;AAER,eAAO;;;IAIb,GAAK;MACD,KAAK;MACL,OAAO,SAAS,QAAQ,GAAG,YAAY;AACrC,YAAI;AACJ,YAAI,IAAI,KAAK,KAAK,KAAK,QAAQ;AAE7B,gBAAM,KAAK,KAAK,KAAK,MAAM,GAAG,CAAC;AAC/B,eAAK,KAAK,OAAO,KAAK,KAAK,KAAK,MAAM,CAAC;mBAC9B,MAAM,KAAK,KAAK,KAAK,QAAQ;AAEtC,gBAAM,KAAK,MAAK;QACxB,OAAa;AAEL,gBAAM,aAAa,KAAK,WAAW,CAAC,IAAI,KAAK,WAAW,CAAC;;AAE3D,eAAO;;IAEb,GAAK;MACD,KAAK;MACL,OAAO,SAAS,QAAQ;AACtB,eAAO,KAAK,KAAK;;;IAIvB,GAAK;MACD,KAAK;MACL,OAAO,SAAS,WAAW,GAAG;AAC5B,YAAI,IAAI,KAAK;AACb,YAAI,IAAI;AACR,YAAI,MAAM,EAAE;AACZ,aAAK,IAAI;AACT,eAAO,IAAI,EAAE,MAAM;AACjB,cAAI,MAAM,EAAE;AACZ,cAAI,KAAK,IAAI,IAAI,SAAS,IAAI,SAAS;AACvC,cAAI,OAAO,IAAI,OAAQ,QAAO;cAAS,QAAO,IAAI,MAAM,GAAG,CAAC;AAC5D,eAAK;AACL,cAAI,MAAM,GAAG;AACX,gBAAI,OAAO,IAAI,QAAQ;AACrB,gBAAE;AACF,kBAAI,EAAE,KAAM,MAAK,OAAO,EAAE;kBAAU,MAAK,OAAO,KAAK,OAAO;YACxE,OAAiB;AACL,mBAAK,OAAO;AACZ,gBAAE,OAAO,IAAI,MAAM,EAAE;;AAEvB;;AAEF,YAAE;;AAEJ,aAAK,UAAU;AACf,eAAO;;;IAIb,GAAK;MACD,KAAK;MACL,OAAO,SAAS,WAAW,GAAG;AAC5B,YAAI,MAAMA,QAAO,YAAY,CAAC;AAC9B,YAAI,IAAI,KAAK;AACb,YAAI,IAAI;AACR,UAAE,KAAK,KAAK,GAAG;AACf,aAAK,EAAE,KAAK;AACZ,eAAO,IAAI,EAAE,MAAM;AACjB,cAAI,MAAM,EAAE;AACZ,cAAI,KAAK,IAAI,IAAI,SAAS,IAAI,SAAS;AACvC,cAAI,KAAK,KAAK,IAAI,SAAS,GAAG,GAAG,EAAE;AACnC,eAAK;AACL,cAAI,MAAM,GAAG;AACX,gBAAI,OAAO,IAAI,QAAQ;AACrB,gBAAE;AACF,kBAAI,EAAE,KAAM,MAAK,OAAO,EAAE;kBAAU,MAAK,OAAO,KAAK,OAAO;YACxE,OAAiB;AACL,mBAAK,OAAO;AACZ,gBAAE,OAAO,IAAI,MAAM,EAAE;;AAEvB;;AAEF,YAAE;;AAEJ,aAAK,UAAU;AACf,eAAO;;;IAIb,GAAK;MACD,KAAKiH;MACL,OAAO,SAAS,MAAM,GAAG,SAAS;AAChC,eAAOxG,SAAQ,MAAM,cAAc,cAAc,CAAA,GAAI,OAAO,GAAG,CAAA,GAAI;;UAEjE,OAAO;;UAEP,eAAe;SAChB,CAAC;;KAEL,CAAC;AACF,WAAOyG;EACT,GAAC;;;;;;;;ACnLD,WAASE,SAAQ,KAAK,IAAI;AACxB,QAAI,QAAQ;AACZ,QAAI,oBAAoB,KAAK,kBAAkB,KAAK,eAAe;AACnE,QAAI,oBAAoB,KAAK,kBAAkB,KAAK,eAAe;AACnE,QAAI,qBAAqB,mBAAmB;AAC1C,UAAI,IAAI;AACN,WAAG,GAAG;iBACG,KAAK;AACd,YAAI,CAAC,KAAK,gBAAgB;AACxB,kBAAQ,SAASC,cAAa,MAAM,GAAG;mBAC9B,CAAC,KAAK,eAAe,cAAc;AAC5C,eAAK,eAAe,eAAe;AACnC,kBAAQ,SAASA,cAAa,MAAM,GAAG;;;AAG3C,aAAO;;AAMT,QAAI,KAAK,gBAAgB;AACvB,WAAK,eAAe,YAAY;;AAIlC,QAAI,KAAK,gBAAgB;AACvB,WAAK,eAAe,YAAY;;AAElC,SAAK,SAAS,OAAO,MAAM,SAAUC,MAAK;AACxC,UAAI,CAAC,MAAMA,MAAK;AACd,YAAI,CAAC,MAAM,gBAAgB;AACzB,kBAAQ,SAAS,qBAAqB,OAAOA,IAAG;mBACvC,CAAC,MAAM,eAAe,cAAc;AAC7C,gBAAM,eAAe,eAAe;AACpC,kBAAQ,SAAS,qBAAqB,OAAOA,IAAG;QACxD,OAAa;AACL,kBAAQ,SAAS,aAAa,KAAK;;iBAE5B,IAAI;AACb,gBAAQ,SAAS,aAAa,KAAK;AACnC,WAAGA,IAAG;MACZ,OAAW;AACL,gBAAQ,SAAS,aAAa,KAAK;;IAEzC,CAAG;AACD,WAAO;;AAET,WAAS,oBAAoB3E,OAAM,KAAK;AACtC,IAAA0E,aAAY1E,OAAM,GAAG;AACrB,gBAAYA,KAAI;;AAElB,WAAS,YAAYA,OAAM;AACzB,QAAIA,MAAK,kBAAkB,CAACA,MAAK,eAAe,UAAW;AAC3D,QAAIA,MAAK,kBAAkB,CAACA,MAAK,eAAe,UAAW;AAC3D,IAAAA,MAAK,KAAK,OAAO;;AAEnB,WAAS4E,aAAY;AACnB,QAAI,KAAK,gBAAgB;AACvB,WAAK,eAAe,YAAY;AAChC,WAAK,eAAe,UAAU;AAC9B,WAAK,eAAe,QAAQ;AAC5B,WAAK,eAAe,aAAa;;AAEnC,QAAI,KAAK,gBAAgB;AACvB,WAAK,eAAe,YAAY;AAChC,WAAK,eAAe,QAAQ;AAC5B,WAAK,eAAe,SAAS;AAC7B,WAAK,eAAe,cAAc;AAClC,WAAK,eAAe,cAAc;AAClC,WAAK,eAAe,WAAW;AAC/B,WAAK,eAAe,eAAe;;;AAGvC,WAASF,aAAY1E,OAAM,KAAK;AAC9B,IAAAA,MAAK,KAAK,SAAS,GAAG;;AAExB,WAAS,eAAe,QAAQ,KAAK;AAOnC,QAAI,SAAS,OAAO;AACpB,QAAI,SAAS,OAAO;AACpB,QAAI,UAAU,OAAO,eAAe,UAAU,OAAO,YAAa,QAAO,QAAQ,GAAG;QAAO,QAAO,KAAK,SAAS,GAAG;;AAErH6E,gBAAiB;IACf,SAASJ;IACT,WAAWG;IACX;;;;;;;;;AC5FF,WAAS,eAAe,UAAU,YAAY;AAAE,aAAS,YAAY,OAAO,OAAO,WAAW,SAAS;AAAG,aAAS,UAAU,cAAc;AAAU,aAAS,YAAY;EAAW;AAErL,MAAI,QAAQ,CAAA;AAEZ,WAAS,gBAAgBrG,OAAM,SAASE,OAAM;AAC5C,QAAI,CAACA,OAAM;AACT,MAAAA,QAAO;;AAGT,aAAS,WAAW,MAAM,MAAM,MAAM;AACpC,UAAI,OAAO,YAAY,UAAU;AAC/B,eAAO;MACb,OAAW;AACL,eAAO,QAAQ,MAAM,MAAM,IAAI;;;AAInC,QAAI,YAEJ,0BAAU,OAAO;AACf,qBAAeqG,YAAW,KAAK;AAE/B,eAASA,WAAU,MAAM,MAAM,MAAM;AACnC,eAAO,MAAM,KAAK,MAAM,WAAW,MAAM,MAAM,IAAI,CAAC,KAAK;;AAG3D,aAAOA;OACPrG,KAAI;AAEN,cAAU,UAAU,OAAOA,MAAK;AAChC,cAAU,UAAU,OAAOF;AAC3B,UAAMA,KAAI,IAAI;;AAIhB,WAAS,MAAM,UAAU,OAAO;AAC9B,QAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,UAAI,MAAM,SAAS;AACnB,iBAAW,SAAS,IAAI,SAAU,GAAG;AACnC,eAAO,OAAO,CAAC;MACrB,CAAK;AAED,UAAI,MAAM,GAAG;AACX,eAAO,UAAU,OAAO,OAAO,GAAG,EAAE,OAAO,SAAS,MAAM,GAAG,MAAM,CAAC,EAAE,KAAK,IAAI,GAAG,OAAO,IAAI,SAAS,MAAM,CAAC;MACnH,WAAe,QAAQ,GAAG;AACpB,eAAO,UAAU,OAAO,OAAO,GAAG,EAAE,OAAO,SAAS,CAAC,GAAG,MAAM,EAAE,OAAO,SAAS,CAAC,CAAC;MACxF,OAAW;AACL,eAAO,MAAM,OAAO,OAAO,GAAG,EAAE,OAAO,SAAS,CAAC,CAAC;;IAExD,OAAS;AACL,aAAO,MAAM,OAAO,OAAO,GAAG,EAAE,OAAO,OAAO,QAAQ,CAAC;;;AAK3D,WAAS,WAAW,KAAK,QAAQ,KAAK;AACpC,WAAO,IAAI,OAAO,CAAC,OAAO,MAAM,IAAI,IAAI,CAAC,KAAK,OAAO,MAAM,MAAM;;AAInE,WAAS,SAAS,KAAK,QAAQ,UAAU;AACvC,QAAI,aAAa,UAAa,WAAW,IAAI,QAAQ;AACnD,iBAAW,IAAI;;AAGjB,WAAO,IAAI,UAAU,WAAW,OAAO,QAAQ,QAAQ,MAAM;;AAI/D,WAAS,SAAS,KAAK,QAAQ,OAAO;AACpC,QAAI,OAAO,UAAU,UAAU;AAC7B,cAAQ;;AAGV,QAAI,QAAQ,OAAO,SAAS,IAAI,QAAQ;AACtC,aAAO;IACX,OAAS;AACL,aAAO,IAAI,QAAQ,QAAQ,KAAK,MAAM;;;AAI1C,kBAAgB,yBAAyB,SAAUG,OAAM,OAAO;AAC9D,WAAO,gBAAgB,QAAQ,8BAA8BA,QAAO;KACnE,SAAS;AACZ,kBAAgB,wBAAwB,SAAUA,OAAM,UAAU,QAAQ;AAExE,QAAI;AAEJ,QAAI,OAAO,aAAa,YAAY,WAAW,UAAU,MAAM,GAAG;AAChE,mBAAa;AACb,iBAAW,SAAS,QAAQ,SAAS,EAAE;IAC3C,OAAS;AACL,mBAAa;;AAGf,QAAI;AAEJ,QAAI,SAASA,OAAM,WAAW,GAAG;AAE/B,YAAM,OAAO,OAAOA,OAAM,GAAG,EAAE,OAAO,YAAY,GAAG,EAAE,OAAO,MAAM,UAAU,MAAM,CAAC;IACzF,OAAS;AACL,UAAIE,QAAO,SAASF,OAAM,GAAG,IAAI,aAAa;AAC9C,YAAM,QAAS,OAAOA,OAAM,IAAK,EAAE,OAAOE,OAAM,GAAG,EAAE,OAAO,YAAY,GAAG,EAAE,OAAO,MAAM,UAAU,MAAM,CAAC;;AAG7G,WAAO,mBAAmB,OAAO,OAAO,MAAM;AAC9C,WAAO;KACN,SAAS;AACZ,kBAAgB,6BAA6B,yBAAyB;AACtE,kBAAgB,8BAA8B,SAAUF,OAAM;AAC5D,WAAO,SAASA,QAAO;EACzB,CAAC;AACD,kBAAgB,8BAA8B,iBAAiB;AAC/D,kBAAgB,wBAAwB,SAAUA,OAAM;AACtD,WAAO,iBAAiBA,QAAO;EACjC,CAAC;AACD,kBAAgB,yBAAyB,gCAAgC;AACzE,kBAAgB,0BAA0B,2BAA2B;AACrE,kBAAgB,8BAA8B,iBAAiB;AAC/D,kBAAgB,0BAA0B,uCAAuC,SAAS;AAC1F,kBAAgB,wBAAwB,SAAU,KAAK;AACrD,WAAO,uBAAuB;KAC7B,SAAS;AACZ,kBAAgB,sCAAsC,kCAAkC;AACxF,gBAAA,QAAuB;;;;;;;;AC5HvB,MAAI,wBAAwBxB,qBAAA,EAA2B,MAAM;AAC7D,WAAS,kBAAkB,SAAS,UAAU,WAAW;AACvD,WAAO,QAAQ,iBAAiB,OAAO,QAAQ,gBAAgB,WAAW,QAAQ,SAAS,IAAI;;AAEjG,WAAS,iBAAiB2D,QAAO,SAAS,WAAW,UAAU;AAC7D,QAAI,MAAM,kBAAkB,SAAS,UAAU,SAAS;AACxD,QAAI,OAAO,MAAM;AACf,UAAI,EAAE,SAAS,GAAG,KAAK,KAAK,MAAM,GAAG,MAAM,QAAQ,MAAM,GAAG;AAC1D,YAAInC,QAAO,WAAW,YAAY;AAClC,cAAM,IAAI,sBAAsBA,OAAM,GAAG;;AAE3C,aAAO,KAAK,MAAM,GAAG;;AAIvB,WAAOmC,OAAM,aAAa,KAAK,KAAK;;AAEtC,UAAiB;IACf;;;;ICfFkE,YAAiB;AAoBjB,SAAS,UAAW,IAAI,KAAK;AAC3B,MAAI,OAAO,eAAe,GAAG;AAC3B,WAAO;EACX;AAEE,MAAI,SAAS;AACb,WAAS,aAAa;AACpB,QAAI,CAAC,QAAQ;AACX,UAAI,OAAO,kBAAkB,GAAG;AAC9B,cAAM,IAAI,MAAM,GAAG;MAC3B,WAAiB,OAAO,kBAAkB,GAAG;AACrC,gBAAQ,MAAM,GAAG;MACzB,OAAa;AACL,gBAAQ,KAAK,GAAG;MACxB;AACM,eAAS;IACf;AACI,WAAO,GAAG,MAAM,MAAM,SAAS;EACnC;AAEE,SAAO;AACT;AAUA,SAAS,OAAQrG,OAAM;AAErB,MAAI;AACF,QAAI,CAAC6E,eAAO,aAAc,QAAO;EACrC,SAAW,GAAG;AACV,WAAO;EACX;AACE,MAAI,MAAMA,eAAO,aAAa7E,KAAI;AAClC,MAAI,QAAQ,IAAK,QAAO;AACxB,SAAO,OAAO,GAAG,EAAE,YAAW,MAAO;AACvC;;;;;;ACvCcsG,uBAAG;AAYjB,WAAS,cAAcnE,QAAO;AAC5B,QAAI,QAAQ;AACZ,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,SAAS,WAAY;AACxB,qBAAe,OAAOA,MAAK;IAC/B;;AAKA,MAAIoE;AAGJ,WAAS,gBAAgB;AAGzB,MAAI,eAAe;IACjB,WAAW/H;EACb;AAIA,MAAIgI,UAAS9H,qBAAA;AAGb,MAAIC,UAAS0D,SAAkB;AAC/B,MAAI,iBAAiB,OAAOwC,mBAAW,cAAcA,iBAAS,OAAO,WAAW,cAAc,SAAS,OAAO,SAAS,cAAc,OAAO,CAAA,GAAI,cAAc,WAAY;EAAA;AAC1K,WAAS,oBAAoB,OAAO;AAClC,WAAOlG,QAAO,KAAK,KAAK;;AAE1B,WAAS,cAAcI,MAAK;AAC1B,WAAOJ,QAAO,SAASI,IAAG,KAAKA,gBAAe;;AAEhD,MAAI,cAAcgE,eAAA;AAClB,MAAI,WAAWG,aAAmC,GAChD,mBAAmB,SAAS;AAC9B,MAAI,iBAAiBiB,qBAAoB,EAAC,OACxC,uBAAuB,eAAe,sBACtC,6BAA6B,eAAe,4BAC5C,wBAAwB,eAAe,uBACvC,yBAAyB,eAAe,wBACxC,uBAAuB,eAAe,sBACtC,yBAAyB,eAAe,wBACxC,6BAA6B,eAAe,4BAC5C,uBAAuB,eAAe;AACxC,MAAI,iBAAiB,YAAY;AACjCsC,0BAAoB,UAAUD,OAAM;AACpC,WAAS,MAAM;EAAA;AACf,WAAS,cAAc,SAAS,QAAQ,UAAU;AAChD,IAAAD,UAASA,WAAUG,wBAAAA;AACnB,cAAU,WAAW,CAAA;AAOrB,QAAI,OAAO,aAAa,UAAW,YAAW,kBAAkBH;AAIhE,SAAK,aAAa,CAAC,CAAC,QAAQ;AAC5B,QAAI,SAAU,MAAK,aAAa,KAAK,cAAc,CAAC,CAAC,QAAQ;AAK7D,SAAK,gBAAgB,iBAAiB,MAAM,SAAS,yBAAyB,QAAQ;AAGtF,SAAK,cAAc;AAGnB,SAAK,YAAY;AAEjB,SAAK,SAAS;AAEd,SAAK,QAAQ;AAEb,SAAK,WAAW;AAGhB,SAAK,YAAY;AAKjB,QAAI,WAAW,QAAQ,kBAAkB;AACzC,SAAK,gBAAgB,CAAC;AAKtB,SAAK,kBAAkB,QAAQ,mBAAmB;AAKlD,SAAK,SAAS;AAGd,SAAK,UAAU;AAGf,SAAK,SAAS;AAMd,SAAK,OAAO;AAKZ,SAAK,mBAAmB;AAGxB,SAAK,UAAU,SAAU,IAAI;AAC3B,cAAQ,QAAQ,EAAE;IACtB;AAGE,SAAK,UAAU;AAGf,SAAK,WAAW;AAChB,SAAK,kBAAkB;AACvB,SAAK,sBAAsB;AAI3B,SAAK,YAAY;AAIjB,SAAK,cAAc;AAGnB,SAAK,eAAe;AAGpB,SAAK,YAAY,QAAQ,cAAc;AAGvC,SAAK,cAAc,CAAC,CAAC,QAAQ;AAG7B,SAAK,uBAAuB;AAI5B,SAAK,qBAAqB,IAAI,cAAc,IAAI;;AAElD,gBAAc,UAAU,YAAY,SAAS,YAAY;AACvD,QAAI,UAAU,KAAK;AACnB,QAAI,MAAM,CAAA;AACV,WAAO,SAAS;AACd,UAAI,KAAK,OAAO;AAChB,gBAAU,QAAQ;;AAEpB,WAAO;EACT;AACA,GAAC,WAAY;AACX,QAAI;AACF,aAAO,eAAe,cAAc,WAAW,UAAU;QACvD,KAAK,aAAa,UAAU,SAAS,4BAA4B;AAC/D,iBAAO,KAAK,UAAS;QAC7B,GAAS,8EAAmF,SAAS;MACrG,CAAK;IACL,SAAW,GAAG;IAAA;EACd,GAAC;AAID,MAAI;AACJ,MAAI,OAAO,WAAW,cAAc,OAAO,eAAe,OAAO,SAAS,UAAU,OAAO,WAAW,MAAM,YAAY;AACtH,sBAAkB,SAAS,UAAU,OAAO,WAAW;AACvD,WAAO,eAAe,UAAU,OAAO,aAAa;MAClD,OAAO,SAAS,MAAM,QAAQ;AAC5B,YAAI,gBAAgB,KAAK,MAAM,MAAM,EAAG,QAAO;AAC/C,YAAI,SAAS,SAAU,QAAO;AAC9B,eAAO,UAAU,OAAO,0BAA0B;;IAExD,CAAG;EACH,OAAO;AACL,sBAAkB,SAASI,iBAAgB,QAAQ;AACjD,aAAO,kBAAkB;IAC7B;;AAEA,WAAS,SAAS,SAAS;AACzB,IAAAJ,UAASA,WAAUG,wBAAAA;AAYnB,QAAI,WAAW,gBAAgBH;AAC/B,QAAI,CAAC,YAAY,CAAC,gBAAgB,KAAK,UAAU,IAAI,EAAG,QAAO,IAAI,SAAS,OAAO;AACnF,SAAK,iBAAiB,IAAI,cAAc,SAAS,MAAM,QAAQ;AAG/D,SAAK,WAAW;AAChB,QAAI,SAAS;AACX,UAAI,OAAO,QAAQ,UAAU,WAAY,MAAK,SAAS,QAAQ;AAC/D,UAAI,OAAO,QAAQ,WAAW,WAAY,MAAK,UAAU,QAAQ;AACjE,UAAI,OAAO,QAAQ,YAAY,WAAY,MAAK,WAAW,QAAQ;AACnE,UAAI,OAAO,QAAQ,UAAU,WAAY,MAAK,SAAS,QAAQ;;AAEjE,IAAAC,QAAO,KAAK,IAAI;;AAIlB,WAAS,UAAU,OAAO,WAAY;AACpC,mBAAe,MAAM,IAAI,uBAAsB,CAAE;EACnD;AACA,WAAS,cAAc,QAAQ,IAAI;AACjC,QAAI,KAAK,IAAI,2BAA0B;AAEvC,mBAAe,QAAQ,EAAE;AACzB,YAAQ,SAAS,IAAI,EAAE;;AAMzB,WAAS,WAAW,QAAQrE,QAAO,OAAO,IAAI;AAC5C,QAAI;AACJ,QAAI,UAAU,MAAM;AAClB,WAAK,IAAI,uBAAsB;eACtB,OAAO,UAAU,YAAY,CAACA,OAAM,YAAY;AACzD,WAAK,IAAI,qBAAqB,SAAS,CAAC,UAAU,QAAQ,GAAG,KAAK;;AAEpE,QAAI,IAAI;AACN,qBAAe,QAAQ,EAAE;AACzB,cAAQ,SAAS,IAAI,EAAE;AACvB,aAAO;;AAET,WAAO;;AAET,WAAS,UAAU,QAAQ,SAAU,OAAO,UAAU,IAAI;AACxD,QAAIA,SAAQ,KAAK;AACjB,QAAI,MAAM;AACV,QAAI,QAAQ,CAACA,OAAM,cAAc,cAAc,KAAK;AACpD,QAAI,SAAS,CAACxD,QAAO,SAAS,KAAK,GAAG;AACpC,cAAQ,oBAAoB,KAAK;;AAEnC,QAAI,OAAO,aAAa,YAAY;AAClC,WAAK;AACL,iBAAW;;AAEb,QAAI,MAAO,YAAW;aAAkB,CAAC,SAAU,YAAWwD,OAAM;AACpE,QAAI,OAAO,OAAO,WAAY,MAAK;AACnC,QAAIA,OAAM,OAAQ,eAAc,MAAM,EAAE;aAAW,SAAS,WAAW,MAAMA,QAAO,OAAO,EAAE,GAAG;AAC9F,MAAAA,OAAM;AACN,YAAM,cAAc,MAAMA,QAAO,OAAO,OAAO,UAAU,EAAE;;AAE7D,WAAO;EACT;AACA,WAAS,UAAU,OAAO,WAAY;AACpC,SAAK,eAAe;EACtB;AACA,WAAS,UAAU,SAAS,WAAY;AACtC,QAAIA,SAAQ,KAAK;AACjB,QAAIA,OAAM,QAAQ;AAChB,MAAAA,OAAM;AACN,UAAI,CAACA,OAAM,WAAW,CAACA,OAAM,UAAU,CAACA,OAAM,oBAAoBA,OAAM,gBAAiB,aAAY,MAAMA,MAAK;;EAEpH;AACA,WAAS,UAAU,qBAAqB,SAAS,mBAAmB,UAAU;AAE5E,QAAI,OAAO,aAAa,SAAU,YAAW,SAAS,YAAW;AACjE,QAAI,EAAE,CAAC,OAAO,QAAQ,SAAS,SAAS,UAAU,UAAU,QAAQ,SAAS,WAAW,YAAY,KAAK,EAAE,SAAS,WAAW,IAAI,YAAW,CAAE,IAAI,IAAK,OAAM,IAAI,qBAAqB,QAAQ;AAChM,SAAK,eAAe,kBAAkB;AACtC,WAAO;EACT;AACA,SAAO,eAAe,SAAS,WAAW,kBAAkB;;;;IAI1D,YAAY;IACZ,KAAK,SAASyE,OAAM;AAClB,aAAO,KAAK,kBAAkB,KAAK,eAAe,UAAS;;EAE/D,CAAC;AACD,WAAS,YAAYzE,QAAO,OAAO,UAAU;AAC3C,QAAI,CAACA,OAAM,cAAcA,OAAM,kBAAkB,SAAS,OAAO,UAAU,UAAU;AACnF,cAAQxD,QAAO,KAAK,OAAO,QAAQ;;AAErC,WAAO;;AAET,SAAO,eAAe,SAAS,WAAW,yBAAyB;;;;IAIjE,YAAY;IACZ,KAAK,SAASiI,OAAM;AAClB,aAAO,KAAK,eAAe;;EAE/B,CAAC;AAKD,WAAS,cAAc,QAAQzE,QAAO,OAAO,OAAO,UAAU,IAAI;AAChE,QAAI,CAAC,OAAO;AACV,UAAI,WAAW,YAAYA,QAAO,OAAO,QAAQ;AACjD,UAAI,UAAU,UAAU;AACtB,gBAAQ;AACR,mBAAW;AACX,gBAAQ;;;AAGZ,QAAI,MAAMA,OAAM,aAAa,IAAI,MAAM;AACvC,IAAAA,OAAM,UAAU;AAChB,QAAI,MAAMA,OAAM,SAASA,OAAM;AAE/B,QAAI,CAAC,IAAK,CAAAA,OAAM,YAAY;AAC5B,QAAIA,OAAM,WAAWA,OAAM,QAAQ;AACjC,UAAI,OAAOA,OAAM;AACjB,MAAAA,OAAM,sBAAsB;QAC1B;QACA;QACA;QACA,UAAU;QACV,MAAM;MACZ;AACI,UAAI,MAAM;AACR,aAAK,OAAOA,OAAM;MACxB,OAAW;AACL,QAAAA,OAAM,kBAAkBA,OAAM;;AAEhC,MAAAA,OAAM,wBAAwB;IAClC,OAAS;AACL,cAAQ,QAAQA,QAAO,OAAO,KAAK,OAAO,UAAU,EAAE;;AAExD,WAAO;;AAET,WAAS,QAAQ,QAAQA,QAAO,QAAQ,KAAK,OAAO,UAAU,IAAI;AAChE,IAAAA,OAAM,WAAW;AACjB,IAAAA,OAAM,UAAU;AAChB,IAAAA,OAAM,UAAU;AAChB,IAAAA,OAAM,OAAO;AACb,QAAIA,OAAM,UAAW,CAAAA,OAAM,QAAQ,IAAI,qBAAqB,OAAO,CAAC;aAAW,OAAQ,QAAO,QAAQ,OAAOA,OAAM,OAAO;QAAO,QAAO,OAAO,OAAO,UAAUA,OAAM,OAAO;AAC7K,IAAAA,OAAM,OAAO;;AAEf,WAAS,aAAa,QAAQA,QAAO0E,OAAM,IAAI,IAAI;AACjD,MAAE1E,OAAM;AACR,QAAI0E,OAAM;AAGR,cAAQ,SAAS,IAAI,EAAE;AAGvB,cAAQ,SAAS,aAAa,QAAQ1E,MAAK;AAC3C,aAAO,eAAe,eAAe;AACrC,qBAAe,QAAQ,EAAE;IAC7B,OAAS;AAGL,SAAG,EAAE;AACL,aAAO,eAAe,eAAe;AACrC,qBAAe,QAAQ,EAAE;AAGzB,kBAAY,QAAQA,MAAK;;;AAG7B,WAAS,mBAAmBA,QAAO;AACjC,IAAAA,OAAM,UAAU;AAChB,IAAAA,OAAM,UAAU;AAChB,IAAAA,OAAM,UAAUA,OAAM;AACtB,IAAAA,OAAM,WAAW;;AAEnB,WAAS,QAAQ,QAAQ,IAAI;AAC3B,QAAIA,SAAQ,OAAO;AACnB,QAAI0E,QAAO1E,OAAM;AACjB,QAAI,KAAKA,OAAM;AACf,QAAI,OAAO,OAAO,WAAY,OAAM,IAAI,sBAAqB;AAC7D,uBAAmBA,MAAK;AACxB,QAAI,GAAI,cAAa,QAAQA,QAAO0E,OAAM,IAAI,EAAE;SAAO;AAErD,UAAI,WAAW,WAAW1E,MAAK,KAAK,OAAO;AAC3C,UAAI,CAAC,YAAY,CAACA,OAAM,UAAU,CAACA,OAAM,oBAAoBA,OAAM,iBAAiB;AAClF,oBAAY,QAAQA,MAAK;;AAE3B,UAAI0E,OAAM;AACR,gBAAQ,SAAS,YAAY,QAAQ1E,QAAO,UAAU,EAAE;MAC9D,OAAW;AACL,mBAAW,QAAQA,QAAO,UAAU,EAAE;;;;AAI5C,WAAS,WAAW,QAAQA,QAAO,UAAU,IAAI;AAC/C,QAAI,CAAC,SAAU,cAAa,QAAQA,MAAK;AACzC,IAAAA,OAAM;AACN,OAAE;AACF,gBAAY,QAAQA,MAAK;;AAM3B,WAAS,aAAa,QAAQA,QAAO;AACnC,QAAIA,OAAM,WAAW,KAAKA,OAAM,WAAW;AACzC,MAAAA,OAAM,YAAY;AAClB,aAAO,KAAK,OAAO;;;AAKvB,WAAS,YAAY,QAAQA,QAAO;AAClC,IAAAA,OAAM,mBAAmB;AACzB,QAAI,QAAQA,OAAM;AAClB,QAAI,OAAO,WAAW,SAAS,MAAM,MAAM;AAEzC,UAAI,IAAIA,OAAM;AACd,UAAI9D,UAAS,IAAI,MAAM,CAAC;AACxB,UAAI,SAAS8D,OAAM;AACnB,aAAO,QAAQ;AACf,UAAI,QAAQ;AACZ,UAAI,aAAa;AACjB,aAAO,OAAO;AACZ,QAAA9D,QAAO,KAAK,IAAI;AAChB,YAAI,CAAC,MAAM,MAAO,cAAa;AAC/B,gBAAQ,MAAM;AACd,iBAAS;;AAEX,MAAAA,QAAO,aAAa;AACpB,cAAQ,QAAQ8D,QAAO,MAAMA,OAAM,QAAQ9D,SAAQ,IAAI,OAAO,MAAM;AAIpE,MAAA8D,OAAM;AACN,MAAAA,OAAM,sBAAsB;AAC5B,UAAI,OAAO,MAAM;AACf,QAAAA,OAAM,qBAAqB,OAAO;AAClC,eAAO,OAAO;MACpB,OAAW;AACL,QAAAA,OAAM,qBAAqB,IAAI,cAAcA,MAAK;;AAEpD,MAAAA,OAAM,uBAAuB;IACjC,OAAS;AAEL,aAAO,OAAO;AACZ,YAAI,QAAQ,MAAM;AAClB,YAAI,WAAW,MAAM;AACrB,YAAI,KAAK,MAAM;AACf,YAAI,MAAMA,OAAM,aAAa,IAAI,MAAM;AACvC,gBAAQ,QAAQA,QAAO,OAAO,KAAK,OAAO,UAAU,EAAE;AACtD,gBAAQ,MAAM;AACd,QAAAA,OAAM;AAKN,YAAIA,OAAM,SAAS;AACjB;;;AAGJ,UAAI,UAAU,KAAM,CAAAA,OAAM,sBAAsB;;AAElD,IAAAA,OAAM,kBAAkB;AACxB,IAAAA,OAAM,mBAAmB;;AAE3B,WAAS,UAAU,SAAS,SAAU,OAAO,UAAU,IAAI;AACzD,OAAG,IAAI,2BAA2B,UAAU,CAAC;EAC/C;AACA,WAAS,UAAU,UAAU;AAC7B,WAAS,UAAU,MAAM,SAAU,OAAO,UAAU,IAAI;AACtD,QAAIA,SAAQ,KAAK;AACjB,QAAI,OAAO,UAAU,YAAY;AAC/B,WAAK;AACL,cAAQ;AACR,iBAAW;IACf,WAAa,OAAO,aAAa,YAAY;AACzC,WAAK;AACL,iBAAW;;AAEb,QAAI,UAAU,QAAQ,UAAU,OAAW,MAAK,MAAM,OAAO,QAAQ;AAGrE,QAAIA,OAAM,QAAQ;AAChB,MAAAA,OAAM,SAAS;AACf,WAAK,OAAM;;AAIb,QAAI,CAACA,OAAM,OAAQ,aAAY,MAAMA,QAAO,EAAE;AAC9C,WAAO;EACT;AACA,SAAO,eAAe,SAAS,WAAW,kBAAkB;;;;IAI1D,YAAY;IACZ,KAAK,SAASyE,OAAM;AAClB,aAAO,KAAK,eAAe;;EAE/B,CAAC;AACD,WAAS,WAAWzE,QAAO;AACzB,WAAOA,OAAM,UAAUA,OAAM,WAAW,KAAKA,OAAM,oBAAoB,QAAQ,CAACA,OAAM,YAAY,CAACA,OAAM;;AAE3G,WAAS,UAAU,QAAQA,QAAO;AAChC,WAAO,OAAO,SAAU,KAAK;AAC3B,MAAAA,OAAM;AACN,UAAI,KAAK;AACP,uBAAe,QAAQ,GAAG;;AAE5B,MAAAA,OAAM,cAAc;AACpB,aAAO,KAAK,WAAW;AACvB,kBAAY,QAAQA,MAAK;IAC7B,CAAG;;AAEH,WAAS2E,WAAU,QAAQ3E,QAAO;AAChC,QAAI,CAACA,OAAM,eAAe,CAACA,OAAM,aAAa;AAC5C,UAAI,OAAO,OAAO,WAAW,cAAc,CAACA,OAAM,WAAW;AAC3D,QAAAA,OAAM;AACN,QAAAA,OAAM,cAAc;AACpB,gBAAQ,SAAS,WAAW,QAAQA,MAAK;MAC/C,OAAW;AACL,QAAAA,OAAM,cAAc;AACpB,eAAO,KAAK,WAAW;;;;AAI7B,WAAS,YAAY,QAAQA,QAAO;AAClC,QAAI,OAAO,WAAWA,MAAK;AAC3B,QAAI,MAAM;AACR,MAAA2E,WAAU,QAAQ3E,MAAK;AACvB,UAAIA,OAAM,cAAc,GAAG;AACzB,QAAAA,OAAM,WAAW;AACjB,eAAO,KAAK,QAAQ;AACpB,YAAIA,OAAM,aAAa;AAGrB,cAAI,SAAS,OAAO;AACpB,cAAI,CAAC,UAAU,OAAO,eAAe,OAAO,YAAY;AACtD,mBAAO,QAAO;;;;;AAKtB,WAAO;;AAET,WAAS,YAAY,QAAQA,QAAO,IAAI;AACtC,IAAAA,OAAM,SAAS;AACf,gBAAY,QAAQA,MAAK;AACzB,QAAI,IAAI;AACN,UAAIA,OAAM,SAAU,SAAQ,SAAS,EAAE;UAAO,QAAO,KAAK,UAAU,EAAE;;AAExE,IAAAA,OAAM,QAAQ;AACd,WAAO,WAAW;;AAEpB,WAAS,eAAe,SAASA,QAAO,KAAK;AAC3C,QAAI,QAAQ,QAAQ;AACpB,YAAQ,QAAQ;AAChB,WAAO,OAAO;AACZ,UAAI,KAAK,MAAM;AACf,MAAAA,OAAM;AACN,SAAG,GAAG;AACN,cAAQ,MAAM;;AAIhB,IAAAA,OAAM,mBAAmB,OAAO;;AAElC,SAAO,eAAe,SAAS,WAAW,aAAa;;;;IAIrD,YAAY;IACZ,KAAK,SAASyE,OAAM;AAClB,UAAI,KAAK,mBAAmB,QAAW;AACrC,eAAO;;AAET,aAAO,KAAK,eAAe;;IAE7B,KAAK,SAAS,IAAI,OAAO;AAGvB,UAAI,CAAC,KAAK,gBAAgB;AACxB;;AAKF,WAAK,eAAe,YAAY;;EAEpC,CAAC;AACD,WAAS,UAAU,UAAU,YAAY;AACzC,WAAS,UAAU,aAAa,YAAY;AAC5C,WAAS,UAAU,WAAW,SAAU,KAAK,IAAI;AAC/C,OAAG,GAAG;;;;;;;;;AClmBR,MAAI,aAAa,OAAO,QAAQ,SAAU7H,MAAK;AAC7C,QAAIyG,QAAO,CAAA;AACX,aAASnF,QAAOtB,KAAK,CAAAyG,MAAK,KAAKnF,IAAG;AAClC,WAAOmF;EACT;AAGcuB,qBAAGR;AACjB,MAAI,WAAW/H,0BAAA;AACf,MAAI,WAAWE,0BAAA;AACf2D,0BAAoBkE,SAAQ,QAAQ;AACpC;AAEE,QAAIf,QAAO,WAAW,SAAS,SAAS;AACxC,aAAS,IAAI,GAAG,IAAIA,MAAK,QAAQ,KAAK;AACpC,UAAI,SAASA,MAAK,CAAC;AACnB,UAAI,CAACe,QAAO,UAAU,MAAM,EAAG,CAAAA,QAAO,UAAU,MAAM,IAAI,SAAS,UAAU,MAAM;;;AAGvF,WAASA,QAAO,SAAS;AACvB,QAAI,EAAE,gBAAgBA,SAAS,QAAO,IAAIA,QAAO,OAAO;AACxD,aAAS,KAAK,MAAM,OAAO;AAC3B,aAAS,KAAK,MAAM,OAAO;AAC3B,SAAK,gBAAgB;AACrB,QAAI,SAAS;AACX,UAAI,QAAQ,aAAa,MAAO,MAAK,WAAW;AAChD,UAAI,QAAQ,aAAa,MAAO,MAAK,WAAW;AAChD,UAAI,QAAQ,kBAAkB,OAAO;AACnC,aAAK,gBAAgB;AACrB,aAAK,KAAK,OAAO,KAAK;;;;AAI5B,SAAO,eAAeA,QAAO,WAAW,yBAAyB;;;;IAI/D,YAAY;IACZ,KAAK,SAASK,OAAM;AAClB,aAAO,KAAK,eAAe;;EAE/B,CAAC;AACD,SAAO,eAAeL,QAAO,WAAW,kBAAkB;;;;IAIxD,YAAY;IACZ,KAAK,SAASK,OAAM;AAClB,aAAO,KAAK,kBAAkB,KAAK,eAAe,UAAS;;EAE/D,CAAC;AACD,SAAO,eAAeL,QAAO,WAAW,kBAAkB;;;;IAIxD,YAAY;IACZ,KAAK,SAASK,OAAM;AAClB,aAAO,KAAK,eAAe;;EAE/B,CAAC;AAGD,WAAS,QAAQ;AAEf,QAAI,KAAK,eAAe,MAAO;AAI/B,YAAQ,SAAS,SAAS,IAAI;;AAEhC,WAAS,QAAQtF,OAAM;AACrB,IAAAA,MAAK,IAAG;;AAEV,SAAO,eAAeiF,QAAO,WAAW,aAAa;;;;IAInD,YAAY;IACZ,KAAK,SAASK,OAAM;AAClB,UAAI,KAAK,mBAAmB,UAAa,KAAK,mBAAmB,QAAW;AAC1E,eAAO;;AAET,aAAO,KAAK,eAAe,aAAa,KAAK,eAAe;;IAE9D,KAAK,SAAS,IAAI,OAAO;AAGvB,UAAI,KAAK,mBAAmB,UAAa,KAAK,mBAAmB,QAAW;AAC1E;;AAKF,WAAK,eAAe,YAAY;AAChC,WAAK,eAAe,YAAY;;EAEpC,CAAC;;;;ACpGD,IAAIjI,WAASH,oBAAuB;AAGpC,IAAI,aAAaG,SAAO,cAAc,SAAU,UAAU;AACxD,aAAW,KAAK;AAChB,UAAQ,YAAY,SAAS,YAAW,GAAE;IACxC,KAAK;IAAM,KAAK;IAAO,KAAK;IAAQ,KAAK;IAAQ,KAAK;IAAS,KAAK;IAAS,KAAK;IAAO,KAAK;IAAQ,KAAK;IAAU,KAAK;IAAW,KAAK;AACxI,aAAO;IACT;AACE,aAAO;EACb;AACA;AAEA,SAAS,mBAAmB,KAAK;AAC/B,MAAI,CAAC,IAAK,QAAO;AACjB,MAAI;AACJ,SAAO,MAAM;AACX,YAAQ,KAAG;MACT,KAAK;MACL,KAAK;AACH,eAAO;MACT,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO;MACT,KAAK;MACL,KAAK;AACH,eAAO;MACT,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO;MACT;AACE,YAAI,QAAS;AACb,eAAO,KAAK,KAAK,YAAW;AAC5B,kBAAU;IAClB;EACA;AACA;AAIA,SAAS,kBAAkB,KAAK;AAC9B,MAAI,OAAO,mBAAmB,GAAG;AACjC,MAAI,OAAO,SAAS,aAAaA,SAAO,eAAe,cAAc,CAAC,WAAW,GAAG,GAAI,OAAM,IAAI,MAAM,uBAAuB,GAAG;AAClI,SAAO,QAAQ;AACjB;AAKqBqI,iBAAA,gBAAGC;AACxB,SAASA,gBAAc,UAAU;AAC/B,OAAK,WAAW,kBAAkB,QAAQ;AAC1C,MAAI;AACJ,UAAQ,KAAK,UAAQ;IACnB,KAAK;AACH,WAAK,OAAO;AACZ,WAAK,MAAM;AACX,WAAK;AACL;IACF,KAAK;AACH,WAAK,WAAW;AAChB,WAAK;AACL;IACF,KAAK;AACH,WAAK,OAAO;AACZ,WAAK,MAAM;AACX,WAAK;AACL;IACF;AACE,WAAK,QAAQ;AACb,WAAK,MAAM;AACX;EACN;AACE,OAAK,WAAW;AAChB,OAAK,YAAY;AACjB,OAAK,WAAWtI,SAAO,YAAY,EAAE;AACvC;AAEAsI,gBAAc,UAAU,QAAQ,SAAU,KAAK;AAC7C,MAAI,IAAI,WAAW,EAAG,QAAO;AAC7B,MAAIpG;AACJ,MAAI;AACJ,MAAI,KAAK,UAAU;AACjB,IAAAA,KAAI,KAAK,SAAS,GAAG;AACrB,QAAIA,OAAM,OAAW,QAAO;AAC5B,QAAI,KAAK;AACT,SAAK,WAAW;EACpB,OAAS;AACL,QAAI;EACR;AACE,MAAI,IAAI,IAAI,OAAQ,QAAOA,KAAIA,KAAI,KAAK,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,KAAK,CAAC;AACvE,SAAOA,MAAK;AACd;AAEAoG,gBAAc,UAAU,MAAM;AAG9BA,gBAAc,UAAU,OAAO;AAG/BA,gBAAc,UAAU,WAAW,SAAU,KAAK;AAChD,MAAI,KAAK,YAAY,IAAI,QAAQ;AAC/B,QAAI,KAAK,KAAK,UAAU,KAAK,YAAY,KAAK,UAAU,GAAG,KAAK,QAAQ;AACxE,WAAO,KAAK,SAAS,SAAS,KAAK,UAAU,GAAG,KAAK,SAAS;EAClE;AACE,MAAI,KAAK,KAAK,UAAU,KAAK,YAAY,KAAK,UAAU,GAAG,IAAI,MAAM;AACrE,OAAK,YAAY,IAAI;AACvB;AAIA,SAAS,cAAc,MAAM;AAC3B,MAAI,QAAQ,IAAM,QAAO;WAAW,QAAQ,MAAM,EAAM,QAAO;WAAW,QAAQ,MAAM,GAAM,QAAO;WAAW,QAAQ,MAAM,GAAM,QAAO;AAC3I,SAAO,QAAQ,MAAM,IAAO,KAAK;AACnC;AAKA,SAAS,oBAAoB3F,OAAM,KAAK,GAAG;AACzC,MAAI,IAAI,IAAI,SAAS;AACrB,MAAI,IAAI,EAAG,QAAO;AAClB,MAAI,KAAK,cAAc,IAAI,CAAC,CAAC;AAC7B,MAAI,MAAM,GAAG;AACX,QAAI,KAAK,EAAG,CAAAA,MAAK,WAAW,KAAK;AACjC,WAAO;EACX;AACE,MAAI,EAAE,IAAI,KAAK,OAAO,GAAI,QAAO;AACjC,OAAK,cAAc,IAAI,CAAC,CAAC;AACzB,MAAI,MAAM,GAAG;AACX,QAAI,KAAK,EAAG,CAAAA,MAAK,WAAW,KAAK;AACjC,WAAO;EACX;AACE,MAAI,EAAE,IAAI,KAAK,OAAO,GAAI,QAAO;AACjC,OAAK,cAAc,IAAI,CAAC,CAAC;AACzB,MAAI,MAAM,GAAG;AACX,QAAI,KAAK,GAAG;AACV,UAAI,OAAO,EAAG,MAAK;UAAO,CAAAA,MAAK,WAAW,KAAK;IACrD;AACI,WAAO;EACX;AACE,SAAO;AACT;AAUA,SAAS,oBAAoBA,OAAM,KAAK,GAAG;AACzC,OAAK,IAAI,CAAC,IAAI,SAAU,KAAM;AAC5B,IAAAA,MAAK,WAAW;AAChB,WAAO;EACX;AACE,MAAIA,MAAK,WAAW,KAAK,IAAI,SAAS,GAAG;AACvC,SAAK,IAAI,CAAC,IAAI,SAAU,KAAM;AAC5B,MAAAA,MAAK,WAAW;AAChB,aAAO;IACb;AACI,QAAIA,MAAK,WAAW,KAAK,IAAI,SAAS,GAAG;AACvC,WAAK,IAAI,CAAC,IAAI,SAAU,KAAM;AAC5B,QAAAA,MAAK,WAAW;AAChB,eAAO;MACf;IACA;EACA;AACA;AAGA,SAAS,aAAa,KAAK;AACzB,MAAI,IAAI,KAAK,YAAY,KAAK;AAC9B,MAAIT,KAAI,oBAAoB,MAAM,GAAM;AACxC,MAAIA,OAAM,OAAW,QAAOA;AAC5B,MAAI,KAAK,YAAY,IAAI,QAAQ;AAC/B,QAAI,KAAK,KAAK,UAAU,GAAG,GAAG,KAAK,QAAQ;AAC3C,WAAO,KAAK,SAAS,SAAS,KAAK,UAAU,GAAG,KAAK,SAAS;EAClE;AACE,MAAI,KAAK,KAAK,UAAU,GAAG,GAAG,IAAI,MAAM;AACxC,OAAK,YAAY,IAAI;AACvB;AAKA,SAAS,SAAS,KAAK,GAAG;AACxB,MAAI,QAAQ,oBAAoB,MAAM,KAAK,CAAC;AAC5C,MAAI,CAAC,KAAK,SAAU,QAAO,IAAI,SAAS,QAAQ,CAAC;AACjD,OAAK,YAAY;AACjB,MAAI,MAAM,IAAI,UAAU,QAAQ,KAAK;AACrC,MAAI,KAAK,KAAK,UAAU,GAAG,GAAG;AAC9B,SAAO,IAAI,SAAS,QAAQ,GAAG,GAAG;AACpC;AAIA,SAAS,QAAQ,KAAK;AACpB,MAAIA,KAAI,OAAO,IAAI,SAAS,KAAK,MAAM,GAAG,IAAI;AAC9C,MAAI,KAAK,SAAU,QAAOA,KAAI;AAC9B,SAAOA;AACT;AAMA,SAAS,UAAU,KAAK,GAAG;AACzB,OAAK,IAAI,SAAS,KAAK,MAAM,GAAG;AAC9B,QAAIA,KAAI,IAAI,SAAS,WAAW,CAAC;AACjC,QAAIA,IAAG;AACL,UAAI,IAAIA,GAAE,WAAWA,GAAE,SAAS,CAAC;AACjC,UAAI,KAAK,SAAU,KAAK,OAAQ;AAC9B,aAAK,WAAW;AAChB,aAAK,YAAY;AACjB,aAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;AACrC,aAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;AACrC,eAAOA,GAAE,MAAM,GAAG,EAAE;MAC5B;IACA;AACI,WAAOA;EACX;AACE,OAAK,WAAW;AAChB,OAAK,YAAY;AACjB,OAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;AACrC,SAAO,IAAI,SAAS,WAAW,GAAG,IAAI,SAAS,CAAC;AAClD;AAIA,SAAS,SAAS,KAAK;AACrB,MAAIA,KAAI,OAAO,IAAI,SAAS,KAAK,MAAM,GAAG,IAAI;AAC9C,MAAI,KAAK,UAAU;AACjB,QAAI,MAAM,KAAK,YAAY,KAAK;AAChC,WAAOA,KAAI,KAAK,SAAS,SAAS,WAAW,GAAG,GAAG;EACvD;AACE,SAAOA;AACT;AAEA,SAAS,WAAW,KAAK,GAAG;AAC1B,MAAI,KAAK,IAAI,SAAS,KAAK;AAC3B,MAAI,MAAM,EAAG,QAAO,IAAI,SAAS,UAAU,CAAC;AAC5C,OAAK,WAAW,IAAI;AACpB,OAAK,YAAY;AACjB,MAAI,MAAM,GAAG;AACX,SAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;EACzC,OAAS;AACL,SAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;AACrC,SAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;EACzC;AACE,SAAO,IAAI,SAAS,UAAU,GAAG,IAAI,SAAS,CAAC;AACjD;AAEA,SAAS,UAAU,KAAK;AACtB,MAAIA,KAAI,OAAO,IAAI,SAAS,KAAK,MAAM,GAAG,IAAI;AAC9C,MAAI,KAAK,SAAU,QAAOA,KAAI,KAAK,SAAS,SAAS,UAAU,GAAG,IAAI,KAAK,QAAQ;AACnF,SAAOA;AACT;AAGA,SAAS,YAAY,KAAK;AACxB,SAAO,IAAI,SAAS,KAAK,QAAQ;AACnC;AAEA,SAAS,UAAU,KAAK;AACtB,SAAO,OAAO,IAAI,SAAS,KAAK,MAAM,GAAG,IAAI;AAC/C;;;;;;AClSA,MAAI,6BAA6BrC,qBAAA,EAA2B,MAAM;AAClE,WAAS6G,MAAK,UAAU;AACtB,QAAI,SAAS;AACb,WAAO,WAAY;AACjB,UAAI,OAAQ;AACZ,eAAS;AACT,eAAS,OAAO,UAAU,QAAQ,OAAO,IAAI,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AACvF,aAAK,IAAI,IAAI,UAAU,IAAI;;AAE7B,eAAS,MAAM,MAAM,IAAI;IAC7B;;AAEA,WAAS,OAAO;EAAA;AAChB,WAAS,UAAU,QAAQ;AACzB,WAAO,OAAO,aAAa,OAAO,OAAO,UAAU;;AAErD,WAAS,IAAI,QAAQ,MAAM,UAAU;AACnC,QAAI,OAAO,SAAS,WAAY,QAAO,IAAI,QAAQ,MAAM,IAAI;AAC7D,QAAI,CAAC,KAAM,QAAO,CAAA;AAClB,eAAWA,MAAK,YAAY,IAAI;AAChC,QAAI,WAAW,KAAK,YAAY,KAAK,aAAa,SAAS,OAAO;AAClE,QAAI,WAAW,KAAK,YAAY,KAAK,aAAa,SAAS,OAAO;AAClE,QAAI,iBAAiB,SAAS6B,kBAAiB;AAC7C,UAAI,CAAC,OAAO,SAAU,UAAQ;IAClC;AACE,QAAI,gBAAgB,OAAO,kBAAkB,OAAO,eAAe;AACnE,QAAI,WAAW,SAASC,YAAW;AACjC,iBAAW;AACX,sBAAgB;AAChB,UAAI,CAAC,SAAU,UAAS,KAAK,MAAM;IACvC;AACE,QAAI,gBAAgB,OAAO,kBAAkB,OAAO,eAAe;AACnE,QAAI,QAAQ,SAASC,SAAQ;AAC3B,iBAAW;AACX,sBAAgB;AAChB,UAAI,CAAC,SAAU,UAAS,KAAK,MAAM;IACvC;AACE,QAAI,UAAU,SAASC,SAAQ,KAAK;AAClC,eAAS,KAAK,QAAQ,GAAG;IAC7B;AACE,QAAI,UAAU,SAASC,WAAU;AAC/B,UAAI;AACJ,UAAI,YAAY,CAAC,eAAe;AAC9B,YAAI,CAAC,OAAO,kBAAkB,CAAC,OAAO,eAAe,MAAO,OAAM,IAAI,2BAA0B;AAChG,eAAO,SAAS,KAAK,QAAQ,GAAG;;AAElC,UAAI,YAAY,CAAC,eAAe;AAC9B,YAAI,CAAC,OAAO,kBAAkB,CAAC,OAAO,eAAe,MAAO,OAAM,IAAI,2BAA0B;AAChG,eAAO,SAAS,KAAK,QAAQ,GAAG;;IAEtC;AACE,QAAI,YAAY,SAASC,aAAY;AACnC,aAAO,IAAI,GAAG,UAAU,QAAQ;IACpC;AACE,QAAI,UAAU,MAAM,GAAG;AACrB,aAAO,GAAG,YAAY,QAAQ;AAC9B,aAAO,GAAG,SAAS,OAAO;AAC1B,UAAI,OAAO,IAAK,WAAS;UAAQ,QAAO,GAAG,WAAW,SAAS;eACtD,YAAY,CAAC,OAAO,gBAAgB;AAE7C,aAAO,GAAG,OAAO,cAAc;AAC/B,aAAO,GAAG,SAAS,cAAc;;AAEnC,WAAO,GAAG,OAAO,KAAK;AACtB,WAAO,GAAG,UAAU,QAAQ;AAC5B,QAAI,KAAK,UAAU,MAAO,QAAO,GAAG,SAAS,OAAO;AACpD,WAAO,GAAG,SAAS,OAAO;AAC1B,WAAO,WAAY;AACjB,aAAO,eAAe,YAAY,QAAQ;AAC1C,aAAO,eAAe,SAAS,OAAO;AACtC,aAAO,eAAe,WAAW,SAAS;AAC1C,UAAI,OAAO,IAAK,QAAO,IAAI,eAAe,UAAU,QAAQ;AAC5D,aAAO,eAAe,OAAO,cAAc;AAC3C,aAAO,eAAe,SAAS,cAAc;AAC7C,aAAO,eAAe,UAAU,QAAQ;AACxC,aAAO,eAAe,OAAO,KAAK;AAClC,aAAO,eAAe,SAAS,OAAO;AACtC,aAAO,eAAe,SAAS,OAAO;IAC1C;;AAEA,gBAAiB;;;;;;;;ACnFjB,MAAI;AACJ,WAAS5B,iBAAgB5G,MAAKsB,MAAK,OAAO;AAAE,IAAAA,OAAM,eAAeA,IAAG;AAAG,QAAIA,QAAOtB,MAAK;AAAE,aAAO,eAAeA,MAAKsB,MAAK,EAAE,OAAc,YAAY,MAAM,cAAc,MAAM,UAAU,KAAI,CAAE;IAAE,OAAQ;AAAE,MAAAtB,KAAIsB,IAAG,IAAI;IAAM;AAAG,WAAOtB;EAAI;AAC1O,WAAS,eAAe,KAAK;AAAE,QAAIsB,OAAM,aAAa,KAAK,QAAQ;AAAG,WAAO,OAAOA,SAAQ,WAAWA,OAAM,OAAOA,IAAG;EAAE;AACzH,WAAS,aAAa,OAAO,MAAM;AAAE,QAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AAAO,QAAI,OAAO,MAAM,OAAO,WAAW;AAAG,QAAI,SAAS,QAAW;AAAE,UAAI,MAAM,KAAK,KAAK,OAAO,QAAQ,SAAS;AAAG,UAAI,OAAO,QAAQ,SAAU,QAAO;AAAK,YAAM,IAAI,UAAU,8CAA8C;IAAE;AAAG,YAAQ,SAAS,WAAW,SAAS,QAAQ,KAAK;EAAE;AACvX,MAAI,WAAW7B,mBAAA;AACf,MAAI,eAAe,uBAAO,aAAa;AACvC,MAAI,cAAc,uBAAO,YAAY;AACrC,MAAI,SAAS,uBAAO,OAAO;AAC3B,MAAI,SAAS,uBAAO,OAAO;AAC3B,MAAI,eAAe,uBAAO,aAAa;AACvC,MAAI,iBAAiB,uBAAO,eAAe;AAC3C,MAAI,UAAU,uBAAO,QAAQ;AAC7B,WAAS,iBAAiB,OAAOgJ,OAAM;AACrC,WAAO;MACL;MACA,MAAMA;IACV;;AAEA,WAAS,eAAe,MAAM;AAC5B,QAAI/B,WAAU,KAAK,YAAY;AAC/B,QAAIA,aAAY,MAAM;AACpB,UAAI,OAAO,KAAK,OAAO,EAAE,KAAI;AAI7B,UAAI,SAAS,MAAM;AACjB,aAAK,YAAY,IAAI;AACrB,aAAK,YAAY,IAAI;AACrB,aAAK,WAAW,IAAI;AACpB,QAAAA,SAAQ,iBAAiB,MAAM,KAAK,CAAC;;;;AAI3C,WAAS,WAAW,MAAM;AAGxB,YAAQ,SAAS,gBAAgB,IAAI;;AAEvC,WAAS,YAAY,aAAa,MAAM;AACtC,WAAO,SAAUA,UAAS,QAAQ;AAChC,kBAAY,KAAK,WAAY;AAC3B,YAAI,KAAK,MAAM,GAAG;AAChB,UAAAA,SAAQ,iBAAiB,QAAW,IAAI,CAAC;AACzC;;AAEF,aAAK,cAAc,EAAEA,UAAS,MAAM;SACnC,MAAM;IACb;;AAEA,MAAI,yBAAyB,OAAO,eAAe,WAAY;EAAA,CAAE;AACjE,MAAI,uCAAuC,OAAO,gBAAgB,wBAAwB;IACxF,IAAI,SAAS;AACX,aAAO,KAAK,OAAO;;IAErB,MAAM,SAAS,OAAO;AACpB,UAAI,QAAQ;AAGZ,UAAIf,SAAQ,KAAK,MAAM;AACvB,UAAIA,WAAU,MAAM;AAClB,eAAO,QAAQ,OAAOA,MAAK;;AAE7B,UAAI,KAAK,MAAM,GAAG;AAChB,eAAO,QAAQ,QAAQ,iBAAiB,QAAW,IAAI,CAAC;;AAE1D,UAAI,KAAK,OAAO,EAAE,WAAW;AAK3B,eAAO,IAAI,QAAQ,SAAUe,UAAS,QAAQ;AAC5C,kBAAQ,SAAS,WAAY;AAC3B,gBAAI,MAAM,MAAM,GAAG;AACjB,qBAAO,MAAM,MAAM,CAAC;YAChC,OAAiB;AACL,cAAAA,SAAQ,iBAAiB,QAAW,IAAI,CAAC;;UAErD,CAAS;QACT,CAAO;;AAOH,UAAI,cAAc,KAAK,YAAY;AACnC,UAAI;AACJ,UAAI,aAAa;AACf,kBAAU,IAAI,QAAQ,YAAY,aAAa,IAAI,CAAC;MAC1D,OAAW;AAGL,YAAI,OAAO,KAAK,OAAO,EAAE,KAAI;AAC7B,YAAI,SAAS,MAAM;AACjB,iBAAO,QAAQ,QAAQ,iBAAiB,MAAM,KAAK,CAAC;;AAEtD,kBAAU,IAAI,QAAQ,KAAK,cAAc,CAAC;;AAE5C,WAAK,YAAY,IAAI;AACrB,aAAO;;KAERE,iBAAgB,uBAAuB,OAAO,eAAe,WAAY;AAC1E,WAAO;GACR,GAAGA,iBAAgB,uBAAuB,UAAU,SAAS,UAAU;AACtE,QAAI,SAAS;AAIb,WAAO,IAAI,QAAQ,SAAUF,UAAS,QAAQ;AAC5C,aAAO,OAAO,EAAE,QAAQ,MAAM,SAAU,KAAK;AAC3C,YAAI,KAAK;AACP,iBAAO,GAAG;AACV;;AAEF,QAAAA,SAAQ,iBAAiB,QAAW,IAAI,CAAC;MAC/C,CAAK;IACL,CAAG;EACH,CAAC,GAAG,wBAAwB,sBAAsB;AAClD,MAAI,oCAAoC,SAASgC,mCAAkC,QAAQ;AACzF,QAAI;AACJ,QAAI,WAAW,OAAO,OAAO,uCAAuC,iBAAiB,CAAA,GAAI9B,iBAAgB,gBAAgB,SAAS;MAChI,OAAO;MACP,UAAU;IACd,CAAG,GAAGA,iBAAgB,gBAAgB,cAAc;MAChD,OAAO;MACP,UAAU;IACd,CAAG,GAAGA,iBAAgB,gBAAgB,aAAa;MAC/C,OAAO;MACP,UAAU;IACd,CAAG,GAAGA,iBAAgB,gBAAgB,QAAQ;MAC1C,OAAO;MACP,UAAU;IACd,CAAG,GAAGA,iBAAgB,gBAAgB,QAAQ;MAC1C,OAAO,OAAO,eAAe;MAC7B,UAAU;IACd,CAAG,GAAGA,iBAAgB,gBAAgB,gBAAgB;MAClD,OAAO,SAAS,MAAMF,UAAS,QAAQ;AACrC,YAAI,OAAO,SAAS,OAAO,EAAE,KAAI;AACjC,YAAI,MAAM;AACR,mBAAS,YAAY,IAAI;AACzB,mBAAS,YAAY,IAAI;AACzB,mBAAS,WAAW,IAAI;AACxB,UAAAA,SAAQ,iBAAiB,MAAM,KAAK,CAAC;QAC7C,OAAa;AACL,mBAAS,YAAY,IAAIA;AACzB,mBAAS,WAAW,IAAI;;;MAG5B,UAAU;IACd,CAAG,GAAG,eAAc;AAClB,aAAS,YAAY,IAAI;AACzB,aAAS,QAAQ,SAAU,KAAK;AAC9B,UAAI,OAAO,IAAI,SAAS,8BAA8B;AACpD,YAAI,SAAS,SAAS,WAAW;AAGjC,YAAI,WAAW,MAAM;AACnB,mBAAS,YAAY,IAAI;AACzB,mBAAS,YAAY,IAAI;AACzB,mBAAS,WAAW,IAAI;AACxB,iBAAO,GAAG;;AAEZ,iBAAS,MAAM,IAAI;AACnB;;AAEF,UAAIA,WAAU,SAAS,YAAY;AACnC,UAAIA,aAAY,MAAM;AACpB,iBAAS,YAAY,IAAI;AACzB,iBAAS,YAAY,IAAI;AACzB,iBAAS,WAAW,IAAI;AACxB,QAAAA,SAAQ,iBAAiB,QAAW,IAAI,CAAC;;AAE3C,eAAS,MAAM,IAAI;IACvB,CAAG;AACD,WAAO,GAAG,YAAY,WAAW,KAAK,MAAM,QAAQ,CAAC;AACrD,WAAO;EACT;AACA,mBAAiB;;;;;;;;ACnLjB,gBAAiB,WAAY;AAC3B,UAAM,IAAI,MAAM,+CAA+C;;;;;;;;;ACsBnDiC,uBAAG;AAGjB,MAAInB;AAGJ,WAAS,gBAAgB;AAGhB/H,gBAAkB;AAC3B,MAAI,kBAAkB,SAASmJ,iBAAgB,SAASzH,OAAM;AAC5D,WAAO,QAAQ,UAAUA,KAAI,EAAE;EACjC;AAIA,MAAIsG,UAAS9H,qBAAA;AAGb,MAAIC,UAAS0D,SAAkB;AAC/B,MAAI,iBAAiB,OAAOwC,mBAAW,cAAcA,iBAAS,OAAO,WAAW,cAAc,SAAS,OAAO,SAAS,cAAc,OAAO,CAAA,GAAI,cAAc,WAAY;EAAA;AAC1K,WAAS,oBAAoB,OAAO;AAClC,WAAOlG,QAAO,KAAK,KAAK;;AAE1B,WAAS,cAAcI,MAAK;AAC1B,WAAOJ,QAAO,SAASI,IAAG,KAAKA,gBAAe;;AAIhD,MAAI,YAAYgE;AAChB,MAAI6E;AACJ,MAAI,aAAa,UAAU,UAAU;AACnC,IAAAA,SAAQ,UAAU,SAAS,QAAQ;EACrC,OAAO;AACL,IAAAA,SAAQ,SAASA,SAAQ;IAAA;;AAI3B,MAAI/B,cAAa3C,mBAAA;AACjB,MAAI,cAAciB,eAAA;AAClB,MAAI,WAAWsC,aAAmC,GAChD,mBAAmB,SAAS;AAC9B,MAAI,iBAAiBC,qBAAoB,EAAC,OACxC,uBAAuB,eAAe,sBACtC,4BAA4B,eAAe,2BAC3C,6BAA6B,eAAe,4BAC5C,qCAAqC,eAAe;AAGtD,MAAIO;AACJ,MAAI;AACJ,MAAI;AACJY,0BAAoB,UAAUrB,OAAM;AACpC,MAAI,iBAAiB,YAAY;AACjC,MAAI,eAAe,CAAC,SAAS,SAAS,WAAW,SAAS,QAAQ;AAClE,WAASsB,iBAAgB,SAAS,OAAO,IAAI;AAG3C,QAAI,OAAO,QAAQ,oBAAoB,WAAY,QAAO,QAAQ,gBAAgB,OAAO,EAAE;AAM3F,QAAI,CAAC,QAAQ,WAAW,CAAC,QAAQ,QAAQ,KAAK,EAAG,SAAQ,GAAG,OAAO,EAAE;aAAW,MAAM,QAAQ,QAAQ,QAAQ,KAAK,CAAC,EAAG,SAAQ,QAAQ,KAAK,EAAE,QAAQ,EAAE;QAAO,SAAQ,QAAQ,KAAK,IAAI,CAAC,IAAI,QAAQ,QAAQ,KAAK,CAAC;;AAErN,WAAS,cAAc,SAAS,QAAQ,UAAU;AAChD,IAAAvB,UAASA,WAAUwB,wBAAAA;AACnB,cAAU,WAAW,CAAA;AAOrB,QAAI,OAAO,aAAa,UAAW,YAAW,kBAAkBxB;AAIhE,SAAK,aAAa,CAAC,CAAC,QAAQ;AAC5B,QAAI,SAAU,MAAK,aAAa,KAAK,cAAc,CAAC,CAAC,QAAQ;AAI7D,SAAK,gBAAgB,iBAAiB,MAAM,SAAS,yBAAyB,QAAQ;AAKtF,SAAK,SAAS,IAAIV,YAAU;AAC5B,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,SAAK,UAAU;AACf,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,SAAK,UAAU;AAMf,SAAK,OAAO;AAIZ,SAAK,eAAe;AACpB,SAAK,kBAAkB;AACvB,SAAK,oBAAoB;AACzB,SAAK,kBAAkB;AACvB,SAAK,SAAS;AAGd,SAAK,YAAY,QAAQ,cAAc;AAGvC,SAAK,cAAc,CAAC,CAAC,QAAQ;AAG7B,SAAK,YAAY;AAKjB,SAAK,kBAAkB,QAAQ,mBAAmB;AAGlD,SAAK,aAAa;AAGlB,SAAK,cAAc;AACnB,SAAK,UAAU;AACf,SAAK,WAAW;AAChB,QAAI,QAAQ,UAAU;AACpB,UAAI,CAACoB,eAAe,CAAAA,iBAAgBe,iBAA2B;AAC/D,WAAK,UAAU,IAAIf,eAAc,QAAQ,QAAQ;AACjD,WAAK,WAAW,QAAQ;;;AAG5B,WAAS,SAAS,SAAS;AACzB,IAAAV,UAASA,WAAUwB,wBAAAA;AACnB,QAAI,EAAE,gBAAgB,UAAW,QAAO,IAAI,SAAS,OAAO;AAI5D,QAAI,WAAW,gBAAgBxB;AAC/B,SAAK,iBAAiB,IAAI,cAAc,SAAS,MAAM,QAAQ;AAG/D,SAAK,WAAW;AAChB,QAAI,SAAS;AACX,UAAI,OAAO,QAAQ,SAAS,WAAY,MAAK,QAAQ,QAAQ;AAC7D,UAAI,OAAO,QAAQ,YAAY,WAAY,MAAK,WAAW,QAAQ;;AAErE,IAAAC,QAAO,KAAK,IAAI;;AAElB,SAAO,eAAe,SAAS,WAAW,aAAa;;;;IAIrD,YAAY;IACZ,KAAK,SAASI,OAAM;AAClB,UAAI,KAAK,mBAAmB,QAAW;AACrC,eAAO;;AAET,aAAO,KAAK,eAAe;;IAE7B,KAAK,SAAS,IAAI,OAAO;AAGvB,UAAI,CAAC,KAAK,gBAAgB;AACxB;;AAKF,WAAK,eAAe,YAAY;;EAEpC,CAAC;AACD,WAAS,UAAU,UAAU,YAAY;AACzC,WAAS,UAAU,aAAa,YAAY;AAC5C,WAAS,UAAU,WAAW,SAAU,KAAK,IAAI;AAC/C,OAAG,GAAG;EACR;AAMA,WAAS,UAAU,OAAO,SAAU,OAAO,UAAU;AACnD,QAAIzE,SAAQ,KAAK;AACjB,QAAI;AACJ,QAAI,CAACA,OAAM,YAAY;AACrB,UAAI,OAAO,UAAU,UAAU;AAC7B,mBAAW,YAAYA,OAAM;AAC7B,YAAI,aAAaA,OAAM,UAAU;AAC/B,kBAAQxD,QAAO,KAAK,OAAO,QAAQ;AACnC,qBAAW;;AAEb,yBAAiB;;IAEvB,OAAS;AACL,uBAAiB;;AAEnB,WAAO,iBAAiB,MAAM,OAAO,UAAU,OAAO,cAAc;EACtE;AAGA,WAAS,UAAU,UAAU,SAAU,OAAO;AAC5C,WAAO,iBAAiB,MAAM,OAAO,MAAM,MAAM,KAAK;EACxD;AACA,WAAS,iBAAiB,QAAQ,OAAO,UAAU,YAAY,gBAAgB;AAC7E,IAAAiJ,OAAM,oBAAoB,KAAK;AAC/B,QAAIzF,SAAQ,OAAO;AACnB,QAAI,UAAU,MAAM;AAClB,MAAAA,OAAM,UAAU;AAChB,iBAAW,QAAQA,MAAK;IAC5B,OAAS;AACL,UAAI;AACJ,UAAI,CAAC,eAAgB,MAAK,aAAaA,QAAO,KAAK;AACnD,UAAI,IAAI;AACN,uBAAe,QAAQ,EAAE;MAC/B,WAAeA,OAAM,cAAc,SAAS,MAAM,SAAS,GAAG;AACxD,YAAI,OAAO,UAAU,YAAY,CAACA,OAAM,cAAc,OAAO,eAAe,KAAK,MAAMxD,QAAO,WAAW;AACvG,kBAAQ,oBAAoB,KAAK;;AAEnC,YAAI,YAAY;AACd,cAAIwD,OAAM,WAAY,gBAAe,QAAQ,IAAI,mCAAkC,CAAE;cAAO,UAAS,QAAQA,QAAO,OAAO,IAAI;QACvI,WAAiBA,OAAM,OAAO;AACtB,yBAAe,QAAQ,IAAI,0BAAyB,CAAE;QAC9D,WAAiBA,OAAM,WAAW;AAC1B,iBAAO;QACf,OAAa;AACL,UAAAA,OAAM,UAAU;AAChB,cAAIA,OAAM,WAAW,CAAC,UAAU;AAC9B,oBAAQA,OAAM,QAAQ,MAAM,KAAK;AACjC,gBAAIA,OAAM,cAAc,MAAM,WAAW,EAAG,UAAS,QAAQA,QAAO,OAAO,KAAK;gBAAO,eAAc,QAAQA,MAAK;UAC5H,OAAe;AACL,qBAAS,QAAQA,QAAO,OAAO,KAAK;;;MAG9C,WAAe,CAAC,YAAY;AACtB,QAAAA,OAAM,UAAU;AAChB,sBAAc,QAAQA,MAAK;;;AAO/B,WAAO,CAACA,OAAM,UAAUA,OAAM,SAASA,OAAM,iBAAiBA,OAAM,WAAW;;AAEjF,WAAS,SAAS,QAAQA,QAAO,OAAO,YAAY;AAClD,QAAIA,OAAM,WAAWA,OAAM,WAAW,KAAK,CAACA,OAAM,MAAM;AACtD,MAAAA,OAAM,aAAa;AACnB,aAAO,KAAK,QAAQ,KAAK;IAC7B,OAAS;AAEL,MAAAA,OAAM,UAAUA,OAAM,aAAa,IAAI,MAAM;AAC7C,UAAI,WAAY,CAAAA,OAAM,OAAO,QAAQ,KAAK;UAAO,CAAAA,OAAM,OAAO,KAAK,KAAK;AACxE,UAAIA,OAAM,aAAc,cAAa,MAAM;;AAE7C,kBAAc,QAAQA,MAAK;;AAE7B,WAAS,aAAaA,QAAO,OAAO;AAClC,QAAI;AACJ,QAAI,CAAC,cAAc,KAAK,KAAK,OAAO,UAAU,YAAY,UAAU,UAAa,CAACA,OAAM,YAAY;AAClG,WAAK,IAAI,qBAAqB,SAAS,CAAC,UAAU,UAAU,YAAY,GAAG,KAAK;;AAElF,WAAO;;AAET,WAAS,UAAU,WAAW,WAAY;AACxC,WAAO,KAAK,eAAe,YAAY;EACzC;AAGA,WAAS,UAAU,cAAc,SAAU,KAAK;AAC9C,QAAI,CAAC8E,eAAe,CAAAA,iBAAgBe,iBAA2B;AAC/D,QAAI,UAAU,IAAIf,eAAc,GAAG;AACnC,SAAK,eAAe,UAAU;AAE9B,SAAK,eAAe,WAAW,KAAK,eAAe,QAAQ;AAG3D,QAAI,IAAI,KAAK,eAAe,OAAO;AACnC,QAAI,UAAU;AACd,WAAO,MAAM,MAAM;AACjB,iBAAW,QAAQ,MAAM,EAAE,IAAI;AAC/B,UAAI,EAAE;;AAER,SAAK,eAAe,OAAO,MAAK;AAChC,QAAI,YAAY,GAAI,MAAK,eAAe,OAAO,KAAK,OAAO;AAC3D,SAAK,eAAe,SAAS,QAAQ;AACrC,WAAO;EACT;AAGA,MAAI,UAAU;AACd,WAAS,wBAAwB,GAAG;AAClC,QAAI,KAAK,SAAS;AAEhB,UAAI;IACR,OAAS;AAGL;AACA,WAAK,MAAM;AACX,WAAK,MAAM;AACX,WAAK,MAAM;AACX,WAAK,MAAM;AACX,WAAK,MAAM;AACX;;AAEF,WAAO;;AAKT,WAAS,cAAc,GAAG9E,QAAO;AAC/B,QAAI,KAAK,KAAKA,OAAM,WAAW,KAAKA,OAAM,MAAO,QAAO;AACxD,QAAIA,OAAM,WAAY,QAAO;AAC7B,QAAI,MAAM,GAAG;AAEX,UAAIA,OAAM,WAAWA,OAAM,OAAQ,QAAOA,OAAM,OAAO,KAAK,KAAK;UAAY,QAAOA,OAAM;;AAG5F,QAAI,IAAIA,OAAM,cAAe,CAAAA,OAAM,gBAAgB,wBAAwB,CAAC;AAC5E,QAAI,KAAKA,OAAM,OAAQ,QAAO;AAE9B,QAAI,CAACA,OAAM,OAAO;AAChB,MAAAA,OAAM,eAAe;AACrB,aAAO;;AAET,WAAOA,OAAM;;AAIf,WAAS,UAAU,OAAO,SAAU,GAAG;AACrC,IAAAyF,OAAM,QAAQ,CAAC;AACf,QAAI,SAAS,GAAG,EAAE;AAClB,QAAIzF,SAAQ,KAAK;AACjB,QAAI,QAAQ;AACZ,QAAI,MAAM,EAAG,CAAAA,OAAM,kBAAkB;AAKrC,QAAI,MAAM,KAAKA,OAAM,kBAAkBA,OAAM,kBAAkB,IAAIA,OAAM,UAAUA,OAAM,gBAAgBA,OAAM,SAAS,MAAMA,OAAM,QAAQ;AAC1I,MAAAyF,OAAM,sBAAsBzF,OAAM,QAAQA,OAAM,KAAK;AACrD,UAAIA,OAAM,WAAW,KAAKA,OAAM,MAAO,aAAY,IAAI;UAAO,cAAa,IAAI;AAC/E,aAAO;;AAET,QAAI,cAAc,GAAGA,MAAK;AAG1B,QAAI,MAAM,KAAKA,OAAM,OAAO;AAC1B,UAAIA,OAAM,WAAW,EAAG,aAAY,IAAI;AACxC,aAAO;;AA0BT,QAAI,SAASA,OAAM;AACnB,IAAAyF,OAAM,iBAAiB,MAAM;AAG7B,QAAIzF,OAAM,WAAW,KAAKA,OAAM,SAAS,IAAIA,OAAM,eAAe;AAChE,eAAS;AACT,MAAAyF,OAAM,8BAA8B,MAAM;;AAK5C,QAAIzF,OAAM,SAASA,OAAM,SAAS;AAChC,eAAS;AACT,MAAAyF,OAAM,oBAAoB,MAAM;eACvB,QAAQ;AACjB,MAAAA,OAAM,SAAS;AACf,MAAAzF,OAAM,UAAU;AAChB,MAAAA,OAAM,OAAO;AAEb,UAAIA,OAAM,WAAW,EAAG,CAAAA,OAAM,eAAe;AAE7C,WAAK,MAAMA,OAAM,aAAa;AAC9B,MAAAA,OAAM,OAAO;AAGb,UAAI,CAACA,OAAM,QAAS,KAAI,cAAc,OAAOA,MAAK;;AAEpD,QAAI;AACJ,QAAI,IAAI,EAAG,OAAM,SAAS,GAAGA,MAAK;QAAO,OAAM;AAC/C,QAAI,QAAQ,MAAM;AAChB,MAAAA,OAAM,eAAeA,OAAM,UAAUA,OAAM;AAC3C,UAAI;IACR,OAAS;AACL,MAAAA,OAAM,UAAU;AAChB,MAAAA,OAAM,aAAa;;AAErB,QAAIA,OAAM,WAAW,GAAG;AAGtB,UAAI,CAACA,OAAM,MAAO,CAAAA,OAAM,eAAe;AAGvC,UAAI,UAAU,KAAKA,OAAM,MAAO,aAAY,IAAI;;AAElD,QAAI,QAAQ,KAAM,MAAK,KAAK,QAAQ,GAAG;AACvC,WAAO;EACT;AACA,WAAS,WAAW,QAAQA,QAAO;AACjC,IAAAyF,OAAM,YAAY;AAClB,QAAIzF,OAAM,MAAO;AACjB,QAAIA,OAAM,SAAS;AACjB,UAAI,QAAQA,OAAM,QAAQ,IAAG;AAC7B,UAAI,SAAS,MAAM,QAAQ;AACzB,QAAAA,OAAM,OAAO,KAAK,KAAK;AACvB,QAAAA,OAAM,UAAUA,OAAM,aAAa,IAAI,MAAM;;;AAGjD,IAAAA,OAAM,QAAQ;AACd,QAAIA,OAAM,MAAM;AAId,mBAAa,MAAM;IACvB,OAAS;AAEL,MAAAA,OAAM,eAAe;AACrB,UAAI,CAACA,OAAM,iBAAiB;AAC1B,QAAAA,OAAM,kBAAkB;AACxB,sBAAc,MAAM;;;;AAQ1B,WAAS,aAAa,QAAQ;AAC5B,QAAIA,SAAQ,OAAO;AACnB,IAAAyF,OAAM,gBAAgBzF,OAAM,cAAcA,OAAM,eAAe;AAC/D,IAAAA,OAAM,eAAe;AACrB,QAAI,CAACA,OAAM,iBAAiB;AAC1B,MAAAyF,OAAM,gBAAgBzF,OAAM,OAAO;AACnC,MAAAA,OAAM,kBAAkB;AACxB,cAAQ,SAAS,eAAe,MAAM;;;AAG1C,WAAS,cAAc,QAAQ;AAC7B,QAAIA,SAAQ,OAAO;AACnB,IAAAyF,OAAM,iBAAiBzF,OAAM,WAAWA,OAAM,QAAQA,OAAM,KAAK;AACjE,QAAI,CAACA,OAAM,cAAcA,OAAM,UAAUA,OAAM,QAAQ;AACrD,aAAO,KAAK,UAAU;AACtB,MAAAA,OAAM,kBAAkB;;AAS1B,IAAAA,OAAM,eAAe,CAACA,OAAM,WAAW,CAACA,OAAM,SAASA,OAAM,UAAUA,OAAM;AAC7E,SAAK,MAAM;;AASb,WAAS,cAAc,QAAQA,QAAO;AACpC,QAAI,CAACA,OAAM,aAAa;AACtB,MAAAA,OAAM,cAAc;AACpB,cAAQ,SAAS,gBAAgB,QAAQA,MAAK;;;AAGlD,WAAS,eAAe,QAAQA,QAAO;AAwBrC,WAAO,CAACA,OAAM,WAAW,CAACA,OAAM,UAAUA,OAAM,SAASA,OAAM,iBAAiBA,OAAM,WAAWA,OAAM,WAAW,IAAI;AACpH,UAAI,MAAMA,OAAM;AAChB,MAAAyF,OAAM,sBAAsB;AAC5B,aAAO,KAAK,CAAC;AACb,UAAI,QAAQzF,OAAM;AAEhB;;AAEJ,IAAAA,OAAM,cAAc;;AAOtB,WAAS,UAAU,QAAQ,SAAU,GAAG;AACtC,mBAAe,MAAM,IAAI,2BAA2B,SAAS,CAAC;EAChE;AACA,WAAS,UAAU,OAAO,SAAU,MAAM,UAAU;AAClD,QAAI,MAAM;AACV,QAAIA,SAAQ,KAAK;AACjB,YAAQA,OAAM,YAAU;MACtB,KAAK;AACH,QAAAA,OAAM,QAAQ;AACd;MACF,KAAK;AACH,QAAAA,OAAM,QAAQ,CAACA,OAAM,OAAO,IAAI;AAChC;MACF;AACE,QAAAA,OAAM,MAAM,KAAK,IAAI;AACrB;;AAEJ,IAAAA,OAAM,cAAc;AACpB,IAAAyF,OAAM,yBAAyBzF,OAAM,YAAY,QAAQ;AACzD,QAAI,SAAS,CAAC,YAAY,SAAS,QAAQ,UAAU,SAAS,QAAQ,UAAU,SAAS,QAAQ;AACjG,QAAI,QAAQ,QAAQ,QAAQ;AAC5B,QAAIA,OAAM,WAAY,SAAQ,SAAS,KAAK;QAAO,KAAI,KAAK,OAAO,KAAK;AACxE,SAAK,GAAG,UAAU,QAAQ;AAC1B,aAAS,SAAS,UAAU,YAAY;AACtC,MAAAyF,OAAM,UAAU;AAChB,UAAI,aAAa,KAAK;AACpB,YAAI,cAAc,WAAW,eAAe,OAAO;AACjD,qBAAW,aAAa;AACxB,kBAAO;;;;AAIb,aAAS,QAAQ;AACf,MAAAA,OAAM,OAAO;AACb,WAAK,IAAG;;AAOV,QAAI,UAAU,YAAY,GAAG;AAC7B,SAAK,GAAG,SAAS,OAAO;AACxB,QAAI,YAAY;AAChB,aAAS,UAAU;AACjB,MAAAA,OAAM,SAAS;AAEf,WAAK,eAAe,SAAS,OAAO;AACpC,WAAK,eAAe,UAAU,QAAQ;AACtC,WAAK,eAAe,SAAS,OAAO;AACpC,WAAK,eAAe,SAAS,OAAO;AACpC,WAAK,eAAe,UAAU,QAAQ;AACtC,UAAI,eAAe,OAAO,KAAK;AAC/B,UAAI,eAAe,OAAO,MAAM;AAChC,UAAI,eAAe,QAAQ,MAAM;AACjC,kBAAY;AAOZ,UAAIzF,OAAM,eAAe,CAAC,KAAK,kBAAkB,KAAK,eAAe,WAAY,SAAO;;AAE1F,QAAI,GAAG,QAAQ,MAAM;AACrB,aAAS,OAAO,OAAO;AACrB,MAAAyF,OAAM,QAAQ;AACd,UAAI,MAAM,KAAK,MAAM,KAAK;AAC1B,MAAAA,OAAM,cAAc,GAAG;AACvB,UAAI,QAAQ,OAAO;AAKjB,aAAKzF,OAAM,eAAe,KAAKA,OAAM,UAAU,QAAQA,OAAM,aAAa,KAAK,QAAQA,OAAM,OAAO,IAAI,MAAM,OAAO,CAAC,WAAW;AAC/H,UAAAyF,OAAM,+BAA+BzF,OAAM,UAAU;AACrD,UAAAA,OAAM;;AAER,YAAI,MAAK;;;AAMb,aAAS,QAAQ,IAAI;AACnB,MAAAyF,OAAM,WAAW,EAAE;AACnB,aAAM;AACN,WAAK,eAAe,SAAS,OAAO;AACpC,UAAI,gBAAgB,MAAM,OAAO,MAAM,EAAG,gBAAe,MAAM,EAAE;;AAInE,IAAAE,iBAAgB,MAAM,SAAS,OAAO;AAGtC,aAAS,UAAU;AACjB,WAAK,eAAe,UAAU,QAAQ;AACtC,aAAM;;AAER,SAAK,KAAK,SAAS,OAAO;AAC1B,aAAS,WAAW;AAClB,MAAAF,OAAM,UAAU;AAChB,WAAK,eAAe,SAAS,OAAO;AACpC,aAAM;;AAER,SAAK,KAAK,UAAU,QAAQ;AAC5B,aAAS,SAAS;AAChB,MAAAA,OAAM,QAAQ;AACd,UAAI,OAAO,IAAI;;AAIjB,SAAK,KAAK,QAAQ,GAAG;AAGrB,QAAI,CAACzF,OAAM,SAAS;AAClB,MAAAyF,OAAM,aAAa;AACnB,UAAI,OAAM;;AAEZ,WAAO;EACT;AACA,WAAS,YAAY,KAAK;AACxB,WAAO,SAAS,4BAA4B;AAC1C,UAAIzF,SAAQ,IAAI;AAChB,MAAAyF,OAAM,eAAezF,OAAM,UAAU;AACrC,UAAIA,OAAM,WAAY,CAAAA,OAAM;AAC5B,UAAIA,OAAM,eAAe,KAAK,gBAAgB,KAAK,MAAM,GAAG;AAC1D,QAAAA,OAAM,UAAU;AAChB,aAAK,GAAG;;IAEd;;AAEA,WAAS,UAAU,SAAS,SAAU,MAAM;AAC1C,QAAIA,SAAQ,KAAK;AACjB,QAAI,aAAa;MACf,YAAY;IAChB;AAGE,QAAIA,OAAM,eAAe,EAAG,QAAO;AAGnC,QAAIA,OAAM,eAAe,GAAG;AAE1B,UAAI,QAAQ,SAASA,OAAM,MAAO,QAAO;AACzC,UAAI,CAAC,KAAM,QAAOA,OAAM;AAGxB,MAAAA,OAAM,QAAQ;AACd,MAAAA,OAAM,aAAa;AACnB,MAAAA,OAAM,UAAU;AAChB,UAAI,KAAM,MAAK,KAAK,UAAU,MAAM,UAAU;AAC9C,aAAO;;AAKT,QAAI,CAAC,MAAM;AAET,UAAI,QAAQA,OAAM;AAClB,UAAI,MAAMA,OAAM;AAChB,MAAAA,OAAM,QAAQ;AACd,MAAAA,OAAM,aAAa;AACnB,MAAAA,OAAM,UAAU;AAChB,eAAS,IAAI,GAAG,IAAI,KAAK,IAAK,OAAM,CAAC,EAAE,KAAK,UAAU,MAAM;QAC1D,YAAY;MAClB,CAAK;AACD,aAAO;;AAIT,QAAIvB,SAAQ,QAAQuB,OAAM,OAAO,IAAI;AACrC,QAAIvB,WAAU,GAAI,QAAO;AACzB,IAAAuB,OAAM,MAAM,OAAOvB,QAAO,CAAC;AAC3B,IAAAuB,OAAM,cAAc;AACpB,QAAIA,OAAM,eAAe,EAAG,CAAAA,OAAM,QAAQA,OAAM,MAAM,CAAC;AACvD,SAAK,KAAK,UAAU,MAAM,UAAU;AACpC,WAAO;EACT;AAIA,WAAS,UAAU,KAAK,SAAU,IAAI,IAAI;AACxC,QAAI,MAAMqE,QAAO,UAAU,GAAG,KAAK,MAAM,IAAI,EAAE;AAC/C,QAAIrE,SAAQ,KAAK;AACjB,QAAI,OAAO,QAAQ;AAGjB,MAAAA,OAAM,oBAAoB,KAAK,cAAc,UAAU,IAAI;AAG3D,UAAIA,OAAM,YAAY,MAAO,MAAK,OAAM;IAC5C,WAAa,OAAO,YAAY;AAC5B,UAAI,CAACA,OAAM,cAAc,CAACA,OAAM,mBAAmB;AACjD,QAAAA,OAAM,oBAAoBA,OAAM,eAAe;AAC/C,QAAAA,OAAM,UAAU;AAChB,QAAAA,OAAM,kBAAkB;AACxB,QAAAyF,OAAM,eAAezF,OAAM,QAAQA,OAAM,OAAO;AAChD,YAAIA,OAAM,QAAQ;AAChB,uBAAa,IAAI;QACzB,WAAiB,CAACA,OAAM,SAAS;AACzB,kBAAQ,SAAS,kBAAkB,IAAI;;;;AAI7C,WAAO;EACT;AACA,WAAS,UAAU,cAAc,SAAS,UAAU;AACpD,WAAS,UAAU,iBAAiB,SAAU,IAAI,IAAI;AACpD,QAAI,MAAMqE,QAAO,UAAU,eAAe,KAAK,MAAM,IAAI,EAAE;AAC3D,QAAI,OAAO,YAAY;AAOrB,cAAQ,SAAS,yBAAyB,IAAI;;AAEhD,WAAO;EACT;AACA,WAAS,UAAU,qBAAqB,SAAU,IAAI;AACpD,QAAI,MAAMA,QAAO,UAAU,mBAAmB,MAAM,MAAM,SAAS;AACnE,QAAI,OAAO,cAAc,OAAO,QAAW;AAOzC,cAAQ,SAAS,yBAAyB,IAAI;;AAEhD,WAAO;EACT;AACA,WAAS,wBAAwBlF,OAAM;AACrC,QAAIa,SAAQb,MAAK;AACjB,IAAAa,OAAM,oBAAoBb,MAAK,cAAc,UAAU,IAAI;AAC3D,QAAIa,OAAM,mBAAmB,CAACA,OAAM,QAAQ;AAG1C,MAAAA,OAAM,UAAU;eAGPb,MAAK,cAAc,MAAM,IAAI,GAAG;AACzC,MAAAA,MAAK,OAAM;;;AAGf,WAAS,iBAAiBA,OAAM;AAC9B,IAAAsG,OAAM,0BAA0B;AAChC,IAAAtG,MAAK,KAAK,CAAC;;AAKb,WAAS,UAAU,SAAS,WAAY;AACtC,QAAIa,SAAQ,KAAK;AACjB,QAAI,CAACA,OAAM,SAAS;AAClB,MAAAyF,OAAM,QAAQ;AAId,MAAAzF,OAAM,UAAU,CAACA,OAAM;AACvB,aAAO,MAAMA,MAAK;;AAEpB,IAAAA,OAAM,SAAS;AACf,WAAO;EACT;AACA,WAAS,OAAO,QAAQA,QAAO;AAC7B,QAAI,CAACA,OAAM,iBAAiB;AAC1B,MAAAA,OAAM,kBAAkB;AACxB,cAAQ,SAAS,SAAS,QAAQA,MAAK;;;AAG3C,WAAS,QAAQ,QAAQA,QAAO;AAC9B,IAAAyF,OAAM,UAAUzF,OAAM,OAAO;AAC7B,QAAI,CAACA,OAAM,SAAS;AAClB,aAAO,KAAK,CAAC;;AAEf,IAAAA,OAAM,kBAAkB;AACxB,WAAO,KAAK,QAAQ;AACpB,SAAK,MAAM;AACX,QAAIA,OAAM,WAAW,CAACA,OAAM,QAAS,QAAO,KAAK,CAAC;;AAEpD,WAAS,UAAU,QAAQ,WAAY;AACrC,IAAAyF,OAAM,yBAAyB,KAAK,eAAe,OAAO;AAC1D,QAAI,KAAK,eAAe,YAAY,OAAO;AACzC,MAAAA,OAAM,OAAO;AACb,WAAK,eAAe,UAAU;AAC9B,WAAK,KAAK,OAAO;;AAEnB,SAAK,eAAe,SAAS;AAC7B,WAAO;EACT;AACA,WAAS,KAAK,QAAQ;AACpB,QAAIzF,SAAQ,OAAO;AACnB,IAAAyF,OAAM,QAAQzF,OAAM,OAAO;AAC3B,WAAOA,OAAM,WAAW,OAAO,KAAI,MAAO,KAAK;;AAMjD,WAAS,UAAU,OAAO,SAAU,QAAQ;AAC1C,QAAI,QAAQ;AACZ,QAAIA,SAAQ,KAAK;AACjB,QAAI,SAAS;AACb,WAAO,GAAG,OAAO,WAAY;AAC3B,MAAAyF,OAAM,aAAa;AACnB,UAAIzF,OAAM,WAAW,CAACA,OAAM,OAAO;AACjC,YAAI,QAAQA,OAAM,QAAQ,IAAG;AAC7B,YAAI,SAAS,MAAM,OAAQ,OAAM,KAAK,KAAK;;AAE7C,YAAM,KAAK,IAAI;IACnB,CAAG;AACD,WAAO,GAAG,QAAQ,SAAU,OAAO;AACjC,MAAAyF,OAAM,cAAc;AACpB,UAAIzF,OAAM,QAAS,SAAQA,OAAM,QAAQ,MAAM,KAAK;AAGpD,UAAIA,OAAM,eAAe,UAAU,QAAQ,UAAU,QAAY;eAAgB,CAACA,OAAM,eAAe,CAAC,SAAS,CAAC,MAAM,QAAS;AACjI,UAAI,MAAM,MAAM,KAAK,KAAK;AAC1B,UAAI,CAAC,KAAK;AACR,iBAAS;AACT,eAAO,MAAK;;IAElB,CAAG;AAID,aAAS,KAAK,QAAQ;AACpB,UAAI,KAAK,CAAC,MAAM,UAAa,OAAO,OAAO,CAAC,MAAM,YAAY;AAC5D,aAAK,CAAC,IAAI,0BAAS,WAAW,QAAQ;AACpC,iBAAO,SAAS,2BAA2B;AACzC,mBAAO,OAAO,MAAM,EAAE,MAAM,QAAQ,SAAS;UACvD;WACQ,CAAC;;;AAKP,aAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC5C,aAAO,GAAG,aAAa,CAAC,GAAG,KAAK,KAAK,KAAK,MAAM,aAAa,CAAC,CAAC,CAAC;;AAKlE,SAAK,QAAQ,SAAU8F,IAAG;AACxB,MAAAL,OAAM,iBAAiBK,EAAC;AACxB,UAAI,QAAQ;AACV,iBAAS;AACT,eAAO,OAAM;;IAEnB;AACE,WAAO;EACT;AACA,MAAI,OAAO,WAAW,YAAY;AAChC,aAAS,UAAU,OAAO,aAAa,IAAI,WAAY;AACrD,UAAI,sCAAsC,QAAW;AACnD,4CAAoCC,sBAAA;;AAEtC,aAAO,kCAAkC,IAAI;IACjD;;AAEA,SAAO,eAAe,SAAS,WAAW,yBAAyB;;;;IAIjE,YAAY;IACZ,KAAK,SAAStB,OAAM;AAClB,aAAO,KAAK,eAAe;;EAE/B,CAAC;AACD,SAAO,eAAe,SAAS,WAAW,kBAAkB;;;;IAI1D,YAAY;IACZ,KAAK,SAASA,OAAM;AAClB,aAAO,KAAK,kBAAkB,KAAK,eAAe;;EAEtD,CAAC;AACD,SAAO,eAAe,SAAS,WAAW,mBAAmB;;;;IAI3D,YAAY;IACZ,KAAK,SAASA,OAAM;AAClB,aAAO,KAAK,eAAe;;IAE7B,KAAK,SAAS,IAAIzE,QAAO;AACvB,UAAI,KAAK,gBAAgB;AACvB,aAAK,eAAe,UAAUA;;;EAGpC,CAAC;AAGD,WAAS,YAAY;AACrB,SAAO,eAAe,SAAS,WAAW,kBAAkB;;;;IAI1D,YAAY;IACZ,KAAK,SAASyE,OAAM;AAClB,aAAO,KAAK,eAAe;;EAE/B,CAAC;AAMD,WAAS,SAAS,GAAGzE,QAAO;AAE1B,QAAIA,OAAM,WAAW,EAAG,QAAO;AAC/B,QAAI;AACJ,QAAIA,OAAM,WAAY,OAAMA,OAAM,OAAO,MAAK;aAAY,CAAC,KAAK,KAAKA,OAAM,QAAQ;AAEjF,UAAIA,OAAM,QAAS,OAAMA,OAAM,OAAO,KAAK,EAAE;eAAWA,OAAM,OAAO,WAAW,EAAG,OAAMA,OAAM,OAAO,MAAK;UAAQ,OAAMA,OAAM,OAAO,OAAOA,OAAM,MAAM;AACzJ,MAAAA,OAAM,OAAO,MAAK;IACtB,OAAS;AAEL,YAAMA,OAAM,OAAO,QAAQ,GAAGA,OAAM,OAAO;;AAE7C,WAAO;;AAET,WAAS,YAAY,QAAQ;AAC3B,QAAIA,SAAQ,OAAO;AACnB,IAAAyF,OAAM,eAAezF,OAAM,UAAU;AACrC,QAAI,CAACA,OAAM,YAAY;AACrB,MAAAA,OAAM,QAAQ;AACd,cAAQ,SAAS,eAAeA,QAAO,MAAM;;;AAGjD,WAAS,cAAcA,QAAO,QAAQ;AACpC,IAAAyF,OAAM,iBAAiBzF,OAAM,YAAYA,OAAM,MAAM;AAGrD,QAAI,CAACA,OAAM,cAAcA,OAAM,WAAW,GAAG;AAC3C,MAAAA,OAAM,aAAa;AACnB,aAAO,WAAW;AAClB,aAAO,KAAK,KAAK;AACjB,UAAIA,OAAM,aAAa;AAGrB,YAAI,SAAS,OAAO;AACpB,YAAI,CAAC,UAAU,OAAO,eAAe,OAAO,UAAU;AACpD,iBAAO,QAAO;;;;;AAKtB,MAAI,OAAO,WAAW,YAAY;AAChC,aAAS,OAAO,SAAU,UAAU,MAAM;AACxC,UAAI,SAAS,QAAW;AACtB,eAAOgG,mBAAA;;AAET,aAAO,KAAK,UAAU,UAAU,IAAI;IACxC;;AAEA,WAAS,QAAQ,IAAI,GAAG;AACtB,aAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,IAAI,GAAG,KAAK;AACzC,UAAI,GAAG,CAAC,MAAM,EAAG,QAAO;;AAE1B,WAAO;EACT;;;;;;;;ACj8BcC,wBAAGC;AACjB,MAAI,iBAAiB7J,qBAAoB,EAAC,OACxC,6BAA6B,eAAe,4BAC5C,wBAAwB,eAAe,uBACvC,qCAAqC,eAAe,oCACpD,8BAA8B,eAAe;AAC/C,MAAI+H,UAAS7H,wBAAA;AACb2D,0BAAoBgG,YAAW9B,OAAM;AACrC,WAAS+B,gBAAe,IAAI,MAAM;AAChC,QAAI,KAAK,KAAK;AACd,OAAG,eAAe;AAClB,QAAI,KAAK,GAAG;AACZ,QAAI,OAAO,MAAM;AACf,aAAO,KAAK,KAAK,SAAS,IAAI,sBAAqB,CAAE;;AAEvD,OAAG,aAAa;AAChB,OAAG,UAAU;AACb,QAAI,QAAQ;AAEV,WAAK,KAAK,IAAI;AAChB,OAAG,EAAE;AACL,QAAI,KAAK,KAAK;AACd,OAAG,UAAU;AACb,QAAI,GAAG,gBAAgB,GAAG,SAAS,GAAG,eAAe;AACnD,WAAK,MAAM,GAAG,aAAa;;;AAG/B,WAASD,WAAU,SAAS;AAC1B,QAAI,EAAE,gBAAgBA,YAAY,QAAO,IAAIA,WAAU,OAAO;AAC9D,IAAA9B,QAAO,KAAK,MAAM,OAAO;AACzB,SAAK,kBAAkB;MACrB,gBAAgB+B,gBAAe,KAAK,IAAI;MACxC,eAAe;MACf,cAAc;MACd,SAAS;MACT,YAAY;MACZ,eAAe;IACnB;AAGE,SAAK,eAAe,eAAe;AAKnC,SAAK,eAAe,OAAO;AAC3B,QAAI,SAAS;AACX,UAAI,OAAO,QAAQ,cAAc,WAAY,MAAK,aAAa,QAAQ;AACvE,UAAI,OAAO,QAAQ,UAAU,WAAY,MAAK,SAAS,QAAQ;;AAIjE,SAAK,GAAG,aAAaxB,UAAS;;AAEhC,WAASA,aAAY;AACnB,QAAI,QAAQ;AACZ,QAAI,OAAO,KAAK,WAAW,cAAc,CAAC,KAAK,eAAe,WAAW;AACvE,WAAK,OAAO,SAAU,IAAI,MAAM;AAC9B,QAAAU,MAAK,OAAO,IAAI,IAAI;MAC1B,CAAK;IACL,OAAS;AACL,MAAAA,MAAK,MAAM,MAAM,IAAI;;;AAGzB,EAAAa,WAAU,UAAU,OAAO,SAAU,OAAO,UAAU;AACpD,SAAK,gBAAgB,gBAAgB;AACrC,WAAO9B,QAAO,UAAU,KAAK,KAAK,MAAM,OAAO,QAAQ;EACzD;AAYA,EAAA8B,WAAU,UAAU,aAAa,SAAU,OAAO,UAAU,IAAI;AAC9D,OAAG,IAAI,2BAA2B,cAAc,CAAC;EACnD;AACA,EAAAA,WAAU,UAAU,SAAS,SAAU,OAAO,UAAU,IAAI;AAC1D,QAAI,KAAK,KAAK;AACd,OAAG,UAAU;AACb,OAAG,aAAa;AAChB,OAAG,gBAAgB;AACnB,QAAI,CAAC,GAAG,cAAc;AACpB,UAAI,KAAK,KAAK;AACd,UAAI,GAAG,iBAAiB,GAAG,gBAAgB,GAAG,SAAS,GAAG,cAAe,MAAK,MAAM,GAAG,aAAa;;EAExG;AAKA,EAAAA,WAAU,UAAU,QAAQ,SAAU,GAAG;AACvC,QAAI,KAAK,KAAK;AACd,QAAI,GAAG,eAAe,QAAQ,CAAC,GAAG,cAAc;AAC9C,SAAG,eAAe;AAClB,WAAK,WAAW,GAAG,YAAY,GAAG,eAAe,GAAG,cAAc;IACtE,OAAS;AAGL,SAAG,gBAAgB;;EAEvB;AACA,EAAAA,WAAU,UAAU,WAAW,SAAU,KAAK,IAAI;AAChD,IAAA9B,QAAO,UAAU,SAAS,KAAK,MAAM,KAAK,SAAU,MAAM;AACxD,SAAG,IAAI;IACX,CAAG;EACH;AACA,WAASiB,MAAK,QAAQ,IAAI,MAAM;AAC9B,QAAI,GAAI,QAAO,OAAO,KAAK,SAAS,EAAE;AACtC,QAAI,QAAQ;AAEV,aAAO,KAAK,IAAI;AAKlB,QAAI,OAAO,eAAe,OAAQ,OAAM,IAAI,4BAA2B;AACvE,QAAI,OAAO,gBAAgB,aAAc,OAAM,IAAI,mCAAkC;AACrF,WAAO,OAAO,KAAK,IAAI;EACzB;;;;;;;;AClKce,0BAAGC;AACjB,MAAIH,aAAY7J,yBAAA;AAChBE,0BAAoB8J,cAAaH,UAAS;AAC1C,WAASG,aAAY,SAAS;AAC5B,QAAI,EAAE,gBAAgBA,cAAc,QAAO,IAAIA,aAAY,OAAO;AAClE,IAAAH,WAAU,KAAK,MAAM,OAAO;;AAE9B,EAAAG,aAAY,UAAU,aAAa,SAAU,OAAO,UAAU,IAAI;AAChE,OAAG,MAAM,KAAK;;;;;;;;;AC9BhB,MAAI;AACJ,WAASnD,MAAK,UAAU;AACtB,QAAI,SAAS;AACb,WAAO,WAAY;AACjB,UAAI,OAAQ;AACZ,eAAS;AACT,eAAS,MAAM,QAAQ,SAAS;IACpC;;AAEA,MAAI,iBAAiB7G,qBAA0B,EAAC,OAC9C,mBAAmB,eAAe,kBAClC,uBAAuB,eAAe;AACxC,WAAS,KAAK,KAAK;AAEjB,QAAI,IAAK,OAAM;;AAEjB,WAAS,UAAU,QAAQ;AACzB,WAAO,OAAO,aAAa,OAAO,OAAO,UAAU;;AAErD,WAAS,UAAU,QAAQ,SAAS,SAAS,UAAU;AACrD,eAAW6G,MAAK,QAAQ;AACxB,QAAI,SAAS;AACb,WAAO,GAAG,SAAS,WAAY;AAC7B,eAAS;IACb,CAAG;AACD,QAAI,QAAQ,OAAW,OAAM3G,mBAAAA;AAC7B,QAAI,QAAQ;MACV,UAAU;MACV,UAAU;OACT,SAAU,KAAK;AAChB,UAAI,IAAK,QAAO,SAAS,GAAG;AAC5B,eAAS;AACT,eAAQ;IACZ,CAAG;AACD,QAAI,YAAY;AAChB,WAAO,SAAU,KAAK;AACpB,UAAI,OAAQ;AACZ,UAAI,UAAW;AACf,kBAAY;AAGZ,UAAI,UAAU,MAAM,EAAG,QAAO,OAAO,MAAK;AAC1C,UAAI,OAAO,OAAO,YAAY,WAAY,QAAO,OAAO,QAAO;AAC/D,eAAS,OAAO,IAAI,qBAAqB,MAAM,CAAC;IACpD;;AAEA,WAAS,KAAK,IAAI;AAChB,OAAE;;AAEJ,WAAS,KAAK,MAAM,IAAI;AACtB,WAAO,KAAK,KAAK,EAAE;;AAErB,WAAS,YAAY,SAAS;AAC5B,QAAI,CAAC,QAAQ,OAAQ,QAAO;AAC5B,QAAI,OAAO,QAAQ,QAAQ,SAAS,CAAC,MAAM,WAAY,QAAO;AAC9D,WAAO,QAAQ,IAAG;;AAEpB,WAAS,WAAW;AAClB,aAAS,OAAO,UAAU,QAAQ,UAAU,IAAI,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AAC1F,cAAQ,IAAI,IAAI,UAAU,IAAI;;AAEhC,QAAI,WAAW,YAAY,OAAO;AAClC,QAAI,MAAM,QAAQ,QAAQ,CAAC,CAAC,EAAG,WAAU,QAAQ,CAAC;AAClD,QAAI,QAAQ,SAAS,GAAG;AACtB,YAAM,IAAI,iBAAiB,SAAS;;AAEtC,QAAIgG;AACJ,QAAI,WAAW,QAAQ,IAAI,SAAU,QAAQ,GAAG;AAC9C,UAAI,UAAU,IAAI,QAAQ,SAAS;AACnC,UAAI,UAAU,IAAI;AAClB,aAAO,UAAU,QAAQ,SAAS,SAAS,SAAU,KAAK;AACxD,YAAI,CAACA,OAAO,CAAAA,SAAQ;AACpB,YAAI,IAAK,UAAS,QAAQ,IAAI;AAC9B,YAAI,QAAS;AACb,iBAAS,QAAQ,IAAI;AACrB,iBAASA,MAAK;MACpB,CAAK;IACL,CAAG;AACD,WAAO,QAAQ,OAAO,IAAI;;AAE5B,eAAiB;;;IChEjB,mBAAiB;AAEjB,IAAI,KAAKlG,cAAkB;AAC3B,IAAIgC,aAAW9B;AAEf8B,WAAS,QAAQ,EAAE;AACnB,OAAO,WAAW6B,0BAAA;AAClB,OAAO,WAAWU,0BAAA;AAClB,OAAO,SAASG,wBAAA;AAChB,OAAO,YAAYiB,yBAAA;AACnB,OAAO,cAAcsC,2BAAA;AACrB,OAAO,WAAWC,mBAAgE;AAClF,OAAO,WAAWmB,gBAA2D;AAG7E,OAAO,SAAS;AAOhB,SAAS,SAAS;AAChB,KAAG,KAAK,IAAI;AACd;AAEA,OAAO,UAAU,OAAO,SAAS,MAAM,SAAS;AAC9C,MAAI,SAAS;AAEb,WAAS,OAAO,OAAO;AACrB,QAAI,KAAK,UAAU;AACjB,UAAI,UAAU,KAAK,MAAM,KAAK,KAAK,OAAO,OAAO;AAC/C,eAAO,MAAK;MACpB;IACA;EACA;AAEE,SAAO,GAAG,QAAQ,MAAM;AAExB,WAAS,UAAU;AACjB,QAAI,OAAO,YAAY,OAAO,QAAQ;AACpC,aAAO,OAAM;IACnB;EACA;AAEE,OAAK,GAAG,SAAS,OAAO;AAIxB,MAAI,CAAC,KAAK,aAAa,CAAC,WAAW,QAAQ,QAAQ,QAAQ;AACzD,WAAO,GAAG,OAAO,KAAK;AACtB,WAAO,GAAG,SAAS,OAAO;EAC9B;AAEE,MAAI,WAAW;AACf,WAAS,QAAQ;AACf,QAAI,SAAU;AACd,eAAW;AAEX,SAAK,IAAG;EACZ;AAGE,WAAS,UAAU;AACjB,QAAI,SAAU;AACd,eAAW;AAEX,QAAI,OAAO,KAAK,YAAY,WAAY,MAAK,QAAO;EACxD;AAGE,WAAS,QAAQ,IAAI;AACnB,YAAO;AACP,QAAI,GAAG,cAAc,MAAM,OAAO,MAAM,GAAG;AACzC,YAAM;IACZ;EACA;AAEE,SAAO,GAAG,SAAS,OAAO;AAC1B,OAAK,GAAG,SAAS,OAAO;AAGxB,WAAS,UAAU;AACjB,WAAO,eAAe,QAAQ,MAAM;AACpC,SAAK,eAAe,SAAS,OAAO;AAEpC,WAAO,eAAe,OAAO,KAAK;AAClC,WAAO,eAAe,SAAS,OAAO;AAEtC,WAAO,eAAe,SAAS,OAAO;AACtC,SAAK,eAAe,SAAS,OAAO;AAEpC,WAAO,eAAe,OAAO,OAAO;AACpC,WAAO,eAAe,SAAS,OAAO;AAEtC,SAAK,eAAe,SAAS,OAAO;EACxC;AAEE,SAAO,GAAG,OAAO,OAAO;AACxB,SAAO,GAAG,SAAS,OAAO;AAE1B,OAAK,GAAG,SAAS,OAAO;AAExB,OAAK,KAAK,QAAQ,MAAM;AAGxB,SAAO;AACT;AC/HA,IAAIlJ,WAASH,oBAAuB;AACpC,IAAI6J,cAAY3J,iBAAkB;AAClC,IAAI8B,aAAW6B;AAEf,SAASoG,WAAUC,YAAW;AAC5BL,cAAU,KAAK,IAAI;AAEnB,OAAK,SAAS1J,SAAO,YAAY+J,UAAS;AAC1C,OAAK,aAAaA;AAClB,OAAK,eAAe;AACpB,OAAK,UAAU,CAAC,GAAG,GAAG,GAAG,CAAC;AAE1B,OAAK,aAAa;AACpB;AAEAlI,WAASiI,YAAUJ,WAAS;AAE5BI,WAAS,UAAU,aAAa,SAAU,OAAO,UAAU,UAAU;AACnE,MAAI/D,SAAQ;AACZ,MAAI;AACF,SAAK,OAAO,OAAO,QAAQ;EAC/B,SAAW,KAAK;AACZ,IAAAA,SAAQ;EACZ;AAEE,WAASA,MAAK;AAChB;AAEA+D,WAAS,UAAU,SAAS,SAAU,UAAU;AAC9C,MAAI/D,SAAQ;AACZ,MAAI;AACF,SAAK,KAAK,KAAK,OAAM,CAAE;EAC3B,SAAW,KAAK;AACZ,IAAAA,SAAQ;EACZ;AAEE,WAASA,MAAK;AAChB;AAEA,IAAIiE,kBAAgB,OAAO,eAAe;AAC1C,IAAIC,mBAAiB,OAAO,gBAAgB,eAC1C,OAAO,eAAe,eACtB,YAAY,WACXjK,SAAO,qBAAqB,cAAcA,SAAO;AAEpD,SAASsC,WAAU,MAAM,UAAU;AAGjC,MAAI,gBAAgBtC,SAAQ,QAAO;AAGnC,MAAI,OAAO,SAAS,SAAU,QAAOA,SAAO,KAAK,MAAM,QAAQ;AAM/D,MAAIiK,oBAAkB,YAAY,OAAO,IAAI,GAAG;AAC9C,QAAI,KAAK,eAAe,EAAG,QAAOjK,SAAO,MAAM,CAAC;AAChD,QAAI,MAAMA,SAAO,KAAK,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AAGnE,QAAI,IAAI,eAAe,KAAK,WAAY,QAAO;EACnD;AAME,MAAIgK,mBAAiB,gBAAgB,WAAY,QAAOhK,SAAO,KAAK,IAAI;AAOxE,MACEA,SAAO,SAAS,IAAI,KACpB,KAAK,eACL,OAAO,KAAK,YAAY,aAAa,cACrC,KAAK,YAAY,SAAS,IAAI,GAC9B;AACA,WAAOA,SAAO,KAAK,IAAI;EAC3B;AAEE,QAAM,IAAI,UAAU,+FAA+F;AACrH;AAEA8J,WAAS,UAAU,SAAS,SAAU,MAAM,UAAU;AACpD,MAAI,KAAK,WAAY,OAAM,IAAI,MAAM,uBAAuB;AAE5D,SAAOxH,WAAS,MAAM,QAAQ;AAG9B,MAAI,QAAQ,KAAK;AACjB,MAAI,SAAS;AACb,SAAO,KAAK,eAAe,KAAK,SAAS,UAAU,KAAK,YAAY;AAClE,aAAS,IAAI,KAAK,cAAc,IAAI,KAAK,aAAa,OAAM,GAAG,IAAI,KAAK,QAAQ;AAChF,SAAK,QAAO;AACZ,SAAK,eAAe;EACxB;AACE,SAAO,SAAS,KAAK,OAAQ,OAAM,KAAK,cAAc,IAAI,KAAK,QAAQ;AAGvE,WAAS,IAAI,GAAG,QAAQ,KAAK,SAAS,GAAG,QAAQ,GAAG,EAAE,GAAG;AACvD,SAAK,QAAQ,CAAC,KAAK;AACnB,YAAS,KAAK,QAAQ,CAAC,IAAI,aAAgB;AAC3C,QAAI,QAAQ,EAAG,MAAK,QAAQ,CAAC,KAAK,aAAe;EACrD;AAEE,SAAO;AACT;AAEAwH,WAAS,UAAU,UAAU,WAAY;AACvC,QAAM,IAAI,MAAM,4BAA4B;AAC9C;AAEAA,WAAS,UAAU,SAAS,SAAU,UAAU;AAC9C,MAAI,KAAK,WAAY,OAAM,IAAI,MAAM,uBAAuB;AAC5D,OAAK,aAAa;AAElB,MAAII,UAAS,KAAK,QAAO;AACzB,MAAI,aAAa,OAAW,CAAAA,UAASA,QAAO,SAAS,QAAQ;AAG7D,OAAK,OAAO,KAAK,CAAC;AAClB,OAAK,eAAe;AACpB,WAAS,IAAI,GAAG,IAAI,GAAG,EAAE,EAAG,MAAK,QAAQ,CAAC,IAAI;AAE9C,SAAOA;AACT;AAEAJ,WAAS,UAAU,UAAU,WAAY;AACvC,QAAM,IAAI,MAAM,4BAA4B;AAC9C;AAEA,IAAAK,aAAiBL;ACxIjB,IAAIjI,aAAWhC;AACf,IAAIiK,aAAW/J;AACf,IAAIC,WAAS0D,oBAAuB;AAEpC,IAAI0G,YAAU,IAAI,MAAM,EAAE;AAE1B,SAASC,QAAO;AACdP,aAAS,KAAK,MAAM,EAAE;AAGtB,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACZ;AAEAjI,WAASwI,OAAKP,UAAQ;AAEtBO,MAAI,UAAU,UAAU,WAAY;AAClC,MAAI,IAAID;AACR,WAAS,IAAI,GAAG,IAAI,IAAI,EAAE,EAAG,GAAE,CAAC,IAAI,KAAK,OAAO,YAAY,IAAI,CAAC;AAEjE,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,KAAK;AAEb,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,WAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,CAAC;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AAEzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,WAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,UAAY,CAAC;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,WAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,CAAC;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,CAAC;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AAEzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,WAAY,CAAC;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,UAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,WAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AAExC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,CAAC;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;AACvC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,YAAY,EAAE;AACzC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,WAAY,EAAE;AACxC,MAAI,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,YAAY,EAAE;AAExC,OAAK,KAAM,KAAK,KAAK,IAAK;AAC1B,OAAK,KAAM,KAAK,KAAK,IAAK;AAC1B,OAAK,KAAM,KAAK,KAAK,IAAK;AAC1B,OAAK,KAAM,KAAK,KAAK,IAAK;AAC5B;AAEAC,MAAI,UAAU,UAAU,WAAY;AAElC,OAAK,OAAO,KAAK,cAAc,IAAI;AACnC,MAAI,KAAK,eAAe,IAAI;AAC1B,SAAK,OAAO,KAAK,GAAG,KAAK,cAAc,EAAE;AACzC,SAAK,QAAO;AACZ,SAAK,eAAe;EACxB;AAEE,OAAK,OAAO,KAAK,GAAG,KAAK,cAAc,EAAE;AACzC,OAAK,OAAO,cAAc,KAAK,QAAQ,CAAC,GAAG,EAAE;AAC7C,OAAK,OAAO,cAAc,KAAK,QAAQ,CAAC,GAAG,EAAE;AAC7C,OAAK,QAAO;AAGZ,MAAI3K,UAASM,SAAO,YAAY,EAAE;AAClC,EAAAN,QAAO,aAAa,KAAK,IAAI,CAAC;AAC9B,EAAAA,QAAO,aAAa,KAAK,IAAI,CAAC;AAC9B,EAAAA,QAAO,aAAa,KAAK,IAAI,CAAC;AAC9B,EAAAA,QAAO,aAAa,KAAK,IAAI,EAAE;AAC/B,SAAOA;AACT;AAEA,SAAS4K,OAAM,GAAG,GAAG;AACnB,SAAQ,KAAK,IAAM,MAAO,KAAK;AACjC;AAEA,SAAS,IAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG1K,IAAG;AACjC,SAAQ0K,OAAM,KAAM,IAAI,IAAO,CAAC,IAAK,KAAM,IAAI,IAAK,GAAG1K,EAAC,IAAI,IAAK;AACnE;AAEA,SAAS,IAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGA,IAAG;AACjC,SAAQ0K,OAAM,KAAM,IAAI,IAAM,IAAK,CAAC,KAAO,IAAI,IAAK,GAAG1K,EAAC,IAAI,IAAK;AACnE;AAEA,SAAS,IAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGA,IAAG;AACjC,SAAQ0K,OAAM,KAAK,IAAI,IAAI,KAAK,IAAI,IAAK,GAAG1K,EAAC,IAAI,IAAK;AACxD;AAEA,SAAS,IAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGA,IAAG;AACjC,SAAQ0K,OAAM,KAAM,KAAK,IAAK,CAAC,MAAQ,IAAI,IAAK,GAAG1K,EAAC,IAAI,IAAK;AAC/D;AAEA,IAAA,SAAiByK;ACjJjB,IAAI7J,aAAW,CAAA,EAAG;AAElB,IAAA+J,YAAiB,MAAM,WAAW,SAAU,KAAK;AAC/C,SAAO/J,WAAS,KAAK,GAAG,KAAK;AAC/B;ACDA,IAAA,OAAiB;ACAjB,IAAA,gBAAiB;ACAjB,IAAA,WAAiB;ACAjB,IAAA,QAAiB;ACAjB,IAAA,QAAiB;ACAjB,IAAA,MAAiB;ACAjB,IAAA,SAAiB;ACAjB,IAAA,MAAiB;ICAjBuC,QAAiB,KAAK;ICAtByH,UAAiB,KAAK;ICAtB9J,QAAiB,KAAK;ICAtBM,QAAiB,KAAK;ICAtBoB,QAAiB,KAAK;ICAtBqI,UAAiB,KAAK;ICAtB,SAAiB,OAAO,SAAS,SAASC,OAAM,GAAG;AAClD,SAAO,MAAM;AACd;ACHA,IAAI,SAAS7K;AAGb,IAAA8K,SAAiB,SAAS,KAAK,QAAQ;AACtC,MAAI,OAAO,MAAM,KAAK,WAAW,GAAG;AACnC,WAAO;EACT;AACC,SAAO,SAAS,IAAI,KAAK;AAC1B;ICPA,OAAiB,OAAO;ACAxB,IAAIC,UAAQ/K;AAEZ,IAAI+K,SAAO;AACV,MAAI;AACHA,YAAM,CAAA,GAAI,QAAQ;EACpB,SAAU,GAAG;AAEXA,cAAQ;EACV;AACA;AAEA,IAAA,OAAiBA;ACXjB,IAAIC,oBAAkB,OAAO,kBAAkB;AAC/C,IAAIA,mBAAiB;AACpB,MAAI;AACHA,sBAAgB,CAAA,GAAI,KAAK,EAAE,OAAO,EAAC,CAAE;EACvC,SAAU,GAAG;AAEXA,wBAAkB;EACpB;AACA;AAEA,IAAA,mBAAiBA;;;;;;ACTHC,YAAG,SAASC,cAAa;AACtC,QAAI,OAAO,WAAW,cAAc,OAAO,OAAO,0BAA0B,YAAY;AAAE,aAAO;IAAM;AACvG,QAAI,OAAO,OAAO,aAAa,UAAU;AAAE,aAAO;IAAK;AAGvD,QAAI3K,OAAM,CAAA;AACV,QAAI,MAAM,uBAAO,MAAM;AACvB,QAAI,SAAS,OAAO,GAAG;AACvB,QAAI,OAAO,QAAQ,UAAU;AAAE,aAAO;IAAM;AAE5C,QAAI,OAAO,UAAU,SAAS,KAAK,GAAG,MAAM,mBAAmB;AAAE,aAAO;IAAM;AAC9E,QAAI,OAAO,UAAU,SAAS,KAAK,MAAM,MAAM,mBAAmB;AAAE,aAAO;IAAM;AAUjF,QAAI,SAAS;AACb,IAAAA,KAAI,GAAG,IAAI;AACX,aAAS,KAAKA,MAAK;AAAE,aAAO;IAAM;AAClC,QAAI,OAAO,OAAO,SAAS,cAAc,OAAO,KAAKA,IAAG,EAAE,WAAW,GAAG;AAAE,aAAO;IAAM;AAEvF,QAAI,OAAO,OAAO,wBAAwB,cAAc,OAAO,oBAAoBA,IAAG,EAAE,WAAW,GAAG;AAAE,aAAO;IAAM;AAErH,QAAI,OAAO,OAAO,sBAAsBA,IAAG;AAC3C,QAAI,KAAK,WAAW,KAAK,KAAK,CAAC,MAAM,KAAK;AAAE,aAAO;IAAM;AAEzD,QAAI,CAAC,OAAO,UAAU,qBAAqB,KAAKA,MAAK,GAAG,GAAG;AAAE,aAAO;IAAM;AAE1E,QAAI,OAAO,OAAO,6BAA6B,YAAY;AAE1D,UAAI;;QAAgD,OAAO,yBAAyBA,MAAK,GAAG;;AAC5F,UAAI,WAAW,UAAU,UAAU,WAAW,eAAe,MAAM;AAAE,eAAO;MAAM;;AAGnF,WAAO;;;;;;;;;ACzCR,MAAI,aAAa,OAAO,WAAW,eAAe;AAClD,MAAI,gBAAgBP,eAAA;AAGNkL,iBAAG,SAAS,mBAAmB;AAC5C,QAAI,OAAO,eAAe,YAAY;AAAE,aAAO;IAAM;AACrD,QAAI,OAAO,WAAW,YAAY;AAAE,aAAO;IAAM;AACjD,QAAI,OAAO,WAAW,KAAK,MAAM,UAAU;AAAE,aAAO;IAAM;AAC1D,QAAI,OAAO,uBAAO,KAAK,MAAM,UAAU;AAAE,aAAO;IAAM;AAEtD,WAAO,cAAa;;;;;;;;;ACTP,2BAAI,OAAO,YAAY,eAAe,QAAQ,kBAAmB;;;;;;;;ACD/E,MAAIC,WAAUnL;AAGd,0BAAiBmL,SAAQ,kBAAkB;;;ACD3C,IAAI,gBAAgB;AACpB,IAAI,QAAQ,OAAO,UAAU;AAC7B,IAAItK,QAAM,KAAK;AACf,IAAI,WAAW;AAEf,IAAI,WAAW,SAASuK,UAAS,GAAG,GAAG;AACnC,MAAI,MAAM,CAAA;AAEV,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,GAAG;AAClC,QAAI,CAAC,IAAI,EAAE,CAAC;EACpB;AACI,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,GAAG;AAClC,QAAI,IAAI,EAAE,MAAM,IAAI,EAAE,CAAC;EAC/B;AAEI,SAAO;AACX;AAEA,IAAI,QAAQ,SAASC,OAAM,SAAS,QAAQ;AACxC,MAAI,MAAM,CAAA;AACV,WAAS,IAAI,UAAU,GAAG,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG,KAAK,GAAG;AACjE,QAAI,CAAC,IAAI,QAAQ,CAAC;EAC1B;AACI,SAAO;AACX;AAEA,IAAI,QAAQ,SAAU,KAAK,QAAQ;AAC/B,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG;AACpC,WAAO,IAAI,CAAC;AACZ,QAAI,IAAI,IAAI,IAAI,QAAQ;AACpB,aAAO;IACnB;EACA;AACI,SAAO;AACX;AAEA,IAAAC,mBAAiB,SAAS,KAAK,MAAM;AACjC,MAAI,SAAS;AACb,MAAI,OAAO,WAAW,cAAc,MAAM,MAAM,MAAM,MAAM,UAAU;AAClE,UAAM,IAAI,UAAU,gBAAgB,MAAM;EAClD;AACI,MAAI,OAAO,MAAM,WAAW,CAAC;AAE7B,MAAI;AACJ,MAAI,SAAS,WAAY;AACrB,QAAI,gBAAgB,OAAO;AACvB,UAAI,SAAS,OAAO;QAChB;QACA,SAAS,MAAM,SAAS;MACxC;AACY,UAAI,OAAO,MAAM,MAAM,QAAQ;AAC3B,eAAO;MACvB;AACY,aAAO;IACnB;AACQ,WAAO,OAAO;MACV;MACA,SAAS,MAAM,SAAS;IACpC;EAEA;AAEI,MAAI,cAAczK,MAAI,GAAG,OAAO,SAAS,KAAK,MAAM;AACpD,MAAI,YAAY,CAAA;AAChB,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AAClC,cAAU,CAAC,IAAI,MAAM;EAC7B;AAEI,UAAQ,SAAS,UAAU,sBAAsB,MAAM,WAAW,GAAG,IAAI,2CAA2C,EAAE,MAAM;AAE5H,MAAI,OAAO,WAAW;AAClB,QAAI,QAAQ,SAAS0K,SAAQ;IAAA;AAC7B,UAAM,YAAY,OAAO;AACzB,UAAM,YAAY,IAAI,MAAK;AAC3B,UAAM,YAAY;EAC1B;AAEI,SAAO;AACX;ACjFA,IAAI,iBAAiBvL;AAErB,IAAA,eAAiB,SAAS,UAAU,QAAQ;ACD5C,IAAA,eAAiB,SAAS,UAAU;;;;;;ACApC,kBAAiB,SAAS,UAAU;;;ICApC,eAAiB,OAAO,YAAY,eAAe,WAAW,QAAQ;ACDtE,IAAIwL,SAAOxL;AAEX,IAAIyL,WAASvL,qBAAA;AACb,IAAIwL,UAAQ7H;AACZ,IAAI,gBAAgBU;IAGpB,cAAiB,iBAAiBiH,OAAK,KAAKE,SAAOD,QAAM;ACPzD,IAAID,SAAOxL;AACX,IAAI2L,eAAazL;AAEjB,IAAIwL,UAAQ7H;AACZ,IAAI,eAAeU;AAGnB,IAAA,uBAAiB,SAAS,cAAc,MAAM;AAC7C,MAAI,KAAK,SAAS,KAAK,OAAO,KAAK,CAAC,MAAM,YAAY;AACrD,UAAM,IAAIoH,aAAW,wBAAwB;EAC/C;AACC,SAAO,aAAaH,QAAME,SAAO,IAAI;AACtC;;;;;;ACZA,MAAIE,YAAW5L;AACf,MAAI6L,QAAO3L;AAEX,MAAI;AACJ,MAAI;AAEH;IAA0E,CAAA,EAAI,cAAc,MAAM;WAC1F,GAAG;AACX,QAAI,CAAC,KAAK,OAAO,MAAM,YAAY,EAAE,UAAU,MAAM,EAAE,SAAS,oBAAoB;AACnF,YAAM;;;AAKR,MAAI,OAAO,CAAC,CAAC,oBAAoB2L,SAAQA;IAAK,OAAO;;IAAyD;EAAW;AAEzH,MAAIV,WAAU;AACd,MAAI,kBAAkBA,SAAQ;AAGhB/C,UAAG,QAAQ,OAAO,KAAK,QAAQ,aAC1CwD,UAAS,CAAC,KAAK,GAAG,CAAC,IACnB,OAAO,oBAAoB;;IACK,SAAS,UAAU,OAAO;AAE1D,aAAO,gBAAgB,SAAS,OAAO,QAAQT,SAAQ,KAAK,CAAC;;MAE5D;;;;;;;;AC3BJ,MAAI,kBAAkBnL,8BAAA;AACtB,MAAI,mBAAmBE,6BAAA;AAEvB,MAAI,iBAAiB2D,WAAA;AAGrBiI,eAAiB,kBACd,SAASA,UAAS,GAAG;AAEtB,WAAO,gBAAgB,CAAC;MAEvB,mBACC,SAASA,UAAS,GAAG;AACtB,QAAI,CAAC,KAAM,OAAO,MAAM,YAAY,OAAO,MAAM,YAAa;AAC7D,YAAM,IAAI,UAAU,yBAAyB;;AAG9C,WAAO,iBAAiB,CAAC;MAExB,iBACC,SAASA,UAAS,GAAG;AAEtB,WAAO,eAAe,CAAC;MAEtB;;;;;;;;ACxBL,MAAI,OAAO,SAAS,UAAU;AAC9B,MAAI,UAAU,OAAO,UAAU;AAC/B,MAAIN,QAAOxL;AAGG,WAAGwL,MAAK,KAAK,MAAM,OAAO;;;ACLxC,IAAIO;AAEJ,IAAI,UAAU/L;AAEd,IAAI,SAASE;AACb,IAAI,aAAa2D;AACjB,IAAI,cAAcU;AAClB,IAAI,kBAAkBG;AACtB,IAAI,eAAeiB;AACnB,IAAIgG,eAAa1D;AACjB,IAAI,YAAYC;AAEhB,IAAI,MAAMmB;AACV,IAAI,QAAQE;AACZ,IAAI,MAAMC;AACV,IAAI,MAAME;AACV,IAAI,MAAMC;AACV,IAAI,QAAQqC;AACZ,IAAIlB,SAAOmB;AAEX,IAAI,YAAY;AAGhB,IAAI,wBAAwB,SAAU,kBAAkB;AACvD,MAAI;AACH,WAAO,UAAU,2BAA2B,mBAAmB,gBAAgB,EAAC;EAClF,SAAU,GAAG;EAAA;AACb;AAEA,IAAI,QAAQC;AACZ,IAAI,kBAAkBC;AAEtB,IAAI,iBAAiB,WAAY;AAChC,QAAM,IAAIR,aAAU;AACrB;AACA,IAAI,iBAAiB,SACjB,WAAY;AACd,MAAI;AAEH,cAAU;AACV,WAAO;EACV,SAAW,cAAc;AACtB,QAAI;AAEH,aAAO,MAAM,WAAW,QAAQ,EAAE;IACtC,SAAY,YAAY;AACpB,aAAO;IACX;EACA;AACA,GAAE,IACC;AAEH,IAAI,aAAaS,kBAAsB,EAAA;AAEvC,IAAI,WAAWC,gBAAA;AACf,IAAI,aAAaC,6BAAA;AACjB,IAAI,cAAcC,8BAAA;AAElB,IAAI,SAASC,qBAAA;AACb,IAAI,QAAQC;AAEZ,IAAI,YAAY,CAAA;AAEhB,IAAI,aAAa,OAAO,eAAe,eAAe,CAAC,WAAWV,cAAY,SAAS,UAAU;AAEjG,IAAI,aAAa;EAChB,WAAW;EACX,oBAAoB,OAAO,mBAAmB,cAAcA,cAAY;EACxE,WAAW;EACX,iBAAiB,OAAO,gBAAgB,cAAcA,cAAY;EAClE,4BAA4B,cAAc,WAAW,SAAS,CAAA,EAAG,OAAO,QAAQ,EAAC,CAAE,IAAIA;EACvF,oCAAoCA;EACpC,mBAAmB;EACnB,oBAAoB;EACpB,4BAA4B;EAC5B,4BAA4B;EAC5B,aAAa,OAAO,YAAY,cAAcA,cAAY;EAC1D,YAAY,OAAO,WAAW,cAAcA,cAAY;EACxD,mBAAmB,OAAO,kBAAkB,cAAcA,cAAY;EACtE,oBAAoB,OAAO,mBAAmB,cAAcA,cAAY;EACxE,aAAa;EACb,cAAc,OAAO,aAAa,cAAcA,cAAY;EAC5D,UAAU;EACV,eAAe;EACf,wBAAwB;EACxB,eAAe;EACf,wBAAwB;EACxB,WAAW;EACX,UAAU;;EACV,eAAe;EACf,kBAAkB,OAAO,iBAAiB,cAAcA,cAAY;EACpE,kBAAkB,OAAO,iBAAiB,cAAcA,cAAY;EACpE,kBAAkB,OAAO,iBAAiB,cAAcA,cAAY;EACpE,0BAA0B,OAAO,yBAAyB,cAAcA,cAAY;EACpF,cAAc;EACd,uBAAuB;EACvB,eAAe,OAAO,cAAc,cAAcA,cAAY;EAC9D,gBAAgB,OAAO,eAAe,cAAcA,cAAY;EAChE,gBAAgB,OAAO,eAAe,cAAcA,cAAY;EAChE,cAAc;EACd,WAAW;EACX,uBAAuB,cAAc,WAAW,SAAS,SAAS,CAAA,EAAG,OAAO,QAAQ,EAAC,CAAE,CAAC,IAAIA;EAC5F,UAAU,OAAO,SAAS,WAAW,OAAOA;EAC5C,SAAS,OAAO,QAAQ,cAAcA,cAAY;EAClD,0BAA0B,OAAO,QAAQ,eAAe,CAAC,cAAc,CAAC,WAAWA,cAAY,UAAS,oBAAI,IAAG,GAAG,OAAO,QAAQ,EAAC,CAAE;EACpI,UAAU;EACV,YAAY;EACZ,YAAY;EACZ,qCAAqC;EACrC,gBAAgB;EAChB,cAAc;EACd,aAAa,OAAO,YAAY,cAAcA,cAAY;EAC1D,WAAW,OAAO,UAAU,cAAcA,cAAY;EACtD,gBAAgB;EAChB,oBAAoB;EACpB,aAAa,OAAO,YAAY,cAAcA,cAAY;EAC1D,YAAY;EACZ,SAAS,OAAO,QAAQ,cAAcA,cAAY;EAClD,0BAA0B,OAAO,QAAQ,eAAe,CAAC,cAAc,CAAC,WAAWA,cAAY,UAAS,oBAAI,IAAG,GAAG,OAAO,QAAQ,EAAC,CAAE;EACpI,uBAAuB,OAAO,sBAAsB,cAAcA,cAAY;EAC9E,YAAY;EACZ,6BAA6B,cAAc,WAAW,SAAS,GAAG,OAAO,QAAQ,EAAC,CAAE,IAAIA;EACxF,YAAY,aAAa,SAASA;EAClC,iBAAiB;EACjB,oBAAoB;EACpB,gBAAgB;EAChB,eAAeJ;EACf,gBAAgB,OAAO,eAAe,cAAcI,cAAY;EAChE,uBAAuB,OAAO,sBAAsB,cAAcA,cAAY;EAC9E,iBAAiB,OAAO,gBAAgB,cAAcA,cAAY;EAClE,iBAAiB,OAAO,gBAAgB,cAAcA,cAAY;EAClE,cAAc;EACd,aAAa,OAAO,YAAY,cAAcA,cAAY;EAC1D,aAAa,OAAO,YAAY,cAAcA,cAAY;EAC1D,aAAa,OAAO,YAAY,cAAcA,cAAY;EAE1D,6BAA6B;EAC7B,8BAA8B;EAC9B,2BAA2B;EAC3B,2BAA2B;EAC3B,cAAc;EACd,gBAAgB;EAChB,cAAc;EACd,cAAc;EACd,cAAc;EACd,gBAAgB;EAChB,eAAejB;EACf,4BAA4B;AAC7B;AAEA,IAAI,UAAU;AACb,MAAI;AACH,SAAK;EACP,SAAU,GAAG;AAEP,iBAAa,SAAS,SAAS,CAAC,CAAC;AACrC,eAAW,mBAAmB,IAAI;EACpC;AACA;AAHM;AAKN,IAAI,SAAS,SAAS4B,QAAOlL,OAAM;AAClC,MAAI;AACJ,MAAIA,UAAS,mBAAmB;AAC/B,YAAQ,sBAAsB,sBAAsB;EACtD,WAAYA,UAAS,uBAAuB;AAC1C,YAAQ,sBAAsB,iBAAiB;EACjD,WAAYA,UAAS,4BAA4B;AAC/C,YAAQ,sBAAsB,uBAAuB;EACvD,WAAYA,UAAS,oBAAoB;AACvC,QAAI,KAAKkL,QAAO,0BAA0B;AAC1C,QAAI,IAAI;AACP,cAAQ,GAAG;IACd;EACA,WAAYlL,UAAS,4BAA4B;AAC/C,QAAI,MAAMkL,QAAO,kBAAkB;AACnC,QAAI,OAAO,UAAU;AACpB,cAAQ,SAAS,IAAI,SAAS;IACjC;EACA;AAEC,aAAWlL,KAAI,IAAI;AAEnB,SAAO;AACR;AAEA,IAAI,iBAAiB;EACpB,WAAW;EACX,0BAA0B,CAAC,eAAe,WAAW;EACrD,oBAAoB,CAAC,SAAS,WAAW;EACzC,wBAAwB,CAAC,SAAS,aAAa,SAAS;EACxD,wBAAwB,CAAC,SAAS,aAAa,SAAS;EACxD,qBAAqB,CAAC,SAAS,aAAa,MAAM;EAClD,uBAAuB,CAAC,SAAS,aAAa,QAAQ;EACtD,4BAA4B,CAAC,iBAAiB,WAAW;EACzD,oBAAoB,CAAC,0BAA0B,WAAW;EAC1D,6BAA6B,CAAC,0BAA0B,aAAa,WAAW;EAChF,sBAAsB,CAAC,WAAW,WAAW;EAC7C,uBAAuB,CAAC,YAAY,WAAW;EAC/C,mBAAmB,CAAC,QAAQ,WAAW;EACvC,oBAAoB,CAAC,SAAS,WAAW;EACzC,wBAAwB,CAAC,aAAa,WAAW;EACjD,2BAA2B,CAAC,gBAAgB,WAAW;EACvD,2BAA2B,CAAC,gBAAgB,WAAW;EACvD,uBAAuB,CAAC,YAAY,WAAW;EAC/C,eAAe,CAAC,qBAAqB,WAAW;EAChD,wBAAwB,CAAC,qBAAqB,aAAa,WAAW;EACtE,wBAAwB,CAAC,aAAa,WAAW;EACjD,yBAAyB,CAAC,cAAc,WAAW;EACnD,yBAAyB,CAAC,cAAc,WAAW;EACnD,eAAe,CAAC,QAAQ,OAAO;EAC/B,mBAAmB,CAAC,QAAQ,WAAW;EACvC,kBAAkB,CAAC,OAAO,WAAW;EACrC,qBAAqB,CAAC,UAAU,WAAW;EAC3C,qBAAqB,CAAC,UAAU,WAAW;EAC3C,uBAAuB,CAAC,UAAU,aAAa,UAAU;EACzD,sBAAsB,CAAC,UAAU,aAAa,SAAS;EACvD,sBAAsB,CAAC,WAAW,WAAW;EAC7C,uBAAuB,CAAC,WAAW,aAAa,MAAM;EACtD,iBAAiB,CAAC,WAAW,KAAK;EAClC,oBAAoB,CAAC,WAAW,QAAQ;EACxC,qBAAqB,CAAC,WAAW,SAAS;EAC1C,yBAAyB,CAAC,cAAc,WAAW;EACnD,6BAA6B,CAAC,kBAAkB,WAAW;EAC3D,qBAAqB,CAAC,UAAU,WAAW;EAC3C,kBAAkB,CAAC,OAAO,WAAW;EACrC,gCAAgC,CAAC,qBAAqB,WAAW;EACjE,qBAAqB,CAAC,UAAU,WAAW;EAC3C,qBAAqB,CAAC,UAAU,WAAW;EAC3C,0BAA0B,CAAC,eAAe,WAAW;EACrD,yBAAyB,CAAC,cAAc,WAAW;EACnD,wBAAwB,CAAC,aAAa,WAAW;EACjD,yBAAyB,CAAC,cAAc,WAAW;EACnD,gCAAgC,CAAC,qBAAqB,WAAW;EACjE,0BAA0B,CAAC,eAAe,WAAW;EACrD,0BAA0B,CAAC,eAAe,WAAW;EACrD,uBAAuB,CAAC,YAAY,WAAW;EAC/C,sBAAsB,CAAC,WAAW,WAAW;EAC7C,sBAAsB,CAAC,WAAW,WAAW;AAC9C;AAEA,IAAIgK,QAAOmB;AACX,IAAI,SAASC,cAAA;AACb,IAAI,UAAUpB,MAAK,KAAK,OAAO,MAAM,UAAU,MAAM;AACrD,IAAI,eAAeA,MAAK,KAAK,QAAQ,MAAM,UAAU,MAAM;AAC3D,IAAI,WAAWA,MAAK,KAAK,OAAO,OAAO,UAAU,OAAO;AACxD,IAAI,YAAYA,MAAK,KAAK,OAAO,OAAO,UAAU,KAAK;AACvD,IAAI,QAAQA,MAAK,KAAK,OAAO,OAAO,UAAU,IAAI;AAGlD,IAAI,aAAa;AACjB,IAAI,eAAe;AACnB,IAAI,eAAe,SAASqB,cAAa,QAAQ;AAChD,MAAI,QAAQ,UAAU,QAAQ,GAAG,CAAC;AAClC,MAAI,OAAO,UAAU,QAAQ,EAAE;AAC/B,MAAI,UAAU,OAAO,SAAS,KAAK;AAClC,UAAM,IAAI,aAAa,gDAAgD;EACzE,WAAY,SAAS,OAAO,UAAU,KAAK;AACzC,UAAM,IAAI,aAAa,gDAAgD;EACzE;AACC,MAAI,SAAS,CAAA;AACb,WAAS,QAAQ,YAAY,SAAU,OAAO,QAAQ,OAAO,WAAW;AACvE,WAAO,OAAO,MAAM,IAAI,QAAQ,SAAS,WAAW,cAAc,IAAI,IAAI,UAAU;EACtF,CAAE;AACD,SAAO;AACR;AAGA,IAAI,mBAAmB,SAASC,kBAAiBtL,OAAM,cAAc;AACpE,MAAI,gBAAgBA;AACpB,MAAI;AACJ,MAAI,OAAO,gBAAgB,aAAa,GAAG;AAC1C,YAAQ,eAAe,aAAa;AACpC,oBAAgB,MAAM,MAAM,CAAC,IAAI;EACnC;AAEC,MAAI,OAAO,YAAY,aAAa,GAAG;AACtC,QAAI,QAAQ,WAAW,aAAa;AACpC,QAAI,UAAU,WAAW;AACxB,cAAQ,OAAO,aAAa;IAC/B;AACE,QAAI,OAAO,UAAU,eAAe,CAAC,cAAc;AAClD,YAAM,IAAImK,aAAW,eAAenK,QAAO,sDAAsD;IACpG;AAEE,WAAO;MACN;MACA,MAAM;MACN;IACH;EACA;AAEC,QAAM,IAAI,aAAa,eAAeA,QAAO,kBAAkB;AAChE;AAEA,IAAA,eAAiB,SAAS,aAAaA,OAAM,cAAc;AAC1D,MAAI,OAAOA,UAAS,YAAYA,MAAK,WAAW,GAAG;AAClD,UAAM,IAAImK,aAAW,2CAA2C;EAClE;AACC,MAAI,UAAU,SAAS,KAAK,OAAO,iBAAiB,WAAW;AAC9D,UAAM,IAAIA,aAAW,2CAA2C;EAClE;AAEC,MAAI,MAAM,eAAenK,KAAI,MAAM,MAAM;AACxC,UAAM,IAAI,aAAa,oFAAoF;EAC7G;AACC,MAAI,QAAQ,aAAaA,KAAI;AAC7B,MAAI,oBAAoB,MAAM,SAAS,IAAI,MAAM,CAAC,IAAI;AAEtD,MAAI,YAAY,iBAAiB,MAAM,oBAAoB,KAAK,YAAY;AAC5E,MAAI,oBAAoB,UAAU;AAClC,MAAI,QAAQ,UAAU;AACtB,MAAI,qBAAqB;AAEzB,MAAI,QAAQ,UAAU;AACtB,MAAI,OAAO;AACV,wBAAoB,MAAM,CAAC;AAC3B,iBAAa,OAAO,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;EAC5C;AAEC,WAAS,IAAI,GAAG,QAAQ,MAAM,IAAI,MAAM,QAAQ,KAAK,GAAG;AACvD,QAAI,OAAO,MAAM,CAAC;AAClB,QAAI,QAAQ,UAAU,MAAM,GAAG,CAAC;AAChC,QAAI,OAAO,UAAU,MAAM,EAAE;AAC7B,SAEG,UAAU,OAAO,UAAU,OAAO,UAAU,QACzC,SAAS,OAAO,SAAS,OAAO,SAAS,SAE3C,UAAU,MACZ;AACD,YAAM,IAAI,aAAa,sDAAsD;IAChF;AACE,QAAI,SAAS,iBAAiB,CAAC,OAAO;AACrC,2BAAqB;IACxB;AAEE,yBAAqB,MAAM;AAC3B,wBAAoB,MAAM,oBAAoB;AAE9C,QAAI,OAAO,YAAY,iBAAiB,GAAG;AAC1C,cAAQ,WAAW,iBAAiB;IACvC,WAAa,SAAS,MAAM;AACzB,UAAI,EAAE,QAAQ,QAAQ;AACrB,YAAI,CAAC,cAAc;AAClB,gBAAM,IAAImK,aAAW,wBAAwBnK,QAAO,6CAA6C;QACtG;AACI,eAAO,KAAKuK;MAChB;AACG,UAAI,SAAU,IAAI,KAAM,MAAM,QAAQ;AACrC,YAAI,OAAO,MAAM,OAAO,IAAI;AAC5B,gBAAQ,CAAC,CAAC;AASV,YAAI,SAAS,SAAS,QAAQ,EAAE,mBAAmB,KAAK,MAAM;AAC7D,kBAAQ,KAAK;QAClB,OAAW;AACN,kBAAQ,MAAM,IAAI;QACvB;MACA,OAAU;AACN,gBAAQ,OAAO,OAAO,IAAI;AAC1B,gBAAQ,MAAM,IAAI;MACtB;AAEG,UAAI,SAAS,CAAC,oBAAoB;AACjC,mBAAW,iBAAiB,IAAI;MACpC;IACA;EACA;AACC,SAAO;AACR;ACvXA,IAAIgB,gBAAe/M;AAEnB,IAAIgN,iBAAgB9M;AAGpB,IAAI,WAAW8M,eAAc,CAACD,cAAa,4BAA4B,CAAC,CAAC;AAGzE,IAAAE,cAAiB,SAAS,mBAAmBzL,OAAM,cAAc;AAGhE,MAAI;;IAA2EuL,cAAavL,OAAM,CAAC,CAAC,YAAY;;AAChH,MAAI,OAAO,cAAc,cAAc,SAASA,OAAM,aAAa,IAAI,IAAI;AAC1E,WAAOwL;;MAAoC,CAAC,SAAS;IAAC;EACxD;AACC,SAAO;AACR;;;;;;AChBA,MAAI,UAAU,SAAS,UAAU;AACjC,MAAIE,gBAAe,OAAO,YAAY,YAAY,YAAY,QAAQ,QAAQ;AAC9E,MAAI;AACJ,MAAI;AACJ,MAAI,OAAOA,kBAAiB,cAAc,OAAO,OAAO,mBAAmB,YAAY;AACtF,QAAI;AACH,qBAAe,OAAO,eAAe,CAAA,GAAI,UAAU;QAClD,KAAK,WAAY;AAChB,gBAAM;;MAEV,CAAG;AACD,yBAAmB,CAAA;AAEnB,MAAAA,cAAa,WAAY;AAAE,cAAM;MAAG,GAAI,MAAM,YAAY;aAClD,GAAG;AACX,UAAI,MAAM,kBAAkB;AAC3B,QAAAA,gBAAe;;;EAGlB,OAAO;AACN,IAAAA,gBAAe;;AAGhB,MAAI,mBAAmB;AACvB,MAAI,eAAe,SAAS,mBAAmB,OAAO;AACrD,QAAI;AACH,UAAI,QAAQ,QAAQ,KAAK,KAAK;AAC9B,aAAO,iBAAiB,KAAK,KAAK;aAC1B,GAAG;AACX,aAAO;;EAET;AAEA,MAAI,oBAAoB,SAAS,iBAAiB,OAAO;AACxD,QAAI;AACH,UAAI,aAAa,KAAK,GAAG;AAAE,eAAO;MAAM;AACxC,cAAQ,KAAK,KAAK;AAClB,aAAO;aACC,GAAG;AACX,aAAO;;EAET;AACA,MAAIC,SAAQ,OAAO,UAAU;AAC7B,MAAI,cAAc;AAClB,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,WAAW;AACf,MAAI,YAAY;AAChB,MAAI,YAAY;AAChB,MAAI,iBAAiB,OAAO,WAAW,cAAc,CAAC,CAAC,OAAO;AAE9D,MAAI,SAAS,EAAE,KAAK,CAAA,CAAA;AAEpB,MAAI,QAAQ,SAAS,mBAAmB;AAAE,WAAO;EAAM;AACvD,MAAI,OAAO,aAAa,UAAU;AAEjC,QAAI,MAAM,SAAS;AACnB,QAAIA,OAAM,KAAK,GAAG,MAAMA,OAAM,KAAK,SAAS,GAAG,GAAG;AACjD,cAAQ,SAAS,iBAAiB,OAAO;AAGxC,aAAK,UAAU,CAAC,WAAW,OAAO,UAAU,eAAe,OAAO,UAAU,WAAW;AACtF,cAAI;AACH,gBAAI,MAAMA,OAAM,KAAK,KAAK;AAC1B,oBACC,QAAQ,YACL,QAAQ,aACR,QAAQ,aACR,QAAQ,gBACP,MAAM,EAAE,KAAK;UACvB,SAAa,GAAG;UAAA;;AAEb,eAAO;MACV;;;AAIA,eAAiBD,gBACd,SAASE,YAAW,OAAO;AAC5B,QAAI,MAAM,KAAK,GAAG;AAAE,aAAO;IAAK;AAChC,QAAI,CAAC,OAAO;AAAE,aAAO;IAAM;AAC3B,QAAI,OAAO,UAAU,cAAc,OAAO,UAAU,UAAU;AAAE,aAAO;IAAM;AAC7E,QAAI;AACH,MAAAF,cAAa,OAAO,MAAM,YAAY;aAC9B,GAAG;AACX,UAAI,MAAM,kBAAkB;AAAE,eAAO;MAAM;;AAE5C,WAAO,CAAC,aAAa,KAAK,KAAK,kBAAkB,KAAK;MAErD,SAASE,YAAW,OAAO;AAC5B,QAAI,MAAM,KAAK,GAAG;AAAE,aAAO;IAAK;AAChC,QAAI,CAAC,OAAO;AAAE,aAAO;IAAM;AAC3B,QAAI,OAAO,UAAU,cAAc,OAAO,UAAU,UAAU;AAAE,aAAO;IAAM;AAC7E,QAAI,gBAAgB;AAAE,aAAO,kBAAkB,KAAK;IAAE;AACtD,QAAI,aAAa,KAAK,GAAG;AAAE,aAAO;IAAM;AACxC,QAAI,WAAWD,OAAM,KAAK,KAAK;AAC/B,QAAI,aAAa,WAAW,aAAa,YAAY,CAAE,iBAAkB,KAAK,QAAQ,GAAG;AAAE,aAAO;IAAM;AACxG,WAAO,kBAAkB,KAAK;;;;;;;;;ACjGhC,MAAIC,cAAapN,kBAAA;AAEjB,MAAImN,SAAQ,OAAO,UAAU;AAC7B,MAAIE,kBAAiB,OAAO,UAAU;AAGtC,MAAI,eAAe,SAASC,cAAa,OAAO,UAAU,UAAU;AAChE,aAAS,IAAI,GAAG,MAAM,MAAM,QAAQ,IAAI,KAAK,KAAK;AAC9C,UAAID,gBAAe,KAAK,OAAO,CAAC,GAAG;AAC/B,YAAI,YAAY,MAAM;AAClB,mBAAS,MAAM,CAAC,GAAG,GAAG,KAAK;QAC3C,OAAmB;AACH,mBAAS,KAAK,UAAU,MAAM,CAAC,GAAG,GAAG,KAAK;;;;EAI1D;AAGA,MAAI,gBAAgB,SAASE,eAAc,QAAQ,UAAU,UAAU;AACnE,aAAS,IAAI,GAAG,MAAM,OAAO,QAAQ,IAAI,KAAK,KAAK;AAE/C,UAAI,YAAY,MAAM;AAClB,iBAAS,OAAO,OAAO,CAAC,GAAG,GAAG,MAAM;MAChD,OAAe;AACH,iBAAS,KAAK,UAAU,OAAO,OAAO,CAAC,GAAG,GAAG,MAAM;;;EAG/D;AAGA,MAAI,gBAAgB,SAASC,eAAc,QAAQ,UAAU,UAAU;AACnE,aAAS,KAAK,QAAQ;AAClB,UAAIH,gBAAe,KAAK,QAAQ,CAAC,GAAG;AAChC,YAAI,YAAY,MAAM;AAClB,mBAAS,OAAO,CAAC,GAAG,GAAG,MAAM;QAC7C,OAAmB;AACH,mBAAS,KAAK,UAAU,OAAO,CAAC,GAAG,GAAG,MAAM;;;;EAI5D;AAGA,WAASI,SAAQ,GAAG;AAChB,WAAON,OAAM,KAAK,CAAC,MAAM;;AAIf,YAAG,SAASO,SAAQ,MAAM,UAAU,SAAS;AACvD,QAAI,CAACN,YAAW,QAAQ,GAAG;AACvB,YAAM,IAAI,UAAU,6BAA6B;;AAGrD,QAAI;AACJ,QAAI,UAAU,UAAU,GAAG;AACvB,iBAAW;;AAGf,QAAIK,SAAQ,IAAI,GAAG;AACf,mBAAa,MAAM,UAAU,QAAQ;IAC7C,WAAe,OAAO,SAAS,UAAU;AACjC,oBAAc,MAAM,UAAU,QAAQ;IAC9C,OAAW;AACH,oBAAc,MAAM,UAAU,QAAQ;;;;;;;;;;AC/D9C,4BAAiB;IAChB;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;;;;;;;;;ACbD,MAAI,gBAAgBzN,+BAAA;AAEpB,MAAI,IAAI,OAAO,eAAe,cAAcqG,iBAAS;AAGvC,yBAAG,SAASsH,wBAAuB;AAChD,QAA2D,MAAM,CAAA;AACjE,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC9C,UAAI,OAAO,EAAE,cAAc,CAAC,CAAC,MAAM,YAAY;AAE9C,YAAI,IAAI,MAAM,IAAI,cAAc,CAAC;;;AAGnC,WAAO;;;;;;;;;;ACbR,MAAI3C,mBAAkBhL;AAEtB,MAAI4N,gBAAe1N;AACnB,MAAIyL,cAAa9H;AAEjB,MAAIgK,SAAOtJ;AAGG,uBAAG,SAASuJ,oBACzBvN,MACA,UACA,OACC;AACD,QAAI,CAACA,QAAQ,OAAOA,SAAQ,YAAY,OAAOA,SAAQ,YAAa;AACnE,YAAM,IAAIoL,YAAW,wCAAwC;;AAE9D,QAAI,OAAO,aAAa,YAAY,OAAO,aAAa,UAAU;AACjE,YAAM,IAAIA,YAAW,0CAA0C;;AAEhE,QAAI,UAAU,SAAS,KAAK,OAAO,UAAU,CAAC,MAAM,aAAa,UAAU,CAAC,MAAM,MAAM;AACvF,YAAM,IAAIA,YAAW,yDAAyD;;AAE/E,QAAI,UAAU,SAAS,KAAK,OAAO,UAAU,CAAC,MAAM,aAAa,UAAU,CAAC,MAAM,MAAM;AACvF,YAAM,IAAIA,YAAW,uDAAuD;;AAE7E,QAAI,UAAU,SAAS,KAAK,OAAO,UAAU,CAAC,MAAM,aAAa,UAAU,CAAC,MAAM,MAAM;AACvF,YAAM,IAAIA,YAAW,2DAA2D;;AAEjF,QAAI,UAAU,SAAS,KAAK,OAAO,UAAU,CAAC,MAAM,WAAW;AAC9D,YAAM,IAAIA,YAAW,yCAAyC;;AAG/D,QAAI,gBAAgB,UAAU,SAAS,IAAI,UAAU,CAAC,IAAI;AAC1D,QAAI,cAAc,UAAU,SAAS,IAAI,UAAU,CAAC,IAAI;AACxD,QAAI,kBAAkB,UAAU,SAAS,IAAI,UAAU,CAAC,IAAI;AAC5D,QAAI,QAAQ,UAAU,SAAS,IAAI,UAAU,CAAC,IAAI;AAGlD,QAAI,OAAO,CAAC,CAACkC,UAAQA,OAAKtN,MAAK,QAAQ;AAEvC,QAAIyK,kBAAiB;AACpB,MAAAA,iBAAgBzK,MAAK,UAAU;QAC9B,cAAc,oBAAoB,QAAQ,OAAO,KAAK,eAAe,CAAC;QACtE,YAAY,kBAAkB,QAAQ,OAAO,KAAK,aAAa,CAAC;QAChE;QACA,UAAU,gBAAgB,QAAQ,OAAO,KAAK,WAAW,CAAC;MAC7D,CAAG;IACH,WAAY,SAAU,CAAC,iBAAiB,CAAC,eAAe,CAAC,iBAAkB;AAEzE,MAAAA,KAAI,QAAQ,IAAI;IAClB,OAAQ;AACN,YAAM,IAAIqN,cAAa,6GAA6G;;;;;;;;;;ACnDtI,MAAI5C,mBAAkBhL;AAEtB,MAAI,yBAAyB,SAAS+N,0BAAyB;AAC9D,WAAO,CAAC,CAAC/C;EACV;AAEA,yBAAuB,0BAA0B,SAAS,0BAA0B;AAEnF,QAAI,CAACA,kBAAiB;AACrB,aAAO;;AAER,QAAI;AACH,aAAOA,iBAAgB,CAAA,GAAI,UAAU,EAAE,OAAO,EAAC,CAAE,EAAE,WAAW;aACtD,GAAG;AAEX,aAAO;;EAET;AAEA,6BAAiB;;;;;;;;ACnBjB,MAAI+B,gBAAe/M;AACnB,MAAI,SAASE,0BAAA;AACb,MAAI,iBAAiB2D,8BAAmC,EAAA;AACxD,MAAIgI,QAAOtH;AAEX,MAAIoH,cAAajH;AACjB,MAAI,SAASqI,cAAa,cAAc;AAGxC,sBAAiB,SAASiB,mBAAkB,IAAI,QAAQ;AACvD,QAAI,OAAO,OAAO,YAAY;AAC7B,YAAM,IAAIrC,YAAW,wBAAwB;;AAE9C,QAAI,OAAO,WAAW,YAAY,SAAS,KAAK,SAAS,cAAc,OAAO,MAAM,MAAM,QAAQ;AACjG,YAAM,IAAIA,YAAW,4CAA4C;;AAGlE,QAAI,QAAQ,UAAU,SAAS,KAAK,CAAC,CAAC,UAAU,CAAC;AAEjD,QAAI,+BAA+B;AACnC,QAAI,2BAA2B;AAC/B,QAAI,YAAY,MAAME,OAAM;AAC3B,UAAI,OAAOA,MAAK,IAAI,QAAQ;AAC5B,UAAI,QAAQ,CAAC,KAAK,cAAc;AAC/B,uCAA+B;;AAEhC,UAAI,QAAQ,CAAC,KAAK,UAAU;AAC3B,mCAA2B;;;AAI7B,QAAI,gCAAgC,4BAA4B,CAAC,OAAO;AACvE,UAAI,gBAAgB;AACnB;;UAA6C;UAAK;UAAU;UAAQ;UAAM;QAAI;MACjF,OAAS;AACN;;UAA6C;UAAK;UAAU;QAAM;;;AAGpE,WAAO;;;;;;;;;ACtCR,MAAIL,QAAOxL;AACX,MAAIyL,UAASvL,qBAAA;AACb,MAAI+N,gBAAcpK;AAGJ,cAAG,SAASqK,aAAY;AACrC,WAAOD,cAAYzC,OAAMC,SAAQ,SAAS;;;;;;;;;ACN3C,QAAIuC,qBAAoBhO,yBAAA;AAExB,QAAIgL,mBAAkB9K;AAEtB,QAAI8M,iBAAgBnJ;AACpB,QAAIqK,aAAY3J,iBAAA;AAEhB,WAAA,UAAiB,SAASqH,UAAS,kBAAkB;AACpD,UAAI,OAAOoB,eAAc,SAAS;AAClC,UAAI,iBAAiB,iBAAiB,UAAU,UAAU,SAAS;AACnE,aAAOgB;QACN;QACA,KAAK,iBAAiB,IAAI,iBAAiB;QAC3C;MACF;IACA;AAEA,QAAIhD,kBAAiB;AACpB,MAAAA,iBAAgB,OAAO,SAAS,SAAS,EAAE,OAAOkD,WAAS,CAAE;IAC9D,OAAO;AACN,aAAA,QAAA,QAAuBA;IACxB;;;;;;;;;ACrBA,MAAIhD,cAAalL,eAAA;AAGH,UAAG,SAAS,sBAAsB;AAC/C,WAAOkL,YAAU,KAAM,CAAC,CAAC,OAAO;;;;;;;;;ACJjC,MAAIwC,WAAU1N,eAAA;AACd,MAAI2N,wBAAuBzN,4BAAA;AAC3B,MAAI0L,YAAW/H,gBAAA;AACf,MAAIoJ,aAAY1I;AAChB,MAAIsH,QAAOnH;AACX,MAAIoH,YAAWnG,gBAAA;AAEf,MAAI,YAAYsH,WAAU,2BAA2B;AACrD,MAAI,iBAAiBhF,aAAgC,EAAA;AAErD,MAAI,IAAI,OAAO,eAAe,cAAc5B,iBAAS;AACrD,MAAI,cAAcsH,sBAAoB;AAEtC,MAAI,SAASV,WAAU,wBAAwB;AAG/C,MAAIkB,YAAWlB,WAAU,2BAA2B,IAAI,KAAK,SAAS,QAAQ,OAAO,OAAO;AAC3F,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,UAAI,MAAM,CAAC,MAAM,OAAO;AACvB,eAAO;;;AAGT,WAAO;EACR;AAIA,MAAI,QAAQ,EAAE,WAAW,KAAI;AAC7B,MAAI,kBAAkBpB,SAAQC,WAAU;AACvC,IAAA4B,SAAQ,aAAa,SAAU,YAAY;AAC1C,UAAI,MAAM,IAAI,EAAE,UAAU,EAAC;AAC3B,UAAI,OAAO,eAAe,OAAO5B,WAAU;AAC1C,YAAI1L,SAAQ0L,UAAS,GAAG;AAExB,YAAI,aAAaD,MAAKzL,QAAO,OAAO,WAAW;AAC/C,YAAI,CAAC,cAAcA,QAAO;AACzB,cAAI,aAAa0L,UAAS1L,MAAK;AAE/B,uBAAayL,MAAK,YAAY,OAAO,WAAW;;AAGjD,cAAM,MAAM,UAAU,IAAID,UAAS,WAAW,GAAG;;IAEpD,CAAE;EACF,OAAO;AACN,IAAA8B,SAAQ,aAAa,SAAU,YAAY;AAC1C,UAAI,MAAM,IAAI,EAAE,UAAU,EAAC;AAC3B,UAAI,KAAK,IAAI,SAAS,IAAI;AAC1B,UAAI,IAAI;AACP;;UACkD,MAAM;;;QAGvD9B,UAAS,EAAE;;IAGf,CAAE;;AAIF,MAAI,iBAAiB,SAAS,kBAAkB,OAAO;AACF,QAAI,QAAQ;AAChE,IAAA8B;;MACmE;;MAElE,SAAU,QAAQ,YAAY;AAC7B,YAAI,CAAC,OAAO;AACX,cAAI;AAEH,gBAAI,MAAM,OAAO,KAAK,MAAM,YAAY;AACvC;cAAmD,OAAO,YAAY,CAAC;;UAE7E,SAAa,GAAG;UAAA;;;IAGhB;AACC,WAAO;EACR;AAGA,MAAI,YAAY,SAAS,aAAa,OAAO;AACG,QAAI,QAAQ;AAC3D,IAAAA;;MACkE;;MACgB,SAAU,QAAQlM,OAAM;AACxG,YAAI,CAAC,OAAO;AACX,cAAI;AAEH,mBAAO,KAAK;AACZ;YAAmD,OAAOA,OAAM,CAAC;UACtE,SAAa,GAAG;UAAA;;;IAGhB;AACC,WAAO;EACR;AAGA,oBAAiB,SAAS4M,iBAAgB,OAAO;AAChD,QAAI,CAAC,SAAS,OAAO,UAAU,UAAU;AAAE,aAAO;IAAM;AACxD,QAAI,CAAC,gBAAgB;AAEpB,UAAI,MAAM,OAAO,UAAU,KAAK,GAAG,GAAG,EAAE;AACxC,UAAID,UAAS,aAAa,GAAG,IAAI,IAAI;AACpC,eAAO;;AAER,UAAI,QAAQ,UAAU;AACrB,eAAO;;AAGR,aAAO,UAAU,KAAK;;AAEvB,QAAI,CAACtC,OAAM;AAAE,aAAO;IAAK;AACzB,WAAO,eAAe,KAAK;;;;;;;;;ACjH5B,MAAIuC,mBAAkBpO,uBAAA;AAGtBqO,mBAAiB,SAASA,cAAa,OAAO;AAC7C,WAAO,CAAC,CAACD,iBAAgB,KAAK;;;;ACJ/B,IAAI,aAAapO;AAEjB,IAAI,YAAYE;AAGhB,IAAI,oBAAoB,UAAU,+BAA+B,IAAI;AAErE,IAAImO,iBAAexK,oBAAA;AAInB,IAAAyK,qBAAiB,qBAAqB,SAAS,iBAAiB,GAAG;AAClE,MAAI,CAACD,eAAa,CAAC,GAAG;AACrB,UAAM,IAAI,WAAW,mBAAmB;EAC1C;AACC,SAAO,EAAE;AACV;AChBA,IAAIlO,WAASH,oBAAuB;AACpC,IAAIyN,YAAUvN;AACd,IAAIoO,oBAAmBzK;AAEvB,IAAI0K,WAAS,YAAY,UAAU,SAAS,OAAOhO,MAAK;AACvD,MAAI;AACH,IAAA+N,kBAAiB/N,IAAG;AACpB,WAAO;EACT,SAAU,GAAG;AACX,WAAO;EACT;AACA;AAEA,IAAI4J,kBAAgB,OAAO,eAAe;AAC1C,IAAIC,mBAAiB,OAAO,gBAAgB,eACxC,OAAO,eAAe;AAC1B,IAAI,qBAAqBA,qBAAmBjK,SAAO,qBAAqB,cAAcA,SAAO;AAE7F,IAAAsC,aAAiB,SAAS,SAAS,MAAM,UAAU;AAClD,MAAItC,SAAO,SAAS,IAAI,GAAG;AAC1B,QAAI,KAAK,eAAe,EAAE,cAAc,OAAO;AAE9C,aAAOA,SAAO,KAAK,IAAI;IAC1B;AACE,WAAO;EACT;AAEC,MAAI,OAAO,SAAS,UAAU;AAC7B,WAAOA,SAAO,KAAK,MAAM,QAAQ;EACnC;AAMC,MAAIiK,oBAAkBmE,SAAO,IAAI,GAAG;AAEnC,QAAI,KAAK,eAAe,GAAG;AAC1B,aAAOpO,SAAO,MAAM,CAAC;IACxB;AAGE,QAAI,oBAAoB;AACvB,UAAI,MAAMA,SAAO,KAAK,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AAKnE,UAAI,IAAI,eAAe,KAAK,YAAY;AACvC,eAAO;MACX;IACA;AAGE,QAAI,QAAQ,gBAAgB,aAAa,OAAO,IAAI,WAAW,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AAC5G,QAAI,SAASA,SAAO,KAAK,KAAK;AAM9B,QAAI,OAAO,WAAW,KAAK,YAAY;AACtC,aAAO;IACV;EACA;AAMC,MAAIgK,mBAAiB,gBAAgB,YAAY;AAChD,WAAOhK,SAAO,KAAK,IAAI;EACzB;AAEC,MAAI,QAAQsN,UAAQ,IAAI;AACxB,MAAI,OAAO;AACV,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACxC,UAAI,IAAI,KAAK,CAAC;AACd,UACC,OAAO,MAAM,YACV,IAAI,KACJ,IAAI,OACJ,CAAC,CAAC,MAAM,GACV;AACD,cAAM,IAAI,WAAW,iDAAiD;MAC1E;IACA;EACA;AAOC,MACC,SACCtN,SAAO,SAAS,IAAI,KACjB,KAAK,eACL,OAAO,KAAK,YAAY,aAAa,cACrC,KAAK,YAAY,SAAS,IAAI,GAEjC;AACD,WAAOA,SAAO,KAAK,IAAI;EACzB;AAEC,QAAM,IAAI,UAAU,wFAAwF;AAC7G;AC1GA,IAAIA,WAASH,oBAAuB;AACpC,IAAIyC,aAAWvC;AAEf,IAAIiK,kBAAgB,OAAO,eAAe;AAC1C,IAAIC,mBAAiBD,mBAAiB,OAAO,gBAAgB;AAC7D,IAAIoE,WAASnE,oBAAkB,YAAY;AAE3C,IAAAoE,eAAiB,SAAU,OAAO,UAAU;AAC3C,MACC,OAAO,UAAU,YACZrO,SAAO,SAAS,KAAK,KACpBgK,mBAAiB,iBAAiB,cAClCoE,YAAUA,SAAO,KAAK,GAC3B;AACD,WAAO9L,WAAS,OAAO,QAAQ;EACjC;AACC,QAAM,IAAI,UAAU,6EAA6E;AAClG;;;ACjBA,IAAI,OAAO,YAAY,eACnB,CAAC,QAAQ,WACT,QAAQ,QAAQ,QAAQ,KAAK,MAAM,KACnC,QAAQ,QAAQ,QAAQ,KAAK,MAAM,KAAK,QAAQ,QAAQ,QAAQ,OAAO,MAAM,GAAG;AAClFgM,qBAAAA,UAAiB,EAAE,UAAUC,WAAQ;AACvC,OAAO;AACLD,qBAAA,UAAiB;AACnB;AAEA,SAASC,WAAS,IAAI,MAAM,MAAM,MAAM;AACtC,MAAI,OAAO,OAAO,YAAY;AAC5B,UAAM,IAAI,UAAU,wCAAwC;EAChE;AACE,MAAI,MAAM,UAAU;AACpB,MAAI,MAAM;AACV,UAAQ,KAAG;IACX,KAAK;IACL,KAAK;AACH,aAAO,QAAQ,SAAS,EAAE;IAC5B,KAAK;AACH,aAAO,QAAQ,SAAS,SAAS,eAAe;AAC9C,WAAG,KAAK,MAAM,IAAI;MACxB,CAAK;IACH,KAAK;AACH,aAAO,QAAQ,SAAS,SAAS,eAAe;AAC9C,WAAG,KAAK,MAAM,MAAM,IAAI;MAC9B,CAAK;IACH,KAAK;AACH,aAAO,QAAQ,SAAS,SAAS,iBAAiB;AAChD,WAAG,KAAK,MAAM,MAAM,MAAM,IAAI;MACpC,CAAK;IACH;AACE,aAAO,IAAI,MAAM,MAAM,CAAC;AACxB,UAAI;AACJ,aAAO,IAAI,KAAK,QAAQ;AACtB,aAAK,GAAG,IAAI,UAAU,CAAC;MAC7B;AACI,aAAO,QAAQ,SAAS,SAAS,YAAY;AAC3C,WAAG,MAAM,MAAM,IAAI;MACzB,CAAK;EACL;AACA;;AC3CA,IAAI/N,aAAW,CAAA,EAAG;AAElB,IAAA,UAAiB,MAAM,WAAW,SAAU,KAAK;AAC/C,SAAOA,WAAS,KAAK,GAAG,KAAK;AAC/B;ICJA,gBAAiBX,cAAkB;;;ACCnC,MAAIH,UAASG;AACb,MAAIG,UAASN,QAAO;AAGpB,WAAS,UAAW,KAAK,KAAK;AAC5B,aAASgC,QAAO,KAAK;AACnB,UAAIA,IAAG,IAAI,IAAIA,IAAG;;;AAGtB,MAAI1B,QAAO,QAAQA,QAAO,SAASA,QAAO,eAAeA,QAAO,iBAAiB;AAC/E,WAAA,UAAiBN;EACnB,OAAO;AAEL,cAAUA,SAAQ,OAAO;AACzB,YAAA,SAAiB;;AAGnB,WAAS,WAAY,KAAK,kBAAkB,QAAQ;AAClD,WAAOM,QAAO,KAAK,kBAAkB,MAAM;;AAI7C,YAAUA,SAAQ,UAAU;AAE5B,aAAW,OAAO,SAAU,KAAK,kBAAkB,QAAQ;AACzD,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,IAAI,UAAU,+BAA+B;;AAErD,WAAOA,QAAO,KAAK,kBAAkB,MAAM;;AAG7C,aAAW,QAAQ,SAAU,MAAM,MAAM,UAAU;AACjD,QAAI,OAAO,SAAS,UAAU;AAC5B,YAAM,IAAI,UAAU,2BAA2B;;AAEjD,QAAI,MAAMA,QAAO,IAAI;AACrB,QAAI,SAAS,QAAW;AACtB,UAAI,OAAO,aAAa,UAAU;AAChC,YAAI,KAAK,MAAM,QAAQ;MAC7B,OAAW;AACL,YAAI,KAAK,IAAI;;IAEnB,OAAS;AACL,UAAI,KAAK,CAAC;;AAEZ,WAAO;;AAGT,aAAW,cAAc,SAAU,MAAM;AACvC,QAAI,OAAO,SAAS,UAAU;AAC5B,YAAM,IAAI,UAAU,2BAA2B;;AAEjD,WAAOA,QAAO,IAAI;;AAGpB,aAAW,kBAAkB,SAAU,MAAM;AAC3C,QAAI,OAAO,SAAS,UAAU;AAC5B,YAAM,IAAI,UAAU,2BAA2B;;AAEjD,WAAON,QAAO,WAAW,IAAI;EAC/B;;;;ACrCA,SAAS4N,UAAQ,KAAK;AACpB,MAAI,MAAM,SAAS;AACjB,WAAO,MAAM,QAAQ,GAAG;EAC5B;AACE,SAAOkB,iBAAe,GAAG,MAAM;AACjC;AACeC,OAAA,UAAGnB;AAElB,SAAS,UAAU,KAAK;AACtB,SAAO,OAAO,QAAQ;AACxB;AACiBmB,OAAA,YAAG;AAEpB,SAAS,OAAO,KAAK;AACnB,SAAO,QAAQ;AACjB;AACcA,OAAA,SAAG;AAEjB,SAAS,kBAAkB,KAAK;AAC9B,SAAO,OAAO;AAChB;AACyBA,OAAA,oBAAG;AAE5B,SAAS,SAAS,KAAK;AACrB,SAAO,OAAO,QAAQ;AACxB;AACgBA,OAAA,WAAG;AAEnB,SAASC,WAAS,KAAK;AACrB,SAAO,OAAO,QAAQ;AACxB;AACgBD,OAAA,WAAGC;AAEnB,SAAS,SAAS,KAAK;AACrB,SAAO,OAAO,QAAQ;AACxB;AACgBD,OAAA,WAAG;AAEnB,SAAS,YAAY,KAAK;AACxB,SAAO,QAAQ;AACjB;AACmBA,OAAA,cAAG;AAEtB,SAAS,SAAS,IAAI;AACpB,SAAOD,iBAAe,EAAE,MAAM;AAChC;AACgBC,OAAA,WAAG;AAEnB,SAASE,WAAS,KAAK;AACrB,SAAO,OAAO,QAAQ,YAAY,QAAQ;AAC5C;AACgBF,OAAA,WAAGE;AAEnB,SAAS,OAAO,GAAG;AACjB,SAAOH,iBAAe,CAAC,MAAM;AAC/B;AACcC,OAAA,SAAG;AAEjB,SAASG,SAAQ,GAAG;AAClB,SAAQJ,iBAAe,CAAC,MAAM,oBAAoB,aAAa;AACjE;AACeC,OAAA,UAAGG;AAElB,SAASC,aAAW,KAAK;AACvB,SAAO,OAAO,QAAQ;AACxB;AACkBJ,OAAA,aAAGI;AAErB,SAAS,YAAY,KAAK;AACxB,SAAO,QAAQ,QACR,OAAO,QAAQ,aACf,OAAO,QAAQ,YACf,OAAO,QAAQ,YACf,OAAO,QAAQ;EACf,OAAO,QAAQ;AACxB;AACmBJ,OAAA,cAAG;AAEtBA,OAAA,WAAmB5O,SAAkB,OAAO;AAE5C,SAAS2O,iBAAe,GAAG;AACzB,SAAO,OAAO,UAAU,SAAS,KAAK,CAAC;AACzC;;;;;;;ACxGA,aAAS,gBAAgB,UAAU,aAAa;AAAE,UAAI,EAAE,oBAAoB,cAAc;AAAE,cAAM,IAAI,UAAU,mCAAmC;MAAE;IAAE;AAEvJ,QAAIxO,UAASH,kBAAuB;AACpC,QAAI4O,QAAO1O;AAEX,aAAS,WAAW,KAAK,QAAQ,QAAQ;AACvC,UAAI,KAAK,QAAQ,MAAM;;AAGzB,WAAA,WAAiB,WAAY;AAC3B,eAASmH,cAAa;AACpB,wBAAgB,MAAMA,WAAU;AAEhC,aAAK,OAAO;AACZ,aAAK,OAAO;AACZ,aAAK,SAAS;;AAGhB,MAAAA,YAAW,UAAU,OAAO,SAAS,KAAK,GAAG;AAC3C,YAAI,QAAQ,EAAE,MAAM,GAAG,MAAM,KAAI;AACjC,YAAI,KAAK,SAAS,EAAG,MAAK,KAAK,OAAO;YAAW,MAAK,OAAO;AAC7D,aAAK,OAAO;AACZ,UAAE,KAAK;MACX;AAEE,MAAAA,YAAW,UAAU,UAAU,SAAS,QAAQ,GAAG;AACjD,YAAI,QAAQ,EAAE,MAAM,GAAG,MAAM,KAAK,KAAI;AACtC,YAAI,KAAK,WAAW,EAAG,MAAK,OAAO;AACnC,aAAK,OAAO;AACZ,UAAE,KAAK;MACX;AAEE,MAAAA,YAAW,UAAU,QAAQ,SAAS,QAAQ;AAC5C,YAAI,KAAK,WAAW,EAAG;AACvB,YAAI,MAAM,KAAK,KAAK;AACpB,YAAI,KAAK,WAAW,EAAG,MAAK,OAAO,KAAK,OAAO;YAAU,MAAK,OAAO,KAAK,KAAK;AAC/E,UAAE,KAAK;AACP,eAAO;MACX;AAEE,MAAAA,YAAW,UAAU,QAAQ,SAAS,QAAQ;AAC5C,aAAK,OAAO,KAAK,OAAO;AACxB,aAAK,SAAS;MAClB;AAEE,MAAAA,YAAW,UAAU,OAAO,SAASC,MAAKvH,IAAG;AAC3C,YAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,YAAI,IAAI,KAAK;AACb,YAAI,MAAM,KAAK,EAAE;AACjB,eAAO,IAAI,EAAE,MAAM;AACjB,iBAAOA,KAAI,EAAE;;AACd,eAAO;MACZ;AAEE,MAAAsH,YAAW,UAAU,SAAS,SAAS,OAAO,GAAG;AAC/C,YAAI,KAAK,WAAW,EAAG,QAAOlH,QAAO,MAAM,CAAC;AAC5C,YAAI,MAAMA,QAAO,YAAY,MAAM,CAAC;AACpC,YAAI,IAAI,KAAK;AACb,YAAI,IAAI;AACR,eAAO,GAAG;AACR,qBAAW,EAAE,MAAM,KAAK,CAAC;AACzB,eAAK,EAAE,KAAK;AACZ,cAAI,EAAE;;AAER,eAAO;MACX;AAEE,aAAOkH;IACT,GAAC;AAED,QAAIuH,SAAQA,MAAK,WAAWA,MAAK,QAAQ,QAAQ;AAC/C,aAAO,QAAQ,UAAUA,MAAK,QAAQ,MAAM,IAAI,WAAY;AAC1D,YAAIrO,OAAMqO,MAAK,QAAQ,EAAE,QAAQ,KAAK,OAAM,CAAE;AAC9C,eAAO,KAAK,YAAY,OAAO,MAAMrO;MACzC;IACA;;;;ACzEA,IAAI,MAAMP;AAIV,SAAS,QAAQ,KAAK,IAAI;AACxB,MAAI,QAAQ;AAEZ,MAAI,oBAAoB,KAAK,kBAAkB,KAAK,eAAe;AACnE,MAAI,oBAAoB,KAAK,kBAAkB,KAAK,eAAe;AAEnE,MAAI,qBAAqB,mBAAmB;AAC1C,QAAI,IAAI;AACN,SAAG,GAAG;IACZ,WAAe,KAAK;AACd,UAAI,CAAC,KAAK,gBAAgB;AACxB,YAAI,SAAS,aAAa,MAAM,GAAG;MAC3C,WAAiB,CAAC,KAAK,eAAe,cAAc;AAC5C,aAAK,eAAe,eAAe;AACnC,YAAI,SAAS,aAAa,MAAM,GAAG;MAC3C;IACA;AAEI,WAAO;EACX;AAKE,MAAI,KAAK,gBAAgB;AACvB,SAAK,eAAe,YAAY;EACpC;AAGE,MAAI,KAAK,gBAAgB;AACvB,SAAK,eAAe,YAAY;EACpC;AAEE,OAAK,SAAS,OAAO,MAAM,SAAUyH,MAAK;AACxC,QAAI,CAAC,MAAMA,MAAK;AACd,UAAI,CAAC,MAAM,gBAAgB;AACzB,YAAI,SAAS,aAAa,OAAOA,IAAG;MAC5C,WAAiB,CAAC,MAAM,eAAe,cAAc;AAC7C,cAAM,eAAe,eAAe;AACpC,YAAI,SAAS,aAAa,OAAOA,IAAG;MAC5C;IACA,WAAe,IAAI;AACb,SAAGA,IAAG;IACZ;EACA,CAAG;AAED,SAAO;AACT;AAEA,SAAS,YAAY;AACnB,MAAI,KAAK,gBAAgB;AACvB,SAAK,eAAe,YAAY;AAChC,SAAK,eAAe,UAAU;AAC9B,SAAK,eAAe,QAAQ;AAC5B,SAAK,eAAe,aAAa;EACrC;AAEE,MAAI,KAAK,gBAAgB;AACvB,SAAK,eAAe,YAAY;AAChC,SAAK,eAAe,QAAQ;AAC5B,SAAK,eAAe,SAAS;AAC7B,SAAK,eAAe,cAAc;AAClC,SAAK,eAAe,cAAc;AAClC,SAAK,eAAe,WAAW;AAC/B,SAAK,eAAe,eAAe;EACvC;AACA;AAEA,SAAS,YAAY3E,OAAM,KAAK;AAC9B,EAAAA,MAAK,KAAK,SAAS,GAAG;AACxB;AAEA,IAAA,YAAiB;EACf;EACA;AACF;;;;;;ACtDA,MAAImM,OAAMjP;AAGI,qBAAG;AAYjB,WAAS,cAAc2D,QAAO;AAC5B,QAAI,QAAQ;AAEZ,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,SAAS,WAAY;AACxB,qBAAe,OAAOA,MAAK;IAC/B;;AAKA,MAAI,aAAa,CAAC,QAAQ,WAAW,CAAC,SAAS,OAAO,EAAE,QAAQ,QAAQ,QAAQ,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,eAAesL,KAAI;AAIvH,MAAIlH;AAGJ,WAAS,gBAAgB;AAGzB,MAAI6G,QAAO,OAAO,OAAO1O,MAAuB;AAChD,EAAA0O,MAAK,WAAW/K;AAIhB,MAAI,eAAe;IACjB,WAAWU;EACb;AAIA,MAAIyD,UAAStD;AAKb,MAAIvE,UAASwF,kBAAuB;AACpC,MAAI,iBAAiB,OAAOU,mBAAW,cAAcA,iBAAS,OAAO,WAAW,cAAc,SAAS,OAAO,SAAS,cAAc,OAAO,CAAA,GAAI,cAAc,WAAY;EAAA;AAC1K,WAAS,oBAAoB,OAAO;AAClC,WAAOlG,QAAO,KAAK,KAAK;;AAE1B,WAAS,cAAcI,MAAK;AAC1B,WAAOJ,QAAO,SAASI,IAAG,KAAKA,gBAAe;;AAKhD,MAAI,cAAc0H;AAElB,EAAA2G,MAAK,SAAS,UAAU5G,OAAM;AAE9B,WAAS,MAAM;EAAA;AAEf,WAAS,cAAc,SAAS,QAAQ;AACtC,IAAAD,UAASA,WAAUG,sBAAAA;AAEnB,cAAU,WAAW,CAAA;AAOrB,QAAI,WAAW,kBAAkBH;AAIjC,SAAK,aAAa,CAAC,CAAC,QAAQ;AAE5B,QAAI,SAAU,MAAK,aAAa,KAAK,cAAc,CAAC,CAAC,QAAQ;AAK7D,QAAI,MAAM,QAAQ;AAClB,QAAI,cAAc,QAAQ;AAC1B,QAAI,aAAa,KAAK,aAAa,KAAK,KAAK;AAE7C,QAAI,OAAO,QAAQ,EAAG,MAAK,gBAAgB;aAAa,aAAa,eAAe,gBAAgB,GAAI,MAAK,gBAAgB;QAAiB,MAAK,gBAAgB;AAGnK,SAAK,gBAAgB,KAAK,MAAM,KAAK,aAAa;AAGlD,SAAK,cAAc;AAGnB,SAAK,YAAY;AAEjB,SAAK,SAAS;AAEd,SAAK,QAAQ;AAEb,SAAK,WAAW;AAGhB,SAAK,YAAY;AAKjB,QAAI,WAAW,QAAQ,kBAAkB;AACzC,SAAK,gBAAgB,CAAC;AAKtB,SAAK,kBAAkB,QAAQ,mBAAmB;AAKlD,SAAK,SAAS;AAGd,SAAK,UAAU;AAGf,SAAK,SAAS;AAMd,SAAK,OAAO;AAKZ,SAAK,mBAAmB;AAGxB,SAAK,UAAU,SAAU,IAAI;AAC3B,cAAQ,QAAQ,EAAE;IACtB;AAGE,SAAK,UAAU;AAGf,SAAK,WAAW;AAEhB,SAAK,kBAAkB;AACvB,SAAK,sBAAsB;AAI3B,SAAK,YAAY;AAIjB,SAAK,cAAc;AAGnB,SAAK,eAAe;AAGpB,SAAK,uBAAuB;AAI5B,SAAK,qBAAqB,IAAI,cAAc,IAAI;;AAGlD,gBAAc,UAAU,YAAY,SAAS,YAAY;AACvD,QAAI,UAAU,KAAK;AACnB,QAAI,MAAM,CAAA;AACV,WAAO,SAAS;AACd,UAAI,KAAK,OAAO;AAChB,gBAAU,QAAQ;;AAEpB,WAAO;EACT;AAEA,GAAC,WAAY;AACX,QAAI;AACF,aAAO,eAAe,cAAc,WAAW,UAAU;QACvD,KAAK,aAAa,UAAU,WAAY;AACtC,iBAAO,KAAK,UAAS;QAC7B,GAAS,8EAAmF,SAAS;MACrG,CAAK;IACL,SAAW,GAAG;IAAA;EACd,GAAC;AAID,MAAI;AACJ,MAAI,OAAO,WAAW,cAAc,OAAO,eAAe,OAAO,SAAS,UAAU,OAAO,WAAW,MAAM,YAAY;AACtH,sBAAkB,SAAS,UAAU,OAAO,WAAW;AACvD,WAAO,eAAe,UAAU,OAAO,aAAa;MAClD,OAAO,SAAU,QAAQ;AACvB,YAAI,gBAAgB,KAAK,MAAM,MAAM,EAAG,QAAO;AAC/C,YAAI,SAAS,SAAU,QAAO;AAE9B,eAAO,UAAU,OAAO,0BAA0B;;IAExD,CAAG;EACH,OAAO;AACL,sBAAkB,SAAU,QAAQ;AAClC,aAAO,kBAAkB;IAC7B;;AAGA,WAAS,SAAS,SAAS;AACzB,IAAAA,UAASA,WAAUG,sBAAAA;AASnB,QAAI,CAAC,gBAAgB,KAAK,UAAU,IAAI,KAAK,EAAE,gBAAgBH,UAAS;AACtE,aAAO,IAAI,SAAS,OAAO;;AAG7B,SAAK,iBAAiB,IAAI,cAAc,SAAS,IAAI;AAGrD,SAAK,WAAW;AAEhB,QAAI,SAAS;AACX,UAAI,OAAO,QAAQ,UAAU,WAAY,MAAK,SAAS,QAAQ;AAE/D,UAAI,OAAO,QAAQ,WAAW,WAAY,MAAK,UAAU,QAAQ;AAEjE,UAAI,OAAO,QAAQ,YAAY,WAAY,MAAK,WAAW,QAAQ;AAEnE,UAAI,OAAO,QAAQ,UAAU,WAAY,MAAK,SAAS,QAAQ;;AAGjE,IAAAC,QAAO,KAAK,IAAI;;AAIlB,WAAS,UAAU,OAAO,WAAY;AACpC,SAAK,KAAK,SAAS,IAAI,MAAM,2BAA2B,CAAC;EAC3D;AAEA,WAAS,cAAc,QAAQ,IAAI;AACjC,QAAI,KAAK,IAAI,MAAM,iBAAiB;AAEpC,WAAO,KAAK,SAAS,EAAE;AACvB,IAAAiH,KAAI,SAAS,IAAI,EAAE;;AAMrB,WAAS,WAAW,QAAQtL,QAAO,OAAO,IAAI;AAC5C,QAAI,QAAQ;AACZ,QAAI,KAAK;AAET,QAAI,UAAU,MAAM;AAClB,WAAK,IAAI,UAAU,qCAAqC;IAC5D,WAAa,OAAO,UAAU,YAAY,UAAU,UAAa,CAACA,OAAM,YAAY;AAChF,WAAK,IAAI,UAAU,iCAAiC;;AAEtD,QAAI,IAAI;AACN,aAAO,KAAK,SAAS,EAAE;AACvB,MAAAsL,KAAI,SAAS,IAAI,EAAE;AACnB,cAAQ;;AAEV,WAAO;;AAGT,WAAS,UAAU,QAAQ,SAAU,OAAO,UAAU,IAAI;AACxD,QAAItL,SAAQ,KAAK;AACjB,QAAI,MAAM;AACV,QAAI,QAAQ,CAACA,OAAM,cAAc,cAAc,KAAK;AAEpD,QAAI,SAAS,CAACxD,QAAO,SAAS,KAAK,GAAG;AACpC,cAAQ,oBAAoB,KAAK;;AAGnC,QAAI,OAAO,aAAa,YAAY;AAClC,WAAK;AACL,iBAAW;;AAGb,QAAI,MAAO,YAAW;aAAkB,CAAC,SAAU,YAAWwD,OAAM;AAEpE,QAAI,OAAO,OAAO,WAAY,MAAK;AAEnC,QAAIA,OAAM,MAAO,eAAc,MAAM,EAAE;aAAW,SAAS,WAAW,MAAMA,QAAO,OAAO,EAAE,GAAG;AAC7F,MAAAA,OAAM;AACN,YAAM,cAAc,MAAMA,QAAO,OAAO,OAAO,UAAU,EAAE;;AAG7D,WAAO;EACT;AAEA,WAAS,UAAU,OAAO,WAAY;AACpC,QAAIA,SAAQ,KAAK;AAEjB,IAAAA,OAAM;EACR;AAEA,WAAS,UAAU,SAAS,WAAY;AACtC,QAAIA,SAAQ,KAAK;AAEjB,QAAIA,OAAM,QAAQ;AAChB,MAAAA,OAAM;AAEN,UAAI,CAACA,OAAM,WAAW,CAACA,OAAM,UAAU,CAACA,OAAM,oBAAoBA,OAAM,gBAAiB,aAAY,MAAMA,MAAK;;EAEpH;AAEA,WAAS,UAAU,qBAAqB,SAAS,mBAAmB,UAAU;AAE5E,QAAI,OAAO,aAAa,SAAU,YAAW,SAAS,YAAW;AACjE,QAAI,EAAE,CAAC,OAAO,QAAQ,SAAS,SAAS,UAAU,UAAU,QAAQ,SAAS,WAAW,YAAY,KAAK,EAAE,SAAS,WAAW,IAAI,YAAW,CAAE,IAAI,IAAK,OAAM,IAAI,UAAU,uBAAuB,QAAQ;AAC5M,SAAK,eAAe,kBAAkB;AACtC,WAAO;EACT;AAEA,WAAS,YAAYA,QAAO,OAAO,UAAU;AAC3C,QAAI,CAACA,OAAM,cAAcA,OAAM,kBAAkB,SAAS,OAAO,UAAU,UAAU;AACnF,cAAQxD,QAAO,KAAK,OAAO,QAAQ;;AAErC,WAAO;;AAGT,SAAO,eAAe,SAAS,WAAW,yBAAyB;;;;IAIjE,YAAY;IACZ,KAAK,WAAY;AACf,aAAO,KAAK,eAAe;;EAE/B,CAAC;AAKD,WAAS,cAAc,QAAQwD,QAAO,OAAO,OAAO,UAAU,IAAI;AAChE,QAAI,CAAC,OAAO;AACV,UAAI,WAAW,YAAYA,QAAO,OAAO,QAAQ;AACjD,UAAI,UAAU,UAAU;AACtB,gBAAQ;AACR,mBAAW;AACX,gBAAQ;;;AAGZ,QAAI,MAAMA,OAAM,aAAa,IAAI,MAAM;AAEvC,IAAAA,OAAM,UAAU;AAEhB,QAAI,MAAMA,OAAM,SAASA,OAAM;AAE/B,QAAI,CAAC,IAAK,CAAAA,OAAM,YAAY;AAE5B,QAAIA,OAAM,WAAWA,OAAM,QAAQ;AACjC,UAAI,OAAOA,OAAM;AACjB,MAAAA,OAAM,sBAAsB;QAC1B;QACA;QACA;QACA,UAAU;QACV,MAAM;MACZ;AACI,UAAI,MAAM;AACR,aAAK,OAAOA,OAAM;MACxB,OAAW;AACL,QAAAA,OAAM,kBAAkBA,OAAM;;AAEhC,MAAAA,OAAM,wBAAwB;IAClC,OAAS;AACL,cAAQ,QAAQA,QAAO,OAAO,KAAK,OAAO,UAAU,EAAE;;AAGxD,WAAO;;AAGT,WAAS,QAAQ,QAAQA,QAAO,QAAQ,KAAK,OAAO,UAAU,IAAI;AAChE,IAAAA,OAAM,WAAW;AACjB,IAAAA,OAAM,UAAU;AAChB,IAAAA,OAAM,UAAU;AAChB,IAAAA,OAAM,OAAO;AACb,QAAI,OAAQ,QAAO,QAAQ,OAAOA,OAAM,OAAO;QAAO,QAAO,OAAO,OAAO,UAAUA,OAAM,OAAO;AAClG,IAAAA,OAAM,OAAO;;AAGf,WAAS,aAAa,QAAQA,QAAO0E,OAAM,IAAI,IAAI;AACjD,MAAE1E,OAAM;AAER,QAAI0E,OAAM;AAGR,MAAA4G,KAAI,SAAS,IAAI,EAAE;AAGnB,MAAAA,KAAI,SAAS,aAAa,QAAQtL,MAAK;AACvC,aAAO,eAAe,eAAe;AACrC,aAAO,KAAK,SAAS,EAAE;IAC3B,OAAS;AAGL,SAAG,EAAE;AACL,aAAO,eAAe,eAAe;AACrC,aAAO,KAAK,SAAS,EAAE;AAGvB,kBAAY,QAAQA,MAAK;;;AAI7B,WAAS,mBAAmBA,QAAO;AACjC,IAAAA,OAAM,UAAU;AAChB,IAAAA,OAAM,UAAU;AAChB,IAAAA,OAAM,UAAUA,OAAM;AACtB,IAAAA,OAAM,WAAW;;AAGnB,WAAS,QAAQ,QAAQ,IAAI;AAC3B,QAAIA,SAAQ,OAAO;AACnB,QAAI0E,QAAO1E,OAAM;AACjB,QAAI,KAAKA,OAAM;AAEf,uBAAmBA,MAAK;AAExB,QAAI,GAAI,cAAa,QAAQA,QAAO0E,OAAM,IAAI,EAAE;SAAO;AAErD,UAAI,WAAW,WAAW1E,MAAK;AAE/B,UAAI,CAAC,YAAY,CAACA,OAAM,UAAU,CAACA,OAAM,oBAAoBA,OAAM,iBAAiB;AAClF,oBAAY,QAAQA,MAAK;;AAG3B,UAAI0E,OAAM;AAER,mBAAW,YAAY,QAAQ1E,QAAO,UAAU,EAAE;MAExD,OAAW;AACL,mBAAW,QAAQA,QAAO,UAAU,EAAE;;;;AAK5C,WAAS,WAAW,QAAQA,QAAO,UAAU,IAAI;AAC/C,QAAI,CAAC,SAAU,cAAa,QAAQA,MAAK;AACzC,IAAAA,OAAM;AACN,OAAE;AACF,gBAAY,QAAQA,MAAK;;AAM3B,WAAS,aAAa,QAAQA,QAAO;AACnC,QAAIA,OAAM,WAAW,KAAKA,OAAM,WAAW;AACzC,MAAAA,OAAM,YAAY;AAClB,aAAO,KAAK,OAAO;;;AAKvB,WAAS,YAAY,QAAQA,QAAO;AAClC,IAAAA,OAAM,mBAAmB;AACzB,QAAI,QAAQA,OAAM;AAElB,QAAI,OAAO,WAAW,SAAS,MAAM,MAAM;AAEzC,UAAI,IAAIA,OAAM;AACd,UAAI9D,UAAS,IAAI,MAAM,CAAC;AACxB,UAAI,SAAS8D,OAAM;AACnB,aAAO,QAAQ;AAEf,UAAI,QAAQ;AACZ,UAAI,aAAa;AACjB,aAAO,OAAO;AACZ,QAAA9D,QAAO,KAAK,IAAI;AAChB,YAAI,CAAC,MAAM,MAAO,cAAa;AAC/B,gBAAQ,MAAM;AACd,iBAAS;;AAEX,MAAAA,QAAO,aAAa;AAEpB,cAAQ,QAAQ8D,QAAO,MAAMA,OAAM,QAAQ9D,SAAQ,IAAI,OAAO,MAAM;AAIpE,MAAA8D,OAAM;AACN,MAAAA,OAAM,sBAAsB;AAC5B,UAAI,OAAO,MAAM;AACf,QAAAA,OAAM,qBAAqB,OAAO;AAClC,eAAO,OAAO;MACpB,OAAW;AACL,QAAAA,OAAM,qBAAqB,IAAI,cAAcA,MAAK;;AAEpD,MAAAA,OAAM,uBAAuB;IACjC,OAAS;AAEL,aAAO,OAAO;AACZ,YAAI,QAAQ,MAAM;AAClB,YAAI,WAAW,MAAM;AACrB,YAAI,KAAK,MAAM;AACf,YAAI,MAAMA,OAAM,aAAa,IAAI,MAAM;AAEvC,gBAAQ,QAAQA,QAAO,OAAO,KAAK,OAAO,UAAU,EAAE;AACtD,gBAAQ,MAAM;AACd,QAAAA,OAAM;AAKN,YAAIA,OAAM,SAAS;AACjB;;;AAIJ,UAAI,UAAU,KAAM,CAAAA,OAAM,sBAAsB;;AAGlD,IAAAA,OAAM,kBAAkB;AACxB,IAAAA,OAAM,mBAAmB;;AAG3B,WAAS,UAAU,SAAS,SAAU,OAAO,UAAU,IAAI;AACzD,OAAG,IAAI,MAAM,6BAA6B,CAAC;EAC7C;AAEA,WAAS,UAAU,UAAU;AAE7B,WAAS,UAAU,MAAM,SAAU,OAAO,UAAU,IAAI;AACtD,QAAIA,SAAQ,KAAK;AAEjB,QAAI,OAAO,UAAU,YAAY;AAC/B,WAAK;AACL,cAAQ;AACR,iBAAW;IACf,WAAa,OAAO,aAAa,YAAY;AACzC,WAAK;AACL,iBAAW;;AAGb,QAAI,UAAU,QAAQ,UAAU,OAAW,MAAK,MAAM,OAAO,QAAQ;AAGrE,QAAIA,OAAM,QAAQ;AAChB,MAAAA,OAAM,SAAS;AACf,WAAK,OAAM;;AAIb,QAAI,CAACA,OAAM,OAAQ,aAAY,MAAMA,QAAO,EAAE;EAChD;AAEA,WAAS,WAAWA,QAAO;AACzB,WAAOA,OAAM,UAAUA,OAAM,WAAW,KAAKA,OAAM,oBAAoB,QAAQ,CAACA,OAAM,YAAY,CAACA,OAAM;;AAE3G,WAAS,UAAU,QAAQA,QAAO;AAChC,WAAO,OAAO,SAAU,KAAK;AAC3B,MAAAA,OAAM;AACN,UAAI,KAAK;AACP,eAAO,KAAK,SAAS,GAAG;;AAE1B,MAAAA,OAAM,cAAc;AACpB,aAAO,KAAK,WAAW;AACvB,kBAAY,QAAQA,MAAK;IAC7B,CAAG;;AAEH,WAAS2E,WAAU,QAAQ3E,QAAO;AAChC,QAAI,CAACA,OAAM,eAAe,CAACA,OAAM,aAAa;AAC5C,UAAI,OAAO,OAAO,WAAW,YAAY;AACvC,QAAAA,OAAM;AACN,QAAAA,OAAM,cAAc;AACpB,QAAAsL,KAAI,SAAS,WAAW,QAAQtL,MAAK;MAC3C,OAAW;AACL,QAAAA,OAAM,cAAc;AACpB,eAAO,KAAK,WAAW;;;;AAK7B,WAAS,YAAY,QAAQA,QAAO;AAClC,QAAI,OAAO,WAAWA,MAAK;AAC3B,QAAI,MAAM;AACR,MAAA2E,WAAU,QAAQ3E,MAAK;AACvB,UAAIA,OAAM,cAAc,GAAG;AACzB,QAAAA,OAAM,WAAW;AACjB,eAAO,KAAK,QAAQ;;;AAGxB,WAAO;;AAGT,WAAS,YAAY,QAAQA,QAAO,IAAI;AACtC,IAAAA,OAAM,SAAS;AACf,gBAAY,QAAQA,MAAK;AACzB,QAAI,IAAI;AACN,UAAIA,OAAM,SAAU,CAAAsL,KAAI,SAAS,EAAE;UAAO,QAAO,KAAK,UAAU,EAAE;;AAEpE,IAAAtL,OAAM,QAAQ;AACd,WAAO,WAAW;;AAGpB,WAAS,eAAe,SAASA,QAAO,KAAK;AAC3C,QAAI,QAAQ,QAAQ;AACpB,YAAQ,QAAQ;AAChB,WAAO,OAAO;AACZ,UAAI,KAAK,MAAM;AACf,MAAAA,OAAM;AACN,SAAG,GAAG;AACN,cAAQ,MAAM;;AAIhB,IAAAA,OAAM,mBAAmB,OAAO;;AAGlC,SAAO,eAAe,SAAS,WAAW,aAAa;IACrD,KAAK,WAAY;AACf,UAAI,KAAK,mBAAmB,QAAW;AACrC,eAAO;;AAET,aAAO,KAAK,eAAe;;IAE7B,KAAK,SAAU,OAAO;AAGpB,UAAI,CAAC,KAAK,gBAAgB;AACxB;;AAKF,WAAK,eAAe,YAAY;;EAEpC,CAAC;AAED,WAAS,UAAU,UAAU,YAAY;AACzC,WAAS,UAAU,aAAa,YAAY;AAC5C,WAAS,UAAU,WAAW,SAAU,KAAK,IAAI;AAC/C,SAAK,IAAG;AACR,OAAG,GAAG;;;;;;;;;AC7oBR,MAAIsL,OAAMjP;AAIV,MAAI,aAAa,OAAO,QAAQ,SAAUO,MAAK;AAC7C,QAAIyG,QAAO,CAAA;AACX,aAASnF,QAAOtB,MAAK;AACnB,MAAAyG,MAAK,KAAKnF,IAAG;;AACd,WAAOmF;EACV;AAGc,mBAAGe;AAGjB,MAAI6G,QAAO,OAAO,OAAO1O,MAAuB;AAChD,EAAA0O,MAAK,WAAW/K;AAGhB,MAAI,WAAWU,wBAAA;AACf,MAAI,WAAWG,wBAAA;AAEf,EAAAkK,MAAK,SAAS7G,SAAQ,QAAQ;AAE9B;AAEE,QAAIf,QAAO,WAAW,SAAS,SAAS;AACxC,aAAS,IAAI,GAAG,IAAIA,MAAK,QAAQ,KAAK;AACpC,UAAI,SAASA,MAAK,CAAC;AACnB,UAAI,CAACe,QAAO,UAAU,MAAM,EAAG,CAAAA,QAAO,UAAU,MAAM,IAAI,SAAS,UAAU,MAAM;;;AAIvF,WAASA,QAAO,SAAS;AACvB,QAAI,EAAE,gBAAgBA,SAAS,QAAO,IAAIA,QAAO,OAAO;AAExD,aAAS,KAAK,MAAM,OAAO;AAC3B,aAAS,KAAK,MAAM,OAAO;AAE3B,QAAI,WAAW,QAAQ,aAAa,MAAO,MAAK,WAAW;AAE3D,QAAI,WAAW,QAAQ,aAAa,MAAO,MAAK,WAAW;AAE3D,SAAK,gBAAgB;AACrB,QAAI,WAAW,QAAQ,kBAAkB,MAAO,MAAK,gBAAgB;AAErE,SAAK,KAAK,OAAO,KAAK;;AAGxB,SAAO,eAAeA,QAAO,WAAW,yBAAyB;;;;IAI/D,YAAY;IACZ,KAAK,WAAY;AACf,aAAO,KAAK,eAAe;;EAE/B,CAAC;AAGD,WAAS,QAAQ;AAGf,QAAI,KAAK,iBAAiB,KAAK,eAAe,MAAO;AAIrD,IAAAkH,KAAI,SAAS,SAAS,IAAI;;AAG5B,WAAS,QAAQnM,OAAM;AACrB,IAAAA,MAAK,IAAG;;AAGV,SAAO,eAAeiF,QAAO,WAAW,aAAa;IACnD,KAAK,WAAY;AACf,UAAI,KAAK,mBAAmB,UAAa,KAAK,mBAAmB,QAAW;AAC1E,eAAO;;AAET,aAAO,KAAK,eAAe,aAAa,KAAK,eAAe;;IAE9D,KAAK,SAAU,OAAO;AAGpB,UAAI,KAAK,mBAAmB,UAAa,KAAK,mBAAmB,QAAW;AAC1E;;AAKF,WAAK,eAAe,YAAY;AAChC,WAAK,eAAe,YAAY;;EAEpC,CAAC;AAED,EAAAA,QAAO,UAAU,WAAW,SAAU,KAAK,IAAI;AAC7C,SAAK,KAAK,IAAI;AACd,SAAK,IAAG;AAER,IAAAkH,KAAI,SAAS,IAAI,GAAG;;;;;;;;;ACxGtB,MAAI9O,UAASH,kBAAuB;AAGpC,MAAIU,cAAaP,QAAO,cAAc,SAAU,UAAU;AACxD,eAAW,KAAK;AAChB,YAAQ,YAAY,SAAS,YAAW,GAAE;MACxC,KAAK;MAAM,KAAK;MAAO,KAAK;MAAQ,KAAK;MAAQ,KAAK;MAAS,KAAK;MAAS,KAAK;MAAO,KAAK;MAAQ,KAAK;MAAU,KAAK;MAAW,KAAK;AACxI,eAAO;MACT;AACE,eAAO;;EAEb;AAEA,WAAS+O,oBAAmB,KAAK;AAC/B,QAAI,CAAC,IAAK,QAAO;AACjB,QAAI;AACJ,WAAO,MAAM;AACX,cAAQ,KAAG;QACT,KAAK;QACL,KAAK;AACH,iBAAO;QACT,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;AACH,iBAAO;QACT,KAAK;QACL,KAAK;AACH,iBAAO;QACT,KAAK;QACL,KAAK;QACL,KAAK;AACH,iBAAO;QACT;AACE,cAAI,QAAS;AACb,iBAAO,KAAK,KAAK,YAAW;AAC5B,oBAAU;;;EAGlB;AAIA,WAASC,mBAAkB,KAAK;AAC9B,QAAI,OAAOD,oBAAmB,GAAG;AACjC,QAAI,OAAO,SAAS,aAAa/O,QAAO,eAAeO,eAAc,CAACA,YAAW,GAAG,GAAI,OAAM,IAAI,MAAM,uBAAuB,GAAG;AAClI,WAAO,QAAQ;;AAMI,iBAAA,gBAAG+H;AACxB,WAASA,eAAc,UAAU;AAC/B,SAAK,WAAW0G,mBAAkB,QAAQ;AAC1C,QAAI;AACJ,YAAQ,KAAK,UAAQ;MACnB,KAAK;AACH,aAAK,OAAOC;AACZ,aAAK,MAAMC;AACX,aAAK;AACL;MACF,KAAK;AACH,aAAK,WAAWC;AAChB,aAAK;AACL;MACF,KAAK;AACH,aAAK,OAAOC;AACZ,aAAK,MAAMC;AACX,aAAK;AACL;MACF;AACE,aAAK,QAAQC;AACb,aAAK,MAAMC;AACX;;AAEJ,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,WAAWvP,QAAO,YAAY,EAAE;;AAGvC,EAAAsI,eAAc,UAAU,QAAQ,SAAU,KAAK;AAC7C,QAAI,IAAI,WAAW,EAAG,QAAO;AAC7B,QAAIpG;AACJ,QAAI;AACJ,QAAI,KAAK,UAAU;AACjB,MAAAA,KAAI,KAAK,SAAS,GAAG;AACrB,UAAIA,OAAM,OAAW,QAAO;AAC5B,UAAI,KAAK;AACT,WAAK,WAAW;IACpB,OAAS;AACL,UAAI;;AAEN,QAAI,IAAI,IAAI,OAAQ,QAAOA,KAAIA,KAAI,KAAK,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,KAAK,CAAC;AACvE,WAAOA,MAAK;EACd;AAEA,EAAAoG,eAAc,UAAU,MAAMkH;AAG9B,EAAAlH,eAAc,UAAU,OAAOmH;AAG/B,EAAAnH,eAAc,UAAU,WAAW,SAAU,KAAK;AAChD,QAAI,KAAK,YAAY,IAAI,QAAQ;AAC/B,UAAI,KAAK,KAAK,UAAU,KAAK,YAAY,KAAK,UAAU,GAAG,KAAK,QAAQ;AACxE,aAAO,KAAK,SAAS,SAAS,KAAK,UAAU,GAAG,KAAK,SAAS;;AAEhE,QAAI,KAAK,KAAK,UAAU,KAAK,YAAY,KAAK,UAAU,GAAG,IAAI,MAAM;AACrE,SAAK,YAAY,IAAI;EACvB;AAIA,WAASoH,eAAc,MAAM;AAC3B,QAAI,QAAQ,IAAM,QAAO;aAAW,QAAQ,MAAM,EAAM,QAAO;aAAW,QAAQ,MAAM,GAAM,QAAO;aAAW,QAAQ,MAAM,GAAM,QAAO;AAC3I,WAAO,QAAQ,MAAM,IAAO,KAAK;;AAMnC,WAASC,qBAAoBhN,OAAM,KAAK,GAAG;AACzC,QAAI,IAAI,IAAI,SAAS;AACrB,QAAI,IAAI,EAAG,QAAO;AAClB,QAAI,KAAK+M,eAAc,IAAI,CAAC,CAAC;AAC7B,QAAI,MAAM,GAAG;AACX,UAAI,KAAK,EAAG,CAAA/M,MAAK,WAAW,KAAK;AACjC,aAAO;;AAET,QAAI,EAAE,IAAI,KAAK,OAAO,GAAI,QAAO;AACjC,SAAK+M,eAAc,IAAI,CAAC,CAAC;AACzB,QAAI,MAAM,GAAG;AACX,UAAI,KAAK,EAAG,CAAA/M,MAAK,WAAW,KAAK;AACjC,aAAO;;AAET,QAAI,EAAE,IAAI,KAAK,OAAO,GAAI,QAAO;AACjC,SAAK+M,eAAc,IAAI,CAAC,CAAC;AACzB,QAAI,MAAM,GAAG;AACX,UAAI,KAAK,GAAG;AACV,YAAI,OAAO,EAAG,MAAK;YAAO,CAAA/M,MAAK,WAAW,KAAK;;AAEjD,aAAO;;AAET,WAAO;;AAWT,WAASiN,qBAAoBjN,OAAM,KAAK,GAAG;AACzC,SAAK,IAAI,CAAC,IAAI,SAAU,KAAM;AAC5B,MAAAA,MAAK,WAAW;AAChB,aAAO;;AAET,QAAIA,MAAK,WAAW,KAAK,IAAI,SAAS,GAAG;AACvC,WAAK,IAAI,CAAC,IAAI,SAAU,KAAM;AAC5B,QAAAA,MAAK,WAAW;AAChB,eAAO;;AAET,UAAIA,MAAK,WAAW,KAAK,IAAI,SAAS,GAAG;AACvC,aAAK,IAAI,CAAC,IAAI,SAAU,KAAM;AAC5B,UAAAA,MAAK,WAAW;AAChB,iBAAO;;;;;AAOf,WAASwM,cAAa,KAAK;AACzB,QAAI,IAAI,KAAK,YAAY,KAAK;AAC9B,QAAIjN,KAAI0N,qBAAoB,MAAM,GAAM;AACxC,QAAI1N,OAAM,OAAW,QAAOA;AAC5B,QAAI,KAAK,YAAY,IAAI,QAAQ;AAC/B,UAAI,KAAK,KAAK,UAAU,GAAG,GAAG,KAAK,QAAQ;AAC3C,aAAO,KAAK,SAAS,SAAS,KAAK,UAAU,GAAG,KAAK,SAAS;;AAEhE,QAAI,KAAK,KAAK,UAAU,GAAG,GAAG,IAAI,MAAM;AACxC,SAAK,YAAY,IAAI;;AAMvB,WAASuN,UAAS,KAAK,GAAG;AACxB,QAAI,QAAQE,qBAAoB,MAAM,KAAK,CAAC;AAC5C,QAAI,CAAC,KAAK,SAAU,QAAO,IAAI,SAAS,QAAQ,CAAC;AACjD,SAAK,YAAY;AACjB,QAAI,MAAM,IAAI,UAAU,QAAQ,KAAK;AACrC,QAAI,KAAK,KAAK,UAAU,GAAG,GAAG;AAC9B,WAAO,IAAI,SAAS,QAAQ,GAAG,GAAG;;AAKpC,WAASH,SAAQ,KAAK;AACpB,QAAItN,KAAI,OAAO,IAAI,SAAS,KAAK,MAAM,GAAG,IAAI;AAC9C,QAAI,KAAK,SAAU,QAAOA,KAAI;AAC9B,WAAOA;;AAOT,WAAS+M,WAAU,KAAK,GAAG;AACzB,SAAK,IAAI,SAAS,KAAK,MAAM,GAAG;AAC9B,UAAI/M,KAAI,IAAI,SAAS,WAAW,CAAC;AACjC,UAAIA,IAAG;AACL,YAAI,IAAIA,GAAE,WAAWA,GAAE,SAAS,CAAC;AACjC,YAAI,KAAK,SAAU,KAAK,OAAQ;AAC9B,eAAK,WAAW;AAChB,eAAK,YAAY;AACjB,eAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;AACrC,eAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;AACrC,iBAAOA,GAAE,MAAM,GAAG,EAAE;;;AAGxB,aAAOA;;AAET,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;AACrC,WAAO,IAAI,SAAS,WAAW,GAAG,IAAI,SAAS,CAAC;;AAKlD,WAASgN,UAAS,KAAK;AACrB,QAAIhN,KAAI,OAAO,IAAI,SAAS,KAAK,MAAM,GAAG,IAAI;AAC9C,QAAI,KAAK,UAAU;AACjB,UAAI,MAAM,KAAK,YAAY,KAAK;AAChC,aAAOA,KAAI,KAAK,SAAS,SAAS,WAAW,GAAG,GAAG;;AAErD,WAAOA;;AAGT,WAASkN,YAAW,KAAK,GAAG;AAC1B,QAAI,KAAK,IAAI,SAAS,KAAK;AAC3B,QAAI,MAAM,EAAG,QAAO,IAAI,SAAS,UAAU,CAAC;AAC5C,SAAK,WAAW,IAAI;AACpB,SAAK,YAAY;AACjB,QAAI,MAAM,GAAG;AACX,WAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;IACzC,OAAS;AACL,WAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;AACrC,WAAK,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,CAAC;;AAEvC,WAAO,IAAI,SAAS,UAAU,GAAG,IAAI,SAAS,CAAC;;AAGjD,WAASC,WAAU,KAAK;AACtB,QAAInN,KAAI,OAAO,IAAI,SAAS,KAAK,MAAM,GAAG,IAAI;AAC9C,QAAI,KAAK,SAAU,QAAOA,KAAI,KAAK,SAAS,SAAS,UAAU,GAAG,IAAI,KAAK,QAAQ;AACnF,WAAOA;;AAIT,WAASoN,aAAY,KAAK;AACxB,WAAO,IAAI,SAAS,KAAK,QAAQ;;AAGnC,WAASC,WAAU,KAAK;AACtB,WAAO,OAAO,IAAI,SAAS,KAAK,MAAM,GAAG,IAAI;EAC/C;;;;;;;;AC9QA,MAAIT,OAAMjP;AAGI,qBAAG;AAGjB,MAAIyN,WAAUvN;AAId,MAAI6H;AAGJ,WAAS,gBAAgB;AAGhBlE,gBAAkB;AAE3B,MAAI,kBAAkB,SAAU,SAASnC,OAAM;AAC7C,WAAO,QAAQ,UAAUA,KAAI,EAAE;EACjC;AAIA,MAAIsG,UAASzD;AAKb,MAAIpE,UAASuE,kBAAuB;AACpC,MAAI,iBAAiB,OAAO2B,mBAAW,cAAcA,iBAAS,OAAO,WAAW,cAAc,SAAS,OAAO,SAAS,cAAc,OAAO,CAAA,GAAI,cAAc,WAAY;EAAA;AAC1K,WAAS,oBAAoB,OAAO;AAClC,WAAOlG,QAAO,KAAK,KAAK;;AAE1B,WAAS,cAAcI,MAAK;AAC1B,WAAOJ,QAAO,SAASI,IAAG,KAAKA,gBAAe;;AAMhD,MAAIqO,QAAO,OAAO,OAAOjJ,MAAuB;AAChD,EAAAiJ,MAAK,WAAW3G;AAIhB,MAAI,YAAYC;AAChB,MAAIkB,SAAQ;AACZ,MAAI,aAAa,UAAU,UAAU;AACnC,IAAAA,SAAQ,UAAU,SAAS,QAAQ;EACrC,OAAO;AACL,IAAAA,SAAQ,WAAY;IAAA;;AAItB,MAAI/B,cAAagC,kBAAA;AACjB,MAAI,cAAcE;AAClB,MAAId;AAEJ,EAAAmG,MAAK,SAAS,UAAU5G,OAAM;AAE9B,MAAI,eAAe,CAAC,SAAS,SAAS,WAAW,SAAS,QAAQ;AAElE,WAASsB,iBAAgB,SAAS,OAAO,IAAI;AAG3C,QAAI,OAAO,QAAQ,oBAAoB,WAAY,QAAO,QAAQ,gBAAgB,OAAO,EAAE;AAM3F,QAAI,CAAC,QAAQ,WAAW,CAAC,QAAQ,QAAQ,KAAK,EAAG,SAAQ,GAAG,OAAO,EAAE;aAAWmE,SAAQ,QAAQ,QAAQ,KAAK,CAAC,EAAG,SAAQ,QAAQ,KAAK,EAAE,QAAQ,EAAE;QAAO,SAAQ,QAAQ,KAAK,IAAI,CAAC,IAAI,QAAQ,QAAQ,KAAK,CAAC;;AAG/M,WAAS,cAAc,SAAS,QAAQ;AACtC,IAAA1F,UAASA,WAAUyB,sBAAAA;AAEnB,cAAU,WAAW,CAAA;AAOrB,QAAI,WAAW,kBAAkBzB;AAIjC,SAAK,aAAa,CAAC,CAAC,QAAQ;AAE5B,QAAI,SAAU,MAAK,aAAa,KAAK,cAAc,CAAC,CAAC,QAAQ;AAI7D,QAAI,MAAM,QAAQ;AAClB,QAAI,cAAc,QAAQ;AAC1B,QAAI,aAAa,KAAK,aAAa,KAAK,KAAK;AAE7C,QAAI,OAAO,QAAQ,EAAG,MAAK,gBAAgB;aAAa,aAAa,eAAe,gBAAgB,GAAI,MAAK,gBAAgB;QAAiB,MAAK,gBAAgB;AAGnK,SAAK,gBAAgB,KAAK,MAAM,KAAK,aAAa;AAKlD,SAAK,SAAS,IAAIV,YAAU;AAC5B,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,SAAK,UAAU;AACf,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,SAAK,UAAU;AAMf,SAAK,OAAO;AAIZ,SAAK,eAAe;AACpB,SAAK,kBAAkB;AACvB,SAAK,oBAAoB;AACzB,SAAK,kBAAkB;AAGvB,SAAK,YAAY;AAKjB,SAAK,kBAAkB,QAAQ,mBAAmB;AAGlD,SAAK,aAAa;AAGlB,SAAK,cAAc;AAEnB,SAAK,UAAU;AACf,SAAK,WAAW;AAChB,QAAI,QAAQ,UAAU;AACpB,UAAI,CAACoB,eAAe,CAAAA,iBAAgBiB,sBAAA,EAA2B;AAC/D,WAAK,UAAU,IAAIjB,eAAc,QAAQ,QAAQ;AACjD,WAAK,WAAW,QAAQ;;;AAI5B,WAAS,SAAS,SAAS;AACzB,IAAAV,UAASA,WAAUyB,sBAAAA;AAEnB,QAAI,EAAE,gBAAgB,UAAW,QAAO,IAAI,SAAS,OAAO;AAE5D,SAAK,iBAAiB,IAAI,cAAc,SAAS,IAAI;AAGrD,SAAK,WAAW;AAEhB,QAAI,SAAS;AACX,UAAI,OAAO,QAAQ,SAAS,WAAY,MAAK,QAAQ,QAAQ;AAE7D,UAAI,OAAO,QAAQ,YAAY,WAAY,MAAK,WAAW,QAAQ;;AAGrE,IAAAxB,QAAO,KAAK,IAAI;;AAGlB,SAAO,eAAe,SAAS,WAAW,aAAa;IACrD,KAAK,WAAY;AACf,UAAI,KAAK,mBAAmB,QAAW;AACrC,eAAO;;AAET,aAAO,KAAK,eAAe;;IAE7B,KAAK,SAAU,OAAO;AAGpB,UAAI,CAAC,KAAK,gBAAgB;AACxB;;AAKF,WAAK,eAAe,YAAY;;EAEpC,CAAC;AAED,WAAS,UAAU,UAAU,YAAY;AACzC,WAAS,UAAU,aAAa,YAAY;AAC5C,WAAS,UAAU,WAAW,SAAU,KAAK,IAAI;AAC/C,SAAK,KAAK,IAAI;AACd,OAAG,GAAG;EACR;AAMA,WAAS,UAAU,OAAO,SAAU,OAAO,UAAU;AACnD,QAAIrE,SAAQ,KAAK;AACjB,QAAI;AAEJ,QAAI,CAACA,OAAM,YAAY;AACrB,UAAI,OAAO,UAAU,UAAU;AAC7B,mBAAW,YAAYA,OAAM;AAC7B,YAAI,aAAaA,OAAM,UAAU;AAC/B,kBAAQxD,QAAO,KAAK,OAAO,QAAQ;AACnC,qBAAW;;AAEb,yBAAiB;;IAEvB,OAAS;AACL,uBAAiB;;AAGnB,WAAO,iBAAiB,MAAM,OAAO,UAAU,OAAO,cAAc;EACtE;AAGA,WAAS,UAAU,UAAU,SAAU,OAAO;AAC5C,WAAO,iBAAiB,MAAM,OAAO,MAAM,MAAM,KAAK;EACxD;AAEA,WAAS,iBAAiB,QAAQ,OAAO,UAAU,YAAY,gBAAgB;AAC7E,QAAIwD,SAAQ,OAAO;AACnB,QAAI,UAAU,MAAM;AAClB,MAAAA,OAAM,UAAU;AAChB,iBAAW,QAAQA,MAAK;IAC5B,OAAS;AACL,UAAI;AACJ,UAAI,CAAC,eAAgB,MAAK,aAAaA,QAAO,KAAK;AACnD,UAAI,IAAI;AACN,eAAO,KAAK,SAAS,EAAE;MAC7B,WAAeA,OAAM,cAAc,SAAS,MAAM,SAAS,GAAG;AACxD,YAAI,OAAO,UAAU,YAAY,CAACA,OAAM,cAAc,OAAO,eAAe,KAAK,MAAMxD,QAAO,WAAW;AACvG,kBAAQ,oBAAoB,KAAK;;AAGnC,YAAI,YAAY;AACd,cAAIwD,OAAM,WAAY,QAAO,KAAK,SAAS,IAAI,MAAM,kCAAkC,CAAC;cAAO,UAAS,QAAQA,QAAO,OAAO,IAAI;QAC1I,WAAiBA,OAAM,OAAO;AACtB,iBAAO,KAAK,SAAS,IAAI,MAAM,yBAAyB,CAAC;QACjE,OAAa;AACL,UAAAA,OAAM,UAAU;AAChB,cAAIA,OAAM,WAAW,CAAC,UAAU;AAC9B,oBAAQA,OAAM,QAAQ,MAAM,KAAK;AACjC,gBAAIA,OAAM,cAAc,MAAM,WAAW,EAAG,UAAS,QAAQA,QAAO,OAAO,KAAK;gBAAO,eAAc,QAAQA,MAAK;UAC5H,OAAe;AACL,qBAAS,QAAQA,QAAO,OAAO,KAAK;;;MAG9C,WAAe,CAAC,YAAY;AACtB,QAAAA,OAAM,UAAU;;;AAIpB,WAAO,aAAaA,MAAK;;AAG3B,WAAS,SAAS,QAAQA,QAAO,OAAO,YAAY;AAClD,QAAIA,OAAM,WAAWA,OAAM,WAAW,KAAK,CAACA,OAAM,MAAM;AACtD,aAAO,KAAK,QAAQ,KAAK;AACzB,aAAO,KAAK,CAAC;IACjB,OAAS;AAEL,MAAAA,OAAM,UAAUA,OAAM,aAAa,IAAI,MAAM;AAC7C,UAAI,WAAY,CAAAA,OAAM,OAAO,QAAQ,KAAK;UAAO,CAAAA,OAAM,OAAO,KAAK,KAAK;AAExE,UAAIA,OAAM,aAAc,cAAa,MAAM;;AAE7C,kBAAc,QAAQA,MAAK;;AAG7B,WAAS,aAAaA,QAAO,OAAO;AAClC,QAAI;AACJ,QAAI,CAAC,cAAc,KAAK,KAAK,OAAO,UAAU,YAAY,UAAU,UAAa,CAACA,OAAM,YAAY;AAClG,WAAK,IAAI,UAAU,iCAAiC;;AAEtD,WAAO;;AAUT,WAAS,aAAaA,QAAO;AAC3B,WAAO,CAACA,OAAM,UAAUA,OAAM,gBAAgBA,OAAM,SAASA,OAAM,iBAAiBA,OAAM,WAAW;;AAGvG,WAAS,UAAU,WAAW,WAAY;AACxC,WAAO,KAAK,eAAe,YAAY;EACzC;AAGA,WAAS,UAAU,cAAc,SAAU,KAAK;AAC9C,QAAI,CAAC8E,eAAe,CAAAA,iBAAgBiB,sBAAA,EAA2B;AAC/D,SAAK,eAAe,UAAU,IAAIjB,eAAc,GAAG;AACnD,SAAK,eAAe,WAAW;AAC/B,WAAO;EACT;AAGA,MAAI,UAAU;AACd,WAAS,wBAAwB,GAAG;AAClC,QAAI,KAAK,SAAS;AAChB,UAAI;IACR,OAAS;AAGL;AACA,WAAK,MAAM;AACX,WAAK,MAAM;AACX,WAAK,MAAM;AACX,WAAK,MAAM;AACX,WAAK,MAAM;AACX;;AAEF,WAAO;;AAKT,WAAS,cAAc,GAAG9E,QAAO;AAC/B,QAAI,KAAK,KAAKA,OAAM,WAAW,KAAKA,OAAM,MAAO,QAAO;AACxD,QAAIA,OAAM,WAAY,QAAO;AAC7B,QAAI,MAAM,GAAG;AAEX,UAAIA,OAAM,WAAWA,OAAM,OAAQ,QAAOA,OAAM,OAAO,KAAK,KAAK;UAAY,QAAOA,OAAM;;AAG5F,QAAI,IAAIA,OAAM,cAAe,CAAAA,OAAM,gBAAgB,wBAAwB,CAAC;AAC5E,QAAI,KAAKA,OAAM,OAAQ,QAAO;AAE9B,QAAI,CAACA,OAAM,OAAO;AAChB,MAAAA,OAAM,eAAe;AACrB,aAAO;;AAET,WAAOA,OAAM;;AAIf,WAAS,UAAU,OAAO,SAAU,GAAG;AACrC,IAAAyF,OAAM,QAAQ,CAAC;AACf,QAAI,SAAS,GAAG,EAAE;AAClB,QAAIzF,SAAQ,KAAK;AACjB,QAAI,QAAQ;AAEZ,QAAI,MAAM,EAAG,CAAAA,OAAM,kBAAkB;AAKrC,QAAI,MAAM,KAAKA,OAAM,iBAAiBA,OAAM,UAAUA,OAAM,iBAAiBA,OAAM,QAAQ;AACzF,MAAAyF,OAAM,sBAAsBzF,OAAM,QAAQA,OAAM,KAAK;AACrD,UAAIA,OAAM,WAAW,KAAKA,OAAM,MAAO,aAAY,IAAI;UAAO,cAAa,IAAI;AAC/E,aAAO;;AAGT,QAAI,cAAc,GAAGA,MAAK;AAG1B,QAAI,MAAM,KAAKA,OAAM,OAAO;AAC1B,UAAIA,OAAM,WAAW,EAAG,aAAY,IAAI;AACxC,aAAO;;AA0BT,QAAI,SAASA,OAAM;AACnB,IAAAyF,OAAM,iBAAiB,MAAM;AAG7B,QAAIzF,OAAM,WAAW,KAAKA,OAAM,SAAS,IAAIA,OAAM,eAAe;AAChE,eAAS;AACT,MAAAyF,OAAM,8BAA8B,MAAM;;AAK5C,QAAIzF,OAAM,SAASA,OAAM,SAAS;AAChC,eAAS;AACT,MAAAyF,OAAM,oBAAoB,MAAM;eACvB,QAAQ;AACjB,MAAAA,OAAM,SAAS;AACf,MAAAzF,OAAM,UAAU;AAChB,MAAAA,OAAM,OAAO;AAEb,UAAIA,OAAM,WAAW,EAAG,CAAAA,OAAM,eAAe;AAE7C,WAAK,MAAMA,OAAM,aAAa;AAC9B,MAAAA,OAAM,OAAO;AAGb,UAAI,CAACA,OAAM,QAAS,KAAI,cAAc,OAAOA,MAAK;;AAGpD,QAAI;AACJ,QAAI,IAAI,EAAG,OAAM,SAAS,GAAGA,MAAK;QAAO,OAAM;AAE/C,QAAI,QAAQ,MAAM;AAChB,MAAAA,OAAM,eAAe;AACrB,UAAI;IACR,OAAS;AACL,MAAAA,OAAM,UAAU;;AAGlB,QAAIA,OAAM,WAAW,GAAG;AAGtB,UAAI,CAACA,OAAM,MAAO,CAAAA,OAAM,eAAe;AAGvC,UAAI,UAAU,KAAKA,OAAM,MAAO,aAAY,IAAI;;AAGlD,QAAI,QAAQ,KAAM,MAAK,KAAK,QAAQ,GAAG;AAEvC,WAAO;EACT;AAEA,WAAS,WAAW,QAAQA,QAAO;AACjC,QAAIA,OAAM,MAAO;AACjB,QAAIA,OAAM,SAAS;AACjB,UAAI,QAAQA,OAAM,QAAQ,IAAG;AAC7B,UAAI,SAAS,MAAM,QAAQ;AACzB,QAAAA,OAAM,OAAO,KAAK,KAAK;AACvB,QAAAA,OAAM,UAAUA,OAAM,aAAa,IAAI,MAAM;;;AAGjD,IAAAA,OAAM,QAAQ;AAGd,iBAAa,MAAM;;AAMrB,WAAS,aAAa,QAAQ;AAC5B,QAAIA,SAAQ,OAAO;AACnB,IAAAA,OAAM,eAAe;AACrB,QAAI,CAACA,OAAM,iBAAiB;AAC1B,MAAAyF,OAAM,gBAAgBzF,OAAM,OAAO;AACnC,MAAAA,OAAM,kBAAkB;AACxB,UAAIA,OAAM,KAAM,CAAAsL,KAAI,SAAS,eAAe,MAAM;UAAO,eAAc,MAAM;;;AAIjF,WAAS,cAAc,QAAQ;AAC7B,IAAA7F,OAAM,eAAe;AACrB,WAAO,KAAK,UAAU;AACtB,SAAK,MAAM;;AASb,WAAS,cAAc,QAAQzF,QAAO;AACpC,QAAI,CAACA,OAAM,aAAa;AACtB,MAAAA,OAAM,cAAc;AACpB,MAAAsL,KAAI,SAAS,gBAAgB,QAAQtL,MAAK;;;AAI9C,WAAS,eAAe,QAAQA,QAAO;AACrC,QAAI,MAAMA,OAAM;AAChB,WAAO,CAACA,OAAM,WAAW,CAACA,OAAM,WAAW,CAACA,OAAM,SAASA,OAAM,SAASA,OAAM,eAAe;AAC7F,MAAAyF,OAAM,sBAAsB;AAC5B,aAAO,KAAK,CAAC;AACb,UAAI,QAAQzF,OAAM;AAEhB;UAAW,OAAMA,OAAM;;AAE3B,IAAAA,OAAM,cAAc;;AAOtB,WAAS,UAAU,QAAQ,SAAU,GAAG;AACtC,SAAK,KAAK,SAAS,IAAI,MAAM,4BAA4B,CAAC;EAC5D;AAEA,WAAS,UAAU,OAAO,SAAU,MAAM,UAAU;AAClD,QAAI,MAAM;AACV,QAAIA,SAAQ,KAAK;AAEjB,YAAQA,OAAM,YAAU;MACtB,KAAK;AACH,QAAAA,OAAM,QAAQ;AACd;MACF,KAAK;AACH,QAAAA,OAAM,QAAQ,CAACA,OAAM,OAAO,IAAI;AAChC;MACF;AACE,QAAAA,OAAM,MAAM,KAAK,IAAI;AACrB;;AAEJ,IAAAA,OAAM,cAAc;AACpB,IAAAyF,OAAM,yBAAyBzF,OAAM,YAAY,QAAQ;AAEzD,QAAI,SAAS,CAAC,YAAY,SAAS,QAAQ,UAAU,SAAS,QAAQ,UAAU,SAAS,QAAQ;AAEjG,QAAI,QAAQ,QAAQ,QAAQ;AAC5B,QAAIA,OAAM,WAAY,CAAAsL,KAAI,SAAS,KAAK;QAAO,KAAI,KAAK,OAAO,KAAK;AAEpE,SAAK,GAAG,UAAU,QAAQ;AAC1B,aAAS,SAAS,UAAU,YAAY;AACtC,MAAA7F,OAAM,UAAU;AAChB,UAAI,aAAa,KAAK;AACpB,YAAI,cAAc,WAAW,eAAe,OAAO;AACjD,qBAAW,aAAa;AACxB,kBAAO;;;;AAKb,aAAS,QAAQ;AACf,MAAAA,OAAM,OAAO;AACb,WAAK,IAAG;;AAOV,QAAI,UAAU,YAAY,GAAG;AAC7B,SAAK,GAAG,SAAS,OAAO;AAExB,QAAI,YAAY;AAChB,aAAS,UAAU;AACjB,MAAAA,OAAM,SAAS;AAEf,WAAK,eAAe,SAAS,OAAO;AACpC,WAAK,eAAe,UAAU,QAAQ;AACtC,WAAK,eAAe,SAAS,OAAO;AACpC,WAAK,eAAe,SAAS,OAAO;AACpC,WAAK,eAAe,UAAU,QAAQ;AACtC,UAAI,eAAe,OAAO,KAAK;AAC/B,UAAI,eAAe,OAAO,MAAM;AAChC,UAAI,eAAe,QAAQ,MAAM;AAEjC,kBAAY;AAOZ,UAAIzF,OAAM,eAAe,CAAC,KAAK,kBAAkB,KAAK,eAAe,WAAY,SAAO;;AAO1F,QAAI,sBAAsB;AAC1B,QAAI,GAAG,QAAQ,MAAM;AACrB,aAAS,OAAO,OAAO;AACrB,MAAAyF,OAAM,QAAQ;AACd,4BAAsB;AACtB,UAAI,MAAM,KAAK,MAAM,KAAK;AAC1B,UAAI,UAAU,OAAO,CAAC,qBAAqB;AAKzC,aAAKzF,OAAM,eAAe,KAAKA,OAAM,UAAU,QAAQA,OAAM,aAAa,KAAK,QAAQA,OAAM,OAAO,IAAI,MAAM,OAAO,CAAC,WAAW;AAC/H,UAAAyF,OAAM,+BAA+BzF,OAAM,UAAU;AACrD,UAAAA,OAAM;AACN,gCAAsB;;AAExB,YAAI,MAAK;;;AAMb,aAAS,QAAQ,IAAI;AACnB,MAAAyF,OAAM,WAAW,EAAE;AACnB,aAAM;AACN,WAAK,eAAe,SAAS,OAAO;AACpC,UAAI,gBAAgB,MAAM,OAAO,MAAM,EAAG,MAAK,KAAK,SAAS,EAAE;;AAIjE,IAAAE,iBAAgB,MAAM,SAAS,OAAO;AAGtC,aAAS,UAAU;AACjB,WAAK,eAAe,UAAU,QAAQ;AACtC,aAAM;;AAER,SAAK,KAAK,SAAS,OAAO;AAC1B,aAAS,WAAW;AAClB,MAAAF,OAAM,UAAU;AAChB,WAAK,eAAe,SAAS,OAAO;AACpC,aAAM;;AAER,SAAK,KAAK,UAAU,QAAQ;AAE5B,aAAS,SAAS;AAChB,MAAAA,OAAM,QAAQ;AACd,UAAI,OAAO,IAAI;;AAIjB,SAAK,KAAK,QAAQ,GAAG;AAGrB,QAAI,CAACzF,OAAM,SAAS;AAClB,MAAAyF,OAAM,aAAa;AACnB,UAAI,OAAM;;AAGZ,WAAO;EACT;AAEA,WAAS,YAAY,KAAK;AACxB,WAAO,WAAY;AACjB,UAAIzF,SAAQ,IAAI;AAChB,MAAAyF,OAAM,eAAezF,OAAM,UAAU;AACrC,UAAIA,OAAM,WAAY,CAAAA,OAAM;AAC5B,UAAIA,OAAM,eAAe,KAAK,gBAAgB,KAAK,MAAM,GAAG;AAC1D,QAAAA,OAAM,UAAU;AAChB,aAAK,GAAG;;IAEd;;AAGA,WAAS,UAAU,SAAS,SAAU,MAAM;AAC1C,QAAIA,SAAQ,KAAK;AACjB,QAAI,aAAa,EAAE,YAAY,MAAK;AAGpC,QAAIA,OAAM,eAAe,EAAG,QAAO;AAGnC,QAAIA,OAAM,eAAe,GAAG;AAE1B,UAAI,QAAQ,SAASA,OAAM,MAAO,QAAO;AAEzC,UAAI,CAAC,KAAM,QAAOA,OAAM;AAGxB,MAAAA,OAAM,QAAQ;AACd,MAAAA,OAAM,aAAa;AACnB,MAAAA,OAAM,UAAU;AAChB,UAAI,KAAM,MAAK,KAAK,UAAU,MAAM,UAAU;AAC9C,aAAO;;AAKT,QAAI,CAAC,MAAM;AAET,UAAI,QAAQA,OAAM;AAClB,UAAI,MAAMA,OAAM;AAChB,MAAAA,OAAM,QAAQ;AACd,MAAAA,OAAM,aAAa;AACnB,MAAAA,OAAM,UAAU;AAEhB,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,cAAM,CAAC,EAAE,KAAK,UAAU,MAAM,EAAE,YAAY,MAAK,CAAE;;AACpD,aAAO;;AAIV,QAAIvB,SAAQ,QAAQuB,OAAM,OAAO,IAAI;AACrC,QAAIvB,WAAU,GAAI,QAAO;AAEzB,IAAAuB,OAAM,MAAM,OAAOvB,QAAO,CAAC;AAC3B,IAAAuB,OAAM,cAAc;AACpB,QAAIA,OAAM,eAAe,EAAG,CAAAA,OAAM,QAAQA,OAAM,MAAM,CAAC;AAEvD,SAAK,KAAK,UAAU,MAAM,UAAU;AAEpC,WAAO;EACT;AAIA,WAAS,UAAU,KAAK,SAAU,IAAI,IAAI;AACxC,QAAI,MAAMqE,QAAO,UAAU,GAAG,KAAK,MAAM,IAAI,EAAE;AAE/C,QAAI,OAAO,QAAQ;AAEjB,UAAI,KAAK,eAAe,YAAY,MAAO,MAAK,OAAM;IAC1D,WAAa,OAAO,YAAY;AAC5B,UAAIrE,SAAQ,KAAK;AACjB,UAAI,CAACA,OAAM,cAAc,CAACA,OAAM,mBAAmB;AACjD,QAAAA,OAAM,oBAAoBA,OAAM,eAAe;AAC/C,QAAAA,OAAM,kBAAkB;AACxB,YAAI,CAACA,OAAM,SAAS;AAClB,UAAAsL,KAAI,SAAS,kBAAkB,IAAI;QAC3C,WAAiBtL,OAAM,QAAQ;AACvB,uBAAa,IAAI;;;;AAKvB,WAAO;EACT;AACA,WAAS,UAAU,cAAc,SAAS,UAAU;AAEpD,WAAS,iBAAiBb,OAAM;AAC9B,IAAAsG,OAAM,0BAA0B;AAChC,IAAAtG,MAAK,KAAK,CAAC;;AAKb,WAAS,UAAU,SAAS,WAAY;AACtC,QAAIa,SAAQ,KAAK;AACjB,QAAI,CAACA,OAAM,SAAS;AAClB,MAAAyF,OAAM,QAAQ;AACd,MAAAzF,OAAM,UAAU;AAChB,aAAO,MAAMA,MAAK;;AAEpB,WAAO;EACT;AAEA,WAAS,OAAO,QAAQA,QAAO;AAC7B,QAAI,CAACA,OAAM,iBAAiB;AAC1B,MAAAA,OAAM,kBAAkB;AACxB,MAAAsL,KAAI,SAAS,SAAS,QAAQtL,MAAK;;;AAIvC,WAAS,QAAQ,QAAQA,QAAO;AAC9B,QAAI,CAACA,OAAM,SAAS;AAClB,MAAAyF,OAAM,eAAe;AACrB,aAAO,KAAK,CAAC;;AAGf,IAAAzF,OAAM,kBAAkB;AACxB,IAAAA,OAAM,aAAa;AACnB,WAAO,KAAK,QAAQ;AACpB,SAAK,MAAM;AACX,QAAIA,OAAM,WAAW,CAACA,OAAM,QAAS,QAAO,KAAK,CAAC;;AAGpD,WAAS,UAAU,QAAQ,WAAY;AACrC,IAAAyF,OAAM,yBAAyB,KAAK,eAAe,OAAO;AAC1D,QAAI,UAAU,KAAK,eAAe,SAAS;AACzC,MAAAA,OAAM,OAAO;AACb,WAAK,eAAe,UAAU;AAC9B,WAAK,KAAK,OAAO;;AAEnB,WAAO;EACT;AAEA,WAAS,KAAK,QAAQ;AACpB,QAAIzF,SAAQ,OAAO;AACnB,IAAAyF,OAAM,QAAQzF,OAAM,OAAO;AAC3B,WAAOA,OAAM,WAAW,OAAO,KAAI,MAAO,MAAM;IAAA;;AAMlD,WAAS,UAAU,OAAO,SAAU,QAAQ;AAC1C,QAAI,QAAQ;AAEZ,QAAIA,SAAQ,KAAK;AACjB,QAAI,SAAS;AAEb,WAAO,GAAG,OAAO,WAAY;AAC3B,MAAAyF,OAAM,aAAa;AACnB,UAAIzF,OAAM,WAAW,CAACA,OAAM,OAAO;AACjC,YAAI,QAAQA,OAAM,QAAQ,IAAG;AAC7B,YAAI,SAAS,MAAM,OAAQ,OAAM,KAAK,KAAK;;AAG7C,YAAM,KAAK,IAAI;IACnB,CAAG;AAED,WAAO,GAAG,QAAQ,SAAU,OAAO;AACjC,MAAAyF,OAAM,cAAc;AACpB,UAAIzF,OAAM,QAAS,SAAQA,OAAM,QAAQ,MAAM,KAAK;AAGpD,UAAIA,OAAM,eAAe,UAAU,QAAQ,UAAU,QAAY;eAAgB,CAACA,OAAM,eAAe,CAAC,SAAS,CAAC,MAAM,QAAS;AAEjI,UAAI,MAAM,MAAM,KAAK,KAAK;AAC1B,UAAI,CAAC,KAAK;AACR,iBAAS;AACT,eAAO,MAAK;;IAElB,CAAG;AAID,aAAS,KAAK,QAAQ;AACpB,UAAI,KAAK,CAAC,MAAM,UAAa,OAAO,OAAO,CAAC,MAAM,YAAY;AAC5D,aAAK,CAAC,IAAI,0BAAU,QAAQ;AAC1B,iBAAO,WAAY;AACjB,mBAAO,OAAO,MAAM,EAAE,MAAM,QAAQ,SAAS;UACvD;WACQ,CAAC;;;AAKP,aAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC5C,aAAO,GAAG,aAAa,CAAC,GAAG,KAAK,KAAK,KAAK,MAAM,aAAa,CAAC,CAAC,CAAC;;AAKlE,SAAK,QAAQ,SAAU8F,IAAG;AACxB,MAAAL,OAAM,iBAAiBK,EAAC;AACxB,UAAI,QAAQ;AACV,iBAAS;AACT,eAAO,OAAM;;IAEnB;AAEE,WAAO;EACT;AAEA,SAAO,eAAe,SAAS,WAAW,yBAAyB;;;;IAIjE,YAAY;IACZ,KAAK,WAAY;AACf,aAAO,KAAK,eAAe;;EAE/B,CAAC;AAGD,WAAS,YAAY;AAMrB,WAAS,SAAS,GAAG9F,QAAO;AAE1B,QAAIA,OAAM,WAAW,EAAG,QAAO;AAE/B,QAAI;AACJ,QAAIA,OAAM,WAAY,OAAMA,OAAM,OAAO,MAAK;aAAY,CAAC,KAAK,KAAKA,OAAM,QAAQ;AAEjF,UAAIA,OAAM,QAAS,OAAMA,OAAM,OAAO,KAAK,EAAE;eAAWA,OAAM,OAAO,WAAW,EAAG,OAAMA,OAAM,OAAO,KAAK;UAAU,OAAMA,OAAM,OAAO,OAAOA,OAAM,MAAM;AAC3J,MAAAA,OAAM,OAAO,MAAK;IACtB,OAAS;AAEL,YAAM,gBAAgB,GAAGA,OAAM,QAAQA,OAAM,OAAO;;AAGtD,WAAO;;AAMT,WAAS,gBAAgB,GAAG,MAAM,YAAY;AAC5C,QAAI;AACJ,QAAI,IAAI,KAAK,KAAK,KAAK,QAAQ;AAE7B,YAAM,KAAK,KAAK,KAAK,MAAM,GAAG,CAAC;AAC/B,WAAK,KAAK,OAAO,KAAK,KAAK,KAAK,MAAM,CAAC;eAC9B,MAAM,KAAK,KAAK,KAAK,QAAQ;AAEtC,YAAM,KAAK,MAAK;IACpB,OAAS;AAEL,YAAM,aAAa,qBAAqB,GAAG,IAAI,IAAI,eAAe,GAAG,IAAI;;AAE3E,WAAO;;AAOT,WAAS,qBAAqB,GAAG,MAAM;AACrC,QAAI,IAAI,KAAK;AACb,QAAI,IAAI;AACR,QAAI,MAAM,EAAE;AACZ,SAAK,IAAI;AACT,WAAO,IAAI,EAAE,MAAM;AACjB,UAAI,MAAM,EAAE;AACZ,UAAI,KAAK,IAAI,IAAI,SAAS,IAAI,SAAS;AACvC,UAAI,OAAO,IAAI,OAAQ,QAAO;UAAS,QAAO,IAAI,MAAM,GAAG,CAAC;AAC5D,WAAK;AACL,UAAI,MAAM,GAAG;AACX,YAAI,OAAO,IAAI,QAAQ;AACrB,YAAE;AACF,cAAI,EAAE,KAAM,MAAK,OAAO,EAAE;cAAU,MAAK,OAAO,KAAK,OAAO;QACpE,OAAa;AACL,eAAK,OAAO;AACZ,YAAE,OAAO,IAAI,MAAM,EAAE;;AAEvB;;AAEF,QAAE;;AAEJ,SAAK,UAAU;AACf,WAAO;;AAMT,WAAS,eAAe,GAAG,MAAM;AAC/B,QAAI,MAAMxD,QAAO,YAAY,CAAC;AAC9B,QAAI,IAAI,KAAK;AACb,QAAI,IAAI;AACR,MAAE,KAAK,KAAK,GAAG;AACf,SAAK,EAAE,KAAK;AACZ,WAAO,IAAI,EAAE,MAAM;AACjB,UAAI,MAAM,EAAE;AACZ,UAAI,KAAK,IAAI,IAAI,SAAS,IAAI,SAAS;AACvC,UAAI,KAAK,KAAK,IAAI,SAAS,GAAG,GAAG,EAAE;AACnC,WAAK;AACL,UAAI,MAAM,GAAG;AACX,YAAI,OAAO,IAAI,QAAQ;AACrB,YAAE;AACF,cAAI,EAAE,KAAM,MAAK,OAAO,EAAE;cAAU,MAAK,OAAO,KAAK,OAAO;QACpE,OAAa;AACL,eAAK,OAAO;AACZ,YAAE,OAAO,IAAI,MAAM,EAAE;;AAEvB;;AAEF,QAAE;;AAEJ,SAAK,UAAU;AACf,WAAO;;AAGT,WAAS,YAAY,QAAQ;AAC3B,QAAIwD,SAAQ,OAAO;AAInB,QAAIA,OAAM,SAAS,EAAG,OAAM,IAAI,MAAM,4CAA4C;AAElF,QAAI,CAACA,OAAM,YAAY;AACrB,MAAAA,OAAM,QAAQ;AACd,MAAAsL,KAAI,SAAS,eAAetL,QAAO,MAAM;;;AAI7C,WAAS,cAAcA,QAAO,QAAQ;AAEpC,QAAI,CAACA,OAAM,cAAcA,OAAM,WAAW,GAAG;AAC3C,MAAAA,OAAM,aAAa;AACnB,aAAO,WAAW;AAClB,aAAO,KAAK,KAAK;;;AAIrB,WAAS,QAAQ,IAAI,GAAG;AACtB,aAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,IAAI,GAAG,KAAK;AACzC,UAAI,GAAG,CAAC,MAAM,EAAG,QAAO;;AAE1B,WAAO;EACT;;;ICz7BA,oBAAiBkG;AAEjB,IAAI,SAAS7J,sBAAA;AAGb,IAAI4O,SAAO,OAAO,OAAO1O,MAAuB;AAChD0O,OAAK,WAAW/K;AAGhB+K,OAAK,SAAS/E,aAAW,MAAM;AAE/B,SAAS,eAAe,IAAI,MAAM;AAChC,MAAI,KAAK,KAAK;AACd,KAAG,eAAe;AAElB,MAAI,KAAK,GAAG;AAEZ,MAAI,CAAC,IAAI;AACP,WAAO,KAAK,KAAK,SAAS,IAAI,MAAM,sCAAsC,CAAC;EAC/E;AAEE,KAAG,aAAa;AAChB,KAAG,UAAU;AAEb,MAAI,QAAQ;AACV,SAAK,KAAK,IAAI;AAEhB,KAAG,EAAE;AAEL,MAAI,KAAK,KAAK;AACd,KAAG,UAAU;AACb,MAAI,GAAG,gBAAgB,GAAG,SAAS,GAAG,eAAe;AACnD,SAAK,MAAM,GAAG,aAAa;EAC/B;AACA;AAEA,SAASA,YAAU,SAAS;AAC1B,MAAI,EAAE,gBAAgBA,aAAY,QAAO,IAAIA,YAAU,OAAO;AAE9D,SAAO,KAAK,MAAM,OAAO;AAEzB,OAAK,kBAAkB;IACrB,gBAAgB,eAAe,KAAK,IAAI;IACxC,eAAe;IACf,cAAc;IACd,SAAS;IACT,YAAY;IACZ,eAAe;EACnB;AAGE,OAAK,eAAe,eAAe;AAKnC,OAAK,eAAe,OAAO;AAE3B,MAAI,SAAS;AACX,QAAI,OAAO,QAAQ,cAAc,WAAY,MAAK,aAAa,QAAQ;AAEvE,QAAI,OAAO,QAAQ,UAAU,WAAY,MAAK,SAAS,QAAQ;EACnE;AAGE,OAAK,GAAG,aAAa,SAAS;AAChC;AAEA,SAAS,YAAY;AACnB,MAAI,QAAQ;AAEZ,MAAI,OAAO,KAAK,WAAW,YAAY;AACrC,SAAK,OAAO,SAAU,IAAI,MAAM;AAC9B,WAAK,OAAO,IAAI,IAAI;IAC1B,CAAK;EACL,OAAS;AACL,SAAK,MAAM,MAAM,IAAI;EACzB;AACA;AAEAA,YAAU,UAAU,OAAO,SAAU,OAAO,UAAU;AACpD,OAAK,gBAAgB,gBAAgB;AACrC,SAAO,OAAO,UAAU,KAAK,KAAK,MAAM,OAAO,QAAQ;AACzD;AAYAA,YAAU,UAAU,aAAa,SAAU,OAAO,UAAU,IAAI;AAC9D,QAAM,IAAI,MAAM,iCAAiC;AACnD;AAEAA,YAAU,UAAU,SAAS,SAAU,OAAO,UAAU,IAAI;AAC1D,MAAI,KAAK,KAAK;AACd,KAAG,UAAU;AACb,KAAG,aAAa;AAChB,KAAG,gBAAgB;AACnB,MAAI,CAAC,GAAG,cAAc;AACpB,QAAI,KAAK,KAAK;AACd,QAAI,GAAG,iBAAiB,GAAG,gBAAgB,GAAG,SAAS,GAAG,cAAe,MAAK,MAAM,GAAG,aAAa;EACxG;AACA;AAKAA,YAAU,UAAU,QAAQ,SAAU,GAAG;AACvC,MAAI,KAAK,KAAK;AAEd,MAAI,GAAG,eAAe,QAAQ,GAAG,WAAW,CAAC,GAAG,cAAc;AAC5D,OAAG,eAAe;AAClB,SAAK,WAAW,GAAG,YAAY,GAAG,eAAe,GAAG,cAAc;EACtE,OAAS;AAGL,OAAG,gBAAgB;EACvB;AACA;AAEAA,YAAU,UAAU,WAAW,SAAU,KAAK,IAAI;AAChD,MAAI,SAAS;AAEb,SAAO,UAAU,SAAS,KAAK,MAAM,KAAK,SAAU,MAAM;AACxD,OAAG,IAAI;AACP,WAAO,KAAK,OAAO;EACvB,CAAG;AACH;AAEA,SAAS,KAAK,QAAQ,IAAI,MAAM;AAC9B,MAAI,GAAI,QAAO,OAAO,KAAK,SAAS,EAAE;AAEtC,MAAI,QAAQ;AACV,WAAO,KAAK,IAAI;AAIlB,MAAI,OAAO,eAAe,OAAQ,OAAM,IAAI,MAAM,4CAA4C;AAE9F,MAAI,OAAO,gBAAgB,aAAc,OAAM,IAAI,MAAM,gDAAgD;AAEzG,SAAO,OAAO,KAAK,IAAI;AACzB;IC1LA,sBAAiB;AAEjB,IAAIA,cAAY7J;AAGhB,IAAI4O,SAAO,OAAO,OAAO1O,MAAuB;AAChD0O,OAAK,WAAW/K;AAGhB+K,OAAK,SAAS,aAAa/E,WAAS;AAEpC,SAAS,YAAY,SAAS;AAC5B,MAAI,EAAE,gBAAgB,aAAc,QAAO,IAAI,YAAY,OAAO;AAElEA,cAAU,KAAK,MAAM,OAAO;AAC9B;AAEA,YAAY,UAAU,aAAa,SAAU,OAAO,UAAU,IAAI;AAChE,KAAG,MAAM,KAAK;AAChB;;AC9CA,YAAU,OAAiB,UAAA7J,wBAAA;AAC3B,UAAA,SAAiB;AACjB,UAAA,WAAmB;AACnB,UAAA,WAAmBE,wBAAAA;AACnB,UAAA,SAAiB2D,sBAAAA;AACjB,UAAA,YAAoBU;AACpB,UAAA,cAAsBG;;;ACJtB,IAAIvE,WAASH,oBAAuB;AACpC,IAAIyC,aAAWvC;AACf,IAAI2J,cAAYhG,uBAA2B;AAC3C,IAAI7B,aAAWuC;AAEf,SAAS0F,WAASC,YAAW;AAC5BL,cAAU,KAAK,IAAI;AAEnB,OAAK,SAAS1J,SAAO,YAAY+J,UAAS;AAC1C,OAAK,aAAaA;AAClB,OAAK,eAAe;AACpB,OAAK,UAAU,CAAC,GAAG,GAAG,GAAG,CAAC;AAE1B,OAAK,aAAa;AACnB;AAEAlI,WAASiI,YAAUJ,WAAS;AAE5BI,WAAS,UAAU,aAAa,SAAU,OAAO,UAAU,UAAU;AACpE,MAAI/D,SAAQ;AACZ,MAAI;AACH,SAAK,OAAO,OAAO,QAAQ;EAC7B,SAAU,KAAK;AACb,IAAAA,SAAQ;EACV;AAEC,WAASA,MAAK;AACf;AAEA+D,WAAS,UAAU,SAAS,SAAU,UAAU;AAC/C,MAAI/D,SAAQ;AACZ,MAAI;AACH,SAAK,KAAK,KAAK,OAAM,CAAE;EACzB,SAAU,KAAK;AACb,IAAAA,SAAQ;EACV;AAEC,WAASA,MAAK;AACf;AAEA+D,WAAS,UAAU,SAAS,SAAU,MAAM,UAAU;AACrD,MAAI,KAAK,YAAY;AACpB,UAAM,IAAI,MAAM,uBAAuB;EACzC;AAEC,MAAI,aAAaxH,WAAS,MAAM,QAAQ;AAGxC,MAAI,QAAQ,KAAK;AACjB,MAAI,SAAS;AACb,SAAO,KAAK,eAAe,WAAW,SAAS,UAAU,KAAK,YAAY;AACzE,aAAS,IAAI,KAAK,cAAc,IAAI,KAAK,cAAa;AACrD,YAAM,CAAC,IAAI,WAAW,MAAM;AAC5B,WAAK;AACL,gBAAU;IACb;AACE,SAAK,QAAO;AACZ,SAAK,eAAe;EACtB;AACC,SAAO,SAAS,WAAW,QAAQ;AAClC,UAAM,KAAK,YAAY,IAAI,WAAW,MAAM;AAC5C,SAAK,gBAAgB;AACrB,cAAU;EACZ;AAGC,WAAS,IAAI,GAAG,QAAQ,WAAW,SAAS,GAAG,QAAQ,GAAG,EAAE,GAAG;AAC9D,SAAK,QAAQ,CAAC,KAAK;AACnB,YAAS,KAAK,QAAQ,CAAC,IAAI,aAAgB;AAC3C,QAAI,QAAQ,GAAG;AACd,WAAK,QAAQ,CAAC,KAAK,aAAe;IACrC;EACA;AAEC,SAAO;AACR;AAEAwH,WAAS,UAAU,UAAU,WAAY;AACxC,QAAM,IAAI,MAAM,4BAA4B;AAC7C;AAEAA,WAAS,UAAU,SAAS,SAAU,UAAU;AAC/C,MAAI,KAAK,YAAY;AACpB,UAAM,IAAI,MAAM,uBAAuB;EACzC;AACC,OAAK,aAAa;AAElB,MAAII,UAAS,KAAK,QAAO;AACzB,MAAI,aAAa,QAAW;AAC3B,IAAAA,UAASA,QAAO,SAAS,QAAQ;EACnC;AAGC,OAAK,OAAO,KAAK,CAAC;AAClB,OAAK,eAAe;AACpB,WAAS,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AAC3B,SAAK,QAAQ,CAAC,IAAI;EACpB;AAEC,SAAOA;AACR;AAEAJ,WAAS,UAAU,UAAU,WAAY;AACxC,QAAM,IAAI,MAAM,4BAA4B;AAC7C;AAEA,IAAA,WAAiBA;AC1GjB,IAAI9J,WAASH,SAAkB;AAC/B,IAAIgC,aAAW9B;AACf,IAAI,WAAW2D;AAEf,IAAI,UAAU,IAAI,MAAM,EAAE;AAE1B,IAAI,KAAK;EACR;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAI;EAClD;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EACnD;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAClD;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EACnD;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;AACnD;AAEA,IAAI,KAAK;EACR;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAClD;EAAG;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EACnD;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAClD;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAClD;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;AACnD;AAEA,IAAI,KAAK;EACR;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EACrD;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAI;EACpD;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EACrD;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EACpD;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;AACtD;AAEA,IAAI,KAAK;EACR;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EACrD;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EACpD;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAG;EAAI;EAAI;EAAI;EAAG;EACrD;EAAI;EAAG;EAAG;EAAI;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EACrD;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAI;AACrD;AAEA,IAAI,KAAK,CAAC,GAAY,YAAY,YAAY,YAAY,UAAU;AACpE,IAAI,KAAK,CAAC,YAAY,YAAY,YAAY,YAAY,CAAU;AAEpE,SAAS,KAAK,GAAG,GAAG;AACnB,SAAQ,KAAK,IAAM,MAAO,KAAK;AAChC;AAEA,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG9D,IAAG;AACpC,SAAQ,KAAM,KAAK,IAAI,IAAI,KAAK,IAAI,IAAK,GAAGA,EAAC,IAAI,IAAK;AACvD;AAEA,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGA,IAAG;AACpC,SAAQ,KAAM,KAAM,IAAI,IAAM,CAAC,IAAI,KAAM,IAAI,IAAK,GAAGA,EAAC,IAAI,IAAK;AAChE;AAEA,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGA,IAAG;AACpC,SAAQ,KAAM,MAAM,IAAI,CAAC,KAAK,KAAK,IAAI,IAAK,GAAGA,EAAC,IAAI,IAAK;AAC1D;AAEA,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGA,IAAG;AACpC,SAAQ,KAAM,KAAM,IAAI,IAAM,IAAI,CAAC,KAAM,IAAI,IAAK,GAAGA,EAAC,IAAI,IAAK;AAChE;AAEA,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGA,IAAG;AACpC,SAAQ,KAAM,KAAK,KAAK,IAAI,CAAC,MAAM,IAAI,IAAK,GAAGA,EAAC,IAAI,IAAK;AAC1D;AAEA,SAASiQ,cAAY;AACpB,WAAS,KAAK,MAAM,EAAE;AAGtB,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACX;AAEAhO,WAASgO,aAAW,QAAQ;AAE5BA,YAAU,UAAU,UAAU,WAAY;AACzC,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC5B,UAAM,CAAC,IAAI,KAAK,OAAO,YAAY,IAAI,CAAC;EAC1C;AAEC,MAAI,KAAK,KAAK,KAAK;AACnB,MAAI,KAAK,KAAK,KAAK;AACnB,MAAI,KAAK,KAAK,KAAK;AACnB,MAAI,KAAK,KAAK,KAAK;AACnB,MAAI,KAAK,KAAK,KAAK;AAEnB,MAAI,KAAK,KAAK,KAAK;AACnB,MAAI,KAAK,KAAK,KAAK;AACnB,MAAI,KAAK,KAAK,KAAK;AACnB,MAAI,KAAK,KAAK,KAAK;AACnB,MAAI,KAAK,KAAK,KAAK;AAGnB,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;AAC/B,QAAI;AACJ,QAAI;AACJ,QAAI,IAAI,IAAI;AACX,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACvD,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IAC1D,WAAa,IAAI,IAAI;AAClB,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACvD,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IAC1D,WAAa,IAAI,IAAI;AAClB,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACvD,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IAC1D,WAAa,IAAI,IAAI;AAClB,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACvD,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IAC1D,OAAS;AACN,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACvD,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IAC1D;AAEE,SAAK;AACL,SAAK;AACL,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK;AACL,SAAK;AAEL,SAAK;AACL,SAAK;AACL,SAAK,KAAK,IAAI,EAAE;AAChB,SAAK;AACL,SAAK;EACP;AAGC,MAAI,IAAK,KAAK,KAAK,KAAK,KAAM;AAC9B,OAAK,KAAM,KAAK,KAAK,KAAK,KAAM;AAChC,OAAK,KAAM,KAAK,KAAK,KAAK,KAAM;AAChC,OAAK,KAAM,KAAK,KAAK,KAAK,KAAM;AAChC,OAAK,KAAM,KAAK,KAAK,KAAK,KAAM;AAChC,OAAK,KAAK;AACX;AAEAA,YAAU,UAAU,UAAU,WAAY;AAEzC,OAAK,OAAO,KAAK,YAAY,IAAI;AACjC,OAAK,gBAAgB;AACrB,MAAI,KAAK,eAAe,IAAI;AAC3B,SAAK,OAAO,KAAK,GAAG,KAAK,cAAc,EAAE;AACzC,SAAK,QAAO;AACZ,SAAK,eAAe;EACtB;AAEC,OAAK,OAAO,KAAK,GAAG,KAAK,cAAc,EAAE;AACzC,OAAK,OAAO,cAAc,KAAK,QAAQ,CAAC,GAAG,EAAE;AAC7C,OAAK,OAAO,cAAc,KAAK,QAAQ,CAAC,GAAG,EAAE;AAC7C,OAAK,QAAO;AAGZ,MAAInQ,UAASM,SAAO,QAAQA,SAAO,MAAM,EAAE,IAAI,IAAIA,SAAO,EAAE;AAC5D,EAAAN,QAAO,aAAa,KAAK,IAAI,CAAC;AAC9B,EAAAA,QAAO,aAAa,KAAK,IAAI,CAAC;AAC9B,EAAAA,QAAO,aAAa,KAAK,IAAI,CAAC;AAC9B,EAAAA,QAAO,aAAa,KAAK,IAAI,EAAE;AAC/B,EAAAA,QAAO,aAAa,KAAK,IAAI,EAAE;AAC/B,SAAOA;AACR;AAEA,IAAA,YAAiBmQ;;ACpKjB,IAAI7P,WAASH,oBAAuB;AACpC,IAAIyC,aAAWvC;AAGf,SAAS+P,OAAK/F,YAAW,WAAW;AACnC,OAAK,SAAS/J,SAAO,MAAM+J,UAAS;AACpC,OAAK,aAAa;AAClB,OAAK,aAAaA;AAClB,OAAK,OAAO;AACb;AAEA+F,OAAK,UAAU,SAAS,SAAU,MAAM,KAAK;AAE5C,SAAOxN,WAAS,MAAM,OAAO,MAAM;AAEnC,MAAI,QAAQ,KAAK;AACjB,MAAIyH,aAAY,KAAK;AACrB,MAAI,SAAS,KAAK;AAClB,MAAI,QAAQ,KAAK;AAEjB,WAAS,SAAS,GAAG,SAAS,UAAS;AACtC,QAAI,WAAW,QAAQA;AACvB,QAAI,YAAY,KAAK,IAAI,SAAS,QAAQA,aAAY,QAAQ;AAE9D,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AACnC,YAAM,WAAW,CAAC,IAAI,KAAK,SAAS,CAAC;IACxC;AAEE,aAAS;AACT,cAAU;AAEV,QAAK,QAAQA,eAAe,GAAG;AAC9B,WAAK,QAAQ,KAAK;IACrB;EACA;AAEC,OAAK,QAAQ;AACb,SAAO;AACR;AAEA+F,OAAK,UAAU,SAAS,SAAU,KAAK;AACtC,MAAI,MAAM,KAAK,OAAO,KAAK;AAE3B,OAAK,OAAO,GAAG,IAAI;AAMnB,OAAK,OAAO,KAAK,GAAG,MAAM,CAAC;AAE3B,MAAI,OAAO,KAAK,YAAY;AAC3B,SAAK,QAAQ,KAAK,MAAM;AACxB,SAAK,OAAO,KAAK,CAAC;EACpB;AAEC,MAAI,OAAO,KAAK,OAAO;AAGvB,MAAI,QAAQ,YAAY;AACvB,SAAK,OAAO,cAAc,MAAM,KAAK,aAAa,CAAC;EAGrD,OAAQ;AACN,QAAI,WAAW,OAAO,gBAAgB;AACtC,QAAI,YAAY,OAAO,WAAW;AAElC,SAAK,OAAO,cAAc,UAAU,KAAK,aAAa,CAAC;AACvD,SAAK,OAAO,cAAc,SAAS,KAAK,aAAa,CAAC;EACxD;AAEC,OAAK,QAAQ,KAAK,MAAM;AACxB,MAAIC,QAAO,KAAK,MAAK;AAErB,SAAO,MAAMA,MAAK,SAAS,GAAG,IAAIA;AACnC;AAEAD,OAAK,UAAU,UAAU,WAAY;AACpC,QAAM,IAAI,MAAM,yCAAyC;AAC1D;AAEA,IAAAC,SAAiBD;ACzEjB,IAAIjO,aAAWhC;AACf,IAAIiQ,SAAO/P;AACX,IAAIC,WAAS0D,oBAAuB;AAEpC,IAAIsM,MAAI;EACP;EAAY;EAAY,aAAa;EAAG,aAAa;AACtD;AAEA,IAAIC,MAAI,IAAI,MAAM,EAAE;AAEpB,SAAS,MAAM;AACd,OAAK,KAAI;AACT,OAAK,KAAKA;AAEVH,SAAK,KAAK,MAAM,IAAI,EAAE;AACvB;AAEAjO,WAAS,KAAKiO,MAAI;AAElB,IAAI,UAAU,OAAO,WAAY;AAChC,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AAEV,SAAO;AACR;AAEA,SAASI,QAAM,KAAK;AACnB,SAAQ,OAAO,IAAM,QAAQ;AAC9B;AAEA,SAASC,SAAO,KAAK;AACpB,SAAQ,OAAO,KAAO,QAAQ;AAC/B;AAEA,SAASC,KAAGxQ,IAAG,GAAG,GAAG,GAAG;AACvB,MAAIA,OAAM,GAAG;AACZ,WAAQ,IAAI,IAAM,CAAC,IAAI;EACzB;AACC,MAAIA,OAAM,GAAG;AACZ,WAAQ,IAAI,IAAM,IAAI,IAAM,IAAI;EAClC;AACC,SAAO,IAAI,IAAI;AAChB;AAEA,IAAI,UAAU,UAAU,SAAU,GAAG;AACpC,MAAI,IAAI,KAAK;AAEb,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAElB,WAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC5B,MAAE,CAAC,IAAI,EAAE,YAAY,IAAI,CAAC;EAC5B;AACC,SAAO,IAAI,IAAI,EAAE,GAAG;AACnB,MAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;EACnD;AAEC,WAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC5B,QAAIA,KAAI,CAAC,EAAE,IAAI;AACf,QAAI,IAAKsQ,QAAM,CAAC,IAAIE,KAAGxQ,IAAG,GAAG,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,IAAIoQ,IAAEpQ,EAAC,IAAK;AAExD,QAAI;AACJ,QAAI;AACJ,QAAIuQ,SAAO,CAAC;AACZ,QAAI;AACJ,QAAI;EACN;AAEC,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC3B;AAEA,IAAI,UAAU,QAAQ,WAAY;AACjC,MAAI,IAAInQ,SAAO,YAAY,EAAE;AAE7B,IAAE,aAAa,KAAK,KAAK,GAAG,CAAC;AAC7B,IAAE,aAAa,KAAK,KAAK,GAAG,CAAC;AAC7B,IAAE,aAAa,KAAK,KAAK,GAAG,CAAC;AAC7B,IAAE,aAAa,KAAK,KAAK,GAAG,EAAE;AAC9B,IAAE,aAAa,KAAK,KAAK,GAAG,EAAE;AAE9B,SAAO;AACR;AAEA,IAAAqQ,QAAiB;AC5FjB,IAAIxO,aAAWhC;AACf,IAAIiQ,SAAO/P;AACX,IAAIC,WAAS0D,oBAAuB;AAEpC,IAAIsM,MAAI;EACP;EAAY;EAAY,aAAa;EAAG,aAAa;AACtD;AAEA,IAAIC,MAAI,IAAI,MAAM,EAAE;AAEpB,SAAS,OAAO;AACf,OAAK,KAAI;AACT,OAAK,KAAKA;AAEVH,SAAK,KAAK,MAAM,IAAI,EAAE;AACvB;AAEAjO,WAAS,MAAMiO,MAAI;AAEnB,KAAK,UAAU,OAAO,WAAY;AACjC,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AAEV,SAAO;AACR;AAEA,SAAS,MAAM,KAAK;AACnB,SAAQ,OAAO,IAAM,QAAQ;AAC9B;AAEA,SAAS,MAAM,KAAK;AACnB,SAAQ,OAAO,IAAM,QAAQ;AAC9B;AAEA,SAAS,OAAO,KAAK;AACpB,SAAQ,OAAO,KAAO,QAAQ;AAC/B;AAEA,SAAS,GAAGlQ,IAAG,GAAG,GAAG,GAAG;AACvB,MAAIA,OAAM,GAAG;AACZ,WAAQ,IAAI,IAAM,CAAC,IAAI;EACzB;AACC,MAAIA,OAAM,GAAG;AACZ,WAAQ,IAAI,IAAM,IAAI,IAAM,IAAI;EAClC;AACC,SAAO,IAAI,IAAI;AAChB;AAEA,KAAK,UAAU,UAAU,SAAU,GAAG;AACrC,MAAI,IAAI,KAAK;AAEb,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAElB,WAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC5B,MAAE,CAAC,IAAI,EAAE,YAAY,IAAI,CAAC;EAC5B;AACC,SAAO,IAAI,IAAI,EAAE,GAAG;AACnB,MAAE,CAAC,IAAI,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;EAC1D;AAEC,WAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC5B,QAAIA,KAAI,CAAC,EAAE,IAAI;AACf,QAAI,IAAK,MAAM,CAAC,IAAI,GAAGA,IAAG,GAAG,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,IAAIoQ,IAAEpQ,EAAC,IAAK;AAExD,QAAI;AACJ,QAAI;AACJ,QAAI,OAAO,CAAC;AACZ,QAAI;AACJ,QAAI;EACN;AAEC,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC3B;AAEA,KAAK,UAAU,QAAQ,WAAY;AAClC,MAAI,IAAII,SAAO,YAAY,EAAE;AAE7B,IAAE,aAAa,KAAK,KAAK,GAAG,CAAC;AAC7B,IAAE,aAAa,KAAK,KAAK,GAAG,CAAC;AAC7B,IAAE,aAAa,KAAK,KAAK,GAAG,CAAC;AAC7B,IAAE,aAAa,KAAK,KAAK,GAAG,EAAE;AAC9B,IAAE,aAAa,KAAK,KAAK,GAAG,EAAE;AAE9B,SAAO;AACR;AAEA,IAAA,OAAiB;AClGjB,IAAI6B,aAAWhC;AACf,IAAIiQ,SAAO/P;AACX,IAAIC,WAAS0D,oBAAuB;AAEpC,IAAIsM,MAAI;EACP;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;AACD;AAEA,IAAIC,MAAI,IAAI,MAAM,EAAE;AAEpB,SAASK,WAAS;AACjB,OAAK,KAAI;AAET,OAAK,KAAKL;AAEVH,SAAK,KAAK,MAAM,IAAI,EAAE;AACvB;AAEAjO,WAASyO,UAAQR,MAAI;AAErBQ,SAAO,UAAU,OAAO,WAAY;AACnC,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AAEV,SAAO;AACR;AAEA,SAAS,GAAG,GAAG,GAAG,GAAG;AACpB,SAAO,IAAK,KAAK,IAAI;AACtB;AAEA,SAASC,MAAI,GAAG,GAAG,GAAG;AACrB,SAAQ,IAAI,IAAM,KAAK,IAAI;AAC5B;AAEA,SAASC,SAAO,GAAG;AAClB,UAAS,MAAM,IAAM,KAAK,OAAS,MAAM,KAAO,KAAK,OAAS,MAAM,KAAO,KAAK;AACjF;AAEA,SAASC,SAAO,GAAG;AAClB,UAAS,MAAM,IAAM,KAAK,OAAS,MAAM,KAAO,KAAK,OAAS,MAAM,KAAO,KAAK;AACjF;AAEA,SAAS,OAAO,GAAG;AAClB,UAAS,MAAM,IAAM,KAAK,OAAS,MAAM,KAAO,KAAK,MAAQ,MAAM;AACpE;AAEA,SAAS,OAAO,GAAG;AAClB,UAAS,MAAM,KAAO,KAAK,OAAS,MAAM,KAAO,KAAK,MAAQ,MAAM;AACrE;AAEAH,SAAO,UAAU,UAAU,SAAU,GAAG;AACvC,MAAI,IAAI,KAAK;AAEb,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAII,KAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,IAAI,KAAK,KAAK;AAElB,WAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC5B,MAAE,CAAC,IAAI,EAAE,YAAY,IAAI,CAAC;EAC5B;AACC,SAAO,IAAI,IAAI,EAAE,GAAG;AACnB,MAAE,CAAC,IAAK,OAAO,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAK;EACzE;AAEC,WAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC5B,QAAI,KAAM,IAAID,SAAO,CAAC,IAAI,GAAG,GAAGC,IAAG,CAAC,IAAIV,IAAE,CAAC,IAAI,EAAE,CAAC,IAAK;AACvD,QAAI,KAAMQ,SAAO,CAAC,IAAID,MAAI,GAAG,GAAG,CAAC,IAAK;AAEtC,QAAI;AACJ,QAAIG;AACJ,IAAAA,KAAI;AACJ,QAAK,IAAI,KAAM;AACf,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAK,KAAK,KAAM;EAClB;AAEC,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAMA,KAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC1B,OAAK,KAAM,IAAI,KAAK,KAAM;AAC3B;AAEAJ,SAAO,UAAU,QAAQ,WAAY;AACpC,MAAI,IAAItQ,SAAO,YAAY,EAAE;AAE7B,IAAE,aAAa,KAAK,IAAI,CAAC;AACzB,IAAE,aAAa,KAAK,IAAI,CAAC;AACzB,IAAE,aAAa,KAAK,IAAI,CAAC;AACzB,IAAE,aAAa,KAAK,IAAI,EAAE;AAC1B,IAAE,aAAa,KAAK,IAAI,EAAE;AAC1B,IAAE,aAAa,KAAK,IAAI,EAAE;AAC1B,IAAE,aAAa,KAAK,IAAI,EAAE;AAC1B,IAAE,aAAa,KAAK,IAAI,EAAE;AAE1B,SAAO;AACR;AAEA,IAAA2Q,WAAiBL;AClLjB,IAAIzO,aAAWhC;AACf,IAAI,SAASE;AACb,IAAI+P,SAAOpM;AACX,IAAI1D,WAASoE,oBAAuB;AAEpC,IAAI6L,MAAI,IAAI,MAAM,EAAE;AAEpB,SAAS,SAAS;AACjB,OAAK,KAAI;AAET,OAAK,KAAKA;AAEVH,SAAK,KAAK,MAAM,IAAI,EAAE;AACvB;AAEAjO,WAAS,QAAQ,MAAM;AAEvB,OAAO,UAAU,OAAO,WAAY;AACnC,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AAEV,SAAO;AACR;AAEA,OAAO,UAAU,QAAQ,WAAY;AACpC,MAAI,IAAI7B,SAAO,YAAY,EAAE;AAE7B,IAAE,aAAa,KAAK,IAAI,CAAC;AACzB,IAAE,aAAa,KAAK,IAAI,CAAC;AACzB,IAAE,aAAa,KAAK,IAAI,CAAC;AACzB,IAAE,aAAa,KAAK,IAAI,EAAE;AAC1B,IAAE,aAAa,KAAK,IAAI,EAAE;AAC1B,IAAE,aAAa,KAAK,IAAI,EAAE;AAC1B,IAAE,aAAa,KAAK,IAAI,EAAE;AAE1B,SAAO;AACR;AAEA,IAAA4Q,WAAiB;ACpDjB,IAAI/O,aAAWhC;AACf,IAAIiQ,SAAO/P;AACX,IAAIC,WAAS0D,oBAAuB;AAEpC,IAAIsM,MAAI;EACP;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;AACD;AAEA,IAAIC,MAAI,IAAI,MAAM,GAAG;AAErB,SAAS,SAAS;AACjB,OAAK,KAAI;AACT,OAAK,KAAKA;AAEVH,SAAK,KAAK,MAAM,KAAK,GAAG;AACzB;AAEAjO,WAAS,QAAQiO,MAAI;AAErB,OAAO,UAAU,OAAO,WAAY;AACnC,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AAEX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AAEX,SAAO;AACR;AAEA,SAAS,GAAG,GAAG,GAAG,GAAG;AACpB,SAAO,IAAK,KAAK,IAAI;AACtB;AAEA,SAAS,IAAI,GAAG,GAAG,GAAG;AACrB,SAAQ,IAAI,IAAM,KAAK,IAAI;AAC5B;AAEA,SAAS,OAAO,GAAG,IAAI;AACtB,UAAS,MAAM,KAAO,MAAM,MAAQ,OAAO,IAAM,KAAK,OAAS,OAAO,IAAM,KAAK;AAClF;AAEA,SAAS,OAAO,GAAG,IAAI;AACtB,UAAS,MAAM,KAAO,MAAM,OAAS,MAAM,KAAO,MAAM,OAAS,OAAO,IAAM,KAAK;AACpF;AAEA,SAAS,OAAO,GAAG,IAAI;AACtB,UAAS,MAAM,IAAM,MAAM,OAAS,MAAM,IAAM,MAAM,MAAQ,MAAM;AACrE;AAEA,SAAS,QAAQ,GAAG,IAAI;AACvB,UAAS,MAAM,IAAM,MAAM,OAAS,MAAM,IAAM,MAAM,OAAS,MAAM,IAAM,MAAM;AAClF;AAEA,SAAS,OAAO,GAAG,IAAI;AACtB,UAAS,MAAM,KAAO,MAAM,OAAS,OAAO,KAAO,KAAK,KAAO,MAAM;AACtE;AAEA,SAAS,QAAQ,GAAG,IAAI;AACvB,UAAS,MAAM,KAAO,MAAM,OAAS,OAAO,KAAO,KAAK,MAAQ,MAAM,IAAM,MAAM;AACnF;AAEA,SAAS,SAAS,GAAG,GAAG;AACvB,SAAQ,MAAM,IAAM,MAAM,IAAK,IAAI;AACpC;AAEA,OAAO,UAAU,UAAU,SAAU,GAAG;AACvC,MAAI,IAAI,KAAK;AAEb,MAAI,KAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAIe,MAAK,KAAK,MAAM;AACpB,MAAIC,MAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AAEpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAI,KAAK,KAAK,MAAM;AACpB,MAAIC,MAAK,KAAK,MAAM;AAEpB,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;AAC/B,MAAE,CAAC,IAAI,EAAE,YAAY,IAAI,CAAC;AAC1B,MAAE,IAAI,CAAC,IAAI,EAAE,YAAa,IAAI,IAAK,CAAC;EACtC;AACC,SAAO,IAAI,KAAK,KAAK,GAAG;AACvB,QAAI,KAAK,EAAE,IAAK,KAAK,CAAE;AACvB,QAAI,KAAK,EAAE,IAAK,KAAK,IAAK,CAAC;AAC3B,QAAIC,UAAS,OAAO,IAAI,EAAE;AAC1B,QAAI,UAAU,QAAQ,IAAI,EAAE;AAE5B,SAAK,EAAE,IAAK,IAAI,CAAE;AAClB,SAAK,EAAE,IAAK,IAAI,IAAK,CAAC;AACtB,QAAIC,UAAS,OAAO,IAAI,EAAE;AAC1B,QAAI,UAAU,QAAQ,IAAI,EAAE;AAG5B,QAAI,OAAO,EAAE,IAAK,IAAI,CAAE;AACxB,QAAI,OAAO,EAAE,IAAK,IAAI,IAAK,CAAC;AAE5B,QAAI,QAAQ,EAAE,IAAK,KAAK,CAAE;AAC1B,QAAI,QAAQ,EAAE,IAAK,KAAK,IAAK,CAAC;AAE9B,QAAI,MAAO,UAAU,OAAQ;AAC7B,QAAI,MAAOD,UAAS,OAAO,SAAS,KAAK,OAAO,IAAK;AACrD,UAAO,MAAM,UAAW;AACxB,UAAO,MAAMC,UAAS,SAAS,KAAK,OAAO,IAAK;AAChD,UAAO,MAAM,QAAS;AACtB,UAAO,MAAM,QAAQ,SAAS,KAAK,KAAK,IAAK;AAE7C,MAAE,CAAC,IAAI;AACP,MAAE,IAAI,CAAC,IAAI;EACb;AAEC,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAChC,UAAM,EAAE,CAAC;AACT,UAAM,EAAE,IAAI,CAAC;AAEb,QAAI,OAAO,IAAI,IAAI,IAAIJ,GAAE;AACzB,QAAI,OAAO,IAAI,IAAI,IAAI,EAAE;AAEzB,QAAI,UAAU,OAAO,IAAI,EAAE;AAC3B,QAAI,UAAU,OAAO,IAAI,EAAE;AAC3B,QAAI,UAAU,OAAO,IAAI,EAAE;AAC3B,QAAI,UAAU,OAAO,IAAI,EAAE;AAG3B,QAAI,MAAMb,IAAE,CAAC;AACb,QAAI,MAAMA,IAAE,IAAI,CAAC;AAEjB,QAAI,MAAM,GAAG,IAAI,IAAI,EAAE;AACvB,QAAI,MAAM,GAAG,IAAI,IAAI,EAAE;AAEvB,QAAI,MAAOe,MAAK,UAAW;AAC3B,QAAI,MAAO,KAAK,UAAU,SAAS,KAAKA,GAAE,IAAK;AAC/C,UAAO,MAAM,MAAO;AACpB,UAAO,MAAM,MAAM,SAAS,KAAK,GAAG,IAAK;AACzC,UAAO,MAAM,MAAO;AACpB,UAAO,MAAM,MAAM,SAAS,KAAK,GAAG,IAAK;AACzC,UAAO,MAAM,MAAO;AACpB,UAAO,MAAM,MAAM,SAAS,KAAK,GAAG,IAAK;AAGzC,QAAI,MAAO,UAAU,OAAQ;AAC7B,QAAI,MAAO,UAAU,OAAO,SAAS,KAAK,OAAO,IAAK;AAEtD,SAAK;AACL,IAAAA,MAAK;AACL,SAAK;AACL,SAAK;AACL,SAAK;AACL,SAAK;AACL,SAAM,KAAK,MAAO;AAClB,SAAMD,MAAK,MAAM,SAAS,IAAI,EAAE,IAAK;AACrC,IAAAA,MAAKD;AACL,SAAK;AACL,IAAAA,MAAK;AACL,SAAK;AACL,SAAK;AACL,SAAK;AACL,SAAM,MAAM,MAAO;AACnB,SAAM,MAAM,MAAM,SAAS,IAAI,GAAG,IAAK;EACzC;AAEC,OAAK,MAAO,KAAK,MAAM,KAAM;AAC7B,OAAK,MAAO,KAAK,MAAM,KAAM;AAC7B,OAAK,MAAO,KAAK,MAAM,KAAM;AAC7B,OAAK,MAAO,KAAK,MAAM,KAAM;AAC7B,OAAK,MAAO,KAAK,MAAM,KAAM;AAC7B,OAAK,MAAO,KAAK,MAAM,KAAM;AAC7B,OAAK,MAAO,KAAK,MAAM,KAAM;AAC7B,OAAK,MAAO,KAAK,MAAME,MAAM;AAE7B,OAAK,MAAO,KAAK,MAAM,KAAK,SAAS,KAAK,KAAK,EAAE,IAAK;AACtD,OAAK,MAAO,KAAK,MAAM,KAAK,SAAS,KAAK,KAAK,EAAE,IAAK;AACtD,OAAK,MAAO,KAAK,MAAMF,MAAK,SAAS,KAAK,KAAK,EAAE,IAAK;AACtD,OAAK,MAAO,KAAK,MAAMC,MAAK,SAAS,KAAK,KAAK,EAAE,IAAK;AACtD,OAAK,MAAO,KAAK,MAAM,KAAK,SAAS,KAAK,KAAK,EAAE,IAAK;AACtD,OAAK,MAAO,KAAK,MAAM,KAAK,SAAS,KAAK,KAAK,EAAE,IAAK;AACtD,OAAK,MAAO,KAAK,MAAM,KAAK,SAAS,KAAK,KAAK,EAAE,IAAK;AACtD,OAAK,MAAO,KAAK,MAAM,KAAK,SAAS,KAAK,KAAKC,GAAE,IAAK;AACvD;AAEA,OAAO,UAAU,QAAQ,WAAY;AACpC,MAAI,IAAI/Q,SAAO,YAAY,EAAE;AAE7B,WAAS,aAAa,GAAG,GAAG,QAAQ;AACnC,MAAE,aAAa,GAAG,MAAM;AACxB,MAAE,aAAa,GAAG,SAAS,CAAC;EAC9B;AAEC,eAAa,KAAK,KAAK,KAAK,KAAK,CAAC;AAClC,eAAa,KAAK,KAAK,KAAK,KAAK,CAAC;AAClC,eAAa,KAAK,KAAK,KAAK,KAAK,EAAE;AACnC,eAAa,KAAK,KAAK,KAAK,KAAK,EAAE;AACnC,eAAa,KAAK,KAAK,KAAK,KAAK,EAAE;AACnC,eAAa,KAAK,KAAK,KAAK,KAAK,EAAE;AACnC,eAAa,KAAK,KAAK,KAAK,KAAK,EAAE;AACnC,eAAa,KAAK,KAAK,KAAK,KAAK,EAAE;AAEnC,SAAO;AACR;AAEA,IAAAkR,WAAiB;AC3XjB,IAAIrP,aAAWhC;AACf,IAAIsR,WAASpR;AACb,IAAI+P,SAAOpM;AACX,IAAI1D,WAASoE,oBAAuB;AAEpC,IAAI,IAAI,IAAI,MAAM,GAAG;AAErB,SAAS,SAAS;AACjB,OAAK,KAAI;AACT,OAAK,KAAK;AAEV0L,SAAK,KAAK,MAAM,KAAK,GAAG;AACzB;AAEAjO,WAAS,QAAQsP,QAAM;AAEvB,OAAO,UAAU,OAAO,WAAY;AACnC,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AAEX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,MAAM;AAEX,SAAO;AACR;AAEA,OAAO,UAAU,QAAQ,WAAY;AACpC,MAAI,IAAInR,SAAO,YAAY,EAAE;AAE7B,WAAS,aAAa,GAAG,GAAG,QAAQ;AACnC,MAAE,aAAa,GAAG,MAAM;AACxB,MAAE,aAAa,GAAG,SAAS,CAAC;EAC9B;AAEC,eAAa,KAAK,KAAK,KAAK,KAAK,CAAC;AAClC,eAAa,KAAK,KAAK,KAAK,KAAK,CAAC;AAClC,eAAa,KAAK,KAAK,KAAK,KAAK,EAAE;AACnC,eAAa,KAAK,KAAK,KAAK,KAAK,EAAE;AACnC,eAAa,KAAK,KAAK,KAAK,KAAK,EAAE;AACnC,eAAa,KAAK,KAAK,KAAK,KAAK,EAAE;AAEnC,SAAO;AACR;AAEA,IAAAoR,WAAiB;;ACxDjB,SAAA,UAAiB,SAAS,IAAI,WAAW;AACxC,QAAI,MAAM,UAAU,YAAW;AAE/B,QAAI,YAAY,OAAO,QAAQ,GAAG;AAClC,QAAI,CAAC,WAAW;AACf,YAAM,IAAI,MAAM,MAAM,6CAA6C;;AAGpE,WAAO,IAAI,UAAS;EACrB;AAEA,SAAA,QAAA,MAAqBvR;AACrB,SAAA,QAAA,OAAsBE;AACtB,SAAA,QAAA,SAAwB2D;AACxB,SAAA,QAAA,SAAwBU;AACxB,SAAA,QAAA,SAAwBG;AACxB,SAAA,QAAA,SAAwBiB;;;AChBxB,IAAIxF,WAASH,oBAAuB;AACpC,IAAI6J,cAAY3J,iBAAkB;AAClC,IAAI,gBAAgB2D,iBAA0B;AAC9C,IAAI7B,aAAWuC;AACf,IAAI9B,aAAWiC;AAEf,SAAS8M,aAAW,UAAU;AAC7B3H,cAAU,KAAK,IAAI;AACnB,OAAK,WAAW,OAAO,aAAa;AACpC,MAAI,KAAK,UAAU;AAClB,SAAK,QAAQ,IAAI,KAAK;EACxB,OAAQ;AACN,SAAK,OAAO,IAAI,KAAK;EACvB;AACC,MAAI,KAAK,QAAQ;AAChB,SAAK,UAAU,KAAK;AACpB,SAAK,SAAS;EAChB;AACC,OAAK,WAAW;AAChB,OAAK,YAAY;AAClB;AACA7H,WAASwP,cAAY3H,WAAS;AAE9B2H,aAAW,UAAU,SAAS,SAAU,MAAM,UAAU,WAAW;AAClE,MAAI,aAAa/O,WAAS,MAAM,QAAQ;AACxC,MAAI,UAAU,KAAK,QAAQ,UAAU;AACrC,MAAI,KAAK,UAAU;AAClB,WAAO;EACT;AAEC,MAAI,WAAW;AACd,cAAU,KAAK,UAAU,SAAS,SAAS;EAC7C;AAEC,SAAO;AACR;AAEA+O,aAAW,UAAU,iBAAiB,WAAY;AAAA;AAClDA,aAAW,UAAU,aAAa,WAAY;AAC7C,QAAM,IAAI,MAAM,6CAA6C;AAC9D;AAEAA,aAAW,UAAU,aAAa,WAAY;AAC7C,QAAM,IAAI,MAAM,6CAA6C;AAC9D;AAEAA,aAAW,UAAU,SAAS,WAAY;AACzC,QAAM,IAAI,MAAM,wCAAwC;AACzD;AAEAA,aAAW,UAAU,aAAa,SAAU,MAAM,GAAG,MAAM;AAC1D,MAAI;AACJ,MAAI;AACH,QAAI,KAAK,UAAU;AAClB,WAAK,QAAQ,IAAI;IACpB,OAAS;AACN,WAAK,KAAK,KAAK,QAAQ,IAAI,CAAC;IAC/B;EACA,SAAU,GAAG;AACX,UAAM;EACR,UAAE;AACA,SAAK,GAAG;EACV;AACA;AACAA,aAAW,UAAU,SAAS,SAAUxI,OAAM;AAC7C,MAAI;AACJ,MAAI;AACH,SAAK,KAAK,KAAK,QAAO,CAAE;EAC1B,SAAU,GAAG;AACX,UAAM;EACR;AAEC,EAAAA,MAAK,GAAG;AACT;AACAwI,aAAW,UAAU,iBAAiB,SAAU,WAAW;AAC1D,MAAI,UAAU,KAAK,QAAO,KAAMrR,SAAO,MAAM,CAAC;AAC9C,MAAI,WAAW;AACd,cAAU,KAAK,UAAU,SAAS,WAAW,IAAI;EACnD;AACC,SAAO;AACR;AAEAqR,aAAW,UAAU,YAAY,SAAU,OAAO,KAAK,KAAK;AAC3D,MAAI,CAAC,KAAK,UAAU;AACnB,SAAK,WAAW,IAAI,cAAc,GAAG;AACrC,SAAK,YAAY;EACnB;AAEC,MAAI,KAAK,cAAc,KAAK;AAC3B,UAAM,IAAI,MAAM,6BAAwB;EAC1C;AAEC,MAAI,MAAM,KAAK,SAAS,MAAM,KAAK;AACnC,MAAI,KAAK;AACR,WAAO,KAAK,SAAS,IAAG;EAC1B;AAEC,SAAO;AACR;AAEA,IAAA,aAAiBA;ACrGjB,IAAIxP,aAAWhC;AACf,IAAIwK,QAAMtK;AACV,IAAI8P,cAAYnM;AAChB,IAAI2M,QAAMjM;AACV,IAAIhD,SAAOmD;AAEX,SAASuL,OAAMC,OAAM;AACnB3O,SAAK,KAAK,MAAM,QAAQ;AAExB,OAAK,QAAQ2O;AACf;AAEAlO,WAASiO,QAAM1O,MAAI;AAEnB0O,OAAK,UAAU,UAAU,SAAU,MAAM;AACvC,OAAK,MAAM,OAAO,IAAI;AACxB;AAEAA,OAAK,UAAU,SAAS,WAAY;AAClC,SAAO,KAAK,MAAM,OAAM;AAC1B;AAEA,IAAApI,YAAiB,SAAS,WAAY,KAAK;AACzC,QAAM,IAAI,YAAW;AACrB,MAAI,QAAQ,MAAO,QAAO,IAAI2C,MAAG;AACjC,MAAI,QAAQ,YAAY,QAAQ,YAAa,QAAO,IAAIwF,YAAS;AAEjE,SAAO,IAAIC,OAAKO,MAAI,GAAG,CAAC;AAC1B;AC5BA,IAAIxO,aAAWhC;AACf,IAAIG,WAASD,oBAAuB;AAEpC,IAAIqB,SAAOsC;AAEX,IAAI4N,UAAQtR,SAAO,MAAM,GAAG;AAC5B,IAAI,YAAY;AAEhB,SAASuR,OAAM,KAAK7P,MAAK;AACvBN,SAAK,KAAK,MAAM,QAAQ;AACxB,MAAI,OAAOM,SAAQ,UAAU;AAC3B,IAAAA,OAAM1B,SAAO,KAAK0B,IAAG;EACzB;AAEE,OAAK,OAAO;AACZ,OAAK,OAAOA;AAEZ,MAAIA,KAAI,SAAS,WAAW;AAC1B,IAAAA,OAAM,IAAIA,IAAG;EACjB,WAAaA,KAAI,SAAS,WAAW;AACjC,IAAAA,OAAM1B,SAAO,OAAO,CAAC0B,MAAK4P,OAAK,GAAG,SAAS;EAC/C;AAEE,MAAI,OAAO,KAAK,QAAQtR,SAAO,YAAY,SAAS;AACpD,MAAI,OAAO,KAAK,QAAQA,SAAO,YAAY,SAAS;AAEpD,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,SAAK,CAAC,IAAI0B,KAAI,CAAC,IAAI;AACnB,SAAK,CAAC,IAAIA,KAAI,CAAC,IAAI;EACvB;AAEE,OAAK,QAAQ,CAAC,IAAI;AACpB;AAEAG,WAAS0P,QAAMnQ,MAAI;AAEnBmQ,OAAK,UAAU,UAAU,SAAU,MAAM;AACvC,OAAK,MAAM,KAAK,IAAI;AACtB;AAEAA,OAAK,UAAU,SAAS,WAAY;AAClC,MAAI,IAAI,KAAK,KAAKvR,SAAO,OAAO,KAAK,KAAK,CAAC;AAC3C,SAAO,KAAK,KAAKA,SAAO,OAAO,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC;AACjD;AACA,IAAA,SAAiBuR;AC7CjB,IAAIlH,QAAMxK;IAEV2R,QAAiB,SAAU9R,SAAQ;AACjC,SAAO,IAAI2K,MAAG,EAAG,OAAO3K,OAAM,EAAE,OAAM;AACxC;ACHA,IAAImC,aAAWhC;AACf,IAAI,SAASE;AACb,IAAIqB,SAAOsC;AACX,IAAI1D,WAASoE,oBAAuB;AACpC,IAAIoN,QAAMjN;AACV,IAAIsL,cAAYrK;AAEhB,IAAI6K,QAAMvI;AAEV,IAAIwJ,UAAQtR,SAAO,MAAM,GAAG;AAE5B,SAASuR,OAAM,KAAK7P,MAAK;AACvBN,SAAK,KAAK,MAAM,QAAQ;AACxB,MAAI,OAAOM,SAAQ,UAAU;AAC3B,IAAAA,OAAM1B,SAAO,KAAK0B,IAAG;EACzB;AAEE,MAAI+P,aAAa,QAAQ,YAAY,QAAQ,WAAY,MAAM;AAE/D,OAAK,OAAO;AACZ,OAAK,OAAO/P;AACZ,MAAIA,KAAI,SAAS+P,YAAW;AAC1B,QAAI1B,QAAO,QAAQ,WAAW,IAAIF,YAAS,IAAKQ,MAAI,GAAG;AACvD,IAAA3O,OAAMqO,MAAK,OAAOrO,IAAG,EAAE,OAAM;EACjC,WAAaA,KAAI,SAAS+P,YAAW;AACjC,IAAA/P,OAAM1B,SAAO,OAAO,CAAC0B,MAAK4P,OAAK,GAAGG,UAAS;EAC/C;AAEE,MAAI,OAAO,KAAK,QAAQzR,SAAO,YAAYyR,UAAS;AACpD,MAAI,OAAO,KAAK,QAAQzR,SAAO,YAAYyR,UAAS;AAEpD,WAAS,IAAI,GAAG,IAAIA,YAAW,KAAK;AAClC,SAAK,CAAC,IAAI/P,KAAI,CAAC,IAAI;AACnB,SAAK,CAAC,IAAIA,KAAI,CAAC,IAAI;EACvB;AACE,OAAK,QAAQ,QAAQ,WAAW,IAAImO,YAAS,IAAKQ,MAAI,GAAG;AACzD,OAAK,MAAM,OAAO,IAAI;AACxB;AAEAxO,WAAS0P,QAAMnQ,MAAI;AAEnBmQ,OAAK,UAAU,UAAU,SAAU,MAAM;AACvC,OAAK,MAAM,OAAO,IAAI;AACxB;AAEAA,OAAK,UAAU,SAAS,WAAY;AAClC,MAAI,IAAI,KAAK,MAAM,OAAM;AACzB,MAAIxB,QAAO,KAAK,SAAS,WAAW,IAAIF,YAAS,IAAKQ,MAAI,KAAK,IAAI;AACnE,SAAON,MAAK,OAAO,KAAK,KAAK,EAAE,OAAO,CAAC,EAAE,OAAM;AACjD;AAEA,IAAArI,YAAiB,SAAS,WAAY,KAAKhG,MAAK;AAC9C,QAAM,IAAI,YAAW;AACrB,MAAI,QAAQ,YAAY,QAAQ,aAAa;AAC3C,WAAO,IAAI6P,OAAK,UAAU7P,IAAG;EACjC;AACE,MAAI,QAAQ,OAAO;AACjB,WAAO,IAAI,OAAO8P,OAAK9P,IAAG;EAC9B;AACE,SAAO,IAAI6P,OAAK,KAAK7P,IAAG;AAC1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC3DA,IAAA,QAAiB7B;;ACAjB,IAAI,YAAY;AAChB,IAAI,YAAY,KAAK,IAAI,GAAG,EAAE,IAAI;AAElC,IAAA,eAAiB,SAAU,YAAY,QAAQ;AAC9C,MAAI,OAAO,eAAe,UAAU;AACnC,UAAM,IAAI,UAAU,yBAAyB;EAC/C;AAEC,MAAI,aAAa,KAAK,CAAC,UAAU,UAAU,GAAG;AAC7C,UAAM,IAAI,UAAU,gBAAgB;EACtC;AAEC,MAAI,OAAO,WAAW,UAAU;AAC/B,UAAM,IAAI,UAAU,yBAAyB;EAC/C;AAEC,MAAI,SAAS,KAAK,SAAS,aAAa,WAAW,QAAQ;AAC1D,UAAM,IAAI,UAAU,gBAAgB;EACtC;AACA;ACnBA,IAAI6R;AAEJ,IAAIxL,eAAO,WAAWA,eAAO,QAAQ,SAAS;AAC7CwL,sBAAkB;AACnB,WAAWxL,eAAO,WAAWA,eAAO,QAAQ,SAAS;AAChD,kBAAgB,SAAS,QAAQ,QAAQ,MAAM,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE;AAEvEwL,sBAAkB,iBAAiB,IAAI,UAAU;AAClD,OAAO;AACNA,sBAAkB;AACnB;AALK;AAML,IAAA,oBAAiBA;ACXjB,IAAI1R,WAASH,oBAAuB;AACpC,IAAIyC,aAAWvC;AAEf,IAAI,gBAAgB,OAAO,eAAe;AAC1C,IAAI,iBAAiB,iBAAiB,OAAO,gBAAgB;AAC7D,IAAIqO,UAAS,kBAAkB,YAAY;AAE3C,IAAA,aAAiB,SAAU,OAAO,UAAU/M,OAAM;AACjD,MACC,OAAO,UAAU,YACdrB,SAAO,SAAS,KAAK,KACpB,iBAAiB,iBAAiB,cAClCoO,WAAUA,QAAO,KAAK,GACzB;AACD,WAAO9L,WAAS,OAAO,QAAQ;EACjC;AACC,QAAM,IAAI,UAAUjB,QAAO,0DAA0D;AACtF;ACjBA,IAAI,MAAMxB;AACV,IAAIgQ,cAAY9P;AAChB,IAAIsQ,QAAM3M;AACV,IAAI1D,WAASoE,oBAAuB;AAEpC,IAAIuN,oBAAkBpN;AACtB,IAAImN,oBAAkBlM;AACtB,IAAIlD,aAAWwF;AAEf,IAAI,QAAQ9H,SAAO,MAAM,GAAG;AAC5B,IAAI,QAAQ;EACX,WAAW;EACX,KAAK;EACL,MAAM;EACN,QAAQ;EACR,QAAQ;EACR,QAAQ;EACR,QAAQ;EACR,cAAc;EACd,WAAW;EACX,QAAQ;AACT;AAEA,IAAI,UAAU;EACb,WAAW;EACX,SAAS;EACT,WAAW;EACX,WAAW;EACX,WAAW;EACX,WAAW;EACX,cAAc;AACf;AAEA,SAAS,WAAW,MAAM;AACzB,SAAO,IAAI6P,YAAS,EAAG,OAAO,IAAI,EAAE,OAAM;AAC3C;AAEA,SAAS+B,YAAU,KAAK;AACvB,WAAS,QAAQ,MAAM;AACtB,WAAOvB,MAAI,GAAG,EAAE,OAAO,IAAI,EAAE,OAAM;EACrC;AAEC,MAAI,QAAQ,YAAY,QAAQ,aAAa;AAC5C,WAAO;EACT;AACC,MAAI,QAAQ,OAAO;AAClB,WAAO;EACT;AACC,SAAO;AACR;AAEA,SAASkB,OAAK,KAAK7P,MAAK,SAAS;AAChC,MAAIqO,QAAO6B,YAAU,GAAG;AACxB,MAAIH,aAAY,QAAQ,YAAY,QAAQ,WAAW,MAAM;AAE7D,MAAI/P,KAAI,SAAS+P,YAAW;AAC3B,IAAA/P,OAAMqO,MAAKrO,IAAG;EAChB,WAAYA,KAAI,SAAS+P,YAAW;AAClC,IAAA/P,OAAM1B,SAAO,OAAO,CAAC0B,MAAK,KAAK,GAAG+P,UAAS;EAC7C;AAEC,MAAI,OAAOzR,SAAO,YAAYyR,aAAY,MAAM,GAAG,CAAC;AACpD,MAAI,OAAOzR,SAAO,YAAYyR,aAAY,MAAM,GAAG,CAAC;AACpD,WAAS,IAAI,GAAG,IAAIA,YAAW,KAAK;AACnC,SAAK,CAAC,IAAI/P,KAAI,CAAC,IAAI;AACnB,SAAK,CAAC,IAAIA,KAAI,CAAC,IAAI;EACrB;AAEC,MAAI,QAAQ1B,SAAO,YAAYyR,aAAY,UAAU,CAAC;AACtD,OAAK,KAAK,OAAO,GAAG,GAAGA,UAAS;AAChC,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,OAAO;AACZ,OAAK,MAAM;AACX,OAAK,YAAYA;AACjB,OAAK,OAAO1B;AACZ,OAAK,OAAO,MAAM,GAAG;AACtB;AAEAwB,OAAK,UAAU,MAAM,SAAU,MAAM,MAAM;AAC1C,OAAK,KAAK,MAAM,KAAK,SAAS;AAC9B,MAAI,IAAI,KAAK,KAAK,IAAI;AACtB,IAAE,KAAK,KAAK,MAAM,KAAK,SAAS;AAChC,SAAO,KAAK,KAAK,KAAK,IAAI;AAC3B;AAEA,SAAS,OAAO,UAAU,MAAM,YAAY,QAAQrH,SAAQ;AAC3DyH,oBAAgB,YAAY,MAAM;AAClC,aAAWrP,WAAS,UAAUoP,mBAAiB,UAAU;AACzD,SAAOpP,WAAS,MAAMoP,mBAAiB,MAAM;AAE7C,MAAI,eAAexH,WAAU,QAAQ,YAAW;AAChD,MAAI,eAAe,QAAQ,WAAW,KAAK;AAC3C,MAAI,OAAO,MAAM,YAAY;AAC7B,MAAI,OAAO,SAAS,YAAY,CAAC,MAAM;AACtC,UAAM,IAAI,UAAU,qCAAqCA,OAAM;EACjE;AAEC,MAAI2H,QAAO,IAAIN,OAAK,cAAc,UAAU,KAAK,MAAM;AAEvD,MAAI,KAAKvR,SAAO,YAAY,MAAM;AAClC,MAAI,SAASA,SAAO,YAAY,KAAK,SAAS,CAAC;AAC/C,OAAK,KAAK,QAAQ,GAAG,GAAG,KAAK,MAAM;AAEnC,MAAI,UAAU;AACd,MAAI,OAAO;AACX,MAAI,IAAI,KAAK,KAAK,SAAS,IAAI;AAE/B,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC5B,WAAO,cAAc,GAAG,KAAK,MAAM;AAEnC,QAAI,IAAI6R,MAAK,IAAI,QAAQA,MAAK,KAAK;AACnC,QAAI,IAAI;AAER,aAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACpC,UAAIA,MAAK,IAAI,GAAGA,MAAK,KAAK;AAC1B,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC9B,UAAE,CAAC,KAAK,EAAE,CAAC;MACf;IACA;AAEE,MAAE,KAAK,IAAI,OAAO;AAClB,eAAW;EACb;AAEC,SAAO;AACR;AAEA,IAAA,cAAiB;AChIjB,IAAI7R,WAASH,oBAAuB;AAEpC,IAAI,kBAAkBE;AACtB,IAAI,kBAAkB2D;AACtB,IAAI,OAAOU;AACX,IAAI9B,aAAWiC;AAEf,IAAI;AACJ,IAAI,SAAS2B,eAAO,UAAUA,eAAO,OAAO;AAC5C,IAAI,YAAY;EACf,KAAK;EACL,SAAS;EACT,MAAM;EACN,QAAQ;EACR,WAAW;EACX,QAAQ;EACR,WAAW;EACX,WAAW;EACX,QAAQ;AACT;AACA,IAAI,SAAS,CAAA;AACb,IAAI;AACJ,SAAS,cAAc;AACtB,MAAI,UAAU;AACb,WAAO;EACT;AACC,MAAIA,eAAO,WAAWA,eAAO,QAAQ,UAAU;AAC9C,eAAWA,eAAO,QAAQ;EAC5B,WAAYA,eAAO,gBAAgB;AACjC,eAAWA,eAAO;EACpB,WAAYA,eAAO,cAAc;AAC/B,eAAWA,eAAO;EACpB,OAAQ;AACN,eAAWA,eAAO;EACpB;AACC,SAAO;AACR;AACA,SAAS,cAAc,UAAU,MAAM,YAAY,QAAQ,MAAM;AAChE,SAAO,OAAO,UAAU,OAAO,UAAU,EAAE,MAAM,SAAQ,GAAI,OAAO,CAAC,YAAY,CAAC,EAAE,KAAK,SAAUxE,MAAK;AACvG,WAAO,OAAO,WAAW;MACxB,MAAM;MACN;MACA;MACA,MAAM;QACL,MAAM;MACV;IACA,GAAKA,MAAK,UAAU,CAAC;EACrB,CAAE,EAAE,KAAK,SAAU,KAAK;AACtB,WAAO1B,SAAO,KAAK,GAAG;EACxB,CAAE;AACF;AACA,SAAS,YAAY,MAAM;AAC1B,MAAIkG,eAAO,WAAW,CAACA,eAAO,QAAQ,SAAS;AAC9C,WAAO,QAAQ,QAAQ,KAAK;EAC9B;AACC,MAAI,CAAC,UAAU,CAAC,OAAO,aAAa,CAAC,OAAO,YAAY;AACvD,WAAO,QAAQ,QAAQ,KAAK;EAC9B;AACC,MAAI,OAAO,IAAI,MAAM,QAAW;AAC/B,WAAO,OAAO,IAAI;EACpB;AACC,aAAW,YAAYlG,SAAO,MAAM,CAAC;AACrC,MAAI,OAAO,cAAc,UAAU,UAAU,IAAI,KAAK,IAAI,EACxD;IACA,WAAY;AAAE,aAAO;IAAK;IAC1B,WAAY;AAAE,aAAO;IAAM;EAC9B;AACC,SAAO,IAAI,IAAI;AACf,SAAO;AACR;AAEA,SAAS,eAAe,SAAS,UAAU;AAC1C,UAAQ,KAAK,SAAU,KAAK;AAC3B,gBAAW,EAAG,WAAY;AACzB,eAAS,MAAM,GAAG;IACrB,CAAG;EACH,GAAI,SAAU,GAAG;AACf,gBAAW,EAAG,WAAY;AACzB,eAAS,CAAC;IACb,CAAG;EACH,CAAE;AACF;AACA,IAAA,QAAiB,SAAU,UAAU,MAAM,YAAY,QAAQkK,SAAQ,UAAU;AAChF,MAAI,OAAOA,YAAW,YAAY;AACjC,eAAWA;AACX,IAAAA,UAAS;EACX;AAEC,kBAAgB,YAAY,MAAM;AAClC,aAAW5H,WAAS,UAAU,iBAAiB,UAAU;AACzD,SAAOA,WAAS,MAAM,iBAAiB,MAAM;AAC7C,MAAI,OAAO,aAAa,YAAY;AACnC,UAAM,IAAI,MAAM,gCAAgC;EAClD;AAEC,EAAA4H,UAASA,WAAU;AACnB,MAAI,OAAO,UAAUA,QAAO,YAAW,CAAE;AAEzC,MAAI,CAAC,QAAQ,OAAOhE,eAAO,YAAY,YAAY;AAClD,gBAAW,EAAG,WAAY;AACzB,UAAI;AACJ,UAAI;AACH,cAAM,KAAK,UAAU,MAAM,YAAY,QAAQgE,OAAM;MACzD,SAAY,GAAG;AACX,iBAAS,CAAC;AACV;MACJ;AACG,eAAS,MAAM,GAAG;IACrB,CAAG;AACD;EACF;AAEC,iBAAe,YAAY,IAAI,EAAE,KAAK,SAAU,MAAM;AACrD,QAAI,MAAM;AACT,aAAO,cAAc,UAAU,MAAM,YAAY,QAAQ,IAAI;IAChE;AAEE,WAAO,KAAK,UAAU,MAAM,YAAY,QAAQA,OAAM;EACxD,CAAE,GAAG,QAAQ;AACb;ACvHcxC,UAAA,SAAG7H;AACjB6H,UAAA,aAAqB3H;;;;ACDrB2F,QAAA,eAAuB,SAAS,aAAa,OAAO,KAAK;AACvD,MAAI,MAAQ,MAAM,IAAI,GAAG,KAAK,KAClB,MAAM,IAAI,GAAG,KAAK,KAClB,MAAM,IAAI,GAAG,KAAK,IACnB,MAAM,IAAI,GAAG;AACxB,SAAO,QAAQ;AACjB;AAEqBA,QAAA,gBAAG,SAAS,cAAc,OAAO,OAAO,KAAK;AAChE,QAAM,IAAI,GAAG,IAAI,UAAU;AAC3B,QAAM,IAAI,GAAG,IAAK,UAAU,KAAM;AAClC,QAAM,IAAI,GAAG,IAAK,UAAU,IAAK;AACjC,QAAM,IAAI,GAAG,IAAI,QAAQ;AAC3B;AAEUA,QAAA,KAAG,SAAS,GAAG,KAAK,KAAK,KAAK,KAAK;AAC3C,MAAI,OAAO;AACX,MAAI,OAAO;AAEX,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG;AAC9B,aAAS,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG;AAC/B,eAAS;AACT,cAAS,QAAS,IAAI,IAAM;IAClC;AACI,aAAS,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG;AAC/B,eAAS;AACT,cAAS,QAAS,IAAI,IAAM;IAClC;EACA;AAEE,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG;AAC9B,aAAS,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG;AAC/B,eAAS;AACT,cAAS,QAAS,IAAI,IAAM;IAClC;AACI,aAAS,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG;AAC/B,eAAS;AACT,cAAS,QAAS,IAAI,IAAM;IAClC;EACA;AAEE,MAAI,MAAM,CAAC,IAAI,SAAS;AACxB,MAAI,MAAM,CAAC,IAAI,SAAS;AAC1B;AAEWA,QAAA,MAAG,SAAS,IAAI,KAAK,KAAK,KAAK,KAAK;AAC7C,MAAI,OAAO;AACX,MAAI,OAAO;AAEX,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,IAAI,IAAI,KAAK,GAAG,KAAK,GAAG;AAC/B,eAAS;AACT,cAAS,QAAS,IAAI,IAAM;AAC5B,eAAS;AACT,cAAS,QAAS,IAAI,IAAM;IAClC;EACA;AACE,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,IAAI,IAAI,KAAK,GAAG,KAAK,GAAG;AAC/B,eAAS;AACT,cAAS,QAAS,IAAI,IAAM;AAC5B,eAAS;AACT,cAAS,QAAS,IAAI,IAAM;IAClC;EACA;AAEE,MAAI,MAAM,CAAC,IAAI,SAAS;AACxB,MAAI,MAAM,CAAC,IAAI,SAAS;AAC1B;AAEWA,QAAA,MAAG,SAAS,IAAI,KAAK,KAAK,KAAK,KAAK;AAC7C,MAAI,OAAO;AACX,MAAI,OAAO;AAMX,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,aAAS,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG;AAC/B,eAAS;AACT,cAAS,OAAQ,IAAI,IAAM;IACjC;AACI,aAAS,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG;AAC/B,eAAS;AACT,cAAS,OAAQ,IAAI,IAAM;IACjC;EACA;AACE,WAAS,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG;AAC/B,aAAS;AACT,YAAS,OAAQ,IAAI,IAAM;EAC/B;AAME,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,aAAS,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG;AAC/B,eAAS;AACT,cAAS,OAAQ,IAAI,IAAM;IACjC;AACI,aAAS,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG;AAC/B,eAAS;AACT,cAAS,OAAQ,IAAI,IAAM;IACjC;EACA;AACE,WAAS,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG;AAC/B,aAAS;AACT,YAAS,OAAQ,IAAI,IAAM;EAC/B;AAEE,MAAI,MAAM,CAAC,IAAI,SAAS;AACxB,MAAI,MAAM,CAAC,IAAI,SAAS;AAC1B;AAEAA,QAAA,SAAiB,SAAS,OAAO,KAAK,OAAO;AAC3C,SAAS,OAAO,QAAS,YAAc,QAAS,KAAK;AACvD;AAEA,IAAI,WAAW;;EAEb;EAAI;EAAI;EAAI;EAAG;EAAI;EAAI;EAAI;EAC3B;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EACzB;EAAG;EAAI;EAAI;EAAI;EAAG;EAAG;EAAI;;EAGzB;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EACzB;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAI;EACzB;EAAI;EAAG;EAAI;EAAI;EAAG;EAAI;EAAI;AAC5B;AAEWA,QAAA,MAAG,SAAS,IAAI,KAAK,KAAK,KAAK,KAAK;AAC7C,MAAI,OAAO;AACX,MAAI,OAAO;AAEX,MAAI,MAAM,SAAS,WAAW;AAC9B,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,aAAS;AACT,YAAS,QAAQ,SAAS,CAAC,IAAK;EACpC;AACE,WAAS,IAAI,KAAK,IAAI,SAAS,QAAQ,KAAK;AAC1C,aAAS;AACT,YAAS,QAAQ,SAAS,CAAC,IAAK;EACpC;AAEE,MAAI,MAAM,CAAC,IAAI,SAAS;AACxB,MAAI,MAAM,CAAC,IAAI,SAAS;AAC1B;AAEcA,QAAA,SAAG,SAAS,OAAOxD,IAAG,KAAK,KAAK;AAC5C,MAAI,OAAO;AACX,MAAI,OAAO;AAEX,UAASA,KAAI,MAAM,IAAMA,OAAM;AAC/B,WAAS,IAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AAChC,aAAS;AACT,YAASA,OAAM,IAAK;EACxB;AACE,WAAS,IAAI,IAAI,KAAK,GAAG,KAAK,GAAG;AAC/B,YAASA,OAAM,IAAK;AACpB,aAAS;EACb;AACE,WAAUA,KAAI,OAAS,IAAMA,OAAM;AAEnC,MAAI,MAAM,CAAC,IAAI,SAAS;AACxB,MAAI,MAAM,CAAC,IAAI,SAAS;AAC1B;AAEA,IAAI,SAAS;EACX;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAI;EAAI;EAAG;EACpD;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAClD;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAClD;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAEnD;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAClD;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EACnD;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EACpD;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAElD;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EACjD;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EACpD;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EACjD;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAEpD;EAAG;EAAI;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EACnD;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAI;EAAI;EAAG;EAAI;EAAI;EACnD;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAG;EAAG;EAAI;EAAI;EACpD;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAEjD;EAAG;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EACpD;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAClD;EAAG;EAAI;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EACnD;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAElD;EAAI;EAAI;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EACnD;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EACnD;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAClD;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAElD;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EACnD;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAClD;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EACpD;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAEjD;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EACnD;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EACnD;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAG;EAAG;EAClD;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;AACpD;AAEAwD,QAAA,aAAqB,SAAS,WAAW,KAAK,KAAK;AACjD,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,IAAK,QAAS,KAAK,IAAI,IAAM;AACjC,QAAI,KAAK,OAAO,IAAI,KAAO,CAAC;AAE5B,YAAQ;AACR,WAAO;EACX;AACE,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,IAAK,QAAS,KAAK,IAAI,IAAM;AACjC,QAAI,KAAK,OAAO,IAAI,KAAO,IAAI,KAAO,CAAC;AAEvC,YAAQ;AACR,WAAO;EACX;AACE,SAAO,QAAQ;AACjB;AAEA,IAAI,eAAe;EACjB;EAAI;EAAI;EAAI;EAAI;EAAG;EAAI;EAAG;EAAI;EAAI;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EACvD;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAG;EAAI;EAAI;EAAI;EAAI;AAC1D;AAEAA,QAAA,UAAkB,SAAS,QAAQ,KAAK;AACtC,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC5C,YAAQ;AACR,WAAQ,QAAQ,aAAa,CAAC,IAAK;EACvC;AACE,SAAO,QAAQ;AACjB;AAEgBA,QAAA,WAAG,SAAS,SAAS,KAAK,MAAM,OAAO;AACrD,MAAI,MAAM,IAAI,SAAS,CAAC;AACxB,SAAO,IAAI,SAAS;AAClB,UAAM,MAAM;AAEd,MAAI,MAAM,CAAA;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,QAAI,KAAK,IAAI,MAAM,GAAG,IAAI,KAAK,CAAC;AAClC,SAAO,IAAI,KAAK,GAAG;AACrB;AC7PA,IAAI9D,WAAS/B;AAEb,SAASiS,SAAO,SAAS;AACvB,OAAK,UAAU;AAEf,OAAK,OAAO,KAAK,QAAQ;AACzB,OAAK,YAAY;AACjB,OAAK,MAAK;AAEV,OAAK,SAAS,IAAI,MAAM,KAAK,SAAS;AACtC,OAAK,YAAY;AACjB,OAAK,UAAU,QAAQ,YAAY;AACrC;IACA,SAAiBA;AAEjBA,SAAO,UAAU,QAAQ,SAAS,QAAQ;AAE1C;AAEAA,SAAO,UAAU,SAAS,SAAS,OAAO,MAAM;AAC9C,MAAI,KAAK,WAAW;AAClB,WAAO,CAAA;AAET,MAAI,KAAK,SAAS;AAChB,WAAO,KAAK,eAAe,IAAI;;AAE/B,WAAO,KAAK,eAAe,IAAI;AACnC;AAEAA,SAAO,UAAU,UAAU,SAAS,QAAQ,MAAM,KAAK;AAErD,MAAI9Q,OAAM,KAAK,IAAI,KAAK,OAAO,SAAS,KAAK,WAAW,KAAK,SAAS,GAAG;AACzE,WAAS,IAAI,GAAG,IAAIA,MAAK;AACvB,SAAK,OAAO,KAAK,YAAY,CAAC,IAAI,KAAK,MAAM,CAAC;AAChD,OAAK,aAAaA;AAGlB,SAAOA;AACT;AAEA8Q,SAAO,UAAU,eAAe,SAAS,aAAa,KAAK,KAAK;AAC9D,OAAK,QAAQ,KAAK,QAAQ,GAAG,KAAK,GAAG;AACrC,OAAK,YAAY;AACjB,SAAO,KAAK;AACd;AAEAA,SAAO,UAAU,iBAAiB,SAAS,eAAe,MAAM;AAC9D,MAAI,WAAW;AACf,MAAI,YAAY;AAEhB,MAAI,SAAU,KAAK,YAAY,KAAK,UAAU,KAAK,YAAa;AAChE,MAAI,MAAM,IAAI,MAAM,QAAQ,KAAK,SAAS;AAE1C,MAAI,KAAK,cAAc,GAAG;AACxB,gBAAY,KAAK,QAAQ,MAAM,QAAQ;AAEvC,QAAI,KAAK,cAAc,KAAK,OAAO;AACjC,mBAAa,KAAK,aAAa,KAAK,SAAS;EACnD;AAGE,MAAIpR,OAAM,KAAK,UAAW,KAAK,SAAS,YAAY,KAAK;AACzD,SAAO,WAAWA,MAAK,YAAY,KAAK,WAAW;AACjD,SAAK,QAAQ,MAAM,UAAU,KAAK,SAAS;AAC3C,iBAAa,KAAK;EACtB;AAGE,SAAO,WAAW,KAAK,QAAQ,YAAY,KAAK;AAC9C,SAAK,OAAO,KAAK,SAAS,IAAI,KAAK,QAAQ;AAE7C,SAAO;AACT;AAEAoR,SAAO,UAAU,iBAAiB,SAAS,eAAe,MAAM;AAC9D,MAAI,WAAW;AACf,MAAI,YAAY;AAEhB,MAAI,QAAQ,KAAK,MAAM,KAAK,YAAY,KAAK,UAAU,KAAK,SAAS,IAAI;AACzE,MAAI,MAAM,IAAI,MAAM,QAAQ,KAAK,SAAS;AAG1C,SAAO,QAAQ,GAAG,SAAS;AACzB,gBAAY,KAAK,QAAQ,MAAM,QAAQ;AACvC,iBAAa,KAAK,aAAa,KAAK,SAAS;EACjD;AAGE,cAAY,KAAK,QAAQ,MAAM,QAAQ;AAEvC,SAAO;AACT;AAEAA,SAAO,UAAU,QAAQ,SAAS,MAAMpS,SAAQ;AAC9C,MAAI;AACJ,MAAIA;AACF,YAAQ,KAAK,OAAOA,OAAM;AAE5B,MAAI;AACJ,MAAI,KAAK,SAAS;AAChB,WAAO,KAAK,cAAa;;AAEzB,WAAO,KAAK,cAAa;AAE3B,MAAI;AACF,WAAO,MAAM,OAAO,IAAI;;AAExB,WAAO;AACX;AAEAoS,SAAO,UAAU,OAAO,SAAS,KAAKpS,SAAQ,KAAK;AACjD,MAAI,QAAQ;AACV,WAAO;AAET,SAAO,MAAMA,QAAO;AAClB,IAAAA,QAAO,KAAK,IAAI;AAElB,SAAO;AACT;AAEAoS,SAAO,UAAU,gBAAgB,SAAS,gBAAgB;AACxD,MAAI,CAAC,KAAK,KAAK,KAAK,QAAQ,KAAK,SAAS;AACxC,WAAO,CAAA;AAET,MAAI,MAAM,IAAI,MAAM,KAAK,SAAS;AAClC,OAAK,QAAQ,KAAK,QAAQ,GAAG,KAAK,CAAC;AACnC,SAAO;AACT;AAEAA,SAAO,UAAU,SAAS,SAAS,OAAOpS,SAAQ;AAChD,SAAOA;AACT;AAEAoS,SAAO,UAAU,gBAAgB,SAAS,gBAAgB;AACxDlQ,WAAO,MAAM,KAAK,WAAW,KAAK,WAAW,4BAA4B;AACzE,MAAI,MAAM,IAAI,MAAM,KAAK,SAAS;AAClC,OAAK,aAAa,KAAK,CAAC;AAExB,SAAO,KAAK,OAAO,GAAG;AACxB;AC3IA,IAAIA,WAAS/B;AACb,IAAIgC,aAAW9B;AAEf,IAAI2F,UAAQhC;AACZ,IAAIoO,WAAS1N;AAEb,SAAS,WAAW;AAClB,OAAK,MAAM,IAAI,MAAM,CAAC;AACtB,OAAK,OAAO;AACd;AAEA,SAAS2N,MAAI,SAAS;AACpBD,WAAO,KAAK,MAAM,OAAO;AAEzB,MAAItO,SAAQ,IAAI,SAAQ;AACxB,OAAK,YAAYA;AAEjB,OAAK,WAAWA,QAAO,QAAQ,GAAG;AACpC;AACA3B,WAASkQ,OAAKD,QAAM;IACpBE,QAAiBD;AAEjBA,MAAI,SAAS,SAAS,OAAO,SAAS;AACpC,SAAO,IAAIA,MAAI,OAAO;AACxB;AAEA,IAAI,aAAa;EACf;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EACrB;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;AACvB;AAEAA,MAAI,UAAU,aAAa,SAAS,WAAWvO,QAAO9B,MAAK;AACzD,EAAA8B,OAAM,OAAO,IAAI,MAAM,KAAK,CAAC;AAE7B5B,WAAO,MAAMF,KAAI,QAAQ,KAAK,WAAW,oBAAoB;AAE7D,MAAI,KAAKgE,QAAM,aAAahE,MAAK,CAAC;AAClC,MAAI,KAAKgE,QAAM,aAAahE,MAAK,CAAC;AAElCgE,UAAM,IAAI,IAAI,IAAIlC,OAAM,KAAK,CAAC;AAC9B,OAAKA,OAAM,IAAI,CAAC;AAChB,OAAKA,OAAM,IAAI,CAAC;AAChB,WAAS,IAAI,GAAG,IAAIA,OAAM,KAAK,QAAQ,KAAK,GAAG;AAC7C,QAAI,QAAQ,WAAW,MAAM,CAAC;AAC9B,SAAKkC,QAAM,OAAO,IAAI,KAAK;AAC3B,SAAKA,QAAM,OAAO,IAAI,KAAK;AAC3BA,YAAM,IAAI,IAAI,IAAIlC,OAAM,MAAM,CAAC;EACnC;AACA;AAEAuO,MAAI,UAAU,UAAU,SAAS,QAAQ,KAAK,OAAO,KAAK,QAAQ;AAChE,MAAIvO,SAAQ,KAAK;AAEjB,MAAI,IAAIkC,QAAM,aAAa,KAAK,KAAK;AACrC,MAAIxD,KAAIwD,QAAM,aAAa,KAAK,QAAQ,CAAC;AAGzCA,UAAM,GAAG,GAAGxD,IAAGsB,OAAM,KAAK,CAAC;AAC3B,MAAIA,OAAM,IAAI,CAAC;AACf,EAAAtB,KAAIsB,OAAM,IAAI,CAAC;AAEf,MAAI,KAAK,SAAS;AAChB,SAAK,SAASA,QAAO,GAAGtB,IAAGsB,OAAM,KAAK,CAAC;;AAEvC,SAAK,SAASA,QAAO,GAAGtB,IAAGsB,OAAM,KAAK,CAAC;AAEzC,MAAIA,OAAM,IAAI,CAAC;AACf,EAAAtB,KAAIsB,OAAM,IAAI,CAAC;AAEfkC,UAAM,cAAc,KAAK,GAAG,MAAM;AAClCA,UAAM,cAAc,KAAKxD,IAAG,SAAS,CAAC;AACxC;AAEA6P,MAAI,UAAU,OAAO,SAASE,MAAKvS,SAAQ,KAAK;AAC9C,MAAI,KAAK,YAAY,OAAO;AAC1B,WAAO;EACX;AAEE,MAAI,QAAQA,QAAO,SAAS;AAC5B,WAAS,IAAI,KAAK,IAAIA,QAAO,QAAQ;AACnC,IAAAA,QAAO,CAAC,IAAI;AAEd,SAAO;AACT;AAEAqS,MAAI,UAAU,SAAS,SAASG,QAAOxS,SAAQ;AAC7C,MAAI,KAAK,YAAY,OAAO;AAC1B,WAAOA;EACX;AAEE,MAAIyS,OAAMzS,QAAOA,QAAO,SAAS,CAAC;AAClC,WAAS,IAAIA,QAAO,SAASyS,MAAK,IAAIzS,QAAO,QAAQ;AACnDkC,aAAO,MAAMlC,QAAO,CAAC,GAAGyS,IAAG;AAE7B,SAAOzS,QAAO,MAAM,GAAGA,QAAO,SAASyS,IAAG;AAC5C;AAEAJ,MAAI,UAAU,WAAW,SAAS,SAASvO,QAAO,QAAQ,QAAQ,KAAK,KAAK;AAC1E,MAAI,IAAI;AACR,MAAItB,KAAI;AAGR,WAAS,IAAI,GAAG,IAAIsB,OAAM,KAAK,QAAQ,KAAK,GAAG;AAC7C,QAAI,OAAOA,OAAM,KAAK,CAAC;AACvB,QAAI,OAAOA,OAAM,KAAK,IAAI,CAAC;AAG3BkC,YAAM,OAAOxD,IAAGsB,OAAM,KAAK,CAAC;AAE5B,YAAQA,OAAM,IAAI,CAAC;AACnB,YAAQA,OAAM,IAAI,CAAC;AACnB,QAAI5D,KAAI8F,QAAM,WAAW,MAAM,IAAI;AACnC,QAAIgL,KAAIhL,QAAM,QAAQ9F,EAAC;AAEvB,QAAI,IAAIsC;AACR,IAAAA,MAAK,IAAIwO,QAAO;AAChB,QAAI;EACR;AAGEhL,UAAM,IAAIxD,IAAG,GAAG,KAAK,GAAG;AAC1B;AAEA6P,MAAI,UAAU,WAAW,SAAS,SAASvO,QAAO,QAAQ,QAAQ,KAAK,KAAK;AAC1E,MAAI,IAAI;AACR,MAAItB,KAAI;AAGR,WAAS,IAAIsB,OAAM,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;AAClD,QAAI,OAAOA,OAAM,KAAK,CAAC;AACvB,QAAI,OAAOA,OAAM,KAAK,IAAI,CAAC;AAG3BkC,YAAM,OAAO,GAAGlC,OAAM,KAAK,CAAC;AAE5B,YAAQA,OAAM,IAAI,CAAC;AACnB,YAAQA,OAAM,IAAI,CAAC;AACnB,QAAI5D,KAAI8F,QAAM,WAAW,MAAM,IAAI;AACnC,QAAIgL,KAAIhL,QAAM,QAAQ9F,EAAC;AAEvB,QAAI,IAAI;AACR,SAAKsC,KAAIwO,QAAO;AAChB,IAAAxO,KAAI;EACR;AAGEwD,UAAM,IAAI,GAAGxD,IAAG,KAAK,GAAG;AAC1B;;ACnJA,IAAIN,WAAS/B;AACb,IAAIgC,aAAW9B;AAEf,IAAI,QAAQ,CAAA;AAEZ,SAAS,SAAS,IAAI;AACpB6B,WAAO,MAAM,GAAG,QAAQ,GAAG,mBAAmB;AAE9C,OAAK,KAAK,IAAI,MAAM,CAAC;AACrB,WAAS,IAAI,GAAG,IAAI,KAAK,GAAG,QAAQ;AAClC,SAAK,GAAG,CAAC,IAAI,GAAG,CAAC;AACrB;AAEA,SAAS,YAAYR,OAAM;AACzB,WAAS,IAAI,SAAS;AACpB,IAAAA,MAAK,KAAK,MAAM,OAAO;AACvB,SAAK,SAAQ;EACjB;AACES,aAAS,KAAKT,KAAI;AAElB,MAAIyF,QAAO,OAAO,KAAK,KAAK;AAC5B,WAAS,IAAI,GAAG,IAAIA,MAAK,QAAQ,KAAK;AACpC,QAAInF,OAAMmF,MAAK,CAAC;AAChB,QAAI,UAAUnF,IAAG,IAAI,MAAMA,IAAG;EAClC;AAEE,MAAI,SAAS,SAAS0Q,QAAO,SAAS;AACpC,WAAO,IAAI,IAAI,OAAO;EAC1B;AAEE,SAAO;AACT;AAEmBC,MAAA,cAAG;AAEtB,MAAM,WAAW,SAAS,WAAW;AACnC,MAAI7O,SAAQ,IAAI,SAAS,KAAK,QAAQ,EAAE;AACxC,OAAK,YAAYA;AACnB;AAEA,MAAM,UAAU,SAAS8O,SAAQ,KAAK,OAAO,KAAK,QAAQ;AACxD,MAAI9O,SAAQ,KAAK;AACjB,MAAI,aAAa,KAAK,YAAY,OAAO;AAEzC,MAAI,KAAKA,OAAM;AACf,MAAI,KAAK,SAAS,WAAW;AAC3B,aAAS,IAAI,GAAG,IAAI,KAAK,WAAW;AAClC,SAAG,CAAC,KAAK,IAAI,QAAQ,CAAC;AAExB,eAAW,QAAQ,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM;AAEhD,aAAS,IAAI,GAAG,IAAI,KAAK,WAAW;AAClC,SAAG,CAAC,IAAI,IAAI,SAAS,CAAC;EAC5B,OAAS;AACL,eAAW,QAAQ,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM;AAErD,aAAS,IAAI,GAAG,IAAI,KAAK,WAAW;AAClC,UAAI,SAAS,CAAC,KAAK,GAAG,CAAC;AAEzB,aAAS,IAAI,GAAG,IAAI,KAAK,WAAW;AAClC,SAAG,CAAC,IAAI,IAAI,QAAQ,CAAC;EAC3B;AACA;AC9DA,IAAI5B,WAAS/B;AACb,IAAIgC,aAAW9B;AAEf,IAAI+R,WAASpO;AACb,IAAIqO,QAAM3N;AAEV,SAAS,SAAS7C,OAAMG,MAAK;AAC3BE,WAAO,MAAMF,KAAI,QAAQ,IAAI,oBAAoB;AAEjD,MAAI,KAAKA,KAAI,MAAM,GAAG,CAAC;AACvB,MAAI,KAAKA,KAAI,MAAM,GAAG,EAAE;AACxB,MAAI,KAAKA,KAAI,MAAM,IAAI,EAAE;AAEzB,MAAIH,UAAS,WAAW;AACtB,SAAK,UAAU;MACbwQ,MAAI,OAAO,EAAE,MAAM,WAAW,KAAK,GAAE,CAAE;MACvCA,MAAI,OAAO,EAAE,MAAM,WAAW,KAAK,GAAE,CAAE;MACvCA,MAAI,OAAO,EAAE,MAAM,WAAW,KAAK,GAAE,CAAE;IAC7C;EACA,OAAS;AACL,SAAK,UAAU;MACbA,MAAI,OAAO,EAAE,MAAM,WAAW,KAAK,GAAE,CAAE;MACvCA,MAAI,OAAO,EAAE,MAAM,WAAW,KAAK,GAAE,CAAE;MACvCA,MAAI,OAAO,EAAE,MAAM,WAAW,KAAK,GAAE,CAAE;IAC7C;EACA;AACA;AAEA,SAAS,IAAI,SAAS;AACpBD,WAAO,KAAK,MAAM,OAAO;AAEzB,MAAItO,SAAQ,IAAI,SAAS,KAAK,MAAM,KAAK,QAAQ,GAAG;AACpD,OAAK,YAAYA;AACnB;AACA3B,WAAS,KAAKiQ,QAAM;IAEpB,MAAiB;AAEjB,IAAI,SAAS,SAASM,QAAO,SAAS;AACpC,SAAO,IAAI,IAAI,OAAO;AACxB;AAEA,IAAI,UAAU,UAAU,SAASE,SAAQ,KAAK,OAAO,KAAK,QAAQ;AAChE,MAAI9O,SAAQ,KAAK;AAEjB,EAAAA,OAAM,QAAQ,CAAC,EAAE,QAAQ,KAAK,OAAO,KAAK,MAAM;AAChD,EAAAA,OAAM,QAAQ,CAAC,EAAE,QAAQ,KAAK,QAAQ,KAAK,MAAM;AACjD,EAAAA,OAAM,QAAQ,CAAC,EAAE,QAAQ,KAAK,QAAQ,KAAK,MAAM;AACnD;AAEA,IAAI,UAAU,OAAOuO,MAAI,UAAU;AACnC,IAAI,UAAU,SAASA,MAAI,UAAU;ACnDxBC,MAAA,QAAGnS;AACFmS,MAAA,SAAGjS;AACNiS,MAAA,MAAGtO;AACHsO,MAAA,MAAG5N;AACd4N,MAAA,MAAczN;ACNd,IAAI,aAAa1E;AACjB,IAAI,MAAME;AACV,IAAI8B,aAAW6B;AACf,IAAI1D,WAASoE,oBAAuB;AAEpC,IAAImO,UAAQ;EACV,gBAAgB,IAAI,IAAI,YAAY,IAAI,GAAG;EAC3C,YAAY,IAAI;EAChB,eAAe,IAAI,IAAI,YAAY,IAAI,GAAG;EAC1C,WAAW,IAAI;EACf,WAAW,IAAI,IAAI,YAAY,IAAI,GAAG;EACtC,WAAW,IAAI;AACjB;AACAA,QAAM,MAAMA,QAAM,SAAS;AAC3BA,QAAM,OAAOA,QAAM,cAAc;AACjC,IAAA,gBAAiBR;AACjBlQ,WAASkQ,OAAK,UAAU;AACxB,SAASA,MAAK,MAAM;AAClB,aAAW,KAAK,IAAI;AACpB,MAAI,WAAW,KAAK,KAAK,YAAW;AACpC,MAAI,OAAOQ,QAAM,QAAQ;AACzB,MAAIhR;AACJ,MAAI,KAAK,SAAS;AAChB,IAAAA,QAAO;EACX,OAAS;AACL,IAAAA,QAAO;EACX;AACE,MAAIG,OAAM,KAAK;AACf,MAAI,CAAC1B,SAAO,SAAS0B,IAAG,GAAG;AACzB,IAAAA,OAAM1B,SAAO,KAAK0B,IAAG;EACzB;AACE,MAAI,aAAa,aAAa,aAAa,eAAe;AACxD,IAAAA,OAAM1B,SAAO,OAAO,CAAC0B,MAAKA,KAAI,MAAM,GAAG,CAAC,CAAC,CAAC;EAC9C;AACE,MAAI,KAAK,KAAK;AACd,MAAI,CAAC1B,SAAO,SAAS,EAAE,GAAG;AACxB,SAAKA,SAAO,KAAK,EAAE;EACvB;AACE,OAAK,OAAO,KAAK,OAAO;IACtB,KAAK0B;IACL;IACA,MAAMH;EACV,CAAG;AACH;AACAwQ,MAAI,UAAU,UAAU,SAAU,MAAM;AACtC,SAAO/R,SAAO,KAAK,KAAK,KAAK,OAAO,IAAI,CAAC;AAC3C;AACA+R,MAAI,UAAU,SAAS,WAAY;AACjC,SAAO/R,SAAO,KAAK,KAAK,KAAK,MAAK,CAAE;AACtC;;;;ACjDA,IAAA,UAAkB,SAAU2C,OAAM,OAAO;AACvC,SAAOA,MAAK,QAAQ,aAAa,KAAK;AACxC;AAEA,IAAA,UAAkB,SAAUA,OAAM,OAAO;AACvC,SAAOA,MAAK,QAAQ,aAAa,KAAK;AACxC;;ACNA,IAAA,YAAiB,SAAS,IAAK,GAAG,GAAG;AACnC,MAAI,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AACxC,MAAIjD,UAAS,IAAIM,SAAAA,OAAO,MAAM;AAE9B,WAAS,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC/B,IAAAN,QAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;EAC1B;AAEE,SAAOA;AACT;ACTA,IAAI+C,QAAM5C;AAEV,IAAA,UAAkB,SAAU8C,OAAM,OAAO;AACvC,MAAI,OAAOF,MAAI,OAAOE,MAAK,KAAK;AAEhC,EAAAA,MAAK,QAAQA,MAAK,QAAQ,aAAa,IAAI;AAC3C,SAAOA,MAAK;AACd;AAEA,IAAA,UAAkB,SAAUA,OAAM,OAAO;AACvC,MAAIwP,OAAMxP,MAAK;AAEf,EAAAA,MAAK,QAAQ;AACb,MAAI,MAAMA,MAAK,QAAQ,aAAa,KAAK;AAEzC,SAAOF,MAAI,KAAK0P,IAAG;AACrB;;AChBA,IAAInS,WAASH,oBAAuB;AACpC,IAAI4C,QAAM1C;AAEV,SAAS,aAAc4C,OAAM,MAAM6P,UAAS;AAC1C,MAAI,MAAM,KAAK;AACf,MAAI,MAAM/P,MAAI,MAAME,MAAK,MAAM;AAC/B,EAAAA,MAAK,SAASA,MAAK,OAAO,MAAM,GAAG;AACnC,EAAAA,MAAK,QAAQ3C,SAAO,OAAO,CAAC2C,MAAK,OAAO6P,WAAU,OAAO,GAAG,CAAC;AAC7D,SAAO;AACT;AAEA,IAAA,UAAkB,SAAU7P,OAAM,MAAM6P,UAAS;AAC/C,MAAI,MAAMxS,SAAO,YAAY,CAAC;AAC9B,MAAI;AAEJ,SAAO,KAAK,QAAQ;AAClB,QAAI2C,MAAK,OAAO,WAAW,GAAG;AAC5B,MAAAA,MAAK,SAASA,MAAK,QAAQ,aAAaA,MAAK,KAAK;AAClD,MAAAA,MAAK,QAAQ3C,SAAO,YAAY,CAAC;IACvC;AAEI,QAAI2C,MAAK,OAAO,UAAU,KAAK,QAAQ;AACrC,YAAMA,MAAK,OAAO;AAClB,YAAM3C,SAAO,OAAO,CAAC,KAAK,aAAa2C,OAAM,KAAK,MAAM,GAAG,GAAG,GAAG6P,QAAO,CAAC,CAAC;AAC1E,aAAO,KAAK,MAAM,GAAG;IAC3B,OAAW;AACL,YAAMxS,SAAO,OAAO,CAAC,KAAK,aAAa2C,OAAM,MAAM6P,QAAO,CAAC,CAAC;AAC5D;IACN;EACA;AAEE,SAAO;AACT;;AChCA,IAAIxS,WAASH,oBAAuB;AAEpC,SAAS4S,cAAa9P,OAAM,WAAW6P,UAAS;AAC9C,MAAIL,OAAMxP,MAAK,QAAQ,aAAaA,MAAK,KAAK;AAC9C,MAAI,MAAMwP,KAAI,CAAC,IAAI;AAEnB,EAAAxP,MAAK,QAAQ3C,SAAO,OAAO;IACzB2C,MAAK,MAAM,MAAM,CAAC;IAClB3C,SAAO,KAAK,CAACwS,WAAU,YAAY,GAAG,CAAC;EAC3C,CAAG;AAED,SAAO;AACT;AAEA,KAAA,UAAkB,SAAU7P,OAAM,OAAO6P,UAAS;AAChD,MAAI,MAAM,MAAM;AAChB,MAAI,MAAMxS,SAAO,YAAY,GAAG;AAChC,MAAI,IAAI;AAER,SAAO,EAAE,IAAI,KAAK;AAChB,QAAI,CAAC,IAAIyS,cAAY9P,OAAM,MAAM,CAAC,GAAG6P,QAAO;EAChD;AAEE,SAAO;AACT;;ACxBA,IAAIxS,WAASH,oBAAuB;AAEpC,SAAS,YAAa8C,OAAM,WAAW6P,UAAS;AAC9C,MAAIL;AACJ,MAAI,IAAI;AACR,MAAI,MAAM;AACV,MAAI,MAAM;AACV,MAAI,KAAK;AACT,SAAO,EAAE,IAAI,KAAK;AAChB,IAAAA,OAAMxP,MAAK,QAAQ,aAAaA,MAAK,KAAK;AAC1C,UAAO,YAAa,KAAM,IAAI,IAAO,MAAO;AAC5C,YAAQwP,KAAI,CAAC,IAAI;AACjB,YAAS,QAAQ,QAAU,IAAI;AAC/B,IAAAxP,MAAK,QAAQ,QAAQA,MAAK,OAAO6P,WAAU,MAAM,KAAK;EAC1D;AACE,SAAO;AACT;AAEA,SAAS,QAAS9S,SAAQ,OAAO;AAC/B,MAAI,MAAMA,QAAO;AACjB,MAAI,IAAI;AACR,MAAI,MAAMM,SAAO,YAAYN,QAAO,MAAM;AAC1C,EAAAA,UAASM,SAAO,OAAO,CAACN,SAAQM,SAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;AAErD,SAAO,EAAE,IAAI,KAAK;AAChB,QAAI,CAAC,IAAIN,QAAO,CAAC,KAAK,IAAIA,QAAO,IAAI,CAAC,KAAM;EAChD;AAEE,SAAO;AACT;AAEA,KAAA,UAAkB,SAAUiD,OAAM,OAAO6P,UAAS;AAChD,MAAI,MAAM,MAAM;AAChB,MAAI,MAAMxS,SAAO,YAAY,GAAG;AAChC,MAAI,IAAI;AAER,SAAO,EAAE,IAAI,KAAK;AAChB,QAAI,CAAC,IAAI,YAAY2C,OAAM,MAAM,CAAC,GAAG6P,QAAO;EAChD;AAEE,SAAO;AACT;;ACzCA,IAAI/P,QAAM5C;AAEV,SAAS6S,WAAU/P,OAAM;AACvB,EAAAA,MAAK,QAAQA,MAAK,QAAQ,aAAaA,MAAK,KAAK;AACjD,SAAOA,MAAK;AACd;AAEA,IAAA,UAAkB,SAAUA,OAAM,OAAO;AACvC,SAAOA,MAAK,OAAO,SAAS,MAAM,QAAQ;AACxC,IAAAA,MAAK,SAAS3C,SAAAA,OAAO,OAAO,CAAC2C,MAAK,QAAQ+P,WAAS/P,KAAI,CAAC,CAAC;EAC7D;AAEE,MAAIwP,OAAMxP,MAAK,OAAO,MAAM,GAAG,MAAM,MAAM;AAC3C,EAAAA,MAAK,SAASA,MAAK,OAAO,MAAM,MAAM,MAAM;AAC5C,SAAOF,MAAI,OAAO0P,IAAG;AACvB;;ACfA,SAASQ,SAAQ,IAAI;AACnB,MAAI,MAAM,GAAG;AACb,MAAI;AACJ,SAAO,OAAO;AACZ,WAAO,GAAG,UAAU,GAAG;AACvB,QAAI,SAAS,KAAK;AAChB,SAAG,WAAW,GAAG,GAAG;IAC1B,OAAW;AACL;AACA,SAAG,WAAW,MAAM,GAAG;AACvB;IACN;EACA;AACA;AACA,IAAA,WAAiBA;ACdjB,IAAIlQ,QAAM5C;AACV,IAAIG,WAASD,oBAAuB;AACpC,IAAI4S,WAASjP;AAEb,SAAS,SAAUf,OAAM;AACvB,MAAI,MAAMA,MAAK,QAAQ,gBAAgBA,MAAK,KAAK;AACjDgQ,WAAOhQ,MAAK,KAAK;AACjB,SAAO;AACT;AAEA,IAAI,YAAY;AAChB,IAAA,UAAkB,SAAUA,OAAM,OAAO;AACvC,MAAI,WAAW,KAAK,KAAK,MAAM,SAAS,SAAS;AACjD,MAAI,QAAQA,MAAK,OAAO;AACxB,EAAAA,MAAK,SAAS3C,SAAO,OAAO;IAC1B2C,MAAK;IACL3C,SAAO,YAAY,WAAW,SAAS;EAC3C,CAAG;AACD,WAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,QAAI,MAAM,SAAS2C,KAAI;AACvB,QAAI,SAAS,QAAQ,IAAI;AACzB,IAAAA,MAAK,OAAO,cAAc,IAAI,CAAC,GAAG,SAAS,CAAC;AAC5C,IAAAA,MAAK,OAAO,cAAc,IAAI,CAAC,GAAG,SAAS,CAAC;AAC5C,IAAAA,MAAK,OAAO,cAAc,IAAI,CAAC,GAAG,SAAS,CAAC;AAC5C,IAAAA,MAAK,OAAO,cAAc,IAAI,CAAC,GAAG,SAAS,EAAE;EACjD;AACE,MAAIwP,OAAMxP,MAAK,OAAO,MAAM,GAAG,MAAM,MAAM;AAC3C,EAAAA,MAAK,SAASA,MAAK,OAAO,MAAM,MAAM,MAAM;AAC5C,SAAOF,MAAI,OAAO0P,IAAG;AACvB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC7BA,IAAI,cAAc;EAChB,KAAKtS;EACL,KAAKE;EACL,KAAK2D;EACL,MAAMU;EACN,MAAMG;EACN,KAAKiB;EACL,KAAKsC;EACL,KAAKA;AACP;AAEA,IAAIyK,UAAQxK;AAEZ,KAASrG,SAAO6Q,SAAO;AACrBA,UAAM7Q,KAAG,EAAE,SAAS,YAAY6Q,QAAM7Q,KAAG,EAAE,IAAI;AACjD;AAFSA;AAIT,IAAA,UAAiB6Q;;ACZjB,IAAIvS,WAASH,oBAAuB;AAEpC,SAAS,cAAe,KAAK;AAC3B,MAAI,CAACG,SAAO,SAAS,GAAG,EAAG,OAAMA,SAAO,KAAK,GAAG;AAEhD,MAAI,MAAO,IAAI,SAAS,IAAK;AAC7B,MAAI,MAAM,IAAI,MAAM,GAAG;AAEvB,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,QAAI,CAAC,IAAI,IAAI,aAAa,IAAI,CAAC;EACnC;AAEE,SAAO;AACT;AAEA,SAAS,SAAU,GAAG;AACpB,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,MAAE,CAAC,IAAI;EACX;AACA;AAEA,SAAS,WAAY,GAAG,aAAa,SAAS,MAAM,SAAS;AAC3D,MAAI,WAAW,QAAQ,CAAC;AACxB,MAAI,WAAW,QAAQ,CAAC;AACxB,MAAI,WAAW,QAAQ,CAAC;AACxB,MAAI,WAAW,QAAQ,CAAC;AAExB,MAAI,KAAK,EAAE,CAAC,IAAI,YAAY,CAAC;AAC7B,MAAI,KAAK,EAAE,CAAC,IAAI,YAAY,CAAC;AAC7B,MAAI,KAAK,EAAE,CAAC,IAAI,YAAY,CAAC;AAC7B,MAAI,KAAK,EAAE,CAAC,IAAI,YAAY,CAAC;AAC7B,MAAI,IAAI,IAAI,IAAI;AAChB,MAAI,QAAQ;AAEZ,WAASyK,SAAQ,GAAGA,SAAQ,SAASA,UAAS;AAC5C,SAAK,SAAS,OAAO,EAAE,IAAI,SAAU,OAAO,KAAM,GAAI,IAAI,SAAU,OAAO,IAAK,GAAI,IAAI,SAAS,KAAK,GAAI,IAAI,YAAY,OAAO;AACjI,SAAK,SAAS,OAAO,EAAE,IAAI,SAAU,OAAO,KAAM,GAAI,IAAI,SAAU,OAAO,IAAK,GAAI,IAAI,SAAS,KAAK,GAAI,IAAI,YAAY,OAAO;AACjI,SAAK,SAAS,OAAO,EAAE,IAAI,SAAU,OAAO,KAAM,GAAI,IAAI,SAAU,OAAO,IAAK,GAAI,IAAI,SAAS,KAAK,GAAI,IAAI,YAAY,OAAO;AACjI,SAAK,SAAS,OAAO,EAAE,IAAI,SAAU,OAAO,KAAM,GAAI,IAAI,SAAU,OAAO,IAAK,GAAI,IAAI,SAAS,KAAK,GAAI,IAAI,YAAY,OAAO;AACjI,SAAK;AACL,SAAK;AACL,SAAK;AACL,SAAK;EACT;AAEE,QAAO,KAAK,OAAO,EAAE,KAAK,KAAO,KAAM,OAAO,KAAM,GAAI,KAAK,KAAO,KAAM,OAAO,IAAK,GAAI,KAAK,IAAK,KAAK,KAAK,GAAI,KAAK,YAAY,OAAO;AAC1I,QAAO,KAAK,OAAO,EAAE,KAAK,KAAO,KAAM,OAAO,KAAM,GAAI,KAAK,KAAO,KAAM,OAAO,IAAK,GAAI,KAAK,IAAK,KAAK,KAAK,GAAI,KAAK,YAAY,OAAO;AAC1I,QAAO,KAAK,OAAO,EAAE,KAAK,KAAO,KAAM,OAAO,KAAM,GAAI,KAAK,KAAO,KAAM,OAAO,IAAK,GAAI,KAAK,IAAK,KAAK,KAAK,GAAI,KAAK,YAAY,OAAO;AAC1I,QAAO,KAAK,OAAO,EAAE,KAAK,KAAO,KAAM,OAAO,KAAM,GAAI,KAAK,KAAO,KAAM,OAAO,IAAK,GAAI,KAAK,IAAK,KAAK,KAAK,GAAI,KAAK,YAAY,OAAO;AAC1I,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,OAAO;AAEZ,SAAO,CAAC,IAAI,IAAI,IAAI,EAAE;AACxB;AAGA,IAAI,OAAO,CAAC,GAAM,GAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,KAAM,IAAM,EAAI;AAC5E,IAAI,KAAK,WAAY;AAEnB,MAAI,IAAI,IAAI,MAAM,GAAG;AACrB,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,QAAI,IAAI,KAAK;AACX,QAAE,CAAC,IAAI,KAAK;IAClB,OAAW;AACL,QAAE,CAAC,IAAK,KAAK,IAAK;IACxB;EACA;AAEE,MAAI,OAAO,CAAA;AACX,MAAI,WAAW,CAAA;AACf,MAAI,UAAU,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE;AAC7B,MAAI,cAAc,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE;AAGjC,MAAI,IAAI;AACR,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAE5B,QAAI,KAAK,KAAM,MAAM,IAAM,MAAM,IAAM,MAAM,IAAM,MAAM;AACzD,SAAM,OAAO,IAAM,KAAK,MAAQ;AAChC,SAAK,CAAC,IAAI;AACV,aAAS,EAAE,IAAI;AAGf,QAAI,KAAK,EAAE,CAAC;AACZ,QAAI,KAAK,EAAE,EAAE;AACb,QAAI,KAAK,EAAE,EAAE;AAGb,QAAI,IAAK,EAAE,EAAE,IAAI,MAAU,KAAK;AAChC,YAAQ,CAAC,EAAE,CAAC,IAAK,KAAK,KAAO,MAAM;AACnC,YAAQ,CAAC,EAAE,CAAC,IAAK,KAAK,KAAO,MAAM;AACnC,YAAQ,CAAC,EAAE,CAAC,IAAK,KAAK,IAAM,MAAM;AAClC,YAAQ,CAAC,EAAE,CAAC,IAAI;AAGhB,QAAK,KAAK,WAAc,KAAK,QAAY,KAAK,MAAU,IAAI;AAC5D,gBAAY,CAAC,EAAE,EAAE,IAAK,KAAK,KAAO,MAAM;AACxC,gBAAY,CAAC,EAAE,EAAE,IAAK,KAAK,KAAO,MAAM;AACxC,gBAAY,CAAC,EAAE,EAAE,IAAK,KAAK,IAAM,MAAM;AACvC,gBAAY,CAAC,EAAE,EAAE,IAAI;AAErB,QAAI,MAAM,GAAG;AACX,UAAI,KAAK;IACf,OAAW;AACL,UAAI,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;AACxB,YAAM,EAAE,EAAE,EAAE,CAAC;IACnB;EACA;AAEE,SAAO;IACL;IACA;IACA;IACA;EACJ;AACA,GAAC;AAED,SAAS,IAAK/I,MAAK;AACjB,OAAK,OAAO,cAAcA,IAAG;AAC7B,OAAK,OAAM;AACb;AAEA,IAAI,YAAY,IAAI;AACpB,IAAI,UAAU,MAAM;AACpB,IAAI,UAAU,YAAY,IAAI;AAC9B,IAAI,UAAU,UAAU,IAAI;AAC5B,IAAI,UAAU,SAAS,WAAY;AACjC,MAAI,WAAW,KAAK;AACpB,MAAI,UAAU,SAAS;AACvB,MAAI,UAAU,UAAU;AACxB,MAAI,UAAU,UAAU,KAAK;AAE7B,MAAI,cAAc,CAAA;AAClB,WAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,gBAAY,CAAC,IAAI,SAAS,CAAC;EAC/B;AAEE,OAAK,IAAI,SAAS,IAAI,QAAQ,KAAK;AACjC,QAAI,IAAI,YAAY,IAAI,CAAC;AAEzB,QAAI,IAAI,YAAY,GAAG;AACrB,UAAK,KAAK,IAAM,MAAM;AACtB,UACG,EAAE,KAAK,MAAM,EAAE,KAAK,KACpB,EAAE,KAAM,MAAM,KAAM,GAAI,KAAK,KAC7B,EAAE,KAAM,MAAM,IAAK,GAAI,KAAK,IAC5B,EAAE,KAAK,IAAI,GAAI;AAElB,WAAK,KAAM,IAAI,UAAW,CAAC,KAAK;IACtC,WAAe,UAAU,KAAK,IAAI,YAAY,GAAG;AAC3C,UACG,EAAE,KAAK,MAAM,EAAE,KAAK,KACpB,EAAE,KAAM,MAAM,KAAM,GAAI,KAAK,KAC7B,EAAE,KAAM,MAAM,IAAK,GAAI,KAAK,IAC5B,EAAE,KAAK,IAAI,GAAI;IACxB;AAEI,gBAAY,CAAC,IAAI,YAAY,IAAI,OAAO,IAAI;EAChD;AAEE,MAAI,iBAAiB,CAAA;AACrB,WAAS,KAAK,GAAG,KAAK,QAAQ,MAAM;AAClC,QAAI,MAAM,SAAS;AACnB,QAAI,KAAK,YAAY,OAAO,KAAK,IAAI,IAAI,EAAE;AAE3C,QAAI,KAAK,KAAK,OAAO,GAAG;AACtB,qBAAe,EAAE,IAAI;IAC3B,OAAW;AACL,qBAAe,EAAE,IACf,EAAE,YAAY,CAAC,EAAE,EAAE,KAAK,OAAO,EAAE,CAAC,IAClC,EAAE,YAAY,CAAC,EAAE,EAAE,KAAM,OAAO,KAAM,GAAI,CAAC,IAC3C,EAAE,YAAY,CAAC,EAAE,EAAE,KAAM,OAAO,IAAK,GAAI,CAAC,IAC1C,EAAE,YAAY,CAAC,EAAE,EAAE,KAAK,KAAK,GAAI,CAAC;IAC1C;EACA;AAEE,OAAK,WAAW;AAChB,OAAK,eAAe;AACpB,OAAK,kBAAkB;AACzB;AAEA,IAAI,UAAU,kBAAkB,SAAU,GAAG;AAC3C,MAAI,cAAc,CAAC;AACnB,SAAO,WAAW,GAAG,KAAK,cAAc,EAAE,SAAS,EAAE,MAAM,KAAK,QAAQ;AAC1E;AAEA,IAAI,UAAU,eAAe,SAAU,GAAG;AACxC,MAAI,MAAM,KAAK,gBAAgB,CAAC;AAChC,MAAI,MAAM1B,SAAO,YAAY,EAAE;AAC/B,MAAI,cAAc,IAAI,CAAC,GAAG,CAAC;AAC3B,MAAI,cAAc,IAAI,CAAC,GAAG,CAAC;AAC3B,MAAI,cAAc,IAAI,CAAC,GAAG,CAAC;AAC3B,MAAI,cAAc,IAAI,CAAC,GAAG,EAAE;AAC5B,SAAO;AACT;AAEA,IAAI,UAAU,eAAe,SAAU,GAAG;AACxC,MAAI,cAAc,CAAC;AAGnB,MAAI,KAAK,EAAE,CAAC;AACZ,IAAE,CAAC,IAAI,EAAE,CAAC;AACV,IAAE,CAAC,IAAI;AAEP,MAAI,MAAM,WAAW,GAAG,KAAK,iBAAiB,EAAE,aAAa,EAAE,UAAU,KAAK,QAAQ;AACtF,MAAI,MAAMA,SAAO,YAAY,EAAE;AAC/B,MAAI,cAAc,IAAI,CAAC,GAAG,CAAC;AAC3B,MAAI,cAAc,IAAI,CAAC,GAAG,CAAC;AAC3B,MAAI,cAAc,IAAI,CAAC,GAAG,CAAC;AAC3B,MAAI,cAAc,IAAI,CAAC,GAAG,EAAE;AAC5B,SAAO;AACT;AAEA,IAAI,UAAU,QAAQ,WAAY;AAChC,WAAS,KAAK,YAAY;AAC1B,WAAS,KAAK,eAAe;AAC7B,WAAS,KAAK,IAAI;AACpB;AAEA4S,MAAA,MAAqB;ACnOrB,IAAI5S,WAASH,oBAAuB;AACpC,IAAI,SAASG,SAAO,MAAM,IAAI,CAAC;AAE/B,SAASuC,UAAS,KAAK;AACrB,SAAO;IACL,IAAI,aAAa,CAAC;IAClB,IAAI,aAAa,CAAC;IAClB,IAAI,aAAa,CAAC;IAClB,IAAI,aAAa,EAAE;EACvB;AACA;AAEA,SAAS,UAAW,KAAK;AACvB,MAAI,MAAMvC,SAAO,YAAY,EAAE;AAC/B,MAAI,cAAc,IAAI,CAAC,MAAM,GAAG,CAAC;AACjC,MAAI,cAAc,IAAI,CAAC,MAAM,GAAG,CAAC;AACjC,MAAI,cAAc,IAAI,CAAC,MAAM,GAAG,CAAC;AACjC,MAAI,cAAc,IAAI,CAAC,MAAM,GAAG,EAAE;AAClC,SAAO;AACT;AAEA,SAAS6S,QAAOnR,MAAK;AACnB,OAAK,IAAIA;AACT,OAAK,QAAQ1B,SAAO,MAAM,IAAI,CAAC;AAC/B,OAAK,QAAQA,SAAO,YAAY,CAAC;AACnC;AAIA6S,QAAM,UAAU,QAAQ,SAAU,OAAO;AACvC,MAAI,IAAI;AACR,SAAO,EAAE,IAAI,MAAM,QAAQ;AACzB,SAAK,MAAM,CAAC,KAAK,MAAM,CAAC;EAC5B;AACE,OAAK,UAAS;AAChB;AAEAA,QAAM,UAAU,YAAY,WAAY;AACtC,MAAI,KAAKtQ,UAAQ,KAAK,CAAC;AACvB,MAAI,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC;AACpB,MAAI,GAAG,IAAI;AACX,MAAI,IAAI;AACR,SAAO,EAAE,IAAI,KAAK;AAChB,UAAM,KAAK,MAAM,CAAC,EAAE,IAAI,EAAE,IAAK,KAAM,IAAK,IAAI,OAAU;AACxD,QAAI,IAAI;AAEN,SAAG,CAAC,KAAK,GAAG,CAAC;AACb,SAAG,CAAC,KAAK,GAAG,CAAC;AACb,SAAG,CAAC,KAAK,GAAG,CAAC;AACb,SAAG,CAAC,KAAK,GAAG,CAAC;IACnB;AAGI,aAAS,GAAG,CAAC,IAAI,OAAO;AAGxB,SAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,SAAG,CAAC,IAAK,GAAG,CAAC,MAAM,KAAO,GAAG,IAAI,CAAC,IAAI,MAAM;IAClD;AACI,OAAG,CAAC,IAAI,GAAG,CAAC,MAAM;AAGlB,QAAI,OAAO;AACT,SAAG,CAAC,IAAI,GAAG,CAAC,IAAK,OAAQ;IAC/B;EACA;AACE,OAAK,QAAQ,UAAU,EAAE;AAC3B;AAEAsQ,QAAM,UAAU,SAAS,SAAU,KAAK;AACtC,OAAK,QAAQ7S,SAAO,OAAO,CAAC,KAAK,OAAO,GAAG,CAAC;AAC5C,MAAI;AACJ,SAAO,KAAK,MAAM,UAAU,IAAI;AAC9B,YAAQ,KAAK,MAAM,MAAM,GAAG,EAAE;AAC9B,SAAK,QAAQ,KAAK,MAAM,MAAM,EAAE;AAChC,SAAK,MAAM,KAAK;EACpB;AACA;AAEA6S,QAAM,UAAU,QAAQ,SAAU,KAAK,IAAI;AACzC,MAAI,KAAK,MAAM,QAAQ;AACrB,SAAK,MAAM7S,SAAO,OAAO,CAAC,KAAK,OAAO,MAAM,GAAG,EAAE,CAAC;EACtD;AAEE,OAAK,MAAM,UAAU,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC;AACrC,SAAO,KAAK;AACd;AAEA,IAAA,QAAiB6S;ACxFjB,IAAID,QAAM/S;AACV,IAAIG,WAASD,oBAAuB;AACpC,IAAI2J,cAAYhG;AAChB,IAAI7B,aAAWuC;AACf,IAAI,QAAQG;AACZ,IAAI9B,QAAM+C;AACV,IAAI,SAASsC;AAEb,SAAS,QAAS,GAAG,GAAG;AACtB,MAAI,MAAM;AACV,MAAI,EAAE,WAAW,EAAE,OAAQ;AAE3B,MAAI,MAAM,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AACrC,WAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,WAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;EACtB;AAEE,SAAO;AACT;AAEA,SAAS,OAAQnF,OAAM,IAAI,IAAI;AAC7B,MAAI,GAAG,WAAW,IAAI;AACpB,IAAAA,MAAK,SAAS3C,SAAO,OAAO,CAAC,IAAIA,SAAO,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAC3D,WAAOA,SAAO,OAAO,CAAC,IAAIA,SAAO,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;EACxD;AACE,MAAI8S,SAAQ,IAAI,MAAM,EAAE;AACxB,MAAI,MAAM,GAAG;AACb,MAAI,QAAQ,MAAM;AAClB,EAAAA,OAAM,OAAO,EAAE;AACf,MAAI,OAAO;AACT,YAAQ,KAAK;AACb,IAAAA,OAAM,OAAO9S,SAAO,MAAM,OAAO,CAAC,CAAC;EACvC;AACE,EAAA8S,OAAM,OAAO9S,SAAO,MAAM,GAAG,CAAC,CAAC;AAC/B,MAAI,SAAS,MAAM;AACnB,MAAI,OAAOA,SAAO,MAAM,CAAC;AACzB,OAAK,YAAY,QAAQ,GAAG,CAAC;AAC7B,EAAA8S,OAAM,OAAO,IAAI;AACjB,EAAAnQ,MAAK,SAASmQ,OAAM;AACpB,MAAI,MAAM9S,SAAO,KAAK2C,MAAK,MAAM;AACjC,SAAO,GAAG;AACV,SAAO;AACT;AACA,SAASoQ,eAAc,MAAMrR,MAAK,IAAI8Q,UAAS;AAC7C9I,cAAU,KAAK,IAAI;AAEnB,MAAI,IAAI1J,SAAO,MAAM,GAAG,CAAC;AAEzB,OAAK,UAAU,IAAI4S,MAAI,IAAIlR,IAAG;AAC9B,MAAI,KAAK,KAAK,QAAQ,aAAa,CAAC;AACpC,OAAK,SAAS,IAAI,MAAM,EAAE;AAC1B,OAAK,OAAO,MAAM,IAAI,EAAE;AAExB,OAAK,QAAQ1B,SAAO,KAAK,EAAE;AAC3B,OAAK,SAASA,SAAO,YAAY,CAAC;AAClC,OAAK,YAAYA,SAAO,YAAY,CAAC;AACrC,OAAK,WAAWwS;AAChB,OAAK,QAAQ;AACb,OAAK,OAAO;AACZ,OAAK,QAAQ;AAEb,OAAK,WAAW;AAChB,OAAK,UAAU;AACjB;AAEA3Q,WAASkR,gBAAcrJ,WAAS;AAEhCqJ,eAAa,UAAU,UAAU,SAAU,OAAO;AAChD,MAAI,CAAC,KAAK,WAAW,KAAK,OAAO;AAC/B,QAAI,OAAO,KAAM,KAAK,QAAQ;AAC9B,QAAI,OAAO,IAAI;AACb,aAAO/S,SAAO,MAAM,MAAM,CAAC;AAC3B,WAAK,OAAO,OAAO,IAAI;IAC7B;EACA;AAEE,OAAK,UAAU;AACf,MAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,KAAK;AACxC,MAAI,KAAK,UAAU;AACjB,SAAK,OAAO,OAAO,KAAK;EAC5B,OAAS;AACL,SAAK,OAAO,OAAO,GAAG;EAC1B;AACE,OAAK,QAAQ,MAAM;AACnB,SAAO;AACT;AAEA+S,eAAa,UAAU,SAAS,WAAY;AAC1C,MAAI,KAAK,YAAY,CAAC,KAAK,SAAU,OAAM,IAAI,MAAM,kDAAkD;AAEvG,MAAI,MAAMtQ,MAAI,KAAK,OAAO,MAAM,KAAK,QAAQ,GAAG,KAAK,OAAO,CAAC,GAAG,KAAK,QAAQ,aAAa,KAAK,MAAM,CAAC;AACtG,MAAI,KAAK,YAAY,QAAQ,KAAK,KAAK,QAAQ,EAAG,OAAM,IAAI,MAAM,kDAAkD;AAEpH,OAAK,WAAW;AAChB,OAAK,QAAQ,MAAK;AACpB;AAEAsQ,eAAa,UAAU,aAAa,SAAS,aAAc;AACzD,MAAI,KAAK,YAAY,CAAC/S,SAAO,SAAS,KAAK,QAAQ,EAAG,OAAM,IAAI,MAAM,iDAAiD;AAEvH,SAAO,KAAK;AACd;AAEA+S,eAAa,UAAU,aAAa,SAAS,WAAY,KAAK;AAC5D,MAAI,CAAC,KAAK,SAAU,OAAM,IAAI,MAAM,iDAAiD;AAErF,OAAK,WAAW;AAClB;AAEAA,eAAa,UAAU,SAAS,SAAS,OAAQ,KAAK;AACpD,MAAI,KAAK,QAAS,OAAM,IAAI,MAAM,4CAA4C;AAE9E,OAAK,OAAO,OAAO,GAAG;AACtB,OAAK,SAAS,IAAI;AACpB;AAEA,IAAA,aAAiBA;ACpHjB,IAAIH,QAAM/S;AACV,IAAIG,WAASD,oBAAuB;AACpC,IAAI2J,cAAYhG;AAChB,IAAI7B,aAAWuC;AAEf,SAAS2O,eAAc,MAAMrR,MAAK,IAAI8Q,UAAS;AAC7C9I,cAAU,KAAK,IAAI;AAEnB,OAAK,UAAU,IAAIkJ,MAAI,IAAIlR,IAAG;AAC9B,OAAK,QAAQ1B,SAAO,KAAK,EAAE;AAC3B,OAAK,SAASA,SAAO,YAAY,CAAC;AAClC,OAAK,YAAYA,SAAO,YAAY,CAAC;AACrC,OAAK,WAAWwS;AAChB,OAAK,QAAQ;AACf;AAEA3Q,WAASkR,gBAAcrJ,WAAS;AAEhCqJ,eAAa,UAAU,UAAU,SAAU,OAAO;AAChD,SAAO,KAAK,MAAM,QAAQ,MAAM,OAAO,KAAK,QAAQ;AACtD;AAEAA,eAAa,UAAU,SAAS,WAAY;AAC1C,OAAK,QAAQ,MAAK;AACpB;AAEA,IAAA,eAAiBA;AC1BjB,IAAI/S,WAASH,oBAAuB;AACpC,IAAI,MAAME;AAGV,SAAS,eAAgB,UAAU,MAAM,SAAS,OAAO;AACvD,MAAI,CAACC,SAAO,SAAS,QAAQ,EAAG,YAAWA,SAAO,KAAK,UAAU,QAAQ;AACzE,MAAI,MAAM;AACR,QAAI,CAACA,SAAO,SAAS,IAAI,EAAG,QAAOA,SAAO,KAAK,MAAM,QAAQ;AAC7D,QAAI,KAAK,WAAW,EAAG,OAAM,IAAI,WAAW,0CAA0C;EAC1F;AAEE,MAAI,SAAS,UAAU;AACvB,MAAI0B,OAAM1B,SAAO,MAAM,MAAM;AAC7B,MAAI,KAAKA,SAAO,MAAM,SAAS,CAAC;AAChC,MAAI,MAAMA,SAAO,MAAM,CAAC;AAExB,SAAO,SAAS,KAAK,QAAQ,GAAG;AAC9B,QAAI+P,QAAO,IAAI,IAAG;AAClB,IAAAA,MAAK,OAAO,GAAG;AACf,IAAAA,MAAK,OAAO,QAAQ;AACpB,QAAI,KAAM,CAAAA,MAAK,OAAO,IAAI;AAC1B,UAAMA,MAAK,OAAM;AAEjB,QAAI,OAAO;AAEX,QAAI,SAAS,GAAG;AACd,UAAI,WAAWrO,KAAI,SAAS;AAC5B,aAAO,KAAK,IAAI,QAAQ,IAAI,MAAM;AAClC,UAAI,KAAKA,MAAK,UAAU,GAAG,IAAI;AAC/B,gBAAU;IAChB;AAEI,QAAI,OAAO,IAAI,UAAU,QAAQ,GAAG;AAClC,UAAI,UAAU,GAAG,SAAS;AAC1B,UAAI,SAAS,KAAK,IAAI,OAAO,IAAI,SAAS,IAAI;AAC9C,UAAI,KAAK,IAAI,SAAS,MAAM,OAAO,MAAM;AACzC,eAAS;IACf;EACA;AAEE,MAAI,KAAK,CAAC;AACV,SAAO,EAAE,KAAKA,MAAK,GAAM;AAC3B;AAEA,IAAA,iBAAiB;AC5CjB,IAAIsR,UAAQnT;AACZ,IAAIoT,eAAalT;AACjB,IAAIC,WAAS0D,oBAAuB;AACpC,IAAIqP,iBAAe3O;AACnB,IAAIsF,cAAYnF;AAChB,IAAIqO,QAAMpN;AACV,IAAI0N,SAAOpL;AACX,IAAIjG,aAAWkG;AAEf,SAAS,OAAQ,MAAMrG,MAAK,IAAI;AAC9BgI,cAAU,KAAK,IAAI;AAEnB,OAAK,SAAS,IAAIyJ,WAAQ;AAC1B,OAAK,UAAU,IAAIP,MAAI,IAAIlR,IAAG;AAC9B,OAAK,QAAQ1B,SAAO,KAAK,EAAE;AAC3B,OAAK,QAAQ;AACb,OAAK,eAAe;AACtB;AAEA6B,WAAS,QAAQ6H,WAAS;AAE1B,OAAO,UAAU,UAAU,SAAU,MAAM;AACzC,OAAK,OAAO,IAAI,IAAI;AACpB,MAAI;AACJ,MAAI;AACJ,MAAI,MAAM,CAAA;AAEV,SAAQ,QAAQ,KAAK,OAAO,IAAG,GAAK;AAClC,YAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK;AACtC,QAAI,KAAK,KAAK;EAClB;AAEE,SAAO1J,SAAO,OAAO,GAAG;AAC1B;AAEA,IAAI,UAAUA,SAAO,MAAM,IAAI,EAAI;AAEnC,OAAO,UAAU,SAAS,WAAY;AACpC,MAAI,QAAQ,KAAK,OAAO,MAAK;AAC7B,MAAI,KAAK,cAAc;AACrB,YAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK;AACtC,SAAK,QAAQ,MAAK;AAClB,WAAO;EACX;AAEE,MAAI,CAAC,MAAM,OAAO,OAAO,GAAG;AAC1B,SAAK,QAAQ,MAAK;AAClB,UAAM,IAAI,MAAM,mCAAmC;EACvD;AACA;AAEA,OAAO,UAAU,iBAAiB,SAAU,OAAO;AACjD,OAAK,eAAe,CAAC,CAAC;AACtB,SAAO;AACT;AAEA,SAASmT,aAAY;AACnB,OAAK,QAAQnT,SAAO,YAAY,CAAC;AACnC;AAEAmT,WAAS,UAAU,MAAM,SAAU,MAAM;AACvC,OAAK,QAAQnT,SAAO,OAAO,CAAC,KAAK,OAAO,IAAI,CAAC;AAC/C;AAEAmT,WAAS,UAAU,MAAM,WAAY;AACnC,MAAI,KAAK,MAAM,SAAS,IAAI;AAC1B,QAAI,MAAM,KAAK,MAAM,MAAM,GAAG,EAAE;AAChC,SAAK,QAAQ,KAAK,MAAM,MAAM,EAAE;AAChC,WAAO;EACX;AACE,SAAO;AACT;AAEAA,WAAS,UAAU,QAAQ,WAAY;AACrC,MAAI,MAAM,KAAK,KAAK,MAAM;AAC1B,MAAI,UAAUnT,SAAO,YAAY,GAAG;AAEpC,MAAI,IAAI;AACR,SAAO,EAAE,IAAI,KAAK;AAChB,YAAQ,WAAW,KAAK,CAAC;EAC7B;AAEE,SAAOA,SAAO,OAAO,CAAC,KAAK,OAAO,OAAO,CAAC;AAC5C;AAEA,SAASoT,iBAAgB,OAAO,UAAU,IAAI;AAC5C,MAAIC,UAASL,QAAM,MAAM,YAAW,CAAE;AACtC,MAAI,CAACK,QAAQ,OAAM,IAAI,UAAU,oBAAoB;AAErD,MAAI,OAAO,aAAa,SAAU,YAAWrT,SAAO,KAAK,QAAQ;AACjE,MAAI,SAAS,WAAWqT,QAAO,MAAM,EAAG,OAAM,IAAI,UAAU,wBAAwB,SAAS,MAAM;AAEnG,MAAI,OAAO,OAAO,SAAU,MAAKrT,SAAO,KAAK,EAAE;AAC/C,MAAIqT,QAAO,SAAS,SAAS,GAAG,WAAWA,QAAO,GAAI,OAAM,IAAI,UAAU,uBAAuB,GAAG,MAAM;AAE1G,MAAIA,QAAO,SAAS,UAAU;AAC5B,WAAO,IAAIN,eAAaM,QAAO,QAAQ,UAAU,EAAE;EACvD,WAAaA,QAAO,SAAS,QAAQ;AACjC,WAAO,IAAIJ,aAAWI,QAAO,QAAQ,UAAU,EAAE;EACrD;AAEE,SAAO,IAAI,OAAOA,QAAO,QAAQ,UAAU,EAAE;AAC/C;AAEA,SAASC,eAAc,OAAO,UAAU;AACtC,MAAID,UAASL,QAAM,MAAM,YAAW,CAAE;AACtC,MAAI,CAACK,QAAQ,OAAM,IAAI,UAAU,oBAAoB;AAErD,MAAIxM,QAAOqM,OAAK,UAAU,OAAOG,QAAO,KAAKA,QAAO,EAAE;AACtD,SAAOD,iBAAe,OAAOvM,MAAK,KAAKA,MAAK,EAAE;AAChD;AAEA,UAAA,iBAAyBuM;AACzB,UAAA,eAAuBE;;ACjHvB,IAAI,aAAazT;AACjB,IAAIG,WAASD,oBAAuB;AACpC,IAAI,QAAQ2D;AACZ,IAAI,eAAeU;AACnB,IAAI,YAAYG;AAChB,IAAIqO,QAAMpN;AACV,IAAI0N,SAAOpL;AACX,IAAIjG,aAAWkG;AAEf,SAAS,SAAU,MAAMrG,MAAK,IAAI;AAChC,YAAU,KAAK,IAAI;AAEnB,OAAK,SAAS,IAAI,SAAQ;AAC1B,OAAK,QAAQ;AACb,OAAK,UAAU,IAAIkR,MAAI,IAAIlR,IAAG;AAC9B,OAAK,QAAQ1B,SAAO,KAAK,EAAE;AAC3B,OAAK,QAAQ;AACb,OAAK,eAAe;AACtB;AAEA6B,WAAS,UAAU,SAAS;AAE5B,SAAS,UAAU,UAAU,SAAU,MAAM;AAC3C,OAAK,OAAO,IAAI,IAAI;AACpB,MAAI;AACJ,MAAI;AACJ,MAAI,MAAM,CAAA;AACV,SAAQ,QAAQ,KAAK,OAAO,IAAI,KAAK,YAAY,GAAI;AACnD,YAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK;AACtC,QAAI,KAAK,KAAK;EAClB;AACE,SAAO7B,SAAO,OAAO,GAAG;AAC1B;AAEA,SAAS,UAAU,SAAS,WAAY;AACtC,MAAI,QAAQ,KAAK,OAAO,MAAK;AAC7B,MAAI,KAAK,cAAc;AACrB,WAAO,MAAM,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC;EAChD,WAAa,OAAO;AAChB,UAAM,IAAI,MAAM,mCAAmC;EACvD;AACA;AAEA,SAAS,UAAU,iBAAiB,SAAU,OAAO;AACnD,OAAK,eAAe,CAAC,CAAC;AACtB,SAAO;AACT;AAEA,SAAS,WAAY;AACnB,OAAK,QAAQA,SAAO,YAAY,CAAC;AACnC;AAEA,SAAS,UAAU,MAAM,SAAU,MAAM;AACvC,OAAK,QAAQA,SAAO,OAAO,CAAC,KAAK,OAAO,IAAI,CAAC;AAC/C;AAEA,SAAS,UAAU,MAAM,SAAU,aAAa;AAC9C,MAAI;AACJ,MAAI,aAAa;AACf,QAAI,KAAK,MAAM,SAAS,IAAI;AAC1B,YAAM,KAAK,MAAM,MAAM,GAAG,EAAE;AAC5B,WAAK,QAAQ,KAAK,MAAM,MAAM,EAAE;AAChC,aAAO;IACb;EACA,OAAS;AACL,QAAI,KAAK,MAAM,UAAU,IAAI;AAC3B,YAAM,KAAK,MAAM,MAAM,GAAG,EAAE;AAC5B,WAAK,QAAQ,KAAK,MAAM,MAAM,EAAE;AAChC,aAAO;IACb;EACA;AAEE,SAAO;AACT;AAEA,SAAS,UAAU,QAAQ,WAAY;AACrC,MAAI,KAAK,MAAM,OAAQ,QAAO,KAAK;AACrC;AAEA,SAAS,MAAO,MAAM;AACpB,MAAI,SAAS,KAAK,EAAE;AACpB,MAAI,SAAS,KAAK,SAAS,IAAI;AAC7B,UAAM,IAAI,MAAM,wBAAwB;EAC5C;AACE,MAAI,IAAI;AACR,SAAO,EAAE,IAAI,QAAQ;AACnB,QAAI,KAAM,KAAK,KAAK,OAAO,MAAO,QAAQ;AACxC,YAAM,IAAI,MAAM,wBAAwB;IAC9C;EACA;AACE,MAAI,WAAW,GAAI;AAEnB,SAAO,KAAK,MAAM,GAAG,KAAK,MAAM;AAClC;AAEA,SAASuT,mBAAkB,OAAO,UAAU,IAAI;AAC9C,MAAIF,UAAS,MAAM,MAAM,YAAW,CAAE;AACtC,MAAI,CAACA,QAAQ,OAAM,IAAI,UAAU,oBAAoB;AAErD,MAAI,OAAO,OAAO,SAAU,MAAKrT,SAAO,KAAK,EAAE;AAC/C,MAAIqT,QAAO,SAAS,SAAS,GAAG,WAAWA,QAAO,GAAI,OAAM,IAAI,UAAU,uBAAuB,GAAG,MAAM;AAE1G,MAAI,OAAO,aAAa,SAAU,YAAWrT,SAAO,KAAK,QAAQ;AACjE,MAAI,SAAS,WAAWqT,QAAO,MAAM,EAAG,OAAM,IAAI,UAAU,wBAAwB,SAAS,MAAM;AAEnG,MAAIA,QAAO,SAAS,UAAU;AAC5B,WAAO,IAAI,aAAaA,QAAO,QAAQ,UAAU,IAAI,IAAI;EAC7D,WAAaA,QAAO,SAAS,QAAQ;AACjC,WAAO,IAAI,WAAWA,QAAO,QAAQ,UAAU,IAAI,IAAI;EAC3D;AAEE,SAAO,IAAI,SAASA,QAAO,QAAQ,UAAU,EAAE;AACjD;AAEA,SAASG,iBAAgB,OAAO,UAAU;AACxC,MAAIH,UAAS,MAAM,MAAM,YAAW,CAAE;AACtC,MAAI,CAACA,QAAQ,OAAM,IAAI,UAAU,oBAAoB;AAErD,MAAIxM,QAAOqM,OAAK,UAAU,OAAOG,QAAO,KAAKA,QAAO,EAAE;AACtD,SAAOE,mBAAiB,OAAO1M,MAAK,KAAKA,MAAK,EAAE;AAClD;AAEA,UAAA,iBAAyB2M;AACzB,UAAA,mBAA2BD;AC3H3B,IAAIE,YAAU5T;AACd,IAAI,YAAYE;AAChB,IAAIwS,UAAQ;AAEZ,SAASmB,eAAc;AACrB,SAAO,OAAO,KAAKnB,OAAK;AAC1B;AAEA7K,UAAA,eAAuBA,UAAA,SAAiB+L,UAAQ;AAChD/L,UAAA,iBAAyBA,UAAA,WAAmB+L,UAAQ;AACpD/L,UAAA,iBAAyBA,UAAA,WAAmB,UAAU;AACtDA,UAAA,mBAA2BA,UAAA,aAAqB,UAAU;AACvCA,UAAA,cAAA,UAAA,aAAwBgM;;;ACZ3C,UAAQ,SAAS,IAAI;IACnB,KAAK;IACL,IAAI;;AAEN,UAAQ,SAAS,IAAI,QAAc,MAAA;IACjC,KAAK;IACL,IAAI;;AAEN,UAAQ,cAAc,IAAI,QAAe,OAAA;IACvC,KAAK;IACL,IAAI;;AAEN,UAAQ,UAAU,IAAI;IACpB,KAAK;IACL,IAAI;;AAEN,UAAQ,aAAa,IAAI;IACvB,KAAK;IACL,IAAI;;AAEN,UAAQ,SAAS,IAAI;IACnB,KAAK;IACL,IAAI;EACN;;ACvBA,IAAI,MAAM7T;AACV,IAAI,MAAME;AACV,IAAI,WAAW2D;AACf,IAAI,WAAWU;AACf,IAAI,OAAOG;AAEX,SAAS,aAAc,OAAO,UAAU;AACtC,UAAQ,MAAM,YAAW;AAEzB,MAAI,QAAQ;AACZ,MAAI,SAAS,KAAK,GAAG;AACnB,aAAS,SAAS,KAAK,EAAE;AACzB,YAAQ,SAAS,KAAK,EAAE;EAC5B,WAAa,SAAS,KAAK,GAAG;AAC1B,aAAS,SAAS,KAAK,EAAE,MAAM;AAC/B,YAAQ,SAAS,KAAK,EAAE;EAC5B,OAAS;AACL,UAAM,IAAI,UAAU,oBAAoB;EAC5C;AAEE,MAAIsC,QAAO,KAAK,UAAU,OAAO,QAAQ,KAAK;AAC9C,SAAO,eAAe,OAAOA,MAAK,KAAKA,MAAK,EAAE;AAChD;AAEA,SAAS,eAAgB,OAAO,UAAU;AACxC,UAAQ,MAAM,YAAW;AAEzB,MAAI,QAAQ;AACZ,MAAI,SAAS,KAAK,GAAG;AACnB,aAAS,SAAS,KAAK,EAAE;AACzB,YAAQ,SAAS,KAAK,EAAE;EAC5B,WAAa,SAAS,KAAK,GAAG;AAC1B,aAAS,SAAS,KAAK,EAAE,MAAM;AAC/B,YAAQ,SAAS,KAAK,EAAE;EAC5B,OAAS;AACL,UAAM,IAAI,UAAU,oBAAoB;EAC5C;AAEE,MAAIA,QAAO,KAAK,UAAU,OAAO,QAAQ,KAAK;AAC9C,SAAO,iBAAiB,OAAOA,MAAK,KAAKA,MAAK,EAAE;AAClD;AAEA,SAAS,eAAgB,OAAOnF,MAAK,IAAI;AACvC,UAAQ,MAAM,YAAW;AACzB,MAAI,SAAS,KAAK,EAAG,QAAO,IAAI,eAAe,OAAOA,MAAK,EAAE;AAC7D,MAAI,SAAS,KAAK,EAAG,QAAO,IAAI,IAAI,EAAE,KAAKA,MAAK,IAAQ,MAAM,MAAK,CAAE;AAErE,QAAM,IAAI,UAAU,oBAAoB;AAC1C;AAEA,SAAS,iBAAkB,OAAOA,MAAK,IAAI;AACzC,UAAQ,MAAM,YAAW;AACzB,MAAI,SAAS,KAAK,EAAG,QAAO,IAAI,iBAAiB,OAAOA,MAAK,EAAE;AAC/D,MAAI,SAAS,KAAK,EAAG,QAAO,IAAI,IAAI,EAAE,KAAKA,MAAK,IAAQ,MAAM,OAAO,SAAS,KAAI,CAAE;AAEpF,QAAM,IAAI,UAAU,oBAAoB;AAC1C;AAEA,SAAS,aAAc;AACrB,SAAO,OAAO,KAAK,QAAQ,EAAE,OAAO,IAAI,WAAU,CAAE;AACtD;AAEoBgG,UAAA,eAAiBA,UAAA,SAAG;AAClBA,UAAA,iBAAmBA,UAAA,WAAG;AACtBA,UAAA,iBAAmBA,UAAA,WAAG;AACpBA,UAAA,mBAAqBA,UAAA,aAAG;AAC7BA,UAAA,cAAA,UAAA,aAAwB;;;;;;;AClE3C,MAAIxF;AAEJyR,UAAA,UAAiB,SAAS,KAAK,KAAK;AAClC,QAAI,CAACzR;AACH,MAAAA,KAAI,IAAI,KAAK,IAAI;AAEnB,WAAOA,GAAE,SAAS,GAAG;EACvB;AAEA,WAAS,KAAK,MAAM;AAClB,SAAK,OAAO;;AAEKyR,UAAA,QAAA,OAAG;AAEtB,OAAK,UAAU,WAAW,SAASC,UAAS,KAAK;AAC/C,WAAO,KAAK,MAAM,GAAG;EACvB;AAGA,OAAK,UAAU,QAAQ,SAAS,MAAM,GAAG;AACvC,QAAI,KAAK,KAAK;AACZ,aAAO,KAAK,KAAK,SAAS,CAAC;AAE7B,QAAI,MAAM,IAAI,WAAW,CAAC;AAC1B,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC9B,UAAI,CAAC,IAAI,KAAK,KAAK,QAAO;AAC5B,WAAO;EACT;AAEA,MAAI,OAAO,SAAS,UAAU;AAC5B,QAAI,KAAK,UAAU,KAAK,OAAO,iBAAiB;AAE9C,WAAK,UAAU,QAAQ,SAAS,MAAM,GAAG;AACvC,YAAI,MAAM,IAAI,WAAW,CAAC;AAC1B,aAAK,OAAO,gBAAgB,GAAG;AAC/B,eAAO;MACb;eACa,KAAK,YAAY,KAAK,SAAS,iBAAiB;AAEzD,WAAK,UAAU,QAAQ,SAAS,MAAM,GAAG;AACvC,YAAI,MAAM,IAAI,WAAW,CAAC;AAC1B,aAAK,SAAS,gBAAgB,GAAG;AACjC,eAAO;MACb;IAGA,WAAa,OAAO,WAAW,UAAU;AAErC,WAAK,UAAU,QAAQ,WAAW;AAChC,cAAM,IAAI,MAAM,qBAAqB;MAC3C;;EAEA,OAAO;AAEL,QAAI;AACF,UAAI3N,UAASpG,wBAAA;AACb,UAAI,OAAOoG,QAAO,gBAAgB;AAChC,cAAM,IAAI,MAAM,eAAe;AAEjC,WAAK,UAAU,QAAQ,SAAS,MAAM,GAAG;AACvC,eAAOA,QAAO,YAAY,CAAC;MACjC;aACW,GAAG;;EAEd;;;;;;;;AChEA,MAAI4N,MAAKhU;AACT,MAAIiU,WAAU/T,eAAA;AAEd,WAAS,YAAY,MAAM;AACzB,SAAK,OAAO,QAAQ,IAAI+T,SAAQ,KAAI;;AAExB,OAAG;AAEjB,cAAY,SAAS,SAAS1B,QAAO,MAAM;AACzC,WAAO,IAAI,YAAY,IAAI;EAC7B;AAEA,cAAY,UAAU,aAAa,SAAS,WAAW,GAAG;AACxD,QAAI,MAAM,EAAE,UAAS;AACrB,QAAI,YAAY,KAAK,KAAK,MAAM,CAAC;AAIjC;AACE,UAAI,IAAI,IAAIyB,IAAG,KAAK,KAAK,SAAS,SAAS,CAAC;WACvC,EAAE,IAAI,CAAC,KAAK;AAEnB,WAAO;EACT;AAEA,cAAY,UAAU,aAAa,SAAS,WAAW,OAAO,MAAM;AAElE,QAAI,OAAO,KAAK,IAAI,KAAK;AACzB,WAAO,MAAM,IAAI,KAAK,WAAW,IAAI,CAAC;EACxC;AAEA,cAAY,UAAU,OAAO,SAAS,KAAK,GAAG,GAAG,IAAI;AACnD,QAAI,MAAM,EAAE,UAAS;AACrB,QAAI,MAAMA,IAAG,KAAK,CAAC;AACnB,QAAI,OAAO,IAAIA,IAAG,CAAC,EAAE,MAAM,GAAG;AAE9B,QAAI,CAAC;AACH,UAAI,KAAK,IAAI,GAAI,MAAM,KAAM,CAAC;AAGhC,QAAI,KAAK,EAAE,KAAK,CAAC;AACjB,aAASjU,KAAI,GAAG,CAAC,GAAG,MAAMA,EAAC,GAAGA,MAAK;IAAA;AACnC,QAAI,IAAI,EAAE,KAAKA,EAAC;AAEhB,QAAI,MAAM,GAAG,MAAM,GAAG;AAEtB,QAAI,QAAQ;AACZ,WAAO,IAAI,GAAG,KAAK;AACjB,UAAI,IAAI,KAAK,WAAW,IAAIiU,IAAG,CAAC,GAAG,EAAE;AACrC,UAAI;AACF,WAAG,CAAC;AAEN,UAAI,IAAI,EAAE,MAAM,GAAG,EAAE,OAAO,CAAC;AAC7B,UAAI,EAAE,IAAI,IAAI,MAAM,KAAK,EAAE,IAAI,GAAG,MAAM;AACtC;AAEF,eAAS,IAAI,GAAG,IAAIjU,IAAG,KAAK;AAC1B,YAAI,EAAE,OAAM;AAEZ,YAAI,EAAE,IAAI,IAAI,MAAM;AAClB,iBAAO;AACT,YAAI,EAAE,IAAI,GAAG,MAAM;AACjB;;AAGJ,UAAI,MAAMA;AACR,eAAO;;AAGX,WAAO;EACT;AAEA,cAAY,UAAU,aAAa,SAAS,WAAW,GAAG,GAAG;AAC3D,QAAI,MAAM,EAAE,UAAS;AACrB,QAAI,MAAMiU,IAAG,KAAK,CAAC;AACnB,QAAI,OAAO,IAAIA,IAAG,CAAC,EAAE,MAAM,GAAG;AAE9B,QAAI,CAAC;AACH,UAAI,KAAK,IAAI,GAAI,MAAM,KAAM,CAAC;AAGhC,QAAI,KAAK,EAAE,KAAK,CAAC;AACjB,aAASjU,KAAI,GAAG,CAAC,GAAG,MAAMA,EAAC,GAAGA,MAAK;IAAA;AACnC,QAAI,IAAI,EAAE,KAAKA,EAAC;AAEhB,QAAI,MAAM,GAAG,MAAM,GAAG;AAEtB,WAAO,IAAI,GAAG,KAAK;AACjB,UAAI,IAAI,KAAK,WAAW,IAAIiU,IAAG,CAAC,GAAG,EAAE;AAErC,UAAI,IAAI,EAAE,IAAI,CAAC;AACf,UAAI,EAAE,KAAK,CAAC,MAAM;AAChB,eAAO;AAET,UAAI,IAAI,EAAE,MAAM,GAAG,EAAE,OAAO,CAAC;AAC7B,UAAI,EAAE,IAAI,IAAI,MAAM,KAAK,EAAE,IAAI,GAAG,MAAM;AACtC;AAEF,eAAS,IAAI,GAAG,IAAIjU,IAAG,KAAK;AAC1B,YAAI,EAAE,OAAM;AAEZ,YAAI,EAAE,IAAI,IAAI,MAAM;AAClB,iBAAO,EAAE,QAAO,EAAG,KAAK,CAAC,EAAE,IAAI,CAAC;AAClC,YAAI,EAAE,IAAI,GAAG,MAAM;AACjB;;AAGJ,UAAI,MAAMA,IAAG;AACX,YAAI,EAAE,OAAM;AACZ,eAAO,EAAE,QAAO,EAAG,KAAK,CAAC,EAAE,IAAI,CAAC;;;AAIpC,WAAO;;;;;;;;;ACjHT,MAAIwG,eAAcvG;AACJ,kBAAG;AACjB,YAAU,cAAc;AACxB,YAAU,aAAa;AACvB,MAAIiC,MAAK/B;AACT,MAAI,aAAa,IAAI+B,IAAG,EAAE;AAC1B,MAAI,cAAc4B,UAAA;AAClB,MAAI,cAAc,IAAI,YAAW;AACjC,MAAI,MAAM,IAAI5B,IAAG,CAAC;AAClB,MAAI,MAAM,IAAIA,IAAG,CAAC;AAClB,MAAI,OAAO,IAAIA,IAAG,CAAC;AACL,MAAIA,IAAG,EAAE;AACX,MAAIA,IAAG,CAAC;AACpB,MAAI,MAAM,IAAIA,IAAG,EAAE;AACnB,MAAI,QAAQ,IAAIA,IAAG,CAAC;AACR,MAAIA,IAAG,CAAC;AACpB,MAAI,SAAS,IAAIA,IAAG,EAAE;AACtB,MAAI,OAAO,IAAIA,IAAG,CAAC;AACN,MAAIA,IAAG,EAAE;AACtB,MAAI,SAAS;AAEb,WAAS,aAAa;AACpB,QAAI,WAAW;AACb,aAAO;AAET,QAAI,QAAQ;AACZ,QAAI,MAAM,CAAA;AACV,QAAI,CAAC,IAAI;AACT,aAAS,IAAI,GAAG,IAAI,GAAG,IAAI,OAAO,KAAK,GAAG;AACxC,UAAI,OAAO,KAAK,KAAK,KAAK,KAAK,CAAC,CAAC;AACjC,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,CAAC,KAAK,MAAM;AACvC,YAAI,IAAI,IAAI,CAAC,MAAM;AACjB;AAEJ,UAAI,MAAM,KAAK,IAAI,CAAC,KAAK;AACvB;AAEF,UAAI,GAAG,IAAI;;AAEb,aAAS;AACT,WAAO;;AAGT,WAAS,YAAY,GAAG;AACtB,QAAIiS,UAAS,WAAU;AAEvB,aAAS,IAAI,GAAG,IAAIA,QAAO,QAAQ;AACjC,UAAI,EAAE,KAAKA,QAAO,CAAC,CAAC,MAAM,GAAG;AAC3B,YAAI,EAAE,KAAKA,QAAO,CAAC,CAAC,MAAM,GAAG;AAC3B,iBAAO;QACf,OAAa;AACL,iBAAO;;;AAIb,WAAO;;AAGT,WAAS,WAAW,GAAG;AACrB,QAAI,MAAMjS,IAAG,KAAK,CAAC;AACnB,WAAO,IAAI,MAAM,GAAG,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,EAAE,QAAO,EAAG,KAAK,CAAC,MAAM;;AAGhE,WAAS,UAAU,MAAM,KAAK;AAC5B,QAAI,OAAO,IAAI;AAEb,UAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,eAAO,IAAIA,IAAG,CAAC,KAAM,GAAI,CAAC;MAChC,OAAW;AACL,eAAO,IAAIA,IAAG,CAAC,KAAM,EAAI,CAAC;;;AAG9B,UAAM,IAAIA,IAAG,GAAG;AAEhB,QAAI,KAAK;AAET,WAAO,MAAM;AACX,YAAM,IAAIA,IAAGsE,aAAY,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC;AAC7C,aAAO,IAAI,UAAS,IAAK,MAAM;AAC7B,YAAI,MAAM,CAAC;;AAEb,UAAI,IAAI,OAAM,GAAI;AAChB,YAAI,KAAK,GAAG;;AAEd,UAAI,CAAC,IAAI,MAAM,CAAC,GAAG;AACjB,YAAI,KAAK,GAAG;;AAEd,UAAI,CAAC,IAAI,IAAI,GAAG,GAAG;AACjB,eAAO,IAAI,IAAI,UAAU,EAAE,IAAI,MAAM,GAAG;AACtC,cAAI,KAAK,IAAI;;iBAEN,CAAC,IAAI,IAAI,IAAI,GAAG;AACzB,eAAO,IAAI,IAAI,GAAG,EAAE,IAAI,KAAK,GAAG;AAC9B,cAAI,KAAK,IAAI;;;AAGjB,WAAK,IAAI,KAAK,CAAC;AACf,UAAI,YAAY,EAAE,KAAK,YAAY,GAAG,KACpC,WAAW,EAAE,KAAK,WAAW,GAAG,KAChC,YAAY,KAAK,EAAE,KAAK,YAAY,KAAK,GAAG,GAAG;AAC/C,eAAO;;;EAIb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACxGA,MAAItE,MAAKjC;AACT,MAAI,cAAcE,UAAA;AAClB,MAAI,cAAc,IAAI,YAAW;AACjC,MAAI,aAAa,IAAI+B,IAAG,EAAE;AAC1B,MAAI,SAAS,IAAIA,IAAG,EAAE;AACtB,MAAI,MAAM,IAAIA,IAAG,EAAE;AACnB,MAAI,QAAQ,IAAIA,IAAG,CAAC;AACpB,MAAI,QAAQ,IAAIA,IAAG,CAAC;AACpB,MAAI,SAAS4B,qBAAA;AACb,MAAI0C,eAAchC;AACJ,OAAG;AAEjB,WAAS,aAAa4P,MAAK,KAAK;AAC9B,UAAM,OAAO;AACb,QAAI,CAAChU,SAAAA,OAAO,SAASgU,IAAG,GAAG;AACzB,MAAAA,OAAM,IAAIhU,SAAAA,OAAOgU,MAAK,GAAG;;AAE3B,SAAK,OAAO,IAAIlS,IAAGkS,IAAG;AACtB,WAAO;;AAGT,WAAS,cAAcC,OAAM,KAAK;AAChC,UAAM,OAAO;AACb,QAAI,CAACjU,SAAAA,OAAO,SAASiU,KAAI,GAAG;AAC1B,MAAAA,QAAO,IAAIjU,SAAAA,OAAOiU,OAAM,GAAG;;AAE7B,SAAK,QAAQ,IAAInS,IAAGmS,KAAI;AACxB,WAAO;;AAGT,MAAI,aAAa,CAAA;AACjB,WAAS,WAAW,OAAO,WAAW;AACpC,QAAI,MAAM,UAAU,SAAS,KAAK;AAClC,QAAI,MAAM,CAAC,KAAK,MAAM,SAAS,EAAE,CAAC,EAAE,KAAK,GAAG;AAC5C,QAAI,OAAO,YAAY;AACrB,aAAO,WAAW,GAAG;;AAEvB,QAAIlO,SAAQ;AAEZ,QAAI,MAAM,OAAM,KACd,CAAC,OAAO,eACR,CAAC,OAAO,WAAW,KAAK,KACxB,CAAC,YAAY,KAAK,KAAK,GAAG;AAE1B,MAAAA,UAAS;AAET,UAAI,QAAQ,QAAQ,QAAQ,MAAM;AAGhC,QAAAA,UAAS;MACf,OAAW;AAGL,QAAAA,UAAS;;AAEX,iBAAW,GAAG,IAAIA;AAClB,aAAOA;;AAET,QAAI,CAAC,YAAY,KAAK,MAAM,KAAK,CAAC,CAAC,GAAG;AAEpC,MAAAA,UAAS;;AAEX,QAAI;AACJ,YAAQ,KAAG;MACT,KAAK;AACH,YAAI,MAAM,IAAI,UAAU,EAAE,IAAI,MAAM,GAAG;AAErC,UAAAA,UAAS;;AAEX;MACF,KAAK;AACH,cAAM,MAAM,IAAI,GAAG;AACnB,YAAI,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,GAAG;AAEpC,UAAAA,UAAS;;AAEX;MACF;AACE,QAAAA,UAAS;;AAEb,eAAW,GAAG,IAAIA;AAClB,WAAOA;;AAGT,WAAS,GAAG,OAAO,WAAW,WAAW;AACvC,SAAK,aAAa,SAAS;AAC3B,SAAK,UAAU,IAAIjE,IAAG,KAAK;AAC3B,SAAK,SAASA,IAAG,KAAK,KAAK,OAAO;AAClC,SAAK,YAAY,MAAM;AACvB,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,QAAI,WAAW;AACb,WAAK,eAAe;AACpB,WAAK,gBAAgB;IACzB,OAAS;AACL,WAAK,aAAa;;;AAGtB,SAAO,eAAe,GAAG,WAAW,eAAe;IACjD,YAAY;IACZ,KAAK,WAAY;AACf,UAAI,OAAO,KAAK,eAAe,UAAU;AACvC,aAAK,aAAa,WAAW,KAAK,SAAS,KAAK,KAAK;;AAEvD,aAAO,KAAK;;EAEhB,CAAC;AACD,KAAG,UAAU,eAAe,WAAY;AACtC,QAAI,CAAC,KAAK,OAAO;AACf,WAAK,QAAQ,IAAIA,IAAGsE,aAAY,KAAK,SAAS,CAAC;;AAEjD,SAAK,OAAO,KAAK,KAAK,MAAM,KAAK,MAAM,EAAE,OAAO,KAAK,KAAK,EAAE,QAAO;AACnE,WAAO,KAAK,aAAY;EAC1B;AAEA,KAAG,UAAU,gBAAgB,SAAU,OAAO;AAC5C,YAAQ,IAAItE,IAAG,KAAK;AACpB,YAAQ,MAAM,MAAM,KAAK,MAAM;AAC/B,QAAIoS,UAAS,MAAM,OAAO,KAAK,KAAK,EAAE,QAAO;AAC7C,QAAI,MAAM,IAAIlU,SAAAA,OAAOkU,QAAO,QAAO,CAAE;AACrC,QAAI,QAAQ,KAAK,SAAQ;AACzB,QAAI,IAAI,SAAS,MAAM,QAAQ;AAC7B,UAAI,QAAQ,IAAIlU,SAAAA,OAAO,MAAM,SAAS,IAAI,MAAM;AAChD,YAAM,KAAK,CAAC;AACZ,YAAMA,SAAAA,OAAO,OAAO,CAAC,OAAO,GAAG,CAAC;;AAElC,WAAO;EACT;AAEA,KAAG,UAAU,eAAe,SAAS,aAAa,KAAK;AACrD,WAAO,kBAAkB,KAAK,MAAM,GAAG;EACzC;AAEA,KAAG,UAAU,gBAAgB,SAAS,cAAc,KAAK;AACvD,WAAO,kBAAkB,KAAK,OAAO,GAAG;EAC1C;AAEA,KAAG,UAAU,WAAW,SAAU,KAAK;AACrC,WAAO,kBAAkB,KAAK,SAAS,GAAG;EAC5C;AAEA,KAAG,UAAU,eAAe,SAAU,KAAK;AACzC,WAAO,kBAAkB,KAAK,MAAM,GAAG;EACzC;AAEA,KAAG,UAAU,eAAe,SAAU,KAAK,KAAK;AAC9C,UAAM,OAAO;AACb,QAAI,CAACA,SAAAA,OAAO,SAAS,GAAG,GAAG;AACzB,YAAM,IAAIA,SAAAA,OAAO,KAAK,GAAG;;AAE3B,SAAK,QAAQ;AACb,SAAK,OAAO,IAAI8B,IAAG,GAAG;AACtB,WAAO;EACT;AAEA,WAAS,kBAAkB+R,KAAI,KAAK;AAClC,QAAI,MAAM,IAAI7T,SAAAA,OAAO6T,IAAG,QAAO,CAAE;AACjC,QAAI,CAAC,KAAK;AACR,aAAO;IACX,OAAS;AACL,aAAO,IAAI,SAAS,GAAG;;EAE3B;;;;;;;ACnKA,MAAIM,iBAAgBtU,qBAA8B;AAClD,MAAI,SAASE;AAEb,MAAI,KAAK2D,UAAmB;AAE5B,WAAS,iBAAkBvB,MAAK;AAC9B,QAAI,QAAQ,IAAInC,SAAAA,OAAO,OAAOmC,IAAG,EAAE,OAAO,KAAK;AAC/C,QAAI,MAAM,IAAInC,SAAAA,OAAO,OAAOmC,IAAG,EAAE,KAAK,KAAK;AAE3C,WAAO,IAAI,GAAG,OAAO,GAAG;;AAG1B,MAAI,YAAY;IACd,UAAU;IAAM,OAAO;IAAM,UAAU;;AAGzC,WAAS,oBAAqB,OAAO,KAAK,WAAW,MAAM;AACzD,QAAInC,SAAAA,OAAO,SAAS,GAAG,KAAK,UAAU,GAAG,MAAM,QAAW;AACxD,aAAO,oBAAoB,OAAO,UAAU,KAAK,SAAS;;AAG5D,UAAM,OAAO;AACb,WAAO,QAAQ;AACf,gBAAY,aAAa,IAAIA,SAAAA,OAAO,CAAC,CAAC,CAAC;AAEvC,QAAI,CAACA,SAAAA,OAAO,SAAS,SAAS,GAAG;AAC/B,kBAAY,IAAIA,SAAAA,OAAO,WAAW,IAAI;;AAGxC,QAAI,OAAO,UAAU,UAAU;AAC7B,aAAO,IAAI,GAAGmU,eAAc,OAAO,SAAS,GAAG,WAAW,IAAI;;AAGhE,QAAI,CAACnU,SAAAA,OAAO,SAAS,KAAK,GAAG;AAC3B,cAAQ,IAAIA,SAAAA,OAAO,OAAO,GAAG;;AAG/B,WAAO,IAAI,GAAG,OAAO,WAAW,IAAI;;AAGtC0H,YAAA,qBAA6BA,UAAA,2BAAmCA,UAAA,mBAA2B;AAChEA,YAAA,sBAAGA,UAAAA,gBAAwB;;;;;;;ACzCtD,GAAC,SAAU/F,SAAQ,SAAS;AAI1B,aAASC,QAAQ,KAAK,KAAK;AACzB,UAAI,CAAC,IAAK,OAAM,IAAI,MAAM,OAAO,kBAAkB;;AAKrD,aAASC,UAAU,MAAM,WAAW;AAClC,WAAK,SAAS;AACd,UAAI,WAAW,WAAY;MAAA;AAC3B,eAAS,YAAY,UAAU;AAC/B,WAAK,YAAY,IAAI,SAAQ;AAC7B,WAAK,UAAU,cAAc;;AAK/B,aAASC,IAAI,QAAQC,OAAM,QAAQ;AACjC,UAAID,IAAG,KAAK,MAAM,GAAG;AACnB,eAAO;;AAGT,WAAK,WAAW;AAChB,WAAK,QAAQ;AACb,WAAK,SAAS;AAGd,WAAK,MAAM;AAEX,UAAI,WAAW,MAAM;AACnB,YAAIC,UAAS,QAAQA,UAAS,MAAM;AAClC,mBAASA;AACT,UAAAA,QAAO;;AAGT,aAAK,MAAM,UAAU,GAAGA,SAAQ,IAAI,UAAU,IAAI;;;AAGtD,QAAI,OAAOJ,YAAW,UAAU;AAC9B,MAAAA,QAAO,UAAUG;IACrB,OAAS;AACL,cAAQ,KAAKA;;AAGf,IAAAA,IAAG,KAAKA;AACR,IAAAA,IAAG,WAAW;AAEd,QAAI9B;AACJ,QAAI;AACF,UAAI,OAAO,WAAW,eAAe,OAAO,OAAO,WAAW,aAAa;AACzE,QAAAA,UAAS,OAAO;MACtB,OAAW;AACL,QAAAA,UAASH,aAAkB;;aAEtB,GAAG;;AAGZ,IAAAiC,IAAG,OAAO,SAAS,KAAM,KAAK;AAC5B,UAAI,eAAeA,KAAI;AACrB,eAAO;;AAGT,aAAO,QAAQ,QAAQ,OAAO,QAAQ,YACpC,IAAI,YAAY,aAAaA,IAAG,YAAY,MAAM,QAAQ,IAAI,KAAK;IACzE;AAEE,IAAAA,IAAG,MAAM,SAASpB,KAAK,MAAM,OAAO;AAClC,UAAI,KAAK,IAAI,KAAK,IAAI,EAAG,QAAO;AAChC,aAAO;IACX;AAEE,IAAAoB,IAAG,MAAM,SAASd,KAAK,MAAM,OAAO;AAClC,UAAI,KAAK,IAAI,KAAK,IAAI,EAAG,QAAO;AAChC,aAAO;IACX;AAEE,IAAAc,IAAG,UAAU,QAAQ,SAASE,MAAM,QAAQD,OAAM,QAAQ;AACxD,UAAI,OAAO,WAAW,UAAU;AAC9B,eAAO,KAAK,YAAY,QAAQA,OAAM,MAAM;;AAG9C,UAAI,OAAO,WAAW,UAAU;AAC9B,eAAO,KAAK,WAAW,QAAQA,OAAM,MAAM;;AAG7C,UAAIA,UAAS,OAAO;AAClB,QAAAA,QAAO;;AAET,MAAAH,QAAOG,WAAUA,QAAO,MAAMA,SAAQ,KAAKA,SAAQ,EAAE;AAErD,eAAS,OAAO,SAAQ,EAAG,QAAQ,QAAQ,EAAE;AAC7C,UAAI,QAAQ;AACZ,UAAI,OAAO,CAAC,MAAM,KAAK;AACrB;AACA,aAAK,WAAW;;AAGlB,UAAI,QAAQ,OAAO,QAAQ;AACzB,YAAIA,UAAS,IAAI;AACf,eAAK,UAAU,QAAQ,OAAO,MAAM;QAC5C,OAAa;AACL,eAAK,WAAW,QAAQA,OAAM,KAAK;AACnC,cAAI,WAAW,MAAM;AACnB,iBAAK,WAAW,KAAK,QAAO,GAAIA,OAAM,MAAM;;;;IAItD;AAEE,IAAAD,IAAG,UAAU,cAAc,SAAS,YAAa,QAAQC,OAAM,QAAQ;AACrE,UAAI,SAAS,GAAG;AACd,aAAK,WAAW;AAChB,iBAAS,CAAC;;AAEZ,UAAI,SAAS,UAAW;AACtB,aAAK,QAAQ,CAAC,SAAS,QAAS;AAChC,aAAK,SAAS;MACpB,WAAe,SAAS,kBAAkB;AACpC,aAAK,QAAQ;UACX,SAAS;UACR,SAAS,WAAa;QAC/B;AACM,aAAK,SAAS;MACpB,OAAW;AACL,QAAAH,QAAO,SAAS,gBAAgB;AAChC,aAAK,QAAQ;UACX,SAAS;UACR,SAAS,WAAa;UACvB;QACR;AACM,aAAK,SAAS;;AAGhB,UAAI,WAAW,KAAM;AAGrB,WAAK,WAAW,KAAK,QAAO,GAAIG,OAAM,MAAM;IAChD;AAEE,IAAAD,IAAG,UAAU,aAAa,SAAS,WAAY,QAAQC,OAAM,QAAQ;AAEnE,MAAAH,QAAO,OAAO,OAAO,WAAW,QAAQ;AACxC,UAAI,OAAO,UAAU,GAAG;AACtB,aAAK,QAAQ,CAAC,CAAC;AACf,aAAK,SAAS;AACd,eAAO;;AAGT,WAAK,SAAS,KAAK,KAAK,OAAO,SAAS,CAAC;AACzC,WAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;AAClC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,aAAK,MAAM,CAAC,IAAI;;AAGlB,UAAI,GAAG;AACP,UAAI,MAAM;AACV,UAAI,WAAW,MAAM;AACnB,aAAK,IAAI,OAAO,SAAS,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG;AACjD,cAAI,OAAO,CAAC,IAAK,OAAO,IAAI,CAAC,KAAK,IAAM,OAAO,IAAI,CAAC,KAAK;AACzD,eAAK,MAAM,CAAC,KAAM,KAAK,MAAO;AAC9B,eAAK,MAAM,IAAI,CAAC,IAAK,MAAO,KAAK,MAAQ;AACzC,iBAAO;AACP,cAAI,OAAO,IAAI;AACb,mBAAO;AACP;;;MAGV,WAAe,WAAW,MAAM;AAC1B,aAAK,IAAI,GAAG,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC5C,cAAI,OAAO,CAAC,IAAK,OAAO,IAAI,CAAC,KAAK,IAAM,OAAO,IAAI,CAAC,KAAK;AACzD,eAAK,MAAM,CAAC,KAAM,KAAK,MAAO;AAC9B,eAAK,MAAM,IAAI,CAAC,IAAK,MAAO,KAAK,MAAQ;AACzC,iBAAO;AACP,cAAI,OAAO,IAAI;AACb,mBAAO;AACP;;;;AAIN,aAAO,KAAK,OAAM;IACtB;AAEE,aAAS,cAAe,QAAQK,QAAO;AACrC,UAAI,IAAI,OAAO,WAAWA,MAAK;AAE/B,UAAI,KAAK,MAAM,KAAK,IAAI;AACtB,eAAO,IAAI;iBAEF,KAAK,MAAM,KAAK,IAAI;AAC7B,eAAO,IAAI;iBAEF,KAAK,MAAM,KAAK,KAAK;AAC9B,eAAO,IAAI;MACjB,OAAW;AACL,QAAAL,QAAO,OAAO,0BAA0B,MAAM;;;AAIlD,aAAS,aAAc,QAAQ,YAAYK,QAAO;AAChD,UAAIC,KAAI,cAAc,QAAQD,MAAK;AACnC,UAAIA,SAAQ,KAAK,YAAY;AAC3B,QAAAC,MAAK,cAAc,QAAQD,SAAQ,CAAC,KAAK;;AAE3C,aAAOC;;AAGT,IAAAJ,IAAG,UAAU,YAAY,SAAS,UAAW,QAAQ,OAAO,QAAQ;AAElE,WAAK,SAAS,KAAK,MAAM,OAAO,SAAS,SAAS,CAAC;AACnD,WAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;AAClC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,aAAK,MAAM,CAAC,IAAI;;AAIlB,UAAI,MAAM;AACV,UAAI,IAAI;AAER,UAAI;AACJ,UAAI,WAAW,MAAM;AACnB,aAAK,IAAI,OAAO,SAAS,GAAG,KAAK,OAAO,KAAK,GAAG;AAC9C,cAAI,aAAa,QAAQ,OAAO,CAAC,KAAK;AACtC,eAAK,MAAM,CAAC,KAAK,IAAI;AACrB,cAAI,OAAO,IAAI;AACb,mBAAO;AACP,iBAAK;AACL,iBAAK,MAAM,CAAC,KAAK,MAAM;UACjC,OAAe;AACL,mBAAO;;;MAGjB,OAAW;AACL,YAAI,cAAc,OAAO,SAAS;AAClC,aAAK,IAAI,cAAc,MAAM,IAAI,QAAQ,IAAI,OAAO,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC7E,cAAI,aAAa,QAAQ,OAAO,CAAC,KAAK;AACtC,eAAK,MAAM,CAAC,KAAK,IAAI;AACrB,cAAI,OAAO,IAAI;AACb,mBAAO;AACP,iBAAK;AACL,iBAAK,MAAM,CAAC,KAAK,MAAM;UACjC,OAAe;AACL,mBAAO;;;;AAKb,WAAK,OAAM;IACf;AAEE,aAAS,UAAW,KAAK,OAAO,KAAKjB,MAAK;AACxC,UAAIqB,KAAI;AACR,UAAI,IAAI;AACR,UAAI,MAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAClC,eAAS,IAAI,OAAO,IAAI,KAAK,KAAK;AAChC,YAAI,IAAI,IAAI,WAAW,CAAC,IAAI;AAE5B,QAAAA,MAAKrB;AAGL,YAAI,KAAK,IAAI;AACX,cAAI,IAAI,KAAK;QAGrB,WAAiB,KAAK,IAAI;AAClB,cAAI,IAAI,KAAK;QAGrB,OAAa;AACL,cAAI;;AAEN,QAAAe,QAAO,KAAK,KAAK,IAAIf,MAAK,mBAAmB;AAC7C,QAAAqB,MAAK;;AAEP,aAAOA;;AAGT,IAAAJ,IAAG,UAAU,aAAa,SAAS,WAAY,QAAQC,OAAM,OAAO;AAElE,WAAK,QAAQ,CAAC,CAAC;AACf,WAAK,SAAS;AAGd,eAAS,UAAU,GAAG,UAAU,GAAG,WAAW,UAAW,WAAWA,OAAM;AACxE;;AAEF;AACA,gBAAW,UAAUA,QAAQ;AAE7B,UAAI,QAAQ,OAAO,SAAS;AAC5B,UAAII,OAAM,QAAQ;AAClB,UAAI,MAAM,KAAK,IAAI,OAAO,QAAQA,IAAG,IAAI;AAEzC,UAAI,OAAO;AACX,eAAS,IAAI,OAAO,IAAI,KAAK,KAAK,SAAS;AACzC,eAAO,UAAU,QAAQ,GAAG,IAAI,SAASJ,KAAI;AAE7C,aAAK,MAAM,OAAO;AAClB,YAAI,KAAK,MAAM,CAAC,IAAI,OAAO,UAAW;AACpC,eAAK,MAAM,CAAC,KAAK;QACzB,OAAa;AACL,eAAK,OAAO,IAAI;;;AAIpB,UAAII,SAAQ,GAAG;AACb,YAAIC,OAAM;AACV,eAAO,UAAU,QAAQ,GAAG,OAAO,QAAQL,KAAI;AAE/C,aAAK,IAAI,GAAG,IAAII,MAAK,KAAK;AACxB,UAAAC,QAAOL;;AAGT,aAAK,MAAMK,IAAG;AACd,YAAI,KAAK,MAAM,CAAC,IAAI,OAAO,UAAW;AACpC,eAAK,MAAM,CAAC,KAAK;QACzB,OAAa;AACL,eAAK,OAAO,IAAI;;;AAIpB,WAAK,OAAM;IACf;AAEE,IAAAN,IAAG,UAAU,OAAO,SAAS,KAAM,MAAM;AACvC,WAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;AAClC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,aAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC;;AAE9B,WAAK,SAAS,KAAK;AACnB,WAAK,WAAW,KAAK;AACrB,WAAK,MAAM,KAAK;IACpB;AAEE,aAAS,KAAM,MAAM,KAAK;AACxB,WAAK,QAAQ,IAAI;AACjB,WAAK,SAAS,IAAI;AAClB,WAAK,WAAW,IAAI;AACpB,WAAK,MAAM,IAAI;;AAGjB,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AACzC,WAAK,MAAM,IAAI;IACnB;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAASO,SAAS;AACrC,UAAIH,KAAI,IAAIJ,IAAG,IAAI;AACnB,WAAK,KAAKI,EAAC;AACX,aAAOA;IACX;AAEE,IAAAJ,IAAG,UAAU,UAAU,SAAS,QAAS,MAAM;AAC7C,aAAO,KAAK,SAAS,MAAM;AACzB,aAAK,MAAM,KAAK,QAAQ,IAAI;;AAE9B,aAAO;IACX;AAGE,IAAAA,IAAG,UAAU,SAAS,SAAS,QAAS;AACtC,aAAO,KAAK,SAAS,KAAK,KAAK,MAAM,KAAK,SAAS,CAAC,MAAM,GAAG;AAC3D,aAAK;;AAEP,aAAO,KAAK,UAAS;IACzB;AAEE,IAAAA,IAAG,UAAU,YAAY,SAAS,YAAa;AAE7C,UAAI,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,MAAM,GAAG;AAC5C,aAAK,WAAW;;AAElB,aAAO;IACX;AAIE,QAAI,OAAO,WAAW,eAAe,OAAO,OAAO,QAAQ,YAAY;AACrE,UAAI;AACF,QAAAA,IAAG,UAAU,uBAAO,IAAI,4BAA4B,CAAC,IAAIrB;eAClD,GAAG;AACV,QAAAqB,IAAG,UAAU,UAAUrB;;IAE7B,OAAS;AACL,MAAAqB,IAAG,UAAU,UAAUrB;;AAGzB,aAASA,WAAW;AAClB,cAAQ,KAAK,MAAM,YAAY,WAAW,KAAK,SAAS,EAAE,IAAI;;AAiChE,QAAI,QAAQ;MACV;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;MACA;IACJ;AAEE,QAAI,aAAa;MACf;MAAG;MACH;MAAI;MAAI;MAAI;MAAI;MAAI;MAAG;MACvB;MAAG;MAAG;MAAG;MAAG;MAAG;MAAG;MAClB;MAAG;MAAG;MAAG;MAAG;MAAG;MAAG;MAClB;MAAG;MAAG;MAAG;MAAG;MAAG;MAAG;MAClB;MAAG;MAAG;MAAG;MAAG;MAAG;MAAG;IACtB;AAEE,QAAI,aAAa;MACf;MAAG;MACH;MAAU;MAAU;MAAU;MAAU;MAAU;MAAU;MAC5D;MAAU;MAAU;MAAU;MAAU;MAAU;MAAS;MAC3D;MAAU;MAAU;MAAU;MAAU;MAAU;MAAS;MAC3D;MAAS;MAAS;MAAS;MAAU;MAAU;MAAU;MACzD;MAAU;MAAU;MAAU;MAAU;MAAU;MAAU;IAChE;AAEE,IAAAqB,IAAG,UAAU,WAAW,SAAStB,UAAUuB,OAAM,SAAS;AACxD,MAAAA,QAAOA,SAAQ;AACf,gBAAU,UAAU,KAAK;AAEzB,UAAI;AACJ,UAAIA,UAAS,MAAMA,UAAS,OAAO;AACjC,cAAM;AACN,YAAI,MAAM;AACV,YAAI,QAAQ;AACZ,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAI,IAAI,KAAK,MAAM,CAAC;AACpB,cAAI,SAAU,KAAK,MAAO,SAAS,UAAU,SAAS,EAAE;AACxD,kBAAS,MAAO,KAAK,MAAQ;AAC7B,iBAAO;AACP,cAAI,OAAO,IAAI;AACb,mBAAO;AACP;;AAEF,cAAI,UAAU,KAAK,MAAM,KAAK,SAAS,GAAG;AACxC,kBAAM,MAAM,IAAI,KAAK,MAAM,IAAI,OAAO;UAChD,OAAe;AACL,kBAAM,OAAO;;;AAGjB,YAAI,UAAU,GAAG;AACf,gBAAM,MAAM,SAAS,EAAE,IAAI;;AAE7B,eAAO,IAAI,SAAS,YAAY,GAAG;AACjC,gBAAM,MAAM;;AAEd,YAAI,KAAK,aAAa,GAAG;AACvB,gBAAM,MAAM;;AAEd,eAAO;;AAGT,UAAIA,WAAUA,QAAO,MAAMA,SAAQ,KAAKA,SAAQ,IAAI;AAElD,YAAI,YAAY,WAAWA,KAAI;AAE/B,YAAI,YAAY,WAAWA,KAAI;AAC/B,cAAM;AACN,YAAI,IAAI,KAAK,MAAK;AAClB,UAAE,WAAW;AACb,eAAO,CAAC,EAAE,OAAM,GAAI;AAClB,cAAIG,KAAI,EAAE,MAAM,SAAS,EAAE,SAASH,KAAI;AACxC,cAAI,EAAE,MAAM,SAAS;AAErB,cAAI,CAAC,EAAE,OAAM,GAAI;AACf,kBAAM,MAAM,YAAYG,GAAE,MAAM,IAAIA,KAAI;UAClD,OAAe;AACL,kBAAMA,KAAI;;;AAGd,YAAI,KAAK,OAAM,GAAI;AACjB,gBAAM,MAAM;;AAEd,eAAO,IAAI,SAAS,YAAY,GAAG;AACjC,gBAAM,MAAM;;AAEd,YAAI,KAAK,aAAa,GAAG;AACvB,gBAAM,MAAM;;AAEd,eAAO;;AAGT,MAAAN,QAAO,OAAO,iCAAiC;IACnD;AAEE,IAAAE,IAAG,UAAU,WAAW,SAAS,WAAY;AAC3C,UAAI,MAAM,KAAK,MAAM,CAAC;AACtB,UAAI,KAAK,WAAW,GAAG;AACrB,eAAO,KAAK,MAAM,CAAC,IAAI;MAC7B,WAAe,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,MAAM,GAAM;AAEtD,eAAO,mBAAoB,KAAK,MAAM,CAAC,IAAI;MACjD,WAAe,KAAK,SAAS,GAAG;AAC1B,QAAAF,QAAO,OAAO,4CAA4C;;AAE5D,aAAQ,KAAK,aAAa,IAAK,CAAC,MAAM;IAC1C;AAEE,IAAAE,IAAG,UAAU,SAAS,SAASlB,UAAU;AACvC,aAAO,KAAK,SAAS,IAAI,CAAC;IAC9B;AAEE,QAAIZ,SAAQ;AACV,MAAA8B,IAAG,UAAU,WAAW,SAASQ,UAAU,QAAQ,QAAQ;AACzD,eAAO,KAAK,YAAYtC,SAAQ,QAAQ,MAAM;MACpD;;AAGE,IAAA8B,IAAG,UAAU,UAAU,SAASS,SAAS,QAAQ,QAAQ;AACvD,aAAO,KAAK,YAAY,OAAO,QAAQ,MAAM;IACjD;AAEE,QAAI,WAAW,SAAS6R,UAAU,WAAW,MAAM;AACjD,UAAI,UAAU,aAAa;AACzB,eAAO,UAAU,YAAY,IAAI;;AAEnC,aAAO,IAAI,UAAU,IAAI;IAC7B;AAEE,IAAAtS,IAAG,UAAU,cAAc,SAAS,YAAa,WAAW,QAAQ,QAAQ;AAC1E,WAAK,OAAM;AAEX,UAAI3B,cAAa,KAAK,WAAU;AAChC,UAAI,YAAY,UAAU,KAAK,IAAI,GAAGA,WAAU;AAChD,MAAAyB,QAAOzB,eAAc,WAAW,uCAAuC;AACvE,MAAAyB,QAAO,YAAY,GAAG,6BAA6B;AAEnD,UAAI,MAAM,SAAS,WAAW,SAAS;AACvC,UAAI,UAAU,WAAW,OAAO,OAAO;AACvC,WAAK,iBAAiB,OAAO,EAAE,KAAKzB,WAAU;AAC9C,aAAO;IACX;AAEE,IAAA2B,IAAG,UAAU,iBAAiB,SAAS,eAAgB,KAAK3B,aAAY;AACtE,UAAI,WAAW;AACf,UAAI,QAAQ;AAEZ,eAAS,IAAI,GAAG,QAAQ,GAAG,IAAI,KAAK,QAAQ,KAAK;AAC/C,YAAI,OAAQ,KAAK,MAAM,CAAC,KAAK,QAAS;AAEtC,YAAI,UAAU,IAAI,OAAO;AACzB,YAAI,WAAW,IAAI,QAAQ;AACzB,cAAI,UAAU,IAAK,QAAQ,IAAK;;AAElC,YAAI,WAAW,IAAI,QAAQ;AACzB,cAAI,UAAU,IAAK,QAAQ,KAAM;;AAGnC,YAAI,UAAU,GAAG;AACf,cAAI,WAAW,IAAI,QAAQ;AACzB,gBAAI,UAAU,IAAK,QAAQ,KAAM;;AAEnC,kBAAQ;AACR,kBAAQ;QAChB,OAAa;AACL,kBAAQ,SAAS;AACjB,mBAAS;;;AAIb,UAAI,WAAW,IAAI,QAAQ;AACzB,YAAI,UAAU,IAAI;AAElB,eAAO,WAAW,IAAI,QAAQ;AAC5B,cAAI,UAAU,IAAI;;;IAG1B;AAEE,IAAA2B,IAAG,UAAU,iBAAiB,SAAS,eAAgB,KAAK3B,aAAY;AACtE,UAAI,WAAW,IAAI,SAAS;AAC5B,UAAI,QAAQ;AAEZ,eAAS,IAAI,GAAG,QAAQ,GAAG,IAAI,KAAK,QAAQ,KAAK;AAC/C,YAAI,OAAQ,KAAK,MAAM,CAAC,KAAK,QAAS;AAEtC,YAAI,UAAU,IAAI,OAAO;AACzB,YAAI,YAAY,GAAG;AACjB,cAAI,UAAU,IAAK,QAAQ,IAAK;;AAElC,YAAI,YAAY,GAAG;AACjB,cAAI,UAAU,IAAK,QAAQ,KAAM;;AAGnC,YAAI,UAAU,GAAG;AACf,cAAI,YAAY,GAAG;AACjB,gBAAI,UAAU,IAAK,QAAQ,KAAM;;AAEnC,kBAAQ;AACR,kBAAQ;QAChB,OAAa;AACL,kBAAQ,SAAS;AACjB,mBAAS;;;AAIb,UAAI,YAAY,GAAG;AACjB,YAAI,UAAU,IAAI;AAElB,eAAO,YAAY,GAAG;AACpB,cAAI,UAAU,IAAI;;;IAG1B;AAEE,QAAI,KAAK,OAAO;AACd,MAAA2B,IAAG,UAAU,aAAa,SAAS,WAAY,GAAG;AAChD,eAAO,KAAK,KAAK,MAAM,CAAC;MAC9B;IACA,OAAS;AACL,MAAAA,IAAG,UAAU,aAAa,SAAS,WAAY,GAAG;AAChD,YAAI,IAAI;AACR,YAAII,KAAI;AACR,YAAI,KAAK,MAAQ;AACf,UAAAA,MAAK;AACL,iBAAO;;AAET,YAAI,KAAK,IAAM;AACb,UAAAA,MAAK;AACL,iBAAO;;AAET,YAAI,KAAK,GAAK;AACZ,UAAAA,MAAK;AACL,iBAAO;;AAET,YAAI,KAAK,GAAM;AACb,UAAAA,MAAK;AACL,iBAAO;;AAET,eAAOA,KAAI;MACjB;;AAGE,IAAAJ,IAAG,UAAU,YAAY,SAAS,UAAW,GAAG;AAE9C,UAAI,MAAM,EAAG,QAAO;AAEpB,UAAI,IAAI;AACR,UAAII,KAAI;AACR,WAAK,IAAI,UAAY,GAAG;AACtB,QAAAA,MAAK;AACL,eAAO;;AAET,WAAK,IAAI,SAAU,GAAG;AACpB,QAAAA,MAAK;AACL,eAAO;;AAET,WAAK,IAAI,QAAS,GAAG;AACnB,QAAAA,MAAK;AACL,eAAO;;AAET,WAAK,IAAI,OAAS,GAAG;AACnB,QAAAA,MAAK;AACL,eAAO;;AAET,WAAK,IAAI,OAAS,GAAG;AACnB,QAAAA;;AAEF,aAAOA;IACX;AAGE,IAAAJ,IAAG,UAAU,YAAY,SAAS,YAAa;AAC7C,UAAI,IAAI,KAAK,MAAM,KAAK,SAAS,CAAC;AAClC,UAAI,KAAK,KAAK,WAAW,CAAC;AAC1B,cAAQ,KAAK,SAAS,KAAK,KAAK;IACpC;AAEE,aAAS,WAAY,KAAK;AACxB,UAAI,IAAI,IAAI,MAAM,IAAI,UAAS,CAAE;AAEjC,eAAS,MAAM,GAAG,MAAM,EAAE,QAAQ,OAAO;AACvC,YAAI,MAAO,MAAM,KAAM;AACvB,YAAI,OAAO,MAAM;AAEjB,UAAE,GAAG,IAAK,IAAI,MAAM,GAAG,MAAM,OAAQ;;AAGvC,aAAO;;AAIT,IAAAA,IAAG,UAAU,WAAW,SAAS,WAAY;AAC3C,UAAI,KAAK,OAAM,EAAI,QAAO;AAE1B,UAAII,KAAI;AACR,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAI,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,CAAC;AACpC,QAAAA,MAAK;AACL,YAAI,MAAM,GAAI;;AAEhB,aAAOA;IACX;AAEE,IAAAJ,IAAG,UAAU,aAAa,SAAS3B,cAAc;AAC/C,aAAO,KAAK,KAAK,KAAK,UAAS,IAAK,CAAC;IACzC;AAEE,IAAA2B,IAAG,UAAU,SAAS,SAAS,OAAQ,OAAO;AAC5C,UAAI,KAAK,aAAa,GAAG;AACvB,eAAO,KAAK,IAAG,EAAG,MAAM,KAAK,EAAE,MAAM,CAAC;;AAExC,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAA,IAAG,UAAU,WAAW,SAAS,SAAU,OAAO;AAChD,UAAI,KAAK,MAAM,QAAQ,CAAC,GAAG;AACzB,eAAO,KAAK,KAAK,KAAK,EAAE,MAAM,CAAC,EAAE,KAAI;;AAEvC,aAAO,KAAK,MAAK;IACrB;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,QAAS;AACrC,aAAO,KAAK,aAAa;IAC7B;AAGE,IAAAA,IAAG,UAAU,MAAM,SAASU,OAAO;AACjC,aAAO,KAAK,MAAK,EAAG,KAAI;IAC5B;AAEE,IAAAV,IAAG,UAAU,OAAO,SAAS,OAAQ;AACnC,UAAI,CAAC,KAAK,OAAM,GAAI;AAClB,aAAK,YAAY;;AAGnB,aAAO;IACX;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,SAAS,IAAI,QAAQ;AAC/B,aAAK,MAAM,KAAK,QAAQ,IAAI;;AAG9B,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,aAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC;;AAG7C,aAAO,KAAK,OAAM;IACtB;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,MAAAF,SAAQ,KAAK,WAAW,IAAI,cAAc,CAAC;AAC3C,aAAO,KAAK,KAAK,GAAG;IACxB;AAGE,IAAAE,IAAG,UAAU,KAAK,SAAS,GAAI,KAAK;AAClC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,IAAI,GAAG;AACzD,aAAO,IAAI,MAAK,EAAG,IAAI,IAAI;IAC/B;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,KAAK,GAAG;AAC1D,aAAO,IAAI,MAAK,EAAG,KAAK,IAAI;IAChC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AAExC,UAAI;AACJ,UAAI,KAAK,SAAS,IAAI,QAAQ;AAC5B,YAAI;MACV,OAAW;AACL,YAAI;;AAGN,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,aAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC;;AAG7C,WAAK,SAAS,EAAE;AAEhB,aAAO,KAAK,OAAM;IACtB;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,MAAAF,SAAQ,KAAK,WAAW,IAAI,cAAc,CAAC;AAC3C,aAAO,KAAK,MAAM,GAAG;IACzB;AAGE,IAAAE,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,KAAK,GAAG;AAC1D,aAAO,IAAI,MAAK,EAAG,KAAK,IAAI;IAChC;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,MAAM,GAAG;AAC3D,aAAO,IAAI,MAAK,EAAG,MAAM,IAAI;IACjC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AAExC,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK,SAAS,IAAI,QAAQ;AAC5B,YAAI;AACJ,YAAI;MACV,OAAW;AACL,YAAI;AACJ,YAAI;;AAGN,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,aAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;;AAGxC,UAAI,SAAS,GAAG;AACd,eAAO,IAAI,EAAE,QAAQ,KAAK;AACxB,eAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;;;AAI7B,WAAK,SAAS,EAAE;AAEhB,aAAO,KAAK,OAAM;IACtB;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,MAAAF,SAAQ,KAAK,WAAW,IAAI,cAAc,CAAC;AAC3C,aAAO,KAAK,MAAM,GAAG;IACzB;AAGE,IAAAE,IAAG,UAAU,MAAM,SAASW,KAAK,KAAK;AACpC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,KAAK,GAAG;AAC1D,aAAO,IAAI,MAAK,EAAG,KAAK,IAAI;IAChC;AAEE,IAAAX,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,MAAM,GAAG;AAC3D,aAAO,IAAI,MAAK,EAAG,MAAM,IAAI;IACjC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,OAAO;AAC1C,MAAAF,QAAO,OAAO,UAAU,YAAY,SAAS,CAAC;AAE9C,UAAI,cAAc,KAAK,KAAK,QAAQ,EAAE,IAAI;AAC1C,UAAI,WAAW,QAAQ;AAGvB,WAAK,QAAQ,WAAW;AAExB,UAAI,WAAW,GAAG;AAChB;;AAIF,eAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,aAAK,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI;;AAInC,UAAI,WAAW,GAAG;AAChB,aAAK,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,IAAK,YAAc,KAAK;;AAIvD,aAAO,KAAK,OAAM;IACtB;AAEE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,OAAO;AACxC,aAAO,KAAK,MAAK,EAAG,MAAM,KAAK;IACnC;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK,KAAK;AAC3C,MAAAF,QAAO,OAAO,QAAQ,YAAY,OAAO,CAAC;AAE1C,UAAI,MAAO,MAAM,KAAM;AACvB,UAAI,OAAO,MAAM;AAEjB,WAAK,QAAQ,MAAM,CAAC;AAEpB,UAAI,KAAK;AACP,aAAK,MAAM,GAAG,IAAI,KAAK,MAAM,GAAG,IAAK,KAAK;MAChD,OAAW;AACL,aAAK,MAAM,GAAG,IAAI,KAAK,MAAM,GAAG,IAAI,EAAE,KAAK;;AAG7C,aAAO,KAAK,OAAM;IACtB;AAGE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,UAAII;AAGJ,UAAI,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AAC7C,aAAK,WAAW;AAChB,QAAAA,KAAI,KAAK,KAAK,GAAG;AACjB,aAAK,YAAY;AACjB,eAAO,KAAK,UAAS;MAG3B,WAAe,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AACpD,YAAI,WAAW;AACf,QAAAA,KAAI,KAAK,KAAK,GAAG;AACjB,YAAI,WAAW;AACf,eAAOA,GAAE,UAAS;;AAIpB,UAAI,GAAG;AACP,UAAI,KAAK,SAAS,IAAI,QAAQ;AAC5B,YAAI;AACJ,YAAI;MACV,OAAW;AACL,YAAI;AACJ,YAAI;;AAGN,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK;AAC1C,aAAK,MAAM,CAAC,IAAIA,KAAI;AACpB,gBAAQA,OAAM;;AAEhB,aAAO,UAAU,KAAK,IAAI,EAAE,QAAQ,KAAK;AACvC,QAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,KAAK;AACvB,aAAK,MAAM,CAAC,IAAIA,KAAI;AACpB,gBAAQA,OAAM;;AAGhB,WAAK,SAAS,EAAE;AAChB,UAAI,UAAU,GAAG;AACf,aAAK,MAAM,KAAK,MAAM,IAAI;AAC1B,aAAK;MAEX,WAAe,MAAM,MAAM;AACrB,eAAO,IAAI,EAAE,QAAQ,KAAK;AACxB,eAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;;;AAI7B,aAAO;IACX;AAGE,IAAAJ,IAAG,UAAU,MAAM,SAASY,KAAK,KAAK;AACpC,UAAI;AACJ,UAAI,IAAI,aAAa,KAAK,KAAK,aAAa,GAAG;AAC7C,YAAI,WAAW;AACf,cAAM,KAAK,IAAI,GAAG;AAClB,YAAI,YAAY;AAChB,eAAO;MACb,WAAe,IAAI,aAAa,KAAK,KAAK,aAAa,GAAG;AACpD,aAAK,WAAW;AAChB,cAAM,IAAI,IAAI,IAAI;AAClB,aAAK,WAAW;AAChB,eAAO;;AAGT,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO,KAAK,MAAK,EAAG,KAAK,GAAG;AAE1D,aAAO,IAAI,MAAK,EAAG,KAAK,IAAI;IAChC;AAGE,IAAAZ,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AAEtC,UAAI,IAAI,aAAa,GAAG;AACtB,YAAI,WAAW;AACf,YAAII,KAAI,KAAK,KAAK,GAAG;AACrB,YAAI,WAAW;AACf,eAAOA,GAAE,UAAS;MAGxB,WAAe,KAAK,aAAa,GAAG;AAC9B,aAAK,WAAW;AAChB,aAAK,KAAK,GAAG;AACb,aAAK,WAAW;AAChB,eAAO,KAAK,UAAS;;AAIvB,UAAI,MAAM,KAAK,IAAI,GAAG;AAGtB,UAAI,QAAQ,GAAG;AACb,aAAK,WAAW;AAChB,aAAK,SAAS;AACd,aAAK,MAAM,CAAC,IAAI;AAChB,eAAO;;AAIT,UAAI,GAAG;AACP,UAAI,MAAM,GAAG;AACX,YAAI;AACJ,YAAI;MACV,OAAW;AACL,YAAI;AACJ,YAAI;;AAGN,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,QAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK;AAC1C,gBAAQA,MAAK;AACb,aAAK,MAAM,CAAC,IAAIA,KAAI;;AAEtB,aAAO,UAAU,KAAK,IAAI,EAAE,QAAQ,KAAK;AACvC,QAAAA,MAAK,EAAE,MAAM,CAAC,IAAI,KAAK;AACvB,gBAAQA,MAAK;AACb,aAAK,MAAM,CAAC,IAAIA,KAAI;;AAItB,UAAI,UAAU,KAAK,IAAI,EAAE,UAAU,MAAM,MAAM;AAC7C,eAAO,IAAI,EAAE,QAAQ,KAAK;AACxB,eAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC;;;AAI7B,WAAK,SAAS,KAAK,IAAI,KAAK,QAAQ,CAAC;AAErC,UAAI,MAAM,MAAM;AACd,aAAK,WAAW;;AAGlB,aAAO,KAAK,OAAM;IACtB;AAGE,IAAAJ,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,MAAK,EAAG,KAAK,GAAG;IAChC;AAEE,aAAS,WAAYa,OAAM,KAAK,KAAK;AACnC,UAAI,WAAW,IAAI,WAAWA,MAAK;AACnC,UAAI,MAAOA,MAAK,SAAS,IAAI,SAAU;AACvC,UAAI,SAAS;AACb,YAAO,MAAM,IAAK;AAGlB,UAAI,IAAIA,MAAK,MAAM,CAAC,IAAI;AACxB,UAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AACvB,UAAIT,KAAI,IAAI;AAEZ,UAAI,KAAKA,KAAI;AACb,UAAI,QAASA,KAAI,WAAa;AAC9B,UAAI,MAAM,CAAC,IAAI;AAEf,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAG5B,YAAI,SAAS,UAAU;AACvB,YAAI,QAAQ,QAAQ;AACpB,YAAI,OAAO,KAAK,IAAI,GAAG,IAAI,SAAS,CAAC;AACrC,iBAAS,IAAI,KAAK,IAAI,GAAG,IAAIS,MAAK,SAAS,CAAC,GAAG,KAAK,MAAM,KAAK;AAC7D,cAAI,IAAK,IAAI,IAAK;AAClB,cAAIA,MAAK,MAAM,CAAC,IAAI;AACpB,cAAI,IAAI,MAAM,CAAC,IAAI;AACnB,UAAAT,KAAI,IAAI,IAAI;AACZ,oBAAWA,KAAI,WAAa;AAC5B,kBAAQA,KAAI;;AAEd,YAAI,MAAM,CAAC,IAAI,QAAQ;AACvB,gBAAQ,SAAS;;AAEnB,UAAI,UAAU,GAAG;AACf,YAAI,MAAM,CAAC,IAAI,QAAQ;MAC7B,OAAW;AACL,YAAI;;AAGN,aAAO,IAAI,OAAM;;AAMnB,QAAI,cAAc,SAASU,aAAaD,OAAM,KAAK,KAAK;AACtD,UAAI,IAAIA,MAAK;AACb,UAAI,IAAI,IAAI;AACZ,UAAI,IAAI,IAAI;AACZ,UAAI,IAAI;AACR,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AACjB,UAAI,KAAK,EAAE,CAAC,IAAI;AAChB,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,OAAO;AAEjB,UAAI,WAAWA,MAAK,WAAW,IAAI;AACnC,UAAI,SAAS;AAEb,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,MAAQ,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACrD,WAAO,MAAM,QAAQ,MAAO,MAAM,OAAO,MAAO;AAChD,YAAM;AAEN,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAK;AAClC,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AAEP,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK,KAAK,GAAG;AACxB,YAAO,MAAM,KAAK,KAAK,KAAK,GAAG,IAAK;AACpC,WAAK,KAAK,KAAK,KAAK,GAAG;AACvB,UAAI,OAAS,IAAI,KAAM,OAAO,MAAM,SAAW,MAAO;AACtD,WAAO,MAAM,QAAQ,MAAO,MAAM,QAAQ,MAAO;AACjD,aAAO;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,CAAC,IAAI;AACP,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,QAAE,EAAE,IAAI;AACR,UAAI,MAAM,GAAG;AACX,UAAE,EAAE,IAAI;AACR,YAAI;;AAEN,aAAO;IACX;AAGE,QAAI,CAAC,KAAK,MAAM;AACd,oBAAc;;AAGhB,aAAS,SAAUA,OAAM,KAAK,KAAK;AACjC,UAAI,WAAW,IAAI,WAAWA,MAAK;AACnC,UAAI,SAASA,MAAK,SAAS,IAAI;AAE/B,UAAI,QAAQ;AACZ,UAAI,UAAU;AACd,eAAS,IAAI,GAAG,IAAI,IAAI,SAAS,GAAG,KAAK;AAGvC,YAAI,SAAS;AACb,kBAAU;AACV,YAAI,QAAQ,QAAQ;AACpB,YAAI,OAAO,KAAK,IAAI,GAAG,IAAI,SAAS,CAAC;AACrC,iBAAS,IAAI,KAAK,IAAI,GAAG,IAAIA,MAAK,SAAS,CAAC,GAAG,KAAK,MAAM,KAAK;AAC7D,cAAI,IAAI,IAAI;AACZ,cAAI,IAAIA,MAAK,MAAM,CAAC,IAAI;AACxB,cAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AACvB,cAAIT,KAAI,IAAI;AAEZ,cAAI,KAAKA,KAAI;AACb,mBAAU,UAAWA,KAAI,WAAa,KAAM;AAC5C,eAAM,KAAK,QAAS;AACpB,kBAAQ,KAAK;AACb,mBAAU,UAAU,OAAO,MAAO;AAElC,qBAAW,WAAW;AACtB,oBAAU;;AAEZ,YAAI,MAAM,CAAC,IAAI;AACf,gBAAQ;AACR,iBAAS;;AAEX,UAAI,UAAU,GAAG;AACf,YAAI,MAAM,CAAC,IAAI;MACrB,OAAW;AACL,YAAI;;AAGN,aAAO,IAAI,OAAM;;AAGnB,aAAS,WAAYS,OAAM,KAAK,KAAK;AAInC,aAAO,SAASA,OAAM,KAAK,GAAG;;AAGhC,IAAAb,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK,KAAK;AAC7C,UAAI;AACJ,UAAI,MAAM,KAAK,SAAS,IAAI;AAC5B,UAAI,KAAK,WAAW,MAAM,IAAI,WAAW,IAAI;AAC3C,cAAM,YAAY,MAAM,KAAK,GAAG;MACtC,WAAe,MAAM,IAAI;AACnB,cAAM,WAAW,MAAM,KAAK,GAAG;MACrC,WAAe,MAAM,MAAM;AACrB,cAAM,SAAS,MAAM,KAAK,GAAG;MACnC,OAAW;AACL,cAAM,WAAW,MAAM,KAAK,GAAG;;AAGjC,aAAO;IACX;AAuME,IAAAA,IAAG,UAAU,MAAM,SAASjB,KAAK,KAAK;AACpC,UAAI,MAAM,IAAIiB,IAAG,IAAI;AACrB,UAAI,QAAQ,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM;AAC9C,aAAO,KAAK,MAAM,KAAK,GAAG;IAC9B;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,UAAI,MAAM,IAAIA,IAAG,IAAI;AACrB,UAAI,QAAQ,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM;AAC9C,aAAO,WAAW,MAAM,KAAK,GAAG;IACpC;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAK,EAAG,MAAM,KAAK,IAAI;IACvC;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,UAAI,WAAW,MAAM;AACrB,UAAI,SAAU,OAAM,CAAC;AAErB,MAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,MAAAA,QAAO,MAAM,QAAS;AAGtB,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAI,KAAK,KAAK,MAAM,CAAC,IAAI,KAAK;AAC9B,YAAI,MAAM,IAAI,aAAc,QAAQ;AACpC,kBAAU;AACV,iBAAU,IAAI,WAAa;AAE3B,iBAAS,OAAO;AAChB,aAAK,MAAM,CAAC,IAAI,KAAK;;AAGvB,UAAI,UAAU,GAAG;AACf,aAAK,MAAM,CAAC,IAAI;AAChB,aAAK;;AAEP,WAAK,SAAS,QAAQ,IAAI,IAAI,KAAK;AAEnC,aAAO,WAAW,KAAK,KAAI,IAAK;IACpC;AAEE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAK,EAAG,MAAM,GAAG;IACjC;AAGE,IAAAA,IAAG,UAAU,MAAM,SAAS,MAAO;AACjC,aAAO,KAAK,IAAI,IAAI;IACxB;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,OAAQ;AACnC,aAAO,KAAK,KAAK,KAAK,MAAK,CAAE;IACjC;AAGE,IAAAA,IAAG,UAAU,MAAM,SAASM,KAAK,KAAK;AACpC,UAAI,IAAI,WAAW,GAAG;AACtB,UAAI,EAAE,WAAW,EAAG,QAAO,IAAIN,IAAG,CAAC;AAGnC,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,MAAM,IAAI,IAAG,GAAI;AAClD,YAAI,EAAE,CAAC,MAAM,EAAG;;AAGlB,UAAI,EAAE,IAAI,EAAE,QAAQ;AAClB,iBAAS,IAAI,IAAI,IAAG,GAAI,IAAI,EAAE,QAAQ,KAAK,IAAI,EAAE,IAAG,GAAI;AACtD,cAAI,EAAE,CAAC,MAAM,EAAG;AAEhB,gBAAM,IAAI,IAAI,CAAC;;;AAInB,aAAO;IACX;AAGE,IAAAA,IAAG,UAAU,SAAS,SAAS,OAAQ,MAAM;AAC3C,MAAAF,QAAO,OAAO,SAAS,YAAY,QAAQ,CAAC;AAC5C,UAAIM,KAAI,OAAO;AACf,UAAItC,MAAK,OAAOsC,MAAK;AACrB,UAAI,YAAa,aAAe,KAAKA,MAAQ,KAAKA;AAClD,UAAI;AAEJ,UAAIA,OAAM,GAAG;AACX,YAAI,QAAQ;AAEZ,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,cAAI,WAAW,KAAK,MAAM,CAAC,IAAI;AAC/B,cAAI,KAAM,KAAK,MAAM,CAAC,IAAI,KAAK,YAAaA;AAC5C,eAAK,MAAM,CAAC,IAAI,IAAI;AACpB,kBAAQ,aAAc,KAAKA;;AAG7B,YAAI,OAAO;AACT,eAAK,MAAM,CAAC,IAAI;AAChB,eAAK;;;AAIT,UAAItC,OAAM,GAAG;AACX,aAAK,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACrC,eAAK,MAAM,IAAIA,EAAC,IAAI,KAAK,MAAM,CAAC;;AAGlC,aAAK,IAAI,GAAG,IAAIA,IAAG,KAAK;AACtB,eAAK,MAAM,CAAC,IAAI;;AAGlB,aAAK,UAAUA;;AAGjB,aAAO,KAAK,OAAM;IACtB;AAEE,IAAAkC,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AAEzC,MAAAF,QAAO,KAAK,aAAa,CAAC;AAC1B,aAAO,KAAK,OAAO,IAAI;IAC3B;AAKE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,MAAM,MAAM,UAAU;AAC3D,MAAAF,QAAO,OAAO,SAAS,YAAY,QAAQ,CAAC;AAC5C,UAAI;AACJ,UAAI,MAAM;AACR,aAAK,OAAQ,OAAO,MAAO;MACjC,OAAW;AACL,YAAI;;AAGN,UAAIM,KAAI,OAAO;AACf,UAAItC,KAAI,KAAK,KAAK,OAAOsC,MAAK,IAAI,KAAK,MAAM;AAC7C,UAAI,OAAO,WAAc,aAAcA,MAAMA;AAC7C,UAAI,cAAc;AAElB,WAAKtC;AACL,UAAI,KAAK,IAAI,GAAG,CAAC;AAGjB,UAAI,aAAa;AACf,iBAAS,IAAI,GAAG,IAAIA,IAAG,KAAK;AAC1B,sBAAY,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC;;AAErC,oBAAY,SAASA;;AAGvB,UAAIA,OAAM,EAAG;eAEF,KAAK,SAASA,IAAG;AAC1B,aAAK,UAAUA;AACf,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,eAAK,MAAM,CAAC,IAAI,KAAK,MAAM,IAAIA,EAAC;;MAExC,OAAW;AACL,aAAK,MAAM,CAAC,IAAI;AAChB,aAAK,SAAS;;AAGhB,UAAI,QAAQ;AACZ,WAAK,IAAI,KAAK,SAAS,GAAG,KAAK,MAAM,UAAU,KAAK,KAAK,IAAI,KAAK;AAChE,YAAI,OAAO,KAAK,MAAM,CAAC,IAAI;AAC3B,aAAK,MAAM,CAAC,IAAK,SAAU,KAAKsC,KAAO,SAASA;AAChD,gBAAQ,OAAO;;AAIjB,UAAI,eAAe,UAAU,GAAG;AAC9B,oBAAY,MAAM,YAAY,QAAQ,IAAI;;AAG5C,UAAI,KAAK,WAAW,GAAG;AACrB,aAAK,MAAM,CAAC,IAAI;AAChB,aAAK,SAAS;;AAGhB,aAAO,KAAK,OAAM;IACtB;AAEE,IAAAJ,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM,MAAM,UAAU;AAEzD,MAAAF,QAAO,KAAK,aAAa,CAAC;AAC1B,aAAO,KAAK,OAAO,MAAM,MAAM,QAAQ;IAC3C;AAGE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,MAAM;AACvC,aAAO,KAAK,MAAK,EAAG,MAAM,IAAI;IAClC;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AACzC,aAAO,KAAK,MAAK,EAAG,OAAO,IAAI;IACnC;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,MAAM;AACvC,aAAO,KAAK,MAAK,EAAG,MAAM,IAAI;IAClC;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AACzC,aAAO,KAAK,MAAK,EAAG,OAAO,IAAI;IACnC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,OAAO,QAAQ,YAAY,OAAO,CAAC;AAC1C,UAAIM,KAAI,MAAM;AACd,UAAItC,MAAK,MAAMsC,MAAK;AACpB,UAAI,IAAI,KAAKA;AAGb,UAAI,KAAK,UAAUtC,GAAG,QAAO;AAG7B,UAAI,IAAI,KAAK,MAAMA,EAAC;AAEpB,aAAO,CAAC,EAAE,IAAI;IAClB;AAGE,IAAAkC,IAAG,UAAU,SAAS,SAAS,OAAQ,MAAM;AAC3C,MAAAF,QAAO,OAAO,SAAS,YAAY,QAAQ,CAAC;AAC5C,UAAIM,KAAI,OAAO;AACf,UAAItC,MAAK,OAAOsC,MAAK;AAErB,MAAAN,QAAO,KAAK,aAAa,GAAG,yCAAyC;AAErE,UAAI,KAAK,UAAUhC,IAAG;AACpB,eAAO;;AAGT,UAAIsC,OAAM,GAAG;AACX,QAAAtC;;AAEF,WAAK,SAAS,KAAK,IAAIA,IAAG,KAAK,MAAM;AAErC,UAAIsC,OAAM,GAAG;AACX,YAAI,OAAO,WAAc,aAAcA,MAAMA;AAC7C,aAAK,MAAM,KAAK,SAAS,CAAC,KAAK;;AAGjC,aAAO,KAAK,OAAM;IACtB;AAGE,IAAAJ,IAAG,UAAU,QAAQ,SAAS,MAAO,MAAM;AACzC,aAAO,KAAK,MAAK,EAAG,OAAO,IAAI;IACnC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,MAAAA,QAAO,MAAM,QAAS;AACtB,UAAI,MAAM,EAAG,QAAO,KAAK,MAAM,CAAC,GAAG;AAGnC,UAAI,KAAK,aAAa,GAAG;AACvB,YAAI,KAAK,WAAW,MAAM,KAAK,MAAM,CAAC,IAAI,MAAM,KAAK;AACnD,eAAK,MAAM,CAAC,IAAI,OAAO,KAAK,MAAM,CAAC,IAAI;AACvC,eAAK,WAAW;AAChB,iBAAO;;AAGT,aAAK,WAAW;AAChB,aAAK,MAAM,GAAG;AACd,aAAK,WAAW;AAChB,eAAO;;AAIT,aAAO,KAAK,OAAO,GAAG;IAC1B;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,WAAK,MAAM,CAAC,KAAK;AAGjB,eAAS,IAAI,GAAG,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,KAAK,UAAW,KAAK;AAClE,aAAK,MAAM,CAAC,KAAK;AACjB,YAAI,MAAM,KAAK,SAAS,GAAG;AACzB,eAAK,MAAM,IAAI,CAAC,IAAI;QAC5B,OAAa;AACL,eAAK,MAAM,IAAI,CAAC;;;AAGpB,WAAK,SAAS,KAAK,IAAI,KAAK,QAAQ,IAAI,CAAC;AAEzC,aAAO;IACX;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,MAAAA,QAAO,MAAM,QAAS;AACtB,UAAI,MAAM,EAAG,QAAO,KAAK,MAAM,CAAC,GAAG;AAEnC,UAAI,KAAK,aAAa,GAAG;AACvB,aAAK,WAAW;AAChB,aAAK,MAAM,GAAG;AACd,aAAK,WAAW;AAChB,eAAO;;AAGT,WAAK,MAAM,CAAC,KAAK;AAEjB,UAAI,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,IAAI,GAAG;AAC1C,aAAK,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;AAC7B,aAAK,WAAW;MACtB,OAAW;AAEL,iBAAS,IAAI,GAAG,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,IAAI,GAAG,KAAK;AACzD,eAAK,MAAM,CAAC,KAAK;AACjB,eAAK,MAAM,IAAI,CAAC,KAAK;;;AAIzB,aAAO,KAAK,OAAM;IACtB;AAEE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAK,EAAG,MAAM,GAAG;IACjC;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAK,EAAG,MAAM,GAAG;IACjC;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,OAAQ;AACnC,WAAK,WAAW;AAEhB,aAAO;IACX;AAEE,IAAAA,IAAG,UAAU,MAAM,SAASiB,OAAO;AACjC,aAAO,KAAK,MAAK,EAAG,KAAI;IAC5B;AAEE,IAAAjB,IAAG,UAAU,eAAe,SAAS,aAAc,KAAKjB,MAAK,OAAO;AAClE,UAAI,MAAM,IAAI,SAAS;AACvB,UAAI;AAEJ,WAAK,QAAQ,GAAG;AAEhB,UAAI;AACJ,UAAI,QAAQ;AACZ,WAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC/B,aAAK,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AAClC,YAAI,SAAS,IAAI,MAAM,CAAC,IAAI,KAAKA;AACjC,aAAK,QAAQ;AACb,iBAAS,KAAK,OAAQ,QAAQ,WAAa;AAC3C,aAAK,MAAM,IAAI,KAAK,IAAI,IAAI;;AAE9B,aAAO,IAAI,KAAK,SAAS,OAAO,KAAK;AACnC,aAAK,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AAClC,gBAAQ,KAAK;AACb,aAAK,MAAM,IAAI,KAAK,IAAI,IAAI;;AAG9B,UAAI,UAAU,EAAG,QAAO,KAAK,OAAM;AAGnC,MAAAe,QAAO,UAAU,EAAE;AACnB,cAAQ;AACR,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,YAAI,EAAE,KAAK,MAAM,CAAC,IAAI,KAAK;AAC3B,gBAAQ,KAAK;AACb,aAAK,MAAM,CAAC,IAAI,IAAI;;AAEtB,WAAK,WAAW;AAEhB,aAAO,KAAK,OAAM;IACtB;AAEE,IAAAE,IAAG,UAAU,WAAW,SAAS,SAAU,KAAK,MAAM;AACpD,UAAI,QAAQ,KAAK,SAAS,IAAI;AAE9B,UAAI,IAAI,KAAK,MAAK;AAClB,UAAI,IAAI;AAGR,UAAI,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI;AAClC,UAAI,UAAU,KAAK,WAAW,GAAG;AACjC,cAAQ,KAAK;AACb,UAAI,UAAU,GAAG;AACf,YAAI,EAAE,MAAM,KAAK;AACjB,UAAE,OAAO,KAAK;AACd,cAAM,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI;;AAIhC,UAAI,IAAI,EAAE,SAAS,EAAE;AACrB,UAAI;AAEJ,UAAI,SAAS,OAAO;AAClB,YAAI,IAAIA,IAAG,IAAI;AACf,UAAE,SAAS,IAAI;AACf,UAAE,QAAQ,IAAI,MAAM,EAAE,MAAM;AAC5B,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,YAAE,MAAM,CAAC,IAAI;;;AAIjB,UAAI,OAAO,EAAE,MAAK,EAAG,aAAa,GAAG,GAAG,CAAC;AACzC,UAAI,KAAK,aAAa,GAAG;AACvB,YAAI;AACJ,YAAI,GAAG;AACL,YAAE,MAAM,CAAC,IAAI;;;AAIjB,eAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,YAAI,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI,KAAK,YACpC,EAAE,MAAM,EAAE,SAAS,IAAI,CAAC,IAAI;AAI/B,aAAK,KAAK,IAAK,KAAK,MAAO,GAAG,QAAS;AAEvC,UAAE,aAAa,GAAG,IAAI,CAAC;AACvB,eAAO,EAAE,aAAa,GAAG;AACvB;AACA,YAAE,WAAW;AACb,YAAE,aAAa,GAAG,GAAG,CAAC;AACtB,cAAI,CAAC,EAAE,OAAM,GAAI;AACf,cAAE,YAAY;;;AAGlB,YAAI,GAAG;AACL,YAAE,MAAM,CAAC,IAAI;;;AAGjB,UAAI,GAAG;AACL,UAAE,OAAM;;AAEV,QAAE,OAAM;AAGR,UAAI,SAAS,SAAS,UAAU,GAAG;AACjC,UAAE,OAAO,KAAK;;AAGhB,aAAO;QACL,KAAK,KAAK;QACV,KAAK;MACX;IACA;AAME,IAAAA,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK,MAAM,UAAU;AAC1D,MAAAF,QAAO,CAAC,IAAI,OAAM,CAAE;AAEpB,UAAI,KAAK,OAAM,GAAI;AACjB,eAAO;UACL,KAAK,IAAIE,IAAG,CAAC;UACb,KAAK,IAAIA,IAAG,CAAC;QACrB;;AAGI,UAAI,KAAKK,MAAK;AACd,UAAI,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AAC7C,cAAM,KAAK,IAAG,EAAG,OAAO,KAAK,IAAI;AAEjC,YAAI,SAAS,OAAO;AAClB,gBAAM,IAAI,IAAI,IAAG;;AAGnB,YAAI,SAAS,OAAO;AAClB,UAAAA,OAAM,IAAI,IAAI,IAAG;AACjB,cAAI,YAAYA,KAAI,aAAa,GAAG;AAClC,YAAAA,KAAI,KAAK,GAAG;;;AAIhB,eAAO;UACL;UACA,KAAKA;QACb;;AAGI,UAAI,KAAK,aAAa,KAAK,IAAI,aAAa,GAAG;AAC7C,cAAM,KAAK,OAAO,IAAI,IAAG,GAAI,IAAI;AAEjC,YAAI,SAAS,OAAO;AAClB,gBAAM,IAAI,IAAI,IAAG;;AAGnB,eAAO;UACL;UACA,KAAK,IAAI;QACjB;;AAGI,WAAK,KAAK,WAAW,IAAI,cAAc,GAAG;AACxC,cAAM,KAAK,IAAG,EAAG,OAAO,IAAI,IAAG,GAAI,IAAI;AAEvC,YAAI,SAAS,OAAO;AAClB,UAAAA,OAAM,IAAI,IAAI,IAAG;AACjB,cAAI,YAAYA,KAAI,aAAa,GAAG;AAClC,YAAAA,KAAI,KAAK,GAAG;;;AAIhB,eAAO;UACL,KAAK,IAAI;UACT,KAAKA;QACb;;AAMI,UAAI,IAAI,SAAS,KAAK,UAAU,KAAK,IAAI,GAAG,IAAI,GAAG;AACjD,eAAO;UACL,KAAK,IAAIL,IAAG,CAAC;UACb,KAAK;QACb;;AAII,UAAI,IAAI,WAAW,GAAG;AACpB,YAAI,SAAS,OAAO;AAClB,iBAAO;YACL,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,CAAC;YAC3B,KAAK;UACf;;AAGM,YAAI,SAAS,OAAO;AAClB,iBAAO;YACL,KAAK;YACL,KAAK,IAAIA,IAAG,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC;UAC9C;;AAGM,eAAO;UACL,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,CAAC;UAC3B,KAAK,IAAIA,IAAG,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC;QAC5C;;AAGI,aAAO,KAAK,SAAS,KAAK,IAAI;IAClC;AAGE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,OAAO,KAAK,OAAO,KAAK,EAAE;IAC1C;AAGE,IAAAA,IAAG,UAAU,MAAM,SAASK,KAAK,KAAK;AACpC,aAAO,KAAK,OAAO,KAAK,OAAO,KAAK,EAAE;IAC1C;AAEE,IAAAL,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,OAAO,KAAK,OAAO,IAAI,EAAE;IACzC;AAGE,IAAAA,IAAG,UAAU,WAAW,SAAS,SAAU,KAAK;AAC9C,UAAI,KAAK,KAAK,OAAO,GAAG;AAGxB,UAAI,GAAG,IAAI,OAAM,EAAI,QAAO,GAAG;AAE/B,UAAIK,OAAM,GAAG,IAAI,aAAa,IAAI,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG;AAExD,UAAI,OAAO,IAAI,MAAM,CAAC;AACtB,UAAI,KAAK,IAAI,MAAM,CAAC;AACpB,UAAI,MAAMA,KAAI,IAAI,IAAI;AAGtB,UAAI,MAAM,KAAM,OAAO,KAAK,QAAQ,EAAI,QAAO,GAAG;AAGlD,aAAO,GAAG,IAAI,aAAa,IAAI,GAAG,IAAI,MAAM,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC;IACnE;AAEE,IAAAL,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,UAAI,WAAW,MAAM;AACrB,UAAI,SAAU,OAAM,CAAC;AAErB,MAAAF,QAAO,OAAO,QAAS;AACvB,UAAI,KAAK,KAAK,MAAM;AAEpB,UAAI,MAAM;AACV,eAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,eAAO,IAAI,OAAO,KAAK,MAAM,CAAC,IAAI,MAAM;;AAG1C,aAAO,WAAW,CAAC,MAAM;IAC7B;AAGE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAM,GAAG;IACzB;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,UAAI,WAAW,MAAM;AACrB,UAAI,SAAU,OAAM,CAAC;AAErB,MAAAF,QAAO,OAAO,QAAS;AAEvB,UAAI,QAAQ;AACZ,eAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,YAAI,KAAK,KAAK,MAAM,CAAC,IAAI,KAAK,QAAQ;AACtC,aAAK,MAAM,CAAC,IAAK,IAAI,MAAO;AAC5B,gBAAQ,IAAI;;AAGd,WAAK,OAAM;AACX,aAAO,WAAW,KAAK,KAAI,IAAK;IACpC;AAEE,IAAAE,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,MAAK,EAAG,MAAM,GAAG;IACjC;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,GAAG;AACpC,MAAAF,QAAO,EAAE,aAAa,CAAC;AACvB,MAAAA,QAAO,CAAC,EAAE,OAAM,CAAE;AAElB,UAAI,IAAI;AACR,UAAI,IAAI,EAAE,MAAK;AAEf,UAAI,EAAE,aAAa,GAAG;AACpB,YAAI,EAAE,KAAK,CAAC;MAClB,OAAW;AACL,YAAI,EAAE,MAAK;;AAIb,UAAI,IAAI,IAAIE,IAAG,CAAC;AAChB,UAAI,IAAI,IAAIA,IAAG,CAAC;AAGhB,UAAI,IAAI,IAAIA,IAAG,CAAC;AAChB,UAAI,IAAI,IAAIA,IAAG,CAAC;AAEhB,UAAI,IAAI;AAER,aAAO,EAAE,OAAM,KAAM,EAAE,OAAM,GAAI;AAC/B,UAAE,OAAO,CAAC;AACV,UAAE,OAAO,CAAC;AACV,UAAE;;AAGJ,UAAI,KAAK,EAAE,MAAK;AAChB,UAAI,KAAK,EAAE,MAAK;AAEhB,aAAO,CAAC,EAAE,OAAM,GAAI;AAClB,iBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,YAAI,IAAI,GAAG;AACT,YAAE,OAAO,CAAC;AACV,iBAAO,MAAM,GAAG;AACd,gBAAI,EAAE,MAAK,KAAM,EAAE,MAAK,GAAI;AAC1B,gBAAE,KAAK,EAAE;AACT,gBAAE,KAAK,EAAE;;AAGX,cAAE,OAAO,CAAC;AACV,cAAE,OAAO,CAAC;;;AAId,iBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,YAAI,IAAI,GAAG;AACT,YAAE,OAAO,CAAC;AACV,iBAAO,MAAM,GAAG;AACd,gBAAI,EAAE,MAAK,KAAM,EAAE,MAAK,GAAI;AAC1B,gBAAE,KAAK,EAAE;AACT,gBAAE,KAAK,EAAE;;AAGX,cAAE,OAAO,CAAC;AACV,cAAE,OAAO,CAAC;;;AAId,YAAI,EAAE,IAAI,CAAC,KAAK,GAAG;AACjB,YAAE,KAAK,CAAC;AACR,YAAE,KAAK,CAAC;AACR,YAAE,KAAK,CAAC;QAChB,OAAa;AACL,YAAE,KAAK,CAAC;AACR,YAAE,KAAK,CAAC;AACR,YAAE,KAAK,CAAC;;;AAIZ,aAAO;QACL,GAAG;QACH,GAAG;QACH,KAAK,EAAE,OAAO,CAAC;MACrB;IACA;AAKE,IAAAA,IAAG,UAAU,SAAS,SAAS,OAAQ,GAAG;AACxC,MAAAF,QAAO,EAAE,aAAa,CAAC;AACvB,MAAAA,QAAO,CAAC,EAAE,OAAM,CAAE;AAElB,UAAI,IAAI;AACR,UAAI,IAAI,EAAE,MAAK;AAEf,UAAI,EAAE,aAAa,GAAG;AACpB,YAAI,EAAE,KAAK,CAAC;MAClB,OAAW;AACL,YAAI,EAAE,MAAK;;AAGb,UAAI,KAAK,IAAIE,IAAG,CAAC;AACjB,UAAI,KAAK,IAAIA,IAAG,CAAC;AAEjB,UAAI,QAAQ,EAAE,MAAK;AAEnB,aAAO,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG;AACrC,iBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,YAAI,IAAI,GAAG;AACT,YAAE,OAAO,CAAC;AACV,iBAAO,MAAM,GAAG;AACd,gBAAI,GAAG,MAAK,GAAI;AACd,iBAAG,KAAK,KAAK;;AAGf,eAAG,OAAO,CAAC;;;AAIf,iBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE;AACzE,YAAI,IAAI,GAAG;AACT,YAAE,OAAO,CAAC;AACV,iBAAO,MAAM,GAAG;AACd,gBAAI,GAAG,MAAK,GAAI;AACd,iBAAG,KAAK,KAAK;;AAGf,eAAG,OAAO,CAAC;;;AAIf,YAAI,EAAE,IAAI,CAAC,KAAK,GAAG;AACjB,YAAE,KAAK,CAAC;AACR,aAAG,KAAK,EAAE;QAClB,OAAa;AACL,YAAE,KAAK,CAAC;AACR,aAAG,KAAK,EAAE;;;AAId,UAAI;AACJ,UAAI,EAAE,KAAK,CAAC,MAAM,GAAG;AACnB,cAAM;MACZ,OAAW;AACL,cAAM;;AAGR,UAAI,IAAI,KAAK,CAAC,IAAI,GAAG;AACnB,YAAI,KAAK,CAAC;;AAGZ,aAAO;IACX;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,UAAI,KAAK,OAAM,EAAI,QAAO,IAAI,IAAG;AACjC,UAAI,IAAI,OAAM,EAAI,QAAO,KAAK,IAAG;AAEjC,UAAI,IAAI,KAAK,MAAK;AAClB,UAAI,IAAI,IAAI,MAAK;AACjB,QAAE,WAAW;AACb,QAAE,WAAW;AAGb,eAAS,QAAQ,GAAG,EAAE,OAAM,KAAM,EAAE,OAAM,GAAI,SAAS;AACrD,UAAE,OAAO,CAAC;AACV,UAAE,OAAO,CAAC;;AAGZ,SAAG;AACD,eAAO,EAAE,OAAM,GAAI;AACjB,YAAE,OAAO,CAAC;;AAEZ,eAAO,EAAE,OAAM,GAAI;AACjB,YAAE,OAAO,CAAC;;AAGZ,YAAII,KAAI,EAAE,IAAI,CAAC;AACf,YAAIA,KAAI,GAAG;AAET,cAAI,IAAI;AACR,cAAI;AACJ,cAAI;QACZ,WAAiBA,OAAM,KAAK,EAAE,KAAK,CAAC,MAAM,GAAG;AACrC;;AAGF,UAAE,KAAK,CAAC;eACD;AAET,aAAO,EAAE,OAAO,KAAK;IACzB;AAGE,IAAAJ,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG;IACpC;AAEE,IAAAA,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,cAAQ,KAAK,MAAM,CAAC,IAAI,OAAO;IACnC;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,QAAS;AACrC,cAAQ,KAAK,MAAM,CAAC,IAAI,OAAO;IACnC;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,aAAO,KAAK,MAAM,CAAC,IAAI;IAC3B;AAGE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,OAAO,QAAQ,QAAQ;AAC9B,UAAIM,KAAI,MAAM;AACd,UAAItC,MAAK,MAAMsC,MAAK;AACpB,UAAI,IAAI,KAAKA;AAGb,UAAI,KAAK,UAAUtC,IAAG;AACpB,aAAK,QAAQA,KAAI,CAAC;AAClB,aAAK,MAAMA,EAAC,KAAK;AACjB,eAAO;;AAIT,UAAI,QAAQ;AACZ,eAAS,IAAIA,IAAG,UAAU,KAAK,IAAI,KAAK,QAAQ,KAAK;AACnD,YAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AACxB,aAAK;AACL,gBAAQ,MAAM;AACd,aAAK;AACL,aAAK,MAAM,CAAC,IAAI;;AAElB,UAAI,UAAU,GAAG;AACf,aAAK,MAAM,CAAC,IAAI;AAChB,aAAK;;AAEP,aAAO;IACX;AAEE,IAAAkC,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,aAAO,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,MAAM;IAClD;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,UAAI,WAAW,MAAM;AAErB,UAAI,KAAK,aAAa,KAAK,CAAC,SAAU,QAAO;AAC7C,UAAI,KAAK,aAAa,KAAK,SAAU,QAAO;AAE5C,WAAK,OAAM;AAEX,UAAI;AACJ,UAAI,KAAK,SAAS,GAAG;AACnB,cAAM;MACZ,OAAW;AACL,YAAI,UAAU;AACZ,gBAAM,CAAC;;AAGT,QAAAF,QAAO,OAAO,UAAW,mBAAmB;AAE5C,YAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AACxB,cAAM,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK;;AAEvC,UAAI,KAAK,aAAa,EAAG,QAAO,CAAC,MAAM;AACvC,aAAO;IACX;AAME,IAAAE,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,UAAI,KAAK,aAAa,KAAK,IAAI,aAAa,EAAG,QAAO;AACtD,UAAI,KAAK,aAAa,KAAK,IAAI,aAAa,EAAG,QAAO;AAEtD,UAAI,MAAM,KAAK,KAAK,GAAG;AACvB,UAAI,KAAK,aAAa,EAAG,QAAO,CAAC,MAAM;AACvC,aAAO;IACX;AAGE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AAEtC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO;AACrC,UAAI,KAAK,SAAS,IAAI,OAAQ,QAAO;AAErC,UAAI,MAAM;AACV,eAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,YAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AACxB,YAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AAEvB,YAAI,MAAM,EAAG;AACb,YAAI,IAAI,GAAG;AACT,gBAAM;QACd,WAAiB,IAAI,GAAG;AAChB,gBAAM;;AAER;;AAEF,aAAO;IACX;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,KAAK,GAAG,MAAM;IAC9B;AAEE,IAAAA,IAAG,UAAU,KAAK,SAAS,GAAI,KAAK;AAClC,aAAO,KAAK,IAAI,GAAG,MAAM;IAC7B;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,KAAK,GAAG,KAAK;IAC7B;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,IAAI,GAAG,KAAK;IAC5B;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,KAAK,GAAG,MAAM;IAC9B;AAEE,IAAAA,IAAG,UAAU,KAAK,SAAS,GAAI,KAAK;AAClC,aAAO,KAAK,IAAI,GAAG,MAAM;IAC7B;AAEE,IAAAA,IAAG,UAAU,OAAO,SAAS,KAAM,KAAK;AACtC,aAAO,KAAK,KAAK,GAAG,KAAK;IAC7B;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,IAAI,GAAG,KAAK;IAC5B;AAEE,IAAAA,IAAG,UAAU,MAAM,SAAS,IAAK,KAAK;AACpC,aAAO,KAAK,KAAK,GAAG,MAAM;IAC9B;AAEE,IAAAA,IAAG,UAAU,KAAK,SAASkB,IAAI,KAAK;AAClC,aAAO,KAAK,IAAI,GAAG,MAAM;IAC7B;AAME,IAAAlB,IAAG,MAAM,SAAS,IAAK,KAAK;AAC1B,aAAO,IAAI,IAAI,GAAG;IACtB;AAEE,IAAAA,IAAG,UAAU,QAAQ,SAAS,MAAO,KAAK;AACxC,MAAAF,QAAO,CAAC,KAAK,KAAK,uCAAuC;AACzD,MAAAA,QAAO,KAAK,aAAa,GAAG,+BAA+B;AAC3D,aAAO,IAAI,UAAU,IAAI,EAAE,UAAU,GAAG;IAC5C;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,MAAAF,QAAO,KAAK,KAAK,sDAAsD;AACvE,aAAO,KAAK,IAAI,YAAY,IAAI;IACpC;AAEE,IAAAE,IAAG,UAAU,YAAY,SAAS,UAAW,KAAK;AAChD,WAAK,MAAM;AACX,aAAO;IACX;AAEE,IAAAA,IAAG,UAAU,WAAW,SAAS,SAAU,KAAK;AAC9C,MAAAF,QAAO,CAAC,KAAK,KAAK,uCAAuC;AACzD,aAAO,KAAK,UAAU,GAAG;IAC7B;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,aAAO,KAAK,IAAI,IAAI,MAAM,GAAG;IACjC;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,QAAS,KAAK;AAC5C,MAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,aAAO,KAAK,IAAI,KAAK,MAAM,GAAG;IAClC;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,aAAO,KAAK,IAAI,IAAI,MAAM,GAAG;IACjC;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,QAAS,KAAK;AAC5C,MAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,aAAO,KAAK,IAAI,KAAK,MAAM,GAAG;IAClC;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,aAAO,KAAK,IAAI,IAAI,MAAM,GAAG;IACjC;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,WAAK,IAAI,SAAS,MAAM,GAAG;AAC3B,aAAO,KAAK,IAAI,IAAI,MAAM,GAAG;IACjC;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,QAAS,KAAK;AAC5C,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,WAAK,IAAI,SAAS,MAAM,GAAG;AAC3B,aAAO,KAAK,IAAI,KAAK,MAAM,GAAG;IAClC;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,IAAI,IAAI;IAC5B;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,MAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,KAAK,IAAI;IAC7B;AAGE,IAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,MAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,KAAK,IAAI;IAC7B;AAEE,IAAAE,IAAG,UAAU,UAAU,SAAS,UAAW;AACzC,MAAAF,QAAO,KAAK,KAAK,qCAAqC;AACtD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,KAAK,IAAI;IAC7B;AAGE,IAAAE,IAAG,UAAU,SAAS,SAAS,SAAU;AACvC,MAAAF,QAAO,KAAK,KAAK,oCAAoC;AACrD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,IAAI,IAAI;IAC5B;AAEE,IAAAE,IAAG,UAAU,SAAS,SAAS,OAAQ,KAAK;AAC1C,MAAAF,QAAO,KAAK,OAAO,CAAC,IAAI,KAAK,mBAAmB;AAChD,WAAK,IAAI,SAAS,IAAI;AACtB,aAAO,KAAK,IAAI,IAAI,MAAM,GAAG;IACjC;AAGE,QAAI,SAAS;MACX,MAAM;MACN,MAAM;MACN,MAAM;MACN,QAAQ;IACZ;AAGE,aAAS,OAAQP,OAAM,GAAG;AAExB,WAAK,OAAOA;AACZ,WAAK,IAAI,IAAIS,IAAG,GAAG,EAAE;AACrB,WAAK,IAAI,KAAK,EAAE,UAAS;AACzB,WAAK,IAAI,IAAIA,IAAG,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC;AAE7C,WAAK,MAAM,KAAK,KAAI;;AAGtB,WAAO,UAAU,OAAO,SAAS,OAAQ;AACvC,UAAI,MAAM,IAAIA,IAAG,IAAI;AACrB,UAAI,QAAQ,IAAI,MAAM,KAAK,KAAK,KAAK,IAAI,EAAE,CAAC;AAC5C,aAAO;IACX;AAEE,WAAO,UAAU,UAAU,SAAS,QAAS,KAAK;AAGhD,UAAII,KAAI;AACR,UAAI;AAEJ,SAAG;AACD,aAAK,MAAMA,IAAG,KAAK,GAAG;AACtB,QAAAA,KAAI,KAAK,MAAMA,EAAC;AAChB,QAAAA,KAAIA,GAAE,KAAK,KAAK,GAAG;AACnB,eAAOA,GAAE,UAAS;MACxB,SAAa,OAAO,KAAK;AAErB,UAAI,MAAM,OAAO,KAAK,IAAI,KAAKA,GAAE,KAAK,KAAK,CAAC;AAC5C,UAAI,QAAQ,GAAG;AACb,QAAAA,GAAE,MAAM,CAAC,IAAI;AACb,QAAAA,GAAE,SAAS;MACjB,WAAe,MAAM,GAAG;AAClB,QAAAA,GAAE,KAAK,KAAK,CAAC;MACnB,OAAW;AACL,YAAIA,GAAE,UAAU,QAAW;AAEzB,UAAAA,GAAE,MAAK;QACf,OAAa;AAEL,UAAAA,GAAE,OAAM;;;AAIZ,aAAOA;IACX;AAEE,WAAO,UAAU,QAAQ,SAAS,MAAO,OAAO,KAAK;AACnD,YAAM,OAAO,KAAK,GAAG,GAAG,GAAG;IAC/B;AAEE,WAAO,UAAU,QAAQ,SAAS,MAAO,KAAK;AAC5C,aAAO,IAAI,KAAK,KAAK,CAAC;IAC1B;AAEE,aAAS,OAAQ;AACf,aAAO;QACL;QACA;QACA;MAAyE;;AAE7E,IAAAL,UAAS,MAAM,MAAM;AAErB,SAAK,UAAU,QAAQ,SAAS,MAAO,OAAO,QAAQ;AAEpD,UAAI,OAAO;AAEX,UAAI,SAAS,KAAK,IAAI,MAAM,QAAQ,CAAC;AACrC,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,eAAO,MAAM,CAAC,IAAI,MAAM,MAAM,CAAC;;AAEjC,aAAO,SAAS;AAEhB,UAAI,MAAM,UAAU,GAAG;AACrB,cAAM,MAAM,CAAC,IAAI;AACjB,cAAM,SAAS;AACf;;AAIF,UAAI,OAAO,MAAM,MAAM,CAAC;AACxB,aAAO,MAAM,OAAO,QAAQ,IAAI,OAAO;AAEvC,WAAK,IAAI,IAAI,IAAI,MAAM,QAAQ,KAAK;AAClC,YAAI,OAAO,MAAM,MAAM,CAAC,IAAI;AAC5B,cAAM,MAAM,IAAI,EAAE,KAAM,OAAO,SAAS,IAAM,SAAS;AACvD,eAAO;;AAET,gBAAU;AACV,YAAM,MAAM,IAAI,EAAE,IAAI;AACtB,UAAI,SAAS,KAAK,MAAM,SAAS,IAAI;AACnC,cAAM,UAAU;MACtB,OAAW;AACL,cAAM,UAAU;;IAEtB;AAEE,SAAK,UAAU,QAAQ,SAAS,MAAO,KAAK;AAE1C,UAAI,MAAM,IAAI,MAAM,IAAI;AACxB,UAAI,MAAM,IAAI,SAAS,CAAC,IAAI;AAC5B,UAAI,UAAU;AAGd,UAAI,KAAK;AACT,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,IAAI,IAAI,MAAM,CAAC,IAAI;AACvB,cAAM,IAAI;AACV,YAAI,MAAM,CAAC,IAAI,KAAK;AACpB,aAAK,IAAI,MAAS,KAAK,WAAa;;AAItC,UAAI,IAAI,MAAM,IAAI,SAAS,CAAC,MAAM,GAAG;AACnC,YAAI;AACJ,YAAI,IAAI,MAAM,IAAI,SAAS,CAAC,MAAM,GAAG;AACnC,cAAI;;;AAGR,aAAO;IACX;AAEE,aAAS,OAAQ;AACf,aAAO;QACL;QACA;QACA;MAAgE;;AAEpE,IAAAA,UAAS,MAAM,MAAM;AAErB,aAAS,OAAQ;AACf,aAAO;QACL;QACA;QACA;MAAuD;;AAE3D,IAAAA,UAAS,MAAM,MAAM;AAErB,aAAS,SAAU;AAEjB,aAAO;QACL;QACA;QACA;MAAqE;;AAEzE,IAAAA,UAAS,QAAQ,MAAM;AAEvB,WAAO,UAAU,QAAQ,SAAS,MAAO,KAAK;AAE5C,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,KAAO;AACrC,YAAI,KAAK,KAAK;AACd,gBAAQ;AAER,YAAI,MAAM,CAAC,IAAI;AACf,gBAAQ;;AAEV,UAAI,UAAU,GAAG;AACf,YAAI,MAAM,IAAI,QAAQ,IAAI;;AAE5B,aAAO;IACX;AAGE,IAAAC,IAAG,SAAS,SAAS,MAAOT,OAAM;AAEhC,UAAI,OAAOA,KAAI,EAAG,QAAO,OAAOA,KAAI;AAEpC,UAAI4B;AACJ,UAAI5B,UAAS,QAAQ;AACnB,QAAA4B,SAAQ,IAAI,KAAI;MACtB,WAAe5B,UAAS,QAAQ;AAC1B,QAAA4B,SAAQ,IAAI,KAAI;MACtB,WAAe5B,UAAS,QAAQ;AAC1B,QAAA4B,SAAQ,IAAI,KAAI;MACtB,WAAe5B,UAAS,UAAU;AAC5B,QAAA4B,SAAQ,IAAI,OAAM;MACxB,OAAW;AACL,cAAM,IAAI,MAAM,mBAAmB5B,KAAI;;AAEzC,aAAOA,KAAI,IAAI4B;AAEf,aAAOA;IACX;AAKE,aAAS,IAAK,GAAG;AACf,UAAI,OAAO,MAAM,UAAU;AACzB,YAAI,QAAQnB,IAAG,OAAO,CAAC;AACvB,aAAK,IAAI,MAAM;AACf,aAAK,QAAQ;MACnB,OAAW;AACL,QAAAF,QAAO,EAAE,IAAI,CAAC,GAAG,gCAAgC;AACjD,aAAK,IAAI;AACT,aAAK,QAAQ;;;AAIjB,QAAI,UAAU,WAAW,SAAS,SAAU,GAAG;AAC7C,MAAAA,QAAO,EAAE,aAAa,GAAG,+BAA+B;AACxD,MAAAA,QAAO,EAAE,KAAK,iCAAiC;IACnD;AAEE,QAAI,UAAU,WAAW,SAAS,SAAU,GAAG,GAAG;AAChD,MAAAA,SAAQ,EAAE,WAAW,EAAE,cAAc,GAAG,+BAA+B;AACvE,MAAAA;QAAO,EAAE,OAAO,EAAE,QAAQ,EAAE;QAC1B;MAAiC;IACvC;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,UAAI,KAAK,MAAO,QAAO,KAAK,MAAM,QAAQ,CAAC,EAAE,UAAU,IAAI;AAE3D,WAAK,GAAG,EAAE,KAAK,KAAK,CAAC,EAAE,UAAU,IAAI,CAAC;AACtC,aAAO;IACX;AAEE,QAAI,UAAU,MAAM,SAASY,KAAK,GAAG;AACnC,UAAI,EAAE,OAAM,GAAI;AACd,eAAO,EAAE,MAAK;;AAGhB,aAAO,KAAK,EAAE,IAAI,CAAC,EAAE,UAAU,IAAI;IACvC;AAEE,QAAI,UAAU,MAAM,SAASE,KAAK,GAAG,GAAG;AACtC,WAAK,SAAS,GAAG,CAAC;AAElB,UAAI,MAAM,EAAE,IAAI,CAAC;AACjB,UAAI,IAAI,IAAI,KAAK,CAAC,KAAK,GAAG;AACxB,YAAI,KAAK,KAAK,CAAC;;AAEjB,aAAO,IAAI,UAAU,IAAI;IAC7B;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACxC,WAAK,SAAS,GAAG,CAAC;AAElB,UAAI,MAAM,EAAE,KAAK,CAAC;AAClB,UAAI,IAAI,IAAI,KAAK,CAAC,KAAK,GAAG;AACxB,YAAI,KAAK,KAAK,CAAC;;AAEjB,aAAO;IACX;AAEE,QAAI,UAAU,MAAM,SAAS,IAAK,GAAG,GAAG;AACtC,WAAK,SAAS,GAAG,CAAC;AAElB,UAAI,MAAM,EAAE,IAAI,CAAC;AACjB,UAAI,IAAI,KAAK,CAAC,IAAI,GAAG;AACnB,YAAI,KAAK,KAAK,CAAC;;AAEjB,aAAO,IAAI,UAAU,IAAI;IAC7B;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACxC,WAAK,SAAS,GAAG,CAAC;AAElB,UAAI,MAAM,EAAE,KAAK,CAAC;AAClB,UAAI,IAAI,KAAK,CAAC,IAAI,GAAG;AACnB,YAAI,KAAK,KAAK,CAAC;;AAEjB,aAAO;IACX;AAEE,QAAI,UAAU,MAAM,SAAS,IAAK,GAAG,KAAK;AACxC,WAAK,SAAS,CAAC;AACf,aAAO,KAAK,KAAK,EAAE,MAAM,GAAG,CAAC;IACjC;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACxC,WAAK,SAAS,GAAG,CAAC;AAClB,aAAO,KAAK,KAAK,EAAE,KAAK,CAAC,CAAC;IAC9B;AAEE,QAAI,UAAU,MAAM,SAAS7B,KAAK,GAAG,GAAG;AACtC,WAAK,SAAS,GAAG,CAAC;AAClB,aAAO,KAAK,KAAK,EAAE,IAAI,CAAC,CAAC;IAC7B;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,aAAO,KAAK,KAAK,GAAG,EAAE,MAAK,CAAE;IACjC;AAEE,QAAI,UAAU,MAAM,SAAS,IAAK,GAAG;AACnC,aAAO,KAAK,IAAI,GAAG,CAAC;IACxB;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,UAAI,EAAE,OAAM,EAAI,QAAO,EAAE,MAAK;AAE9B,UAAI,OAAO,KAAK,EAAE,MAAM,CAAC;AACzB,MAAAe,QAAO,OAAO,MAAM,CAAC;AAGrB,UAAI,SAAS,GAAG;AACd,YAAIQ,OAAM,KAAK,EAAE,IAAI,IAAIN,IAAG,CAAC,CAAC,EAAE,OAAO,CAAC;AACxC,eAAO,KAAK,IAAI,GAAGM,IAAG;;AAMxB,UAAI,IAAI,KAAK,EAAE,KAAK,CAAC;AACrB,UAAIxC,KAAI;AACR,aAAO,CAAC,EAAE,OAAM,KAAM,EAAE,MAAM,CAAC,MAAM,GAAG;AACtC,QAAAA;AACA,UAAE,OAAO,CAAC;;AAEZ,MAAAgC,QAAO,CAAC,EAAE,OAAM,CAAE;AAElB,UAAI,MAAM,IAAIE,IAAG,CAAC,EAAE,MAAM,IAAI;AAC9B,UAAI,OAAO,IAAI,OAAM;AAIrB,UAAI,OAAO,KAAK,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC;AAClC,UAAI,IAAI,KAAK,EAAE,UAAS;AACxB,UAAI,IAAIA,IAAG,IAAI,IAAI,CAAC,EAAE,MAAM,IAAI;AAEhC,aAAO,KAAK,IAAI,GAAG,IAAI,EAAE,IAAI,IAAI,MAAM,GAAG;AACxC,UAAE,QAAQ,IAAI;;AAGhB,UAAI,IAAI,KAAK,IAAI,GAAG,CAAC;AACrB,UAAII,KAAI,KAAK,IAAI,GAAG,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;AACvC,UAAI,IAAI,KAAK,IAAI,GAAG,CAAC;AACrB,UAAI,IAAItC;AACR,aAAO,EAAE,IAAI,GAAG,MAAM,GAAG;AACvB,YAAI,MAAM;AACV,iBAAS,IAAI,GAAG,IAAI,IAAI,GAAG,MAAM,GAAG,KAAK;AACvC,gBAAM,IAAI,OAAM;;AAElB,QAAAgC,QAAO,IAAI,CAAC;AACZ,YAAI,IAAI,KAAK,IAAI,GAAG,IAAIE,IAAG,CAAC,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC;AAE/C,QAAAI,KAAIA,GAAE,OAAO,CAAC;AACd,YAAI,EAAE,OAAM;AACZ,YAAI,EAAE,OAAO,CAAC;AACd,YAAI;;AAGN,aAAOA;IACX;AAEE,QAAI,UAAU,OAAO,SAAS,KAAM,GAAG;AACrC,UAAI,MAAM,EAAE,OAAO,KAAK,CAAC;AACzB,UAAI,IAAI,aAAa,GAAG;AACtB,YAAI,WAAW;AACf,eAAO,KAAK,KAAK,GAAG,EAAE,OAAM;MAClC,OAAW;AACL,eAAO,KAAK,KAAK,GAAG;;IAE1B;AAEE,QAAI,UAAU,MAAM,SAASE,KAAK,GAAG,KAAK;AACxC,UAAI,IAAI,OAAM,EAAI,QAAO,IAAIN,IAAG,CAAC,EAAE,MAAM,IAAI;AAC7C,UAAI,IAAI,KAAK,CAAC,MAAM,EAAG,QAAO,EAAE,MAAK;AAErC,UAAI,aAAa;AACjB,UAAI,MAAM,IAAI,MAAM,KAAK,UAAU;AACnC,UAAI,CAAC,IAAI,IAAIA,IAAG,CAAC,EAAE,MAAM,IAAI;AAC7B,UAAI,CAAC,IAAI;AACT,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC;;AAGjC,UAAI,MAAM,IAAI,CAAC;AACf,UAAI,UAAU;AACd,UAAI,aAAa;AACjB,UAAI,QAAQ,IAAI,UAAS,IAAK;AAC9B,UAAI,UAAU,GAAG;AACf,gBAAQ;;AAGV,WAAK,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACpC,YAAI,OAAO,IAAI,MAAM,CAAC;AACtB,iBAAS,IAAI,QAAQ,GAAG,KAAK,GAAG,KAAK;AACnC,cAAI,MAAO,QAAQ,IAAK;AACxB,cAAI,QAAQ,IAAI,CAAC,GAAG;AAClB,kBAAM,KAAK,IAAI,GAAG;;AAGpB,cAAI,QAAQ,KAAK,YAAY,GAAG;AAC9B,yBAAa;AACb;;AAGF,sBAAY;AACZ,qBAAW;AACX;AACA,cAAI,eAAe,eAAe,MAAM,KAAK,MAAM,GAAI;AAEvD,gBAAM,KAAK,IAAI,KAAK,IAAI,OAAO,CAAC;AAChC,uBAAa;AACb,oBAAU;;AAEZ,gBAAQ;;AAGV,aAAO;IACX;AAEE,QAAI,UAAU,YAAY,SAAS,UAAW,KAAK;AACjD,UAAII,KAAI,IAAI,KAAK,KAAK,CAAC;AAEvB,aAAOA,OAAM,MAAMA,GAAE,MAAK,IAAKA;IACnC;AAEE,QAAI,UAAU,cAAc,SAAS,YAAa,KAAK;AACrD,UAAI,MAAM,IAAI,MAAK;AACnB,UAAI,MAAM;AACV,aAAO;IACX;AAME,IAAAJ,IAAG,OAAO,SAASoB,MAAM,KAAK;AAC5B,aAAO,IAAI,KAAK,GAAG;IACvB;AAEE,aAAS,KAAM,GAAG;AAChB,UAAI,KAAK,MAAM,CAAC;AAEhB,WAAK,QAAQ,KAAK,EAAE,UAAS;AAC7B,UAAI,KAAK,QAAQ,OAAO,GAAG;AACzB,aAAK,SAAS,KAAM,KAAK,QAAQ;;AAGnC,WAAK,IAAI,IAAIpB,IAAG,CAAC,EAAE,OAAO,KAAK,KAAK;AACpC,WAAK,KAAK,KAAK,KAAK,KAAK,EAAE,IAAG,CAAE;AAChC,WAAK,OAAO,KAAK,EAAE,OAAO,KAAK,CAAC;AAEhC,WAAK,OAAO,KAAK,KAAK,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,KAAK,CAAC;AACrD,WAAK,OAAO,KAAK,KAAK,KAAK,KAAK,CAAC;AACjC,WAAK,OAAO,KAAK,EAAE,IAAI,KAAK,IAAI;;AAElC,IAAAD,UAAS,MAAM,GAAG;AAElB,SAAK,UAAU,YAAY,SAAS,UAAW,KAAK;AAClD,aAAO,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,CAAC;IAC1C;AAEE,SAAK,UAAU,cAAc,SAAS,YAAa,KAAK;AACtD,UAAIK,KAAI,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC;AACpC,MAAAA,GAAE,MAAM;AACR,aAAOA;IACX;AAEE,SAAK,UAAU,OAAO,SAAS,KAAM,GAAG,GAAG;AACzC,UAAI,EAAE,OAAM,KAAM,EAAE,OAAM,GAAI;AAC5B,UAAE,MAAM,CAAC,IAAI;AACb,UAAE,SAAS;AACX,eAAO;;AAGT,UAAI,IAAI,EAAE,KAAK,CAAC;AAChB,UAAI,IAAI,EAAE,MAAM,KAAK,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,OAAO,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC;AACxE,UAAI,IAAI,EAAE,KAAK,CAAC,EAAE,OAAO,KAAK,KAAK;AACnC,UAAI,MAAM;AAEV,UAAI,EAAE,IAAI,KAAK,CAAC,KAAK,GAAG;AACtB,cAAM,EAAE,KAAK,KAAK,CAAC;iBACV,EAAE,KAAK,CAAC,IAAI,GAAG;AACxB,cAAM,EAAE,KAAK,KAAK,CAAC;;AAGrB,aAAO,IAAI,UAAU,IAAI;IAC7B;AAEE,SAAK,UAAU,MAAM,SAASrB,KAAK,GAAG,GAAG;AACvC,UAAI,EAAE,OAAM,KAAM,EAAE,OAAM,EAAI,QAAO,IAAIiB,IAAG,CAAC,EAAE,UAAU,IAAI;AAE7D,UAAI,IAAI,EAAE,IAAI,CAAC;AACf,UAAI,IAAI,EAAE,MAAM,KAAK,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,OAAO,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC;AACxE,UAAI,IAAI,EAAE,KAAK,CAAC,EAAE,OAAO,KAAK,KAAK;AACnC,UAAI,MAAM;AACV,UAAI,EAAE,IAAI,KAAK,CAAC,KAAK,GAAG;AACtB,cAAM,EAAE,KAAK,KAAK,CAAC;iBACV,EAAE,KAAK,CAAC,IAAI,GAAG;AACxB,cAAM,EAAE,KAAK,KAAK,CAAC;;AAGrB,aAAO,IAAI,UAAU,IAAI;IAC7B;AAEE,SAAK,UAAU,OAAO,SAAS,KAAM,GAAG;AAEtC,UAAI,MAAM,KAAK,KAAK,EAAE,OAAO,KAAK,CAAC,EAAE,IAAI,KAAK,EAAE,CAAC;AACjD,aAAO,IAAI,UAAU,IAAI;IAC7B;KACoC,QAAQqB,cAAI;;;ACz9GhD,IAAIrB,OAAKjC;AACT,IAAIuG,gBAAcrG;AAClB,IAAIC,WAAS0D,oBAAuB;AAEpC,SAAS,KAAKuQ,OAAM;AACnB,MAAI,MAAMA,MAAK,QAAQ,WAAU;AACjC,MAAI/R;AACJ,KAAG;AACF,IAAAA,KAAI,IAAIJ,KAAGsE,cAAY,GAAG,CAAC;EAC7B,SAAUlE,GAAE,IAAI+R,MAAK,OAAO,KAAK,KAAK,CAAC/R,GAAE,KAAK+R,MAAK,MAAM,KAAK,CAAC/R,GAAE,KAAK+R,MAAK,MAAM;AAChF,SAAO/R;AACR;AAEA,SAAS,MAAM+R,OAAM;AACpB,MAAI/R,KAAI,KAAK+R,KAAI;AACjB,MAAI,UAAU/R,GAAE,MAAMJ,KAAG,KAAKmS,MAAK,OAAO,CAAC,EAAE,OAAO,IAAInS,KAAGmS,MAAK,cAAc,CAAC,EAAE,QAAO;AACxF,SAAO,EAAE,SAAkB,WAAW/R,GAAE,KAAK+R,MAAK,OAAO,EAAC;AAC3D;AAEA,SAASI,MAAI,KAAKJ,OAAM;AACvB,MAAI,SAAS,MAAMA,KAAI;AACvB,MAAI,MAAMA,MAAK,QAAQ,WAAU;AACjC,MAAI,UAAU,IAAInS,KAAG,GAAG,EAAE,IAAI,OAAO,OAAO,EAAE,KAAKmS,MAAK,OAAO;AAC/D,MAAI,KAAK,QAAQ,MAAMnS,KAAG,KAAKmS,MAAK,MAAM,CAAC;AAC3C,MAAI,KAAK,QAAQ,MAAMnS,KAAG,KAAKmS,MAAK,MAAM,CAAC;AAC3C,MAAI,OAAOA,MAAK;AAChB,MAAI,IAAIA,MAAK;AACb,MAAI,IAAIA,MAAK;AACb,MAAI,KAAK,GAAG,OAAOA,MAAK,SAAS,EAAE,QAAO;AAC1C,MAAI,KAAK,GAAG,OAAOA,MAAK,SAAS,EAAE,QAAO;AAC1C,MAAI,IAAI,GAAG,KAAK,EAAE,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC;AAC7C,SAAO,GAAG,KAAK,CAAC,EAAE,KAAK,OAAO,SAAS,EAAE,KAAKA,MAAK,OAAO,EAAE,YAAYjU,UAAQ,MAAM,GAAG;AAC1F;AACAqU,MAAI,OAAO;AAEX,IAAA,gBAAiBA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACnCjB,MAAI3O,SAAQ;AAEZ,WAASnD,SAAQ,KAAK,KAAK;AACzB,QAAI,MAAM,QAAQ,GAAG;AACnB,aAAO,IAAI,MAAK;AAClB,QAAI,CAAC;AACH,aAAO,CAAA;AACT,QAAI,MAAM,CAAA;AACV,QAAI,OAAO,QAAQ,UAAU;AAC3B,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC9B,YAAI,CAAC,IAAI,IAAI,CAAC,IAAI;AACpB,aAAO;;AAET,QAAI,QAAQ,OAAO;AACjB,YAAM,IAAI,QAAQ,gBAAgB,EAAE;AACpC,UAAI,IAAI,SAAS,MAAM;AACrB,cAAM,MAAM;AACd,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,KAAK,SAAS,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IAChD,OAAS;AACL,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,IAAI,IAAI,WAAW,CAAC;AACxB,YAAI,KAAK,KAAK;AACd,YAAI,KAAK,IAAI;AACb,YAAI;AACF,cAAI,KAAK,IAAI,EAAE;;AAEf,cAAI,KAAK,EAAE;;;AAGjB,WAAO;;AAET,EAAAmD,OAAM,UAAUnD;AAEhB,WAAS+R,OAAM,MAAM;AACnB,QAAI,KAAK,WAAW;AAClB,aAAO,MAAM;;AAEb,aAAO;;AAEX,EAAA5O,OAAM,QAAQ4O;AAEd,WAASC,OAAM,KAAK;AAClB,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC9B,aAAOD,OAAM,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC;AAClC,WAAO;;AAET,EAAA5O,OAAM,QAAQ6O;AAEd,EAAA7O,OAAM,SAAS,SAASxB,QAAO,KAAK,KAAK;AACvC,QAAI,QAAQ;AACV,aAAOqQ,OAAM,GAAG;;AAEhB,aAAO;;;;ACtDX,MAAI7O,SAAQ;AACZ,MAAI5D,MAAKjC;AACT,MAAI,YAAYE;AAChB,MAAI,WAAW2D;AAEf,EAAAgC,OAAM,SAAS;AACf,EAAAA,OAAM,UAAU,SAAS;AACzB,EAAAA,OAAM,QAAQ,SAAS;AACvB,EAAAA,OAAM,QAAQ,SAAS;AACvB,EAAAA,OAAM,SAAS,SAAS;AAGxB,WAAS8O,QAAO,KAAK,GAAG,MAAM;AAC5B,QAAI,MAAM,IAAI,MAAM,KAAK,IAAI,IAAI,UAAS,GAAI,IAAI,IAAI,CAAC;AACvD,QAAI;AACJ,SAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG;AAClC,UAAI,CAAC,IAAI;;AAGX,QAAI,KAAK,KAAM,IAAI;AACnB,QAAI,IAAI,IAAI,MAAK;AAEjB,SAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC/B,UAAI;AACJ,UAAIrS,OAAM,EAAE,MAAM,KAAK,CAAC;AACxB,UAAI,EAAE,MAAK,GAAI;AACb,YAAIA,QAAO,MAAM,KAAK;AACpB,eAAK,MAAM,KAAKA;;AAEhB,cAAIA;AACN,UAAE,MAAM,CAAC;MACf,OAAW;AACL,YAAI;;AAGN,UAAI,CAAC,IAAI;AACT,QAAE,OAAO,CAAC;;AAGZ,WAAO;;AAET,EAAAuD,OAAM,SAAS8O;AAGf,WAASC,QAAO,IAAI,IAAI;AACtB,QAAI,MAAM;MACR,CAAA;MACA,CAAA;IACJ;AAEE,SAAK,GAAG,MAAK;AACb,SAAK,GAAG,MAAK;AACb,QAAI,KAAK;AACT,QAAI,KAAK;AACT,QAAI;AACJ,WAAO,GAAG,KAAK,CAAC,EAAE,IAAI,KAAK,GAAG,KAAK,CAAC,EAAE,IAAI,GAAG;AAE3C,UAAI,MAAO,GAAG,MAAM,CAAC,IAAI,KAAM;AAC/B,UAAI,MAAO,GAAG,MAAM,CAAC,IAAI,KAAM;AAC/B,UAAI,QAAQ;AACV,cAAM;AACR,UAAI,QAAQ;AACV,cAAM;AACR,UAAI;AACJ,WAAK,MAAM,OAAO,GAAG;AACnB,aAAK;MACX,OAAW;AACL,aAAM,GAAG,MAAM,CAAC,IAAI,KAAM;AAC1B,aAAK,OAAO,KAAK,OAAO,MAAM,QAAQ;AACpC,eAAK,CAAC;;AAEN,eAAK;;AAET,UAAI,CAAC,EAAE,KAAK,EAAE;AAEd,UAAI;AACJ,WAAK,MAAM,OAAO,GAAG;AACnB,aAAK;MACX,OAAW;AACL,aAAM,GAAG,MAAM,CAAC,IAAI,KAAM;AAC1B,aAAK,OAAO,KAAK,OAAO,MAAM,QAAQ;AACpC,eAAK,CAAC;;AAEN,eAAK;;AAET,UAAI,CAAC,EAAE,KAAK,EAAE;AAGd,UAAI,IAAI,OAAO,KAAK;AAClB,aAAK,IAAI;AACX,UAAI,IAAI,OAAO,KAAK;AAClB,aAAK,IAAI;AACX,SAAG,OAAO,CAAC;AACX,SAAG,OAAO,CAAC;;AAGb,WAAO;;AAET,EAAA/O,OAAM,SAAS+O;AAEf,WAASC,gBAAetU,MAAKiB,OAAM,UAAU;AAC3C,QAAIK,OAAM,MAAML;AAChB,IAAAjB,KAAI,UAAUiB,KAAI,IAAI,SAASqT,kBAAiB;AAC9C,aAAO,KAAKhT,IAAG,MAAM,SAAY,KAAKA,IAAG,IACvC,KAAKA,IAAG,IAAI,SAAS,KAAK,IAAI;IACpC;;AAEA,EAAAgE,OAAM,iBAAiBgP;AAEvB,WAASC,YAAW,OAAO;AACzB,WAAO,OAAO,UAAU,WAAWjP,OAAM,QAAQ,OAAO,KAAK,IAC3D;;AAEJ,EAAAA,OAAM,aAAaiP;AAEnB,WAAS,UAAU,OAAO;AACxB,WAAO,IAAI7S,IAAG,OAAO,OAAO,IAAI;;AAElC,EAAA4D,OAAM,YAAY;;;ACtHlB,IAAI5D,OAAKjC;AACT,IAAI6F,UAAQ3F;AACZ,IAAI,SAAS2F,QAAM;AACnB,IAAI,SAASA,QAAM;AACnB,IAAI9D,WAAS8D,QAAM;AAEnB,SAAS,UAAUnE,OAAM,MAAM;AAC7B,OAAK,OAAOA;AACZ,OAAK,IAAI,IAAIO,KAAG,KAAK,GAAG,EAAE;AAG1B,OAAK,MAAM,KAAK,QAAQA,KAAG,IAAI,KAAK,KAAK,IAAIA,KAAG,KAAK,KAAK,CAAC;AAG3D,OAAK,OAAO,IAAIA,KAAG,CAAC,EAAE,MAAM,KAAK,GAAG;AACpC,OAAK,MAAM,IAAIA,KAAG,CAAC,EAAE,MAAM,KAAK,GAAG;AACnC,OAAK,MAAM,IAAIA,KAAG,CAAC,EAAE,MAAM,KAAK,GAAG;AAGnC,OAAK,IAAI,KAAK,KAAK,IAAIA,KAAG,KAAK,GAAG,EAAE;AACpC,OAAK,IAAI,KAAK,KAAK,KAAK,cAAc,KAAK,GAAG,KAAK,IAAI;AAGvD,OAAK,UAAU,IAAI,MAAM,CAAC;AAC1B,OAAK,UAAU,IAAI,MAAM,CAAC;AAC1B,OAAK,UAAU,IAAI,MAAM,CAAC;AAC1B,OAAK,UAAU,IAAI,MAAM,CAAC;AAE1B,OAAK,aAAa,KAAK,IAAI,KAAK,EAAE,UAAS,IAAK;AAGhD,MAAI,cAAc,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC;AAC7C,MAAI,CAAC,eAAe,YAAY,KAAK,GAAG,IAAI,GAAG;AAC7C,SAAK,OAAO;EAChB,OAAS;AACL,SAAK,gBAAgB;AACrB,SAAK,OAAO,KAAK,EAAE,MAAM,KAAK,GAAG;EACrC;AACA;IACAC,SAAiB;AAEjB,UAAU,UAAU,QAAQ,SAAS,QAAQ;AAC3C,QAAM,IAAI,MAAM,iBAAiB;AACnC;AAEA,UAAU,UAAU,WAAW,SAAS,WAAW;AACjD,QAAM,IAAI,MAAM,iBAAiB;AACnC;AAEA,UAAU,UAAU,eAAe,SAAS,aAAa,GAAG,GAAG;AAC7DH,WAAO,EAAE,WAAW;AACpB,MAAI,UAAU,EAAE,YAAW;AAE3B,MAAI,MAAM,OAAO,GAAG,GAAG,KAAK,UAAU;AACtC,MAAI,KAAK,KAAM,QAAQ,OAAO,MAAO,QAAQ,OAAO,MAAM,IAAI,IAAI;AAClE,OAAK;AAGL,MAAI,OAAO,CAAA;AACX,MAAI;AACJ,MAAI;AACJ,OAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,QAAQ,MAAM;AAC7C,WAAO;AACP,aAAS,IAAI,IAAI,QAAQ,OAAO,GAAG,KAAK,GAAG;AACzC,cAAQ,QAAQ,KAAK,IAAI,CAAC;AAC5B,SAAK,KAAK,IAAI;EAClB;AAEE,MAAI,IAAI,KAAK,OAAO,MAAM,MAAM,IAAI;AACpC,MAAI,IAAI,KAAK,OAAO,MAAM,MAAM,IAAI;AACpC,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,SAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAChC,aAAO,KAAK,CAAC;AACb,UAAI,SAAS;AACX,YAAI,EAAE,SAAS,QAAQ,OAAO,CAAC,CAAC;eACzB,SAAS,CAAC;AACjB,YAAI,EAAE,SAAS,QAAQ,OAAO,CAAC,EAAE,IAAG,CAAE;IAC9C;AACI,QAAI,EAAE,IAAI,CAAC;EACf;AACE,SAAO,EAAE,IAAG;AACd;AAEA,UAAU,UAAU,WAAW,SAAS,SAAS,GAAG,GAAG;AACrD,MAAI,IAAI;AAGR,MAAI,YAAY,EAAE,cAAc,CAAC;AACjC,MAAI,UAAU;AACd,MAAI,MAAM,UAAU;AAGpB,MAAI,MAAM,OAAO,GAAG,GAAG,KAAK,UAAU;AAGtC,MAAI,MAAM,KAAK,OAAO,MAAM,MAAM,IAAI;AACtC,WAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AAExC,aAAS,IAAI,GAAG,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG;AACtC;AACF,QAAI,KAAK;AACP;AACF,UAAM,IAAI,KAAK,CAAC;AAEhB,QAAI,IAAI;AACN;AACF,QAAI,IAAI,IAAI,CAAC;AACbA,aAAO,MAAM,CAAC;AACd,QAAI,EAAE,SAAS,UAAU;AAEvB,UAAI,IAAI;AACN,cAAM,IAAI,SAAS,IAAK,IAAI,KAAM,CAAC,CAAC;;AAEpC,cAAM,IAAI,SAAS,IAAK,CAAC,IAAI,KAAM,CAAC,EAAE,IAAG,CAAE;IACnD,OAAW;AAEL,UAAI,IAAI;AACN,cAAM,IAAI,IAAI,IAAK,IAAI,KAAM,CAAC,CAAC;;AAE/B,cAAM,IAAI,IAAI,IAAK,CAAC,IAAI,KAAM,CAAC,EAAE,IAAG,CAAE;IAC9C;EACA;AACE,SAAO,EAAE,SAAS,WAAW,IAAI,IAAG,IAAK;AAC3C;AAEA,UAAU,UAAU,cAAc,SAAS,YAAY,MACrD,QACA,QACA,KACA,gBAAgB;AAChB,MAAI,WAAW,KAAK;AACpB,MAAI,MAAM,KAAK;AACf,MAAI,MAAM,KAAK;AAGf,MAAIlB,OAAM;AACV,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK;AACxB,QAAI,OAAO,CAAC;AACZ,QAAI,YAAY,EAAE,cAAc,IAAI;AACpC,aAAS,CAAC,IAAI,UAAU;AACxB,QAAI,CAAC,IAAI,UAAU;EACvB;AAGE,OAAK,IAAI,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG;AAChC,QAAI,IAAI,IAAI;AACZ,QAAI,IAAI;AACR,QAAI,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,GAAG;AAC1C,UAAI,CAAC,IAAI,OAAO,OAAO,CAAC,GAAG,SAAS,CAAC,GAAG,KAAK,UAAU;AACvD,UAAI,CAAC,IAAI,OAAO,OAAO,CAAC,GAAG,SAAS,CAAC,GAAG,KAAK,UAAU;AACvD,MAAAA,OAAM,KAAK,IAAI,IAAI,CAAC,EAAE,QAAQA,IAAG;AACjC,MAAAA,OAAM,KAAK,IAAI,IAAI,CAAC,EAAE,QAAQA,IAAG;AACjC;IACN;AAEI,QAAI,OAAO;MACT,OAAO,CAAC;;MACR;;MACA;;MACA,OAAO,CAAC;;IACd;AAGI,QAAI,OAAO,CAAC,EAAE,EAAE,IAAI,OAAO,CAAC,EAAE,CAAC,MAAM,GAAG;AACtC,WAAK,CAAC,IAAI,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,CAAC;AACjC,WAAK,CAAC,IAAI,OAAO,CAAC,EAAE,IAAG,EAAG,SAAS,OAAO,CAAC,EAAE,IAAG,CAAE;IACxD,WAAe,OAAO,CAAC,EAAE,EAAE,IAAI,OAAO,CAAC,EAAE,EAAE,OAAM,CAAE,MAAM,GAAG;AACtD,WAAK,CAAC,IAAI,OAAO,CAAC,EAAE,IAAG,EAAG,SAAS,OAAO,CAAC,CAAC;AAC5C,WAAK,CAAC,IAAI,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,IAAG,CAAE;IAC7C,OAAW;AACL,WAAK,CAAC,IAAI,OAAO,CAAC,EAAE,IAAG,EAAG,SAAS,OAAO,CAAC,CAAC;AAC5C,WAAK,CAAC,IAAI,OAAO,CAAC,EAAE,IAAG,EAAG,SAAS,OAAO,CAAC,EAAE,IAAG,CAAE;IACxD;AAEI,QAAIuB,SAAQ;MACV;;MACA;;MACA;;MACA;;MACA;;MACA;;MACA;;MACA;;MACA;;IACN;AAEI,QAAI,MAAM,OAAO,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACrC,IAAAvB,OAAM,KAAK,IAAI,IAAI,CAAC,EAAE,QAAQA,IAAG;AACjC,QAAI,CAAC,IAAI,IAAI,MAAMA,IAAG;AACtB,QAAI,CAAC,IAAI,IAAI,MAAMA,IAAG;AACtB,SAAK,IAAI,GAAG,IAAIA,MAAK,KAAK;AACxB,UAAI,KAAK,IAAI,CAAC,EAAE,CAAC,IAAI;AACrB,UAAI,KAAK,IAAI,CAAC,EAAE,CAAC,IAAI;AAErB,UAAI,CAAC,EAAE,CAAC,IAAIuB,QAAO,KAAK,KAAK,KAAK,KAAK,EAAE;AACzC,UAAI,CAAC,EAAE,CAAC,IAAI;AACZ,UAAI,CAAC,IAAI;IACf;EACA;AAEE,MAAI,MAAM,KAAK,OAAO,MAAM,MAAM,IAAI;AACtC,MAAI,MAAM,KAAK;AACf,OAAK,IAAIvB,MAAK,KAAK,GAAG,KAAK;AACzB,QAAI,IAAI;AAER,WAAO,KAAK,GAAG;AACb,UAAI,OAAO;AACX,WAAK,IAAI,GAAG,IAAI,KAAK,KAAK;AACxB,YAAI,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI;AACrB,YAAI,IAAI,CAAC,MAAM;AACb,iBAAO;MACjB;AACM,UAAI,CAAC;AACH;AACF;AACA;IACN;AACI,QAAI,KAAK;AACP;AACF,UAAM,IAAI,KAAK,CAAC;AAChB,QAAI,IAAI;AACN;AAEF,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK;AACxB,UAAI,IAAI,IAAI,CAAC;AAEb,UAAI,MAAM;AACR;eACO,IAAI;AACX,YAAI,IAAI,CAAC,EAAG,IAAI,KAAM,CAAC;eAChB,IAAI;AACX,YAAI,IAAI,CAAC,EAAG,CAAC,IAAI,KAAM,CAAC,EAAE,IAAG;AAE/B,UAAI,EAAE,SAAS;AACb,cAAM,IAAI,SAAS,CAAC;;AAEpB,cAAM,IAAI,IAAI,CAAC;IACvB;EACA;AAEE,OAAK,IAAI,GAAG,IAAI,KAAK;AACnB,QAAI,CAAC,IAAI;AAEX,MAAI;AACF,WAAO;;AAEP,WAAO,IAAI,IAAG;AAClB;AAEA,SAAS,UAAUkU,QAAOrT,OAAM;AAC9B,OAAK,QAAQqT;AACb,OAAK,OAAOrT;AACZ,OAAK,cAAc;AACrB;AACA,UAAU,YAAY;AAEtB,UAAU,UAAU,KAAK,SAAS,KAAc;AAC9C,QAAM,IAAI,MAAM,iBAAiB;AACnC;AAEA,UAAU,UAAU,WAAW,SAASsT,YAAW;AACjD,SAAO,KAAK,MAAM,SAAS,IAAI;AACjC;AAEA,UAAU,UAAU,cAAc,SAAS,YAAY,OAAO,KAAK;AACjE,UAAQnP,QAAM,QAAQ,OAAO,GAAG;AAEhC,MAAI,MAAM,KAAK,EAAE,WAAU;AAG3B,OAAK,MAAM,CAAC,MAAM,KAAQ,MAAM,CAAC,MAAM,KAAQ,MAAM,CAAC,MAAM,MACxD,MAAM,SAAS,MAAM,IAAI,KAAK;AAChC,QAAI,MAAM,CAAC,MAAM;AACf9D,eAAO,MAAM,MAAM,SAAS,CAAC,IAAI,MAAM,CAAC;aACjC,MAAM,CAAC,MAAM;AACpBA,eAAO,MAAM,MAAM,SAAS,CAAC,IAAI,MAAM,CAAC;AAE1C,QAAI,MAAO,KAAK;MAAM,MAAM,MAAM,GAAG,IAAI,GAAG;MAC1C,MAAM,MAAM,IAAI,KAAK,IAAI,IAAI,GAAG;IAAC;AAEnC,WAAO;EACX,YAAc,MAAM,CAAC,MAAM,KAAQ,MAAM,CAAC,MAAM,MAClC,MAAM,SAAS,MAAM,KAAK;AACpC,WAAO,KAAK,WAAW,MAAM,MAAM,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC,MAAM,CAAI;EACrE;AACE,QAAM,IAAI,MAAM,sBAAsB;AACxC;AAEA,UAAU,UAAU,mBAAmB,SAAS,iBAAiB,KAAK;AACpE,SAAO,KAAK,OAAO,KAAK,IAAI;AAC9B;AAEA,UAAU,UAAU,UAAU,SAAS,QAAQ,SAAS;AACtD,MAAI,MAAM,KAAK,MAAM,EAAE,WAAU;AACjC,MAAI,IAAI,KAAK,KAAI,EAAG,QAAQ,MAAM,GAAG;AAErC,MAAI;AACF,WAAO,CAAE,KAAK,KAAI,EAAG,OAAM,IAAK,IAAO,CAAI,EAAG,OAAO,CAAC;AAExD,SAAO,CAAE,CAAI,EAAG,OAAO,GAAG,KAAK,KAAI,EAAG,QAAQ,MAAM,GAAG,CAAC;AAC1D;AAEA,UAAU,UAAU,SAAS,SAASsC,QAAO,KAAK,SAAS;AACzD,SAAOwB,QAAM,OAAO,KAAK,QAAQ,OAAO,GAAG,GAAG;AAChD;AAEA,UAAU,UAAU,aAAa,SAAS,WAAW,OAAO;AAC1D,MAAI,KAAK;AACP,WAAO;AAET,MAAI,cAAc;IAChB,SAAS;IACT,KAAK;IACL,MAAM;EACV;AACE,cAAY,MAAM,KAAK,cAAc,CAAC;AACtC,cAAY,UAAU,KAAK,YAAY,GAAG,KAAK;AAC/C,cAAY,OAAO,KAAK,SAAQ;AAChC,OAAK,cAAc;AAEnB,SAAO;AACT;AAEA,UAAU,UAAU,cAAc,SAAS,YAAY,GAAG;AACxD,MAAI,CAAC,KAAK;AACR,WAAO;AAET,MAAI,UAAU,KAAK,YAAY;AAC/B,MAAI,CAAC;AACH,WAAO;AAET,SAAO,QAAQ,OAAO,UAAU,KAAK,MAAM,EAAE,UAAS,IAAK,KAAK,QAAQ,IAAI;AAC9E;AAEA,UAAU,UAAU,cAAc,SAAS,YAAY,MAAM,OAAO;AAClE,MAAI,KAAK,eAAe,KAAK,YAAY;AACvC,WAAO,KAAK,YAAY;AAE1B,MAAI,UAAU,CAAE,IAAI;AACpB,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK,MAAM;AACpC,aAAS,IAAI,GAAG,IAAI,MAAM;AACxB,YAAM,IAAI,IAAG;AACf,YAAQ,KAAK,GAAG;EACpB;AACE,SAAO;IACL;IACA,QAAQ;EACZ;AACA;AAEA,UAAU,UAAU,gBAAgB,SAAS,cAAc,KAAK;AAC9D,MAAI,KAAK,eAAe,KAAK,YAAY;AACvC,WAAO,KAAK,YAAY;AAE1B,MAAI,MAAM,CAAE,IAAI;AAChB,MAAIhF,QAAO,KAAK,OAAO;AACvB,MAAIoU,OAAMpU,SAAQ,IAAI,OAAO,KAAK,IAAG;AACrC,WAAS,IAAI,GAAG,IAAIA,MAAK;AACvB,QAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,IAAIoU,IAAG;AAC7B,SAAO;IACL;IACA,QAAQ;EACZ;AACA;AAEA,UAAU,UAAU,WAAW,SAAS,WAAW;AACjD,SAAO;AACT;AAEA,UAAU,UAAU,OAAO,SAAS,KAAK,GAAG;AAC1C,MAAI5S,KAAI;AACR,WAAS,IAAI,GAAG,IAAI,GAAG;AACrB,IAAAA,KAAIA,GAAE,IAAG;AACX,SAAOA;AACT;AC1XA,IAAIwD,UAAQ7F;AACZ,IAAIiC,OAAK/B;AACT,IAAI8B,aAAW6B;AACf,IAAItC,SAAOgD;AAEX,IAAIxC,WAAS8D,QAAM;AAEnB,SAAS,WAAW,MAAM;AACxBtE,SAAK,KAAK,MAAM,SAAS,IAAI;AAE7B,OAAK,IAAI,IAAIU,KAAG,KAAK,GAAG,EAAE,EAAE,MAAM,KAAK,GAAG;AAC1C,OAAK,IAAI,IAAIA,KAAG,KAAK,GAAG,EAAE,EAAE,MAAM,KAAK,GAAG;AAC1C,OAAK,OAAO,KAAK,IAAI,QAAO;AAE5B,OAAK,QAAQ,KAAK,EAAE,QAAO,EAAG,KAAK,CAAC,MAAM;AAC1C,OAAK,SAAS,KAAK,EAAE,QAAO,EAAG,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,MAAM;AAGxD,OAAK,OAAO,KAAK,iBAAiB,IAAI;AACtC,OAAK,cAAc,IAAI,MAAM,CAAC;AAC9B,OAAK,cAAc,IAAI,MAAM,CAAC;AAChC;AACAD,WAAS,YAAYT,MAAI;IACzB,QAAiB;AAEjB,WAAW,UAAU,mBAAmB,SAAS,iBAAiB,MAAM;AAEtE,MAAI,CAAC,KAAK,SAAS,CAAC,KAAK,KAAK,CAAC,KAAK,KAAK,KAAK,EAAE,KAAK,CAAC,MAAM;AAC1D;AAGF,MAAI;AACJ,MAAI;AACJ,MAAI,KAAK,MAAM;AACb,WAAO,IAAIU,KAAG,KAAK,MAAM,EAAE,EAAE,MAAM,KAAK,GAAG;EAC/C,OAAS;AACL,QAAI,QAAQ,KAAK,cAAc,KAAK,CAAC;AAErC,WAAO,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AACtD,WAAO,KAAK,MAAM,KAAK,GAAG;EAC9B;AACE,MAAI,KAAK,QAAQ;AACf,aAAS,IAAIA,KAAG,KAAK,QAAQ,EAAE;EACnC,OAAS;AAEL,QAAI,UAAU,KAAK,cAAc,KAAK,CAAC;AACvC,QAAI,KAAK,EAAE,IAAI,QAAQ,CAAC,CAAC,EAAE,EAAE,IAAI,KAAK,EAAE,EAAE,OAAO,IAAI,CAAC,MAAM,GAAG;AAC7D,eAAS,QAAQ,CAAC;IACxB,OAAW;AACL,eAAS,QAAQ,CAAC;AAClBF,eAAO,KAAK,EAAE,IAAI,MAAM,EAAE,EAAE,IAAI,KAAK,EAAE,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC;IAClE;EACA;AAGE,MAAI;AACJ,MAAI,KAAK,OAAO;AACd,YAAQ,KAAK,MAAM,IAAI,SAAS,KAAK;AACnC,aAAO;QACL,GAAG,IAAIE,KAAG,IAAI,GAAG,EAAE;QACnB,GAAG,IAAIA,KAAG,IAAI,GAAG,EAAE;MAC3B;IACA,CAAK;EACL,OAAS;AACL,YAAQ,KAAK,cAAc,MAAM;EACrC;AAEE,SAAO;IACL;IACA;IACA;EACJ;AACA;AAEA,WAAW,UAAU,gBAAgB,SAAS,cAAc,KAAK;AAI/D,MAAI,MAAM,QAAQ,KAAK,IAAI,KAAK,MAAMA,KAAG,KAAK,GAAG;AACjD,MAAI,OAAO,IAAIA,KAAG,CAAC,EAAE,MAAM,GAAG,EAAE,QAAO;AACvC,MAAI,QAAQ,KAAK,OAAM;AAEvB,MAAIlC,KAAI,IAAIkC,KAAG,CAAC,EAAE,MAAM,GAAG,EAAE,OAAM,EAAG,QAAO,EAAG,OAAO,IAAI;AAE3D,MAAI,KAAK,MAAM,OAAOlC,EAAC,EAAE,QAAO;AAChC,MAAI,KAAK,MAAM,OAAOA,EAAC,EAAE,QAAO;AAChC,SAAO,CAAE,IAAI,EAAE;AACjB;AAEA,WAAW,UAAU,gBAAgB,SAAS,cAAc,QAAQ;AAElE,MAAI,WAAW,KAAK,EAAE,MAAM,KAAK,MAAM,KAAK,EAAE,UAAS,IAAK,CAAC,CAAC;AAI9D,MAAI,IAAI;AACR,MAAI,IAAI,KAAK,EAAE,MAAK;AACpB,MAAI,KAAK,IAAIkC,KAAG,CAAC;AACjB,MAAI,KAAK,IAAIA,KAAG,CAAC;AACjB,MAAI,KAAK,IAAIA,KAAG,CAAC;AACjB,MAAI,KAAK,IAAIA,KAAG,CAAC;AAGjB,MAAI;AACJ,MAAI;AAEJ,MAAI;AACJ,MAAI;AAEJ,MAAI;AACJ,MAAI;AAEJ,MAAI;AACJ,MAAI,IAAI;AACR,MAAII;AACJ,MAAI;AACJ,SAAO,EAAE,KAAK,CAAC,MAAM,GAAG;AACtB,QAAI,IAAI,EAAE,IAAI,CAAC;AACf,IAAAA,KAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AAClB,QAAI,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC;AACpB,QAAI,IAAI,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC;AAExB,QAAI,CAAC,MAAMA,GAAE,IAAI,QAAQ,IAAI,GAAG;AAC9B,WAAK,MAAM,IAAG;AACd,WAAK;AACL,WAAKA,GAAE,IAAG;AACV,WAAK;IACX,WAAe,MAAM,EAAE,MAAM,GAAG;AAC1B;IACN;AACI,YAAQA;AAER,QAAI;AACJ,QAAIA;AACJ,SAAK;AACL,SAAK;AACL,SAAK;AACL,SAAK;EACT;AACE,OAAKA,GAAE,IAAG;AACV,OAAK;AAEL,MAAI,OAAO,GAAG,IAAG,EAAG,IAAI,GAAG,IAAG,CAAE;AAChC,MAAI,OAAO,GAAG,IAAG,EAAG,IAAI,GAAG,IAAG,CAAE;AAChC,MAAI,KAAK,IAAI,IAAI,KAAK,GAAG;AACvB,SAAK;AACL,SAAK;EACT;AAGE,MAAI,GAAG,UAAU;AACf,SAAK,GAAG,IAAG;AACX,SAAK,GAAG,IAAG;EACf;AACE,MAAI,GAAG,UAAU;AACf,SAAK,GAAG,IAAG;AACX,SAAK,GAAG,IAAG;EACf;AAEE,SAAO;IACL,EAAE,GAAG,IAAI,GAAG,GAAE;IACd,EAAE,GAAG,IAAI,GAAG,GAAE;EAClB;AACA;AAEA,WAAW,UAAU,aAAa,SAAS,WAAW,GAAG;AACvD,MAAI,QAAQ,KAAK,KAAK;AACtB,MAAI,KAAK,MAAM,CAAC;AAChB,MAAI,KAAK,MAAM,CAAC;AAEhB,MAAI,KAAK,GAAG,EAAE,IAAI,CAAC,EAAE,SAAS,KAAK,CAAC;AACpC,MAAI,KAAK,GAAG,EAAE,IAAG,EAAG,IAAI,CAAC,EAAE,SAAS,KAAK,CAAC;AAE1C,MAAI,KAAK,GAAG,IAAI,GAAG,CAAC;AACpB,MAAI,KAAK,GAAG,IAAI,GAAG,CAAC;AACpB,MAAI,KAAK,GAAG,IAAI,GAAG,CAAC;AACpB,MAAI,KAAK,GAAG,IAAI,GAAG,CAAC;AAGpB,MAAI,KAAK,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE;AACzB,MAAI,KAAK,GAAG,IAAI,EAAE,EAAE,IAAG;AACvB,SAAO,EAAE,IAAQ,GAAM;AACzB;AAEA,WAAW,UAAU,aAAa,SAAS,WAAW,GAAG,KAAK;AAC5D,MAAI,IAAIJ,KAAG,GAAG,EAAE;AAChB,MAAI,CAAC,EAAE;AACL,QAAI,EAAE,MAAM,KAAK,GAAG;AAEtB,MAAI,KAAK,EAAE,OAAM,EAAG,OAAO,CAAC,EAAE,QAAQ,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,QAAQ,KAAK,CAAC;AACtE,MAAI,IAAI,GAAG,QAAO;AAClB,MAAI,EAAE,OAAM,EAAG,OAAO,EAAE,EAAE,IAAI,KAAK,IAAI,MAAM;AAC3C,UAAM,IAAI,MAAM,eAAe;AAIjC,MAAI,QAAQ,EAAE,QAAO,EAAG,MAAK;AAC7B,MAAI,OAAO,CAAC,SAAS,CAAC,OAAO;AAC3B,QAAI,EAAE,OAAM;AAEd,SAAO,KAAK,MAAM,GAAG,CAAC;AACxB;AAEA,WAAW,UAAU,WAAW,SAAS+S,UAASE,QAAO;AACvD,MAAIA,OAAM;AACR,WAAO;AAET,MAAI,IAAIA,OAAM;AACd,MAAI,IAAIA,OAAM;AAEd,MAAI,KAAK,KAAK,EAAE,OAAO,CAAC;AACxB,MAAI,MAAM,EAAE,OAAM,EAAG,OAAO,CAAC,EAAE,QAAQ,EAAE,EAAE,QAAQ,KAAK,CAAC;AACzD,SAAO,EAAE,OAAM,EAAG,QAAQ,GAAG,EAAE,KAAK,CAAC,MAAM;AAC7C;AAEA,WAAW,UAAU,kBACjB,SAAS,gBAAgB,QAAQ,QAAQ,gBAAgB;AACvD,MAAI,UAAU,KAAK;AACnB,MAAI,UAAU,KAAK;AACnB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,QAAQ,KAAK,WAAW,OAAO,CAAC,CAAC;AACrC,QAAI,IAAI,OAAO,CAAC;AAChB,QAAI,OAAO,EAAE,SAAQ;AAErB,QAAI,MAAM,GAAG,UAAU;AACrB,YAAM,GAAG,KAAI;AACb,UAAI,EAAE,IAAI,IAAI;IACxB;AACQ,QAAI,MAAM,GAAG,UAAU;AACrB,YAAM,GAAG,KAAI;AACb,aAAO,KAAK,IAAI,IAAI;IAC9B;AAEQ,YAAQ,IAAI,CAAC,IAAI;AACjB,YAAQ,IAAI,IAAI,CAAC,IAAI;AACrB,YAAQ,IAAI,CAAC,IAAI,MAAM;AACvB,YAAQ,IAAI,IAAI,CAAC,IAAI,MAAM;EACnC;AACM,MAAI,MAAM,KAAK,YAAY,GAAG,SAAS,SAAS,IAAI,GAAG,cAAc;AAGrE,WAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,YAAQ,CAAC,IAAI;AACb,YAAQ,CAAC,IAAI;EACrB;AACM,SAAO;AACb;AAEA,SAASC,QAAMJ,QAAO,GAAG,GAAG,OAAO;AACjCxT,SAAK,UAAU,KAAK,MAAMwT,QAAO,QAAQ;AACzC,MAAI,MAAM,QAAQ,MAAM,MAAM;AAC5B,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK,MAAM;EACf,OAAS;AACL,SAAK,IAAI,IAAI9S,KAAG,GAAG,EAAE;AACrB,SAAK,IAAI,IAAIA,KAAG,GAAG,EAAE;AAErB,QAAI,OAAO;AACT,WAAK,EAAE,SAAS,KAAK,MAAM,GAAG;AAC9B,WAAK,EAAE,SAAS,KAAK,MAAM,GAAG;IACpC;AACI,QAAI,CAAC,KAAK,EAAE;AACV,WAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;AACtC,QAAI,CAAC,KAAK,EAAE;AACV,WAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;AACtC,SAAK,MAAM;EACf;AACA;AACAD,WAASmT,SAAO5T,OAAK,SAAS;AAE9B,WAAW,UAAU,QAAQ,SAAS2T,OAAM,GAAG,GAAG,OAAO;AACvD,SAAO,IAAIC,QAAM,MAAM,GAAG,GAAG,KAAK;AACpC;AAEA,WAAW,UAAU,gBAAgB,SAAS,cAAc5U,MAAK,KAAK;AACpE,SAAO4U,QAAM,SAAS,MAAM5U,MAAK,GAAG;AACtC;AAEA4U,QAAM,UAAU,WAAW,SAASC,YAAW;AAC7C,MAAI,CAAC,KAAK,MAAM;AACd;AAEF,MAAI,MAAM,KAAK;AACf,MAAI,OAAO,IAAI;AACb,WAAO,IAAI;AAEb,MAAI,OAAO,KAAK,MAAM,MAAM,KAAK,EAAE,OAAO,KAAK,MAAM,KAAK,IAAI,GAAG,KAAK,CAAC;AACvE,MAAI,KAAK;AACP,QAAIL,SAAQ,KAAK;AACjB,QAAI,UAAU,SAAS,GAAG;AACxB,aAAOA,OAAM,MAAM,EAAE,EAAE,OAAOA,OAAM,KAAK,IAAI,GAAG,EAAE,CAAC;IACzD;AACI,QAAI,OAAO;AACX,SAAK,cAAc;MACjB,MAAM;MACN,KAAK,IAAI,OAAO;QACd,KAAK,IAAI,IAAI;QACb,QAAQ,IAAI,IAAI,OAAO,IAAI,OAAO;MAC1C;MACM,SAAS,IAAI,WAAW;QACtB,MAAM,IAAI,QAAQ;QAClB,QAAQ,IAAI,QAAQ,OAAO,IAAI,OAAO;MAC9C;IACA;EACA;AACE,SAAO;AACT;AAEAI,QAAM,UAAU,SAAS,SAAS,SAAS;AACzC,MAAI,CAAC,KAAK;AACR,WAAO,CAAE,KAAK,GAAG,KAAK,CAAC;AAEzB,SAAO,CAAE,KAAK,GAAG,KAAK,GAAG,KAAK,eAAe;IAC3C,SAAS,KAAK,YAAY,WAAW;MACnC,MAAM,KAAK,YAAY,QAAQ;MAC/B,QAAQ,KAAK,YAAY,QAAQ,OAAO,MAAM,CAAC;IACrD;IACI,KAAK,KAAK,YAAY,OAAO;MAC3B,KAAK,KAAK,YAAY,IAAI;MAC1B,QAAQ,KAAK,YAAY,IAAI,OAAO,MAAM,CAAC;IACjD;EACA,CAAG;AACH;AAEAA,QAAM,WAAW,SAAS,SAASJ,QAAOxU,MAAK,KAAK;AAClD,MAAI,OAAOA,SAAQ;AACjB,IAAAA,OAAM,KAAK,MAAMA,IAAG;AACtB,MAAI,MAAMwU,OAAM,MAAMxU,KAAI,CAAC,GAAGA,KAAI,CAAC,GAAG,GAAG;AACzC,MAAI,CAACA,KAAI,CAAC;AACR,WAAO;AAET,WAAS,UAAUA,MAAK;AACtB,WAAOwU,OAAM,MAAMxU,KAAI,CAAC,GAAGA,KAAI,CAAC,GAAG,GAAG;EAC1C;AAEE,MAAI,MAAMA,KAAI,CAAC;AACf,MAAI,cAAc;IAChB,MAAM;IACN,SAAS,IAAI,WAAW;MACtB,MAAM,IAAI,QAAQ;MAClB,QAAQ,CAAE,GAAG,EAAG,OAAO,IAAI,QAAQ,OAAO,IAAI,SAAS,CAAC;IAC9D;IACI,KAAK,IAAI,OAAO;MACd,KAAK,IAAI,IAAI;MACb,QAAQ,CAAE,GAAG,EAAG,OAAO,IAAI,IAAI,OAAO,IAAI,SAAS,CAAC;IAC1D;EACA;AACE,SAAO;AACT;AAEA4U,QAAM,UAAU,UAAU,SAAS,UAAU;AAC3C,MAAI,KAAK,WAAU;AACjB,WAAO;AACT,SAAO,kBAAkB,KAAK,EAAE,QAAO,EAAG,SAAS,IAAI,CAAC,IACpD,SAAS,KAAK,EAAE,QAAO,EAAG,SAAS,IAAI,CAAC,IAAI;AAClD;AAEAA,QAAM,UAAU,aAAa,SAAS,aAAa;AACjD,SAAO,KAAK;AACd;AAEAA,QAAM,UAAU,MAAM,SAAS,IAAI,GAAG;AAEpC,MAAI,KAAK;AACP,WAAO;AAGT,MAAI,EAAE;AACJ,WAAO;AAGT,MAAI,KAAK,GAAG,CAAC;AACX,WAAO,KAAK,IAAG;AAGjB,MAAI,KAAK,IAAG,EAAG,GAAG,CAAC;AACjB,WAAO,KAAK,MAAM,MAAM,MAAM,IAAI;AAGpC,MAAI,KAAK,EAAE,IAAI,EAAE,CAAC,MAAM;AACtB,WAAO,KAAK,MAAM,MAAM,MAAM,IAAI;AAEpC,MAAI,IAAI,KAAK,EAAE,OAAO,EAAE,CAAC;AACzB,MAAI,EAAE,KAAK,CAAC,MAAM;AAChB,QAAI,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,QAAO,CAAE;AAC3C,MAAI,KAAK,EAAE,OAAM,EAAG,QAAQ,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;AAC/C,MAAI,KAAK,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,KAAK,CAAC;AACnD,SAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AAChC;AAEAA,QAAM,UAAU,MAAM,SAAS,MAAM;AACnC,MAAI,KAAK;AACP,WAAO;AAGT,MAAI,MAAM,KAAK,EAAE,OAAO,KAAK,CAAC;AAC9B,MAAI,IAAI,KAAK,CAAC,MAAM;AAClB,WAAO,KAAK,MAAM,MAAM,MAAM,IAAI;AAEpC,MAAI,IAAI,KAAK,MAAM;AAEnB,MAAI,KAAK,KAAK,EAAE,OAAM;AACtB,MAAI,QAAQ,IAAI,QAAO;AACvB,MAAI,IAAI,GAAG,OAAO,EAAE,EAAE,QAAQ,EAAE,EAAE,QAAQ,CAAC,EAAE,OAAO,KAAK;AAEzD,MAAI,KAAK,EAAE,OAAM,EAAG,QAAQ,KAAK,EAAE,OAAO,KAAK,CAAC,CAAC;AACjD,MAAI,KAAK,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,KAAK,CAAC;AACnD,SAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AAChC;AAEAA,QAAM,UAAU,OAAO,SAAS,OAAO;AACrC,SAAO,KAAK,EAAE,QAAO;AACvB;AAEAA,QAAM,UAAU,OAAO,SAAS,OAAO;AACrC,SAAO,KAAK,EAAE,QAAO;AACvB;AAEAA,QAAM,UAAU,MAAM,SAAS,IAAI,GAAG;AACpC,MAAI,IAAIlT,KAAG,GAAG,EAAE;AAChB,MAAI,KAAK,WAAU;AACjB,WAAO;WACA,KAAK,YAAY,CAAC;AACzB,WAAO,KAAK,MAAM,aAAa,MAAM,CAAC;WAC/B,KAAK,MAAM;AAClB,WAAO,KAAK,MAAM,gBAAgB,CAAE,IAAI,GAAI,CAAE,CAAC,CAAE;;AAEjD,WAAO,KAAK,MAAM,SAAS,MAAM,CAAC;AACtC;AAEAkT,QAAM,UAAU,SAAS,SAAS,OAAO,IAAI,IAAI,IAAI;AACnD,MAAI,SAAS,CAAE,MAAM,EAAE;AACvB,MAAI,SAAS,CAAE,IAAI,EAAE;AACrB,MAAI,KAAK,MAAM;AACb,WAAO,KAAK,MAAM,gBAAgB,QAAQ,MAAM;;AAEhD,WAAO,KAAK,MAAM,YAAY,GAAG,QAAQ,QAAQ,CAAC;AACtD;AAEAA,QAAM,UAAU,UAAU,SAAS,QAAQ,IAAI,IAAI,IAAI;AACrD,MAAI,SAAS,CAAE,MAAM,EAAE;AACvB,MAAI,SAAS,CAAE,IAAI,EAAE;AACrB,MAAI,KAAK,MAAM;AACb,WAAO,KAAK,MAAM,gBAAgB,QAAQ,QAAQ,IAAI;;AAEtD,WAAO,KAAK,MAAM,YAAY,GAAG,QAAQ,QAAQ,GAAG,IAAI;AAC5D;AAEAA,QAAM,UAAU,KAAK,SAAShS,IAAG,GAAG;AAClC,SAAO,SAAS,KACT,KAAK,QAAQ,EAAE,QACV,KAAK,OAAO,KAAK,EAAE,IAAI,EAAE,CAAC,MAAM,KAAK,KAAK,EAAE,IAAI,EAAE,CAAC,MAAM;AACvE;AAEAgS,QAAM,UAAU,MAAM,SAAS,IAAI,aAAa;AAC9C,MAAI,KAAK;AACP,WAAO;AAET,MAAI,MAAM,KAAK,MAAM,MAAM,KAAK,GAAG,KAAK,EAAE,OAAM,CAAE;AAClD,MAAI,eAAe,KAAK,aAAa;AACnC,QAAI,MAAM,KAAK;AACf,QAAI,SAAS,SAAS,GAAG;AACvB,aAAO,EAAE,IAAG;IAClB;AACI,QAAI,cAAc;MAChB,KAAK,IAAI,OAAO;QACd,KAAK,IAAI,IAAI;QACb,QAAQ,IAAI,IAAI,OAAO,IAAI,MAAM;MACzC;MACM,SAAS,IAAI,WAAW;QACtB,MAAM,IAAI,QAAQ;QAClB,QAAQ,IAAI,QAAQ,OAAO,IAAI,MAAM;MAC7C;IACA;EACA;AACE,SAAO;AACT;AAEAA,QAAM,UAAU,MAAM,SAAS,MAAM;AACnC,MAAI,KAAK;AACP,WAAO,KAAK,MAAM,OAAO,MAAM,MAAM,IAAI;AAE3C,MAAI,MAAM,KAAK,MAAM,OAAO,KAAK,GAAG,KAAK,GAAG,KAAK,MAAM,GAAG;AAC1D,SAAO;AACT;AAEA,SAAS,OAAOJ,QAAO,GAAG,GAAG,GAAG;AAC9BxT,SAAK,UAAU,KAAK,MAAMwT,QAAO,UAAU;AAC3C,MAAI,MAAM,QAAQ,MAAM,QAAQ,MAAM,MAAM;AAC1C,SAAK,IAAI,KAAK,MAAM;AACpB,SAAK,IAAI,KAAK,MAAM;AACpB,SAAK,IAAI,IAAI9S,KAAG,CAAC;EACrB,OAAS;AACL,SAAK,IAAI,IAAIA,KAAG,GAAG,EAAE;AACrB,SAAK,IAAI,IAAIA,KAAG,GAAG,EAAE;AACrB,SAAK,IAAI,IAAIA,KAAG,GAAG,EAAE;EACzB;AACE,MAAI,CAAC,KAAK,EAAE;AACV,SAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;AACtC,MAAI,CAAC,KAAK,EAAE;AACV,SAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;AACtC,MAAI,CAAC,KAAK,EAAE;AACV,SAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;AAEtC,OAAK,OAAO,KAAK,MAAM,KAAK,MAAM;AACpC;AACAD,WAAS,QAAQT,OAAK,SAAS;AAE/B,WAAW,UAAU,SAAS,SAAS,OAAO,GAAG,GAAG,GAAG;AACrD,SAAO,IAAI,OAAO,MAAM,GAAG,GAAG,CAAC;AACjC;AAEA,OAAO,UAAU,MAAM,SAAS,MAAM;AACpC,MAAI,KAAK,WAAU;AACjB,WAAO,KAAK,MAAM,MAAM,MAAM,IAAI;AAEpC,MAAI,OAAO,KAAK,EAAE,QAAO;AACzB,MAAI,QAAQ,KAAK,OAAM;AACvB,MAAI,KAAK,KAAK,EAAE,OAAO,KAAK;AAC5B,MAAI,KAAK,KAAK,EAAE,OAAO,KAAK,EAAE,OAAO,IAAI;AAEzC,SAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AAChC;AAEA,OAAO,UAAU,MAAM,SAASoB,OAAM;AACpC,SAAO,KAAK,MAAM,OAAO,KAAK,GAAG,KAAK,EAAE,OAAM,GAAI,KAAK,CAAC;AAC1D;AAEA,OAAO,UAAU,MAAM,SAASE,KAAI,GAAG;AAErC,MAAI,KAAK,WAAU;AACjB,WAAO;AAGT,MAAI,EAAE,WAAU;AACd,WAAO;AAGT,MAAI,MAAM,EAAE,EAAE,OAAM;AACpB,MAAI,KAAK,KAAK,EAAE,OAAM;AACtB,MAAI,KAAK,KAAK,EAAE,OAAO,GAAG;AAC1B,MAAI,KAAK,EAAE,EAAE,OAAO,EAAE;AACtB,MAAI,KAAK,KAAK,EAAE,OAAO,IAAI,OAAO,EAAE,CAAC,CAAC;AACtC,MAAI,KAAK,EAAE,EAAE,OAAO,GAAG,OAAO,KAAK,CAAC,CAAC;AAErC,MAAI,IAAI,GAAG,OAAO,EAAE;AACpB,MAAIR,KAAI,GAAG,OAAO,EAAE;AACpB,MAAI,EAAE,KAAK,CAAC,MAAM,GAAG;AACnB,QAAIA,GAAE,KAAK,CAAC,MAAM;AAChB,aAAO,KAAK,MAAM,OAAO,MAAM,MAAM,IAAI;;AAEzC,aAAO,KAAK,IAAG;EACrB;AAEE,MAAI,KAAK,EAAE,OAAM;AACjB,MAAI,KAAK,GAAG,OAAO,CAAC;AACpB,MAAI,IAAI,GAAG,OAAO,EAAE;AAEpB,MAAI,KAAKA,GAAE,OAAM,EAAG,QAAQ,EAAE,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC;AACpD,MAAI,KAAKA,GAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,GAAG,OAAO,EAAE,CAAC;AACtD,MAAI,KAAK,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,CAAC;AAEpC,SAAO,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;AACrC;AAEA,OAAO,UAAU,WAAW,SAAS,SAAS,GAAG;AAE/C,MAAI,KAAK,WAAU;AACjB,WAAO,EAAE,IAAG;AAGd,MAAI,EAAE,WAAU;AACd,WAAO;AAGT,MAAI,KAAK,KAAK,EAAE,OAAM;AACtB,MAAI,KAAK,KAAK;AACd,MAAI,KAAK,EAAE,EAAE,OAAO,EAAE;AACtB,MAAI,KAAK,KAAK;AACd,MAAI,KAAK,EAAE,EAAE,OAAO,EAAE,EAAE,OAAO,KAAK,CAAC;AAErC,MAAI,IAAI,GAAG,OAAO,EAAE;AACpB,MAAIA,KAAI,GAAG,OAAO,EAAE;AACpB,MAAI,EAAE,KAAK,CAAC,MAAM,GAAG;AACnB,QAAIA,GAAE,KAAK,CAAC,MAAM;AAChB,aAAO,KAAK,MAAM,OAAO,MAAM,MAAM,IAAI;;AAEzC,aAAO,KAAK,IAAG;EACrB;AAEE,MAAI,KAAK,EAAE,OAAM;AACjB,MAAI,KAAK,GAAG,OAAO,CAAC;AACpB,MAAI,IAAI,GAAG,OAAO,EAAE;AAEpB,MAAI,KAAKA,GAAE,OAAM,EAAG,QAAQ,EAAE,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC;AACpD,MAAI,KAAKA,GAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,GAAG,OAAO,EAAE,CAAC;AACtD,MAAI,KAAK,KAAK,EAAE,OAAO,CAAC;AAExB,SAAO,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;AACrC;AAEA,OAAO,UAAU,OAAO,SAASgT,MAAK9S,MAAK;AACzC,MAAIA,SAAQ;AACV,WAAO;AACT,MAAI,KAAK,WAAU;AACjB,WAAO;AACT,MAAI,CAACA;AACH,WAAO,KAAK,IAAG;AAEjB,MAAI;AACJ,MAAI,KAAK,MAAM,SAAS,KAAK,MAAM,QAAQ;AACzC,QAAIF,KAAI;AACR,SAAK,IAAI,GAAG,IAAIE,MAAK;AACnB,MAAAF,KAAIA,GAAE,IAAG;AACX,WAAOA;EACX;AAIE,MAAI,IAAI,KAAK,MAAM;AACnB,MAAI,OAAO,KAAK,MAAM;AAEtB,MAAI,KAAK,KAAK;AACd,MAAI,KAAK,KAAK;AACd,MAAI,KAAK,KAAK;AACd,MAAI,MAAM,GAAG,OAAM,EAAG,OAAM;AAG5B,MAAI,MAAM,GAAG,OAAO,EAAE;AACtB,OAAK,IAAI,GAAG,IAAIE,MAAK,KAAK;AACxB,QAAI,MAAM,GAAG,OAAM;AACnB,QAAI,OAAO,IAAI,OAAM;AACrB,QAAI,OAAO,KAAK,OAAM;AACtB,QAAI,IAAI,IAAI,OAAO,GAAG,EAAE,QAAQ,GAAG,EAAE,QAAQ,EAAE,OAAO,GAAG,CAAC;AAE1D,QAAI,KAAK,GAAG,OAAO,IAAI;AACvB,QAAI,KAAK,EAAE,OAAM,EAAG,QAAQ,GAAG,OAAO,EAAE,CAAC;AACzC,QAAI,KAAK,GAAG,QAAQ,EAAE;AACtB,QAAI,MAAM,EAAE,OAAO,EAAE;AACrB,UAAM,IAAI,QAAQ,GAAG,EAAE,QAAQ,IAAI;AACnC,QAAI,KAAK,IAAI,OAAO,EAAE;AACtB,QAAI,IAAI,IAAIA;AACV,YAAM,IAAI,OAAO,IAAI;AAEvB,SAAK;AACL,SAAK;AACL,UAAM;EACV;AAEE,SAAO,KAAK,MAAM,OAAO,IAAI,IAAI,OAAO,IAAI,GAAG,EAAE;AACnD;AAEA,OAAO,UAAU,MAAM,SAAS0S,OAAM;AACpC,MAAI,KAAK,WAAU;AACjB,WAAO;AAET,MAAI,KAAK,MAAM;AACb,WAAO,KAAK,SAAQ;WACb,KAAK,MAAM;AAClB,WAAO,KAAK,UAAS;;AAErB,WAAO,KAAK,KAAI;AACpB;AAEA,OAAO,UAAU,WAAW,SAAS,WAAW;AAC9C,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,MAAI,KAAK,MAAM;AAMb,QAAI,KAAK,KAAK,EAAE,OAAM;AAEtB,QAAI,KAAK,KAAK,EAAE,OAAM;AAEtB,QAAI,OAAO,GAAG,OAAM;AAEpB,QAAIlV,KAAI,KAAK,EAAE,OAAO,EAAE,EAAE,OAAM,EAAG,QAAQ,EAAE,EAAE,QAAQ,IAAI;AAC3D,IAAAA,KAAIA,GAAE,QAAQA,EAAC;AAEf,QAAI,IAAI,GAAG,OAAO,EAAE,EAAE,QAAQ,EAAE;AAEhC,QAAI,IAAI,EAAE,OAAM,EAAG,QAAQA,EAAC,EAAE,QAAQA,EAAC;AAGvC,QAAI,QAAQ,KAAK,QAAQ,IAAI;AAC7B,YAAQ,MAAM,QAAQ,KAAK;AAC3B,YAAQ,MAAM,QAAQ,KAAK;AAG3B,SAAK;AAEL,SAAK,EAAE,OAAOA,GAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,KAAK;AAEzC,SAAK,KAAK,EAAE,OAAO,KAAK,CAAC;EAC7B,OAAS;AAML,QAAI,IAAI,KAAK,EAAE,OAAM;AAErB,QAAI,IAAI,KAAK,EAAE,OAAM;AAErB,QAAI,IAAI,EAAE,OAAM;AAEhB,QAAI,IAAI,KAAK,EAAE,OAAO,CAAC,EAAE,OAAM,EAAG,QAAQ,CAAC,EAAE,QAAQ,CAAC;AACtD,QAAI,EAAE,QAAQ,CAAC;AAEf,QAAI,IAAI,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC;AAE7B,QAAI8Q,KAAI,EAAE,OAAM;AAGhB,QAAI,KAAK,EAAE,QAAQ,CAAC;AACpB,SAAK,GAAG,QAAQ,EAAE;AAClB,SAAK,GAAG,QAAQ,EAAE;AAGlB,SAAKA,GAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC;AAE3B,SAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE;AAEvC,SAAK,KAAK,EAAE,OAAO,KAAK,CAAC;AACzB,SAAK,GAAG,QAAQ,EAAE;EACtB;AAEE,SAAO,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;AACrC;AAEA,OAAO,UAAU,YAAY,SAAS,YAAY;AAChD,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,MAAI,KAAK,MAAM;AAMb,QAAI,KAAK,KAAK,EAAE,OAAM;AAEtB,QAAI,KAAK,KAAK,EAAE,OAAM;AAEtB,QAAI,OAAO,GAAG,OAAM;AAEpB,QAAI9Q,KAAI,KAAK,EAAE,OAAO,EAAE,EAAE,OAAM,EAAG,QAAQ,EAAE,EAAE,QAAQ,IAAI;AAC3D,IAAAA,KAAIA,GAAE,QAAQA,EAAC;AAEf,QAAI,IAAI,GAAG,OAAO,EAAE,EAAE,QAAQ,EAAE,EAAE,QAAQ,KAAK,MAAM,CAAC;AAEtD,QAAI,IAAI,EAAE,OAAM,EAAG,QAAQA,EAAC,EAAE,QAAQA,EAAC;AAEvC,SAAK;AAEL,QAAI,QAAQ,KAAK,QAAQ,IAAI;AAC7B,YAAQ,MAAM,QAAQ,KAAK;AAC3B,YAAQ,MAAM,QAAQ,KAAK;AAC3B,SAAK,EAAE,OAAOA,GAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,KAAK;AAEzC,SAAK,KAAK,EAAE,OAAO,KAAK,CAAC;EAC7B,OAAS;AAKL,QAAI,QAAQ,KAAK,EAAE,OAAM;AAEzB,QAAI,QAAQ,KAAK,EAAE,OAAM;AAEzB,QAAI,OAAO,KAAK,EAAE,OAAO,KAAK;AAE9B,QAAI,QAAQ,KAAK,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK,CAAC;AAC5D,YAAQ,MAAM,OAAO,KAAK,EAAE,QAAQ,KAAK;AAEzC,QAAI,QAAQ,KAAK,QAAQ,IAAI;AAC7B,YAAQ,MAAM,QAAQ,KAAK;AAC3B,QAAI,QAAQ,MAAM,OAAO,KAAK;AAC9B,SAAK,MAAM,OAAM,EAAG,QAAQ,KAAK;AAEjC,SAAK,KAAK,EAAE,OAAO,KAAK,CAAC,EAAE,OAAM,EAAG,QAAQ,KAAK,EAAE,QAAQ,KAAK;AAEhE,QAAI,UAAU,MAAM,OAAM;AAC1B,cAAU,QAAQ,QAAQ,OAAO;AACjC,cAAU,QAAQ,QAAQ,OAAO;AACjC,cAAU,QAAQ,QAAQ,OAAO;AACjC,SAAK,MAAM,OAAO,MAAM,QAAQ,EAAE,CAAC,EAAE,QAAQ,OAAO;EACxD;AAEE,SAAO,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;AACrC;AAEA,OAAO,UAAU,OAAO,SAAS,OAAO;AACtC,MAAI,IAAI,KAAK,MAAM;AAGnB,MAAI,KAAK,KAAK;AACd,MAAI,KAAK,KAAK;AACd,MAAI,KAAK,KAAK;AACd,MAAI,MAAM,GAAG,OAAM,EAAG,OAAM;AAE5B,MAAI,MAAM,GAAG,OAAM;AACnB,MAAI,MAAM,GAAG,OAAM;AAEnB,MAAI,IAAI,IAAI,OAAO,GAAG,EAAE,QAAQ,GAAG,EAAE,QAAQ,EAAE,OAAO,GAAG,CAAC;AAE1D,MAAI,OAAO,GAAG,OAAO,EAAE;AACvB,SAAO,KAAK,QAAQ,IAAI;AACxB,MAAI,KAAK,KAAK,OAAO,GAAG;AACxB,MAAI,KAAK,EAAE,OAAM,EAAG,QAAQ,GAAG,OAAO,EAAE,CAAC;AACzC,MAAI,KAAK,GAAG,QAAQ,EAAE;AAEtB,MAAI,OAAO,IAAI,OAAM;AACrB,SAAO,KAAK,QAAQ,IAAI;AACxB,SAAO,KAAK,QAAQ,IAAI;AACxB,SAAO,KAAK,QAAQ,IAAI;AACxB,MAAI,KAAK,EAAE,OAAO,EAAE,EAAE,QAAQ,IAAI;AAClC,MAAI,KAAK,GAAG,OAAO,EAAE,EAAE,OAAO,EAAE;AAEhC,SAAO,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;AACrC;AAEA,OAAO,UAAU,OAAO,SAAS,OAAO;AACtC,MAAI,CAAC,KAAK,MAAM;AACd,WAAO,KAAK,IAAG,EAAG,IAAI,IAAI;AAM5B,MAAI,KAAK,KAAK,EAAE,OAAM;AAEtB,MAAI,KAAK,KAAK,EAAE,OAAM;AAEtB,MAAI,KAAK,KAAK,EAAE,OAAM;AAEtB,MAAI,OAAO,GAAG,OAAM;AAEpB,MAAI,IAAI,GAAG,OAAO,EAAE,EAAE,QAAQ,EAAE;AAEhC,MAAI,KAAK,EAAE,OAAM;AAEjB,MAAI,IAAI,KAAK,EAAE,OAAO,EAAE,EAAE,OAAM,EAAG,QAAQ,EAAE,EAAE,QAAQ,IAAI;AAC3D,MAAI,EAAE,QAAQ,CAAC;AACf,MAAI,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC;AACzB,MAAI,EAAE,QAAQ,EAAE;AAEhB,MAAI,KAAK,EAAE,OAAM;AAEjB,MAAI,IAAI,KAAK,QAAQ,IAAI;AACzB,MAAI,EAAE,QAAQ,CAAC;AACf,MAAI,EAAE,QAAQ,CAAC;AACf,MAAI,EAAE,QAAQ,CAAC;AAEf,MAAI,IAAI,EAAE,QAAQ,CAAC,EAAE,OAAM,EAAG,QAAQ,EAAE,EAAE,QAAQ,EAAE,EAAE,QAAQ,CAAC;AAE/D,MAAI,OAAO,GAAG,OAAO,CAAC;AACtB,SAAO,KAAK,QAAQ,IAAI;AACxB,SAAO,KAAK,QAAQ,IAAI;AACxB,MAAI,KAAK,KAAK,EAAE,OAAO,EAAE,EAAE,QAAQ,IAAI;AACvC,OAAK,GAAG,QAAQ,EAAE;AAClB,OAAK,GAAG,QAAQ,EAAE;AAElB,MAAI,KAAK,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;AACnE,OAAK,GAAG,QAAQ,EAAE;AAClB,OAAK,GAAG,QAAQ,EAAE;AAClB,OAAK,GAAG,QAAQ,EAAE;AAElB,MAAI,KAAK,KAAK,EAAE,OAAO,CAAC,EAAE,OAAM,EAAG,QAAQ,EAAE,EAAE,QAAQ,EAAE;AAEzD,SAAO,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;AACrC;AAEA,OAAO,UAAU,MAAM,SAASiB,KAAI,GAAG,OAAO;AAC5C,MAAI,IAAIiB,KAAG,GAAG,KAAK;AAEnB,SAAO,KAAK,MAAM,SAAS,MAAM,CAAC;AACpC;AAEA,OAAO,UAAU,KAAK,SAASkB,IAAG,GAAG;AACnC,MAAI,EAAE,SAAS;AACb,WAAO,KAAK,GAAG,EAAE,IAAG,CAAE;AAExB,MAAI,SAAS;AACX,WAAO;AAGT,MAAI,KAAK,KAAK,EAAE,OAAM;AACtB,MAAI,MAAM,EAAE,EAAE,OAAM;AACpB,MAAI,KAAK,EAAE,OAAO,GAAG,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM;AACzD,WAAO;AAGT,MAAI,KAAK,GAAG,OAAO,KAAK,CAAC;AACzB,MAAI,MAAM,IAAI,OAAO,EAAE,CAAC;AACxB,SAAO,KAAK,EAAE,OAAO,GAAG,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM;AAChE;AAEA,OAAO,UAAU,SAAS,SAAS,OAAO,GAAG;AAC3C,MAAI,KAAK,KAAK,EAAE,OAAM;AACtB,MAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG,EAAE,OAAO,EAAE;AAC1C,MAAI,KAAK,EAAE,IAAI,EAAE,MAAM;AACrB,WAAO;AAET,MAAI,KAAK,EAAE,MAAK;AAChB,MAAI,IAAI,KAAK,MAAM,KAAK,OAAO,EAAE;AACjC,aAAS;AACP,OAAG,KAAK,KAAK,MAAM,CAAC;AACpB,QAAI,GAAG,IAAI,KAAK,MAAM,CAAC,KAAK;AAC1B,aAAO;AAET,OAAG,QAAQ,CAAC;AACZ,QAAI,KAAK,EAAE,IAAI,EAAE,MAAM;AACrB,aAAO;EACb;AACA;AAEA,OAAO,UAAU,UAAU,SAASvC,WAAU;AAC5C,MAAI,KAAK,WAAU;AACjB,WAAO;AACT,SAAO,mBAAmB,KAAK,EAAE,SAAS,IAAI,CAAC,IAC3C,SAAS,KAAK,EAAE,SAAS,IAAI,CAAC,IAC9B,SAAS,KAAK,EAAE,SAAS,IAAI,CAAC,IAAI;AACxC;AAEA,OAAO,UAAU,aAAa,SAAS0U,cAAa;AAElD,SAAO,KAAK,EAAE,KAAK,CAAC,MAAM;AAC5B;ACv6BA,IAAIrT,OAAKjC;AACT,IAAIgC,aAAW9B;AACf,IAAIqB,SAAOsC;AAEX,IAAIgC,UAAQtB;AAEZ,SAAS,UAAU,MAAM;AACvBhD,SAAK,KAAK,MAAM,QAAQ,IAAI;AAE5B,OAAK,IAAI,IAAIU,KAAG,KAAK,GAAG,EAAE,EAAE,MAAM,KAAK,GAAG;AAC1C,OAAK,IAAI,IAAIA,KAAG,KAAK,GAAG,EAAE,EAAE,MAAM,KAAK,GAAG;AAC1C,OAAK,KAAK,IAAIA,KAAG,CAAC,EAAE,MAAM,KAAK,GAAG,EAAE,QAAO;AAC3C,OAAK,MAAM,IAAIA,KAAG,CAAC,EAAE,MAAM,KAAK,GAAG;AACnC,OAAK,MAAM,KAAK,GAAG,OAAO,KAAK,EAAE,OAAO,KAAK,GAAG,CAAC;AACnD;AACAD,WAAS,WAAWT,MAAI;IACxB,OAAiB;AAEjB,UAAU,UAAU,WAAW,SAASyT,UAASE,QAAO;AACtD,MAAI,IAAIA,OAAM,UAAS,EAAG;AAC1B,MAAI,KAAK,EAAE,OAAM;AACjB,MAAI,MAAM,GAAG,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC;AACzD,MAAI,IAAI,IAAI,QAAO;AAEnB,SAAO,EAAE,OAAM,EAAG,IAAI,GAAG,MAAM;AACjC;AAEA,SAASC,QAAMJ,QAAO,GAAG,GAAG;AAC1BxT,SAAK,UAAU,KAAK,MAAMwT,QAAO,YAAY;AAC7C,MAAI,MAAM,QAAQ,MAAM,MAAM;AAC5B,SAAK,IAAI,KAAK,MAAM;AACpB,SAAK,IAAI,KAAK,MAAM;EACxB,OAAS;AACL,SAAK,IAAI,IAAI9S,KAAG,GAAG,EAAE;AACrB,SAAK,IAAI,IAAIA,KAAG,GAAG,EAAE;AACrB,QAAI,CAAC,KAAK,EAAE;AACV,WAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;AACtC,QAAI,CAAC,KAAK,EAAE;AACV,WAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;EAC1C;AACA;AACAD,WAASmT,SAAO5T,OAAK,SAAS;AAE9B,UAAU,UAAU,cAAc,SAASgU,aAAY,OAAO,KAAK;AACjE,SAAO,KAAK,MAAM1P,QAAM,QAAQ,OAAO,GAAG,GAAG,CAAC;AAChD;AAEA,UAAU,UAAU,QAAQ,SAASqP,OAAM,GAAG,GAAG;AAC/C,SAAO,IAAIC,QAAM,MAAM,GAAG,CAAC;AAC7B;AAEA,UAAU,UAAU,gBAAgB,SAASK,eAAcjV,MAAK;AAC9D,SAAO4U,QAAM,SAAS,MAAM5U,IAAG;AACjC;AAEA4U,QAAM,UAAU,aAAa,SAASM,cAAa;AAEnD;AAEAN,QAAM,UAAU,UAAU,SAASO,WAAU;AAC3C,SAAO,KAAK,KAAI,EAAG,QAAQ,MAAM,KAAK,MAAM,EAAE,WAAU,CAAE;AAC5D;AAEAP,QAAM,WAAW,SAASQ,UAASZ,QAAOxU,MAAK;AAC7C,SAAO,IAAI4U,QAAMJ,QAAOxU,KAAI,CAAC,GAAGA,KAAI,CAAC,KAAKwU,OAAM,GAAG;AACrD;AAEAI,QAAM,UAAU,UAAU,SAASvU,WAAU;AAC3C,MAAI,KAAK,WAAU;AACjB,WAAO;AACT,SAAO,kBAAkB,KAAK,EAAE,QAAO,EAAG,SAAS,IAAI,CAAC,IACpD,SAAS,KAAK,EAAE,QAAO,EAAG,SAAS,IAAI,CAAC,IAAI;AAClD;AAEAuU,QAAM,UAAU,aAAa,SAASG,cAAa;AAEjD,SAAO,KAAK,EAAE,KAAK,CAAC,MAAM;AAC5B;AAEAH,QAAM,UAAU,MAAM,SAASF,OAAM;AAKnC,MAAI,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC;AAE5B,MAAI,KAAK,EAAE,OAAM;AAEjB,MAAI,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC;AAE5B,MAAI,KAAK,EAAE,OAAM;AAEjB,MAAI,IAAI,GAAG,OAAO,EAAE;AAEpB,MAAI,KAAK,GAAG,OAAO,EAAE;AAErB,MAAI,KAAK,EAAE,OAAO,GAAG,OAAO,KAAK,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC;AACrD,SAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AAChC;AAEAE,QAAM,UAAU,MAAM,SAAStS,OAAM;AACnC,QAAM,IAAI,MAAM,mCAAmC;AACrD;AAEAsS,QAAM,UAAU,UAAU,SAAS,QAAQ,GAAG,MAAM;AAKlD,MAAI,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC;AAE5B,MAAI,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC;AAE5B,MAAI,IAAI,EAAE,EAAE,OAAO,EAAE,CAAC;AAEtB,MAAI,IAAI,EAAE,EAAE,OAAO,EAAE,CAAC;AAEtB,MAAI,KAAK,EAAE,OAAO,CAAC;AAEnB,MAAI,KAAK,EAAE,OAAO,CAAC;AAEnB,MAAI,KAAK,KAAK,EAAE,OAAO,GAAG,OAAO,EAAE,EAAE,OAAM,CAAE;AAE7C,MAAI,KAAK,KAAK,EAAE,OAAO,GAAG,QAAQ,EAAE,EAAE,OAAM,CAAE;AAC9C,SAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AAChC;AAEAA,QAAM,UAAU,MAAM,SAASnU,KAAI,GAAG;AACpC,MAAI,IAAI,EAAE,MAAK;AACf,MAAI,IAAI;AACR,MAAI,IAAI,KAAK,MAAM,MAAM,MAAM,IAAI;AACnC,MAAI,IAAI;AAER,WAAS,OAAO,CAAA,GAAI,EAAE,KAAK,CAAC,MAAM,GAAG,EAAE,OAAO,CAAC;AAC7C,SAAK,KAAK,EAAE,MAAM,CAAC,CAAC;AAEtB,WAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,QAAI,KAAK,CAAC,MAAM,GAAG;AAEjB,UAAI,EAAE,QAAQ,GAAG,CAAC;AAElB,UAAI,EAAE,IAAG;IACf,OAAW;AAEL,UAAI,EAAE,QAAQ,GAAG,CAAC;AAElB,UAAI,EAAE,IAAG;IACf;EACA;AACE,SAAO;AACT;AAEAmU,QAAM,UAAU,SAAS,SAASS,UAAS;AACzC,QAAM,IAAI,MAAM,mCAAmC;AACrD;AAEAT,QAAM,UAAU,UAAU,SAAS,UAAU;AAC3C,QAAM,IAAI,MAAM,mCAAmC;AACrD;AAEAA,QAAM,UAAU,KAAK,SAAShS,IAAG,OAAO;AACtC,SAAO,KAAK,KAAI,EAAG,IAAI,MAAM,KAAI,CAAE,MAAM;AAC3C;AAEAgS,QAAM,UAAU,YAAY,SAAS,YAAY;AAC/C,OAAK,IAAI,KAAK,EAAE,OAAO,KAAK,EAAE,QAAO,CAAE;AACvC,OAAK,IAAI,KAAK,MAAM;AACpB,SAAO;AACT;AAEAA,QAAM,UAAU,OAAO,SAASU,QAAO;AAErC,OAAK,UAAS;AAEd,SAAO,KAAK,EAAE,QAAO;AACvB;AC/KA,IAAIhQ,UAAQ7F;AACZ,IAAIiC,OAAK/B;AACT,IAAI8B,aAAW6B;AACf,IAAI,OAAOU;AAEX,IAAIxC,WAAS8D,QAAM;AAEnB,SAAS,aAAa,MAAM;AAE1B,OAAK,WAAW,KAAK,IAAI,OAAO;AAChC,OAAK,QAAQ,KAAK,YAAY,KAAK,IAAI,OAAO;AAC9C,OAAK,WAAW,KAAK;AAErB,OAAK,KAAK,MAAM,WAAW,IAAI;AAE/B,OAAK,IAAI,IAAI5D,KAAG,KAAK,GAAG,EAAE,EAAE,KAAK,KAAK,IAAI,CAAC;AAC3C,OAAK,IAAI,KAAK,EAAE,MAAM,KAAK,GAAG;AAC9B,OAAK,IAAI,IAAIA,KAAG,KAAK,GAAG,EAAE,EAAE,MAAM,KAAK,GAAG;AAC1C,OAAK,KAAK,KAAK,EAAE,OAAM;AACvB,OAAK,IAAI,IAAIA,KAAG,KAAK,GAAG,EAAE,EAAE,MAAM,KAAK,GAAG;AAC1C,OAAK,KAAK,KAAK,EAAE,OAAO,KAAK,CAAC;AAE9BF,WAAO,CAAC,KAAK,WAAW,KAAK,EAAE,QAAO,EAAG,KAAK,CAAC,MAAM,CAAC;AACtD,OAAK,QAAQ,KAAK,IAAI,OAAO;AAC/B;AACAC,WAAS,cAAc,IAAI;IAC3B,UAAiB;AAEjB,aAAa,UAAU,QAAQ,SAAS,MAAM,KAAK;AACjD,MAAI,KAAK;AACP,WAAO,IAAI,OAAM;;AAEjB,WAAO,KAAK,EAAE,OAAO,GAAG;AAC5B;AAEA,aAAa,UAAU,QAAQ,SAAS,MAAM,KAAK;AACjD,MAAI,KAAK;AACP,WAAO;;AAEP,WAAO,KAAK,EAAE,OAAO,GAAG;AAC5B;AAGA,aAAa,UAAU,SAAS,SAAS8T,QAAO,GAAG,GAAG,GAAG,GAAG;AAC1D,SAAO,KAAK,MAAM,GAAG,GAAG,GAAG,CAAC;AAC9B;AAEA,aAAa,UAAU,aAAa,SAASC,YAAW,GAAG,KAAK;AAC9D,MAAI,IAAI9T,KAAG,GAAG,EAAE;AAChB,MAAI,CAAC,EAAE;AACL,QAAI,EAAE,MAAM,KAAK,GAAG;AAEtB,MAAI,KAAK,EAAE,OAAM;AACjB,MAAI,MAAM,KAAK,GAAG,OAAO,KAAK,EAAE,OAAO,EAAE,CAAC;AAC1C,MAAI,MAAM,KAAK,IAAI,OAAO,KAAK,GAAG,OAAO,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC;AAE3D,MAAI,KAAK,IAAI,OAAO,IAAI,QAAO,CAAE;AACjC,MAAI,IAAI,GAAG,QAAO;AAClB,MAAI,EAAE,OAAM,EAAG,OAAO,EAAE,EAAE,IAAI,KAAK,IAAI,MAAM;AAC3C,UAAM,IAAI,MAAM,eAAe;AAEjC,MAAI,QAAQ,EAAE,QAAO,EAAG,MAAK;AAC7B,MAAI,OAAO,CAAC,SAAS,CAAC,OAAO;AAC3B,QAAI,EAAE,OAAM;AAEd,SAAO,KAAK,MAAM,GAAG,CAAC;AACxB;AAEA,aAAa,UAAU,aAAa,SAAS,WAAW,GAAG,KAAK;AAC9D,MAAI,IAAIA,KAAG,GAAG,EAAE;AAChB,MAAI,CAAC,EAAE;AACL,QAAI,EAAE,MAAM,KAAK,GAAG;AAGtB,MAAI,KAAK,EAAE,OAAM;AACjB,MAAI,MAAM,GAAG,OAAO,KAAK,EAAE;AAC3B,MAAI,MAAM,GAAG,OAAO,KAAK,CAAC,EAAE,OAAO,KAAK,EAAE,EAAE,OAAO,KAAK,CAAC;AACzD,MAAI,KAAK,IAAI,OAAO,IAAI,QAAO,CAAE;AAEjC,MAAI,GAAG,IAAI,KAAK,IAAI,MAAM,GAAG;AAC3B,QAAI;AACF,YAAM,IAAI,MAAM,eAAe;;AAE/B,aAAO,KAAK,MAAM,KAAK,MAAM,CAAC;EACpC;AAEE,MAAI,IAAI,GAAG,QAAO;AAClB,MAAI,EAAE,OAAM,EAAG,OAAO,EAAE,EAAE,IAAI,KAAK,IAAI,MAAM;AAC3C,UAAM,IAAI,MAAM,eAAe;AAEjC,MAAI,EAAE,QAAO,EAAG,MAAK,MAAO;AAC1B,QAAI,EAAE,OAAM;AAEd,SAAO,KAAK,MAAM,GAAG,CAAC;AACxB;AAEA,aAAa,UAAU,WAAW,SAAS+S,UAASE,QAAO;AACzD,MAAIA,OAAM,WAAU;AAClB,WAAO;AAGT,EAAAA,OAAM,UAAS;AAEf,MAAI,KAAKA,OAAM,EAAE,OAAM;AACvB,MAAI,KAAKA,OAAM,EAAE,OAAM;AACvB,MAAI,MAAM,GAAG,OAAO,KAAK,CAAC,EAAE,OAAO,EAAE;AACrC,MAAI,MAAM,KAAK,GAAG,OAAO,KAAK,IAAI,OAAO,KAAK,EAAE,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AAEtE,SAAO,IAAI,IAAI,GAAG,MAAM;AAC1B;AAEA,SAAS,MAAMH,QAAO,GAAG,GAAG,GAAG,GAAG;AAChC,OAAK,UAAU,KAAK,MAAMA,QAAO,YAAY;AAC7C,MAAI,MAAM,QAAQ,MAAM,QAAQ,MAAM,MAAM;AAC1C,SAAK,IAAI,KAAK,MAAM;AACpB,SAAK,IAAI,KAAK,MAAM;AACpB,SAAK,IAAI,KAAK,MAAM;AACpB,SAAK,IAAI,KAAK,MAAM;AACpB,SAAK,OAAO;EAChB,OAAS;AACL,SAAK,IAAI,IAAI9S,KAAG,GAAG,EAAE;AACrB,SAAK,IAAI,IAAIA,KAAG,GAAG,EAAE;AACrB,SAAK,IAAI,IAAI,IAAIA,KAAG,GAAG,EAAE,IAAI,KAAK,MAAM;AACxC,SAAK,IAAI,KAAK,IAAIA,KAAG,GAAG,EAAE;AAC1B,QAAI,CAAC,KAAK,EAAE;AACV,WAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;AACtC,QAAI,CAAC,KAAK,EAAE;AACV,WAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;AACtC,QAAI,CAAC,KAAK,EAAE;AACV,WAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;AACtC,QAAI,KAAK,KAAK,CAAC,KAAK,EAAE;AACpB,WAAK,IAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG;AACtC,SAAK,OAAO,KAAK,MAAM,KAAK,MAAM;AAGlC,QAAI,KAAK,MAAM,YAAY,CAAC,KAAK,GAAG;AAClC,WAAK,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC;AAC7B,UAAI,CAAC,KAAK;AACR,aAAK,IAAI,KAAK,EAAE,OAAO,KAAK,EAAE,QAAO,CAAE;IAC/C;EACA;AACA;AACAD,WAAS,OAAO,KAAK,SAAS;AAE9B,aAAa,UAAU,gBAAgB,SAASwT,eAAcjV,MAAK;AACjE,SAAO,MAAM,SAAS,MAAMA,IAAG;AACjC;AAEA,aAAa,UAAU,QAAQ,SAAS2U,OAAM,GAAG,GAAG,GAAG,GAAG;AACxD,SAAO,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC;AACnC;AAEA,MAAM,WAAW,SAASS,UAASZ,QAAOxU,MAAK;AAC7C,SAAO,IAAI,MAAMwU,QAAOxU,KAAI,CAAC,GAAGA,KAAI,CAAC,GAAGA,KAAI,CAAC,CAAC;AAChD;AAEA,MAAM,UAAU,UAAU,SAASK,WAAU;AAC3C,MAAI,KAAK,WAAU;AACjB,WAAO;AACT,SAAO,kBAAkB,KAAK,EAAE,QAAO,EAAG,SAAS,IAAI,CAAC,IACpD,SAAS,KAAK,EAAE,QAAO,EAAG,SAAS,IAAI,CAAC,IACxC,SAAS,KAAK,EAAE,QAAO,EAAG,SAAS,IAAI,CAAC,IAAI;AAClD;AAEA,MAAM,UAAU,aAAa,SAAS0U,cAAa;AAEjD,SAAO,KAAK,EAAE,KAAK,CAAC,MAAM,MACvB,KAAK,EAAE,IAAI,KAAK,CAAC,MAAM,KACvB,KAAK,QAAQ,KAAK,EAAE,IAAI,KAAK,MAAM,CAAC,MAAM;AAC/C;AAEA,MAAM,UAAU,UAAU,SAAS,UAAU;AAM3C,MAAI,IAAI,KAAK,EAAE,OAAM;AAErB,MAAI,IAAI,KAAK,EAAE,OAAM;AAErB,MAAI,IAAI,KAAK,EAAE,OAAM;AACrB,MAAI,EAAE,QAAQ,CAAC;AAEf,MAAI,IAAI,KAAK,MAAM,MAAM,CAAC;AAE1B,MAAI,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC,EAAE,OAAM,EAAG,QAAQ,CAAC,EAAE,QAAQ,CAAC;AAE3D,MAAI,IAAI,EAAE,OAAO,CAAC;AAElB,MAAIzE,KAAI,EAAE,OAAO,CAAC;AAElB,MAAI,IAAI,EAAE,OAAO,CAAC;AAElB,MAAI,KAAK,EAAE,OAAOA,EAAC;AAEnB,MAAI,KAAK,EAAE,OAAO,CAAC;AAEnB,MAAI,KAAK,EAAE,OAAO,CAAC;AAEnB,MAAI,KAAKA,GAAE,OAAO,CAAC;AACnB,SAAO,KAAK,MAAM,MAAM,IAAI,IAAI,IAAI,EAAE;AACxC;AAEA,MAAM,UAAU,WAAW,SAAS,WAAW;AAQ7C,MAAI,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC,EAAE,OAAM;AAEpC,MAAI,IAAI,KAAK,EAAE,OAAM;AAErB,MAAI,IAAI,KAAK,EAAE,OAAM;AAErB,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI,KAAK,MAAM,SAAS;AAEtB,QAAI,KAAK,MAAM,MAAM,CAAC;AAEtB,QAAIA,KAAI,EAAE,OAAO,CAAC;AAClB,QAAI,KAAK,MAAM;AAEb,WAAK,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,OAAOA,GAAE,OAAO,KAAK,MAAM,GAAG,CAAC;AAE1D,WAAKA,GAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAEzB,WAAKA,GAAE,OAAM,EAAG,OAAOA,EAAC,EAAE,OAAOA,EAAC;IACxC,OAAW;AAEL,UAAI,KAAK,EAAE,OAAM;AAEjB,UAAIA,GAAE,OAAO,CAAC,EAAE,QAAQ,CAAC;AAEzB,WAAK,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,EAAE,OAAO,CAAC;AAEpC,WAAKA,GAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAEzB,WAAKA,GAAE,OAAO,CAAC;IACrB;EACA,OAAS;AAEL,QAAI,EAAE,OAAO,CAAC;AAEd,QAAI,KAAK,MAAM,MAAM,KAAK,CAAC,EAAE,OAAM;AAEnC,QAAI,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC;AAExB,SAAK,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC;AAE5C,SAAK,KAAK,MAAM,MAAM,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;AAE5C,SAAK,EAAE,OAAO,CAAC;EACnB;AACE,SAAO,KAAK,MAAM,MAAM,IAAI,IAAI,EAAE;AACpC;AAEA,MAAM,UAAU,MAAM,SAASoE,OAAM;AACnC,MAAI,KAAK,WAAU;AACjB,WAAO;AAGT,MAAI,KAAK,MAAM;AACb,WAAO,KAAK,QAAO;;AAEnB,WAAO,KAAK,SAAQ;AACxB;AAEA,MAAM,UAAU,UAAU,SAAS,QAAQ,GAAG;AAM5C,MAAI,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC,EAAE,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AAEpD,MAAI,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC,EAAE,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AAEpD,MAAI,IAAI,KAAK,EAAE,OAAO,KAAK,MAAM,EAAE,EAAE,OAAO,EAAE,CAAC;AAE/C,MAAI,IAAI,KAAK,EAAE,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AAErC,MAAI,IAAI,EAAE,OAAO,CAAC;AAElB,MAAIpE,KAAI,EAAE,OAAO,CAAC;AAElB,MAAI,IAAI,EAAE,OAAO,CAAC;AAElB,MAAI,IAAI,EAAE,OAAO,CAAC;AAElB,MAAI,KAAK,EAAE,OAAOA,EAAC;AAEnB,MAAI,KAAK,EAAE,OAAO,CAAC;AAEnB,MAAI,KAAK,EAAE,OAAO,CAAC;AAEnB,MAAI,KAAKA,GAAE,OAAO,CAAC;AACnB,SAAO,KAAK,MAAM,MAAM,IAAI,IAAI,IAAI,EAAE;AACxC;AAEA,MAAM,UAAU,WAAW,SAAS,SAAS,GAAG;AAO9C,MAAI,IAAI,KAAK,EAAE,OAAO,EAAE,CAAC;AAEzB,MAAI,IAAI,EAAE,OAAM;AAEhB,MAAI,IAAI,KAAK,EAAE,OAAO,EAAE,CAAC;AAEzB,MAAI,IAAI,KAAK,EAAE,OAAO,EAAE,CAAC;AAEzB,MAAI,IAAI,KAAK,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC;AAEvC,MAAIA,KAAI,EAAE,OAAO,CAAC;AAElB,MAAI,IAAI,EAAE,OAAO,CAAC;AAElB,MAAI,MAAM,KAAK,EAAE,OAAO,KAAK,CAAC,EAAE,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC;AAC5E,MAAI,KAAK,EAAE,OAAOA,EAAC,EAAE,OAAO,GAAG;AAC/B,MAAI;AACJ,MAAI;AACJ,MAAI,KAAK,MAAM,SAAS;AAEtB,SAAK,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,OAAO,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC;AAErD,SAAKA,GAAE,OAAO,CAAC;EACnB,OAAS;AAEL,SAAK,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAEnC,SAAK,KAAK,MAAM,MAAMA,EAAC,EAAE,OAAO,CAAC;EACrC;AACE,SAAO,KAAK,MAAM,MAAM,IAAI,IAAI,EAAE;AACpC;AAEA,MAAM,UAAU,MAAM,SAAShO,KAAI,GAAG;AACpC,MAAI,KAAK,WAAU;AACjB,WAAO;AACT,MAAI,EAAE,WAAU;AACd,WAAO;AAET,MAAI,KAAK,MAAM;AACb,WAAO,KAAK,QAAQ,CAAC;;AAErB,WAAO,KAAK,SAAS,CAAC;AAC1B;AAEA,MAAM,UAAU,MAAM,SAAS7B,KAAI,GAAG;AACpC,MAAI,KAAK,YAAY,CAAC;AACpB,WAAO,KAAK,MAAM,aAAa,MAAM,CAAC;;AAEtC,WAAO,KAAK,MAAM,SAAS,MAAM,CAAC;AACtC;AAEA,MAAM,UAAU,SAAS,SAAS4U,QAAO,IAAI,GAAG,IAAI;AAClD,SAAO,KAAK,MAAM,YAAY,GAAG,CAAE,MAAM,CAAC,GAAI,CAAE,IAAI,EAAE,GAAI,GAAG,KAAK;AACpE;AAEA,MAAM,UAAU,UAAU,SAASI,SAAQ,IAAI,GAAG,IAAI;AACpD,SAAO,KAAK,MAAM,YAAY,GAAG,CAAE,MAAM,CAAC,GAAI,CAAE,IAAI,EAAE,GAAI,GAAG,IAAI;AACnE;AAEA,MAAM,UAAU,YAAY,SAASC,aAAY;AAC/C,MAAI,KAAK;AACP,WAAO;AAGT,MAAI,KAAK,KAAK,EAAE,QAAO;AACvB,OAAK,IAAI,KAAK,EAAE,OAAO,EAAE;AACzB,OAAK,IAAI,KAAK,EAAE,OAAO,EAAE;AACzB,MAAI,KAAK;AACP,SAAK,IAAI,KAAK,EAAE,OAAO,EAAE;AAC3B,OAAK,IAAI,KAAK,MAAM;AACpB,OAAK,OAAO;AACZ,SAAO;AACT;AAEA,MAAM,UAAU,MAAM,SAAStT,OAAM;AACnC,SAAO,KAAK,MAAM;IAAM,KAAK,EAAE,OAAM;IACnC,KAAK;IACL,KAAK;IACL,KAAK,KAAK,KAAK,EAAE,OAAM;EAAE;AAC7B;AAEA,MAAM,UAAU,OAAO,SAASkT,QAAO;AACrC,OAAK,UAAS;AACd,SAAO,KAAK,EAAE,QAAO;AACvB;AAEA,MAAM,UAAU,OAAO,SAASK,QAAO;AACrC,OAAK,UAAS;AACd,SAAO,KAAK,EAAE,QAAO;AACvB;AAEA,MAAM,UAAU,KAAK,SAAS/S,IAAG,OAAO;AACtC,SAAO,SAAS,SACT,KAAK,KAAI,EAAG,IAAI,MAAM,KAAI,CAAE,MAAM,KAClC,KAAK,KAAI,EAAG,IAAI,MAAM,KAAI,CAAE,MAAM;AAC3C;AAEA,MAAM,UAAU,SAAS,SAASgT,QAAO,GAAG;AAC1C,MAAI,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG,EAAE,OAAO,KAAK,CAAC;AAC9C,MAAI,KAAK,EAAE,IAAI,EAAE,MAAM;AACrB,WAAO;AAET,MAAI,KAAK,EAAE,MAAK;AAChB,MAAI,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,CAAC;AACrC,aAAS;AACP,OAAG,KAAK,KAAK,MAAM,CAAC;AACpB,QAAI,GAAG,IAAI,KAAK,MAAM,CAAC,KAAK;AAC1B,aAAO;AAET,OAAG,QAAQ,CAAC;AACZ,QAAI,KAAK,EAAE,IAAI,EAAE,MAAM;AACrB,aAAO;EACb;AACA;AAGA,MAAM,UAAU,MAAM,MAAM,UAAU;AACtC,MAAM,UAAU,WAAW,MAAM,UAAU;;AChb3C,MAAIpB,SAAQ;AAEZ,EAAAA,OAAM,OAAO/U;AACb,EAAA+U,OAAM,QAAQ7U;AACd,EAAA6U,OAAM,OAAOlR;AACb,EAAAkR,OAAM,UAAUxQ;;;;;ACLhB,IAAIxC,WAAS/B;AACb,IAAIgC,aAAW9B;AAEC2F,QAAA,WAAG7D;AAEnB,SAAS,gBAAgB,KAAK,GAAG;AAC/B,OAAK,IAAI,WAAW,CAAC,IAAI,WAAY,OAAQ;AAC3C,WAAO;EACX;AACE,MAAI,IAAI,KAAK,IAAI,KAAK,IAAI,QAAQ;AAChC,WAAO;EACX;AACE,UAAQ,IAAI,WAAW,IAAI,CAAC,IAAI,WAAY;AAC9C;AAEA,SAAS,QAAQ,KAAK,KAAK;AACzB,MAAI,MAAM,QAAQ,GAAG;AACnB,WAAO,IAAI,MAAK;AAClB,MAAI,CAAC;AACH,WAAO,CAAA;AACT,MAAI,MAAM,CAAA;AACV,MAAI,OAAO,QAAQ,UAAU;AAC3B,QAAI,CAAC,KAAK;AAKR,UAAI,IAAI;AACR,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,IAAI,IAAI,WAAW,CAAC;AACxB,YAAI,IAAI,KAAK;AACX,cAAI,GAAG,IAAI;QACrB,WAAmB,IAAI,MAAM;AACnB,cAAI,GAAG,IAAK,KAAK,IAAK;AACtB,cAAI,GAAG,IAAK,IAAI,KAAM;QAChC,WAAmB,gBAAgB,KAAK,CAAC,GAAG;AAClC,cAAI,UAAY,IAAI,SAAW,OAAO,IAAI,WAAW,EAAE,CAAC,IAAI;AAC5D,cAAI,GAAG,IAAK,KAAK,KAAM;AACvB,cAAI,GAAG,IAAM,KAAK,KAAM,KAAM;AAC9B,cAAI,GAAG,IAAM,KAAK,IAAK,KAAM;AAC7B,cAAI,GAAG,IAAK,IAAI,KAAM;QAChC,OAAe;AACL,cAAI,GAAG,IAAK,KAAK,KAAM;AACvB,cAAI,GAAG,IAAM,KAAK,IAAK,KAAM;AAC7B,cAAI,GAAG,IAAK,IAAI,KAAM;QAChC;MACA;IACA,WAAe,QAAQ,OAAO;AACxB,YAAM,IAAI,QAAQ,gBAAgB,EAAE;AACpC,UAAI,IAAI,SAAS,MAAM;AACrB,cAAM,MAAM;AACd,WAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC/B,YAAI,KAAK,SAAS,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IAClD;EACA,OAAS;AACL,SAAK,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC1B,UAAI,CAAC,IAAI,IAAI,CAAC,IAAI;EACxB;AACE,SAAO;AACT;AACe6D,QAAA,UAAG;AAElB,SAAS,MAAM,KAAK;AAClB,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC9B,WAAO,MAAM,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC;AAClC,SAAO;AACT;AACaA,QAAA,QAAG;AAEhB,SAAS,MAAM,GAAG;AAChB,MAAI,MAAO,MAAM,KACL,MAAM,IAAK,QACX,KAAK,IAAK,YACV,IAAI,QAAS;AACzB,SAAO,QAAQ;AACjB;AACaA,QAAA,QAAG;AAEhB,SAAS,QAAQ,KAAK,QAAQ;AAC5B,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,QAAI,IAAI,IAAI,CAAC;AACb,QAAI,WAAW;AACb,UAAI,MAAM,CAAC;AACb,WAAO,MAAM,EAAE,SAAS,EAAE,CAAC;EAC/B;AACE,SAAO;AACT;AACeA,QAAA,UAAG;AAElB,SAAS,MAAM,MAAM;AACnB,MAAI,KAAK,WAAW;AAClB,WAAO,MAAM;;AAEb,WAAO;AACX;AACaA,QAAA,QAAG;AAEhB,SAAS,MAAM,MAAM;AACnB,MAAI,KAAK,WAAW;AAClB,WAAO,MAAM;WACN,KAAK,WAAW;AACvB,WAAO,OAAO;WACP,KAAK,WAAW;AACvB,WAAO,QAAQ;WACR,KAAK,WAAW;AACvB,WAAO,SAAS;WACT,KAAK,WAAW;AACvB,WAAO,UAAU;WACV,KAAK,WAAW;AACvB,WAAO,WAAW;WACX,KAAK,WAAW;AACvB,WAAO,YAAY;;AAEnB,WAAO;AACX;AACaA,QAAA,QAAG;AAEhB,SAAS,OAAO,KAAK,OAAO,KAAK,QAAQ;AACvC,MAAI,MAAM,MAAM;AAChB9D,WAAO,MAAM,MAAM,CAAC;AACpB,MAAI,MAAM,IAAI,MAAM,MAAM,CAAC;AAC3B,WAAS,IAAI,GAAG,IAAI,OAAO,IAAI,IAAI,QAAQ,KAAK,KAAK,GAAG;AACtD,QAAI;AACJ,QAAI,WAAW;AACb,UAAK,IAAI,CAAC,KAAK,KAAO,IAAI,IAAI,CAAC,KAAK,KAAO,IAAI,IAAI,CAAC,KAAK,IAAK,IAAI,IAAI,CAAC;;AAEvE,UAAK,IAAI,IAAI,CAAC,KAAK,KAAO,IAAI,IAAI,CAAC,KAAK,KAAO,IAAI,IAAI,CAAC,KAAK,IAAK,IAAI,CAAC;AACzE,QAAI,CAAC,IAAI,MAAM;EACnB;AACE,SAAO;AACT;AACc8D,QAAA,SAAG;AAEjB,SAAS,QAAQ,KAAK,QAAQ;AAC5B,MAAI,MAAM,IAAI,MAAM,IAAI,SAAS,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,KAAK,GAAG;AAClD,QAAI,IAAI,IAAI,CAAC;AACb,QAAI,WAAW,OAAO;AACpB,UAAI,CAAC,IAAI,MAAM;AACf,UAAI,IAAI,CAAC,IAAK,MAAM,KAAM;AAC1B,UAAI,IAAI,CAAC,IAAK,MAAM,IAAK;AACzB,UAAI,IAAI,CAAC,IAAI,IAAI;IACvB,OAAW;AACL,UAAI,IAAI,CAAC,IAAI,MAAM;AACnB,UAAI,IAAI,CAAC,IAAK,MAAM,KAAM;AAC1B,UAAI,IAAI,CAAC,IAAK,MAAM,IAAK;AACzB,UAAI,CAAC,IAAI,IAAI;IACnB;EACA;AACE,SAAO;AACT;AACeA,QAAA,UAAG;AAElB,SAASuQ,SAAO,GAAG,GAAG;AACpB,SAAQ,MAAM,IAAM,KAAM,KAAK;AACjC;AACcvQ,QAAA,SAAGuQ;AAEjB,SAASC,SAAO,GAAG,GAAG;AACpB,SAAQ,KAAK,IAAM,MAAO,KAAK;AACjC;AACcxQ,QAAA,SAAGwQ;AAEjB,SAASC,QAAM,GAAG,GAAG;AACnB,SAAQ,IAAI,MAAO;AACrB;AACazQ,QAAA,QAAGyQ;AAEhB,SAASC,UAAQ,GAAG,GAAG,GAAG;AACxB,SAAQ,IAAI,IAAI,MAAO;AACzB;AACe1Q,QAAA,UAAG0Q;AAElB,SAASC,UAAQ,GAAG,GAAG,GAAG,GAAG;AAC3B,SAAQ,IAAI,IAAI,IAAI,MAAO;AAC7B;AACe3Q,QAAA,UAAG2Q;AAElB,SAASC,UAAQ,GAAG,GAAG,GAAG,GAAG,GAAG;AAC9B,SAAQ,IAAI,IAAI,IAAI,IAAI,MAAO;AACjC;AACe5Q,QAAA,UAAG4Q;AAElB,SAASC,QAAM,KAAK,KAAK,IAAI,IAAI;AAC/B,MAAI,KAAK,IAAI,GAAG;AAChB,MAAI,KAAK,IAAI,MAAM,CAAC;AAEpB,MAAI,KAAM,KAAK,OAAQ;AACvB,MAAI,MAAM,KAAK,KAAK,IAAI,KAAK,KAAK;AAClC,MAAI,GAAG,IAAI,OAAO;AAClB,MAAI,MAAM,CAAC,IAAI;AACjB;AACa7Q,QAAA,QAAG6Q;AAEhB,SAASC,WAAS,IAAI,IAAI,IAAI,IAAI;AAChC,MAAI,KAAM,KAAK,OAAQ;AACvB,MAAI,MAAM,KAAK,KAAK,IAAI,KAAK,KAAK;AAClC,SAAO,OAAO;AAChB;AACgB9Q,QAAA,WAAG8Q;AAEnB,SAASC,WAAS,IAAI,IAAI,IAAI,IAAI;AAChC,MAAI,KAAK,KAAK;AACd,SAAO,OAAO;AAChB;AACgB/Q,QAAA,WAAG+Q;AAEnB,SAASC,aAAW,IAAI,IAAI,IAAI,IAAI7F,KAAI,IAAIC,KAAI,IAAI;AAClD,MAAI,QAAQ;AACZ,MAAI,KAAK;AACT,OAAM,KAAK,OAAQ;AACnB,WAAS,KAAK,KAAK,IAAI;AACvB,OAAM,KAAK,OAAQ;AACnB,WAAS,KAAK,KAAK,IAAI;AACvB,OAAM,KAAK,OAAQ;AACnB,WAAS,KAAK,KAAK,IAAI;AAEvB,MAAI,KAAK,KAAK,KAAKD,MAAKC,MAAK;AAC7B,SAAO,OAAO;AAChB;AACkBpL,QAAA,aAAGgR;AAErB,SAASC,aAAW,IAAI,IAAI,IAAI,IAAI9F,KAAI,IAAIC,KAAI,IAAI;AAClD,MAAI,KAAK,KAAK,KAAK,KAAK;AACxB,SAAO,OAAO;AAChB;AACkBpL,QAAA,aAAGiR;AAErB,SAASC,aAAW,IAAI,IAAI,IAAI,IAAI/F,KAAI,IAAIC,KAAI,IAAI,IAAI,IAAI;AAC1D,MAAI,QAAQ;AACZ,MAAI,KAAK;AACT,OAAM,KAAK,OAAQ;AACnB,WAAS,KAAK,KAAK,IAAI;AACvB,OAAM,KAAK,OAAQ;AACnB,WAAS,KAAK,KAAK,IAAI;AACvB,OAAM,KAAK,OAAQ;AACnB,WAAS,KAAK,KAAK,IAAI;AACvB,OAAM,KAAK,OAAQ;AACnB,WAAS,KAAK,KAAK,IAAI;AAEvB,MAAI,KAAK,KAAK,KAAKD,MAAKC,MAAK,KAAK;AAClC,SAAO,OAAO;AAChB;AACkBpL,QAAA,aAAGkR;AAErB,SAASC,aAAW,IAAI,IAAI,IAAI,IAAIhG,KAAI,IAAIC,KAAI,IAAI,IAAI,IAAI;AAC1D,MAAI,KAAK,KAAK,KAAK,KAAK,KAAK;AAE7B,SAAO,OAAO;AAChB;AACkBpL,QAAA,aAAGmR;AAErB,SAASC,YAAU,IAAI,IAAI,KAAK;AAC9B,MAAI5U,KAAK,MAAO,KAAK,MAAS,OAAO;AACrC,SAAOA,OAAM;AACf;AACiBwD,QAAA,YAAGoR;AAEpB,SAASC,YAAU,IAAI,IAAI,KAAK;AAC9B,MAAI7U,KAAK,MAAO,KAAK,MAAS,OAAO;AACrC,SAAOA,OAAM;AACf;AACiBwD,QAAA,YAAGqR;AAEpB,SAASC,WAAS,IAAI,IAAI,KAAK;AAC7B,SAAO,OAAO;AAChB;AACgBtR,QAAA,WAAGsR;AAEnB,SAASC,WAAS,IAAI,IAAI,KAAK;AAC7B,MAAI/U,KAAK,MAAO,KAAK,MAAS,OAAO;AACrC,SAAOA,OAAM;AACf;AACAwD,QAAA,WAAmBuR;;ACnRnB,IAAIvR,UAAQ7F;AACZ,IAAI+B,WAAS7B;AAEb,SAASmX,cAAY;AACnB,OAAK,UAAU;AACf,OAAK,eAAe;AACpB,OAAK,YAAY,KAAK,YAAY;AAClC,OAAK,UAAU,KAAK,YAAY;AAChC,OAAK,eAAe,KAAK,YAAY;AACrC,OAAK,YAAY,KAAK,YAAY,YAAY;AAC9C,OAAK,SAAS;AAEd,OAAK,UAAU,KAAK,YAAY;AAChC,OAAK,WAAW,KAAK,YAAY;AACnC;AACiBC,SAAA,YAAGD;AAEpBA,YAAU,UAAU,SAAS,SAASE,QAAO,KAAK,KAAK;AAErD,QAAM1R,QAAM,QAAQ,KAAK,GAAG;AAC5B,MAAI,CAAC,KAAK;AACR,SAAK,UAAU;;AAEf,SAAK,UAAU,KAAK,QAAQ,OAAO,GAAG;AACxC,OAAK,gBAAgB,IAAI;AAGzB,MAAI,KAAK,QAAQ,UAAU,KAAK,SAAS;AACvC,UAAM,KAAK;AAGX,QAAIxD,KAAI,IAAI,SAAS,KAAK;AAC1B,SAAK,UAAU,IAAI,MAAM,IAAI,SAASA,IAAG,IAAI,MAAM;AACnD,QAAI,KAAK,QAAQ,WAAW;AAC1B,WAAK,UAAU;AAEjB,UAAMwD,QAAM,OAAO,KAAK,GAAG,IAAI,SAASxD,IAAG,KAAK,MAAM;AACtD,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,KAAK;AACxC,WAAK,QAAQ,KAAK,GAAG,IAAI,KAAK,QAAQ;EAC5C;AAEE,SAAO;AACT;AAEAgV,YAAU,UAAU,SAAS,SAAS,OAAO,KAAK;AAChD,OAAK,OAAO,KAAK,KAAI,CAAE;AACvBtV,WAAO,KAAK,YAAY,IAAI;AAE5B,SAAO,KAAK,QAAQ,GAAG;AACzB;AAEAsV,YAAU,UAAU,OAAO,SAAS,MAAM;AACxC,MAAI,MAAM,KAAK;AACf,MAAI,QAAQ,KAAK;AACjB,MAAI,IAAI,SAAU,MAAM,KAAK,aAAa;AAC1C,MAAI,MAAM,IAAI,MAAM,IAAI,KAAK,SAAS;AACtC,MAAI,CAAC,IAAI;AACT,WAAS,IAAI,GAAG,IAAI,GAAG;AACrB,QAAI,CAAC,IAAI;AAGX,UAAQ;AACR,MAAI,KAAK,WAAW,OAAO;AACzB,aAAS,IAAI,GAAG,IAAI,KAAK,WAAW;AAClC,UAAI,GAAG,IAAI;AAEb,QAAI,GAAG,IAAI;AACX,QAAI,GAAG,IAAI;AACX,QAAI,GAAG,IAAI;AACX,QAAI,GAAG,IAAI;AACX,QAAI,GAAG,IAAK,QAAQ,KAAM;AAC1B,QAAI,GAAG,IAAK,QAAQ,KAAM;AAC1B,QAAI,GAAG,IAAK,QAAQ,IAAK;AACzB,QAAI,GAAG,IAAI,MAAM;EACrB,OAAS;AACL,QAAI,GAAG,IAAI,MAAM;AACjB,QAAI,GAAG,IAAK,QAAQ,IAAK;AACzB,QAAI,GAAG,IAAK,QAAQ,KAAM;AAC1B,QAAI,GAAG,IAAK,QAAQ,KAAM;AAC1B,QAAI,GAAG,IAAI;AACX,QAAI,GAAG,IAAI;AACX,QAAI,GAAG,IAAI;AACX,QAAI,GAAG,IAAI;AAEX,SAAK,IAAI,GAAG,IAAI,KAAK,WAAW;AAC9B,UAAI,GAAG,IAAI;EACjB;AAEE,SAAO;AACT;;;ACzFA,IAAIxR,UAAQ7F;AACZ,IAAI,SAAS6F,QAAM;AAEnB,SAAS2R,OAAKzX,IAAG,GAAG,GAAG,GAAG;AACxB,MAAIA,OAAM;AACR,WAAO0X,OAAK,GAAG,GAAG,CAAC;AACrB,MAAI1X,OAAM,KAAKA,OAAM;AACnB,WAAO,IAAI,GAAG,GAAG,CAAC;AACpB,MAAIA,OAAM;AACR,WAAO2X,QAAM,GAAG,GAAG,CAAC;AACxB;AACYJ,SAAA,OAAGE;AAEf,SAASC,OAAK,GAAG,GAAG,GAAG;AACrB,SAAQ,IAAI,IAAO,CAAC,IAAK;AAC3B;AACYH,SAAA,OAAGG;AAEf,SAASC,QAAM,GAAG,GAAG,GAAG;AACtB,SAAQ,IAAI,IAAM,IAAI,IAAM,IAAI;AAClC;AACaJ,SAAA,QAAGI;AAEhB,SAAS,IAAI,GAAG,GAAG,GAAG;AACpB,SAAO,IAAI,IAAI;AACjB;AACWJ,SAAA,MAAG;AAEd,SAASK,SAAO,GAAG;AACjB,SAAO,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,EAAE,IAAI,OAAO,GAAG,EAAE;AACpD;AACcL,SAAA,SAAGK;AAEjB,SAASC,SAAO,GAAG;AACjB,SAAO,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,EAAE,IAAI,OAAO,GAAG,EAAE;AACpD;AACcN,SAAA,SAAGM;AAEjB,SAASC,SAAO,GAAG;AACjB,SAAO,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,EAAE,IAAK,MAAM;AAC/C;AACcP,SAAA,SAAGO;AAEjB,SAASC,SAAO,GAAG;AACjB,SAAO,OAAO,GAAG,EAAE,IAAI,OAAO,GAAG,EAAE,IAAK,MAAM;AAChD;AACAR,SAAA,SAAiBQ;AC9CjB,IAAIjS,UAAQ7F;AACZ,IAAIsX,WAASpX;AACb,IAAI6X,cAAYlU;AAEhB,IAAIwS,WAASxQ,QAAM;AACnB,IAAIyQ,UAAQzQ,QAAM;AAClB,IAAI4Q,YAAU5Q,QAAM;AACpB,IAAI,OAAOkS,YAAU;AACrB,IAAIV,cAAYC,SAAO;AAEvB,IAAI,SAAS;EACX;EAAY;EACZ;EAAY;AACd;AAEA,SAAS,OAAO;AACd,MAAI,EAAE,gBAAgB;AACpB,WAAO,IAAI,KAAI;AAEjBD,cAAU,KAAK,IAAI;AACnB,OAAK,IAAI;IACP;IAAY;IAAY;IACxB;IAAY;EAAU;AACxB,OAAK,IAAI,IAAI,MAAM,EAAE;AACvB;AAEAxR,QAAM,SAAS,MAAMwR,WAAS;IAC9B,KAAiB;AAEjB,KAAK,YAAY;AACjB,KAAK,UAAU;AACf,KAAK,eAAe;AACpB,KAAK,YAAY;AAEjB,KAAK,UAAU,UAAU,SAAS5E,SAAQ,KAAK,OAAO;AACpD,MAAIrC,KAAI,KAAK;AAEb,WAAS,IAAI,GAAG,IAAI,IAAI;AACtB,IAAAA,GAAE,CAAC,IAAI,IAAI,QAAQ,CAAC;AAEtB,SAAM,IAAIA,GAAE,QAAQ;AAClB,IAAAA,GAAE,CAAC,IAAIiG,SAAOjG,GAAE,IAAI,CAAC,IAAIA,GAAE,IAAI,CAAC,IAAIA,GAAE,IAAI,EAAE,IAAIA,GAAE,IAAI,EAAE,GAAG,CAAC;AAE9D,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAEhB,OAAK,IAAI,GAAG,IAAIA,GAAE,QAAQ,KAAK;AAC7B,QAAIrQ,KAAI,CAAC,EAAE,IAAI;AACf,QAAI,IAAI0W,UAAQJ,SAAO,GAAG,CAAC,GAAG,KAAKtW,IAAG,GAAG,GAAG,CAAC,GAAG,GAAGqQ,GAAE,CAAC,GAAG,OAAOrQ,EAAC,CAAC;AAClE,QAAI;AACJ,QAAI;AACJ,QAAIsW,SAAO,GAAG,EAAE;AAChB,QAAI;AACJ,QAAI;EACR;AAEE,OAAK,EAAE,CAAC,IAAIC,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAC9B,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAC9B,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAC9B,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAC9B,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAChC;AAEA,KAAK,UAAU,UAAU,SAASjM,QAAO,KAAK;AAC5C,MAAI,QAAQ;AACV,WAAOxE,QAAM,QAAQ,KAAK,GAAG,KAAK;;AAElC,WAAOA,QAAM,QAAQ,KAAK,GAAG,KAAK;AACtC;ACvEA,IAAIA,UAAQ7F;AACZ,IAAIsX,WAASpX;AACb,IAAI,YAAY2D;AAChB,IAAI9B,WAASwC;AAEb,IAAI+R,UAAQzQ,QAAM;AAClB,IAAI2Q,YAAU3Q,QAAM;AACpB,IAAI,UAAUA,QAAM;AACpB,IAAI,OAAO,UAAU;AACrB,IAAI,QAAQ,UAAU;AACtB,IAAI,SAAS,UAAU;AACvB,IAAI,SAAS,UAAU;AACvB,IAAI,SAAS,UAAU;AACvB,IAAI,SAAS,UAAU;AAEvB,IAAIwR,cAAYC,SAAO;AAEvB,IAAI,WAAW;EACb;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;AACtC;AAEA,SAASU,WAAS;AAChB,MAAI,EAAE,gBAAgBA;AACpB,WAAO,IAAIA,SAAM;AAEnBX,cAAU,KAAK,IAAI;AACnB,OAAK,IAAI;IACP;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;EACxC;AACE,OAAK,IAAI;AACT,OAAK,IAAI,IAAI,MAAM,EAAE;AACvB;AACAxR,QAAM,SAASmS,UAAQX,WAAS;IAChC,OAAiBW;AAEjBA,SAAO,YAAY;AACnBA,SAAO,UAAU;AACjBA,SAAO,eAAe;AACtBA,SAAO,YAAY;AAEnBA,SAAO,UAAU,UAAU,SAASvF,SAAQ,KAAK,OAAO;AACtD,MAAIrC,KAAI,KAAK;AAEb,WAAS,IAAI,GAAG,IAAI,IAAI;AACtB,IAAAA,GAAE,CAAC,IAAI,IAAI,QAAQ,CAAC;AACtB,SAAO,IAAIA,GAAE,QAAQ;AACnB,IAAAA,GAAE,CAAC,IAAIoG,UAAQ,OAAOpG,GAAE,IAAI,CAAC,CAAC,GAAGA,GAAE,IAAI,CAAC,GAAG,OAAOA,GAAE,IAAI,EAAE,CAAC,GAAGA,GAAE,IAAI,EAAE,CAAC;AAEzE,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAIS,KAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAEhB9O,WAAO,KAAK,EAAE,WAAWqO,GAAE,MAAM;AACjC,OAAK,IAAI,GAAG,IAAIA,GAAE,QAAQ,KAAK;AAC7B,QAAI,KAAK,QAAQ,GAAG,OAAO,CAAC,GAAG,KAAK,GAAGS,IAAG,CAAC,GAAG,KAAK,EAAE,CAAC,GAAGT,GAAE,CAAC,CAAC;AAC7D,QAAI,KAAKkG,QAAM,OAAO,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,CAAC;AACxC,QAAI;AACJ,QAAIzF;AACJ,IAAAA,KAAI;AACJ,QAAIyF,QAAM,GAAG,EAAE;AACf,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAIA,QAAM,IAAI,EAAE;EACpB;AAEE,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAC9B,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAC9B,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAC9B,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAC9B,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAC9B,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAGzF,EAAC;AAC9B,OAAK,EAAE,CAAC,IAAIyF,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAC9B,OAAK,EAAE,CAAC,IAAIA,QAAM,KAAK,EAAE,CAAC,GAAG,CAAC;AAChC;AAEA0B,SAAO,UAAU,UAAU,SAAS3N,QAAO,KAAK;AAC9C,MAAI,QAAQ;AACV,WAAOxE,QAAM,QAAQ,KAAK,GAAG,KAAK;;AAElC,WAAOA,QAAM,QAAQ,KAAK,GAAG,KAAK;AACtC;ACtGA,IAAIA,UAAQ7F;AACZ,IAAI,SAASE;AAEb,SAAS,SAAS;AAChB,MAAI,EAAE,gBAAgB;AACpB,WAAO,IAAI,OAAM;AAEnB,SAAO,KAAK,IAAI;AAChB,OAAK,IAAI;IACP;IAAY;IAAY;IAAY;IACpC;IAAY;IAAY;IAAY;EAAU;AAClD;AACA2F,QAAM,SAAS,QAAQ,MAAM;IAC7B,OAAiB;AAEjB,OAAO,YAAY;AACnB,OAAO,UAAU;AACjB,OAAO,eAAe;AACtB,OAAO,YAAY;AAEnB,OAAO,UAAU,UAAU,SAASwE,QAAO,KAAK;AAE9C,MAAI,QAAQ;AACV,WAAOxE,QAAM,QAAQ,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,KAAK;;AAE9C,WAAOA,QAAM,QAAQ,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,KAAK;AAClD;AC1BA,IAAIA,UAAQ7F;AACZ,IAAIsX,WAASpX;AACb,IAAI6B,WAAS8B;AAEb,IAAI,YAAYgC,QAAM;AACtB,IAAI,YAAYA,QAAM;AACtB,IAAI,WAAWA,QAAM;AACrB,IAAI,WAAWA,QAAM;AACrB,IAAI,QAAQA,QAAM;AAClB,IAAI,WAAWA,QAAM;AACrB,IAAI,WAAWA,QAAM;AACrB,IAAI,aAAaA,QAAM;AACvB,IAAI,aAAaA,QAAM;AACvB,IAAI,aAAaA,QAAM;AACvB,IAAI,aAAaA,QAAM;AAEvB,IAAIwR,cAAYC,SAAO;AAEvB,IAAI,WAAW;EACb;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;EACpC;EAAY;EAAY;EAAY;AACtC;AAEA,SAAShG,WAAS;AAChB,MAAI,EAAE,gBAAgBA;AACpB,WAAO,IAAIA,SAAM;AAEnB+F,cAAU,KAAK,IAAI;AACnB,OAAK,IAAI;IACP;IAAY;IACZ;IAAY;IACZ;IAAY;IACZ;IAAY;IACZ;IAAY;IACZ;IAAY;IACZ;IAAY;IACZ;IAAY;EAAU;AACxB,OAAK,IAAI;AACT,OAAK,IAAI,IAAI,MAAM,GAAG;AACxB;AACAxR,QAAM,SAASyL,UAAQ+F,WAAS;IAChC,OAAiB/F;AAEjBA,SAAO,YAAY;AACnBA,SAAO,UAAU;AACjBA,SAAO,eAAe;AACtBA,SAAO,YAAY;AAEnBA,SAAO,UAAU,gBAAgB,SAAS,cAAc,KAAK,OAAO;AAClE,MAAIlB,KAAI,KAAK;AAGb,WAAS,IAAI,GAAG,IAAI,IAAI;AACtB,IAAAA,GAAE,CAAC,IAAI,IAAI,QAAQ,CAAC;AACtB,SAAO,IAAIA,GAAE,QAAQ,KAAK,GAAG;AAC3B,QAAI,QAAQ,UAAUA,GAAE,IAAI,CAAC,GAAGA,GAAE,IAAI,CAAC,CAAC;AACxC,QAAI,QAAQ,UAAUA,GAAE,IAAI,CAAC,GAAGA,GAAE,IAAI,CAAC,CAAC;AACxC,QAAI,QAAQA,GAAE,IAAI,EAAE;AACpB,QAAI,QAAQA,GAAE,IAAI,EAAE;AACpB,QAAI,QAAQ,UAAUA,GAAE,IAAI,EAAE,GAAGA,GAAE,IAAI,EAAE,CAAC;AAC1C,QAAI,QAAQ,UAAUA,GAAE,IAAI,EAAE,GAAGA,GAAE,IAAI,EAAE,CAAC;AAC1C,QAAI,QAAQA,GAAE,IAAI,EAAE;AACpB,QAAI,QAAQA,GAAE,IAAI,EAAE;AAEpB,IAAAA,GAAE,CAAC,IAAI;MACL;MAAO;MACP;MAAO;MACP;MAAO;MACP;MAAO;IAAK;AACd,IAAAA,GAAE,IAAI,CAAC,IAAI;MACT;MAAO;MACP;MAAO;MACP;MAAO;MACP;MAAO;IAAK;EAClB;AACA;AAEAkB,SAAO,UAAU,UAAU,SAASmB,SAAQ,KAAK,OAAO;AACtD,OAAK,cAAc,KAAK,KAAK;AAE7B,MAAIrC,KAAI,KAAK;AAEb,MAAI,KAAK,KAAK,EAAE,CAAC;AACjB,MAAI,KAAK,KAAK,EAAE,CAAC;AACjB,MAAI,KAAK,KAAK,EAAE,CAAC;AACjB,MAAI,KAAK,KAAK,EAAE,CAAC;AACjB,MAAIY,MAAK,KAAK,EAAE,CAAC;AACjB,MAAI,KAAK,KAAK,EAAE,CAAC;AACjB,MAAIC,MAAK,KAAK,EAAE,CAAC;AACjB,MAAI,KAAK,KAAK,EAAE,CAAC;AACjB,MAAI,KAAK,KAAK,EAAE,CAAC;AACjB,MAAI,KAAK,KAAK,EAAE,CAAC;AACjB,MAAI,KAAK,KAAK,EAAE,EAAE;AAClB,MAAI,KAAK,KAAK,EAAE,EAAE;AAClB,MAAI,KAAK,KAAK,EAAE,EAAE;AAClB,MAAI,KAAK,KAAK,EAAE,EAAE;AAClB,MAAI,KAAK,KAAK,EAAE,EAAE;AAClB,MAAIC,MAAK,KAAK,EAAE,EAAE;AAElBnP,WAAO,KAAK,EAAE,WAAWqO,GAAE,MAAM;AACjC,WAAS,IAAI,GAAG,IAAIA,GAAE,QAAQ,KAAK,GAAG;AACpC,QAAI,QAAQ;AACZ,QAAI,QAAQc;AACZ,QAAI,QAAQ,UAAU,IAAI,EAAE;AAC5B,QAAI,QAAQ,UAAU,IAAI,EAAE;AAC5B,QAAI,QAAQ,QAAQ,IAAI,IAAI,IAAI,IAAI,EAAM;AAC1C,QAAI,QAAQ,QAAQ,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAC1C,QAAI,QAAQ,KAAK,EAAE,CAAC;AACpB,QAAI,QAAQ,KAAK,EAAE,IAAI,CAAC;AACxB,QAAI,QAAQd,GAAE,CAAC;AACf,QAAI,QAAQA,GAAE,IAAI,CAAC;AAEnB,QAAI,QAAQ;MACV;MAAO;MACP;MAAO;MACP;MAAO;MACP;MAAO;MACP;MAAO;IAAK;AACd,QAAI,QAAQ;MACV;MAAO;MACP;MAAO;MACP;MAAO;MACP;MAAO;MACP;MAAO;IAAK;AAEd,YAAQ,UAAU,IAAI,EAAE;AACxB,YAAQ,UAAU,IAAI,EAAE;AACxB,YAAQ,SAAS,IAAI,IAAI,IAAI,IAAIY,GAAM;AACvC,YAAQ,SAAS,IAAI,IAAI,IAAI,IAAIA,KAAI,EAAE;AAEvC,QAAI,QAAQ,SAAS,OAAO,OAAO,OAAO,KAAK;AAC/C,QAAI,QAAQ,SAAS,OAAO,OAAO,OAAO,KAAK;AAE/C,SAAK;AACL,IAAAE,MAAK;AAEL,SAAK;AACL,SAAK;AAEL,SAAK;AACL,SAAK;AAEL,SAAK,SAASD,KAAI,IAAI,OAAO,KAAK;AAClC,SAAK,SAAS,IAAI,IAAI,OAAO,KAAK;AAElC,IAAAA,MAAKD;AACL,SAAK;AAEL,IAAAA,MAAK;AACL,SAAK;AAEL,SAAK;AACL,SAAK;AAEL,SAAK,SAAS,OAAO,OAAO,OAAO,KAAK;AACxC,SAAK,SAAS,OAAO,OAAO,OAAO,KAAK;EAC5C;AAEE,QAAM,KAAK,GAAG,GAAG,IAAI,EAAE;AACvB,QAAM,KAAK,GAAG,GAAG,IAAI,EAAE;AACvB,QAAM,KAAK,GAAG,GAAGA,KAAI,EAAE;AACvB,QAAM,KAAK,GAAG,GAAGC,KAAI,EAAE;AACvB,QAAM,KAAK,GAAG,GAAG,IAAI,EAAE;AACvB,QAAM,KAAK,GAAG,IAAI,IAAI,EAAE;AACxB,QAAM,KAAK,GAAG,IAAI,IAAI,EAAE;AACxB,QAAM,KAAK,GAAG,IAAI,IAAIC,GAAE;AAC1B;AAEAI,SAAO,UAAU,UAAU,SAASjH,QAAO,KAAK;AAC9C,MAAI,QAAQ;AACV,WAAOxE,QAAM,QAAQ,KAAK,GAAG,KAAK;;AAElC,WAAOA,QAAM,QAAQ,KAAK,GAAG,KAAK;AACtC;AAEA,SAAS,QAAQ,IAAI,IAAI,IAAI,IAAI,IAAI;AACnC,MAAIxD,KAAK,KAAK,KAAQ,CAAC,KAAM;AAC7B,MAAIA,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,QAAQ,IAAI,IAAI,IAAI,IAAI,IAAI4V,KAAI;AACvC,MAAI5V,KAAK,KAAK,KAAQ,CAAC,KAAM4V;AAC7B,MAAI5V,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,SAAS,IAAI,IAAI,IAAI,IAAI,IAAI;AACpC,MAAIA,KAAK,KAAK,KAAO,KAAK,KAAO,KAAK;AACtC,MAAIA,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,SAAS,IAAI,IAAI,IAAI,IAAI,IAAI4V,KAAI;AACxC,MAAI5V,KAAK,KAAK,KAAO,KAAK4V,MAAO,KAAKA;AACtC,MAAI5V,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,UAAU,IAAI,IAAI;AACzB,MAAI,QAAQ,UAAU,IAAI,IAAI,EAAE;AAChC,MAAI,QAAQ,UAAU,IAAI,IAAI,CAAC;AAC/B,MAAI,QAAQ,UAAU,IAAI,IAAI,CAAC;AAE/B,MAAIA,KAAI,QAAQ,QAAQ;AACxB,MAAIA,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,UAAU,IAAI,IAAI;AACzB,MAAI,QAAQ,UAAU,IAAI,IAAI,EAAE;AAChC,MAAI,QAAQ,UAAU,IAAI,IAAI,CAAC;AAC/B,MAAI,QAAQ,UAAU,IAAI,IAAI,CAAC;AAE/B,MAAIA,KAAI,QAAQ,QAAQ;AACxB,MAAIA,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,UAAU,IAAI,IAAI;AACzB,MAAI,QAAQ,UAAU,IAAI,IAAI,EAAE;AAChC,MAAI,QAAQ,UAAU,IAAI,IAAI,EAAE;AAChC,MAAI,QAAQ,UAAU,IAAI,IAAI,CAAC;AAE/B,MAAIA,KAAI,QAAQ,QAAQ;AACxB,MAAIA,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,UAAU,IAAI,IAAI;AACzB,MAAI,QAAQ,UAAU,IAAI,IAAI,EAAE;AAChC,MAAI,QAAQ,UAAU,IAAI,IAAI,EAAE;AAChC,MAAI,QAAQ,UAAU,IAAI,IAAI,CAAC;AAE/B,MAAIA,KAAI,QAAQ,QAAQ;AACxB,MAAIA,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,UAAU,IAAI,IAAI;AACzB,MAAI,QAAQ,UAAU,IAAI,IAAI,CAAC;AAC/B,MAAI,QAAQ,UAAU,IAAI,IAAI,CAAC;AAC/B,MAAI,QAAQ,SAAS,IAAI,IAAI,CAAC;AAE9B,MAAIA,KAAI,QAAQ,QAAQ;AACxB,MAAIA,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,UAAU,IAAI,IAAI;AACzB,MAAI,QAAQ,UAAU,IAAI,IAAI,CAAC;AAC/B,MAAI,QAAQ,UAAU,IAAI,IAAI,CAAC;AAC/B,MAAI,QAAQ,SAAS,IAAI,IAAI,CAAC;AAE9B,MAAIA,KAAI,QAAQ,QAAQ;AACxB,MAAIA,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,UAAU,IAAI,IAAI;AACzB,MAAI,QAAQ,UAAU,IAAI,IAAI,EAAE;AAChC,MAAI,QAAQ,UAAU,IAAI,IAAI,EAAE;AAChC,MAAI,QAAQ,SAAS,IAAI,IAAI,CAAC;AAE9B,MAAIA,KAAI,QAAQ,QAAQ;AACxB,MAAIA,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;AAEA,SAAS,UAAU,IAAI,IAAI;AACzB,MAAI,QAAQ,UAAU,IAAI,IAAI,EAAE;AAChC,MAAI,QAAQ,UAAU,IAAI,IAAI,EAAE;AAChC,MAAI,QAAQ,SAAS,IAAI,IAAI,CAAC;AAE9B,MAAIA,KAAI,QAAQ,QAAQ;AACxB,MAAIA,KAAI;AACN,IAAAA,MAAK;AACP,SAAOA;AACT;ACvUA,IAAIwD,UAAQ7F;AAEZ,IAAI,SAASE;AAEb,SAAS,SAAS;AAChB,MAAI,EAAE,gBAAgB;AACpB,WAAO,IAAI,OAAM;AAEnB,SAAO,KAAK,IAAI;AAChB,OAAK,IAAI;IACP;IAAY;IACZ;IAAY;IACZ;IAAY;IACZ;IAAY;IACZ;IAAY;IACZ;IAAY;IACZ;IAAY;IACZ;IAAY;EAAU;AAC1B;AACA2F,QAAM,SAAS,QAAQ,MAAM;IAC7B,OAAiB;AAEjB,OAAO,YAAY;AACnB,OAAO,UAAU;AACjB,OAAO,eAAe;AACtB,OAAO,YAAY;AAEnB,OAAO,UAAU,UAAU,SAASwE,QAAO,KAAK;AAC9C,MAAI,QAAQ;AACV,WAAOxE,QAAM,QAAQ,KAAK,EAAE,MAAM,GAAG,EAAE,GAAG,KAAK;;AAE/C,WAAOA,QAAM,QAAQ,KAAK,EAAE,MAAM,GAAG,EAAE,GAAG,KAAK;AACnD;AChCY,IAAA,OAAG7F;AACD,IAAA,SAAGE;AACH,IAAA,SAAG2D;AACH,IAAA,SAAGU;AACjB,IAAA,SAAiBG;;ACJjB,IAAImB,UAAQ7F;AACZ,IAAI,SAASE;AAEb,IAAI,SAAS2F,QAAM;AACnB,IAAI,QAAQA,QAAM;AAClB,IAAI,UAAUA,QAAM;AACpB,IAAI,UAAUA,QAAM;AACpB,IAAI,YAAY,OAAO;AAEvB,SAAS,YAAY;AACnB,MAAI,EAAE,gBAAgB;AACpB,WAAO,IAAI,UAAS;AAEtB,YAAU,KAAK,IAAI;AAEnB,OAAK,IAAI,CAAE,YAAY,YAAY,YAAY,WAAY,UAAU;AACrE,OAAK,SAAS;AAChB;AACAA,QAAM,SAAS,WAAW,SAAS;AAClB,OAAA,YAAG;AAEpB,UAAU,YAAY;AACtB,UAAU,UAAU;AACpB,UAAU,eAAe;AACzB,UAAU,YAAY;AAEtB,UAAU,UAAU,UAAU,SAAS0R,QAAO,KAAK,OAAO;AACxD,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,IAAI,KAAK,EAAE,CAAC;AAChB,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAIW,MAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QAAI,IAAI;MACN;QACE,QAAQ,GAAG,EAAE,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC;QACjD,EAAE,CAAC;MAAC;MACN;IAAC;AACH,QAAI;AACJ,QAAI;AACJ,QAAI,OAAO,GAAG,EAAE;AAChB,QAAI;AACJ,QAAI;AACJ,QAAI;MACF;QACE,QAAQ,IAAI,EAAE,KAAK,GAAG,IAAIA,KAAI,EAAE,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,CAAC;QAC5D,GAAG,CAAC;MAAC;MACP;IAAE;AACJ,SAAK;AACL,SAAK;AACL,SAAK,OAAOA,KAAI,EAAE;AAClB,IAAAA,MAAK;AACL,SAAK;EACT;AACE,MAAI,QAAQ,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE;AAC5B,OAAK,EAAE,CAAC,IAAI,QAAQ,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE;AACpC,OAAK,EAAE,CAAC,IAAI,QAAQ,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE;AACpC,OAAK,EAAE,CAAC,IAAI,QAAQ,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE;AACpC,OAAK,EAAE,CAAC,IAAI,QAAQ,KAAK,EAAE,CAAC,GAAG,GAAGA,GAAE;AACpC,OAAK,EAAE,CAAC,IAAI;AACd;AAEA,UAAU,UAAU,UAAU,SAAS7N,QAAO,KAAK;AACjD,MAAI,QAAQ;AACV,WAAOxE,QAAM,QAAQ,KAAK,GAAG,QAAQ;;AAErC,WAAOA,QAAM,QAAQ,KAAK,GAAG,QAAQ;AACzC;AAEA,SAAS,EAAE,GAAG,GAAG,GAAG,GAAG;AACrB,MAAI,KAAK;AACP,WAAO,IAAI,IAAI;WACR,KAAK;AACZ,WAAQ,IAAI,IAAO,CAAC,IAAK;WAClB,KAAK;AACZ,YAAQ,IAAK,CAAC,KAAM;WACb,KAAK;AACZ,WAAQ,IAAI,IAAM,IAAK,CAAC;;AAExB,WAAO,KAAK,IAAK,CAAC;AACtB;AAEA,SAAS,EAAE,GAAG;AACZ,MAAI,KAAK;AACP,WAAO;WACA,KAAK;AACZ,WAAO;WACA,KAAK;AACZ,WAAO;WACA,KAAK;AACZ,WAAO;;AAEP,WAAO;AACX;AAEA,SAAS,GAAG,GAAG;AACb,MAAI,KAAK;AACP,WAAO;WACA,KAAK;AACZ,WAAO;WACA,KAAK;AACZ,WAAO;WACA,KAAK;AACZ,WAAO;;AAEP,WAAO;AACX;AAEA,IAAI,IAAI;EACN;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAI;EAClD;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EACnD;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAClD;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EACnD;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;AACpD;AAEA,IAAI,KAAK;EACP;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAClD;EAAG;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAG;EACnD;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAClD;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAClD;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;AACpD;AAEA,IAAI,IAAI;EACN;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EACrD;EAAG;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAI;EACpD;EAAI;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EACrD;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAG;EAAG;EAAG;EAAG;EAAG;EACpD;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAG;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;AACvD;AAEA,IAAI,KAAK;EACP;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EACrD;EAAG;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EACpD;EAAG;EAAG;EAAI;EAAI;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAG;EAAI;EAAI;EAAI;EAAG;EACrD;EAAI;EAAG;EAAG;EAAI;EAAI;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EACrD;EAAG;EAAG;EAAI;EAAG;EAAI;EAAG;EAAI;EAAG;EAAG;EAAI;EAAG;EAAG;EAAI;EAAI;EAAI;AACtD;AC/IA,IAAIA,UAAQ7F;AACZ,IAAI+B,WAAS7B;AAEb,SAAS,KAAKgQ,OAAMrO,MAAK,KAAK;AAC5B,MAAI,EAAE,gBAAgB;AACpB,WAAO,IAAI,KAAKqO,OAAMrO,MAAK,GAAG;AAChC,OAAK,OAAOqO;AACZ,OAAK,YAAYA,MAAK,YAAY;AAClC,OAAK,UAAUA,MAAK,UAAU;AAC9B,OAAK,QAAQ;AACb,OAAK,QAAQ;AAEb,OAAK,MAAMrK,QAAM,QAAQhE,MAAK,GAAG,CAAC;AACpC;IACAmQ,QAAiB;AAEjB,KAAK,UAAU,QAAQ,SAAS7P,MAAKN,MAAK;AAExC,MAAIA,KAAI,SAAS,KAAK;AACpB,IAAAA,OAAM,IAAI,KAAK,KAAI,EAAG,OAAOA,IAAG,EAAE,OAAM;AAC1CE,WAAOF,KAAI,UAAU,KAAK,SAAS;AAGnC,WAAS,IAAIA,KAAI,QAAQ,IAAI,KAAK,WAAW;AAC3C,IAAAA,KAAI,KAAK,CAAC;AAEZ,OAAK,IAAI,GAAG,IAAIA,KAAI,QAAQ;AAC1B,IAAAA,KAAI,CAAC,KAAK;AACZ,OAAK,QAAQ,IAAI,KAAK,KAAI,EAAG,OAAOA,IAAG;AAGvC,OAAK,IAAI,GAAG,IAAIA,KAAI,QAAQ;AAC1B,IAAAA,KAAI,CAAC,KAAK;AACZ,OAAK,QAAQ,IAAI,KAAK,KAAI,EAAG,OAAOA,IAAG;AACzC;AAEA,KAAK,UAAU,SAAS,SAAS0V,QAAO,KAAK,KAAK;AAChD,OAAK,MAAM,OAAO,KAAK,GAAG;AAC1B,SAAO;AACT;AAEA,KAAK,UAAU,SAAS,SAASlN,QAAO,KAAK;AAC3C,OAAK,MAAM,OAAO,KAAK,MAAM,OAAM,CAAE;AACrC,SAAO,KAAK,MAAM,OAAO,GAAG;AAC9B;;AC9CA,MAAI6F,QAAO;AAEX,EAAAA,MAAK,QAAQlQ;AACb,EAAAkQ,MAAK,SAAShQ;AACd,EAAAgQ,MAAK,MAAMrM;AACX,EAAAqM,MAAK,SAAS3L;AACd,EAAA2L,MAAK,OAAOxL;AAGZ,EAAAwL,MAAK,OAAOA,MAAK,IAAI;AACrB,EAAAA,MAAK,SAASA,MAAK,IAAI;AACvB,EAAAA,MAAK,SAASA,MAAK,IAAI;AACvB,EAAAA,MAAK,SAASA,MAAK,IAAI;AACvB,EAAAA,MAAK,SAASA,MAAK,IAAI;AACvB,EAAAA,MAAK,YAAYA,MAAK,OAAO;;;;;;;ACd7B,EAAAiI,aAAiB;IACf,SAAS;MACP,MAAM;MACN,QAAQ;QACN;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;;;IAIN,KAAK;MACH,KAAK;MACL,QAAQ;QACN;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;QAEF;UACE;UACA;;;;;;;;ACrwBR,MAAIC,UAAS;AAEb,MAAIlI,QAAOlQ;AACX,MAAI+U,UAAQ7U;AACZ,MAAI2F,SAAQhC;AAEZ,MAAI9B,UAAS8D,OAAM;AAEnB,WAAS,YAAY,SAAS;AAC5B,QAAI,QAAQ,SAAS;AACnB,WAAK,QAAQ,IAAIkP,QAAM,MAAM,OAAO;aAC7B,QAAQ,SAAS;AACxB,WAAK,QAAQ,IAAIA,QAAM,QAAQ,OAAO;;AAEtC,WAAK,QAAQ,IAAIA,QAAM,KAAK,OAAO;AACrC,SAAK,IAAI,KAAK,MAAM;AACpB,SAAK,IAAI,KAAK,MAAM;AACpB,SAAK,OAAO,QAAQ;AAEpB,IAAAhT,QAAO,KAAK,EAAE,SAAQ,GAAI,eAAe;AACzC,IAAAA,QAAO,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,WAAU,GAAI,yBAAyB;;AAEnE,EAAAqW,QAAO,cAAc;AAErB,WAAS,YAAY5W,OAAM,SAAS;AAClC,WAAO,eAAe4W,SAAQ5W,OAAM;MAClC,cAAc;MACd,YAAY;MACZ,KAAK,WAAW;AACd,YAAIuT,SAAQ,IAAI,YAAY,OAAO;AACnC,eAAO,eAAeqD,SAAQ5W,OAAM;UAClC,cAAc;UACd,YAAY;UACZ,OAAOuT;QACf,CAAO;AACD,eAAOA;;IAEb,CAAG;;AAGH,cAAY,QAAQ;IAClB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,MAAM7E,MAAK;IACX,MAAM;IACN,GAAG;MACD;MACA;;EAEJ,CAAC;AAED,cAAY,QAAQ;IAClB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,MAAMA,MAAK;IACX,MAAM;IACN,GAAG;MACD;MACA;;EAEJ,CAAC;AAED,cAAY,QAAQ;IAClB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,MAAMA,MAAK;IACX,MAAM;IACN,GAAG;MACD;MACA;;EAEJ,CAAC;AAED,cAAY,QAAQ;IAClB,MAAM;IACN,OAAO;IACP,GAAG;IAEH,GAAG;IAEH,GAAG;IAEH,GAAG;IAEH,MAAMA,MAAK;IACX,MAAM;IACN,GAAG;MACD;MAEA;;EAGJ,CAAC;AAED,cAAY,QAAQ;IAClB,MAAM;IACN,OAAO;IACP,GAAG;IAGH,GAAG;IAGH,GAAG;IAGH,GAAG;IAGH,MAAMA,MAAK;IACX,MAAM;IACN,GAAG;MACD;MAGA;;EAIJ,CAAC;AAED,cAAY,cAAc;IACxB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,MAAMA,MAAK;IACX,MAAM;IACN,GAAG;MACD;;EAEJ,CAAC;AAED,cAAY,WAAW;IACrB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;;IAEH,GAAG;IACH,GAAG;IACH,MAAMA,MAAK;IACX,MAAM;IACN,GAAG;MACD;;MAGA;;EAEJ,CAAC;AAED,MAAI;AACJ,MAAI;AACF,UAAM3L,iBAAA;WACC,GAAG;AACV,UAAM;;AAGR,cAAY,aAAa;IACvB,MAAM;IACN,OAAO;IACP,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,MAAM2L,MAAK;;IAGX,MAAM;IACN,QAAQ;IACR,OAAO;MACL;QACE,GAAG;QACH,GAAG;;MAEL;QACE,GAAG;QACH,GAAG;;;IAIP,MAAM;IACN,GAAG;MACD;MACA;MACA;;EAEJ,CAAC;;AC3MD,IAAIA,SAAOlQ;AACX,IAAI6F,UAAQ3F;AACZ,IAAI6B,WAAS8B;AAEb,SAAS,SAAS,SAAS;AACzB,MAAI,EAAE,gBAAgB;AACpB,WAAO,IAAI,SAAS,OAAO;AAC7B,OAAK,OAAO,QAAQ;AACpB,OAAK,aAAa,CAAC,CAAC,QAAQ;AAE5B,OAAK,SAAS,KAAK,KAAK;AACxB,OAAK,aAAa,QAAQ,cAAc,KAAK,KAAK;AAElD,OAAK,UAAU;AACf,OAAK,iBAAiB;AACtB,OAAK,IAAI;AACT,OAAK,IAAI;AAET,MAAI,UAAUgC,QAAM,QAAQ,QAAQ,SAAS,QAAQ,cAAc,KAAK;AACxE,MAAI,QAAQA,QAAM,QAAQ,QAAQ,OAAO,QAAQ,YAAY,KAAK;AAClE,MAAI,OAAOA,QAAM,QAAQ,QAAQ,MAAM,QAAQ,WAAW,KAAK;AAC/D9D;IAAO,QAAQ,UAAW,KAAK,aAAa;IACrC,qCAAqC,KAAK,aAAa;EAAO;AACrE,OAAK,MAAM,SAAS,OAAO,IAAI;AACjC;IACA,WAAiB;AAEjB,SAAS,UAAU,QAAQ,SAASI,MAAK,SAAS,OAAO,MAAM;AAC7D,MAAI,OAAO,QAAQ,OAAO,KAAK,EAAE,OAAO,IAAI;AAE5C,OAAK,IAAI,IAAI,MAAM,KAAK,SAAS,CAAC;AAClC,OAAK,IAAI,IAAI,MAAM,KAAK,SAAS,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,KAAK,EAAE,QAAQ,KAAK;AACtC,SAAK,EAAE,CAAC,IAAI;AACZ,SAAK,EAAE,CAAC,IAAI;EAChB;AAEE,OAAK,QAAQ,IAAI;AACjB,OAAK,UAAU;AACf,OAAK,iBAAiB;AACxB;AAEA,SAAS,UAAU,QAAQ,SAAS6P,QAAO;AACzC,SAAO,IAAI9B,OAAK,KAAK,KAAK,MAAM,KAAK,CAAC;AACxC;AAEA,SAAS,UAAU,UAAU,SAASqH,QAAO,MAAM;AACjD,MAAI,OAAO,KAAK,MAAK,EACL,OAAO,KAAK,CAAC,EACb,OAAO,CAAE,CAAI,CAAE;AAC/B,MAAI;AACF,WAAO,KAAK,OAAO,IAAI;AACzB,OAAK,IAAI,KAAK,OAAM;AACpB,OAAK,IAAI,KAAK,MAAK,EAAG,OAAO,KAAK,CAAC,EAAE,OAAM;AAC3C,MAAI,CAAC;AACH;AAEF,OAAK,IAAI,KAAK,MAAK,EACL,OAAO,KAAK,CAAC,EACb,OAAO,CAAE,CAAI,CAAE,EACf,OAAO,IAAI,EACX,OAAM;AACpB,OAAK,IAAI,KAAK,MAAK,EAAG,OAAO,KAAK,CAAC,EAAE,OAAM;AAC7C;AAEA,SAAS,UAAU,SAAS,SAAS,OAAO,SAAS,YAAY1U,MAAK,QAAQ;AAE5E,MAAI,OAAO,eAAe,UAAU;AAClC,aAASA;AACT,IAAAA,OAAM;AACN,iBAAa;EACjB;AAEE,YAAUgD,QAAM,QAAQ,SAAS,UAAU;AAC3C,EAAAhD,OAAMgD,QAAM,QAAQhD,MAAK,MAAM;AAE/Bd;IAAO,QAAQ,UAAW,KAAK,aAAa;IACrC,qCAAqC,KAAK,aAAa;EAAO;AAErE,OAAK,QAAQ,QAAQ,OAAOc,QAAO,CAAA,CAAE,CAAC;AACtC,OAAK,UAAU;AACjB;AAEA,SAAS,UAAU,WAAW,SAAS,SAAS,KAAK,KAAKA,MAAK,QAAQ;AACrE,MAAI,KAAK,UAAU,KAAK;AACtB,UAAM,IAAI,MAAM,oBAAoB;AAGtC,MAAI,OAAO,QAAQ,UAAU;AAC3B,aAASA;AACT,IAAAA,OAAM;AACN,UAAM;EACV;AAGE,MAAIA,MAAK;AACP,IAAAA,OAAMgD,QAAM,QAAQhD,MAAK,UAAU,KAAK;AACxC,SAAK,QAAQA,IAAG;EACpB;AAEE,MAAI,OAAO,CAAA;AACX,SAAO,KAAK,SAAS,KAAK;AACxB,SAAK,IAAI,KAAK,MAAK,EAAG,OAAO,KAAK,CAAC,EAAE,OAAM;AAC3C,WAAO,KAAK,OAAO,KAAK,CAAC;EAC7B;AAEE,MAAI,MAAM,KAAK,MAAM,GAAG,GAAG;AAC3B,OAAK,QAAQA,IAAG;AAChB,OAAK;AACL,SAAOgD,QAAM,OAAO,KAAK,GAAG;AAC9B;AC9GA,IAAI5D,OAAKjC;AACT,IAAI6F,UAAQ3F;AACZ,IAAI6B,WAAS8D,QAAM;AAEnB,SAASwS,UAAQC,KAAI,SAAS;AAC5B,OAAK,KAAKA;AACV,OAAK,OAAO;AACZ,OAAK,MAAM;AAGX,MAAI,QAAQ;AACV,SAAK,eAAe,QAAQ,MAAM,QAAQ,OAAO;AACnD,MAAI,QAAQ;AACV,SAAK,cAAc,QAAQ,KAAK,QAAQ,MAAM;AAClD;IACAzW,QAAiBwW;AAEjBA,UAAQ,aAAa,SAAS,WAAWC,KAAInE,MAAK,KAAK;AACrD,MAAIA,gBAAekE;AACjB,WAAOlE;AAET,SAAO,IAAIkE,UAAQC,KAAI;IACrB,KAAKnE;IACL,QAAQ;EACZ,CAAG;AACH;AAEAkE,UAAQ,cAAc,SAAS,YAAYC,KAAIlE,OAAM,KAAK;AACxD,MAAIA,iBAAgBiE;AAClB,WAAOjE;AAET,SAAO,IAAIiE,UAAQC,KAAI;IACrB,MAAMlE;IACN,SAAS;EACb,CAAG;AACH;AAEAiE,UAAQ,UAAU,WAAW,SAASrD,YAAW;AAC/C,MAAIb,OAAM,KAAK,UAAS;AAExB,MAAIA,KAAI,WAAU;AAChB,WAAO,EAAE,QAAQ,OAAO,QAAQ,qBAAoB;AACtD,MAAI,CAACA,KAAI,SAAQ;AACf,WAAO,EAAE,QAAQ,OAAO,QAAQ,4BAA2B;AAC7D,MAAI,CAACA,KAAI,IAAI,KAAK,GAAG,MAAM,CAAC,EAAE,WAAU;AACtC,WAAO,EAAE,QAAQ,OAAO,QAAQ,sBAAqB;AAEvD,SAAO,EAAE,QAAQ,MAAM,QAAQ,KAAI;AACrC;AAEAkE,UAAQ,UAAU,YAAY,SAAS,UAAU,SAAS,KAAK;AAE7D,MAAI,OAAO,YAAY,UAAU;AAC/B,UAAM;AACN,cAAU;EACd;AAEE,MAAI,CAAC,KAAK;AACR,SAAK,MAAM,KAAK,GAAG,EAAE,IAAI,KAAK,IAAI;AAEpC,MAAI,CAAC;AACH,WAAO,KAAK;AAEd,SAAO,KAAK,IAAI,OAAO,KAAK,OAAO;AACrC;AAEAA,UAAQ,UAAU,aAAa,SAAS,WAAW,KAAK;AACtD,MAAI,QAAQ;AACV,WAAO,KAAK,KAAK,SAAS,IAAI,CAAC;;AAE/B,WAAO,KAAK;AAChB;AAEAA,UAAQ,UAAU,iBAAiB,SAAS,eAAexW,MAAK,KAAK;AACnE,OAAK,OAAO,IAAII,KAAGJ,MAAK,OAAO,EAAE;AAIjC,OAAK,OAAO,KAAK,KAAK,KAAK,KAAK,GAAG,MAAM,CAAC;AAC5C;AAEAwW,UAAQ,UAAU,gBAAgB,SAAS,cAAcxW,MAAK,KAAK;AACjE,MAAIA,KAAI,KAAKA,KAAI,GAAG;AAIlB,QAAI,KAAK,GAAG,MAAM,SAAS,QAAQ;AACjCE,eAAOF,KAAI,GAAG,mBAAmB;IACvC,WAAe,KAAK,GAAG,MAAM,SAAS,WACvB,KAAK,GAAG,MAAM,SAAS,WAAW;AAC3CE,eAAOF,KAAI,KAAKA,KAAI,GAAG,8BAA8B;IAC3D;AACI,SAAK,MAAM,KAAK,GAAG,MAAM,MAAMA,KAAI,GAAGA,KAAI,CAAC;AAC3C;EACJ;AACE,OAAK,MAAM,KAAK,GAAG,MAAM,YAAYA,MAAK,GAAG;AAC/C;AAGAwW,UAAQ,UAAU,SAAS,SAAS,OAAOlE,MAAK;AAC9C,MAAG,CAACA,KAAI,SAAQ,GAAI;AAClBpS,aAAOoS,KAAI,SAAQ,GAAI,4BAA4B;EACvD;AACE,SAAOA,KAAI,IAAI,KAAK,IAAI,EAAE,KAAI;AAChC;AAGAkE,UAAQ,UAAU,OAAO,SAASvN,MAAK,KAAK,KAAK,SAAS;AACxD,SAAO,KAAK,GAAG,KAAK,KAAK,MAAM,KAAK,OAAO;AAC7C;AAEAuN,UAAQ,UAAU,SAAS,SAAS,OAAO,KAAKE,YAAW,SAAS;AAClE,SAAO,KAAK,GAAG,OAAO,KAAKA,YAAW,MAAM,QAAW,OAAO;AAChE;AAEAF,UAAQ,UAAU,UAAU,SAASzX,WAAU;AAC7C,SAAO,iBAAiB,KAAK,QAAQ,KAAK,KAAK,SAAS,IAAI,CAAC,KACtD,YAAY,KAAK,OAAO,KAAK,IAAI,QAAO,KAAM;AACvD;ACtHA,IAAIqB,OAAKjC;AAET,IAAI6F,UAAQ3F;AACZ,IAAI6B,WAAS8D,QAAM;AAEnB,SAAS2S,YAAU,SAAS,KAAK;AAC/B,MAAI,mBAAmBA;AACrB,WAAO;AAET,MAAI,KAAK,WAAW,SAAS,GAAG;AAC9B;AAEFzW,WAAO,QAAQ,KAAK,QAAQ,GAAG,0BAA0B;AACzD,OAAK,IAAI,IAAIE,KAAG,QAAQ,GAAG,EAAE;AAC7B,OAAK,IAAI,IAAIA,KAAG,QAAQ,GAAG,EAAE;AAC7B,MAAI,QAAQ,kBAAkB;AAC5B,SAAK,gBAAgB;;AAErB,SAAK,gBAAgB,QAAQ;AACjC;IACAsW,cAAiBC;AAEjB,SAAS,WAAW;AAClB,OAAK,QAAQ;AACf;AAEA,SAAS,UAAU,KAAK,GAAG;AACzB,MAAI,UAAU,IAAI,EAAE,OAAO;AAC3B,MAAI,EAAE,UAAU,MAAO;AACrB,WAAO;EACX;AACE,MAAI,WAAW,UAAU;AAGzB,MAAI,aAAa,KAAK,WAAW,GAAG;AAClC,WAAO;EACX;AAEE,MAAG,IAAI,EAAE,KAAK,MAAM,GAAM;AACxB,WAAO;EACX;AAEE,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,MAAM,EAAE,OAAO,IAAI,UAAU,KAAK,OAAO;AACvD,YAAQ;AACR,WAAO,IAAI,GAAG;AACd,aAAS;EACb;AAGE,MAAI,OAAO,KAAM;AACf,WAAO;EACX;AAEE,IAAE,QAAQ;AACV,SAAO;AACT;AAEA,SAAS,UAAU,KAAK;AACtB,MAAI,IAAI;AACR,MAAI,MAAM,IAAI,SAAS;AACvB,SAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,IAAI,QAAS,IAAI,KAAK;AACjD;EACJ;AACE,MAAI,MAAM,GAAG;AACX,WAAO;EACX;AACE,SAAO,IAAI,MAAM,CAAC;AACpB;AAEAA,YAAU,UAAU,aAAa,SAAS,WAAW,MAAM,KAAK;AAC9D,SAAO3S,QAAM,QAAQ,MAAM,GAAG;AAC9B,MAAI,IAAI,IAAI,SAAQ;AACpB,MAAI,KAAK,EAAE,OAAO,MAAM,IAAM;AAC5B,WAAO;EACX;AACE,MAAI,MAAM,UAAU,MAAM,CAAC;AAC3B,MAAI,QAAQ,OAAO;AACjB,WAAO;EACX;AACE,MAAK,MAAM,EAAE,UAAW,KAAK,QAAQ;AACnC,WAAO;EACX;AACE,MAAI,KAAK,EAAE,OAAO,MAAM,GAAM;AAC5B,WAAO;EACX;AACE,MAAI,OAAO,UAAU,MAAM,CAAC;AAC5B,MAAI,SAAS,OAAO;AAClB,WAAO;EACX;AACE,OAAK,KAAK,EAAE,KAAK,IAAI,SAAS,GAAG;AAC/B,WAAO;EACX;AACE,MAAIxD,KAAI,KAAK,MAAM,EAAE,OAAO,OAAO,EAAE,KAAK;AAC1C,IAAE,SAAS;AACX,MAAI,KAAK,EAAE,OAAO,MAAM,GAAM;AAC5B,WAAO;EACX;AACE,MAAI,OAAO,UAAU,MAAM,CAAC;AAC5B,MAAI,SAAS,OAAO;AAClB,WAAO;EACX;AACE,MAAI,KAAK,WAAW,OAAO,EAAE,OAAO;AAClC,WAAO;EACX;AACE,OAAK,KAAK,EAAE,KAAK,IAAI,SAAS,GAAG;AAC/B,WAAO;EACX;AACE,MAAItC,KAAI,KAAK,MAAM,EAAE,OAAO,OAAO,EAAE,KAAK;AAC1C,MAAIsC,GAAE,CAAC,MAAM,GAAG;AACd,QAAIA,GAAE,CAAC,IAAI,KAAM;AACf,MAAAA,KAAIA,GAAE,MAAM,CAAC;IACnB,OAAW;AAEL,aAAO;IACb;EACA;AACE,MAAItC,GAAE,CAAC,MAAM,GAAG;AACd,QAAIA,GAAE,CAAC,IAAI,KAAM;AACf,MAAAA,KAAIA,GAAE,MAAM,CAAC;IACnB,OAAW;AAEL,aAAO;IACb;EACA;AAEE,OAAK,IAAI,IAAIkC,KAAGI,EAAC;AACjB,OAAK,IAAI,IAAIJ,KAAGlC,EAAC;AACjB,OAAK,gBAAgB;AAErB,SAAO;AACT;AAEA,SAAS,gBAAgB,KAAK,KAAK;AACjC,MAAI,MAAM,KAAM;AACd,QAAI,KAAK,GAAG;AACZ;EACJ;AACE,MAAI,SAAS,KAAK,KAAK,IAAI,GAAG,IAAI,KAAK,QAAQ;AAC/C,MAAI,KAAK,SAAS,GAAI;AACtB,SAAO,EAAE,QAAQ;AACf,QAAI,KAAM,SAAS,UAAU,KAAM,GAAI;EAC3C;AACE,MAAI,KAAK,GAAG;AACd;AAEAyY,YAAU,UAAU,QAAQ,SAAS,MAAM,KAAK;AAC9C,MAAInW,KAAI,KAAK,EAAE,QAAO;AACtB,MAAItC,KAAI,KAAK,EAAE,QAAO;AAGtB,MAAIsC,GAAE,CAAC,IAAI;AACT,IAAAA,KAAI,CAAE,CAAC,EAAG,OAAOA,EAAC;AAEpB,MAAItC,GAAE,CAAC,IAAI;AACT,IAAAA,KAAI,CAAE,CAAC,EAAG,OAAOA,EAAC;AAEpB,EAAAsC,KAAI,UAAUA,EAAC;AACf,EAAAtC,KAAI,UAAUA,EAAC;AAEf,SAAO,CAACA,GAAE,CAAC,KAAK,EAAEA,GAAE,CAAC,IAAI,MAAO;AAC9B,IAAAA,KAAIA,GAAE,MAAM,CAAC;EACjB;AACE,MAAI,MAAM,CAAE,CAAI;AAChB,kBAAgB,KAAKsC,GAAE,MAAM;AAC7B,QAAM,IAAI,OAAOA,EAAC;AAClB,MAAI,KAAK,CAAI;AACb,kBAAgB,KAAKtC,GAAE,MAAM;AAC7B,MAAI,WAAW,IAAI,OAAOA,EAAC;AAC3B,MAAI,MAAM,CAAE,EAAI;AAChB,kBAAgB,KAAK,SAAS,MAAM;AACpC,QAAM,IAAI,OAAO,QAAQ;AACzB,SAAO8F,QAAM,OAAO,KAAK,GAAG;AAC9B;;;;;;AC7KA,MAAI5D,MAAKjC;AACT,MAAIyY,YAAWvY;AACf,MAAI2F,SAAQhC;AACZ,MAAIuU,UAAS7T;AACb,MAAI,OAAOG,eAAA;AACX,MAAI3C,UAAS8D,OAAM;AAEnB,MAAIwS,WAAU1S;AACd,MAAI6S,aAAYvQ;AAEhB,WAASyQ,IAAG,SAAS;AACnB,QAAI,EAAE,gBAAgBA;AACpB,aAAO,IAAIA,IAAG,OAAO;AAGvB,QAAI,OAAO,YAAY,UAAU;AAC/B,MAAA3W;QAAO,OAAO,UAAU,eAAe,KAAKqW,SAAQ,OAAO;QACzD,mBAAmB;MAAO;AAE5B,gBAAUA,QAAO,OAAO;;AAI1B,QAAI,mBAAmBA,QAAO;AAC5B,gBAAU,EAAE,OAAO,QAAO;AAE5B,SAAK,QAAQ,QAAQ,MAAM;AAC3B,SAAK,IAAI,KAAK,MAAM;AACpB,SAAK,KAAK,KAAK,EAAE,MAAM,CAAC;AACxB,SAAK,IAAI,KAAK,MAAM;AAGpB,SAAK,IAAI,QAAQ,MAAM;AACvB,SAAK,EAAE,WAAW,QAAQ,MAAM,EAAE,UAAS,IAAK,CAAC;AAGjD,SAAK,OAAO,QAAQ,QAAQ,QAAQ,MAAM;;AAE9BE,SAAGI;AAEjB,EAAAA,IAAG,UAAU,UAAU,SAAS,QAAQ,SAAS;AAC/C,WAAO,IAAIL,SAAQ,MAAM,OAAO;EAClC;AAEA,EAAAK,IAAG,UAAU,iBAAiB,SAAS,eAAetE,OAAM,KAAK;AAC/D,WAAOiE,SAAQ,YAAY,MAAMjE,OAAM,GAAG;EAC5C;AAEA,EAAAsE,IAAG,UAAU,gBAAgB,SAASC,eAAcxE,MAAK,KAAK;AAC5D,WAAOkE,SAAQ,WAAW,MAAMlE,MAAK,GAAG;EAC1C;AAEA,EAAAuE,IAAG,UAAU,aAAa,SAAS,WAAW,SAAS;AACrD,QAAI,CAAC;AACH,gBAAU,CAAA;AAGZ,QAAI,OAAO,IAAID,UAAS;MACtB,MAAM,KAAK;MACX,MAAM,QAAQ;MACd,SAAS,QAAQ,WAAW;MAC5B,SAAS,QAAQ,WAAW,KAAK,KAAK,KAAK,YAAY;MACvD,YAAY,QAAQ,WAAW,QAAQ,cAAc;MACrD,OAAO,KAAK,EAAE,QAAO;IACzB,CAAG;AAED,QAAI,QAAQ,KAAK,EAAE,WAAU;AAC7B,QAAI,MAAM,KAAK,EAAE,IAAI,IAAIxW,IAAG,CAAC,CAAC;AAC9B,eAAS;AACP,UAAImS,QAAO,IAAInS,IAAG,KAAK,SAAS,KAAK,CAAC;AACtC,UAAImS,MAAK,IAAI,GAAG,IAAI;AAClB;AAEF,MAAAA,MAAK,MAAM,CAAC;AACZ,aAAO,KAAK,eAAeA,KAAI;;EAEnC;AAEA,EAAAsE,IAAG,UAAU,eAAe,SAAS,aAAa,KAAK,WAAW,WAAW;AAC3E,QAAIpY;AACJ,QAAI2B,IAAG,KAAK,GAAG,KAAK,OAAO,QAAQ,UAAU;AAC3C,YAAM,IAAIA,IAAG,KAAK,EAAE;AACpB,MAAA3B,cAAa,IAAI,WAAU;IAC/B,WAAa,OAAO,QAAQ,UAAU;AAElC,MAAAA,cAAa,IAAI;AACjB,YAAM,IAAI2B,IAAG,KAAK,EAAE;IACxB,OAAS;AAEL,UAAI,MAAM,IAAI,SAAQ;AAEtB,MAAA3B,cAAc,IAAI,SAAS,MAAO;AAClC,YAAM,IAAI2B,IAAG,KAAK,EAAE;;AAGtB,QAAI,OAAO,cAAc,UAAU;AACjC,kBAAY3B,cAAa;;AAE3B,QAAI,QAAQ,YAAY,KAAK,EAAE,UAAS;AACxC,QAAI,QAAQ;AACV,YAAM,IAAI,MAAM,KAAK;AACvB,QAAI,CAAC,aAAa,IAAI,IAAI,KAAK,CAAC,KAAK;AACnC,aAAO,IAAI,IAAI,KAAK,CAAC;;AAErB,aAAO;EACX;AAEA,EAAAoY,IAAG,UAAU,OAAO,SAAS5N,MAAK,KAAKjJ,MAAK,KAAK,SAAS;AACxD,QAAI,OAAO,QAAQ,UAAU;AAC3B,gBAAU;AACV,YAAM;;AAER,QAAI,CAAC;AACH,gBAAU,CAAA;AAEZ,QAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,YAAY,CAACI,IAAG,KAAK,GAAG,GAAG;AACvE,MAAAF;QAAO,OAAO,QAAQ,YAAY,OAAO,OAAO,IAAI,WAAW;QAC7D;MAAsE;AACxE,MAAAA,QAAQ,IAAI,WAAW,MAAO,IAAI,MAAM;AACxC,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAK,CAAAA,SAAQ,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,CAAC;;AAGvE,IAAAF,OAAM,KAAK,eAAeA,MAAK,GAAG;AAClC,UAAM,KAAK,aAAa,KAAK,OAAO,QAAQ,YAAY;AAGxD,IAAAE,QAAO,CAAC,IAAI,MAAK,GAAI,iCAAiC;AAGtD,QAAI,QAAQ,KAAK,EAAE,WAAU;AAC7B,QAAI,OAAOF,KAAI,WAAU,EAAG,QAAQ,MAAM,KAAK;AAG/C,QAAI,QAAQ,IAAI,QAAQ,MAAM,KAAK;AAGnC,IAAAE,QAAQ,IAAIE,IAAG,KAAK,EAAG,GAAG,GAAG,GAAG,sBAAsB;AAGtD,QAAI,OAAO,IAAIwW,UAAS;MACtB,MAAM,KAAK;MACX,SAAS;MACT;MACA,MAAM,QAAQ;MACd,SAAS,QAAQ,WAAW;IAChC,CAAG;AAGD,QAAI,MAAM,KAAK,EAAE,IAAI,IAAIxW,IAAG,CAAC,CAAC;AAE9B,aAAS,OAAO,KAAK,QAAQ;AAC3B,UAAI,IAAI,QAAQ,IACd,QAAQ,EAAE,IAAI,IACd,IAAIA,IAAG,KAAK,SAAS,KAAK,EAAE,WAAU,CAAE,CAAC;AAC3C,UAAI,KAAK,aAAa,GAAG,IAAI;AAC7B,UAAI,EAAE,KAAK,CAAC,KAAK,KAAK,EAAE,IAAI,GAAG,KAAK;AAClC;AAEF,UAAI,KAAK,KAAK,EAAE,IAAI,CAAC;AACrB,UAAI,GAAG,WAAU;AACf;AAEF,UAAI,MAAM,GAAG,KAAI;AACjB,UAAII,KAAI,IAAI,KAAK,KAAK,CAAC;AACvB,UAAIA,GAAE,KAAK,CAAC,MAAM;AAChB;AAEF,UAAItC,KAAI,EAAE,KAAK,KAAK,CAAC,EAAE,IAAIsC,GAAE,IAAIR,KAAI,WAAU,CAAE,EAAE,KAAK,GAAG,CAAC;AAC5D,MAAA9B,KAAIA,GAAE,KAAK,KAAK,CAAC;AACjB,UAAIA,GAAE,KAAK,CAAC,MAAM;AAChB;AAEF,UAAI,iBAAiB,GAAG,KAAI,EAAG,MAAK,IAAK,IAAI,MACxB,IAAI,IAAIsC,EAAC,MAAM,IAAI,IAAI;AAG5C,UAAI,QAAQ,aAAatC,GAAE,IAAI,KAAK,EAAE,IAAI,GAAG;AAC3C,QAAAA,KAAI,KAAK,EAAE,IAAIA,EAAC;AAChB,yBAAiB;;AAGnB,aAAO,IAAIyY,WAAU,EAAE,GAAGnW,IAAG,GAAGtC,IAAG,cAA4B,CAAE;;EAErE;AAEA,EAAA2Y,IAAG,UAAU,SAAS,SAASE,QAAO,KAAKL,YAAW1W,MAAK,KAAK,SAAS;AACvE,QAAI,CAAC;AACH,gBAAU,CAAA;AAEZ,UAAM,KAAK,aAAa,KAAK,OAAO,QAAQ,YAAY;AACxD,IAAAA,OAAM,KAAK,cAAcA,MAAK,GAAG;AACjC,IAAA0W,aAAY,IAAIC,WAAUD,YAAW,KAAK;AAG1C,QAAIlW,KAAIkW,WAAU;AAClB,QAAIxY,KAAIwY,WAAU;AAClB,QAAIlW,GAAE,KAAK,CAAC,IAAI,KAAKA,GAAE,IAAI,KAAK,CAAC,KAAK;AACpC,aAAO;AACT,QAAItC,GAAE,KAAK,CAAC,IAAI,KAAKA,GAAE,IAAI,KAAK,CAAC,KAAK;AACpC,aAAO;AAGT,QAAI,OAAOA,GAAE,KAAK,KAAK,CAAC;AACxB,QAAI,KAAK,KAAK,IAAI,GAAG,EAAE,KAAK,KAAK,CAAC;AAClC,QAAI,KAAK,KAAK,IAAIsC,EAAC,EAAE,KAAK,KAAK,CAAC;AAChC,QAAI;AAEJ,QAAI,CAAC,KAAK,MAAM,eAAe;AAC7B,UAAI,KAAK,EAAE,OAAO,IAAIR,KAAI,UAAS,GAAI,EAAE;AACzC,UAAI,EAAE,WAAU;AACd,eAAO;AAET,aAAO,EAAE,KAAI,EAAG,KAAK,KAAK,CAAC,EAAE,IAAIQ,EAAC,MAAM;;AAM1C,QAAI,KAAK,EAAE,QAAQ,IAAIR,KAAI,UAAS,GAAI,EAAE;AAC1C,QAAI,EAAE,WAAU;AACd,aAAO;AAKT,WAAO,EAAE,OAAOQ,EAAC;EACnB;AAEA,EAAAqW,IAAG,UAAU,gBAAgB,SAAS,KAAKH,YAAW,GAAG,KAAK;AAC5D,IAAAxW,SAAQ,IAAI,OAAO,GAAG,0CAA0C;AAChE,IAAAwW,aAAY,IAAIC,WAAUD,YAAW,GAAG;AAExC,QAAI,IAAI,KAAK;AACb,QAAI,IAAI,IAAItW,IAAG,GAAG;AAClB,QAAII,KAAIkW,WAAU;AAClB,QAAIxY,KAAIwY,WAAU;AAGlB,QAAI,SAAS,IAAI;AACjB,QAAI,cAAc,KAAK;AACvB,QAAIlW,GAAE,IAAI,KAAK,MAAM,EAAE,KAAK,KAAK,MAAM,CAAC,CAAC,KAAK,KAAK;AACjD,YAAM,IAAI,MAAM,sCAAsC;AAGxD,QAAI;AACF,MAAAA,KAAI,KAAK,MAAM,WAAWA,GAAE,IAAI,KAAK,MAAM,CAAC,GAAG,MAAM;;AAErD,MAAAA,KAAI,KAAK,MAAM,WAAWA,IAAG,MAAM;AAErC,QAAI,OAAOkW,WAAU,EAAE,KAAK,CAAC;AAC7B,QAAI,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,KAAK,CAAC;AAClC,QAAIM,MAAK9Y,GAAE,IAAI,IAAI,EAAE,KAAK,CAAC;AAI3B,WAAO,KAAK,EAAE,OAAO,IAAIsC,IAAGwW,GAAE;EAChC;AAEA,EAAAH,IAAG,UAAU,sBAAsB,SAAS,GAAGH,YAAW,GAAG,KAAK;AAChE,IAAAA,aAAY,IAAIC,WAAUD,YAAW,GAAG;AACxC,QAAIA,WAAU,kBAAkB;AAC9B,aAAOA,WAAU;AAEnB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI;AACJ,UAAI;AACF,iBAAS,KAAK,cAAc,GAAGA,YAAW,CAAC;eACpCO,IAAG;AACV;;AAGF,UAAI,OAAO,GAAG,CAAC;AACb,eAAO;;AAEX,UAAM,IAAI,MAAM,sCAAsC;;;;AClRxD,IAAIjT,UAAQ7F;AACZ,IAAI+B,WAAS8D,QAAM;AACnB,IAAIiP,eAAajP,QAAM;AACvB,IAAIgP,mBAAiBhP,QAAM;AAW3B,SAASwS,UAAQU,QAAO,QAAQ;AAC9B,OAAK,QAAQA;AACb,OAAK,UAAUjE,aAAW,OAAO,MAAM;AACvC,MAAIiE,OAAM,QAAQ,OAAO,GAAG;AAC1B,SAAK,OAAO,OAAO;;AAEnB,SAAK,YAAYjE,aAAW,OAAO,GAAG;AAC1C;AAEAuD,UAAQ,aAAa,SAASW,YAAWD,QAAO5E,MAAK;AACnD,MAAIA,gBAAekE;AACjB,WAAOlE;AACT,SAAO,IAAIkE,UAAQU,QAAO,EAAE,KAAK5E,KAAG,CAAE;AACxC;AAEAkE,UAAQ,aAAa,SAAS,WAAWU,QAAO1E,SAAQ;AACtD,MAAIA,mBAAkBgE;AACpB,WAAOhE;AACT,SAAO,IAAIgE,UAAQU,QAAO,EAAE,QAAQ1E,QAAM,CAAE;AAC9C;AAEAgE,UAAQ,UAAU,SAAS,SAAS,SAAS;AAC3C,SAAO,KAAK;AACd;AAEAxD,iBAAewD,WAAS,YAAY,SAAS,WAAW;AACtD,SAAO,KAAK,MAAM,YAAY,KAAK,IAAG,CAAE;AAC1C,CAAC;AAEDxD,iBAAewD,WAAS,OAAO,SAAS,MAAM;AAC5C,MAAI,KAAK;AACP,WAAO,KAAK,MAAM,YAAY,KAAK,SAAS;AAC9C,SAAO,KAAK,MAAM,EAAE,IAAI,KAAK,KAAI,CAAE;AACrC,CAAC;AAEDxD,iBAAewD,WAAS,aAAa,SAAS,YAAY;AACxD,MAAIU,SAAQ,KAAK;AACjB,MAAI7I,QAAO,KAAK,KAAI;AACpB,MAAI,SAAS6I,OAAM,iBAAiB;AAEpC,MAAI,IAAI7I,MAAK,MAAM,GAAG6I,OAAM,cAAc;AAC1C,IAAE,CAAC,KAAK;AACR,IAAE,MAAM,KAAK;AACb,IAAE,MAAM,KAAK;AAEb,SAAO;AACT,CAAC;AAEDlE,iBAAewD,WAAS,QAAQ,SAAS,OAAO;AAC9C,SAAO,KAAK,MAAM,UAAU,KAAK,UAAS,CAAE;AAC9C,CAAC;AAEDxD,iBAAewD,WAAS,QAAQ,SAAS,OAAO;AAC9C,SAAO,KAAK,MAAM,KAAI,EAAG,OAAO,KAAK,OAAM,CAAE,EAAE,OAAM;AACvD,CAAC;AAEDxD,iBAAewD,WAAS,iBAAiB,SAAS,gBAAgB;AAChE,SAAO,KAAK,KAAI,EAAG,MAAM,KAAK,MAAM,cAAc;AACpD,CAAC;AAEDA,UAAQ,UAAU,OAAO,SAASvN,MAAK,SAAS;AAC9C/I,WAAO,KAAK,SAAS,yBAAyB;AAC9C,SAAO,KAAK,MAAM,KAAK,SAAS,IAAI;AACtC;AAEAsW,UAAQ,UAAU,SAAS,SAASO,QAAO,SAAS,KAAK;AACvD,SAAO,KAAK,MAAM,OAAO,SAAS,KAAK,IAAI;AAC7C;AAEAP,UAAQ,UAAU,YAAY,SAAS,UAAU,KAAK;AACpDtW,WAAO,KAAK,SAAS,wBAAwB;AAC7C,SAAO8D,QAAM,OAAO,KAAK,OAAM,GAAI,GAAG;AACxC;AAEAwS,UAAQ,UAAU,YAAY,SAASY,WAAU,KAAK;AACpD,SAAOpT,QAAM,OAAO,KAAK,SAAQ,GAAI,GAAG;AAC1C;AAEA,IAAAhE,OAAiBwW;AC5FjB,IAAIpW,OAAKjC;AACT,IAAI6F,UAAQ3F;AACZ,IAAI6B,WAAS8D,QAAM;AACnB,IAAI,iBAAiBA,QAAM;AAC3B,IAAIiP,eAAajP,QAAM;AAUvB,SAAS2S,YAAUO,QAAO,KAAK;AAC7B,OAAK,QAAQA;AAEb,MAAI,OAAO,QAAQ;AACjB,UAAMjE,aAAW,GAAG;AAEtB,MAAI,MAAM,QAAQ,GAAG,GAAG;AACtB/S,aAAO,IAAI,WAAWgX,OAAM,iBAAiB,GAAG,4BAA4B;AAC5E,UAAM;MACJ,GAAG,IAAI,MAAM,GAAGA,OAAM,cAAc;MACpC,GAAG,IAAI,MAAMA,OAAM,cAAc;IACvC;EACA;AAEEhX,WAAO,IAAI,KAAK,IAAI,GAAG,0BAA0B;AAEjD,MAAIgX,OAAM,QAAQ,IAAI,CAAC;AACrB,SAAK,KAAK,IAAI;AAChB,MAAI,IAAI,aAAa9W;AACnB,SAAK,KAAK,IAAI;AAEhB,OAAK,YAAY,MAAM,QAAQ,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI;AACpD,OAAK,YAAY,MAAM,QAAQ,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI;AACtD;AAEA,eAAeuW,aAAW,KAAK,SAAS,IAAI;AAC1C,SAAO,KAAK,MAAM,UAAU,KAAK,SAAQ,CAAE;AAC7C,CAAC;AAED,eAAeA,aAAW,KAAK,SAASU,KAAI;AAC1C,SAAO,KAAK,MAAM,YAAY,KAAK,SAAQ,CAAE;AAC/C,CAAC;AAED,eAAeV,aAAW,YAAY,SAAS,WAAW;AACxD,SAAO,KAAK,MAAM,YAAY,KAAK,EAAC,CAAE;AACxC,CAAC;AAED,eAAeA,aAAW,YAAY,SAAS,WAAW;AACxD,SAAO,KAAK,MAAM,UAAU,KAAK,EAAC,CAAE;AACtC,CAAC;AAEDA,YAAU,UAAU,UAAU,SAAS,UAAU;AAC/C,SAAO,KAAK,SAAQ,EAAG,OAAO,KAAK,SAAQ,CAAE;AAC/C;AAEAA,YAAU,UAAU,QAAQ,SAAS9D,SAAQ;AAC3C,SAAO7O,QAAM,OAAO,KAAK,QAAO,GAAI,KAAK,EAAE,YAAW;AACxD;AAEA,IAAA,YAAiB2S;AC/DjB,IAAItI,QAAOlQ;AACX,IAAI,SAASE;AACb,IAAI2F,UAAQhC;AACZ,IAAI9B,WAAS8D,QAAM;AACnB,IAAI,aAAaA,QAAM;AACvB,IAAI,UAAUtB;AACd,IAAI,YAAYG;AAEhB,SAAS,MAAMqQ,QAAO;AACpBhT,WAAOgT,WAAU,WAAW,iCAAiC;AAE7D,MAAI,EAAE,gBAAgB;AACpB,WAAO,IAAI,MAAMA,MAAK;AAExB,EAAAA,SAAQ,OAAOA,MAAK,EAAE;AACtB,OAAK,QAAQA;AACb,OAAK,IAAIA,OAAM;AACf,OAAK,EAAE,WAAWA,OAAM,EAAE,UAAS,IAAK,CAAC;AAEzC,OAAK,aAAaA,OAAM,MAAK,EAAG;AAChC,OAAK,iBAAiB,KAAK,KAAKA,OAAM,EAAE,UAAS,IAAK,CAAC;AACvD,OAAK,OAAO7E,MAAK;AACnB;IAEA,QAAiB;AAOjB,MAAM,UAAU,OAAO,SAASpF,MAAK,SAASuJ,SAAQ;AACpD,YAAU,WAAW,OAAO;AAC5B,MAAIxS,OAAM,KAAK,cAAcwS,OAAM;AACnC,MAAIhS,KAAI,KAAK,QAAQR,KAAI,cAAa,GAAI,OAAO;AACjD,MAAIqX,KAAI,KAAK,EAAE,IAAI7W,EAAC;AACpB,MAAI8W,YAAW,KAAK,YAAYD,EAAC;AACjC,MAAI,KAAK,KAAK,QAAQC,WAAUtX,KAAI,SAAQ,GAAI,OAAO,EACpD,IAAIA,KAAI,KAAI,CAAE;AACjB,MAAIuX,KAAI/W,GAAE,IAAI,EAAE,EAAE,KAAK,KAAK,MAAM,CAAC;AACnC,SAAO,KAAK,cAAc,EAAE,GAAG6W,IAAG,GAAGE,IAAG,UAAUD,UAAQ,CAAE;AAC9D;AAQA,MAAM,UAAU,SAAS,SAASP,QAAO,SAAS,KAAKzE,MAAK;AAC1D,YAAU,WAAW,OAAO;AAC5B,QAAM,KAAK,cAAc,GAAG;AAC5B,MAAI,IAAI,EAAC,EAAG,IAAI,IAAI,MAAM,MAAM,CAAC,KAAK,IAAI,EAAC,EAAG,MAAK,GAAI;AACrD,WAAO;EACX;AACE,MAAItS,OAAM,KAAK,cAAcsS,IAAG;AAChC,MAAI,IAAI,KAAK,QAAQ,IAAI,SAAQ,GAAItS,KAAI,SAAQ,GAAI,OAAO;AAC5D,MAAI,KAAK,KAAK,EAAE,IAAI,IAAI,EAAC,CAAE;AAC3B,MAAI,UAAU,IAAI,EAAC,EAAG,IAAIA,KAAI,IAAG,EAAG,IAAI,CAAC,CAAC;AAC1C,SAAO,QAAQ,GAAG,EAAE;AACtB;AAEA,MAAM,UAAU,UAAU,SAAS,UAAU;AAC3C,MAAIqO,QAAO,KAAK,KAAI;AACpB,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ;AACpC,IAAAA,MAAK,OAAO,UAAU,CAAC,CAAC;AAC1B,SAAOrK,QAAM,UAAUqK,MAAK,OAAM,CAAE,EAAE,KAAK,KAAK,MAAM,CAAC;AACzD;AAEA,MAAM,UAAU,gBAAgB,SAAS,cAAciE,MAAK;AAC1D,SAAO,QAAQ,WAAW,MAAMA,IAAG;AACrC;AAEA,MAAM,UAAU,gBAAgB,SAAS,cAAcE,SAAQ;AAC7D,SAAO,QAAQ,WAAW,MAAMA,OAAM;AACxC;AAEA,MAAM,UAAU,gBAAgB,SAAS,cAAc,KAAK;AAC1D,MAAI,eAAe;AACjB,WAAO;AACT,SAAO,IAAI,UAAU,MAAM,GAAG;AAChC;AAUA,MAAM,UAAU,cAAc,SAAS,YAAYa,QAAO;AACxD,MAAI,MAAMA,OAAM,KAAI,EAAG,QAAQ,MAAM,KAAK,cAAc;AACxD,MAAI,KAAK,iBAAiB,CAAC,KAAKA,OAAM,KAAI,EAAG,MAAK,IAAK,MAAO;AAC9D,SAAO;AACT;AAEA,MAAM,UAAU,cAAc,SAASK,aAAY,OAAO;AACxD,UAAQ1P,QAAM,WAAW,KAAK;AAE9B,MAAI,SAAS,MAAM,SAAS;AAC5B,MAAI,SAAS,MAAM,MAAM,GAAG,MAAM,EAAE,OAAO,MAAM,MAAM,IAAI,CAAC,GAAI;AAChE,MAAI,UAAU,MAAM,MAAM,IAAI,SAAU;AAExC,MAAI,IAAIA,QAAM,UAAU,MAAM;AAC9B,SAAO,KAAK,MAAM,WAAW,GAAG,MAAM;AACxC;AAEA,MAAM,UAAU,YAAY,SAAS,UAAU,KAAK;AAClD,SAAO,IAAI,QAAQ,MAAM,KAAK,cAAc;AAC9C;AAEA,MAAM,UAAU,YAAY,SAASwT,WAAU,OAAO;AACpD,SAAOxT,QAAM,UAAU,KAAK;AAC9B;AAEA,MAAM,UAAU,UAAU,SAAS,QAAQ,KAAK;AAC9C,SAAO,eAAe,KAAK;AAC7B;;;;;;ACtHA,QAAIyT,YAAW;AAEf,IAAAA,UAAS,UAAU,WAA2B;AAC9C,IAAAA,UAAS,QAAQpZ;AACjB,IAAAoZ,UAAS,OAAOzV,eAAA;AAChB,IAAAyV,UAAS,QAAQ/U;AACjB,IAAA+U,UAAS,SAAS5U;AAGlB,IAAA4U,UAAS,KAAK3T,UAAA;AACd,IAAA2T,UAAS,QAAQrR;;;;;;;;;;;;ACZjB,QAAI3D,QAAOtE,YAAA;AACX,QAAIgC,YAAW9B;AAEf,QAAIuF,OAAM;AAEV,IAAAA,KAAI,SAAS,SAAS,OAAOjE,OAAM,MAAM;AACvC,aAAO,IAAI,OAAOA,OAAM,IAAI;IAC9B;AAEA,aAAS,OAAOA,OAAM,MAAM;AAC1B,WAAK,OAAOA;AACZ,WAAK,OAAO;AAEZ,WAAK,WAAW,CAAA;AAChB,WAAK,WAAW,CAAA;IAClB;AAEA,WAAO,UAAU,eAAe,SAAS,YAAYU,OAAM;AACzD,UAAI;AACJ,UAAI;AACF,gBAAQ,UAAQ,IAAI,EAAE;UACpB,eAAe,KAAK,OAAO;QAGjC;eACW,GAAG;AACV,gBAAQ,SAAU,QAAQ;AACxB,eAAK,WAAW,MAAM;QAC5B;;AAEE,MAAAF,UAAS,OAAOE,KAAI;AACpB,YAAM,UAAU,aAAa,SAAS,UAAU,QAAQ;AACtD,QAAAA,MAAK,KAAK,MAAM,MAAM;MAC1B;AAEE,aAAO,IAAI,MAAM,IAAI;IACvB;AAEA,WAAO,UAAU,cAAc,SAAS,YAAY,KAAK;AACvD,YAAM,OAAO;AAEb,UAAI,CAAC,KAAK,SAAS,eAAe,GAAG;AACnC,aAAK,SAAS,GAAG,IAAI,KAAK,aAAaoC,MAAK,SAAS,GAAG,CAAC;AAC3D,aAAO,KAAK,SAAS,GAAG;IAC1B;AAEA,WAAO,UAAU,SAAS,SAASe,QAAO,MAAM,KAAK,SAAS;AAC5D,aAAO,KAAK,YAAY,GAAG,EAAE,OAAO,MAAM,OAAO;IACnD;AAEA,WAAO,UAAU,cAAc,SAAS,YAAY,KAAK;AACvD,YAAM,OAAO;AAEb,UAAI,CAAC,KAAK,SAAS,eAAe,GAAG;AACnC,aAAK,SAAS,GAAG,IAAI,KAAK,aAAaf,MAAK,SAAS,GAAG,CAAC;AAC3D,aAAO,KAAK,SAAS,GAAG;IAC1B;AAEA,WAAO,UAAU,SAAS,SAASD,QAAO,MAAM,KAAoBZ,WAAU;AAC5E,aAAO,KAAK,YAAY,GAAG,EAAE,OAAO,MAAMA,SAAQ;;;;;;;AC3DpD,IAAI,WAAWzD;AAEf,SAAS,SAAS,SAAS;AACzB,OAAK,iBAAiB;IACpB,KAAK;IACL,MAAM,CAAA;IACN,SAAS,WAAW,CAAA;IACpB,QAAQ,CAAA;EACZ;AACA;AACgB,SAAA,WAAG;AAEnB,SAAS,UAAU,UAAU,SAAS+O,SAAQxO,MAAK;AACjD,SAAOA,gBAAe;AACxB;AAEA,SAAS,UAAU,OAAO,SAASwD,QAAO;AACxC,MAAIJ,SAAQ,KAAK;AAEjB,SAAO,EAAE,KAAKA,OAAM,KAAK,SAASA,OAAM,KAAK,OAAM;AACrD;AAEA,SAAS,UAAU,UAAU,SAASK,SAAQ,MAAM;AAClD,MAAIL,SAAQ,KAAK;AAEjB,EAAAA,OAAM,MAAM,KAAK;AACjB,EAAAA,OAAM,OAAOA,OAAM,KAAK,MAAM,GAAG,KAAK,OAAO;AAC/C;AAEA,SAAS,UAAU,WAAW,SAAS4V,UAAS1X,MAAK;AACnD,SAAO,KAAK,eAAe,KAAK,KAAKA,IAAG;AAC1C;AAEA,SAAS,UAAU,UAAU,SAAS2X,SAAQpX,QAAO;AACnD,MAAIuB,SAAQ,KAAK;AAEjB,EAAAA,OAAM,OAAOA,OAAM,KAAK,MAAM,GAAGvB,SAAQ,CAAC;AAC5C;AAEA,SAAS,UAAU,WAAW,SAASqX,UAASrX,QAAOP,MAAK,OAAO;AACjE,MAAI8B,SAAQ,KAAK;AAEjB,OAAK,QAAQvB,MAAK;AAClB,MAAIuB,OAAM,QAAQ;AAChB,IAAAA,OAAM,IAAI9B,IAAG,IAAI;AACrB;AAEA,SAAS,UAAU,OAAO,SAAS+B,QAAO;AACxC,SAAO,KAAK,eAAe,KAAK,KAAK,GAAG;AAC1C;AAEA,SAAS,UAAU,cAAc,SAAS8V,eAAc;AACtD,MAAI/V,SAAQ,KAAK;AAEjB,MAAI,OAAOA,OAAM;AACjB,EAAAA,OAAM,MAAM,CAAA;AACZ,SAAO;AACT;AAEA,SAAS,UAAU,cAAc,SAASgW,aAAY,MAAM;AAC1D,MAAIhW,SAAQ,KAAK;AAEjB,MAAI,MAAMA,OAAM;AAChB,EAAAA,OAAM,MAAM;AACZ,SAAO;AACT;AAEA,SAAS,UAAU,QAAQ,SAASuC,OAAM,KAAK;AAC7C,MAAI;AACJ,MAAIvC,SAAQ,KAAK;AAEjB,MAAI,YAAY,eAAe;AAC/B,MAAI,WAAW;AACb,UAAM;EACV,OAAS;AACL,UAAM,IAAI,cAAcA,OAAM,KAAK,IAAI,SAAS,MAAM;AACpD,aAAO,MAAM,KAAK,UAAU,IAAI,IAAI;IAC1C,CAAK,EAAE,KAAK,EAAE,GAAG,IAAI,WAAW,KAAK,IAAI,KAAK;EAC9C;AAEE,MAAI,CAACA,OAAM,QAAQ;AACjB,UAAM;AAER,MAAI,CAAC;AACH,IAAAA,OAAM,OAAO,KAAK,GAAG;AAEvB,SAAO;AACT;AAEA,SAAS,UAAU,aAAa,SAASiW,YAAW,QAAQ;AAC1D,MAAIjW,SAAQ,KAAK;AACjB,MAAI,CAACA,OAAM,QAAQ;AACjB,WAAO;AAET,SAAO;IACL,QAAQ,KAAK,QAAQ,MAAM,IAAI,OAAO;IACtC,QAAQA,OAAM;EAClB;AACA;AAEA,SAAS,cAAcC,OAAM,KAAK;AAChC,OAAK,OAAOA;AACZ,OAAK,QAAQ,GAAG;AAClB;AACA,SAAS,eAAe,KAAK;AAE7B,cAAc,UAAU,UAAU,SAASiW,SAAQ,KAAK;AACtD,OAAK,UAAU,MAAM,WAAW,KAAK,QAAQ;AAC7C,MAAI,MAAM;AACR,UAAM,kBAAkB,MAAM,aAAa;AAE7C,MAAI,CAAC,KAAK,OAAO;AACf,QAAI;AAEF,YAAM,IAAI,MAAM,KAAK,OAAO;IAClC,SAAa,GAAG;AACV,WAAK,QAAQ,EAAE;IACrB;EACA;AACE,SAAO;AACT;;;;;;ACxHA,MAAI7X,YAAWhC;AACf,MAAIwD,YAAWtD,YAAkB,EAAC;AAClC,MAAIC,UAAS0D,SAAkB;AAE/B,WAASC,eAAc5B,OAAM,SAAS;AACpC,IAAAsB,UAAS,KAAK,MAAM,OAAO;AAC3B,QAAI,CAACrD,QAAO,SAAS+B,KAAI,GAAG;AAC1B,WAAK,MAAM,kBAAkB;AAC7B;;AAGF,SAAK,OAAOA;AACZ,SAAK,SAAS;AACd,SAAK,SAASA,MAAK;;AAErB,EAAAF,UAAS8B,gBAAeN,SAAQ;AACX,SAAA,gBAAGM;AAExB,EAAAA,eAAc,UAAU,OAAO,SAASC,QAAO;AAC7C,WAAO,EAAE,QAAQ,KAAK,QAAQ,UAAUP,UAAS,UAAU,KAAK,KAAK,IAAI,EAAC;EAC5E;AAEA,EAAAM,eAAc,UAAU,UAAU,SAASE,SAAQD,OAAM;AAEvD,QAAI,MAAM,IAAID,eAAc,KAAK,IAAI;AACrC,QAAI,SAASC,MAAK;AAClB,QAAI,SAAS,KAAK;AAElB,SAAK,SAASA,MAAK;AACnB,IAAAP,UAAS,UAAU,QAAQ,KAAK,MAAMO,MAAK,QAAQ;AAEnD,WAAO;EACT;AAEA,EAAAD,eAAc,UAAU,UAAU,SAASgW,WAAU;AACnD,WAAO,KAAK,WAAW,KAAK;EAC9B;AAEA,EAAAhW,eAAc,UAAU,YAAY,SAAS7C,WAAU,MAAM;AAC3D,QAAI,KAAK,SAAS,KAAK,KAAK;AAC1B,aAAO,KAAK,KAAK,UAAU,KAAK,UAAU,IAAI;;AAE9C,aAAO,KAAK,MAAM,QAAQ,uBAAuB;;AAGrD,EAAA6C,eAAc,UAAU,OAAO,SAASiW,MAAK,OAAO,MAAM;AACxD,QAAI,EAAE,KAAK,SAAS,SAAS,KAAK;AAChC,aAAO,KAAK,MAAM,QAAQ,uBAAuB;AAEnD,QAAI,MAAM,IAAIjW,eAAc,KAAK,IAAI;AAGrC,QAAI,iBAAiB,KAAK;AAE1B,QAAI,SAAS,KAAK;AAClB,QAAI,SAAS,KAAK,SAAS;AAC3B,SAAK,UAAU;AACf,WAAO;;AAGT,EAAAA,eAAc,UAAU,MAAM,SAASyB,KAAIxB,OAAM;AAC/C,WAAO,KAAK,KAAK,MAAMA,QAAOA,MAAK,SAAS,KAAK,QAAQ,KAAK,MAAM;;AAGtE,WAASE,eAAc,OAAOR,WAAU;AACtC,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAK,SAAS;AACd,WAAK,QAAQ,MAAM,IAAI,SAAS,MAAM;AACpC,YAAI,EAAE,gBAAgBQ;AACpB,iBAAO,IAAIA,eAAc,MAAMR,SAAQ;AACzC,aAAK,UAAU,KAAK;AACpB,eAAO;SACN,IAAI;IACX,WAAa,OAAO,UAAU,UAAU;AACpC,UAAI,EAAE,KAAK,SAAS,SAAS;AAC3B,eAAOA,UAAS,MAAM,8BAA8B;AACtD,WAAK,QAAQ;AACb,WAAK,SAAS;IAClB,WAAa,OAAO,UAAU,UAAU;AACpC,WAAK,QAAQ;AACb,WAAK,SAAStD,QAAO,WAAW,KAAK;eAC5BA,QAAO,SAAS,KAAK,GAAG;AACjC,WAAK,QAAQ;AACb,WAAK,SAAS,MAAM;IACxB,OAAS;AACL,aAAOsD,UAAS,MAAM,uBAAuB,OAAO,KAAK;;;AAGxC,SAAA,gBAAGQ;AAExB,EAAAA,eAAc,UAAU,OAAO,SAASqD,MAAK,KAAK,QAAQ;AACxD,QAAI,CAAC;AACH,YAAM,IAAInH,QAAO,KAAK,MAAM;AAC9B,QAAI,CAAC;AACH,eAAS;AAEX,QAAI,KAAK,WAAW;AAClB,aAAO;AAET,QAAI,MAAM,QAAQ,KAAK,KAAK,GAAG;AAC7B,WAAK,MAAM,QAAQ,SAAS,MAAM;AAChC,aAAK,KAAK,KAAK,MAAM;AACrB,kBAAU,KAAK;MACrB,CAAK;IACL,OAAS;AACL,UAAI,OAAO,KAAK,UAAU;AACxB,YAAI,MAAM,IAAI,KAAK;eACZ,OAAO,KAAK,UAAU;AAC7B,YAAI,MAAM,KAAK,OAAO,MAAM;eACrBA,QAAO,SAAS,KAAK,KAAK;AACjC,aAAK,MAAM,KAAK,KAAK,MAAM;AAC7B,gBAAU,KAAK;;AAGjB,WAAO;;;;;;;;;AClHT,MAAIqD,YAAWxD,YAAkB,EAAC;AAClC,MAAIiE,iBAAgBjE,YAAkB,EAAC;AACvC,MAAI8D,iBAAgB9D,YAAkB,EAAC;AACvC,MAAI+B,UAAS7B;AAGb,MAAI8Z,QAAO;IACT;IAAO;IAAS;IAAO;IAAS;IAAS;IACzC;IAAW;IAAW;IAAS;IAAQ;IAAO;IAC9C;IAAU;IAAU;IAAW;IAAU;IAAY;IAAU;IAC/D;IAAU;IAAU;IAAY;IAAU;IAAU;IAAW;EACjE;AAGA,MAAIC,WAAU;IACZ;IAAO;IAAO;IAAO;IAAY;IAAY;IAAY;IAAO;IAChE;IAAO;EACT,EAAE,OAAOD,KAAI;AAGb,MAAIE,aAAY;IACd;IAAY;IAAc;IAC1B;IAAc;IAAgB;IAC9B;IAAe;IAAc;IAAe;IAE5C;IAAoB;IAAc;IAAgB;IAClD;IAAe;IAAc;EAC/B;AAEA,WAAShW,MAAK,KAAK,QAAQ;AACzB,QAAIP,SAAQ,CAAA;AACZ,SAAK,aAAaA;AAElB,IAAAA,OAAM,MAAM;AAEZ,IAAAA,OAAM,SAAS,UAAU;AACzB,IAAAA,OAAM,WAAW;AAGjB,IAAAA,OAAM,MAAM;AACZ,IAAAA,OAAM,OAAO;AACb,IAAAA,OAAM,cAAc;AACpB,IAAAA,OAAM,SAAS;AACf,IAAAA,OAAM,WAAW;AACjB,IAAAA,OAAM,MAAM;AACZ,IAAAA,OAAM,MAAM;AACZ,IAAAA,OAAM,MAAM;AACZ,IAAAA,OAAM,aAAa;AACnB,IAAAA,OAAM,MAAM;AACZ,IAAAA,OAAM,SAAS,IAAI;AACnB,IAAAA,OAAM,WAAW;AACjB,IAAAA,OAAM,WAAW;AACjB,IAAAA,OAAM,WAAW;AAGjB,QAAI,CAACA,OAAM,QAAQ;AACjB,MAAAA,OAAM,WAAW,CAAA;AACjB,WAAK,MAAK;;;AAGA,SAAGO;AAEjB,MAAIiW,cAAa;IACf;IAAO;IAAU;IAAY;IAAO;IAAQ;IAAe;IAC3D;IAAY;IAAO;IAAO;IAAO;IAAc;IAAO;IAAW;IACjE;IAAY;EACd;AAEA,EAAAjW,MAAK,UAAU,QAAQ,SAAS1B,SAAQ;AACtC,QAAImB,SAAQ,KAAK;AACjB,QAAI,SAAS,CAAA;AACb,IAAAwW,YAAW,QAAQ,SAAS,MAAM;AAChC,aAAO,IAAI,IAAIxW,OAAM,IAAI;IAC7B,CAAG;AACD,QAAI,MAAM,IAAI,KAAK,YAAY,OAAO,MAAM;AAC5C,QAAI,aAAa;AACjB,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,QAAQ,SAASkW,QAAO;AACrC,QAAIzW,SAAQ,KAAK;AACjB,IAAAsW,SAAQ,QAAQ,SAAS,QAAQ;AAC/B,WAAK,MAAM,IAAI,SAAS,iBAAiB;AACvC,YAAIzX,SAAQ,IAAI,KAAK,YAAY,IAAI;AACrC,QAAAmB,OAAM,SAAS,KAAKnB,MAAK;AACzB,eAAOA,OAAM,MAAM,EAAE,MAAMA,QAAO,SAAS;MACjD;OACK,IAAI;EACT;AAEA,EAAA0B,MAAK,UAAU,QAAQ,SAAS/B,MAAK,MAAM;AACzC,QAAIwB,SAAQ,KAAK;AAEjB,IAAA5B,QAAO4B,OAAM,WAAW,IAAI;AAC5B,SAAK,KAAK,IAAI;AAGd,IAAAA,OAAM,WAAWA,OAAM,SAAS,OAAO,SAAS,OAAO;AACrD,aAAO,MAAM,WAAW,WAAW;OAClC,IAAI;AACP,IAAA5B,QAAO,MAAM4B,OAAM,SAAS,QAAQ,GAAG,mCAAmC;EAC5E;AAEA,EAAAO,MAAK,UAAU,WAAW,SAASmW,SAAQ,MAAM;AAC/C,QAAI1W,SAAQ,KAAK;AAGjB,QAAI,WAAW,KAAK,OAAO,SAAS,KAAK;AACvC,aAAO,eAAe,KAAK;OAC1B,IAAI;AACP,WAAO,KAAK,OAAO,SAAS,KAAK;AAC/B,aAAO,EAAE,eAAe,KAAK;OAC5B,IAAI;AAEP,QAAI,SAAS,WAAW,GAAG;AACzB,MAAA5B,QAAO4B,OAAM,aAAa,IAAI;AAC9B,MAAAA,OAAM,WAAW;AAGjB,eAAS,QAAQ,SAAS,OAAO;AAC/B,cAAM,WAAW,SAAS;SACzB,IAAI;;AAET,QAAI,KAAK,WAAW,GAAG;AACrB,MAAA5B,QAAO4B,OAAM,SAAS,IAAI;AAC1B,MAAAA,OAAM,OAAO;AACb,MAAAA,OAAM,cAAc,KAAK,IAAI,SAAS,KAAK;AACzC,YAAI,OAAO,QAAQ,YAAY,IAAI,gBAAgB;AACjD,iBAAO;AAET,YAAI,MAAM,CAAA;AACV,eAAO,KAAK,GAAG,EAAE,QAAQ,SAAS9B,MAAK;AACrC,cAAIA,SAAQA,OAAM;AAChB,YAAAA,QAAO;AACT,cAAI,QAAQ,IAAIA,IAAG;AACnB,cAAI,KAAK,IAAIA;QACrB,CAAO;AACD,eAAO;MACb,CAAK;;EAEL;AAMA,EAAAqY,WAAU,QAAQ,SAAS,QAAQ;AACjC,IAAAhW,MAAK,UAAU,MAAM,IAAI,SAAS,aAAa;AAC7C,UAAIP,SAAQ,KAAK;AACjB,YAAM,IAAI,MAAM,SAAS,oCAAoCA,OAAM,GAAG;IAC1E;EACA,CAAC;AAMD,EAAAqW,MAAK,QAAQ,SAAS,KAAK;AACzB,IAAA9V,MAAK,UAAU,GAAG,IAAI,SAAS,aAAa;AAC1C,UAAIP,SAAQ,KAAK;AACjB,UAAI,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AAE/C,MAAA5B,QAAO4B,OAAM,QAAQ,IAAI;AACzB,MAAAA,OAAM,MAAM;AAEZ,WAAK,SAAS,IAAI;AAElB,aAAO;IACX;EACA,CAAC;AAED,EAAAO,MAAK,UAAU,MAAM,SAASe,KAAI,MAAM;AACtC,IAAAlD,QAAO,IAAI;AACX,QAAI4B,SAAQ,KAAK;AAEjB,IAAA5B,QAAO4B,OAAM,QAAQ,IAAI;AACzB,IAAAA,OAAM,MAAM;AAEZ,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,WAAW,SAASoW,YAAW;AAC5C,QAAI3W,SAAQ,KAAK;AAEjB,IAAAA,OAAM,WAAW;AAEjB,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,MAAM,SAASqW,KAAI,KAAK;AACrC,QAAI5W,SAAQ,KAAK;AAEjB,IAAA5B,QAAO4B,OAAM,SAAS,MAAM,IAAI;AAChC,IAAAA,OAAM,SAAS,IAAI;AACnB,IAAAA,OAAM,WAAW;AAEjB,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,WAAW,SAASE,UAAS,KAAK;AAC/C,QAAIT,SAAQ,KAAK;AAEjB,IAAA5B,QAAO4B,OAAM,aAAa,QAAQA,OAAM,aAAa,IAAI;AACzD,IAAAA,OAAM,WAAW;AAEjB,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,WAAW,SAASsW,UAAS,KAAK;AAC/C,QAAI7W,SAAQ,KAAK;AAEjB,IAAA5B,QAAO4B,OAAM,aAAa,QAAQA,OAAM,aAAa,IAAI;AACzD,IAAAA,OAAM,WAAW;AAEjB,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,MAAM,SAAS3D,OAAM;AAClC,QAAIoD,SAAQ,KAAK;AACjB,QAAI,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AAE/C,IAAAA,OAAM,MAAM;AAEZ,QAAI,KAAK,WAAW;AAClB,WAAK,SAAS,IAAI;AAEpB,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,MAAM,SAASrC,KAAI,QAAQ;AACxC,QAAI8B,SAAQ,KAAK;AAEjB,IAAA5B,QAAO4B,OAAM,QAAQ,IAAI;AACzB,IAAAA,OAAM,MAAM;AAEZ,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,MAAM,SAASoB,OAAM;AAClC,QAAI3B,SAAQ,KAAK;AAEjB,IAAAA,OAAM,MAAM;AAEZ,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,SAAS,SAASuW,QAAOla,MAAK;AAC3C,QAAIoD,SAAQ,KAAK;AAEjB,IAAA5B,QAAO4B,OAAM,WAAW,IAAI;AAC5B,IAAAA,OAAM,SAASpD;AACf,SAAK,SAAS,OAAO,KAAKA,IAAG,EAAE,IAAI,SAASsB,MAAK;AAC/C,aAAOtB,KAAIsB,IAAG;KACf,CAAC;AAEF,WAAO;EACT;AAEA,EAAAqC,MAAK,UAAU,WAAW,SAASwW,UAAS,MAAM;AAChD,QAAI/W,SAAQ,KAAK;AAEjB,IAAA5B,QAAO4B,OAAM,QAAQ,IAAI;AACzB,IAAAA,OAAM,WAAW;AAEjB,WAAO;EACT;AAMA,EAAAO,MAAK,UAAU,UAAU,SAASmB,QAAO,OAAO,SAAS;AACvD,QAAI1B,SAAQ,KAAK;AAGjB,QAAIA,OAAM,WAAW;AACnB,aAAO,MAAM,WAAWA,OAAM,SAAS,CAAC,EAAE,QAAQ,OAAO,OAAO,CAAC;AAEnE,QAAI,SAASA,OAAM,SAAS;AAC5B,QAAI,UAAU;AAEd,QAAI,UAAU;AACd,QAAIA,OAAM,QAAQ;AAChB,gBAAU,MAAM,SAASA,OAAM,GAAG;AAGpC,QAAIA,OAAM,UAAU;AAClB,UAAI,MAAM;AACV,UAAIA,OAAM,aAAa;AACrB,cAAMA,OAAM;eACLA,OAAM,aAAa;AAC1B,cAAMA,OAAM;eACLA,OAAM,QAAQ;AACrB,cAAMA,OAAM;AAEd,UAAI,QAAQ,QAAQ,CAACA,OAAM,KAAK;AAE9B,YAAII,QAAO,MAAM,KAAI;AACrB,YAAI;AACF,cAAIJ,OAAM,WAAW;AACnB,iBAAK,eAAeA,OAAM,KAAK,OAAO,OAAO;;AAE7C,iBAAK,cAAc,OAAO,OAAO;AACnC,oBAAU;iBACH,GAAG;AACV,oBAAU;;AAEZ,cAAM,QAAQI,KAAI;MACxB,OAAW;AACL,kBAAU,KAAK,SAAS,OAAO,KAAKJ,OAAM,GAAG;AAE7C,YAAI,MAAM,QAAQ,OAAO;AACvB,iBAAO;;;AAKb,QAAI;AACJ,QAAIA,OAAM,OAAO;AACf,gBAAU,MAAM,YAAW;AAE7B,QAAI,SAAS;AAEX,UAAIA,OAAM,aAAa,MAAM;AAC3B,YAAIS,YAAW,KAAK,WAAW,OAAOT,OAAM,QAAQ;AACpD,YAAI,MAAM,QAAQS,SAAQ;AACxB,iBAAOA;AACT,gBAAQA;;AAGV,UAAI,QAAQ,MAAM;AAGlB,UAAIT,OAAM,QAAQ,QAAQA,OAAM,WAAW,MAAM;AAC/C,YAAIA,OAAM;AACR,cAAII,QAAO,MAAM,KAAI;AACvB,YAAI,OAAO,KAAK;UACd;UACAJ,OAAM,aAAa,OAAOA,OAAM,WAAWA,OAAM;UACjDA,OAAM;QACd;AACM,YAAI,MAAM,QAAQ,IAAI;AACpB,iBAAO;AAET,YAAIA,OAAM;AACR,mBAAS,MAAM,IAAII,KAAI;;AAEvB,kBAAQ;;AAGZ,UAAI,WAAW,QAAQ,SAASJ,OAAM,QAAQ;AAC5C,gBAAQ,MAAM,MAAM,KAAI,GAAI,OAAO,MAAM,QAAQ,QAAQ;AAE3D,UAAI,WAAW,QAAQ,SAASA,OAAM,QAAQ;AAC5C,gBAAQ,MAAM,MAAM,KAAI,GAAI,MAAM,QAAQ,MAAM,QAAQ,SAAS;AAGnE,UAAIA,OAAM;AACR,iBAAS;eACFA,OAAM,WAAW;AACxB,iBAAS,KAAK,eAAeA,OAAM,KAAK,OAAO,OAAO;;AAEtD,iBAAS,KAAK,cAAc,OAAO,OAAO;AAE5C,UAAI,MAAM,QAAQ,MAAM;AACtB,eAAO;AAGT,UAAI,CAACA,OAAM,OAAOA,OAAM,WAAW,QAAQA,OAAM,aAAa,MAAM;AAClE,QAAAA,OAAM,SAAS,QAAQ,SAAS,eAAe,OAAO;AAGpD,gBAAM,QAAQ,OAAO,OAAO;QACpC,CAAO;;AAIH,UAAIA,OAAM,aAAaA,OAAM,QAAQ,YAAYA,OAAM,QAAQ,WAAW;AACxE,YAAI,OAAO,IAAIG,eAAc,MAAM;AACnC,iBAAS,KAAK,QAAQH,OAAM,UAAU,MAAM,eAAe,GAAG,EACzD,QAAQ,MAAM,OAAO;;;AAK9B,QAAIA,OAAM,OAAO;AACf,eAAS,MAAM,YAAY,OAAO;AAGpC,QAAIA,OAAM,QAAQ,SAAS,WAAW,QAAQ,YAAY;AACxD,YAAM,SAAS,SAASA,OAAM,KAAK,MAAM;aAClC,YAAY;AACnB,YAAM,QAAQ,OAAO;AAEvB,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,iBAAiB,SAASyW,eAAc,KAAK,OAAO,SAAS;AAC1E,QAAIhX,SAAQ,KAAK;AAEjB,QAAI,QAAQ,SAAS,QAAQ;AAC3B,aAAO;AACT,QAAI,QAAQ,WAAW,QAAQ;AAC7B,aAAO,KAAK,YAAY,OAAO,KAAKA,OAAM,KAAK,CAAC,GAAG,OAAO;aACnD,OAAO,KAAK,GAAG;AACtB,aAAO,KAAK,WAAW,OAAO,KAAK,OAAO;aACnC,QAAQ,WAAWA,OAAM;AAChC,aAAO,KAAK,aAAa,OAAOA,OAAM,KAAK,CAAC,GAAGA,OAAM,KAAK,CAAC,GAAG,OAAO;aAC9D,QAAQ;AACf,aAAO,KAAK,aAAa,OAAO,MAAM,MAAM,OAAO;aAC5C,QAAQ,aAAa,QAAQ;AACpC,aAAO,KAAK,YAAY,OAAO,KAAK,OAAO;aACpC,QAAQ;AACf,aAAO,KAAK,YAAY,OAAO,OAAO;aAC/B,QAAQ;AACf,aAAO,KAAK,YAAY,OAAO,OAAO;aAC/B,QAAQ;AACf,aAAO,KAAK,WAAW,OAAO,KAAK,OAAO;aACnC,QAAQ,SAAS,QAAQ;AAChC,aAAO,KAAK,WAAW,OAAOA,OAAM,QAAQA,OAAM,KAAK,CAAC,GAAG,OAAO;AAEpE,QAAIA,OAAM,QAAQ,MAAM;AACtB,aAAO,KAAK,QAAQA,OAAM,KAAK,MAAM,eAAe,GAAG,EAClD,QAAQ,OAAO,OAAO;IAC/B,OAAS;AACL,aAAO,MAAM,MAAM,kBAAkB,GAAG;;EAE5C;AAEA,EAAAO,MAAK,UAAU,UAAU,SAAS0W,SAAQ,QAAQra,MAAK;AAErD,QAAIoD,SAAQ,KAAK;AAEjB,IAAAA,OAAM,aAAa,KAAK,KAAK,QAAQpD,IAAG;AACxC,IAAAwB,QAAO4B,OAAM,WAAW,WAAW,WAAW,IAAI;AAClD,IAAAA,OAAM,aAAaA,OAAM,WAAW,WAAW,SAAS,CAAC;AACzD,QAAIA,OAAM,aAAaA,OAAM,WAAW,WAAW,UAAU;AAC3D,MAAAA,OAAM,aAAaA,OAAM,WAAW,MAAK;AACzC,MAAAA,OAAM,WAAW,WAAW,WAAWA,OAAM;;AAE/C,WAAOA,OAAM;EACf;AAEA,EAAAO,MAAK,UAAU,gBAAgB,SAAS2W,cAAa,OAAO,SAAS;AACnE,QAAIlX,SAAQ,KAAK;AACjB,QAAI,SAAS;AACb,QAAI,QAAQ;AAEZ,WAAO,KAAKA,OAAM,MAAM,EAAE,KAAK,SAAS9B,MAAK;AAC3C,UAAIkC,QAAO,MAAM,KAAI;AACrB,UAAII,QAAOR,OAAM,OAAO9B,IAAG;AAC3B,UAAI;AACF,YAAI,QAAQsC,MAAK,QAAQ,OAAO,OAAO;AACvC,YAAI,MAAM,QAAQ,KAAK;AACrB,iBAAO;AAET,iBAAS,EAAE,MAAMtC,MAAK,MAAY;AAClC,gBAAQ;eACD,GAAG;AACV,cAAM,QAAQkC,KAAI;AAClB,eAAO;;AAET,aAAO;OACN,IAAI;AAEP,QAAI,CAAC;AACH,aAAO,MAAM,MAAM,oBAAoB;AAEzC,WAAO;EACT;AAMA,EAAAG,MAAK,UAAU,uBAAuB,SAAS4W,qBAAoB,MAAM;AACvE,WAAO,IAAI7W,eAAc,MAAM,KAAK,QAAQ;EAC9C;AAEA,EAAAC,MAAK,UAAU,UAAU,SAASG,QAAO,MAAMZ,WAAU,QAAQ;AAC/D,QAAIE,SAAQ,KAAK;AACjB,QAAIA,OAAM,SAAS,MAAM,QAAQA,OAAM,SAAS,MAAM;AACpD;AAEF,QAAI,SAAS,KAAK,aAAa,MAAMF,WAAU,MAAM;AACrD,QAAI,WAAW;AACb;AAEF,QAAI,KAAK,aAAa,QAAQA,WAAU,MAAM;AAC5C;AAEF,WAAO;EACT;AAEA,EAAAS,MAAK,UAAU,eAAe,SAASG,QAAO,MAAMZ,WAAU,QAAQ;AACpE,QAAIE,SAAQ,KAAK;AAGjB,QAAIA,OAAM,WAAW;AACnB,aAAOA,OAAM,SAAS,CAAC,EAAE,QAAQ,MAAMF,aAAY,IAAID,UAAQ,CAAE;AAEnE,QAAI,SAAS;AAGb,SAAK,WAAWC;AAGhB,QAAIE,OAAM,YAAY,SAAS,QAAW;AACxC,UAAIA,OAAM,SAAS,MAAM;AACvB,eAAOA,OAAM,SAAS;;AAEtB;;AAIJ,QAAI,UAAU;AACd,QAAI,YAAY;AAChB,QAAIA,OAAM,KAAK;AAEb,eAAS,KAAK,qBAAqB,IAAI;IAC3C,WAAaA,OAAM,QAAQ;AACvB,eAAS,KAAK,cAAc,MAAMF,SAAQ;IAC9C,WAAaE,OAAM,UAAU;AACzB,gBAAU,KAAK,QAAQA,OAAM,UAAU,MAAM,EAAE,QAAQ,MAAMF,SAAQ;AACrE,kBAAY;IAChB,WAAaE,OAAM,UAAU;AACzB,gBAAUA,OAAM,SAAS,IAAI,SAASoX,QAAO;AAC3C,YAAIA,OAAM,WAAW,QAAQ;AAC3B,iBAAOA,OAAM,QAAQ,MAAMtX,WAAU,IAAI;AAE3C,YAAIsX,OAAM,WAAW,QAAQ;AAC3B,iBAAOtX,UAAS,MAAM,yBAAyB;AACjD,YAAI,UAAUA,UAAS,SAASsX,OAAM,WAAW,GAAG;AAEpD,YAAI,OAAO,SAAS;AAClB,iBAAOtX,UAAS,MAAM,yCAAyC;AAEjE,YAAI,MAAMsX,OAAM,QAAQ,KAAKA,OAAM,WAAW,GAAG,GAAGtX,WAAU,IAAI;AAClE,QAAAA,UAAS,SAAS,OAAO;AAEzB,eAAO;SACN,IAAI,EAAE,OAAO,SAASsX,QAAO;AAC9B,eAAOA;MACb,CAAK;AACD,gBAAU,KAAK,qBAAqB,OAAO;IAC/C,OAAS;AACL,UAAIpX,OAAM,QAAQ,WAAWA,OAAM,QAAQ,SAAS;AAElD,YAAI,EAAEA,OAAM,QAAQA,OAAM,KAAK,WAAW;AACxC,iBAAOF,UAAS,MAAM,yBAAyBE,OAAM,GAAG;AAE1D,YAAI,CAAC,MAAM,QAAQ,IAAI;AACrB,iBAAOF,UAAS,MAAM,oCAAoC;AAE5D,YAAI,QAAQ,KAAK,MAAK;AACtB,cAAM,WAAW,WAAW;AAC5B,kBAAU,KAAK,qBAAqB,KAAK,IAAI,SAAS,MAAM;AAC1D,cAAIE,SAAQ,KAAK;AAEjB,iBAAO,KAAK,QAAQA,OAAM,KAAK,CAAC,GAAG,IAAI,EAAE,QAAQ,MAAMF,SAAQ;QACvE,GAAS,KAAK,CAAC;MACf,WAAeE,OAAM,QAAQ,MAAM;AAC7B,iBAAS,KAAK,QAAQA,OAAM,KAAK,MAAM,EAAE,QAAQ,MAAMF,SAAQ;MACrE,OAAW;AACL,kBAAU,KAAK,iBAAiBE,OAAM,KAAK,IAAI;AAC/C,oBAAY;;;AAKhB,QAAI;AACJ,QAAI,CAACA,OAAM,OAAOA,OAAM,WAAW,MAAM;AACvC,UAAI,MAAMA,OAAM,aAAa,OAAOA,OAAM,WAAWA,OAAM;AAC3D,UAAI,MAAMA,OAAM,aAAa,OAAO,cAAc;AAElD,UAAI,QAAQ,MAAM;AAChB,YAAIA,OAAM,QAAQ;AAChB,UAAAF,UAAS,MAAM,sCAAsC;MAC7D,OAAW;AACL,YAAIE,OAAM,QAAQ;AAChB,mBAAS,KAAK,iBAAiB,KAAK,WAAW,KAAK,OAAO;;;AAKjE,QAAIA,OAAM,aAAa;AACrB,eAAS,KAAK,iBAAiBA,OAAM,UAAU,OAAO,WAAW,MAAM;AAEzE,WAAO;EACT;AAEA,EAAAO,MAAK,UAAU,gBAAgB,SAAS8W,cAAa,MAAMvX,WAAU;AACnE,QAAIE,SAAQ,KAAK;AAEjB,QAAIQ,QAAOR,OAAM,OAAO,KAAK,IAAI;AACjC,QAAI,CAACQ,OAAM;AACT,MAAApC;QACI;QACA,KAAK,OAAO,mBACR,KAAK,UAAU,OAAO,KAAK4B,OAAM,MAAM,CAAC;MAAC;;AAEnD,WAAOQ,MAAK,QAAQ,KAAK,OAAOV,SAAQ;EAC1C;AAEA,EAAAS,MAAK,UAAU,mBAAmB,SAAS+W,iBAAgB,KAAK,MAAM;AACpE,QAAItX,SAAQ,KAAK;AAEjB,QAAI,OAAO,KAAK,GAAG;AACjB,aAAO,KAAK,WAAW,MAAM,GAAG;aACzB,QAAQ,WAAWA,OAAM;AAChC,aAAO,KAAK,aAAa,MAAMA,OAAM,YAAY,CAAC,GAAGA,OAAM,KAAK,CAAC,CAAC;aAC3D,QAAQ;AACf,aAAO,KAAK,aAAa,MAAM,MAAM,IAAI;aAClC,QAAQ,aAAa,QAAQ;AACpC,aAAO,KAAK,YAAY,MAAM,GAAG;aAC1B,QAAQ;AACf,aAAO,KAAK,YAAW;aAChB,QAAQ,SAAS,QAAQ;AAChC,aAAO,KAAK,WAAW,MAAMA,OAAM,QAAQA,OAAM,YAAY,CAAC,CAAC;aACxD,QAAQ;AACf,aAAO,KAAK,YAAY,IAAI;aACrB,QAAQ;AACf,aAAO,KAAK,WAAW,MAAM,GAAG;;AAEhC,YAAM,IAAI,MAAM,sBAAsB,GAAG;EAC7C;AAEA,EAAAO,MAAK,UAAU,YAAY,SAASgX,UAAS,KAAK;AAChD,WAAO,YAAY,KAAK,GAAG;EAC7B;AAEA,EAAAhX,MAAK,UAAU,cAAc,SAASiX,YAAW,KAAK;AACpD,WAAO,oCAAoC,KAAK,GAAG;;;;;;;;;ACxnBrD,QAAIjZ,QAAO;AAEX,IAAAA,MAAK,WAAWlC,SAAsB;AACtC,IAAAkC,MAAK,gBAAgBhC,cAAmB,EAAC;AACzC,IAAAgC,MAAK,gBAAgBhC,cAAmB,EAAC;AACzC,IAAAgC,MAAK,OAAO2B,YAAiB;;;;;;;;;;;ACL7B,QAAI6B,aAAY1F,iBAAA;AAEhB,YAAmB,WAAA;MACjB,GAAG;MACH,GAAG;MACH,GAAG;MACH,GAAG;IACL;AACA,YAAyB,iBAAA0F,WAAU,SAAS,QAAQ,QAAQ;AAE5D,YAAc,MAAA;MACZ,GAAM;MACN,GAAM;MACN,GAAM;MACN,GAAM;MACN,GAAM;MACN,GAAM;MACN,GAAM;MACN,GAAM;MACN,GAAM;MACN,GAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;MACN,IAAM;IACR;AACA,YAAA,YAAoBA,WAAU,SAAS,QAAQ,GAAG;;;;;;;;;ACzClD,QAAIA,aAAY;AAGhB,IAAAA,WAAU,WAAW,SAAS,QAAQ,KAAK;AACzC,UAAI,MAAM,CAAA;AAEV,aAAO,KAAK,GAAG,EAAE,QAAQ,SAAS7D,MAAK;AAErC,aAAKA,OAAM,MAAMA;AACf,UAAAA,OAAMA,OAAM;AAEd,YAAI,QAAQ,IAAIA,IAAG;AACnB,YAAI,KAAK,IAAIA;MACjB,CAAG;AAED,aAAO;IACT;AAEA,IAAA6D,WAAU,MAAM1F,aAAgB;;;;;;;;;;AClBhC,MAAIgC,YAAWhC;AAEf,MAAIsE,QAAOpE,YAAA;AACX,MAAIgC,QAAOoC,MAAK;AAChB,MAAIE,UAASF,MAAK;AAGlB,MAAIG,OAAMH,MAAK,UAAU;AAEzB,WAASc,YAAW,QAAQ;AAC1B,SAAK,MAAM;AACX,SAAK,OAAO,OAAO;AACnB,SAAK,SAAS;AAGd,SAAK,OAAO,IAAIT,SAAO;AACvB,SAAK,KAAK,MAAM,OAAO,IAAI;EAC7B;AACcC,YAAGQ;AAEjB,EAAAA,YAAW,UAAU,SAAS,SAASC,QAAO,MAAM,SAAS;AAC3D,QAAI,EAAE,gBAAgBnD,MAAK;AACzB,aAAO,IAAIA,MAAK,cAAc,MAAM,OAAO;AAE7C,WAAO,KAAK,KAAK,QAAQ,MAAM,OAAO;EACxC;AAIA,WAASyC,SAAQ,QAAQ;AACvB,IAAAzC,MAAK,KAAK,KAAK,MAAM,OAAO,MAAM;;AAEpC,EAAAF,UAAS2C,UAASzC,MAAK,IAAI;AAE3B,EAAAyC,SAAQ,UAAU,WAAW,SAASyW,SAAQvb,SAAQ,KAAKyF,MAAK;AAC9D,QAAIzF,QAAO,QAAO;AAChB,aAAO;AAET,QAAI8D,SAAQ9D,QAAO,KAAI;AACvB,QAAI,aAAawb,cAAaxb,SAAQ,0BAA0B,MAAM,GAAG;AACzE,QAAIA,QAAO,QAAQ,UAAU;AAC3B,aAAO;AAET,IAAAA,QAAO,QAAQ8D,MAAK;AAEpB,WAAO,WAAW,QAAQ,OAAO,WAAW,WAAW,OACpD,WAAW,SAAS,SAAU,OAAO2B;EAC1C;AAEA,EAAAX,SAAQ,UAAU,aAAa,SAAS2W,WAAUzb,SAAQ,KAAKyF,MAAK;AAClE,QAAI,aAAa+V;MAAaxb;MACA,8BAA8B,MAAM;IAAG;AACrE,QAAIA,QAAO,QAAQ,UAAU;AAC3B,aAAO;AAET,QAAI,MAAM0b;MAAa1b;MACA,WAAW;MACX,8BAA8B,MAAM;IAAG;AAG9D,QAAIA,QAAO,QAAQ,GAAG;AACpB,aAAO;AAET,QAAI,CAACyF,QACD,WAAW,QAAQ,OACnB,WAAW,WAAW,OACtB,WAAW,SAAS,SAAS,KAAK;AACpC,aAAOzF,QAAO,MAAM,2BAA2B,MAAM,GAAG;;AAG1D,QAAI,WAAW,aAAa,QAAQ;AAClC,aAAOA,QAAO,KAAK,KAAK,+BAA+B,MAAM,GAAG;AAGlE,QAAI8D,SAAQ9D,QAAO,KAAI;AACvB,QAAI,MAAM,KAAK;MACXA;MACA,6CAA6C,KAAK,MAAM;IAAG;AAC/D,QAAIA,QAAO,QAAQ,GAAG;AACpB,aAAO;AAET,UAAMA,QAAO,SAAS8D,OAAM;AAC5B,IAAA9D,QAAO,QAAQ8D,MAAK;AACpB,WAAO9D,QAAO,KAAK,KAAK,+BAA+B,MAAM,GAAG;EAClE;AAEA,EAAA8E,SAAQ,UAAU,gBAAgB,SAAS6W,cAAa3b,SAAQ,MAAM;AACpE,WAAO,MAAM;AACX,UAAI,MAAMwb,cAAaxb,SAAQ,IAAI;AACnC,UAAIA,QAAO,QAAQ,GAAG;AACpB,eAAO;AACT,UAAI,MAAM0b,cAAa1b,SAAQ,IAAI,WAAW,IAAI;AAClD,UAAIA,QAAO,QAAQ,GAAG;AACpB,eAAO;AAET,UAAI;AACJ,UAAI,IAAI,aAAa,QAAQ;AAC3B,cAAMA,QAAO,KAAK,GAAG;;AAErB,cAAM,KAAK,cAAcA,SAAQ,IAAI;AAGvC,UAAIA,QAAO,QAAQ,GAAG;AACpB,eAAO;AAET,UAAI,IAAI,WAAW;AACjB;;EAEN;AAEA,EAAA8E,SAAQ,UAAU,cAAc,SAAS8W,YAAW5b,SAAQ,KAAK,SACb,SAAS;AAC3D,QAAI,SAAS,CAAA;AACb,WAAO,CAACA,QAAO,QAAO,GAAI;AACxB,UAAI,cAAc,KAAK,SAASA,SAAQ,KAAK;AAC7C,UAAIA,QAAO,QAAQ,WAAW;AAC5B,eAAO;AAET,UAAI,MAAM,QAAQ,OAAOA,SAAQ,OAAO,OAAO;AAC/C,UAAIA,QAAO,QAAQ,GAAG,KAAK;AACzB;AACF,aAAO,KAAK,GAAG;;AAEjB,WAAO;EACT;AAEA,EAAA8E,SAAQ,UAAU,aAAa,SAAS+W,WAAU7b,SAAQ,KAAK;AAC7D,QAAI,QAAQ,UAAU;AACpB,UAAI,SAASA,QAAO,UAAS;AAC7B,UAAIA,QAAO,QAAQ,MAAM;AACvB,eAAO;AACT,aAAO,EAAE,QAAgB,MAAMA,QAAO,IAAG,EAAE;IAC/C,WAAa,QAAQ,UAAU;AAC3B,UAAI0F,OAAM1F,QAAO,IAAG;AACpB,UAAI0F,KAAI,SAAS,MAAM;AACrB,eAAO1F,QAAO,MAAM,iDAAiD;AAEvE,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI0F,KAAI,SAAS,GAAG,KAAK;AACvC,eAAO,OAAO,aAAaA,KAAI,aAAa,IAAI,CAAC,CAAC;;AAEpD,aAAO;IACX,WAAa,QAAQ,UAAU;AAC3B,UAAI,SAAS1F,QAAO,IAAG,EAAG,SAAS,OAAO;AAC1C,UAAI,CAAC,KAAK,UAAU,MAAM,GAAG;AAC3B,eAAOA,QAAO,MAAM,wDAC+B;;AAErD,aAAO;IACX,WAAa,QAAQ,UAAU;AAC3B,aAAOA,QAAO,IAAG;IACrB,WAAa,QAAQ,WAAW;AAC5B,aAAOA,QAAO,IAAG;IACrB,WAAa,QAAQ,YAAY;AAC7B,UAAI,WAAWA,QAAO,IAAG,EAAG,SAAS,OAAO;AAC5C,UAAI,CAAC,KAAK,YAAY,QAAQ,GAAG;AAC/B,eAAOA,QAAO,MAAM,0DACiC;;AAEvD,aAAO;eACE,OAAO,KAAK,GAAG,GAAG;AAC3B,aAAOA,QAAO,IAAG,EAAG,SAAQ;IAChC,OAAS;AACL,aAAOA,QAAO,MAAM,8BAA8B,MAAM,cAAc;;EAE1E;AAEA,EAAA8E,SAAQ,UAAU,eAAe,SAASgX,aAAY9b,SAAQ,QAAQ,UAAU;AAC9E,QAAI;AACJ,QAAI,cAAc,CAAA;AAClB,QAAI,QAAQ;AACZ,WAAO,CAACA,QAAO,QAAO,GAAI;AACxB,UAAI,WAAWA,QAAO,UAAS;AAC/B,gBAAU;AACV,eAAS,WAAW;AACpB,WAAK,WAAW,SAAU,GAAG;AAC3B,oBAAY,KAAK,KAAK;AACtB,gBAAQ;;;AAGZ,QAAI,WAAW;AACb,kBAAY,KAAK,KAAK;AAExB,QAAI,QAAS,YAAY,CAAC,IAAI,KAAM;AACpC,QAAI,SAAS,YAAY,CAAC,IAAI;AAE9B,QAAI;AACF,eAAS;;AAET,eAAS,CAAC,OAAO,MAAM,EAAE,OAAO,YAAY,MAAM,CAAC,CAAC;AAEtD,QAAI,QAAQ;AACV,UAAI,MAAM,OAAO,OAAO,KAAK,GAAG,CAAC;AACjC,UAAI,QAAQ;AACV,cAAM,OAAO,OAAO,KAAK,GAAG,CAAC;AAC/B,UAAI,QAAQ;AACV,iBAAS;;AAGb,WAAO;EACT;AAEA,EAAA8E,SAAQ,UAAU,cAAc,SAASiX,YAAW/b,SAAQ,KAAK;AAC/D,QAAI,MAAMA,QAAO,IAAG,EAAG,SAAQ;AAC/B,QAAI,QAAQ,WAAW;AACrB,UAAI,OAAO,IAAI,MAAM,GAAG,CAAC,IAAI;AAC7B,UAAI,MAAM,IAAI,MAAM,GAAG,CAAC,IAAI;AAC5B,UAAI,MAAM,IAAI,MAAM,GAAG,CAAC,IAAI;AAC5B,UAAI,OAAO,IAAI,MAAM,GAAG,EAAE,IAAI;AAC9B,UAAIsB,OAAM,IAAI,MAAM,IAAI,EAAE,IAAI;AAC9B,UAAI,MAAM,IAAI,MAAM,IAAI,EAAE,IAAI;IAClC,WAAa,QAAQ,WAAW;AAC5B,UAAI,OAAO,IAAI,MAAM,GAAG,CAAC,IAAI;AAC7B,UAAI,MAAM,IAAI,MAAM,GAAG,CAAC,IAAI;AAC5B,UAAI,MAAM,IAAI,MAAM,GAAG,CAAC,IAAI;AAC5B,UAAI,OAAO,IAAI,MAAM,GAAG,CAAC,IAAI;AAC7B,UAAIA,OAAM,IAAI,MAAM,GAAG,EAAE,IAAI;AAC7B,UAAI,MAAM,IAAI,MAAM,IAAI,EAAE,IAAI;AAC9B,UAAI,OAAO;AACT,eAAO,MAAO;;AAEd,eAAO,OAAO;IACpB,OAAS;AACL,aAAOtB,QAAO,MAAM,cAAc,MAAM,4BAA4B;;AAGtE,WAAO,KAAK,IAAI,MAAM,MAAM,GAAG,KAAK,MAAMsB,MAAK,KAAK,CAAC;EACvD;AAEA,EAAAwD,SAAQ,UAAU,cAAc,SAASkX,YAAWhc,SAAQ;AAC1D,WAAO;EACT;AAEA,EAAA8E,SAAQ,UAAU,cAAc,SAASmX,YAAWjc,SAAQ;AAC1D,QAAI,MAAMA,QAAO,UAAS;AAC1B,QAAIA,QAAO,QAAQ,GAAG;AACpB,aAAO;;AAEP,aAAO,QAAQ;EACnB;AAEA,EAAA8E,SAAQ,UAAU,aAAa,SAAS0U,WAAUxZ,SAAQ,QAAQ;AAEhE,QAAI0F,OAAM1F,QAAO,IAAG;AACpB,QAAI,MAAM,IAAI2E,QAAOe,IAAG;AAExB,QAAI;AACF,YAAM,OAAO,IAAI,SAAS,EAAE,CAAC,KAAK;AAEpC,WAAO;EACT;AAEA,EAAAZ,SAAQ,UAAU,OAAO,SAASM,KAAI,QAAQ1E,MAAK;AACjD,QAAI,OAAO,WAAW;AACpB,eAAS,OAAOA,IAAG;AACrB,WAAO,OAAO,YAAY,KAAK,EAAE;EACnC;AAIA,WAAS8a,cAAa,KAAK,MAAM;AAC/B,QAAI,MAAM,IAAI,UAAU,IAAI;AAC5B,QAAI,IAAI,QAAQ,GAAG;AACjB,aAAO;AAET,QAAI,MAAM5W,KAAI,SAAS,OAAO,CAAC;AAC/B,QAAI,aAAa,MAAM,QAAU;AAGjC,SAAK,MAAM,QAAU,IAAM;AACzB,UAAI,MAAM;AACV,YAAM;AACN,cAAQ,MAAM,SAAU,KAAM;AAC5B,cAAM,IAAI,UAAU,IAAI;AACxB,YAAI,IAAI,QAAQ,GAAG;AACjB,iBAAO;AAET,gBAAQ;AACR,eAAO,MAAM;;IAEnB,OAAS;AACL,aAAO;;AAET,QAAI,SAASA,KAAI,IAAI,GAAG;AAExB,WAAO;MACL;MACA;MACA;MACA;IACJ;;AAGA,WAAS8W,cAAa,KAAK,WAAW,MAAM;AAC1C,QAAI,MAAM,IAAI,UAAU,IAAI;AAC5B,QAAI,IAAI,QAAQ,GAAG;AACjB,aAAO;AAGT,QAAI,CAAC,aAAa,QAAQ;AACxB,aAAO;AAGT,SAAK,MAAM,SAAU,GAAG;AAEtB,aAAO;;AAIT,QAAI,MAAM,MAAM;AAChB,QAAI,MAAM;AACR,aAAO,IAAI,MAAM,2BAA2B;AAE9C,UAAM;AACN,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,cAAQ;AACR,UAAI,IAAI,IAAI,UAAU,IAAI;AAC1B,UAAI,IAAI,QAAQ,CAAC;AACf,eAAO;AACT,aAAO;;AAGT,WAAO;EACT;;;;;;;;ACnUA,MAAIvZ,YAAWhC;AACf,MAAIG,UAASD,SAAkB;AAE/B,MAAIkF,cAAavB,aAAA;AAEjB,WAASkY,YAAW,QAAQ;AAC1B,IAAA3W,YAAW,KAAK,MAAM,MAAM;AAC5B,SAAK,MAAM;EACb;AACA,EAAApD,UAAS+Z,aAAY3W,WAAU;AACjBF,UAAG6W;AAEjB,EAAAA,YAAW,UAAU,SAAS,SAAS1W,QAAO,MAAM,SAAS;AAC3D,QAAI,QAAQ,KAAK,SAAQ,EAAG,MAAM,UAAU;AAE5C,QAAI,QAAQ,QAAQ,MAAM,YAAW;AAErC,QAAI,KAAK;AACT,QAAI,QAAQ;AACZ,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAI,QAAQ,MAAM,CAAC,EAAE,MAAM,EAAE;AAC7B,UAAI,UAAU;AACZ;AAEF,UAAI,MAAM,CAAC,MAAM;AACf;AAEF,UAAI,UAAU,IAAI;AAChB,YAAI,MAAM,CAAC,MAAM;AACf;AACF,gBAAQ;MACd,OAAW;AACL,YAAI,MAAM,CAAC,MAAM;AACf;AACF,cAAM;AACN;;;AAGJ,QAAI,UAAU,MAAM,QAAQ;AAC1B,YAAM,IAAI,MAAM,gCAAgC,KAAK;AAEvD,QAAI,SAAS,MAAM,MAAM,QAAQ,GAAG,GAAG,EAAE,KAAK,EAAE;AAEhD,WAAO,QAAQ,qBAAqB,EAAE;AAEtC,QAAI,QAAQ,IAAIlF,QAAO,QAAQ,QAAQ;AACvC,WAAOiF,YAAW,UAAU,OAAO,KAAK,MAAM,OAAO,OAAO;;;;;;;;;AC/C9D,QAAII,YAAW;AAEf,IAAAA,UAAS,MAAMxF,aAAA;AACf,IAAAwF,UAAS,MAAMtF,aAAgB;;;;;;;;;;ACH/B,MAAI8B,YAAWhC;AACf,MAAIG,UAASD,SAAkB;AAE/B,MAAIoE,QAAOT,YAAA;AACX,MAAI3B,QAAOoC,MAAK;AAGhB,MAAIG,OAAMH,MAAK,UAAU;AAEzB,WAAS,WAAW,QAAQ;AAC1B,SAAK,MAAM;AACX,SAAK,OAAO,OAAO;AACnB,SAAK,SAAS;AAGd,SAAK,OAAO,IAAIK,SAAO;AACvB,SAAK,KAAK,MAAM,OAAO,IAAI;EAC7B;AACc,UAAG;AAEjB,aAAW,UAAU,SAAS,SAASN,QAAO,MAAMZ,WAAU;AAC5D,WAAO,KAAK,KAAK,QAAQ,MAAMA,SAAQ,EAAE,KAAI;EAC/C;AAIA,WAASkB,SAAQ,QAAQ;AACvB,IAAAzC,MAAK,KAAK,KAAK,MAAM,OAAO,MAAM;;AAEpC,EAAAF,UAAS2C,UAASzC,MAAK,IAAI;AAE3B,EAAAyC,SAAQ,UAAU,mBAAmB,SAAS,gBAAgB,KACA,WACA,KACA,SAAS;AACrE,QAAI,aAAa,UAAU,KAAK,WAAW,KAAK,KAAK,QAAQ;AAG7D,QAAI,QAAQ,SAAS,KAAM;AACzB,UAAI,SAAS,IAAIxE,QAAO,CAAC;AACzB,aAAO,CAAC,IAAI;AACZ,aAAO,CAAC,IAAI,QAAQ;AACpB,aAAO,KAAK,qBAAqB,CAAE,QAAQ,OAAO,CAAE;;AAKtD,QAAI,YAAY;AAChB,aAAS,IAAI,QAAQ,QAAQ,KAAK,KAAO,MAAM;AAC7C;AAEF,QAAI,SAAS,IAAIA,QAAO,IAAI,IAAI,SAAS;AACzC,WAAO,CAAC,IAAI;AACZ,WAAO,CAAC,IAAI,MAAO;AAEnB,aAAS,IAAI,IAAI,WAAW,IAAI,QAAQ,QAAQ,IAAI,GAAG,KAAK,MAAM;AAChE,aAAO,CAAC,IAAI,IAAI;AAElB,WAAO,KAAK,qBAAqB,CAAE,QAAQ,OAAO,CAAE;EACtD;AAEA,EAAAwE,SAAQ,UAAU,aAAa,SAAS,UAAU,KAAK,KAAK;AAC1D,QAAI,QAAQ,UAAU;AACpB,aAAO,KAAK,qBAAqB,CAAE,IAAI,SAAS,GAAG,IAAI,IAAI,CAAE;IACjE,WAAa,QAAQ,UAAU;AAC3B,UAAI,MAAM,IAAIxE,QAAO,IAAI,SAAS,CAAC;AACnC,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,cAAc,IAAI,WAAW,CAAC,GAAG,IAAI,CAAC;;AAE5C,aAAO,KAAK,qBAAqB,GAAG;IACxC,WAAa,QAAQ,UAAU;AAC3B,UAAI,CAAC,KAAK,UAAU,GAAG,GAAG;AACxB,eAAO,KAAK,SAAS,MAAM,gEACuB;;AAEpD,aAAO,KAAK,qBAAqB,GAAG;IACxC,WAAa,QAAQ,YAAY;AAC7B,UAAI,CAAC,KAAK,YAAY,GAAG,GAAG;AAC1B,eAAO,KAAK,SAAS,MAAM,mNAKe;;AAE5C,aAAO,KAAK,qBAAqB,GAAG;eAC3B,OAAO,KAAK,GAAG,GAAG;AAC3B,aAAO,KAAK,qBAAqB,GAAG;IACxC,WAAa,QAAQ,WAAW;AAC5B,aAAO,KAAK,qBAAqB,GAAG;IACxC,OAAS;AACL,aAAO,KAAK,SAAS,MAAM,8BAA8B,MAC9B,cAAc;;EAE7C;AAEA,EAAAwE,SAAQ,UAAU,eAAe,SAAS,YAAY,IAAI,QAAQ,UAAU;AAC1E,QAAI,OAAO,OAAO,UAAU;AAC1B,UAAI,CAAC;AACH,eAAO,KAAK,SAAS,MAAM,6CAA6C;AAC1E,UAAI,CAAC,OAAO,eAAe,EAAE;AAC3B,eAAO,KAAK,SAAS,MAAM,+BAA+B;AAC5D,WAAK,OAAO,EAAE,EAAE,MAAM,UAAU;AAChC,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ;AAC7B,WAAG,CAAC,KAAK;eACF,MAAM,QAAQ,EAAE,GAAG;AAC5B,WAAK,GAAG,MAAK;AACb,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ;AAC7B,WAAG,CAAC,KAAK;;AAGb,QAAI,CAAC,MAAM,QAAQ,EAAE,GAAG;AACtB,aAAO,KAAK,SAAS,MAAM,oDACU,KAAK,UAAU,EAAE,CAAC;;AAGzD,QAAI,CAAC,UAAU;AACb,UAAI,GAAG,CAAC,KAAK;AACX,eAAO,KAAK,SAAS,MAAM,6BAA6B;AAC1D,SAAG,OAAO,GAAG,GAAG,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC;;AAIpC,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,UAAI,QAAQ,GAAG,CAAC;AAChB,WAAK,QAAQ,SAAS,KAAM,UAAU;AACpC;;AAGJ,QAAI,QAAQ,IAAIxE,QAAO,IAAI;AAC3B,QAAI,SAAS,MAAM,SAAS;AAC5B,aAAS,IAAI,GAAG,SAAS,GAAG,KAAK,GAAG,KAAK;AACvC,UAAI,QAAQ,GAAG,CAAC;AAChB,YAAM,QAAQ,IAAI,QAAQ;AAC1B,cAAQ,UAAU,KAAK;AACrB,cAAM,QAAQ,IAAI,MAAQ,QAAQ;;AAGtC,WAAO,KAAK,qBAAqB,KAAK;EACxC;AAEA,WAAS,IAAI,KAAK;AAChB,QAAI,MAAM;AACR,aAAO,MAAM;;AAEb,aAAO;;AAGX,EAAAwE,SAAQ,UAAU,cAAc,SAAS,WAAW,MAAM,KAAK;AAC7D,QAAI;AACJ,QAAI,OAAO,IAAI,KAAK,IAAI;AAExB,QAAI,QAAQ,WAAW;AACrB,YAAM;QACJ,IAAI,KAAK,YAAW,CAAE;QACtB,IAAI,KAAK,YAAW,IAAK,CAAC;QAC1B,IAAI,KAAK,WAAU,CAAE;QACrB,IAAI,KAAK,YAAW,CAAE;QACtB,IAAI,KAAK,cAAa,CAAE;QACxB,IAAI,KAAK,cAAa,CAAE;QACxB;MACN,EAAM,KAAK,EAAE;IACb,WAAa,QAAQ,WAAW;AAC5B,YAAM;QACJ,IAAI,KAAK,YAAW,IAAK,GAAG;QAC5B,IAAI,KAAK,YAAW,IAAK,CAAC;QAC1B,IAAI,KAAK,WAAU,CAAE;QACrB,IAAI,KAAK,YAAW,CAAE;QACtB,IAAI,KAAK,cAAa,CAAE;QACxB,IAAI,KAAK,cAAa,CAAE;QACxB;MACN,EAAM,KAAK,EAAE;IACb,OAAS;AACL,WAAK,SAAS,MAAM,cAAc,MAAM,4BAA4B;;AAGtE,WAAO,KAAK,WAAW,KAAK,QAAQ;EACtC;AAEA,EAAAA,SAAQ,UAAU,cAAc,SAAS,aAAa;AACpD,WAAO,KAAK,qBAAqB,EAAE;EACrC;AAEA,EAAAA,SAAQ,UAAU,aAAa,SAASG,WAAU,KAAK,QAAQ;AAC7D,QAAI,OAAO,QAAQ,UAAU;AAC3B,UAAI,CAAC;AACH,eAAO,KAAK,SAAS,MAAM,6CAA6C;AAC1E,UAAI,CAAC,OAAO,eAAe,GAAG,GAAG;AAC/B,eAAO,KAAK,SAAS,MAAM,iCACA,KAAK,UAAU,GAAG,CAAC;;AAEhD,YAAM,OAAO,GAAG;;AAIlB,QAAI,OAAO,QAAQ,YAAY,CAAC3E,QAAO,SAAS,GAAG,GAAG;AACpD,UAAI,WAAW,IAAI,QAAO;AAC1B,UAAI,CAAC,IAAI,QAAQ,SAAS,CAAC,IAAI,KAAM;AACnC,iBAAS,QAAQ,CAAC;;AAEpB,YAAM,IAAIA,QAAO,QAAQ;;AAG3B,QAAIA,QAAO,SAAS,GAAG,GAAG;AACxB,UAAI,OAAO,IAAI;AACf,UAAI,IAAI,WAAW;AACjB;AAEF,UAAI,MAAM,IAAIA,QAAO,IAAI;AACzB,UAAI,KAAK,GAAG;AACZ,UAAI,IAAI,WAAW;AACjB,YAAI,CAAC,IAAI;AACX,aAAO,KAAK,qBAAqB,GAAG;;AAGtC,QAAI,MAAM;AACR,aAAO,KAAK,qBAAqB,GAAG;AAEtC,QAAI,MAAM;AACR,aAAO,KAAK,qBAAqB,CAAC,GAAG,GAAG,CAAC;AAE3C,QAAI,OAAO;AACX,aAAS,IAAI,KAAK,KAAK,KAAO,MAAM;AAClC;AAEF,QAAI,MAAM,IAAI,MAAM,IAAI;AACxB,aAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,UAAI,CAAC,IAAI,MAAM;AACf,cAAQ;;AAEV,QAAG,IAAI,CAAC,IAAI,KAAM;AAChB,UAAI,QAAQ,CAAC;;AAGf,WAAO,KAAK,qBAAqB,IAAIA,QAAO,GAAG,CAAC;EAClD;AAEA,EAAAwE,SAAQ,UAAU,cAAc,SAAS,WAAW,OAAO;AACzD,WAAO,KAAK,qBAAqB,QAAQ,MAAO,CAAC;EACnD;AAEA,EAAAA,SAAQ,UAAU,OAAO,SAASM,KAAI,QAAQ1E,MAAK;AACjD,QAAI,OAAO,WAAW;AACpB,eAAS,OAAOA,IAAG;AACrB,WAAO,OAAO,YAAY,KAAK,EAAE;EACnC;AAEA,EAAAoE,SAAQ,UAAU,eAAe,SAAS,YAAY,YAAYlB,WAAU,QAAQ;AAClF,QAAIE,SAAQ,KAAK;AACjB,QAAI;AACJ,QAAIA,OAAM,SAAS,MAAM;AACvB,aAAO;AAET,QAAI,OAAO,WAAW,KAAI;AAC1B,QAAIA,OAAM,kBAAkB;AAC1B,MAAAA,OAAM,gBAAgB,KAAK,aAAaA,OAAM,SAAS,GAAGF,WAAU,MAAM,EAAE,KAAI;AAElF,QAAI,KAAK,WAAWE,OAAM,cAAc;AACtC,aAAO;AAET,SAAK,IAAE,GAAG,IAAI,KAAK,QAAQ;AACzB,UAAI,KAAK,CAAC,MAAMA,OAAM,cAAc,CAAC;AACnC,eAAO;AAEX,WAAO;EACT;AAIA,WAAS,UAAU,KAAK,WAAW,KAAKF,WAAU;AAChD,QAAI;AAEJ,QAAI,QAAQ;AACV,YAAM;aACC,QAAQ;AACf,YAAM;AAER,QAAIgB,KAAI,UAAU,eAAe,GAAG;AAClC,YAAMA,KAAI,UAAU,GAAG;aAChB,OAAO,QAAQ,aAAa,MAAM,OAAO;AAChD,YAAM;;AAEN,aAAOhB,UAAS,MAAM,kBAAkB,GAAG;AAE7C,QAAI,OAAO;AACT,aAAOA,UAAS,MAAM,sCAAsC;AAE9D,QAAI,CAAC;AACH,aAAO;AAET,WAAQgB,KAAI,eAAe,OAAO,WAAW,KAAK;AAElD,WAAO;EACT;;;;;;;;ACtSA,MAAIzC,YAAWhC;AAEf,MAAI,aAAaE,WAAA;AAEjB,WAAS,WAAW,QAAQ;AAC1B,eAAW,KAAK,MAAM,MAAM;AAC5B,SAAK,MAAM;EACb;AACA,EAAA8B,UAAS,YAAY,UAAU;AACjB,QAAG;AAEjB,aAAW,UAAU,SAAS,SAASqC,QAAO,MAAM,SAAS;AAC3D,QAAI,MAAM,WAAW,UAAU,OAAO,KAAK,MAAM,IAAI;AAErD,QAAI,IAAI,IAAI,SAAS,QAAQ;AAC7B,QAAI,MAAM,CAAE,gBAAgB,QAAQ,QAAQ,OAAO;AACnD,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAI,KAAK,EAAE,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7B,QAAI,KAAK,cAAc,QAAQ,QAAQ,OAAO;AAC9C,WAAO,IAAI,KAAK,IAAI;;;;;;;;;ACnBtB,QAAIc,YAAW;AAEf,IAAAA,UAAS,MAAMnF,WAAA;AACf,IAAAmF,UAAS,MAAMjF,WAAgB;;;;;;;;;ACH/B,QAAIoE,QAAO;AAEX,IAAAA,MAAK,SAAStE;AAEd,IAAAsE,MAAK,SAASpE,WAAqB,EAAC;AACpC,IAAAoE,MAAK,OAAOT,YAAA;AACZ,IAAAS,MAAK,YAAYC,iBAAA;AACjB,IAAAD,MAAK,WAAWI,gBAAA;AAChB,IAAAJ,MAAK,WAAWqB,gBAA0B;;;;ACH1C,IAAI,MAAM3F,YAAA;AAEV,IAAI,OAAO,IAAI,OAAO,QAAQ,WAAY;AACzC,OAAK,OAAO;IACX,SAAS,KAAK,QAAO;IACrB,aAAa,KAAK,QAAO;EAC3B,CAAE;AACF,CAAC;AAED,IAAI,qBAAqB,IAAI,OAAO,sBAAsB,WAAY;AACrE,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,MAAM,EAAE,MAAK;IACtB,KAAK,IAAI,OAAO,EAAE,IAAG;EACvB;AACA,CAAC;AAED,IAAIgc,wBAAsB,IAAI,OAAO,uBAAuB,WAAY;AACvE,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,WAAW,EAAE,MAAK;IAC3B,KAAK,IAAI,YAAY,EAAE,SAAQ;IAC/B,KAAK,IAAI,OAAO,EAAE,MAAK,EAAG,SAAQ;EACpC;AACA,CAAC;AAED,IAAI,uBAAuB,IAAI,OAAO,wBAAwB,WAAY;AACzE,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,WAAW,EAAE,IAAIA,qBAAmB;IAC7C,KAAK,IAAI,kBAAkB,EAAE,OAAM;EACrC;AACA,CAAC;AAED,IAAI,4BAA4B,IAAI,OAAO,6BAA6B,WAAY;AACnF,OAAK,MAAM,kBAAkB;AAC9B,CAAC;AAED,IAAI,cAAc,IAAI,OAAO,eAAe,WAAY;AACvD,OAAK,MAAM,yBAAyB;AACrC,CAAC;AAED,IAAI,OAAO,IAAI,OAAO,QAAQ,WAAY;AACzC,OAAK,OAAO;IACX,aAAa,KAAK,IAAI,WAAW;EACnC,CAAE;AACF,CAAC;AAED,IAAI,WAAW,IAAI,OAAO,YAAY,WAAY;AACjD,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,WAAW,EAAE,IAAI,IAAI;IAC9B,KAAK,IAAI,UAAU,EAAE,IAAI,IAAI;EAC/B;AACA,CAAC;AAED,IAAI,YAAY,IAAI,OAAO,aAAa,WAAY;AACnD,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,QAAQ,EAAE,MAAK;IACxB,KAAK,IAAI,UAAU,EAAE,KAAI,EAAG,IAAI,KAAK;IACrC,KAAK,IAAI,WAAW,EAAE,OAAM;EAC9B;AACA,CAAC;AAED,IAAI,iBAAiB,IAAI,OAAO,kBAAkB,WAAY;AAC7D,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,SAAS,EAAE,SAAS,CAAC,EAAE,KAAK,EAAC,EAAG,SAAQ;IACjD,KAAK,IAAI,cAAc,EAAE,KAAK,EAAC;IAC/B,KAAK,IAAI,WAAW,EAAE,IAAIA,qBAAmB;IAC7C,KAAK,IAAI,QAAQ,EAAE,IAAI,IAAI;IAC3B,KAAK,IAAI,UAAU,EAAE,IAAI,QAAQ;IACjC,KAAK,IAAI,SAAS,EAAE,IAAI,IAAI;IAC5B,KAAK,IAAI,sBAAsB,EAAE,IAAI,oBAAoB;IACzD,KAAK,IAAI,gBAAgB,EAAE,SAAS,CAAC,EAAE,OAAM,EAAG,SAAQ;IACxD,KAAK,IAAI,iBAAiB,EAAE,SAAS,CAAC,EAAE,OAAM,EAAG,SAAQ;IACzD,KAAK,IAAI,YAAY,EAAE,SAAS,CAAC,EAAE,MAAM,SAAS,EAAE,SAAQ;EAC9D;AACA,CAAC;AAED,IAAI,kBAAkB,IAAI,OAAO,mBAAmB,WAAY;AAC/D,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,gBAAgB,EAAE,IAAI,cAAc;IAC7C,KAAK,IAAI,oBAAoB,EAAE,IAAIA,qBAAmB;IACtD,KAAK,IAAI,gBAAgB,EAAE,OAAM;EACnC;AACA,CAAC;AAED,IAAA,cAAiB;ACnFjB,IAAI1X,SAAOtE,YAAA;AAEQic,OAAA,cAAG/b;AAEtB,IAAI,gBAAgBoE,OAAK,OAAO,iBAAiB,WAAY;AAC5D,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,SAAS,EAAE,KAAK,EAAC;IAC1B,KAAK,IAAI,SAAS,EAAE,KAAK,EAAC;IAC1B,KAAK,IAAI,gBAAgB,EAAE,KAAK,EAAC;IACjC,KAAK,IAAI,iBAAiB,EAAE,KAAK,EAAC;IAClC,KAAK,IAAI,QAAQ,EAAE,KAAK,EAAC;IACzB,KAAK,IAAI,QAAQ,EAAE,KAAK,EAAC;IACzB,KAAK,IAAI,WAAW,EAAE,KAAK,EAAC;IAC5B,KAAK,IAAI,WAAW,EAAE,KAAK,EAAC;IAC5B,KAAK,IAAI,aAAa,EAAE,KAAK,EAAC;EAChC;AACA,CAAC;AACoB2X,OAAA,gBAAG;AAExB,IAAI,eAAe3X,OAAK,OAAO,gBAAgB,WAAY;AAC1D,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,SAAS,EAAE,KAAK,EAAC;IAC1B,KAAK,IAAI,gBAAgB,EAAE,KAAK,EAAC;EACnC;AACA,CAAC;AACmB2X,OAAA,eAAG;AAEvB,IAAI,sBAAsB3X,OAAK,OAAO,uBAAuB,WAAY;AACxE,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,WAAW,EAAE,MAAK;IAC3B,KAAK,IAAI,MAAM,EAAE,MAAK,EAAG,SAAQ;IACjC,KAAK,IAAI,OAAO,EAAE,MAAK,EAAG,SAAQ;IAClC,KAAK,IAAI,QAAQ,EAAE,IAAG,EAAG;MACxB,KAAK,IAAI,GAAG,EAAE,KAAK,EAAC;MACpB,KAAK,IAAI,GAAG,EAAE,KAAK,EAAC;MACpB,KAAK,IAAI,GAAG,EAAE,KAAK,EAAC;IACvB,EAAI,SAAQ;EACZ;AACA,CAAC;AAED,IAAI,YAAYA,OAAK,OAAO,wBAAwB,WAAY;AAC/D,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,WAAW,EAAE,IAAI,mBAAmB;IAC7C,KAAK,IAAI,kBAAkB,EAAE,OAAM;EACrC;AACA,CAAC;AACgB2X,OAAA,YAAG;AAEpB,IAAI,iBAAiB3X,OAAK,OAAO,kBAAkB,WAAY;AAC9D,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,SAAS,EAAE,KAAK,EAAC;IAC1B,KAAK,IAAI,WAAW,EAAE,IAAI,mBAAmB;IAC7C,KAAK,IAAI,mBAAmB,EAAE,OAAM;EACtC;AACA,CAAC;AACiB2X,OAAA,aAAG;AACrB,IAAI,0BAA0B3X,OAAK,OAAO,2BAA2B,WAAY;AAChF,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,WAAW,EAAE,IAAG,EAAG;MAC3B,KAAK,IAAI,IAAI,EAAE,MAAK;MACpB,KAAK,IAAI,SAAS,EAAE,IAAG,EAAG;QACzB,KAAK,IAAI,KAAK,EAAE,IAAG,EAAG;UACrB,KAAK,IAAI,IAAI,EAAE,MAAK;UACpB,KAAK,IAAI,WAAW,EAAE,IAAG,EAAG;YAC3B,KAAK,IAAI,MAAM,EAAE,OAAM;YACvB,KAAK,IAAI,OAAO,EAAE,KAAK,EAAC;UAC9B;QACA;QACI,KAAK,IAAI,QAAQ,EAAE,IAAG,EAAG;UACxB,KAAK,IAAI,MAAM,EAAE,MAAK;UACtB,KAAK,IAAI,IAAI,EAAE,OAAM;QAC1B;MACA;IACA;IACE,KAAK,IAAI,mBAAmB,EAAE,OAAM;EACtC;AACA,CAAC;AAE0B2X,OAAA,sBAAG;AAE9B,IAAI,gBAAgB3X,OAAK,OAAO,iBAAiB,WAAY;AAC5D,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,SAAS,EAAE,KAAK,EAAC;IAC1B,KAAK,IAAI,GAAG,EAAE,KAAK,EAAC;IACpB,KAAK,IAAI,GAAG,EAAE,KAAK,EAAC;IACpB,KAAK,IAAI,GAAG,EAAE,KAAK,EAAC;IACpB,KAAK,IAAI,SAAS,EAAE,KAAK,EAAC;IAC1B,KAAK,IAAI,UAAU,EAAE,KAAK,EAAC;EAC7B;AACA,CAAC;AACoB2X,OAAA,gBAAG;AAExBA,OAAA,WAAmB3X,OAAK,OAAO,YAAY,WAAY;AACtD,OAAK,KAAK,EAAC;AACZ,CAAC;AAED,IAAI,eAAeA,OAAK,OAAO,gBAAgB,WAAY;AAC1D,OAAK,OAAO;IACX,YAAY,KAAK,MAAK;EACxB,CAAE;AACF,CAAC;AAED,IAAI,eAAeA,OAAK,OAAO,gBAAgB,WAAY;AAC1D,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,SAAS,EAAE,KAAK,EAAC;IAC1B,KAAK,IAAI,YAAY,EAAE,OAAM;IAC7B,KAAK,IAAI,YAAY,EAAE,SAAQ,EAAG,SAAS,CAAC,EAAE,IAAI,YAAY;IAC9D,KAAK,IAAI,WAAW,EAAE,SAAQ,EAAG,SAAS,CAAC,EAAE,OAAM;EACrD;AACA,CAAC;AACmB2X,OAAA,eAAG;AAEvBA,OAAA,YAAoB3X,OAAK,OAAO,aAAa,WAAY;AACxD,OAAK,IAAG,EAAG;IACV,KAAK,IAAI,GAAG,EAAE,KAAK,EAAC;IACpB,KAAK,IAAI,GAAG,EAAE,KAAK,EAAC;EACtB;AACA,CAAC;;;;;;;;;;;;;;;ACvHD,IAAI,WAAW;AACf,IAAI,aAAa;AACjB,IAAI,YAAY;AAChB,IAAI,MAAMtE;AACV,IAAI4T,YAAU1T;AACd,IAAIC,WAAS0D,oBAAuB;AACpC,IAAAqY,YAAiB,SAAU,MAAM,UAAU;AAC1C,MAAIra,OAAM,KAAK,SAAQ;AACvB,MAAI,QAAQA,KAAI,MAAM,QAAQ;AAC9B,MAAI;AACJ,MAAI,CAAC,OAAO;AACX,QAAI,SAASA,KAAI,MAAM,SAAS;AAChC,gBAAY1B,SAAO,KAAK,OAAO,CAAC,EAAE,QAAQ,WAAW,EAAE,GAAG,QAAQ;EACpE,OAAQ;AACN,QAAI,QAAQ,QAAQ,MAAM,CAAC;AAC3B,QAAI,KAAKA,SAAO,KAAK,MAAM,CAAC,GAAG,KAAK;AACpC,QAAI,aAAaA,SAAO,KAAK,MAAM,CAAC,EAAE,QAAQ,WAAW,EAAE,GAAG,QAAQ;AACtE,QAAI,YAAY,IAAI,UAAU,GAAG,MAAM,GAAG,CAAC,GAAG,SAAS,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE;AACtE,QAAI,MAAM,CAAA;AACV,QAAIgc,UAASvI,UAAQ,iBAAiB,OAAO,WAAW,EAAE;AAC1D,QAAI,KAAKuI,QAAO,OAAO,UAAU,CAAC;AAClC,QAAI,KAAKA,QAAO,OAAO,EAAC,CAAE;AAC1B,gBAAYhc,SAAO,OAAO,GAAG;EAC/B;AACC,MAAI,MAAM0B,KAAI,MAAM,UAAU,EAAE,CAAC;AACjC,SAAO;IACN;IACA,MAAM;EACR;AACA;AC9BA,IAAI,OAAO7B;AACX,IAAI,QAAQ;AACZ,IAAI,UAAU6D;AACd,IAAI,UAAUU;AACd,IAAI,aAAaG,UAAkB;AACnC,IAAIvE,WAASwF,oBAAuB;AAEpC,SAAS,QAAQ,MAAM,UAAU;AAChC,MAAI,OAAO,KAAK,UAAU,QAAQ,IAAI,UAAU;AAChD,MAAI,QAAQ,SAAS,KAAK,UAAU,QAAQ,IAAI,UAAU,MAAM,SAAQ,GAAI,EAAE;AAC9E,MAAI,OAAO,MAAM,KAAK,UAAU,QAAQ,OAAO,KAAK,KAAK,GAAG,CAAC;AAC7D,MAAI,KAAK,KAAK,UAAU,QAAQ,OAAO;AACvC,MAAI,aAAa,KAAK;AACtB,MAAI,SAAS,SAAS,KAAK,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,IAAI;AAChD,MAAI9D,OAAM,WAAW,UAAU,MAAM,OAAO,QAAQ,MAAM;AAC1D,MAAIsa,UAAS,QAAQ,iBAAiB,MAAMta,MAAK,EAAE;AACnD,MAAI,MAAM,CAAA;AACV,MAAI,KAAKsa,QAAO,OAAO,UAAU,CAAC;AAClC,MAAI,KAAKA,QAAO,OAAO,EAAC,CAAE;AAC1B,SAAOhc,SAAO,OAAO,GAAG;AACzB;AAEA,SAASic,YAAUvc,SAAQ;AAC1B,MAAI;AACJ,MAAI,OAAOA,YAAW,YAAY,CAACM,SAAO,SAASN,OAAM,GAAG;AAC3D,eAAWA,QAAO;AAClB,IAAAA,UAASA,QAAO;EAClB;AACC,MAAI,OAAOA,YAAW,UAAU;AAC/B,IAAAA,UAASM,SAAO,KAAKN,OAAM;EAC7B;AAEC,MAAI,WAAW,QAAQA,SAAQ,QAAQ;AAEvC,MAAI6B,QAAO,SAAS;AACpB,MAAI,OAAO,SAAS;AACpB,MAAI,SAAS;AACb,UAAQA,OAAI;IACX,KAAK;AACJ,cAAQ,KAAK,YAAY,OAAO,MAAM,KAAK,EAAE,eAAe;;IAE7D,KAAK;AACJ,UAAI,CAAC,OAAO;AACX,gBAAQ,KAAK,UAAU,OAAO,MAAM,KAAK;MAC7C;AACG,gBAAU,MAAM,UAAU,UAAU,KAAK,GAAG;AAC5C,cAAQ,SAAO;QACd,KAAK;AACJ,iBAAO,KAAK,aAAa,OAAO,MAAM,iBAAiB,MAAM,KAAK;QACnE,KAAK;AACJ,gBAAM,oBAAoB,MAAM;AAChC,iBAAO;YACN,MAAM;YACN,MAAM;UACZ;QACI,KAAK;AACJ,gBAAM,UAAU,OAAO,UAAU,KAAK,SAAS,OAAO,MAAM,iBAAiB,MAAM,KAAK;AACxF,iBAAO;YACN,MAAM;YACN,MAAM,MAAM,UAAU;UAC5B;QACI;AAAS,gBAAM,IAAI,MAAM,oBAAoB,OAAO;MACxD;;IAEE,KAAK;AACJ,aAAO,KAAK,oBAAoB,OAAO,MAAM,KAAK;AAClD,aAAO,QAAQ,MAAM,QAAQ;;IAE9B,KAAK;AACJ,cAAQ,KAAK,WAAW,OAAO,MAAM,KAAK;AAC1C,gBAAU,MAAM,UAAU,UAAU,KAAK,GAAG;AAC5C,cAAQ,SAAO;QACd,KAAK;AACJ,iBAAO,KAAK,cAAc,OAAO,MAAM,mBAAmB,KAAK;QAChE,KAAK;AACJ,iBAAO;YACN,OAAO,MAAM,UAAU;YACvB,YAAY,KAAK,aAAa,OAAO,MAAM,mBAAmB,KAAK,EAAE;UAC3E;QACI,KAAK;AACJ,gBAAM,UAAU,OAAO,WAAW,KAAK,SAAS,OAAO,MAAM,mBAAmB,KAAK;AACrF,iBAAO;YACN,MAAM;YACN,QAAQ,MAAM,UAAU;UAC9B;QACI;AAAS,gBAAM,IAAI,MAAM,oBAAoB,OAAO;MACxD;;IAEE,KAAK;AACJ,aAAO,KAAK,aAAa,OAAO,MAAM,KAAK;IAC5C,KAAK;AACJ,aAAO,KAAK,cAAc,OAAO,MAAM,KAAK;IAC7C,KAAK;AACJ,aAAO;QACN,MAAM;QACN,QAAQ,KAAK,cAAc,OAAO,MAAM,KAAK;MACjD;IACE,KAAK;AACJ,aAAO,KAAK,aAAa,OAAO,MAAM,KAAK;AAC3C,aAAO;QACN,OAAO,KAAK,WAAW;QACvB,YAAY,KAAK;MACrB;IACE;AAAS,YAAM,IAAI,MAAM,sBAAsBA,KAAI;EACrD;AACA;AACA0a,YAAU,YAAY,KAAK;AAE3B,IAAA,YAAiBA;;;;;;;;;;;;;AC3GjB,MAAIjc,UAASH,oBAAuB;AACpC,MAAIqc,cAAanc;AACjB,MAAIsU,OAAM3Q;AACV,MAAI6U,MAAKnU,gBAAmB,EAAC;AAC7B,MAAItC,MAAKyC;AACT,MAAI0X,aAAYzW;AAChB,MAAIyS,UAASnQ;AAEb,MAAI,oBAAoB;AAExB,WAAS6C,MAAKoF,OAAMrO,MAAK,UAAU,UAAU,KAAK;AAChD,QAAIuS,QAAOgI,WAAUva,IAAG;AACxB,QAAIuS,MAAK,OAAO;AAEd,UAAI,aAAa,WAAW,aAAa,aAAa;AAAE,cAAM,IAAI,MAAM,wBAAwB;MAAE;AAClG,aAAO,OAAOlE,OAAMkE,KAAI;IAC5B,WAAaA,MAAK,SAAS,OAAO;AAC9B,UAAI,aAAa,OAAO;AAAE,cAAM,IAAI,MAAM,wBAAwB;MAAE;AACpE,aAAO,QAAQlE,OAAMkE,OAAM,QAAQ;;AAErC,QAAI,aAAa,SAAS,aAAa,aAAa;AAAE,YAAM,IAAI,MAAM,wBAAwB;IAAE;AAChG,QAAIvS,KAAI,YAAY,UAAaA,KAAI,YAAY,mBAAmB;AAAE,YAAM,IAAI,MAAM,qCAAqC;IAAE;AAE7H,IAAAqO,QAAO/P,QAAO,OAAO,CAAC,KAAK+P,KAAI,CAAC;AAChC,QAAI,MAAMkE,MAAK,QAAQ,WAAU;AACjC,QAAI9B,OAAM,CAAC,GAAG,CAAC;AACf,WAAOpC,MAAK,SAASoC,KAAI,SAAS,IAAI,KAAK;AAAE,MAAAA,KAAI,KAAK,GAAI;IAAE;AAC5D,IAAAA,KAAI,KAAK,CAAI;AACb,QAAI,IAAI;AACR,WAAO,EAAE,IAAIpC,MAAK,QAAQ;AAAE,MAAAoC,KAAI,KAAKpC,MAAK,CAAC,CAAC;IAAE;AAE9C,QAAI,MAAMsE,KAAIlC,MAAK8B,KAAI;AACvB,WAAO;;AAGT,WAAS,OAAOlE,OAAMkE,OAAM;AAC1B,QAAI,UAAUgE,QAAOhE,MAAK,MAAM,KAAK,GAAG,CAAC;AACzC,QAAI,CAAC,SAAS;AAAE,YAAM,IAAI,MAAM,mBAAmBA,MAAK,MAAM,KAAK,GAAG,CAAC;IAAE;AAEzE,QAAIW,SAAQ,IAAI2D,IAAG,OAAO;AAC1B,QAAI7W,OAAMkT,OAAM,eAAeX,MAAK,UAAU;AAC9C,QAAI,MAAMvS,KAAI,KAAKqO,KAAI;AAEvB,WAAO/P,QAAO,KAAK,IAAI,MAAK,CAAE;;AAGhC,WAAS,QAAQ+P,OAAMkE,OAAM,MAAM;AACjC,QAAI,IAAIA,MAAK,OAAO;AACpB,QAAI,IAAIA,MAAK,OAAO;AACpB,QAAI,IAAIA,MAAK,OAAO;AACpB,QAAI,IAAIA,MAAK,OAAO;AACpB,QAAI/R,KAAI,IAAIJ,IAAG,CAAC;AAChB,QAAI;AACJ,QAAI,IAAI,SAASiO,OAAM,CAAC,EAAE,IAAI,CAAC;AAC/B,QAAInQ,KAAI;AACR,QAAI,KAAK,OAAO,GAAG,GAAGmQ,OAAM,IAAI;AAChC,WAAOnQ,OAAM,OAAO;AAClB,UAAI,QAAQ,GAAG,IAAI,IAAI;AACvB,MAAAsC,KAAI,MAAM,GAAG,GAAG,GAAG,CAAC;AACpB,MAAAtC,KAAI,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAIsC,EAAC,CAAC,CAAC,EAAE,IAAI,CAAC;AACzC,UAAItC,GAAE,KAAK,CAAC,MAAM,GAAG;AACnB,QAAAA,KAAI;AACJ,QAAAsC,KAAI,IAAIJ,IAAG,CAAC;;;AAGhB,WAAOqa,OAAMja,IAAGtC,EAAC;;AAGnB,WAASuc,OAAMja,IAAGtC,IAAG;AACnB,IAAAsC,KAAIA,GAAE,QAAO;AACb,IAAAtC,KAAIA,GAAE,QAAO;AAGb,QAAIsC,GAAE,CAAC,IAAI,KAAM;AAAE,MAAAA,KAAI,CAAC,CAAC,EAAE,OAAOA,EAAC;IAAE;AACrC,QAAItC,GAAE,CAAC,IAAI,KAAM;AAAE,MAAAA,KAAI,CAAC,CAAC,EAAE,OAAOA,EAAC;IAAE;AAErC,QAAI,QAAQsC,GAAE,SAAStC,GAAE,SAAS;AAClC,QAAI,MAAM;MACR;MAAM;MAAO;MAAMsC,GAAE;IACzB;AACE,UAAM,IAAI,OAAOA,IAAG,CAAC,GAAMtC,GAAE,MAAM,GAAGA,EAAC;AACvC,WAAOI,QAAO,KAAK,GAAG;;AAGxB,WAAS,OAAO,GAAG,GAAG+P,OAAM,MAAM;AAChC,QAAI/P,QAAO,KAAK,EAAE,QAAO,CAAE;AAC3B,QAAI,EAAE,SAAS,EAAE,WAAU,GAAI;AAC7B,UAAI,QAAQA,QAAO,MAAM,EAAE,WAAU,IAAK,EAAE,MAAM;AAClD,UAAIA,QAAO,OAAO,CAAC,OAAO,CAAC,CAAC;;AAE9B,QAAI,OAAO+P,MAAK;AAChB,QAAI,QAAQ,YAAYA,OAAM,CAAC;AAC/B,QAAI,IAAI/P,QAAO,MAAM,IAAI;AACzB,MAAE,KAAK,CAAC;AACR,QAAI,IAAIA,QAAO,MAAM,IAAI;AACzB,QAAIkc,YAAW,MAAM,CAAC,EAAE,OAAO,CAAC,EAAE,OAAOlc,QAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,OAAO,KAAK,EAAE,OAAM;AACzF,QAAIkc,YAAW,MAAM,CAAC,EAAE,OAAO,CAAC,EAAE,OAAM;AACxC,QAAIA,YAAW,MAAM,CAAC,EAAE,OAAO,CAAC,EAAE,OAAOlc,QAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,OAAO,KAAK,EAAE,OAAM;AACzF,QAAIkc,YAAW,MAAM,CAAC,EAAE,OAAO,CAAC,EAAE,OAAM;AACxC,WAAO,EAAE,GAAM,EAAI;;AAGrB,WAAS,SAAS,OAAO,GAAG;AAC1B,QAAI,OAAO,IAAIpa,IAAG,KAAK;AACvB,QAAI,SAAS,MAAM,UAAU,KAAK,EAAE,UAAS;AAC7C,QAAI,QAAQ,GAAG;AAAE,WAAK,MAAM,KAAK;IAAE;AACnC,WAAO;;AAGT,WAAS,YAAY,MAAM,GAAG;AAC5B,WAAO,SAAS,MAAM,CAAC;AACvB,WAAO,KAAK,IAAI,CAAC;AACjB,QAAI,MAAM9B,QAAO,KAAK,KAAK,QAAO,CAAE;AACpC,QAAI,IAAI,SAAS,EAAE,WAAU,GAAI;AAC/B,UAAI,QAAQA,QAAO,MAAM,EAAE,WAAU,IAAK,IAAI,MAAM;AACpD,YAAMA,QAAO,OAAO,CAAC,OAAO,GAAG,CAAC;;AAElC,WAAO;;AAGT,WAAS,QAAQ,GAAG,IAAI,MAAM;AAC5B,QAAI;AACJ,QAAI;AAEJ,OAAG;AACD,UAAIA,QAAO,MAAM,CAAC;AAElB,aAAO,EAAE,SAAS,IAAI,EAAE,UAAS,GAAI;AACnC,WAAG,IAAIkc,YAAW,MAAM,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAM;AACjD,YAAIlc,QAAO,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;;AAG7B,UAAI,SAAS,GAAG,CAAC;AACjB,SAAG,IAAIkc,YAAW,MAAM,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAOlc,QAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,OAAM;AAC1E,SAAG,IAAIkc,YAAW,MAAM,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAM;aAC1C,EAAE,IAAI,CAAC,MAAM;AAEtB,WAAO;;AAGT,WAAS,MAAM,GAAG,GAAG,GAAG,GAAG;AACzB,WAAO,EAAE,MAAMpa,IAAG,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAO,EAAG,IAAI,CAAC;;AAGxCsa,SAAA,UAAGzR;AACIyR,SAAA,QAAA,SAAG;AACxBA,SAAA,QAAA,UAAyB;;;;;;;;AClJzB,MAAIpc,UAASH,oBAAuB;AACpC,MAAIiC,MAAK/B;AACT,MAAIwY,MAAK7U,gBAAmB,EAAC;AAC7B,MAAIuY,aAAY7X;AAChB,MAAI6T,UAAS;AAEb,WAASQ,QAAO,KAAK1I,OAAMrO,MAAK,UAAU,KAAK;AAC7C,QAAIsS,OAAMiI,WAAUva,IAAG;AACvB,QAAIsS,KAAI,SAAS,MAAM;AAErB,UAAI,aAAa,WAAW,aAAa,aAAa;AAAE,cAAM,IAAI,MAAM,uBAAuB;MAAE;AACjG,aAAO,SAAS,KAAKjE,OAAMiE,IAAG;IAClC,WAAaA,KAAI,SAAS,OAAO;AAC7B,UAAI,aAAa,OAAO;AAAE,cAAM,IAAI,MAAM,uBAAuB;MAAE;AACnE,aAAO,UAAU,KAAKjE,OAAMiE,IAAG;;AAEjC,QAAI,aAAa,SAAS,aAAa,aAAa;AAAE,YAAM,IAAI,MAAM,uBAAuB;IAAE;AAE/F,IAAAjE,QAAO/P,QAAO,OAAO,CAAC,KAAK+P,KAAI,CAAC;AAChC,QAAI,MAAMiE,KAAI,QAAQ,WAAU;AAChC,QAAI7B,OAAM,CAAC,CAAC;AACZ,QAAI,SAAS;AACb,WAAOpC,MAAK,SAASoC,KAAI,SAAS,IAAI,KAAK;AACzC,MAAAA,KAAI,KAAK,GAAI;AACb,gBAAU;;AAEZ,IAAAA,KAAI,KAAK,CAAI;AACb,QAAI,IAAI;AACR,WAAO,EAAE,IAAIpC,MAAK,QAAQ;AACxB,MAAAoC,KAAI,KAAKpC,MAAK,CAAC,CAAC;;AAElB,IAAAoC,OAAMnS,QAAO,KAAKmS,IAAG;AACrB,QAAI,MAAMrQ,IAAG,KAAKkS,KAAI,OAAO;AAC7B,UAAM,IAAIlS,IAAG,GAAG,EAAE,MAAM,GAAG;AAE3B,UAAM,IAAI,OAAO,IAAIA,IAAGkS,KAAI,cAAc,CAAC;AAC3C,UAAMhU,QAAO,KAAK,IAAI,QAAO,EAAG,QAAO,CAAE;AACzC,QAAI,MAAM,SAAS,IAAI,IAAI;AAC3B,UAAM,KAAK,IAAI,IAAI,QAAQmS,KAAI,MAAM;AACrC,QAAI,IAAI,WAAWA,KAAI,QAAQ;AAAE,YAAM;IAAE;AAEzC,QAAI;AACJ,WAAO,EAAE,IAAI,KAAK;AAAE,aAAO,IAAI,CAAC,IAAIA,KAAI,CAAC;IAAE;AAC3C,WAAO,QAAQ;;AAGjB,WAAS,SAAS,KAAKpC,OAAMiE,MAAK;AAChC,QAAI,UAAUiE,QAAOjE,KAAI,KAAK,UAAU,MAAM,KAAK,GAAG,CAAC;AACvD,QAAI,CAAC,SAAS;AAAE,YAAM,IAAI,MAAM,mBAAmBA,KAAI,KAAK,UAAU,MAAM,KAAK,GAAG,CAAC;IAAE;AAEvF,QAAIY,SAAQ,IAAI2D,IAAG,OAAO;AAC1B,QAAI,SAASvE,KAAI,KAAK,kBAAkB;AAExC,WAAOY,OAAM,OAAO7E,OAAM,KAAK,MAAM;;AAGvC,WAAS,UAAU,KAAKA,OAAMiE,MAAK;AACjC,QAAI,IAAIA,KAAI,KAAK;AACjB,QAAI,IAAIA,KAAI,KAAK;AACjB,QAAI,IAAIA,KAAI,KAAK;AACjB,QAAI,IAAIA,KAAI,KAAK;AACjB,QAAI,WAAWiI,WAAU,UAAU,OAAO,KAAK,KAAK;AACpD,QAAIrc,KAAI,SAAS;AACjB,QAAIsC,KAAI,SAAS;AACjB,eAAWtC,IAAG,CAAC;AACf,eAAWsC,IAAG,CAAC;AACf,QAAI,QAAQJ,IAAG,KAAK,CAAC;AACrB,QAAI,IAAIlC,GAAE,KAAK,CAAC;AAChB,QAAI,IAAI,EAAE,MAAM,KAAK,EAClB,OAAO,IAAIkC,IAAGiO,KAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,EACjC,QAAO,EACP,IAAI,EAAE,MAAM,KAAK,EAAE,OAAO7N,GAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,QAAO,CAAE,EACpD,IAAI,CAAC,EACL,IAAI,CAAC;AACR,WAAO,EAAE,IAAIA,EAAC,MAAM;;AAGtB,WAAS,WAAW,GAAG,GAAG;AACxB,QAAI,EAAE,KAAK,CAAC,KAAK,GAAG;AAAE,YAAM,IAAI,MAAM,aAAa;IAAE;AACrD,QAAI,EAAE,IAAI,CAAC,KAAK,GAAG;AAAE,YAAM,IAAI,MAAM,aAAa;IAAE;;AAGtD,aAAiBuW;;;;;;;;ACnFjB,MAAIzY,UAASH,oBAAuB;AACpC,MAAIwc,cAAatc;AACjB,MAAI,SAAS2D;AACb,MAAI7B,YAAWuC;AACf,MAAIuG,QAAOpG,YAAA;AACX,MAAIkU,UAASjT,cAAA;AAEb,MAAI,aAAa;AACjB,SAAO,KAAK,UAAU,EAAE,QAAQ,SAAU9D,MAAK;AAC7C,eAAWA,IAAG,EAAE,KAAK1B,QAAO,KAAK,WAAW0B,IAAG,EAAE,IAAI,KAAK;AAC1D,eAAWA,KAAI,YAAW,CAAE,IAAI,WAAWA,IAAG;EAChD,CAAC;AAED,WAAS,KAAK,WAAW;AACvB,WAAO,SAAS,KAAK,IAAI;AAEzB,QAAI,OAAO,WAAW,SAAS;AAC/B,QAAI,CAAC,MAAM;AAAE,YAAM,IAAI,MAAM,wBAAwB;IAAE;AAEvD,SAAK,YAAY,KAAK;AACtB,SAAK,QAAQ2a,YAAW,KAAK,IAAI;AACjC,SAAK,OAAO,KAAK;AACjB,SAAK,YAAY,KAAK;;AAExB,EAAAxa,UAAS,MAAM,OAAO,QAAQ;AAE9B,OAAK,UAAU,SAAS,SAAS,OAAO,MAAM,GAAGgH,OAAM;AACrD,SAAK,MAAM,OAAO,IAAI;AACtB,IAAAA,MAAI;EACN;AAEA,OAAK,UAAU,SAAS,SAASuO,QAAO,MAAM,KAAK;AACjD,SAAK,MAAM,OAAO,OAAO,SAAS,WAAWpX,QAAO,KAAK,MAAM,GAAG,IAAI,IAAI;AAE1E,WAAO;EACT;AAEA,OAAK,UAAU,OAAO,SAASsc,YAAW5a,MAAK,KAAK;AAClD,SAAK,IAAG;AACR,QAAIqO,QAAO,KAAK,MAAM,OAAM;AAC5B,QAAI,MAAMpF,MAAKoF,OAAMrO,MAAK,KAAK,WAAW,KAAK,WAAW,KAAK,IAAI;AAEnE,WAAO,MAAM,IAAI,SAAS,GAAG,IAAI;EACnC;AAEA,WAAS,OAAO,WAAW;AACzB,WAAO,SAAS,KAAK,IAAI;AAEzB,QAAI,OAAO,WAAW,SAAS;AAC/B,QAAI,CAAC,MAAM;AAAE,YAAM,IAAI,MAAM,wBAAwB;IAAE;AAEvD,SAAK,QAAQ2a,YAAW,KAAK,IAAI;AACjC,SAAK,OAAO,KAAK;AACjB,SAAK,YAAY,KAAK;;AAExB,EAAAxa,UAAS,QAAQ,OAAO,QAAQ;AAEhC,SAAO,UAAU,SAAS,SAAS,OAAO,MAAM,GAAGgH,OAAM;AACvD,SAAK,MAAM,OAAO,IAAI;AACtB,IAAAA,MAAI;EACN;AAEA,SAAO,UAAU,SAAS,SAASuO,QAAO,MAAM,KAAK;AACnD,SAAK,MAAM,OAAO,OAAO,SAAS,WAAWpX,QAAO,KAAK,MAAM,GAAG,IAAI,IAAI;AAE1E,WAAO;EACT;AAEA,SAAO,UAAU,SAAS,SAAS,aAAa0B,MAAK,KAAK,KAAK;AAC7D,QAAI,YAAY,OAAO,QAAQ,WAAW1B,QAAO,KAAK,KAAK,GAAG,IAAI;AAElE,SAAK,IAAG;AACR,QAAI+P,QAAO,KAAK,MAAM,OAAM;AAC5B,WAAO0I,QAAO,WAAW1I,OAAMrO,MAAK,KAAK,WAAW,KAAK,IAAI;EAC/D;AAEA,WAAS,WAAW,WAAW;AAC7B,WAAO,IAAI,KAAK,SAAS;;AAG3B,WAAS,aAAa,WAAW;AAC/B,WAAO,IAAI,OAAO,SAAS;;AAG7BgG,cAAiB;IACf,MAAM;IACN,QAAQ;IACR;IACA;;;;;;;;;AC1FF,MAAIyR,YAAWtZ,gBAAmB;AAClC,MAAIiC,MAAK/B;AAET2H,cAAiB,SAAS,WAAYkN,QAAO;AAC3C,WAAO,IAAI,KAAKA,MAAK;;AAGvB,MAAI,UAAU;IACZ,WAAW;MACT,MAAM;MACN,YAAY;;IAEd,WAAW;MACT,MAAM;MACN,YAAY;;IAEd,YAAY;MACV,MAAM;MACN,YAAY;;IAEd,YAAY;MACV,MAAM;MACN,YAAY;;IAEd,SAAS;MACP,MAAM;MACN,YAAY;;IAEd,WAAW;MACT,MAAM;MACN,YAAY;;IAEd,WAAW;MACT,MAAM;MACN,YAAY;;;AAIhB,UAAQ,OAAO,QAAQ;AACvB,UAAQ,OAAO,QAAQ,YAAY,QAAQ;AAC3C,UAAQ,OAAO,QAAQ,YAAY,QAAQ;AAC3C,UAAQ,OAAO,QAAQ;AACvB,UAAQ,OAAO,QAAQ;AAEvB,WAAS,KAAMA,QAAO;AACpB,SAAK,YAAY,QAAQA,MAAK;AAC9B,QAAI,CAAC,KAAK,WAAW;AACnB,WAAK,YAAY;QACf,MAAMA;;;AAGV,SAAK,QAAQ,IAAIuE,UAAS,GAAG,KAAK,UAAU,IAAI;AAChD,SAAK,OAAO;;AAGd,OAAK,UAAU,eAAe,SAAU,KAAK,QAAQ;AACnD,SAAK,OAAO,KAAK,MAAM,WAAU;AACjC,WAAO,KAAK,aAAa,KAAK,MAAM;;AAGtC,OAAK,UAAU,gBAAgB,SAAU,OAAO,OAAO,KAAK;AAC1D,YAAQ,SAAS;AACjB,QAAI,CAACnZ,SAAAA,OAAO,SAAS,KAAK,GAAG;AAC3B,cAAQ,IAAIA,SAAAA,OAAO,OAAO,KAAK;;AAEjC,QAAI,WAAW,KAAK,MAAM,cAAc,KAAK,EAAE,UAAS;AACxD,QAAI,MAAM,SAAS,IAAI,KAAK,KAAK,WAAU,CAAE,EAAE,KAAI;AACnD,WAAO,kBAAkB,KAAK,KAAK,KAAK,UAAU,UAAU;;AAG9D,OAAK,UAAU,eAAe,SAAU,KAAK,QAAQ;AACnD,QAAI0B,OAAM,KAAK,KAAK,UAAU,WAAW,cAAc,IAAI;AAC3D,QAAI,WAAW,UAAU;AACvB,UAAIA,KAAIA,KAAI,SAAS,CAAC,IAAI,GAAG;AAC3B,QAAAA,KAAI,CAAC,IAAI;MACf,OAAW;AACL,QAAAA,KAAI,CAAC,IAAI;;;AAGb,WAAO,kBAAkBA,MAAK,GAAG;;AAGnC,OAAK,UAAU,gBAAgB,SAAU,KAAK;AAC5C,WAAO,kBAAkB,KAAK,KAAK,WAAU,GAAI,GAAG;;AAGtD,OAAK,UAAU,eAAe,SAAUsS,MAAK,KAAK;AAChD,UAAM,OAAO;AACb,QAAI,CAAChU,SAAAA,OAAO,SAASgU,IAAG,GAAG;AACzB,MAAAA,OAAM,IAAIhU,SAAAA,OAAOgU,MAAK,GAAG;;AAE3B,SAAK,KAAK,cAAcA,IAAG;AAC3B,WAAO;;AAGT,OAAK,UAAU,gBAAgB,SAAUC,OAAM,KAAK;AAClD,UAAM,OAAO;AACb,QAAI,CAACjU,SAAAA,OAAO,SAASiU,KAAI,GAAG;AAC1B,MAAAA,QAAO,IAAIjU,SAAAA,OAAOiU,OAAM,GAAG;;AAG7B,QAAI,QAAQ,IAAInS,IAAGmS,KAAI;AACvB,YAAQ,MAAM,SAAS,EAAE;AACzB,SAAK,OAAO,KAAK,MAAM,WAAU;AACjC,SAAK,KAAK,eAAe,KAAK;AAC9B,WAAO;;AAGT,WAAS,kBAAmBJ,KAAI,KAAK,KAAK;AACxC,QAAI,CAAC,MAAM,QAAQA,GAAE,GAAG;AACtB,MAAAA,MAAKA,IAAG,QAAO;;AAEjB,QAAI,MAAM,IAAI7T,SAAAA,OAAO6T,GAAE;AACvB,QAAI,OAAO,IAAI,SAAS,KAAK;AAC3B,UAAI,QAAQ,IAAI7T,SAAAA,OAAO,MAAM,IAAI,MAAM;AACvC,YAAM,KAAK,CAAC;AACZ,YAAMA,SAAAA,OAAO,OAAO,CAAC,OAAO,GAAG,CAAC;;AAElC,QAAI,CAAC,KAAK;AACR,aAAO;IACX,OAAS;AACL,aAAO,IAAI,SAAS,GAAG;;EAE3B;;;;AC3HA,IAAIqc,eAAaxc;AACjB,IAAIG,WAASD,oBAAuB;AAEpC,IAAAwc,QAAiB,SAAU,MAAM,KAAK;AACpC,MAAI,IAAIvc,SAAO,MAAM,CAAC;AACtB,MAAI,IAAI;AACR,MAAI;AACJ,SAAO,EAAE,SAAS,KAAK;AACrB,QAAI,MAAM,GAAG;AACb,QAAIA,SAAO,OAAO,CAAC,GAAGqc,aAAW,MAAM,EAAE,OAAO,IAAI,EAAE,OAAO,CAAC,EAAE,OAAM,CAAE,CAAC;EAC7E;AACE,SAAO,EAAE,MAAM,GAAG,GAAG;AACvB;AAEA,SAAS,MAAO,GAAG;AACjB,MAAI,MAAMrc,SAAO,YAAY,CAAC;AAC9B,MAAI,cAAc,GAAG,CAAC;AACtB,SAAO;AACT;AClBA,IAAAyC,QAAiB,SAASA,KAAK,GAAG,GAAG;AACnC,MAAI,MAAM,EAAE;AACZ,MAAI,IAAI;AACR,SAAO,EAAE,IAAI,KAAK;AAChB,MAAE,CAAC,KAAK,EAAE,CAAC;EACf;AACE,SAAO;AACT;ACPA,IAAIX,OAAKjC;AACT,IAAIG,WAASD,oBAAuB;AAEpC,SAASyc,aAAY,WAAW9a,MAAK;AACnC,SAAO1B,SAAO,KAAK,UAChB,MAAM8B,KAAG,KAAKJ,KAAI,OAAO,CAAC,EAC1B,OAAO,IAAII,KAAGJ,KAAI,cAAc,CAAC,EACjC,QAAO,EACP,QAAO,CAAE;AACd;AAEA,IAAA,eAAiB8a;ACXjB,IAAIP,cAAYpc;AAChB,IAAIuG,eAAcrG;AAClB,IAAIsc,eAAa3Y;AACjB,IAAI6Y,QAAMnY;AACV,IAAI3B,QAAM8B;AACV,IAAIzC,OAAK0D;AACT,IAAIgX,eAAa1U;AACjB,IAAIuM,QAAMtM;AACV,IAAI/H,WAASkJ,oBAAuB;IAEpC,gBAAiB,SAASuT,eAAe,WAAW,KAAK,SAAS;AAChE,MAAI;AACJ,MAAI,UAAU,SAAS;AACrB,cAAU,UAAU;EACxB,WAAa,SAAS;AAClB,cAAU;EACd,OAAS;AACL,cAAU;EACd;AACE,MAAI/a,OAAMua,YAAU,SAAS;AAC7B,MAAI;AACJ,MAAI,YAAY,GAAG;AACjB,gBAAYS,OAAKhb,MAAK,GAAG;EAC7B,WAAa,YAAY,GAAG;AACxB,gBAAYib,QAAMjb,MAAK,KAAK,OAAO;EACvC,WAAa,YAAY,GAAG;AACxB,gBAAY,IAAII,KAAG,GAAG;AACtB,QAAI,UAAU,IAAIJ,KAAI,OAAO,KAAK,GAAG;AACnC,YAAM,IAAI,MAAM,2BAA2B;IACjD;EACA,OAAS;AACL,UAAM,IAAI,MAAM,iBAAiB;EACrC;AACE,MAAI,SAAS;AACX,WAAO2S,MAAI,WAAW3S,IAAG;EAC7B,OAAS;AACL,WAAO8a,aAAW,WAAW9a,IAAG;EACpC;AACA;AAEA,SAASgb,OAAMhb,MAAK,KAAK;AACvB,MAAI,IAAIA,KAAI,QAAQ,WAAU;AAC9B,MAAI,OAAO,IAAI;AACf,MAAI,QAAQ2a,aAAW,MAAM,EAAE,OAAOrc,SAAO,MAAM,CAAC,CAAC,EAAE,OAAM;AAC7D,MAAI,OAAO,MAAM;AACjB,MAAI,QAAQ,IAAI;AAChB,MAAI,OAAO,IAAI,QAAQ,GAAG;AACxB,UAAM,IAAI,MAAM,kBAAkB;EACtC;AACE,MAAI,KAAKA,SAAO,MAAM,IAAI,OAAO,QAAQ,CAAC;AAC1C,MAAI,QAAQ,IAAI,OAAO;AACvB,MAAI,OAAOoG,aAAY,IAAI;AAC3B,MAAI,WAAW3D,MAAIzC,SAAO,OAAO,CAAC,OAAO,IAAIA,SAAO,MAAM,GAAG,CAAC,GAAG,GAAG,GAAG,KAAK,GAAGuc,MAAI,MAAM,KAAK,CAAC;AAC/F,MAAI,aAAa9Z,MAAI,MAAM8Z,MAAI,UAAU,IAAI,CAAC;AAC9C,SAAO,IAAIza,KAAG9B,SAAO,OAAO,CAACA,SAAO,MAAM,CAAC,GAAG,YAAY,QAAQ,GAAG,CAAC,CAAC;AACzE;AACA,SAAS2c,QAAOjb,MAAK,KAAK,SAAS;AACjC,MAAI,OAAO,IAAI;AACf,MAAI,IAAIA,KAAI,QAAQ,WAAU;AAC9B,MAAI,OAAO,IAAI,IAAI;AACjB,UAAM,IAAI,MAAM,kBAAkB;EACtC;AACE,MAAI;AACJ,MAAI,SAAS;AACX,SAAK1B,SAAO,MAAM,IAAI,OAAO,GAAG,GAAI;EACxC,OAAS;AACL,SAAK,QAAQ,IAAI,OAAO,CAAC;EAC7B;AACE,SAAO,IAAI8B,KAAG9B,SAAO,OAAO,CAACA,SAAO,KAAK,CAAC,GAAG,UAAU,IAAI,CAAC,CAAC,GAAG,IAAIA,SAAO,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AAC/F;AACA,SAAS,QAAS,KAAK;AACrB,MAAI,MAAMA,SAAO,YAAY,GAAG;AAChC,MAAI,IAAI;AACR,MAAI,QAAQoG,aAAY,MAAM,CAAC;AAC/B,MAAI,MAAM;AACV,MAAI;AACJ,SAAO,IAAI,KAAK;AACd,QAAI,QAAQ,MAAM,QAAQ;AACxB,cAAQA,aAAY,MAAM,CAAC;AAC3B,YAAM;IACZ;AACI,UAAM,MAAM,KAAK;AACjB,QAAI,KAAK;AACP,UAAI,GAAG,IAAI;IACjB;EACA;AACE,SAAO;AACT;ACvFA,IAAI,YAAYvG;AAChB,IAAI,MAAME;AACV,IAAI0C,OAAMiB;AACV,IAAI5B,OAAKsC;AACT,IAAI,MAAMG;AACV,IAAI8X,cAAa7W;AACjB,IAAI,aAAasC;AACjB,IAAI9H,WAAS+H,oBAAuB;IAEpC,iBAAiB,SAAS6U,gBAAgB,YAAY,KAAK,SAAS;AAClE,MAAI;AACJ,MAAI,WAAW,SAAS;AACtB,cAAU,WAAW;EACzB,WAAa,SAAS;AAClB,cAAU;EACd,OAAS;AACL,cAAU;EACd;AAEE,MAAIlb,OAAM,UAAU,UAAU;AAC9B,MAAI,IAAIA,KAAI,QAAQ,WAAU;AAC9B,MAAI,IAAI,SAAS,KAAK,IAAII,KAAG,GAAG,EAAE,IAAIJ,KAAI,OAAO,KAAK,GAAG;AACvD,UAAM,IAAI,MAAM,kBAAkB;EACtC;AACE,MAAI;AACJ,MAAI,SAAS;AACX,UAAM,WAAW,IAAII,KAAG,GAAG,GAAGJ,IAAG;EACrC,OAAS;AACL,UAAM,IAAI,KAAKA,IAAG;EACtB;AACE,MAAI,UAAU1B,SAAO,MAAM,IAAI,IAAI,MAAM;AACzC,QAAMA,SAAO,OAAO,CAAC,SAAS,GAAG,GAAG,CAAC;AACrC,MAAI,YAAY,GAAG;AACjB,WAAO,KAAK0B,MAAK,GAAG;EACxB,WAAa,YAAY,GAAG;AACxB,WAAO,MAAMA,MAAK,KAAK,OAAO;EAClC,WAAa,YAAY,GAAG;AACxB,WAAO;EACX,OAAS;AACL,UAAM,IAAI,MAAM,iBAAiB;EACrC;AACA;AAEA,SAAS,KAAMA,MAAK,KAAK;AACvB,MAAI,IAAIA,KAAI,QAAQ,WAAU;AAC9B,MAAI,QAAQ2a,YAAW,MAAM,EAAE,OAAOrc,SAAO,MAAM,CAAC,CAAC,EAAE,OAAM;AAC7D,MAAI,OAAO,MAAM;AACjB,MAAI,IAAI,CAAC,MAAM,GAAG;AAChB,UAAM,IAAI,MAAM,kBAAkB;EACtC;AACE,MAAI,aAAa,IAAI,MAAM,GAAG,OAAO,CAAC;AACtC,MAAI,WAAW,IAAI,MAAM,OAAO,CAAC;AACjC,MAAI,OAAOyC,KAAI,YAAY,IAAI,UAAU,IAAI,CAAC;AAC9C,MAAI,KAAKA,KAAI,UAAU,IAAI,MAAM,IAAI,OAAO,CAAC,CAAC;AAC9C,MAAI,QAAQ,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG;AACrC,UAAM,IAAI,MAAM,kBAAkB;EACtC;AACE,MAAI,IAAI;AACR,SAAO,GAAG,CAAC,MAAM,GAAG;AAClB;EACJ;AACE,MAAI,GAAG,GAAG,MAAM,GAAG;AACjB,UAAM,IAAI,MAAM,kBAAkB;EACtC;AACE,SAAO,GAAG,MAAM,CAAC;AACnB;AAEA,SAAS,MAAOf,MAAK,KAAK,SAAS;AACjC,MAAI,KAAK,IAAI,MAAM,GAAG,CAAC;AACvB,MAAI,IAAI;AACR,MAAI,SAAS;AACb,SAAO,IAAI,GAAG,MAAM,GAAG;AACrB,QAAI,KAAK,IAAI,QAAQ;AACnB;AACA;IACN;EACA;AACE,MAAI,KAAK,IAAI,MAAM,GAAG,IAAI,CAAC;AAE3B,MAAK,GAAG,SAAS,KAAK,MAAM,UAAU,CAAC,WAAa,GAAG,SAAS,KAAK,MAAM,UAAU,SAAU;AAC7F;EACJ;AACE,MAAI,GAAG,SAAS,GAAG;AACjB;EACJ;AACE,MAAI,QAAQ;AACV,UAAM,IAAI,MAAM,kBAAkB;EACtC;AACE,SAAO,IAAI,MAAM,CAAC;AACpB;AACA,SAAS,QAAS,GAAG,GAAG;AACtB,MAAI1B,SAAO,KAAK,CAAC;AACjB,MAAIA,SAAO,KAAK,CAAC;AACjB,MAAI,MAAM;AACV,MAAI,MAAM,EAAE;AACZ,MAAI,EAAE,WAAW,EAAE,QAAQ;AACzB;AACA,UAAM,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;EACrC;AACE,MAAI,IAAI;AACR,SAAO,EAAE,IAAI,KAAK;AAChB,WAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;EACtB;AACE,SAAO;AACT;;ACxGA,UAAA,gBAAwBH;AACxB,UAAA,iBAAyBE;AAEzB,UAAA,iBAAyB,SAAS,eAAgB2B,MAAK,KAAK;AAC1D,WAAO,QAAQ,cAAcA,MAAK,KAAK,IAAI;;AAG7C,UAAA,gBAAwB,SAAS,cAAeA,MAAK,KAAK;AACxD,WAAO,QAAQ,eAAeA,MAAK,KAAK,IAAI;EAC9C;;;ACPA,SAAS,aAAc;AACrB,QAAM,IAAI,MAAM,4GAA4G;AAC9H;AACA,IAAI,aAAa7B;AACjB,IAAI,cAAcE;AAClB,IAAIC,UAAS,WAAW;AACxB,IAAI,mBAAmB,WAAW;AAClC,IAAIiG,UAASC,eAAO,UAAUA,eAAO;AACrC,IAAI,aAAa,KAAK,IAAI,GAAG,EAAE,IAAI;AACnC,SAAS,aAAc,QAAQ,QAAQ;AACrC,MAAI,OAAO,WAAW,YAAY,WAAW,QAAQ;AACnD,UAAM,IAAI,UAAU,yBAAyB;EACjD;AAEE,MAAI,SAAS,cAAc,SAAS,GAAG;AACrC,UAAM,IAAI,UAAU,yBAAyB;EACjD;AAEE,MAAI,SAAS,oBAAoB,SAAS,QAAQ;AAChD,UAAM,IAAI,WAAW,qBAAqB;EAC9C;AACA;AAEA,SAAS,WAAY,MAAM,QAAQ,QAAQ;AACzC,MAAI,OAAO,SAAS,YAAY,SAAS,MAAM;AAC7C,UAAM,IAAI,UAAU,uBAAuB;EAC/C;AAEE,MAAI,OAAO,cAAc,OAAO,GAAG;AACjC,UAAM,IAAI,UAAU,uBAAuB;EAC/C;AAEE,MAAI,OAAO,SAAS,UAAU,OAAO,kBAAkB;AACrD,UAAM,IAAI,WAAW,kBAAkB;EAC3C;AACA;AACA,IAAKD,WAAUA,QAAO,mBAAoB,CAAC,QAAQ,SAAS;AAC1D,UAAA,aAAqB;AACrB,UAAA,iBAAyB;AAC3B,OAAO;AACL,UAAA,aAAqB;AACrB,UAAA,iBAAyB;AAC3B;AACA,SAAS,WAAY,KAAK,QAAQ,MAAM,IAAI;AAC1C,MAAI,CAACjG,QAAO,SAAS,GAAG,KAAK,EAAE,eAAekG,eAAO,aAAa;AAChE,UAAM,IAAI,UAAU,+CAA+C;EACvE;AAEE,MAAI,OAAO,WAAW,YAAY;AAChC,SAAK;AACL,aAAS;AACT,WAAO,IAAI;EACf,WAAa,OAAO,SAAS,YAAY;AACrC,SAAK;AACL,WAAO,IAAI,SAAS;EACxB,WAAa,OAAO,OAAO,YAAY;AACnC,UAAM,IAAI,UAAU,kCAAkC;EAC1D;AACE,eAAa,QAAQ,IAAI,MAAM;AAC/B,aAAW,MAAM,QAAQ,IAAI,MAAM;AACnC,SAAO,WAAW,KAAK,QAAQ,MAAM,EAAE;AACzC;AAEA,SAAS,WAAY,KAAK,QAAQ,MAAM,IAAI;AAC1C,MAAI,QAAQ,SAAS;AACnB,QAAI,SAAS,IAAI;AACjB,QAAI,OAAO,IAAI,WAAW,QAAQ,QAAQ,IAAI;AAC9C,IAAAD,QAAO,gBAAgB,IAAI;AAC3B,QAAI,IAAI;AACN,cAAQ,SAAS,WAAY;AAC3B,WAAG,MAAM,GAAG;MACpB,CAAO;AACD;IACN;AACI,WAAO;EACX;AACE,MAAI,IAAI;AACN,gBAAY,MAAM,SAAU,KAAK4W,QAAO;AACtC,UAAI,KAAK;AACP,eAAO,GAAG,GAAG;MACrB;AACM,MAAAA,OAAM,KAAK,KAAK,MAAM;AACtB,SAAG,MAAM,GAAG;IAClB,CAAK;AACD;EACJ;AACE,MAAI,QAAQ,YAAY,IAAI;AAC5B,QAAM,KAAK,KAAK,MAAM;AACtB,SAAO;AACT;AACA,SAAS,eAAgB,KAAK,QAAQ,MAAM;AAC1C,MAAI,OAAO,WAAW,aAAa;AACjC,aAAS;EACb;AACE,MAAI,CAAC7c,QAAO,SAAS,GAAG,KAAK,EAAE,eAAekG,eAAO,aAAa;AAChE,UAAM,IAAI,UAAU,+CAA+C;EACvE;AAEE,eAAa,QAAQ,IAAI,MAAM;AAE/B,MAAI,SAAS,OAAW,QAAO,IAAI,SAAS;AAE5C,aAAW,MAAM,QAAQ,IAAI,MAAM;AAEnC,SAAO,WAAW,KAAK,QAAQ,IAAI;AACrC;;;;;ACxGmB,mBAAA,cAAG,iBAAA,MAAc,iBAAA,oBAA4B,iBAAY,OAAGrG;AAG/E,mBAAA,aAAqB,iBAAA,OAAeE;AAGpC,mBAAA,aAAqB,iBAAA,OAAe2D;AAEpC,MAAIoZ,UAAQ1Y;AACZ,MAAI,WAAW,OAAO,KAAK0Y,OAAK;AAChC,MAAI,SAAS;IACZ;IACA;IACA;IACA;IACA;IACA;IACA;EACD,EAAE,OAAO,QAAQ;AAEjB,mBAAA,YAAoB,WAAY;AAC/B,WAAO;EACR;AAEA,MAAI,IAAIvY;AACR,mBAAA,SAAiB,EAAE;AACnB,mBAAA,aAAqB,EAAE;AAEvB,MAAIqO,OAAMpN;AAEV,mBAAA,SAAiBoN,KAAI;AACrB,mBAAA,eAAuBA,KAAI;AAC3B,mBAAA,WAAmBA,KAAI;AACvB,mBAAA,iBAAyBA,KAAI;AAC7B,mBAAA,WAAmBA,KAAI;AACvB,mBAAA,iBAAyBA,KAAI;AAC7B,mBAAA,aAAqBA,KAAI;AACzB,mBAAA,mBAA2BA,KAAI;AAC/B,mBAAA,aAAqBA,KAAI;AACzB,mBAAA,cAAsBA,KAAI;AAE1B,MAAI9B,MAAKhJ,iBAAA;AAET,mBAAA,qBAA6BgJ,IAAG;AAChC,mBAAA,2BAAmCA,IAAG;AACtC,mBAAA,mBAA2BA,IAAG;AAC9B,mBAAA,sBAA8BA,IAAG;AACjC,mBAAA,gBAAwBA,IAAG;AAE3B,MAAInG,QAAO5C,iBAAA;AAEX,mBAAA,aAAqB4C,MAAK;AAC1B,mBAAA,OAAeA,MAAK;AACpB,mBAAA,eAAuBA,MAAK;AAC5B,mBAAA,SAAiBA,MAAK;AAEJ,mBAAA,aAAGzB,eAAAA;AAErB,MAAIuT,iBAAgBrT;AAEpB,mBAAA,gBAAwBqT,eAAc;AACtC,mBAAA,iBAAyBA,eAAc;AACvC,mBAAA,gBAAwBA,eAAc;AACtC,mBAAA,iBAAyBA,eAAc;AAWvC,MAAI,KAAKpT;AAET,mBAAA,aAAqB,GAAG;AACxB,mBAAA,iBAAyB,GAAG;AAE5B,mBAAA,oBAA4B,WAAY;AACvC,UAAM,IAAI,MAAM,2HAA2H;EAC5I;AAEA,mBAAA,YAAoB;IACnB,2BAA2B;IAC3B,sBAAsB;IACtB,8BAA8B;IAC9B,2BAA2B;IAC3B,aAAa;IACb,cAAc;IACd,mBAAmB;IACnB,oBAAoB;IACpB,gBAAgB;IAChB,wBAAwB;IACxB,kBAAkB;IAClB,uBAAuB;IACvB,6BAA6B;IAC7B,+BAA+B;IAC/B,yBAAyB;;;;ACpG1B,OAAO,eAAepD,UAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC9CA,SAAA,SAAG0K;AACjB,IAAMoM,aAAWld,wBAAA;AACjB,SAAS8Q,QAAO,MAAM;AAClB,UAAO,GAAIoM,WAAS,YAAY,QAAQ,EAAE,OAAO,IAAI,EAAE,OAAM;AACjE;;ACLA,OAAO,eAAexX,aAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC/BA,YAAA,wBAAA,YAAA,yBAAoCA,YAAA,mBAAmDA,YAAA,mBAAG;AAC/FA,YAAA,mBAAG;AACHA,YAAA,mBAAG;AACGA,YAAA,yBAAG;AACJA,YAAA,wBAAG;ACLhC,OAAO,eAAewK,QAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACjCA,OAAA,sBAAG;AAC9B,IAAMiN,YAAUnd;AAChB,IAAM,WAAWE;AACjB,IAAMkd,gBAAcvZ;AACpB,SAAS,kBAAkB,QAAQ,UAAU,WAAW;AACpD,UAAO,GAAI,SAAS,QAAQ1D,SAAAA,OAAO,OAAO,CAACA,SAAAA,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,UAAU,SAAS,CAAC,CAAC;AAC3F;AACA,SAAS,kBAAkBkd,MAAK;AAC5B,QAAM,OAAM,GAAI,SAAS,QAAQld,SAAAA,OAAO,OAAO,CAACA,SAAAA,OAAO,KAAK,CAACid,cAAY,gBAAgB,CAAC,GAAGjd,SAAAA,OAAO,MAAK,GAAIgd,UAAQ,cAAcE,IAAG,CAAC,CAAC,CAAC,CAAC;AAC1I,SAAO;AACX;AACA,SAAS,oBAAoB,SAAS;AAClC,MAAI,QAAQ,SAAS;AACjB,WAAOld,SAAAA,OAAO,MAAM,EAAE;AAC1B,MAAI,QAAQ,SAAS;AACjB,WAAO,kBAAkB,QAAQ,OAAO;AAC5C,QAAM,SAAS,UAAU,UACnB,QAAQ,SAAS,UAAUid,cAAY,yBAAyBA,cAAY,wBAC5EA,cAAY;AAClB,SAAO,kBAAkB,QAAQ,oBAAoB,QAAQ,IAAI,GAAG,oBAAoB,QAAQ,KAAK,CAAC;AAC1G;ACrBA,OAAO,eAAe,MAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC7C,KAAA,UAAG;AAClB,IAAM,YAAYpd;AAClB,IAAM,SAASE;AACf,SAAS,QAAQ,OAAO,mBAAmB;AACvC,QAAM,QAAO,GAAI,UAAU,WAAW,OAAO,iBAAiB;AAC9D,UAAO,GAAI,OAAO,qBAAqB,IAAI;AAC/C;;;;ACLA,SAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,UAAA,YAAoB,QAAiB,SAAA,QAAA,cAAsB;AAE3D,QAAM8F,OAAMhG,cAAA;AACZ,UAAA,cAAsBgG,KAAI,OAAO,YAAY,WAAY;AACrD,SAAK,IAAG,EAAG,IAAI,KAAK,IAAI,MAAM,EAAE,QAAO,GAAI,KAAK,IAAI,OAAO,EAAE,IAAI,QAAQ,MAAM,CAAC;EACpF,CAAC;AACD,UAAA,SAAiBA,KAAI,OAAO,YAAY,WAAY;AAChD,SAAK,OAAO;MACR,MAAM,KAAK,SAAS,CAAC,EAAE,MAAK;MAC5B,WAAW,KAAK,SAAS,CAAC,EAAE,OAAM;MAClC,QAAQ,KAAK,SAAS,CAAC,EAAE,QAAO;MAChC,SAAS,KAAK,SAAS,CAAC,EAAE,IAAG;MAC7B,MAAM,KAAK,SAAS,CAAC,EAAE,MAAM,QAAQ,WAAW;MAChD,OAAO,KAAK,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM;MAC5C,YAAY,KAAK,SAAS,CAAC,EAAE,IAAG;IACxC,CAAK;EACL,CAAC;AACD,UAAA,YAAoBA,KAAI,OAAO,UAAU,WAAY;AACjD,SAAK,OAAM;EACf,CAAC;;;;ACtBD,OAAO,eAAe,aAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACzC,YAAA,cAAG;AACtB,IAAM,cAAN,cAA0B,MAAM;EAC5B,YAAY,SAAS,QAAQ;AACzB,UAAM,OAAO;AACb,SAAK,OAAO,KAAK,YAAY;AAC7B,SAAK,SAAS;EACtB;AACA;AACmB,YAAA,cAAG;ACTtB,OAAO,eAAe1E,UAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC9BA,SAAA,yBAAgDA,SAAA,wCAA4CA,SAAA,oCAA8BA,SAAA,sBAAsCA,SAAA,8BAAG;AACjM,IAAMgc,kBAAgBtd;AACtB,IAAM,8BAAN,cAA0Csd,gBAAc,YAAY;EAChE,YAAY,UAAU;AAClB,UAAM,yBAAyB,KAAK,UAAU,QAAQ,CAAC,kBAAkB,SAAS,IAAI,IAAI,GAAG;EACrG;AACA;AACmChc,SAAA,8BAAG;AACtC,IAAM,sBAAN,cAAkCgc,gBAAc,YAAY;EACxD,cAAc;AACV,UAAM,gGAAgG,GAAG;EACjH;AACA;AAC2Bhc,SAAA,sBAAG;AAC9B,IAAM,oCAAN,cAAgDgc,gBAAc,YAAY;EACtE,YAAY,WAAW;AACnB,UAAM,cAAc,SAAS,mCAAmC,GAAG;EAC3E;AACA;AACyChc,SAAA,oCAAG;AAC5C,IAAM,wCAAN,cAAoDgc,gBAAc,YAAY;EAC1E,cAAc;AACV,UAAM,iDAAiD,GAAG;EAClE;AACA;AAC6Chc,SAAA,wCAAG;AAChD,IAAM,yBAAN,cAAqCgc,gBAAc,YAAY;EAC3D,cAAc;AACV,UAAM,mFAAmF,GAAG;EACpG;AACA;AAC8Bhc,SAAA,yBAAG;;;;;;;;;;AChCjC,SAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,UAAA,gBAAwB,QAAwB,gBAAA,QAAA,aAAqB,QAAe,OAAA;AACpF,MAAIsN;AACJ,GAAC,SAAUA,OAAM;AACb,IAAAA,MAAK,cAAc,CAAC,MAAM;IAAA;AAC1B,aAAS,SAAS,MAAM;IAAA;AACxB,IAAAA,MAAK,WAAW;AAChB,aAAS,YAAY,IAAI;AACrB,YAAM,IAAI,MAAK;;AAEnB,IAAAA,MAAK,cAAc;AACnB,IAAAA,MAAK,cAAc,CAAC,UAAU;AAC1B,YAAMrO,OAAM,CAAA;AACZ,iBAAW,QAAQ,OAAO;AACtB,QAAAA,KAAI,IAAI,IAAI;;AAEhB,aAAOA;IACf;AACI,IAAAqO,MAAK,qBAAqB,CAACrO,SAAQ;AAC/B,YAAM,YAAYqO,MAAK,WAAWrO,IAAG,EAAE,OAAO,CAAC,MAAM,OAAOA,KAAIA,KAAI,CAAC,CAAC,MAAM,QAAQ;AACpF,YAAM,WAAW,CAAA;AACjB,iBAAW,KAAK,WAAW;AACvB,iBAAS,CAAC,IAAIA,KAAI,CAAC;;AAEvB,aAAOqO,MAAK,aAAa,QAAQ;IACzC;AACI,IAAAA,MAAK,eAAe,CAACrO,SAAQ;AACzB,aAAOqO,MAAK,WAAWrO,IAAG,EAAE,IAAI,SAAU,GAAG;AACzC,eAAOA,KAAI,CAAC;MACxB,CAAS;IACT;AACI,IAAAqO,MAAK,aAAa,OAAO,OAAO,SAAS,aACnC,CAACrO,SAAQ,OAAO,KAAKA,IAAG,IACxB,CAAC,WAAW;AACV,YAAMyG,QAAO,CAAA;AACb,iBAAWnF,QAAO,QAAQ;AACtB,YAAI,OAAO,UAAU,eAAe,KAAK,QAAQA,IAAG,GAAG;AACnD,UAAAmF,MAAK,KAAKnF,IAAG;;;AAGrB,aAAOmF;IACnB;AACI,IAAA4H,MAAK,OAAO,CAAC,KAAK,YAAY;AAC1B,iBAAW,QAAQ,KAAK;AACpB,YAAI,QAAQ,IAAI;AACZ,iBAAO;;AAEf,aAAO;IACf;AACI,IAAAA,MAAK,YAAY,OAAO,OAAO,cAAc,aACvC,CAAC,QAAQ,OAAO,UAAU,GAAG,IAC7B,CAAC,QAAQ,OAAO,QAAQ,YAAY,OAAO,SAAS,GAAG,KAAK,KAAK,MAAM,GAAG,MAAM;AACtF,aAAS,WAAW,OAAO,YAAY,OAAO;AAC1C,aAAO,MAAM,IAAI,CAAC,QAAS,OAAO,QAAQ,WAAW,IAAI,GAAG,MAAM,GAAI,EAAE,KAAK,SAAS;;AAE1F,IAAAA,MAAK,aAAa;AAClB,IAAAA,MAAK,wBAAwB,CAAC,GAAG,UAAU;AACvC,UAAI,OAAO,UAAU,UAAU;AAC3B,eAAO,MAAM,SAAQ;;AAEzB,aAAO;IACf;KACGA,UAAS,QAAA,OAAeA,QAAO,CAAA,EAAG;AACrC,MAAI;AACJ,GAAC,SAAU2O,aAAY;AACnB,IAAAA,YAAW,cAAc,CAAC,OAAO,WAAW;AACxC,aAAO;QACH,GAAG;QACH,GAAG;;MACf;IACA;KACG,eAAe,QAAA,aAAqB,aAAa,CAAA,EAAG;AACvD,UAAwB,gBAAA3O,MAAK,YAAY;IACrC;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;EACJ,CAAC;AACD,QAAM,gBAAgB,CAAC,SAAS;AAC5B,UAAM,IAAI,OAAO;AACjB,YAAQ,GAAC;MACL,KAAK;AACD,eAAO,QAAQ,cAAc;MACjC,KAAK;AACD,eAAO,QAAQ,cAAc;MACjC,KAAK;AACD,eAAO,OAAO,MAAM,IAAI,IAAI,QAAQ,cAAc,MAAM,QAAQ,cAAc;MAClF,KAAK;AACD,eAAO,QAAQ,cAAc;MACjC,KAAK;AACD,eAAO,QAAQ,cAAc;MACjC,KAAK;AACD,eAAO,QAAQ,cAAc;MACjC,KAAK;AACD,eAAO,QAAQ,cAAc;MACjC,KAAK;AACD,YAAI,MAAM,QAAQ,IAAI,GAAG;AACrB,iBAAO,QAAQ,cAAc;;AAEjC,YAAI,SAAS,MAAM;AACf,iBAAO,QAAQ,cAAc;;AAEjC,YAAI,KAAK,QAAQ,OAAO,KAAK,SAAS,cAAc,KAAK,SAAS,OAAO,KAAK,UAAU,YAAY;AAChG,iBAAO,QAAQ,cAAc;;AAEjC,YAAI,OAAO,QAAQ,eAAe,gBAAgB,KAAK;AACnD,iBAAO,QAAQ,cAAc;;AAEjC,YAAI,OAAO,QAAQ,eAAe,gBAAgB,KAAK;AACnD,iBAAO,QAAQ,cAAc;;AAEjC,YAAI,OAAO,SAAS,eAAe,gBAAgB,MAAM;AACrD,iBAAO,QAAQ,cAAc;;AAEjC,eAAO,QAAQ,cAAc;MACjC;AACI,eAAO,QAAQ,cAAc;;EAEzC;AACA,UAAA,gBAAwB;;ACvIxB,OAAO,eAAe4O,YAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5DA,WAAA,WAAwCA,WAAA,gBAAA,WAAA,eAA0B;AAClE,IAAMC,cAAYzd;AAClBwd,WAAA,eAAuBC,YAAU,KAAK,YAAY;EAC9C;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;AACJ,CAAC;AACD,IAAM,gBAAgB,CAACld,SAAQ;AAC3B,QAAM,OAAO,KAAK,UAAUA,MAAK,MAAM,CAAC;AACxC,SAAO,KAAK,QAAQ,eAAe,KAAK;AAC5C;AACqBid,WAAA,gBAAG;AACxB,IAAM,WAAN,MAAM,kBAAiB,MAAM;EACzB,IAAI,SAAS;AACT,WAAO,KAAK;EACpB;EACI,YAAY,QAAQ;AAChB,UAAK;AACL,SAAK,SAAS,CAAA;AACd,SAAK,WAAW,CAAC,QAAQ;AACrB,WAAK,SAAS,CAAC,GAAG,KAAK,QAAQ,GAAG;IAC9C;AACQ,SAAK,YAAY,CAAC,OAAO,CAAA,MAAO;AAC5B,WAAK,SAAS,CAAC,GAAG,KAAK,QAAQ,GAAG,IAAI;IAClD;AACQ,UAAM,cAAc,WAAW;AAC/B,QAAI,OAAO,gBAAgB;AAEvB,aAAO,eAAe,MAAM,WAAW;IACnD,OACa;AACD,WAAK,YAAY;IAC7B;AACQ,SAAK,OAAO;AACZ,SAAK,SAAS;EACtB;EACI,OAAO,SAAS;AACZ,UAAM,SAAS,WACX,SAAU,OAAO;AACb,aAAO,MAAM;IAC7B;AACQ,UAAM,cAAc,EAAE,SAAS,CAAA,EAAE;AACjC,UAAM,eAAe,CAACtX,WAAU;AAC5B,iBAAW,SAASA,OAAM,QAAQ;AAC9B,YAAI,MAAM,SAAS,iBAAiB;AAChC,gBAAM,YAAY,IAAI,YAAY;QACtD,WACyB,MAAM,SAAS,uBAAuB;AAC3C,uBAAa,MAAM,eAAe;QACtD,WACyB,MAAM,SAAS,qBAAqB;AACzC,uBAAa,MAAM,cAAc;QACrD,WACyB,MAAM,KAAK,WAAW,GAAG;AAC9B,sBAAY,QAAQ,KAAK,OAAO,KAAK,CAAC;QAC1D,OACqB;AACD,cAAI,OAAO;AACX,cAAI,IAAI;AACR,iBAAO,IAAI,MAAM,KAAK,QAAQ;AAC1B,kBAAM,KAAK,MAAM,KAAK,CAAC;AACvB,kBAAM,WAAW,MAAM,MAAM,KAAK,SAAS;AAC3C,gBAAI,CAAC,UAAU;AACX,mBAAK,EAAE,IAAI,KAAK,EAAE,KAAK,EAAE,SAAS,CAAA,EAAE;YAQhE,OAC6B;AACD,mBAAK,EAAE,IAAI,KAAK,EAAE,KAAK,EAAE,SAAS,CAAA,EAAE;AACpC,mBAAK,EAAE,EAAE,QAAQ,KAAK,OAAO,KAAK,CAAC;YAC/D;AACwB,mBAAO,KAAK,EAAE;AACd;UACxB;QACA;MACA;IACA;AACQ,iBAAa,IAAI;AACjB,WAAO;EACf;EACI,OAAO,OAAO,OAAO;AACjB,QAAI,EAAE,iBAAiB,YAAW;AAC9B,YAAM,IAAI,MAAM,mBAAmB,KAAK,EAAE;IACtD;EACA;EACI,WAAW;AACP,WAAO,KAAK;EACpB;EACI,IAAI,UAAU;AACV,WAAO,KAAK,UAAU,KAAK,QAAQuX,YAAU,KAAK,uBAAuB,CAAC;EAClF;EACI,IAAI,UAAU;AACV,WAAO,KAAK,OAAO,WAAW;EACtC;EACI,QAAQ,SAAS,CAAC,UAAU,MAAM,SAAS;AACvC,UAAM,cAAc,CAAA;AACpB,UAAM,aAAa,CAAA;AACnB,eAAW,OAAO,KAAK,QAAQ;AAC3B,UAAI,IAAI,KAAK,SAAS,GAAG;AACrB,cAAM,UAAU,IAAI,KAAK,CAAC;AAC1B,oBAAY,OAAO,IAAI,YAAY,OAAO,KAAK,CAAA;AAC/C,oBAAY,OAAO,EAAE,KAAK,OAAO,GAAG,CAAC;MACrD,OACiB;AACD,mBAAW,KAAK,OAAO,GAAG,CAAC;MAC3C;IACA;AACQ,WAAO,EAAE,YAAY,YAAW;EACxC;EACI,IAAI,aAAa;AACb,WAAO,KAAK,QAAO;EAC3B;AACA;AACgBD,WAAA,WAAG;AACnB,SAAS,SAAS,CAAC,WAAW;AAC1B,QAAMtX,SAAQ,IAAI,SAAS,MAAM;AACjC,SAAOA;AACX;ACxIA,OAAO,eAAe,IAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,IAAMwX,kBAAgB1d;AACtB,IAAMyd,cAAYvd;AAClB,IAAM,WAAW,CAAC,OAAO,SAAS;AAC9B,MAAI;AACJ,UAAQ,MAAM,MAAI;IACd,KAAKwd,gBAAc,aAAa;AAC5B,UAAI,MAAM,aAAaD,YAAU,cAAc,WAAW;AACtD,kBAAU;MAC1B,OACiB;AACD,kBAAU,YAAY,MAAM,QAAQ,cAAc,MAAM,QAAQ;MAChF;AACY;IACJ,KAAKC,gBAAc,aAAa;AAC5B,gBAAU,mCAAmC,KAAK,UAAU,MAAM,UAAUD,YAAU,KAAK,qBAAqB,CAAC;AACjH;IACJ,KAAKC,gBAAc,aAAa;AAC5B,gBAAU,kCAAkCD,YAAU,KAAK,WAAW,MAAM,MAAM,IAAI,CAAC;AACvF;IACJ,KAAKC,gBAAc,aAAa;AAC5B,gBAAU;AACV;IACJ,KAAKA,gBAAc,aAAa;AAC5B,gBAAU,yCAAyCD,YAAU,KAAK,WAAW,MAAM,OAAO,CAAC;AAC3F;IACJ,KAAKC,gBAAc,aAAa;AAC5B,gBAAU,gCAAgCD,YAAU,KAAK,WAAW,MAAM,OAAO,CAAC,eAAe,MAAM,QAAQ;AAC/G;IACJ,KAAKC,gBAAc,aAAa;AAC5B,gBAAU;AACV;IACJ,KAAKA,gBAAc,aAAa;AAC5B,gBAAU;AACV;IACJ,KAAKA,gBAAc,aAAa;AAC5B,gBAAU;AACV;IACJ,KAAKA,gBAAc,aAAa;AAC5B,UAAI,OAAO,MAAM,eAAe,UAAU;AACtC,YAAI,cAAc,MAAM,YAAY;AAChC,oBAAU,gCAAgC,MAAM,WAAW,QAAQ;AACnE,cAAI,OAAO,MAAM,WAAW,aAAa,UAAU;AAC/C,sBAAU,GAAG,OAAO,sDAAsD,MAAM,WAAW,QAAQ;UAC3H;QACA,WACyB,gBAAgB,MAAM,YAAY;AACvC,oBAAU,mCAAmC,MAAM,WAAW,UAAU;QAC5F,WACyB,cAAc,MAAM,YAAY;AACrC,oBAAU,iCAAiC,MAAM,WAAW,QAAQ;QACxF,OACqB;AACDD,sBAAU,KAAK,YAAY,MAAM,UAAU;QAC/D;MACA,WACqB,MAAM,eAAe,SAAS;AACnC,kBAAU,WAAW,MAAM,UAAU;MACrD,OACiB;AACD,kBAAU;MAC1B;AACY;IACJ,KAAKC,gBAAc,aAAa;AAC5B,UAAI,MAAM,SAAS;AACf,kBAAU,sBAAsB,MAAM,QAAQ,YAAY,MAAM,YAAY,aAAa,WAAW,IAAI,MAAM,OAAO;eAChH,MAAM,SAAS;AACpB,kBAAU,uBAAuB,MAAM,QAAQ,YAAY,MAAM,YAAY,aAAa,MAAM,IAAI,MAAM,OAAO;eAC5G,MAAM,SAAS;AACpB,kBAAU,kBAAkB,MAAM,QAAQ,sBAAsB,MAAM,YAAY,8BAA8B,eAAe,GAAG,MAAM,OAAO;eAC1I,MAAM,SAAS;AACpB,kBAAU,kBAAkB,MAAM,QAAQ,sBAAsB,MAAM,YAAY,8BAA8B,eAAe,GAAG,MAAM,OAAO;eAC1I,MAAM,SAAS;AACpB,kBAAU,gBAAgB,MAAM,QAAQ,sBAAsB,MAAM,YAAY,8BAA8B,eAAe,GAAG,IAAI,KAAK,OAAO,MAAM,OAAO,CAAC,CAAC;;AAE/J,kBAAU;AACd;IACJ,KAAKA,gBAAc,aAAa;AAC5B,UAAI,MAAM,SAAS;AACf,kBAAU,sBAAsB,MAAM,QAAQ,YAAY,MAAM,YAAY,YAAY,WAAW,IAAI,MAAM,OAAO;eAC/G,MAAM,SAAS;AACpB,kBAAU,uBAAuB,MAAM,QAAQ,YAAY,MAAM,YAAY,YAAY,OAAO,IAAI,MAAM,OAAO;eAC5G,MAAM,SAAS;AACpB,kBAAU,kBAAkB,MAAM,QAAQ,YAAY,MAAM,YAAY,0BAA0B,WAAW,IAAI,MAAM,OAAO;eACzH,MAAM,SAAS;AACpB,kBAAU,kBAAkB,MAAM,QAAQ,YAAY,MAAM,YAAY,0BAA0B,WAAW,IAAI,MAAM,OAAO;eACzH,MAAM,SAAS;AACpB,kBAAU,gBAAgB,MAAM,QAAQ,YAAY,MAAM,YAAY,6BAA6B,cAAc,IAAI,IAAI,KAAK,OAAO,MAAM,OAAO,CAAC,CAAC;;AAEpJ,kBAAU;AACd;IACJ,KAAKA,gBAAc,aAAa;AAC5B,gBAAU;AACV;IACJ,KAAKA,gBAAc,aAAa;AAC5B,gBAAU;AACV;IACJ,KAAKA,gBAAc,aAAa;AAC5B,gBAAU,gCAAgC,MAAM,UAAU;AAC1D;IACJ,KAAKA,gBAAc,aAAa;AAC5B,gBAAU;AACV;IACJ;AACI,gBAAU,KAAK;AACfD,kBAAU,KAAK,YAAY,KAAK;EAC5C;AACI,SAAO,EAAE,QAAO;AACpB;AACA,GAAA,UAAkB;AC7GlB,IAAI,kBAAmBna,kBAAQA,eAAK,mBAAoB,SAAUhB,MAAK;AACnE,SAAQA,QAAOA,KAAI,aAAcA,OAAM,EAAE,WAAWA,KAAG;AAC3D;AACA,OAAO,eAAehB,UAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACrCA,SAAA,kBAAG;AACPA,SAAA,cAAG;AACHA,SAAA,cAAG;AACtB,IAAM,UAAU,gBAAgBtB,EAA2B;AAC3DsB,SAAA,kBAA0B,QAAQ;AAClC,IAAI,mBAAmB,QAAQ;AAC/B,SAAS,YAAY,KAAK;AACtB,qBAAmB;AACvB;AACA,SAAS,cAAc;AACnB,SAAO;AACX;;;ACfA,MAAIsE,mBAAmBtC,kBAAQA,eAAK,mBAAoB,SAAUhB,MAAK;AACnE,WAAQA,QAAOA,KAAI,aAAcA,OAAM,EAAE,WAAWA,KAAG;EAC3D;AACA,SAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,UAAkB,UAAA,QAAA,UAAkB,QAAkB,UAAA,QAAA,YAAoB,QAAa,KAAA,QAAA,QAAgB,QAAkB,UAAA,QAAA,cAAsB,QAAqB,aAAA,QAAA,YAAoB;AACxL,UAAA,oBAA4B;AAC5B,QAAMqb,eAAc3d;AACpB,QAAM4d,WAAUhY,iBAAgB1F,EAA4B;AAC5D,QAAM,YAAY,CAAC,WAAW;AAC1B,UAAM,EAAE,MAAM,MAAA0D,OAAM,WAAW,UAAS,IAAK;AAC7C,UAAM,WAAW,CAAC,GAAGA,OAAM,GAAI,UAAU,QAAQ,CAAA,CAAG;AACpD,UAAM,YAAY;MACd,GAAG;MACH,MAAM;IACd;AACI,QAAI,UAAU,YAAY,QAAW;AACjC,aAAO;QACH,GAAG;QACH,MAAM;QACN,SAAS,UAAU;MAC/B;;AAEI,QAAIia,gBAAe;AACnB,UAAM,OAAO,UACR,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EACjB,MAAK,EACL,QAAO;AACZ,eAAW,OAAO,MAAM;AACpB,MAAAA,gBAAe,IAAI,WAAW,EAAE,MAAM,cAAcA,cAAY,CAAE,EAAE;;AAExE,WAAO;MACH,GAAG;MACH,MAAM;MACN,SAASA;IACjB;EACA;AACA,UAAA,YAAoB;AACpB,UAAA,aAAqB,CAAA;AACrB,WAAS,kBAAkB,KAAK,WAAW;AACvC,UAAM,eAAc,GAAIF,aAAY,aAAW;AAC/C,UAAM,SAAQ,GAAI,QAAQ,WAAW;MACjC;MACA,MAAM,IAAI;MACV,MAAM,IAAI;MACV,WAAW;QACP,IAAI,OAAO;;QACX,IAAI;;QACJ;;QACA,gBAAgBC,SAAQ,UAAU,SAAYA,SAAQ;;QACxD,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3B,CAAK;AACD,QAAI,OAAO,OAAO,KAAK,KAAK;;EAEhC,MAAM,YAAY;IACd,cAAc;AACV,WAAK,QAAQ;;IAEjB,QAAQ;AACJ,UAAI,KAAK,UAAU;AACf,aAAK,QAAQ;;IAErB,QAAQ;AACJ,UAAI,KAAK,UAAU;AACf,aAAK,QAAQ;;IAErB,OAAO,WAAW,QAAQ,SAAS;AAC/B,YAAM,aAAa,CAAA;AACnB,iBAAW7d,MAAK,SAAS;AACrB,YAAIA,GAAE,WAAW;AACb,iBAAO,QAAQ;AACnB,YAAIA,GAAE,WAAW;AACb,iBAAO,MAAK;AAChB,mBAAW,KAAKA,GAAE,KAAK;;AAE3B,aAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,WAAU;;IAEpD,aAAa,iBAAiB,QAAQ,OAAO;AACzC,YAAM,YAAY,CAAA;AAClB,iBAAW,QAAQ,OAAO;AACtB,cAAM8B,OAAM,MAAM,KAAK;AACvB,cAAM,QAAQ,MAAM,KAAK;AACzB,kBAAU,KAAK;UACX,KAAAA;UACA;QAChB,CAAa;;AAEL,aAAO,YAAY,gBAAgB,QAAQ,SAAS;;IAExD,OAAO,gBAAgB,QAAQ,OAAO;AAClC,YAAM,cAAc,CAAA;AACpB,iBAAW,QAAQ,OAAO;AACtB,cAAM,EAAE,KAAAA,MAAK,MAAK,IAAK;AACvB,YAAIA,KAAI,WAAW;AACf,iBAAO,QAAQ;AACnB,YAAI,MAAM,WAAW;AACjB,iBAAO,QAAQ;AACnB,YAAIA,KAAI,WAAW;AACf,iBAAO,MAAK;AAChB,YAAI,MAAM,WAAW;AACjB,iBAAO,MAAK;AAChB,YAAIA,KAAI,UAAU,gBAAgB,OAAO,MAAM,UAAU,eAAe,KAAK,YAAY;AACrF,sBAAYA,KAAI,KAAK,IAAI,MAAM;;;AAGvC,aAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,YAAW;;;AAGzD,UAAA,cAAsB;AACtB,UAAkB,UAAA,OAAO,OAAO;IAC5B,QAAQ;EACZ,CAAC;AACD,QAAM,QAAQ,CAAC,WAAW,EAAE,QAAQ,SAAS,MAAK;AAClD,UAAA,QAAgB;AAChB,QAAM,KAAK,CAAC,WAAW,EAAE,QAAQ,SAAS,MAAK;AAC/C,UAAA,KAAa;AACb,QAAM,YAAY,CAAC,MAAM,EAAE,WAAW;AACtC,UAAA,YAAoB;AACpB,QAAM,UAAU,CAAC,MAAM,EAAE,WAAW;AACpC,UAAA,UAAkB;AAClB,QAAM,UAAU,CAAC,MAAM,EAAE,WAAW;AACpC,UAAA,UAAkB;AAClB,QAAM,UAAU,CAAC,MAAM,OAAO,YAAY,eAAe,aAAa;AACtE,UAAA,UAAkB;;;AC1HlB,OAAO,eAAe,aAAS,cAAc,EAAE,OAAO,KAAI,CAAE;;;ACA5D,OAAO,eAAeic,aAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC3CA,YAAA,YAAG;AACpB,IAAI;CACH,SAAUC,YAAW;AAClB,EAAAA,WAAU,WAAW,CAAC,YAAY,OAAO,YAAY,WAAW,EAAE,QAAO,IAAK,WAAW,CAAA;AAEzF,EAAAA,WAAU,WAAW,CAAC,YAAY,OAAO,YAAY,WAAW,UAAU,SAAS;AACvF,GAAG,cAAcD,YAAA,YAAoB,YAAY,CAAA,EAAG;ACPpD,OAAO,eAAe,OAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAClC,MAAA,qBAAA,MAAA,OAAkB,MAAA,UAAgC,MAAA,SAAgB,MAAA,QAAc,MAAA,MAAA,MAAA,SAAoB,MAAA,wBAA4C,MAAA,OAAA,MAAA,YAAuB,MAAA,SAAiB,MAAA,cAAsB,MAAA,cAAwC,MAAA,aAAA,MAAA,QAAmB,MAAA,SAAiC,MAAA,WAAqB,MAAA,aAAsB,MAAA,cAAA,MAAA,cAAyB,MAAA,iBAA2C,MAAA,aAAA,MAAA,aAAwB,MAAA,gBAAwB,MAAA,UAAkB,MAAA,aAAoC,MAAA,UAAA,MAAA,cAAyB,MAAA,SAA+B,MAAA,SAAoB,MAAA,YAAmB,MAAA,WAAA,MAAA,kBAA6B,MAAA,wBAAgD,MAAA,WAAA,MAAA,YAAuB,MAAA,WAAmB,MAAA,UAAkB,MAAA,WAAqC,MAAA,aAAA,MAAA,SAAoB,MAAA,UAAsC,MAAA,eAAoB,MAAA,YAAkB,MAAA,UAAA,MAAA,aAAwB,MAAA,YAAoB,MAAA,YAAoB,MAAA,YAAmC,MAAA,UAAG;AAC5+B,MAAA,QAAgB,MAAA,OAAe,MAAA,UAA+B,MAAA,QAAoB,MAAA,YAAgB,MAAA,QAAsB,MAAA,cAAA,MAAA,SAAoB,MAAA,SAAiB,MAAA,eAAuB,MAAA,MAAc,MAAA,SAAgC,MAAA,UAAqB,MAAA,aAAmB,MAAA,WAAkB,MAAA,UAAA,MAAA,WAAsB,MAAA,UAAkB,MAAA,WAAmB,MAAA,SAAiB,MAAA,SAAiC,MAAA,WAAe,MAAA,OAAgB,MAAA,QAAqB,MAAA,aAAA,MAAA,MAAiB,MAAA,MAAc,MAAA,UAAkB,MAAA,OAAe,MAAA,eAAyC,MAAA,aAAmB,MAAA,WAAA,MAAA,OAAkB,MAAA,SAAiB;AACvkB,MAAA,gBAAG;AACV,MAAA,SAAG;AACjB,IAAM,gBAAgB9d;AACtB,IAAM,cAAcE;AACpB,IAAM,iBAAiB2D;AACvB,IAAM,iBAAiBU;AACvB,IAAM,YAAYG;AAClB,IAAM,qBAAN,MAAyB;EACrB,YAAY,QAAQ,OAAOd,OAAM/B,MAAK;AAClC,SAAK,cAAc,CAAA;AACnB,SAAK,SAAS;AACd,SAAK,OAAO;AACZ,SAAK,QAAQ+B;AACb,SAAK,OAAO/B;EACpB;EACI,IAAI,OAAO;AACP,QAAI,CAAC,KAAK,YAAY,QAAQ;AAC1B,UAAI,MAAM,QAAQ,KAAK,IAAI,GAAG;AAC1B,aAAK,YAAY,KAAK,GAAG,KAAK,OAAO,GAAG,KAAK,IAAI;MACjE,OACiB;AACD,aAAK,YAAY,KAAK,GAAG,KAAK,OAAO,KAAK,IAAI;MAC9D;IACA;AACQ,WAAO,KAAK;EACpB;AACA;AACA,IAAM,eAAe,CAAC,KAAK,WAAW;AAClC,OAAI,GAAI,eAAe,SAAS,MAAM,GAAG;AACrC,WAAO,EAAE,SAAS,MAAM,MAAM,OAAO,MAAK;EAClD,OACS;AACD,QAAI,CAAC,IAAI,OAAO,OAAO,QAAQ;AAC3B,YAAM,IAAI,MAAM,2CAA2C;IACvE;AACQ,WAAO;MACH,SAAS;MACT,IAAI,QAAQ;AACR,YAAI,KAAK;AACL,iBAAO,KAAK;AAChB,cAAMqE,SAAQ,IAAI,cAAc,SAAS,IAAI,OAAO,MAAM;AAC1D,aAAK,SAASA;AACd,eAAO,KAAK;MAC5B;IACA;EACA;AACA;AACA,SAAS,oBAAoB,QAAQ;AACjC,MAAI,CAAC;AACD,WAAO,CAAA;AACX,QAAM,EAAE,UAAA8X,WAAU,oBAAoB,gBAAgB,aAAAC,aAAW,IAAK;AACtE,MAAID,cAAa,sBAAsB,iBAAiB;AACpD,UAAM,IAAI,MAAM,0FAA0F;EAClH;AACI,MAAIA;AACA,WAAO,EAAE,UAAUA,WAAU,aAAAC,aAAW;AAC5C,QAAM,YAAY,CAAC,KAAK,QAAQ;AAC5B,UAAM,EAAE,QAAO,IAAK;AACpB,QAAI,IAAI,SAAS,sBAAsB;AACnC,aAAO,EAAE,SAAS,WAAW,IAAI,aAAY;IACzD;AACQ,QAAI,OAAO,IAAI,SAAS,aAAa;AACjC,aAAO,EAAE,SAAS,WAAW,kBAAkB,IAAI,aAAY;IAC3E;AACQ,QAAI,IAAI,SAAS;AACb,aAAO,EAAE,SAAS,IAAI,aAAY;AACtC,WAAO,EAAE,SAAS,WAAW,sBAAsB,IAAI,aAAY;EAC3E;AACI,SAAO,EAAE,UAAU,WAAW,aAAAA,aAAW;AAC7C;AACA,IAAM,UAAN,MAAc;EACV,IAAI,cAAc;AACd,WAAO,KAAK,KAAK;EACzB;EACI,SAAS,OAAO;AACZ,YAAO,GAAI,UAAU,eAAe,MAAM,IAAI;EACtD;EACI,gBAAgB,OAAO,KAAK;AACxB,WAAQ,OAAO;MACX,QAAQ,MAAM,OAAO;MACrB,MAAM,MAAM;MACZ,aAAY,GAAI,UAAU,eAAe,MAAM,IAAI;MACnD,gBAAgB,KAAK,KAAK;MAC1B,MAAM,MAAM;MACZ,QAAQ,MAAM;IAC1B;EACA;EACI,oBAAoB,OAAO;AACvB,WAAO;MACH,QAAQ,IAAI,eAAe,YAAW;MACtC,KAAK;QACD,QAAQ,MAAM,OAAO;QACrB,MAAM,MAAM;QACZ,aAAY,GAAI,UAAU,eAAe,MAAM,IAAI;QACnD,gBAAgB,KAAK,KAAK;QAC1B,MAAM,MAAM;QACZ,QAAQ,MAAM;MAC9B;IACA;EACA;EACI,WAAW,OAAO;AACd,UAAM,SAAS,KAAK,OAAO,KAAK;AAChC,SAAI,GAAI,eAAe,SAAS,MAAM,GAAG;AACrC,YAAM,IAAI,MAAM,wCAAwC;IACpE;AACQ,WAAO;EACf;EACI,YAAY,OAAO;AACf,UAAM,SAAS,KAAK,OAAO,KAAK;AAChC,WAAO,QAAQ,QAAQ,MAAM;EACrC;EACI,MAAM,MAAM,QAAQ;AAChB,UAAM,SAAS,KAAK,UAAU,MAAM,MAAM;AAC1C,QAAI,OAAO;AACP,aAAO,OAAO;AAClB,UAAM,OAAO;EACrB;EACI,UAAU,MAAM,QAAQ;AACpB,UAAM,MAAM;MACR,QAAQ;QACJ,QAAQ,CAAA;QACR,OAAO,QAAQ,SAAS;QACxB,oBAAoB,QAAQ;MAC5C;MACY,MAAM,QAAQ,QAAQ,CAAA;MACtB,gBAAgB,KAAK,KAAK;MAC1B,QAAQ;MACR;MACA,aAAY,GAAI,UAAU,eAAe,IAAI;IACzD;AACQ,UAAM,SAAS,KAAK,WAAW,EAAE,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAG,CAAE;AACpE,WAAO,aAAa,KAAK,MAAM;EACvC;EACI,YAAY,MAAM;AACd,UAAM,MAAM;MACR,QAAQ;QACJ,QAAQ,CAAA;QACR,OAAO,CAAC,CAAC,KAAK,WAAW,EAAE;MAC3C;MACY,MAAM,CAAA;MACN,gBAAgB,KAAK,KAAK;MAC1B,QAAQ;MACR;MACA,aAAY,GAAI,UAAU,eAAe,IAAI;IACzD;AACQ,QAAI,CAAC,KAAK,WAAW,EAAE,OAAO;AAC1B,UAAI;AACA,cAAM,SAAS,KAAK,WAAW,EAAE,MAAM,MAAM,CAAA,GAAI,QAAQ,IAAG,CAAE;AAC9D,gBAAQ,GAAG,eAAe,SAAS,MAAM,IACnC;UACE,OAAO,OAAO;QACtC,IACsB;UACE,QAAQ,IAAI,OAAO;QAC3C;MACA,SACmB,KAAK;AACR,YAAI,KAAK,SAAS,YAAW,GAAI,SAAS,aAAa,GAAG;AACtD,eAAK,WAAW,EAAE,QAAQ;QAC9C;AACgB,YAAI,SAAS;UACT,QAAQ,CAAA;UACR,OAAO;QAC3B;MACA;IACA;AACQ,WAAO,KAAK,YAAY,EAAE,MAAM,MAAM,CAAA,GAAI,QAAQ,IAAG,CAAE,EAAE,KAAK,CAAC,YAAW,GAAI,eAAe,SAAS,MAAM,IACtG;MACE,OAAO,OAAO;IAC9B,IACc;MACE,QAAQ,IAAI,OAAO;IACnC,CAAa;EACb;EACI,MAAM,WAAW,MAAM,QAAQ;AAC3B,UAAM,SAAS,MAAM,KAAK,eAAe,MAAM,MAAM;AACrD,QAAI,OAAO;AACP,aAAO,OAAO;AAClB,UAAM,OAAO;EACrB;EACI,MAAM,eAAe,MAAM,QAAQ;AAC/B,UAAM,MAAM;MACR,QAAQ;QACJ,QAAQ,CAAA;QACR,oBAAoB,QAAQ;QAC5B,OAAO;MACvB;MACY,MAAM,QAAQ,QAAQ,CAAA;MACtB,gBAAgB,KAAK,KAAK;MAC1B,QAAQ;MACR;MACA,aAAY,GAAI,UAAU,eAAe,IAAI;IACzD;AACQ,UAAM,mBAAmB,KAAK,OAAO,EAAE,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAG,CAAE;AAC1E,UAAM,SAAS,QAAO,GAAI,eAAe,SAAS,gBAAgB,IAAI,mBAAmB,QAAQ,QAAQ,gBAAgB;AACzH,WAAO,aAAa,KAAK,MAAM;EACvC;EACI,OAAO,OAAO,SAAS;AACnB,UAAM,qBAAqB,CAAC,QAAQ;AAChC,UAAI,OAAO,YAAY,YAAY,OAAO,YAAY,aAAa;AAC/D,eAAO,EAAE,QAAO;MAChC,WACqB,OAAO,YAAY,YAAY;AACpC,eAAO,QAAQ,GAAG;MAClC,OACiB;AACD,eAAO;MACvB;IACA;AACQ,WAAO,KAAK,YAAY,CAAC,KAAK,QAAQ;AAClC,YAAM,SAAS,MAAM,GAAG;AACxB,YAAM,WAAW,MAAM,IAAI,SAAS;QAChC,MAAM,cAAc,aAAa;QACjC,GAAG,mBAAmB,GAAG;MACzC,CAAa;AACD,UAAI,OAAO,YAAY,eAAe,kBAAkB,SAAS;AAC7D,eAAO,OAAO,KAAK,CAAC,SAAS;AACzB,cAAI,CAAC,MAAM;AACP,qBAAQ;AACR,mBAAO;UAC/B,OACyB;AACD,mBAAO;UAC/B;QACA,CAAiB;MACjB;AACY,UAAI,CAAC,QAAQ;AACT,iBAAQ;AACR,eAAO;MACvB,OACiB;AACD,eAAO;MACvB;IACA,CAAS;EACT;EACI,WAAW,OAAO,gBAAgB;AAC9B,WAAO,KAAK,YAAY,CAAC,KAAK,QAAQ;AAClC,UAAI,CAAC,MAAM,GAAG,GAAG;AACb,YAAI,SAAS,OAAO,mBAAmB,aAAa,eAAe,KAAK,GAAG,IAAI,cAAc;AAC7F,eAAO;MACvB,OACiB;AACD,eAAO;MACvB;IACA,CAAS;EACT;EACI,YAAY,YAAY;AACpB,WAAO,IAAI,WAAW;MAClB,QAAQ;MACR,UAAU,sBAAsB;MAChC,QAAQ,EAAE,MAAM,cAAc,WAAU;IACpD,CAAS;EACT;EACI,YAAY,YAAY;AACpB,WAAO,KAAK,YAAY,UAAU;EAC1C;EACI,YAAY1D,MAAK;AAEb,SAAK,MAAM,KAAK;AAChB,SAAK,OAAOA;AACZ,SAAK,QAAQ,KAAK,MAAM,KAAK,IAAI;AACjC,SAAK,YAAY,KAAK,UAAU,KAAK,IAAI;AACzC,SAAK,aAAa,KAAK,WAAW,KAAK,IAAI;AAC3C,SAAK,iBAAiB,KAAK,eAAe,KAAK,IAAI;AACnD,SAAK,MAAM,KAAK,IAAI,KAAK,IAAI;AAC7B,SAAK,SAAS,KAAK,OAAO,KAAK,IAAI;AACnC,SAAK,aAAa,KAAK,WAAW,KAAK,IAAI;AAC3C,SAAK,cAAc,KAAK,YAAY,KAAK,IAAI;AAC7C,SAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,SAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,SAAK,UAAU,KAAK,QAAQ,KAAK,IAAI;AACrC,SAAK,QAAQ,KAAK,MAAM,KAAK,IAAI;AACjC,SAAK,UAAU,KAAK,QAAQ,KAAK,IAAI;AACrC,SAAK,KAAK,KAAK,GAAG,KAAK,IAAI;AAC3B,SAAK,MAAM,KAAK,IAAI,KAAK,IAAI;AAC7B,SAAK,YAAY,KAAK,UAAU,KAAK,IAAI;AACzC,SAAK,QAAQ,KAAK,MAAM,KAAK,IAAI;AACjC,SAAK,UAAU,KAAK,QAAQ,KAAK,IAAI;AACrC,SAAK,QAAQ,KAAK,MAAM,KAAK,IAAI;AACjC,SAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,SAAK,OAAO,KAAK,KAAK,KAAK,IAAI;AAC/B,SAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,SAAK,aAAa,KAAK,WAAW,KAAK,IAAI;AAC3C,SAAK,aAAa,KAAK,WAAW,KAAK,IAAI;AAC3C,SAAK,WAAW,IAAI;MAChB,SAAS;MACT,QAAQ;MACR,UAAU,CAAC,SAAS,KAAK,WAAW,EAAE,IAAI;IACtD;EACA;EACI,WAAW;AACP,WAAO,YAAY,OAAO,MAAM,KAAK,IAAI;EACjD;EACI,WAAW;AACP,WAAO,YAAY,OAAO,MAAM,KAAK,IAAI;EACjD;EACI,UAAU;AACN,WAAO,KAAK,SAAQ,EAAG,SAAQ;EACvC;EACI,QAAQ;AACJ,WAAO,SAAS,OAAO,IAAI;EACnC;EACI,UAAU;AACN,WAAO,WAAW,OAAO,MAAM,KAAK,IAAI;EAChD;EACI,GAAG,QAAQ;AACP,WAAO,SAAS,OAAO,CAAC,MAAM,MAAM,GAAG,KAAK,IAAI;EACxD;EACI,IAAI,UAAU;AACV,WAAO,gBAAgB,OAAO,MAAM,UAAU,KAAK,IAAI;EAC/D;EACI,UAAU,WAAW;AACjB,WAAO,IAAI,WAAW;MAClB,GAAG,oBAAoB,KAAK,IAAI;MAChC,QAAQ;MACR,UAAU,sBAAsB;MAChC,QAAQ,EAAE,MAAM,aAAa,UAAS;IAClD,CAAS;EACT;EACI,QAAQA,MAAK;AACT,UAAM,mBAAmB,OAAOA,SAAQ,aAAaA,OAAM,MAAMA;AACjE,WAAO,IAAI,WAAW;MAClB,GAAG,oBAAoB,KAAK,IAAI;MAChC,WAAW;MACX,cAAc;MACd,UAAU,sBAAsB;IAC5C,CAAS;EACT;EACI,QAAQ;AACJ,WAAO,IAAI,WAAW;MAClB,UAAU,sBAAsB;MAChC,MAAM;MACN,GAAG,oBAAoB,KAAK,IAAI;IAC5C,CAAS;EACT;EACI,MAAMA,MAAK;AACP,UAAM,iBAAiB,OAAOA,SAAQ,aAAaA,OAAM,MAAMA;AAC/D,WAAO,IAAI,SAAS;MAChB,GAAG,oBAAoB,KAAK,IAAI;MAChC,WAAW;MACX,YAAY;MACZ,UAAU,sBAAsB;IAC5C,CAAS;EACT;EACI,SAAS0D,cAAa;AAClB,UAAM,OAAO,KAAK;AAClB,WAAO,IAAI,KAAK;MACZ,GAAG,KAAK;MACR,aAAAA;IACZ,CAAS;EACT;EACI,KAAK,QAAQ;AACT,WAAO,YAAY,OAAO,MAAM,MAAM;EAC9C;EACI,WAAW;AACP,WAAO,YAAY,OAAO,IAAI;EACtC;EACI,aAAa;AACT,WAAO,KAAK,UAAU,MAAS,EAAE;EACzC;EACI,aAAa;AACT,WAAO,KAAK,UAAU,IAAI,EAAE;EACpC;AACA;AACe,MAAA,UAAG;AACJ,MAAA,SAAG;AACA,MAAA,YAAG;AACpB,IAAM,YAAY;AAClB,IAAM,aAAa;AACnB,IAAM,YAAY;AAGlB,IAAM,YAAY;AAClB,IAAM,cAAc;AACpB,IAAM,WAAW;AACjB,IAAM,gBAAgB;AAatB,IAAM,aAAa;AAInB,IAAM,cAAc;AACpB,IAAI;AAEJ,IAAM,YAAY;AAClB,IAAM,gBAAgB;AAGtB,IAAM,YAAY;AAClB,IAAM,gBAAgB;AAEtB,IAAM,cAAc;AAEpB,IAAM,iBAAiB;AAMvB,IAAM,kBAAkB;AACxB,IAAM,YAAY,IAAI,OAAO,IAAI,eAAe,GAAG;AACnD,SAAS,gBAAgB,MAAM;AAC3B,MAAI,qBAAqB;AACzB,MAAI,KAAK,WAAW;AAChB,yBAAqB,GAAG,kBAAkB,UAAU,KAAK,SAAS;EAC1E,WACa,KAAK,aAAa,MAAM;AAC7B,yBAAqB,GAAG,kBAAkB;EAClD;AACI,QAAM,oBAAoB,KAAK,YAAY,MAAM;AACjD,SAAO,8BAA8B,kBAAkB,IAAI,iBAAiB;AAChF;AACA,SAAS,UAAU,MAAM;AACrB,SAAO,IAAI,OAAO,IAAI,gBAAgB,IAAI,CAAC,GAAG;AAClD;AAEA,SAAS,cAAc,MAAM;AACzB,MAAI,QAAQ,GAAG,eAAe,IAAI,gBAAgB,IAAI,CAAC;AACvD,QAAM,OAAO,CAAA;AACb,OAAK,KAAK,KAAK,QAAQ,OAAO,GAAG;AACjC,MAAI,KAAK;AACL,SAAK,KAAK,sBAAsB;AACpC,UAAQ,GAAG,KAAK,IAAI,KAAK,KAAK,GAAG,CAAC;AAClC,SAAO,IAAI,OAAO,IAAI,KAAK,GAAG;AAClC;AACA,SAAS,UAAUC,KAAIC,UAAS;AAC5B,OAAKA,aAAY,QAAQ,CAACA,aAAY,UAAU,KAAKD,GAAE,GAAG;AACtD,WAAO;EACf;AACI,OAAKC,aAAY,QAAQ,CAACA,aAAY,UAAU,KAAKD,GAAE,GAAG;AACtD,WAAO;EACf;AACI,SAAO;AACX;AACA,SAAS,WAAW,KAAK,KAAK;AAC1B,MAAI,CAAC,SAAS,KAAK,GAAG;AAClB,WAAO;AACX,MAAI;AACA,UAAM,CAAC,MAAM,IAAI,IAAI,MAAM,GAAG;AAC9B,QAAI,CAAC;AACD,aAAO;AAEX,UAAM,SAAS,OACV,QAAQ,MAAM,GAAG,EACjB,QAAQ,MAAM,GAAG,EACjB,OAAO,OAAO,UAAW,IAAK,OAAO,SAAS,KAAM,GAAI,GAAG;AAChE,UAAM,UAAU,KAAK,MAAM,KAAK,MAAM,CAAC;AACvC,QAAI,OAAO,YAAY,YAAY,YAAY;AAC3C,aAAO;AACX,QAAI,SAAS,WAAW,SAAS,QAAQ;AACrC,aAAO;AACX,QAAI,CAAC,QAAQ;AACT,aAAO;AACX,QAAI,OAAO,QAAQ,QAAQ;AACvB,aAAO;AACX,WAAO;EACf,QACU;AACF,WAAO;EACf;AACA;AACA,SAAS,YAAYA,KAAIC,UAAS;AAC9B,OAAKA,aAAY,QAAQ,CAACA,aAAY,cAAc,KAAKD,GAAE,GAAG;AAC1D,WAAO;EACf;AACI,OAAKC,aAAY,QAAQ,CAACA,aAAY,cAAc,KAAKD,GAAE,GAAG;AAC1D,WAAO;EACf;AACI,SAAO;AACX;AACA,IAAM,YAAN,MAAM,mBAAkB,QAAQ;EAC5B,OAAO,OAAO;AACV,QAAI,KAAK,KAAK,QAAQ;AAClB,YAAM,OAAO,OAAO,MAAM,IAAI;IAC1C;AACQ,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,QAAQ;AAC/C,YAAME,OAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmBA,MAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAUA,KAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,UAAM,SAAS,IAAI,eAAe,YAAW;AAC7C,QAAI,MAAM;AACV,eAAW,SAAS,KAAK,KAAK,QAAQ;AAClC,UAAI,MAAM,SAAS,OAAO;AACtB,YAAI,MAAM,KAAK,SAAS,MAAM,OAAO;AACjC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;YACf,MAAM;YACN,WAAW;YACX,OAAO;YACP,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,OAAO;AAC3B,YAAI,MAAM,KAAK,SAAS,MAAM,OAAO;AACjC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;YACf,MAAM;YACN,WAAW;YACX,OAAO;YACP,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,UAAU;AAC9B,cAAM,SAAS,MAAM,KAAK,SAAS,MAAM;AACzC,cAAM,WAAW,MAAM,KAAK,SAAS,MAAM;AAC3C,YAAI,UAAU,UAAU;AACpB,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,cAAI,QAAQ;AACR,aAAA,GAAI,eAAe,mBAAmB,KAAK;cACvC,MAAM,cAAc,aAAa;cACjC,SAAS,MAAM;cACf,MAAM;cACN,WAAW;cACX,OAAO;cACP,SAAS,MAAM;YAC3C,CAAyB;UACzB,WAC6B,UAAU;AACf,aAAA,GAAI,eAAe,mBAAmB,KAAK;cACvC,MAAM,cAAc,aAAa;cACjC,SAAS,MAAM;cACf,MAAM;cACN,WAAW;cACX,OAAO;cACP,SAAS,MAAM;YAC3C,CAAyB;UACzB;AACoB,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,SAAS;AAC7B,YAAI,CAAC,WAAW,KAAK,MAAM,IAAI,GAAG;AAC9B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,SAAS;AAC7B,YAAI,CAAC,YAAY;AACb,uBAAa,IAAI,OAAO,aAAa,GAAG;QAC5D;AACgB,YAAI,CAAC,WAAW,KAAK,MAAM,IAAI,GAAG;AAC9B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,QAAQ;AAC5B,YAAI,CAAC,UAAU,KAAK,MAAM,IAAI,GAAG;AAC7B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,UAAU;AAC9B,YAAI,CAAC,YAAY,KAAK,MAAM,IAAI,GAAG;AAC/B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,QAAQ;AAC5B,YAAI,CAAC,UAAU,KAAK,MAAM,IAAI,GAAG;AAC7B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,SAAS;AAC7B,YAAI,CAAC,WAAW,KAAK,MAAM,IAAI,GAAG;AAC9B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,QAAQ;AAC5B,YAAI,CAAC,UAAU,KAAK,MAAM,IAAI,GAAG;AAC7B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,OAAO;AAC3B,YAAI;AACA,cAAI,IAAI,MAAM,IAAI;QACtC,QACsB;AACF,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,SAAS;AAC7B,cAAM,MAAM,YAAY;AACxB,cAAM,aAAa,MAAM,MAAM,KAAK,MAAM,IAAI;AAC9C,YAAI,CAAC,YAAY;AACb,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,QAAQ;AAC5B,cAAM,OAAO,MAAM,KAAK,KAAI;MAC5C,WACqB,MAAM,SAAS,YAAY;AAChC,YAAI,CAAC,MAAM,KAAK,SAAS,MAAM,OAAO,MAAM,QAAQ,GAAG;AACnD,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,YAAY,EAAE,UAAU,MAAM,OAAO,UAAU,MAAM,SAAQ;YAC7D,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,eAAe;AACnC,cAAM,OAAO,MAAM,KAAK,YAAW;MACnD,WACqB,MAAM,SAAS,eAAe;AACnC,cAAM,OAAO,MAAM,KAAK,YAAW;MACnD,WACqB,MAAM,SAAS,cAAc;AAClC,YAAI,CAAC,MAAM,KAAK,WAAW,MAAM,KAAK,GAAG;AACrC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,YAAY,EAAE,YAAY,MAAM,MAAK;YACrC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,YAAY;AAChC,YAAI,CAAC,MAAM,KAAK,SAAS,MAAM,KAAK,GAAG;AACnC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,YAAY,EAAE,UAAU,MAAM,MAAK;YACnC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,YAAY;AAChC,cAAM,QAAQ,cAAc,KAAK;AACjC,YAAI,CAAC,MAAM,KAAK,MAAM,IAAI,GAAG;AACzB,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,YAAY;YACZ,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,QAAQ;AAC5B,cAAM,QAAQ;AACd,YAAI,CAAC,MAAM,KAAK,MAAM,IAAI,GAAG;AACzB,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,YAAY;YACZ,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,QAAQ;AAC5B,cAAM,QAAQ,UAAU,KAAK;AAC7B,YAAI,CAAC,MAAM,KAAK,MAAM,IAAI,GAAG;AACzB,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,YAAY;YACZ,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,YAAY;AAChC,YAAI,CAAC,cAAc,KAAK,MAAM,IAAI,GAAG;AACjC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,MAAM;AAC1B,YAAI,CAAC,UAAU,MAAM,MAAM,MAAM,OAAO,GAAG;AACvC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,OAAO;AAC3B,YAAI,CAAC,WAAW,MAAM,MAAM,MAAM,GAAG,GAAG;AACpC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,QAAQ;AAC5B,YAAI,CAAC,YAAY,MAAM,MAAM,MAAM,OAAO,GAAG;AACzC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,UAAU;AAC9B,YAAI,CAAC,YAAY,KAAK,MAAM,IAAI,GAAG;AAC/B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,aAAa;AACjC,YAAI,CAAC,eAAe,KAAK,MAAM,IAAI,GAAG;AAClC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,YAAY;YACZ,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,OACiB;AACD,kBAAU,KAAK,YAAY,KAAK;MAChD;IACA;AACQ,WAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,MAAM,KAAI;EACxD;EACI,OAAO,OAAO,YAAY,SAAS;AAC/B,WAAO,KAAK,WAAW,CAAC,SAAS,MAAM,KAAK,IAAI,GAAG;MAC/C;MACA,MAAM,cAAc,aAAa;MACjC,GAAG,eAAe,UAAU,SAAS,OAAO;IACxD,CAAS;EACT;EACI,UAAU,OAAO;AACb,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK;IAC/C,CAAS;EACT;EACI,MAAM,SAAS;AACX,WAAO,KAAK,UAAU,EAAE,MAAM,SAAS,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC9F;EACI,IAAI,SAAS;AACT,WAAO,KAAK,UAAU,EAAE,MAAM,OAAO,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC5F;EACI,MAAM,SAAS;AACX,WAAO,KAAK,UAAU,EAAE,MAAM,SAAS,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC9F;EACI,KAAK,SAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC7F;EACI,OAAO,SAAS;AACZ,WAAO,KAAK,UAAU,EAAE,MAAM,UAAU,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC/F;EACI,KAAK,SAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC7F;EACI,MAAM,SAAS;AACX,WAAO,KAAK,UAAU,EAAE,MAAM,SAAS,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC9F;EACI,KAAK,SAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC7F;EACI,OAAO,SAAS;AACZ,WAAO,KAAK,UAAU,EAAE,MAAM,UAAU,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC/F;EACI,UAAU,SAAS;AAEf,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,GAAG,eAAe,UAAU,SAAS,OAAO;IACxD,CAAS;EACT;EACI,IAAI,SAAS;AACT,WAAO,KAAK,UAAU,EAAE,MAAM,OAAO,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC5F;EACI,GAAG,SAAS;AACR,WAAO,KAAK,UAAU,EAAE,MAAM,MAAM,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC3F;EACI,KAAK,SAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EAC7F;EACI,SAAS,SAAS;AACd,QAAI,OAAO,YAAY,UAAU;AAC7B,aAAO,KAAK,UAAU;QAClB,MAAM;QACN,WAAW;QACX,QAAQ;QACR,OAAO;QACP,SAAS;MACzB,CAAa;IACb;AACQ,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,WAAW,OAAO,SAAS,cAAc,cAAc,OAAO,SAAS;MACvE,QAAQ,SAAS,UAAU;MAC3B,OAAO,SAAS,SAAS;MACzB,GAAG,eAAe,UAAU,SAAS,SAAS,OAAO;IACjE,CAAS;EACT;EACI,KAAK,SAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,QAAO,CAAE;EACvD;EACI,KAAK,SAAS;AACV,QAAI,OAAO,YAAY,UAAU;AAC7B,aAAO,KAAK,UAAU;QAClB,MAAM;QACN,WAAW;QACX,SAAS;MACzB,CAAa;IACb;AACQ,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,WAAW,OAAO,SAAS,cAAc,cAAc,OAAO,SAAS;MACvE,GAAG,eAAe,UAAU,SAAS,SAAS,OAAO;IACjE,CAAS;EACT;EACI,SAAS,SAAS;AACd,WAAO,KAAK,UAAU,EAAE,MAAM,YAAY,GAAG,eAAe,UAAU,SAAS,OAAO,EAAC,CAAE;EACjG;EACI,MAAM,OAAO,SAAS;AAClB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN;MACA,GAAG,eAAe,UAAU,SAAS,OAAO;IACxD,CAAS;EACT;EACI,SAAS,OAAO,SAAS;AACrB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN;MACA,UAAU,SAAS;MACnB,GAAG,eAAe,UAAU,SAAS,SAAS,OAAO;IACjE,CAAS;EACT;EACI,WAAW,OAAO,SAAS;AACvB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN;MACA,GAAG,eAAe,UAAU,SAAS,OAAO;IACxD,CAAS;EACT;EACI,SAAS,OAAO,SAAS;AACrB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN;MACA,GAAG,eAAe,UAAU,SAAS,OAAO;IACxD,CAAS;EACT;EACI,IAAI,WAAW,SAAS;AACpB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO;MACP,GAAG,eAAe,UAAU,SAAS,OAAO;IACxD,CAAS;EACT;EACI,IAAI,WAAW,SAAS;AACpB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO;MACP,GAAG,eAAe,UAAU,SAAS,OAAO;IACxD,CAAS;EACT;EACI,OAAO,KAAK,SAAS;AACjB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO;MACP,GAAG,eAAe,UAAU,SAAS,OAAO;IACxD,CAAS;EACT;;;;EAII,SAAS,SAAS;AACd,WAAO,KAAK,IAAI,GAAG,eAAe,UAAU,SAAS,OAAO,CAAC;EACrE;EACI,OAAO;AACH,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,MAAM,OAAM,CAAE;IAC1D,CAAS;EACT;EACI,cAAc;AACV,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,MAAM,cAAa,CAAE;IACjE,CAAS;EACT;EACI,cAAc;AACV,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,MAAM,cAAa,CAAE;IACjE,CAAS;EACT;EACI,IAAI,aAAa;AACb,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACpN,QAAOA,IAAG,SAAS,UAAU;EACrE;EACI,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,MAAM;EACjE;EACI,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,MAAM;EACjE;EACI,IAAI,aAAa;AACb,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,UAAU;EACrE;EACI,IAAI,UAAU;AACV,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,OAAO;EAClE;EACI,IAAI,QAAQ;AACR,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,KAAK;EAChE;EACI,IAAI,UAAU;AACV,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,OAAO;EAClE;EACI,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,MAAM;EACjE;EACI,IAAI,WAAW;AACX,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,QAAQ;EACnE;EACI,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,MAAM;EACjE;EACI,IAAI,UAAU;AACV,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,OAAO;EAClE;EACI,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,MAAM;EACjE;EACI,IAAI,OAAO;AACP,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,IAAI;EAC/D;EACI,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,MAAM;EACjE;EACI,IAAI,WAAW;AACX,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,QAAQ;EACnE;EACI,IAAI,cAAc;AAEd,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,QAAOA,IAAG,SAAS,WAAW;EACtE;EACI,IAAI,YAAY;AACZ,QAAI7P,OAAM;AACV,eAAW6P,OAAM,KAAK,KAAK,QAAQ;AAC/B,UAAIA,IAAG,SAAS,OAAO;AACnB,YAAI7P,SAAQ,QAAQ6P,IAAG,QAAQ7P;AAC3B,UAAAA,OAAM6P,IAAG;MAC7B;IACA;AACQ,WAAO7P;EACf;EACI,IAAI,YAAY;AACZ,QAAIN,OAAM;AACV,eAAWmQ,OAAM,KAAK,KAAK,QAAQ;AAC/B,UAAIA,IAAG,SAAS,OAAO;AACnB,YAAInQ,SAAQ,QAAQmQ,IAAG,QAAQnQ;AAC3B,UAAAA,OAAMmQ,IAAG;MAC7B;IACA;AACQ,WAAOnQ;EACf;AACA;AACiB,MAAA,YAAG;AACpB,UAAU,SAAS,CAAC,WAAW;AAC3B,SAAO,IAAI,UAAU;IACjB,QAAQ,CAAA;IACR,UAAU,sBAAsB;IAChC,QAAQ,QAAQ,UAAU;IAC1B,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AAEA,SAAS,mBAAmB,KAAK,MAAM;AACnC,QAAM,eAAe,IAAI,SAAQ,EAAG,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI;AACzD,QAAM,gBAAgB,KAAK,SAAQ,EAAG,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI;AAC3D,QAAM,WAAW,cAAc,eAAe,cAAc;AAC5D,QAAM,SAAS,OAAO,SAAS,IAAI,QAAQ,QAAQ,EAAE,QAAQ,KAAK,EAAE,CAAC;AACrE,QAAM,UAAU,OAAO,SAAS,KAAK,QAAQ,QAAQ,EAAE,QAAQ,KAAK,EAAE,CAAC;AACvE,SAAQ,SAAS,UAAW,MAAM;AACtC;AACA,IAAM,YAAN,MAAM,mBAAkB,QAAQ;EAC5B,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;AAChB,SAAK,OAAO,KAAK;EACzB;EACI,OAAO,OAAO;AACV,QAAI,KAAK,KAAK,QAAQ;AAClB,YAAM,OAAO,OAAO,MAAM,IAAI;IAC1C;AACQ,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,QAAQ;AAC/C,YAAMud,OAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmBA,MAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAUA,KAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,QAAI,MAAM;AACV,UAAM,SAAS,IAAI,eAAe,YAAW;AAC7C,eAAW,SAAS,KAAK,KAAK,QAAQ;AAClC,UAAI,MAAM,SAAS,OAAO;AACtB,YAAI,CAAC,UAAU,KAAK,UAAU,MAAM,IAAI,GAAG;AACvC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,UAAU;YACV,UAAU;YACV,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,OAAO;AAC3B,cAAM,WAAW,MAAM,YAAY,MAAM,OAAO,MAAM,QAAQ,MAAM,QAAQ,MAAM;AAClF,YAAI,UAAU;AACV,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;YACf,MAAM;YACN,WAAW,MAAM;YACjB,OAAO;YACP,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,OAAO;AAC3B,cAAM,SAAS,MAAM,YAAY,MAAM,OAAO,MAAM,QAAQ,MAAM,QAAQ,MAAM;AAChF,YAAI,QAAQ;AACR,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;YACf,MAAM;YACN,WAAW,MAAM;YACjB,OAAO;YACP,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,cAAc;AAClC,YAAI,mBAAmB,MAAM,MAAM,MAAM,KAAK,MAAM,GAAG;AACnD,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,YAAY,MAAM;YAClB,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,UAAU;AAC9B,YAAI,CAAC,OAAO,SAAS,MAAM,IAAI,GAAG;AAC9B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,OACiB;AACD,kBAAU,KAAK,YAAY,KAAK;MAChD;IACA;AACQ,WAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,MAAM,KAAI;EACxD;EACI,IAAI,OAAO,SAAS;AAChB,WAAO,KAAK,SAAS,OAAO,OAAO,MAAM,eAAe,UAAU,SAAS,OAAO,CAAC;EAC3F;EACI,GAAG,OAAO,SAAS;AACf,WAAO,KAAK,SAAS,OAAO,OAAO,OAAO,eAAe,UAAU,SAAS,OAAO,CAAC;EAC5F;EACI,IAAI,OAAO,SAAS;AAChB,WAAO,KAAK,SAAS,OAAO,OAAO,MAAM,eAAe,UAAU,SAAS,OAAO,CAAC;EAC3F;EACI,GAAG,OAAO,SAAS;AACf,WAAO,KAAK,SAAS,OAAO,OAAO,OAAO,eAAe,UAAU,SAAS,OAAO,CAAC;EAC5F;EACI,SAAS,MAAM,OAAO,WAAW,SAAS;AACtC,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,QAAQ;QACJ,GAAG,KAAK,KAAK;QACb;UACI;UACA;UACA;UACA,SAAS,eAAe,UAAU,SAAS,OAAO;QACtE;MACA;IACA,CAAS;EACT;EACI,UAAU,OAAO;AACb,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK;IAC/C,CAAS;EACT;EACI,IAAI,SAAS;AACT,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,SAAS,SAAS;AACd,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO;MACP,WAAW;MACX,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,SAAS,SAAS;AACd,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO;MACP,WAAW;MACX,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,YAAY,SAAS;AACjB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO;MACP,WAAW;MACX,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,YAAY,SAAS;AACjB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO;MACP,WAAW;MACX,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,WAAW,OAAO,SAAS;AACvB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN;MACA,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,OAAO,SAAS;AACZ,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,KAAK,SAAS;AACV,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,WAAW;MACX,OAAO,OAAO;MACd,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS,EAAE,UAAU;MACT,MAAM;MACN,WAAW;MACX,OAAO,OAAO;MACd,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,IAAI,WAAW;AACX,QAAIjd,OAAM;AACV,eAAW6P,OAAM,KAAK,KAAK,QAAQ;AAC/B,UAAIA,IAAG,SAAS,OAAO;AACnB,YAAI7P,SAAQ,QAAQ6P,IAAG,QAAQ7P;AAC3B,UAAAA,OAAM6P,IAAG;MAC7B;IACA;AACQ,WAAO7P;EACf;EACI,IAAI,WAAW;AACX,QAAIN,OAAM;AACV,eAAWmQ,OAAM,KAAK,KAAK,QAAQ;AAC/B,UAAIA,IAAG,SAAS,OAAO;AACnB,YAAInQ,SAAQ,QAAQmQ,IAAG,QAAQnQ;AAC3B,UAAAA,OAAMmQ,IAAG;MAC7B;IACA;AACQ,WAAOnQ;EACf;EACI,IAAI,QAAQ;AACR,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACmQ,QAAOA,IAAG,SAAS,SAAUA,IAAG,SAAS,gBAAgB,UAAU,KAAK,UAAUA,IAAG,KAAK,CAAE;EACpI;EACI,IAAI,WAAW;AACX,QAAInQ,OAAM;AACV,QAAIM,OAAM;AACV,eAAW6P,OAAM,KAAK,KAAK,QAAQ;AAC/B,UAAIA,IAAG,SAAS,YAAYA,IAAG,SAAS,SAASA,IAAG,SAAS,cAAc;AACvE,eAAO;MACvB,WACqBA,IAAG,SAAS,OAAO;AACxB,YAAI7P,SAAQ,QAAQ6P,IAAG,QAAQ7P;AAC3B,UAAAA,OAAM6P,IAAG;MAC7B,WACqBA,IAAG,SAAS,OAAO;AACxB,YAAInQ,SAAQ,QAAQmQ,IAAG,QAAQnQ;AAC3B,UAAAA,OAAMmQ,IAAG;MAC7B;IACA;AACQ,WAAO,OAAO,SAAS7P,IAAG,KAAK,OAAO,SAASN,IAAG;EAC1D;AACA;AACiB,MAAA,YAAG;AACpB,UAAU,SAAS,CAAC,WAAW;AAC3B,SAAO,IAAI,UAAU;IACjB,QAAQ,CAAA;IACR,UAAU,sBAAsB;IAChC,QAAQ,QAAQ,UAAU;IAC1B,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,YAAN,MAAM,mBAAkB,QAAQ;EAC5B,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;EACxB;EACI,OAAO,OAAO;AACV,QAAI,KAAK,KAAK,QAAQ;AAClB,UAAI;AACA,cAAM,OAAO,OAAO,MAAM,IAAI;MAC9C,QACkB;AACF,eAAO,KAAK,iBAAiB,KAAK;MAClD;IACA;AACQ,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,QAAQ;AAC/C,aAAO,KAAK,iBAAiB,KAAK;IAC9C;AACQ,QAAI,MAAM;AACV,UAAM,SAAS,IAAI,eAAe,YAAW;AAC7C,eAAW,SAAS,KAAK,KAAK,QAAQ;AAClC,UAAI,MAAM,SAAS,OAAO;AACtB,cAAM,WAAW,MAAM,YAAY,MAAM,OAAO,MAAM,QAAQ,MAAM,QAAQ,MAAM;AAClF,YAAI,UAAU;AACV,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,MAAM;YACN,SAAS,MAAM;YACf,WAAW,MAAM;YACjB,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,OAAO;AAC3B,cAAM,SAAS,MAAM,YAAY,MAAM,OAAO,MAAM,QAAQ,MAAM,QAAQ,MAAM;AAChF,YAAI,QAAQ;AACR,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,MAAM;YACN,SAAS,MAAM;YACf,WAAW,MAAM;YACjB,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,cAAc;AAClC,YAAI,MAAM,OAAO,MAAM,UAAU,OAAO,CAAC,GAAG;AACxC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,YAAY,MAAM;YAClB,SAAS,MAAM;UACvC,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,OACiB;AACD,kBAAU,KAAK,YAAY,KAAK;MAChD;IACA;AACQ,WAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,MAAM,KAAI;EACxD;EACI,iBAAiB,OAAO;AACpB,UAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,KAAA,GAAI,eAAe,mBAAmB,KAAK;MACvC,MAAM,cAAc,aAAa;MACjC,UAAU,UAAU,cAAc;MAClC,UAAU,IAAI;IAC1B,CAAS;AACD,WAAO,eAAe;EAC9B;EACI,IAAI,OAAO,SAAS;AAChB,WAAO,KAAK,SAAS,OAAO,OAAO,MAAM,eAAe,UAAU,SAAS,OAAO,CAAC;EAC3F;EACI,GAAG,OAAO,SAAS;AACf,WAAO,KAAK,SAAS,OAAO,OAAO,OAAO,eAAe,UAAU,SAAS,OAAO,CAAC;EAC5F;EACI,IAAI,OAAO,SAAS;AAChB,WAAO,KAAK,SAAS,OAAO,OAAO,MAAM,eAAe,UAAU,SAAS,OAAO,CAAC;EAC3F;EACI,GAAG,OAAO,SAAS;AACf,WAAO,KAAK,SAAS,OAAO,OAAO,OAAO,eAAe,UAAU,SAAS,OAAO,CAAC;EAC5F;EACI,SAAS,MAAM,OAAO,WAAW,SAAS;AACtC,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,QAAQ;QACJ,GAAG,KAAK,KAAK;QACb;UACI;UACA;UACA;UACA,SAAS,eAAe,UAAU,SAAS,OAAO;QACtE;MACA;IACA,CAAS;EACT;EACI,UAAU,OAAO;AACb,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK;IAC/C,CAAS;EACT;EACI,SAAS,SAAS;AACd,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO,OAAO,CAAC;MACf,WAAW;MACX,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,SAAS,SAAS;AACd,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO,OAAO,CAAC;MACf,WAAW;MACX,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,YAAY,SAAS;AACjB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO,OAAO,CAAC;MACf,WAAW;MACX,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,YAAY,SAAS;AACjB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO,OAAO,CAAC;MACf,WAAW;MACX,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,WAAW,OAAO,SAAS;AACvB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN;MACA,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,IAAI,WAAW;AACX,QAAIM,OAAM;AACV,eAAW6P,OAAM,KAAK,KAAK,QAAQ;AAC/B,UAAIA,IAAG,SAAS,OAAO;AACnB,YAAI7P,SAAQ,QAAQ6P,IAAG,QAAQ7P;AAC3B,UAAAA,OAAM6P,IAAG;MAC7B;IACA;AACQ,WAAO7P;EACf;EACI,IAAI,WAAW;AACX,QAAIN,OAAM;AACV,eAAWmQ,OAAM,KAAK,KAAK,QAAQ;AAC/B,UAAIA,IAAG,SAAS,OAAO;AACnB,YAAInQ,SAAQ,QAAQmQ,IAAG,QAAQnQ;AAC3B,UAAAA,OAAMmQ,IAAG;MAC7B;IACA;AACQ,WAAOnQ;EACf;AACA;AACiB,MAAA,YAAG;AACpB,UAAU,SAAS,CAAC,WAAW;AAC3B,SAAO,IAAI,UAAU;IACjB,QAAQ,CAAA;IACR,UAAU,sBAAsB;IAChC,QAAQ,QAAQ,UAAU;IAC1B,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,aAAN,cAAyB,QAAQ;EAC7B,OAAO,OAAO;AACV,QAAI,KAAK,KAAK,QAAQ;AAClB,YAAM,OAAO,QAAQ,MAAM,IAAI;IAC3C;AACQ,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,SAAS;AAChD,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,YAAO,GAAI,eAAe,IAAI,MAAM,IAAI;EAChD;AACA;AACkB,MAAA,aAAG;AACrB,WAAW,SAAS,CAAC,WAAW;AAC5B,SAAO,IAAI,WAAW;IAClB,UAAU,sBAAsB;IAChC,QAAQ,QAAQ,UAAU;IAC1B,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,UAAN,MAAM,iBAAgB,QAAQ;EAC1B,OAAO,OAAO;AACV,QAAI,KAAK,KAAK,QAAQ;AAClB,YAAM,OAAO,IAAI,KAAK,MAAM,IAAI;IAC5C;AACQ,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,MAAM;AAC7C,YAAMud,OAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmBA,MAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAUA,KAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,QAAI,OAAO,MAAM,MAAM,KAAK,QAAO,CAAE,GAAG;AACpC,YAAMA,OAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmBA,MAAK;QACvC,MAAM,cAAc,aAAa;MACjD,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,UAAM,SAAS,IAAI,eAAe,YAAW;AAC7C,QAAI,MAAM;AACV,eAAW,SAAS,KAAK,KAAK,QAAQ;AAClC,UAAI,MAAM,SAAS,OAAO;AACtB,YAAI,MAAM,KAAK,QAAO,IAAK,MAAM,OAAO;AACpC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;YACf,WAAW;YACX,OAAO;YACP,SAAS,MAAM;YACf,MAAM;UAC9B,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,MAAM,SAAS,OAAO;AAC3B,YAAI,MAAM,KAAK,QAAO,IAAK,MAAM,OAAO;AACpC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,SAAS,MAAM;YACf,WAAW;YACX,OAAO;YACP,SAAS,MAAM;YACf,MAAM;UAC9B,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,OACiB;AACD,kBAAU,KAAK,YAAY,KAAK;MAChD;IACA;AACQ,WAAO;MACH,QAAQ,OAAO;MACf,OAAO,IAAI,KAAK,MAAM,KAAK,QAAO,CAAE;IAChD;EACA;EACI,UAAU,OAAO;AACb,WAAO,IAAI,SAAQ;MACf,GAAG,KAAK;MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK;IAC/C,CAAS;EACT;EACI,IAAI,SAAS,SAAS;AAClB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO,QAAQ,QAAO;MACtB,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,IAAI,SAAS,SAAS;AAClB,WAAO,KAAK,UAAU;MAClB,MAAM;MACN,OAAO,QAAQ,QAAO;MACtB,SAAS,eAAe,UAAU,SAAS,OAAO;IAC9D,CAAS;EACT;EACI,IAAI,UAAU;AACV,QAAIjd,OAAM;AACV,eAAW6P,OAAM,KAAK,KAAK,QAAQ;AAC/B,UAAIA,IAAG,SAAS,OAAO;AACnB,YAAI7P,SAAQ,QAAQ6P,IAAG,QAAQ7P;AAC3B,UAAAA,OAAM6P,IAAG;MAC7B;IACA;AACQ,WAAO7P,QAAO,OAAO,IAAI,KAAKA,IAAG,IAAI;EAC7C;EACI,IAAI,UAAU;AACV,QAAIN,OAAM;AACV,eAAWmQ,OAAM,KAAK,KAAK,QAAQ;AAC/B,UAAIA,IAAG,SAAS,OAAO;AACnB,YAAInQ,SAAQ,QAAQmQ,IAAG,QAAQnQ;AAC3B,UAAAA,OAAMmQ,IAAG;MAC7B;IACA;AACQ,WAAOnQ,QAAO,OAAO,IAAI,KAAKA,IAAG,IAAI;EAC7C;AACA;AACe,MAAA,UAAG;AAClB,QAAQ,SAAS,CAAC,WAAW;AACzB,SAAO,IAAI,QAAQ;IACf,QAAQ,CAAA;IACR,QAAQ,QAAQ,UAAU;IAC1B,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,YAAN,cAAwB,QAAQ;EAC5B,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,QAAQ;AAC/C,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,YAAO,GAAI,eAAe,IAAI,MAAM,IAAI;EAChD;AACA;AACiB,MAAA,YAAG;AACpB,UAAU,SAAS,CAAC,WAAW;AAC3B,SAAO,IAAI,UAAU;IACjB,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,eAAN,cAA2B,QAAQ;EAC/B,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,WAAW;AAClD,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,YAAO,GAAI,eAAe,IAAI,MAAM,IAAI;EAChD;AACA;AACoB,MAAA,eAAG;AACvB,aAAa,SAAS,CAAC,WAAW;AAC9B,SAAO,IAAI,aAAa;IACpB,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,UAAN,cAAsB,QAAQ;EAC1B,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,MAAM;AAC7C,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,YAAO,GAAI,eAAe,IAAI,MAAM,IAAI;EAChD;AACA;AACe,MAAA,UAAG;AAClB,QAAQ,SAAS,CAAC,WAAW;AACzB,SAAO,IAAI,QAAQ;IACf,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,SAAN,cAAqB,QAAQ;EACzB,cAAc;AACV,UAAM,GAAG,SAAS;AAElB,SAAK,OAAO;EACpB;EACI,OAAO,OAAO;AACV,YAAO,GAAI,eAAe,IAAI,MAAM,IAAI;EAChD;AACA;AACc,MAAA,SAAG;AACjB,OAAO,SAAS,CAAC,WAAW;AACxB,SAAO,IAAI,OAAO;IACd,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,aAAN,cAAyB,QAAQ;EAC7B,cAAc;AACV,UAAM,GAAG,SAAS;AAElB,SAAK,WAAW;EACxB;EACI,OAAO,OAAO;AACV,YAAO,GAAI,eAAe,IAAI,MAAM,IAAI;EAChD;AACA;AACkB,MAAA,aAAG;AACrB,WAAW,SAAS,CAAC,WAAW;AAC5B,SAAO,IAAI,WAAW;IAClB,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,WAAN,cAAuB,QAAQ;EAC3B,OAAO,OAAO;AACV,UAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,KAAA,GAAI,eAAe,mBAAmB,KAAK;MACvC,MAAM,cAAc,aAAa;MACjC,UAAU,UAAU,cAAc;MAClC,UAAU,IAAI;IAC1B,CAAS;AACD,WAAO,eAAe;EAC9B;AACA;AACgB,MAAA,WAAG;AACnB,SAAS,SAAS,CAAC,WAAW;AAC1B,SAAO,IAAI,SAAS;IAChB,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,UAAN,cAAsB,QAAQ;EAC1B,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,WAAW;AAClD,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,YAAO,GAAI,eAAe,IAAI,MAAM,IAAI;EAChD;AACA;AACe,MAAA,UAAG;AAClB,QAAQ,SAAS,CAAC,WAAW;AACzB,SAAO,IAAI,QAAQ;IACf,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,WAAN,MAAM,kBAAiB,QAAQ;EAC3B,OAAO,OAAO;AACV,UAAM,EAAE,KAAK,OAAM,IAAK,KAAK,oBAAoB,KAAK;AACtD,UAAM0Z,OAAM,KAAK;AACjB,QAAI,IAAI,eAAe,UAAU,cAAc,OAAO;AAClD,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,QAAIA,KAAI,gBAAgB,MAAM;AAC1B,YAAM,SAAS,IAAI,KAAK,SAASA,KAAI,YAAY;AACjD,YAAM,WAAW,IAAI,KAAK,SAASA,KAAI,YAAY;AACnD,UAAI,UAAU,UAAU;AACpB,SAAA,GAAI,eAAe,mBAAmB,KAAK;UACvC,MAAM,SAAS,cAAc,aAAa,UAAU,cAAc,aAAa;UAC/E,SAAU,WAAWA,KAAI,YAAY,QAAQ;UAC7C,SAAU,SAASA,KAAI,YAAY,QAAQ;UAC3C,MAAM;UACN,WAAW;UACX,OAAO;UACP,SAASA,KAAI,YAAY;QAC7C,CAAiB;AACD,eAAO,MAAK;MAC5B;IACA;AACQ,QAAIA,KAAI,cAAc,MAAM;AACxB,UAAI,IAAI,KAAK,SAASA,KAAI,UAAU,OAAO;AACvC,SAAA,GAAI,eAAe,mBAAmB,KAAK;UACvC,MAAM,cAAc,aAAa;UACjC,SAASA,KAAI,UAAU;UACvB,MAAM;UACN,WAAW;UACX,OAAO;UACP,SAASA,KAAI,UAAU;QAC3C,CAAiB;AACD,eAAO,MAAK;MAC5B;IACA;AACQ,QAAIA,KAAI,cAAc,MAAM;AACxB,UAAI,IAAI,KAAK,SAASA,KAAI,UAAU,OAAO;AACvC,SAAA,GAAI,eAAe,mBAAmB,KAAK;UACvC,MAAM,cAAc,aAAa;UACjC,SAASA,KAAI,UAAU;UACvB,MAAM;UACN,WAAW;UACX,OAAO;UACP,SAASA,KAAI,UAAU;QAC3C,CAAiB;AACD,eAAO,MAAK;MAC5B;IACA;AACQ,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,IAAI,CAAC,GAAG,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,MAAM;AAC9C,eAAOA,KAAI,KAAK,YAAY,IAAI,mBAAmB,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC;MAC1F,CAAa,CAAC,EAAE,KAAK,CAAC8D,YAAW;AACjB,eAAO,eAAe,YAAY,WAAW,QAAQA,OAAM;MAC3E,CAAa;IACb;AACQ,UAAM,SAAS,CAAC,GAAG,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,MAAM;AAC1C,aAAO9D,KAAI,KAAK,WAAW,IAAI,mBAAmB,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC;IACrF,CAAS;AACD,WAAO,eAAe,YAAY,WAAW,QAAQ,MAAM;EACnE;EACI,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;EACzB;EACI,IAAI,WAAW,SAAS;AACpB,WAAO,IAAI,UAAS;MAChB,GAAG,KAAK;MACR,WAAW,EAAE,OAAO,WAAW,SAAS,eAAe,UAAU,SAAS,OAAO,EAAC;IAC9F,CAAS;EACT;EACI,IAAI,WAAW,SAAS;AACpB,WAAO,IAAI,UAAS;MAChB,GAAG,KAAK;MACR,WAAW,EAAE,OAAO,WAAW,SAAS,eAAe,UAAU,SAAS,OAAO,EAAC;IAC9F,CAAS;EACT;EACI,OAAO,KAAK,SAAS;AACjB,WAAO,IAAI,UAAS;MAChB,GAAG,KAAK;MACR,aAAa,EAAE,OAAO,KAAK,SAAS,eAAe,UAAU,SAAS,OAAO,EAAC;IAC1F,CAAS;EACT;EACI,SAAS,SAAS;AACd,WAAO,KAAK,IAAI,GAAG,OAAO;EAClC;AACA;AACgB,MAAA,WAAG;AACnB,SAAS,SAAS,CAAC,QAAQ,WAAW;AAClC,SAAO,IAAI,SAAS;IAChB,MAAM;IACN,WAAW;IACX,WAAW;IACX,aAAa;IACb,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,SAAS,eAAe,QAAQ;AAC5B,MAAI,kBAAkB,WAAW;AAC7B,UAAM,WAAW,CAAA;AACjB,eAAW1Y,QAAO,OAAO,OAAO;AAC5B,YAAM,cAAc,OAAO,MAAMA,IAAG;AACpC,eAASA,IAAG,IAAI,YAAY,OAAO,eAAe,WAAW,CAAC;IAC1E;AACQ,WAAO,IAAI,UAAU;MACjB,GAAG,OAAO;MACV,OAAO,MAAM;IACzB,CAAS;EACT,WACa,kBAAkB,UAAU;AACjC,WAAO,IAAI,SAAS;MAChB,GAAG,OAAO;MACV,MAAM,eAAe,OAAO,OAAO;IAC/C,CAAS;EACT,WACa,kBAAkB,aAAa;AACpC,WAAO,YAAY,OAAO,eAAe,OAAO,OAAM,CAAE,CAAC;EACjE,WACa,kBAAkB,aAAa;AACpC,WAAO,YAAY,OAAO,eAAe,OAAO,OAAM,CAAE,CAAC;EACjE,WACa,kBAAkB,UAAU;AACjC,WAAO,SAAS,OAAO,OAAO,MAAM,IAAI,CAAC,SAAS,eAAe,IAAI,CAAC,CAAC;EAC/E,OACS;AACD,WAAO;EACf;AACA;AACA,IAAM,YAAN,MAAM,mBAAkB,QAAQ;EAC5B,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,UAAU;AAKf,SAAK,YAAY,KAAK;AAqCtB,SAAK,UAAU,KAAK;EAC5B;EACI,aAAa;AACT,QAAI,KAAK,YAAY;AACjB,aAAO,KAAK;AAChB,UAAM,QAAQ,KAAK,KAAK,MAAK;AAC7B,UAAMmF,QAAO,UAAU,KAAK,WAAW,KAAK;AAC5C,SAAK,UAAU,EAAE,OAAO,MAAAA,MAAI;AAC5B,WAAO,KAAK;EACpB;EACI,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,QAAQ;AAC/C,YAAMoX,OAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmBA,MAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAUA,KAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,UAAM,EAAE,QAAQ,IAAG,IAAK,KAAK,oBAAoB,KAAK;AACtD,UAAM,EAAE,OAAO,MAAM,UAAS,IAAK,KAAK,WAAU;AAClD,UAAM,YAAY,CAAA;AAClB,QAAI,EAAE,KAAK,KAAK,oBAAoB,YAAY,KAAK,KAAK,gBAAgB,UAAU;AAChF,iBAAWvc,QAAO,IAAI,MAAM;AACxB,YAAI,CAAC,UAAU,SAASA,IAAG,GAAG;AAC1B,oBAAU,KAAKA,IAAG;QACtC;MACA;IACA;AACQ,UAAM,QAAQ,CAAA;AACd,eAAWA,QAAO,WAAW;AACzB,YAAM,eAAe,MAAMA,IAAG;AAC9B,YAAM,QAAQ,IAAI,KAAKA,IAAG;AAC1B,YAAM,KAAK;QACP,KAAK,EAAE,QAAQ,SAAS,OAAOA,KAAG;QAClC,OAAO,aAAa,OAAO,IAAI,mBAAmB,KAAK,OAAO,IAAI,MAAMA,IAAG,CAAC;QAC5E,WAAWA,QAAO,IAAI;MACtC,CAAa;IACb;AACQ,QAAI,KAAK,KAAK,oBAAoB,UAAU;AACxC,YAAM,cAAc,KAAK,KAAK;AAC9B,UAAI,gBAAgB,eAAe;AAC/B,mBAAWA,QAAO,WAAW;AACzB,gBAAM,KAAK;YACP,KAAK,EAAE,QAAQ,SAAS,OAAOA,KAAG;YAClC,OAAO,EAAE,QAAQ,SAAS,OAAO,IAAI,KAAKA,IAAG,EAAC;UACtE,CAAqB;QACrB;MACA,WACqB,gBAAgB,UAAU;AAC/B,YAAI,UAAU,SAAS,GAAG;AACtB,WAAA,GAAI,eAAe,mBAAmB,KAAK;YACvC,MAAM,cAAc,aAAa;YACjC,MAAM;UAC9B,CAAqB;AACD,iBAAO,MAAK;QAChC;MACA,WACqB,gBAAgB,QAAS;WAE7B;AACD,cAAM,IAAI,MAAM,sDAAsD;MACtF;IACA,OACa;AAED,YAAM,WAAW,KAAK,KAAK;AAC3B,iBAAWA,QAAO,WAAW;AACzB,cAAM,QAAQ,IAAI,KAAKA,IAAG;AAC1B,cAAM,KAAK;UACP,KAAK,EAAE,QAAQ,SAAS,OAAOA,KAAG;UAClC,OAAO,SAAS;YAAO,IAAI,mBAAmB,KAAK,OAAO,IAAI,MAAMA,IAAG;;UAC3F;UACoB,WAAWA,QAAO,IAAI;QAC1C,CAAiB;MACjB;IACA;AACQ,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,QAAO,EACjB,KAAK,YAAY;AAClB,cAAM,YAAY,CAAA;AAClB,mBAAW,QAAQ,OAAO;AACtB,gBAAMA,OAAM,MAAM,KAAK;AACvB,gBAAM,QAAQ,MAAM,KAAK;AACzB,oBAAU,KAAK;YACX,KAAAA;YACA;YACA,WAAW,KAAK;UACxC,CAAqB;QACrB;AACgB,eAAO;MACvB,CAAa,EACI,KAAK,CAAC,cAAc;AACrB,eAAO,eAAe,YAAY,gBAAgB,QAAQ,SAAS;MACnF,CAAa;IACb,OACa;AACD,aAAO,eAAe,YAAY,gBAAgB,QAAQ,KAAK;IAC3E;EACA;EACI,IAAI,QAAQ;AACR,WAAO,KAAK,KAAK,MAAK;EAC9B;EACI,OAAO,SAAS;AACZ,mBAAe,UAAU;AACzB,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,aAAa;MACb,GAAI,YAAY,SACV;QACE,UAAU,CAAC,OAAO,QAAQ;AACtB,gBAAM,eAAe,KAAK,KAAK,WAAW,OAAO,GAAG,EAAE,WAAW,IAAI;AACrE,cAAI,MAAM,SAAS;AACf,mBAAO;cACH,SAAS,eAAe,UAAU,SAAS,OAAO,EAAE,WAAW;YAC/F;AACwB,iBAAO;YACH,SAAS;UACrC;QACA;MACA,IACkB,CAAA;IAClB,CAAS;EACT;EACI,QAAQ;AACJ,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,aAAa;IACzB,CAAS;EACT;EACI,cAAc;AACV,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,aAAa;IACzB,CAAS;EACT;;;;;;;;;;;;;;;;;;EAkBI,OAAO,cAAc;AACjB,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,OAAO,OAAO;QACV,GAAG,KAAK,KAAK,MAAK;QAClB,GAAG;MACnB;IACA,CAAS;EACT;;;;;;EAMI,MAAM,SAAS;AACX,UAAM,SAAS,IAAI,WAAU;MACzB,aAAa,QAAQ,KAAK;MAC1B,UAAU,QAAQ,KAAK;MACvB,OAAO,OAAO;QACV,GAAG,KAAK,KAAK,MAAK;QAClB,GAAG,QAAQ,KAAK,MAAK;MACrC;MACY,UAAU,sBAAsB;IAC5C,CAAS;AACD,WAAO;EACf;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAoCI,OAAOA,MAAK,QAAQ;AAChB,WAAO,KAAK,QAAQ,EAAE,CAACA,IAAG,GAAG,OAAM,CAAE;EAC7C;;;;;;;;;;;;;;;;;;;;;;EAsBI,SAASO,QAAO;AACZ,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,UAAUA;IACtB,CAAS;EACT;EACI,KAAK,MAAM;AACP,UAAM,QAAQ,CAAA;AACd,eAAWP,QAAO,UAAU,KAAK,WAAW,IAAI,GAAG;AAC/C,UAAI,KAAKA,IAAG,KAAK,KAAK,MAAMA,IAAG,GAAG;AAC9B,cAAMA,IAAG,IAAI,KAAK,MAAMA,IAAG;MAC3C;IACA;AACQ,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,OAAO,MAAM;IACzB,CAAS;EACT;EACI,KAAK,MAAM;AACP,UAAM,QAAQ,CAAA;AACd,eAAWA,QAAO,UAAU,KAAK,WAAW,KAAK,KAAK,GAAG;AACrD,UAAI,CAAC,KAAKA,IAAG,GAAG;AACZ,cAAMA,IAAG,IAAI,KAAK,MAAMA,IAAG;MAC3C;IACA;AACQ,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,OAAO,MAAM;IACzB,CAAS;EACT;;;;EAII,cAAc;AACV,WAAO,eAAe,IAAI;EAClC;EACI,QAAQ,MAAM;AACV,UAAM,WAAW,CAAA;AACjB,eAAWA,QAAO,UAAU,KAAK,WAAW,KAAK,KAAK,GAAG;AACrD,YAAM,cAAc,KAAK,MAAMA,IAAG;AAClC,UAAI,QAAQ,CAAC,KAAKA,IAAG,GAAG;AACpB,iBAASA,IAAG,IAAI;MAChC,OACiB;AACD,iBAASA,IAAG,IAAI,YAAY,SAAQ;MACpD;IACA;AACQ,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,OAAO,MAAM;IACzB,CAAS;EACT;EACI,SAAS,MAAM;AACX,UAAM,WAAW,CAAA;AACjB,eAAWA,QAAO,UAAU,KAAK,WAAW,KAAK,KAAK,GAAG;AACrD,UAAI,QAAQ,CAAC,KAAKA,IAAG,GAAG;AACpB,iBAASA,IAAG,IAAI,KAAK,MAAMA,IAAG;MAC9C,OACiB;AACD,cAAM,cAAc,KAAK,MAAMA,IAAG;AAClC,YAAI,WAAW;AACf,eAAO,oBAAoB,aAAa;AACpC,qBAAW,SAAS,KAAK;QAC7C;AACgB,iBAASA,IAAG,IAAI;MAChC;IACA;AACQ,WAAO,IAAI,WAAU;MACjB,GAAG,KAAK;MACR,OAAO,MAAM;IACzB,CAAS;EACT;EACI,QAAQ;AACJ,WAAO,cAAc,UAAU,KAAK,WAAW,KAAK,KAAK,CAAC;EAClE;AACA;AACiB,MAAA,YAAG;AACpB,UAAU,SAAS,CAAC,OAAO,WAAW;AAClC,SAAO,IAAI,UAAU;IACjB,OAAO,MAAM;IACb,aAAa;IACb,UAAU,SAAS,OAAM;IACzB,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,UAAU,eAAe,CAAC,OAAO,WAAW;AACxC,SAAO,IAAI,UAAU;IACjB,OAAO,MAAM;IACb,aAAa;IACb,UAAU,SAAS,OAAM;IACzB,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,UAAU,aAAa,CAAC,OAAO,WAAW;AACtC,SAAO,IAAI,UAAU;IACjB;IACA,aAAa;IACb,UAAU,SAAS,OAAM;IACzB,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,WAAN,cAAuB,QAAQ;EAC3B,OAAO,OAAO;AACV,UAAM,EAAE,IAAG,IAAK,KAAK,oBAAoB,KAAK;AAC9C,UAAM,UAAU,KAAK,KAAK;AAC1B,aAAS,cAAc,SAAS;AAE5B,iBAAW,UAAU,SAAS;AAC1B,YAAI,OAAO,OAAO,WAAW,SAAS;AAClC,iBAAO,OAAO;QAClC;MACA;AACY,iBAAW,UAAU,SAAS;AAC1B,YAAI,OAAO,OAAO,WAAW,SAAS;AAElC,cAAI,OAAO,OAAO,KAAK,GAAG,OAAO,IAAI,OAAO,MAAM;AAClD,iBAAO,OAAO;QAClC;MACA;AAEY,YAAM,cAAc,QAAQ,IAAI,CAAC,WAAW,IAAI,cAAc,SAAS,OAAO,IAAI,OAAO,MAAM,CAAC;AAChG,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC;MAChB,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,IAAI,QAAQ,IAAI,OAAO,WAAW;AAC7C,cAAM,WAAW;UACb,GAAG;UACH,QAAQ;YACJ,GAAG,IAAI;YACP,QAAQ,CAAA;UAChC;UACoB,QAAQ;QAC5B;AACgB,eAAO;UACH,QAAQ,MAAM,OAAO,YAAY;YAC7B,MAAM,IAAI;YACV,MAAM,IAAI;YACV,QAAQ;UAChC,CAAqB;UACD,KAAK;QACzB;MACA,CAAa,CAAC,EAAE,KAAK,aAAa;IAClC,OACa;AACD,UAAI,QAAQ;AACZ,YAAM,SAAS,CAAA;AACf,iBAAW,UAAU,SAAS;AAC1B,cAAM,WAAW;UACb,GAAG;UACH,QAAQ;YACJ,GAAG,IAAI;YACP,QAAQ,CAAA;UAChC;UACoB,QAAQ;QAC5B;AACgB,cAAM,SAAS,OAAO,WAAW;UAC7B,MAAM,IAAI;UACV,MAAM,IAAI;UACV,QAAQ;QAC5B,CAAiB;AACD,YAAI,OAAO,WAAW,SAAS;AAC3B,iBAAO;QAC3B,WACyB,OAAO,WAAW,WAAW,CAAC,OAAO;AAC1C,kBAAQ,EAAE,QAAQ,KAAK,SAAQ;QACnD;AACgB,YAAI,SAAS,OAAO,OAAO,QAAQ;AAC/B,iBAAO,KAAK,SAAS,OAAO,MAAM;QACtD;MACA;AACY,UAAI,OAAO;AACP,YAAI,OAAO,OAAO,KAAK,GAAG,MAAM,IAAI,OAAO,MAAM;AACjD,eAAO,MAAM;MAC7B;AACY,YAAM,cAAc,OAAO,IAAI,CAACyc,YAAW,IAAI,cAAc,SAASA,OAAM,CAAC;AAC7E,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC;MAChB,CAAa;AACD,aAAO,eAAe;IAClC;EACA;EACI,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;EACzB;AACA;AACgB,MAAA,WAAG;AACnB,SAAS,SAAS,CAAC3c,QAAO,WAAW;AACjC,SAAO,IAAI,SAAS;IAChB,SAASA;IACT,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AAQA,IAAM,mBAAmB,CAACD,UAAS;AAC/B,MAAIA,iBAAgB,SAAS;AACzB,WAAO,iBAAiBA,MAAK,MAAM;EAC3C,WACaA,iBAAgB,YAAY;AACjC,WAAO,iBAAiBA,MAAK,UAAS,CAAE;EAChD,WACaA,iBAAgB,YAAY;AACjC,WAAO,CAACA,MAAK,KAAK;EAC1B,WACaA,iBAAgB,SAAS;AAC9B,WAAOA,MAAK;EACpB,WACaA,iBAAgB,eAAe;AAEpC,WAAO,UAAU,KAAK,aAAaA,MAAK,IAAI;EACpD,WACaA,iBAAgB,YAAY;AACjC,WAAO,iBAAiBA,MAAK,KAAK,SAAS;EACnD,WACaA,iBAAgB,cAAc;AACnC,WAAO,CAAC,MAAS;EACzB,WACaA,iBAAgB,SAAS;AAC9B,WAAO,CAAC,IAAI;EACpB,WACaA,iBAAgB,aAAa;AAClC,WAAO,CAAC,QAAW,GAAG,iBAAiBA,MAAK,OAAM,CAAE,CAAC;EAC7D,WACaA,iBAAgB,aAAa;AAClC,WAAO,CAAC,MAAM,GAAG,iBAAiBA,MAAK,OAAM,CAAE,CAAC;EACxD,WACaA,iBAAgB,YAAY;AACjC,WAAO,iBAAiBA,MAAK,OAAM,CAAE;EAC7C,WACaA,iBAAgB,aAAa;AAClC,WAAO,iBAAiBA,MAAK,OAAM,CAAE;EAC7C,WACaA,iBAAgB,UAAU;AAC/B,WAAO,iBAAiBA,MAAK,KAAK,SAAS;EACnD,OACS;AACD,WAAO,CAAA;EACf;AACA;AACA,IAAM,wBAAN,MAAM,+BAA8B,QAAQ;EACxC,OAAO,OAAO;AACV,UAAM,EAAE,IAAG,IAAK,KAAK,oBAAoB,KAAK;AAC9C,QAAI,IAAI,eAAe,UAAU,cAAc,QAAQ;AACnD,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,UAAM,gBAAgB,KAAK;AAC3B,UAAM,qBAAqB,IAAI,KAAK,aAAa;AACjD,UAAM,SAAS,KAAK,WAAW,IAAI,kBAAkB;AACrD,QAAI,CAAC,QAAQ;AACT,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,SAAS,MAAM,KAAK,KAAK,WAAW,KAAI,CAAE;QAC1C,MAAM,CAAC,aAAa;MACpC,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,OAAO,YAAY;QACtB,MAAM,IAAI;QACV,MAAM,IAAI;QACV,QAAQ;MACxB,CAAa;IACb,OACa;AACD,aAAO,OAAO,WAAW;QACrB,MAAM,IAAI;QACV,MAAM,IAAI;QACV,QAAQ;MACxB,CAAa;IACb;EACA;EACI,IAAI,gBAAgB;AAChB,WAAO,KAAK,KAAK;EACzB;EACI,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;EACzB;EACI,IAAI,aAAa;AACb,WAAO,KAAK,KAAK;EACzB;;;;;;;;;EASI,OAAO,OAAO,eAAe,SAAS,QAAQ;AAE1C,UAAM,aAAa,oBAAI,IAAG;AAE1B,eAAWA,SAAQ,SAAS;AACxB,YAAM,sBAAsB,iBAAiBA,MAAK,MAAM,aAAa,CAAC;AACtE,UAAI,CAAC,oBAAoB,QAAQ;AAC7B,cAAM,IAAI,MAAM,mCAAmC,aAAa,mDAAmD;MACnI;AACY,iBAAW,SAAS,qBAAqB;AACrC,YAAI,WAAW,IAAI,KAAK,GAAG;AACvB,gBAAM,IAAI,MAAM,0BAA0B,OAAO,aAAa,CAAC,wBAAwB,OAAO,KAAK,CAAC,EAAE;QAC1H;AACgB,mBAAW,IAAI,OAAOA,KAAI;MAC1C;IACA;AACQ,WAAO,IAAI,uBAAsB;MAC7B,UAAU,sBAAsB;MAChC;MACA;MACA;MACA,GAAG,oBAAoB,MAAM;IACzC,CAAS;EACT;AACA;AAC6B,MAAA,wBAAG;AAChC,SAAS,YAAY,GAAG,GAAG;AACvB,QAAM,SAAQ,GAAI,UAAU,eAAe,CAAC;AAC5C,QAAM,SAAQ,GAAI,UAAU,eAAe,CAAC;AAC5C,MAAI,MAAM,GAAG;AACT,WAAO,EAAE,OAAO,MAAM,MAAM,EAAC;EACrC,WACa,UAAU,UAAU,cAAc,UAAU,UAAU,UAAU,cAAc,QAAQ;AAC3F,UAAM,QAAQ,UAAU,KAAK,WAAW,CAAC;AACzC,UAAM,aAAa,UAAU,KAAK,WAAW,CAAC,EAAE,OAAO,CAACG,SAAQ,MAAM,QAAQA,IAAG,MAAM,EAAE;AACzF,UAAM,SAAS,EAAE,GAAG,GAAG,GAAG,EAAC;AAC3B,eAAWA,QAAO,YAAY;AAC1B,YAAM,cAAc,YAAY,EAAEA,IAAG,GAAG,EAAEA,IAAG,CAAC;AAC9C,UAAI,CAAC,YAAY,OAAO;AACpB,eAAO,EAAE,OAAO,MAAK;MACrC;AACY,aAAOA,IAAG,IAAI,YAAY;IACtC;AACQ,WAAO,EAAE,OAAO,MAAM,MAAM,OAAM;EAC1C,WACa,UAAU,UAAU,cAAc,SAAS,UAAU,UAAU,cAAc,OAAO;AACzF,QAAI,EAAE,WAAW,EAAE,QAAQ;AACvB,aAAO,EAAE,OAAO,MAAK;IACjC;AACQ,UAAM,WAAW,CAAA;AACjB,aAASO,SAAQ,GAAGA,SAAQ,EAAE,QAAQA,UAAS;AAC3C,YAAM,QAAQ,EAAEA,MAAK;AACrB,YAAM,QAAQ,EAAEA,MAAK;AACrB,YAAM,cAAc,YAAY,OAAO,KAAK;AAC5C,UAAI,CAAC,YAAY,OAAO;AACpB,eAAO,EAAE,OAAO,MAAK;MACrC;AACY,eAAS,KAAK,YAAY,IAAI;IAC1C;AACQ,WAAO,EAAE,OAAO,MAAM,MAAM,SAAQ;EAC5C,WACa,UAAU,UAAU,cAAc,QAAQ,UAAU,UAAU,cAAc,QAAQ,CAAC,MAAM,CAAC,GAAG;AACpG,WAAO,EAAE,OAAO,MAAM,MAAM,EAAC;EACrC,OACS;AACD,WAAO,EAAE,OAAO,MAAK;EAC7B;AACA;AACA,IAAM,kBAAN,cAA8B,QAAQ;EAClC,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAG,IAAK,KAAK,oBAAoB,KAAK;AACtD,UAAM,eAAe,CAAC,YAAY,gBAAgB;AAC9C,WAAI,GAAI,eAAe,WAAW,UAAU,MAAK,GAAI,eAAe,WAAW,WAAW,GAAG;AACzF,eAAO,eAAe;MACtC;AACY,YAAM,SAAS,YAAY,WAAW,OAAO,YAAY,KAAK;AAC9D,UAAI,CAAC,OAAO,OAAO;AACf,SAAA,GAAI,eAAe,mBAAmB,KAAK;UACvC,MAAM,cAAc,aAAa;QACrD,CAAiB;AACD,eAAO,eAAe;MACtC;AACY,WAAI,GAAI,eAAe,SAAS,UAAU,MAAK,GAAI,eAAe,SAAS,WAAW,GAAG;AACrF,eAAO,MAAK;MAC5B;AACY,aAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,OAAO,KAAI;IAC7D;AACQ,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,IAAI;QACf,KAAK,KAAK,KAAK,YAAY;UACvB,MAAM,IAAI;UACV,MAAM,IAAI;UACV,QAAQ;QAC5B,CAAiB;QACD,KAAK,KAAK,MAAM,YAAY;UACxB,MAAM,IAAI;UACV,MAAM,IAAI;UACV,QAAQ;QAC5B,CAAiB;MACjB,CAAa,EAAE,KAAK,CAAC,CAAC,MAAM,KAAK,MAAM,aAAa,MAAM,KAAK,CAAC;IAChE,OACa;AACD,aAAO,aAAa,KAAK,KAAK,KAAK,WAAW;QAC1C,MAAM,IAAI;QACV,MAAM,IAAI;QACV,QAAQ;MACxB,CAAa,GAAG,KAAK,KAAK,MAAM,WAAW;QAC3B,MAAM,IAAI;QACV,MAAM,IAAI;QACV,QAAQ;MACxB,CAAa,CAAC;IACd;EACA;AACA;AACuB,MAAA,kBAAG;AAC1B,gBAAgB,SAAS,CAAC,MAAM,OAAO,WAAW;AAC9C,SAAO,IAAI,gBAAgB;IACvB;IACA;IACA,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AAEA,IAAM,WAAN,MAAM,kBAAiB,QAAQ;EAC3B,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAG,IAAK,KAAK,oBAAoB,KAAK;AACtD,QAAI,IAAI,eAAe,UAAU,cAAc,OAAO;AAClD,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,QAAI,IAAI,KAAK,SAAS,KAAK,KAAK,MAAM,QAAQ;AAC1C,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,SAAS,KAAK,KAAK,MAAM;QACzB,WAAW;QACX,OAAO;QACP,MAAM;MACtB,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,UAAM,OAAO,KAAK,KAAK;AACvB,QAAI,CAAC,QAAQ,IAAI,KAAK,SAAS,KAAK,KAAK,MAAM,QAAQ;AACnD,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,SAAS,KAAK,KAAK,MAAM;QACzB,WAAW;QACX,OAAO;QACP,MAAM;MACtB,CAAa;AACD,aAAO,MAAK;IACxB;AACQ,UAAM,QAAQ,CAAC,GAAG,IAAI,IAAI,EACrB,IAAI,CAAC,MAAM,cAAc;AAC1B,YAAM,SAAS,KAAK,KAAK,MAAM,SAAS,KAAK,KAAK,KAAK;AACvD,UAAI,CAAC;AACD,eAAO;AACX,aAAO,OAAO,OAAO,IAAI,mBAAmB,KAAK,MAAM,IAAI,MAAM,SAAS,CAAC;IACvF,CAAS,EACI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AACtB,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,IAAI,KAAK,EAAE,KAAK,CAAC,YAAY;AACxC,eAAO,eAAe,YAAY,WAAW,QAAQ,OAAO;MAC5E,CAAa;IACb,OACa;AACD,aAAO,eAAe,YAAY,WAAW,QAAQ,KAAK;IACtE;EACA;EACI,IAAI,QAAQ;AACR,WAAO,KAAK,KAAK;EACzB;EACI,KAAK,MAAM;AACP,WAAO,IAAI,UAAS;MAChB,GAAG,KAAK;MACR;IACZ,CAAS;EACT;AACA;AACgB,MAAA,WAAG;AACnB,SAAS,SAAS,CAAC,SAAS,WAAW;AACnC,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AACzB,UAAM,IAAI,MAAM,uDAAuD;EAC/E;AACI,SAAO,IAAI,SAAS;IAChB,OAAO;IACP,UAAU,sBAAsB;IAChC,MAAM;IACN,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,YAAN,MAAM,mBAAkB,QAAQ;EAC5B,IAAI,YAAY;AACZ,WAAO,KAAK,KAAK;EACzB;EACI,IAAI,cAAc;AACd,WAAO,KAAK,KAAK;EACzB;EACI,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAG,IAAK,KAAK,oBAAoB,KAAK;AACtD,QAAI,IAAI,eAAe,UAAU,cAAc,QAAQ;AACnD,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,UAAM,QAAQ,CAAA;AACd,UAAM,UAAU,KAAK,KAAK;AAC1B,UAAM,YAAY,KAAK,KAAK;AAC5B,eAAWP,QAAO,IAAI,MAAM;AACxB,YAAM,KAAK;QACP,KAAK,QAAQ,OAAO,IAAI,mBAAmB,KAAKA,MAAK,IAAI,MAAMA,IAAG,CAAC;QACnE,OAAO,UAAU,OAAO,IAAI,mBAAmB,KAAK,IAAI,KAAKA,IAAG,GAAG,IAAI,MAAMA,IAAG,CAAC;QACjF,WAAWA,QAAO,IAAI;MACtC,CAAa;IACb;AACQ,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,eAAe,YAAY,iBAAiB,QAAQ,KAAK;IAC5E,OACa;AACD,aAAO,eAAe,YAAY,gBAAgB,QAAQ,KAAK;IAC3E;EACA;EACI,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;EACzB;EACI,OAAO,OAAO,OAAO,QAAQ,OAAO;AAChC,QAAI,kBAAkB,SAAS;AAC3B,aAAO,IAAI,WAAU;QACjB,SAAS;QACT,WAAW;QACX,UAAU,sBAAsB;QAChC,GAAG,oBAAoB,KAAK;MAC5C,CAAa;IACb;AACQ,WAAO,IAAI,WAAU;MACjB,SAAS,UAAU,OAAM;MACzB,WAAW;MACX,UAAU,sBAAsB;MAChC,GAAG,oBAAoB,MAAM;IACzC,CAAS;EACT;AACA;AACiB,MAAA,YAAG;AACpB,IAAM,SAAN,cAAqB,QAAQ;EACzB,IAAI,YAAY;AACZ,WAAO,KAAK,KAAK;EACzB;EACI,IAAI,cAAc;AACd,WAAO,KAAK,KAAK;EACzB;EACI,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAG,IAAK,KAAK,oBAAoB,KAAK;AACtD,QAAI,IAAI,eAAe,UAAU,cAAc,KAAK;AAChD,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,UAAM,UAAU,KAAK,KAAK;AAC1B,UAAM,YAAY,KAAK,KAAK;AAC5B,UAAM,QAAQ,CAAC,GAAG,IAAI,KAAK,QAAO,CAAE,EAAE,IAAI,CAAC,CAACA,MAAK,KAAK,GAAGO,WAAU;AAC/D,aAAO;QACH,KAAK,QAAQ,OAAO,IAAI,mBAAmB,KAAKP,MAAK,IAAI,MAAM,CAACO,QAAO,KAAK,CAAC,CAAC;QAC9E,OAAO,UAAU,OAAO,IAAI,mBAAmB,KAAK,OAAO,IAAI,MAAM,CAACA,QAAO,OAAO,CAAC,CAAC;MACtG;IACA,CAAS;AACD,QAAI,IAAI,OAAO,OAAO;AAClB,YAAM,WAAW,oBAAI,IAAG;AACxB,aAAO,QAAQ,QAAO,EAAG,KAAK,YAAY;AACtC,mBAAW,QAAQ,OAAO;AACtB,gBAAMP,OAAM,MAAM,KAAK;AACvB,gBAAM,QAAQ,MAAM,KAAK;AACzB,cAAIA,KAAI,WAAW,aAAa,MAAM,WAAW,WAAW;AACxD,mBAAO,eAAe;UAC9C;AACoB,cAAIA,KAAI,WAAW,WAAW,MAAM,WAAW,SAAS;AACpD,mBAAO,MAAK;UACpC;AACoB,mBAAS,IAAIA,KAAI,OAAO,MAAM,KAAK;QACvD;AACgB,eAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,SAAQ;MAC9D,CAAa;IACb,OACa;AACD,YAAM,WAAW,oBAAI,IAAG;AACxB,iBAAW,QAAQ,OAAO;AACtB,cAAMA,OAAM,KAAK;AACjB,cAAM,QAAQ,KAAK;AACnB,YAAIA,KAAI,WAAW,aAAa,MAAM,WAAW,WAAW;AACxD,iBAAO,eAAe;QAC1C;AACgB,YAAIA,KAAI,WAAW,WAAW,MAAM,WAAW,SAAS;AACpD,iBAAO,MAAK;QAChC;AACgB,iBAAS,IAAIA,KAAI,OAAO,MAAM,KAAK;MACnD;AACY,aAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,SAAQ;IAC1D;EACA;AACA;AACc,MAAA,SAAG;AACjB,OAAO,SAAS,CAAC,SAAS,WAAW,WAAW;AAC5C,SAAO,IAAI,OAAO;IACd;IACA;IACA,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,SAAN,MAAM,gBAAe,QAAQ;EACzB,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAG,IAAK,KAAK,oBAAoB,KAAK;AACtD,QAAI,IAAI,eAAe,UAAU,cAAc,KAAK;AAChD,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,UAAM0Y,OAAM,KAAK;AACjB,QAAIA,KAAI,YAAY,MAAM;AACtB,UAAI,IAAI,KAAK,OAAOA,KAAI,QAAQ,OAAO;AACnC,SAAA,GAAI,eAAe,mBAAmB,KAAK;UACvC,MAAM,cAAc,aAAa;UACjC,SAASA,KAAI,QAAQ;UACrB,MAAM;UACN,WAAW;UACX,OAAO;UACP,SAASA,KAAI,QAAQ;QACzC,CAAiB;AACD,eAAO,MAAK;MAC5B;IACA;AACQ,QAAIA,KAAI,YAAY,MAAM;AACtB,UAAI,IAAI,KAAK,OAAOA,KAAI,QAAQ,OAAO;AACnC,SAAA,GAAI,eAAe,mBAAmB,KAAK;UACvC,MAAM,cAAc,aAAa;UACjC,SAASA,KAAI,QAAQ;UACrB,MAAM;UACN,WAAW;UACX,OAAO;UACP,SAASA,KAAI,QAAQ;QACzC,CAAiB;AACD,eAAO,MAAK;MAC5B;IACA;AACQ,UAAM,YAAY,KAAK,KAAK;AAC5B,aAAS,YAAYgE,WAAU;AAC3B,YAAM,YAAY,oBAAI,IAAG;AACzB,iBAAW,WAAWA,WAAU;AAC5B,YAAI,QAAQ,WAAW;AACnB,iBAAO,eAAe;AAC1B,YAAI,QAAQ,WAAW;AACnB,iBAAO,MAAK;AAChB,kBAAU,IAAI,QAAQ,KAAK;MAC3C;AACY,aAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,UAAS;IAC3D;AACQ,UAAM,WAAW,CAAC,GAAG,IAAI,KAAK,OAAM,CAAE,EAAE,IAAI,CAAC,MAAM,MAAM,UAAU,OAAO,IAAI,mBAAmB,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC;AACzH,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,IAAI,QAAQ,EAAE,KAAK,CAACA,cAAa,YAAYA,SAAQ,CAAC;IACjF,OACa;AACD,aAAO,YAAY,QAAQ;IACvC;EACA;EACI,IAAI,SAAS,SAAS;AAClB,WAAO,IAAI,QAAO;MACd,GAAG,KAAK;MACR,SAAS,EAAE,OAAO,SAAS,SAAS,eAAe,UAAU,SAAS,OAAO,EAAC;IAC1F,CAAS;EACT;EACI,IAAI,SAAS,SAAS;AAClB,WAAO,IAAI,QAAO;MACd,GAAG,KAAK;MACR,SAAS,EAAE,OAAO,SAAS,SAAS,eAAe,UAAU,SAAS,OAAO,EAAC;IAC1F,CAAS;EACT;EACI,KAAK,MAAM,SAAS;AAChB,WAAO,KAAK,IAAI,MAAM,OAAO,EAAE,IAAI,MAAM,OAAO;EACxD;EACI,SAAS,SAAS;AACd,WAAO,KAAK,IAAI,GAAG,OAAO;EAClC;AACA;AACc,MAAA,SAAG;AACjB,OAAO,SAAS,CAAC,WAAW,WAAW;AACnC,SAAO,IAAI,OAAO;IACd;IACA,SAAS;IACT,SAAS;IACT,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,cAAN,MAAM,qBAAoB,QAAQ;EAC9B,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,WAAW,KAAK;EAC7B;EACI,OAAO,OAAO;AACV,UAAM,EAAE,IAAG,IAAK,KAAK,oBAAoB,KAAK;AAC9C,QAAI,IAAI,eAAe,UAAU,cAAc,UAAU;AACrD,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,aAAS,cAAc,MAAMrY,QAAO;AAChC,cAAO,GAAI,eAAe,WAAW;QACjC,MAAM;QACN,MAAM,IAAI;QACV,WAAW,CAAC,IAAI,OAAO,oBAAoB,IAAI,iBAAgB,GAAI,YAAY,aAAW,GAAK,YAAY,eAAe,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7I,WAAW;UACP,MAAM,cAAc,aAAa;UACjC,gBAAgBA;QACpC;MACA,CAAa;IACb;AACQ,aAAS,iBAAiB,SAASA,QAAO;AACtC,cAAO,GAAI,eAAe,WAAW;QACjC,MAAM;QACN,MAAM,IAAI;QACV,WAAW,CAAC,IAAI,OAAO,oBAAoB,IAAI,iBAAgB,GAAI,YAAY,aAAW,GAAK,YAAY,eAAe,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7I,WAAW;UACP,MAAM,cAAc,aAAa;UACjC,iBAAiBA;QACrC;MACA,CAAa;IACb;AACQ,UAAM,SAAS,EAAE,UAAU,IAAI,OAAO,mBAAkB;AACxD,UAAM,KAAK,IAAI;AACf,QAAI,KAAK,KAAK,mBAAmB,YAAY;AAIzC,YAAM,KAAK;AACX,cAAO,GAAI,eAAe,IAAI,kBAAmB,MAAM;AACnD,cAAMA,SAAQ,IAAI,cAAc,SAAS,CAAA,CAAE;AAC3C,cAAM,aAAa,MAAM,GAAG,KAAK,KAAK,WAAW,MAAM,MAAM,EAAE,MAAM,CAAC,MAAM;AACxE,UAAAA,OAAM,SAAS,cAAc,MAAM,CAAC,CAAC;AACrC,gBAAMA;QAC1B,CAAiB;AACD,cAAM,SAAS,MAAM,QAAQ,MAAM,IAAI,MAAM,UAAU;AACvD,cAAM,gBAAgB,MAAM,GAAG,KAAK,QAAQ,KAAK,KAC5C,WAAW,QAAQ,MAAM,EACzB,MAAM,CAAC,MAAM;AACd,UAAAA,OAAM,SAAS,iBAAiB,QAAQ,CAAC,CAAC;AAC1C,gBAAMA;QAC1B,CAAiB;AACD,eAAO;MACvB,CAAa;IACb,OACa;AAID,YAAM,KAAK;AACX,cAAO,GAAI,eAAe,IAAI,YAAa,MAAM;AAC7C,cAAM,aAAa,GAAG,KAAK,KAAK,UAAU,MAAM,MAAM;AACtD,YAAI,CAAC,WAAW,SAAS;AACrB,gBAAM,IAAI,cAAc,SAAS,CAAC,cAAc,MAAM,WAAW,KAAK,CAAC,CAAC;QAC5F;AACgB,cAAM,SAAS,QAAQ,MAAM,IAAI,MAAM,WAAW,IAAI;AACtD,cAAM,gBAAgB,GAAG,KAAK,QAAQ,UAAU,QAAQ,MAAM;AAC9D,YAAI,CAAC,cAAc,SAAS;AACxB,gBAAM,IAAI,cAAc,SAAS,CAAC,iBAAiB,QAAQ,cAAc,KAAK,CAAC,CAAC;QACpG;AACgB,eAAO,cAAc;MACrC,CAAa;IACb;EACA;EACI,aAAa;AACT,WAAO,KAAK,KAAK;EACzB;EACI,aAAa;AACT,WAAO,KAAK,KAAK;EACzB;EACI,QAAQ,OAAO;AACX,WAAO,IAAI,aAAY;MACnB,GAAG,KAAK;MACR,MAAM,SAAS,OAAO,KAAK,EAAE,KAAK,WAAW,OAAM,CAAE;IACjE,CAAS;EACT;EACI,QAAQ,YAAY;AAChB,WAAO,IAAI,aAAY;MACnB,GAAG,KAAK;MACR,SAAS;IACrB,CAAS;EACT;EACI,UAAU,MAAM;AACZ,UAAM,gBAAgB,KAAK,MAAM,IAAI;AACrC,WAAO;EACf;EACI,gBAAgB,MAAM;AAClB,UAAM,gBAAgB,KAAK,MAAM,IAAI;AACrC,WAAO;EACf;EACI,OAAO,OAAO,MAAM,SAAS,QAAQ;AACjC,WAAO,IAAI,aAAY;MACnB,MAAO,OAAO,OAAO,SAAS,OAAO,CAAA,CAAE,EAAE,KAAK,WAAW,OAAM,CAAE;MACjE,SAAS,WAAW,WAAW,OAAM;MACrC,UAAU,sBAAsB;MAChC,GAAG,oBAAoB,MAAM;IACzC,CAAS;EACT;AACA;AACmB,MAAA,cAAG;AACtB,IAAM,UAAN,cAAsB,QAAQ;EAC1B,IAAI,SAAS;AACT,WAAO,KAAK,KAAK,OAAM;EAC/B;EACI,OAAO,OAAO;AACV,UAAM,EAAE,IAAG,IAAK,KAAK,oBAAoB,KAAK;AAC9C,UAAM,aAAa,KAAK,KAAK,OAAM;AACnC,WAAO,WAAW,OAAO,EAAE,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAG,CAAE;EAChF;AACA;AACe,MAAA,UAAG;AAClB,QAAQ,SAAS,CAAC,QAAQ,WAAW;AACjC,SAAO,IAAI,QAAQ;IACf;IACA,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,aAAN,cAAyB,QAAQ;EAC7B,OAAO,OAAO;AACV,QAAI,MAAM,SAAS,KAAK,KAAK,OAAO;AAChC,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,UAAU,IAAI;QACd,MAAM,cAAc,aAAa;QACjC,UAAU,KAAK,KAAK;MACpC,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,WAAO,EAAE,QAAQ,SAAS,OAAO,MAAM,KAAI;EACnD;EACI,IAAI,QAAQ;AACR,WAAO,KAAK,KAAK;EACzB;AACA;AACkB,MAAA,aAAG;AACrB,WAAW,SAAS,CAAC,OAAO,WAAW;AACnC,SAAO,IAAI,WAAW;IAClB;IACA,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,SAAS,cAAc,QAAQ,QAAQ;AACnC,SAAO,IAAI,QAAQ;IACf;IACA,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,UAAN,MAAM,iBAAgB,QAAQ;EAC1B,OAAO,OAAO;AACV,QAAI,OAAO,MAAM,SAAS,UAAU;AAChC,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,YAAM,iBAAiB,KAAK,KAAK;AACjC,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,UAAU,UAAU,KAAK,WAAW,cAAc;QAClD,UAAU,IAAI;QACd,MAAM,cAAc,aAAa;MACjD,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,QAAI,CAAC,KAAK,QAAQ;AACd,WAAK,SAAS,IAAI,IAAI,KAAK,KAAK,MAAM;IAClD;AACQ,QAAI,CAAC,KAAK,OAAO,IAAI,MAAM,IAAI,GAAG;AAC9B,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,YAAM,iBAAiB,KAAK,KAAK;AACjC,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,UAAU,IAAI;QACd,MAAM,cAAc,aAAa;QACjC,SAAS;MACzB,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,YAAO,GAAI,eAAe,IAAI,MAAM,IAAI;EAChD;EACI,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;EACzB;EACI,IAAI,OAAO;AACP,UAAM,aAAa,CAAA;AACnB,eAAW,OAAO,KAAK,KAAK,QAAQ;AAChC,iBAAW,GAAG,IAAI;IAC9B;AACQ,WAAO;EACf;EACI,IAAI,SAAS;AACT,UAAM,aAAa,CAAA;AACnB,eAAW,OAAO,KAAK,KAAK,QAAQ;AAChC,iBAAW,GAAG,IAAI;IAC9B;AACQ,WAAO;EACf;EACI,IAAI,OAAO;AACP,UAAM,aAAa,CAAA;AACnB,eAAW,OAAO,KAAK,KAAK,QAAQ;AAChC,iBAAW,GAAG,IAAI;IAC9B;AACQ,WAAO;EACf;EACI,QAAQ,QAAQ,SAAS,KAAK,MAAM;AAChC,WAAO,SAAQ,OAAO,QAAQ;MAC1B,GAAG,KAAK;MACR,GAAG;IACf,CAAS;EACT;EACI,QAAQ,QAAQ,SAAS,KAAK,MAAM;AAChC,WAAO,SAAQ,OAAO,KAAK,QAAQ,OAAO,CAAC,QAAQ,CAAC,OAAO,SAAS,GAAG,CAAC,GAAG;MACvE,GAAG,KAAK;MACR,GAAG;IACf,CAAS;EACT;AACA;AACe,MAAA,UAAG;AAClB,QAAQ,SAAS;AACjB,IAAM,gBAAN,cAA4B,QAAQ;EAChC,OAAO,OAAO;AACV,UAAM,mBAAmB,UAAU,KAAK,mBAAmB,KAAK,KAAK,MAAM;AAC3E,UAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,QAAI,IAAI,eAAe,UAAU,cAAc,UAAU,IAAI,eAAe,UAAU,cAAc,QAAQ;AACxG,YAAM,iBAAiB,UAAU,KAAK,aAAa,gBAAgB;AACnE,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,UAAU,UAAU,KAAK,WAAW,cAAc;QAClD,UAAU,IAAI;QACd,MAAM,cAAc,aAAa;MACjD,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,QAAI,CAAC,KAAK,QAAQ;AACd,WAAK,SAAS,IAAI,IAAI,UAAU,KAAK,mBAAmB,KAAK,KAAK,MAAM,CAAC;IACrF;AACQ,QAAI,CAAC,KAAK,OAAO,IAAI,MAAM,IAAI,GAAG;AAC9B,YAAM,iBAAiB,UAAU,KAAK,aAAa,gBAAgB;AACnE,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,UAAU,IAAI;QACd,MAAM,cAAc,aAAa;QACjC,SAAS;MACzB,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,YAAO,GAAI,eAAe,IAAI,MAAM,IAAI;EAChD;EACI,IAAI,OAAO;AACP,WAAO,KAAK,KAAK;EACzB;AACA;AACqB,MAAA,gBAAG;AACxB,cAAc,SAAS,CAAC,QAAQ,WAAW;AACvC,SAAO,IAAI,cAAc;IACrB;IACA,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,aAAN,cAAyB,QAAQ;EAC7B,SAAS;AACL,WAAO,KAAK,KAAK;EACzB;EACI,OAAO,OAAO;AACV,UAAM,EAAE,IAAG,IAAK,KAAK,oBAAoB,KAAK;AAC9C,QAAI,IAAI,eAAe,UAAU,cAAc,WAAW,IAAI,OAAO,UAAU,OAAO;AAClF,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,UAAM,cAAc,IAAI,eAAe,UAAU,cAAc,UAAU,IAAI,OAAO,QAAQ,QAAQ,IAAI,IAAI;AAC5G,YAAO,GAAI,eAAe,IAAI,YAAY,KAAK,CAAC,SAAS;AACrD,aAAO,KAAK,KAAK,KAAK,WAAW,MAAM;QACnC,MAAM,IAAI;QACV,UAAU,IAAI,OAAO;MACrC,CAAa;IACb,CAAS,CAAC;EACV;AACA;AACkB,MAAA,aAAG;AACrB,WAAW,SAAS,CAAC,QAAQ,WAAW;AACpC,SAAO,IAAI,WAAW;IAClB,MAAM;IACN,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,aAAN,cAAyB,QAAQ;EAC7B,YAAY;AACR,WAAO,KAAK,KAAK;EACzB;EACI,aAAa;AACT,WAAO,KAAK,KAAK,OAAO,KAAK,aAAa,sBAAsB,aAC1D,KAAK,KAAK,OAAO,WAAU,IAC3B,KAAK,KAAK;EACxB;EACI,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAG,IAAK,KAAK,oBAAoB,KAAK;AACtD,UAAM,SAAS,KAAK,KAAK,UAAU;AACnC,UAAM,WAAW;MACb,UAAU,CAAC,QAAQ;AACf,SAAA,GAAI,eAAe,mBAAmB,KAAK,GAAG;AAC9C,YAAI,IAAI,OAAO;AACX,iBAAO,MAAK;QAChC,OACqB;AACD,iBAAO,MAAK;QAChC;MACA;MACY,IAAI,OAAO;AACP,eAAO,IAAI;MAC3B;IACA;AACQ,aAAS,WAAW,SAAS,SAAS,KAAK,QAAQ;AACnD,QAAI,OAAO,SAAS,cAAc;AAC9B,YAAM,YAAY,OAAO,UAAU,IAAI,MAAM,QAAQ;AACrD,UAAI,IAAI,OAAO,OAAO;AAClB,eAAO,QAAQ,QAAQ,SAAS,EAAE,KAAK,OAAOsY,eAAc;AACxD,cAAI,OAAO,UAAU;AACjB,mBAAO,eAAe;AAC1B,gBAAM,SAAS,MAAM,KAAK,KAAK,OAAO,YAAY;YAC9C,MAAMA;YACN,MAAM,IAAI;YACV,QAAQ;UAChC,CAAqB;AACD,cAAI,OAAO,WAAW;AAClB,mBAAO,eAAe;AAC1B,cAAI,OAAO,WAAW;AAClB,oBAAO,GAAI,eAAe,OAAO,OAAO,KAAK;AACjD,cAAI,OAAO,UAAU;AACjB,oBAAO,GAAI,eAAe,OAAO,OAAO,KAAK;AACjD,iBAAO;QAC3B,CAAiB;MACjB,OACiB;AACD,YAAI,OAAO,UAAU;AACjB,iBAAO,eAAe;AAC1B,cAAM,SAAS,KAAK,KAAK,OAAO,WAAW;UACvC,MAAM;UACN,MAAM,IAAI;UACV,QAAQ;QAC5B,CAAiB;AACD,YAAI,OAAO,WAAW;AAClB,iBAAO,eAAe;AAC1B,YAAI,OAAO,WAAW;AAClB,kBAAO,GAAI,eAAe,OAAO,OAAO,KAAK;AACjD,YAAI,OAAO,UAAU;AACjB,kBAAO,GAAI,eAAe,OAAO,OAAO,KAAK;AACjD,eAAO;MACvB;IACA;AACQ,QAAI,OAAO,SAAS,cAAc;AAC9B,YAAM,oBAAoB,CAAC,QAAQ;AAC/B,cAAM,SAAS,OAAO,WAAW,KAAK,QAAQ;AAC9C,YAAI,IAAI,OAAO,OAAO;AAClB,iBAAO,QAAQ,QAAQ,MAAM;QACjD;AACgB,YAAI,kBAAkB,SAAS;AAC3B,gBAAM,IAAI,MAAM,2FAA2F;QAC/H;AACgB,eAAO;MACvB;AACY,UAAI,IAAI,OAAO,UAAU,OAAO;AAC5B,cAAM,QAAQ,KAAK,KAAK,OAAO,WAAW;UACtC,MAAM,IAAI;UACV,MAAM,IAAI;UACV,QAAQ;QAC5B,CAAiB;AACD,YAAI,MAAM,WAAW;AACjB,iBAAO,eAAe;AAC1B,YAAI,MAAM,WAAW;AACjB,iBAAO,MAAK;AAEhB,0BAAkB,MAAM,KAAK;AAC7B,eAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,MAAM,MAAK;MACjE,OACiB;AACD,eAAO,KAAK,KAAK,OAAO,YAAY,EAAE,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAG,CAAE,EAAE,KAAK,CAAC,UAAU;AACjG,cAAI,MAAM,WAAW;AACjB,mBAAO,eAAe;AAC1B,cAAI,MAAM,WAAW;AACjB,mBAAO,MAAK;AAChB,iBAAO,kBAAkB,MAAM,KAAK,EAAE,KAAK,MAAM;AAC7C,mBAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,MAAM,MAAK;UACzE,CAAqB;QACrB,CAAiB;MACjB;IACA;AACQ,QAAI,OAAO,SAAS,aAAa;AAC7B,UAAI,IAAI,OAAO,UAAU,OAAO;AAC5B,cAAMtc,QAAO,KAAK,KAAK,OAAO,WAAW;UACrC,MAAM,IAAI;UACV,MAAM,IAAI;UACV,QAAQ;QAC5B,CAAiB;AACD,YAAI,EAAC,GAAI,eAAe,SAASA,KAAI;AACjC,iBAAO,eAAe;AAC1B,cAAM,SAAS,OAAO,UAAUA,MAAK,OAAO,QAAQ;AACpD,YAAI,kBAAkB,SAAS;AAC3B,gBAAM,IAAI,MAAM,iGAAiG;QACrI;AACgB,eAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,OAAM;MAC5D,OACiB;AACD,eAAO,KAAK,KAAK,OAAO,YAAY,EAAE,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAG,CAAE,EAAE,KAAK,CAACA,UAAS;AAChG,cAAI,EAAC,GAAI,eAAe,SAASA,KAAI;AACjC,mBAAO,eAAe;AAC1B,iBAAO,QAAQ,QAAQ,OAAO,UAAUA,MAAK,OAAO,QAAQ,CAAC,EAAE,KAAK,CAAC,YAAY;YAC7E,QAAQ,OAAO;YACf,OAAO;UAC/B,EAAsB;QACtB,CAAiB;MACjB;IACA;AACQ,cAAU,KAAK,YAAY,MAAM;EACzC;AACA;AACkB,MAAA,aAAG;AACC,MAAA,iBAAG;AACzB,WAAW,SAAS,CAAC,QAAQ,QAAQ,WAAW;AAC5C,SAAO,IAAI,WAAW;IAClB;IACA,UAAU,sBAAsB;IAChC;IACA,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,WAAW,uBAAuB,CAAC,YAAY,QAAQ,WAAW;AAC9D,SAAO,IAAI,WAAW;IAClB;IACA,QAAQ,EAAE,MAAM,cAAc,WAAW,WAAU;IACnD,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,cAAN,cAA0B,QAAQ;EAC9B,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,WAAW;AAClD,cAAO,GAAI,eAAe,IAAI,MAAS;IACnD;AACQ,WAAO,KAAK,KAAK,UAAU,OAAO,KAAK;EAC/C;EACI,SAAS;AACL,WAAO,KAAK,KAAK;EACzB;AACA;AACmB,MAAA,cAAG;AACtB,YAAY,SAAS,CAACR,OAAM,WAAW;AACnC,SAAO,IAAI,YAAY;IACnB,WAAWA;IACX,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,cAAN,cAA0B,QAAQ;EAC9B,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,MAAM;AAC7C,cAAO,GAAI,eAAe,IAAI,IAAI;IAC9C;AACQ,WAAO,KAAK,KAAK,UAAU,OAAO,KAAK;EAC/C;EACI,SAAS;AACL,WAAO,KAAK,KAAK;EACzB;AACA;AACmB,MAAA,cAAG;AACtB,YAAY,SAAS,CAACA,OAAM,WAAW;AACnC,SAAO,IAAI,YAAY;IACnB,WAAWA;IACX,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,aAAN,cAAyB,QAAQ;EAC7B,OAAO,OAAO;AACV,UAAM,EAAE,IAAG,IAAK,KAAK,oBAAoB,KAAK;AAC9C,QAAI,OAAO,IAAI;AACf,QAAI,IAAI,eAAe,UAAU,cAAc,WAAW;AACtD,aAAO,KAAK,KAAK,aAAY;IACzC;AACQ,WAAO,KAAK,KAAK,UAAU,OAAO;MAC9B;MACA,MAAM,IAAI;MACV,QAAQ;IACpB,CAAS;EACT;EACI,gBAAgB;AACZ,WAAO,KAAK,KAAK;EACzB;AACA;AACkB,MAAA,aAAG;AACrB,WAAW,SAAS,CAACA,OAAM,WAAW;AAClC,SAAO,IAAI,WAAW;IAClB,WAAWA;IACX,UAAU,sBAAsB;IAChC,cAAc,OAAO,OAAO,YAAY,aAAa,OAAO,UAAU,MAAM,OAAO;IACnF,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,WAAN,cAAuB,QAAQ;EAC3B,OAAO,OAAO;AACV,UAAM,EAAE,IAAG,IAAK,KAAK,oBAAoB,KAAK;AAE9C,UAAM,SAAS;MACX,GAAG;MACH,QAAQ;QACJ,GAAG,IAAI;QACP,QAAQ,CAAA;MACxB;IACA;AACQ,UAAM,SAAS,KAAK,KAAK,UAAU,OAAO;MACtC,MAAM,OAAO;MACb,MAAM,OAAO;MACb,QAAQ;QACJ,GAAG;MACnB;IACA,CAAS;AACD,SAAI,GAAI,eAAe,SAAS,MAAM,GAAG;AACrC,aAAO,OAAO,KAAK,CAAC2c,YAAW;AAC3B,eAAO;UACH,QAAQ;UACR,OAAOA,QAAO,WAAW,UACnBA,QAAO,QACP,KAAK,KAAK,WAAW;YACnB,IAAI,QAAQ;AACR,qBAAO,IAAI,cAAc,SAAS,OAAO,OAAO,MAAM;YACtF;YAC4B,OAAO,OAAO;UAC1C,CAAyB;QACzB;MACA,CAAa;IACb,OACa;AACD,aAAO;QACH,QAAQ;QACR,OAAO,OAAO,WAAW,UACnB,OAAO,QACP,KAAK,KAAK,WAAW;UACnB,IAAI,QAAQ;AACR,mBAAO,IAAI,cAAc,SAAS,OAAO,OAAO,MAAM;UAClF;UACwB,OAAO,OAAO;QACtC,CAAqB;MACrB;IACA;EACA;EACI,cAAc;AACV,WAAO,KAAK,KAAK;EACzB;AACA;AACgB,MAAA,WAAG;AACnB,SAAS,SAAS,CAAC3c,OAAM,WAAW;AAChC,SAAO,IAAI,SAAS;IAChB,WAAWA;IACX,UAAU,sBAAsB;IAChC,YAAY,OAAO,OAAO,UAAU,aAAa,OAAO,QAAQ,MAAM,OAAO;IAC7E,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,IAAM,SAAN,cAAqB,QAAQ;EACzB,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,UAAU,cAAc,KAAK;AAC5C,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,OAAA,GAAI,eAAe,mBAAmB,KAAK;QACvC,MAAM,cAAc,aAAa;QACjC,UAAU,UAAU,cAAc;QAClC,UAAU,IAAI;MAC9B,CAAa;AACD,aAAO,eAAe;IAClC;AACQ,WAAO,EAAE,QAAQ,SAAS,OAAO,MAAM,KAAI;EACnD;AACA;AACc,MAAA,SAAG;AACjB,OAAO,SAAS,CAAC,WAAW;AACxB,SAAO,IAAI,OAAO;IACd,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AACA,MAAA,QAAgB,uBAAO,WAAW;AAClC,IAAM,aAAN,cAAyB,QAAQ;EAC7B,OAAO,OAAO;AACV,UAAM,EAAE,IAAG,IAAK,KAAK,oBAAoB,KAAK;AAC9C,UAAM,OAAO,IAAI;AACjB,WAAO,KAAK,KAAK,KAAK,OAAO;MACzB;MACA,MAAM,IAAI;MACV,QAAQ;IACpB,CAAS;EACT;EACI,SAAS;AACL,WAAO,KAAK,KAAK;EACzB;AACA;AACkB,MAAA,aAAG;AACrB,IAAM,cAAN,MAAM,qBAAoB,QAAQ;EAC9B,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAG,IAAK,KAAK,oBAAoB,KAAK;AACtD,QAAI,IAAI,OAAO,OAAO;AAClB,YAAM,cAAc,YAAY;AAC5B,cAAM,WAAW,MAAM,KAAK,KAAK,GAAG,YAAY;UAC5C,MAAM,IAAI;UACV,MAAM,IAAI;UACV,QAAQ;QAC5B,CAAiB;AACD,YAAI,SAAS,WAAW;AACpB,iBAAO,eAAe;AAC1B,YAAI,SAAS,WAAW,SAAS;AAC7B,iBAAO,MAAK;AACZ,kBAAO,GAAI,eAAe,OAAO,SAAS,KAAK;QACnE,OACqB;AACD,iBAAO,KAAK,KAAK,IAAI,YAAY;YAC7B,MAAM,SAAS;YACf,MAAM,IAAI;YACV,QAAQ;UAChC,CAAqB;QACrB;MACA;AACY,aAAO,YAAW;IAC9B,OACa;AACD,YAAM,WAAW,KAAK,KAAK,GAAG,WAAW;QACrC,MAAM,IAAI;QACV,MAAM,IAAI;QACV,QAAQ;MACxB,CAAa;AACD,UAAI,SAAS,WAAW;AACpB,eAAO,eAAe;AAC1B,UAAI,SAAS,WAAW,SAAS;AAC7B,eAAO,MAAK;AACZ,eAAO;UACH,QAAQ;UACR,OAAO,SAAS;QACpC;MACA,OACiB;AACD,eAAO,KAAK,KAAK,IAAI,WAAW;UAC5B,MAAM,SAAS;UACf,MAAM,IAAI;UACV,QAAQ;QAC5B,CAAiB;MACjB;IACA;EACA;EACI,OAAO,OAAO,GAAG,GAAG;AAChB,WAAO,IAAI,aAAY;MACnB,IAAI;MACJ,KAAK;MACL,UAAU,sBAAsB;IAC5C,CAAS;EACT;AACA;AACmB,MAAA,cAAG;AACtB,IAAM,cAAN,cAA0B,QAAQ;EAC9B,OAAO,OAAO;AACV,UAAM,SAAS,KAAK,KAAK,UAAU,OAAO,KAAK;AAC/C,UAAM,SAAS,CAAC,SAAS;AACrB,WAAI,GAAI,eAAe,SAAS,IAAI,GAAG;AACnC,aAAK,QAAQ,OAAO,OAAO,KAAK,KAAK;MACrD;AACY,aAAO;IACnB;AACQ,YAAO,GAAI,eAAe,SAAS,MAAM,IAAI,OAAO,KAAK,CAAC,SAAS,OAAO,IAAI,CAAC,IAAI,OAAO,MAAM;EACxG;EACI,SAAS;AACL,WAAO,KAAK,KAAK;EACzB;AACA;AACmB,MAAA,cAAG;AACtB,YAAY,SAAS,CAACA,OAAM,WAAW;AACnC,SAAO,IAAI,YAAY;IACnB,WAAWA;IACX,UAAU,sBAAsB;IAChC,GAAG,oBAAoB,MAAM;EACrC,CAAK;AACL;AAQA,SAAS,YAAY,QAAQ,MAAM;AAC/B,QAAM,IAAI,OAAO,WAAW,aAAa,OAAO,IAAI,IAAI,OAAO,WAAW,WAAW,EAAE,SAAS,OAAM,IAAK;AAC3G,QAAM,KAAK,OAAO,MAAM,WAAW,EAAE,SAAS,EAAC,IAAK;AACpD,SAAO;AACX;AACA,SAAS,OAAO,OAAO,UAAU,CAAA,GAWjC,OAAO;AACH,MAAI;AACA,WAAO,OAAO,OAAM,EAAG,YAAY,CAAC,MAAM,QAAQ;AAC9C,YAAMW,KAAI,MAAM,IAAI;AACpB,UAAIA,cAAa,SAAS;AACtB,eAAOA,GAAE,KAAK,CAACA,OAAM;AACjB,cAAI,CAACA,IAAG;AACJ,kBAAM,SAAS,YAAY,SAAS,IAAI;AACxC,kBAAM,SAAS,OAAO,SAAS,SAAS;AACxC,gBAAI,SAAS,EAAE,MAAM,UAAU,GAAG,QAAQ,OAAO,OAAM,CAAE;UACjF;QACA,CAAiB;MACjB;AACY,UAAI,CAACA,IAAG;AACJ,cAAM,SAAS,YAAY,SAAS,IAAI;AACxC,cAAM,SAAS,OAAO,SAAS,SAAS;AACxC,YAAI,SAAS,EAAE,MAAM,UAAU,GAAG,QAAQ,OAAO,OAAM,CAAE;MACzE;AACY;IACZ,CAAS;AACL,SAAO,OAAO,OAAM;AACxB;AACA,MAAA,OAAe;EACX,QAAQ,UAAU;AACtB;AACA,IAAI;CACH,SAAUoc,wBAAuB;AAC9B,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,QAAQ,IAAI;AAClC,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,SAAS,IAAI;AACnC,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,cAAc,IAAI;AACxC,EAAAA,uBAAsB,SAAS,IAAI;AACnC,EAAAA,uBAAsB,QAAQ,IAAI;AAClC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,UAAU,IAAI;AACpC,EAAAA,uBAAsB,SAAS,IAAI;AACnC,EAAAA,uBAAsB,UAAU,IAAI;AACpC,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,UAAU,IAAI;AACpC,EAAAA,uBAAsB,uBAAuB,IAAI;AACjD,EAAAA,uBAAsB,iBAAiB,IAAI;AAC3C,EAAAA,uBAAsB,UAAU,IAAI;AACpC,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,QAAQ,IAAI;AAClC,EAAAA,uBAAsB,QAAQ,IAAI;AAClC,EAAAA,uBAAsB,aAAa,IAAI;AACvC,EAAAA,uBAAsB,SAAS,IAAI;AACnC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,SAAS,IAAI;AACnC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,eAAe,IAAI;AACzC,EAAAA,uBAAsB,aAAa,IAAI;AACvC,EAAAA,uBAAsB,aAAa,IAAI;AACvC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,UAAU,IAAI;AACpC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,aAAa,IAAI;AACvC,EAAAA,uBAAsB,aAAa,IAAI;AAC3C,GAAG,0BAAuD,MAAA,wBAAG,wBAAwB,CAAA,EAAG;AAKxF,IAAM,iBAAiB,CAEvB,KAAK,SAAS;EACV,SAAS,yBAAyB,IAAI,IAAI;AAC9C,MAAM,OAAO,CAAC,SAAS,gBAAgB,KAAK,MAAM;AAChC,MAAA,aAAG;AACrB,IAAM,aAAa,UAAU;AACf,MAAA,SAAG;AACjB,IAAM,aAAa,UAAU;AACf,MAAA,SAAG;AACjB,IAAM,UAAU,OAAO;AACZ,MAAA,MAAG;AACd,IAAM,aAAa,UAAU;AACf,MAAA,SAAG;AACjB,IAAM,cAAc,WAAW;AAChB,MAAA,UAAG;AAClB,IAAM,WAAW,QAAQ;AACb,MAAA,OAAG;AACf,IAAM,aAAa,UAAU;AACf,MAAA,SAAG;AACjB,IAAM,gBAAgB,aAAa;AAClB,MAAA,YAAG;AACpB,IAAM,WAAW,QAAQ;AACb,MAAA,OAAG;AACf,IAAM,UAAU,OAAO;AACZ,MAAA,MAAG;AACd,IAAM,cAAc,WAAW;AAChB,MAAA,UAAG;AAClB,IAAM,YAAY,SAAS;AACd,MAAA,QAAG;AAChB,IAAM,WAAW,QAAQ;AACb,MAAA,OAAG;AACf,IAAM,YAAY,SAAS;AACd,MAAA,QAAG;AAChB,IAAM,aAAa,UAAU;AACf,MAAA,SAAG;AACjB,IAAM,mBAAmB,UAAU;AACf,MAAA,eAAG;AACvB,IAAM,YAAY,SAAS;AACd,MAAA,QAAG;AAChB,IAAM,yBAAyB,sBAAsB;AAC3B,MAAA,qBAAG;AAC7B,IAAM,mBAAmB,gBAAgB;AACrB,MAAA,eAAG;AACvB,IAAM,YAAY,SAAS;AACd,MAAA,QAAG;AAChB,IAAM,aAAa,UAAU;AACf,MAAA,SAAG;AACjB,IAAM,UAAU,OAAO;AACZ,MAAA,MAAG;AACd,IAAM,UAAU,OAAO;AACZ,MAAA,MAAG;AACd,IAAM,eAAe,YAAY;AACjB,MAAA,WAAG;AACnB,IAAM,WAAW,QAAQ;AACb,MAAA,OAAG;AACf,IAAM,cAAc,WAAW;AAChB,MAAA,UAAG;AAClB,IAAM,WAAW,QAAQ;AACb,MAAA,OAAG;AACf,IAAM,iBAAiB,cAAc;AACnB,MAAA,aAAG;AACrB,IAAM,cAAc,WAAW;AAChB,MAAA,UAAG;AAClB,IAAM,cAAc,WAAW;AACjB,MAAA,SAAG;AACE,MAAA,cAAG;AACtB,IAAM,eAAe,YAAY;AACjB,MAAA,WAAG;AACnB,IAAM,eAAe,YAAY;AACjB,MAAA,WAAG;AACnB,IAAM,iBAAiB,WAAW;AAChB,MAAA,aAAG;AACrB,IAAM,eAAe,YAAY;AACjB,MAAA,WAAG;AACnB,IAAM,UAAU,MAAM,WAAU,EAAG,SAAQ;AAC5B,MAAA,UAAG;AAClB,IAAM,UAAU,MAAM,WAAU,EAAG,SAAQ;AAC5B,MAAA,UAAG;AAClB,IAAM,WAAW,MAAM,YAAW,EAAG,SAAQ;AAC7B,MAAA,WAAG;AACnB,MAAA,SAAiB;EACb,SAAS,CAAC,QAAQ,UAAU,OAAO,EAAE,GAAG,KAAK,QAAQ,KAAI,CAAE;EAC3D,SAAS,CAAC,QAAQ,UAAU,OAAO,EAAE,GAAG,KAAK,QAAQ,KAAI,CAAE;EAC3D,UAAU,CAAC,QAAQ,WAAW,OAAO;IACjC,GAAG;IACH,QAAQ;EAChB,CAAK;EACD,SAAS,CAAC,QAAQ,UAAU,OAAO,EAAE,GAAG,KAAK,QAAQ,KAAI,CAAE;EAC3D,OAAO,CAAC,QAAQ,QAAQ,OAAO,EAAE,GAAG,KAAK,QAAQ,KAAI,CAAE;AAC3D;AACa,MAAA,QAAG,eAAe;;AC7rH/B,MAAIC,mBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,QAAI,OAAO,OAAW,MAAK;AAC3B,QAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,QAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,aAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,eAAO,EAAE,CAAC;MAAE,EAAE;;AAE7D,WAAO,eAAe,GAAG,IAAI,IAAI;QAC/B,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,QAAI,OAAO,OAAW,MAAK;AAC3B,MAAE,EAAE,IAAI,EAAE,CAAC;;AAEf,MAAI,eAAgBA,kBAAQA,eAAK,gBAAiB,SAAS,GAAGqb,UAAS;AACnE,aAAS,KAAK,EAAG,KAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKA,UAAS,CAAC,EAAG,CAAAD,iBAAgBC,UAAS,GAAG,CAAC;EAC5H;AACA,SAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,eAAa3e,UAAyB,OAAO;AAC7C,eAAaE,WAAoC,OAAO;AACxD,eAAa2D,aAAsC,OAAO;AAC1D,eAAaU,MAA+B,OAAO;AACnD,eAAaG,OAAwB,OAAO;AAC5C,eAAaiB,YAA2B,OAAO;;;ACpB/C,MAAI+Y,mBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,QAAI,OAAO,OAAW,MAAK;AAC3B,QAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,QAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,aAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,eAAO,EAAE,CAAC;MAAE,EAAE;;AAE7D,WAAO,eAAe,GAAG,IAAI,IAAI;QAC/B,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,QAAI,OAAO,OAAW,MAAK;AAC3B,MAAE,EAAE,IAAI,EAAE,CAAC;;AAEf,MAAIsb,sBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,WAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;EACtE,KAAK,SAAS,GAAG,GAAG;AAChB,MAAE,SAAS,IAAI;EACnB;AACA,MAAIub,gBAAgBvb,kBAAQA,eAAK,gBAAiB,SAAUhB,MAAK;AAC7D,QAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,QAAI,SAAS,CAAA;AACb,QAAIA,QAAO;AAAM,eAAS,KAAKA,KAAK,KAAI,MAAM,aAAa,OAAO,UAAU,eAAe,KAAKA,MAAK,CAAC,EAAG,CAAAoc,iBAAgB,QAAQpc,MAAK,CAAC;;AACvI,IAAAsc,oBAAmB,QAAQtc,IAAG;AAC9B,WAAO;EACX;AACA,MAAI,eAAgBgB,kBAAQA,eAAK,gBAAiB,SAAS,GAAGqb,UAAS;AACnE,aAAS,KAAK,EAAG,KAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKA,UAAS,CAAC,EAAG,CAAAD,iBAAgBC,UAAS,GAAG,CAAC;EAC5H;AACA,SAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,UAAY,IAAA;AACZ,QAAM,IAAIE,cAAa7e,QAA4B;AACnD,UAAA,IAAY;AACZ,eAAaA,UAA8B,OAAO;AAClD,UAAA,UAAkB;;AC/BlB,OAAO,eAAe,QAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5C,OAAA,WAAG;AACnB,IAAM8F,aAAW9F;AACjB,IAAM8e,UAAQ5e;AACd,IAAM6e,iBAAeD,QAAM,EAAE,OAAO,SAAOhZ,WAAS,OAAO,SAAS,GAAG,GAAG;EACtE,SAAS;AACb,CAAC;AACD,IAAM,eAAegZ,QAAM,EAAE,KAAK,MAAMA,QAAM,EAAE,MAAM;EAClDA,QAAM,EAAE,KAAI;EACZA,QAAM,EAAE,QAAO;EACfC;EACAD,QAAM,EAAE,OAAM;EACdA,QAAM,EAAE,OAAM;EACdA,QAAM,EAAE,OAAM;EACdA,QAAM,EAAE,MAAM,YAAY;EAC1BA,QAAM,EAAE,OAAO,YAAY;AAC/B,CAAC,CAAC;AACF,IAAM,iBAAiBA,QAAM,EAAE,MAAM,CAACA,QAAM,EAAE,OAAM,GAAIA,QAAM,EAAE,MAAM,YAAY,CAAC,CAAC;AACpF,IAAM,mBAAmBA,QAAM,EAAE,MAAM,CAACC,gBAAcD,QAAM,EAAE,MAAM,cAAc,GAAGA,QAAM,EAAE,MAAMC,cAAY,CAAC,CAAC;AACjH,IAAM,eAAeD,QAAM,EAAE,MAAM,CAAC,kBAAkBA,QAAM,EAAE,MAAMC,cAAY,CAAC,CAAC;AAClF,SAAS,SAAS,OAAO;AACrB,QAAM,SAAS,aAAa,UAAU,KAAK;AAC3C,SAAO,OAAO;AAClB;;ACvBA,OAAO,eAAe,aAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5C,YAAA,WAAGve;AACnB,IAAMsF,aAAW9F;AAKjB,SAASQ,WAAS,OAAO;AACrB,SAAOsF,WAAS,OAAO,SAAS,KAAK;AACzC;ACTA,OAAO,eAAe,WAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC/B,UAAA,wBAAG;AACjB,UAAA,UAAG;AACF,UAAA,WAAGrD;AACH,UAAA,WAAG;AACK,UAAA,mBAAG;AACP,UAAA,eAAG;AACH,UAAA,eAAG;AACH,UAAA,eAAG;AACJ,UAAA,cAAG;AACI,UAAA,qBAAG;AACT,UAAA,eAAG;AACO,UAAA,yBAAG;AACL,UAAA,uBAAG;AAC/B,IAAMqD,aAAW9F;AACjB,IAAM,WAAWE;AACjB,IAAM8e,kBAAgBnb;AACtB,SAAS,QAAQhE,SAAQ;AACrB,MAAI,CAACiG,WAAS,OAAO,SAASjG,OAAM,GAAG;AACnC,UAAM,IAAI,sBAAsBA,OAAM;EAC9C;AACI,SAAO,MAAMA,QAAO,SAAS,KAAK,CAAC;AACvC;AAMA,SAAS4C,UAASZ,MAAK;AACnB,SAAOiE,WAAS,OAAO,KAAKjE,MAAK,KAAK;AAC1C;AAMA,SAAS,SAAShC,SAAQ;AACtB,SAAOA,QAAO,SAAS,KAAK,EAAE,YAAW;AAC7C;AACA,SAAS,iBAAiB,cAAc,gBAAgB;AACpD,MAAI,OAAO,iBAAiB,UAAU;AAClC,WAAO,CAAC,cAAc,OAAO,OAAO,CAAA,GAAI,cAAc,CAAC;EAC/D,OACS;AACD,UAAM,EAAE,MAAA2B,OAAM,KAAI,IAAK;AACvB,WAAO,CAACA,OAAM,QAAQ,CAAA,CAAE;EAChC;AACA;AACA,IAAM,wBAAN,cAAoC,MAAM;EACtC,YAAY3B,SAAQ;AAChB,UAAM,0CAA0C,OAAOA,OAAM,EAAE;EACvE;AACA;AAC6B,UAAA,wBAAG;AAChC,SAAS,aAAa,OAAO;AACzB,OAAI,GAAImf,gBAAc,UAAU,KAAK,GAAG;AACpC,WAAO;EACf;AACI,SAAOvc,UAAS,KAAK;AACzB;AACA,SAAS,aAAa,OAAO;AACzB,MAAI,OAAO,UAAU,UAAU;AAC3B,WAAO,MAAM,YAAW;EAChC,OACS;AACD,WAAO,SAAS,KAAK;EAC7B;AACA;AACA,SAAS,aAAa,OAAO;AACzB,MAAI;AACA,QAAI,SAAS,MAAM;AACf,aAAO;IACnB;AACQ,QAAIqD,WAAS,OAAO,SAAS,KAAK,GAAG;AACjC,aAAO;IACnB;AACQ,QAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;AACxD,aAAO;IACnB;AACQ,QAAI,OAAO,UAAU,UAAU;AAC3B,UAAI,CAAC,OAAO,UAAU,KAAK,GAAG;AAC1B,cAAM,MAAM,yCAAyC;MACrE;AACY,aAAO;IACnB;AACQ,QAAI,MAAM,QAAQ,KAAK,GAAG;AACtB,aAAO,MAAM,MAAM,UAAQ,aAAa,IAAI,CAAC;IACzD;AACQ,QAAI,OAAO,UAAU,UAAU;AAC3B,aAAO,OAAO,OAAO,KAAK,EAAE,MAAM,SAAO,aAAa,GAAG,CAAC;IACtE;EACA,SACWI,QAAO;AACV,UAAM,IAAI,MAAM,yBAAyBA,MAAK,EAAE;EACxD;AACI,SAAO;AACX;AACA,SAAS,YAAY+Y,SAAQ;AACzB,QAAM,aAAaA,QAAO,CAAC;AAC3B,QAAM,aAAaA,QAAO,CAAC;AAC3B,QAAM,UAAU;IACZ,eAAe,WAAW,CAAC;IAC3B,YAAY,WAAW,CAAC,EAAE,IAAI,CAAC,eAAe;MAC1C,QAAQ,UAAU,CAAC;MACnB,MAAM,UAAU,CAAC;IAC7B,EAAU;IACF,SAAS,WAAW,CAAC;EAC7B;AACI,SAAO;IACH,eAAe,QAAQ;IACvB,YAAY,QAAQ;IACpB,SAAS,QAAQ;IACjB;EACR;AACA;AACA,SAAS,mBAAmBA,SAAQ;AAChC,SAAOA,QAAO,CAAC;AACnB;AACA,SAAS,aAAa,OAAO;AACzB,MAAI,EAAC,GAAI,SAAS,UAAU,KAAK;AAC7B,WAAO;AACX,MAAI;AACA,gBAAY,KAAK;AACjB,WAAO;EACf,SACW/Y,QAAO;AACV,WAAO;EACf;AACA;AACA,SAAS,uBAAuB,SAAS;AACrC,QAAM,kBAAkB,CAAA;AACxB,UAAQ,QAAQ,UAAQ;AACpB,UAAM,eAAe,KAAK,SAAS,KAAK;AACxC,QAAI,CAAC,gBAAgB,SAAS,YAAY,GAAG;AACzC,sBAAgB,KAAK,YAAY;IAC7C;EACA,CAAK;AACD,QAAM,SAAS,CAAA;AACf,kBAAgB,QAAQ,UAAQ;AAC5B,WAAO,KAAKJ,WAAS,OAAO,KAAK,MAAM,KAAK,CAAC;EACrD,CAAK;AACD,SAAO;AACX;AACA,SAAS,qBAAqB,WAAW;AACrC,QAAM,SAAS,UAAU,MAAM,oDAAoD;AACnF,MAAI,CAAC;AACD,WAAO,CAAA;AACX,QAAM,CAAC,UAAU,WAAW,WAAW,IAAI,OAAO,MAAM,CAAC;AACzD,SAAO,EAAE,aAAa,UAAU,UAAS;AAC7C;ACrJA,OAAO,eAAeoZ,iBAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACzCA,gBAAA,cAAG;AACAA,gBAAA,iBAAG;AACNA,gBAAA,cAAG;AACAA,gBAAA,iBAAG;AACPA,gBAAA,aAAG;AACCA,gBAAA,iBAAG;AACzB,IAAMpZ,aAAW9F;AACjB,IAAM,eAAeE;AACrB,IAAM,UAAU2D,UAAAA;AAChB,IAAMsb,aAAW5a;AACjB,IAAM6a,gBAAc1a;AACpB,SAAS,YAAY,QAAQ;AACzB,SAAO,aAAa,OAAO,OAAO,eAAe,MAAM,CAAC;AAC5D;AACA,SAAS,eAAeua,SAAQ;AAC5B,SAAO,YAAYA,OAAM;AAC7B;AACA,SAAS,YAAY,OAAO;AACxB,MAAI;AACA,UAAM1e,OAAM,aAAa,OAAO,OAAO,KAAK;AAC5C,WAAO,WAAWA,IAAG;EAC7B,SACW2F,QAAO;AACV,UAAM,IAAI,MAAM,qBAAqBA,MAAK,EAAE;EACpD;AACA;AACA,SAAS,eAAe,OAAO;AAC3B,QAAM,eAAe,YAAY,KAAK;AACtC,MAAI,EAAC,GAAIkZ,cAAY,cAAc,YAAY,GAAG;AAC9C,UAAM,IAAI,MAAM,6BAA6B,YAAY,+CAA+C;EAChH;AACI,SAAO;AACX;AACA,SAAS,WAAW,UAAU;AAC1B,MAAIC,KAAI;AACR,MAAI,SAAS,SAAS,QAAQ;AAC1B,WAAO;EACf,WACa,SAAS,SAAS,aAAa;AACpC,WAAO,SAAS;EACxB,WACa,SAAS,SAAS,UAAU;AACjC,WAAO,SAAS;EACxB,WACa,SAAS,SAAS,WAAW;AAClC,WAAO,OAAO,SAAS,KAAK;EACpC,WACa,SAAS,SAAS,SAAS;AAChC,UAAM,aAAa,SAAS;AAC5B,WAAO,WAAW,IAAI,CAAC,SAAS,WAAW,IAAI,CAAC;EACxD,WACa,SAAS,SAAS,cAAc;AACrC,WAAO,QAAQ,MAAMA,MAAK,SAAS,WAAW,QAAQA,QAAO,SAAS,SAASA,IAAG,SAAQ,OAAQ,QAAQ,OAAO,SAAS,KAAK,EAAE;EACzI,WACa,SAAS,SAAS,QAAQ;AAC/B,UAAM,aAAa,SAAS;AAC5B,UAAM,SAAS,CAAA;AACf,eAAW,QAAQ,CAAC,SAAS;AACzB,aAAO,KAAK,IAAI,IAAI,WAAW,KAAK,KAAK;IACrD,CAAS;AACD,WAAO;EACf,OACS;AACD,UAAM,IAAIF,WAAS,4BAA4B,QAAQ;EAC/D;AACA;AACA,SAAS,eAAe,OAAO;AAC3B,MAAI;AACA,QAAI,SAAS,MAAM;AACf,aAAO,EAAE,MAAM,QAAQ,OAAO,KAAI;IAC9C;AACQ,QAAIrZ,WAAS,OAAO,SAAS,KAAK,GAAG;AACjC,aAAO,EAAE,MAAM,aAAa,MAAY;IACpD;AACQ,QAAI,OAAO,UAAU,WAAW;AAC5B,aAAO,EAAE,MAAM,WAAW,OAAO,QAAQ,IAAI,EAAC;IAC1D;AACQ,QAAI,OAAO,UAAU,UAAU;AAC3B,aAAO,EAAE,MAAM,UAAU,MAAY;IACjD;AACQ,QAAI,OAAO,UAAU,UAAU;AAC3B,UAAI,CAAC,OAAO,UAAU,KAAK,GAAG;AAC1B,cAAM,MAAM,yCAAyC;MACrE;AACY,aAAO,EAAE,MAAM,WAAW,OAAO,IAAI,QAAQ,GAAG,KAAK,EAAC;IAClE;AACQ,QAAI,OAAO,UAAU,UAAU;AAC3B,aAAO,EAAE,MAAM,cAAc,OAAO,IAAI,QAAQ,GAAG,MAAM,SAAQ,CAAE,EAAC;IAChF;AACQ,QAAI,MAAM,gBAAgB,OAAO;AAC7B,aAAO;QACH,MAAM;QACN,OAAO,MAAM,IAAI,UAAQ,eAAe,IAAI,CAAC;MAC7D;IACA;AACQ,QAAI,OAAO,UAAU,UAAU;AAC3B,UAAI,kBAAkB;AACtB,UAAI,wBAAwB,eAAe,GAAG;AAC1C,0BAAkB,kBAAkB,eAAe;MACnE;AACY,aAAO;QACH,MAAM;QACN,OAAO,OAAO,KAAK,eAAe,EAAE,IAAI,SAAUjE,MAAK;AACnD,iBAAO,EAAE,MAAMA,MAAK,OAAO,eAAe,gBAAgBA,IAAG,CAAC,EAAC;QACnF,CAAiB;MACjB;IACA;EACA,SACWqE,QAAO;AACV,UAAM,UAAU,QAAQ,MAAM,SAAQ,IAAK;AAC3C,UAAM,IAAI,MAAM,oBAAoB,OAAO,KAAKA,MAAK,EAAE;EAC/D;AACI,QAAM,IAAI,MAAM,SAAS,KAAK,2BAA2B,OAAO,KAAK,EAAE;AAC3E;AACA,SAAS,wBAAwB3F,MAAK;AAClC,aAAWsB,QAAOtB,MAAK;AACnB,QAAI,OAAOsB,SAAQ,UAAU;AACzB,aAAO;IACnB;EACA;AACI,SAAO;AACX;AACA,SAAS,kBAAkB,MAAM;AAC7B,QAAM,cAAc,OAAO,QAAQ,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,MAAM;AAC9D,QAAI,OAAO,MAAM;AACb,aAAO;IACnB;AACQ,QAAI,OAAO,MAAM;AACb,aAAO;IACnB;AACQ,WAAO;EACf,CAAK;AACD,QAAM,aAAa,CAAA;AACnB,aAAW,CAACA,MAAK,KAAK,KAAK,aAAa;AACpC,eAAWA,IAAG,IAAI;EAC1B;AACI,SAAO;AACX;;AC1IA,OAAO,eAAe,WAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAChC,UAAA,uBAAG;AAC/B,UAAA,uBAA+B;EAC3B,KAAK;EACL,KAAK;EACL,OAAO;AACX;ACNA,IAAI6c,oBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,MAAI,OAAO,OAAW,MAAK;AAC3B,MAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,MAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,WAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,aAAO,EAAE,CAAC;IAAE,EAAE;EACjE;AACI,SAAO,eAAe,GAAG,IAAI,IAAI;AACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,MAAI,OAAO,OAAW,MAAK;AAC3B,IAAE,EAAE,IAAI,EAAE,CAAC;AACf;AACA,IAAIsb,uBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,SAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;AACtE,KAAK,SAAS,GAAG,GAAG;AAChB,IAAE,SAAS,IAAI;AACnB;AACA,IAAIub,iBAAgBvb,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,MAAI,UAAU,SAAS,GAAG;AACtB,cAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,UAAI,KAAK,CAAA;AACT,eAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,aAAO;IACnB;AACQ,WAAO,QAAQ,CAAC;EACxB;AACI,SAAO,SAAUhd,MAAK;AAClB,QAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,QAAI,SAAS,CAAA;AACb,QAAIA,QAAO;AAAM,eAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAWoc,mBAAgB,QAAQpc,MAAK,EAAE,CAAC,CAAC;;AAC/Hsc,yBAAmB,QAAQtc,IAAG;AAC9B,WAAO;EACf;AACA,GAAC;AACD,OAAO,eAAe+a,OAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5DA,MAAA,UAAgCA,MAAA,SAAA,MAAA,SAAoB;AACpD,IAAM,iBAAiBrd;AACvB,IAAMkf,kBAAgBL,eAAa3e,eAA+B;AAClE,IAAMkd,gBAAcvZ;AACpB,IAAM,WAAW,CAACtD,MAAK,sBAAsB;AACzC,MAAI,CAAC,OAAO,OAAO6c,cAAY,oBAAoB,EAAE,SAAS,iBAAiB,GAAG;AAC9E,UAAM,IAAI,MAAM,kCAAkC;EAC1D;AACI,MAAI,MAAM,iBAAiB,GAAG;AAC1B,UAAM,IAAI,MAAM,gCAAgC;EACxD;AACI,UAAO,GAAI,eAAe,SAAS7c,MAAK,iBAAiB;AAC7D;AACe8c,MAAA,UAAG;AAClB,IAAMhZ,WAAS6a,gBAAc;AACf7B,MAAA,SAAGhZ;AACjB,IAAMgB,WAAS6Z,gBAAc;AACf7B,MAAA,SAAGhY;;;ACpDjB,IAAM/D,WAAS;EACb,iBAAiB;EACjB,WACE;EACF,WAAW;EACX,0BAA0B;EAC1B,gBAAgB;EAChB,cAAc;EACd,kBAAkB;EAClB,gBAAgB;EAChB,WAAW;EACX,MAAM;EACN,SAAS;EACT,MAAM;AACR;AAEA,SAAS,OAAQ,MAAM,KAAK;AAC1B,MAAI,CAAC,KAAM,OAAM,IAAI,MAAM,GAAG;AAChC;AAEA,SAAS,aAAcE,OAAM,OAAO,QAAQ;AAC1C,SAAO,iBAAiB,YAAY,YAAYA,KAAI,sBAAsB;AAE1E,MAAI,WAAW,QAAW;AACxB,QAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,YAAM,UAAU,OAAO,KAAK,IAAI;AAChC,YAAM,MAAM,YAAYA,KAAI,qCAAqC,OAAO;AACxE,aAAO,OAAO,SAAS,MAAM,MAAM,GAAG,GAAG;IAC/C,OAAW;AACL,YAAM,MAAM,YAAYA,KAAI,oCAAoC,MAAM;AACtE,aAAO,MAAM,WAAW,QAAQ,GAAG;IACzC;EACA;AACA;AAEA,SAAS,aAAc,OAAO;AAC5B,SAAO,aAAa,KAAK,MAAM,WAAW,qCAAqC;AACjF;AAEA,SAAS,kBAAmB,SAAS,CAAC,QAAQ,IAAI,WAAW,GAAG,GAAG,QAAQ;AACzE,MAAI,OAAO,WAAW,WAAY,UAAS,OAAO,MAAM;AACxD,eAAa,UAAU,QAAQ,MAAM;AACrC,SAAO;AACT;AAEA,SAAS,aAAc,OAAO;AAC5B,SAAO,OAAO,UAAU,SAAS,KAAK,KAAK,EAAE,MAAM,GAAG,EAAE;AAC1D;IAEA,MAAiB,CAAC2W,eAAc;AAC9B,SAAO;IACL,iBAAkB,MAAM;AACtB;QACE,SAAS,QAAQ,gBAAgB;QACjC;MACR;AACM,UAAI,SAAS,KAAM,cAAa,QAAQ,MAAM,EAAE;AAEhD,cAAQA,WAAU,iBAAiB,IAAI,GAAC;QACtC,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,wBAAwB;MACzD;IACA;IAEI,iBAAkB,QAAQ;AACxB,mBAAa,eAAe,QAAQ,EAAE;AAEtC,aAAO6W,WAAU,iBAAiB,MAAM,MAAM;IACpD;IAEI,iBAAkB,QAAQ;AACxB,mBAAa,eAAe,QAAQ,EAAE;AAEtC,cAAQA,WAAU,iBAAiB,MAAM,GAAC;QACxC,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,eAAe;MAChD;IACA;IAEI,mBAAoB,QAAQ,OAAO;AACjC,mBAAa,eAAe,QAAQ,EAAE;AACtC,mBAAa,SAAS,OAAO,EAAE;AAE/B,cAAQ6W,WAAU,mBAAmB,QAAQ,KAAK,GAAC;QACjD,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,SAAS;MAC1C;IACA;IAEI,mBAAoB,QAAQ,OAAO;AACjC,mBAAa,eAAe,QAAQ,EAAE;AACtC,mBAAa,SAAS,OAAO,EAAE;AAE/B,cAAQ6W,WAAU,mBAAmB,QAAQ,KAAK,GAAC;QACjD,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,SAAS;MAC1C;IACA;IAEI,gBAAiB,QAAQ;AACvB,mBAAa,cAAc,QAAQ,CAAC,IAAI,EAAE,CAAC;AAE3C,aAAO6W,WAAU,gBAAgB,MAAM,MAAM;IACnD;IAEI,gBAAiB,QAAQ,aAAa,MAAM,QAAQ;AAClD,mBAAa,eAAe,QAAQ,EAAE;AACtC,mBAAa,UAAU;AACvB,eAAS,kBAAkB,QAAQ,aAAa,KAAK,EAAE;AAEvD,cAAQA,WAAU,gBAAgB,QAAQ,MAAM,GAAC;QAC/C,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,cAAc;QACvC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,gBAAgB;MACjD;IACA;IAEI,iBAAkB,QAAQ,aAAa,MAAM,QAAQ;AACnD,mBAAa,cAAc,QAAQ,CAAC,IAAI,EAAE,CAAC;AAC3C,mBAAa,UAAU;AACvB,eAAS,kBAAkB,QAAQ,aAAa,KAAK,EAAE;AAEvD,cAAQ6W,WAAU,iBAAiB,QAAQ,MAAM,GAAC;QAChD,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,YAAY;QACrC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,gBAAgB;MACjD;IACA;IAEI,gBAAiB,QAAQ,aAAa,MAAM,QAAQ;AAClD,mBAAa,cAAc,QAAQ,CAAC,IAAI,EAAE,CAAC;AAC3C,mBAAa,UAAU;AACvB,eAAS,kBAAkB,QAAQ,aAAa,KAAK,EAAE;AAEvD,cAAQ6W,WAAU,gBAAgB,QAAQ,MAAM,GAAC;QAC/C,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,YAAY;QACrC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,eAAe;QACxC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,gBAAgB;MACjD;IACA;IAEI,iBAAkB,SAAS,aAAa,MAAM,QAAQ;AACpD,aAAO,MAAM,QAAQ,OAAO,GAAG,qCAAqC;AACpE,aAAO,QAAQ,SAAS,GAAG,2DAA2D;AACtF,iBAAW,UAAU,SAAS;AAC5B,qBAAa,cAAc,QAAQ,CAAC,IAAI,EAAE,CAAC;MACnD;AACM,mBAAa,UAAU;AACvB,eAAS,kBAAkB,QAAQ,aAAa,KAAK,EAAE;AAEvD,cAAQ6W,WAAU,iBAAiB,QAAQ,OAAO,GAAC;QACjD,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,YAAY;QACrC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,cAAc;QACvC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,gBAAgB;MACjD;IACA;IAEI,kBAAmB,QAAQ,OAAO,aAAa,MAAM,QAAQ;AAC3D,mBAAa,cAAc,QAAQ,CAAC,IAAI,EAAE,CAAC;AAC3C,mBAAa,SAAS,OAAO,EAAE;AAC/B,mBAAa,UAAU;AACvB,eAAS,kBAAkB,QAAQ,aAAa,KAAK,EAAE;AAEvD,cAAQ6W,WAAU,kBAAkB,QAAQ,QAAQ,KAAK,GAAC;QACxD,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,YAAY;QACrC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,SAAS;MAC1C;IACA;IAEI,kBAAmB,QAAQ,OAAO,aAAa,MAAM,QAAQ;AAC3D,mBAAa,cAAc,QAAQ,CAAC,IAAI,EAAE,CAAC;AAC3C,mBAAa,SAAS,OAAO,EAAE;AAC/B,mBAAa,UAAU;AACvB,eAAS,kBAAkB,QAAQ,aAAa,KAAK,EAAE;AAEvD,cAAQ6W,WAAU,kBAAkB,QAAQ,QAAQ,KAAK,GAAC;QACxD,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,YAAY;QACrC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,SAAS;MAC1C;IACA;IAEI,mBAAoB,KAAK;AACvB,mBAAa,aAAa,KAAK,EAAE;AAEjC,cAAQ6W,WAAU,mBAAmB,GAAG,GAAC;QACvC,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,SAAS;MAC1C;IACA;IAEI,gBAAiB,KAAK,QAAQ;AAC5B,mBAAa,aAAa,KAAK,EAAE;AACjC,eAAS,kBAAkB,QAAQ,EAAE;AAErC,YAAMf,OAAM,EAAE,QAAQ,WAAW,GAAE;AACnC,cAAQ4X,WAAU,gBAAgB5X,MAAK,GAAG,GAAC;QACzC,KAAK;AACH,iBAAO,OAAO,MAAM,GAAGA,KAAI,SAAS;QACtC,KAAK;AACH,gBAAM,IAAI,MAAMe,SAAO,SAAS;QAClC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,eAAe;MAChD;IACA;IAEI,gBAAiB,KAAK,QAAQ;AAC5B,mBAAa,aAAa,GAAG;AAC7B,eAAS,kBAAkB,QAAQ,EAAE;AAErC,cAAQ6W,WAAU,gBAAgB,QAAQ,GAAG,GAAC;QAC5C,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,SAAS;QAClC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,eAAe;MAChD;IACA;IAEI,UAAW,OAAO,QAAQ,UAAU,CAAA,GAAI,QAAQ;AAC9C,mBAAa,WAAW,OAAO,EAAE;AACjC,mBAAa,eAAe,QAAQ,EAAE;AACtC,aAAO,aAAa,OAAO,MAAM,UAAU,kCAAkC;AAC7E,UAAI,QAAQ,SAAS,OAAW,cAAa,gBAAgB,QAAQ,IAAI;AACzE,UAAI,QAAQ,YAAY,OAAW,QAAO,aAAa,QAAQ,OAAO,MAAM,YAAY,2CAA2C;AACnI,eAAS,kBAAkB,QAAQ,EAAE;AAErC,YAAMf,OAAM,EAAE,WAAW,QAAQ,OAAO,KAAI;AAC5C,cAAQ4X,WAAU,UAAU5X,MAAK,OAAO,QAAQ,QAAQ,MAAM,QAAQ,OAAO,GAAC;QAC5E,KAAK;AACH,iBAAOA;QACT,KAAK;AACH,gBAAM,IAAI,MAAMe,SAAO,IAAI;QAC7B,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,eAAe;MAChD;IACA;IAEI,YAAa,KAAK,OAAO,QAAQ;AAC/B,mBAAa,aAAa,KAAK,EAAE;AACjC,mBAAa,WAAW,OAAO,EAAE;AACjC,mBAAa,cAAc,QAAQ,CAAC,IAAI,EAAE,CAAC;AAE3C,cAAQ6W,WAAU,YAAY,KAAK,OAAO,MAAM,GAAC;QAC/C,KAAK;AACH,iBAAO;QACT,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,SAAS;QAClC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,YAAY;MAC7C;IACA;IAEI,aAAc,KAAK,OAAO,OAAO,aAAa,MAAM,QAAQ;AAC1D,mBAAa,aAAa,KAAK,EAAE;AACjC;QACE,aAAa,KAAK,MAAM,YACtB,SAAS,KACT,SAAS;QACX;MACR;AACM,mBAAa,WAAW,OAAO,EAAE;AACjC,mBAAa,UAAU;AACvB,eAAS,kBAAkB,QAAQ,aAAa,KAAK,EAAE;AAEvD,cAAQ6W,WAAU,aAAa,QAAQ,KAAK,OAAO,KAAK,GAAC;QACvD,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,SAAS;QAClC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,OAAO;QAChC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,eAAe;MAChD;IACA;IAEI,KAAM,QAAQ,QAAQ,UAAU,CAAA,GAAI,QAAQ;AAC1C,mBAAa,cAAc,QAAQ,CAAC,IAAI,EAAE,CAAC;AAC3C,mBAAa,eAAe,QAAQ,EAAE;AACtC,aAAO,aAAa,OAAO,MAAM,UAAU,kCAAkC;AAC7E,UAAI,QAAQ,SAAS,OAAW,cAAa,gBAAgB,QAAQ,IAAI;AACzE,UAAI,QAAQ,WAAW,QAAW;AAChC,eAAO,aAAa,QAAQ,MAAM,MAAM,YAAY,0CAA0C;AAC9F,YAAI,QAAQ,SAAS,OAAW,cAAa,gBAAgB,QAAQ,MAAM,EAAE;AAC7E,YAAI,QAAQ,SAAS,OAAW,cAAa,gBAAgB,QAAQ,MAAM,EAAE;AAC7E,qBAAa,UAAU,MAAM;MACrC,OAAa;AACL,iBAAS,kBAAkB,QAAQ,EAAE;MAC7C;AAEM,cAAQ6W,WAAU,KAAK,QAAQ,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,IAAI,GAAC;QACtG,KAAK;AACH,iBAAO;QACT,KAAK;AACH,gBAAM,IAAI,MAAM7W,SAAO,YAAY;QACrC,KAAK;AACH,gBAAM,IAAI,MAAMA,SAAO,IAAI;MACrC;IACA;EACA;AACA;AC/UA,IAAM,KAAKtB,gBAAmB,EAAC;AAE/B,IAAM,KAAK,IAAI,GAAG,WAAW;AAC7B,IAAM,WAAW,GAAG;AAIpB,IAAM,KAAK,SAAS,EAAE;AAEtB,SAAS,wBAAyB,OAAO,MAAM;AAC7C,MAAI,IAAI,IAAI,GAAG,IAAI;AAGnB,MAAI,EAAE,IAAI,SAAS,CAAC,KAAK,EAAG,QAAO;AACnC,MAAI,EAAE,MAAM,SAAS,GAAG;AAGxB,MAAI,IAAI,EAAE,OAAM,EAAG,QAAQ,CAAC,EAAE,QAAQ,SAAS,CAAC,EAAE,QAAO;AACzD,MAAK,UAAU,MAAU,EAAE,MAAK,EAAI,KAAI,EAAE,OAAM;AAGhD,QAAM,KAAK,EAAE,OAAM,EAAG,QAAQ,CAAC;AAC/B,MAAI,CAAC,EAAE,OAAM,EAAG,QAAQ,GAAG,QAAQ,SAAS,CAAC,CAAC,EAAE,OAAM,EAAI,QAAO;AAEjE,SAAO,GAAG,QAAQ,EAAE,KAAK,EAAE,GAAM,EAAI,EAAE,CAAE;AAC3C;AAEA,SAAS,0BAA2B,OAAO,MAAM,MAAM;AACrD,MAAI,IAAI,IAAI,GAAG,IAAI;AACnB,MAAI,IAAI,IAAI,GAAG,IAAI;AAGnB,MAAI,EAAE,IAAI,SAAS,CAAC,KAAK,KAAK,EAAE,IAAI,SAAS,CAAC,KAAK,EAAG,QAAO;AAE7D,MAAI,EAAE,MAAM,SAAS,GAAG;AACxB,MAAI,EAAE,MAAM,SAAS,GAAG;AAGxB,OAAK,UAAU,KAAQ,UAAU,MAAS,EAAE,MAAK,OAAQ,UAAU,GAAO,QAAO;AAGjF,QAAM,KAAK,EAAE,OAAM,EAAG,QAAQ,CAAC;AAC/B,MAAI,CAAC,EAAE,OAAM,EAAG,QAAQ,GAAG,QAAQ,SAAS,CAAC,CAAC,EAAE,OAAM,EAAI,QAAO;AAEjE,SAAO,GAAG,QAAQ,EAAE,KAAK,EAAE,GAAM,EAAI,EAAE,CAAE;AAC3C;AAEA,SAAS,cAAe,QAAQ;AAE9B,QAAM,QAAQ,OAAO,CAAC;AACtB,UAAQ,OAAK;IACX,KAAK;IACL,KAAK;AACH,UAAI,OAAO,WAAW,GAAI,QAAO;AACjC,aAAO,wBAAwB,OAAO,OAAO,SAAS,GAAG,EAAE,CAAC;IAC9D,KAAK;IACL,KAAK;IACL,KAAK;AACH,UAAI,OAAO,WAAW,GAAI,QAAO;AACjC,aAAO,0BAA0B,OAAO,OAAO,SAAS,GAAG,EAAE,GAAG,OAAO,SAAS,IAAI,EAAE,CAAC;IACzF;AACE,aAAO;EACb;AACA;AAEA,SAAS,cAAe,QAAQkV,QAAO;AACrC,QAAM,SAASA,OAAM,OAAO,MAAM,OAAO,WAAW,EAAE;AAGtD,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,EAAG,QAAO,CAAC,IAAI,OAAO,CAAC;AAC9D;AAEA,IAAAoE,aAAiB;EACf,mBAAoB;AAClB,WAAO;EACX;EAEE,iBAAkB,QAAQ;AACxB,UAAMtF,MAAK,IAAI,GAAG,MAAM;AACxB,WAAOA,IAAG,IAAI,SAAS,CAAC,IAAI,KAAK,CAACA,IAAG,OAAM,IAAK,IAAI;EACxD;EAEE,iBAAkB,QAAQ;AACxB,UAAMA,MAAK,IAAI,GAAG,MAAM;AACxB,UAAM,SAAS,SAAS,EAAE,IAAIA,GAAE,EAAE,KAAK,SAAS,CAAC,EAAE,YAAY,YAAY,MAAM,EAAE;AACnF,WAAO,IAAI,MAAM;AACjB,WAAO;EACX;EAEE,mBAAoB,QAAQ,OAAO;AACjC,UAAMA,MAAK,IAAI,GAAG,KAAK;AACvB,QAAIA,IAAG,IAAI,SAAS,CAAC,KAAK,EAAG,QAAO;AAEpC,IAAAA,IAAG,KAAK,IAAI,GAAG,MAAM,CAAC;AACtB,QAAIA,IAAG,IAAI,SAAS,CAAC,KAAK,EAAG,CAAAA,IAAG,KAAK,SAAS,CAAC;AAC/C,QAAIA,IAAG,OAAM,EAAI,QAAO;AAExB,UAAM,UAAUA,IAAG,YAAY,YAAY,MAAM,EAAE;AACnD,WAAO,IAAI,OAAO;AAElB,WAAO;EACX;EAEE,mBAAoB,QAAQ,OAAO;AACjC,QAAIA,MAAK,IAAI,GAAG,KAAK;AACrB,QAAIA,IAAG,IAAI,SAAS,CAAC,KAAK,KAAKA,IAAG,OAAM,EAAI,QAAO;AAEnD,IAAAA,IAAG,KAAK,IAAI,GAAG,MAAM,CAAC;AACtB,QAAIA,IAAG,IAAI,SAAS,CAAC,KAAK,EAAG,CAAAA,MAAKA,IAAG,KAAK,SAAS,CAAC;AAEpD,UAAM,UAAUA,IAAG,YAAY,YAAY,MAAM,EAAE;AACnD,WAAO,IAAI,OAAO;AAElB,WAAO;EACX;EAEE,gBAAiB,QAAQ;AACvB,UAAM,OAAO,cAAc,MAAM;AACjC,WAAO,SAAS,OAAO,IAAI;EAC/B;EAEE,gBAAiB,QAAQ,QAAQ;AAC/B,UAAMA,MAAK,IAAI,GAAG,MAAM;AACxB,QAAIA,IAAG,IAAI,SAAS,CAAC,KAAK,KAAKA,IAAG,OAAM,EAAI,QAAO;AAEnD,UAAMkB,SAAQ,GAAG,eAAe,MAAM,EAAE,UAAS;AACjD,kBAAc,QAAQA,MAAK;AAE3B,WAAO;EACX;EAEE,iBAAkB,QAAQ,QAAQ;AAChC,UAAM,OAAO,cAAc,MAAM;AACjC,QAAI,SAAS,KAAM,QAAO;AAE1B,UAAMA,SAAQ,KAAK,UAAS;AAC5B,kBAAc,QAAQA,MAAK;AAE3B,WAAO;EACX;EAEE,gBAAiB,QAAQ,QAAQ;AAC/B,UAAM,OAAO,cAAc,MAAM;AACjC,QAAI,SAAS,KAAM,QAAO;AAE1B,UAAMA,SAAQ,KAAK,UAAS;AAC5B,IAAAA,OAAM,IAAIA,OAAM,EAAE,OAAM;AACxB,kBAAc,QAAQA,MAAK;AAE3B,WAAO;EACX;EAEE,iBAAkB,QAAQ,SAAS;AACjC,UAAM,QAAQ,IAAI,MAAM,QAAQ,MAAM;AACtC,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACvC,YAAM,CAAC,IAAI,cAAc,QAAQ,CAAC,CAAC;AACnC,UAAI,MAAM,CAAC,MAAM,KAAM,QAAO;IACpC;AAEI,QAAIA,SAAQ,MAAM,CAAC,EAAE,UAAS;AAC9B,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,EAAG,CAAAA,SAAQA,OAAM,IAAI,MAAM,CAAC,EAAE,GAAG;AACrE,QAAIA,OAAM,WAAU,EAAI,QAAO;AAE/B,kBAAc,QAAQA,MAAK;AAE3B,WAAO;EACX;EAEE,kBAAmB,QAAQ,QAAQ,OAAO;AACxC,UAAM,OAAO,cAAc,MAAM;AACjC,QAAI,SAAS,KAAM,QAAO;AAE1B,YAAQ,IAAI,GAAG,KAAK;AACpB,QAAI,MAAM,IAAI,SAAS,CAAC,KAAK,EAAG,QAAO;AAEvC,UAAMA,SAAQ,KAAK,UAAS,EAAG,IAAI,SAAS,EAAE,IAAI,KAAK,CAAC;AACxD,QAAIA,OAAM,WAAU,EAAI,QAAO;AAE/B,kBAAc,QAAQA,MAAK;AAE3B,WAAO;EACX;EAEE,kBAAmB,QAAQ,QAAQ,OAAO;AACxC,UAAM,OAAO,cAAc,MAAM;AACjC,QAAI,SAAS,KAAM,QAAO;AAE1B,YAAQ,IAAI,GAAG,KAAK;AACpB,QAAI,MAAM,IAAI,SAAS,CAAC,KAAK,KAAK,MAAM,OAAM,EAAI,QAAO;AAEzD,UAAMA,SAAQ,KAAK,UAAS,EAAG,IAAI,KAAK;AACxC,kBAAc,QAAQA,MAAK;AAE3B,WAAO;EACX;EAEE,mBAAoB,KAAK;AACvB,UAAM7S,KAAI,IAAI,GAAG,IAAI,SAAS,GAAG,EAAE,CAAC;AACpC,UAAMtC,KAAI,IAAI,GAAG,IAAI,SAAS,IAAI,EAAE,CAAC;AACrC,QAAIsC,GAAE,IAAI,SAAS,CAAC,KAAK,KAAKtC,GAAE,IAAI,SAAS,CAAC,KAAK,EAAG,QAAO;AAE7D,QAAIA,GAAE,IAAI,GAAG,EAAE,MAAM,GAAG;AACtB,UAAI,IAAI,SAAS,EAAE,IAAIA,EAAC,EAAE,YAAY,YAAY,MAAM,EAAE,GAAG,EAAE;IACrE;AAEI,WAAO;EACX;;;EAIE,gBAAiBQ,MAAK,KAAK;AACzB,UAAM,OAAO,IAAI,SAAS,GAAG,EAAE;AAC/B,UAAM,OAAO,IAAI,SAAS,IAAI,EAAE;AAChC,QAAI,IAAI,GAAG,IAAI,EAAE,IAAI,SAAS,CAAC,KAAK,EAAG,QAAO;AAC9C,QAAI,IAAI,GAAG,IAAI,EAAE,IAAI,SAAS,CAAC,KAAK,EAAG,QAAO;AAE9C,UAAM,EAAE,OAAM,IAAKA;AAGnB,QAAI8B,KAAI,OAAO,SAAS,GAAG,IAAI,EAAE;AACjC,IAAAA,GAAE,CAAC,IAAI;AACP,IAAAA,GAAE,IAAI,MAAM,CAAC;AAEb,QAAI,OAAO;AACX,QAAI,OAAO;AACX,WAAO,OAAO,KAAKA,GAAE,IAAI,MAAM,KAAQ,EAAEA,GAAE,OAAO,CAAC,IAAI,MAAO,EAAE,MAAM,EAAE,KAAK;AAE7E,IAAAA,KAAIA,GAAE,SAAS,IAAI;AACnB,QAAIA,GAAE,CAAC,IAAI,IAAM,QAAO;AACxB,QAAI,OAAO,KAAMA,GAAE,CAAC,MAAM,KAAS,EAAEA,GAAE,CAAC,IAAI,KAAO,QAAO;AAG1D,QAAItC,KAAI,OAAO,SAAS,IAAI,IAAI,IAAI,KAAK,EAAE;AAC3C,IAAAA,GAAE,CAAC,IAAI;AACP,IAAAA,GAAE,IAAI,MAAM,CAAC;AAEb,QAAI,OAAO;AACX,QAAI,OAAO;AACX,WAAO,OAAO,KAAKA,GAAE,IAAI,MAAM,KAAQ,EAAEA,GAAE,OAAO,CAAC,IAAI,MAAO,EAAE,MAAM,EAAE,KAAK;AAE7E,IAAAA,KAAIA,GAAE,SAAS,IAAI;AACnB,QAAIA,GAAE,CAAC,IAAI,IAAM,QAAO;AACxB,QAAI,OAAO,KAAMA,GAAE,CAAC,MAAM,KAAS,EAAEA,GAAE,CAAC,IAAI,KAAO,QAAO;AAG1D,IAAAQ,KAAI,YAAY,IAAI,OAAO;AAI3B,WAAO,CAAC,IAAI;AACZ,WAAO,CAAC,IAAIA,KAAI,YAAY;AAC5B,WAAO,CAAC,IAAI;AACZ,WAAO,CAAC,IAAI8B,GAAE;AACd,WAAO,IAAIA,IAAG,CAAC;AACf,WAAO,IAAI,IAAI,IAAI;AACnB,WAAO,IAAI,IAAI,IAAItC,GAAE;AACrB,WAAO,IAAIA,IAAG,IAAI,IAAI;AAEtB,WAAO;EACX;;;EAIE,gBAAiB,QAAQ,KAAK;AAC5B,QAAI,IAAI,SAAS,EAAG,QAAO;AAC3B,QAAI,IAAI,SAAS,GAAI,QAAO;AAC5B,QAAI,IAAI,CAAC,MAAM,GAAM,QAAO;AAC5B,QAAI,IAAI,CAAC,MAAM,IAAI,SAAS,EAAG,QAAO;AACtC,QAAI,IAAI,CAAC,MAAM,EAAM,QAAO;AAE5B,UAAM,OAAO,IAAI,CAAC;AAClB,QAAI,SAAS,EAAG,QAAO;AACvB,QAAI,IAAI,QAAQ,IAAI,OAAQ,QAAO;AACnC,QAAI,IAAI,IAAI,IAAI,MAAM,EAAM,QAAO;AAEnC,UAAM,OAAO,IAAI,IAAI,IAAI;AACzB,QAAI,SAAS,EAAG,QAAO;AACvB,QAAK,IAAI,OAAO,SAAU,IAAI,OAAQ,QAAO;AAE7C,QAAI,IAAI,CAAC,IAAI,IAAM,QAAO;AAC1B,QAAI,OAAO,KAAM,IAAI,CAAC,MAAM,KAAS,EAAE,IAAI,CAAC,IAAI,KAAO,QAAO;AAE9D,QAAI,IAAI,OAAO,CAAC,IAAI,IAAM,QAAO;AACjC,QAAI,OAAO,KAAM,IAAI,OAAO,CAAC,MAAM,KAAS,EAAE,IAAI,OAAO,CAAC,IAAI,KAAO,QAAO;AAE5E,QAAI,OAAO,IAAI,SAAS,GAAG,IAAI,IAAI;AACnC,QAAI,KAAK,WAAW,MAAM,KAAK,CAAC,MAAM,EAAM,QAAO,KAAK,SAAS,CAAC;AAClE,QAAI,KAAK,SAAS,GAAI,QAAO;AAE7B,QAAI,OAAO,IAAI,SAAS,IAAI,IAAI;AAChC,QAAI,KAAK,WAAW,MAAM,KAAK,CAAC,MAAM,EAAM,QAAO,KAAK,MAAM,CAAC;AAC/D,QAAI,KAAK,SAAS,GAAI,OAAM,IAAI,MAAM,sBAAsB;AAE5D,QAAIsC,KAAI,IAAI,GAAG,IAAI;AACnB,QAAIA,GAAE,IAAI,SAAS,CAAC,KAAK,EAAG,CAAAA,KAAI,IAAI,GAAG,CAAC;AAExC,QAAItC,KAAI,IAAI,GAAG,IAAI,SAAS,IAAI,IAAI,CAAC;AACrC,QAAIA,GAAE,IAAI,SAAS,CAAC,KAAK,EAAG,CAAAA,KAAI,IAAI,GAAG,CAAC;AAExC,WAAO,IAAIsC,GAAE,YAAY,YAAY,MAAM,EAAE,GAAG,CAAC;AACjD,WAAO,IAAItC,GAAE,YAAY,YAAY,MAAM,EAAE,GAAG,EAAE;AAElD,WAAO;EACX;EAEE,UAAWQ,MAAK,SAAS,QAAQ,MAAM,SAAS;AAC9C,QAAI,SAAS;AACX,YAAM,WAAW;AACjB,gBAAU,CAAC,YAAY;AACrB,cAAM,QAAQ,SAAS,SAAS,QAAQ,MAAM,MAAM,OAAO;AAE3D,cAAM,UAAU,iBAAiB,cAAc,MAAM,WAAW;AAChE,YAAI,CAAC,QAAS,OAAM,IAAI,MAAM,iBAAiB;AAE/C,eAAO,IAAI,GAAG,KAAK;MAC3B;IACA;AAEI,UAAM,IAAI,IAAI,GAAG,MAAM;AACvB,QAAI,EAAE,IAAI,SAAS,CAAC,KAAK,KAAK,EAAE,OAAM,EAAI,QAAO;AAEjD,QAAI;AACJ,QAAI;AACF,YAAM,GAAG,KAAK,SAAS,QAAQ,EAAE,WAAW,MAAM,GAAG,SAAS,MAAM,KAAI,CAAE;IAChF,SAAa,KAAK;AACZ,aAAO;IACb;AAEI,IAAAA,KAAI,UAAU,IAAI,IAAI,EAAE,YAAY,YAAY,MAAM,EAAE,GAAG,CAAC;AAC5D,IAAAA,KAAI,UAAU,IAAI,IAAI,EAAE,YAAY,YAAY,MAAM,EAAE,GAAG,EAAE;AAC7D,IAAAA,KAAI,QAAQ,IAAI;AAEhB,WAAO;EACX;EAEE,YAAa,KAAK,OAAO,QAAQ;AAC/B,UAAM,SAAS,EAAE,GAAG,IAAI,SAAS,GAAG,EAAE,GAAG,GAAG,IAAI,SAAS,IAAI,EAAE,EAAC;AAEhE,UAAM,OAAO,IAAI,GAAG,OAAO,CAAC;AAC5B,UAAM,OAAO,IAAI,GAAG,OAAO,CAAC;AAC5B,QAAI,KAAK,IAAI,SAAS,CAAC,KAAK,KAAK,KAAK,IAAI,SAAS,CAAC,KAAK,EAAG,QAAO;AACnE,QAAI,KAAK,IAAI,GAAG,EAAE,MAAM,KAAK,KAAK,OAAM,KAAM,KAAK,OAAM,EAAI,QAAO;AAEpE,UAAM,OAAO,cAAc,MAAM;AACjC,QAAI,SAAS,KAAM,QAAO;AAE1B,UAAM2U,SAAQ,KAAK,UAAS;AAC5B,UAAM,UAAU,GAAG,OAAO,OAAO,QAAQA,MAAK;AAC9C,WAAO,UAAU,IAAI;EACzB;EAEE,aAAc,QAAQ,KAAK,OAAO,OAAO;AACvC,UAAM,SAAS,EAAE,GAAG,IAAI,MAAM,GAAG,EAAE,GAAG,GAAG,IAAI,MAAM,IAAI,EAAE,EAAC;AAE1D,UAAM,OAAO,IAAI,GAAG,OAAO,CAAC;AAC5B,UAAM,OAAO,IAAI,GAAG,OAAO,CAAC;AAC5B,QAAI,KAAK,IAAI,SAAS,CAAC,KAAK,KAAK,KAAK,IAAI,SAAS,CAAC,KAAK,EAAG,QAAO;AAEnE,QAAI,KAAK,OAAM,KAAM,KAAK,OAAM,EAAI,QAAO;AAG3C,QAAIA;AACJ,QAAI;AACF,MAAAA,SAAQ,GAAG,cAAc,OAAO,QAAQ,KAAK;IACnD,SAAa,KAAK;AACZ,aAAO;IACb;AAEI,kBAAc,QAAQA,MAAK;AAE3B,WAAO;EACX;EAEE,KAAM,QAAQ,QAAQ,QAAQ,MAAM,QAAQ,MAAM,MAAM;AACtD,UAAM,OAAO,cAAc,MAAM;AACjC,QAAI,SAAS,KAAM,QAAO;AAE1B,UAAM,SAAS,IAAI,GAAG,MAAM;AAC5B,QAAI,OAAO,IAAI,SAAS,CAAC,KAAK,KAAK,OAAO,OAAM,EAAI,QAAO;AAE3D,UAAMA,SAAQ,KAAK,UAAS,EAAG,IAAI,MAAM;AAEzC,QAAI,WAAW,QAAW;AACxB,YAAMqK,QAAOrK,OAAM,OAAO,MAAM,IAAI;AACpC,YAAMpE,UAAS,GAAG,KAAI,EAAG,OAAOyO,KAAI,EAAE,OAAM;AAC5C,eAAS,IAAI,GAAG,IAAI,IAAI,EAAE,EAAG,QAAO,CAAC,IAAIzO,QAAO,CAAC;IACvD,OAAW;AACL,UAAI,CAAC,KAAM,QAAO,IAAI,WAAW,EAAE;AACnC,YAAM,IAAIoE,OAAM,KAAI,EAAG,QAAQ,MAAM,EAAE;AACvC,eAAS,IAAI,GAAG,IAAI,IAAI,EAAE,EAAG,MAAK,CAAC,IAAI,EAAE,CAAC;AAE1C,UAAI,CAAC,KAAM,QAAO,IAAI,WAAW,EAAE;AACnC,YAAM,IAAIA,OAAM,KAAI,EAAG,QAAQ,MAAM,EAAE;AACvC,eAAS,IAAI,GAAG,IAAI,IAAI,EAAE,EAAG,MAAK,CAAC,IAAI,EAAE,CAAC;AAE1C,YAAMhF,QAAO,OAAO,MAAM,MAAM,IAAI;AAEpC,YAAM,UAAUA,iBAAgB,cAAcA,MAAK,WAAW,OAAO;AACrE,UAAI,CAAC,QAAS,QAAO;AAErB,aAAO,IAAIA,KAAI;IACrB;AAEI,WAAO;EACX;AACA;ICrZA,WAAiBlQ,IAAiBE,UAAyB;;ACC3D,OAAO,eAAeoB,UAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5DA,SAAA,kCAA0CA,SAAA,yBAAiC;AAC3E,IAAM,yBAAN,cAAqC,MAAM;EACvC,YAAY,SAAS;AACjB,UAAM,4CAA4C,QAAQ,MAAM,EAAE;EAC1E;AACA;AAC8BA,SAAA,yBAAG;AACjC,IAAM,kCAAN,cAA8C,MAAM;EAChD,cAAc;AACV,UAAM,0BAA0B;EACxC;AACA;AACuCA,SAAA,kCAAG;;ACb1C,MAAIod,mBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,QAAI,OAAO,OAAW,MAAK;AAC3B,QAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,QAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,aAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,eAAO,EAAE,CAAC;MAAE,EAAE;;AAE7D,WAAO,eAAe,GAAG,IAAI,IAAI;QAC/B,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,QAAI,OAAO,OAAW,MAAK;AAC3B,MAAE,EAAE,IAAI,EAAE,CAAC;;AAEf,MAAIsb,sBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,WAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;EACtE,KAAK,SAAS,GAAG,GAAG;AAChB,MAAE,SAAS,IAAI;EACnB;AACA,MAAIub,gBAAgBvb,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,QAAI,UAAU,SAAS,GAAG;AACtB,gBAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,YAAI,KAAK,CAAA;AACT,iBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,eAAO;MACnB;AACQ,aAAO,QAAQ,CAAC;IACxB;AACI,WAAO,SAAUhd,MAAK;AAClB,UAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,UAAI,SAAS,CAAA;AACb,UAAIA,QAAO;AAAM,iBAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,CAAAoc,iBAAgB,QAAQpc,MAAK,EAAE,CAAC,CAAC;;AAC/H,MAAAsc,oBAAmB,QAAQtc,IAAG;AAC9B,aAAO;IACf;EACA,GAAC;AACD,SAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,UAAkB,UAAA;AAClB,UAAA,kBAA0B;AAC1B,UAAA,cAAsBiE;AACtB,UAAA,SAAiBuK;AACjB,UAAA,aAAqB;AACrB,UAAA,iBAAyB;AACzB,UAAA,uBAA+B;AAC/B,UAAA,OAAehG;AACf,UAAA,aAAqB;AACrB,UAAA,cAAsB;AACtB,UAAA,WAAmB;AACnB,UAAA,gBAAwB;AACxB,QAAMhF,YAAW9F;AACjB,QAAMoG,UAASyY,cAAa3e,wBAAA,CAAiB;AAC7C,QAAMiY,aAAY0G,cAAahb,QAAoB;AACnD,QAAMub,eAAc7a;AACpB,QAAM4a,YAAWza;AACjB,WAAS,gBAAgB,SAAS;AAC9B,0BAAsB,OAAO;AAC7B,WAAOoB,UAAS,OAAO,KAAKqS,WAAU,gBAAgB,SAAS,IAAI,EAAE,MAAM;;AAE/E,WAAS5R,aAAY,MAAM;AACvB,WAAOH,QAAO,YAAY,IAAI;;AAElC,WAAS0K,QAAOjR,SAAQ;AACpB,WAAOuG,QAAO,WAAW,QAAQ,EAAE,OAAOvG,OAAM,EAAE,OAAM;;AAE5D,UAAA,UAAkBiR;AAClB,WAAS,WAAW,OAAO;AACvB,YAAO,GAAI,QAAQ,SAAShL,UAAS,OAAO,OAAO,KAAK,CAAC;;AAS7D,WAAS,eAAe,SAAS,QAAQyS,YAAW;AAChD,UAAMlO,WAAS,GAAI,QAAQ,SAAS,OAAO;AAC3C,WAAO,qBAAqBA,SAAQ,QAAQkO,UAAS;;AASzD,WAAS,qBAAqBlO,SAAQ,QAAQkO,YAAW;AACrD,WAAOJ,WAAU,YAAYI,YAAWlO,SAAQ,MAAM;;AAQ1D,WAASS,MAAK,SAAS,SAAS;AAC5B,0BAAsB,OAAO;AAC7B,UAAM,eAAegG,QAAO,OAAO;AACnC,WAAO,WAAW,cAAc,OAAO;;AAQ3C,WAAS,WAAW,cAAc,SAAS;AACvC,WAAOhL,UAAS,OAAO,KAAKqS,WAAU,UAAU,cAAc,OAAO,EAAE,SAAS;;AAOpF,WAAS,YAAY,SAAS;AAC1B,QAAI;AACJ,QAAI,SAAS;AACT,iBAAU,GAAIiH,aAAY,cAAc,OAAO;AAC/C,eAAS,gBAAgB,OAAO;WAE/B;AACD,SAAG;AACC,kBAAU7Y,aAAY,EAAE;eACnB,CAAC4R,WAAU,iBAAiB,OAAO;AAC5C,eAASrS,UAAS,OAAO,KAAKqS,WAAU,gBAAgB,OAAO,EAAE,MAAM;;AAE3E,WAAO,EAAE,QAAQ,QAAO;;AAM5B,WAAS,WAAW;AAChB,WAAO5R,aAAY,EAAE,EAAE,SAAS,KAAK;;AAOzC,WAAS,cAAc,SAAS;AAC5B,0BAAsB,OAAO;AAC7B,UAAM,SAAST,UAAS,OAAO,KAAKqS,WAAU,gBAAgB,OAAO,EAAE,MAAM;AAC7E,WAAO,EAAE,QAAQ,QAAO;;AAE5B,WAAS,sBAAsB,SAAS;AACpC,QAAI,CAAC,SAAS;AACV,YAAM,IAAIgH,UAAS,gCAA+B;;AAEtD,QAAI,CAACrZ,UAAS,OAAO,SAAS,OAAO,KAAK,QAAQ,WAAW,IAAI;AAC7D,YAAM,IAAIqZ,UAAS,uBAAuB,OAAO;;;;;ACnJzD,IAAIT,oBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,MAAI,OAAO,OAAW,MAAK;AAC3B,MAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,MAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,WAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,aAAO,EAAE,CAAC;IAAE,EAAE;EACjE;AACI,SAAO,eAAe,GAAG,IAAI,IAAI;AACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,MAAI,OAAO,OAAW,MAAK;AAC3B,IAAE,EAAE,IAAI,EAAE,CAAC;AACf;AACA,IAAIsb,uBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,SAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;AACtE,KAAK,SAAS,GAAG,GAAG;AAChB,IAAE,SAAS,IAAI;AACnB;AACA,IAAIub,iBAAgBvb,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,MAAI,UAAU,SAAS,GAAG;AACtB,cAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,UAAI,KAAK,CAAA;AACT,eAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,aAAO;IACnB;AACQ,WAAO,QAAQ,CAAC;EACxB;AACI,SAAO,SAAUhd,MAAK;AAClB,QAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,QAAI,SAAS,CAAA;AACb,QAAIA,QAAO;AAAM,eAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAWoc,mBAAgB,QAAQpc,MAAK,EAAE,CAAC,CAAC;;AAC/Hsc,yBAAmB,QAAQtc,IAAG;AAC9B,WAAO;EACf;AACA,GAAC;AACD,OAAO,eAAe,KAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,IAAA,SAAiB,IAAA,SAAiB;AAClC,IAAM,gBAAgBuc,eAAa7e,eAA0B;AAC7D,IAAMqE,UAAS,cAAc;AACf,IAAA,SAAGA;AACjB,IAAMgB,UAAS,cAAc;AACf,IAAA,SAAGA;ACvCjB,IAAIqZ,oBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,MAAI,OAAO,OAAW,MAAK;AAC3B,MAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,MAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,WAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,aAAO,EAAE,CAAC;IAAE,EAAE;EACjE;AACI,SAAO,eAAe,GAAG,IAAI,IAAI;AACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,MAAI,OAAO,OAAW,MAAK;AAC3B,IAAE,EAAE,IAAI,EAAE,CAAC;AACf;AACA,IAAIsb,uBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,SAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;AACtE,KAAK,SAAS,GAAG,GAAG;AAChB,IAAE,SAAS,IAAI;AACnB;AACA,IAAIub,iBAAgBvb,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,MAAI,UAAU,SAAS,GAAG;AACtB,cAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,UAAI,KAAK,CAAA;AACT,eAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,aAAO;IACnB;AACQ,WAAO,QAAQ,CAAC;EACxB;AACI,SAAO,SAAUhd,MAAK;AAClB,QAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,QAAI,SAAS,CAAA;AACb,QAAIA,QAAO;AAAM,eAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAWoc,mBAAgB,QAAQpc,MAAK,EAAE,CAAC,CAAC;;AAC/Hsc,yBAAmB,QAAQtc,IAAG;AAC9B,WAAO;EACf;AACA,GAAC;AACD,IAAIkd,cAAalc,kBAAQA,eAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,WAAS,MAAM,OAAO;AAAE,WAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU2D,UAAS;AAAE,MAAAA,SAAQ,KAAK;IAAE,CAAE;EAAE;AAC1G,SAAO,KAAK,MAAM,IAAI,UAAU,SAAUA,UAAS,QAAQ;AACvD,aAAS,UAAU,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,KAAK,KAAK,CAAC;MAAE,SAAU,GAAG;AAAE,eAAO,CAAC;MAAE;IAAE;AACzF,aAAS,SAAS,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,OAAO,EAAE,KAAK,CAAC;MAAE,SAAU,GAAG;AAAE,eAAO,CAAC;MAAE;IAAE;AAC5F,aAAS,KAAK,QAAQ;AAAE,aAAO,OAAOA,SAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;IAAE;AAC5G,UAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,KAAI,CAAE;EAC5E,CAAK;AACL;AACA,OAAO,eAAewY,OAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5CA,MAAA,WAAG;AACQA,MAAA,sBAAG;AACRA,MAAA,iBAAG;AACRA,MAAA,YAAG;AACGA,MAAA,kBAAG;AACWA,MAAA,gCAAG;AACjBA,MAAA,kBAAG;AACPA,MAAA,cAAG;AACVA,MAAA,OAAG3U;AACK2U,MAAA,eAAG;AACNA,MAAA,YAAG;AACDA,MAAA,cAAG;AACIA,MAAA,qBAAG;AACKA,MAAA,6BAAG;AACTA,MAAA,uBAAG;AACZA,MAAA,cAAG;AACtB,IAAM3Z,aAAW9F;AACjB,IAAM,MAAM6e,eAAa3e,KAAiB;AAC1C,IAAM,eAAe2D;AACrB,IAAMsb,aAAW5a;AACjB,IAAM,UAAUG;AAChB,IAAM0a,gBAAczZ;AACpB,IAAM,gBAAgBsC;AACtB,SAAS,SAAS,eAAe;AAC7B,SAAO,EAAE,eAAe,YAAY,CAAA,GAAI,SAAS,CAAA,EAAE;AACvD;AAUA,SAAS,oBAAoB,QAAQ,MAAMwX,MAAK;AAC5C,MAAIA,QAAO,MAAM;AACb,UAAM,IAAIN,WAAS,oBAAmB;EAC9C;AACI,MAAIM,KAAI,YAAY;AAChB,UAAM,IAAIN,WAAS,kCAAkC,UAAU;EACvE;AACI,EAAAM,KAAI,WAAW,KAAK,EAAE,QAAgB,KAAU,CAAE;AAClD,SAAOA;AACX;AACA,SAAS,eAAe,QAAQA,MAAK;AACjC,MAAIA,KAAI,YAAY;AAChB,UAAM,IAAIN,WAAS,kCAAkC,QAAQ;EACrE;AACI,EAAAM,KAAI,QAAQ,KAAK,MAAM;AAC3B;AAKA,SAAS,UAAUA,MAAK,mBAAmB;AACvC,SAAO,IAAI,QAAQ,gBAAgBA,IAAG,GAAG,iBAAiB;AAC9D;AAKA,SAAS,gBAAgBA,MAAK,mBAAmB;AAC7C,SAAO,IAAI,QAAQ,gBAAgBA,IAAG,GAAG,iBAAiB;AAC9D;AACA,SAAS,8BAA8B,SAAS,mBAAmB;AAC/D,SAAO,IAAI,QAAQ,SAAS,iBAAiB;AACjD;AACA,SAAS,gBAAgBA,MAAK;AAC1B,SAAO;IACHA,KAAI;IACJA,KAAI,WAAW,IAAI,CAAC,OAAO,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC;IAC/CA,KAAI;EACZ;AACA;AACA,SAAS,YAAYA,MAAK;AACtB,MAAIJ;AACJ,SAAO;IACH;MACII,KAAI;MACJA,KAAI,WAAW,IAAI,CAAC,OAAO,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC;MAC/CA,KAAI;IAChB;KACSJ,MAAKI,KAAI,gBAAgB,QAAQJ,QAAO,SAASA,MAAK,CAAA;EAC/D;AACA;AACA,SAASvU,MAAK2U,MAAK,eAAe,mBAAmB,QAAQ;AACzD,SAAOD,YAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,SAAI,GAAI,cAAc,UAAU,aAAa,GAAG;AAC5C,YAAM,eAAe,gBAAgBC,MAAK,iBAAiB;AAC3D,YAAMlH,cAAY,GAAI,aAAa,YAAY,cAAc,aAAa;AAC1E,aAAO,aAAa,WAAU,GAAI,aAAa,aAAa,aAAa,EAAE,QAAQA,YAAWkH,IAAG;IAC7G,OACa;AAED,YAAM,aAAa,gBAAgBA,IAAG;AACtC,YAAMlH,aAAY,MAAM,cAAc,KAAK,YAAY,iBAAiB;AACxE,aAAO,aAAa,cAAc,QAAQA,YAAWkH,IAAG;IACpE;EACA,CAAK;AACL;AAIA,SAAS,aAAa,cAAc,iBAAiBA,MAAK;AACtD,MAAI,CAACA,KAAI,YAAY;AACjB,IAAAA,KAAI,aAAa,MAAMA,KAAI,QAAQ,MAAM;EACjD;AACI,QAAM,cAAcA,KAAI,QAAQ,UAAU,CAAC,WAAW,aAAa,OAAO,MAAM,CAAC;AACjF,MAAI,gBAAgB,IAAI;AACpB,UAAM,IAAIN,WAAS,uBAAsB;EACjD;AACI,EAAAM,KAAI,WAAW,WAAW,IAAI;AAC9B,SAAOA;AACX;AACA,SAAS,UAAUA,MAAK;AACpB,MAAI,CAACA,KAAI,YAAY;AAIjB,IAAAA,KAAI,aAAa,CAAA;EACzB;AACI,UAAO,GAAI,QAAQ,QAAQ,CAAC,gBAAgBA,IAAG,GAAGA,KAAI,UAAU,CAAC;AACrE;AACA,SAAS,YAAY,UAAU;AAC3B,QAAM,kBAAiB,GAAI,QAAQ,QAAQ,QAAQ;AACnD,QAAM,OAAO,eAAe,CAAC;AAC7B,QAAM,YAAY;IACd,eAAe,KAAK,CAAC;IACrB,YAAY,KAAK,CAAC,EAAE,IAAI,CAAC,eAAe;MACpC,QAAQ,UAAU,CAAC;MACnB,MAAM,UAAU,CAAC;IAC7B,EAAU;IACF,SAAS,KAAK,CAAC;EACvB;AACI,QAAM,aAAa,eAAe,CAAC;AACnC,SAAO;IACH,eAAe,UAAU;IACzB,YAAY,UAAU;IACtB,SAAS,UAAU;IACnB;EACR;AACA;AACA,SAAS,mBAAmB,QAAQA,MAAK;AACrC,MAAIJ;AACJ,MAAI,CAAC,MAAM,QAAQI,KAAI,UAAU,KAAKA,KAAI,WAAW,WAAW,GAAG;AAC/D,WAAO;EACf;AACI,aAAW,KAAKA,KAAI,SAAS;AACzB,UAAM,aAAY,GAAI,aAAa,sBAAsB,QAAQA,KAAI,QAAQ,CAAC,IAAIJ,MAAKI,KAAI,gBAAgB,QAAQJ,QAAO,SAAS,SAASA,IAAG,CAAC,CAAC;AACjJ,QAAI,CAAC;AACD,aAAO;EACnB;AACI,SAAO;AACX;AACA,SAAS,2BAA2B,QAAQI,MAAK;AAC7C,MAAIJ;AACJ,aAAW,KAAKI,KAAI,SAAS;AACzB,SAAKJ,MAAKI,KAAI,gBAAgB,QAAQJ,QAAO,SAAS,SAASA,IAAG,CAAC,GAAG;AAClE,YAAM,aAAY,GAAI,aAAa,sBAAsB,QAAQI,KAAI,QAAQ,CAAC,GAAGA,KAAI,WAAW,CAAC,CAAC;AAClG,UAAI,CAAC;AACD,eAAO;IACvB;EACA;AACI,SAAO;AACX;AACA,SAAS,qBAAqB,SAAS;AACnC,MAAItL,MAAKC;AACT,MAAI,SAAS;AACT,IAAAA,SAAO,GAAIgL,cAAY,cAAc,QAAQ,OAAO;AACpD,IAAAjL,OAAM,QAAQ,UAAS,GAAIiL,cAAY,cAAc,QAAQ,MAAM,KAAI,GAAI,aAAa,iBAAiBhL,KAAI;EACrH,OACS;AACD,KAAC,EAAE,SAASA,OAAM,QAAQD,KAAG,KAAK,GAAI,aAAa,aAAW;EACtE;AACI,SAAO;IACH,QAAQA;IACR,MAAM,CAACsL,MAAK,sBAAsBD,YAAU,MAAM,QAAQ,QAAQ,aAAa;AAC3E,YAAMjH,aAAY,8BAA8BkH,MAAK,iBAAiB;AACtE,cAAO,GAAI,aAAa,YAAYlH,YAAWnE,KAAI;IAC/D,CAAS;EACT;AACA;AACA,SAAS,YAAYiJ,MAAK;AACtB,MAAI,MAAM,QAAQA,IAAG,KAAKA,KAAI,WAAW,GAAG;AACxC,UAAM,IAAI,MAAM,gCAAgC;EACxD;AACI,QAAM,WAAWA;AACjB,MAAI,CAAC,MAAM,QAAQ,SAAS,CAAC,CAAC,GAAG;AAC7B,UAAM,IAAI,MAAM,gCAAgC;EACxD;AACI,MAAI,CAAC,MAAM,QAAQ,SAAS,CAAC,CAAC,GAAG;AAC7B,UAAM,IAAI,MAAM,iCAAiC;EACzD;AACI,WAAS,CAAC,EAAE,QAAQ,aAAW;AAC3B,QAAI,CAACvX,WAAS,OAAO,SAAS,OAAO,GAAG;AACpC,YAAM,IAAI,MAAM,0BAA0B;IACtD;EACA,CAAK;AACD,QAAM,UAAU,gBAAgB,SAAS,CAAC,CAAC;AAC3C,SAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,OAAO,GAAG,EAAE,YAAY,SAAS,CAAC,EAAC,CAAE;AAChF;AACA,SAAS,gBAAgBuX,MAAK;AAC1B,MAAI,MAAM,QAAQA,IAAG,KAAKA,KAAI,WAAW,GAAG;AACxC,UAAM,IAAI,MAAM,gCAAgC;EACxD;AACI,QAAM,QAAQA;AACd,MAAI,CAACvX,WAAS,OAAO,SAAS,MAAM,CAAC,CAAC,GAAG;AACrC,UAAM,IAAI,MAAM,oCAAoC;EAC5D;AACI,MAAI,CAAC,MAAM,QAAQ,MAAM,CAAC,CAAC,GAAG;AAC1B,UAAM,IAAI,MAAM,iCAAiC;EACzD;AACI,MAAI,CAAC,MAAM,QAAQ,MAAM,CAAC,CAAC,GAAG;AAC1B,UAAM,IAAI,MAAM,gCAAgC;EACxD;AACI,QAAM,CAAC,EAAE,QAAQ,aAAW;AACxB,QAAI,CAACA,WAAS,OAAO,SAAS,OAAO,GAAG;AACpC,YAAM,IAAI,MAAM,0BAA0B;IACtD;EACA,CAAK;AACD,SAAO;IACH,eAAe,MAAM,CAAC;IACtB,YAAY,MAAM,CAAC,EAAE,IAAI,aAAW,eAAe,OAAO,CAAC;IAC3D,SAAS,MAAM,CAAC;EACxB;AACA;AACA,SAAS,eAAeuX,MAAK;AACzB,MAAI,MAAM,QAAQA,IAAG,KAAKA,KAAI,WAAW,GAAG;AACxC,UAAM,IAAI,MAAM,gCAAgC;EACxD;AACI,QAAM,QAAQA;AACd,MAAI,OAAO,MAAM,CAAC,MAAM,UAAU;AAC9B,UAAM,IAAI,MAAM,gCAAgC;EACxD;AACI,MAAI,CAAC,MAAM,QAAQ,MAAM,CAAC,CAAC,GAAG;AAC1B,UAAM,IAAI,MAAM,iCAAiC;EACzD;AACI,SAAO,EAAE,QAAQ,MAAM,CAAC,GAAG,MAAM,MAAM,CAAC,EAAC;AAC7C;;AC1RA,IAAIgC;AACJ,OAAO,eAAeK,UAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5CA,SAAA,WAAG;AACAA,SAAA,cAAG;AACHA,SAAA,cAAG;AACTA,SAAA,QAAG;AACJA,SAAA,OAAG;AACFA,SAAA,QAAGxZ;AACDwZ,SAAA,UAAG;AACJA,SAAA,SAAGC;AACjB,IAAI;CACH,SAAUC,UAAS;AAChB,EAAAA,SAAQ,OAAO,IAAI;AACnB,EAAAA,SAAQ,MAAM,IAAI;AAClB,EAAAA,SAAQ,OAAO,IAAI;AACnB,EAAAA,SAAQ,SAAS,IAAI;AACzB,GAAG,YAAY,UAAU,CAAA,EAAG;AAC5B,IAAI;CACH,SAAUC,WAAU;AACjB,EAAAA,UAAS,KAAK,IAAI;AAClB,EAAAA,UAAS,OAAO,IAAI;AACpB,EAAAA,UAAS,MAAM,IAAI;AACnB,EAAAA,UAAS,QAAQ,IAAI;AACrB,EAAAA,UAAS,WAAW,IAAI;AAC5B,GAAG,aAAa,WAAW,CAAA,EAAG;AAC9B,IAAI;CACH,SAAUC,WAAU;AACjB,EAAAA,UAAS,OAAO,IAAI;AACpB,EAAAA,UAAS,MAAM,IAAI;AACnB,EAAAA,UAAS,OAAO,IAAI;AACpB,EAAAA,UAAS,SAAS,IAAI;AACtB,EAAAA,UAAS,UAAU,IAAI;AAC3B,GAAG,aAA6BJ,SAAA,WAAG,WAAW,CAAA,EAAG;AACjD,IAAM,cAAc;EAChB,CAAC,SAAS,OAAO,GAAG;EACpB,CAAC,SAAS,IAAI,GAAG;EACjB,CAAC,SAAS,KAAK,GAAG;EAClB,CAAC,SAAS,KAAK,GAAG;EAClB,CAAC,SAAS,QAAQ,GAAG;AACzB;AACA,IAAM,oBAAoB,YAAY,SAAS,OAAO;AACtD,IAAI,WAAW,OAAO,YAAY,cAC5B,qBACCL,OAAK,YAAY,QAAQ,IAAI,SAAS,OAAO,QAAQA,SAAO,SAASA,OAAK;AACjF,SAAS,YAAY,OAAO;AACxB,aAAW,YAAY,KAAK;AAChC;AACA,SAAS,cAAc;AACnB,SAAO,OAAO,KAAK,WAAW,EAAE,KAAK,CAAAxd,SAAO,YAAYA,IAAG,MAAM,QAAQ;AAC7E;AACA,SAAS,MAAM,SAAS,YAAY;AAChC,MAAI,YAAY,GAAG;AACf,mBAAe;MACX;MACA;MACA,SAAS,QAAQ;MACjB,OAAO,SAAS;IAC5B,CAAS;EACT;AACA;AACA,SAAS,KAAK,SAAS,YAAY;AAC/B,MAAI,YAAY,GAAG;AACf,mBAAe;MACX;MACA;MACA,SAAS,QAAQ;MACjB,OAAO,SAAS;IAC5B,CAAS;EACT;AACA;AACA,SAASqE,QAAM,SAAS,YAAY;AAChC,MAAI,YAAY,IAAI;AAChB,mBAAe;MACX;MACA;MACA,SAAS,QAAQ;MACjB,OAAO,SAAS;IAC5B,CAAS;EACT;AACA;AACA,SAAS,QAAQ,SAAS,YAAY;AAClC,MAAI,YAAY,GAAG;AACf,mBAAe;MACX;MACA;MACA,SAAS,QAAQ;MACjB,OAAO,SAAS;IAC5B,CAAS;EACT;AACA;AACA,SAAS,eAAe,EAAE,SAAS,SAAS,OAAO,WAAU,GAAK;AAC9D,QAAM,OAAO,aAAY;AACzB,QAAM,oBAAoB,aAAa,IAAI,UAAU,MAAM;AAC3D,UAAQ,IAAI,IAAI,IAAI,KAAK,KAAK,GAAG,OAAO,IAAI,SAAS,SAAS,IAAI,iBAAiB,IAAI,OAAO,EAAE;AACpG;AACA,SAAS,eAAe;AACpB,QAAMoM,OAAM,CAAC,GAAGvS,KAAI,MAAM,GAAG,IAAI,MAAMA,EAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAACA,EAAC;AAChE,QAAM,OAAO,oBAAI,KAAI;AACrB,SAAO,GAAGuS,KAAI,KAAK,SAAQ,CAAE,CAAC,IAAIA,KAAI,KAAK,WAAU,CAAE,CAAC,IAAIA,KAAI,KAAK,WAAU,CAAE,CAAC,IAAIA,KAAI,KAAK,gBAAe,GAAI,CAAC,CAAC;AACxH;AACA,SAASqN,SAAO,YAAY;AACxB,SAAO;IACH,OAAO,CAAC,YAAY,MAAM,SAAS,UAAU;IAC7C;IACR,OAAQzZ;IACA;IACA;IACA,SAAS,MAAM,YAAY,SAAS,QAAQ;EACpD;AACA;;ACvGA,SAAS6Z,mBAAiB;AACxB,OAAK,WAAW,CAAA;AAChB,OAAK,OAAO;AACd;AAEA,IAAA,kBAAiBA;ACoBjB,SAAS5c,KAAG,OAAO,OAAO;AACxB,SAAO,UAAU,SAAU,UAAU,SAAS,UAAU;AAC1D;AAEA,IAAA,OAAiBA;ACpCjB,IAAIA,OAAKnD;AAUT,SAASggB,eAAa,OAAOne,MAAK;AAChC,MAAI,SAAS,MAAM;AACnB,SAAO,UAAU;AACf,QAAIsB,KAAG,MAAM,MAAM,EAAE,CAAC,GAAGtB,IAAG,GAAG;AAC7B,aAAO;IACb;EACA;AACE,SAAO;AACT;AAEA,IAAA,gBAAiBme;ACpBjB,IAAIA,iBAAehgB;AAGnB,IAAI,aAAa,MAAM;AAGvB,IAAI,SAAS,WAAW;AAWxB,SAASigB,kBAAgBpe,MAAK;AAC5B,MAAI,OAAO,KAAK,UACZO,SAAQ4d,eAAa,MAAMne,IAAG;AAElC,MAAIO,SAAQ,GAAG;AACb,WAAO;EACX;AACE,MAAI,YAAY,KAAK,SAAS;AAC9B,MAAIA,UAAS,WAAW;AACtB,SAAK,IAAG;EACZ,OAAS;AACL,WAAO,KAAK,MAAMA,QAAO,CAAC;EAC9B;AACE,IAAE,KAAK;AACP,SAAO;AACT;AAEA,IAAA,mBAAiB6d;AClCjB,IAAID,iBAAehgB;AAWnB,SAASkgB,eAAare,MAAK;AACzB,MAAI,OAAO,KAAK,UACZO,SAAQ4d,eAAa,MAAMne,IAAG;AAElC,SAAOO,SAAQ,IAAI,SAAY,KAAKA,MAAK,EAAE,CAAC;AAC9C;AAEA,IAAA,gBAAiB8d;AClBjB,IAAIF,iBAAehgB;AAWnB,SAASmgB,eAAate,MAAK;AACzB,SAAOme,eAAa,KAAK,UAAUne,IAAG,IAAI;AAC5C;AAEA,IAAA,gBAAiBse;ACfjB,IAAI,eAAengB;AAYnB,SAASogB,eAAave,MAAK,OAAO;AAChC,MAAI,OAAO,KAAK,UACZO,SAAQ,aAAa,MAAMP,IAAG;AAElC,MAAIO,SAAQ,GAAG;AACb,MAAE,KAAK;AACP,SAAK,KAAK,CAACP,MAAK,KAAK,CAAC;EAC1B,OAAS;AACL,SAAKO,MAAK,EAAE,CAAC,IAAI;EACrB;AACE,SAAO;AACT;AAEA,IAAA,gBAAiBge;ACzBjB,IAAI,iBAAiBpgB;AAArB,IACI,kBAAkBE;AADtB,IAEI,eAAe2D;AAFnB,IAGI,eAAeU;AAHnB,IAII,eAAeG;AASnB,SAAS2b,YAAU,SAAS;AAC1B,MAAIje,SAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,OAAK,MAAK;AACV,SAAO,EAAEA,SAAQ,QAAQ;AACvB,QAAI,QAAQ,QAAQA,MAAK;AACzB,SAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;EAC/B;AACA;AAGAie,YAAU,UAAU,QAAQ;AAC5BA,YAAU,UAAU,QAAQ,IAAI;AAChCA,YAAU,UAAU,MAAM;AAC1BA,YAAU,UAAU,MAAM;AAC1BA,YAAU,UAAU,MAAM;AAE1B,IAAA,aAAiBA;AC/BjB,IAAIA,cAAYrgB;AAShB,SAASsgB,eAAa;AACpB,OAAK,WAAW,IAAID;AACpB,OAAK,OAAO;AACd;AAEA,IAAA,cAAiBC;ACLjB,SAASC,cAAY1e,MAAK;AACxB,MAAI,OAAO,KAAK,UACZ,SAAS,KAAK,QAAQ,EAAEA,IAAG;AAE/B,OAAK,OAAO,KAAK;AACjB,SAAO;AACT;AAEA,IAAA,eAAiB0e;ACRjB,SAASC,WAAS3e,MAAK;AACrB,SAAO,KAAK,SAAS,IAAIA,IAAG;AAC9B;AAEA,IAAA,YAAiB2e;ACJjB,SAASC,WAAS5e,MAAK;AACrB,SAAO,KAAK,SAAS,IAAIA,IAAG;AAC9B;AAEA,IAAA,YAAiB4e;ACZjB,IAAIC,eAAa,OAAOra,kBAAU,YAAYA,kBAAUA,eAAO,WAAW,UAAUA;AAEpF,IAAA,cAAiBqa;ACHjB,IAAI,aAAa1gB;AAGjB,IAAI,WAAW,OAAO,QAAQ,YAAY,QAAQ,KAAK,WAAW,UAAU;AAG5E,IAAI4B,SAAO,cAAc,YAAY,SAAS,aAAa,EAAC;AAE5D,IAAA,QAAiBA;ACRjB,IAAIA,SAAO5B;AAGX,IAAI2gB,WAAS/e,OAAK;AAElB,IAAA,UAAiB+e;ACLjB,IAAIA,WAAS3gB;AAGb,IAAI4gB,gBAAc,OAAO;AAGzB,IAAIvT,mBAAiBuT,cAAY;AAOjC,IAAIC,yBAAuBD,cAAY;AAGvC,IAAIE,mBAAiBH,WAASA,SAAO,cAAc;AASnD,SAASI,YAAU,OAAO;AACxB,MAAI,QAAQ1T,iBAAe,KAAK,OAAOyT,gBAAc,GACjD,MAAM,MAAMA,gBAAc;AAE9B,MAAI;AACF,UAAMA,gBAAc,IAAI;AACxB,QAAI,WAAW;EACnB,SAAW,GAAG;EAAA;AAEZ,MAAI,SAASD,uBAAqB,KAAK,KAAK;AAC5C,MAAI,UAAU;AACZ,QAAI,OAAO;AACT,YAAMC,gBAAc,IAAI;IAC9B,OAAW;AACL,aAAO,MAAMA,gBAAc;IACjC;EACA;AACE,SAAO;AACT;AAEA,IAAA,aAAiBC;AC5CjB,IAAIH,gBAAc,OAAO;AAOzB,IAAI,uBAAuBA,cAAY;AASvC,SAASjS,iBAAe,OAAO;AAC7B,SAAO,qBAAqB,KAAK,KAAK;AACxC;AAEA,IAAA,kBAAiBA;ACrBjB,IAAIgS,WAAS3gB;AAAb,IACI,YAAYE;AADhB,IAEI,iBAAiB2D;AAGrB,IAAI,UAAU;AAAd,IACI,eAAe;AAGnB,IAAI,iBAAiB8c,WAASA,SAAO,cAAc;AASnD,SAASK,aAAW,OAAO;AACzB,MAAI,SAAS,MAAM;AACjB,WAAO,UAAU,SAAY,eAAe;EAChD;AACE,SAAQ,kBAAkB,kBAAkB,OAAO,KAAK,IACpD,UAAU,KAAK,IACf,eAAe,KAAK;AAC1B;AAEA,IAAA,cAAiBA;ACFjB,SAASlS,WAAS,OAAO;AACvB,MAAIpN,QAAO,OAAO;AAClB,SAAO,SAAS,SAASA,SAAQ,YAAYA,SAAQ;AACvD;AAEA,IAAA,aAAiBoN;AC9BjB,IAAIkS,eAAahhB;AAAjB,IACI8O,aAAW5O;AAGf,IAAI,WAAW;AAAf,IACI+gB,YAAU;AADd,IAEIC,WAAS;AAFb,IAGI,WAAW;AAmBf,SAASlS,aAAW,OAAO;AACzB,MAAI,CAACF,WAAS,KAAK,GAAG;AACpB,WAAO;EACX;AAGE,MAAI,MAAMkS,aAAW,KAAK;AAC1B,SAAO,OAAOC,aAAW,OAAOC,YAAU,OAAO,YAAY,OAAO;AACtE;AAEA,IAAA,eAAiBlS;ACpCjB,IAAIpN,SAAO5B;AAGX,IAAImhB,eAAavf,OAAK,oBAAoB;AAE1C,IAAA,cAAiBuf;ACLjB,IAAI,aAAanhB;AAGjB,IAAI,cAAc,WAAW;AAC3B,MAAI,MAAM,SAAS,KAAK,cAAc,WAAW,QAAQ,WAAW,KAAK,YAAY,EAAE;AACvF,SAAO,MAAO,mBAAmB,MAAO;AAC1C,GAAC;AASD,SAASohB,WAAS,MAAM;AACtB,SAAO,CAAC,CAAC,cAAe,cAAc;AACxC;AAEA,IAAA,YAAiBA;AClBjB,IAAIC,cAAY,SAAS;AAGzB,IAAIC,iBAAeD,YAAU;AAS7B,SAASE,WAAS,MAAM;AACtB,MAAI,QAAQ,MAAM;AAChB,QAAI;AACF,aAAOD,eAAa,KAAK,IAAI;IACnC,SAAa,GAAG;IAAA;AACZ,QAAI;AACF,aAAQ,OAAO;IACrB,SAAa,GAAG;IAAA;EAChB;AACE,SAAO;AACT;AAEA,IAAA,YAAiBC;ACzBjB,IAAIvS,eAAahP;AAAjB,IACI,WAAWE;AADf,IAEI4O,aAAWjL;AAFf,IAGI0d,aAAWhd;AAMf,IAAI,eAAe;AAGnB,IAAI,eAAe;AAGnB,IAAI,YAAY,SAAS;AAAzB,IACIqc,gBAAc,OAAO;AAGzB,IAAI,eAAe,UAAU;AAG7B,IAAIvT,mBAAiBuT,cAAY;AAGjC,IAAI,aAAa;EAAO,MACtB,aAAa,KAAKvT,gBAAc,EAAE,QAAQ,cAAc,MAAM,EAC7D,QAAQ,0DAA0D,OAAO,IAAI;AAChF;AAUA,SAASmU,eAAa,OAAO;AAC3B,MAAI,CAAC1S,WAAS,KAAK,KAAK,SAAS,KAAK,GAAG;AACvC,WAAO;EACX;AACE,MAAI,UAAUE,aAAW,KAAK,IAAI,aAAa;AAC/C,SAAO,QAAQ,KAAKuS,WAAS,KAAK,CAAC;AACrC;AAEA,IAAA,gBAAiBC;ACtCjB,SAASC,WAAS,QAAQ5f,MAAK;AAC7B,SAAO,UAAU,OAAO,SAAY,OAAOA,IAAG;AAChD;AAEA,IAAA,YAAiB4f;ACZjB,IAAI,eAAezhB;AAAnB,IACI,WAAWE;AAUf,SAASwhB,YAAU,QAAQ7f,MAAK;AAC9B,MAAI,QAAQ,SAAS,QAAQA,IAAG;AAChC,SAAO,aAAa,KAAK,IAAI,QAAQ;AACvC;AAEA,IAAA,aAAiB6f;AChBjB,IAAIA,cAAY1hB;AAAhB,IACI4B,SAAO1B;AAGX,IAAIyhB,QAAMD,YAAU9f,QAAM,KAAK;AAE/B,IAAA,OAAiB+f;ACNjB,IAAID,cAAY1hB;AAGhB,IAAI4hB,iBAAeF,YAAU,QAAQ,QAAQ;AAE7C,IAAA,gBAAiBE;ACLjB,IAAIA,iBAAe5hB;AASnB,SAAS6hB,cAAY;AACnB,OAAK,WAAWD,iBAAeA,eAAa,IAAI,IAAI,CAAA;AACpD,OAAK,OAAO;AACd;AAEA,IAAA,aAAiBC;ACJjB,SAASC,aAAWjgB,MAAK;AACvB,MAAI,SAAS,KAAK,IAAIA,IAAG,KAAK,OAAO,KAAK,SAASA,IAAG;AACtD,OAAK,QAAQ,SAAS,IAAI;AAC1B,SAAO;AACT;AAEA,IAAA,cAAiBigB;AChBjB,IAAIF,iBAAe5hB;AAGnB,IAAI+hB,mBAAiB;AAGrB,IAAInB,gBAAc,OAAO;AAGzB,IAAIvT,mBAAiBuT,cAAY;AAWjC,SAASoB,UAAQngB,MAAK;AACpB,MAAI,OAAO,KAAK;AAChB,MAAI+f,gBAAc;AAChB,QAAI,SAAS,KAAK/f,IAAG;AACrB,WAAO,WAAWkgB,mBAAiB,SAAY;EACnD;AACE,SAAO1U,iBAAe,KAAK,MAAMxL,IAAG,IAAI,KAAKA,IAAG,IAAI;AACtD;AAEA,IAAA,WAAiBmgB;AC7BjB,IAAIJ,iBAAe5hB;AAGnB,IAAI4gB,gBAAc,OAAO;AAGzB,IAAIvT,mBAAiBuT,cAAY;AAWjC,SAASqB,UAAQpgB,MAAK;AACpB,MAAI,OAAO,KAAK;AAChB,SAAO+f,iBAAgB,KAAK/f,IAAG,MAAM,SAAawL,iBAAe,KAAK,MAAMxL,IAAG;AACjF;AAEA,IAAA,WAAiBogB;ACtBjB,IAAI,eAAejiB;AAGnB,IAAI,iBAAiB;AAYrB,SAASkiB,UAAQrgB,MAAK,OAAO;AAC3B,MAAI,OAAO,KAAK;AAChB,OAAK,QAAQ,KAAK,IAAIA,IAAG,IAAI,IAAI;AACjC,OAAKA,IAAG,IAAK,gBAAgB,UAAU,SAAa,iBAAiB;AACrE,SAAO;AACT;AAEA,IAAA,WAAiBqgB;ACtBjB,IAAI,YAAYliB;AAAhB,IACI,aAAaE;AADjB,IAEI,UAAU2D;AAFd,IAGI,UAAUU;AAHd,IAII,UAAUG;AASd,SAASuL,OAAK,SAAS;AACrB,MAAI7N,SAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,OAAK,MAAK;AACV,SAAO,EAAEA,SAAQ,QAAQ;AACvB,QAAI,QAAQ,QAAQA,MAAK;AACzB,SAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;EAC/B;AACA;AAGA6N,OAAK,UAAU,QAAQ;AACvBA,OAAK,UAAU,QAAQ,IAAI;AAC3BA,OAAK,UAAU,MAAM;AACrBA,OAAK,UAAU,MAAM;AACrBA,OAAK,UAAU,MAAM;AAErB,IAAA,QAAiBA;AC/BjB,IAAI,OAAOjQ;AAAX,IACIqgB,cAAYngB;AADhB,IAEIyhB,QAAM9d;AASV,SAASse,kBAAgB;AACvB,OAAK,OAAO;AACZ,OAAK,WAAW;IACd,QAAQ,IAAI;IACZ,OAAO,KAAKR,SAAOtB;IACnB,UAAU,IAAI;EAClB;AACA;AAEA,IAAA,iBAAiB8B;ACbjB,SAASC,YAAU,OAAO;AACxB,MAAI1gB,QAAO,OAAO;AAClB,SAAQA,SAAQ,YAAYA,SAAQ,YAAYA,SAAQ,YAAYA,SAAQ,YACvE,UAAU,cACV,UAAU;AACjB;AAEA,IAAA,aAAiB0gB;ACdjB,IAAI,YAAYpiB;AAUhB,SAASqiB,aAAW,KAAKxgB,MAAK;AAC5B,MAAI,OAAO,IAAI;AACf,SAAO,UAAUA,IAAG,IAChB,KAAK,OAAOA,QAAO,WAAW,WAAW,MAAM,IAC/C,KAAK;AACX;AAEA,IAAA,cAAiBwgB;ACjBjB,IAAIA,eAAariB;AAWjB,SAASsiB,iBAAezgB,MAAK;AAC3B,MAAI,SAASwgB,aAAW,MAAMxgB,IAAG,EAAE,QAAQ,EAAEA,IAAG;AAChD,OAAK,QAAQ,SAAS,IAAI;AAC1B,SAAO;AACT;AAEA,IAAA,kBAAiBygB;ACjBjB,IAAID,eAAariB;AAWjB,SAASuiB,cAAY1gB,MAAK;AACxB,SAAOwgB,aAAW,MAAMxgB,IAAG,EAAE,IAAIA,IAAG;AACtC;AAEA,IAAA,eAAiB0gB;ACfjB,IAAIF,eAAariB;AAWjB,SAASwiB,cAAY3gB,MAAK;AACxB,SAAOwgB,aAAW,MAAMxgB,IAAG,EAAE,IAAIA,IAAG;AACtC;AAEA,IAAA,eAAiB2gB;ACfjB,IAAI,aAAaxiB;AAYjB,SAASyiB,cAAY5gB,MAAK,OAAO;AAC/B,MAAI,OAAO,WAAW,MAAMA,IAAG,GAC3B,OAAO,KAAK;AAEhB,OAAK,IAAIA,MAAK,KAAK;AACnB,OAAK,QAAQ,KAAK,QAAQ,OAAO,IAAI;AACrC,SAAO;AACT;AAEA,IAAA,eAAiB4gB;ACrBjB,IAAI,gBAAgBziB;AAApB,IACI,iBAAiBE;AADrB,IAEI,cAAc2D;AAFlB,IAGI,cAAcU;AAHlB,IAII,cAAcG;AASlB,SAASge,WAAS,SAAS;AACzB,MAAItgB,SAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,OAAK,MAAK;AACV,SAAO,EAAEA,SAAQ,QAAQ;AACvB,QAAI,QAAQ,QAAQA,MAAK;AACzB,SAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;EAC/B;AACA;AAGAsgB,WAAS,UAAU,QAAQ;AAC3BA,WAAS,UAAU,QAAQ,IAAI;AAC/BA,WAAS,UAAU,MAAM;AACzBA,WAAS,UAAU,MAAM;AACzBA,WAAS,UAAU,MAAM;AAEzB,IAAA,YAAiBA;AC/BjB,IAAIrC,cAAYrgB;AAAhB,IACI2hB,QAAMzhB;AADV,IAEI,WAAW2D;AAGf,IAAI,mBAAmB;AAYvB,SAAS8e,WAAS9gB,MAAK,OAAO;AAC5B,MAAI,OAAO,KAAK;AAChB,MAAI,gBAAgBwe,aAAW;AAC7B,QAAI,QAAQ,KAAK;AACjB,QAAI,CAACsB,SAAQ,MAAM,SAAS,mBAAmB,GAAI;AACjD,YAAM,KAAK,CAAC9f,MAAK,KAAK,CAAC;AACvB,WAAK,OAAO,EAAE,KAAK;AACnB,aAAO;IACb;AACI,WAAO,KAAK,WAAW,IAAI,SAAS,KAAK;EAC7C;AACE,OAAK,IAAIA,MAAK,KAAK;AACnB,OAAK,OAAO,KAAK;AACjB,SAAO;AACT;AAEA,IAAA,YAAiB8gB;ACjCjB,IAAI,YAAY3iB;AAAhB,IACI,aAAaE;AADjB,IAEI,cAAc2D;AAFlB,IAGI,WAAWU;AAHf,IAII,WAAWG;AAJf,IAKI,WAAWiB;AASf,SAASid,QAAM,SAAS;AACtB,MAAI,OAAO,KAAK,WAAW,IAAI,UAAU,OAAO;AAChD,OAAK,OAAO,KAAK;AACnB;AAGAA,QAAM,UAAU,QAAQ;AACxBA,QAAM,UAAU,QAAQ,IAAI;AAC5BA,QAAM,UAAU,MAAM;AACtBA,QAAM,UAAU,MAAM;AACtBA,QAAM,UAAU,MAAM;AAEtB,IAAA,SAAiBA;ACjBjB,SAASC,YAAU,OAAO,UAAU;AAClC,MAAIzgB,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,SAAO,EAAEA,SAAQ,QAAQ;AACvB,QAAI,SAAS,MAAMA,MAAK,GAAGA,QAAO,KAAK,MAAM,OAAO;AAClD;IACN;EACA;AACE,SAAO;AACT;AAEA,IAAA,aAAiBygB;ACrBjB,IAAInB,cAAY1hB;AAEhB,IAAI8iB,oBAAkB,WAAW;AAC/B,MAAI;AACF,QAAI,OAAOpB,YAAU,QAAQ,gBAAgB;AAC7C,SAAK,CAAA,GAAI,IAAI,CAAA,CAAE;AACf,WAAO;EACX,SAAW,GAAG;EAAA;AACd,GAAC;AAED,IAAA,kBAAiBoB;ACVjB,IAAI,iBAAiB9iB;AAWrB,SAAS+iB,kBAAgB,QAAQlhB,MAAK,OAAO;AAC3C,MAAIA,QAAO,eAAe,gBAAgB;AACxC,mBAAe,QAAQA,MAAK;MAC1B,gBAAgB;MAChB,cAAc;MACd,SAAS;MACT,YAAY;IAClB,CAAK;EACL,OAAS;AACL,WAAOA,IAAG,IAAI;EAClB;AACA;AAEA,IAAA,mBAAiBkhB;ACxBjB,IAAIA,oBAAkB/iB;AAAtB,IACImD,MAAKjD;AAGT,IAAI0gB,gBAAc,OAAO;AAGzB,IAAIvT,mBAAiBuT,cAAY;AAYjC,SAASoC,cAAY,QAAQnhB,MAAK,OAAO;AACvC,MAAI,WAAW,OAAOA,IAAG;AACzB,MAAI,EAAEwL,iBAAe,KAAK,QAAQxL,IAAG,KAAKsB,IAAG,UAAU,KAAK,MACvD,UAAU,UAAa,EAAEtB,QAAO,SAAU;AAC7CkhB,sBAAgB,QAAQlhB,MAAK,KAAK;EACtC;AACA;AAEA,IAAA,eAAiBmhB;AC3BjB,IAAIA,gBAAchjB;AAAlB,IACI,kBAAkBE;AAYtB,SAAS+iB,aAAW,QAAQ,OAAO,QAAQ,YAAY;AACrD,MAAI,QAAQ,CAAC;AACb,aAAW,SAAS,CAAA;AAEpB,MAAI7gB,SAAQ,IACR,SAAS,MAAM;AAEnB,SAAO,EAAEA,SAAQ,QAAQ;AACvB,QAAIP,OAAM,MAAMO,MAAK;AAErB,QAAI,WAAW,aACX,WAAW,OAAOP,IAAG,GAAG,OAAOA,IAAG,GAAGA,MAAK,QAAQ,MAAM,IACxD;AAEJ,QAAI,aAAa,QAAW;AAC1B,iBAAW,OAAOA,IAAG;IAC3B;AACI,QAAI,OAAO;AACT,sBAAgB,QAAQA,MAAK,QAAQ;IAC3C,OAAW;AACLmhB,oBAAY,QAAQnhB,MAAK,QAAQ;IACvC;EACA;AACE,SAAO;AACT;AAEA,IAAA,cAAiBohB;AC9BjB,SAASC,YAAU,GAAG,UAAU;AAC9B,MAAI9gB,SAAQ,IACR,SAAS,MAAM,CAAC;AAEpB,SAAO,EAAEA,SAAQ,GAAG;AAClB,WAAOA,MAAK,IAAI,SAASA,MAAK;EAClC;AACE,SAAO;AACT;AAEA,IAAA,aAAiB8gB;ACKjB,SAASC,eAAa,OAAO;AAC3B,SAAO,SAAS,QAAQ,OAAO,SAAS;AAC1C;AAEA,IAAA,iBAAiBA;AC5BjB,IAAInC,eAAahhB;AAAjB,IACImjB,iBAAejjB;AAGnB,IAAIkjB,YAAU;AASd,SAASC,kBAAgB,OAAO;AAC9B,SAAOF,eAAa,KAAK,KAAKnC,aAAW,KAAK,KAAKoC;AACrD;AAEA,IAAA,mBAAiBC;ACjBjB,IAAI,kBAAkBrjB;AAAtB,IACImjB,iBAAejjB;AAGnB,IAAI0gB,gBAAc,OAAO;AAGzB,IAAIvT,mBAAiBuT,cAAY;AAGjC,IAAI0C,yBAAuB1C,cAAY;AAoBvC,IAAI2C,gBAAc,gBAAgB,4BAAW;AAAE,SAAO;AAAU,GAAE,CAAE,IAAI,kBAAkB,SAAS,OAAO;AACxG,SAAOJ,eAAa,KAAK,KAAK9V,iBAAe,KAAK,OAAO,QAAQ,KAC/D,CAACiW,uBAAqB,KAAK,OAAO,QAAQ;AAC9C;AAEA,IAAA,gBAAiBC;ACZjB,IAAI9V,YAAU,MAAM;AAEpB,IAAA,YAAiBA;;ACZjB,SAAS,YAAY;AACnB,SAAO;AACT;AAEA,IAAA,cAAiB;;;ACjBjB,MAAI7L,QAAO5B,OACPwjB,aAAYtjB;AAGhB,MAAI,cAA4C,WAAW,CAAC,QAAQ,YAAY;AAGhF,MAAI,aAAa,eAAe,QAA6B,UAAU,CAAC,OAAO,YAAY;AAG3F,MAAI,gBAAgB,cAAc,WAAW,YAAY;AAGzD,MAAIC,UAAS,gBAAgByB,MAAK,SAAS;AAG3C,MAAI,iBAAiBzB,UAASA,QAAO,WAAW;AAmBhD,MAAIK,YAAW,kBAAkBgjB;AAEjC,SAAA,UAAiBhjB;;;ACpCjB,IAAIijB,qBAAmB;AAGvB,IAAI,WAAW;AAUf,SAASC,UAAQ,OAAO,QAAQ;AAC9B,MAAIhiB,QAAO,OAAO;AAClB,WAAS,UAAU,OAAO+hB,qBAAmB;AAE7C,SAAO,CAAC,CAAC,WACN/hB,SAAQ,YACNA,SAAQ,YAAY,SAAS,KAAK,KAAK,OACrC,QAAQ,MAAM,QAAQ,KAAK,KAAK,QAAQ;AACjD;AAEA,IAAA,WAAiBgiB;ACvBjB,IAAI,mBAAmB;AA4BvB,SAASC,WAAS,OAAO;AACvB,SAAO,OAAO,SAAS,YACrB,QAAQ,MAAM,QAAQ,KAAK,KAAK,SAAS;AAC7C;AAEA,IAAA,aAAiBA;AClCjB,IAAI3C,eAAahhB;AAAjB,IACI2jB,aAAWzjB;AADf,IAEIijB,iBAAetf;AAGnB,IAAIuf,YAAU;AAAd,IACIQ,aAAW;AADf,IAEIC,YAAU;AAFd,IAGIC,YAAU;AAHd,IAIIC,aAAW;AAJf,IAKI9C,YAAU;AALd,IAMI+C,WAAS;AANb,IAOIC,cAAY;AAPhB,IAQIC,cAAY;AARhB,IASIC,cAAY;AAThB,IAUIC,WAAS;AAVb,IAWIC,cAAY;AAXhB,IAYIC,eAAa;AAEjB,IAAIC,mBAAiB;AAArB,IACIC,gBAAc;AADlB,IAEIC,eAAa;AAFjB,IAGIC,eAAa;AAHjB,IAIIC,YAAU;AAJd,IAKIC,aAAW;AALf,IAMIC,aAAW;AANf,IAOIC,aAAW;AAPf,IAQIC,oBAAkB;AARtB,IASIC,cAAY;AAThB,IAUIC,cAAY;AAGhB,IAAI,iBAAiB,CAAA;AACrB,eAAeR,YAAU,IAAI,eAAeC,YAAU,IACtD,eAAeC,SAAO,IAAI,eAAeC,UAAQ,IACjD,eAAeC,UAAQ,IAAI,eAAeC,UAAQ,IAClD,eAAeC,iBAAe,IAAI,eAAeC,WAAS,IAC1D,eAAeC,WAAS,IAAI;AAC5B,eAAe7B,SAAO,IAAI,eAAeQ,UAAQ,IACjD,eAAeW,gBAAc,IAAI,eAAeV,SAAO,IACvD,eAAeW,aAAW,IAAI,eAAeV,SAAO,IACpD,eAAeC,UAAQ,IAAI,eAAe9C,SAAO,IACjD,eAAe+C,QAAM,IAAI,eAAeC,WAAS,IACjD,eAAeC,WAAS,IAAI,eAAeC,WAAS,IACpD,eAAeC,QAAM,IAAI,eAAeC,WAAS,IACjD,eAAeC,YAAU,IAAI;AAS7B,SAASY,mBAAiB,OAAO;AAC/B,SAAO/B,eAAa,KAAK,KACvBQ,WAAS,MAAM,MAAM,KAAK,CAAC,CAAC,eAAe3C,aAAW,KAAK,CAAC;AAChE;AAEA,IAAA,oBAAiBkE;ACpDjB,SAASC,YAAU,MAAM;AACvB,SAAO,SAAS,OAAO;AACrB,WAAO,KAAK,KAAK;EACrB;AACA;AAEA,IAAA,aAAiBA;;;;ACbjB,MAAIzE,cAAa1gB;AAGjB,MAAI,cAA4C,WAAW,CAAC,QAAQ,YAAY;AAGhF,MAAI,aAAa,eAAe,QAA6B,UAAU,CAAC,OAAO,YAAY;AAG3F,MAAI,gBAAgB,cAAc,WAAW,YAAY;AAGzD,MAAI,cAAc,iBAAiB0gB,YAAW;AAG9C,MAAI0E,aAAY,WAAW;AACzB,QAAI;AAEF,UAAIzjB,SAAQ,cAAc,WAAW,WAAW,WAAW,QAAQ,MAAM,EAAE;AAE3E,UAAIA,QAAO;AACT,eAAOA;;AAIT,aAAO,eAAe,YAAY,WAAW,YAAY,QAAQ,MAAM;IAC3E,SAAW,GAAG;IAAA;KACb;AAED,SAAA,UAAiByjB;;;AC7BjB,IAAI,mBAAmBplB;AAAvB,IACImlB,cAAYjlB;AADhB,IAEIklB,aAAWvhB;AAGf,IAAI,mBAAmBuhB,cAAYA,WAAS;AAmB5C,IAAI/W,iBAAe,mBAAmB8W,YAAU,gBAAgB,IAAI;AAEpE,IAAA,iBAAiB9W;AC1BjB,IAAI,YAAYrO;AAAhB,IACI,cAAcE;AADlB,IAEIuN,YAAU5J;AAFd,IAGIrD,aAAW+D;AAHf,IAII,UAAUG;AAJd,IAKI,eAAeiB;AAGnB,IAAIib,gBAAc,OAAO;AAGzB,IAAIvT,mBAAiBuT,cAAY;AAUjC,SAASyE,gBAAc,OAAO,WAAW;AACvC,MAAI,QAAQ5X,UAAQ,KAAK,GACrB,QAAQ,CAAC,SAAS,YAAY,KAAK,GACnC,SAAS,CAAC,SAAS,CAAC,SAASjN,WAAS,KAAK,GAC3C,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,aAAa,KAAK,GAC1D,cAAc,SAAS,SAAS,UAAU,QAC1C,SAAS,cAAc,UAAU,MAAM,QAAQ,MAAM,IAAI,CAAA,GACzD,SAAS,OAAO;AAEpB,WAASqB,QAAO,OAAO;AACrB,SAAK,aAAawL,iBAAe,KAAK,OAAOxL,IAAG,MAC5C,EAAE;KAECA,QAAO;IAEN,WAAWA,QAAO,YAAYA,QAAO;IAErC,WAAWA,QAAO,YAAYA,QAAO,gBAAgBA,QAAO;IAE7D,QAAQA,MAAK,MAAM,KAClB;AACN,aAAO,KAAKA,IAAG;IACrB;EACA;AACE,SAAO;AACT;AAEA,IAAA,iBAAiBwjB;AC/CjB,IAAIzE,gBAAc,OAAO;AASzB,SAAS0E,cAAY,OAAO;AAC1B,MAAI,OAAO,SAAS,MAAM,aACtBllB,SAAS,OAAO,QAAQ,cAAc,KAAK,aAAcwgB;AAE7D,SAAO,UAAUxgB;AACnB;AAEA,IAAA,eAAiBklB;ACTjB,SAASC,UAAQ,MAAM,WAAW;AAChC,SAAO,SAAS,KAAK;AACnB,WAAO,KAAK,UAAU,GAAG,CAAC;EAC9B;AACA;AAEA,IAAA,WAAiBA;ACdjB,IAAIA,YAAUvlB;AAGd,IAAIwlB,eAAaD,UAAQ,OAAO,MAAM,MAAM;AAE5C,IAAA,cAAiBC;ACLjB,IAAIF,gBAActlB;AAAlB,IACI,aAAaE;AAGjB,IAAI0gB,gBAAc,OAAO;AAGzB,IAAIvT,mBAAiBuT,cAAY;AASjC,SAAS6E,WAAS,QAAQ;AACxB,MAAI,CAACH,cAAY,MAAM,GAAG;AACxB,WAAO,WAAW,MAAM;EAC5B;AACE,MAAI,SAAS,CAAA;AACb,WAASzjB,QAAO,OAAO,MAAM,GAAG;AAC9B,QAAIwL,iBAAe,KAAK,QAAQxL,IAAG,KAAKA,QAAO,eAAe;AAC5D,aAAO,KAAKA,IAAG;IACrB;EACA;AACE,SAAO;AACT;AAEA,IAAA,YAAiB4jB;AC7BjB,IAAI,aAAazlB;AAAjB,IACI,WAAWE;AA2Bf,SAASwlB,cAAY,OAAO;AAC1B,SAAO,SAAS,QAAQ,SAAS,MAAM,MAAM,KAAK,CAAC,WAAW,KAAK;AACrE;AAEA,IAAA,gBAAiBA;AChCjB,IAAIL,kBAAgBrlB;AAApB,IACI,WAAWE;AADf,IAEIwlB,gBAAc7hB;AA8BlB,SAASmD,OAAK,QAAQ;AACpB,SAAO0e,cAAY,MAAM,IAAIL,gBAAc,MAAM,IAAI,SAAS,MAAM;AACtE;AAEA,IAAA,SAAiBre;ACpCjB,IAAIic,eAAajjB;AAAjB,IACIgH,SAAO9G;AAWX,SAASylB,aAAW,QAAQ,QAAQ;AAClC,SAAO,UAAU1C,aAAW,QAAQjc,OAAK,MAAM,GAAG,MAAM;AAC1D;AAEA,IAAA,cAAiB2e;ACPjB,SAASC,eAAa,QAAQ;AAC5B,MAAI,SAAS,CAAA;AACb,MAAI,UAAU,MAAM;AAClB,aAAS/jB,QAAO,OAAO,MAAM,GAAG;AAC9B,aAAO,KAAKA,IAAG;IACrB;EACA;AACE,SAAO;AACT;AAEA,IAAA,gBAAiB+jB;ACnBjB,IAAI9W,aAAW9O;AAAf,IACIslB,gBAAcplB;AADlB,IAEI,eAAe2D;AAGnB,IAAI+c,gBAAc,OAAO;AAGzB,IAAIvT,mBAAiBuT,cAAY;AASjC,SAASiF,aAAW,QAAQ;AAC1B,MAAI,CAAC/W,WAAS,MAAM,GAAG;AACrB,WAAO,aAAa,MAAM;EAC9B;AACE,MAAI,UAAUwW,cAAY,MAAM,GAC5B,SAAS,CAAA;AAEb,WAASzjB,QAAO,QAAQ;AACtB,QAAI,EAAEA,QAAO,kBAAkB,WAAW,CAACwL,iBAAe,KAAK,QAAQxL,IAAG,KAAK;AAC7E,aAAO,KAAKA,IAAG;IACrB;EACA;AACE,SAAO;AACT;AAEA,IAAA,cAAiBgkB;AChCjB,IAAI,gBAAgB7lB;AAApB,IACI,aAAaE;AADjB,IAEI,cAAc2D;AAyBlB,SAASiiB,SAAO,QAAQ;AACtB,SAAO,YAAY,MAAM,IAAI,cAAc,QAAQ,IAAI,IAAI,WAAW,MAAM;AAC9E;AAEA,IAAA,WAAiBA;AC/BjB,IAAI7C,eAAajjB;AAAjB,IACI8lB,WAAS5lB;AAWb,SAAS6lB,eAAa,QAAQ,QAAQ;AACpC,SAAO,UAAU9C,aAAW,QAAQ6C,SAAO,MAAM,GAAG,MAAM;AAC5D;AAEA,IAAA,gBAAiBC;;;;AChBjB,MAAInkB,QAAO5B;AAGX,MAAI,cAA4C,WAAW,CAAC,QAAQ,YAAY;AAGhF,MAAI,aAAa,eAAe,QAA6B,UAAU,CAAC,OAAO,YAAY;AAG3F,MAAI,gBAAgB,cAAc,WAAW,YAAY;AAGzD,MAAIG,UAAS,gBAAgByB,MAAK,SAAS,QACvC,cAAczB,UAASA,QAAO,cAAc;AAUhD,WAAS6lB,aAAYnmB,SAAQ,QAAQ;AACnC,QAAI,QAAQ;AACV,aAAOA,QAAO,MAAK;;AAErB,QAAI,SAASA,QAAO,QAChB,SAAS,cAAc,YAAY,MAAM,IAAI,IAAIA,QAAO,YAAY,MAAM;AAE9E,IAAAA,QAAO,KAAK,MAAM;AAClB,WAAO;;AAGT,SAAA,UAAiBmmB;;;AC1BjB,SAASC,YAAU,QAAQ,OAAO;AAChC,MAAI7jB,SAAQ,IACR,SAAS,OAAO;AAEpB,YAAU,QAAQ,MAAM,MAAM;AAC9B,SAAO,EAAEA,SAAQ,QAAQ;AACvB,UAAMA,MAAK,IAAI,OAAOA,MAAK;EAC/B;AACE,SAAO;AACT;AAEA,IAAA,aAAiB6jB;ACVjB,SAASC,cAAY,OAAO,WAAW;AACrC,MAAI9jB,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,WAAW,GACX,SAAS,CAAA;AAEb,SAAO,EAAEA,SAAQ,QAAQ;AACvB,QAAI,QAAQ,MAAMA,MAAK;AACvB,QAAI,UAAU,OAAOA,QAAO,KAAK,GAAG;AAClC,aAAO,UAAU,IAAI;IAC3B;EACA;AACE,SAAO;AACT;AAEA,IAAA,eAAiB8jB;ACNjB,SAASC,cAAY;AACnB,SAAO,CAAA;AACT;AAEA,IAAA,cAAiBA;ACtBjB,IAAI,cAAcnmB;AAAlB,IACImmB,cAAYjmB;AAGhB,IAAI0gB,gBAAc,OAAO;AAGzB,IAAI,uBAAuBA,cAAY;AAGvC,IAAIwF,qBAAmB,OAAO;AAS9B,IAAIC,eAAa,CAACD,qBAAmBD,cAAY,SAAS,QAAQ;AAChE,MAAI,UAAU,MAAM;AAClB,WAAO,CAAA;EACX;AACE,WAAS,OAAO,MAAM;AACtB,SAAO,YAAYC,mBAAiB,MAAM,GAAG,SAAS,QAAQ;AAC5D,WAAO,qBAAqB,KAAK,QAAQ,MAAM;EACnD,CAAG;AACH;AAEA,IAAA,cAAiBC;AC7BjB,IAAIpD,eAAajjB;AAAjB,IACIqmB,eAAanmB;AAUjB,SAASomB,cAAY,QAAQ,QAAQ;AACnC,SAAOrD,aAAW,QAAQoD,aAAW,MAAM,GAAG,MAAM;AACtD;AAEA,IAAA,eAAiBC;ACPjB,SAASC,YAAU,OAAO,QAAQ;AAChC,MAAInkB,SAAQ,IACR,SAAS,OAAO,QAChB,SAAS,MAAM;AAEnB,SAAO,EAAEA,SAAQ,QAAQ;AACvB,UAAM,SAASA,MAAK,IAAI,OAAOA,MAAK;EACxC;AACE,SAAO;AACT;AAEA,IAAA,aAAiBmkB;ACnBjB,IAAI,UAAUvmB;AAGd,IAAIwmB,iBAAe,QAAQ,OAAO,gBAAgB,MAAM;AAExD,IAAA,gBAAiBA;ACLjB,IAAID,cAAYvmB;AAAhB,IACIwmB,iBAAetmB;AADnB,IAEImmB,eAAaxiB;AAFjB,IAGI,YAAYU;AAGhB,IAAI,mBAAmB,OAAO;AAS9B,IAAIkiB,iBAAe,CAAC,mBAAmB,YAAY,SAAS,QAAQ;AAClE,MAAI,SAAS,CAAA;AACb,SAAO,QAAQ;AACbF,gBAAU,QAAQF,aAAW,MAAM,CAAC;AACpC,aAASG,eAAa,MAAM;EAChC;AACE,SAAO;AACT;AAEA,IAAA,gBAAiBC;ACxBjB,IAAI,aAAazmB;AAAjB,IACIymB,iBAAevmB;AAUnB,SAASwmB,gBAAc,QAAQ,QAAQ;AACrC,SAAO,WAAW,QAAQD,eAAa,MAAM,GAAG,MAAM;AACxD;AAEA,IAAA,iBAAiBC;ACfjB,IAAI,YAAY1mB;AAAhB,IACIyN,YAAUvN;AAad,SAASymB,iBAAe,QAAQ,UAAU,aAAa;AACrD,MAAI,SAAS,SAAS,MAAM;AAC5B,SAAOlZ,UAAQ,MAAM,IAAI,SAAS,UAAU,QAAQ,YAAY,MAAM,CAAC;AACzE;AAEA,IAAA,kBAAiBkZ;ACnBjB,IAAIA,mBAAiB3mB;AAArB,IACI,aAAaE;AADjB,IAEI8G,SAAOnD;AASX,SAAS+iB,aAAW,QAAQ;AAC1B,SAAOD,iBAAe,QAAQ3f,QAAM,UAAU;AAChD;AAEA,IAAA,cAAiB4f;ACfjB,IAAI,iBAAiB5mB;AAArB,IACI,eAAeE;AADnB,IAEI4lB,WAASjiB;AAUb,SAASgjB,eAAa,QAAQ;AAC5B,SAAO,eAAe,QAAQf,UAAQ,YAAY;AACpD;AAEA,IAAA,gBAAiBe;AChBjB,IAAInF,cAAY1hB;AAAhB,IACI4B,SAAO1B;AAGX,IAAI4mB,aAAWpF,YAAU9f,QAAM,UAAU;AAEzC,IAAA,YAAiBklB;ACNjB,IAAIpF,cAAY1hB;AAAhB,IACI4B,SAAO1B;AAGX,IAAI6mB,YAAUrF,YAAU9f,QAAM,SAAS;AAEvC,IAAA,WAAiBmlB;ACNjB,IAAIrF,cAAY1hB;AAAhB,IACI4B,SAAO1B;AAGX,IAAI8mB,QAAMtF,YAAU9f,QAAM,KAAK;AAE/B,IAAA,OAAiBolB;ACNjB,IAAI,YAAYhnB;AAAhB,IACI4B,SAAO1B;AAGX,IAAI+mB,YAAU,UAAUrlB,QAAM,SAAS;AAEvC,IAAA,WAAiBqlB;ACNjB,IAAIH,aAAW9mB;AAAf,IACI2hB,QAAMzhB;AADV,IAEI6mB,YAAUljB;AAFd,IAGImjB,QAAMziB;AAHV,IAII0iB,YAAUviB;AAJd,IAKI,aAAaiB;AALjB,IAMI,WAAWsC;AAGf,IAAI+b,WAAS;AAAb,IACIE,cAAY;AADhB,IAEI,aAAa;AAFjB,IAGIE,WAAS;AAHb,IAIIE,eAAa;AAEjB,IAAIE,gBAAc;AAGlB,IAAI,qBAAqB,SAASsC,UAAQ;AAA1C,IACI,gBAAgB,SAASnF,KAAG;AADhC,IAEI,oBAAoB,SAASoF,SAAO;AAFxC,IAGI,gBAAgB,SAASC,KAAG;AAHhC,IAII,oBAAoB,SAASC,SAAO;AASxC,IAAIC,WAAS;AAGb,IAAKJ,cAAYI,SAAO,IAAIJ,WAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAKtC,iBACxD7C,SAAOuF,SAAO,IAAIvF,OAAG,KAAKqC,YAC1B+C,aAAWG,SAAOH,UAAQ,QAAO,CAAE,KAAK,cACxCC,SAAOE,SAAO,IAAIF,OAAG,KAAK5C,YAC1B6C,aAAWC,SAAO,IAAID,WAAO,KAAK3C,cAAa;AAClD4C,aAAS,SAAS,OAAO;AACvB,QAAI,SAAS,WAAW,KAAK,GACzB,OAAO,UAAUhD,cAAY,MAAM,cAAc,QACjD,aAAa,OAAO,SAAS,IAAI,IAAI;AAEzC,QAAI,YAAY;AACd,cAAQ,YAAU;QAChB,KAAK;AAAoB,iBAAOM;QAChC,KAAK;AAAe,iBAAOR;QAC3B,KAAK;AAAmB,iBAAO;QAC/B,KAAK;AAAe,iBAAOI;QAC3B,KAAK;AAAmB,iBAAOE;MACvC;IACA;AACI,WAAO;EACX;AACA;AAEA,IAAA,UAAiB4C;ACxDjB,IAAI,cAAc,OAAO;AAGzB,IAAI,iBAAiB,YAAY;AASjC,SAASC,iBAAe,OAAO;AAC7B,MAAI,SAAS,MAAM,QACf,SAAS,IAAI,MAAM,YAAY,MAAM;AAGzC,MAAI,UAAU,OAAO,MAAM,CAAC,KAAK,YAAY,eAAe,KAAK,OAAO,OAAO,GAAG;AAChF,WAAO,QAAQ,MAAM;AACrB,WAAO,QAAQ,MAAM;EACzB;AACE,SAAO;AACT;AAEA,IAAA,kBAAiBA;ACzBjB,IAAI,OAAOnnB;AAGX,IAAIonB,eAAa,KAAK;AAEtB,IAAA,cAAiBA;ACLjB,IAAIA,eAAapnB;AASjB,SAASqnB,mBAAiB,aAAa;AACrC,MAAI,SAAS,IAAI,YAAY,YAAY,YAAY,UAAU;AAC/D,MAAID,aAAW,MAAM,EAAE,IAAI,IAAIA,aAAW,WAAW,CAAC;AACtD,SAAO;AACT;AAEA,IAAA,oBAAiBC;ACfjB,IAAIA,qBAAmBrnB;AAUvB,SAASsnB,gBAAc,UAAU,QAAQ;AACvC,MAAIznB,UAAS,SAASwnB,mBAAiB,SAAS,MAAM,IAAI,SAAS;AACnE,SAAO,IAAI,SAAS,YAAYxnB,SAAQ,SAAS,YAAY,SAAS,UAAU;AAClF;AAEA,IAAA,iBAAiBynB;ACdjB,IAAI,UAAU;AASd,SAASC,cAAY,QAAQ;AAC3B,MAAI,SAAS,IAAI,OAAO,YAAY,OAAO,QAAQ,QAAQ,KAAK,MAAM,CAAC;AACvE,SAAO,YAAY,OAAO;AAC1B,SAAO;AACT;AAEA,IAAA,eAAiBA;AChBjB,IAAI5G,WAAS3gB;AAGb,IAAI,cAAc2gB,WAASA,SAAO,YAAY;AAA9C,IACI,gBAAgB,cAAc,YAAY,UAAU;AASxD,SAAS6G,cAAY,QAAQ;AAC3B,SAAO,gBAAgB,OAAO,cAAc,KAAK,MAAM,CAAC,IAAI,CAAA;AAC9D;AAEA,IAAA,eAAiBA;ACjBjB,IAAIH,qBAAmBrnB;AAUvB,SAASynB,kBAAgB,YAAY,QAAQ;AAC3C,MAAI5nB,UAAS,SAASwnB,mBAAiB,WAAW,MAAM,IAAI,WAAW;AACvE,SAAO,IAAI,WAAW,YAAYxnB,SAAQ,WAAW,YAAY,WAAW,MAAM;AACpF;AAEA,IAAA,mBAAiB4nB;ACfjB,IAAI,mBAAmBznB;AAAvB,IACI,gBAAgBE;AADpB,IAEI,cAAc2D;AAFlB,IAGI,cAAcU;AAHlB,IAII,kBAAkBG;AAGtB,IAAImf,YAAU;AAAd,IACIC,YAAU;AADd,IAEIE,WAAS;AAFb,IAGIC,cAAY;AAHhB,IAIIE,cAAY;AAJhB,IAKIC,WAAS;AALb,IAMIC,cAAY;AANhB,IAOIqD,cAAY;AAEhB,IAAInD,mBAAiB;AAArB,IACIC,gBAAc;AADlB,IAEIC,eAAa;AAFjB,IAGIC,eAAa;AAHjB,IAIIC,YAAU;AAJd,IAKIC,aAAW;AALf,IAMIC,aAAW;AANf,IAOIC,aAAW;AAPf,IAQIC,oBAAkB;AARtB,IASIC,cAAY;AAThB,IAUIC,cAAY;AAchB,SAAS0C,iBAAe,QAAQ,KAAK,QAAQ;AAC3C,MAAI,OAAO,OAAO;AAClB,UAAQ,KAAG;IACT,KAAKpD;AACH,aAAO,iBAAiB,MAAM;IAEhC,KAAKV;IACL,KAAKC;AACH,aAAO,IAAI,KAAK,CAAC,MAAM;IAEzB,KAAKU;AACH,aAAO,cAAc,QAAQ,MAAM;IAErC,KAAKC;IAAY,KAAKC;IACtB,KAAKC;IAAS,KAAKC;IAAU,KAAKC;IAClC,KAAKC;IAAU,KAAKC;IAAiB,KAAKC;IAAW,KAAKC;AACxD,aAAO,gBAAgB,QAAQ,MAAM;IAEvC,KAAKjB;AACH,aAAO,IAAI;IAEb,KAAKC;IACL,KAAKI;AACH,aAAO,IAAI,KAAK,MAAM;IAExB,KAAKF;AACH,aAAO,YAAY,MAAM;IAE3B,KAAKC;AACH,aAAO,IAAI;IAEb,KAAKsD;AACH,aAAO,YAAY,MAAM;EAC/B;AACA;AAEA,IAAA,kBAAiBC;AC5EjB,IAAI7Y,aAAW9O;AAGf,IAAI,eAAe,OAAO;AAU1B,IAAI4nB,eAAc,4BAAW;AAC3B,WAAS,SAAS;EAAA;AAClB,SAAO,SAASxnB,QAAO;AACrB,QAAI,CAAC0O,WAAS1O,MAAK,GAAG;AACpB,aAAO,CAAA;IACb;AACI,QAAI,cAAc;AAChB,aAAO,aAAaA,MAAK;IAC/B;AACI,WAAO,YAAYA;AACnB,QAAI,SAAS,IAAI;AACjB,WAAO,YAAY;AACnB,WAAO;EACX;AACA,GAAC;AAED,IAAA,cAAiBwnB;AC7BjB,IAAI,aAAa5nB;AAAjB,IACI,eAAeE;AADnB,IAEI,cAAc2D;AASlB,SAASgkB,kBAAgB,QAAQ;AAC/B,SAAQ,OAAO,OAAO,eAAe,cAAc,CAAC,YAAY,MAAM,IAClE,WAAW,aAAa,MAAM,CAAC,IAC/B,CAAA;AACN;AAEA,IAAA,mBAAiBA;ACjBjB,IAAIX,WAASlnB;AAAb,IACImjB,iBAAejjB;AAGnB,IAAI8jB,WAAS;AASb,SAAS8D,YAAU,OAAO;AACxB,SAAO3E,eAAa,KAAK,KAAK+D,SAAO,KAAK,KAAKlD;AACjD;AAEA,IAAA,aAAiB8D;ACjBjB,IAAI,YAAY9nB;AAAhB,IACImlB,cAAYjlB;AADhB,IAEIklB,aAAWvhB;AAGf,IAAI,YAAYuhB,cAAYA,WAAS;AAmBrC,IAAI2C,UAAQ,YAAY5C,YAAU,SAAS,IAAI;AAE/C,IAAA,UAAiB4C;AC1BjB,IAAIb,WAASlnB;AAAb,IACI,eAAeE;AAGnB,IAAIkkB,WAAS;AASb,SAAS4D,YAAU,OAAO;AACxB,SAAO,aAAa,KAAK,KAAKd,SAAO,KAAK,KAAK9C;AACjD;AAEA,IAAA,aAAiB4D;ACjBjB,IAAI,YAAYhoB;AAAhB,IACI,YAAYE;AADhB,IAEI,WAAW2D;AAGf,IAAI,YAAY,YAAY,SAAS;AAmBrC,IAAIokB,UAAQ,YAAY,UAAU,SAAS,IAAI;AAE/C,IAAA,UAAiBA;AC1BjB,IAAI,QAAQjoB;AAAZ,IACI,YAAYE;AADhB,IAEI,cAAc2D;AAFlB,IAGI,aAAaU;AAHjB,IAII,eAAeG;AAJnB,IAKI,cAAciB;AALlB,IAMI,YAAYsC;AANhB,IAOI,cAAcC;AAPlB,IAQI,gBAAgBmB;AARpB,IASI,aAAaE;AATjB,IAUI,eAAeC;AAVnB,IAWI,SAASE;AAXb,IAYI,iBAAiBC;AAZrB,IAaI,iBAAiBqC;AAbrB,IAcI,kBAAkBC;AAdtB,IAeI,UAAUC;AAfd,IAgBI,WAAWC;AAhBf,IAiBI,QAAQC;AAjBZ,IAkBI,WAAWC;AAlBf,IAmBI,QAAQC;AAnBZ,IAoBI,OAAOC;AApBX,IAqBI,SAASC;AAGb,IAAI0b,oBAAkB;AAAtB,IACI,kBAAkB;AADtB,IAEIC,uBAAqB;AAGzB,IAAI,UAAU;AAAd,IACI,WAAW;AADf,IAEI,UAAU;AAFd,IAGI,UAAU;AAHd,IAII,WAAW;AAJf,IAKI,UAAU;AALd,IAMI,SAAS;AANb,IAOI,SAAS;AAPb,IAQI,YAAY;AARhB,IASI,YAAY;AAThB,IAUI,YAAY;AAVhB,IAWI,SAAS;AAXb,IAYI,YAAY;AAZhB,IAaI,YAAY;AAbhB,IAcI,aAAa;AAEjB,IAAI,iBAAiB;AAArB,IACI,cAAc;AADlB,IAEI,aAAa;AAFjB,IAGI,aAAa;AAHjB,IAII,UAAU;AAJd,IAKI,WAAW;AALf,IAMI,WAAW;AANf,IAOI,WAAW;AAPf,IAQI,kBAAkB;AARtB,IASI,YAAY;AAThB,IAUI,YAAY;AAGhB,IAAI,gBAAgB,CAAA;AACpB,cAAc,OAAO,IAAI,cAAc,QAAQ,IAC/C,cAAc,cAAc,IAAI,cAAc,WAAW,IACzD,cAAc,OAAO,IAAI,cAAc,OAAO,IAC9C,cAAc,UAAU,IAAI,cAAc,UAAU,IACpD,cAAc,OAAO,IAAI,cAAc,QAAQ,IAC/C,cAAc,QAAQ,IAAI,cAAc,MAAM,IAC9C,cAAc,SAAS,IAAI,cAAc,SAAS,IAClD,cAAc,SAAS,IAAI,cAAc,MAAM,IAC/C,cAAc,SAAS,IAAI,cAAc,SAAS,IAClD,cAAc,QAAQ,IAAI,cAAc,eAAe,IACvD,cAAc,SAAS,IAAI,cAAc,SAAS,IAAI;AACtD,cAAc,QAAQ,IAAI,cAAc,OAAO,IAC/C,cAAc,UAAU,IAAI;AAkB5B,SAASC,YAAU,OAAO,SAAS,YAAYvmB,MAAK,QAAQ,OAAO;AACjE,MAAI,QACA,SAAS,UAAUqmB,mBACnB,SAAS,UAAU,iBACnB,SAAS,UAAUC;AAEvB,MAAI,YAAY;AACd,aAAS,SAAS,WAAW,OAAOtmB,MAAK,QAAQ,KAAK,IAAI,WAAW,KAAK;EAC9E;AACE,MAAI,WAAW,QAAW;AACxB,WAAO;EACX;AACE,MAAI,CAAC,SAAS,KAAK,GAAG;AACpB,WAAO;EACX;AACE,MAAI,QAAQ,QAAQ,KAAK;AACzB,MAAI,OAAO;AACT,aAAS,eAAe,KAAK;AAC7B,QAAI,CAAC,QAAQ;AACX,aAAO,UAAU,OAAO,MAAM;IACpC;EACA,OAAS;AACL,QAAI,MAAM,OAAO,KAAK,GAClB,SAAS,OAAO,WAAW,OAAO;AAEtC,QAAI,SAAS,KAAK,GAAG;AACnB,aAAO,YAAY,OAAO,MAAM;IACtC;AACI,QAAI,OAAO,aAAa,OAAO,WAAY,UAAU,CAAC,QAAS;AAC7D,eAAU,UAAU,SAAU,CAAA,IAAK,gBAAgB,KAAK;AACxD,UAAI,CAAC,QAAQ;AACX,eAAO,SACH,cAAc,OAAO,aAAa,QAAQ,KAAK,CAAC,IAChD,YAAY,OAAO,WAAW,QAAQ,KAAK,CAAC;MACxD;IACA,OAAW;AACL,UAAI,CAAC,cAAc,GAAG,GAAG;AACvB,eAAO,SAAS,QAAQ,CAAA;MAChC;AACM,eAAS,eAAe,OAAO,KAAK,MAAM;IAChD;EACA;AAEE,YAAU,QAAQ,IAAI;AACtB,MAAI,UAAU,MAAM,IAAI,KAAK;AAC7B,MAAI,SAAS;AACX,WAAO;EACX;AACE,QAAM,IAAI,OAAO,MAAM;AAEvB,MAAI,MAAM,KAAK,GAAG;AAChB,UAAM,QAAQ,SAAS,UAAU;AAC/B,aAAO,IAAIumB,YAAU,UAAU,SAAS,YAAY,UAAU,OAAO,KAAK,CAAC;IACjF,CAAK;EACL,WAAa,MAAM,KAAK,GAAG;AACvB,UAAM,QAAQ,SAAS,UAAUvmB,MAAK;AACpC,aAAO,IAAIA,MAAKumB,YAAU,UAAU,SAAS,YAAYvmB,MAAK,OAAO,KAAK,CAAC;IACjF,CAAK;EACL;AAEE,MAAI,WAAW,SACV,SAAS,eAAe,aACxB,SAAS,SAAS;AAEvB,MAAI,QAAQ,QAAQ,SAAY,SAAS,KAAK;AAC9C,YAAU,SAAS,OAAO,SAAS,UAAUA,MAAK;AAChD,QAAI,OAAO;AACT,MAAAA,OAAM;AACN,iBAAW,MAAMA,IAAG;IAC1B;AAEI,gBAAY,QAAQA,MAAKumB,YAAU,UAAU,SAAS,YAAYvmB,MAAK,OAAO,KAAK,CAAC;EACxF,CAAG;AACD,SAAO;AACT;AAEA,IAAA,aAAiBumB;ACrKjB,IAAI,YAAYpoB;AAGhB,IAAI,kBAAkB;AAAtB,IACI,qBAAqB;AAoBzB,SAAS,UAAU,OAAO;AACxB,SAAO,UAAU,OAAO,kBAAkB,kBAAkB;AAC9D;AAEA,IAAA,cAAiB;;;;AC3BjB,OAAO,eAAe,QAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC3B,OAAA,4BAA+C,OAAA,uCAAgC,OAAA,wBAAgC,OAAA,wBAA0B,OAAA,kBAAqC,OAAA,6BAA4C,OAAA,oCAAwC,OAAA,gCAAwC,OAAA,gCAA0C,OAAA,kCAA8B,OAAA,sBAA2C,OAAA,mCAA6B,OAAA,qBAAG;AAC9d,IAAM,gBAAgBA;AACtB,IAAMof,gBAAclf;AACpB,IAAM,qBAAN,cAAiC,cAAc,YAAY;EACvD,cAAc;AACV,UAAM,8BAA8B,GAAG;EAC/C;AACA;AAC0B,OAAA,qBAAG;AAC7B,IAAM,mCAAN,cAA+C,cAAc,YAAY;EACrE,cAAc;AACV,UAAM,+GAA+G,GAAG;EAChI;AACA;AACwC,OAAA,mCAAG;AAC3C,IAAM,sBAAN,cAAkC,cAAc,YAAY;EACxD,cAAc;AACV,UAAM,+IAA+I,GAAG;EAChK;AACA;AAC2B,OAAA,sBAAG;AAC9B,IAAM,kCAAN,cAA8C,cAAc,YAAY;EACpE,YAAY,MAAM;AACd,UAAM,SAAS,OAAO,SAAS,WAAW,SAAS;AACnD,UAAM,iDAAiD,MAAM,IAAI,IAAI,IAAI,GAAG;EACpF;AACA;AACuC,OAAA,kCAAG;AAC1C,IAAM,gCAAN,cAA4C,cAAc,YAAY;EAClE,cAAc;AACV,UAAM,sCAAsC,GAAG;EACvD;AACA;AACqC,OAAA,gCAAG;AACxC,IAAM,gCAAN,cAA4C,cAAc,YAAY;EAClE,YAAY,UAAU;AAClB,UAAM,6CAA6C,QAAQ,qDAAqD,GAAG;EAC3H;AACA;AACqC,OAAA,gCAAG;AACxC,IAAM,oCAAN,cAAgD,cAAc,YAAY;EACtE,cAAc;AACV,UAAM,8CAA8C,GAAG;EAC/D;AACA;AACyC,OAAA,oCAAG;AAC5C,IAAM,6BAAN,cAAyC,cAAc,YAAY;EAC/D,YAAYgG,QAAO;AACf,UAAM,oDAAoDA,MAAK,IAAI,GAAG;EAC9E;AACA;AACkC,OAAA,6BAAG;AACrC,IAAM,kBAAN,cAA8B,MAAM;EAChC,YAAY,cAAc;AACtB,UAAM,6BAA6B,YAAY,EAAE;AACjD,SAAK,OAAO;AACZ,SAAK,aAAa;AAClB,UAAM,UAAS,GAAIkZ,cAAY,sBAAsB,YAAY;AACjE,SAAK,cAAc,OAAO;AAC1B,SAAK,WAAW,OAAO;AACvB,SAAK,YAAY,OAAO;EAChC;AACA;AACuB,OAAA,kBAAG;AAC1B,IAAM,wBAAN,cAAoC,cAAc,YAAY;EAC1D,YAAY,QAAQlZ,QAAO;AACvB,QAAI2X,gBAAe,6CAA6C,MAAM;AACtE,QAAI,WAAW,MAAM;AACjB,YAAMA,eAAc,GAAG;IACnC,OACa;AACD,UAAI3X,QAAO;AACP,QAAA2X,iBAAgB,aAAa3X,MAAK;MAClD;AACY,YAAM2X,eAAc,MAAM;IACtC;EACA;AACA;AAC6B,OAAA,wBAAG;AAChC,IAAM,wBAAN,cAAoC,cAAc,YAAY;EAC1D,YAAY,OAAO;AACf,UAAM,wCAAwC,SAAS,MAAM,MAAM,IAAI,GAAG;EAClF;AACA;AAC6B,OAAA,wBAAG;AAChC,IAAM,uCAAN,cAAmD,cAAc,YAAY;EACzE,cAAc;AACV,UAAM,+BAA+B,GAAG;EAChD;AACA;AAC4C,OAAA,uCAAG;AAC/C,IAAM,4BAAN,cAAwC,MAAM;EAC1C,YAAY,SAAS,QAAQ;AACzB,UAAM,oCAAoC,OAAO,aAAa,MAAM,EAAE;EAC9E;AACA;AACiC,OAAA,4BAAG;;;ACjGpC,OAAO,eAAe,OAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,MAAA,SAAiB,MAAA,yBAAiC,MAAA,kBAA0B,MAAA,mBAA2B,MAAA,iBAAyB,MAAA,mBAA2B;AAC3J,IAAI;CACH,SAAUwK,mBAAkB;AACzB,EAAAA,kBAAiB,cAAc,IAAI;AACnC,EAAAA,kBAAiB,gBAAgB,IAAI;AACrC,EAAAA,kBAAiB,gBAAgB,IAAI;AACrC,EAAAA,kBAAiB,eAAe,IAAI;AACxC,GAAG,qBAA6C,MAAA,mBAAG,mBAAmB,CAAA,EAAG;AACzE,IAAI;CACH,SAAUC,iBAAgB;AACvB,EAAAA,gBAAe,SAAS,IAAI;AAC5B,EAAAA,gBAAe,WAAW,IAAI;AAC9B,EAAAA,gBAAe,UAAU,IAAI;AAC7B,EAAAA,gBAAe,SAAS,IAAI;AAC5B,EAAAA,gBAAe,SAAS,IAAI;AAChC,GAAG,mBAAyC,MAAA,iBAAG,iBAAiB,CAAA,EAAG;AACnE,IAAI;CACH,SAAUC,mBAAkB;AACzB,EAAAA,kBAAiB,8BAA8B,IAAI;AACnD,EAAAA,kBAAiB,6BAA6B,IAAI;AAClD,EAAAA,kBAAiB,eAAe,IAAI;AACpC,EAAAA,kBAAiB,cAAc,IAAI;AACnC,EAAAA,kBAAiB,QAAQ,IAAI;AAC7B,EAAAA,kBAAiB,UAAU,IAAI;AACnC,GAAG,qBAA6C,MAAA,mBAAG,mBAAmB,CAAA,EAAG;AACzE,IAAI;CACH,SAAUC,kBAAiB;AACxB,EAAAA,iBAAgB,aAAa,IAAI;AACjC,EAAAA,iBAAgB,iBAAiB,IAAI;AACrC,EAAAA,iBAAgB,gBAAgB,IAAI;AACpC,EAAAA,iBAAgB,iBAAiB,IAAI;AACzC,GAAG,oBAA2C,MAAA,kBAAG,kBAAkB,CAAA,EAAG;AACtE,IAAI;CACH,SAAUC,yBAAwB;AAC/B,EAAAA,wBAAuB,MAAM,IAAI;AACjC,EAAAA,wBAAuB,MAAM,IAAI;AACjC,EAAAA,wBAAuB,kBAAkB,IAAI;AAC7C,EAAAA,wBAAuB,iBAAiB,IAAI;AAC5C,EAAAA,wBAAuB,YAAY,IAAI;AAC3C,GAAG,2BAAyD,MAAA,yBAAG,yBAAyB,CAAA,EAAG;AAC3F,IAAI;CACH,SAAUC,SAAQ;AACf,EAAAA,QAAO,KAAK,IAAI;AAChB,EAAAA,QAAO,MAAM,IAAI;AACrB,GAAG,WAAyB,MAAA,SAAG,SAAS,CAAA,EAAG;;AC7C3C,IAAIhK,oBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,MAAI,OAAO,OAAW,MAAK;AAC3B,MAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,MAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,WAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,aAAO,EAAE,CAAC;IAAE,EAAE;EACjE;AACI,SAAO,eAAe,GAAG,IAAI,IAAI;AACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,MAAI,OAAO,OAAW,MAAK;AAC3B,IAAE,EAAE,IAAI,EAAE,CAAC;AACf;AACA,IAAIsb,uBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,SAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;AACtE,KAAK,SAAS,GAAG,GAAG;AAChB,IAAE,SAAS,IAAI;AACnB;AACA,IAAIub,iBAAgBvb,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,MAAI,UAAU,SAAS,GAAG;AACtB,cAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,UAAI,KAAK,CAAA;AACT,eAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,aAAO;IACnB;AACQ,WAAO,QAAQ,CAAC;EACxB;AACI,SAAO,SAAUhd,MAAK;AAClB,QAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,QAAI,SAAS,CAAA;AACb,QAAIA,QAAO;AAAM,eAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAWoc,mBAAgB,QAAQpc,MAAK,EAAE,CAAC,CAAC;;AAC/Hsc,yBAAmB,QAAQtc,IAAG;AAC9B,WAAO;EACf;AACA,GAAC;AACD,OAAO,eAAe,aAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,YAAA,oBAA4B,YAAA,cAAsB;AAClD,IAAMqd,WAASd,eAAa7e,QAAoB;AAChD,IAAM,cAAN,MAAkB;EACd,YAAY,KAAK;AACb,SAAK,mBAAmB;AACxB,SAAK,MAAM;EACnB;EACI,cAAc;AACV,WAAO,KAAK,IAAG,KAAM,KAAK;EAClC;EACI,gBAAgB,UAAU;AACtB,SAAK,mBAAmB,KAAK,IAAG,IAAK;EAC7C;EACI,gBAAgB;AACZ,SAAK,mBAAmB;EAChC;AACA;AACmB,YAAA,cAAG;AACtB,IAAM,eAAe,CAAC,UAAU;AAC5B,QAAM,gBAAgB,CAAC,GAAG,KAAK;AAC/B,WAAS,IAAI,cAAc,SAAS,GAAG,IAAI,GAAG,KAAK;AAC/C,UAAM,IAAI,KAAK,MAAM,KAAK,OAAM,KAAM,IAAI,EAAE;AAC5C,KAAC,cAAc,CAAC,GAAG,cAAc,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,cAAc,CAAC,CAAC;EAClF;AACI,SAAO;AACX;AACA,IAAM,oBAAoB,CAAC,EAAE,UAAU,gBAAgB,OAAO,sBAAsB,IAAI,MAAQ;AAC5F,QAAM,QAAQ,SAAS,IAAI,SAAO,IAAI,YAAY,GAAG,CAAC;AACtD,SAAO;IACH;IACA,aAAa;IACb;IACA,cAAc;IACd,kBAAkB,yBAAyB;AACvC,YAAM,iBAAiB,KAAK,MAAM,OAAO,CAACmE,UAASA,MAAK,YAAW,CAAE;AACrE,UAAI,KAAK,MAAM,UAAU,GAAG;AAExB,cAAM,oBAAoB,4BAA4B,QAAQ,4BAA4B,SAAS,0BAA0B,KAAK,MAAM,SAAS,KAAK,MAAO,KAAK,KAAK,MAAM,SAAS,KAAM,CAAC;AAC7L,YAAI,eAAe,SAAS,mBAAmB;AAC3Cwb,mBAAO,MAAM,kBAAkB,eAAe,MAAM,MAAM,iBAAiB,WAAW,KAAK,MAAM,MAAM,SAAS;AAChH,gBAAM,oBAAoB,KAAK;AAC/B,eAAK,sBAAqB;AAC1B,cAAI,KAAK,iBAAiB,mBAAmB;AACzC,gBAAI,mBAAmB;AACnB,mBAAK,cAAc,iBAAiB;AACpCA,uBAAO,KAAK,0CAA0C,iBAAiB,EAAE;YACrG;UACA;AACoB,gBAAM,wBAAwB,KAAK,MAAM,OAAO,CAACxb,UAASA,MAAK,YAAW,CAAE;AAC5E,iBAAO,aAAa,qBAAqB;QAC7D;MACA;AACY,YAAM,yBAAyB,aAAa,cAAc;AAE1D,UAAI,iBAAiB,KAAK,eAAe,KAAK,YAAY,YAAW,GAAI;AACrE,cAAM,qBAAqB,uBAAuB,OAAO,CAAAA,UAAQA,UAAS,KAAK,WAAW;AAC1F,eAAO,CAAC,KAAK,aAAa,GAAG,kBAAkB;MAC/D;AACY,aAAO;IACnB;IACQ,cAAcA,OAAM;AAChB,WAAK,cAAcA;IAC/B;IACQ,iBAAiB,WAAW;AACxB,WAAK,gBAAgB;IACjC;IACQ,UAAU;AACN,YAAMwkB,SAAQ,KAAK,kBAAiB;AACpC,UAAIA,OAAM,WAAW,GAAG;AACpB,eAAO;MACvB;AACY,YAAMvmB,SAAQ,KAAK,MAAM,KAAK,OAAM,IAAKumB,OAAM,MAAM;AACrD,YAAMxkB,QAAOwkB,OAAMvmB,MAAK;AACxB,WAAK,eAAe+B;AACpB,UAAI,CAAC,KAAK,eAAe;AACrB,eAAOA;MACvB;AACY,UAAI,CAAC,KAAK,aAAa;AACnB,aAAK,cAAcA,KAAI;AACvB,eAAOA;MACvB;AACY,WAAK,eAAe,KAAK;AACzB,aAAO,KAAK;IACxB;IACQ,wBAAwB;AACpB,iBAAWA,SAAQ,KAAK,OAAO;AAC3B,QAAAA,MAAK,cAAa;MAClC;IACA;IACQ,oBAAoB,SAAS,WAAW,qBAAqB;AACzD,UAAI,KAAK,eAAe,KAAK,YAAY,QAAQ,SAAS;AACtD,aAAK,cAAc;MACnC;AACY,YAAM,cAAc,KAAK,MAAM,KAAK,CAACA,UAASA,MAAK,QAAQ,OAAO;AAClE,UAAI,CAAC;AACD;AACJ,kBAAY,gBAAgB,QAAQ;IAChD;EACA;AACA;AACyB,YAAA,oBAAG;;;;ACtI5B,OAAO,eAAe,cAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACxC,aAAA,eAAG;AACvB,IAAM2B,aAAW9F;AACjB,IAAM8e,UAAQ5e;AACd,aAAA,eAAuB4e,QAAM,EAAE,MAAM,CAACA,QAAM,EAAE,WAAW,UAAU,GAAGA,QAAM,EAAE,WAAWhZ,WAAS,MAAM,CAAC,CAAC;;ACJ1G,SAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,UAAuB,eAAA,QAAA,cAAsB;AAC7C,QAAMqZ,YAAWnf;AACjB,QAAM,iBAAiBE;AACvB,UAAA,cAAsB,eAAe,aAAa,OAAO,OAAK,EAAE,WAAW,IAAI,2BAA2B;AAC1G,QAAM,eAAe,CAAC,KAAK,YAAY;AACnC,UAAM,yBAAyB,QAAQ,YAAY,UAAU,GAAG;AAChE,UAAM,EAAE,eAAe,MAAK,IAAK,WAAW,CAAA;AAC5C,UAAM,WAAW,WAAW;AAC5B,QAAI,CAAC,UAAU;AACX,aAAO,EAAE,SAAS,KAAI;;AAE1B,UAAM,kBAAkB,IAAIif,UAAS,sBAAsB,GAAG;AAC9D,QAAI,cAAc;AACd,YAAM;;AAEV,WAAO;MACH,SAAS;MACT,OAAO,uBAAuB;MAC9B,SAAS,gBAAgB;IACjC;EACA;AACA,UAAA,eAAuB;;ACtBvB,OAAO,eAAe,sBAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC1B,qBAAA,6BAAG;AACrC,IAAMrZ,aAAW9F;AACjB,IAAM8e,UAAQ5e;AACd,IAAM,UAAU2D;AAChB,qBAAA,6BAAqCib,QAAM,EAAE,OAAO;EAChD,OAAOA,QAAM,EAAE,WAAWhZ,WAAS,MAAM,EAAE,YAAY,CAAC,KAAK,WAAW;AACpE,UAAM,kBAAkB,QAAQ,YAAY,UAAU,GAAG;AACzD,QAAI,CAAC,gBAAgB;AACjB,sBAAgB,MAAM,OAAO,QAAQ,WAAS,OAAO,SAAS,KAAK,CAAC;EAChF,CAAK;EACD,QAAQgZ,QAAM,EAAE,WAAWhZ,WAAS,MAAM,EAAE,OAAO,UAAQ,KAAK,SAAS,GAAG;IACxE,SAAS;EACjB,CAAK;EACD,WAAWgZ,QAAM,EAAE,OAAM,EAAG,IAAG,EAAG,YAAY,EAAE,SAAS,2CAA0C,CAAE;AACzG,CAAC;;ACfD,OAAO,eAAe5Y,QAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5DA,OAAA,0BAAkCA,OAAA,6BAAqCA,OAAA,uBAAwDA,OAAA,oBAA6BA,OAAA,qBAAAA,OAAA,oCAA+CA,OAAA,0BAAkC;AAC7O,IAAM,cAAclG;AACpB,IAAM,0BAAN,cAAsC,MAAM;EACxC,YAAY,WAAW,eAAe;AAClC,UAAM,wEAAuE,GAAI,YAAY,UAAU,SAAS,CAAC,kDAAiD,GAAI,YAAY,UAAU,aAAa,CAAC,EAAE;EACpN;AACA;AAC+BkG,OAAA,0BAAG;AAClC,IAAM,oCAAN,cAAgD,MAAM;EAClD,YAAY,QAAQ,kBAAkB;AAClC,UAAM,iCAAiC,MAAM,4CAA4C,gBAAgB,EAAE;EACnH;AACA;AACyCA,OAAA,oCAAG;AAC5C,IAAM,qBAAN,cAAiC,MAAM;EACnC,YAAY,QAAQ;AAChB,UAAM,oBAAmB,GAAI,YAAY,UAAU,MAAM,CAAC,oCAAoC;EACtG;AACA;AAC0BA,OAAA,qBAAG;AAC7B,IAAM,oBAAN,cAAgC,MAAM;EAClC,cAAc;AACV,UAAM,qGAAqG;EACnH;AACA;AACyBA,OAAA,oBAAG;AAC5B,IAAM,uBAAN,cAAmC,MAAM;EACrC,YAAY2X,eAAc;AACtB,UAAM,4CAA4CA,aAAY,EAAE;EACxE;AACA;AAC4B3X,OAAA,uBAAG;AAC/B,IAAM,6BAAN,cAAyC,MAAM;EAC3C,YAAY,gBAAgB;AACxB,UAAM,4DAA2D,GAAI,YAAY,cAAc,cAAc,CAAC,GAAG;EACzH;AACA;AACkCA,OAAA,6BAAG;AACrC,IAAM,0BAAN,cAAsC,MAAM;EACxC,cAAc;AACV,UAAM,iDAAiD;EAC/D;AACA;AAC+BA,OAAA,0BAAG;;AC5ClC,OAAO,eAAe,UAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5C,SAAA,WAAG;AACD,SAAA,aAAG;AACL,SAAA,WAAG;AACqB,SAAA,mCAAG;AACE,SAAA,wCAAG;AACrB,SAAA,sBAAG;AACE,SAAA,2BAAG;AACd,SAAA,gBAAG;AACG,SAAA,sBAAG;AACQ,SAAA,iCAAG;AACd,SAAA,sBAAG;AACG,SAAA,4BAAG;AACE,SAAA,iCAAG;AAChB,SAAA,oBAAG;AACE,SAAA,yBAAG;AACJ,SAAA,wBAAG;AACE,SAAA,6BAAG;AACA,SAAA,gCAAG;AACE,SAAA,qCAAG;AAC7C,IAAMJ,aAAW9F;AACjB,IAAM8e,UAAQ5e;AACd,IAAM,eAAe4e,QAAM,EAAE,MAAM;EAC/BA,QAAM,EAAE,QAAO;EACfA,QAAM,EAAE,OAAM;EACdA,QAAM,EAAE,OAAM;EACdA,QAAM,EAAE,OAAM;EACdA,QAAM,EAAE,WAAWhZ,WAAS,MAAM;EAClCgZ,QAAM,EAAE,MAAMA,QAAM,EAAE,QAAO,CAAE;EAC/BA,QAAM,EAAE,OAAOA,QAAM,EAAE,QAAO,CAAE;AACpC,CAAC;AACD,IAAM,iBAAiBA,QAAM,EAAE,OAAO,YAAY;AAClD,IAAM,uCAAuCA,QAAM,EAAE,OAAO;EACxD,KAAKA,QAAM,EAAE,OAAM;EACnB,MAAMA,QAAM,EAAE,OAAM;EACpB,MAAMA,QAAM,EAAE,OAAM,EAAG,SAAQ;AACnC,CAAC;AACD,IAAM,0BAA0BA,QAAM,EAAE,OAAO;EAC3C,KAAKA,QAAM,EAAE,OAAM;EACnB,cAAcA,QAAM,EAAE,OAAM;EAC5B,QAAQA,QAAM,EAAE,OAAM;EACtB,QAAQA,QAAM,EAAE,OAAM;EACtB,cAAcA,QAAM,EAAE,MAAM,oCAAoC;EAChE,SAASA,QAAM,EAAE,OAAM;EACvB,WAAWA,QAAM,EAAE,MAAMA,QAAM,EAAE,OAAM,CAAE;EACzC,WAAWA,QAAM,EAAE,OAAM;AAC7B,CAAC;AACD,IAAM,0BAA0BA,QAAM,EAAE,OAAO;EAC3C,IAAIA,QAAM,EAAE,OAAM;AACtB,CAAC;AACD,IAAM,0BAA0BA,QAAM,EAAE,OAAO;EAC3C,mBAAmBA,QAAM,EAAE,OAAM;AACrC,CAAC;AACD,IAAM,qCAAqCA,QAAM,EAAE,OAAO;EACtD,OAAOA,QAAM,EAAE,OAAM;AACzB,CAAC;AACD,IAAM,0BAA0BA,QAAM,EAAE,OAAO;EAC3C,MAAMA,QAAM,EAAE,WAAWhZ,WAAS,MAAM;EACxC,aAAagZ,QAAM,EAAE,WAAWhZ,WAAS,MAAM;EAC/C,SAASgZ,QAAM,EAAE,WAAWhZ,WAAS,MAAM;EAC3C,iBAAiB;EACjB,SAASgZ,QAAM,EAAE,OAAM;AAC3B,CAAC;AACD,IAAM,gCAAgCA,QAAM,EAAE,OAAO;EACjD,UAAUA,QAAM,EAAE,OAAM;EACxB,aAAaA,QAAM,EAAE,OAAM;EAC3B,aAAaA,QAAM,EAAE,OAAM;EAC3B,SAASA,QAAM,EAAE,OAAM;EACvB,WAAWA,QAAM,EAAE,OAAM;EACzB,OAAOA,QAAM,EAAE,OAAM;EACrB,QAAQA,QAAM,EAAE,OAAM;EACtB,QAAQA,QAAM,EAAE,OAAM;AAC1B,CAAC;AACD,IAAM,wBAAwBA,QAAM,EAAE,OAAO;EACzC,UAAUA,QAAM,EAAE,WAAWhZ,WAAS,MAAM;EAC5C,aAAagZ,QAAM,EAAE,OAAM;EAC3B,aAAaA,QAAM,EAAE,WAAWhZ,WAAS,MAAM;EAC/C,SAASgZ,QAAM,EAAE,WAAWhZ,WAAS,MAAM;EAC3C,WAAWgZ,QAAM,EAAE,OAAM;EACzB,OAAOA,QAAM,EAAE,WAAWhZ,WAAS,MAAM;EACzC,QAAQgZ,QAAM,EAAE,WAAWhZ,WAAS,MAAM;EAC1C,QAAQgZ,QAAM,EAAE,WAAWhZ,WAAS,MAAM;AAC9C,CAAC;AACD,IAAM,4BAA4BgZ,QAAM,EAAE,OAAO;EAC7C,OAAOA,QAAM,EAAE,WAAWhZ,WAAS,MAAM;EACzC,cAAcgZ,QAAM,EAAE,OAAM;EAC5B,iBAAiBA,QAAM,EAAE,OAAM;AACnC,CAAC;AACD,IAAM,oCAAoCA,QAAM,EAAE,OAAO;EACrD,OAAOA,QAAM,EAAE,OAAM;EACrB,cAAcA,QAAM,EAAE,OAAM;EAC5B,iBAAiBA,QAAM,EAAE,OAAM;AACnC,CAAC;AACD,SAAS,SAAS,OAAO;AACrB,QAAM,SAASA,QAAM,EAAE,OAAM,EAAG,UAAU,KAAK;AAC/C,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,WAAW,OAAO;AACvB,QAAM,SAAS,eAAe,UAAU,KAAK;AAC7C,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,SAAS,OAAO;AACrB,QAAM,SAAS,aAAa,UAAU,KAAK;AAC3C,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,iCAAiC,OAAO;AAC7C,QAAM,SAAS,qCAAqC,UAAU,KAAK;AACnE,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,sCAAsC,OAAO;AAClD,QAAM,SAASA,QAAM,EAAE,MAAM,oCAAoC,EAAE,UAAU,KAAK;AAClF,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,oBAAoB,OAAO;AAChC,QAAM,SAAS,wBAAwB,UAAU,KAAK;AACtD,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,yBAAyB,OAAO;AACrC,QAAM,SAASA,QAAM,EAAE,MAAM,uBAAuB,EAAE,UAAU,KAAK;AACrE,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,cAAc,OAAO;AAC1B,QAAM,SAAS,wBAAwB,UAAU,KAAK;AACtD,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,oBAAoB,OAAO;AAChC,QAAM,SAAS,wBAAwB,UAAU,KAAK;AACtD,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,+BAA+B,OAAO;AAC3C,QAAM,SAAS,mCAAmC,UAAU,KAAK;AACjE,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,oBAAoB,OAAO;AAChC,QAAM,SAAS,wBAAwB,UAAU,KAAK;AACtD,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,0BAA0B,OAAO;AACtC,QAAM,SAAS,8BAA8B,UAAU,KAAK;AAC5D,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,+BAA+B,OAAO;AAC3C,QAAM,SAASA,QAAM,EAAE,MAAM,6BAA6B,EAAE,UAAU,KAAK;AAC3E,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,kBAAkB,OAAO;AAC9B,QAAM,SAAS,sBAAsB,UAAU,KAAK;AACpD,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,uBAAuB,OAAO;AACnC,QAAM,SAASA,QAAM,EAAE,MAAM,qBAAqB,EAAE,UAAU,KAAK;AACnE,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,sBAAsB,OAAO;AAClC,QAAM,SAAS,0BAA0B,UAAU,KAAK;AACxD,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,2BAA2B,OAAO;AACvC,QAAM,SAASA,QAAM,EAAE,MAAM,yBAAyB,EAAE,UAAU,KAAK;AACvE,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,8BAA8B,OAAO;AAC1C,QAAM,SAAS,kCAAkC,UAAU,KAAK;AAChE,SAAO,OAAO,UAAU,QAAQ;AACpC;AACA,SAAS,mCAAmC,OAAO;AAC/C,QAAM,SAASA,QAAM,EAAE,MAAM,iCAAiC,EAAE,UAAU,KAAK;AAC/E,SAAO,OAAO,UAAU,QAAQ;AACpC;;ACxKA,OAAO,eAAe8J,qBAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACnCA,oBAAA,oBAAG;AAC5B,IAAMC,UAAQ7oB;AAMd,SAAS,kBAAkByf,MAAK;AAC5B,UAAO,GAAIoJ,QAAM,WAAWpJ,IAAG;AACnC;;ACVA,OAAO,eAAe,YAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAClC,WAAA,qBAAG;AAC7B,IAAMX,UAAQ9e;AACd,IAAMod,gBAAcld;AACpB,IAAM,mBAAmB4e,QAAM,EAAE,OAAO;EACpC,qBAAqBA,QAAM,EAAE,OAAM,EAAG,IAAG,EAAG,SAAQ;AACxD,CAAC;AACD,IAAM,qBAAqB,CAAC,SAAS;AACjC,QAAM,SAAS,iBAAiB,UAAU,IAAI;AAC9C,MAAI,CAAC,OAAO,SAAS;AACjB,WAAO,EAAE,qBAAqB1B,cAAY,qBAAqB,IAAG;EAC1E;AACI,SAAO,OAAO;AAClB;AAC0B,WAAA,qBAAG;;;;ACd7B,IAAI,kBAAmB9Z,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,MAAI,OAAO,OAAW,MAAK;AAC3B,MAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,MAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,WAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,aAAO,EAAE,CAAC;IAAE,EAAE;EACjE;AACI,SAAO,eAAe,GAAG,IAAI,IAAI;AACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,MAAI,OAAO,OAAW,MAAK;AAC3B,IAAE,EAAE,IAAI,EAAE,CAAC;AACf;AACA,IAAI,qBAAsBA,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,SAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;AACtE,KAAK,SAAS,GAAG,GAAG;AAChB,IAAE,SAAS,IAAI;AACnB;AACA,IAAI,eAAgBA,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,MAAI,UAAU,SAAS,GAAG;AACtB,cAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,UAAI,KAAK,CAAA;AACT,eAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,aAAO;IACnB;AACQ,WAAO,QAAQ,CAAC;EACxB;AACI,SAAO,SAAUhd,MAAK;AAClB,QAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,QAAI,SAAS,CAAA;AACb,QAAIA,QAAO;AAAM,eAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQA,MAAK,EAAE,CAAC,CAAC;;AAC/H,uBAAmB,QAAQA,IAAG;AAC9B,WAAO;EACf;AACA,GAAC;AACD,IAAIkd,cAAalc,kBAAQA,eAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,WAAS,MAAM,OAAO;AAAE,WAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU2D,UAAS;AAAE,MAAAA,SAAQ,KAAK;IAAE,CAAE;EAAE;AAC1G,SAAO,KAAK,MAAM,IAAI,UAAU,SAAUA,UAAS,QAAQ;AACvD,aAAS,UAAU,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,KAAK,KAAK,CAAC;MAAE,SAAU,GAAG;AAAE,eAAO,CAAC;MAAE;IAAE;AACzF,aAAS,SAAS,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,OAAO,EAAE,KAAK,CAAC;MAAE,SAAU,GAAG;AAAE,eAAO,CAAC;MAAE;IAAE;AAC5F,aAAS,KAAK,QAAQ;AAAE,aAAO,OAAOA,SAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;IAAE;AAC5G,UAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,KAAI,CAAE;EAC5E,CAAK;AACL;AACA,OAAO,eAAe,UAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACvC,SAAA,gBAAG;AACxB,IAAM,WAAWjH;AACjB,IAAM,SAAS,aAAaE,QAAoB;AAChD,IAAM,kBAAkB2D;AACxB,IAAMilB,YAAUvkB;AAChB,SAAS,wBAAwB,SAAS;AACtC,MAAI,CAAC;AACD,WAAO,EAAE,YAAY,QAAW,WAAW,OAAS;AACxD,QAAM,aAAa,IAAI,gBAAe;AACtC,QAAM,eAAe,IAAI,MAAM,yBAAyB,OAAO,IAAI;AACnE,eAAa,OAAO;AACpB,QAAM,YAAY,WAAW,MAAM,WAAW,MAAM,YAAY,GAAG,OAAO;AAC1E,SAAO,EAAE,YAAY,UAAS;AAClC;AACA,SAAS,cAAc,QAAQX,OAAM,UAAU,SAAS,YAAY;AAChE,SAAO4b,YAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,QAAI,UAAUsJ,UAAQ,OAAO,KAAK;AAC9B,aAAO,MAAM,IAAIllB,OAAM,UAAU,OAAO;IACpD,OACa;AACD,aAAO,MAAM,KAAKA,OAAM,UAAU,SAAS,UAAU;IACjE;EACA,CAAK;AACL;AAOA,SAAS,IAAIA,OAAM,UAAU,SAAS;AAClC,SAAO4b,YAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,WAAO,MAAM,WAAW,IAAI,IAAI5b,OAAM,QAAQ,EAAE,IAAI,EAAE;AACtD,QAAI;AACA,YAAM,EAAE,YAAY,UAAS,IAAK,wBAAwB,OAAO;AACjE,YAAM,WAAW,MAAM,MAAM,IAAI,IAAIA,OAAM,QAAQ,EAAE,MAAM;QACvD,QAAQ,eAAe,QAAQ,eAAe,SAAS,SAAS,WAAW;MAC3F,CAAa;AACD,UAAI;AACA,qBAAa,SAAS;AAC1B,YAAM,cAAc,SAAS,QAAQ,IAAI,cAAc;AACvD,YAAM,uBAAuB,SAAS,QAAQ,IAAI,yBAAyB;AAC3E,UAAI,UAAU;AACd,YAAMsC,SAAQ;AACd,UAAI,gBAAgB,QAAQ,gBAAgB,SAAS,SAAS,YAAY,SAAS,kBAAkB,GAAG;AACpG,kBAAU,MAAM,SAAS,KAAI;MAC7C,WACqB,gBAAgB,QAAQ,gBAAgB,SAAS,SAAS,YAAY,SAAS,YAAY,GAAG;AACnG,kBAAU,MAAM,SAAS,KAAI;MAC7C,WACqB,gBAAgB,QAAQ,gBAAgB,SAAS,SAAS,YAAY,SAAS,0BAA0B,GAAG;AACjH,kBAAU,MAAM,4BAA4B,QAAQ;MACpE;AACY,aAAO,qBAAqBA,QAAO,SAAS,QAAQ,SAAS,oBAAoB;IAC7F,SACeA,QAAO;AACV,aAAO,MAAMA,OAAM,OAAO;AAC1B,aAAO,qBAAqBA,QAAO,MAAM,IAAI;IACzD;EACA,CAAK;AACL;AACA,SAAS,4BAA4B,UAAU;AAC3C,SAAOsZ,YAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,UAAM,cAAc,SAAS,QAAQ,IAAI,cAAc;AACvD,QAAI,gBAAgB,4BAA4B;AAC5C,YAAM,iBAAiB,MAAM,SAAS,YAAW;AACjD,YAAM3f,UAAS,SAAS,OAAO,KAAK,cAAc;AAClD,cAAO,GAAI,gBAAgB,aAAaA,OAAM;IAC1D;AACQ,QAAI,gBAAgB,oBAAoB;AACpC,aAAO,MAAM,SAAS,KAAI;IACtC;AACQ,UAAM,eAAe,MAAM,SAAS,KAAI;AACxC,WAAO,eAAe,eAAe,SAAS;EACtD,CAAK;AACL;AAQA,SAAS,KAAK+D,OAAM,UAAU,SAAS,aAAa;AAChD,SAAO4b,YAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,WAAO,MAAM,YAAY,IAAI,IAAI5b,OAAM,QAAQ,EAAE,IAAI,EAAE;AACvD,WAAO,MAAM,aAAa,KAAK,UAAU,WAAW,CAAC,EAAE;AACvD,QAAI,SAAS,OAAO,SAAS,WAAW,GAAG;AACvC,UAAI;AACA,cAAM,EAAE,YAAY,UAAS,IAAK,wBAAwB,OAAO;AACjE,cAAM,iBAAiB;UACnB,QAAQ;UACR,MAAM,IAAI,WAAW,WAAW;UAChC,SAAS;YACL,QAAQ;YACR,gBAAgB;UACxC;UACoB,QAAQ,eAAe,QAAQ,eAAe,SAAS,SAAS,WAAW;QAC/F;AACgB,cAAM,WAAW,MAAM,MAAM,IAAI,IAAIA,OAAM,QAAQ,EAAE,MAAM,cAAc;AACzE,YAAI;AACA,uBAAa,SAAS;AAC1B,cAAM,uBAAuB,SAAS,QAAQ,IAAI,yBAAyB;AAC3E,eAAO,qBAAqB,MAAM,SAAS,QAAQ,MAAM,4BAA4B,QAAQ,GAAG,oBAAoB;MACpI,SACmBsC,QAAO;AACV,eAAO,qBAAqBA,QAAO,MAAM,IAAI;MAC7D;IACA,OACa;AACD,UAAI;AACA,cAAM,EAAE,YAAY,UAAS,IAAK,wBAAwB,OAAO;AACjE,cAAM,WAAW,MAAM,MAAM,IAAI,IAAItC,OAAM,QAAQ,EAAE,MAAM;UACvD,QAAQ;UACR,MAAM,KAAK,UAAU,WAAW;UAChC,SAAS;YACL,QAAQ;YACR,gBAAgB;UACxC;UACoB,QAAQ,eAAe,QAAQ,eAAe,SAAS,SAAS,WAAW;QAC/F,CAAiB;AACD,YAAI;AACA,uBAAa,SAAS;AAC1B,cAAM,uBAAuB,SAAS,QAAQ,IAAI,yBAAyB;AAC3E,eAAO,qBAAqB,MAAM,SAAS,QAAQ,MAAM,4BAA4B,QAAQ,GAAG,oBAAoB;MACpI,SACmBsC,QAAO;AACV,eAAO,qBAAqBA,QAAO,MAAM,IAAI;MAC7D;IACA;EACA,CAAK;AACL;AACA,SAAS,qBAAqBA,QAAO,YAAY,SAAS,sBAAsB;AAC5E,MAAI,kBAAkB;AAEtB,MAAIA,UAAS,CAAC,cAAc,CAAC,SAAS;AAClC,sBAAkB;EAC1B;AACI,QAAM,iBAAiB;IACnB,OAAAA;IACA,YAAY;IACZ;EACR;AACI,MAAI,sBAAsB;AACtB,mBAAe,uBAAuB;EAC9C;AACI,SAAO;AACX;;AC9LA,OAAO,eAAe,WAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,UAAA,yBAAgE,UAAA,0BAAA,UAAA,0BAAqC;AACzE,UAAA,uBAAG;AACN,UAAA,oBAAG;AACN,UAAA,iBAAG;AACK,UAAA,yBAAG;AACjC,SAAS,qBAAqBA,QAAO;AACjC,SAAQ,OAAOA,WAAU,YACrBA,WAAU,QACV,UAAUA,UACVA,OAAM,SAAS;AACvB;AACA,SAAS,kBAAkBA,QAAO;AAC9B,SAAQ,OAAOA,WAAU,YACrBA,WAAU,QACV,YAAYA,UACZ,OAAOA,OAAM,WAAW;AAChC;AACA,SAAS,eAAeA,QAAO;AAC3B,SAAQ,OAAOA,WAAU,YAAYA,WAAU,QAAQ,UAAUA,UAAS,OAAOA,OAAM,SAAS;AACpG;AACA,SAAS,uBAAuB,UAAU;AACtC,MAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AAEnD,QAAI,WAAW,YAAY,qBAAqB,SAAS,KAAK,GAAG;AAC7D,aAAO;IACnB;AAEQ,QAAI,aAAa,YAAY,qBAAqB,SAAS,OAAO,GAAG;AACjE,aAAO;IACnB;EACA;AACI,SAAO;AACX;AACA,IAAM,0BAA0B,CAAC,WAAW;AACxC,SAAO,UAAU,OAAO,SAAS;AACrC;AAC+B,UAAA,0BAAG;AAClC,IAAM,0BAA0B,CAAC,WAAW;AACxC,SAAO,UAAU,OAAO,SAAS;AACrC;AAC+B,UAAA,0BAAG;AAClC,IAAM,yBAAyB,CAAC,eAAe,cAAc,OAAO,aAAa;AACnD,UAAA,yBAAG;;;;;;AC3CjC,QAAIwY,mBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;QAAE,EAAE;;AAE7D,aAAO,eAAe,GAAG,IAAI,IAAI;UAC/B,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;;AAEf,QAAIsb,sBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;IACnB;AACA,QAAIub,gBAAgBvb,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,cAAI,KAAK,CAAA;AACT,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;QACnB;AACQ,eAAO,QAAQ,CAAC;MACxB;AACI,aAAO,SAAUhd,MAAK;AAClB,YAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,YAAI,SAAS,CAAA;AACb,YAAIA,QAAO;AAAM,mBAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,CAAAoc,iBAAgB,QAAQpc,MAAK,EAAE,CAAC,CAAC;;AAC/H,QAAAsc,oBAAmB,QAAQtc,IAAG;AAC9B,eAAO;MACf;IACA,GAAC;AACD,QAAIkd,aAAalc,kBAAQA,eAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,eAAS,MAAM,OAAO;AAAE,eAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU2D,UAAS;AAAE,UAAAA,SAAQ,KAAK;QAAE,CAAE;MAAE;AAC1G,aAAO,KAAK,MAAM,IAAI,UAAU,SAAUA,UAAS,QAAQ;AACvD,iBAAS,UAAU,OAAO;AAAE,cAAI;AAAE,iBAAK,UAAU,KAAK,KAAK,CAAC;UAAE,SAAU,GAAG;AAAE,mBAAO,CAAC;UAAE;QAAE;AACzF,iBAAS,SAAS,OAAO;AAAE,cAAI;AAAE,iBAAK,UAAU,OAAO,EAAE,KAAK,CAAC;UAAE,SAAU,GAAG;AAAE,mBAAO,CAAC;UAAE;QAAE;AAC5F,iBAAS,KAAK,QAAQ;AAAE,iBAAO,OAAOA,SAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;QAAE;AAC5G,cAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,KAAI,CAAE;MAC5E,CAAK;IACL;AACA,WAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,YAAA,iBAAyB,QAA+B,uBAAA,QAAA,gBAAwB;AAChF,YAAA,eAAuB;AACvB,YAAA,iBAAyB;AACzB,YAAA,gBAAwB;AACxB,YAAA,iBAAyB;AACzB,YAAA,eAAuB;AACvB,YAAA,0BAAkC;AAClC,YAAA,uBAA+B;AAC/B,UAAMkW,WAAUnd,eAAA;AAChB,UAAM,aAAaE;AACnB,UAAMyf,UAASd,cAAahb,QAAoB;AAChD,UAAM,eAAeU;AACrB,aAAS,uBAAuB,YAAY2B,QAAO;AAC/C,WAAI,GAAI,aAAa,gBAAgBA,MAAK,GAAG;AACzC,cAAM,EAAE,MAAA7E,MAAI,IAAK6E;AACjB,YAAI7E,UAAS;AACT,iBAAO,IAAI,KAAK;AACpB,YAAIA,UAAS;AACT,iBAAO,IAAI,KAAK;;AAExB,YAAM,UAAS,GAAI,aAAa,mBAAmB6E,MAAK,IAAIA,OAAM,SAAS;AAC3E,cAAQ,QAAM;QACV,KAAK;AACD,iBAAO,KAAK;;QAChB,KAAK;AACD,iBAAO,KAAK;;QAChB,KAAK;AACD,iBAAO,IAAI;;QACf,KAAK;AACD,iBAAO,KAAK;;QAChB;AACI,iBAAO,IAAI;;;AAGvB,aAAS,aAAamZ,KAAI;AACtB,aAAOG,WAAU,MAAM,WAAW,QAAQ,WAAW,EAAE,QAAQ,MAAA5b,OAAM,QAAA4P,SAAQ,YAAY,gBAAe,GAAK;AACzG,eAAO,MAAM,aAAa;UACtB;UACA,MAAA5P;UACA,QAAA4P;UACA;UACA;UACA,oBAAoB;UACpB,mBAAmBA,QAAO;;QACtC,CAAS;MACT,CAAK;;AAEL,aAAS,eAAe6L,KAAI;AACxB,aAAOG,WAAU,MAAM,WAAW,QAAQ,WAAW,EAAE,QAAQ,MAAA5b,OAAM,QAAA4P,SAAQ,YAAY,gBAAe,GAAK;AACzG,eAAO,MAAM,aAAa;UACtB;UACA,MAAA5P;UACA,QAAA4P;UACA;UACA;UACA,oBAAoB;UACpB,mBAAmBA,QAAO;QACtC,CAAS;MACT,CAAK;;AAEL,YAAwB,gBAAA;MACpB,cAAc;IAClB;AACA,aAAS,8BAA8B,oBAAoB;AACvD,aAAO,sBAAsB,qBAAqB,KAAK;;AAE3D,aAAS,cAAc6L,KAAI;AACvB,aAAOG,WAAU,MAAM,WAAW,QAAQ,WAAW,EAAE,QAAQ,MAAA5b,OAAM,QAAA4P,SAAQ,YAAY,gBAAe,GAAK;AACzG,YAAI;AAEJ,cAAM,uBAAuB,8BAA8BA,QAAO,aAAa,MAAM;AACrF,cAAM,mBAAmBA,QAAO,aAAa,SAAS,uBAAuB;AAC7E,cAAM,EAAE,aAAAuV,aAAW,IAAKvV;AACxB,cAAM,UAAU;AAChB,cAAM,iBAAiBuV,aAAY,mBAAmB,KAAKvV,QAAO,uBAAuB,QAAQ,OAAO,SAAS,KAAK,oBAAoB;AAC1I,cAAM,WAAW,CAAA;AACjB,cAAM,WAAW,eAAe,IAAI,CAACrP,UAASqb,WAAU,MAAM,QAAQ,QAAQ,aAAa;AACvF,cAAI;AACA,kBAAM,iBAAiB,oBAAoB,QAAQ,oBAAoB,SAAS,kBAAkBhM,QAAO;AACzG,kBAAM,WAAW,OAAO,GAAG,WAAW,eAAe,QAAQ5P,OAAMO,MAAK,KAAK,gBAAgB,UAAU;AACvG,kBAAM,EAAE,WAAU,IAAK;AACvB,gBAAI,eAAe,GAAG,aAAa,wBAAwB,UAAU,GAAG;AACpE,uBAAS,KAAK,EAAE,MAAM,WAAW,QAAQ,SAAQ,CAAE;mBAElD;AACD,kBAAI,eAAe,GAAG,aAAa,yBAAyB,UAAU,GAAG;AACrE,sBAAM,WAAW,uBAAuB,YAAY,SAAS,KAAK;AAClE,gBAAA4kB,aAAY,oBAAoB5kB,MAAK,KAAK,QAAQ;;AAEtD,uBAAS,KAAK,EAAE,MAAM,WAAW,QAAQ,SAAQ,CAAE;;AAEvD,mBAAO;mBAEJ+B,QAAO;AACV,qBAAS,KAAK,EAAE,MAAM,SAAS,QAAQA,OAAK,CAAE;AAC9C,mBAAOA;;SAEd,CAAC;AACF,YAAI,oBAAoB;AAExB,iBAAS,IAAI,GAAG,IAAI,sBAAsB,KAAK;AAC3C,8BAAoB,MAAM,wBAAwB,mBAAmB,OAAO;;AAGhF,cAAM,qBAAqB,SAAS,OAAO,aAAW,QAAQ,SAAS,SAAS;AAChF,cAAM,kBAAkB,SAAS,OAAO,aAAW,QAAQ,SAAS,SAAS;AAC7E,cAAM,gBAAgB,SAAS,OAAO,aAAW,QAAQ,SAAS,OAAO;AAEzE,cAAM,8BAA6B,GAAI,QAAQ,gBAAgB,kBAAkB;AAGjF,eAAO,MAAM;AAET,cAAI,2BAA2B,0BAAyB,KAAM,sBAAsB;AAChF,gBAAI,2BAA2B,0BAAyB,IAAK,GAAG;AAC5D,cAAAyZ,QAAO,QAAQ,+DAA+D;;AAElF,mBAAO,2BAA2B,iBAAgB;;AAItD,cAAI,CAAC,GAAG,iBAAiB,GAAG,aAAa,EAAE,UAAU,kBAAkB;AACnE,gBAAI,gBAAgB,SAAS,GAAG;AAC5B,qBAAO,gBAAgB,CAAC,EAAE;mBAEzB;AACD,oBAAM,cAAc,CAAC,EAAE;;;AAI/B,cAAI,SAAS,UAAUnM,QAAO,aAAa,QAAQ;AAC/C,kBAAM,IAAI,MAAM,QAAQ,cAAc,YAAY;;AAGtD,8BAAoB,MAAM,wBAAwB,mBAAmB,OAAO;;MAExF,CAAK;;AAEL,aAAS,eAAe6L,KAAI;AACxB,aAAOG,WAAU,MAAM,WAAW,QAAQ,WAAW,EAAE,QAAQ,MAAA5b,OAAM,QAAA4P,SAAQ,YAAY,gBAAe,GAAK;AACzG,YAAI,aAAa;AACjB,YAAI,UAAU;AACd,YAAItN,SAAQ;AACZ,YAAI,uBAAuB;AAC3B,cAAM,WAAWsN,QAAO,YAAY,QAAO;AAC3C,YAAI,CAAC,UAAU;AACX,gBAAM,IAAI,MAAM,sEAAsE;;AAE1F,iBAAS,UAAU,GAAG,UAAUA,QAAO,qBAAqB,WAAW;AACnE,gBAAM,iBAAiB,oBAAoB,QAAQ,oBAAoB,SAAS,kBAAkBA,QAAO;AACzG,gBAAM,WAAW,OAAM,GAAI,WAAW,eAAe,QAAQ5P,OAAM,SAAS,KAAK,gBAAgB,UAAU;AAC3G,cAAI,UAAU;AACV,aAAC,EAAE,OAAAsC,QAAO,YAAY,SAAS,qBAAoB,IAAK;;AAE5D,gBAAM6I,WAAU,cACV,GAAI,aAAa,yBAAyB,UAAU,MAAK,GAAI,aAAa,yBAAyB,UAAU,IAC7G;AACN,cAAI,CAACA,YAAW,CAAC7I,QAAO;AACpB,mBAAO,EAAE,OAAAA,QAAO,YAAY,SAAS,qBAAoB;;AAE7D,UAAAyZ,QAAO,KAAK,GAAG,MAAM,sBAAsB,SAAS,GAAG,cAAc,UAAU,CAAC,MAAMnM,QAAO,mBAAmB,EAAE;AAClH,iBAAM,GAAI2J,SAAQ,OAAO3J,QAAO,eAAe;;AAEnD,eAAO,EAAE,OAAAtN,QAAO,YAAY,SAAS,qBAAoB;MACjE,CAAK;;AAEL,aAAS,aAAamZ,KAAI;AACtB,aAAOG,WAAU,MAAM,WAAW,QAAQ,WAAW,EAAE,QAAQ,MAAA5b,OAAM,QAAA4P,SAAQ,YAAY,oBAAoB,mBAAmB,gBAAe,GAAK;AAChJ,YAAI,IAAI,IAAI;AACZ,YAAI,aAAa;AACjB,YAAI,UAAU;AACd,YAAItN,SAAQ;AACZ,YAAI,uBAAuB;AAC3B,cAAM,EAAE,aAAA6iB,aAAW,IAAKvV;AACxB,cAAM,iBAAiBuV,aAAY,kBAAkB,iBAAiB;AACtE,mBAAW5kB,SAAQ,gBAAgB;AAC/B,mBAAS,UAAU,GAAG,UAAUqP,QAAO,qBAAqB,WAAW;AACnE,kBAAM,iBAAiB,oBAAoB,QAAQ,oBAAoB,SAAS,kBAAkBA,QAAO;AACzG,kBAAM,WAAW,OAAM,GAAI,WAAW,eAAe,QAAQ5P,OAAMO,MAAK,KAAK,gBAAgB,UAAU;AACvG,YAAA+B,UAAS,KAAK,aAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,WAAW,QAAQ,OAAO,SAAS,KAAK;AACnH,0BAAc,KAAK,aAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,gBAAgB,QAAQ,OAAO,SAAS,KAAK;AAC7H,uBAAW,KAAK,aAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,aAAa,QAAQ,OAAO,SAAS,KAAK;AACvH,mCAAuB,aAAa,QAAQ,aAAa,SAAS,SAAS,SAAS;AACpF,kBAAM,gBAAgB,CAAC,CAAC,eAAc,GAAI,aAAa,yBAAyB,UAAU;AAC1F,kBAAM,gBAAgB,CAAC,CAAC,eAAc,GAAI,aAAa,yBAAyB,UAAU;AAC1F,gBAAI,CAAC,iBAAiB,CAAC,iBAAiB,YAAY;AAEhD,cAAA6iB,aAAY,eAAe5kB;AAC3B,kBAAI4kB,aAAY,gBAAgB5kB,OAAM;AAClC,gBAAAA,MAAK,cAAa;AAClB,gBAAA4kB,aAAY,cAAc5kB,KAAI;;AAElC,qBAAO,EAAE,OAAA+B,QAAO,YAAY,SAAS,qBAAoB;;AAE7D,gBAAI,eAAe;AACf,oBAAM,WAAW,uBAAuB,eAAe,QAAQ,eAAe,SAAS,aAAa,QAAW,SAAS,KAAK;AAC7H,cAAA6iB,aAAY,oBAAoB5kB,MAAK,KAAK,QAAQ;AAClD,cAAAwb,QAAO,KAAK,uCAAuCxb,MAAK,GAAG,mBAAmB;AAC9E;;AAEJ,gBAAI,eAAe;AACf,kBAAI,CAAC,sBAAsB,EAAC,GAAI,aAAa,wBAAwB,QAAQ,GAAG;AAC5E,uBAAO,EAAE,OAAA+B,QAAO,YAAY,SAAS,qBAAoB;;AAE7D,kBAAI,CAAC6iB,aAAY,eAAe;AAC5B,gBAAApJ,QAAO,KAAK,kCAAkCxb,MAAK,GAAG,mBAAmB;AACzE;;;AAIR,YAAAwb,QAAO,KAAK,GAAG,MAAM,sBAAsBxb,MAAK,GAAG,cAAc,UAAU,CAAC,MAAMqP,QAAO,mBAAmB,EAAE;AAE9G,gBAAIA,QAAO,kBAAkB,GAAG;AAC5B,qBAAM,GAAI2J,SAAQ,OAAO3J,QAAO,eAAe;;;;AAI3D,eAAO,EAAE,OAAAtN,QAAO,YAAY,SAAS,qBAAoB;MACjE,CAAK;;AAEL,aAAS,wBAAwB,UAAU,SAAS;AAChD,aAAOsZ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAI,oBAAoB,CAAA;AACxB,YAAI;AACA,gBAAM,kBAAkB,MAAM,QAAQ,KAAK,CAAC,qBAAqB,OAAO,GAAG,GAAG,QAAQ,CAAC;AACvF,gBAAM,oBAAoB,OAAO,GAAG,QAAQ,sBAAsB,QAAQ;AAC1E,gBAAM,yBAAyB,kBAAkB,UAAU,OAAK,KAAK,UAAU,EAAE,KAAK,MAAM,KAAK,UAAU,eAAe,CAAC;AAE3H,4BAAkB,OAAO,wBAAwB,CAAC;AAElD,8BAAoB,kBAAkB,IAAI,OAAK,EAAE,KAAK;AACtD,iBAAO;iBAEJtZ,QAAO;AACV,cAAIA,kBAAiB,SAASA,OAAM,YAAY,oBAAoB;AAChE,kBAAMA;;AAEV,iBAAO;;MAEnB,CAAK;;AAEL,aAAS,qBAAqB,WAAW;AACrC,aAAOsZ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,eAAO,IAAI,QAAQ,CAAC,GAAG,WAAW;AAC9B,qBAAW,MAAM;AACb,mBAAO,IAAI,MAAM,kBAAkB,CAAC;aACrC,SAAS;QACxB,CAAS;MACT,CAAK;;AAEL,UAAM,uBAAuB,CAAC,aAAaA,WAAU,QAAQ,QAAQ,QAAQ,aAAa;AACtF,YAAM,cAAc,CAAA;AACpB,YAAM,eAAe,EAAE,QAAQ,UAAS;AACxC,iBAAW,KAAK,UAAU;AACtB,oBAAY,KAAK,MAAM,QAAQ,KAAK,CAAC,GAAG,YAAY,CAAC,EAAE,KAAK,WAAS,UAAU,eAAe,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,YAAY,GAAG,EAAE,OAAO,EAAC,CAAE,IAAI,EAAE,QAAQ,aAAa,MAAK,GAAI,aAAW,EAAE,QAAQ,YAAY,OAAO,OAAM,EAAG,CAAC;;AAEnP,aAAO;IACX,CAAC;AACD,YAAA,uBAA+B;AAC/B,UAAM,kBAAkB,CAACjf,SAAQ;AAC7B,UAAIA,QAAO,OAAOA,SAAQ,YAAY,CAAC,MAAM,QAAQA,IAAG,GAAG;AACvD,eAAO,KAAK,UAAUA,MAAK,OAAO,KAAKA,IAAG,EAAE,KAAI,CAAE;;AAEtD,aAAO,KAAK,UAAUA,IAAG;IAC7B;AACA,UAAM,iBAAiB,CAAC,cAAc;AAClC,YAAM,cAAc,UAAU,OAAO,CAAC,KAAK,aAAa;AACpD,cAAMsB,OAAM,gBAAgB,SAAS,MAAM;AAC3C,YAAIA,IAAG,IAAI,IAAIA,IAAG,IACZ,EAAE,UAAU,IAAIA,IAAG,EAAE,UAAU,OAAO,IAAIA,IAAG,EAAE,QAAQ,EAAC,IACxD,EAAE,UAAU,OAAO,EAAC;AAC1B,eAAO;SACR,CAAA,CAAE;AACL,YAAM,oBAAoB,OAAO,OAAO,WAAW,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAErF,YAAM,4BAA4B,MAAM;AACpC,eAAO,kBAAkB,SAAS,IAAI,kBAAkB,CAAC,EAAE,QAAQ;MAC3E;AAEI,YAAM,4BAA4B,MAAM;AACpC,eAAO,kBAAkB;MACjC;AAEI,YAAM,mBAAmB,MAAM;AAC3B,eAAO,kBAAkB,CAAC,EAAE,SAAS;MAC7C;AACI,aAAO;QACH;QACA;QACA;MACR;IACA;AACA,YAAA,iBAAyB;;;;;;;;AC/UzB,MAAI2d,aAAalc,kBAAQA,eAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,aAAS,MAAM,OAAO;AAAE,aAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU2D,UAAS;AAAE,QAAAA,SAAQ,KAAK;MAAE,CAAE;IAAE;AAC1G,WAAO,KAAK,MAAM,IAAI,UAAU,SAAUA,UAAS,QAAQ;AACvD,eAAS,UAAU,OAAO;AAAE,YAAI;AAAE,eAAK,UAAU,KAAK,KAAK,CAAC;QAAE,SAAU,GAAG;AAAE,iBAAO,CAAC;QAAE;MAAE;AACzF,eAAS,SAAS,OAAO;AAAE,YAAI;AAAE,eAAK,UAAU,OAAO,EAAE,KAAK,CAAC;QAAE,SAAU,GAAG;AAAE,iBAAO,CAAC;QAAE;MAAE;AAC5F,eAAS,KAAK,QAAQ;AAAE,eAAO,OAAOA,SAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;MAAE;AAC5G,YAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,KAAI,CAAE;IAC5E,CAAK;EACL;AACA,SAAO,eAAe+hB,6BAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACzBA,8BAAA,8BAAGC;AACtC,QAAMH,WAAU9oB;AAChB,QAAM,uBAAuBE,0BAAA;AAC7B,WAAS+oB,8BAA4B,UAAU,QAAQ,UAAU,cAAc;AAC3E,WAAOzJ,WAAU,MAAM,WAAW,QAAQ,WAAW,QAAQ5b,OAAM4P,SAAQ,YAAY,sBAAsB,OAAO,iBAAiB;AACjI,cAAQA,QAAO,kBAAgB;QAC3B,KAAKsV,SAAQ,iBAAiB;AAC1B,iBAAO,OAAM,GAAI,qBAAqB,cAAc,EAAE,QAAQ,MAAAllB,OAAM,QAAA4P,SAAQ,YAAY,gBAAe,CAAE;QAC7G,KAAKsV,SAAQ,iBAAiB;AAC1B,iBAAO,OAAM,GAAI,qBAAqB,gBAAgB,EAAE,QAAQ,MAAAllB,OAAM,QAAA4P,SAAQ,YAAY,gBAAe,CAAE;QAC/G,KAAKsV,SAAQ,iBAAiB;AAC1B,iBAAO,OAAM,GAAI,qBAAqB,gBAAgB,EAAE,QAAQ,MAAAllB,OAAM,QAAA4P,SAAQ,YAAY,gBAAe,CAAE;QAC/G,KAAKsV,SAAQ,iBAAiB;AAC1B,cAAI,qBAAqB;AACrB,mBAAO,OAAM,GAAI,qBAAqB,gBAAgB,EAAE,QAAQ,MAAAllB,OAAM,QAAA4P,SAAQ,YAAY,gBAAe,CAAE;;AAE/G,iBAAO,OAAM,GAAI,qBAAqB,eAAe,EAAE,QAAQ,MAAA5P,OAAM,QAAA4P,SAAQ,YAAY,gBAAe,CAAE;QAC9G;AACI,gBAAM,IAAI,MAAM,kCAAkCA,QAAO,gBAAgB,EAAE;;IAE3F,CAAK;;;;;;;;;AC9BL,QAAIkL,mBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;QAAE,EAAE;;AAE7D,aAAO,eAAe,GAAG,IAAI,IAAI;UAC/B,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;;AAEf,QAAIsb,sBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;IACnB;AACA,QAAIub,gBAAgBvb,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,cAAI,KAAK,CAAA;AACT,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;QACnB;AACQ,eAAO,QAAQ,CAAC;MACxB;AACI,aAAO,SAAUhd,MAAK;AAClB,YAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,YAAI,SAAS,CAAA;AACb,YAAIA,QAAO;AAAM,mBAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,CAAAoc,iBAAgB,QAAQpc,MAAK,EAAE,CAAC,CAAC;;AAC/H,QAAAsc,oBAAmB,QAAQtc,IAAG;AAC9B,eAAO;MACf;IACA,GAAC;AACD,QAAIkd,aAAalc,kBAAQA,eAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,eAAS,MAAM,OAAO;AAAE,eAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU2D,UAAS;AAAE,UAAAA,SAAQ,KAAK;QAAE,CAAE;MAAE;AAC1G,aAAO,KAAK,MAAM,IAAI,UAAU,SAAUA,UAAS,QAAQ;AACvD,iBAAS,UAAU,OAAO;AAAE,cAAI;AAAE,iBAAK,UAAU,KAAK,KAAK,CAAC;UAAE,SAAU,GAAG;AAAE,mBAAO,CAAC;UAAE;QAAE;AACzF,iBAAS,SAAS,OAAO;AAAE,cAAI;AAAE,iBAAK,UAAU,OAAO,EAAE,KAAK,CAAC;UAAE,SAAU,GAAG;AAAE,mBAAO,CAAC;UAAE;QAAE;AAC5F,iBAAS,KAAK,QAAQ;AAAE,iBAAO,OAAOA,SAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;QAAE;AAC5G,cAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,KAAI,CAAE;MAC5E,CAAK;IACL;AACA,WAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,YAAgB,QAAA,QAAA,uBAA+B,QAAgC,wBAAA,QAAA,wBAAgC,QAAoB,YAAA,QAAA,0BAAkC,QAAA,gCAAwC,QAAwC,gCAAA,QAAA,yBAAiC;AACtR,YAAA,8BAAsC;AACtC,YAAA,+BAAuC;AACvC,YAAA,aAAqB;AACrB,YAAA,gBAAwB;AACxB,YAAA,uBAA+B;AAC/B,YAAA,yBAAiC;AACjC,YAAA,mBAA2B;AAC3B,YAAA,2CAAmD;AACnD,YAAA,wCAAgD;AAChD,YAAA,kBAA0B;AAC1B,YAAA,0BAAkC;AAClC,YAAA,wBAAgC;AAChC,YAAA,yCAAiD;AACjD,YAAA,0BAAkC;AAClC,YAAA,4BAAoC;AACpC,YAAA,sCAA8C;AAC9C,YAAA,gCAAwC;AACxC,YAAA,mBAA2B;AAC3B,YAAA,6BAAqC;AACrC,YAAA,kBAA0B;AAC1B,YAAA,oBAA4B;AAC5B,YAAA,qBAA6B;AAC7B,YAAA,0BAAkC;AAClC,YAAA,qBAA6B;AAC7B,UAAMnB,YAAW9F;AACjB,UAAM2f,UAASd,cAAa3e,QAAoB;AAChD,UAAMif,YAAWtb;AACjB,UAAM,UAAUgb,cAAata,KAAqB;AAClD,UAAM,WAAWV;AACjB,UAAMub,eAAc1a;AACpB,UAAM,qBAAqBiB,wBAAA;AAC3B,UAAMmjB,WAAU7gB;AAChB,UAAMihB,iBAAgBhhB;AACtB,UAAM,yBAAyBmB;AAC/B,UAAM,UAAUE;AAChB,UAAM,+BAA+BC,kCAAA;AACrC,UAAM2T,WAAUzT,aAAA;AAChB,UAAM,aAAaC;AACnB,UAAM,sBAAsBqC;AAC5B,UAAM,eAAeC;AACrB,UAAM,gCAAgCC,mCAAA;AACtC,UAAMkR,eAAcjR;AACpB,UAAM,eAAeC;AACrB,aAAS,4BAA4B,UAAU;AAC3C,aAAOoT,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAIH,KAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AACpC,cAAM,mBAAmB,MAAM,wBAAwB,QAAQ;AAC/D,YAAI,qBAAqB,QAAQ,iBAAiB,WAAW,GAAG;AAC5D,gBAAM,MAAM,MAAMA,MAAK,SAAS,mBAAmB,QAAQA,QAAO,SAASA,MAAK,SAAS,mBAAmB,QAAQ,OAAO,SAAS,KAAK;AACzI,gBAAM,IAAI,SAAS,gCAAgC,EAAE;;AAEzD,cAAM,gBAAe,GAAI,QAAQ,uBAAuB,gBAAgB;AACxE,cAAM0J,gBAAc,GAAIG,eAAc,mBAAmB;UACrD,UAAU;UACV,gBAAgB,KAAK,SAAS,mBAAmB,QAAQ,OAAO,SAAS,KAAK;UAC9E,sBAAsB,KAAK,SAAS,oBAAoB,QAAQ,OAAO,SAAS,SAAS,GAAG;QACxG,CAAS;AACD,cAAM,qBAAqB,OAAO,MAAM1J,WAAU,MAAM,QAAQ,QAAQ,aAAa;AACjF,cAAIH;AACJ,cAAI,SAAS,eAAe;AACxB,mBAAO,SAAS;;AAEpB,cAAI,SAAS,kBAAkB,QAAW;AACtC,mBAAO,MAAM,wBAAwB;cACjC,aAAA0J;cACA;cACA,SAAS,SAAS;cAClB,oBAAoB1J,MAAK,SAAS,uBAAuB,QAAQA,QAAO,SAASA,MAAKjC,aAAY,qBAAqB;cACvH,gBAAgB,SAAS;cACzB,iBAAiB,SAAS;YAC9C,CAAiB;;AAEL,gBAAM,IAAI,SAAS,iCAAgC;SACtD,GAAC;AACF,cAAM,oBAAoB,OAAO,MAAMoC,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChF,cAAIH;AACJ,cAAI,SAAS,mBAAmB;AAC5B,mBAAO,SAAS;;AAEpB,gBAAM,oBAAoB;AAC1B,iBAAO,MAAM,wBAAwB;YACjC,aAAA0J;YACA;YACA,SAAS;YACT,oBAAoB1J,MAAK,SAAS,uBAAuB,QAAQA,QAAO,SAASA,MAAKjC,aAAY,qBAAqB;YACvH,gBAAgB,SAAS;YACzB,iBAAiB,SAAS;UAC1C,CAAa;SACJ,GAAC;AACF,eAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,EAAE,cAAc,aAAa2L,aAAW,GAAK,SAAS,6BAA6B,SAC9H,EAAE,0BAA0B,SAAS,yBAAwB,IAC7D,CAAA,CAAE,GAAK,SAAS,kBAAkB,SAAY,EAAE,eAAe,SAAS,cAAa,IAAK,CAAA,CAAE,GAAI,EAAE,eAAe,oBAAoB,oBAAoB,KAAK,SAAS,uBAAuB,QAAQ,OAAO,SAAS,KAAK3L,aAAY,qBAAqB,OAAO,mBAAmB,iBAAiB,SAAS,iBAAiB,GAAG,+BAA+B,iBAAiB,SAAS,6BAA6B,GAAG,8BAA8B,iBAAiB,SAAS,4BAA4B,GAAG,yBAAyB,2BAA2B,SAAS,uBAAuB,GAAG,oBAAoB,KAAK,SAAS,oBAAoB,QAAQ,OAAO,SAAS,SAAS,GAAG,aAAa,QAAQ,sBAAsB,UAAU,uBAAuB,KAAK,SAAS,oBAAoB,QAAQ,OAAO,SAAS,SAAS,GAAG,wBAAwB,QAAQ,sBAAsB,qBAAqB,mBAAmB,KAAK,SAAS,oBAAoB,QAAQ,OAAO,SAAS,SAAS,GAAG,oBAAoB,QAAQ,sBAAsB,iBAAiB,uBAAuB,KAAK,SAAS,oBAAoB,QAAQ,OAAO,SAAS,SAAS,GAAG,wBAAwB,QAAQ,sBAAsB,qBAAqB,mBAAmB,SAAS,qBAAqB,mBAAmB,gBAAgB,SAAS,gBAAgB,iBAAiB,SAAS,gBAAe,CAAE;MAC52C,CAAK;;AAEL,aAAS,6BAA6B5J,SAAQ;AAC1C,aAAOgM,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAIH;AACJ,YAAI;AACA,gBAAM,WAAW,OAAO,GAAG,8BAA8B,6BAA6ByJ,SAAQ,OAAO,KAAK,WAAWtV,QAAO,aAAa,aAAaA,SAAQ,QAAW,QAAQ6L,MAAK7L,QAAO,oBAAoB,QAAQ6L,QAAO,SAASA,MAAK7L,QAAO,eAAe;AACpQ,gBAAM,qBAAqB,GAAG,aAAa,oBAAoB,SAAS,OAAO;AAC/E,iBAAO,kBAAkB;iBAEtBtN,QAAO;AACV,kBAAQ,KAAK,kEAAkEA,MAAK;AACpF,iBAAOkX,aAAY,qBAAqB;;MAEpD,CAAK;;AAEL,aAAS,WAAW,OAAO;AACvB,UAAI,MAAM,UAAU,IAAI;AACpB,cAAMlX,SAAQ,IAAIiZ,UAAS,sBAAsB,KAAK;AACtD,QAAAQ,QAAO,MAAMzZ,OAAM,SAAQ,CAAE;AAC7B,eAAO;;AAEX,aAAO;;AAEX,aAAS,cAAcmZ,KAAI;AACvB,aAAOG,WAAU,MAAM,WAAW,QAAQ,WAAW,EAAE,aAAAuJ,cAAa,uBAAuB,0BAA0B,eAAe,gBAAgB,eAAe,eAAe,gBAAgB,gBAAe,GAAK;AAClN,YAAI,sBAAsB,WAAW,GAAG;AACpC,gBAAM,IAAI,SAAS,8BAA6B;;AAEpD,YAAI,CAAC,iBAAiB,kBAAkB,QAAW;AAC/C,gBAAM,IAAI,SAAS,iCAAgC;;AAEvD,cAAM,eAAe;AACrB,cAAM,gBAAgB,MAAM,wBAAwB;UAChD,aAAAA;UACA,cAAc;UACd,SAAS;UACT;UACA;UACA;QACZ,CAAS;AACD,cAAM,qBAAqB,OAAO,MAAMvJ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AACjF,cAAI,eAAe;AACf,mBAAO;;AAEX,cAAI,kBAAkB,QAAW;AAC7B,mBAAO,MAAM,wBAAwB;cACjC,aAAAuJ;cACA,cAAc;cACd,SAAS;cACT;cACA;cACA;YACpB,CAAiB;;AAEL,gBAAM,IAAI,SAAS,iCAAgC;SACtD,GAAC;AACF,cAAM,WAAW,OAAM,GAAI,mBAAmB,cAAc;UACxD,cAAa,GAAI,QAAQ,sBAAsB,qBAAqB;UACpE,eAAe;QAC3B,CAAS;AACD,cAAM,kBAAkB,MAAM,qBAAqB,WAAU,GAAI3J,aAAY,cAAc,kBAAkB,CAAC;AAC9G,eAAO,oBAAoB,iBAAiB;UACxC;UACA;WACD,uBAAuB;MAClC,CAAK;;AAEL,aAAS,qBAAqB,iBAAiB,eAAe;AAC1D,aAAOI,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,cAAM,cAAc;UAChB,MAAM;UACN,MAAM,EAAE,gBAAgB,cAAa;QACjD;AACQ,eAAO,MAAM,gBAAgB,MAAM,WAAW;MACtD,CAAK;;AAEL,aAAS,uBAAuB,YAAY;AACxC,aAAO,WAAW,IAAI,eAAa;AAC/B,YAAIH;AACJ,eAAO;UACH,QAAQ,UAAU;UAClB,OAAOA,MAAK,UAAU,UAAU,QAAQA,QAAO,SAASA,MAAK,CAAA;QACzE;MACA,CAAK;;AAEL,aAAS,iBAAiBI,MAAK;AAC3B,YAAM,YAAW,GAAI,oBAAoB,mBAAmBA,IAAG;AAC/D,UAAI,CAAC3Z,UAAS,OAAO,SAAS,QAAQ,GAAG;AACrC,cAAM,IAAIqZ,UAAS,qCAAoC;;AAE3D,aAAO;;AAEX,aAAS,yCAAyC,aAAa,eAAe;AAC1E,UAAIrZ,UAAS,OAAO,SAAS,WAAW,GAAG;AACvC,eAAO,QAAQ,YAAY,WAAW;iBAEjC,gBAAgB,aAAa;AAClC,eAAO;UACH,gBAAe,GAAIsZ,aAAY,cAAc,aAAa;UAC1D,YAAY,uBAAuB,YAAY,UAAU;UACzD,SAAS,YAAY;UACrB,YAAY,CAAA;QACxB;iBAEa,UAAU,aAAa;AAC5B,eAAO;UACH,gBAAe,GAAIA,aAAY,cAAc,aAAa;UAC1D,YAAY,uBAAuB,CAAC,WAAW,CAAC;UAChD,SAAS,CAAA;UACT,YAAY,CAAA;QACxB;aAES;AACD,cAAM,IAAI,SAAS,kCAAiC;;;AAG5D,UAAM,yBAAyB,CAAC,QAAQnY,UAAS,aAAa;AAC1D,aAAO,CAACf,QAAO,WAAW;AACtB,YAAImZ;AACJ,YAAInZ,QAAO;AACP,uBAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,iBAAOA,MAAK;eAEX;AACD,uBAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,OAAOmZ,MAAK,YAAY,QAAQA,QAAO,SAASA,MAAK,IAAI;AACtH,UAAApY,SAAQ,WAAW,QAAQ,WAAW,SAAS,SAAS,IAAI;;MAExE;IACA;AACA,YAAA,yBAAiC;AACjC,UAAM,gCAAgC,CAACf,QAAO,YAAY,YAAY;AAClE,aAAO,IAAI,QAAQ,CAACe,UAAS,WAAW;AACpC,2BAAmBf,QAAO,YAAY,SAAS,YAAU;AACrD,cAAI,QAAQ;AACR,mBAAO,MAAM;iBAEZ;AACD,YAAAe,SAAO;;QAEvB,CAAS;MACT,CAAK;IACL;AACA,YAAA,gCAAwC;AACxC,aAAS,YAAY,OAAO;AACxB,UAAI,OAAO,UAAU,UAAU;AAC3B,eAAO,CAAC,KAAK;;AAEjB,aAAO;;AAEX,UAAM,gCAAgC,CAAC,4BAA4B;AAC/D,aAAO;QACH,WAAU,GAAImY,aAAY,UAAU,wBAAwB,QAAQ;QACpE,aAAa,wBAAwB;QACrC,cAAa,GAAIA,aAAY,UAAU,wBAAwB,WAAW;QAC1E,UAAS,GAAIA,aAAY,UAAU,wBAAwB,OAAO;QAClE,WAAW,wBAAwB;QACnC,QAAO,GAAIA,aAAY,UAAU,wBAAwB,KAAK;QAC9D,SAAQ,GAAIA,aAAY,UAAU,wBAAwB,MAAM;QAChE,SAAQ,GAAIA,aAAY,UAAU,wBAAwB,MAAM;MACxE;IACA;AACA,YAAA,gCAAwC;AACxC,UAAM,0BAA0B,CAAC,sBAAsB;AACnD,aAAO;QACH,MAAK,GAAIA,aAAY,UAAU,kBAAkB,GAAG;QACpD,eAAc,GAAIA,aAAY,UAAU,kBAAkB,YAAY;QACtE,SAAQ,GAAIA,aAAY,UAAU,kBAAkB,MAAM;QAC1D,cAAc,kBAAkB,aAAa,IAAI,iBAAiB;QAClE,QAAQ,kBAAkB;QAC1B,UAAS,GAAIA,aAAY,UAAU,kBAAkB,OAAO;QAC5D,WAAW,kBAAkB,UAAU,IAAI,aAAW;AAClD,kBAAO,GAAIA,aAAY,UAAU,OAAO;QACpD,CAAS;QACD,WAAW,kBAAkB;MACrC;IACA;AACA,YAAA,0BAAkC;AAClC,UAAM,oBAAoB,CAAC,gBAAgB;AACvC,YAAM,uBAAuB;QACzB,MAAK,GAAIA,aAAY,UAAU,YAAY,GAAG;QAC9C,OAAM,GAAIA,aAAY,UAAU,YAAY,IAAI;MACxD;AACI,UAAI,YAAY,SAAS,QAAW;AAChC,6BAAqB,QAAO,GAAIA,aAAY,UAAU,YAAY,IAAI;;AAE1E,aAAO;IACX;AACA,aAAS,sCAAsC,6BAA6B;AACxE,aAAO;QACH,QAAO,GAAIA,aAAY,UAAU,4BAA4B,KAAK;QAClE,cAAc,4BAA4B;QAC1C,iBAAiB,4BAA4B;MACrD;;AAEA,UAAM,YAAY,CAAC,YAAY;AAC3B,aAAQ,OAAO,YAAY,YACvB,YAAY,QACZ,aAAa,WACb,YAAY,WACZ,QAAQ,mBAAmBtZ,UAAS,UACpC,QAAQ,kBAAkBA,UAAS;IAC3C;AACA,YAAA,YAAoB;AACpB,aAAS,wBAAwB,UAAU;AACvC,aAAO0Z,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAIH;AACJ,YAAI,SAAS,sBAAsB;AAC/B,gBAAM,0BAA0B,oBAAoB,YAAY,SAAS,oBAAoB,GAAG,UAAU,sBAAsB;AAChI,cAAI,4BAA4B,MAAM;AAClC,kBAAM,IAAI,SAAS,8BAA6B;;AAEpD,gBAAM,oBAAoB;AAE1B,gBAAM0J,gBAAc,GAAIG,eAAc,mBAAmB;YACrD,UAAU;YACV,sBAAsB7J,MAAK,SAAS,oBAAoB,QAAQA,QAAO,SAAS,SAASA,IAAG;UAC5G,CAAa;AACD,gBAAM,kBAAkB,MAAM,cAAc;YACxC,aAAA0J;YACA,wBAAuB,GAAI,QAAQ,uBAAuB,iBAAiB;YAC3E,0BAA0B,SAAS;YACnC,eAAe,SAAS;YACxB,gBAAgB,SAAS;YACzB,eAAe,SAAS;YACxB,eAAe,SAAS;YACxB,gBAAgB,SAAS;YACzB,iBAAiB,SAAS;UAC1C,CAAa;AACD,iBAAO;mBAEF,OAAO,SAAS,gBAAgB,UAAU;AAE/C,iBAAO,oBAAoB,CAAC,SAAS,WAAW,GAAG,UAAU,aAAa;mBAErE,MAAM,QAAQ,SAAS,WAAW,GAAG;AAE1C,iBAAO,oBAAoB,SAAS,aAAa,UAAU,aAAa;eAEvE;AAED,iBAAO,CAAA;;MAEnB,CAAK;;AAEL,aAAS,oBAAoB,UAAU,UAAU,UAAU;AACvD,UAAI1J;AACJ,UAAI,aAAa,MAAM;AACnB,eAAO;;AAEX,YAAM,6BAA6B,MAAM,QAAQ,SAAS,wBAAwB,KAC9E,SAAS,yBAAyB,SAAS;AAC/C,YAAM,mBAAmB,OAAO,SAAS,kBAAkB;AAC3D,UAAI,CAAC,8BAA8B,CAAC,kBAAkB;AAClD,eAAO;;AAEX,YAAM,sBAAsBA,MAAK,SAAS,8BAA8B,QAAQA,QAAO,SAASA,MAAK,CAAA,GAChG,IAAI,eAAa,UAAU,YAAW,CAAE,EACxC,OAAO,eAAa,UAAU,SAAS,CAAC;AAC7C,YAAM,mBAAmB,SAAS,OAAO,SAAO;AAC5C,cAAM,uBAAuB,kBAAkB,KAAK,eAAa,IAAI,YAAW,EAAG,SAAS,SAAS,CAAC;AACtG,cAAM,qBAAqB,SAAS,gBAAgB,SAAS,cAAc,GAAG,IAAI;AAClF,eAAO,CAAC,wBAAwB;MACxC,CAAK;AACD,UAAI,iBAAiB,WAAW,GAAG;AAC/B,cAAM,IAAI,SAAS,8BAA8B,QAAQ;;AAE7D,aAAO;;AAEX,aAAS,gBAAgB,sBAAsB,mBAAmB,0BAA0B,eAAe;AACvG,aAAOG,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,eAAO,OAAM,GAAI,mBAAmB,cAAc;UAC9C;UACA,eAAe;UACf;UACA;QACZ,CAAS;MACT,CAAK;;AAEL,aAAS,wBAAwB,iBAAiB;AAC9C,aAAOA,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAI;AACA,gBAAM,cAAc;YAChB,MAAM;UACtB;AACY,gBAAM,uBAAuB,MAAM,gBAAgB,MAAM,WAAW;AACpE,cAAI,CAAC,sBAAsB;AACvB,kBAAM,IAAI,QAAQ,qBAAqB,0CAA0C;;AAErF,iBAAO;iBAEJtZ,QAAO;AACV,gBAAM,IAAI,QAAQ,qBAAqBA,OAAM,OAAO;;MAEhE,CAAK;;AAEL,YAAgC,wBAAA;MAC5B,UAAU4iB,SAAQ,iBAAiB;MACnC,qBAAqB;MACrB,iBAAiB;MACjB,qBAAqB;IACzB;AACA,UAAM,wBAAwB,CAAC,qBAAqB;AAChD,YAAM,YAAY,iBAAiB,IAAI,iBAAe;AAClD,eAAO,EAAE,KAAK,aAAa,eAAe,EAAC;MACnD,CAAK;AACD,aAAO;IACX;AACA,YAAA,wBAAgC;AAChC,UAAM,uBAAuB,CAAC,iBAAiB;AAC3C,aAAO,aAAa,IAAI,cAAY,SAAS,GAAG;IACpD;AACA,YAAA,uBAA+B;AAC/B,aAAS,sBAAsB,OAAO,mBAAmB,sBAAsB;AAC3E,aAAOtJ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAIH;AACJ,YAAI,kBAAkB;AACtB,iBAAS,IAAI,GAAG,IAAI,kBAAkB,OAAO,KAAK;AAC9C,4BAAkB,MAAM,qBAAqB,KAAK;AAClD,cAAI,gBAAgB,WAAWyJ,SAAQ,eAAe,WAAW;AAC7D,mBAAO;qBAEF,gBAAgB,WAAWA,SAAQ,eAAe,UAAU;AACjE,kBAAM,IAAI3J,UAAS,iBAAiBE,MAAK,gBAAgB,kBAAkB,QAAQA,QAAO,SAASA,MAAK,EAAE;;AAE9G,iBAAM,GAAI,QAAQ,OAAO,kBAAkB,QAAQ;;AAEvD,cAAM,IAAI,MAAM,6EAA6E,oBAAoB,QAAQ,oBAAoB,SAAS,SAAS,gBAAgB,MAAM,EAAE;MAC/L,CAAK;;AAEL,aAAS,uCAAuC,OAAO,+BAA+B,4CAA4C;AAC9H,aAAOG,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAIH;AACJ,YAAI;AACJ,iBAAS,IAAI,GAAG,IAAI,8BAA8B,OAAO,KAAK;AAC1D,yCAA+B,MAAM,2CAA2C,KAAK;AACrF,gBAAM,iCAAiC,uBAAuB,2BAA2B,UAAU,4BAA4B;AAC/H,cAAI,+BAA+B,SAAS;AACxC,mBAAO;cACH,QAAQyJ,SAAQ,gBAAgB;cAChC,mBAAmB,+BAA+B;YACtE;qBAEqB,CAAC,+BAA+B,SAAS;AAC9C,kBAAM,IAAI3J,UAAS,iBAAiBE,MAAKyJ,SAAQ,gBAAgB,qBAAqB,QAAQzJ,QAAO,SAASA,MAAK,EAAE;;AAEzH,iBAAM,GAAI,QAAQ,OAAO,8BAA8B,QAAQ;;AAKnE,eAAO;MACf,CAAK;;AAEL,aAAS,wBAAwB,gBAAgB,iBAAiB,mBAAmB,YAAY,mBAAmB,sBAAsB,QAAQ;AAC9I,aAAOG,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAIH,KAAI;AACR,cAAM,qBAAqB;UACvB,QAAQyJ,SAAQ,eAAe;UAC/B,YAAY;UACZ;UACA,OAAOzJ,MAAK,OAAO,OAAO,YAAY,kBAAkB,QAAQA,QAAO,SAAS,SAASA,IAAG;QACxG;AACQ,mBAAW,KAAKyJ,SAAQ,iBAAiB,cAAc,kBAAkB;AACzE,YAAI,oBAAoB,SAAS,sBAAsBA,SAAQ,uBAAuB,MAAM;AACxF,iBAAO;;AAEX,cAAM,yBAAyB,MAAM,sBAAsB,gBAAgB,mBAAmB,oBAAoB;AAClH,2BAAmB,aAAa,uBAAuB;AACvD,2BAAmB,SAAS,uBAAuB;AACnD,2BAAmB,QAAQ,KAAK,OAAO,OAAO,YAAY,kBAAkB,QAAQ,OAAO,SAAS,SAAS,GAAG;AAChH,mBAAW,KAAKA,SAAQ,iBAAiB,eAAe,kBAAkB;AAC1E,YAAI,sBAAsBA,SAAQ,uBAAuB,MAAM;AAC3D,iBAAO;;AAEX,eAAO;MACf,CAAK;;AAEL,aAAS,0BAA0B,oBAAoB,mBAAmB,YAAY,qBAAqB,iBAAiB,0BAA0B,4CAA4C,2CAA2C;AACzO,aAAOtJ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,cAAM,oCAAoC,MAAM,uCAAuC,mBAAmB,gBAAgB,oBAAoB,+BAA+B,0CAA0C;AACvN,2BAAmB,SAAS,kCAAkC;AAC9D,2BAAmB,oBAAoB,kCAAkC;AACzE,2BAAmB,6BAA6B,gBAAgB,OAAO;AACvE,mBAAW,KAAKsJ,SAAQ,iBAAiB,8BAA8B,kBAAkB;AACzF,YAAI,sBAAsBA,SAAQ,uBAAuB,kBAAkB;AACvE,iBAAO;;AAEX,cAAM,8BAA8B,MAAM,0CAA0C,kCAAkC,kBAAkB,OAAO,iBAAiB,wBAAwB;AACxL,YAAI,CAAC,6BAA6B;AAC9B,iBAAO;;AAEX,2BAAmB,SAASA,SAAQ,gBAAgB;AACpD,2BAAmB,mBAAmB;AACtC,2BAAmB,4BAA4B;AAC/C,mBAAW,KAAKA,SAAQ,iBAAiB,6BAA6B,kBAAkB;AACxF,YAAI,sBAAsBA,SAAQ,uBAAuB,iBAAiB;AACtE,iBAAO;;AAEX,eAAO;MACf,CAAK;;AAEL,aAAS,oCAAoC,QAAQ;AACjD,aAAOtJ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,cAAM,kBAAkB,MAAM,iBAAgB,GAAI,QAAQ,sBAAsB,OAAO,OAAO,YAAY,GAAG,OAAO,OAAO,mBAAmB,OAAO,OAAO,0BAA0B,OAAO,OAAO,aAAa;AACjN,cAAM,kBAAkB,OAAM,GAAI,6BAA6B,oBAAoB,iBAAiB,OAAO,OAAO,aAAa;AAC/H,cAAM,gCAAgC,MAAM,wBAAwB,eAAe;AACnF,cAAM,iCAAiC,8BAA8B,SAAS,KAAK;AACnF,eAAO,EAAE,iBAAiB,+BAA8B;MAChE,CAAK;;AAEL,aAAS,8BAA8B,wBAAwB,eAAe,iBAAiB,yBAAyB,8BAA8B,mBAAmB,0BAA0B,eAAe;AAC9M,aAAOA,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,cAAM,6BAA6B,MAAM,iBAAgB,GAAI,QAAQ,sBAAsB,sBAAsB,GAAG,yBAAyB,0BAA0B,aAAa;AACpL,cAAM,wBAAwB,MAAM,gBAAgB,qBAAqB,aAAa;AACtF,cAAM,mBAAkB,GAAIrC,SAAQ,mBAAmB,uBAAuB,iBAAiB;AAC/F,cAAM,yCAAyC,OAAM,GAAIA,SAAQ,yCAAyC,6BAA4B,GAAIiC,aAAY,UAAU,gBAAgB,OAAO,aAAa,GAAG,iBAAiB,4BAA4B;AACpP,cAAM,uCAAuC,uBAAuB,2BAA2B,UAAU,sCAAsC;AAC/I,YAAI,CAAC,qCAAqC,SAAS;AAC/C,iBAAO;;AAEX,eAAO,qCAAqC;MACpD,CAAK;;AAYL,aAAS,iBAAiB,eAAe;AACrC,UAAIC,KAAI;AACR,aAAO;QACH,WAAWA,MAAK,kBAAkB,QAAQ,kBAAkB,SAAS,SAAS,cAAc,cAAc,QAAQA,QAAO,SAASA,MAAK;QACvI,QAAQ,KAAK,kBAAkB,QAAQ,kBAAkB,SAAS,SAAS,cAAc,WAAW,QAAQ,OAAO,SAAS,KAAK;MACzI;;AAEA,aAAS,2BAA2B,eAAe;AAC/C,UAAIA,KAAI;AACR,aAAO;QACH,WAAWA,MAAK,kBAAkB,QAAQ,kBAAkB,SAAS,SAAS,cAAc,cAAc,QAAQA,QAAO,SAASA,MAAK;QACvI,QAAQ,KAAK,kBAAkB,QAAQ,kBAAkB,SAAS,SAAS,cAAc,WAAW,QAAQ,OAAO,SAAS,KAAK;MACzI;;AAEA,aAAS,gBAAgB,QAAQ,QAAQ;AACrC,YAAM,oBAAoB,OAAO,OAAOyJ,SAAQ,gBAAgB,EAAE,OAAO,CAAC,UAAU,OAAO,UAAU,QAAQ;AAE7G,YAAM,eAAe,CAAC,cAAc,CAAC,YAAY,OAAO,KAAK,WAAW,OAAO;AAC/E,iBAAW,aAAa,mBAAmB;AACvC,eAAO,GAAG,WAAW,aAAa,SAAS,CAAC;;;AASpD,aAAS,kBAAkB5iB,QAAO,YAAY,gBAAgB,UAAU;AACpE,UAAI;AACA,cAAM,0BAA0B,mBAAmB,cAAc;AACjE,QAAAyZ,QAAO,MAAM,UAAUzZ,MAAK,kBAAkB,UAAU,oBAAoB,uBAAuB,EAAE;AACrG,YAAIA,QAAO;AACP,iBAAO,SAASA,QAAO,IAAI;;AAE/B,YAAI,eAAe,KAAK;AACpB,iBAAO,SAAS,IAAIiZ,UAAS,sBAAsB,eAAe,QAAQ,eAAe,SAAS,aAAa,KAAK,uBAAuB,GAAG,IAAI;;AAEtJ,eAAO,SAAS,MAAM,cAAc;eAEjCjZ,QAAO;AACV,iBAASA,QAAO,IAAI;AACpB,QAAAyZ,QAAO,MAAM,qEAAqEzZ,MAAK,EAAE;;;AASjG,aAAS,mBAAmBA,QAAO,YAAY,gBAAgB,UAAU;AACrE,UAAImZ;AACJ,YAAM,0BAA0B,mBAAmB,cAAc;AACjE,MAAAM,QAAO,MAAM,UAAUzZ,MAAK,kBAAkB,UAAU,oBAAoB,uBAAuB,EAAE;AACrG,UAAI;AACA,YAAIA,QAAO;AACP,UAAAyZ,QAAO,MAAM,qBAAqBzZ,MAAK,EAAE;AACzC,mBAASA,QAAO,IAAI;mBAEf,CAAC,cAAc,EAAE,GAAG,aAAa,wBAAwB,UAAU,GAAG;AAC3E,cAAI2X,gBAAe,6CAA6C,UAAU;AAC1E,gBAAM,6BAA6B,CAAC,CAAC,kBAAkB,OAAO,mBAAmB,YAAY,WAAW,kBACjGwB,MAAK,eAAe,WAAW,QAAQA,QAAO,SAAS,SAASA,IAAG,SAAQ,IAC5E;AACN,cAAI,yBAAyB;AACzB,YAAAxB,iBAAgB,aAAa,uBAAuB;;AAExD,UAAA8B,QAAO,MAAM9B,aAAY;AACzB,mBAAS,IAAIsB,UAAS,sBAAsB,eAAe,QAAQ,eAAe,SAAS,aAAa,KAAK,8BAA8B,uBAAuB,GAAG,cAAc;eAElL;AACD,UAAAQ,QAAO,KAAK,iDAAiD,uBAAuB,EAAE;AACtF,mBAAS,MAAM,cAAc;;eAG9BzZ,QAAO;AACV,QAAAyZ,QAAO,MAAM,iEAAiEzZ,MAAK,EAAE;;;AAG7F,aAAS,wBAAwBmZ,KAAI;AACjC,aAAOG,WAAU,MAAM,WAAW,QAAQ,WAAW,EAAE,cAAc,SAAS,iBAAiB,CAAA,GAAI,aAAAuJ,cAAa,gBAAgB,gBAAe,GAAK;AAChJ,YAAI;AACJ,cAAM,uBAAuB,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,QAAQ,qBAAqB,GAAG,cAAc;AAC3G,cAAMvV,UAAS;UACX;UACA,aAAAuV;UACA,mBAAmB,iBAAgB;UACnC,+BAA+B,iBAAgB;UAC/C,8BAA8B,iBAAgB;UAC9C,yBAAyB,2BAA0B;UACnD,kBAAkB,qBAAqB;UACvC,qBAAqB,qBAAqB;UAC1C,iBAAiB,qBAAqB;UACtC,qBAAqB,qBAAqB;UAC1C,mBAAmB3L,aAAY,qBAAqB;UACpD;UACA;QACZ;AACQ,cAAM,EAAE,OAAAlX,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,aAAa,OAAO,IAAItV,SAAQ,QAAW,QAAQ,KAAKA,QAAO,oBAAoB,QAAQ,OAAO,SAAS,KAAKA,QAAO,eAAe;AACtQ,cAAM,iBAAgB,GAAI,WAAW,UAAU,OAAO;AACtD,YAAI,CAAC,eAAe;AAChB,gBAAMtN;;AAEV,YAAIA,QAAO;AACP,gBAAM,IAAIiZ,UAAS,0BAA0B,SAASjZ,OAAM,OAAO;mBAE9D,eAAe,KAAK;AACzB,gBAAM,IAAIiZ,UAAS,0BAA0B,SAAS,aAAa;;AAEvE,eAAO;MACf,CAAK;;AAEL,UAAM,QAAQ,CAAC,OAAO,IAAI,QAAQ,CAAA9c,OAAK,WAAWA,IAAG,EAAE,CAAC;AACxD,YAAA,QAAgB;AAChB,aAAS,mBAAmB,gBAAgB;AACxC,UAAI,OAAO,mBAAmB,UAAU;AACpC,eAAO,GAAG,cAAc;iBAEnB,OAAO,mBAAmB,UAAU;AACzC,eAAO,KAAK,UAAU,gBAAgB,CAACR,MAAK,UAAU,OAAO,UAAU,WAAW,GAAG,KAAK,MAAM,KAAK;aAEpG;AACD,eAAO,OAAO,cAAc;;;;;;;;;;ACrrBpC,MAAI2d,aAAalc,kBAAQA,eAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,aAAS,MAAM,OAAO;AAAE,aAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU2D,UAAS;AAAE,QAAAA,SAAQ,KAAK;MAAE,CAAE;IAAE;AAC1G,WAAO,KAAK,MAAM,IAAI,UAAU,SAAUA,UAAS,QAAQ;AACvD,eAAS,UAAU,OAAO;AAAE,YAAI;AAAE,eAAK,UAAU,KAAK,KAAK,CAAC;QAAE,SAAU,GAAG;AAAE,iBAAO,CAAC;QAAE;MAAE;AACzF,eAAS,SAAS,OAAO;AAAE,YAAI;AAAE,eAAK,UAAU,OAAO,EAAE,KAAK,CAAC;QAAE,SAAU,GAAG;AAAE,iBAAO,CAAC;QAAE;MAAE;AAC5F,eAAS,KAAK,QAAQ;AAAE,eAAO,OAAOA,SAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;MAAE;AAC5G,YAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,KAAI,CAAE;IAC5E,CAAK;EACL;AACA,SAAO,eAAepB,SAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC9BA,UAAA,yBAAG;AACXA,UAAA,iBAAG;AACsBA,UAAA,0CAAG;AACRA,UAAA,qCAAG;AACRA,UAAA,gCAAG;AACfA,UAAA,oBAAG;AACKA,UAAA,4BAAG;AACCA,UAAA,gCAAG;AACxC,QAAMC,YAAW9F;AACjB,QAAMmf,YAAWjf;AACjB,QAAMid,WAAUtZ,eAAA;AAChB,QAAM,yBAAyBU;AAC/B,QAAM4kB,gBAAezkB;AACrB,QAAM0a,eAAczZ;AACpB,QAAM,QAAQsC;AACd,QAAM4gB,SAAQ3gB;AACd,QAAMkhB,mBAAkB/f;AACxB,QAAM,UAAUE;AAChB,WAAS,uBAAuB,QAAQ,eAAe;AACnD,WAAOiW,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,UAAI;AACA,cAAM,cAAc,MAAM,OAAO,MAAM;UACnC,MAAM;UACN,MAAM,EAAE,MAAM,cAAa;QAC3C,CAAa;AACD,eAAO;eAEJtZ,QAAO;AACV,cAAM,IAAI,QAAQ,qBAAqBA,OAAM,OAAO;;IAEhE,CAAK;;AAEL,WAAS,eAAe,QAAQ1E,OAAM;AAClC,WAAOge,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,UAAI;AACA,cAAM,cAAc,MAAM,OAAO,MAAM;UACnC,MAAM;UACN,MAAM,EAAE,MAAAhe,MAAI;QAC5B,CAAa;AACD,eAAO;eAEJ0E,QAAO;AACV,cAAM,IAAI,QAAQ,qBAAqBA,OAAM,OAAO;;IAEhE,CAAK;;AAEL,WAAS,wCAAwC,QAAQ,eAAe,UAAU,8BAA8B;AAC5G,WAAOsZ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,UAAI,+BAA+B;AACnC,eAAS,IAAI,GAAG,IAAI,6BAA6B,OAAO,KAAK;AACzD,uCAA+B,MAAM,mCAAmC,QAAQ,eAAe,QAAQ;AACvG,YAAI,8BAA8B;AAC9B,gBAAM,iCAAiC,uBAAuB,2BAA2B,UAAU,4BAA4B;AAC/H,cAAI,+BAA+B,SAAS;AACxC,mBAAO,+BAA+B;qBAEjC,CAAC,+BAA+B,SAAS;AAC9C,kBAAM,IAAIL,UAAS,gBAAgB,sCAAsC;;;AAGjF,eAAM,GAAIhC,SAAQ,OAAO,6BAA6B,QAAQ;;AAElE,aAAO;IACf,CAAK;;AAEL,WAAS,mCAAmC,QAAQ,eAAe,UAAU;AACzE,WAAOqC,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,UAAI;AACA,cAAM,yBAAyB,MAAM,OAAO,MAAM;UAC9C,MAAM;UACN,MAAM,EAAE,gBAAgB,eAAe,WAAW,SAAQ;QAC1E,CAAa;AACD,YAAI,CAAC;AACD,iBAAO;AACX,eAAO,8BAA8B,sBAAsB;eAExDtZ,QAAO;AACV,cAAM,IAAI,QAAQ,qBAAqBA,OAAM,OAAO;;IAEhE,CAAK;;AAEL,WAAS,8BAA8B,YAAY;AAC/C,UAAM,EAAE,QAAQ,SAAS,YAAW,IAAK;AACzC,WAAO;MACH,OAAO;MACP,QAAQ;MACR,WAAW;IACnB;;AAEA,WAAS,kBAAkB,gBAAgB,mBAAmB;AAC1D,UAAM,oBAAoB,eAAe;AACzC,QAAI,CAAC,mBAAmB;AACpB,YAAM,IAAI,MAAM,mDAAmD;;AAEvE,UAAM,wBAAuB,GAAIkjB,iBAAgB,aAAa,iBAAiB;AAC/E,YAAO,GAAI,MAAM,SAAS,sBAAsB,iBAAiB;;AAGrE,WAAS,0BAA0B,cAAc,cAAc,WAAW,kBAAkB;AACxF,WAAO5J,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,UAAIH,KAAI,IAAI;AACZ,YAAM,QAAQ,MAAM,aAAa,eAAe,YAAY;AAC5D,YAAM,SAAQ,GAAI+J,iBAAgB,aAAa,KAAK;AAEpD,YAAM,iBAAgB,GAAI,MAAM,SAAS,OAAO,aAAa,OAAO,iBAAiB;AACrF,UAAItjB,UAAS,OAAO,QAAQ,eAAe,SAAS,GAAG;AAGnD,cAAM,IAAI,QAAQ,wBAAwB,WAAW,aAAa;;AAEtE,YAAM,aAAY,GAAI+iB,OAAM,aAAa,KAAK;AAC9C,UAAI,iBAAiB,YAAYxJ,MAAK,UAAU,gBAAgB,QAAQA,QAAO,SAAS,SAASA,IAAG,SAAS;AACzG,cAAM,IAAI,QAAQ,mCAAmC,MAAM,KAAK,UAAU,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,YAAY,QAAQ,OAAO,SAAS,KAAK,GAAG,iBAAiB,MAAM;;AAGrM,YAAM,SAAQ,GAAIwJ,OAAM,iBAAiB,WAAW,aAAa,OAAO,iBAAiB;AACzF,UAAI/iB,UAAS,OAAO,QAAQ,QAAO,GAAIsZ,aAAY,cAAc,YAAY,CAAC,GAAG;AAC7E,cAAM,IAAI,QAAQ,kBAAiB;;AAEvC,iBAAW,UAAU,kBAAkB;AACnC,YAAI,eAAe;AACnB,mBAAW7G,cAAa,UAAU,YAAY;AAE1C,eAAI,GAAI4Q,cAAa,sBAAsB,OAAO,QAAQ5Q,UAAS,GAAG;AAClE,2BAAe;AACf;;;AAGR,YAAI,CAAC;AACD,gBAAM,IAAI,QAAQ,mBAAmB,MAAM;;AAEnD,aAAO,EAAE,YAAY,WAAW,gBAAgB,cAAa;IACrE,CAAK;;AAEL,WAAS,8BAA8B,qBAAqB,gBAAgB,SAAS,eAAe,aAAa,gBAAgB,YAAY,MAAM;AAC/I,QAAI;AACJ,oBAAgB;MACZ,sBAAqB,GAAI6G,aAAY,cAAc,mBAAmB;MACtE,iBAAiB;MACjB,mBAAkB,GAAIgK,iBAAgB,aAAa,OAAO;IAClE;AACI,QAAI,WAAW;AACX,sBAAgB,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,aAAa,GAAG,EAAE,iBAAiB,gBAAgB,QAAQ,gBAAgB,SAAS,SAAS,YAAY,QAAQ,kBAAkB,gBAAgB,QAAQ,gBAAgB,SAAS,SAAS,YAAY,WAAW,gBAAgB,mBAAkB,GAAIA,iBAAgB,aAAa,cAAc,EAAC,CAAE;;AAE5V,WAAO;MACH,YAAY;QACR;UACI,MAAM;UACN,MAAM,OAAO,OAAO,aAAa;;;MAGzC,SAAS;IACjB;;;;;;;;AClKA,MAAI5J,aAAalc,kBAAQA,eAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,aAAS,MAAM,OAAO;AAAE,aAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU2D,UAAS;AAAE,QAAAA,SAAQ,KAAK;MAAE,CAAE;IAAE;AAC1G,WAAO,KAAK,MAAM,IAAI,UAAU,SAAUA,UAAS,QAAQ;AACvD,eAAS,UAAU,OAAO;AAAE,YAAI;AAAE,eAAK,UAAU,KAAK,KAAK,CAAC;QAAE,SAAU,GAAG;AAAE,iBAAO,CAAC;QAAE;MAAE;AACzF,eAAS,SAAS,OAAO;AAAE,YAAI;AAAE,eAAK,UAAU,OAAO,EAAE,KAAK,CAAC;QAAE,SAAU,GAAG;AAAE,iBAAO,CAAC;QAAE;MAAE;AAC5F,eAAS,KAAK,QAAQ;AAAE,eAAO,OAAOA,SAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;MAAE;AAC5G,YAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,KAAI,CAAE;IAC5E,CAAK;EACL;AACA,SAAO,eAAe,4BAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACnC,6BAAA,oBAAG;AACQ,6BAAA,+BAAG;AAChB,6BAAA,kBAAG;AACA,6BAAA,qBAAG;AAC7B,QAAM,qBAAqBjH,wBAAA;AAC3B,QAAMmd,WAAUjd,aAAA;AAChB,QAAMkf,eAAcvb;AACpB,QAAM,UAAUU;AAChB,QAAM,UAAUG,eAAA;AAChB,QAAMokB,WAAUnjB;AAkBhB,WAAS,kBAAkB,mBAAmB,gBAAgB,iBAAiB,oBAAoB,uBAAuB,uBAAuB;AAC7I,WAAO6Z,WAAU,MAAM,WAAW,QAAQ,WAAW,iBAAiB,cAAc,eAAe,kBAAkB,qBAAqB,qBAAqB,gBAAgB,CAAA,GAAI,iCAAiC,OAAO,mBAAmB,mBAAmB;AAC7P,UAAI;AACJ,UAAI,CAAC,mBAAmB;AACpB,mCAA2B,OAAM,GAAI,mBAAmB,cAAc;UAClE,uBAAsB,GAAI,QAAQ,sBAAsB,gBAAgB,OAAO,YAAY;UAC3F,gBAAe,GAAIJ,aAAY,cAAc,mBAAmB;UAChE;UACA,eAAe;UACf,0BAA0B,gBAAgB,OAAO;UACjD,eAAe,gBAAgB,OAAO;QACtD,CAAa;aAEA;AACD,mCAA2B,OAAM,GAAI,mBAAmB,cAAc;UAClE,aAAa;UACb,gBAAe,GAAIA,aAAY,cAAc,mBAAmB;UAChE;UACA,eAAe;UACf,0BAA0B,gBAAgB,OAAO;UACjD,eAAe,gBAAgB,OAAO;QACtD,CAAa;;AAEL,YAAM,UAAU,MAAM,yBAAyB,qBAAqB,YAAY;AAChF,UAAI,CAAC,WAAW,CAAC,QAAQ,MAAM;AAC3B,cAAM,IAAI,QAAQ,2BAA2B,YAAY;;AAE7D,YAAM,YAAY,QAAQ;AAC1B,YAAM,EAAE,YAAY,eAAc,IAAK,CAAC,cAAc,OAAO,SAAS,IAChE,OAAM,GAAIjC,SAAQ,2BAA2B,0BAA0B,cAAc,WAAW,gBAAgB,IAChH,EAAE,YAAY,MAAM,gBAAgB,cAAa;AACvD,YAAM,gBAAgB,OAAM,GAAIA,SAAQ,wBAAwB,kBAAiB,GAAIiC,aAAY,cAAc,mBAAmB,CAAC;AACnI,YAAM,gBAAgB,OAAM,GAAIjC,SAAQ,wBAAwB,kBAAiB,GAAIiC,aAAY,cAAc,mBAAmB,CAAC;AACnI,UAAI,CAAC,kCAAkC,kBAAkB,eAAe;AAEpE,cAAM,uBAAsB,GAAIjC,SAAQ,+BAA+B,qBAAqB,gBAAgB,SAAS,eAAe,QAAW,QAAW,KAAK;AAC/J,eAAO,EAAE,QAAQ,oBAAmB;aAEnC;AAED,cAAM,8BAA8B,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,eAAe,GAAG,EAAE,QAAQ,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,gBAAgB,MAAM,GAAG,EAAE,kBAAkB2L,SAAQ,iBAAiB,eAAc,CAAE,EAAC,CAAE;AACzN,cAAM,kBAAkB,MAAM,mBAAmB,6BAA6B,qBAAqB,aAAa;AAChH,cAAM,oBAAoB,MAAM,6BAA6B,0BAA0B,iBAAiB,QAAW,OAAO;AAC1H,YAAI,CAAC,mBAAmB;AACpB,gBAAM,IAAI,QAAQ,wBAAuB;;AAE7C,cAAM,iBAAiB,MAAM,gBAAgB,qBAAqB,kBAAkB,KAAK;AACzF,cAAM,uBAAsB,GAAI3L,SAAQ,+BAA+B,qBAAqB,gBAAgB,SAAS,eAAe,mBAAmB,cAAc;AACrK,eAAO,EAAE,QAAQ,qBAAqB,WAAU;;IAE5D,CAAK;;AAaL,WAAS,6BAA6B,cAAc,iBAAiBkM,QAAO,SAAS;AACjF,WAAO7J,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,UAAI,CAAC6J,UAAS,CAAC,SAAS;AACpB,cAAM,MAAM,4BAA4B;;AAE5C,YAAM,oBAAoB,YAAY,QAAQ,YAAY,SAAS,UAAWA,WAAU,MAAM,aAAa,qBAAqBA,MAAK;AACrI,UAAI,CAAC,mBAAmB;AACpB,cAAM,MAAM,8BAA8B;;AAG9C,YAAM,YAAW,GAAIlM,SAAQ,mBAAmB,mBAAmB,aAAa,OAAO,iBAAiB;AACxG,YAAM,gBAAgB,aAAa,OAAO;AAC1C,YAAM,sBAAsB,OAAM,GAAIA,SAAQ,yCAAyC,kBAAiB,GAAIiC,aAAY,UAAU,aAAa,GAAG,UAAU,aAAa,OAAO,6BAA6B;AAC7M,aAAO;IACf,CAAK;;AAWL,WAAS,gBAAgB,cAAc,iBAAiBiK,QAAO,SAAS;AACpE,WAAO7J,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,aAAO,CAAC,EAAE,MAAM,6BAA6B,cAAc,iBAAiB6J,QAAO,OAAO;IAClG,CAAK;;AAUL,WAAS,mBAAmB,QAAQ,mBAAmB,SAAS;AAC5D,WAAO7J,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,UAAI,CAAC,qBAAqB,CAAC,SAAS;AAChC,cAAM,MAAM,8CAA8C;;AAE9D,YAAM,gBAAgB,YAAY,QAAQ,YAAY,SAAS,UAAW,sBAAsB,OAAM,GAAIrC,SAAQ,wBAAwB,SAAQ,GAAIiC,aAAY,cAAc,iBAAiB,CAAC;AAClM,UAAI,CAAC,eAAe;AAChB,cAAM,MAAM,2BAA2B;;AAE3C,YAAM,oBAAoB,OAAM,GAAIjC,SAAQ,gBAAgB,QAAQ,aAAa;AACjF,UAAI,CAAC,qBAAqB,CAAC,kBAAkB,iBAAiB;AAC1D,cAAM,MAAM,iCAAiC;;AAEjD,YAAMmM,mBAAkB,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,OAAO,MAAM,GAAG,EAAE,uBAAsB,GAAI,QAAQ,sBAAsB,OAAO,OAAO,YAAY,GAAG,gBAAe,GAAIlK,aAAY,UAAU,kBAAkB,eAAe,EAAC,CAAE;AAC5O,YAAM,mCAAmC,OAAM,GAAI,mBAAmB,cAAckK,gBAAe;AACnG,aAAO;IACf,CAAK;;;;;;AC1IL,OAAO,eAAe,mBAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACpC,kBAAA,mBAAG;AAC3B,IAAM,WAAWtpB;AACjB,IAAM,mBAAN,MAAuB;EACnB,cAAc;AACV,SAAK,WAAW,IAAI,SAAS,aAAY;EACjD;EACI,GAAG,WAAW,IAAI;AAEd,SAAK,SAAS,GAAG,WAAW,EAAE;EACtC;EACI,KAAK,WAAW,IAAI;AAEhB,SAAK,SAAS,KAAK,WAAW,EAAE;EACxC;EACI,IAAI,WAAW,IAAI;AAEf,SAAK,SAAS,IAAI,WAAW,EAAE;EACvC;EACI,KAAK,WAAW,QAAQ;AACpB,SAAK,SAAS,KAAK,WAAW,MAAM;EAC5C;EACI,cAAc,WAAW;AACrB,WAAO,KAAK,SAAS,cAAc,SAAS;EACpD;EACI,UAAU,WAAW;AACjB,WAAO,KAAK,SAAS,UAAU,SAAS;EAChD;EACI,aAAa;AACT,WAAO,KAAK,SAAS,WAAU;EACvC;EACI,qBAAqB;AACjB,SAAK,SAAS,mBAAkB;EACxC;EACI,+BAA+B,8BAA8B;AACzD,SAAK,SAAS,gBAAgB,4BAA4B;EAClE;EACI,kBAAkB;AACd,WAAO,KAAK,SAAS,gBAAe;EAC5C;AACA;AACwB,kBAAA,mBAAG;ACzC3B,IAAIwf,cAAalc,kBAAQA,eAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,WAAS,MAAM,OAAO;AAAE,WAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU2D,UAAS;AAAE,MAAAA,SAAQ,KAAK;IAAE,CAAE;EAAE;AAC1G,SAAO,KAAK,MAAM,IAAI,UAAU,SAAUA,UAAS,QAAQ;AACvD,aAAS,UAAU,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,KAAK,KAAK,CAAC;MAAE,SAAU,GAAG;AAAE,eAAO,CAAC;MAAE;IAAE;AACzF,aAAS,SAAS,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,OAAO,EAAE,KAAK,CAAC;MAAE,SAAU,GAAG;AAAE,eAAO,CAAC;MAAE;IAAE;AAC5F,aAAS,KAAK,QAAQ;AAAE,aAAO,OAAOA,SAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;IAAE;AAC5G,UAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,KAAI,CAAE;EAC5E,CAAK;AACL;AACA,IAAI;AACJ,OAAO,eAAe,aAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACtC,YAAA,iBAAG;AACzB,IAAM,sBAAsBjH;AAC5B,IAAM,iBAAN,cAA6B,oBAAoB,iBAAiB;EAC9D,YAAY,UAAU;AAClB,UAAK;AAGL,SAAK,EAAE,IAAI;AACX,SAAK,WAAW,IAAI,QAAQ,QAAQ;EAC5C;EACI,KAAK,aAAa,YAAY;AAC1B,WAAOwf,YAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,aAAO,KAAK,SAAS,KAAK,aAAa,UAAU;IAC7D,CAAS;EACT;EACI,MAAM,YAAY;AACd,WAAOA,YAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,aAAO,KAAK,SAAS,MAAM,UAAU;IACjD,CAAS;EACT;EACI,QAAQ,WAAW;AACf,WAAOA,YAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,aAAO,KAAK,SAAS,QAAQ,SAAS;IAClD,CAAS;EACT;EACI,GAAG,WAAW,IAAI;AACd,UAAM,GAAG,WAAW,EAAE;AACtB,WAAO;EACf;EACI,KAAK,WAAW,IAAI;AAChB,UAAM,KAAK,WAAW,EAAE;AACxB,WAAO;EACf;AACA;AACsB,YAAA,iBAAG;AACzB,KAAK,OAAO;;;AC9DZ,SAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,UAAiC,yBAAA,QAAA,wBAAgC;AACjE,QAAMV,SAAQ9e;AACd,QAAM,sBAAsB;AAC5B,UAAA,wBAAgC8e,OAAM,EAAE,MAAM;IAC1CA,OAAM,EAAE,OAAM,EAAG,OAAO,SAAO,oBAAoB,KAAK,GAAG,GAAG,mBAAmB;IACjFA,OAAM,EAAE,OAAM;EAClB,CAAC;AACD,QAAM,yBAAyB,CAACyK,kBAAiB,YAAY;AACzD,UAAM,MAAM,QAAQ,sBAAsB,UAAUA,gBAAe;AACnE,UAAM,EAAE,QAAO,IAAK;AACpB,UAAM,WAAW,WAAW;AAC5B,UAAM,EAAE,eAAe,MAAK,IAAK,WAAW,CAAA;AAC5C,QAAI,CAAC,UAAU;AACX,aAAO,EAAE,QAAO;;AAEpB,UAAM,EAAE,OAAArjB,OAAK,IAAK;AAClB,UAAM,qBAAqBA,WAAU,QAAQA,WAAU,SAAS,SAASA,OAAM,OAAO,KAAK,CAAC,EAAE,MAAA7E,MAAI,MAAOA,UAAS,eAAe;AACjI,UAAM,wBAAwB6E,WAAU,QAAQA,WAAU,SAAS,SAASA,OAAM,OAAO,KAAK,CAAC,EAAE,SAAAsjB,SAAO,MAAOA,aAAY,mBAAmB;AAC9I,UAAM,WAAW,MAAM;AACnB,UAAI,oBAAoB;AACpB,eAAO,2EAA2E,OAAOD,gBAAe;;AAE5G,UAAI,uBAAuB;AACvB,eAAO;;AAEX,aAAOrjB,WAAU,QAAQA,WAAU,SAAS,SAASA,OAAM,OAAO,IAAI,WAAS,MAAM,OAAO,EAAE,KAAK,IAAI;IAC/G,GAAK;AACD,QAAI,cAAc;AACd,YAAM,IAAI,MAAM,OAAO;;AAE3B,WAAO;MACH;MACA,OAAAA;MACA,SAASA,WAAU,QAAQA,WAAU,SAAS,SAASA,OAAM,OAAO,IAAI,WAAS,MAAM,OAAO,EAAE,KAAK,IAAI;IACjH;EACA;AACA,UAAA,yBAAiC;;;;ACrCjC,SAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,UAAgC,wBAAA,QAAA,+BAAuC;AACvE,QAAM4Y,SAAQ9e;AACd,QAAM8oB,WAAU5oB;AAChB,QAAMif,YAAWtb;AACjB,QAAM,mBAAmBib,OAAM,EAAE,MAAM;IACnCA,OAAM,EAAE,OAAO;MACX,eAAeA,OAAM,EAAE,UAAS;MAChC,eAAeA,OAAM,EAAE,OAAM;IACrC,CAAK;IACDA,OAAM,EAAE,OAAO;MACX,eAAeA,OAAM,EAAE,OAAM;MAC7B,eAAeA,OAAM,EAAE,UAAS;IACxC,CAAK;EACL,CAAC;AACD,QAAM,gBAAgBA,OAAM,EAAE,MAAM;IAChCA,OAAM,EAAE,OAAO;MACX,aAAaA,OAAM,EAAE,MAAM,CAACA,OAAM,EAAE,OAAM,GAAIA,OAAM,EAAE,MAAMA,OAAM,EAAE,OAAM,CAAE,CAAC,CAAC;MAC9E,sBAAsBA,OAAM,EAAE,UAAS;IAC/C,CAAK;IACDA,OAAM,EAAE,OAAO;MACX,aAAaA,OAAM,EAAE,UAAS;MAC9B,sBAAsBA,OAAM,EAAE,MAAM,CAACA,OAAM,EAAE,OAAM,GAAIA,OAAM,EAAE,MAAMA,OAAM,EAAE,OAAM,CAAE,CAAC,CAAC;IAC/F,CAAK;EACL,CAAC;AACD,QAAM,4BAA4BA,OAAM,EAAE,OAAO;IAC7C,uBAAuBA,OAAM,EAAE,OAAM,EAAG,SAAQ;IAChD,oBAAoBA,OAAM,EAAE,OAAM,EAAG,SAAQ;IAC7C,gBAAgBA,OAAM,EACjB,OAAO;MACR,UAAUA,OAAM,EAAE,WAAWgK,SAAQ,gBAAgB,EAAE,SAAQ;MAC/D,qBAAqBhK,OAAM,EAAE,OAAM,EAAG,SAAQ;MAC9C,iBAAiBA,OAAM,EAAE,OAAM,EAAG,SAAQ;MAC1C,qBAAqBA,OAAM,EAAE,OAAM,EAAG,SAAQ;IACtD,CAAK,EACI,SAAQ;EACjB,CAAC;AACD,QAAM,+BAA+B,CAACwK,kBAAiB,YAAY;AAC/D,UAAM,EAAE,eAAe,MAAK,IAAK,WAAW,CAAA;AAC5C,UAAM,8BAA8B,iBAAiB,UAAUA,gBAAe;AAC9E,QAAI,WAAW,6BAA6B;AACxC,YAAM,mCAAmC,IAAInK,UAAS,iCAAgC;AACtF,UAAI,cAAc;AACd,cAAM;;AAEV,aAAO;QACH,SAAS,4BAA4B;QACrC,OAAO,4BAA4B;QACnC,SAAS,iCAAiC;MACtD;;AAEI,WAAO,EAAE,SAAS,KAAI;EAC1B;AACA,UAAA,+BAAuC;AACvC,QAAM,kBAAkB,CAACmK,kBAAiB,YAAY;AAClD,UAAM,EAAE,eAAe,MAAK,IAAK,WAAW,CAAA;AAC5C,UAAM,2BAA2B,cAAc,UAAUA,gBAAe;AACxE,QAAI,WAAW,0BAA0B;AACrC,YAAM,sBAAsB,IAAInK,UAAS,oBAAmB;AAC5D,UAAI,cAAc;AACd,cAAM;;AAEV,aAAO;QACH,SAAS,yBAAyB;QAClC,OAAO,yBAAyB;QAChC,SAAS,oBAAoB;MACzC;;AAEI,WAAO,EAAE,SAAS,KAAI;EAC1B;AACA,QAAM,8BAA8B,CAACmK,kBAAiB,YAAY;AAC9D,UAAM,EAAE,eAAe,MAAK,IAAK,WAAW,CAAA;AAC5C,UAAM,uCAAuC,0BAA0B,UAAUA,gBAAe;AAChG,QAAI,WAAW,sCAAsC;AACjD,YAAM,EAAE,OAAO,EAAE,OAAM,IAAK,CAAA,EAAE,IAAK;AACnC,YAAMzL,gBAAe,WAAW,QAAQ,WAAW,SAAS,SAAS,OAAO,IAAI,CAAC,EAAE,SAAS,MAAAja,MAAI,MAAO,GAAGA,MAAK,CAAC,CAAC,KAAK,OAAO,EAAE,EAAE,KAAK,IAAI;AAC1I,UAAI,cAAc;AACd,cAAM,IAAI,MAAMia,aAAY;;AAEhC,aAAO;QACH,SAAS,qCAAqC;QAC9C,OAAO,qCAAqC;QAC5C,SAASA;MACrB;;AAEI,WAAO,EAAE,SAAS,KAAI;EAC1B;AACA,QAAM,wBAAwB,CAACyL,kBAAiB,YAAY;AACxD,UAAM,+BAA8B,GAAI,QAAQ,8BAA8BA,kBAAiB,OAAO;AACtG,QAAI,WAAW,6BAA6B;AACxC,aAAO;;AAEX,UAAM,2BAA2B,gBAAgBA,kBAAiB,OAAO;AACzE,QAAI,WAAW,0BAA0B;AACrC,aAAO;;AAEX,UAAM,uCAAuC,4BAA4BA,kBAAiB,OAAO;AACjG,QAAI,WAAW,sCAAsC;AACjD,aAAO;;AAEX,WAAO,EAAE,SAAS,KAAI;EAC1B;AACA,UAAA,wBAAgC;;;;ACtGhC,SAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,UAA4B,oBAAA,QAAA,mBAA2B;AACvD,QAAMxK,SAAQ9e;AACd,QAAM,iBAAiBE;AACvB,QAAM,gBAAgB4e,OAAM,EAAE,OAAO;IACjC,SAAS,eAAe;IACxB,QAAQ,eAAe;EAC3B,CAAC;AACD,QAAM,0BAA0BA,OAAM,EAAE,OAAO;IAC3C,QAAQ,eAAe;IACvB,MAAMA,OAAM,EAAE,SAAQ,EAAG,KAAK,eAAe,YAAY,EAAE,QAAQA,OAAM,EAAE,QAAQ,eAAe,YAAY,CAAC;EACnH,CAAC;AACD,UAAA,mBAA2BA,OAAM,EAAE,MAAM,CAAC,eAAe,uBAAuB,CAAC;AACjF,QAAM,oBAAoB,CAACrC,aAAY,YAAY;AAC/C,UAAM,0BAA0B,QAAQ,iBAAiB,UAAUA,WAAU;AAC7E,UAAM,EAAE,eAAe,MAAK,IAAK,WAAW,CAAA;AAC5C,UAAM,WAAW,WAAW;AAC5B,QAAI,CAAC,UAAU;AACX,aAAO,EAAE,SAAS,KAAI;;AAE1B,UAAM,UAAU;AAChB,QAAI,cAAc;AACd,YAAM,IAAI,MAAM,OAAO;;AAE3B,WAAO;MACH,SAAS;MACT,OAAO,wBAAwB;MAC/B;IACR;EACA;AACA,UAAA,oBAA4B;;;AC9B5B,OAAO,eAAe,0BAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACpB,yBAAA,mCAAG;AAC3C,IAAM,QAAQzc;AACd,IAAM8oB,YAAU5oB;AAChB,IAAM,aAAa,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW4oB,UAAQ,cAAc,GAAG,MAAM,EAAE,WAAWA,UAAQ,eAAe,CAAC,CAAC;AAC1H,IAAM,iCAAiC,MAAM,EACxC,OAAO;EACR,YAAY,MAAM,EAAE,OAAM,EAAG,SAAQ;EACrC,QAAQ,MAAM,EAAE,OAAO;IACnB,QAAQ;IACR,cAAc,MAAM,EAAE,OAAM,EAAG,SAAQ;EAC/C,CAAK;AACL,CAAC,EACI,UAAU,CAAC,EAAE,YAAY,OAAM,OAAQ;EACxC;EACA,QAAQ,OAAO;EACf,cAAc,OAAO;AACzB,EAAE;AACF,SAAS,iCAAiC,OAAO;AAC7C,QAAM,SAAS,+BAA+B,UAAU,KAAK;AAC7D,MAAI,CAAC,OAAO,SAAS;AACjB,UAAM,IAAI,MAAM,+CAA+C;EACvE;AACI,SAAO,OAAO;AAClB;;;;;ACxBA,MAAIpK,mBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,QAAI,OAAO,OAAW,MAAK;AAC3B,QAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,QAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,aAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,eAAO,EAAE,CAAC;MAAE,EAAE;;AAE7D,WAAO,eAAe,GAAG,IAAI,IAAI;QAC/B,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,QAAI,OAAO,OAAW,MAAK;AAC3B,MAAE,EAAE,IAAI,EAAE,CAAC;;AAEf,MAAIsb,sBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,WAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;EACtE,KAAK,SAAS,GAAG,GAAG;AAChB,MAAE,SAAS,IAAI;EACnB;AACA,MAAIub,gBAAgBvb,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,QAAI,UAAU,SAAS,GAAG;AACtB,gBAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,YAAI,KAAK,CAAA;AACT,iBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,eAAO;MACnB;AACQ,aAAO,QAAQ,CAAC;IACxB;AACI,WAAO,SAAUhd,MAAK;AAClB,UAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,UAAI,SAAS,CAAA;AACb,UAAIA,QAAO;AAAM,iBAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,CAAAoc,iBAAgB,QAAQpc,MAAK,EAAE,CAAC,CAAC;;AAC/H,MAAAsc,oBAAmB,QAAQtc,IAAG;AAC9B,aAAO;IACf;EACA,GAAC;AACD,MAAIkd,aAAalc,kBAAQA,eAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,aAAS,MAAM,OAAO;AAAE,aAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU2D,UAAS;AAAE,QAAAA,SAAQ,KAAK;MAAE,CAAE;IAAE;AAC1G,WAAO,KAAK,MAAM,IAAI,UAAU,SAAUA,UAAS,QAAQ;AACvD,eAAS,UAAU,OAAO;AAAE,YAAI;AAAE,eAAK,UAAU,KAAK,KAAK,CAAC;QAAE,SAAU,GAAG;AAAE,iBAAO,CAAC;QAAE;MAAE;AACzF,eAAS,SAAS,OAAO;AAAE,YAAI;AAAE,eAAK,UAAU,OAAO,EAAE,KAAK,CAAC;QAAE,SAAU,GAAG;AAAE,iBAAO,CAAC;QAAE;MAAE;AAC5F,eAAS,KAAK,QAAQ;AAAE,eAAO,OAAOA,SAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;MAAE;AAC5G,YAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,KAAI,CAAE;IAC5E,CAAK;EACL;AACA,MAAIrB,mBAAmBtC,kBAAQA,eAAK,mBAAoB,SAAUhB,MAAK;AACnE,WAAQA,QAAOA,KAAI,aAAcA,OAAM,EAAE,WAAWA,KAAG;EAC3D;AACA,SAAO,eAAe,kBAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACxC,mBAAA,eAAG;AACvB,QAAM4a,YAAWld,wBAAA;AACjB,QAAMypB,gBAAc7jB,iBAAgB1F,WAA2B;AAC/D,QAAM,+BAA+B2D,kCAAA;AACrC,QAAM8b,UAASd,cAAata,QAAoB;AAChD,QAAM6a,eAAc1a;AACpB,QAAM0kB,mBAAkBzjB;AACxB,QAAM,UAAUkZ,cAAa5W,KAAqB;AAClD,QAAMkV,WAAUjV,eAAA;AAChB,QAAMwhB,iBAAgBrgB;AACtB,QAAM8V,YAAW5V;AACjB,QAAMuf,WAAUtf;AAChB,QAAM,oBAAoBE;AAC1B,QAAM,oBAAoBC;AAC1B,QAAM,eAAeqC;AACrB,QAAM2d,WAAU1d;AAChB,QAAM,yBAAyBC;AAC/B,QAAM,aAAaC;AACnB,QAAM,UAAUC,aAAA;AAChB,QAAM,gCAAgCC,mCAAA;AACtC,QAAM,6BAA6BC;AACnC,WAAS,aAAa,UAAU;AAC5B,WAAOkT,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,OAAA,GAAI,kBAAkB,uBAAuB,UAAU,EAAE,cAAc,KAAI,CAAE;AAC7E,YAAMhM,UAAS,OAAM,GAAI2J,SAAQ,6BAA6B,QAAQ;AACtE,MAAA3J,QAAO,oBAAoB,MAAM,qBAAqB,QAAQ;AAC9D,aAAO;QACH,QAAAA;QACA,MAAM,mBAAmB,MAAM,UAAU;AACrC,iBAAOgM,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,gBAAI,OAAO;AACX,gBAAI,OAAO,sBAAsB,UAAU;AACvC,sBAAQ;AACR,sBAAQ;mBAEP;AACD,sBAAQ,sBAAsB,QAAQ,sBAAsB,SAAS,SAAS,kBAAkB;AAChG,sBAAQ,sBAAsB,QAAQ,sBAAsB,SAAS,SAAS,kBAAkB;;AAEpG,kBAAM,EAAE,OAAAtZ,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,MAAM,aAAatV,QAAO,aAAa,IAAIA,UAAQ,GAAI4V,iBAAgB,cAAa,GAAIhK,aAAY,kBAAkB,OAAO,KAAK,CAAC,CAAC;AAC/P,mBAAO,IAAI,QAAQ,CAACnY,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,oBAAoBjX,QAAO,aAAY,GAAI,WAAW,UAAU,OAAO,IAAG,GAAIiX,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YAC5K,CAAqB;UACrB,CAAiB;;QAEL,gBAAgB,aAAawV,aAAY,UAAU;AAC/C,iBAAO+C,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAAG,QAAO,MAAM,4BAA4B,EAAC,GAAIxC,SAAQ,WAAWV,WAAU,IAAI,mCAAmC,EAAE,YAAW,GAAI2C,aAAY,UAAU3C,YAAW,MAAM,CAAC,EAAE;AAC7K,kBAAMgD,QAAM,GAAItC,SAAQ,0CAA0C,aAAa3J,QAAO,aAAa;AACnG,gBAAI;AACA,oBAAM,WAAW,OAAQ,GAAG2J,SAAQ,WAAWV,WAAU,IACnD,QAAQ,KAAKgD,MAAKhD,YAAW,SAASjJ,QAAO,mBAAmBiJ,YAAW,MAAM,IACjF,QAAQ,KAAKgD,MAAKhD,aAAYjJ,QAAO,iBAAiB;AAC5D,oBAAM,YAAY,GAAG2J,SAAQ,kBAAkB,QAAQ;AACvD,kBAAI,OAAO,aAAa,YAAY;AAChC,yBAAS,MAAM,QAAQ;;AAE3B,qBAAO;qBAEJjX,QAAO;AACV,kBAAI,OAAO,aAAa,YAAY;AAChC,yBAASA,QAAO,IAAI;;AAGxB,oBAAM,IAAI,MAAMA,MAAK;;UAE7C,CAAiB;;QAEL,2BAA2B,aAAa,UAAU,oBAAoB4iB,SAAQ,uBAAuB,MAAM;AACvG,gBAAM,SAAS;AACf,mBAAS,WAAW;AAChB,mBAAO,OAAO,gBAAgB,aAAa,MAAM,UAAU,iBAAiB;;AAEhF,gBAAM,aAAa,IAAIY,eAAc,eAAe,CAACziB,UAAS,WAAWuY,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAClH,gBAAItZ,SAAQ;AAEZ,qBAAS,IAAI,GAAG,IAAIsN,QAAO,wBAAwB,OAAO,KAAK;AAC3D,cAAAmM,QAAO,KAAK,sCAAsC,IAAI,CAAC,OAAOnM,QAAO,wBAAwB,KAAK,EAAE;AACpG,oBAAM,gBAAgB,SAAQ,EACzB,GAAGsV,SAAQ,iBAAiB,8BAA8B,aAAW;AACtE,2BAAW,KAAKA,SAAQ,iBAAiB,8BAA8B,OAAO;cAC1G,CAAyB,EACI,GAAGA,SAAQ,iBAAiB,6BAA6B,aAAW;AACrE,2BAAW,KAAKA,SAAQ,iBAAiB,6BAA6B,OAAO;cACzG,CAAyB,EACI,GAAGA,SAAQ,iBAAiB,cAAc,aAAW;AACtD,2BAAW,KAAKA,SAAQ,iBAAiB,cAAc,OAAO;cAC1F,CAAyB,EACI,GAAGA,SAAQ,iBAAiB,QAAQ,aAAW;AAChD,2BAAW,KAAKA,SAAQ,iBAAiB,QAAQ,OAAO;cACpF,CAAyB,EACI,GAAGA,SAAQ,iBAAiB,eAAe,aAAW;AACvD,2BAAW,KAAKA,SAAQ,iBAAiB,eAAe,OAAO;cAC3F,CAAyB,EACI,MAAM,cAAY;AACnB,gBAAAnJ,QAAO,QAAQ,+CAA+C,IAAI,CAAC,OAAOnM,QAAO,wBAAwB,KAAK,KAAK,QAAQ,EAAE;AAC7H,2BAAW,KAAKsV,SAAQ,iBAAiB,UAAU,QAAQ;AAC3D,gBAAA5iB,SAAQ;cACpC,CAAyB;AACD,oBAAM,aAAa,MAAM;AACzB,kBAAI,YAAY;AACZ,gBAAAe,SAAQ,UAAU;AAClB;;AAEJ,qBAAM,GAAIkW,SAAQ,OAAO3J,QAAO,wBAAwB,QAAQ;;AAEpE,mBAAOtN,MAAK;WACf,CAAC;AACF,iBAAO;;QAEX,gBAAgB,aAAa,kBAAkB,MAAM,UAAU,oBAAoB4iB,SAAQ,uBAAuB,MAAM;AACpH,gBAAM,aAAa,IAAIY,eAAc,eAAe,CAACziB,UAAS,WAAWuY,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAClH,gBAAIH,KAAI;AACR,gBAAI;AACA,oBAAMI,QAAO,GAAGtC,SAAQ,0CAA0C,aAAa3J,QAAO,aAAa;AACnG,kBAAIiM,KAAI,QAAQ,aAAaJ,MAAKI,KAAI,gBAAgB,QAAQJ,QAAO,SAAS,SAASA,IAAG,SAAS;AAC/F,uBAAO,IAAIF,UAAS,sCAAqC,CAAE;;AAE/D,oBAAM,YAAY,GAAGhC,SAAQ,kBAAkBsC,IAAG;AAClD,oBAAM,EAAE,OAAAvZ,QAAO,YAAY,QAAO,IAAK,OAAO,GAAG,8BAA8B,6BAA6B4iB,SAAQ,OAAO,MAAM,MAAMtV,QAAO,aAAa,IAAIA,SAAQ,QAAQ;AAC/K,oBAAM,iBAAiB,QAAQ,gBAAgBiM,MAAKjM,QAAO,iBAAiB;AAC5E,kBAAI;AACA,uBAAO,GAAG2J,SAAQ,+BAA+BjX,QAAO,aAAa,GAAG,WAAW,UAAU,OAAO,CAAC;AACrG,oBAAI,OAAO,aAAa,YAAY;AAChC,2BAAS,MAAM;oBACX,QAAQ4iB,SAAQ,eAAe;oBAC/B;oBACA;oBACA,OAAO,KAAKtV,QAAO,YAAY,kBAAkB,QAAQ,OAAO,SAAS,SAAS,GAAG;kBACzH,CAAiC;;uBAGF,QAAQ;AACX,oBAAI,OAAO,aAAa,YAAY;AAChC,2BAAS,QAAQ,IAAI;;AAEzB,uBAAO,OAAO,MAAM;;AAExB,oBAAM,SAAS;AACf,oBAAM,sBAAsB;gBACxB,mBAAmB,OAAO,OAAO;gBACjC,+BAA+B,OAAO,OAAO;gBAC7C,8BAA8B,OAAO,OAAO;cACxE;AACwB,oBAAM,mBAAmB,MAAM,uBAAuB,MAAM;AAC5D,kBAAI,qBAAqB,OAAO,GAAG2J,SAAQ,yBAAyB,gBAAgB,iBAAiB,mBAAmB,YAAY,oBAAoB,mBAAmB,MAAM,iBAAiB,qBAAqB,gBAAgB,QAAQ,GAAG,gBAAgB;AAClQ,kBAAI,sBAAsB2L,SAAQ,uBAAuB,QACrD,sBAAsBA,SAAQ,uBAAuB,MAAM;AAC3D,gBAAA7hB,SAAQ,kBAAkB;AAC1B;;AAEJ,oBAAM,EAAE,iBAAiB,+BAA8B,IAAK,OAAO,GAAGkW,SAAQ,qCAAqC,MAAM;AACzH,mCAAqB,OAAO,GAAGA,SAAQ,2BAA2B,oBAAoB,mBAAmB,YAAY,qBAAqB,iBAAiB,gCAAgC,MAAM,iBAAiB,2CAA2C,gBAAgB,iBAAiB,QAAQ,GAAG,mBAAiB,iBAAiB,0CAA0C,eAAe,iBAAiB,gCAAgC,QAAQ,CAAC;AAC9b,cAAAlW,SAAQ,kBAAkB;qBAEvBf,QAAO;AACV,2BAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,qBAAOA,MAAK;;WAEnB,CAAC;AACF,iBAAO;;QAEX,6BAA6B,wBAAwBuW,aAAY,kBAAkB,MAAM,UAAU,oBAAoBqM,SAAQ,uBAAuB,MAAM;AACxJ,WAAA,GAAI,aAAa,mBAAmBrM,aAAY,EAAE,cAAc,KAAI,CAAE;AACtE,gBAAM,aAAa,IAAIiN,eAAc,eAAe,CAACziB,UAAS,WAAWuY,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAClH,kBAAM,SAAS;AACf,kBAAM,cAAc,UAAU,yBACxB;cACE,YAAY,CAAC,sBAAsB;cACnC,SAAS,CAAC/C,YAAW,MAAM;gBAE7B;AACN,kBAAM,SAAS,YAAY,WAAW,KAAK,eAAa;AACpD,qBAAO,UAAU,SAAS;YAClD,CAAqB;AACD,kBAAM,qBAAqB,SAAS,cAAc,OAAO,OAAO,WAAW;AAC3E,gBAAI;AACA,oBAAM,WAAW,MAAM,OAAO,gBAAgB,oBAAoBA,WAAU;AAC5E,yBAAW,KAAKqM,SAAQ,iBAAiB,QAAQ,QAAQ;AACzD,oBAAM,4BAA4B,OAAO,gBAAgB,UAAU,iBAAiB,UAAU,iBAAiB;AAC/G,eAAC,GAAG3L,SAAQ,iBAAiB,2BAA2B,UAAU;AAClE,cAAAlW,SAAQ,MAAM,yBAAyB;qBAEpCf,QAAO;AACV,qBAAOA,MAAK;;WAEnB,CAAC;AACF,iBAAO;;QAEX,eAAe,gBAAgB,UAAU;AACrC,iBAAOsZ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,gBAAI;AACA,eAAC,GAAGmK,SAAQ,cAAc,gBAAgB,EAAE,cAAc,KAAI,CAAE;qBAE7DzjB,QAAO;AACV,2BAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,oBAAMA;;AAEV,kBAAM,EAAE,OAAAA,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,MAAMtV,QAAO,aAAa,KAAI,GAAI4L,aAAY,cAAc,cAAc,CAAC,IAAI5L,OAAM;AACrN,kBAAM,eAAc,GAAI,WAAW,eAAe,OAAO;AACzD,mBAAO,IAAI,QAAQ,CAACvM,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,YAAY,eAAe,OAAO,eAAc,GAAIkZ,aAAY,UAAU,YAAY,EAAE,KAAI,GAAI,WAAW,UAAU,OAAO,IAAG,GAAIjC,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YAC3P,CAAqB;UACrB,CAAiB;;QAEL,qBAAqB,gBAAgB,UAAU;AAC3C,iBAAOuY,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,gBAAI;AACA,eAAC,GAAGmK,SAAQ,cAAc,gBAAgB,EAAE,cAAc,KAAI,CAAE;qBAE7DzjB,QAAO;AACV,2BAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,oBAAMA;;AAEV,kBAAM,EAAE,OAAAA,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,MAAMtV,QAAO,aAAa,IAAI,eAAe,SAAS,KAAK,CAAC,WAAWA,OAAM;AAC7M,mBAAO,IAAI,QAAQ,CAACvM,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,aAAY,GAAI,WAAW,UAAU,OAAO,IAAG,GAAIiX,SAAQ,wBAAwB,QAAQ,YAAUlW,UAAQ,GAAI,2BAA2B,kCAAkC;gBAChN;gBACA;cAC5B,CAAyB,CAAC,GAAG,QAAQ,CAAC;YACtC,CAAqB;UACrB,CAAiB;;QAEL,OAAO,aAAa;AAChB,gBAAM,gBAAe,GAAIwiB,cAAY,SAAS,WAAW;AACzD,gBAAM,cAAc;YAChB,MAAM;YACN,MAAM,EAAC,GAAIvM,UAAS,aAAa,EAAE,CAAC;UACxD;AACgB,uBAAa,aAAa,CAAC,GAAG,aAAa,YAAY,WAAW;AAClE,iBAAO;;QAEX,sBAAsB;AAClB,iBAAOsC,WAAU,MAAM,WAAW,QAAQ,WAAW,QAAQ,IAAI,YAAY,UAAU,WAAW,cAAc;AAC5G,kBAAM,uBAAuB,aAAa,gBAAgB,WAAW,QAAO,CAAE,KAAK;AACnF,kBAAM,sBAAsB,YAAY,eAAe,UAAU,QAAO,CAAE,KAAK;AAC/E,kBAAM,mBAAmB,eAAe,WAAW,YAAY,KAAK;AACpE,kBAAM,EAAE,OAAAtZ,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,gBAAgBtV,QAAO,aAAa,UAAU,KAAK,GAAG,oBAAoB,GAAG,mBAAmB,GAAG,gBAAgB,IAAIA,OAAM;AAC7P,kBAAM,iCAAgC,GAAI,WAAW,gCAAgC,OAAO;AAC5F,kBAAM,OAAO,eAAe,OAAO,gCAC7B,8BAA8B,IAAI2J,SAAQ,6BAA6B,IACvE;AACN,mBAAO,IAAI,QAAQ,CAAClW,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,aAAY,GAAI,WAAW,UAAU,IAAI,IAAG,GAAIiX,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YACxK,CAAqB;UACrB,CAAiB;;QAEL,mBAAmB,gBAAgB,UAAU;AACzC,iBAAOuY,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,gBAAI;AACA,eAAC,GAAGmK,SAAQ,cAAc,gBAAgB,EAAE,cAAc,KAAI,CAAE;qBAE7DzjB,QAAO;AACV,2BAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,oBAAMA;;AAEV,kBAAM,EAAE,OAAAA,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,gBAAgBtV,QAAO,aAAa,KAAI,GAAI4L,aAAY,cAAc,cAAc,CAAC,IAAI5L,OAAM;AAC/N,kBAAM,2BAA0B,GAAI,WAAW,2BAA2B,OAAO;AACjF,kBAAM,OAAO,eAAe,OAAO,2BAC7B,GAAI2J,SAAQ,+BAA+B,uBAAuB,IAClE;AACN,mBAAO,IAAI,QAAQ,CAAClW,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,aAAY,GAAI,WAAW,UAAU,IAAI,IAAG,GAAIiX,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YACxK,CAAqB;UACrB,CAAiB;;QAEL,8BAA8B,UAAU,iBAAiB,yBAAyB;AAC9E,iBAAOuY,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,kBAAM,SAAS;AACf,kBAAM,SAAS,EAAE,QAAQsJ,SAAQ,gBAAgB,YAAW;AAC5D,kBAAM,oBAAoB,OAAM,GAAI,QAAQ,yCAAyC,kBAAiB,GAAI1J,aAAY,cAAc,OAAO,OAAO,aAAa,IAAG,GAAIA,aAAY,cAAc,QAAQ,GAAG5L,QAAO,6BAA6B;AAC/O,gBAAI,CAAC,mBAAmB;AACpB,qBAAO;;AAEX,kBAAM,iCAAiC,uBAAuB,2BAA2B,UAAU,iBAAiB;AACpH,gBAAI,CAAC,+BAA+B,SAAS;AACzC,qBAAO;;AAEX,mBAAO,SAASsV,SAAQ,gBAAgB;AACxC,mBAAO,oBAAoB,+BAA+B;AAC1D,kBAAM,4BAA4B,OAAM,GAAI3L,SAAQ,+BAA+B3J,QAAO,cAAc,+BAA+B,KAAK,OAAO,iBAAiB,yBAAyBA,QAAO,8BAA8BA,QAAO,mBAAmBA,QAAO,0BAA0BA,QAAO,aAAa;AACjT,gBAAI,CAAC,2BAA2B;AAC5B,qBAAO;;AAEX,mBAAO,SAASsV,SAAQ,gBAAgB;AACxC,mBAAO,mBAAmB;AAC1B,mBAAO;UAC3B,CAAiB;;QAEL,gCAAgC,gBAAgB,UAAU;AACtD,iBAAOtJ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,gBAAIH;AACJ,gBAAI;AACA,oBAAM,SAAS;AACf,oBAAM,mBAAmB,MAAM,OAAO,qBAAqB,cAAc;AACzE,oBAAM,WAAW;gBACb,QAAQ,iBAAiB;gBACzB,YAAY,iBAAiB;gBAC7B,iBAAiB,GAAGD,aAAY,cAAc,cAAc;gBAC5D,OAAOC,MAAK,OAAO,OAAO,YAAY,kBAAkB,QAAQA,QAAO,SAAS,SAASA,IAAG;cACxH;AACwB,kBAAI,iBAAiB,WAAWyJ,SAAQ,eAAe,SAAS;AAC5D,uBAAO;;AAEX,kBAAI,yBAAyB;AAC7B,kBAAI,iBAAiB,WAAWA,SAAQ,eAAe,WAAW;AAC9D,sBAAM,EAAE,iBAAiB,+BAA8B,IAAK,OAAO,GAAG3L,SAAQ,qCAAqC,MAAM;AACzH,yCAAyB,MAAM,OAAO,2CAA2C,gBAAgB,eAAe;AAChH,oBAAI,2BAA2B2L,SAAQ,gBAAgB,eAAe,CAAC,wBAAwB;AAC3F,yBAAO;;AAEX,oBAAI,2BAA2BA,SAAQ,gBAAgB,iBAAiB;AACpE,2BAAS,SAASA,SAAQ,gBAAgB;AAC1C,2BAAS,aAAa;AACtB,yBAAO;;AAEX,sBAAM,iCAAiC,uBAAuB,2BAA2B,UAAU,sBAAsB;AACzH,oBAAI,CAAC,+BAA+B,SAAS;AACzC,yBAAO;;AAEX,oBAAI,+BAA+B,SAAS;AACxC,2BAAS,SAASA,SAAQ,gBAAgB;AAC1C,2BAAS,aAAa;AACtB,2BAAS,oBAAoB,+BAA+B;AAC5D,2BAAS,6BAA6B,gBAAgB,OAAO;AAC7D,wBAAM,wBAAwB,MAAM,OAAO,0CAA0C,+BAA+B,KAAK,OAAO,iBAAiB,8BAA8B;AAC/K,sBAAI,CAAC,uBAAuB;AACxB,2BAAO;;AAEX,2BAAS,SAASA,SAAQ,gBAAgB;AAC1C,2BAAS,mBAAmB;AAC5B,2BAAS,4BAA4B;AACrC,yBAAO;;;AAGf,qBAAO;qBAEJ5iB,QAAO;AACV,2BAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,oBAAMA;;UAE9B,CAAiB;;QAEL,oBAAoB,UAAU;AAC1B,iBAAOsZ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,kBAAM,EAAE,OAAAtZ,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,gBAAgBtV,QAAO,aAAa,UAAUA,SAAQ,QAAW,IAAI;AACrM,kBAAM,qBAAoB,GAAI,WAAW,qBAAqB,OAAO;AACrE,mBAAO,IAAI,QAAQ,CAACvM,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,YAAY,eAAe,MAAM,sBAAsB,QAAQ,sBAAsB,SAAS,SAAS,kBAAkB,qBAAoB,GAAI,WAAW,UAAU,OAAO,IAAG,GAAIiX,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YAC5S,CAAqB;UACrB,CAAiB;;QAEL,aAAa,mBAAmB;AAC5B,iBAAOuY,WAAU,MAAM,WAAW,QAAQ,WAAW+J,kBAAiB,MAAM,OAAO,UAAU;AACzF,aAAA,GAAI,kBAAkB,wBAAwBA,kBAAiB,EAAE,cAAc,KAAI,CAAE;AACrF,kBAAM,cAAc,OAAOA,qBAAoB,WAAWA,mBAAkB,UAAUA,gBAAe;AACrG,kBAAM,EAAE,OAAArjB,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,UAAUtV,QAAO,aAAa,IAAI,WAAW,QAAQ,GAAG,IAAIA,OAAM;AAClM,kBAAM,qBAAoB,GAAI,WAAW,qBAAqB,OAAO;AACrE,mBAAO,IAAI,QAAQ,CAACvM,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,YAAY,eAAe,OAAO,sBAAsB,QAAQ,qBAChG,GAAIiX,SAAQ,yBAAyB,iBAAiB,KACtD,GAAI,WAAW,UAAU,OAAO,IAAG,GAAIA,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YAC/H,CAAqB;UACrB,CAAiB;;QAEL,iBAAiB;AACb,iBAAOuY,WAAU,MAAM,WAAW,QAAQ,WAAW,MAAM,OAAO,UAAU;AACxE,kBAAM,+BAA+B,MAAM,QAAQ,GAAG,KAAK;AAC3D,kBAAM,EAAE,OAAAtZ,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,UAAUtV,QAAO,aAAa,WAAW,4BAA4B,IAAIA,SAAQ,QAAW,IAAI;AAChO,kBAAM,qBAAqB;AAC3B,kBAAM,0BAAyB,GAAI,WAAW,0BAA0B,OAAO;AAC/E,mBAAO,IAAI,QAAQ,CAACvM,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,YAAY,eAAe,OAAO,2BAA2B,QAAQ,0BACrG,GAAIiX,SAAQ,yBAAyB,uBAAuB,kBAAkB,CAAC,KAC/E,GAAI,WAAW,UAAU,OAAO,IAAG,GAAIA,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YAC/H,CAAqB;UACrB,CAAiB;;QAEL,YAAY;AACR,iBAAOuY,WAAU,MAAM,WAAW,QAAQ,WAAW,EAAE,OAAO,YAAY,WAAW,cAAc,aAAa,cAAc,KAAK,SAAQ,IAAM,CAAA,GAAI;AACjJ,kBAAM,eAAe;cACjB;cACA;cACA,eAAe;cACf,cAAc;cACd,iBAAiB;cACjB,gBAAgB;cAChB,iBAAiB;YACzC;AACoB,kBAAM,eAAe,IAAI,gBAAe;AACxC,uBAAW,CAAC3d,MAAK,KAAK,KAAK,OAAO,QAAQ,YAAY,GAAG;AACrD,kBAAI,UAAU,QAAW;AACrB,6BAAa,OAAOA,MAAK,MAAM,SAAQ,CAAE;;;AAGjD,kBAAM,EAAE,OAAAqE,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,UAAUtV,QAAO,aAAa,IAAI,YAAY,IAAIA,OAAM;AACxL,kBAAM,0BAAyB,GAAI,WAAW,0BAA0B,OAAO;AAC/E,mBAAO,IAAI,QAAQ,CAACvM,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,YAAY,eAAe,OAAO,yBAClE,uBAAuB,IAAIiX,SAAQ,uBAAuB,KAC1D,GAAI,WAAW,UAAU,OAAO,IAAG,GAAIA,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YAC/H,CAAqB;UACrB,CAAiB;;QAEL,uBAAuB;AACnB,iBAAOuM,QAAO,aAAa,IAAI,CAAC,aAAa,SAAS,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;QA2B7D,qBAAqB6V,QAAO,UAAU;AAClC,iBAAO7J,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,gBAAI;AACA,eAAC,GAAGmK,SAAQ,cAAcN,QAAO,EAAE,cAAc,KAAI,CAAE;qBAEpDnjB,QAAO;AACV,2BAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,oBAAMA;;AAEV,kBAAM,EAAE,OAAAA,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,MAAMtV,QAAO,aAAa,KAAI,GAAI4L,aAAY,cAAciK,MAAK,CAAC,sBAAsB7V,OAAM;AAC9N,kBAAM,oBAAoB;cACtB,iBAAiB;cACjB,SAAS;YACjC;AACoB,gBAAI,eAAe,KAAK;AACpB,kBAAI;AACA,sBAAM,gCAAgC,GAAG,WAAW,gCAAgC,OAAO;AAC3F,oBAAI,CAAC,8BAA8B;AAC/B,wBAAMtN;;AAEV,sBAAM,gBAAgB,GAAGkjB,iBAAgB,cAAc,GAAGhK,aAAY,UAAU,6BAA6B,KAAK,CAAC;AACnH,kCAAkB,UAAU,aAAa;AACzC,kCAAkB,OAAO,aAAa;AACtC,kCAAkB,cAAc,aAAa;AAC7C,kCAAkB,UAAU,aAAa;AACzC,kCAAkB,kBAAkB,aAAa;uBAE9C,aAAa;AAChB,oBAAI,UAAU;AACV,2BAAS,aAAa,IAAI;;AAE9B,sBAAM;;;AAGd,mBAAO,IAAI,QAAQ,CAACnY,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,YAAY,eAAe,MAAM,qBAAoB,GAAI,WAAW,UAAU,OAAO,IAAG,GAAIiX,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YACpN,CAAqB;UACrB,CAAiB;;QAEL,2CAA2C,gBAAgB,iBAAiB,UAAU;AAClF,iBAAOuY,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,gBAAI;AACA,eAAC,GAAGmK,SAAQ,cAAc,gBAAgB,EAAE,cAAc,KAAI,CAAE;qBAE7DzjB,QAAO;AACV,2BAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,oBAAMA;;AAEV,kBAAM,SAAS;AACf,gBAAI;AACA,kBAAI;AACJ,kBAAI;AACA,oCAAoB,MAAM,OAAO,qBAAqB,cAAc;uBAEjEA,QAAO;AACV,6BAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,uBAAO4iB,SAAQ,gBAAgB;;AAEnC,oBAAMc,wBAAuB,OAAO,GAAG,6BAA6B,8BAA8B,QAAQ,iBAAiB,gBAAgB,iBAAiB;AAC5J,kBAAI,CAACA;AACD,uBAAOd,SAAQ,gBAAgB;AACnC,qBAAOc;qBAEJ1jB,QAAO;AACV,2BAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,qBAAO4iB,SAAQ,gBAAgB;;UAEvD,CAAiB;;QAEL,0CAA0C,eAAe,iBAAiB,yBAAyB,UAAU;AACzG,iBAAOtJ,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,gBAAI;AACA,eAAC,GAAGmK,SAAQ,cAAc,eAAe,EAAE,cAAc,KAAI,CAAE;qBAE5DzjB,QAAO;AACV,2BAAa,QAAQ,aAAa,SAAS,SAAS,SAASA,QAAO,IAAI;AACxE,oBAAMA;;AAEV,kBAAM,wCAAwC,OAAM,GAAIiX,SAAQ,+BAA+B3J,QAAO,cAAc,eAAe,iBAAiB,yBAAyBA,QAAO,8BAA8BA,QAAO,mBAAmBA,QAAO,0BAA0BA,QAAO,aAAa;AACjS,mBAAO;UAC3B,CAAiB;;QAEL,uBAAuB,eAAe,UAAU;AAC5C,iBAAOgM,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,kBAAM,EAAE,OAAAtZ,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,QAAO,GAAI1J,aAAY,cAAc,aAAa,CAAC,YAAY5L,OAAM;AACrM,mBAAO,IAAI,QAAQ,CAACvM,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,aAAY,GAAI,WAAW,UAAU,OAAO,IAAG,GAAIiX,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YAC3K,CAAqB;UACrB,CAAiB;;QAEL,sBAAsB,eAAeoiB,QAAO,UAAU;AAClD,iBAAO7J,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,kBAAM,EAAE,OAAAtZ,QAAO,YAAY,SAAS,qBAAoB,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,QAAO,GAAI1J,aAAY,cAAc,aAAa,CAAC,aAAY,GAAIA,aAAY,cAAciK,MAAK,CAAC,IAAI7V,OAAM;AACnQ,kBAAM,eAAc,GAAI,WAAW,eAAe,OAAO;AACzD,kBAAM,SAAS,eAAc,GAAI4L,aAAY,UAAU,YAAY,EAAE,KAAI,GAAI,WAAW,UAAU,OAAO;AACzG,mBAAO,IAAI,QAAQ,CAACnY,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,YAAY,SAAQ,GAAIiX,SAAQ,wBAAwB,QAAQ,YAAUlW,SAAQ;gBACpH,SAAQ,GAAI,WAAW,UAAU,MAAM;gBACvC,sBAAsB,OAAO,oBAAoB;cAC7E,CAAyB,GAAG,QAAQ,CAAC;YACrC,CAAqB;UACrB,CAAiB;;QAEL,wBAAwB,eAAe,UAAU;AAC7C,iBAAOuY,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,kBAAM,EAAE,OAAAtZ,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,QAAO,GAAI1J,aAAY,cAAc,aAAa,CAAC,aAAa5L,OAAM;AACtM,kBAAM,6BAA4B,GAAI,WAAW,oCAAoC,OAAO;AAC5F,kBAAM,oBAAoB,eAAe,OAAO,4BAC1C,0BAA0B,IAAI,0BAAuB,GAAI2J,SAAQ,uCAAuC,mBAAmB,CAAC,IAC5H;AACN,mBAAO,IAAI,QAAQ,CAAClW,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,aAAY,GAAI,WAAW,UAAU,iBAAiB,IAAG,GAAIiX,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YACrL,CAAqB;UACrB,CAAiB;;;;;;QAML,gBAAgB,UAAU;AACtB,iBAAOuY,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,kBAAM,EAAE,OAAAtZ,QAAO,YAAY,QAAO,IAAK,OAAM,GAAI,8BAA8B,6BAA6B4iB,SAAQ,OAAO,KAAK,UAAUtV,QAAO,aAAa,gCAAgCA,OAAM;AACpM,mBAAO,IAAI,QAAQ,CAACvM,UAAS,WAAW;AACpC,eAAA,GAAIkW,SAAQ,mBAAmBjX,QAAO,aAAY,GAAI,WAAW,UAAU,OAAO,IAAG,GAAIiX,SAAQ,wBAAwB,QAAQlW,UAAS,QAAQ,CAAC;YAC3K,CAAqB;UACrB,CAAiB;;MAEjB;AACQ,eAAS,qBAAqB4iB,WAAU;AACpC,eAAOrK,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,cAAI;AACJ,cAAIqK,UAAS,sBAAsB,QAAW;AAC1C,gCAAoBA,UAAS;iBAE5B;AACD,gCAAoB,OAAM,GAAI1M,SAAQ,8BAA8B3J,OAAM;;AAE9E,iBAAO;QACvB,CAAa;;AAEL,eAAS,uBAAuB,QAAQ;AACpC,eAAOgM,WAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,cAAIH;AACJ,cAAI,CAAC,OAAO,OAAO,YAAY,cAAc;AACzC,kBAAM,IAAI,MAAM,2DAA2D;;AAE/E,gBAAM,mBAAmB,MAAM,aAAa;YACxC,cAAcA,MAAK,OAAO,OAAO,YAAY,kBAAkB,QAAQA,QAAO,SAAS,SAASA,IAAG;YACnG,eAAe,OAAO,OAAO;YAC7B,mBAAmB,OAAO,OAAO;YACjC,eAAe;YACf,0BAA0B,OAAO,OAAO;YACxC,eAAe,OAAO,OAAO;UACjD,CAAiB;AACD,iBAAO;QACvB,CAAa;;IAEb,CAAK;;;;;AC3nBL,IAAI,YAAa/b,kBAAQA,eAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,WAAS,MAAM,OAAO;AAAE,WAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU2D,UAAS;AAAE,MAAAA,SAAQ,KAAK;IAAE,CAAE;EAAE;AAC1G,SAAO,KAAK,MAAM,IAAI,UAAU,SAAUA,UAAS,QAAQ;AACvD,aAAS,UAAU,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,KAAK,KAAK,CAAC;MAAE,SAAU,GAAG;AAAE,eAAO,CAAC;MAAE;IAAE;AACzF,aAAS,SAAS,OAAO;AAAE,UAAI;AAAE,aAAK,UAAU,OAAO,EAAE,KAAK,CAAC;MAAE,SAAU,GAAG;AAAE,eAAO,CAAC;MAAE;IAAE;AAC5F,aAAS,KAAK,QAAQ;AAAE,aAAO,OAAOA,SAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;IAAE;AAC5G,UAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,KAAI,CAAE;EAC5E,CAAK;AACL;AACA,OAAO,eAAe,YAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AACpC,WAAA,mBAAG;AAC3B,IAAM,UAAUjH;AAChB,IAAM,gBAAgBE;AACtB,IAAM,gBAAgB2D;AACtB,IAAM,UAAUU,eAAA;AAChB,IAAM,cAAcG;AACpB,SAAS,mBAAmB;AACxB,SAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,WAAO;MACH,QAAQ;QACJ,mBAAmB,YAAY,qBAAqB;QACpD,cAAa,GAAI,cAAc,mBAAmB;UAC9C,UAAU,CAAA;QAC9B,CAAiB;QACD,cAAc,CAAA;QACd,eAAe;QACf,oBAAmB,GAAI,QAAQ,kBAAkB,EAAE,UAAU,KAAM,OAAO,EAAC,CAAE;QAC7E,gCAA+B,GAAI,QAAQ,kBAAgB;QAC3D,+BAA8B,GAAI,QAAQ,kBAAgB;QAC1D,0BAAyB,GAAI,QAAQ,4BAA0B;QAC/D,kBAAkB,QAAQ,iBAAiB;QAC3C,qBAAqB;QACrB,iBAAiB;QACjB,qBAAqB;QACrB,mBAAmB;QACnB,gBAAgB;QAChB,iBAAiB;MACjC;MACY,QAAQ;AACJ,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,gBAAgB;QAC1D,CAAiB;MACjB;MACY,kBAAkB;AACd,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,0BAA0B;QACpE,CAAiB;MACjB;MACY,kBAAkB;AACd,eAAO,IAAI,cAAc,eAAe,CAAC,UAAU,WAAW,OAAO,0BAA0B,CAAC;MAChH;MACY,6BAA6B;AACzB,eAAO,IAAI,cAAc,eAAe,CAAC,UAAU,WAAW,OAAO,qCAAqC,CAAC;MAC3H;MACY,+BAA+B;AAC3B,eAAO,IAAI,cAAc,eAAe,CAAC,UAAU,WAAW,OAAO,uCAAuC,CAAC;MAC7H;MACY,iBAAiB;AACb,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,yBAAyB;QACnE,CAAiB;MACjB;MACY,uBAAuB;AACnB,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,+BAA+B;QACzE,CAAiB;MACjB;MACY,SAAS;AACL,cAAM,IAAI,MAAM,cAAc;MAC9C;MACY,sBAAsB;AAClB,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,8BAA8B;QACxE,CAAiB;MACjB;MACY,qBAAqB;AACjB,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,6BAA6B;QACvE,CAAiB;MACjB;MACY,gCAAgC;AAC5B,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,wCAAwC;QAClF,CAAiB;MACjB;MACY,kCAAkC;AAC9B,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,0CAA0C;QACpF,CAAiB;MACjB;MACY,sBAAsB;AAClB,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,8BAA8B;QACxE,CAAiB;MACjB;MACY,YAAY;AACR,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,uBAAuB;QACjE,CAAiB;MACjB;MACY,eAAe;AACX,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,uBAAuB;QACjE,CAAiB;MACjB;MACY,iBAAiB;AACb,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,yBAAyB;QACnE,CAAiB;MACjB;MACY,uBAAuB;AACnB,eAAO,CAAA;MACvB;MACY,uBAAuB;AACnB,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,+BAA+B;QACzE,CAAiB;MACjB;MACY,6CAA6C;AACzC,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,qDAAqD;QAC/F,CAAiB;MACjB;MACY,4CAA4C;AACxC,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,oDAAoD;QAC9F,CAAiB;MACjB;MACY,kBAAkB;AACd,eAAO,QAAQ,OAAO,0BAA0B;MAChE;MACY,yBAAyB;AACrB,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,iCAAiC;QAC3E,CAAiB;MACjB;MACY,wBAAwB;AACpB,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,gCAAgC;QAC1E,CAAiB;MACjB;MACY,0BAA0B;AACtB,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAO,QAAQ,OAAO,kCAAkC;QAC5E,CAAiB;MACjB;IACA;EACA,CAAK;AACL;;ACpJA,OAAO,eAAeolB,2BAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC7BA,0BAAA,0BAAG;AAClC,IAAM,WAAW9pB;AACjB,IAAM,QAAQE;AAMd,SAAS,wBAAwB,aAAa,mBAAmB;AAC7D,MAAI;AACA,YAAQ,GAAG,MAAM,+BAA+B,aAAa,iBAAiB;EACtF,SACWgG,QAAO;AACV,UAAM,IAAI,SAAS,2BAA2BA,MAAK;EAC3D;AACA;;;;;;;AChBA,SAAO,eAAe,MAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC7C,OAAA,UAAG;AACH,OAAA,UAAG;AAClB,QAAMJ,YAAW9F;AACjB,QAAM,MAAME,aAAA;AACZ,WAAS,QAAQ,OAAO;AACpB,QAAImf;AACJ,WAAO;EAAmB,IAAI,UAAU,SAAS,MAAM,aAAa,CAAC;;;EAEvE,MAAM,WAAW,IAAI,QAAM,MAAM,GAAG,MAAM,IAAI,GAAG,KAAK,IAAI,OAAO,EAAE,KAAK,IAAI,CAAC;CAAK,EAAE,KAAK,EAAE,CAAC;;EAE5F,MAAM,QAAQ,IAAI,CAAAtf,OAAK,MAAM,IAAI,UAAU,SAASA,EAAC,CAAC;CAAI,EAAE,KAAK,EAAE,CAAC;;GAEnEsf,MAAK,MAAM,gBAAgB,QAAQA,QAAO,SAAS,SAASA,IAAG,IAAI,CAAAtf,OAAK,MAAM,IAAI,UAAU,SAASA,EAAC,CAAC;CAAI,EAAE,KAAK,EAAE,CAAC;;AAExH,WAAS,QAAQ,QAAQ;AACrB,WAAO,KAAK,UAAU,QAAQ,CAAC,MAAM,UAAU;AAC3C,UAAI,OAAO,UAAU,UAAU;AAC3B,eAAO,GAAG,MAAM,SAAQ,CAAE;;AAE9B,UAAI+F,UAAS,OAAO,SAAS,KAAK,GAAG;AACjC,eAAO,IAAI,UAAU,SAAS,KAAK;;AAEvC,UAAI,OAAO,UAAU,YACjB,UAAU,QACV,MAAM,SAAS,YACf,MAAM,QAAQ,MAAM,IAAI,GAAG;AAC3B,eAAO,KAAK,MAAM,IAAI;;AAE1B,aAAO;IACf,CAAK;;;;;;;;AC9BL,MAAI4Y,mBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,QAAI,OAAO,OAAW,MAAK;AAC3B,QAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,QAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,aAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,eAAO,EAAE,CAAC;MAAE,EAAE;;AAE7D,WAAO,eAAe,GAAG,IAAI,IAAI;QAC/B,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,QAAI,OAAO,OAAW,MAAK;AAC3B,MAAE,EAAE,IAAI,EAAE,CAAC;;AAEf,MAAIsb,sBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,WAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;EACtE,KAAK,SAAS,GAAG,GAAG;AAChB,MAAE,SAAS,IAAI;EACnB;AACA,MAAIub,gBAAgBvb,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,QAAI,UAAU,SAAS,GAAG;AACtB,gBAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,YAAI,KAAK,CAAA;AACT,iBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,eAAO;MACnB;AACQ,aAAO,QAAQ,CAAC;IACxB;AACI,WAAO,SAAUhd,MAAK;AAClB,UAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,UAAI,SAAS,CAAA;AACb,UAAIA,QAAO;AAAM,iBAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,CAAAoc,iBAAgB,QAAQpc,MAAK,EAAE,CAAC,CAAC;;AAC/H,MAAAsc,oBAAmB,QAAQtc,IAAG;AAC9B,aAAO;IACf;EACA,GAAC;AACD,SAAO,eAAeynB,wBAAS,cAAc,EAAE,OAAO,KAAI,CAAE;AAC9BA,yBAAA,yBAAGC;AACjC,QAAM,UAAUnL,cAAa7e,KAAqB;AAClD,QAAM2f,UAASd,cAAa3e,QAAoB;AAChD,QAAM,SAAS2D,YAAA;AAKf,WAASmmB,yBAAuB,oBAAoB;AAChD,UAAMvK,OAAM,QAAQ,YAAY,kBAAkB;AAClD,IAAAE,QAAO,MAAM,iDAAgD,GAAI,OAAO,SAASF,IAAG,CAAC,EAAE;AACvF,WAAOA;;;;;;;;;AC7CX,QAAIf,mBAAmBpb,kBAAQA,eAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;QAAE,EAAE;;AAE7D,aAAO,eAAe,GAAG,IAAI,IAAI;UAC/B,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;;AAEf,QAAIsb,sBAAsBtb,kBAAQA,eAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAC,CAAE;IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;IACnB;AACA,QAAIub,gBAAgBvb,kBAAQA,eAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUgc,IAAG;AACjD,cAAI,KAAK,CAAA;AACT,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;QACnB;AACQ,eAAO,QAAQ,CAAC;MACxB;AACI,aAAO,SAAUhd,MAAK;AAClB,YAAIA,QAAOA,KAAI,WAAY,QAAOA;AAClC,YAAI,SAAS,CAAA;AACb,YAAIA,QAAO;AAAM,mBAAS,IAAI,QAAQA,IAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,CAAAoc,iBAAgB,QAAQpc,MAAK,EAAE,CAAC,CAAC;;AAC/H,QAAAsc,oBAAmB,QAAQtc,IAAG;AAC9B,eAAO;MACf;IACA,GAAC;AACD,QAAI,eAAgBgB,kBAAQA,eAAK,gBAAiB,SAAS,GAAGqb,UAAS;AACnE,eAAS,KAAK,EAAG,KAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKA,UAAS,CAAC,EAAG,CAAAD,iBAAgBC,UAAS,GAAG,CAAC;IAC5H;AACA,WAAO,eAAc,SAAU,cAAc,EAAE,OAAO,KAAI,CAAE;AAC5D,YAA+B,uBAAA,QAAA,yBAAiC,QAAA,oBAA4B,QAAyC,iCAAA,QAAA,4BAAoC,QAAA,sBAA8B,QAAyC,iCAAA,QAAA,sBAA8B,QAAwB,gBAAA,QAAA,2BAAmC,QAA8B,sBAAA,QAAA,wCAAgD,QAAA,mCAA2C,QAAmB,WAAA,QAAA,aAAqB,QAAmB,WAAA,QAAA,mBAA2B,QAAwC,gCAAA,QAAA,sCAA8C,QAAA,0BAAkC,QAA0B,kBAAA,QAAA,yBAAiC,QAAsB,cAAA,QAAA,iBAAyB,QAA2B,mBAAA,QAAA,yBAAiC,QAAA,kBAA0B,QAAyB,iBAAA,QAAA,mBAA2B,QAAA,8BAAsC,QAAkB,UAAA,QAAA,UAAkB,QAAA,yBAAiC,QAA4B,oBAAA,QAAA,0BAAkC,QAA6B,qBAAA,QAAA,+BAAuC,QAA0B,kBAAA,QAAA,oBAA4B,QAAA,gCAAwC,QAA+B,uBAAA,QAAA,mBAA2B,QAAuB,eAAA,QAAA,aAAqB,QAAiB,SAAA,QAAA,MAAc,QAAA,YAAoB,QAAc,MAAA,QAAA,SAAiB;AACv4C,QAAI7Y,YAAW9F;AACf,WAAO,eAAe,SAAS,UAAU,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO8F,UAAS;IAAO,EAAE,CAAE;AAC3G,YAAA,MAAc+Y,cAAa3e,KAA0B;AACrD,YAAA,YAAoB2e,cAAahb,SAA0B;AAC3D,YAAA,MAAcgb,cAAata,KAAwB;AACnD,YAAA,SAAiBsa,cAAana,QAAuB;AACrD,YAAA,aAAqBma,cAAalZ,UAAsC;AACxE,QAAI,qBAAqBsC,wBAAA;AACzB,WAAO,eAAe,SAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,mBAAmB;IAAa,EAAE,CAAE;AACjI,QAAI,eAAeC;AACnB,WAAO,eAAe,SAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;IAAiB,EAAE,CAAE;AACnI,QAAI2gB,SAAQtkB;AACZ,WAAO,eAAe,SAAS,wBAAwB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOskB,OAAM;IAAqB,EAAE,CAAE;AACpI,WAAO,eAAe,SAAS,iCAAiC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOA,OAAM;IAA8B,EAAE,CAAE;AACtJ,QAAI,+BAA+Bxf,kCAAA;AACnC,WAAO,eAAe,SAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,6BAA6B;IAAkB,EAAE,CAAE;AACrJ,WAAO,eAAe,SAAS,mBAAmB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,6BAA6B;IAAgB,EAAE,CAAE;AACjJ,WAAO,eAAe,SAAS,gCAAgC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,6BAA6B;IAA6B,EAAE,CAAE;AAC3K,WAAO,eAAe,SAAS,sBAAsB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,6BAA6B;IAAmB,EAAE,CAAE;AACvJ,QAAI,4BAA4BE;AAChC,WAAO,eAAe,SAAS,2BAA2B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;IAAwB,EAAE,CAAE;AAC9J,QAAI,sBAAsBC;AAC1B,WAAO,eAAe,SAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;IAAkB,EAAE,CAAE;AAC5I,QAAI,2BAA2BE,8BAAA;AAC/B,WAAO,eAAe,SAAS,0BAA0B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,yBAAyB;IAAuB,EAAE,CAAE;AAC3J,QAAI,SAASC,YAAA;AACb,WAAO,eAAe,SAAS,WAAW,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,OAAO;IAAQ,EAAE,CAAE;AAC3G,WAAO,eAAe,SAAS,WAAW,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,OAAO;IAAQ,EAAE,CAAE;AAC3G,QAAI,gCAAgCqC,mCAAA;AACpC,WAAO,eAAe,SAAS,+BAA+B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,8BAA8B;IAA4B,EAAE,CAAE;AAC1K,QAAI8c,WAAU7c;AACd,WAAO,eAAe,SAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO6c,SAAQ;IAAiB,EAAE,CAAE;AAC9H,WAAO,eAAe,SAAS,kBAAkB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOA,SAAQ;IAAe,EAAE,CAAE;AAC1H,WAAO,eAAe,SAAS,mBAAmB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOA,SAAQ;IAAgB,EAAE,CAAE;AAC5H,WAAO,eAAe,SAAS,0BAA0B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOA,SAAQ;IAAuB,EAAE,CAAE;AAC1I,WAAO,eAAe,SAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOA,SAAQ;IAAiB,EAAE,CAAE;AAC9H,QAAIY,iBAAgBxd;AACpB,WAAO,eAAe,SAAS,kBAAkB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOwd,eAAc;IAAe,EAAE,CAAE;AAChI,QAAIpM,iBAAgBnR;AACpB,WAAO,eAAe,SAAS,eAAe,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOmR,eAAc;IAAY,EAAE,CAAE;AAC1H,QAAIH,WAAU/Q,eAAA;AACd,WAAO,eAAe,SAAS,0BAA0B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO+Q,SAAQ;IAAuB,EAAE,CAAE;AAC1I,WAAO,eAAe,SAAS,mBAAmB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOA,SAAQ;IAAgB,EAAE,CAAE;AAC5H,WAAO,eAAe,SAAS,2BAA2B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOA,SAAQ;IAAwB,EAAE,CAAE;AAC5I,WAAO,eAAe,SAAS,uCAAuC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOA,SAAQ;IAAoC,EAAE,CAAE;AACpK,WAAO,eAAe,SAAS,iCAAiC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOA,SAAQ;IAA8B,EAAE,CAAE;AACxJ,WAAO,eAAe,SAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAOA,SAAQ;IAAiB,EAAE,CAAE;AAC9H,QAAI,aAAa9Q;AACjB,WAAO,eAAe,SAAS,YAAY,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAS,EAAE,CAAE;AACjH,WAAO,eAAe,SAAS,cAAc,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAW,EAAE,CAAE;AACrH,WAAO,eAAe,SAAS,YAAY,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAS,EAAE,CAAE;AACjH,WAAO,eAAe,SAAS,oCAAoC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAiC,EAAE,CAAE;AACjK,WAAO,eAAe,SAAS,yCAAyC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAsC,EAAE,CAAE;AAC3K,WAAO,eAAe,SAAS,uBAAuB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAoB,EAAE,CAAE;AACvI,WAAO,eAAe,SAAS,4BAA4B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAyB,EAAE,CAAE;AACjJ,WAAO,eAAe,SAAS,iBAAiB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAc,EAAE,CAAE;AAC3H,WAAO,eAAe,SAAS,uBAAuB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAoB,EAAE,CAAE;AACvI,WAAO,eAAe,SAAS,kCAAkC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAA+B,EAAE,CAAE;AAC7J,WAAO,eAAe,SAAS,uBAAuB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAoB,EAAE,CAAE;AACvI,WAAO,eAAe,SAAS,6BAA6B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAA0B,EAAE,CAAE;AACnJ,WAAO,eAAe,SAAS,kCAAkC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAA+B,EAAE,CAAE;AAC7J,WAAO,eAAe,SAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAkB,EAAE,CAAE;AACnI,WAAO,eAAe,SAAS,0BAA0B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;IAAuB,EAAE,CAAE;AAC7I,QAAI+Q,eAAc9Q;AAClB,WAAO,eAAe,SAAS,wBAAwB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO8Q,aAAY;IAAqB,EAAE,CAAE;AAC1I,iBAAa7Q,QAA0C,OAAO;AAC9D,iBAAaC,UAA6B,OAAO;AACjD,iBAAaC,UAAoC,OAAO;AACxD,iBAAaE,QAA6B,OAAO;;;;ACzGjD,IAAI,eAAe,aAAY;AACY,IAAA,QAA4B,wCAAwB,YAAY;;;ACgB3G,IAAM,EAAE,QAAAsd,SAAQ,KAAK,MAAM,IAAI;AAqB/B,IAAM,gBAAgB;AACtB,IAAM,sBACJ;AACF,IAAM,8BACJ;AACF,IAAM,gCAAmD;AAAA,EACvD;AAAA,EACA;AAAA,EACA;AACF;AACA,IAAM,gCAAmD;AAAA,EACvD;AACF;AAEA,IAAM,sBAAsB;AAE5B,SAAS,SAASC,IAAmB;AACnC,SAAOA,GAAE,KAAK,EAAE,QAAQ,QAAQ,EAAE,EAAE,YAAY;AAClD;AAEA,SAAS,QAAQA,IAAoB;AACnC,SAAO,iBAAiB,KAAK,SAASA,EAAC,CAAC;AAC1C;AAEA,SAAS,aAAa,KAAyB;AAC7C,SAAOC,YAAW,SAAS,GAAG,CAAC;AACjC;AAEA,SAAS,iBAAiB,SAA6B;AACrD,SAAO,UAAU,aAAa,aAAa,OAAO,GAAG,IAAI;AAC3D;AAEA,SAAS,YAAY,MAA4D;AAC/E,MAAI,gBAAgB,WAAY,QAAO;AACvC,MAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,UAAU,MAAM;AAC/D,WAAO,IAAI,WAAY,KAA4B,IAAI;AAAA,EACzD;AACA,SAAO,IAAI,WAAW,IAAuB;AAC/C;AAGA,SAAS,WAAW,MAA8B;AAChD,SAAO,OAAO,IAAI;AACpB;AAEA,SAAS,kBAAkB,KAAsB;AAC/C,MAAI,CAAC,QAAQ,GAAG,EAAG,QAAO;AAC1B,MAAI;AACF,WAAO,UAAU,MAAM,iBAAiB,aAAa,GAAG,CAAC;AAAA,EAC3D,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,gBAAgB,KAAqB;AAC5C,MAAI,CAAC,kBAAkB,GAAG,GAAG;AAC3B,UAAM,IAAI,MAAM,kEAA6D;AAAA,EAC/E;AACA,SAAOC,YAAW,iBAAiB,GAAG,CAAC;AACzC;AAEA,SAAS,kBAA2B;AAClC,QAAMC,QAAO,UAAU,MAAM,gBAAgB;AAC7C,SAAO;AAAA,IACL,UAAUD,YAAWC,KAAI;AAAA,IACzB,SAASD,YAAW,UAAU,aAAaC,OAAM,IAAI,CAAC;AAAA,EACxD;AACF;AAEA,SAAS,UAAU,SAA4B;AAC7C,MAAI,CAAC,kBAAkB,OAAO,GAAG;AAC/B,UAAM,IAAI,MAAM,kEAA6D;AAAA,EAC/E;AACA,QAAMC,SAAQ,SAAS,OAAO;AAC9B,SAAO,EAAE,SAASA,QAAO,QAAQ,gBAAgBA,MAAK,EAAE;AAC1D;AAQA,SAAS,OACP,QACA,MACA,YACA,kBACQ;AACR,MAAI,CAAC,kBAAkB,UAAU,GAAG;AAClC,UAAM,IAAI,MAAM,qBAAqB;AAAA,EACvC;AACA,QAAM,WAAWH,YAAW,SAAS,gBAAgB,CAAC;AACtD,MAAI,SAAS,WAAW,IAAI;AAC1B,UAAM,IAAI,MAAM,oDAA+C;AAAA,EACjE;AAEA,QAAM,OAAOF,QAAO,KAAK,QAAQ;AACjC,QAAMI,QAAOJ,QAAO,KAAK,aAAa,UAAU,CAAC;AACjD,QAAMM,OAAMN,QAAO,KAAK,iBAAiB,UAAU,CAAC;AAEpD,MAAI,IAAI,MAAM,SAAS,IAAI;AAC3B,MAAI,MAAM,oBAAoB,QAAQ,MAAM,CAAC;AAC7C,QAAM,eAAeM,MAAK,CAAC;AAQ3B,QAAMC,UAAS,MAAM,gBAAgB,GAAG,mBAAmB;AAC3D,QAAMC,aAAY,UAAU,KAAKD,SAAQH,OAAM,EAAE,SAAS,MAAM,CAAC;AACjE,MAAI,MAAM,aAAaE,MAAKN,QAAO,KAAKQ,UAAS,GAAG,CAAC;AAErD,SAAO,MAAM,UAAU,CAAC,EAAE,SAAS,KAAK;AAC1C;AAEA,SAAS,gBACP,YACA,QACA,SACA,UACA,cACA,SACA,eACQ;AACR,SAAO;AAAA,IACL;AAAA,IACA,CAAC,YAAY,QAAQ,SAAS,UAAU,YAAY;AAAA,IACpD;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,gBACP,YACA,QACA,SACA,OACA,SACA,eACQ;AACR,SAAO;AAAA,IACL;AAAA,IACA,CAAC,YAAY,QAAQ,SAAS,KAAK;AAAA,IACnC;AAAA,IACA;AAAA,EACF;AACF;AAMA,SAAS,gBACP,MACA,cACA,WACS;AACT,QAAM,WAAW,aAAa,KAAK,EAAE,QAAQ,QAAQ,EAAE,EAAE,YAAY;AACrE,MAAI,CAAC,cAAc,KAAK,QAAQ,GAAG;AACjC,UAAM,IAAI,MAAM,sBAAsB;AAAA,EACxC;AACA,MAAI,SAAS,SAAS,MAAM,SAAS,SAAS,KAAK;AACjD,UAAM,IAAI,MAAM,+BAA+B;AAAA,EACjD;AACA,QAAM,UAAU,UAAU,KAAK,EAAE,QAAQ,QAAQ,EAAE,EAAE,YAAY;AACjE,QAAM,UAAUN,YAAW,OAAO;AAElC,QAAMK,UAAS,WAAW,YAAY,IAAI,CAAC;AAC3C,QAAM,WAAWL,YAAW,QAAQ;AAIpC,SAAO,UAAU,OAAO,UAAUK,SAAQ,SAAS,EAAE,SAAS,MAAM,CAAC;AACvE;AAIA,IAAM,WACJ;AAEF,SAAS,cAAc,OAA6B;AAClD,SAAO,EAAE,UAAU,OAAO,OAAO,CAAC,EAAE;AACtC;AAEA,SAAS,eAAe,GAAoB;AAC1C,SAAO;AACT;AAEA,SAAS,qBAAqBN,IAAmB;AAC/C,SAAOA,GAAE,UAAU,MAAM,EAAE,YAAY;AACzC;AAEA,SAAS,0BAA0B,GAAoB;AACrD,SAAO;AACT;AAEA,SAAS,qBAAqB,GAAkB,IAA4B;AAC1E,QAAM,IAAI,MAAM,wBAAwB,QAAQ,EAAE;AACpD;AAEA,SAAS,oBAAoB,GAAmB,IAAsC;AACpF,QAAM,IAAI,MAAM,uBAAuB,QAAQ,EAAE;AACnD;AAKA,SAAS,gBAAgB,GAAkB;AACzC,QAAM,IAAI,MAAM,mBAAmB,QAAQ,EAAE;AAC/C;AAEA,SAAS,qBAAqB,GAAW,IAAmB;AAC1D,QAAM,IAAI,MAAM,wBAAwB,QAAQ,EAAE;AACpD;AAEA,SAAS,qBAAqB,GAAW,IAAY,KAAoB;AACvE,QAAM,IAAI,MAAM,wBAAwB,QAAQ,EAAE;AACpD;AAMA,SAAS,KAA8CQ,OAAiB;AACtE,UAAQ,IAAI,UAA0B;AACpC,UAAM,IAAI,MAAM,GAAGA,KAAI,IAAI,QAAQ,EAAE;AAAA,EACvC;AACF;AAEO,IAAM,SAAyB;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,wBAAwB;AAAA,EACxB,gCAAgC;AAAA,EAChC,kBAAkB;AAAA;AAAA;AAAA,EAGlB,eAAe;AAAA,EACf,wBAAwB,MAAM,CAAC,GAAG,6BAA6B;AAAA,EAC/D,wBAAwB,MAAM,CAAC,GAAG,6BAA6B;AAAA;AAAA,EAG/D,qBAAqB,KAA4C,qBAAqB;AAAA,EACtF,oBAAoB,KAA2C,oBAAoB;AAAA,EACnF,6BAA6B,KAAoD,6BAA6B;AAAA,EAC9G,2BAA2B,KAAkD,2BAA2B;AAAA,EACxG,4BAA4B,KAAmD,4BAA4B;AAAA,EAC3G,mBAAmB,KAA0C,mBAAmB;AAAA,EAChF,kBAAkB,KAAyC,kBAAkB;AAAA,EAC7E,oBAAoB,KAA2C,oBAAoB;AAAA,EACnF,YAAY,KAAmC,YAAY;AAAA,EAC3D,sBAAsB,KAA6C,sBAAsB;AAAA,EACzF,wBAAwB,KAA+C,wBAAwB;AAAA,EAC/F,eAAe,KAAsC,eAAe;AAAA,EACpE,eAAe,KAAsC,eAAe;AAAA,EACpE,iBAAiB,KAAwC,iBAAiB;AAAA,EAC1E,sBAAsB;AAAA,EACtB,8BAA8B,KAAqD,8BAA8B;AAAA,EACjH,yBAAyB,KAAgD,yBAAyB;AAAA,EAClG,8BAA8B,KAAqD,8BAA8B;AAAA,EACjH,eAAe,KAAsC,eAAe;AAAA,EACpE,wBAAwB,KAA+C,wBAAwB;AAAA,EAC/F,kBAAkB,KAAyC,kBAAkB;AAAA,EAC7E,wBAAwB,KAA+C,wBAAwB;AAAA,EAC/F,qBAAqB,KAA4C,qBAAqB;AAAA,EACtF,6BAA6B,KAAoD,6BAA6B;AAAA,EAC9G,0BAA0B,KAAiD,0BAA0B;AAAA,EACrG,6BAA6B,KAAoD,6BAA6B;AAAA,EAC9G,iCAAiC,KAAwD,iCAAiC;AAAA,EAC1H,yCAAyC,KAAgE,yCAAyC;AAAA,EAClJ,8BAA8B,KAAqD,8BAA8B;AAAA,EACjH,qBAAqB,KAA4C,qBAAqB;AAAA,EACtF,gBAAgB,KAAuC,gBAAgB;AAAA,EACvE,iBAAiB,KAAwC,iBAAiB;AAAA,EAC1E,kBAAkB,KAAyC,kBAAkB;AAAA,EAC7E,mBAAmB,KAA0C,mBAAmB;AAAA,EAChF,qBAAqB,KAA4C,qBAAqB;AAAA,EACtF,wBAAwB,KAA+C,wBAAwB;AAAA,EAC/F,mBAAmB,KAA0C,mBAAmB;AAAA,EAChF,cAAc,KAAqC,cAAc;AAAA,EACjE,4BAA4B,KAAmD,4BAA4B;AAAA,EAC3G,uBAAuB,KAA8C,uBAAuB;AAAA,EAC5F,qBAAqB;AAAA,EACrB,0BAA0B;AAAA,EAC1B,4BAA4B;AAAA,EAC5B,4BAA4B;AAAA,EAC5B,wBAAwB;AAAA,EACxB,4BAA4B;AAAA,EAC5B,gCAAgC;AAAA,EAChC,8BAA8B;AAAA,EAC9B,yCAAyC;AAAA,EACzC,kBAAkB;AAAA,EAClB,QAAQ;AACV;;;ACxVO,SAASC,aAAY,MAA0B;AACpD,QAAM,MAAM,IAAI,WAAW,IAAI;AAC/B,aAAW,OAAO,gBAAgB,GAAG;AACrC,SAAO;AACT;AAEO,SAAS,UAAU,MAAsB;AAC9C,QAAM,MAAMA,aAAY,IAAI;AAC5B,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,WAAO,IAAI,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,EAC5C;AACA,SAAO;AACT;;;ACXO,IAAM,mBAA2B,OAAO;AAExC,IAAM,4BAA+C,OAAO;AAAA,EACjE,OAAO,uBAAuB;AAChC;AAEO,IAAM,yBAAiC,OAAO;;;ACErD,IAAM,4BAA+C,OAAO;AAAA,EAC1D,OAAO,uBAAuB;AAChC;AAEA,IAAM,iCACJ,OAAO;AAQF,IAAM,eAA4B;AAAA,EACvC,SAAS;AAAA,EACT,eAAe;AAAA,EACf,UAAU;AACZ;AAEO,IAAM,gBAA6B;AAAA,EACxC,SAAS;AAAA,EACT,eAAe;AAAA,EACf,UAAU;AACZ;;;ACfM,SAAU,QACdC,OACA,KACA,MAAuB;AAEvB,QAAMA,KAAI;AAIV,MAAI,SAAS;AAAW,WAAO,IAAI,WAAWA,MAAK,SAAS;AAC5D,SAAO,KAAKA,OAAM,MAAM,GAAG;AAC7B;AAIA,IAAM,eAA+B,2BAAW,GAAG,CAAC;AAEpD,IAAM,eAA+B,2BAAW,GAAE;AAqB5C,SAAUC,QACdD,OACA,KACAE,OACA,SAAiB,IAAE;AAEnB,QAAMF,KAAI;AACV,UAAQ,QAAQ,QAAQ;AACxB,SAAO,KAAK,QAAW,KAAK;AAC5B,QAAM,OAAOA,MAAK;AAElB,MAAI,IAAI,SAAS;AAAM,UAAM,IAAI,MAAM,uCAAuC;AAE9E,MAAI,SAAS,MAAM;AAAM,UAAM,IAAI,MAAM,+BAA+B;AACxE,QAAM,SAAS,KAAK,KAAK,SAAS,IAAI;AACtC,MAAIE,UAAS;AAAW,IAAAA,QAAO;;AAC1B,WAAOA,OAAM,QAAW,MAAM;AAEnC,QAAM,MAAM,IAAI,WAAW,SAAS,IAAI;AAExC,QAAM,OAAO,KAAK,OAAOF,OAAM,GAAG;AAClC,QAAM,UAAU,KAAK,WAAU;AAC/B,QAAM,IAAI,IAAI,WAAW,KAAK,SAAS;AACvC,WAAS,UAAU,GAAG,UAAU,QAAQ,WAAW;AACjD,iBAAa,CAAC,IAAI,UAAU;AAG5B,YAAQ,OAAO,YAAY,IAAI,eAAe,CAAC,EAC5C,OAAOE,KAAI,EACX,OAAO,YAAY,EACnB,WAAW,CAAC;AACf,QAAI,IAAI,GAAG,OAAO,OAAO;AACzB,SAAK,WAAW,OAAO;EACzB;AACA,OAAK,QAAO;AACZ,UAAQ,QAAO;AACf,QAAM,GAAG,YAAY;AACrB,SAAO,IAAI,MAAM,GAAG,MAAM;AAC5B;AA0BO,IAAM,OAAO,CAClBF,OACA,KACA,MACAE,OACA,WACqBD,QAAOD,OAAM,QAAQA,OAAM,KAAK,IAAI,GAAGE,OAAM,MAAM;;;AC7GnE,SAASC,SAAQ,GAAG;AAKvB,SAAQ,aAAa,cAChB,YAAY,OAAO,CAAC,KACjB,EAAE,YAAY,SAAS,gBACvB,uBAAuB,KACvB,EAAE,sBAAsB;AACpC;AAGA,IAAM,SAAS,CAAC,UAAW,QAAQ,IAAI,KAAK,OAAO;AAa5C,SAASC,OAAM,OAAO,QAAQ,IAAI;AACrC,MAAI,OAAO,UAAU;AACjB,UAAM,IAAI,UAAU,OAAO,KAAK,IAAI,gCAAgC,OAAO,KAAK;AACpF,SAAO;AACX;AAcO,SAASC,SAAQ,GAAG,QAAQ,IAAI;AACnC,MAAI,OAAO,MAAM;AACb,UAAM,IAAI,UAAU,OAAO,KAAK,IAAI,0BAA0B,OAAO,CAAC;AAC1E,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI;AAChC,UAAM,IAAI,WAAW,OAAO,KAAK,IAAI,gCAAgC,CAAC;AAC1E,SAAO;AACX;AAiBO,SAASC,QAAO,OAAO,QAAQ,QAAQ,IAAI;AAG9C,MAAIH,SAAQ,KAAK,MAAM,WAAW,UAAa,MAAM,WAAW;AAC5D,WAAO;AAEX,MAAI,WAAW;AACX,IAAAE,SAAQ,QAAQ,QAAQ;AAC5B,QAAM,QAAQF,SAAQ,KAAK;AAC3B,QAAM,QAAQ,WAAW,SAAY,cAAc,MAAM,KAAK;AAC9D,QAAM,MAAM,QAAQ,UAAU,MAAM,MAAM,KAAK,QAAQ,OAAO,KAAK;AACnE,QAAM,UAAU,OAAO,KAAK,IAAI,wBAAwB,QAAQ,WAAW;AAC3E,MAAI,CAAC;AACD,UAAM,IAAI,UAAU,OAAO;AAC/B,QAAM,IAAI,WAAW,OAAO;AAChC;AAoBO,SAASI,SAAQ,UAAU,gBAAgB,MAAM;AAGpD,MAAI,SAAS;AACT,UAAM,IAAI,MAAM,oBAAoB;AACxC,MAAI,iBAAiB,SAAS;AAC1B,UAAM,IAAI,MAAM,6BAA6B;AACrD;AAgBO,SAASC,SAAQ,KAAK,UAAU;AACnC,EAAAC,QAAO,KAAK,QAAW,QAAQ;AAG/B,QAAMC,OAAM,SAAS;AACrB,MAAI,EAAE,IAAI,UAAUA,OAAM;AACtB,UAAM,IAAI,WAAW,iCAAiCA,IAAG;AAAA,EAC7D;AACJ;AAiBO,SAAS,UAAU,KAAK,UAAU;AACrC,EAAAF,SAAQ,KAAK,QAAQ;AACrB,MAAI,CAAC,YAAY,GAAG;AAChB,UAAM,IAAI,MAAM,iCAAiC;AACzD;AAYO,SAAS,GAAG,KAAK;AACpB,SAAO,IAAI,WAAW,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;AACpE;AAaO,SAAS,IAAI,KAAK;AACrB,SAAO,IAAI,YAAY,IAAI,QAAQ,IAAI,YAAY,KAAK,MAAM,IAAI,aAAa,CAAC,CAAC;AACrF;AAaO,SAASG,UAAS,QAAQ;AAC7B,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,WAAO,CAAC,EAAE,KAAK,CAAC;AAAA,EACpB;AACJ;AAYO,SAASC,YAAW,KAAK;AAC5B,SAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;AAClE;AAKO,IAAM,OAAwB,uBAAM,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM,IAAM;AAYtG,SAAS,SAAS,MAAM;AAC3B,SAAU,QAAQ,KAAM,aAClB,QAAQ,IAAK,WACb,SAAS,IAAK,QACd,SAAS,KAAM;AACzB;AAYO,IAAM,YAAY,OACnB,CAAC,MAAM,IACP,CAAC,MAAM,SAAS,CAAC,MAAM;AAYtB,SAAS,WAAW,KAAK;AAC5B,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,QAAI,CAAC,IAAI,SAAS,IAAI,CAAC,CAAC;AAAA,EAC5B;AACA,SAAO;AACX;AAYO,IAAM,aAAa,OACpB,CAAC,MAAM,IACP;AA8SC,SAAS,WAAW,GAAG,GAAG;AAC7B,MAAIC,QAAO,CAAC;AACZ,MAAIA,QAAO,CAAC;AACZ,MAAI,EAAE,WAAW,EAAE;AACf,WAAO;AACX,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAC1B,YAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;AACtB,SAAO,SAAS;AACpB;AAUO,SAAS,mBAAmB,QAAQ,SAAS,SAAS;AACzD,QAAM,MAAM;AACZ,QAAM,UAAW,YAAY,MAAM,CAAC;AACpC,QAAM,OAAO,CAAC,KAAKC,SAAQ,IAAIA,MAAK,GAAG,QAAQ,GAAG,CAAC,EAC9C,OAAO,GAAG,EACV,OAAO;AACZ,QAAM,MAAM,IAAI,IAAI,WAAW,MAAM,GAAG,GAAG,QAAQ,IAAI,WAAW,CAAC,CAAC,CAAC;AACrE,OAAK,YAAY,IAAI;AACrB,OAAK,WAAW,IAAI;AACpB,OAAK,SAAS,CAACA,SAAQ,SAAS,IAAIA,MAAK,GAAG,IAAI;AAChD,SAAO;AACX;AAaO,IAAM,wCAAa,CAAC,QAAQ,gBAAgB;AAC/C,WAAS,cAAcA,SAAQ,MAAM;AAEjC,IAAAD,QAAOC,MAAK,QAAW,KAAK;AAE5B,QAAI,OAAO,gBAAgB,QAAW;AAClC,YAAM,QAAQ,KAAK,CAAC;AACpB,MAAAD,QAAO,OAAO,OAAO,eAAe,SAAY,OAAO,aAAa,OAAO;AAAA,IAC/E;AAEA,UAAM,OAAO,OAAO;AACpB,UAAM,WAAW,OAAO,gBAAgB,SAAY,IAAI;AAExD,QAAI,CAAC,OAAO,SAAS;AACjB,eAAS,IAAI,UAAU,IAAI,KAAK,QAAQ;AACpC,YAAIE,SAAQ,KAAK,CAAC,CAAC;AACf,gBAAM,IAAI,MAAM,mBAAmB;AAAA,IAC/C;AAEA,QAAI,OAAO,WAAW,KAAK,QAAQ,MAAM;AACrC,MAAAF,QAAO,KAAK,QAAQ,GAAG,QAAW,KAAK;AAC3C,UAAMG,UAAS,YAAYF,MAAK,GAAG,IAAI;AACvC,UAAM,cAAc,CAAC,UAAU,WAAW;AACtC,UAAI,WAAW,QAAW;AACtB,YAAI,aAAa;AACb,gBAAM,IAAI,MAAM,6BAA6B;AACjD,QAAAD,QAAO,QAAQ,QAAW,QAAQ;AAAA,MACtC;AAAA,IACJ;AAEA,QAAI,SAAS;AACb,UAAM,WAAW;AAAA,MACb,QAAQ,MAAM,QAAQ;AAClB,YAAI;AACA,gBAAM,IAAI,MAAM,8CAA8C;AAElE,iBAAS;AACT,QAAAA,QAAO,MAAM,QAAW,MAAM;AAC9B,oBAAYG,QAAO,QAAQ,QAAQ,MAAM;AACzC,eAAOA,QAAO,QAAQ,MAAM,MAAM;AAAA,MACtC;AAAA,MACA,QAAQ,MAAM,QAAQ;AAClB,QAAAH,QAAO,MAAM,QAAW,MAAM;AAC9B,YAAI,QAAQ,KAAK,SAAS;AACtB,gBAAM,IAAI,MAAM,+CAA+C,IAAI;AACvE,oBAAYG,QAAO,QAAQ,QAAQ,MAAM;AACzC,eAAOA,QAAO,QAAQ,MAAM,MAAM;AAAA,MACtC;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACA,SAAO,OAAO,eAAe,MAAM;AACnC,SAAO;AACX;AAkBO,SAAS,UAAU,gBAAgB,KAAK,cAAc,MAAM;AAC/D,MAAI,QAAQ;AACR,WAAO,IAAI,WAAW,cAAc;AAExC,EAAAH,QAAO,KAAK,gBAAgB,QAAQ;AACpC,MAAI,eAAe,CAAC,YAAY,GAAG;AAC/B,UAAM,IAAI,MAAM,iCAAiC;AACrD,SAAO;AACX;AAmBO,SAAS,WAAW,YAAY,WAAWI,OAAM;AAEpD,EAAAC,SAAQ,UAAU;AAClB,EAAAA,SAAQ,SAAS;AACjB,EAAAC,OAAMF,KAAI;AACV,QAAM,MAAM,IAAI,WAAW,EAAE;AAC7B,QAAM,OAAOG,YAAW,GAAG;AAC3B,OAAK,aAAa,GAAG,OAAO,SAAS,GAAGH,KAAI;AAC5C,OAAK,aAAa,GAAG,OAAO,UAAU,GAAGA,KAAI;AAC7C,SAAO;AACX;AAYO,SAAS,YAAY,OAAO;AAC/B,SAAO,MAAM,aAAa,MAAM;AACpC;AAaO,SAASI,WAAU,OAAO;AAG7B,SAAO,WAAW,KAAKR,QAAO,KAAK,CAAC;AACxC;;;ACrwBA,IAAM,aAAa;AAInB,IAAM,UAA0B,oBAAI,WAAW,EAAE;AACjD,IAAM,UAA0B,oBAAI,OAAO;AAG3C,IAAM,OAAO;AAKb,IAAMS,QAAO,CAAC,IAAI,IAAI,IAAI,OAAO;AAC7B,QAAM,QAAQ,KAAK;AACnB,SAAO;AAAA,IACH,IAAK,MAAM,KAAO,OAAO;AAAA,IACzB,IAAK,MAAM,KAAO,OAAO;AAAA,IACzB,IAAK,MAAM,KAAO,OAAO;AAAA;AAAA;AAAA,IAGzB,IAAK,OAAO,IAAO,QAAQ,KAAM,EAAE,QAAQ;AAAA;AAAA,EAC/C;AACJ;AAEA,IAAM,SAAS,CAAC,OAAS,MAAM,IAAK,QAAS,MACtC,MAAM,IAAK,QAAS,MACpB,MAAM,KAAM,QAAS,IACtB,MAAM,KAAM,MACd;AAyBJ,IAAM,iBAAiB,CAAC,UAAU;AAC9B,MAAI,QAAQ,KAAK;AACb,WAAO;AACX,MAAI,QAAQ;AACR,WAAO;AACX,SAAO;AACX;AAoBO,IAAMC,SAAN,MAAY;AAAA,EACf,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,WAAW;AAAA,EACX,YAAY;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA,YAAYC,MAAK,gBAAgB;AAC7B,IAAAC,QAAOD,MAAK,IAAI,KAAK;AACrB,IAAAA,OAAME,WAAUF,IAAG;AACnB,UAAM,QAAQG,YAAWH,IAAG;AAC5B,QAAI,KAAK,MAAM,UAAU,GAAG,KAAK;AACjC,QAAI,KAAK,MAAM,UAAU,GAAG,KAAK;AACjC,QAAI,KAAK,MAAM,UAAU,GAAG,KAAK;AACjC,QAAI,KAAK,MAAM,UAAU,IAAI,KAAK;AAElC,UAAM,UAAU,CAAC;AACjB,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,cAAQ,KAAK,EAAE,IAAI,OAAO,EAAE,GAAG,IAAI,OAAO,EAAE,GAAG,IAAI,OAAO,EAAE,GAAG,IAAI,OAAO,EAAE,EAAE,CAAC;AAC/E,OAAC,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAII,MAAK,IAAI,IAAI,IAAI,EAAE;AAAA,IAC7D;AACA,UAAMC,KAAI,eAAe,kBAAkB,IAAI;AAC/C,QAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAASA,EAAC;AACxB,YAAM,IAAI,MAAM,gDAAgD;AACpE,SAAK,IAAIA;AACT,UAAM,OAAO;AACb,UAAM,UAAU,OAAOA;AACvB,UAAM,aAAc,KAAK,aAAa,KAAKA;AAC3C,UAAM,QAAQ,CAAC;AAEf,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAE9B,eAAS,OAAO,GAAG,OAAO,YAAY,QAAQ;AAE1C,YAAI,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK;AACjC,iBAAS,IAAI,GAAG,IAAIA,IAAG,KAAK;AACxB,gBAAM,MAAO,SAAUA,KAAI,IAAI,IAAM;AACrC,cAAI,CAAC;AACD;AACJ,gBAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,QAAQA,KAAI,IAAI,CAAC;AAC5D,UAAE,MAAM,IAAM,MAAM,IAAM,MAAM,IAAM,MAAM;AAAA,QAChD;AACA,cAAM,KAAK,EAAE,IAAI,IAAI,IAAI,GAAG,CAAC;AAAA,MACjC;AAAA,IACJ;AACA,SAAK,IAAI;AAAA,EACb;AAAA,EACA,aAAa,IAAI,IAAI,IAAI,IAAI;AACzB,IAAE,MAAM,KAAK,IAAM,MAAM,KAAK,IAAM,MAAM,KAAK,IAAM,MAAM,KAAK;AAChE,UAAM,EAAE,GAAAA,IAAG,GAAG,WAAW,IAAI;AAE7B,QAAI,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK;AACjC,UAAM,QAAQ,KAAKA,MAAK;AACxB,QAAI,IAAI;AAIR,eAAW,OAAO,CAAC,IAAI,IAAI,IAAI,EAAE,GAAG;AAChC,eAAS,UAAU,GAAG,UAAU,GAAG,WAAW;AAC1C,cAAM,OAAQ,QAAS,IAAI,UAAY;AACvC,iBAAS,SAAS,IAAIA,KAAI,GAAG,UAAU,GAAG,UAAU;AAChD,gBAAM,MAAO,SAAUA,KAAI,SAAW;AACtC,gBAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,EAAE,IAAI,aAAa,GAAG;AACjE,UAAE,MAAM,IAAM,MAAM,IAAM,MAAM,IAAM,MAAM;AAC5C,eAAK;AAAA,QACT;AAAA,MACJ;AAAA,IACJ;AACA,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,KAAK;AAAA,EACd;AAAA,EACA,OAAO,MAAM;AACT,IAAAC,SAAQ,IAAI;AACZ,IAAAL,QAAO,IAAI;AACX,WAAOC,WAAU,IAAI;AACrB,UAAM,MAAM,IAAI,IAAI;AACpB,UAAM,SAAS,KAAK,MAAM,KAAK,SAAS,UAAU;AAClD,UAAM,OAAO,KAAK,SAAS;AAC3B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,WAAK,aAAa,UAAU,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC;AAAA,IAChI;AACA,QAAI,MAAM;AACN,cAAQ,IAAI,KAAK,SAAS,SAAS,UAAU,CAAC;AAG9C,WAAK,aAAa,UAAU,QAAQ,CAAC,CAAC,GAAG,UAAU,QAAQ,CAAC,CAAC,GAAG,UAAU,QAAQ,CAAC,CAAC,GAAG,UAAU,QAAQ,CAAC,CAAC,CAAC;AAC5G,MAAAK,OAAM,OAAO;AAAA,IACjB;AACA,WAAO;AAAA,EACX;AAAA,EACA,UAAU;AAEN,SAAK,YAAY;AACjB,UAAM,EAAE,EAAE,IAAI;AAId,eAAW,OAAO,GAAG;AACjB,MAAE,IAAI,KAAK,GAAK,IAAI,KAAK,GAAK,IAAI,KAAK,GAAK,IAAI,KAAK;AAAA,IACzD;AAAA,EACJ;AAAA,EACA,WAAW,KAAK;AACZ,IAAAD,SAAQ,IAAI;AAGZ,cAAU,KAAK,IAAI;AACnB,SAAK,WAAW;AAIhB,UAAM,EAAE,IAAI,IAAI,IAAI,GAAG,IAAI;AAC3B,UAAM,MAAM,IAAI,GAAG;AACnB,QAAI,CAAC,IAAI;AACT,QAAI,CAAC,IAAI;AACT,QAAI,CAAC,IAAI;AACT,QAAI,CAAC,IAAI;AAET,QAAI,CAAC;AACD,iBAAW,IAAI,SAAS,GAAG,aAAa,CAAC,CAAC;AAAA,EAClD;AAAA,EACA,SAAS;AACL,UAAM,MAAM,IAAI,WAAW,UAAU;AACrC,SAAK,WAAW,GAAG;AAEnB,SAAK,QAAQ;AACb,WAAO;AAAA,EACX;AACJ;AAkFO,IAAME,SACG,mCAAmB,IAAI,CAACC,MAAK,mBAAmB,IAAIC,OAAMD,MAAK,cAAc,GAAG,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC;;;ACjSrH,IAAME,cAAa;AAEnB,IAAM,eAAe;AAGrB,IAAM,cAA8B,oBAAI,WAAWA,WAAU;AAK7D,IAAMC,QAAO;AAEb,SAAS,kBAAkBC,MAAK;AAC5B,MAAI,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,SAASA,KAAI,MAAM;AACjC,UAAM,IAAI,MAAM,kEAAkEA,KAAI,MAAM;AACpG;AAMA,SAASC,MAAK,GAAG;AACb,SAAQ,KAAK,IAAMF,QAAO,EAAE,KAAK;AACrC;AAIA,SAASG,KAAI,GAAG,GAAG;AACf,MAAI,MAAM;AACV,SAAO,IAAI,GAAG,MAAM,GAAG;AAEnB,WAAO,IAAI,EAAE,IAAI;AACjB,QAAID,MAAK,CAAC;AAAA,EACd;AACA,SAAO;AACX;AA6BA,IAAM,OAAwB,uBAAM;AAChC,QAAM,IAAI,IAAI,WAAW,GAAG;AAI5B,WAAS,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,KAAK,KAAKE,MAAK,CAAC;AAC5C,MAAE,CAAC,IAAI;AACX,QAAM,MAAM,IAAI,WAAW,GAAG;AAG9B,MAAI,CAAC,IAAI;AACT,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,QAAI,IAAI,EAAE,MAAM,CAAC;AACjB,SAAK,KAAK;AACV,QAAI,EAAE,CAAC,CAAC,KAAK,IAAK,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK,IAAK,MAAQ;AAAA,EACzE;AACA,EAAAC,OAAM,CAAC;AACP,SAAO;AACX,GAAG;AAOH,IAAM,WAAW,CAAC,MAAO,KAAK,KAAO,MAAM;AAG3C,IAAM,WAAW,CAAC,MAAO,KAAK,IAAM,MAAM;AAK1C,SAAS,UAAUC,OAAM,IAAI;AACzB,MAAIA,MAAK,WAAW;AAChB,UAAM,IAAI,MAAM,mBAAmB;AACvC,QAAM,KAAK,IAAI,YAAY,GAAG,EAAE,IAAI,CAAC,GAAG,MAAM,GAAGA,MAAK,CAAC,CAAC,CAAC;AACzD,QAAM,KAAK,GAAG,IAAI,QAAQ;AAC1B,QAAM,KAAK,GAAG,IAAI,QAAQ;AAC1B,QAAM,KAAK,GAAG,IAAI,QAAQ;AAG1B,QAAM,MAAM,IAAI,YAAY,MAAM,GAAG;AACrC,QAAM,MAAM,IAAI,YAAY,MAAM,GAAG;AACrC,QAAMC,SAAQ,IAAI,YAAY,MAAM,GAAG;AACvC,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,YAAM,MAAM,IAAI,MAAM;AACtB,UAAI,GAAG,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC;AACvB,UAAI,GAAG,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC;AACvB,MAAAA,OAAM,GAAG,IAAKD,MAAK,CAAC,KAAK,IAAKA,MAAK,CAAC;AAAA,IACxC;AAAA,EACJ;AACA,SAAO,EAAE,MAAAA,OAAM,OAAAC,QAAO,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI;AACnD;AAIA,IAAM,gBAAgC,0BAAU,MAAM,CAACC,OAAOC,KAAID,IAAG,CAAC,KAAK,KAAOA,MAAK,KAAOA,MAAK,IAAKC,KAAID,IAAG,CAAC,CAAC;AAMjH,IAAM,UAA2B,uBAAM;AACnC,QAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,WAAS,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,KAAK,IAAIE,MAAK,CAAC;AAC1C,MAAE,CAAC,IAAI;AACX,SAAO;AACX,GAAG;AAEH,SAAS,YAAYC,MAAK;AACtB,EAAAC,QAAOD,IAAG;AACV,QAAM,MAAMA,KAAI;AAChB,oBAAkBA,IAAG;AACrB,QAAM,EAAE,MAAM,IAAI;AAClB,QAAM,UAAU,CAAC;AAGjB,MAAI,CAAC,QAAQ,CAAC,YAAYA,IAAG;AACzB,YAAQ,KAAMA,OAAME,WAAUF,IAAG,CAAE;AACvC,QAAM,MAAM,WAAW,IAAIA,IAAG,CAAC;AAC/B,QAAM,KAAK,IAAI;AAGf,QAAM,UAAU,CAAC,MAAM,UAAU,OAAO,GAAG,GAAG,GAAG,CAAC;AAGlD,QAAM,KAAK,IAAI,YAAY,MAAM,EAAE;AACnC,KAAG,IAAI,GAAG;AAEV,WAAS,IAAI,IAAI,IAAI,GAAG,QAAQ,KAAK;AACjC,QAAI,IAAI,GAAG,IAAI,CAAC;AAChB,QAAI,IAAI,OAAO;AACX,UAAI,QAAQ,SAAS,CAAC,CAAC,IAAI,QAAQ,IAAI,KAAK,CAAC;AAAA,aACxC,KAAK,KAAK,IAAI,OAAO;AAC1B,UAAI,QAAQ,CAAC;AACjB,OAAG,CAAC,IAAI,GAAG,IAAI,EAAE,IAAI;AAAA,EACzB;AACA,EAAAG,OAAM,GAAG,OAAO;AAChB,SAAO;AACX;AA0BA,SAAS,UAAU,KAAK,KAAK,IAAI,IAAI,IAAI,IAAI;AAKzC,SAAQ,IAAM,MAAM,IAAK,QAAY,OAAO,IAAK,GAAK,IAClD,IAAM,OAAO,IAAK,QAAY,OAAO,KAAM,GAAK;AACxD;AACA,SAAS,UAAU,OAAO,IAAI,IAAI,IAAI,IAAI;AAKtC,SAAQ,MAAO,KAAK,MAAS,KAAK,KAAO,IACpC,MAAQ,OAAO,KAAM,MAAU,OAAO,KAAM,KAAO,KAAK;AACjE;AACA,SAAS,QAAQ,IAAI,IAAI,IAAI,IAAI,IAAI;AACjC,QAAM,EAAE,OAAO,KAAK,IAAI,IAAI;AAC5B,MAAI,IAAI;AACR,EAAE,MAAM,GAAG,GAAG,GAAK,MAAM,GAAG,GAAG,GAAK,MAAM,GAAG,GAAG,GAAK,MAAM,GAAG,GAAG;AAGjE,QAAM,SAAS,GAAG,SAAS,IAAI;AAC/B,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,UAAMC,MAAK,GAAG,GAAG,IAAI,UAAU,KAAK,KAAK,IAAI,IAAI,IAAI,EAAE;AACvD,UAAMC,MAAK,GAAG,GAAG,IAAI,UAAU,KAAK,KAAK,IAAI,IAAI,IAAI,EAAE;AACvD,UAAMC,MAAK,GAAG,GAAG,IAAI,UAAU,KAAK,KAAK,IAAI,IAAI,IAAI,EAAE;AACvD,UAAMC,MAAK,GAAG,GAAG,IAAI,UAAU,KAAK,KAAK,IAAI,IAAI,IAAI,EAAE;AACvD,IAAE,KAAKH,KAAM,KAAKC,KAAM,KAAKC,KAAM,KAAKC;AAAA,EAC5C;AAEA,QAAM,KAAK,GAAG,GAAG,IAAI,UAAU,OAAO,IAAI,IAAI,IAAI,EAAE;AACpD,QAAM,KAAK,GAAG,GAAG,IAAI,UAAU,OAAO,IAAI,IAAI,IAAI,EAAE;AACpD,QAAM,KAAK,GAAG,GAAG,IAAI,UAAU,OAAO,IAAI,IAAI,IAAI,EAAE;AACpD,QAAM,KAAK,GAAG,GAAG,IAAI,UAAU,OAAO,IAAI,IAAI,IAAI,EAAE;AACpD,SAAO,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG;AAC5C;AA4EA,SAAS,MAAM,IAAIC,OAAM,OAAO,KAAK,KAAK;AACtC,EAAAC,QAAO,OAAOC,aAAY,OAAO;AACjC,EAAAD,QAAO,GAAG;AACV,QAAM,UAAU,IAAI,QAAQ,GAAG;AAC/B,QAAME,OAAM;AACZ,QAAM,MAAM,IAAIA,IAAG;AACnB,QAAM,OAAOC,YAAWD,IAAG;AAC3B,QAAM,QAAQ,IAAI,GAAG;AACrB,QAAM,QAAQ,IAAI,GAAG;AAGrB,QAAM,SAASH,QAAO,IAAI;AAC1B,QAAM,SAAS,IAAI;AACnB,MAAI,SAAS,KAAK,UAAU,QAAQA,KAAI;AAExC,WAAS,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KAAK,GAAG;AAC3C,UAAM,EAAE,IAAI,IAAI,IAAI,GAAG,IAAI,QAAQ,IAAI,UAAU,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,CAAC,CAAC,CAAC;AACjH,UAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,UAAU,EAAE;AAC1C,UAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,UAAU,EAAE;AAC1C,UAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,UAAU,EAAE;AAC1C,UAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,UAAU,EAAE;AAC1C,aAAU,SAAS,MAAO;AAC1B,SAAK,UAAU,QAAQ,QAAQA,KAAI;AAAA,EACvC;AAEA,QAAM,QAAQE,cAAa,KAAK,MAAM,MAAM,SAAS,YAAY;AACjE,MAAI,QAAQ,QAAQ;AAChB,UAAM,EAAE,IAAI,IAAI,IAAI,GAAG,IAAI,QAAQ,IAAI,UAAU,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,CAAC,CAAC,GAAG,UAAU,IAAI,CAAC,CAAC,CAAC;AACjH,UAAM,MAAM,IAAI,YAAY,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;AAC5C,eAAW,GAAG;AACd,UAAM,MAAM,GAAG,GAAG;AAClB,aAAS,IAAI,OAAO,MAAM,GAAG,IAAI,QAAQ,KAAK;AAC1C,UAAI,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,GAAG;AAC7B,IAAAG,OAAM,GAAG;AAAA,EACb;AAGA,SAAO;AACX;AA6YA,SAAS,WAAW,IAAIC,OAAMC,MAAK,MAAM,KAAK;AAC1C,QAAM,YAAY,MAAM,IAAI,SAAS;AACrC,QAAM,IAAI,GAAG,OAAOA,MAAK,KAAK,SAAS,SAAS;AAChD,MAAI;AACA,MAAE,OAAO,GAAG;AAGhB,QAAM,MAAM,WAAW,IAAI,KAAK,QAAQ,IAAI,WAAWD,KAAI;AAC3D,IAAE,OAAO,IAAI;AACb,IAAE,OAAO,GAAG;AACZ,QAAM,MAAM,EAAE,OAAO;AACrB,EAAAE,OAAM,GAAG;AACT,SAAO;AACX;AAwBO,IAAM,MAAsB,2BAAW,EAAE,WAAW,IAAI,aAAa,IAAI,WAAW,IAAI,SAAS,MAAM,cAAc,KAAK,GAAG,SAAS,OAAOD,MAAK,OAAO,KAAK;AAIjK,MAAI,MAAM,SAAS;AACf,UAAM,IAAI,MAAM,+BAA+B;AACnD,QAAM,YAAY;AAClB,WAAS,YAAY,SAAS,SAAS,MAAM;AACzC,UAAM,MAAM,WAAWE,QAAO,OAAO,SAAS,MAAM,GAAG;AACvD,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ;AAChC,UAAI,CAAC,KAAK,QAAQ,CAAC;AACvB,WAAO;AAAA,EACX;AACA,WAASC,cAAa;AAClB,UAAM,KAAK,YAAYH,IAAG;AAC1B,UAAM,UAAU,YAAY,MAAM;AAClC,UAAM,UAAU,YAAY,MAAM;AAClC,UAAM,IAAI,OAAO,SAAS,SAAS,OAAO;AAE1C,QAAI,MAAM,WAAW,IAAI;AACrB,cAAQ,IAAI,KAAK;AAAA,IACrB,OACK;AACD,YAAM,WAAW,YAAY,MAAM;AACnC,YAAM,OAAOI,YAAW,QAAQ;AAChC,WAAK,aAAa,GAAG,OAAO,MAAM,SAAS,CAAC,GAAG,KAAK;AAKpD,YAAM,IAAIF,OAAM,OAAO,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO,QAAQ;AAC7D,QAAE,WAAW,OAAO;AACpB,QAAE,QAAQ;AAAA,IACd;AAGA,UAAM,UAAU,MAAM,IAAI,OAAO,SAAS,WAAW;AACrD,WAAO,EAAE,IAAI,SAAS,SAAS,QAAQ;AAAA,EAC3C;AACA,SAAO;AAAA,IACH,QAAQ,WAAW;AACf,YAAM,EAAE,IAAI,SAAS,SAAS,QAAQ,IAAIC,YAAW;AACrD,YAAM,MAAM,IAAI,WAAW,UAAU,SAAS,SAAS;AACvD,YAAM,UAAU,CAAC,IAAI,SAAS,SAAS,OAAO;AAC9C,UAAI,CAAC,YAAY,SAAS;AACtB,gBAAQ,KAAM,YAAYE,WAAU,SAAS,CAAE;AACnD,YAAM,IAAI,OAAO,SAAS,WAAW,IAAI,SAAS,GAAG,UAAU,MAAM,CAAC;AACtE,YAAM,MAAM,YAAY,SAAS,SAAS,IAAI,SAAS,GAAG,IAAI,SAAS,SAAS,CAAC;AACjF,cAAQ,KAAK,GAAG;AAChB,UAAI,IAAI,KAAK,UAAU,MAAM;AAC7B,MAAAJ,OAAM,GAAG,OAAO;AAChB,aAAO;AAAA,IACX;AAAA,IACA,QAAQ,YAAY;AAChB,YAAM,EAAE,IAAI,SAAS,SAAS,QAAQ,IAAIE,YAAW;AACrD,YAAM,UAAU,CAAC,IAAI,SAAS,SAAS,OAAO;AAC9C,UAAI,CAAC,YAAY,UAAU;AACvB,gBAAQ,KAAM,aAAaE,WAAU,UAAU,CAAE;AACrD,YAAM,OAAO,WAAW,SAAS,GAAG,CAAC,SAAS;AAC9C,YAAM,YAAY,WAAW,SAAS,CAAC,SAAS;AAChD,YAAM,MAAM,YAAY,SAAS,SAAS,IAAI;AAC9C,cAAQ,KAAK,GAAG;AAGhB,UAAI,CAAC,WAAW,KAAK,SAAS,GAAG;AAC7B,QAAAJ,OAAM,GAAG,OAAO;AAChB,cAAM,IAAI,MAAM,sBAAsB;AAAA,MAC1C;AACA,YAAM,MAAM,MAAM,IAAI,OAAO,SAAS,IAAI;AAC1C,MAAAA,OAAM,GAAG,OAAO;AAChB,aAAO;AAAA,IACX;AAAA,EACJ;AACJ,CAAC;;;AC/0BD,IAAM,iBAAiB;AACvB,IAAM,iBAAiB;AACvB,IAAM,YAAY;AAClB,IAAM,cAAc;AACpB,IAAM,aAAa,IAAI,iBAAiB;AAMjC,IAAM,cAAc;AAAA,EACzB,UAAU;AAAA,EACV,SAAS;AAAA,EACT,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,KAAK;AACP;AAGA,SAAS,UACP,aACA,WACA,QACY;AAEZ,QAAM,UAAU,YAAY,MAAM,CAAC;AACnC,SAAO,KAAK,QAAQ,SAAS,WAAW,IAAI,YAAY,EAAE,OAAO,MAAM,GAAG,EAAE;AAC9E;AAEA,SAAS,aAAa,KAAqB;AACzC,SAAO,IAAI,KAAK,EAAE,QAAQ,QAAQ,EAAE,EAAE,YAAY;AACpD;AAMO,SAAS,cACd,WACA,cACA,KACA,SAAsB,YAAY,KACtB;AACZ,QAAM,YAAYK,YAAW,aAAa,YAAY,CAAC;AACvD,MAAI,UAAU,WAAW,gBAAgB;AACvC,UAAM,IAAI;AAAA,MACR,oCAAoC,cAAc,sCAAsC,UAAU,MAAM;AAAA,IAC1G;AAAA,EACF;AAEA,QAAM,aAAa,UAAU,MAAM,gBAAgB;AACnD,QAAM,YAAY,UAAU,aAAa,YAAY,IAAI;AACzD,QAAMC,OAAM,UAAU,UAAU,gBAAgB,YAAY,WAAW,IAAI,GAAG,WAAW,MAAM;AAE/F,QAAM,QAAQ,IAAI,WAAW,SAAS;AACtC,SAAO,gBAAgB,KAAK;AAE5B,QAAM,WAAW,IAAI,YAAY,EAAE,OAAO,GAAG,MAAM,IAAI,GAAG,EAAE;AAC5D,QAAM,SAAS,IAAIA,MAAK,OAAO,QAAQ,EAAE;AAAA,IACvC,IAAI,YAAY,EAAE,OAAO,SAAS;AAAA,EACpC;AAEA,QAAM,UAAU,IAAI,WAAW,aAAa,OAAO,MAAM;AACzD,UAAQ,CAAC,IAAI;AACb,UAAQ,IAAI,WAAW,CAAC;AACxB,UAAQ,IAAI,OAAO,IAAI,cAAc;AACrC,UAAQ,IAAI,QAAQ,UAAU;AAE9B,SAAO;AACT;AAMO,SAAS,cACd,SACA,eACA,KACA,SAAsB,YAAY,KAC1B;AACR,MAAI,QAAQ,SAAS,aAAa,aAAa;AAC7C,UAAM,IAAI,MAAM,wCAAwC;AAAA,EAC1D;AAEA,QAAMC,WAAU,QAAQ,CAAC;AACzB,MAAIA,aAAY,gBAAgB;AAC9B,UAAM,IAAI;AAAA,MACR,0CAA0CA,QAAO,cAAc,cAAc;AAAA,IAC/E;AAAA,EACF;AAEA,QAAM,YAAY,QAAQ,SAAS,GAAG,IAAI,cAAc;AACxD,QAAM,QAAQ,QAAQ,SAAS,IAAI,gBAAgB,UAAU;AAC7D,QAAM,SAAS,QAAQ,SAAS,UAAU;AAE1C,QAAM,aAAaF,YAAW,aAAa,aAAa,CAAC;AACzD,QAAMC,OAAM,UAAU,UAAU,gBAAgB,YAAY,WAAW,IAAI,GAAG,WAAW,MAAM;AAE/F,QAAM,WAAW,IAAI,YAAY,EAAE,OAAO,GAAG,MAAM,IAAI,GAAG,EAAE;AAC5D,QAAM,SAAS,IAAIA,MAAK,OAAO,QAAQ,EAAE,QAAQ,MAAM;AACvD,SAAO,IAAI,YAAY,EAAE,OAAO,MAAM;AACxC;AAGO,SAAS,gBAAgB,qBAAqC;AACnE,SAAO,aAAa,sBAAsB;AAC5C;;;AC9HA,IAAM,SAAS;AACf,IAAM,YAAY;AAWlB,SAAS,SAAS,OAA2B;AAC3C,MAAI,SAAS;AACb,aAAW,KAAK,MAAO,WAAU,OAAO,aAAa,CAAC;AACtD,SAAO,KAAK,MAAM;AACpB;AAEA,SAAS,WAAW,MAA0B;AAC5C,QAAM,SAAS,KAAK,IAAI;AACxB,QAAM,MAAM,IAAI,WAAW,OAAO,MAAM;AACxC,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,KAAI,CAAC,IAAI,OAAO,WAAW,CAAC;AACpE,SAAO;AACT;AAEO,SAAS,aACd,SACA,iBAAiB,IACjB,YAAY,IACJ;AACR,SAAO,CAAC,QAAQ,gBAAgB,WAAW,SAAS,OAAO,CAAC,EAAE,KAAK,SAAS;AAC9E;AAEA,SAAS,aAAa,OAAe,UAA2B;AAC9D,SAAO,MAAM,WAAW,IACpB,OACA,MAAM,WAAW,YAAY,cAAc,KAAK,KAAK;AAC3D;AAMO,SAAS,WAAW,OAAwB;AACjD,MAAI,OAAO,UAAU,YAAY,CAAC,MAAM,WAAW,SAAS,SAAS,EAAG,QAAO;AAC/E,QAAM,QAAQ,MAAM,MAAM,SAAS;AACnC,SAAO,MAAM,UAAU,KAAK,aAAa,MAAM,CAAC,GAAG,EAAE,KAAK,aAAa,MAAM,CAAC,GAAG,EAAE;AACrF;AAGO,SAAS,cAAc,OAAgC;AAC5D,MAAI,CAAC,WAAW,KAAK,EAAG,QAAO;AAC/B,QAAM,CAAC,EAAE,gBAAgB,WAAW,GAAG,IAAI,IAAI,MAAM,MAAM,SAAS;AACpE,MAAI;AACF,WAAO,EAAE,gBAAgB,WAAW,SAAS,WAAW,KAAK,KAAK,SAAS,CAAC,EAAE;AAAA,EAChF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,iBAAiB,WAA2B;AAC1D,SAAO,UAAU,KAAK,EAAE,QAAQ,QAAQ,EAAE,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AACvE;;;ACxDA,IAAM,EAAE,QAAQ,YAAY,KAAKE,OAAM,IAAI;AAI3C,IAAMC,uBAAsB;AAQrB,SAAS,aACd,UACA,QACA,SACA,cACQ;AACR,QAAM,YAAY,KAAK,UAAU;AAAA,IAC/B,SAAS,KAAK;AAAA,IACd,uBAAuB,MAAM;AAAA,IAC7B,QAAQ,KAAK;AAAA,IACb,aAAa,KAAK;AAAA,EACpB,CAAC;AACD,SAAOC,YAAW,OAAO,IAAI,YAAY,EAAE,OAAO,SAAS,CAAC,CAAC;AAC/D;AAGO,SAAS,UAAU,YAAoB,QAAwB;AACpE,SAAO,GAAG,UAAU,IAAI,MAAM;AAChC;AAOO,SAAS,uBAAuB,QAAwB;AAE7D,WAAS,OAAO,KAAK;AACrB,MAAI;AACF,UAAM,SAAkB,KAAK,MAAM,MAAM;AACzC,QAAI,UAAU,OAAO,WAAW,YAAY,UAAU,QAAQ;AAC5D,YAAMC,OAAM;AACZ,YAAM,cAAc;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,YAAY,KAAK,CAAC,MAAM,KAAKA,IAAG,GAAG;AACrC,eAAO,KAAK,UAAU,EAAE,WAAWA,KAAI,WAAW,MAAMA,KAAI,KAAK,CAAC;AAAA,MACpE;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAOA,SAAS,gBACP,QACA,MACA,YACA,kBACQ;AACR,QAAMC,QAAOC,YAAW,WAAW,KAAK,EAAE,QAAQ,QAAQ,EAAE,EAAE,YAAY,CAAC;AAC3E,MAAID,MAAK,WAAW,IAAI;AACtB,UAAM,IAAI,MAAM,qBAAqB;AAAA,EACvC;AACA,QAAM,WAAWC;AAAA,IACf,iBAAiB,KAAK,EAAE,QAAQ,QAAQ,EAAE,EAAE,YAAY;AAAA,EAC1D;AACA,MAAI,SAAS,WAAW,IAAI;AAC1B,UAAM,IAAI,MAAM,oDAA+C;AAAA,EACjE;AAEA,QAAMC,OAAM,UAAU,aAAaF,OAAM,IAAI;AAC7C,QAAM,cAAc,KAAK;AAAA,IAAI,CAAC,MAC5B,OAAO,MAAM,WAAW,IAAI,WAAW,KAAK,CAAC;AAAA,EAC/C;AAEA,MAAI,IAAIJ,OAAM,SAAS,WAAW,KAAK,QAAQ,CAAC;AAChD,MAAIA,OAAM,oBAAoB,QAAQ,aAAa,CAAC;AACpD,EAAAA,OAAM,eAAe,WAAW,KAAKM,IAAG,GAAG,CAAC;AAG5C,QAAMC,UAASP,OAAM,gBAAgB,GAAGC,oBAAmB;AAC3D,QAAMO,aAAY,UAAU,KAAKD,SAAQH,OAAM,EAAE,SAAS,MAAM,CAAC;AACjE,MAAIJ,OAAM,aAAa,WAAW,KAAKM,IAAG,GAAG,WAAW,KAAKE,UAAS,GAAG,CAAC;AAE1E,SAAOR,OAAM,UAAU,CAAC,EAAE,SAAS,KAAK;AAC1C;AAGO,SAAS,sBACd,YACA,QACA,SACA,UACA,cACA,qBACA,YACA,kBACQ;AACR,QAAM,cAAc,iBAAiB,mBAAmB;AACxD,QAAM,OAAO,CAAC,MAAc,WAC1B,SAAS,KACL,KACA;AAAA,IACE;AAAA,MACE;AAAA,MACA;AAAA,MACA,UAAU,YAAY,MAAM;AAAA,MAC5B,YAAY;AAAA,IACd;AAAA,IACA;AAAA,EACF;AAGN,QAAM,eAAe;AAAA,IACnB;AAAA,MACE;AAAA,MACA;AAAA,MACA,UAAU,YAAY,QAAQ;AAAA,MAC9B,YAAY;AAAA,IACd;AAAA,IACA;AAAA,IACA,aAAa,UAAU,QAAQ,SAAS,YAAY;AAAA,EACtD;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,MACE;AAAA,MACA;AAAA,MACA,KAAK,SAAS,SAAS;AAAA,MACvB;AAAA,MACA,KAAK,cAAc,WAAW;AAAA,IAChC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AC/HO,SAAS,yBAA8C;AAC5D,SAAO,oBAAI,IAAI;AAAA,IACb;AAAA,IACA;AAAA,IACA,IAAI,IAAI,gBAAgB,EAAE,SAAS,YAAY;AAAA,EACjD,CAAC;AACH;AAEA,IAAM,sBAA2C,uBAAuB;AAEjE,SAAS,sBACd,OACmB;AACnB,QAAM,SACJ,OAAO,WAAW,gBAAgB,gBAAgB;AACpD,QAAM,YAAY,OAAO,UAAU,KAAK,KAAK;AAE7C,MAAI;AACJ,MAAI;AACF,aAAS,IAAI,IAAI,SAAS;AAAA,EAC5B,QAAQ;AACN,UAAM,IAAI;AAAA,MACR,wCAAwC,SAAS,wEACkB,gBAAgB;AAAA,IACrF;AAAA,EACF;AAMA,QAAM,aACJ,OAAO,aAAa,YACnB,OAAO,aAAa,eACnB,OAAO,aAAa,eACpB,OAAO,aAAa,WACpB,OAAO,aAAa;AACxB,MAAI,OAAO,aAAa,YAAY,CAAC,YAAY;AAC/C,UAAM,IAAI;AAAA,MACR,mDAAmD,OAAO,QAAQ;AAAA,IAEpE;AAAA,EACF;AAEA,MAAI,OAAO,YAAY,OAAO,UAAU;AACtC,UAAM,IAAI;AAAA,MACR;AAAA,IAEF;AAAA,EACF;AAEA,QAAM,gBAAgB,OAAO;AAE7B,MAAI,WAAW,eAAe;AAC5B,UAAM,eAAgB,OAClB;AACJ,UAAMS,OAAM,cAAc,KAAK,EAAE,YAAY;AAC7C,QAAI,CAACA,QAAO,CAAC,iBAAiB,KAAKA,IAAG,GAAG;AACvC,YAAM,IAAI;AAAA,QACR;AAAA,MAIF;AAAA,IACF;AACA,WAAO,EAAE,KAAK,eAAe,QAAQ,cAAcA,KAAI;AAAA,EACzD;AAKA,MAAI,CAAC,cAAc,CAAC,oBAAoB,IAAI,OAAO,SAAS,YAAY,CAAC,GAAG;AAC1E,UAAM,IAAI;AAAA,MACR,qCAAqC,OAAO,QAAQ,+CACtC,CAAC,GAAG,mBAAmB,EAAE,KAAK,IAAI,CAAC;AAAA,IAInD;AAAA,EACF;AAEA,SAAO,EAAE,KAAK,eAAe,QAAQ,cAAc,KAAK;AAC1D;;;AC3GO,IAAM,iBAAN,cAA6B,MAAM;AAAA;AAAA,EAE/B;AAAA;AAAA,EAEA;AAAA,EAET,YACE,QACA,MACA,aAAa,IACb,WAAmB,kBACnB;AACA,UAAM,OAAO,QAAQ,MAAM,YAAY,QAAQ,CAAC;AAChD,SAAK,OAAO;AACZ,SAAK,SAAS;AACd,SAAK,OAAO;AAAA,EACd;AACF;AAEO,IAAM,6BAAN,cAAyC,MAAM;AAAA,EACpD,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAGA,SAAS,OACP,QACA,MACA,YACA,UACQ;AACR,QAAM,YAAY,SAAS,QAAQ,QAAQ,EAAE,KAAK;AAClD,MAAI,MAAM,aAAa,MAAM,KAAK,QAAQ,UAAU;AACpD,QAAM,UAAU,KAAK,YAAY;AACjC,MAAI,QAAQ,SAAS,sBAAsB,GAAG;AAC5C,WAAO;AAAA,gCAA8B,SAAS;AAAA,EAChD,WACE,QAAQ,SAAS,qBAAqB,KACtC,QAAQ,SAAS,sBAAsB,GACvC;AACA,WAAO;AAAA,8BAA4B,SAAS;AAAA,EAC9C,WACE,QAAQ,SAAS,iBAAiB,KAClC,QAAQ,SAAS,QAAQ,GACzB;AACA,WAAO;AAAA,+BAA6B,SAAS;AAAA,EAC/C,WACE,QAAQ,SAAS,YAAY,KAC7B,QAAQ,SAAS,kBAAkB,KACnC,QAAQ,SAAS,uBAAuB,GACxC;AACA,WAAO;AAAA,mCAAiC,SAAS;AAAA,EACnD,WAAW,UAAU,OAAO,SAAS,KAAK;AACxC,WAAO;AAAA,sBAAoB,SAAS;AAAA,EACtC;AACA,SAAO;AACT;;;ACrDO,IAAM,aAAN,MAAiB;AAAA,EACb;AAAA,EACA;AAAA,EAET,YAAY,SAAiB,WAAmB;AAC9C,SAAK,UAAU,QAAQ,QAAQ,QAAQ,EAAE;AACzC,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,SAASC,OAAc,OAA4C;AACjE,UAAM,MAAM,IAAI,IAAI,KAAK,UAAUA,KAAI;AACvC,QAAI,OAAO;AACT,iBAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,GAAG;AAC1C,YAAI,MAAM,UAAa,MAAM,QAAQ,MAAM,IAAI;AAC7C,cAAI,aAAa,IAAI,GAAG,OAAO,CAAC,CAAC;AAAA,QACnC;AAAA,MACF;AAAA,IACF;AACA,WAAO,IAAI,SAAS;AAAA,EACtB;AAAA,EAEA,MAAM,IACJA,OACA,OACA,SACmB;AACnB,WAAO,KAAK,MAAM,KAAK,SAASA,OAAM,KAAK,GAAG;AAAA,MAC5C,QAAQ;AAAA,MACR,GAAI,WAAW,EAAE,QAAQ;AAAA,IAC3B,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,KACJA,OACA,MACA,SACmB;AACnB,WAAO,KAAK,MAAM,KAAK,SAASA,KAAI,GAAG;AAAA,MACrC,QAAQ;AAAA,MACR,SAAS,EAAE,gBAAgB,oBAAoB,GAAG,QAAQ;AAAA,MAC1D,MAAM,KAAK,UAAU,IAAI;AAAA,IAC3B,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,MAAM,KAAaC,OAAsC;AACrE,WAAO,MAAM,KAAK,EAAE,GAAGA,OAAM,QAAQ,YAAY,QAAQ,KAAK,SAAS,EAAE,CAAC;AAAA,EAC5E;AACF;;;ACpDA,IAAM,gBACJ;AAEK,SAAS,eAAe,QAAyB;AACtD,QAAM,IAAI,MAAM,aAAa;AAC/B;AAEO,SAAS,kBAAkB,UAA8B;AAC9D,QAAM,IAAI,MAAM,aAAa;AAC/B;;;ACfO,SAAS,iBAAiBC,MAAuB;AACtD,MAAIA,SAAQ,QAAQA,SAAQ,OAAW,QAAO;AAC9C,QAAM,IAAI,OAAOA,IAAG,EAAE,YAAY;AAClC,MAAI,MAAM,WAAW,MAAM,QAAS,QAAO;AAC3C,MAAI,MAAM,UAAU,MAAM,SAAU,QAAO;AAC3C,MAAI,MAAM,WAAW,MAAM,MAAO,QAAO;AACzC,SAAO;AACT;AAEO,SAAS,gBAAgBA,MAA6B;AAC3D,QAAMC,KAAI,OAAOD,QAAO,EAAE,EAAE,YAAY;AACxC,MAAIC,OAAM,aAAaA,OAAM,cAAcA,OAAM,QAAS,QAAOA;AACjE,SAAO;AACT;AAGO,SAAS,YAAY,KAAsB;AAChD,MAAI,CAAC,IAAK,QAAO;AACjB,MAAI,OAAO,QAAQ,SAAU,QAAO;AACpC,MAAI,eAAe,WAAY,QAAO,OAAO,KAAK,GAAG,EAAE,SAAS,KAAK;AACrE,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,OAAQ,IAA2B;AACzC,QAAI,MAAM,QAAQ,IAAI,EAAG,QAAO,OAAO,KAAK,IAAI,EAAE,SAAS,KAAK;AAAA,EAClE;AACA,SAAO;AACT;;;ACDO,SAAS,eAAe,SAAgC;AAAC;AAEzD,SAAS,WACd,eACA,SACA,cACM;AAAC;AAEF,SAAS,eACd,eACA,aACA,SACA,SACM;AAAC;AAET,eAAsB,iBAAgC;AAAC;AAEvD,eAAsB,oBAAmC;AAAC;;;AC5B1D,IAAMC,iBACJ;AAEK,SAAS,eAAuB;AACrC,QAAM,IAAI,MAAMA,cAAa;AAC/B;AAEO,SAAS,gBAAwB;AACtC,QAAM,IAAI,MAAMA,cAAa;AAC/B;AAEO,SAAS,iBAAmC;AACjD,SAAO,CAAC;AACV;AAEO,SAAS,eAAe,GAA2B;AACxD,QAAM,IAAI,MAAMA,cAAa;AAC/B;AAOO,SAAS,QACd,MACA,WACQ;AACR,SAAO,aAAa;AACtB;;;ACUA,SAAS,qBAA6B;AACpC,SAAO,MAAM,KAAK,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC;AACzC;AAEO,IAAM,SAAN,MAAM,QAAO;AAAA,EACT;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA;AAAA,EAEA;AAAA;AAAA,EAEA;AAAA;AAAA,EAEA;AAAA;AAAA,EAGD,mBAAkC;AAAA,EACzB;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,oBAAI,IAAyB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMpD,cAAwD;AAAA,EAEhE,YAAY,SAAiB,UAAyB,CAAC,GAAG;AACxD,SAAK,OAAO,OAAO,UAAU,OAAO;AACpC,SAAK,YACF,QAAQ,YAAY,kBAAkB,QAAQ,QAAQ,EAAE,KACzD;AACF,SAAK,WAAW,QAAQ,WACpB,CAAC,GAAG,QAAQ,QAAQ,IACpB;AACJ,SAAK,gBAAgB,QAAQ,iBAAiB,OAAO;AACrD,SAAK,UAAU,QAAQ;AACvB,SAAK,eAAe,QAAQ;AAC5B,SAAK,sBAAsB,QAAQ;AACnC,SAAK,aAAa,QAAQ,eAAe;AACzC,SAAK,SAAS,QAAQ,UAAU,CAAC;AACjC,SAAK,OAAO,IAAI,WAAW,KAAK,UAAU,QAAQ,aAAa,GAAM;AAErE,QAAI,KAAK,aAAa,kBAAkB;AACtC,WAAK,OAAO,OAAO,kDAAkD;AAAA,QACnE,UAAU,KAAK;AAAA,QACf,WAAW,KAAK,eACZ,8CACA;AAAA,MACN,CAAC;AAAA,IACH;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,OAAO,WAAW,UAA6B,CAAC,GAAW;AACzD,UAAM,YAAY;AAAA,MAChB,QAAQ,SAAS,EAAE,UAAU,QAAQ,eAAe,KAAK,OAAU;AAAA,IACrE;AAEA,UAAM,WAAW,QAAQ,YAAY,QAAQ,QAAQ;AACrD,UAAM,OAAkB,WACpB,OAAO,UAAU,QAAQ,IACzB,kBAAkB,QAAQ,OAAO;AAErC,UAAM,gBACJ,QAAQ,iBAAiB,QAAQ,aAAa,KAAK;AAErD,WAAO,IAAI,QAAO,KAAK,SAAS;AAAA,MAC9B,UAAU,UAAU;AAAA,MACpB;AAAA,MACA,WAAW,QAAQ;AAAA,MACnB,UAAU,QAAQ;AAAA,MAClB,SAAS,QAAQ;AAAA,MACjB,cAAc,UAAU,gBAAgB;AAAA,MACxC,YAAY,QAAQ;AAAA,MACpB,QAAQ,QAAQ;AAAA,IAClB,CAAC;AAAA,EACH;AAAA,EAEA,IAAI,SAAiB;AACnB,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA,EAEA,IAAI,UAAkB;AACpB,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,iBACJ,QACA,MACkB;AAClB,UAAM,KAAK,UAAU,KAAK,KAAK;AAC/B,WAAO,KAAK,MAAM,oBAAoB,IAAI,YAAY;AACpD,YAAM,QAAgC,EAAE,QAAQ,GAAG;AACnD,UAAI,MAAM,QAAS,OAAM,UAAU,KAAK;AACxC,YAAM,OAAO,MAAM,KAAK,KAAK;AAAA,QAC3B;AAAA,QACA;AAAA,QACA,KAAK,YAAY;AAAA,MACnB;AACA,YAAM,KAAK,aAAa,IAAI;AAC5B,YAAM,OAAQ,MAAM,KAAK,KAAK,IAAI;AAIlC,UAAI,OAAO,KAAK,KAAK,QAAQ;AAC3B,cAAMC,OAAM,MAAM;AAClB,aAAK,mBAAmB,OAAOA,SAAQ,YAAYA,OAAMA,OAAM;AAAA,MACjE;AACA,aAAO,QAAQ,MAAM,UAAU;AAAA,IACjC,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,YACJ,QACA,UAAU,IACV,UAA8B,CAAC,GACH;AAC5B,UAAM,QAAQ,YAAY,IAAI;AAC9B,eAAW,eAAe,QAAW,KAAK,KAAK,MAAM;AAErD,QAAI;AACJ,QAAI;AACF,eAAS,MAAM,KAAK,iBAAiB,KAAK,KAAK,QAAQ;AAAA,QACrD,SAAS,QAAQ,WAAW;AAAA,MAC9B,CAAC;AAAA,IACH,SAAS,KAAK;AACZ,qBAAe,eAAe,YAAY,IAAI,IAAI,OAAO,OAAO;AAChE,aAAO,EAAE,SAAS,OAAO,YAAY,MAAM,OAAO,aAAa,GAAG,EAAE;AAAA,IACtE;AACA,QAAI,CAAC,QAAQ;AACX,qBAAe,eAAe,YAAY,IAAI,IAAI,OAAO,OAAO;AAChE,aAAO;AAAA,QACL,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,OACE;AAAA,MAEJ;AAAA,IACF;AAEA,UAAM,aAAa,mBAAmB;AAMtC,UAAM,OAAO,KAAK,kBAAkB,QAAQ,SAAS;AAIrD,UAAM,SACJ,QAAQ,uBAAuB,KAAK,uBAAuB,KAAK;AAClE,QAAI;AACF,YAAM,YAAY,SACd;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ,YAAY;AAAA,QACpB,QAAQ,gBAAgB;AAAA,QACxB;AAAA,QACA,KAAK,KAAK;AAAA,QACV;AAAA,MACF,IACA,OAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ,YAAY;AAAA,QACpB,QAAQ,gBAAgB;AAAA,QACxB,KAAK,KAAK;AAAA,QACV;AAAA,MACF;AACJ,qBAAe,eAAe,YAAY,IAAI,IAAI,OAAO,SAAS;AAClE,aAAO,EAAE,SAAS,MAAM,YAAY,UAAU;AAAA,IAChD,SAAS,KAAK;AACZ,qBAAe,eAAe,YAAY,IAAI,IAAI,OAAO,OAAO;AAChE,aAAO,EAAE,SAAS,OAAO,YAAY,MAAM,OAAO,aAAa,GAAG,EAAE;AAAA,IACtE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,YACJ,QACA,UAAU,IACV,UAAwB,CAAC,GACH;AACtB,WAAO,KAAK;AAAA,MAAM;AAAA,MAAe,KAAK,KAAK;AAAA,MAAQ,MACjD,KAAK,aAAa,QAAQ,SAAS,OAAO;AAAA,IAC5C;AAAA,EACF;AAAA,EAEA,MAAc,aACZ,QACA,SACA,SACsB;AACtB,QAAI,CAAC,QAAQ,KAAK,GAAG;AACnB,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC3D;AAOA,QAAI,YAAmC,QAAQ;AAC/C,QAAI,QAAQ,SAAS;AACnB,YAAM,aAAa,MAAM,KAAK,uBAAuB,QAAQ,OAAO;AACpE,UAAI,YAAY;AACd,oBAAY,EAAE,SAAS,WAAW;AAAA,MACpC,WAAW,CAAC,WAAW,eAAe;AAGpC,cAAM,WAAW,MAAM,KAAK,oBAAoB,QAAQ,SAAS,IAAI;AACrE,oBAAY,EAAE,GAAG,WAAW,SAAS,SAAS,QAAQ;AAAA,MACxD;AAAA,IACF;AACA,UAAM,OAAO,KAAK,kBAAkB,SAAS;AAE7C,UAAM,YAAY,MAAM,KAAK,YAAY,QAAQ,SAAS;AAAA,MACxD,UAAU,QAAQ;AAAA,MAClB,cAAc,QAAQ;AAAA,MACtB;AAAA,IACF,CAAC;AACD,QAAI,CAAC,UAAU,WAAW,CAAC,UAAU,cAAc,CAAC,UAAU,WAAW;AACvE,YAAM,IAAI,MAAM,UAAU,SAAS,8BAA8B;AAAA,IACnE;AAEA,QAAI;AACJ,QAAI,CAAC,QAAQ,UAAU;AACrB,YAAM,aAAa,mBAAmB;AACtC,0BAAoB,OAAO;AAAA,QACzB;AAAA,QACA;AAAA,QACA,WAAW;AAAA,QACX;AAAA,QACA,KAAK,KAAK;AAAA,QACV;AAAA,MACF;AAAA,IACF;AAEA,UAAM,OAAyB;AAAA,MAC7B,cAAc,UAAU;AAAA,MACxB,cAAc,KAAK,KAAK;AAAA,MACxB;AAAA,MACA,sBAAsB,UAAU;AAAA,IAClC;AACA,QAAI,kBAAmB,MAAK,sBAAsB;AAClD,QAAI,QAAS,MAAK,UAAU;AAC5B,QAAI,QAAQ,SAAU,MAAK,WAAW,QAAQ;AAC9C,QAAI,QAAQ,SAAU,MAAK,YAAY,QAAQ;AAC/C,QAAI,QAAQ,aAAc,MAAK,iBAAiB,QAAQ;AACxD,QAAI,QAAQ,MAAO,MAAK,QAAQ,QAAQ;AAGxC,QAAI,QAAQ,SAAU,MAAK,WAAW,QAAQ;AAC9C,QAAI,QAAQ,KAAM,MAAK,OAAO,QAAQ;AAEtC,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,KAAK,KAAK,iBAAiB,IAAI;AAAA,IACnD,SAAS,KAAK;AACZ,YAAM,KAAK,eAAe,GAAG;AAAA,IAC/B;AACA,QAAI,CAAC,KAAK,GAAI,OAAM,MAAM,KAAK,UAAU,IAAI;AAI7C,UAAM,YAAY,OAAO,KAAK,MAAM,KAAK,YAAY,CAAC;AACtD,UAAM,eAAe,QAAQ,gBAAgB,KAAK;AAClD,QAAI,iBAAiB,QAAW;AAC9B,YAAM,MAAM,KAAK,QAAQ,IAAI,oBAAoB;AACjD,UAAI,CAAC,KAAK;AACR,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AACA,UAAI;AACJ,UAAI;AACF,aAAK,OAAO,gBAAgB,WAAW,KAAK,YAAY;AAAA,MAC1D,SAAS,KAAK;AACZ,cAAM,IAAI;AAAA,UACR,iCAAiC,aAAa,GAAG,CAAC;AAAA,QACpD;AAAA,MACF;AACA,UAAI,CAAC,IAAI;AACP,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,UAAM,OAAO,UAAU,SAAS;AAIhC,UAAM,WAAW,KAAK;AACtB,UAAM,QACJ,OAAO,aAAa,YAAY,OAAO,UAAU,QAAQ,KAAK,YAAY,KAAK,YAAY,KACvF,WACA;AACN,WAAO;AAAA,MACL,SAAS,iBAAiB,KAAK,OAAO;AAAA,MACtC,YAAY,OAAO,KAAK,eAAe,EAAE;AAAA,MACzC,QAAQ,OAAO,KAAK,UAAU,EAAE;AAAA,MAChC,YAAY,OAAO,KAAK,cAAc,CAAC;AAAA,MACvC,UAAU,OAAO,KAAK,YAAY,EAAE;AAAA,MACpC,WAAW,OAAO,KAAK,cAAc,CAAC;AAAA,MACtC,YAAY,OAAO,KAAK,gBAAgB,UAAU,UAAU;AAAA,MAC5D,SAAS,QAAQ,KAAK,QAAQ;AAAA,MAC9B,UAAU,QAAQ,KAAK,QAAQ;AAAA,MAC/B,iBAAiB,OAAO,KAAK,oBAAoB,EAAE;AAAA,MACnD,QAAQ,OAAO,KAAK,UAAU,EAAE;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,cAAc,OAAyC;AAC3D,UAAM,WAAW,MAAM,YAAY;AAInC,UAAM,gBAAgB,OAAO,cAAc,cAAc,MAAM,IAAI,CAAC;AACpE,UAAM,eAAe,OAAO,cAAc,MAAM,WAAW,QAAQ;AACnE,UAAM,WAAW,cAAc;AAC/B,UAAM,aAAa,SAAS,QAAQ;AACpC,UAAM,cAAc,aAAa;AACjC,UAAM,kBACJ,cAAc,MAAM,SAAS,aAAa,MAAM;AAClD,QAAI,kBAAkB,GAAG;AACvB,YAAM,QAAQ;AAAA,QACZ,GAAG,oBAAI,IAAI;AAAA,UACT,GAAG,cAAc,MAAM,IAAI,CAACC,OAAMA,GAAE,IAAI;AAAA,UACxC,GAAG,aAAa,MAAM,IAAI,CAACA,OAAMA,GAAE,IAAI;AAAA,QACzC,CAAC;AAAA,MACH;AACA,WAAK,OAAO,OAAO,+CAA+C;AAAA,QAChE,MAAM;AAAA,QACN,OAAO;AAAA,QACP;AAAA,MACF,CAAC;AAAA,IACH;AAEA,QAAI;AACF,WAAK,OAAO,OAAO,6BAA6B,EAAE,MAAM,SAAS,CAAC;AAClE,YAAM,SAAS,MAAM,KAAK,YAAY,YAAY,aAAa;AAAA,QAC7D;AAAA,QACA,cAAc;AAAA,QACd,SAAS,KAAK;AAAA;AAAA,QAEd,UAAU,MAAM;AAAA,MAClB,CAAC;AAUD,UAAI,OAAO,YAAY,cAAc;AACnC,YAAI,OAAO,WAAW,UAAU;AAC9B,iBAAO,KAAK;AAAA,YACV,mEACE,OAAO,UAAU,QACnB;AAAA,YACA,OAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO;AAAA,UACL,OAAO;AAAA,UACP,SAAS;AAAA,UACT,QACE,OAAO,UACP;AAAA,UACF,YAAY,OAAO;AAAA,QACrB;AAAA,MACF;AAEA,YAAM,SAAS,OAAO;AACtB,UAAI,WAAW,SAAS;AACtB,eAAO;AAAA,UACL,OAAO;AAAA,UACP,SAAS;AAAA,UACT,QAAQ,OAAO;AAAA,UACf,YAAY,OAAO;AAAA,QACrB;AAAA,MACF;AACA,UAAI,WAAW,yBAAyB;AACtC,eAAO;AAAA,UACL,OAAO;AAAA,UACP,SAAS;AAAA,UACT,QAAQ,OAAO,UAAU;AAAA,UACzB,YAAY,OAAO;AAAA,QACrB;AAAA,MACF;AACA,UAAI,WAAW,SAAS;AAGtB,YAAI,OAAO,YAAY,QAAQ;AAC7B,iBAAO;AAAA,YACL,OAAO;AAAA,YACP,SAAS;AAAA,YACT,QAAQ,OAAO;AAAA,YACf,YAAY,OAAO;AAAA,UACrB;AAAA,QACF;AACA,YAAI,OAAO,YAAY,SAAS;AAC9B,iBAAO;AAAA,YACL,OAAO;AAAA,YACP,SAAS;AAAA,YACT,QAAQ,OAAO;AAAA,YACf,YAAY,OAAO;AAAA,UACrB;AAAA,QACF;AACA,eAAO;AAAA,UACL,OAAO;AAAA,UACP,SAAS;AAAA,UACT,QAAQ,OAAO;AAAA,UACf,YAAY,OAAO;AAAA,QACrB;AAAA,MACF;AAEA,aAAO,KAAK;AAAA,QACV;AAAA,QACA,OAAO;AAAA,MACT;AAAA,IACF,SAAS,KAAK;AACZ,YAAM,UAAU,aAAa,GAAG;AAChC,WAAK,OAAO,OAAO,6BAA6B,EAAE,QAAQ,QAAQ,CAAC;AACnE,aAAO,KAAK,KAAK,OAAO;AAAA,IAC1B;AAAA,EACF;AAAA,EAEQ,KAAK,QAAgB,YAA+B;AAC1D,WAAO,EAAE,OAAO,CAAC,KAAK,YAAY,SAAS,SAAS,QAAQ,WAAW;AAAA,EACzE;AAAA;AAAA,EAIA,MAAM,kBACJ,YACA,aACyB;AACzB,UAAM,KAAK,eAAe,KAAK,KAAK;AACpC,WAAO,KAAK,MAAM,qBAAqB,IAAI,YAAY;AACrD,YAAM,OAAO,MAAM,KAAK,KAAK;AAAA,QAC3B;AAAA,QACA,EAAE,cAAc,YAAY,cAAc,GAAG;AAAA,QAC7C,KAAK,YAAY;AAAA,MACnB;AACA,YAAM,KAAK,aAAa,IAAI;AAC5B,YAAM,OAAS,MAAM,KAAK,KAAK,IAAI,KAAM,CAAC;AAC1C,aAAO;AAAA,QACL,QAAQ,gBAAgB,KAAK,MAAM;AAAA,QACnC,SAAS,iBAAiB,KAAK,OAAO;AAAA,QACtC,QAAQ,OAAO,KAAK,UAAU,EAAE;AAAA,QAChC,YAAY,OAAO,KAAK,cAAc,UAAU;AAAA,QAChD,SAAS,QAAQ,KAAK,OAAO;AAAA,QAC7B,QAAQ,QAAQ,KAAK,MAAM;AAAA,QAC3B,gBAAgB,UAAU,KAAK,cAAc;AAAA,MAC/C;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA,EAIA,aAAa,UAA6C;AACxD,WAAO,KAAK;AAAA,MAAM;AAAA,MAAgB;AAAA,MAAW,MAC3C,KAAK,kBAAkB,cAAc,EAAE,OAAO,SAAS,CAAC;AAAA,IAC1D;AAAA,EACF;AAAA,EAEA,gBACE,SACA,UAC2B;AAC3B,WAAO,KAAK;AAAA,MAAM;AAAA,MAAmB;AAAA,MAAW,MAC9C,KAAK,kBAAkB,kBAAkB;AAAA,QACvC,KAAK;AAAA,QACL,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,kBACE,aACA,UAC2B;AAC3B,WAAO,KAAK;AAAA,MAAM;AAAA,MAAqB;AAAA,MAAa,MAClD,KAAK,kBAAkB,oBAAoB;AAAA,QACzC,OAAO;AAAA,QACP,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,MAAM,mBAAoC;AACxC,WAAO,KAAK,MAAM,oBAAoB,QAAW,YAAY;AAC3D,YAAMC,OAAM,MAAM,KAAK,cAAc,mBAAmB,CAAC,CAAC;AAC1D,YAAM,IAAI,OAAOA,IAAG;AACpB,aAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAAA,IAClC,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,gBAAgB,YAAkD;AACtE,WAAO,KAAK,MAAM,mBAAmB,QAAW,YAAY;AAC1D,YAAMA,OAAM,MAAM,KAAK,cAAc,kBAAkB;AAAA,QACrD,cAAc;AAAA,MAChB,CAAC;AACD,UAAI,CAAC,SAASA,IAAG,EAAG,QAAO;AAC3B,aAAO,eAAeA,IAAG;AAAA,IAC3B,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,eAAe,SAA2C;AAC9D,WAAO,KAAK,MAAM,kBAAkB,QAAW,YAAY;AACzD,YAAMA,OAAM,MAAM,KAAK,cAAc,iBAAiB,EAAE,KAAK,QAAQ,CAAC;AACtE,UAAI,CAAC,SAASA,IAAG,EAAG,QAAO;AAC3B,aAAO;AAAA,QACL,SAAS,OAAOA,KAAI,YAAY,EAAE;AAAA,QAClC,MAAM,OAAOA,KAAI,QAAQ,EAAE;AAAA,QAC3B,gBAAgB,QAAQA,KAAI,eAAe;AAAA,QAC3C,oBAAoB,QAAQA,KAAI,mBAAmB;AAAA,MACrD;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,sBACJ,SACA,UACuB;AACvB,WAAO,KAAK,MAAM,yBAAyB,QAAW,YAAY;AAChE,YAAMA,OAAM,MAAM,KAAK,cAAc,wBAAwB;AAAA,QAC3D,KAAK;AAAA,QACL,OAAO;AAAA,MACT,CAAC;AACD,UAAI,CAAC,MAAM,QAAQA,IAAG,EAAG,QAAO,CAAC;AACjC,aAAOA,KAAI,IAAI,CAAC,SAAS,aAAa,IAA+B,CAAC;AAAA,IACxE,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,qBACJ,SACA,UAC6B;AAC7B,WAAO,KAAK,MAAM,wBAAwB,QAAW,YAAY;AAC/D,YAAMA,OAAM,MAAM,KAAK,cAAc,uBAAuB;AAAA,QAC1D,KAAK;AAAA,QACL,OAAO;AAAA,MACT,CAAC;AACD,UAAI,CAAC,MAAM,QAAQA,IAAG,EAAG,QAAO,CAAC;AACjC,aAAOA,KAAI;AAAA,QAAI,CAAC,SACd,mBAAmB,IAA+B;AAAA,MACpD;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA,EAIA,eAAe,aAAuD;AACpE,WAAO,KAAK;AAAA,MAAM;AAAA,MAAkB;AAAA,MAAa,MAC/C,KAAK,eAAe,EAAE,QAAQ,sBAAsB,OAAO,YAAY,CAAC;AAAA,IAC1E;AAAA,EACF;AAAA,EAEA,MAAM,eAAe,aAA2C;AAC9D,WAAO,KAAK,MAAM,kBAAkB,aAAa,YAAY;AAC3D,YAAMA,OAAM,MAAM,KAAK,eAAe;AAAA,QACpC,QAAQ;AAAA,QACR,OAAO;AAAA,MACT,CAAC;AACD,aAAO;AAAA,QACL,QAAQ,OAAOA,KAAI,UAAU,EAAE;AAAA,QAC/B,UAAU,QAAQA,KAAI,SAAS;AAAA,QAC/B,UAAU,QAAQA,KAAI,SAAS;AAAA,QAC/B,eAAe,OAAOA,KAAI,kBAAkB,EAAE;AAAA,MAChD;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA,EAIA,MAAM,iBAAmD;AACvD,WAAO,KAAK,MAAM,kBAAkB,QAAW,YAAY;AACzD,YAAM,OAAO,MAAM,KAAK,KAAK;AAAA,QAC3B;AAAA,QACA,EAAE,QAAQ,eAAe;AAAA,QACzB,KAAK,YAAY;AAAA,MACnB;AACA,YAAM,KAAK,aAAa,IAAI;AAC5B,YAAM,OAAS,MAAM,KAAK,KAAK,IAAI,KAAM,CAAC;AAE1C,UAAI,SAAS,KAAK,IAAI,EAAG,QAAO,KAAK;AACrC,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,mBACJ,SACA,SACiC;AACjC,WAAO,KAAK,MAAM,sBAAsB,QAAW,YAAY;AAC7D,YAAM,SAAqC,EAAE,KAAK,QAAQ;AAC1D,UAAI,QAAS,QAAO,UAAU;AAC9B,YAAMA,OAAM,MAAM,KAAK,cAAc,oBAAoB,MAAM;AAC/D,UAAI,CAAC,SAASA,IAAG,EAAG,QAAO;AAC3B,aAAO,sBAAsBA,MAAK,OAAO;AAAA,IAC3C,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,uBAAuB,SAA0C;AACrE,QAAI;AACF,YAAM,OAAO,MAAM,KAAK,KAAK;AAAA,QAC3B;AAAA,QACA,EAAE,KAAK,QAAQ;AAAA,QACf,KAAK,YAAY;AAAA,MACnB;AACA,UAAI,KAAK,WAAW,IAAK,QAAO;AAChC,YAAM,OAAQ,MAAM,KAAK,KAAK,IAAI;AAGlC,UAAI,MAAM,YAAY,YAAY,MAAM,YAAY,WAAW;AAC7D,eAAO,KAAK;AAAA,MACd;AACA,aAAO;AAAA,IACT,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,mBAAmB,SAAuC;AAC9D,UAAM,SAAS,KAAK,YAAY,IAAI,OAAO;AAC3C,QAAI,OAAQ,QAAO;AACnB,UAAM,aAAa,MAAM,KAAK,uBAAuB,OAAO;AAC5D,WAAO,KAAK,oBAAoB,SAAS,UAAU;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAc,oBACZ,SACA,YACsB;AACtB,UAAM,SAAS,KAAK,YAAY,IAAI,OAAO;AAC3C,QAAI,OAAQ,QAAO;AAEnB,QAAI,YAAY;AACd,YAAM,QAAQ,eAAe,YAAY,gBAAgB;AACzD,WAAK,YAAY,IAAI,SAAS,KAAK;AACnC,aAAO;AAAA,IACT;AAKA,QAAI;AACF,YAAM,CAAC,QAAQ,OAAO,IAAI,MAAM,QAAQ,IAAI;AAAA,QAC1C,KAAK,mBAAmB,SAAS,QAAQ,EAAE,MAAM,MAAM,IAAI;AAAA,QAC3D,KAAK,mBAAmB,SAAS,SAAS,EAAE,MAAM,MAAM,IAAI;AAAA,MAC9D,CAAC;AAED,UAAI,QAAQ,uBAAuB;AACjC,aAAK,YAAY,IAAI,SAAS,aAAa;AAC3C,eAAO;AAAA,MACT;AACA,UAAI,UAAU,SAAS;AACrB,cAAM,QACJ,QAAQ,cAAc,OAAO,cACzB,gBACA;AACN,aAAK,YAAY,IAAI,SAAS,KAAK;AACnC,eAAO;AAAA,MACT;AACA,UAAI,QAAQ;AACV,aAAK,YAAY,IAAI,SAAS,YAAY;AAC1C,eAAO;AAAA,MACT;AACA,UAAI,SAAS,uBAAuB;AAClC,aAAK,YAAY,IAAI,SAAS,aAAa;AAC3C,eAAO;AAAA,MACT;AAAA,IACF,QAAQ;AAAA,IAER;AACA,SAAK,YAAY,IAAI,SAAS,YAAY;AAC1C,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,kBAAwB;AACtB,SAAK,YAAY,MAAM;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAc,MACZC,OACA,aACA,IACY;AACZ,UAAM,QAAQ,YAAY,IAAI;AAC9B,eAAWA,OAAM,QAAW,WAAW;AACvC,QAAI;AACF,YAAM,SAAS,MAAM,GAAG;AACxB,qBAAeA,OAAM,YAAY,IAAI,IAAI,OAAO,SAAS;AACzD,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,qBAAeA,OAAM,YAAY,IAAI,IAAI,OAAO,OAAO;AACvD,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,kBAAkB,WAA+B;AACvD,QAAI,WAAW,cAAe,QAAO,UAAU;AAC/C,QAAI,WAAW,YAAY,UAAW,QAAO,cAAc;AAC3D,QAAI,WAAW,YAAY,SAAU,QAAO,aAAa;AACzD,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,gBAAwB;AAC9B,UAAM,MAAM,KAAK,IAAI;AACrB,QAAI,KAAK,eAAe,MAAM,KAAK,YAAY,WAAW,IAAI,KAAK,KAAM;AACvE,aAAO,KAAK,YAAY;AAAA,IAC1B;AACA,UAAM,QAAQ,QAAQ,IAAI,SAAS,EAAE,CAAC,IAAI,UAAU,CAAC,CAAC;AACtD,UAAM,MAAM,OAAO;AAAA,MACjB;AAAA,MACA,QAAQ,GAAG;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK;AAAA,MACV,KAAK;AAAA,IACP;AACA,SAAK,cAAc,EAAE,KAAK,UAAU,IAAI;AACxC,WAAO;AAAA,EACT;AAAA,EAEQ,cAAsC;AAC5C,WAAO,EAAE,eAAe,UAAU,KAAK,cAAc,CAAC,GAAG;AAAA,EAC3D;AAAA,EAEA,MAAc,cACZ,QACA,QACkB;AAClB,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,KAAK;AAAA,QACrB;AAAA,QACA,EAAE,QAAQ,GAAG,OAAO;AAAA,QACpB,KAAK,YAAY;AAAA,MACnB;AAAA,IACF,SAAS,KAAK;AACZ,YAAM,KAAK,eAAe,GAAG;AAAA,IAC/B;AACA,QAAI,KAAK,WAAW,IAAK,OAAM,MAAM,KAAK,UAAU,IAAI;AACxD,WAAO,KAAK,KAAK,IAAI;AAAA,EACvB;AAAA,EAEA,MAAc,eACZ,MACkC;AAClC,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,KAAK,KAAK,oBAAoB,MAAM,KAAK,YAAY,CAAC;AAAA,IAC1E,SAAS,KAAK;AACZ,YAAM,KAAK,eAAe,GAAG;AAAA,IAC/B;AACA,QAAI,KAAK,WAAW,IAAK,OAAM,MAAM,KAAK,UAAU,IAAI;AACxD,UAAM,OAAO,MAAM,KAAK,KAAK,IAAI;AACjC,WAAO,SAAS,IAAI,IAAI,OAAO,CAAC;AAAA,EAClC;AAAA,EAEA,MAAc,kBACZ,QACA,QAC2B;AAC3B,UAAMD,OAAM,MAAM,KAAK,cAAc,QAAQ,MAAM;AACnD,QAAI,CAAC,MAAM,QAAQA,IAAG,EAAG,QAAO,CAAC;AACjC,WAAOA,KAAI,IAAI,CAAC,SAAS,iBAAiB,IAA+B,CAAC;AAAA,EAC5E;AAAA,EAEA,MAAc,aAAa,MAA+B;AACxD,QAAI,KAAK,GAAI;AACb,UAAM,MAAM,KAAK,UAAU,IAAI;AAAA,EACjC;AAAA;AAAA,EAGA,MAAc,UAAU,MAAyC;AAC/D,WAAO,IAAI;AAAA,MACT,KAAK;AAAA,MACL,MAAM,SAAS,IAAI;AAAA,MACnB,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AAAA,EACF;AAAA;AAAA,EAGQ,eAAe,KAA8B;AACnD,WAAO,IAAI,eAAe,GAAG,aAAa,GAAG,GAAG,IAAI,KAAK,QAAQ;AAAA,EACnE;AAAA,EAEA,MAAc,KAAK,MAAkC;AACnD,UAAM,OAAO,MAAM,SAAS,IAAI;AAChC,QAAI,CAAC,KAAM,QAAO;AAClB,UAAM,SAAS,aAAa,IAAI;AAChC,WAAO,WAAW,SAAY,OAAO;AAAA,EACvC;AAAA;AAAA,EAIA,OAAO,kBAA2B;AAChC,WAAO,OAAO,gBAAgB;AAAA,EAChC;AAAA,EAEA,OAAO,kBAAkB,KAAsB;AAC7C,WAAO,OAAO,kBAAkB,GAAG;AAAA,EACrC;AAAA,EAEA,OAAO,gBAAgB,SAAyB;AAC9C,WAAO,OAAO,gBAAgB,OAAO;AAAA,EACvC;AAAA,EAEA,OAAO,cAAc,MAA4B;AAC/C,WAAO,OAAO,cAAc,IAAI;AAAA,EAClC;AAAA,EAEA,OAAO,qBAAqB,MAAsB;AAChD,WAAO,OAAO,qBAAqB,IAAI;AAAA,EACzC;AAAA,EAEA,OAAO,0BAA0B,MAAuB;AACtD,WAAO,OAAO,0BAA0B,IAAI;AAAA,EAC9C;AACF;AAKA,SAAS,aAAaA,MAA8B;AAClD,SAAO;AAAA,IACL,YAAY,OAAOA,KAAI,gBAAgB,EAAE;AAAA,IACzC,aAAa,YAAYA,KAAI,YAAY;AAAA,IACzC,UAAU,OAAOA,KAAI,aAAa,EAAE;AAAA,IACpC,aAAa,OAAOA,KAAI,gBAAgB,EAAE;AAAA,IAC1C,aAAa,OAAOA,KAAI,gBAAgB,EAAE;AAAA,IAC1C,SAAS,OAAOA,KAAI,YAAY,EAAE;AAAA,EACpC;AACF;AAEA,SAAS,iBAAiBA,MAA8C;AACtE,SAAO;AAAA,IACL,GAAG,aAAaA,IAAG;AAAA,IACnB,cAAc,OAAOA,KAAI,kBAAkB,EAAE;AAAA,IAC7C,OAAO,OAAOA,KAAI,SAAS,CAAC;AAAA,EAC9B;AACF;AAEA,SAAS,eAAeA,MAA4C;AAClE,SAAO;AAAA,IACL,GAAG,aAAaA,IAAG;AAAA,IACnB,cAAc,UAAUA,KAAI,cAAc;AAAA,IAC1C,WAAW,UAAUA,KAAI,UAAU;AAAA,IACnC,YAAY,UAAUA,KAAI,WAAW;AAAA,IACrC,cAAc,UAAUA,KAAI,aAAa;AAAA,IACzC,cAAc,UAAUA,KAAI,aAAa;AAAA,IACzC,eAAe,UAAUA,KAAI,cAAc;AAAA,IAC3C,eAAe,UAAUA,KAAI,cAAc;AAAA,IAC3C,uBAAuB,UAAUA,KAAI,wBAAwB;AAAA,EAC/D;AACF;AAEA,SAAS,aAAaA,MAA0C;AAC9D,SAAO;AAAA,IACL,YAAY,OAAOA,KAAI,eAAe,EAAE;AAAA,IACxC,aAAa,YAAYA,KAAI,YAAY;AAAA,IACzC,YAAY,OAAOA,KAAI,eAAe,EAAE;AAAA,IACxC,eAAe,OAAOA,KAAI,kBAAkB,EAAE;AAAA,IAC9C,SAAS,iBAAiBA,KAAI,OAAO;AAAA,IACrC,QAAQ,OAAOA,KAAI,UAAU,EAAE;AAAA,IAC/B,WAAW,OAAOA,KAAI,cAAc,CAAC;AAAA,EACvC;AACF;AAEA,SAAS,mBAAmBA,MAAgD;AAC1E,SAAO;AAAA,IACL,YAAY,OAAOA,KAAI,eAAe,EAAE;AAAA,IACxC,YAAY,OAAOA,KAAI,eAAe,EAAE;AAAA,IACxC,QAAQ,OAAOA,KAAI,UAAU,EAAE;AAAA,IAC/B,YAAY,OAAOA,KAAI,eAAe,EAAE;AAAA,IACxC,YAAY,OAAOA,KAAI,eAAe,CAAC;AAAA,IACvC,WAAW,OAAOA,KAAI,cAAc,CAAC;AAAA,IACrC,YACE,UAAUA,KAAI,WAAW,KAAK,YAAYA,KAAI,WAAW,KAAK;AAAA,EAClE;AACF;AAEA,SAAS,sBACPA,MACA,SACiB;AACjB,SAAO;AAAA,IACL,UAAU,OAAOA,KAAI,YAAY,OAAO;AAAA,IACxC,mBAAmB,OAAOA,KAAI,qBAAqB,EAAE;AAAA,IACrD,cAAc,OAAOA,KAAI,gBAAgB,CAAC;AAAA,IAC1C,uBAAuB,QAAQA,KAAI,qBAAqB;AAAA,IACxD,eAAe,OAAOA,KAAI,iBAAiB,CAAC;AAAA,IAC5C,cAAc,OAAOA,KAAI,gBAAgB,CAAC;AAAA,IAC1C,iBAAiB,OAAOA,KAAI,mBAAmB,CAAC;AAAA,IAChD,aAAa,OAAOA,KAAI,eAAe,CAAC;AAAA,IACxC,YAAY,OAAOA,KAAI,cAAc,CAAC;AAAA,IACtC,WAAW,QAAQA,KAAI,SAAS;AAAA,EAClC;AACF;AAIA,SAAS,SAAS,GAA0C;AAC1D,SAAO,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;AAChE;AAEA,SAAS,UAAU,GAAgC;AACjD,MAAI,MAAM,QAAQ,MAAM,OAAW,QAAO;AAC1C,SAAO,OAAO,MAAM,WAAW,IAAI,OAAO,CAAC;AAC7C;AAEA,SAAS,UAAU,GAAgC;AACjD,MAAI,MAAM,QAAQ,MAAM,OAAW,QAAO;AAC1C,QAAM,IAAI,OAAO,CAAC;AAClB,SAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAClC;AAEA,SAAS,QAAQ,GAAiC;AAChD,MAAI,MAAM,QAAQ,MAAM,OAAW,QAAO;AAC1C,SAAO,QAAQ,CAAC;AAClB;AAGA,SAAS,aAAa,MAAuB;AAC3C,MAAI;AACF,WAAO,KAAK,MAAM,IAAI;AAAA,EACxB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,UAAU,OAAwB;AACzC,QAAM,SAAS,aAAa,MAAM,SAAS,OAAO,CAAC;AACnD,SAAO,WAAW,SAAY,CAAC,IAAI;AACrC;AAEA,eAAe,SAAS,MAAiC;AACvD,MAAI;AACF,WAAO,MAAM,KAAK,KAAK;AAAA,EACzB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,aAAa,KAAsB;AAC1C,SAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AACxD;AAEA,SAAS,cAAc,MAAuB;AAC5C,MAAI,SAAS,QAAQ,SAAS,OAAW,QAAO;AAChD,MAAI,OAAO,SAAS,SAAU,QAAO;AACrC,MAAI;AACF,WAAO,KAAK,UAAU,IAAI;AAAA,EAC5B,QAAQ;AACN,WAAO,OAAO,IAAI;AAAA,EACpB;AACF;AAEA,IAAM,iBAAiB;AACvB,SAAS,SAAS,MAAsB;AACtC,MAAI,KAAK,UAAU,eAAgB,QAAO;AAC1C,SAAO,KAAK,MAAM,GAAG,cAAc,IAAI;AACzC;;;AChkCO,SAAS,kBAAqB,OAAa;AAChD,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,OAAO,cAAc,KAAK,EAAE;AAAA,EACrC;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO,MAAM,IAAI,CAAC,MAAM,kBAAkB,CAAC,CAAC;AAAA,EAC9C;AACA,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAC/C,UAAM,MAA+B,CAAC;AACtC,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAgC,GAAG;AACrE,UAAI,CAAC,IAAI,kBAAkB,CAAC;AAAA,IAC9B;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;ACzCO,SAAS,6BACd,WACA,cACA,WACkC;AAClC,MAAI,CAAC,cAAc;AACjB,WAAO,EAAE,IAAI,OAAO,QAAQ,oCAAoC;AAAA,EAClE;AAEA,QAAM,OAAO,OAAO,SAAS,SAAS,IAAI,YAAY,OAAO,KAAK,SAAS;AAE3E,MAAI;AACJ,MAAI;AACF,cAAU,OAAO,gBAAgB,MAAM,cAAc,SAAS;AAAA,EAChE,SAAS,KAAK;AACZ,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,OAAO,EAAE;AAIrE,QACE,QAAQ,SAAS,sBAAsB,KACvC,QAAQ,SAAS,+BAA+B,GAChD;AACA,aAAO,EAAE,IAAI,OAAO,QAAQ,6BAA6B;AAAA,IAC3D;AACA,WAAO,EAAE,IAAI,OAAO,QAAQ,iCAAiC,OAAO,GAAG;AAAA,EACzE;AAEA,SAAO,UACH,EAAE,IAAI,KAAK,IACX;AAAA,IACE,IAAI;AAAA,IACJ,QAAQ;AAAA,EACV;AACN;;;ACtCA,IAAM,EAAE,QAAAE,QAAO,IAAI;AAEnB,IAAM,YAAY,IAAI,YAAY,EAAE,OAAO,0BAA0B;AACrE,IAAM,UAAU;AAChB,IAAMC,aAAY;AAElB,SAASC,UAASC,IAAmB;AACnC,SAAOA,GAAE,KAAK,EAAE,QAAQ,QAAQ,EAAE,EAAE,YAAY;AAClD;AAEA,SAAS,QAAQ,KAAyB;AACxC,QAAMC,SAAQF,UAAS,GAAG;AAC1B,MAAI,CAAC,cAAc,KAAKE,MAAK,KAAKA,OAAM,SAAS,MAAM,GAAG;AACxD,UAAM,IAAI,MAAM,aAAa;AAAA,EAC/B;AACA,QAAM,MAAM,IAAI,WAAWA,OAAM,SAAS,CAAC;AAC3C,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,QAAI,CAAC,IAAI,SAASA,OAAM,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE;AAAA,EACrD;AACA,SAAO;AACT;AAGA,SAAS,cAAcC,KAAsC;AAC3D,QAAM,KAAK,IAAI,YAAYA,IAAG,UAAU;AACxC,MAAI,WAAW,EAAE,EAAE,IAAIA,GAAgB;AACvC,SAAO;AACT;AAEA,eAAe,kBAAkB,YAAyC;AACxE,QAAM,MAAM,QAAQ,UAAU;AAC9B,MAAI,IAAI,eAAe,SAAS;AAC9B,UAAM,IAAI,MAAM,oCAAoC,OAAO,uBAAuB;AAAA,EACpF;AACA,QAAM,cAAc,MAAM,OAAO,OAAO,UAAU,OAAO,cAAc,GAAG,GAAG,QAAQ,OAAO,CAAC,YAAY,CAAC;AAC1G,QAAM,OAAO,MAAM,OAAO,OAAO;AAAA,IAC/B,EAAE,MAAM,QAAQ,MAAM,WAAW,MAAM,IAAI,YAAY,CAAC,GAAG,MAAM,cAAc,SAAS,EAAE;AAAA,IAC1F;AAAA,IACA,UAAU;AAAA,EACZ;AACA,SAAO,IAAI,WAAW,IAAI;AAC5B;AAEA,eAAe,aAAa,UAA0C;AACpE,SAAO,OAAO,OAAO,UAAU,OAAO,cAAc,QAAQ,GAAG,EAAE,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,SAAS,CAAC;AACnH;AAGA,eAAsBC,iBAAgB,SAAkC;AACtE,QAAMC,OAAM,MAAM,kBAAkB,OAAO;AAC3C,SAAOP,QAAO,KAAKO,IAAG;AACxB;AAGA,eAAsBC,sBACpB,WACAC,MACgD;AAChD,MAAIA,KAAI,eAAe,SAAS;AAC9B,UAAM,IAAI,MAAM,qCAAqC,OAAO,QAAQ;AAAA,EACtE;AACA,QAAM,QAAQ,IAAI,WAAWR,UAAS;AACtC,SAAO,gBAAgB,KAAK;AAC5B,QAAM,SAAS,MAAM,aAAa,IAAI,WAAWQ,IAAG,CAAC;AACrD,QAAM,YAAY,MAAM,OAAO,OAAO;AAAA,IACpC,EAAE,MAAM,WAAW,IAAI,cAAc,KAAK,EAAE;AAAA,IAC5C;AAAA,IACA,cAAc,IAAI,YAAY,EAAE,OAAO,SAAS,CAAC;AAAA,EACnD;AACA,SAAO,EAAE,YAAYT,QAAO,KAAK,IAAI,WAAW,SAAS,CAAC,GAAG,OAAOA,QAAO,KAAK,KAAK,EAAE;AACzF;AAGA,eAAsBU,sBACpB,YACA,OACAD,MACiB;AACjB,MAAIA,KAAI,eAAe,SAAS;AAC9B,UAAM,IAAI,MAAM,qCAAqC,OAAO,QAAQ;AAAA,EACtE;AACA,MAAI,MAAM,eAAeR,YAAW;AAClC,UAAM,IAAI,MAAM,uCAAuCA,UAAS,QAAQ;AAAA,EAC1E;AACA,QAAM,SAAS,MAAM,aAAa,IAAI,WAAWQ,IAAG,CAAC;AACrD,QAAM,WAAW,MAAM,OAAO,OAAO;AAAA,IACnC,EAAE,MAAM,WAAW,IAAI,cAAc,KAAK,EAAE;AAAA,IAC5C;AAAA,IACA,cAAc,UAAU;AAAA,EAC1B;AACA,SAAO,IAAI,YAAY,EAAE,OAAO,QAAQ;AAC1C;;;AC/FA,IAAME,YAAW;AAEjB,eAAsB,WACpB,QACA,OACA,OAC2B;AAC3B,QAAM,IAAI,MAAM,cAAcA,SAAQ,EAAE;AAC1C;AAEA,eAAsB,gBACpB,UACA,OACA,OAC6B;AAC7B,QAAM,IAAI,MAAM,mBAAmBA,SAAQ,EAAE;AAC/C;;;ACdA,IAAMC,YACJ;AAiCF,eAAsB,oBACpB,YACA,OACA,OACe;AACf,QAAM,IAAI,MAAM,uBAAuBA,SAAQ,EAAE;AACnD;AAEA,eAAsB,kBACpB,OACA,YACwB;AACxB,QAAM,IAAI,MAAM,qBAAqBA,SAAQ,EAAE;AACjD;AAEA,eAAsB,gBACpB,OACA,YAC6B;AAC7B,QAAM,IAAI,MAAM,mBAAmBA,SAAQ,EAAE;AAC/C;AAEA,eAAsB,kBACpB,OACA,YAC6B;AAC7B,QAAM,IAAI,MAAM,qBAAqBA,SAAQ,EAAE;AACjD;AAEA,eAAsB,iBACpB,OACA,YAC6B;AAC7B,QAAM,IAAI,MAAM,oBAAoBA,SAAQ,EAAE;AAChD;AAEA,eAAsB,cACpB,KACA,OACA,YAC2B;AAC3B,QAAM,IAAI,MAAM,iBAAiBA,SAAQ,EAAE;AAC7C;AAEA,eAAsB,mBACpB,OACA,YACgC;AAChC,QAAM,IAAI,MAAM,sBAAsBA,SAAQ,EAAE;AAClD;AAEA,eAAsB,eACpB,OACA,SACA,OACA,OACe;AACf,QAAM,IAAI,MAAM,kBAAkBA,SAAQ,EAAE;AAC9C;;;ACxFA,IAAMC,YACJ;AAEK,IAAM,kCAAyD;AAAA,EACpE;AAAA,EACA;AAAA,EACA;AACF;AAEO,IAAM,+BAAsD;AAAA,EACjE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAuBO,SAAS,oBACd,QACA,MACA,QAAoC,CAAC,GACjB;AACpB,QAAM,IAAI,MAAM,uBAAuBA,SAAQ,EAAE;AACnD;;;ACkBA,SAAS,eACP,OACA,KACA,UACAC,SACM;AACN,MAAI,CAACA,SAAQ,KAAM;AAEnB,QAAM,KAAM,SAAS,CAAC;AACtB,QAAM,IAAK,OAAO,CAAC;AACnB,QAAM,gBACJ,GAAG,UAAU,EAAE,UAAU,GAAG,QAAQ,EAAE,QAAQ,GAAG,aAAa,EAAE;AAClE,QAAM,UACJ,iBAAiB,OAAO,kBAAkB,WACrC,gBACD,CAAC;AACP,QAAM,WAAW,OAAO,KAAK,OAAO,EAAE,MAAM,GAAG,EAAE;AACjD,QAAM,aACH,OAAO,QAAQ,cAAc,YAAY,QAAQ,aACjD,OAAO,QAAQ,SAAS,YAAY,QAAQ,QAC5C,OAAO,QAAQ,aAAa,YAAY,QAAQ,YACjD;AACF,QAAM,WAAW,MAAM,QAAQ,QAAQ,KAAK,IAAI,QAAQ,QAAQ;AAChE,QAAM,gBACJ,YAAY,SAAS,CAAC,KAAK,OAAO,SAAS,CAAC,MAAM,WAC9C,OAAO,KAAK,SAAS,CAAC,CAA4B,EAAE,MAAM,GAAG,EAAE,IAC/D;AACN,QAAM,OACH,GAAG,YACH,EAAE,MAA4B,QAC9B,EAAE,YACF,EAAE,QACH;AAEF,EAAAA,QAAO,KAAK,oCAAoC;AAAA,IAC9C,UAAU;AAAA,IACV,WAAW,OAAO,KAAK,EAAE,EAAE,MAAM,GAAG,EAAE;AAAA,IACtC,SAAS,OAAO,KAAK,CAAC,EAAE,MAAM,GAAG,EAAE;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,UAAU;AAAA,IACtB,aAAa,CAAC,CAAC;AAAA,IACf,YAAY,UAAU;AAAA,EACxB,CAAC;AACH;AAgBA,eAAsB,iBACpB,OACiC;AACjC,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU;AAAA,IACV,OAAAC,SAAQ;AAAA,IACR,QAAAD;AAAA,EACF,IAAI;AAEJ,QAAM,WAAW,oBAAoB,OAAO,KAAK,EAAE,UAAU,UAAU,CAAC;AAExE,MAAIC,OAAO,gBAAe,OAAO,KAAK,UAAUD,OAAM;AAEtD,MAAI,CAAC,SAAU,QAAO,EAAE,SAAS,MAAM;AAGvC,MAAI;AACJ,MAAI;AACF,iBAAa,MAAM,WAAW,UAAU,MAAM;AAAA,MAC5C;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,UAAM,SAAS,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC9D,IAAAA,SAAQ,OAAO,+BAA+B;AAAA,MAC5C,MAAM,SAAS;AAAA,MACf;AAAA,IACF,CAAC;AAED,WAAO;AAAA,MACL,SAAS;AAAA,MACT,UAAU,UACN,EAAE,OAAO,OAAO,OAAO,MAAM,OAAO,IACpC,EAAE,OAAO,KAAK;AAAA,IACpB;AAAA,EACF;AAIA,MAAI,WAAW,YAAY,OAAO;AAChC,IAAAA,SAAQ,OAAO,yBAAyB;AAAA,MACtC,MAAM,SAAS;AAAA,MACf,QAAQ,WAAW;AAAA,IACrB,CAAC;AACD,WAAO;AAAA,MACL,SAAS;AAAA,MACT,UAAU,UACN,EAAE,OAAO,OAAO,OAAO,MAAM,QAAQ,WAAW,OAAO,IACvD,EAAE,OAAO,KAAK;AAAA,MAClB;AAAA,MACA,WAAW;AAAA,IACb;AAAA,EACF;AAIA,sBAAoB,SAAS,OAAO,MAAM;AAAA,IACxC,OAAO,WAAW;AAAA,IAClB;AAAA,IACA;AAAA,EACF,CAAC,EAAE,MAAM,CAAC,QAAiB;AACzB,UAAM,SAAS,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC9D,IAAAA,SAAQ,OAAO,0CAA0C;AAAA,MACvD,MAAM,SAAS;AAAA,MACf;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAED,EAAAA,SAAQ;AAAA,IACN,WAAW,YAAY,WAAW,yBAAyB;AAAA,IAC3D,EAAE,MAAM,SAAS,KAAK,OAAO,WAAW,OAAO,QAAQ,WAAW,OAAO;AAAA,EAC3E;AAEA,SAAO;AAAA,IACL,SAAS;AAAA,IACT,UAAU,EAAE,OAAO,KAAK;AAAA,IACxB;AAAA,IACA,WAAW;AAAA,EACb;AACF;;;AC5LO,IAAM,uBAAN,cAAmC,MAAM;AAAA,EAC9C,YACkB,IAChB,QACA;AACA,UAAM,uCAAuC,EAAE,KAAK,MAAM,EAAE;AAH5C;AAIhB,SAAK,OAAO;AAAA,EACd;AAAA,EALkB;AAMpB;AAEA,IAAM,iBAAiB;AAEvB,eAAsB,gBACpB,MACA,SACA,OAA0B,CAAC,GACA;AAC3B,QAAM,MAAM,KAAK,SAAS;AAC1B,QAAM,MAAM,KAAK,IAAI;AAErB,QAAM,YAAY,CAAC,KAAK,SAAS,MAAM,QAAQ,YAAY;AAC3D,MAAI,WAAW;AACb,WAAO,EAAE,SAAS,OAAO,QAAQ;AAAA,EACnC;AAEA,QAAM,YAAY,MAAM,kBAAkB,MAAM,KAAK,SAAS;AAC9D,QAAM,cAA6B,EAAE,UAAU,WAAW,WAAW,IAAI;AAEzE,MAAI,cAAc,QAAQ,UAAU;AAClC,WAAO,EAAE,SAAS,OAAO,SAAS,YAAY;AAAA,EAChD;AAEA,MAAI,cAAc,MAAM;AACtB,WAAO,EAAE,SAAS,MAAM,SAAS,MAAM,SAAS,YAAY;AAAA,EAC9D;AAEA,QAAM,MAAM,MAAM,cAAc,WAAW,MAAM,KAAK,SAAS;AAC/D,MAAI,IAAI,cAAc;AACpB,UAAM,IAAI,qBAAqB,WAAW,IAAI,YAAY;AAAA,EAC5D;AACA,SAAO,EAAE,SAAS,MAAM,SAAS,KAAK,SAAS,YAAY;AAC7D;;;ACxEA,IAAM,cAAc,CAACE,UAAwB;AAC3C,QAAM,IAAI,MAAM,GAAGA,KAAI,yCAAyC;AAClE;AAEO,IAAM,eAAN,MAAmB;AAAA,EACxB,YAAY,WAAmB;AAAA,EAAC;AAAA,EAChC,IAAI,SAAyC;AAC3C,WAAO,QAAQ,OAAO,IAAI,MAAM,yDAAyD,CAAC;AAAA,EAC5F;AAAA,EACA,IAAI,SAAiB,UAAwC;AAC3D,WAAO,QAAQ,OAAO,IAAI,MAAM,yDAAyD,CAAC;AAAA,EAC5F;AACF;AAEO,SAAS,mBAAmB,eAAgC;AACjE,SAAO,YAAY,oBAAoB;AACzC;;;ACdA,IAAMC,eAAc,CAACC,UAAwB;AAC3C,QAAM,IAAI,MAAM,GAAGA,KAAI,yCAAyC;AAClE;AAEO,SAAS,iBACd,cACA,aACe;AACf,SAAOD,aAAY,kBAAkB;AACvC;AAEO,SAAS,qBAAqB,eAAgC;AACnE,SAAOA,aAAY,sBAAsB;AAC3C;;;ACnBA,IAAME,YACJ;AAEK,IAAM,iCAAwD;AAAA,EACnE;AAAA,EACA;AACF;AAQO,SAAS,mBACd,QACA,MACA,QAAmC,CAAC,GAC3B;AACT,QAAM,IAAI,MAAM,sBAAsBA,SAAQ,EAAE;AAClD;;;ACWA,IAAMC,eAAc,CAACC,UAAwB;AAC3C,QAAM,IAAI,MAAM,GAAGA,KAAI,yCAAyC;AAClE;AAEO,IAAM,qBAAN,MAAyB;AAAA,EAC9B,YAAY,OAAkC;AAAA,EAAC;AAAA,EAC/C,eAA8B;AAC5B,WAAO,QAAQ;AAAA,MACb,IAAI,MAAM,wEAAwE;AAAA,IACpF;AAAA,EACF;AAAA,EACA,qBAAqB,QAAiB,MAA6C;AACjF,WAAO,QAAQ;AAAA,MACb,IAAI;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,yBAAyB,OAAsD;AAC7F,SAAOD,aAAY,0BAA0B;AAC/C;;;ACqDO,SAASE,mBAAkB,KAAsB;AACtD,SAAO,OAAO,kBAAkB,GAAG;AACrC;AAEO,SAASC,iBAAgB,SAAyB;AACvD,SAAO,OAAO,gBAAgB,OAAO;AACvC;AAEO,SAASC,mBAA2B;AACzC,SAAO,OAAO,gBAAgB;AAChC;AAEO,SAASC,WAAU,SAA4B;AACpD,SAAO,OAAO,UAAU,OAAO;AACjC;AAEO,SAASC,iBACd,YACA,QACA,SACA,UACA,cACA,SACA,eACQ;AACR,SAAO,OAAO;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAsBO,SAASC,iBACd,YACA,QACA,SACA,OACA,SACA,eACQ;AACR,SAAO,OAAO;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEO,SAASC,iBACd,MACA,cACA,WACS;AACT,SAAO,OAAO,gBAAgB,MAAM,cAAc,SAAS;AAC7D;AAEO,SAASC,sBAAqB,MAAsB;AACzD,SAAO,OAAO,qBAAqB,IAAI;AACzC;AAEO,SAASC,2BAA0B,MAAuB;AAC/D,SAAO,OAAO,0BAA0B,IAAI;AAC9C;AAEO,SAASC,eAAc,MAA4B;AACxD,SAAO,OAAO,cAAc,IAAI;AAClC;AAEO,SAASC,gBAAe,MAAuB;AACpD,SAAO,OAAO,eAAe,IAAI;AACnC;AAEO,SAASC,sBACd,SACA,SACgB;AAChB,SAAO,OAAO,qBAAqB,SAAS,OAAO;AACrD;AAEO,SAASC,qBACd,QACA,OACkB;AAClB,SAAO,OAAO,oBAAoB,QAAQ,KAAK;AACjD;","names":["module","exports","assert","inherits","BN","base","Buffer","max","min","init","index","r","mul","mod","pow","clone","inspect","toString","toJSON","toBuffer","toArray","byteLength","neg","xor","add","self","comb10MulTo","permute","s","stub","abs","eq","name","prime","mont","min","ch","error","hl","pad","info","isLE","buffer","state","G","sigma1","sigma0","abytes","anumber","bytesToHex","concatBytes","hexToBytes","isBytes","randomBytes","abytes","min","max","concatBytes","reseed","sl","f","_0n","_1n","_0n","_1n","r","root","S","R","_1n","_0n","_1n","anumber","_0n","_1n","abytes","isLE","_1n","key","isLE","abytes","_0n","_1n","neg","W","window","_1n","_0n","Point","_1n","point","W","base","window","f","isLE","type","_0n","hash","key","pad","_2n","_0n","_1n","def","abytes","_3n","_4n","point","isCompressed","concatBytes","encodePoint","decodePoint","Point","hexToBytes","endo","mul","f","bytesToHex","Point","randomBytes","error","isCompressed","abytes","isBytes","s","utils","hash","hmac","key","_2n","_1n","Signature","r","hexToBytes","R","concatBytes","bytesToHex","_0n","sign","verify","signature","_2n","_3n","root","buffer","isLE","s","require$$0","ieee754","require$$1","Buffer","proto","assertSize","byteLength","obj","isBuffer","compare","isEncoding","toString","inspect","max","i","toJSON","mul","readUInt8","readUInt32BE","min","writeUInt32BE","code","errors","Base","name","range","type","types","root","key","module","assert","inherits","BN","base","init","index","r","mod","pow","clone","toBuffer","toArray","neg","xor","add","self","comb10MulTo","permute","stub","abs","eq","prime","mont","this","inherits_browserModule","Reporter","reporter","ReporterError","state","path","require$$2","DecoderBuffer","save","restore","EncoderBuffer","Node","node","explicit","encode","asn1","require$$3","bignum","der","require$$4","DERNode","der_1","header","encodeInt","size","out","use","pem","encoders","DERDecoder","decode","any","raw","decoders","api","constants","require$$5","__importDefault","utils","buffer_1","bn_js_1","asn","sortDictPairByKey","error","oldBrowser","crypto","global","browserModule","randomBytes","ReflectApply","ReflectOwnKeys","warning","NumberIsNaN","eventsModule","once","events","listeners","keys","resolve","streamBrowser","_defineProperty","custom","BufferList","join","destroy","emitErrorNT","err","undestroy","destroy_1","NodeError","browser","_stream_writable","Duplex","Stream","require$$6","require$$7","realHasInstance","get","sync","prefinish","_stream_duplex","string_decoder","StringDecoder","onlegacyfinish","onfinish","onend","onerror","onclose","onrequest","done","createReadableStreamAsyncIterator","_stream_readable","EElistenerCount","debug","require$$8","prependListener","require$$9","require$$10","n","require$$11","require$$12","_stream_transform","Transform","afterTransform","_stream_passthrough","PassThrough","HashBase","blockSize","useUint8Array","useArrayBuffer","digest","hashBase","ARRAY16","MD5","rotl","isarray","floor","round","isNaN","sign","$gOPD","$defineProperty","shams","hasSymbols","$Object","concatty","slicy","implementation","Empty","bind","$apply","$call","$TypeError","callBind","gOPD","getProto","undefined","require$$13","require$$14","require$$15","require$$16","require$$17","require$$18","require$$19","require$$20","require$$21","require$$22","doEval","require$$23","require$$24","stringToPath","getBaseIntrinsic","GetIntrinsic","callBindBasic","callBound","reflectApply","toStr","isCallable","hasOwnProperty","forEachArray","forEachString","forEachObject","isArray","forEach","availableTypedArrays","$SyntaxError","gopd","defineDataProperty","hasPropertyDescriptors","setFunctionLength","actualApply","applyBind","$indexOf","whichTypedArray","isTypedArray","typedArrayBuffer","isView","toBuffer_1","processNextickArgsModule","nextTick","objectToString","util","isString","isObject","isError","isFunction","pna","_normalizeEncoding","normalizeEncoding","utf16Text","utf16End","utf8FillLast","base64Text","base64End","simpleWrite","simpleEnd","utf8End","utf8Text","utf8CheckByte","utf8CheckIncomplete","utf8CheckExtraBytes","RIPEMD160","Hash","hash","K","W","rotl5","rotl30","ft","sha","Sha256","maj","sigma0","sigma1","f","sha256","sha224","ch","dh","hl","gamma0","gamma1","sha512","SHA512","sha384","CipherBase","ZEROS","Hmac","md5","blocksize","defaultEncoding","checkParameters","getDigest","hmac","Cipher","DES","des","_pad","_unpad","pad","create","cbc","_update","modes","decrypt","encryptByte","getBlock","incr32","aes","GHASH","ghash","StreamCipher","MODES","AuthCipher","ebtk","Splitter","createCipheriv","config","createCipher","createDecipheriv","createDecipher","ciphers","getCiphers","brorandModule","generate","bn","brorand","primes","pub","priv","secret","generatePrime","allocate","crt","zero2","toHex","getNAF","getJSF","cachedProperty","parseBytes","curve","validate","dbl","point","Point","_getBeta","dblp","isInfinity","decodePoint","pointFromJSON","precompute","_encode","fromJSON","mulAdd","getX","jpoint","pointFromX","jmulAdd","normalize","getY","eqXToP","rotr32","rotl32","sum32","sum32_3","sum32_4","sum32_5","sum64","sum64_hi","sum64_lo","sum64_4_hi","sum64_4_lo","sum64_5_hi","sum64_5_lo","rotr64_hi","rotr64_lo","shr64_hi","shr64_lo","BlockHash","common","update","ft_1","ch32","maj32","s0_256","s1_256","g0_256","g1_256","shaCommon","SHA256","zl","Ch","secp256k1","curves","KeyPair","ec","signature","Signature","HmacDRBG","EC","keyFromPublic","verify","s2","e","eddsa","fromPublic","getPublic","R","Rencoded","S","decodeInt","elliptic","enterKey","exitKey","leaveKey","enterObject","leaveObject","wrapResult","rethrow","isEmpty","skip","tags","methods","overrided","stateProps","wrap","useArgs","optional","def","implicit","choice","contains","decodeGeneric","_getUse","decodeChoice","createEncoderBuffer","child","encodeChoice","encodePrimitive","isNumstr","isPrintstr","peekTag","derDecodeTag","decodeTag","derDecodeLen","skipUntilEnd","decodeList","decodeStr","decodeObjid","decodeTime","decodeNull","decodeBool","PEMDecoder","AlgorithmIdentifier","asn1_1","fixProc","cipher","parseKeys","createHmac","toDER","signModule","createHash","signMethod","mgf","withPublic","publicEncrypt","oaep","pkcs1","privateDecrypt","bytes","algos","crypto_1","utils_1","constants_1","gtv","customError_1","objectUtil","ZodError_1","util_js_1","ZodError_js_1","errors_js_1","en_js_1","errorMessage","errorUtil_1","errorUtil","errorMap","description","ip","version","ctx","result","issues","elements","processed","ZodFirstPartyTypeKind","__createBinding","exports","__setModuleDefault","__importStar","zod_1","bufferSchema","bufferUtils_1","rawGtx","serialization","errors_1","formatter_1","_a","o","data","__awaiter","gtx","logger_1","logger","MsgType","LogColor","LogLevel","listCacheClear","assocIndexOf","listCacheDelete","listCacheGet","listCacheHas","listCacheSet","ListCache","stackClear","stackDelete","stackGet","stackHas","freeGlobal","Symbol","objectProto","nativeObjectToString","symToStringTag","getRawTag","baseGetTag","funcTag","genTag","coreJsData","isMasked","funcProto","funcToString","toSource","baseIsNative","getValue","getNative","Map","nativeCreate","hashClear","hashDelete","HASH_UNDEFINED","hashGet","hashHas","hashSet","mapCacheClear","isKeyable","getMapData","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","MapCache","stackSet","Stack","arrayEach","defineProperty","baseAssignValue","assignValue","copyObject","baseTimes","isObjectLike","argsTag","baseIsArguments","propertyIsEnumerable","isArguments","stubFalse","MAX_SAFE_INTEGER","isIndex","isLength","arrayTag","boolTag","dateTag","errorTag","mapTag","numberTag","objectTag","regexpTag","setTag","stringTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","baseIsTypedArray","baseUnary","nodeUtil","arrayLikeKeys","isPrototype","overArg","nativeKeys","baseKeys","isArrayLike","baseAssign","nativeKeysIn","baseKeysIn","keysIn","baseAssignIn","cloneBuffer","copyArray","arrayFilter","stubArray","nativeGetSymbols","getSymbols","copySymbols","arrayPush","getPrototype","getSymbolsIn","copySymbolsIn","baseGetAllKeys","getAllKeys","getAllKeysIn","DataView","Promise","Set","WeakMap","getTag","initCloneArray","Uint8Array","cloneArrayBuffer","cloneDataView","cloneRegExp","cloneSymbol","cloneTypedArray","symbolTag","initCloneByTag","baseCreate","initCloneObject","baseIsMap","isMap","baseIsSet","isSet","CLONE_DEEP_FLAG","CLONE_SYMBOLS_FLAG","baseClone","FailoverStrategy","ResponseStatus","TransactionEvent","AnchoringStatus","ChainConfirmationLevel","Method","nodes","encodeTransaction_1","gtx_1","enums_1","nodeManager","requestWithFailoverStrategy_1","requestWithFailoverStrategy","nodeManager_1","encryption_1","serialization_1","txRid","networkSettings","blockIdentifier","message","cloneDeep_1","promiEvents_1","txRid_1","anchoringTransaction","settings","calculateTransactionRid_1","decodeTransactionToGtx_1","decodeTransactionToGtx","Buffer","s","hexToBytes","bytesToHex","priv","clean","pub","digest","signature","name","randomBytes","hash","expand","info","isBytes","abool","anumber","abytes","aexists","aoutput","abytes","min","clean","createView","abytes","key","isBytes","cipher","isLE","anumber","abool","createView","copyBytes","mul2","GHASH","key","abytes","copyBytes","createView","mul2","W","aexists","clean","ghash","key","GHASH","BLOCK_SIZE","POLY","key","mul2","mul","mul2","clean","sbox","sbox2","s","mul","mul2","key","abytes","copyBytes","clean","t0","t1","t2","t3","isLE","abytes","BLOCK_SIZE","ctr","createView","clean","isLE","key","clean","ghash","deriveKeys","createView","copyBytes","hexToBytes","key","version","pcgtx","MERKLE_HASH_VERSION","bytesToHex","obj","priv","hexToBytes","pub","digest","signature","key","path","init","raw","s","NOT_AVAILABLE","key","f","raw","name","Buffer","NONCE_LEN","stripHex","s","clean","u8","deriveMemoryKey","raw","encryptMemoryContent","key","decryptMemoryContent","STUB_MSG","STUB_MSG","STUB_MSG","logger","debug","name","unavailable","name","STUB_MSG","unavailable","name","isValidPrivateKey","derivePublicKey","generateKeypair","loadAgent","signLogToolCall","signJudgeAction","verifySignature","normalizeForMatching","containsEvasionCharacters","redactSecrets","containsSecret","createMemorySnapshot","diffMemorySnapshots"]}